{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:00:37Z","timestamp":1725487237204},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727323"},{"type":"electronic","value":"9783540727347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72734-7_33","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T09:40:50Z","timestamp":1183023650000},"page":"472-485","source":"Crossref","is-referenced-by-count":3,"title":["Multiplexor Categories and Models of Soft Linear Logic"],"prefix":"10.1007","author":[{"given":"Brian F.","family":"Redmond","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","first-page":"1","volume-title":"Proceedings of the 1996 CLiCS Summer School, Isaac Newton Institute","author":"S. Abramsky","year":"1997","unstructured":"Abramsky, S.: Semantics of Interaction: an introduction to Game Semantics. In: Dybjer, P., Pitts, A. (eds.) Proceedings of the 1996 CLiCS Summer School, Isaac Newton Institute, pp. 1\u201331. Cambridge University Press, Cambridge (1997)"},{"key":"33_CR2","unstructured":"Abramsky, S.: Predicative Copying and Polynomial Time. Clifford Lectures, Tulane (2002), Slides available at: \n                  \n                    http:\/\/web.comlab.ox.ac.uk\/oucl\/work\/samson.abramsky\/pcpt.pdf"},{"issue":"1-2","key":"33_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2003.10.015","volume":"318","author":"P. Baillot","year":"2004","unstructured":"Baillot, P.: Stratified coherence spaces: a denotational semantics for Light Linear Logic. Theoretical Computer Science\u00a0318(1-2), 29\u201355 (2004)","journal-title":"Theoretical Computer Science"},{"key":"33_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":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11590156_15","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"U. Lago Dal","year":"2005","unstructured":"Dal Lago, U., Hofmann, M.: Quantitative Models and Implicit Complexity. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 189\u2013200. Springer, Heidelberg (2005)"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J.-Y. Girard","year":"1998","unstructured":"Girard, J.-Y.: Light Linear Logic. Information and Computation\u00a0143, 175\u2013204 (1998)","journal-title":"Information and Computation"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(92)90386-T","volume":"97","author":"J.-Y. Girard","year":"1992","unstructured":"Girard, J.-Y., Scedrov, A., Scott, P.J.: Bounded linear logic: a modular approach to polynomial-time computability. Theoretical Computer Science\u00a097, 1\u201366 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"33_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.tcs.2003.10.019","volume":"318","author":"M. Hofmann","year":"2004","unstructured":"Hofmann, M., Scott, P.J.: Realizability Models for BLL-like Languages. Theoretical Computer Science\u00a0318(1-2), 121\u2013137 (2004)","journal-title":"Theoretical Computer Science"},{"key":"33_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. Theoretical Computer Science\u00a0318, 163\u2013180 (2004)","journal-title":"Theoretical Computer Science"},{"key":"33_CR11","first-page":"179","volume-title":"Proceedings of LICS","author":"O. Laurent","year":"2006","unstructured":"Laurent, O., Tortora de Falco, L.: Obsessional cliques: a semantic characterization of bounded time complexity. In: Proceedings of LICS, pp. 179\u2013188. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"33_CR12","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1998","unstructured":"Mac Lane, S.: Categories for the Working Mathematician, 2nd edn. Springer, Heidelberg (1998)","edition":"2"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-540-45208-9_4","volume-title":"Theoretical Computer Science","author":"H. Mairson","year":"2003","unstructured":"Mairson, H., Terui, K.: On the Computational Complexity of Cut-Elimination in Linear Logic. In: Blundo, C., Laneve, C. (eds.) ICTCS 2003. LNCS, vol.\u00a02841, pp. 23\u201336. Springer, Heidelberg (2003)"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/3-540-44622-2_29","volume-title":"Computer Science Logic","author":"A.S. Murawski","year":"2000","unstructured":"Murawski, A.S., Ong, C.-H.L.: Discreet Games, Light Affine Logic and PTIME Computation. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 427\u2013441. Springer, Heidelberg (2000)"},{"key":"33_CR15","unstructured":"Redmond, B.F.: PhD Thesis. University of Ottawa. In preparation"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72734-7_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:47:01Z","timestamp":1619516821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72734-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727323","9783540727347"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72734-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}