{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:27Z","timestamp":1720624947016},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0661(04)81008-9","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"100-111","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Linearity and Passivity"],"prefix":"10.1016","volume":"78","author":[{"given":"David A.","family":"Wright","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Abransky S. and G. McCusker, Linearity, Sharing and state; A fully abstract game semantics for idealised algol with active expressions, in: Linear Logic, Electronic Notes in Theoretical Computer Science 3 (1993).","DOI":"10.1016\/S1571-0661(05)80398-6"},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB2","unstructured":"Barendsen E. and S Smetsers, Conventional and uniqueness typing in graph rewriting systems, Foundations of Software Technology and Theoretically Computer Science, (1996)."},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB3","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1996.561458","article-title":"Linear logic, monads and the lambda calculus","author":"Benton","year":"1996","journal-title":"Logic in Computer Science"},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB4","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB5","unstructured":"Girard J.Y., On the logic of unity (1991), manuscript."},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB6","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1093\/comjnl\/32.2.98","article-title":"Why functional programming matters","volume":"32","author":"Hughes","year":"1989","journal-title":"Computer Journal"},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB7","doi-asserted-by":"crossref","unstructured":"O'Hearn, P.W., A.J. Power, M. Takeyama and R.D. Tennant, Syntactic control of interference revisted, in: Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science 1 (1995).","DOI":"10.1016\/S1571-0661(04)00026-X"},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB8","series-title":"Algol-like Languages 1","year":"1997"},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB9","series-title":"Algol-like Languages 2","year":"1997"},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB10","series-title":"Logic in Computer Science","article-title":"Type theory and recursion","author":"Plotkin","year":"1993"},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB11","doi-asserted-by":"crossref","unstructured":"Swarup V., U.S. Reddy and E. Ireland, Assignments for applicative languages, in: Functional programming and Computer Architecture, Lecture Notes in Computer Science 523 (1991).","DOI":"10.1007\/3540543961_10"},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB12","series-title":"Theory and Practice of Software Developoment, Lecture Notes in Computer Science 494","doi-asserted-by":"crossref","DOI":"10.1007\/3540539816_70","article-title":"A New Technique for Strictness A Analysis","author":"Wright","year":"1991"},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB13","article-title":"An intensional type discipline","volume":"14","author":"Wright","year":"1992","journal-title":"Australian Computer Science Communications"},{"key":"10.1016\/S1571-0661(04)81008-9_NEWBIB14","unstructured":"Wright, D. A., Linear, strictness and usage logics, Computing: the Australian Theory Symposium 1, 1996."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810089?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810089?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T07:41:46Z","timestamp":1682754106000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104810089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":14,"alternative-id":["S1571066104810089"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81008-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}