Lambda-dropping: Transforming recursive equations into programs with block structure
From MaRDI portal
Publication:1583366
DOI10.1016/S0304-3975(00)00054-2zbMATH Open0949.68046OpenAlexW2077853727MaRDI QIDQ1583366FDOQ1583366
Authors: 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
Recommendations
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Title not available (Why is that?)
- Deforestation: Transforming programs to eliminate trees
- Title not available (Why is that?)
- The Mechanical Evaluation of Expressions
- The next 700 programming languages
- Title not available (Why is that?)
- A partial evaluator for the untyped lambda-calculus
- Title not available (Why is that?)
- Detecting global variables in denotational specifications
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- A categorical interpretation of Landin's correspondence principle
Cited In (6)
- On one-pass CPS transformations
- Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant
- Getting There and Back Again
- Title not available (Why is that?)
- A functional approach to generic programming using adaptive traversals
- Lambda-dropping: Transforming recursive equations into programs with block structure
This page was built for publication: Lambda-dropping: Transforming recursive equations into programs with block structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583366)
