Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Indexed Containers Thorsten Altenkirch Peter Morris
 

Summary: Indexed Containers
Thorsten Altenkirch Peter Morris
University of Nottingham
{txa,pwm}@cs.nott.ac.uk
Abstract
We show that the syntactically rich notion of inductive
families can be reduced to a core type theory with a fixed
number of type constructors exploiting the novel notion of
indexed containers. Indexed containers generalize simple
containers, capturing strictly positive families instead of
just strictly positive types, without having to extend the core
type theory. Other applications of indexed containers in-
clude datatype-generic programming and reasoning about
polymorphic functions. The construction presented here has
been formlized using the Agda system.
1 Introduction
Inductive datatypes are a central feature of modern Type
Theory (e.g. COQ [23]) or functional programming (e.g.
Haskell1
) . A simple example is the type (or set) of de

  

Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham

 

Collections: Computer Technologies and Information Sciences