Cubical agda: a dependently typed programming language with univalence and higher inductive types

Proof assistants based on dependent type theory provide expressive languages for both programming and proving within the same system. However, all of the major implementations lack powerful extensionality principles for reasoning about equality, such as function and propositional extensionality. The...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages Jg. 3; H. ICFP; S. 1 - 29
Hauptverfasser:	Vezzosi, Andrea, Mörtberg, Anders, Abel, Andreas
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	01.08.2019
Schlagworte:	administrativ databehandling Computing Science Cubical Type Theory Dependent Pattern Matching Higher Inductive Types matematisk logik Mathematical Logic Univalence
ISSN:	2475-1421, 2475-1421
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!