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.
Original language | English |
---|---|
Article number | e5 |
Number of pages | 41 |
Journal | Journal of Functional Programming |
Volume | 25 |
DOIs | |
Publication status | Published - 20 May 2015 |
Keywords
- core type theory
- indexed containers