Proof Methods for Corecursive Programs
Recursion is a well-known and powerful programming technique, with a wide variety of applications. The dual technique of corecursion is less well-known, but is increasingly proving to be just as useful. This article is a tutorial on four methods for proving properties of corecursive programs: fixpoi...
Autori principali: | Gibbons, J, Hutton, G |
---|---|
Natura: | Journal article |
Pubblicazione: |
2015
|
Documenti analoghi
Documenti analoghi
-
Proof methods for corecursive programs
di: Gibbons, J, et al.
Pubblicazione: (2005) -
Proof Methods for Structured Corecursive Programs
di: Gibbons, J, et al.
Pubblicazione: (1999) -
Corecursive Algebras, Corecursive Monads and Bloom Monads
di: Jiří Adámek, et al.
Pubblicazione: (2014-09-01) -
Categorical Semantics for Functional Reactive Programming with Temporal Recursion and Corecursion
di: Wolfgang Jeltsch
Pubblicazione: (2014-06-01) -
Structured general corecursion and coinductive graphs [extended abstract]
di: Tarmo Uustalu
Pubblicazione: (2012-02-01)