{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T02:28:19Z","timestamp":1660271299675},"reference-count":16,"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)00299-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:01:16Z","timestamp":1027627276000},"page":"317-335","source":"Crossref","is-referenced-by-count":8,"title":["Parsing MELL proof nets"],"prefix":"10.1016","volume":"254","author":[{"given":"Stefano","family":"Guerrini","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Masini","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00299-6_BIB1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0168-0072(94)00033-Y","article-title":"Sequent reconstruction in LLM \u2013 A sweepline proof","volume":"73","author":"Banach","year":"1995","journal-title":"Ann. Pure. Appl. Logic."},{"key":"10.1016\/S0304-3975(99)00299-6_BIB2","unstructured":"V. Danos, Une Application de la Logique Lin\u00e9aire \u00e0 l\u2019\u00c8tude des Processus de Normalisation (principalement du \u03bb-calcul), Ph.D. Thesis, Universit\u00e9 Paris 7, June 1990."},{"key":"10.1016\/S0304-3975(99)00299-6_BIB3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01622878","article-title":"The structure of multiplicatives","volume":"28","author":"Danos","year":"1989","journal-title":"Arch. Math. Logic"},{"issue":"1","key":"10.1016\/S0304-3975(99)00299-6_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00299-6_BIB5","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard, Linear logic: its syntax and semantics, in J.-Y. Girard, Y. Lafont, L. Regnier (Eds.), Advances in Linear Logic, Cambridge University Press, Cambridge, 1995, pp. 1\u2013 42. Proc. Workshop on Linear Logic, Ithaca, New York, June 1993.","DOI":"10.1017\/CBO9780511629150.002"},{"key":"10.1016\/S0304-3975(99)00299-6_BIB6","doi-asserted-by":"crossref","unstructured":"G. Gonthier, M. Abadi, J.-J. L\u00e9vy, Linear logic without boxes, in: Proc. 7th Annual Symp. on Logic in Computer Science, Santa Cruz, CA, June 1992, pp. 223\u2013234.","DOI":"10.1109\/LICS.1992.185535"},{"key":"10.1016\/S0304-3975(99)00299-6_BIB7","unstructured":"S. Guerrini, Theoretical and practical issues of optimal implementations of functional languages, Ph.D. Thesis, Dipartimento di Informatica, Pisa, 1996. TD-3\/96."},{"key":"10.1016\/S0304-3975(99)00299-6_BIB8","doi-asserted-by":"crossref","unstructured":"S. Guerrini, Correctness of multiplicative proof nets is linear, in: Proc. 14th Annual Symp. on Logic in Computer Science, Trento, Italy, July 1999.","DOI":"10.1109\/LICS.1999.782640"},{"key":"10.1016\/S0304-3975(99)00299-6_BIB9","doi-asserted-by":"crossref","unstructured":"S. Guerrini, S. Martini, A. Masini, Coherence for sharing proof nets, in: H. Ganzinger (Ed.), Proc. 7th Internat. Conf. on Rewriting Techniques and Applications (RTA-96), Lecture Notes in Computer Science, vol. 1103, New Brunswick, NJ, USA, July 27\u201330 1996, Springer, Berlin, pp. 215\u2013229.","DOI":"10.1007\/3-540-61464-8_54"},{"key":"10.1016\/S0304-3975(99)00299-6_BIB10","doi-asserted-by":"crossref","unstructured":"S. Guerrini, S. Martini, A. Masini, Proof nets, garbage and computations, in: TLCA 97, Lecture Notes in Computer Science, Springer, Berlin, 1997. Also appeared as: IRCS Report 97-02, Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia, 1997.","DOI":"10.1007\/3-540-62688-3_36"},{"key":"10.1016\/S0304-3975(99)00299-6_BIB11","unstructured":"S. Guerrini, S. Martini, A. Masini, Proof nets, garbage and computations, Theoret. Comput. Sci. (1999), to appear. Extended version of [8]."},{"key":"10.1016\/S0304-3975(99)00299-6_BIB12","doi-asserted-by":"crossref","unstructured":"Y. Lafont, From proof nets to interaction nets, in: J.-Y. Girard, Y. Lafont, L. Regnier (Eds.), Advances in Linear Logic, Cambridge University Press, Cambridge, 1995, pp. 225\u2013247. Proc. Workshop on Linear Logic, Ithaca, New York, June 1993.","DOI":"10.1017\/CBO9780511629150.012"},{"key":"10.1016\/S0304-3975(99)00299-6_BIB13","doi-asserted-by":"crossref","unstructured":"P. Lincoln, Deciding provability of linear logic formulas, in: J.-Y. Girard, Y. Lafont, L. Regnier (Eds.), Advances in Linear Logic, Cambridge University Press, Cambridge, 1995, pp. 109\u2013122. Proc. Workshop on Linear Logic, Ithaca, New York, June 1993.","DOI":"10.1017\/CBO9780511629150.006"},{"key":"10.1016\/S0304-3975(99)00299-6_BIB14","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(94)00108-1","article-title":"Constant-only multiplicative linear logic is NP-complete","volume":"135","author":"Lincoln","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00299-6_BIB15","doi-asserted-by":"crossref","unstructured":"S. Martini, A. Masini, On the fine structure of the exponential rule, in: J.-Y. Girard, Y. Lafont, L. Regnier (Eds.), Advances in Linear Logic, Cambridge University Press, Cambridge, 1995, pp. 197\u2013210. Proc. Workshop on Linear Logic, Ithaca, New York, June 1993.","DOI":"10.1017\/CBO9780511629150.010"},{"key":"10.1016\/S0304-3975(99)00299-6_BIB16","unstructured":"L. Regnier, Lambda-Calcul et Reseaux, Ph.D. Thesis, Universit\u00e9 Paris 7, January 1992."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002996?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002996?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:52Z","timestamp":1555894792000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599002996"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00299-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}