Complete Laziness: a Natural Semantics

DOI10.1016/j.entcs.2008.03.058zbMath1279.68191OpenAlexW2027027952MaRDI QIDQ2873681

François-Régis Sinot

Publication date: 24 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.058

zbMATH Keywords

efficiencyoptimalityoperational semanticsstrategiessharingcall-by-needlazinessfunctional programming languages

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Related Items (1)

Functional sets with typed symbols: Mixed zonotopes and polynotopes for hybrid nonlinear reachability and filtering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• An operational semantics of sharing in lazy evaluation
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Combinatory reduction systems: Introduction and survey
• Optimality and inefficiency
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• Closed reduction: explicit substitutions without $\alpha$ -conversion
• Optimistic evaluation
• Programming Languages and Systems
• Call-by-need in token-passing nets

This page was built for publication: Complete Laziness: a Natural Semantics