{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:30:04Z","timestamp":1775097004127,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540749141","type":"print"},{"value":"9783540749158","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_32","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"420-434","source":"Crossref","is-referenced-by-count":3,"title":["Linear Realizability"],"prefix":"10.1007","author":[{"given":"Naohiko","family":"Hoshino","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"32_CR1","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1017\/S0960129502003730","volume":"12","author":"S. Abramsky","year":"2002","unstructured":"Abramsky, S., Haghverdi, E., Scott, P.J.: Geometry of interaction and linear combinatory algebras. Mathematical Structures in Computer Science\u00a012(5), 625\u2013665 (2002)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2-3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.apal.2004.08.003","volume":"134","author":"S. Abramsky","year":"2005","unstructured":"Abramsky, S., Lenisa, M.: Linear realizability and full completeness for typed lambda-calculi. Ann. Pure Appl. Logic\u00a0134(2-3), 122\u2013168 (2005)","journal-title":"Ann. Pure Appl. Logic"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0022251","volume-title":"Computer Science Logic","author":"P.N. Benton","year":"1995","unstructured":"Benton, P.N.: A mixed linear and non-linear logic: Proofs, terms and models (extended abstract). In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, pp. 121\u2013135. Springer, Heidelberg (1995)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BFb0014046","volume-title":"Typed Lambda Calculi and Applications","author":"G.M. Bierman","year":"1995","unstructured":"Bierman, G.M.: What is a categorical model of intuitionistic linear logic? In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, pp. 78\u201393. Springer, Heidelberg (1995)"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BFb0037106","volume-title":"Typed Lambda Calculi and Applications","author":"J.M.E. Hyland","year":"1993","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: Modified realizability toposes and strong normalization proofs. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 179\u2013194. Springer, Heidelberg (1993)"},{"key":"32_CR6","unstructured":"Hoshino, N.: Linear realizability. Master\u2019s thesis, Kyoto University (2007)"},{"key":"32_CR7","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Categorical Logic and Type Theory","year":"1999","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0141. North Holland, Amsterdam (1999)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Math. Proc. Cambridge Phil. Soc.\u00a0119(3) (1996)","DOI":"10.1017\/S0305004100074338"},{"key":"32_CR9","volume-title":"The Foundations of Intuitionistic Mathematics, especially in relation to recursive functions.","author":"S.C. Kleene","year":"1965","unstructured":"Kleene, S.C., Vesley, R.E.: The Foundations of Intuitionistic Mathematics, especially in relation to recursive functions. North-Holland, Amsterdam (1965)"},{"issue":"1-2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2003.10.018","volume":"318","author":"Y. Lafont","year":"2004","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. Theor. Comput. Sci.\u00a0318(1-2), 163\u2013180 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR11","unstructured":"Longley, J.: Realizability Toposes and Language Semantics. PhD thesis, Edinburgh University (1995)"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-32033-3_17","volume-title":"Term Rewriting and Applications","author":"A.K. Simpson","year":"2005","unstructured":"Simpson, A.K.: Reduction in a linear lambda-calculus with applications to operational semantics. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 219\u2013234. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:45:53Z","timestamp":1619520353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}