Summary: Slide 1
Generalized Iteration and Coiteration
for Higher-Order Nested Datatypes
Mendler strikes again!
Andreas Abel
(joint work with Ralph Matthes and Tarmo Uustalu)
Workshop on Termination and Type Theory
G¨oteborg, Sweden
November 14, 2002
Work supported by: PhD Prg. Logic in Computer Science, Munich (DFG)
Slide 2
Powerlists
· lists of length 2n
· perfectly balanced leaf-labelled binary trees
· in Haskell:
data PList a = Zero a
| Succ (PList (a, a))
l0 = Zero 0
l1 = Succ (Zero (0,1))
l2 = Succ (Succ (Zero ((0,1),(2,3))))

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München

Collections: Computer Technologies and Information Sciences