Skip to main content

Research Repository

See what's under the surface

Advanced Search

Proof Methods for Corecursive Programs

Hutton, Graham; Gibbons, Jeremy

Authors

Jeremy Gibbons



Abstract

Recursion is a well-known and powerful programming technique, with a wide variety of applications. The dual technique of corecursion is less well-known, but is increasingly proving to be just as useful. This article is a tutorial on the four main methods for proving properties of corecursive programs: fixpoint induction, the approximation (or take) lemma, coinduction, and fusion.

Journal Article Type Article
Publication Date Apr 1, 2005
Journal Fundamenta Informaticae Special Issue on Program Transformation
Publisher IOS Press
Peer Reviewed Peer Reviewed
Volume 66
Issue 4
APA6 Citation Hutton, G., & Gibbons, J. (2005). Proof Methods for Corecursive Programs
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf

Files

corecursion.pdf (80 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations

;