Lambda-dropping: Transforming recursive equations into programs with block structure

DOI10.1016/S0304-3975(00)00054-2zbMath0949.68046OpenAlexW2077853727MaRDI QIDQ1583366

Olivier Danvy, Ulrik Pagh Schultz

Publication date: 26 October 2000

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00054-2

zbMATH Keywords

partial evaluationblock structurelambda-droppinglambda-lifting

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items

Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant ⋮ Getting There and Back Again ⋮ A functional approach to generic programming using adaptive traversals ⋮ On one-pass CPS transformations ⋮ Lambda-dropping: Transforming recursive equations into programs with block structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Deforestation: Transforming programs to eliminate trees
• Combinators and functional programming languages. Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985. Proceedings
• Lambda-dropping: Transforming recursive equations into programs with block structure
• Detecting global variables in denotational specifications
• A partial evaluator for the untyped lambda-calculus
• The next 700 programming languages
• The Mechanical Evaluation of Expressions
• A categorical interpretation of Landin's correspondence principle