Skip to main content

Research Repository

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.

Citation

Hutton, G., & Gibbons, J. (2005). Proof Methods for Corecursive Programs

Journal Article Type Article
Publication Date Apr 1, 2005
Deposit Date Nov 7, 2005
Publicly Available Date Oct 9, 2007
Journal Fundamenta Informaticae Special Issue on Program Transformation
Publisher IOS Press
Peer Reviewed Peer Reviewed
Volume 66
Issue 4
Public URL http://eprints.nottingham.ac.uk/id/eprint/227
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/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