Shrinking lambda expressions in linear time

DOI10.1017/S0956796897002839MaRDI QIDQ4376489zbMATH OpenFDO

Authors Andrew W. Appel, Trevor Jim

Publication date 3 August 1998

Published in Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

functional-language compilers

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 1953273
• scientific article; zbMATH DE number 1522992
• Refining reduction in the lambda calculus
• Transformations and reduction strategies for typed lambda expressions
• scientific article; zbMATH DE number 1547348
• Linear-time self-interpretation of the pure lambda calculus
• LINEAR TIME IN HYPERSEQUENT FRAMEWORK
• scientific article; zbMATH DE number 1953288
• Demonstrating Lambda Calculus Reduction

Cited in

(6)

• A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
• A higher-order strategy for eliminating common subexpressions
• Shrinking Reductions in SML.NET
• Scoped dynamic rewrite rules
• Repetitive reduction patterns in lambda calculus with \texttt{letrec} (work in progress)
• A survey of strategies in rule-based program transformation systems

This page was built for publication: Shrinking lambda expressions in linear time

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