Location of Repository

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

Publisher: IOS Press

Year: 2005

OAI identifier:
oai:eprints.nottingham.ac.uk:227

Provided by:
Nottingham ePrints

Downloaded from
http://eprints.nottingham.ac.uk/227/1/corecursion.pdf

- (1988). An Introduction to Functional Programming,
- (2004). Chasing Bottoms: A Case Study in Program Verification in the Presense of Partial and Infinite Values, in:
- Coalgebras, Monads and Comonads, in:
- (2003). Generalised Coinduction,
- (1994). Infinite Objects in Type Theory, in: Types for Proofs and Programs
- (1998). Introduction to Functional Programming using Haskell (second edition),
- (1990). Introduction to Lattices and Order,
- (1980). Mathematical Theory of Program Correctness,
- (1988). Non-Well-Founded Sets,
- (1997). O.: Algebra of Programming,
- (1991). Program Calculation Properties of Continuous Algebras,
- (1975). Recursive Programming Techniques,
- (1996). Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.