Proving The Unique Fixed−Point Principle Correct
Say you want to prove something about an infinite data-structure, such as a stream or an infinite tree, but you would rather not subject yourself to coïnduction. The unique fixed-point principle is an easy-to-use, calculational alternative. The proof technique rests on the fact that certain recursio...
| Main Authors: | , |
|---|---|
| Format: | Report |
| Published: |
Department of Computer Science‚ University of Oxford
2011
|