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

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of ACM on programming languages Ročník 3; číslo ICFP; s. 1 - 29
Hlavní autori:	Vezzosi, Andrea, Mörtberg, Anders, Abel, Andreas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	01.08.2019
Predmet:	administrativ databehandling Computing Science Cubical Type Theory Dependent Pattern Matching Higher Inductive Types matematisk logik Mathematical Logic Univalence
ISSN:	2475-1421, 2475-1421
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!