Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
(Co-)Iteration for Higher-Order Nested Datatypes
 

Summary: (Co-)Iteration for
Higher-Order Nested Datatypes
Andreas Abel1
and Ralph Matthes2
1
Department of Computer Science,
University of Munich
abel@informatik.uni-muenchen.de
2
PPS,
CNRS, Universit´e Paris VII (on leave from University of Munich)
matthes@informatik.uni-muenchen.de
Abstract. The problem of defining iteration for higher-order nested
datatypes of arbitrary (finite) rank is solved within the framework of
System F
of higher-order parametric polymorphism. The proposed so-
lution heavily relies on a general notion of monotonicity as opposed to
a syntactic criterion on the shape of the type constructors such as posi-
tivity or even being polynomial. Its use is demonstrated for some rank-2
heterogeneous/nested datatypes such as powerlists and de Bruijn terms

  

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

 

Collections: Computer Technologies and Information Sciences