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>...
Príomhchruthaitheoirí: | Gibbons, J, Hutton, G |
---|---|
Formáid: | Conference item |
Foilsithe / Cruthaithe: |
1999
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Proof methods for corecursive programs
de réir: Gibbons, J, et al.
Foilsithe / Cruthaithe: (2005) -
Proof Methods for Corecursive Programs
de réir: Gibbons, J, et al.
Foilsithe / Cruthaithe: (2015) -
Corecursive Algebras, Corecursive Monads and Bloom Monads
de réir: Jiří Adámek, et al.
Foilsithe / Cruthaithe: (2014-09-01) -
Proof of a Structured Program: ‘The Sieve of Eratosthenes'
de réir: Hoare, C
Foilsithe / Cruthaithe: (1972) -
Program Correctness Proofs
de réir: Hoare, C
Foilsithe / Cruthaithe: (1975)