Datatype-generic termination proofs
Datatype-generic programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatype-generic programs. The notion of F-reductivity, where F parametrises a datatype, is reviewed and a number of its properties are presented. The prop...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Springer
2008
|
| Online Access: | https://eprints.nottingham.ac.uk/1858/ |