The under-performing unfold: a new approach to optimising corecursive programs
This paper presents a new approach to optimising corecursive programs by factorisation. In particular, we focus on programs written using the corecursion operator unfold. We use and expand upon the proof techniques of guarded coinduction and unfold fusion, capturing a pattern of generalising coinduc...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/28183/ |