Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Constructing Strictly Positive Families Peter Morris and Thorsten Altenkirch
 

Summary: Constructing Strictly Positive Families
Peter Morris and Thorsten Altenkirch
School of Computer Science and Information Technology
University of Nottingham
{pwm,txa}@cs.nott.ac.uk
Abstract
We present an inductive definition of a universe containing codes for strictly positive
families (SPFs) such as vectors or simply typed lambda terms. This construction
extends the usual definition of inductive strictly positive types as given in previous
joint work with McBride. We relate this to Indexed Containers, which were recently
proposed in joint work with Ghani, Hancock and McBride. We demonstrate by example
how dependent types can be encoded in this universe and give examples for generic
programs.
Keywords: datatypes, containers, universes, generic programming, dependent types, Epigram
1. INTRODUCTION
In a dependently typed language like Epigram [9, 8, 5] generic programming is normal programing.
This is achieved by defining a universe [?, ?] consisting of a type of names U : and a family
of elements El : U indexed by type names. We have exploited this opportunity in [10] by
defining the universe of regular tree types and developing generic programs and proofs for this
universe. However, there is an obvious asymmetry in our previous definitions where we exploit

  

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

 

Collections: Computer Technologies and Information Sciences