Proof Methods for Structured Corecursive Programs
Corecursive programs produce values of greatest fixpoint types, in contrast to recursive programs, which consume values of least fixpoint types. There are a number of widely used methods for proving properties of corecursive programs, including fixpoint induction, the <em>take lemma</em>...
| প্রধান লেখক: | , |
|---|---|
| বিন্যাস: | Conference item |
| প্রকাশিত: |
1999
|