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

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 3; no. ICFP; pp. 1 - 29
Main Authors:	Vezzosi, Andrea, Mörtberg, Anders, Abel, Andreas
Format:	Journal Article
Language:	English
Published:	01.08.2019
Subjects:	administrativ databehandling Computing Science Cubical Type Theory Dependent Pattern Matching Higher Inductive Types matematisk logik Mathematical Logic Univalence
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!