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]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
78Kb

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:Faculty of Science > School of Computer Science and Information Technology
ID Code:227
Deposited By:Hutton, Graham
Deposited On:07 Nov 2005
Last Modified:09 Oct 2007 16:50

Repository Staff Only: item control page