Contractive functions on infinite data structures
Coinductive data structures, such as streams or infinite trees, have many applications in functional programming and type theory, and are naturally defined using recursive equations. But how do we ensure that such equations make sense, i.e. that they actually generate a productive infinite object? A...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2017
|
| Online Access: | https://eprints.nottingham.ac.uk/41358/ |