{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:23Z","timestamp":1761611123259},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(04)00104-5","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T05:34:35Z","timestamp":1075959275000},"page":"58-73","source":"Crossref","is-referenced-by-count":1,"title":["A type theory which is complete for Kreisel's modified realizability"],"prefix":"10.1016","volume":"23","author":[{"given":"Tristan","family":"Crolard","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB1","series-title":"Foundations of Constructive Mathematics","author":"Beeson","year":"1973"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB2","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculs and Formalism","first-page":"491","article-title":"Modified realization and the formulae-as-types notion","author":"Dillar","year":"1987"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF00485463","article-title":"Realizability and intuitionistic logic","volume":"60","author":"Dillar","year":"1984","journal-title":"Synthese"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB4","doi-asserted-by":"crossref","unstructured":"S. Feferman. Constructive theories of functions and classes. In M. Boffa, D. van Dalen, and K. McAloon, editors, Logic Colloquium '78: Proceedings of the Logic Colloquium at Mons, Amsterdam, 1979. North-Holland.","DOI":"10.1016\/S0049-237X(08)71625-2"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB5","doi-asserted-by":"crossref","unstructured":"S. C. Kleene. Realizability: a retrospective survey. In Proceedings of the Cambridge Summer School in Matchematical Logic, volume 37 of Lecture Notes in Mathematics, pages 95\u2013112, Berlin, 1973. Springer-Verlag.","DOI":"10.1007\/BFb0066772"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB6","series-title":"Logic colloquium '73","article-title":"An intuitionistic theory of types: predicative part","author":"Martin-Lf","year":"1975"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB7","series-title":"Logic, Methodolgy and Philosophy of Science IV","first-page":"153","article-title":"Constructive mathematics and computer programming","author":"Martin-Lf","year":"1982"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB8","series-title":"Intuitionistic Type Theory","author":"Martin-Lf","year":"1984"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB9","unstructured":"C. Paulin-Mohring. Extraction de programmes dans le calcul des conctructions. PhD thesis, Universit Denis Diderot - Paris 7, 1989."},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB10","series-title":"Logique et informatique: une introduction, collection didactique","first-page":"163","article-title":"Ralisabilit et extraction de programmes","author":"Paulin-Mohring","year":"1989"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB11","unstructured":"M. D. G. Swaen. Weak and strong sum-elimination in intuitionistic type theory. PhD thesis, The University of Amsterdam, 1989."},{"issue":"3","key":"10.1016\/S1571-0661(04)00104-5_NEWBIB12","doi-asserted-by":"crossref","first-page":"924","DOI":"10.2307\/2275440","article-title":"A characterization of ML in many-sorted arithmetic with conditional application","volume":"57","author":"Swaen","year":"1992","journal-title":"The Journal of Symbolic Logic"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB13","doi-asserted-by":"crossref","unstructured":"A. S. Troelstra. Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1973.","DOI":"10.1007\/BFb0066739"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90047-8","article-title":"On the syntax of Martin-Lof's type theories","volume":"51","author":"Troelstra","year":"1987","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00104-5_NEWBIB15","series-title":"constructivism in Mathematics","author":"Troelstra","year":"1988"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001045?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001045?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T01:56:55Z","timestamp":1550195815000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999]]}},"alternative-id":["S1571066104001045"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00104-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}