Classical by-need

DOI10.1007/978-3-662-49498-1_24MaRDI QIDQ2802497zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

linear logiclambda-calculusclassical logiccontrol operatorscall-by-needlazy evaluationlinear head reductionKrivine abstract machinelambda-mu-calculussigma equivalence

Mathematics Subject Classification ID

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)

Recommendations

• Classical call-by-need and duality
• The call-by-need lambda calculus
• scientific article; zbMATH DE number 1231468
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• The Call-by-Need Lambda Calculus, Revisited

Cites work

• scientific article; zbMATH DE number 1324438 (Why is no real title available?)
• (Leftmost-outermost) beta reduction is invariant, indeed
• A call-by-name lambda-calculus machine
• A nonstandard standardization theorem
• An equivalence between lambda- terms
• Classical call-by-need and duality
• Classical call-by-need sequent calculi: the unity of semantic artifacts
• Classical logic, continuation semantics and abstract machines
• Defunctionalized interpreters for call-by-need evaluation
• Distilling abstract machines
• Explicit substitutions
• Linear logic
• On full abstraction for PCF: I, II and III
• The Call-by-Need Lambda Calculus, Revisited
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• The duality of computation
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The permutative -calculus
• The structural \(\lambda \)-calculus

Cited in

(7)

• scientific article; zbMATH DE number 7204443 (Why is no real title available?)
• Classical call-by-need sequent calculi: the unity of semantic artifacts
• Taylor expansion, finiteness and strategies
• Realizability interpretation and normalization of typed call-by-need \(\lambda\)-calculus with control
• Classical call-by-need and duality
• scientific article; zbMATH DE number 7155170 (Why is no real title available?)
• Linear -reduction

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)