Categories of Containers

We introduce the notion of containers as a mathematical formalisation of the idea that many important datatypes consist of templates where data is stored. We show that containers have good closure properties under a variety of constructions including the formation of initial algebras and final coalgebras. We also show that containers include strictly positive types and shapely types but that there are containers which do not correspond to either of these. Further, we derive a representation result classifying the nature of polymorphic functions between containers. We finish this paper with an application to the theory of shapely types and refer to a forthcoming paper which applies this theory to differentiable types.

• Type: Conference
• Year: 2003
• Where: FOSSACS
• Authors: Michael Abbott, Thorsten Altenkirch, Neil Ghani
• Keywords: Applied Computing, Containers, FOSSACS 2003, Important Datatypes, Mathematical Formalisation