Linear-time self-interpretation of the pure lambda calculus

DOI10.1023/A:1010058213619MaRDI QIDQ5926074zbMATH OpenFDO

Authors Torben Ægidius Mogensen

Publication date 12 March 2001

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1010058213619

zbMATH Keywords

linear-time self-interpretation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 1522992
• (Leftmost-outermost) beta reduction is invariant, indeed
• Efficient self-interpretation in lambda calculus
• The weak lambda calculus as a reasonable machine
• The call-by-need lambda calculus

Cited in

(8)

• Intensional computation with higher-order functions
• Programs as data structures in \(\lambda\)SF-calculus
• Self-quotation in a typed, intensional lambda-calculus
• scientific article; zbMATH DE number 445159 (Why is no real title available?)
• Shrinking lambda expressions in linear time
• scientific article; zbMATH DE number 1522992 (Why is no real title available?)
• Efficient self-interpretation in lambda calculus
• Typed self-interpretation by pattern matching

This page was built for publication: Linear-time self-interpretation of the pure lambda calculus

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