Universal algebra in higher types
Theoretical Computer Science
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Designing combinational circuits with list homomorphisms
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science,Software Engineering, Information Technology, e-Business, and Applications, 2003
Hi-index | 0.00 |
We present an extension of the Lübeck Transformation System LTS automating the fusion of a function with a catamorphism as a refinement step in algebraic program development. The system detects catamorphisms in constructor-based higher-order algebraic specifications and generates an axiomatisation of the composition function. As the basis we give a generalized treatment of the fusion theorem in the setting of algebraic specifications. We illustrate the approach presenting compound fusion transformations for non-free data structures.