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...
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Journal article |
| Baskı/Yayın Bilgisi: |
2015
|
| Özet: | 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: fixpoint induction, the approximation lemma, coinduction, and fusion. |
|---|