Proof Methods for Corecursive Programs

Hutton, Graham and Gibbons, Jeremy (2005) Proof Methods for Corecursive Programs. Fundamenta Informaticae Special Issue on Program Transformation, 66 (4). pp. 353-366.

[img] PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (80kB)

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.

Item Type: Article
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Depositing User: Hutton, Graham
Date Deposited: 07 Nov 2005
Last Modified: 09 Oct 2007 15:50
URI: http://eprints.nottingham.ac.uk/id/eprint/227

Actions (Archive Staff Only)

Edit View Edit View