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...
Главные авторы: | Gibbons, J, Hutton, G |
---|---|
Формат: | Journal article |
Опубликовано: |
2015
|
Схожие документы
-
Proof methods for corecursive programs
по: Gibbons, J, и др.
Опубликовано: (2005) -
Proof Methods for Structured Corecursive Programs
по: Gibbons, J, и др.
Опубликовано: (1999) -
Corecursive Algebras, Corecursive Monads and Bloom Monads
по: Jiří Adámek, и др.
Опубликовано: (2014-09-01) -
Categorical Semantics for Functional Reactive Programming with Temporal Recursion and Corecursion
по: Wolfgang Jeltsch
Опубликовано: (2014-06-01) -
Structured general corecursion and coinductive graphs [extended abstract]
по: Tarmo Uustalu
Опубликовано: (2012-02-01)