Datatype-generic termination proofs
From MaRDI portal
Publication:1015386
DOI10.1007/s00224-007-9056-zzbMath1166.68027MaRDI QIDQ1015386
Henk Doornbos, Roland C. Backhouse
Publication date: 8 May 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/1858/
68Q65: Abstract data types; algebraic specification
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
03G15: Cylindric and polyadic algebras; relation algebras
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed-point calculus
- Polytypic values possess polykinded types
- Data structures and program transformation
- Notions of computation and monads
- Paramorphisms
- A calculational approach to mathematical induction
- Type-indexed data types
- Reductivity
- Polytypic unification
- Demonic operators and monotype factors
- Container types categorically
- Final Dialgebras: From Categories to Allegories
- Dependency-style generic haskell