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)