How powerful are folding/unfolding transformations?

DOI10.1017/S0956796800000964zbMath0817.68105MaRDI QIDQ4764267

Hong Zhu

Publication date: 6 August 1995

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

zbMATH Keywords

inherent complexity

Mathematics Subject Classification ID

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

Related Items

The next 700 program transformers

Cites Work

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