How powerful are folding/unfolding transformations?

DOI10.1017/S0956796800000964MaRDI QIDQ4764267zbMATH OpenFDO

Authors Hong Zhu

Publication date 6 August 1995

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0956796800000964

zbMATH Keywords

inherent complexity

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3924119
• scientific article; zbMATH DE number 177790
• Total unfolding: theory and applications
• Unfold/fold transformations of logic programs

Cites work

• A System for Assisting Program Transformation
• A Transformation System for Developing Recursive Programs
• A synthesis of several sorting algorithms
• Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique
• Program. construction. International summer school

Cited in

(10)

• Factorising folds for faster functions
• Logic Based Program Synthesis and Transformation
• The under-appreciated unfold
• scientific article; zbMATH DE number 177790 (Why is no real title available?)
• The under-appreciated unfold
• scientific article; zbMATH DE number 3924119 (Why is no real title available?)
• Metamorphism in jigsaw
• Folding left and right matters: Direct style, accumulators, and continuations
• The next 700 program transformers
• Some equivalent transformations of recursive programs based on their schematic properties

This page was built for publication: How powerful are folding/unfolding transformations?

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