{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:17:13Z","timestamp":1781893033205,"version":"3.54.5"},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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":[[1997,4]]},"DOI":"10.1016\/s0304-3975(96)00233-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"27-58","source":"Crossref","is-referenced-by-count":3,"title":["A general adequacy result for a linear functional language"],"prefix":"10.1016","volume":"177","author":[{"given":"Torben","family":"Bra\u00fcner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00233-2_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(93)90181-R","article-title":"Computational interpretations of linear logic","author":"Abramsky","year":"1990"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB2","series-title":"Full abstraction for PCF","author":"Abramsky","year":"1995"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB3","article-title":"Term assignment for intuitionistic linear logic","author":"Benton","year":"1992"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB4","article-title":"On intuitionistic linear logic","author":"Bierman","year":"1994"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB5","series-title":"Proc. CSL'94","article-title":"The girard translation extended with recursion","volume":"Vol. 933","author":"Bra\u00fcner","year":"1995"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB6","article-title":"An axiomatic approach to adequacy","author":"Bra\u00fcner","year":"1996"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB7","series-title":"9th LICS Conf., IEEE","article-title":"Plotkin, An axiomatisation of computationally adequate domain theoretic models of FPC","author":"Fiore","year":"1994"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB8","doi-asserted-by":"crossref","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\/S0304-3975(96)00233-2_BIB9","doi-asserted-by":"crossref","DOI":"10.1016\/0168-0072(93)90093-S","article-title":"On the unity of logic","volume":"59","author":"Girard","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB10","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","article-title":"The formulae-as-type notion of construction","author":"Howard","year":"1980"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB11","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(90)90165-E","article-title":"A note on inconsistencies caused by fixpoints in a cartesian closed category","volume":"73","author":"Huwig","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00233-2_BIB12","doi-asserted-by":"crossref","unstructured":"B. Jacobs, Semantics of weakening and contraction, Ann. Pure Appl. Logic, to appear.","DOI":"10.1016\/0168-0072(94)90020-5"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB13","unstructured":"F. Lamarche, Dialectics: a model of linear logic and PCF, MSCS, to appear."},{"key":"10.1016\/S0304-3975(96)00233-2_BIB14","series-title":"Category Theory, Homology Theory and their Applications II","article-title":"Diagonal arguments and cartesian closed categories","volume":"Vol. 92","author":"Lawvere","year":"1969"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB15","doi-asserted-by":"crossref","DOI":"10.1017\/S0956796800001131","article-title":"Lilac: a functional programming language based on linear logic","author":"Mackie","year":"1991"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB16","series-title":"Intuitionistic Type Theory","author":"Martin-L\u00f6f","year":"1984"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB17","series-title":"Proc. Workshop on Category Theory and Computer Programming","article-title":"Categories of partial morphisms and the partial lambda-calculus","volume":"Vol. 240","author":"Moggi","year":"1986"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB18","article-title":"Lambda-definability and logical relations","author":"Plotkin","year":"1973"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB19","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00233-2_BIB20","series-title":"8th LICS Conf., IEEE","article-title":"Type theory and recursion","author":"Plotkin","year":"1993"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB21","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537359.003.0004","article-title":"Basic category theory","author":"Poigne","year":"1992"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB22","article-title":"Continuity and effectiveness in topoi","author":"Rosolini","year":"1986"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB23","series-title":"A type theoretical alternative to CUCH, ISWIM, OWHY","author":"Scott","year":"1969"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB24","article-title":"Linear logic, \u2217-autonomous categories, and cofree coalgebras","volume":"Vol. 92","author":"Seely","year":"1989"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB25","series-title":"There's no substitute for linear logic","author":"Wadler","year":"1991"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB26","series-title":"Proc. MFCS'93","article-title":"A taste of linear logic","volume":"Vol. 711","author":"Wadler","year":"1993"},{"key":"10.1016\/S0304-3975(96)00233-2_BIB27","series-title":"The Formal Semantics of Programming Languages","author":"Winskel","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002332?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002332?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T23:43:01Z","timestamp":1704152581000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0304397596002332"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00233-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}