Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
From MaRDI portal
Publication:5504594
DOI10.1007/978-3-540-78769-3_6zbMath1179.68036OpenAlexW1586696879MaRDI QIDQ5504594
Josep Silva, Germán Vidal, Salvador Tamarit, Sebastian Fischer
Publication date: 22 January 2009
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78769-3_6
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Deforestation: Transforming programs to eliminate trees
- A residualizing semantics for the partial evaluation of functional logic programs.
- Operational semantics for declarative multi-paradigm languages
- Fast narrowing-driven partial evaluation for inductively sequential programs
- Secrets of the Glasgow Haskell Compiler inliner
- Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
This page was built for publication: Preserving Sharing in the Partial Evaluation of Lazy Functional Programs