{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:29:13Z","timestamp":1778300953985,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540565178","type":"print"},{"value":"9783540475866","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bfb0037099","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:21:36Z","timestamp":1138184496000},"page":"75-90","source":"Crossref","is-referenced-by-count":89,"title":["A term calculus for Intuitionistic Linear Logic"],"prefix":"10.1007","author":[{"given":"Nick","family":"Benton","sequence":"first","affiliation":[]},{"given":"Gavin","family":"Bierman","sequence":"additional","affiliation":[]},{"given":"Valeria","family":"de Paiva","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Hyland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,28]]},"reference":[{"key":"6_CR1","volume-title":"Technical Report 90\/20","author":"S. Abramsky","year":"1990","unstructured":"Samson Abramsky. Computational interpretations of linear logic. Technical Report 90\/20, Department of Computing, Imperial College, London, October 1990."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Nick Benton, Gavin Bierman, Valeria de Paiva, and Martin Hyland. Term assignment for intuitionistic linear logic. Technical Report 262, Computer Laboratory, University of Cambridge, August 1992.","DOI":"10.1007\/BFb0037099"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J. Girard","year":"1987","unstructured":"Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1\u2013101, 1987.","journal-title":"Theoretical Computer Science"},{"key":"6_CR4","unstructured":"Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(92)90386-T","volume":"97","author":"J. Girard","year":"1992","unstructured":"Jean-Yves Girard, Andre Scedrov, and Philip Scott. Bounded linear logic: A modular approach to polynomial time computability. Theoretical Computer Science, 97:1\u201366, 1992.","journal-title":"Theoretical Computer Science"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Patrick Lincoln and John Mitchell. Operational aspects of linear lambda calculus. In Proceedings of Symposium on Logic in Computer Science, pages 235\u2013246, June 1992.","DOI":"10.1109\/LICS.1992.185536"},{"key":"6_CR7","volume-title":"Master's thesis","author":"I. Mackie","year":"1991","unstructured":"Ian Mackie. Lilac: A functional programming language based on linear logic. Master's thesis, Department of Computing, Imperial College, London, September 1991."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"P.W. O'Hearn. Linear logic and interference control (preliminary report). In Proceedings of Conference on Category Theory and Computer Science, volume 530 of Lecture Notes in Computer Science, pages 74\u201393, September 1991.","DOI":"10.1007\/BFb0013458"},{"key":"6_CR9","unstructured":"Dag Prawitz. Natural Deduction, volume 3 of Stockholm Studies in Philosophy. Almqvist and Wiksell, 1965."},{"issue":"4","key":"6_CR10","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.2307\/2274279","volume":"49","author":"P. Schroeder-Heister","year":"1984","unstructured":"Peter Schroeder-Heister. A natural extension of natural deduction. The Journal of Symbolic Logic, 49(4):1284\u20131300, December 1984.","journal-title":"The Journal of Symbolic Logic"},{"key":"6_CR11","unstructured":"M.E. Szabo, editor. The Collected Papers of Gerhard Gentzen. North-Holland, 1969."},{"key":"6_CR12","unstructured":"Philip Wadler. There's no substitute for linear logic. Draft Paper, December 1991."}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037099","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T10:37:01Z","timestamp":1555411021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565178","9783540475866"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0037099","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}