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>...
Autors principals: | Gibbons, J, Hutton, G |
---|---|
Format: | Conference item |
Publicat: |
1999
|
Ítems similars
-
Proof methods for corecursive programs
per: Gibbons, J, et al.
Publicat: (2005) -
Proof Methods for Corecursive Programs
per: Gibbons, J, et al.
Publicat: (2015) -
Corecursive Algebras, Corecursive Monads and Bloom Monads
per: Jiří Adámek, et al.
Publicat: (2014-09-01) -
Structured general corecursion and coinductive graphs [extended abstract]
per: Tarmo Uustalu
Publicat: (2012-02-01) -
Categorical Semantics for Functional Reactive Programming with Temporal Recursion and Corecursion
per: Wolfgang Jeltsch
Publicat: (2014-06-01)