A grammar-based data-flow analysis to stop deforestation

DOI10.1007/BFB0017492MaRDI QIDQ4954460zbMATH OpenFDO

Authors M. H. B. Sørensen

Publication date 7 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0017492

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Theory of compilers and interpreters (68N20) Data structures (68P05)

Recommendations

• Constraints to stop deforestation
• scientific article; zbMATH DE number 5033862
• Comparison of deforestation techniques for functional programs and for tree transducers
• Typer inference builds a short cut to deforestation

Cited in

(3)

• Typer inference builds a short cut to deforestation
• Proving the correctness of recursion-based automatic program transformations
• Deforestation: Transforming programs to eliminate trees

Describes a project that uses

Uses Software

• Miranda

This page was built for publication: A grammar-based data-flow analysis to stop deforestation

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