{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:31:24Z","timestamp":1725489084053},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730835"},{"type":"electronic","value":"9783540730866"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73086-6_4","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T10:57:56Z","timestamp":1187089076000},"page":"40-54","source":"Crossref","is-referenced-by-count":9,"title":["Towards Constructive Homological Algebra in Type Theory"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Coquand","sequence":"first","affiliation":[]},{"given":"Arnaud","family":"Spiwack","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Aransay, J.M.: Razonamiento mecanizado en \u00e1lgebra homol\u00f3gica. PhD thesis (2006)"},{"key":"4_CR2","unstructured":"Artin, M., Grothendieck, A., Verdier, J,-L.: Univers S\u00e9minaire de G\u00e9om\u00e9trie Alg\u00e9brique du Bois Marie -,1963-64 - Th\u00e9orie des topos et cohomologie \u00e9tale des sch\u00e9mas - (SGA 4) - vol. 1, LNM 269, 185-217, Springer-Verlag, Berlin, New York (1963)"},{"key":"4_CR3","volume-title":"Foundations of Constructive Analysis","author":"E. Bishop","year":"1967","unstructured":"Bishop, E.: Foundations of Constructive Analysis. McGraw-Hill, New York (1967)"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0890-5401(91)90066-B","volume":"91","author":"N.G. Bruijn de","year":"1991","unstructured":"de Bruijn, N.G.: Telescopic mappings in typed lambda calculus. Inform. and Comput.\u00a091(2), 189\u2013204 (1991)","journal-title":"Inform. and Comput."},{"key":"4_CR5","unstructured":"Barakat, M., Robertz, D.: homalg: First steps to an abstract package for homological algebra. In: Proceedings of the X meeting on computational algebra and its applications (EACA 2006), Sevilla, Spain, pp. 29\u201332 (2006)"},{"key":"4_CR6","unstructured":"LogiCal project. The Coq Proof Assistant (2007), http:\/\/coq.inria.fr\/V8.1\/refman\/index.html"},{"key":"4_CR7","unstructured":"Coquand, T.: Metamathematical investigations of a calculus of constructions. Rapport de recherche de l\u2019INRIA (1989)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Gregoire, B., Leroy, X.: A Compiled Implementation of Strong Reduction. International Conference on Functional Programming (2002)","DOI":"10.1145\/581478.581501"},{"key":"4_CR9","series-title":"Found. Comput. Ser.","doi-asserted-by":"crossref","first-page":"239","DOI":"10.7551\/mitpress\/5641.003.0015","volume-title":"Proof, language, and interaction","author":"G. Huet","year":"2000","unstructured":"Huet, G., Saibi, A.: Constructive category theory. In: Proof, language, and interaction. Found. Comput. Ser., pp. 239\u2013275. MIT Press, Cambridge, MA (2000)"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P. Landin","year":"1964","unstructured":"Landin, P.: The mechanical evaluation of expressions. Comput. J.\u00a06, 308\u2013320 (1964)","journal-title":"Comput. J."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Martin-L\u00f6f, P.: An intuitionistic theory of types. In: Twenty-five years of constructive type theory (Venice, 1995), pp. 127\u2013172, Oxford Logic Guides, 36, Oxford Univ. Press, New York (1998)","DOI":"10.1093\/oso\/9780198501275.003.0010"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"TYPES 1996","author":"P.-A. Melli\u00e8s","year":"1997","unstructured":"Melli\u00e8s, P.-A., Werner, B.: A Generic Normalization Proof for Pure Type Systems. In: Paulin-Mohring, C., Gimenez, E. (eds.) TYPES 1996. LNCS, Springer, Heidelberg (1997)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39185-1_14","volume-title":"Types for Proofs and Programs","author":"A. Miquel","year":"2003","unstructured":"Miquel, A., Werner, B.: The Not So Simple Proof-Irrelevant Model of CC. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol.\u00a02646, Springer, Heidelberg (2003)"},{"key":"4_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8640-5","volume-title":"A Course in Constructive Algebra","author":"R. Mines","year":"1988","unstructured":"Mines, R., Richman, F., Ruitenburg, W.: A Course in Constructive Algebra. Springer, Heidelberg (1988)"},{"key":"4_CR15","unstructured":"Rubio, J., Sergereart, F.: Constructive Homological Algebra and Applications, Genove Summer School (2006), available at http:\/\/www-fourier.ujf-grenoble.fr\/~sergerar\/Papers\/"},{"key":"4_CR16","unstructured":"Spiwack, A.: Ajouter des entiers machine \u00e0 Coq. Master thesis, http:\/\/arnaud.spiwack.free.fr\/"}],"container-title":["Lecture Notes in Computer Science","Towards Mechanized Mathematical Assistants"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73086-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T11:05:24Z","timestamp":1708167924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73086-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540730835","9783540730866"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73086-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}