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>...
Glavni autori: | Gibbons, J, Hutton, G |
---|---|
Format: | Conference item |
Izdano: |
1999
|
Slični predmeti
-
Proof methods for corecursive programs
od: Gibbons, J, i dr.
Izdano: (2005) -
Proof Methods for Corecursive Programs
od: Gibbons, J, i dr.
Izdano: (2015) -
Corecursive Algebras, Corecursive Monads and Bloom Monads
od: Jiří Adámek, i dr.
Izdano: (2014-09-01) -
Proof of a Structured Program: ‘The Sieve of Eratosthenes'
od: Hoare, C
Izdano: (1972) -
Program Correctness Proofs
od: Hoare, C
Izdano: (1975)