The call-by-need lambda calculus
From MaRDI portal
Recommendations
Cited in
(50)- Call-by-name, call-by-value, call-by-need and the linear lambda calculus
- Formal verification of the correspondence between call-by-need and call-by-name
- Call-by-need, neededness and all that
- Realizability interpretation and normalization of typed call-by-need \(\lambda\)-calculus with control
- The spirit of node replication
- On the value of variables
- Classical by-need
- Reasoning about call-by-need by means of types
- Analysis and caching of dependencies
- Congruence of bisimulation in a non-deterministic call-by-need lambda calculus
- Complete laziness: a natural semantics
- Minimality in a linear calculus with iteration
- The Call-by-Need Lambda Calculus, Revisited
- Classical call-by-need sequent calculi: the unity of semantic artifacts
- On the value of variables
- Three Syntactic Theories for Combinatory Graph Reduction
- Classical call-by-need and duality
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- Defunctionalized interpreters for call-by-need evaluation
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
- Small-step and big-step semantics for call-by-need
- scientific article; zbMATH DE number 1231468 (Why is no real title available?)
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
- The call-by-need lambda calculus
- scientific article; zbMATH DE number 1953273 (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
- A Fresh Look at the λ-Calculus
- Deriving an abstract machine for strong call by need
- Semantic subtyping for non-strict languages
- A calculus of expandable stores. Continuation-and-environment-passing style translations
- A non-deterministic call-by-need lambda calculus
- Contextual equivalences in call-by-need and call-by-name polymorphically typed calculi (preliminary report)
- 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
- Rewriting and Call-Time Choice: The HO Case
- Call-by-need in token-passing nets
- A calculus of open modules: call-by-need strategy and confluence
- Types by need
- Useful Open Call-By-Need
- Node Replication: Theory And Practice
- Formal verifications of call-by-need and call-by-name evaluations with mutual recursion
- Call-by-value and call-by-name: a simple proof of a classic theorem
- 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 Q4236864)
