Publication | Open Access
Busy and lazy FP with infinite objects
11
Citations
15
References
1984
Year
Unknown Venue
Computational Complexity TheoryEngineeringComputational Model TheoryComputational ComplexityFormal VerificationLazy FpNon-strict Basic OperationsCombinatorial OptimizationNon-strict Language ConstructsProgramming LanguagesProgramming Language TheoryComputer ScienceFunctional Programming LanguageFunctional ProgrammingProgramming Language DesignDeclarative ProgrammingProgram AnalysisFormal MethodsParallel ProgrammingComputability Theory
The paper introduces a variant of Backus' functional programming language FP that has non-strict basic operations as well as non-strict language constructs.
| Year | Citations | |
|---|---|---|
Page 1
Page 1