{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:58Z","timestamp":1750306498764,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,18]],"date-time":"2016-01-18T00:00:00Z","timestamp":1453075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,18]]},"DOI":"10.1145\/2854065.2854076","type":"proceedings-article","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T13:18:57Z","timestamp":1452604737000},"page":"122-129","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Constructing the propositional truncation using non-recursive HITs"],"prefix":"10.1145","author":[{"given":"Floris van","family":"Doorn","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,1,18]]},"reference":[{"issue":"1997","key":"e_1_3_2_1_1_1","first-page":"329","article-title":"378\u2013388. {Dyb97} Peter Dybjer, Representing inductively defined sets by wellorderings in Martin-L\u00f6f \u2019s type theory","volume":"176","author":"Leonardo de Moura KA","year":"2015","unstructured":"{d KA + 15} Leonardo de Moura , Soonho Kong , Jeremy Avigad , Floris van Doorn , and Jakob von Raumer , The Lean Theorem Prover (system description), CADE-25 ( 2015 ), 378\u2013388. {Dyb97} Peter Dybjer, Representing inductively defined sets by wellorderings in Martin-L\u00f6f \u2019s type theory , Theoretical Computer Science 176 ( 1997 ), no. 1\u20132, 329 \u2013 335 , doi:10.1016\/S0304- 3975(96)00145-4. {KECA13} Nicolai Kraus, Mart\u00edn Escard\u00f3, Thierry Coquand, and Thorsten Altenkirch, Generalizations of Hedberg\u2019s theorem, Typed Lambda Calculi and Applications, Springer, 2013, pp. 173\u2013188. {KECA14}, Notions of anonymous existence in Martin-L\u00f6f type theory, Submitted to the special issue of TLCA\u201913 (2014). 10.1016\/S0304- {dKA + 15} Leonardo de Moura, Soonho Kong, Jeremy Avigad, Floris van Doorn, and Jakob von Raumer, The Lean Theorem Prover (system description), CADE-25 (2015), 378\u2013388. {Dyb97} Peter Dybjer, Representing inductively defined sets by wellorderings in Martin-L\u00f6f \u2019s type theory, Theoretical Computer Science 176 (1997), no. 1\u20132, 329 \u2013 335, doi:10.1016\/S0304- 3975(96)00145-4. {KECA13} Nicolai Kraus, Mart\u00edn Escard\u00f3, Thierry Coquand, and Thorsten Altenkirch, Generalizations of Hedberg\u2019s theorem, Typed Lambda Calculi and Applications, Springer, 2013, pp. 173\u2013188. {KECA14}, Notions of anonymous existence in Martin-L\u00f6f type theory, Submitted to the special issue of TLCA\u201913 (2014).","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_1_2_1","volume-title":"Institute for Advanced Study","author":"Foundations Program The Univalent","year":"2013","unstructured":"{Uni13} The Univalent Foundations Program , Homotopy type theory: Univalent foundations of mathematics, http:\/\/homotopytypetheory.org\/book , Institute for Advanced Study , 2013 . {Uni13} The Univalent Foundations Program, Homotopy type theory: Univalent foundations of mathematics, http:\/\/homotopytypetheory.org\/book, Institute for Advanced Study, 2013."},{"key":"e_1_3_2_1_3_1","volume-title":"December","author":"van Doorn Floris","year":"2015","unstructured":"{vD15} Floris van Doorn , The Lean Theorem Prover, blog post , December 2015 , http:\/\/homotopytypetheory.org\/2015\/ 12\/02\/the-proof-assistant-lean\/. {Voe14} V. Voevodsky, The equivalence axiom and univalent models of type theory. (Talk at CMU on February 4, 2010), arXiv: 1402.5556. {vD15} Floris van Doorn, The Lean Theorem Prover, blog post, December 2015, http:\/\/homotopytypetheory.org\/2015\/ 12\/02\/the-proof-assistant-lean\/. {Voe14} V. Voevodsky, The equivalence axiom and univalent models of type theory. (Talk at CMU on February 4, 2010), arXiv: 1402.5556."}],"event":{"name":"CPP 2016: Certified Proofs and Programs","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"St. Petersburg FL USA","acronym":"CPP 2016"},"container-title":["Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854065.2854076","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2854065.2854076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:47Z","timestamp":1750225727000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854065.2854076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,18]]},"references-count":3,"alternative-id":["10.1145\/2854065.2854076","10.1145\/2854065"],"URL":"https:\/\/doi.org\/10.1145\/2854065.2854076","relation":{},"subject":[],"published":{"date-parts":[[2016,1,18]]},"assertion":[{"value":"2016-01-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}