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)