The call-by-need lambda calculus
From MaRDI portal
Publication:4236864
DOI10.1017/S0956796898003037zbMath0918.03019OpenAlexW2062838731MaRDI QIDQ4236864
Martin Odersky, J. Maraist, Philip Wadler
Publication date: 28 March 1999
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796898003037
operational semanticslambda calculusobservational equivalencecall-by-needoperational interpretationstandard reductionstrict functional languages
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)
Related Items
The Negligible and Yet Subtle Cost of Pattern Matching, A concurrent lambda calculus with futures, On the value of variables, A strong call-by-need calculus, Node Replication: Theory And Practice, On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation, The spirit of node replication, Three Syntactic Theories for Combinatory Graph Reduction, Classical Call-by-Need and Duality, Rewriting and narrowing for constructor systems with call-time choice semantics, On generic context lemmas for higher-order calculi with sharing, Purely functional lazy nondeterministic programming, Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi, An abstract monadic semantics for value recursion, Unnamed Item, Unnamed Item, Unnamed Item, Classical By-Need, Rewriting and Call-Time Choice: The HO Case, Reasoning About Call-by-need by Means of Types, A Fresh Look at the λ-Calculus, Small-step and big-step semantics for call-by-need, Complete Laziness: a Natural Semantics, Minimality in a Linear Calculus with Iteration
