{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:57Z","timestamp":1761611157128,"version":"build-2065373602"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6419,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1996]]},"DOI":"10.1016\/s1571-0661(05)80399-8","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"15-27","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Towards a Classical Linear \u03bb-calculus (Preliminary Report)"],"prefix":"10.1016","volume":"3","author":[{"given":"G.M.","family":"Bierman","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80399-8_BIB1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0168-0072(95)00004-Z","article-title":"A strong normalisation result for classical logic","volume":"76","author":"Barbanera","year":"1995","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(05)80399-8_BIB2","doi-asserted-by":"crossref","unstructured":"P.N. Benton, G.M. Bierman, V.C.V. de Paiva, and J.M.E. Hyland. A term calculus for intuitionistic linear logic. In M. Bezem and J.F. Groote, editors, Proceedings of First International Conference on Typed \u03bb-calculi and applications, volume 664 of Lecture Notes in Computer Science, pages 75\u201390, 1993.","DOI":"10.1007\/BFb0037099"},{"key":"10.1016\/S1571-0661(05)80399-8_BIB3","series-title":"PhD thesis, Computer Laboratory, University of Cambridge, December 1993. Published as Computer Laboratory Technical Report 346","article-title":"On Intuitionistic Linear Logic","author":"Bierman","year":"1994"},{"key":"10.1016\/S1571-0661(05)80399-8_BIB4","doi-asserted-by":"crossref","unstructured":"G.M. Bierman. What is a categorical model of intuitionistic linear logic? In Proceedings of Second International Conference on Typed \u03bb-calculi and applications, volume 902 of Lecture Notes in Computer Science, pages 78-93, April 1995. Previously available as Technical Report 333, University of Cambridge Computer Laboratory, March 1994.","DOI":"10.1007\/BFb0014046"},{"key":"10.1016\/S1571-0661(05)80399-8_BIB5","article-title":"A classical linear \u03bb-calculus","author":"Bierman","year":"1996","journal-title":"Cambridge Computer Laboratory Technical Report, to appear"},{"key":"10.1016\/S1571-0661(05)80399-8_BIB6","doi-asserted-by":"crossref","unstructured":"M. Felleisen. The theory and practice of first-class prompts. In Proceedings of Symposium on Principles of Programming Languages, pages 180\u2013190, January 1988.","DOI":"10.1145\/73560.73576"},{"key":"10.1016\/S1571-0661(05)80399-8_BIB7","doi-asserted-by":"crossref","unstructured":"A. Filinski. Linear continuations. In Proceedings of Symposium on Principles of Programming Languages, pages 27\u201338, January 1992.","DOI":"10.1145\/143165.143174"},{"key":"10.1016\/S1571-0661(05)80399-8_BIB8","series-title":"volume 7 of Cambridge Tracts in Theoretical Computer Science.","article-title":"Proofs and Types","author":"Girard","year":"1989"},{"key":"10.1016\/S1571-0661(05)80399-8_BIB9","article-title":"A semantic view of classical proofs: type-theoretic, categorical and denotational characterizations","author":"Ong","year":"1995","journal-title":"To appear in LICS'96, December"},{"key":"10.1016\/S1571-0661(05)80399-8_BIB10","doi-asserted-by":"crossref","unstructured":"M. Parigot. \u03bb\u03bc-calculus: an algorithmic interpretation of classical natural deduction. In Proceedings of Conference on Logic Programming and Automated Reasoning, volume 624 of Lecture Notes in Computer Science, pages 190-201, 1992.","DOI":"10.1007\/BFb0013061"},{"key":"10.1016\/S1571-0661(05)80399-8_BIB11","series-title":"volume 3 of Stockholm Studies in Philosophy.","article-title":"Natural Deduction","author":"Prawitz","year":"1965"},{"key":"10.1016\/S1571-0661(05)80399-8_BIB12","doi-asserted-by":"crossref","unstructured":"D. Prawitz. Ideas and results in proof theory. In J.E. Fenstad, editor, Proceedings of Second Scandinavian Logic Symposium, pages 235\u2013307, 1971.","DOI":"10.1016\/S0049-237X(08)70849-8"},{"year":"1978","series-title":"Multiple-Conclusion Logic","author":"Shoesmith","key":"10.1016\/S1571-0661(05)80399-8_BIB13"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803998?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803998?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:06Z","timestamp":1761610146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803998"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"references-count":13,"alternative-id":["S1571066105803998"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80399-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Towards a Classical Linear \u03bb-calculus (Preliminary Report)","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80399-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}