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