Classical by-need
DOI10.1007/978-3-662-49498-1_24zbMATH Open1335.68034OpenAlexW2498111426MaRDI QIDQ2802497FDOQ2802497
Authors: Pierre-Marie Pédrot, Alexis Saurin 
Publication date: 26 April 2016
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49498-1_24
Recommendations
linear logiclambda-calculusclassical logiccontrol operatorscall-by-needlazy evaluationlinear head reductionKrivine abstract machinelambda-mu-calculussigma equivalence
Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Functional programming and lambda calculus (68N18)
Cites Work
- On full abstraction for PCF: I, II and III
- Title not available (Why is that?)
- Linear logic
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Classical logic, continuation semantics and abstract machines
- The duality of computation
- The call-by-need lambda calculus
- The call-by-need lambda calculus
- A call-by-name lambda-calculus machine
- The permutative \(\lambda \)-calculus
- The Call-by-Need Lambda Calculus, Revisited
- An equivalence between lambda- terms
- Explicit substitutions
- The structural \(\lambda \)-calculus
- A nonstandard standardization theorem
- Distilling abstract machines
- Classical call-by-need and duality
- (Leftmost-outermost) beta reduction is invariant, indeed
- Classical call-by-need sequent calculi: the unity of semantic artifacts
- Defunctionalized interpreters for call-by-need evaluation
Cited In (6)
This page was built for publication: Classical by-need
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802497)
