{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:00:20Z","timestamp":1743037220191,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587462"},{"type":"electronic","value":"9783319587479"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58747-9_1","type":"book-chapter","created":{"date-parts":[[2017,5,5]],"date-time":"2017-05-05T01:14:05Z","timestamp":1493946845000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Type Theory and Formalisation of Mathematics"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Coquand","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,6]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Appel, A.: Modular verification for computer security. In: CSF 2016: 29th IEEE Computer Security Foundations Symposium, June 2016","DOI":"10.1109\/CSF.2016.8"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Bishop, E.: Mathematics as a numerical language 1970 Intuitionism and Proof Theory (Proc. Conf., Buffalo, N.Y.), pp. 53\u201371 (1968)","DOI":"10.1016\/S0049-237X(08)70740-7"},{"key":"1_CR3","unstructured":"Bourbaki, N.: \u00c9l\u00e9ments de math\u00e9matique. Chapitre 4: Structures. Actualit\u00e9s Sci. Ind. no. 1258 Hermann, Paris (1957)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"de Bruijn, N.G.: The mathematical language AUTOMATH, its usage, and some of its extensions. In: 1970 Symposium on Automatic Demonstration. Lecture Notes in Mathematics, vol. 125, pp. 29\u201361","DOI":"10.1007\/BFb0060623"},{"key":"1_CR5","unstructured":"de Bruijn, N.G.: A survey of the project AUTOMATH. In: To H. B. Curry: essays on combinatory logic, lambda calculus and formalism, pp. 579\u2013606 (1980)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A Church","year":"1940","unstructured":"Church, A.: A formulation of the simple theory of types. J. Symbolic Logic 5, 56\u201368 (1940)","journal-title":"J. Symbolic Logic"},{"key":"1_CR7","unstructured":"Interview of P. Deligne. https:\/\/www.simonsfoundation.org\/science_lives_video\/pierre-deligne\/"},{"key":"1_CR8","unstructured":"Gonthier, G.: A computer-checked proof of the Four Colour Theorem. Microsoft report (2005)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-39634-2_14","volume-title":"Interactive Theorem Proving","author":"G Gonthier","year":"2013","unstructured":"Gonthier, G., et al.: A machine-checked proof of the odd order theorem. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol. 7998, pp. 163\u2013179. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39634-2_14"},{"key":"1_CR10","unstructured":"Th. Hales. Developments in formal proofs. Ast\u00e9risque No. 367\u2013368, Exp. No. 1086, pp. 387\u2013410 (2015)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Martin-L\u00f6f, P.: Constructive mathematics and computer programming. In: Logic, methodology and philosophy of science, VI (Hannover, 1979). Stud. Logic Found. Math., vol. 104, pp. 153\u2013175 (1982)","DOI":"10.1016\/S0049-237X(09)70189-2"},{"issue":"5","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1017\/S0960129514000577","volume":"25","author":"V Voevodsky","year":"2015","unstructured":"Voevodsky, V.: An experimental library of formalized mathematics based on the univalent foundations. Math. Structures Comput. Sci. 25(5), 1278\u20131294 (2015)","journal-title":"Math. Structures Comput. Sci."},{"key":"1_CR13","unstructured":"Library UniMath. https:\/\/github.com\/UniMath\/UniMath\/tree\/master\/UniMath"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58747-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:13:31Z","timestamp":1710263611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58747-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587462","9783319587479"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58747-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"6 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kazan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/logic.pdmi.ras.ru\/csr2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}