Evaluating lambda terms with traversals

DOI10.1016/j.tcs.2019.08.035zbMath1436.03103OpenAlexW2973316748MaRDI QIDQ2007730

William Blum

Publication date: 22 November 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.08.035

zbMATH Keywords

lambda calculusgame semanticstraversalslinear reduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• A unification algorithm for typed \(\bar\lambda\)-calculus
• An equivalence between lambda- terms
• Head linear reduction and pure proof net extraction
• Reversible, irreversible and optimal \(\lambda\)-machines
• A call-by-name lambda-calculus machine
• The Mechanical Evaluation of Expressions
• The Safe Lambda Calculus
• Innocent game models of untyped \(\lambda\)-calculus

This page was built for publication: Evaluating lambda terms with traversals