<bibliography>
 <citation type="unpublished" key="anel2017blakers">
  <author>Mathieu <surname>Anel</surname></author>
  <author>Georg <surname>Biedermann</surname></author>
  <author>Eric <surname>Finster</surname></author>
  <author>Andr&#233; <surname>Joyal</surname></author>
  <year>2017</year>
  <title>A Generalized Blakers-Massey Theorem</title>
  <url>https://arxiv.org/abs/1703.09050</url>
 </citation>
 <citation type="unpublished" key="abcfhl17cart">
  <author>Carlo <surname>Angiuli</surname></author>
  <author>Guillaume <surname>Brunerie</surname></author>
  <author>Thierry <surname>Coquand</surname></author>
  <author>Kuen-Bang <surname>Hou (Favonia)</surname></author>
  <author>Robert <surname>Harper</surname></author>
  <author>Daniel R. <surname>Licata</surname></author>
  <year>2017</year>
  <title>Cartesian Cubical Type Theory</title>
  <url>https://github.com/dlicata335/cart-cube</url>
  <note>Preprint</note>
 </citation>
 <citation type="inproceedings" key="ahw2017cubical">
  <author>Carlo <surname>Angiuli</surname></author>
  <author>Robert <surname>Harper</surname></author>
  <author>Todd <surname>Wilson</surname></author>
  <year>2017</year>
  <title>Computational Higher-Dimensional Type Theory</title>
  <booktitle>Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages</booktitle>
  <series>POPL 2017</series>
  <publisher>ACM</publisher>
  <address>New York, NY, USA</address>
  <pages>680&#8211;693</pages>
  <doi>10.1145/3009837.3009861</doi>
 </citation>
 <citation type="unpublished" key="afh17uuee">
  <author>Carlo <surname>Angiuli</surname></author>
  <author>Kuen-Bang <surname>Hou (Favonia)</surname></author>
  <author>Robert <surname>Harper</surname></author>
  <year>2017</year>
  <title>Computational Higher Type Theory III: Univalent Universes and Exact Equality</title>
  <url>https://arxiv.org/abs/1712.01800</url>
 </citation>
 <citation type="unpublished" key="ack17twolevel">
  <author>Danil <surname>Annenkov</surname></author>
  <author>Paolo <surname>Capriotti</surname></author>
  <author>Nicolai <surname>Kraus</surname></author>
  <year>2017</year>
  <title>Two-Level Type Theory and Applications</title>
  <url>https://arxiv.org/abs/1705.03307</url>
 </citation>
 <citation type="inproceedings" key="matita2011">
  <author>Andrea <surname>Asperti</surname></author>
  <author>Wilmer <surname>Ricciotti</surname></author>
  <author>Claudio Sacerdoti <surname>Coen</surname></author>
  <author>Enrico <surname>Tassi</surname></author>
  <year>2011</year>
  <title>The Matita Interactive Theorem Prover</title>
  <booktitle>Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31 - August 5, 2011. Proceedings</booktitle>
  <pages>64&#8211;69</pages>
  <doi>10.1007/978-3-642-22438-6_7</doi>
 </citation>
 <citation type="techreport" key="bates:1981">
  <author>Joseph L. <surname>Bates</surname></author>
  <year>1981</year>
  <title>A Logic for Correct Program Development</title>
  <type>Technical Report</type>
  <number>TR81-455</number>
  <institution>Cornell University</institution>
  <url>http://hdl.handle.net/1813/6295</url>
  <note>Revision of Cornell University Ph.D. thesis submitted August 1979</note>
 </citation>
 <citation type="inproceedings" key="coqhott">
  <author>Andrej <surname>Bauer</surname></author>
  <author>Jason <surname>Gross</surname></author>
  <author>Peter LeFanu <surname>Lumsdaine</surname></author>
  <author>Michael <surname>Shulman</surname></author>
  <author>Matthieu <surname>Sozeau</surname></author>
  <author>Bas <surname>Spitters</surname></author>
  <year>2017</year>
  <title>The HoTT Library: A Formalization of Homotopy Type Theory in Coq</title>
  <booktitle>Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs</booktitle>
  <series>CPP 2017</series>
  <publisher>ACM</publisher>
  <address>New York, NY, USA</address>
  <pages>164&#8211;172</pages>
  <doi>10.1145/3018610.3018615</doi>
 </citation>
 <citation type="inproceedings" key="bch">
  <author>Marc <surname>Bezem</surname></author>
  <author>Thierry <surname>Coquand</surname></author>
  <author>Simon <surname>Huber</surname></author>
  <year>2014</year>
  <title>A model of type theory in cubical sets</title>
  <booktitle>19th International Conference on Types for Proofs and Programs (TYPES 2013)</booktitle>
  <volume>26</volume>
  <publisher>Dagstuhl Publishing</publisher>
  <address>Toulouse, France</address>
  <pages>107&#8211;128</pages>
  <doi>10.4230/LIPIcs.TYPES.2013.107</doi>
 </citation>
 <citation type="article" key="brady:2013">
  <author>Edwin <surname>Brady</surname></author>
  <year>2013</year>
  <title>Idris, a general-purpose dependently typed programming language: Design and implementation</title>
  <journal>Journal of Functional Programming</journal>
  <volume>23</volume>
  <number>5</number>
  <pages>552&#8211;593</pages>
  <doi>10.1017/S095679681300018X</doi>
 </citation>
 <citation type="phdthesis" key="brunerie2016homotopy">
  <author>Guillaume <surname>Brunerie</surname></author>
  <year>2016</year>
  <title>On the homotopy groups of spheres in homotopy type theory</title>
  <school>Université Nice Sophia Antipolis</school>
  <url>https://arxiv.org/abs/1606.05916</url>
 </citation>
 <citation type="misc" key="agdahott">
  <author>Guillaume <surname>Brunerie</surname></author>
  <author>Kuen-Bang <surname>Hou (Favonia)</surname></author>
  <author>Evan <surname>Cavallo</surname></author>
  <author>Eric <surname>Finster</surname></author>
  <author>Jesper <surname>Cockx</surname></author>
  <author>Christian <surname>Sattler</surname></author>
  <author>Chris <surname>Jeris</surname></author>
  <author>Michael <surname>Shulman</surname></author>
  <year>2018</year>
  <title>Homotopy Type Theory in Agda</title>
  <url>https://github.com/HoTT/HoTT-Agda</url>
 </citation>
 <citation type="unpublished" key="ch18inductive">
  <author>Evan <surname>Cavallo</surname></author>
  <author>Robert <surname>Harper</surname></author>
  <year>2018</year>
  <title>Computational Higher Type Theory IV: Inductive Types</title>
  <url>https://arxiv.org/abs/1801.01568</url>
 </citation>
 <citation type="inproceedings" key="cohen2018cubical">
  <author>Cyril <surname>Cohen</surname></author>
  <author>Thierry <surname>Coquand</surname></author>
  <author>Simon <surname>Huber</surname></author>
  <author>Anders <surname>M&#246;rtberg</surname></author>
  <year>2018</year>
  <title>Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom</title>
  <booktitle>21st International Conference on Types for Proofs and Programs (TYPES 2015)</booktitle>
  <volume>69</volume>
  <publisher>Schloss Dagstuhl&#8211;Leibniz-Zentrum fuer Informatik</publisher>
  <address>Dagstuhl, Germany</address>
  <pages>5:1&#8211;5:34</pages>
  <doi>10.4230/LIPIcs.TYPES.2015.5</doi>
 </citation>
 <citation type="misc" key="cubicaltt">
  <author>Cyril <surname>Cohen</surname></author>
  <author>Thierry <surname>Coquand</surname></author>
  <author>Simon <surname>Huber</surname></author>
  <author>Anders <surname>M&#246;rtberg</surname></author>
  <year>2018</year>
  <title>cubicaltt: Experimental implementation of Cubical Type Theory</title>
  <howpublished>https://github.com/mortberg/cubicaltt</howpublished>
 </citation>
 <citation type="book" key="constableetalnuprl">
  <author>Robert L. <surname>Constable, et al.</surname></author>
  <year>1985</year>
  <title>Implementing Mathematics with the Nuprl Proof Development Environment</title>
  <publisher>Prentice-Hall</publisher>
  <address>Englewood Cliffs, NJ</address>
  <url>http://www.nuprl.org/book/</url>
 </citation>
 <citation type="inproceedings" key="leanhott">
  <author>Floris <surname>van Doorn</surname></author>
  <author>Jakob <surname>von Raumer</surname></author>
  <author>Ulrik <surname>Buchholtz</surname></author>
  <year>2017</year>
  <title>Homotopy Type Theory in Lean</title>
  <booktitle>Interactive Theorem Proving</booktitle>
  <publisher>Springer</publisher>
  <address>Cham</address>
  <pages>479&#8211;495</pages>
  <doi>10.1007/978-3-319-66107-0_30</doi>
 </citation>
 <citation type="book" key="gordon-milner-wadsworth:1979">
  <author>Michael <surname>Gordon</surname></author>
  <author>Robin <surname>Milner</surname></author>
  <author>Christopher <surname>Wadsworth</surname></author>
  <year>1979</year>
  <title>Edinburgh LCF: A Mechanized Logic of Computation</title>
  <series>Lecture Notes in Computer Science</series>
  <volume>78</volume>
  <publisher>Springer-Verlag</publisher>
  <address>Berlin, Heidelberg</address>
  <doi>10.1007/3-540-09724-4</doi>
 </citation>
 <citation type="unpublished" key="kapulkinlumsdaine">
  <author>Chris <surname>Kapulkin</surname></author>
  <author>Peter LeFanu <surname>Lumsdaine</surname></author>
  <year>2016</year>
  <title>The Simplicial Model of Univalent Foundations (after Voevodsky)</title>
  <url>https://arxiv.org/abs/1211.2851</url>
 </citation>
 <citation type="misc" key="licata2014cubical">
  <author>Daniel R. <surname>Licata</surname></author>
  <author>Guillaume <surname>Brunerie</surname></author>
  <year>2014</year>
  <title>A cubical type theory</title>
  <url>http://dlicata.web.wesleyan.edu/pubs/lb14cubical/lb14cubes-oxford.pdf</url>
  <note>Talk at Oxford Homotopy Type Theory Workshop</note>
 </citation>
 <citation type="unpublished" key="lumsdaineshulman">
  <author>Peter LeFanu <surname>Lumsdaine</surname></author>
  <author>Mike <surname>Shulman</surname></author>
  <year>2017</year>
  <title>Semantics of higher inductive types</title>
  <url>https://arxiv.org/abs/1705.07088</url>
 </citation>
 <citation type="article" key="cmcp">
  <author>P. <surname>Martin-L&#246;f</surname></author>
  <year>1984</year>
  <title>Constructive Mathematics and Computer Programming</title>
  <journal>Philosophical Transactions of the Royal Society of London Series A</journal>
  <volume>312</volume>
  <pages>501&#8211;518</pages>
  <doi>10.1098/rsta.1984.0073</doi>
 </citation>
 <citation type="inproceedings" key="mcbride:2004">
  <author>Conor <surname>McBride</surname></author>
  <year>2005</year>
  <title>Epigram: Practical Programming with Dependent Types</title>
  <booktitle>Proceedings of the 5th International Conference on Advanced Functional Programming</booktitle>
  <series>AFP'04</series>
  <publisher>Springer-Verlag</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>130&#8211;170</pages>
  <doi>10.1007/11546382_3</doi>
 </citation>
 <citation type="phdthesis" key="spiwack2011">
  <author>Arnaud <surname>Spiwack</surname></author>
  <year>2011</year>
  <title>Verified Computing in Homological Algebra, A Journey Exploring the Power and Limits of Dependent Type Theory</title>
  <school>&#201;cole Polytechnique</school>
  <url>https://pastel.archives-ouvertes.fr/pastel-00605836</url>
 </citation>
 <citation type="unpublished" key="sterling2017">
  <author>Jonathan <surname>Sterling</surname></author>
  <author>Robert <surname>Harper</surname></author>
  <year>2017</year>
  <title>Algebraic Foundations of Proof Refinement</title>
  <url>https://arxiv.org/abs/1703.05215</url>
 </citation>
 <citation type="misc" key="redprl">
  <author><surname>The RedPRL Development Team</surname></author>
  <year>2018</year>
  <title>RedPRL &#8211; the People's Refinement Logic</title>
  <url>http://www.redprl.org/</url>
 </citation>
 <citation type="book" key="hottbook">
  <author>The <surname>Univalent Foundations Program</surname></author>
  <year>2013</year>
  <title>Homotopy Type Theory: Univalent Foundations of Mathematics</title>
  <publisher>http://homotopytypetheory.org/book</publisher>
  <address>Institute for Advanced Study</address>
 </citation>
 <citation type="misc" key="voevodskycmu">
  <author>Vladimir <surname>Voevodsky</surname></author>
  <year>2010</year>
  <title>The equivalence axiom and univalent models of type theory</title>
  <url>http://www.math.ias.edu/vladimir/files/CMU_talk.pdf</url>
  <note>Notes from a talk at Carnegie Mellon University</note>
 </citation>
 <citation type="unpublished" key="voevodsky10hcanon">
  <author>Vladimir <surname>Voevodsky</surname></author>
  <year>2010</year>
  <title>Univalent Foundations Project</title>
  <url>http://www.math.ias.edu/vladimir/files/univalent_foundations_project.pdf</url>
  <note>Modified version of an NSF grant application</note>
 </citation>
 <citation type="unpublished" key="voevodsky13hts">
  <author>Vladimir <surname>Voevodsky</surname></author>
  <year>2013</year>
  <title>A type system with two kinds of identity types</title>
  <url>https://www.math.ias.edu/vladimir/sites/math.ias.edu.vladimir/files/HTS.pdf</url>
  <note>Slides available at https://uf-ias-2012.wikispaces.com/file/view/HTS_slides.pdf/410105196/HTS_slides.pdf</note>
 </citation>
</bibliography>
