A simplifier for untyped lambda expressions

DOI10.1007/3-540-54317-1_103MaRDI QIDQ5881291zbMATH OpenOpenAlexFDO

Authors Carolyn Talcott

Publication date 9 March 2023

Published in Conditional and Typed Rewriting Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54317-1_103

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Recommendations

• Call-by-value Termination in the Untyped lambda-calculus
• Rewriting Techniques and Applications
• A partial evaluator for the untyped lambda-calculus
• Adding algebraic rewriting to the untyped lambda calculus
• Adding algebraic rewriting to the untyped lambda calculus (extended abstract)

Cites work

• Approximate Reduction and Lambda Calculus Models
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• The next 700 programming languages

Cited in

(5)

• A theory for program and data type specification
• Evaluating lambda terms with traversals
• Transformations and reduction strategies for typed lambda expressions
• Call-by-value Termination in the Untyped lambda-calculus
• Shrinking Reductions in SML.NET

This page was built for publication: A simplifier for untyped lambda expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881291)