Proof methods for corecursive programs (2005) [12 citations — 4 self]
Download:
|
|
by Jeremy Gibbons
Fundamenta Informaticae Special Issue on Program Transformation
http://www.cs.nott.ac.uk/~gmh//corecursion.ps
Add To MetaCart
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 four methods for proving properties of corecursive programs: fixpoint induction, the approximation lemma, coinduction, and fusion.
Citations
| 1143 | Imperative functional programming – Jones, Wadler - 1993 |
| 746 | Introduction to Lattices and Order – Davey, Priestley - 1992 |
| 178 | Introduction to Functional Programming Using Haskell – Bird - 1998 |
| 110 | Bisimilarity as a theory of functional programming – Gordon - 1995 |
| 98 | Recursive Programming Techniques – Burge - 1975 |
| 97 | Algebraically complete categories – Freyd - 1991 |
| 74 | Vicious Circles – Barwise, Moss - 1996 |
| 50 | Mathematical theory of program correctness – Bakker - 1980 |
| 40 | Non-well-founded sets. Number 14 – Aczel - 1988 |
| 11 | The generic approximation lemma – Hutton, Gibbons - 2001 |
