Proof Methods for Structured Corecursive Programs
Corecursive programs produce values of greatest fixpoint types, in contrast to recursive programs, which consume values of least fixpoint types. There are a number of widely used methods for proving properties of corecursive programs, including fixpoint induction, the <em>take lemma</em>...
Auteurs principaux: | Gibbons, J, Hutton, G |
---|---|
Format: | Conference item |
Publié: |
1999
|
Documents similaires
-
Proof methods for corecursive programs
par: Gibbons, J, et autres
Publié: (2005) -
Proof Methods for Corecursive Programs
par: Gibbons, J, et autres
Publié: (2015) -
Corecursive Algebras, Corecursive Monads and Bloom Monads
par: Jiří Adámek, et autres
Publié: (2014-09-01) -
Proof of a Structured Program: ‘The Sieve of Eratosthenes'
par: Hoare, C
Publié: (1972) -
Program Correctness Proofs
par: Hoare, C
Publié: (1975)