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>...
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Conference item |
| Julkaistu: |
1999
|
Samankaltaisia teoksia
Model and proof generation for heap-manipulating programs
Tekijä: Brain, M, et al.
Julkaistu: (2014)
Tekijä: Brain, M, et al.
Julkaistu: (2014)