{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:07:13Z","timestamp":1774987633587,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319035444","type":"print"},{"value":"9783319035451","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03545-1_1","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T16:31:48Z","timestamp":1386606708000},"page":"1-16","source":"Crossref","is-referenced-by-count":13,"title":["\u03c0 n (S n ) in Homotopy Type Theory"],"prefix":"10.1007","author":[{"given":"Daniel R.","family":"Licata","sequence":"first","affiliation":[]},{"given":"Guillaume","family":"Brunerie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Awodey, S., Warren, M.: Homotopy theoretic models of identity types. In: Mathematical Proceedings of the Cambridge Philosophical Society (2009)","DOI":"10.1017\/S0305004108001783"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Awodey, S., Gambino, N., Sojakova, K.: Inductive types in homotopy type theory. In: IEEE Symposium on Logic in Computer Science (2012)","DOI":"10.1109\/LICS.2012.21"},{"key":"1_CR3","unstructured":"Finster, E., Licata, D.R., Lumsdaine, P.L.: The Blakers-Massey theorem in \u221e-topoi and homotopy type theory (in preparation, 2013)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Licata, D.R., Shulman, M.: Calculating the fundamental group of the cirlce in homotopy type theory. In: IEEE Symposium on Logic in Computer Science (2013)","DOI":"10.1109\/LICS.2013.28"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-642-02273-9_14","volume-title":"Typed Lambda Calculi and Applications","author":"P.L. Lumsdaine","year":"2009","unstructured":"Lumsdaine, P.L.: Weak \u03c9-categories from intensional type theory. In: Curien, P.-L. (ed.) TLCA 2009. LNCS, vol.\u00a05608, pp. 172\u2013187. Springer, Heidelberg (2009)"},{"key":"1_CR6","unstructured":"Lumsdaine, P.L., Shulman, M.: Higher inductive types (in preparation, 2013)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Martin-L\u00f6f, P.: An intuitionistic theory of types: Predicative part. In: Rose, H., Shepherdson, J. (eds.) Proceedings of the Logic Colloquium, Logic Colloquium 1973. Studies in Logic and the Foundations of Mathematics, vol.\u00a080, pp. 73\u2013118. Elsevier (1975)","DOI":"10.1016\/S0049-237X(08)71945-1"},{"key":"1_CR8","unstructured":"McBride, C.: Dependently Typed Functional Programs and Their Proofs. PhD thesis, University of Edinburgh (2000)"},{"key":"1_CR9","unstructured":"Nordstr\u00f6m, B., Peterson, K., Smith, J.: Programming in Martin-L\u00f6f\u2019s Type Theory, an Introduction. Clarendon Press (1990)"},{"key":"1_CR10","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology (2007)"},{"key":"1_CR11","unstructured":"The Univalent Foundations Program. Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study (2013), \n                      http:\/\/homotopytypetheory.org\/book"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1112\/plms\/pdq026","volume":"102","author":"B. van den Berg","year":"2011","unstructured":"van den Berg, B., Garner, R.: Types are weak \u03c9-groupoids. Proceedings of the London Mathematical Society\u00a0102(2), 370\u2013394 (2011)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-20920-8_4","volume-title":"Logic, Language, Information and Computation","author":"V. Voevodsky","year":"2011","unstructured":"Voevodsky, V.: Univalent foundations of mathematics. In: Beklemishev, L.D., de Queiroz, R. (eds.) WoLLIC 2011. LNCS, vol.\u00a06642, p. 4. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Certified Programs and Proofs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03545-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T21:52:16Z","timestamp":1676843536000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03545-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035444","9783319035451"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03545-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}