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>...
Asıl Yazarlar: | Gibbons, J, Hutton, G |
---|---|
Materyal Türü: | Conference item |
Baskı/Yayın Bilgisi: |
1999
|
Benzer Materyaller
-
Proof methods for corecursive programs
Yazar:: Gibbons, J, ve diğerleri
Baskı/Yayın Bilgisi: (2005) -
Proof Methods for Corecursive Programs
Yazar:: Gibbons, J, ve diğerleri
Baskı/Yayın Bilgisi: (2015) -
Corecursive Algebras, Corecursive Monads and Bloom Monads
Yazar:: Jiří Adámek, ve diğerleri
Baskı/Yayın Bilgisi: (2014-09-01) -
Proof of a Structured Program: ‘The Sieve of Eratosthenes'
Yazar:: Hoare, C
Baskı/Yayın Bilgisi: (1972) -
Program Correctness Proofs
Yazar:: Hoare, C
Baskı/Yayın Bilgisi: (1975)