Indexed Containers

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 stri...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2009 24th Annual IEEE Symposium on Logic In Computer Science S. 277 - 285
Hauptverfasser: Altenkirch, T., Morris, P.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.08.2009
Schlagworte:
Algebra
Containers
Data mining
functional programming
Probability density function
Programming
Reactive power
Shape
Type Theory
ISBN:0769537464, 9780769537467
ISSN:1043-6871
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISBN:0769537464
9780769537467
ISSN:1043-6871
DOI:10.1109/LICS.2009.33