{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:36Z","timestamp":1725558456282},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_35","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T19:33:58Z","timestamp":1277494438000},"page":"441-454","source":"Crossref","is-referenced-by-count":4,"title":["A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Miquel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Aczel, P.: Non well-founded sets. Center for the Study of Language and Information (1988)"},{"key":"35_CR2","unstructured":"Barendregt, H.: Introduction to generalized type systems. Technical Report 90-8, University of Nijmegen, Department of Informatics (May 1990)"},{"key":"35_CR3","unstructured":"Barras, B., Boutin, S., Cornes, C., Courant, J., Filli\u00e2tre, J.C., Gim\u00e9nez, E., Herbelin, H., Huet, G., Mu\u00f1oz, C., Murthy, C., Parent, C., Paulin, C., Sa\u00efbi, A., Werner, B.: The Coq Proof Assistant Reference Manual \u2013 Version V6.1. Technical Report 0203, INRIA (August 1997)"},{"key":"35_CR4","series-title":"Springer Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BFb0066773","volume-title":"Cambridge Summer School in Mathematical Logic","author":"H. Friedman","year":"1973","unstructured":"Friedman, H.: Some applications of Kleene\u2019s methods for intuitionistic systems. In: Cambridge Summer School in Mathematical Logic. Springer Lecture Notes in Mathematics, vol.\u00a0337, pp. 113\u2013170. Springer, Heidelberg (1973)"},{"key":"35_CR5","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, 155\u2013189 (1991)","journal-title":"Journal of Functional Programming"},{"issue":"3","key":"35_CR6","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. Archive for Mathematical Logic\u00a040(3), 189\u2013205 (2001)","journal-title":"Archive for Mathematical Logic"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Krivine, J.-L.: Dependent choice, \u2018quote\u2019 and the clock. Theoretical Computer Science (2003)","DOI":"10.1016\/S0304-3975(02)00776-4"},{"key":"35_CR8","unstructured":"Martin-L\u00f6f, P.: Intuitionistic Type Theory. Bibliopolis, Napoli (1984)"},{"key":"35_CR9","unstructured":"McCarty, D.: Realizability and Recursive Mathematics. PhD thesis, Ohio State University (1984)"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 normalization proof for pure type systems. In: Gim\u00e9nez, E. (ed.) TYPES 1996. LNCS, vol.\u00a01512, Springer, Heidelberg (1998)"},{"key":"35_CR11","unstructured":"Miquel, A.: Le calcul des constructions implicite: syntaxe et s\u00e9mantique. PhD thesis, Universit\u00e9 Paris VII (2001)"},{"key":"35_CR12","series-title":"Springer Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/BFb0066775","volume-title":"Cambridge Summer School in Mathematical Logic","author":"J. Myhill","year":"1973","unstructured":"Myhill, J.: Some properties of intuitionistic Zermelo-Fraenkel set theory. In: Cambridge Summer School in Mathematical Logic. Springer Lecture Notes in Mathematics, vol.\u00a0337, pp. 206\u2013231. Springer, Heidelberg (1973)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:01:48Z","timestamp":1559206908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}