Algebra of program termination

Authors:
Henk Doornbos;Roland Backhouse
Affiliations:
EverMind, Groningen, The Netherlands;School of Computer Science and Information Technology, University of Nottingham
Venue:
Algebraic and coalgebraic methods in the mathematics of program construction
Year:
2002

Citing 10
Cited 0

Program construction and verification

Program construction and verification
Data structures and program transformation

Science of Computer Programming
Functional programming with bananas, lenses, envelopes and barbed wire

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Reductivity

Science of Computer Programming - Special issue on mathematics of program construction
A calculational approach to mathematical induction

Theoretical Computer Science
The Science of Programming

The Science of Programming
Polynomial Relators (Extended Abstract)

AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Virtual Data Structures

Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Induction and Recursion on Datatypes

MPC '95 Mathematics of Program Construction
Container types categorically

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Well-foundedness and inductive properties of relations are expressed in terms of fixed points. A class of fixed point equations, called "hylo" equations, is introduced. A methodology of recursive program design based on the use of hylo equations is presented. Current research on generalisations of well-foundedness and inductive properties of relations, making these properties relative to a datatype, is introduced.