Indexed containers
- 20 May 2015
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Functional Programming
- Vol. 25
Abstract
We show that the syntactically rich notion of strictly positive families can be reduced to a core type theory with a fixed number of type constructors exploiting the novel notion of indexed containers. As a result, we show indexed containers provide normal forms for strictly positive families in much the same way that containers provide normal forms for strictly positive types. Interestingly, this step from containers to indexed containers is achieved without having to extend the core type theory. Most of the construction presented here has been formalized using the Agda system.Keywords
This publication has 24 references indexed in Scilit:
- Inductive-Inductive Definitions2010
- Big-step normalisationJournal of Functional Programming, 2009
- Indexed induction–recursionThe Journal of Logic and Algebraic Programming, 2006
- Programming interfaces and basic topologyAnnals of Pure and Applied Logic, 2006
- Containers: Constructing strictly positive typesTheoretical Computer Science, 2005
- The ZipperJournal of Functional Programming, 1997
- Representing inductively defined sets by wellorderings in Martin-Löf's type theoryTheoretical Computer Science, 1997
- On the greatest fixed point of a set functorTheoretical Computer Science, 1995
- A construction of non-well-founded sets within Martin-Löf's type theoryThe Journal of Symbolic Logic, 1989
- Normal functors, power series and λ-calculusAnnals of Pure and Applied Logic, 1988