Complete laziness: a natural semantics
From MaRDI portal
Recommendations
Cites work
- An operational semantics of sharing in lazy evaluation
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Call-by-need in token-passing nets
- Closed reduction: explicit substitutions without $\alpha$ -conversion
- Combinatory reduction systems: Introduction and survey
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- Optimality and inefficiency: what isn't a cost model of the lambda calculus?
- Optimistic evaluation
- Programming Languages and Systems
- The call-by-need lambda calculus
- The call-by-need lambda calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The optimal implementation of functional programming languages
Cited in
(8)- Functional sets with typed symbols: Mixed zonotopes and polynotopes for hybrid nonlinear reachability and filtering
- An operational semantics for parallel lazy evaluation
- The role of indirections in lazy natural semantics
- scientific article; zbMATH DE number 4050946 (Why is no real title available?)
- The adequacy of Launchbury's natural semantics for lazy evaluation
- scientific article; zbMATH DE number 2090021 (Why is no real title available?)
- To be or not to be …lazy (In a Parallel Context)
- Kleene getting lazy
This page was built for publication: Complete laziness: a natural semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873681)