The call-by-need lambda calculus
From MaRDI portal
Publication:4358458
DOI10.1017/S0956796897002724zbMATH Open0887.68007MaRDI QIDQ4358458FDOQ4358458
Authors: Zena M. Ariola, Matthias Felleisen 
Publication date: 29 September 1997
Published in: Journal of Functional Programming (Search for Journal in Brave)
Recommendations
Cited In (53)
- Title not available (Why is that?)
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
- Title not available (Why is that?)
- Lambda-calcul, évaluation paresseuse et mise en mémoire
- A call-by-name lambda-calculus machine
- Title not available (Why is that?)
- Standardization of a Call-By-Value Lambda-Calculus
- A non-deterministic call-by-need lambda calculus
- A calculus of open modules: call-by-need strategy and confluence
- The Negligible and Yet Subtle Cost of Pattern Matching
- Lazy evaluation and delimited control
- The spirit of node replication
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
- Call-by-need in token-passing nets
- Classical by-need
- Title not available (Why is that?)
- Explaining the lazy Krivine machine using explicit substitution and addresses
- Title not available (Why is that?)
- A unified approach to fully lazy sharing
- Program equivalence in a typed probabilistic call-by-need functional language
- A concurrent lambda calculus with futures
- Minimality in a linear calculus with iteration
- Lambda calculus with explicit recursion
- Small-step and big-step semantics for call-by-need
- Rewriting and narrowing for constructor systems with call-time choice semantics
- An imperative pure calculus
- Lazy evaluation and delimited control
- The Call-by-Need Lambda Calculus, Revisited
- Call-by-need, neededness and all that
- Reasoning about call-by-need by means of types
- Weak optimality, and the meaning of sharing
- Node Replication: Theory And Practice
- Classical call-by-need and duality
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- Title not available (Why is that?)
- Possibilities and limitations of call-by-need space improvement
- On the value of variables
- A strong call-by-need calculus
- Three Syntactic Theories for Combinatory Graph Reduction
- Complete laziness: a natural semantics
- On generic context lemmas for higher-order calculi with sharing
- A calculus of expandable stores. Continuation-and-environment-passing style translations
- Title not available (Why is that?)
- Atomic lambda calculus: a typed lambda-calculus with explicit sharing
- Formal verifications of call-by-need and call-by-name evaluations with mutual recursion
- Purely functional lazy nondeterministic programming
- Linear-time self-interpretation of the pure lambda calculus
- A non-deterministic call-by-need lambda calculus
- On the value of variables
- Title not available (Why is that?)
- Formal verification of the correspondence between call-by-need and call-by-name
- Useful Open Call-By-Need
- An abstract monadic semantics for value recursion
This page was built for publication: The call-by-need lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358458)
