Small-step and big-step semantics for call-by-need

DOI10.1017/S0956796809990219zbMath1184.68164MaRDI QIDQ3648355

Keiko Nakata, Masahito Hasegawa

Publication date: 25 November 2009

Published in: Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

cyclic call-by-need lambda calculi

Mathematics Subject Classification ID

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

Related Items (4)

The Role of Indirections in Lazy Natural Semantics ⋮ The adequacy of Launchbury's natural semantics for lazy evaluation ⋮ Three Syntactic Theories for Combinatory Graph Reduction ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Full abstraction in the lazy lambda calculus
• A syntactic approach to type soundness
• Revised6 Report on the Algorithmic Language Scheme
• The call-by-need lambda calculus
• Deriving a lazy abstract machine
• The call-by-need lambda calculus

This page was built for publication: Small-step and big-step semantics for call-by-need