<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Cubical Type Theory: a constructive interpretation of the univalence axiom · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1611.02108/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1611.02108/feed.xml" rel="self" type="application/rss+xml" /><item><title>Cubical Type Theory: a constructive interpretation of the univalence axiom — mentioned by mauricioc</title><link>https://news.ycombinator.com/item?id=20423231</link><guid isPermaLink="false">urn:hackerpapers:mention:1611.02108:20423231</guid><pubDate>Fri, 12 Jul 2019 18:42:35 GMT</pubDate><description>&lt;p&gt;One exciting new development is &amp;quot;Cubical Type Theory: a constructive interpretation of the univalence axiom&amp;quot; [0], a constructive version of homotopy type theory. The &amp;quot;axiom of choice&amp;quot; in this context is not really an axiom, just a provable theorem whose proof in this setting is given by Martin-Löf. The reason, I believe, is that constructive mathematics has a different meaning for the exists (∃) quantifier. In a constructive context, existence is &amp;quot;stronger&amp;quot; since you have to specify a witness of existence; this makes the hypothesis of the &amp;quot;axiom&amp;quot; of choice stronger, allowing for a proof.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1611.02108/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item><item><title>Cubical Type Theory: a constructive interpretation of the univalence axiom — mentioned by hiker</title><link>https://news.ycombinator.com/item?id=15591964</link><guid isPermaLink="false">urn:hackerpapers:mention:1611.02108:15591964</guid><pubDate>Tue, 31 Oct 2017 09:44:10 GMT</pubDate><description>&lt;p&gt;Cubical https://github.com/mortberg/cubicaltt is a proof of concept programming language based on constructive (cubical type theory https://arxiv.org/abs/1611.02108) interpretation of HoTT. Agda also added recently support for cubical paths https://agda.readthedocs.io/en/latest/language/cubical.html . I&amp;#x27;m also waiting on Lean https://leanprover.github.io to introduce cubical type theory for HoTT. Version 2 of the language had HoTT based on the univalence axiom which was dropped in version 3. With cubical type theory the univalence axiom can be constructively proved and is no longer an axiom.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1611.02108/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
