{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T19:04:54Z","timestamp":1707246294437},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)00141-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:01:16Z","timestamp":1027627276000},"page":"259-271","source":"Crossref","is-referenced-by-count":1,"title":["Completeness, minimal logic and programs extraction"],"prefix":"10.1016","volume":"254","author":[{"given":"Christophe","family":"Raffalli","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00141-3_BIB1","unstructured":"A. Heyting, Les Fondements des Math\u00e9matiques, Intuitionisme, Th\u00e9orie de la D\u00e9monstration, Gauthier-Villars, Paris and E. Nauwelaersts, Louvain, 1955."},{"key":"10.1016\/S0304-3975(99)00141-3_BIB2","unstructured":"W. Howard, The formulae-as-types notion of construction, To H.B. Curry: Essays on Combinatory Logic, \u03bb-Calculus and Formalism, 1980, pp. 479\u2013490."},{"key":"10.1016\/S0304-3975(99)00141-3_BIB3","doi-asserted-by":"crossref","unstructured":"S.A. Kripke, Semantical analysis of intuitionistic logic i, in: Formal System and Recursive Functions, North-Holland, Oxford, 1965, 8th Logic colloquium.","DOI":"10.1016\/S0049-237X(08)71685-9"},{"key":"10.1016\/S0304-3975(99)00141-3_BIB4","unstructured":"J.-L. Krivine, Lambda-calculus: Types and Models, Computers and Their Applications, Ellis Horwood, Chichester, UK, 1993."},{"issue":"3","key":"10.1016\/S0304-3975(99)00141-3_BIB5","first-page":"149","article-title":"Michel Parigot, Programming with proofs","volume":"26","author":"Krivine","year":"1990","journal-title":"Inf. Processing Cybern. EIK"},{"issue":"4","key":"10.1016\/S0304-3975(99)00141-3_BIB6","doi-asserted-by":"crossref","first-page":"405","DOI":"10.2307\/421172","article-title":"Une preuve formelle et intuitionniste du th\u00e9or\u00e8me de compl\u00e9tude de la logique classique","volume":"2","author":"Krivine","year":"1996","journal-title":"Bull. Symbol. Logic"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001413?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001413?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T00:59:55Z","timestamp":1555894795000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599001413"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00141-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}