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 take lemma, and coinduction....
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
1999
|
| Online Access: | https://eprints.nottingham.ac.uk/236/ |