{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T14:50:35Z","timestamp":1707749435893},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"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":[[2003,2]]},"DOI":"10.1016\/s0304-3975(01)00148-7","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T19:22:41Z","timestamp":1043954561000},"page":"353-378","source":"Crossref","is-referenced-by-count":5,"title":["Computational isomorphisms in classical logic"],"prefix":"10.1016","volume":"294","author":[{"given":"Vincent","family":"Danos","sequence":"first","affiliation":[]},{"given":"Jean-Baptiste","family":"Joinet","sequence":"additional","affiliation":[]},{"given":"Harold","family":"Schellinx","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0304-3975(01)00148-7_BIB1","doi-asserted-by":"crossref","first-page":"755","DOI":"10.2307\/2275572","article-title":"A new deconstructive logic","volume":"62","author":"Danos","year":"1997","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"10.1016\/S0304-3975(01)00148-7_BIB2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1017\/S0960129500001328","article-title":"A new constructive logic: classical logic","volume":"1","author":"Girard","year":"1991","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00148-7_BIB3","unstructured":"H. Herbelin, S\u00e9quents qu'on calcule. De l'interpr\u00e9tation du calcul des s\u00e9quents comme calcul de \u03bb-termes et comme calcul de strat\u00e9gies gagnantes, Th\u00e8se de Doctorat, Universit\u00e9 de Paris 7, Pr\u00e9publications du LITP, 1995."},{"key":"10.1016\/S0304-3975(01)00148-7_BIB4","unstructured":"H. Herbelin, B\u00f6hm trees and games, weak-head reduction and interaction between strategies, TLCA, 1997."},{"key":"10.1016\/S0304-3975(01)00148-7_BIB5","unstructured":"J.-B. Joinet, H. Schellinx, L. Tortora de Falco, SN and CR for free-style LKtq: linear decorations and simulation of normalization, preprint no. 1067, Utrecht University, Department of Mathematics, 1998; J. Symbolic Logic, in press."},{"key":"10.1016\/S0304-3975(01)00148-7_BIB6","series-title":"Lambda-Calculus, Types and Models","author":"Krivine","year":"1993"},{"key":"10.1016\/S0304-3975(01)00148-7_BIB7","unstructured":"O. Laurent, M. Quatrini, L. Tortora de Falco, Polarized and focalized linear and classical proofs, Pr\u00e9publication no. 24, Institut de Math\u00e9matiques de Luminy, Universit\u00e9 de Marseille-Luminy, submitted for publication."},{"key":"10.1016\/S0304-3975(01)00148-7_BIB8","series-title":"Logic in Computer Science","first-page":"230","article-title":"A semantic view of classical proofs","author":"Ong","year":"1996"},{"key":"10.1016\/S0304-3975(01)00148-7_BIB9","series-title":"Logic Programming and Automated Reasoning, LNAI 624","first-page":"190","article-title":"\u03bb\u03bc-Calculus","author":"Parigot","year":"1992"},{"key":"10.1016\/S0304-3975(01)00148-7_BIB10","series-title":"Logic in Computer Science","first-page":"39","article-title":"Strong normalization for second order classical natural deduction","author":"Parigot","year":"1993"},{"issue":"4","key":"10.1016\/S0304-3975(01)00148-7_BIB11","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.2307\/2275652","article-title":"Proofs of strong normalization for second order classical natural deduction","volume":"62","author":"Parigot","year":"1997","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(01)00148-7_BIB12","unstructured":"M. Quatrini, L. Tortora de Falco, Polarisation des preuves classiques et renversement, Compte-Rendu de l'Acad\u00e9mie Sci. S\u00e9r. I, Paris 322 (1996)."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001487?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001487?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T10:51:08Z","timestamp":1554029468000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0304397501001487"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00148-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}