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>...
Главные авторы: | Gibbons, J, Hutton, G |
---|---|
Формат: | Conference item |
Опубликовано: |
1999
|
Схожие документы
-
Proof methods for corecursive programs
по: Gibbons, J, и др.
Опубликовано: (2005) -
Proof Methods for Corecursive Programs
по: Gibbons, J, и др.
Опубликовано: (2015) -
Corecursive Algebras, Corecursive Monads and Bloom Monads
по: Jiří Adámek, и др.
Опубликовано: (2014-09-01) -
Proof of a Structured Program: ‘The Sieve of Eratosthenes'
по: Hoare, C
Опубликовано: (1972) -
Program Correctness Proofs
по: Hoare, C
Опубликовано: (1975)