The call-by-need lambda calculus
From MaRDI portal
Publication:4358458
DOI10.1017/S0956796897002724zbMath0887.68007MaRDI QIDQ4358458
Zena M. Ariola, Matthias Felleisen
Publication date: 29 September 1997
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items
The Negligible and Yet Subtle Cost of Pattern Matching, A concurrent lambda calculus with futures, On the value of variables, Lambda calculus with explicit recursion, Program equivalence in a typed probabilistic call-by-need functional language, 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, Explaining the lazy Krivine machine using explicit substitution and addresses, 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, A calculus of open modules: call-by-need strategy and confluence, Unnamed Item, Classical By-Need, An imperative pure calculus, Reasoning About Call-by-need by Means of Types, Unnamed Item, Small-step and big-step semantics for call-by-need, Complete Laziness: a Natural Semantics, Minimality in a Linear Calculus with Iteration
