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>...
Egile Nagusiak: | Gibbons, J, Hutton, G |
---|---|
Formatua: | Conference item |
Argitaratua: |
1999
|
Antzeko izenburuak
Model and proof generation for heap-manipulating programs
nork: Brain, M, et al.
Argitaratua: (2014)
nork: Brain, M, et al.
Argitaratua: (2014)
Antzeko izenburuak
-
Proof methods for corecursive programs
nork: Gibbons, J, et al.
Argitaratua: (2005) -
Proof Methods for Corecursive Programs
nork: Gibbons, J, et al.
Argitaratua: (2015) -
Corecursive Algebras, Corecursive Monads and Bloom Monads
nork: Jiří Adámek, et al.
Argitaratua: (2014-09-01) -
Proof of a Structured Program: ‘The Sieve of Eratosthenes'
nork: Hoare, C
Argitaratua: (1972) -
Program Correctness Proofs
nork: Hoare, C
Argitaratua: (1975)