Head reduction and normalization in a call-by-value lambda-calculus

DOI10.4230/OASIcs.WPTE.2015.3zbMath1428.68100OpenAlexW2255489013MaRDI QIDQ5240183

Giulio Guerrieri

Publication date: 24 October 2019

Full work available at URL: http://dx.doi.org/10.4230/OASIcs.WPTE.2015.3

zbMATH Keywords

evaluationconfluencelambda-calculuscall-by-valuesequentializationhead reductioninternal reductionsigma-reduction(strong) normalization

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (3)

Parallelism in realizability models ⋮ Unnamed Item ⋮ On reduction and normalization in the computational core

Uses Software

• ALGOL 60

Cites Work

• Linear logic
• The parametric lambda calculus. A metamodel for computation.
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• An equivalence between lambda- terms
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• Call-by-Value Solvability, Revisited
• An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
• Call-by-value Solvability
• Standardization of a Call-By-Value Lambda-Calculus
• Correspondence between ALGOL 60 and Church's Lambda-notation
• A Semantical and Operational Account of Call-by-Value Solvability
• Parallel reductions in \(\lambda\)-calculus
• Unnamed Item
• Unnamed Item

This page was built for publication: Head reduction and normalization in a call-by-value lambda-calculus