Central to our development are the notions of containers and container functors. These provide a new conceptual analysis of data structures and polymorphic ...
Every non-inductive strictly positive type F in n variables can be interpreted as an n-ary container (|F|) ∈ Gn (and an n-ary functor [[(|F|)]] : Cn → C) such.
People also ask
What are strictly positive types?
What is a container class What are the types of container classes?
This paper presents a formalisation of the result that `containers preserve least and greatest fixed points' in Cubical Agda, thereby giving a formulation ...
Central to our development are the notions of containers and container functors. These provide a new conceptual analysis of data structures and polymorphic ...
Containers. Constructing Strictly Positive Types. Felix Rech. Advisor: Steven Schäfer. December 9, 2016. 1. Page 2. (Co-)Inductive Types in Coq.
Abstract. We present an inductive definition of a universe containing codes for strictly positive families (SPFs) such as vectors or simply typed lambda ...
Surprisingly the grammar of indexed strictly positive types which we use to generate indexed containers is very different from that of strictly positive types.
In order to represent, compute and reason with ad- vanced data types one must go beyond the traditional treatment of data types as being inductive types and ...
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions ...
Sep 4, 2024 · Containers capture the concept of strictly positive data types in programming. The original development of containers is done in the ...