Indexed Containers

Authors:
Thorsten Altenkirch;Peter Morris
Affiliations:
-;-
Venue:
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Year:
2009

Citing 0
Cited 18

Let's see how things unfold: reconciling the infinite with the intensional

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
The gentle art of levitation

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Higher-order containers

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Formal polytypic programs and proofs

Journal of Functional Programming
Polymorphic abstract syntax via Grothendieck construction

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
A foundation for GADTs and inductive families: dependent polynomial functor approach

Proceedings of the seventh ACM SIGPLAN workshop on Generic programming
A categorical semantics for inductive-inductive definitions

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Indexed induction and coinduction, fibrationally

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
2-Dimensional Directed Type Theory

Electronic Notes in Theoretical Computer Science (ENTCS)
Monads need not be endofunctors

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
When is a container a comonad?

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Discrete generalised polynomial functors

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Data Types with Symmetries and Polynomial Functors over Groupoids

Electronic Notes in Theoretical Computer Science (ENTCS)
Relational algebraic ornaments

Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming
Generic datatypes à la carte

Proceedings of the 9th ACM SIGPLAN workshop on Generic programming
Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Fibred Data Types

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the syntactically rich notion of inductive families can be reduced to a core type theory with a fixed number of type constructors exploiting the novel notion of indexed containers. Indexed containers generalize simple containers, capturing strictly positive families instead of just strictly positive types, without having to extend the core type theory. Other applications of indexed containers include data type-generic programming and reasoning about polymorphic functions. The construction presented here has been formalized using the Agda system.