Proof Methods for Corecursive Programs
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 progr...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
IOS Press
2005
|
| Online Access: | https://eprints.nottingham.ac.uk/227/ |
| _version_ | 1848790374655459328 |
|---|---|
| author | Hutton, Graham Gibbons, Jeremy |
| author_facet | Hutton, Graham Gibbons, Jeremy |
| author_sort | Hutton, Graham |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T18:11:36Z |
| format | Article |
| id | nottingham-227 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:11:36Z |
| publishDate | 2005 |
| publisher | IOS Press |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-2272020-05-04T20:30:34Z https://eprints.nottingham.ac.uk/227/ Proof Methods for Corecursive Programs Hutton, Graham Gibbons, Jeremy 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. IOS Press 2005-04 Article PeerReviewed Hutton, Graham and Gibbons, Jeremy (2005) Proof Methods for Corecursive Programs. Fundamenta Informaticae Special Issue on Program Transformation, 66 (4). pp. 353-366. |
| spellingShingle | Hutton, Graham Gibbons, Jeremy Proof Methods for Corecursive Programs |
| title | Proof Methods for Corecursive Programs |
| title_full | Proof Methods for Corecursive Programs |
| title_fullStr | Proof Methods for Corecursive Programs |
| title_full_unstemmed | Proof Methods for Corecursive Programs |
| title_short | Proof Methods for Corecursive Programs |
| title_sort | proof methods for corecursive programs |
| url | https://eprints.nottingham.ac.uk/227/ |