{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:06Z","timestamp":1725490266682},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_25","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"313-327","source":"Crossref","is-referenced-by-count":8,"title":["Classical Program Extraction in the Calculus of Constructions"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Miquel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Aczel, P.: On relating type theories and set theories. In: Altenkirch, Naraschewski, Reus (eds.) Proceedings of Types 1998 (1999)","DOI":"10.1007\/3-540-48167-2_1"},{"key":"25_CR2","unstructured":"Altenkirch, T.: Constructions, Inductive Types and Strong Normalization. PhD thesis, University of Edinburgh (November 1993)"},{"issue":"76","key":"25_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"120","author":"T. Coquand","year":"1988","unstructured":"Coquand, T., Huet, G.: The calculus of constructions. Information and Computation\u00a0120(76), 95 (1988)","journal-title":"Information and Computation"},{"issue":"1991","key":"25_CR4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1017\/S0956796800020037","volume":"1,2","author":"J.H. Geuvers","year":"1991","unstructured":"Geuvers, J.H., Nederhof, M.J.: A modular proof of strong normalization for the calculus of constructions. Journal of Functional Programming\u00a01,2(1991), 155\u2013189 (1991)","journal-title":"Journal of Functional Programming"},{"key":"25_CR5","volume-title":"The L. E. J. Brouwer Centenary Symposium","author":"J.M.E. Hyland","year":"1982","unstructured":"Hyland, J.M.E.: The effective topos. In: Troelstra, A.S., van Dalen, D. (eds.) The L. E. J. Brouwer Centenary Symposium, North Holland, Amsterdam (1982)"},{"key":"25_CR6","unstructured":"Krivine, J.-L.: Lambda-calcul, types et mod\u00e8les. Masson (1991)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(94)90081-7","volume":"129","author":"J.-L. Krivine","year":"1994","unstructured":"Krivine, J.-L.: A general storage theorem for integers in call-by-name lambda-calculus. Th. Comp. Sc.\u00a0129, 79\u201394 (1994)","journal-title":"Th. Comp. Sc."},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s001530000057","volume":"40","author":"J.-L. Krivine","year":"2001","unstructured":"Krivine, J.-L.: Typed lambda-calculus in classical Zermelo-Fraenkel set theory. Arch. Math. Log.\u00a040(3), 189\u2013205 (2001)","journal-title":"Arch. Math. Log."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0304-3975(02)00776-4","volume":"308","author":"J.-L. Krivine","year":"2003","unstructured":"Krivine, J.-L.: Dependent choice, \u2018quote\u2019 and the clock. Th. Comp. Sc.\u00a0308, 259\u2013276 (2003)","journal-title":"Th. Comp. Sc."},{"key":"25_CR10","unstructured":"Krivine, J.-L.: Realizability in classical logic. Unpublished lecture notes (available on the author\u2019s web page) (2005)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-39185-1_12","volume-title":"Types for Proofs and Programs","author":"P. Letouzey","year":"2003","unstructured":"Letouzey, P.: A new extraction for Coq. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol.\u00a02646, pp. 200\u2013219. Springer, Heidelberg (2003)"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(90)90122-X","volume":"70","author":"G. Longo","year":"1990","unstructured":"Longo, G., Moggi, E.: A category-theoretic characterization of functional completeness. Theor. Comput. Sci.\u00a070(2), 193\u2013211 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198538356.001.0001","volume-title":"Computation and Reasoning: A Type Theory for Computer Science","author":"Z. Luo","year":"1994","unstructured":"Luo, Z.: Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, Oxford (1994)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0097796","volume-title":"Types for Proofs and Programs","author":"P.-A. Melli\u00e8s","year":"1998","unstructured":"Melli\u00e8s, P.-A., Werner, B.: A generic normalisation proof for pure type systems. In: Gim\u00e9nez, E., Paulin-Mohring, C. (eds.) TYPES 1996. LNCS, vol.\u00a01512, pp. 254\u2013276. Springer, Heidelberg (1998)"},{"key":"25_CR15","unstructured":"Miquel, A.: Le calcul des constructions implicite: syntaxe et s\u00e9mantique. PhD thesis, Universit\u00e9 Paris 7 (2001)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Paulin-Mohring, C.: Extracting F\u03c9\u2019s programs from proofs in the calculus of constructions. In: POPL 1989, pp. 89\u2013104 (1989)","DOI":"10.1145\/75277.75285"},{"key":"25_CR17","unstructured":"Paulin-Mohring, C.: D\u00e9finitions Inductives en Th\u00e9orie des Types d\u2019Ordre Sup\u00e9rieur. Habilitation \u00e0 diriger les recherches, Universit\u00e9 Claude Bernard Lyon I (1996)"},{"key":"25_CR18","unstructured":"The Coq Development Team (LogiCal Project). The Coq Proof Assistant Reference Manual - Version 8.1. Technical report, INRIA (2006)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Streicher, T.: Semantics of Type Theory. Birkh\u00e4user (1991)","DOI":"10.1007\/978-1-4612-0433-6"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T15:37:08Z","timestamp":1708184228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}