2012/12/16 by Pierre-Evariste Dagand, Conor McBride, Dagand, Pierre-Evariste +1 · 1 citation
Computer Science · Mathematics · #Category Theory (math.CT) #FOS: Computer and information sciences #FOS: Mathematics #Programming Languages (cs.PL) #cs.PL #math.CT
paper · pdf · doi:10.48550/arxiv.1212.3806
32 pages, technical report, extends paper to appear in LICS'13
arxiv created 2013/04/21 · arxiv updated 2013/04/23
Ornaments aim at taming the multiplication of special-purpose datatype in dependently-typed theory. In its original form, the definition of ornaments is tied to a particular universe of datatypes. Being a type theoretic object, constructions on ornaments are typically explained through an operational narrative. This overbearing concreteness calls for an abstract model of ornaments. In this paper, we give a categorical model of ornaments. As a necessary first step, we abstract the universe of datatypes using the theory of polynomial functors. We are then able to characterize ornaments as cartesian morphisms between polynomial functors. We thus gain access to powerful mathematical tools that shall help us understand and develop ornaments. We shall also illustrate the adequacy of our model. Firstly, we rephrase the standard ornamental constructions into our framework. Thanks to its conciseness, this process gives us a deeper understanding of the structures at play. Secondly, we develop new ornamental constructions, by translating categorical structures into type theoretic artifacts.