Cubical Agda: A dependently typed programming language with univalence and higher inductive types
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Functional Programming"
DOI: 10.1017/s0956796821000034
Abstract: Abstract 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… read more here.
Keywords: dependently typed; higher inductive; univalence; type theory ... See more keywords