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)