Proof Methods for Corecursive Programs

Proof Methods for Corecursive Programs (1999)

by Jeremy Gibbons , Graham Hutton

Venue:	Fundamenta Informaticae Special Issue on Program Transformation
Citations:	17 - 5 self

Datum	Value	Source
TITLE	Proof methods for corecursive programs	SVM HeaderParse 0.1
AUTHOR NAME	Jeremy Gibbons	SVM HeaderParse 0.1
AUTHOR ADDR	; Graham Hutton	SVM HeaderParse 0.1
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.	SVM HeaderParse 0.1
CITATIONS	10 found	ParsCit 1.0