Proof Methods for Corecursive Programs (1999)
Cached
Download Links
- [www.cs.nott.ac.uk]
- [web.comlab.ox.ac.uk]
- [www.comlab.ox.ac.uk]
- DBLP
Other Repositories/Bibliography
by
Jeremy Gibbons
,
Graham Hutton
| Venue: | Fundamenta Informaticae Special Issue on Program Transformation |
| Citations: | 17 - 5 self |
BibTeX
@ARTICLE{Gibbons99proofmethods,
author = {Jeremy Gibbons and Graham Hutton},
title = {Proof Methods for Corecursive Programs},
journal = {Fundamenta Informaticae Special Issue on Program Transformation},
year = {1999},
volume = {66}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This article is a tutorial on four methods for proving properties of corecursive programs: fixpoint induction, the approximation lemma, coinduction, and fusion.
Citations
| 1224 | Lectures on constructive functional programming - Bird - 1989 |
| 909 | Introduction to Lattices and Order - Davey, Priestley - 1990 |
| 200 | Introduction to functional programming using Haskell - Bird - 1998 |
| 109 | Bisimilarity as a theory of functional programming - Gordon - 1995 |
| 103 | Recursive Programming Techniques - Burge - 1975 |
| 89 | Algebraically complete categories - Freyd - 1991 |
| 89 | de Moor, O.: Algebra of Programming - Bird - 1997 |
| 87 | Vicious circles - Barwise, Moss - 1996 |
| 52 | Mathematical Theory of Program Correctness - BAKKER - 1980 |
| 38 | Non-well-founded Sets. Number 14 - Aczel - 1988 |
| 17 | Program calculation properties of continuous algebras - Fokkinga, Meijer - 1991 |
| 15 | Generalised coinduction - Bartels |
| 10 | The Generic Approximation Lemma - Hutton, Gibbons - 2001 |
| 7 | Chasing bottoms: A case study in program verification in the presence of partial and infinite values - Danielsson, Jansson - 2004 |
| 4 | Infinite Objects in Type Theory, in: Types for Proofs and Programs (H - Coquand - 1993 |
