The semantics of lazy functional languages

DOI10.1016/0304-3975(89)90122-9zbMath0678.68081OpenAlexW2079399972MaRDI QIDQ1124368

Mark B. Josephs

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90122-9

zbMATH Keywords

denotational semantics\(\lambda \) -calculuslazy functional languages

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items (2)

A functional correspondence between call-by-need evaluators and lazy abstract machines ⋮ On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation

Cites Work

• Functional programming with side-effects
• Recursion Equations as a Programming Language
• A new implementation technique for applicative languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The semantics of lazy functional languages