Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Generalized Iteration and Coiteration for HigherOrder Nested Datatypes
 

Summary: Slide 1
Generalized Iteration and Coiteration
for Higher­Order Nested Datatypes
Mendler rules!
Andreas Abel
(joint work with Ralph Matthes and Tarmo Uustalu)
FoSSaCS 2003
Warsaw, Poland
April 8, 2003
Work supported by:
PhD Prg. Logic in Computer Science, Munich (DFG)
EU TYPES Project
Slide 2
Powerlists
. lists of length 2 n
. perfectly balanced leaf­labelled binary trees
. in Haskell:
data PList a = Zero a
| Succ (PList (a, a))
l0 = Zero 0

  

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

 

Collections: Computer Technologies and Information Sciences