Lambda-dropping: Transforming recursive equations into programs with block structure
From MaRDI portal
(Redirected from Publication:1583366)
Recommendations
Cites work
- scientific article; zbMATH DE number 1696598 (Why is no real title available?)
- scientific article; zbMATH DE number 3907750 (Why is no real title available?)
- scientific article; zbMATH DE number 4008457 (Why is no real title available?)
- scientific article; zbMATH DE number 1122795 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- A categorical interpretation of Landin's correspondence principle
- A partial evaluator for the untyped lambda-calculus
- Combinators and functional programming languages. Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985. Proceedings
- Deforestation: Transforming programs to eliminate trees
- Detecting global variables in denotational specifications
- Lambda-dropping: Transforming recursive equations into programs with block structure
- The Mechanical Evaluation of Expressions
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The next 700 programming languages
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
- scientific article; zbMATH DE number 1696598 (Why is no real title available?)
- 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)
