The call-by-need lambda calculus
From MaRDI portal
Publication:4358458
Recommendations
Cited in
(62)- Lambda calculus with explicit recursion
- Formal verification of the correspondence between call-by-need and call-by-name
- Call-by-need, neededness and all that
- Stackability in the simply-typed call-by-value lambda calculus
- The spirit of node replication
- On the value of variables
- Explaining the lazy Krivine machine using explicit substitution and addresses
- A call-by-name lambda-calculus machine
- Classical by-need
- Reasoning about call-by-need by means of types
- Complete laziness: a natural semantics
- Minimality in a linear calculus with iteration
- The Call-by-Need Lambda Calculus, Revisited
- On the value of variables
- A unified approach to fully lazy sharing
- Three Syntactic Theories for Combinatory Graph Reduction
- Classical call-by-need and duality
- Lambda-calcul, évaluation paresseuse et mise en mémoire
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- Lazy evaluation and delimited control
- Small-step and big-step semantics for call-by-need
- scientific article; zbMATH DE number 4106256 (Why is no real title available?)
- scientific article; zbMATH DE number 1231610 (Why is no real title available?)
- The call-by-need lambda calculus
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
- Deriving a lazy abstract machine
- scientific article; zbMATH DE number 1953273 (Why is no real title available?)
- scientific article; zbMATH DE number 1497776 (Why is no real title available?)
- scientific article; zbMATH DE number 1522992 (Why is no real title available?)
- An abstract monadic semantics for value recursion
- Purely functional lazy nondeterministic programming
- scientific article; zbMATH DE number 7340561 (Why is no real title available?)
- The Negligible and Yet Subtle Cost of Pattern Matching
- A syntactic model of mutation and aliasing
- Beyond polarity: towards a multi-discipline intermediate language with sharing
- Deriving an abstract machine for strong call by need
- Semantic subtyping for non-strict languages
- Compiling with classical connectives
- A calculus of expandable stores. Continuation-and-environment-passing style translations
- Possibilities and limitations of call-by-need space improvement
- A non-deterministic call-by-need lambda calculus
- Contextual equivalences in call-by-need and call-by-name polymorphically typed calculi (preliminary report)
- Weak optimality, and the meaning of sharing
- Lazy evaluation and delimited control
- Atomic lambda calculus: a typed lambda-calculus with explicit sharing
- Standardization of a Call-By-Value Lambda-Calculus
- A non-deterministic call-by-need lambda calculus
- Rewriting and narrowing for constructor systems with call-time choice semantics
- Call-by-need in token-passing nets
- A calculus of open modules: call-by-need strategy and confluence
- Linear-time self-interpretation of the pure lambda calculus
- Program equivalence in a typed probabilistic call-by-need functional language
- Useful Open Call-By-Need
- Node Replication: Theory And Practice
- Formal verifications of call-by-need and call-by-name evaluations with mutual recursion
- A quantitative approach to global state composition
- Call-by-value and call-by-name: a simple proof of a classic theorem
- Genericity through stratification
- An imperative pure calculus
- A concurrent lambda calculus with futures
- On generic context lemmas for higher-order calculi with sharing
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
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)
