Problems in rewriting applied to categorical concepts by the example of a computational comonad [chapter]

Wolfgang Gehrke
1995 Lecture Notes in Computer Science  
We present a canonical system for comonads which can be extended to the notion of a computational comonad BG92] where the crucial point is to nd an appropriate representation. These canonical systems are checked with the help of the Larch Prover GG91] exploiting a method by G. Huet Hue90a] to represent typing within an untyped rewriting system. The resulting decision procedures are implemented in the programming language Elf Pfe89] since typing is directly supported by this language. Finally we
more » ... outline an incomplete attempt to solve the problem which could be used as a benchmark for rewriting tools.
doi:10.1007/3-540-59200-8_58 fatcat:xv74us3nx5djdce3f7vzhwi7jq