{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T01:26:43Z","timestamp":1660267603079},"reference-count":35,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"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":7412,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0168-0072(93)90041-b","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"151-177","source":"Crossref","is-referenced-by-count":8,"title":["Linearizing intuitionistic implication"],"prefix":"10.1016","volume":"60","author":[{"given":"Patrick","family":"Lincoln","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natarajan","family":"Shankar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(93)90041-B_BIB1","unstructured":"S. Abramsky, Computational interpretations of linear logic, Theoreti. Comput. Sci., to appear in Special Issue on the 1990 Workshop on Math. Found. Prog. Semantics."},{"key":"10.1016\/0168-0072(93)90041-B_BIB2","first-page":"211","article-title":"New foundations for the geometry of interaction","author":"Abramsky","year":"1992"},{"key":"10.1016\/0168-0072(93)90041-B_BIB3","doi-asserted-by":"crossref","DOI":"10.1093\/logcom\/2.3.297","article-title":"Logic programming with focusing proofs in linear logic","author":"Andreoli","year":"1992","journal-title":"J. Logic and Computation"},{"key":"10.1016\/0168-0072(93)90041-B_BIB4","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0038690","article-title":"Logic programming with sequent systems: a linear logic approach","author":"Andreoli","year":"1990"},{"key":"10.1016\/0168-0072(93)90041-B_BIB5","doi-asserted-by":"crossref","DOI":"10.1007\/BF03037173","article-title":"Linear objects: logical processes with built-in inheritance","volume":"9","author":"Andreoli","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/0168-0072(93)90041-B_BIB6","first-page":"59","article-title":"Implicative formulae in the \u2018proofs as computations\u2019 analogy","author":"Asperti","year":"1990","journal-title":"Proc. 17th ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0168-0072(93)90041-B_BIB7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-4049(91)90020-3","article-title":"Accessible categories and models of linear logic","volume":"69","author":"Barr","year":"1990","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/0168-0072(93)90041-B_BIB8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0168-0072(92)90073-9","article-title":"A game semantics for linear logic","volume":"56","author":"Blass","year":"1992","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(93)90041-B_BIB9","author":"Curry","year":"1963"},{"key":"10.1016\/0168-0072(93)90041-B_BIB10","doi-asserted-by":"crossref","first-page":"807","DOI":"10.2307\/2275431","article-title":"Contraction-free sequent calculi for intuitionistic logic","volume":"57","author":"Dyckhoff","year":"1992","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(93)90041-B_BIB11","article-title":"Normal process representatives","author":"Gehlot","year":"1990","journal-title":"Proc. 5th IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0168-0072(93)90041-B_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\/0168-0072(93)90041-B_BIB13","doi-asserted-by":"crossref","DOI":"10.1016\/S0049-237X(08)70271-4","article-title":"Geometry of interaction I: interpretation of system F","author":"Girard","year":"1989"},{"key":"10.1016\/0168-0072(93)90041-B_BIB14","first-page":"52","article-title":"Linear logic and lazy computation","volume":"Vol. 2","author":"Girard","year":"1987"},{"key":"10.1016\/0168-0072(93)90041-B_BIB15","article-title":"Proofs and Types","author":"Girard","year":"1989"},{"key":"10.1016\/0168-0072(93)90041-B_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(92)90386-T","article-title":"Bounded linear logic: a modular approach to polynomial time computability","volume":"97","author":"Girard","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(93)90041-B_BIB17","doi-asserted-by":"crossref","DOI":"10.1145\/143165.143172","article-title":"The geometry of optimal lambda reduction","author":"Gonthier","year":"1992"},{"key":"10.1016\/0168-0072(93)90041-B_BIB18","first-page":"223","article-title":"Linear logic without boxes","author":"Gonthier","year":"1992"},{"key":"10.1016\/0168-0072(93)90041-B_BIB19","first-page":"32","article-title":"Logic programming in a fragment of intuitionistic linear logic","author":"Hodas","year":"1991"},{"key":"10.1016\/0168-0072(93)90041-B_BIB20","doi-asserted-by":"crossref","DOI":"10.1007\/BF01627506","article-title":"Bounds for Cut Elimination in Intuitionistic Propositional Logic","author":"Hudelmaier","year":"1989"},{"key":"10.1016\/0168-0072(93)90041-B_BIB21","first-page":"200","article-title":"Horn programming in linear logic is NP-complete","author":"Kanovich","year":"1992"},{"key":"10.1016\/0168-0072(93)90041-B_BIB22","author":"Kleene","year":"1952"},{"key":"10.1016\/0168-0072(93)90041-B_BIB23","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(88)90100-4","article-title":"The linear abstract machine","volume":"59","author":"Lafont","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(93)90041-B_BIB24","first-page":"235","article-title":"Operational aspects of linear lambds calculus","author":"Lincoln","year":"1992"},{"key":"10.1016\/0168-0072(93)90041-B_BIB25","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0168-0072(92)90075-B","article-title":"Decision problems for propositional linear logic","volume":"56","author":"Lincoln","year":"1992","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(93)90041-B_BIB26","first-page":"51","article-title":"Linearizing intuitionistic implication","author":"Lincoln","year":"1991"},{"key":"10.1016\/0168-0072(93)90041-B_BIB27","article-title":"The complexity of cut elimination in a fragment of linear logic","author":"Lincoln","year":"1990","journal-title":"Manuscript"},{"key":"10.1016\/0168-0072(93)90041-B_BIB28","first-page":"329","article-title":"Abstractions in logic programming","volume":"31","author":"Miller","year":"1990"},{"key":"10.1016\/0168-0072(93)90041-B_BIB29","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","article-title":"Uniform proofs as a foundation for logic programming","volume":"51","author":"Miller","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(93)90041-B_BIB30","first-page":"198","article-title":"Gentzen-type systems and resolution rules. Part I Propositional logic","volume":"417","author":"Mints","year":"1990"},{"key":"10.1016\/0168-0072(93)90041-B_BIB31","first-page":"416","article-title":"On a version of the constructive predicate calculus without structural rules","volume":"6","author":"Pliushkevichus","year":"1965","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0168-0072(93)90041-B_BIB32","first-page":"1","article-title":"Event spaces and their linear logic","author":"Pratt","year":"1992"},{"key":"10.1016\/0168-0072(93)90041-B_BIB33","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(79)90006-9","article-title":"Intuitionistic propositional logic is polynomial-space complete","volume":"9","author":"Statman","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(93)90041-B_BIB34","first-page":"193","article-title":"New derivability algorithm in the constructive propositional calculus","volume":"52","author":"Vorobjev","year":"1958","journal-title":"Proc. Steklov Inst. Math."},{"key":"10.1016\/0168-0072(93)90041-B_BIB35","first-page":"45","article-title":"Untersuchungen \u00fcber den Aussagenkalk\u00fcl von A. Heyting","volume":"46","author":"Wajsberg","year":"1938","journal-title":"Wiadomo\u015bci Matematyczne"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729390041B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729390041B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:02Z","timestamp":1555127642000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729390041B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["016800729390041B"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(93)90041-b","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}