{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:30Z","timestamp":1761611070722},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"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":[[1994,12]]},"DOI":"10.1016\/0304-3975(94)00105-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"67-110","source":"Crossref","is-referenced-by-count":29,"title":["On proof normalization in linear logic"],"prefix":"10.1016","volume":"135","author":[{"given":"Didier","family":"Galmiche","sequence":"first","affiliation":[]},{"given":"Guy","family":"Perrier","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/0304-3975(94)00105-7_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","article-title":"Computational interpretations of linear logic","volume":"111","author":"Abramsky","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0304-3975(94)00105-7_BIB2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","article-title":"Logic programming with focusing proofs in linear logic","volume":"2","author":"Andreoli","year":"1993","journal-title":"J. Logic and Comput."},{"key":"10.1016\/0304-3975(94)00105-7_BIB3","first-page":"1","article-title":"Logic programming with sequent systems: A linear logic approach","volume":"vol. 475","author":"Andreoli","year":"1989"},{"key":"10.1016\/0304-3975(94)00105-7_BIB4","first-page":"495","article-title":"Linear objects: logical processes with built-in inheritance","author":"Andreoli","year":"1990"},{"key":"10.1016\/0304-3975(94)00105-7_BIB5","series-title":"Technical Report ECS-LFCS 91-161","article-title":"Proof nets for multiplicative and additive linear logic","author":"Bellin","year":"1991"},{"key":"10.1016\/0304-3975(94)00105-7_BIB6","first-page":"219","article-title":"A linear semantics for allowed logic programs","author":"Cerrito","year":"1990","journal-title":"5th IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0304-3975(94)00105-7_BIB7","series-title":"Logic for Computer Science: Foundations of Automatic Theorem Proving","author":"Gallier","year":"1986"},{"issue":"2","key":"10.1016\/0304-3975(94)00105-7_BIB8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(90)90199-R","article-title":"Constructive system for automatic program synthesis","volume":"71","author":"Galmiche","year":"1990","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0304-3975(94)00105-7_BIB9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(92)90037-G","article-title":"Program development in constructive type theory","volume":"94","author":"Galmiche","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00105-7_BIB10","first-page":"151","article-title":"Automated deduction in additive and multiplicative linear logic","volume":"Vol. 620","author":"Galmiche","year":"1992"},{"key":"10.1016\/0304-3975(94)00105-7_BIB11","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BFb0013047","article-title":"A procedure for automatic proof nets construction","author":"Galmiche","year":"1992","journal-title":"LP AR'92, International Conference on Logic Programming and Automated Reasoning, LN AI 624"},{"issue":"1","key":"10.1016\/0304-3975(94)00105-7_BIB12","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\/0304-3975(94)00105-7_BIB13","first-page":"69","article-title":"Towards a geometry of interaction","author":"Girard","year":"1987","journal-title":"Conference on Categories in Computer Science and Logic"},{"key":"10.1016\/0304-3975(94)00105-7_BIB14","first-page":"304","article-title":"The uniform proof-theoretic foundation of linear logic programming","author":"Harland","year":"1991"},{"key":"10.1016\/0304-3975(94)00105-7_BIB15","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BFb0013046","article-title":"On resolution in fragments of classical linear logic","author":"Harland","year":"1992","journal-title":"LP AR'92, International Conference on Logic Programming and Automated Reasoning, LN AI 624"},{"key":"10.1016\/0304-3975(94)00105-7_BIB16","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/LICS.1991.151628","article-title":"Logic programming in a fragment of intuitionistic linear logic","author":"Hodas","year":"1991","journal-title":"6th IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0304-3975(94)00105-7_BIB17","first-page":"200","article-title":"Horn programming in linear logic is NP-complete","author":"Kanovich","year":"1992","journal-title":"7th IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0304-3975(94)00105-7_BIB18","first-page":"279","article-title":"ACL \u2014 a concurrent linear logic programming paradigm","author":"Kobayashi","year":"1993","journal-title":"Int. Symposium on Logic Programming"},{"key":"10.1016\/0304-3975(94)00105-7_BIB19","first-page":"95","article-title":"Interaction nets","author":"Lafont","year":"1990","journal-title":"17th ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(94)00105-7_BIB20","first-page":"235","article-title":"Operational aspects of linear lambda calculus","author":"Lincoln","year":"1992","journal-title":"7th IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0304-3975(94)00105-7_BIB21","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/FSCS.1990.89588","article-title":"Decision problems for propositional linear logic","author":"Lincoln","year":"1990","journal-title":"31st IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)00105-7_BIB22","series-title":"Foundations of Software Technology and Theoretical Computer Science","first-page":"63","article-title":"Generating plans in linear logic","volume":"Vol. 472","author":"Masseron","year":"1990"},{"issue":"2","key":"10.1016\/0304-3975(94)00105-7_BIB23","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0304-3975(93)90007-G","article-title":"Generating plans in linear logic I: Actions as proofs","volume":"113","author":"Masseron","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00105-7_BIB24","series-title":"Category Theory and Computer Science","article-title":"From petri nets to linear logic","volume":"Vol. 389","author":"Meseguer","year":"1989"},{"issue":"2","key":"10.1016\/0304-3975(94)00105-7_BIB25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/130956.130958","article-title":"Introduction to linear logic","volume":"23","author":"Mitchell","year":"1992","journal-title":"Sigact News"},{"key":"10.1016\/0304-3975(94)00105-7_BIB26","first-page":"536","article-title":"Proof search in the intuitionistic sequent calculus","volume":"Vol. 607","author":"Shankar","year":"1992","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"10.1016\/0304-3975(94)00105-7_BIB27","series-title":"Programming Methodology Group Report 70","article-title":"Proof search strategies in linear logic","author":"Tammet","year":"1993"},{"key":"10.1016\/0304-3975(94)00105-7_BIB28","article-title":"Lectures on Linear Logic","volume":"Vol. 29","author":"Troelstra","year":"1992","journal-title":"Lecture Notes"},{"key":"10.1016\/0304-3975(94)00105-7_BIB29","series-title":"Automated Proof search in Non-Classical Logics","author":"Wallen","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594001057?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594001057?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:27:53Z","timestamp":1580902073000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594001057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0304397594001057"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00105-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}