{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:28:44Z","timestamp":1767929324210,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642381638","type":"print"},{"value":"9783642381645","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38164-5_13","type":"book-chapter","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T17:59:00Z","timestamp":1367344740000},"page":"178-194","source":"Crossref","is-referenced-by-count":14,"title":["Presheaf Models of Quantum Computation: An Outline"],"prefix":"10.1007","author":[{"given":"Octavio","family":"Malherbe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip","family":"Scott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Selinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: Proc. 19th Annual IEEE Symp. on Logic in Computer Science (LICS 2004), pp. 415\u2013425. IEEE Computer Soc. Press (2004)","DOI":"10.1109\/LICS.2004.1319636"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0022251","volume-title":"Computer Science Logic","author":"N. Benton","year":"1995","unstructured":"Benton, 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":"13_CR3","unstructured":"Bierman, G.: On intuitionistic linear logic. Ph.D. thesis, Computer Science department, Cambridge University (1993)"},{"key":"13_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. Bierman","year":"1995","unstructured":"Bierman, G.: 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":"13_CR5","doi-asserted-by":"crossref","unstructured":"Borceux, F.: Handbook of Categorical Algebra 1. Cambridge University Press (1994)","DOI":"10.1017\/CBO9780511525865"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Day, B.: On closed categories of functors. Lecture Notes in Math., vol.\u00a0137, pp. 1\u201338. Springer (1970)","DOI":"10.1007\/BFb0060438"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-4049(72)90021-7","volume":"2","author":"B. Day","year":"1972","unstructured":"Day, B.: A reflection theorem for closed categories. J. Pure Appl. Algebra\u00a02, 1\u201311 (1972)","journal-title":"J. Pure Appl. Algebra"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0004972700045433","volume":"8","author":"B. Day","year":"1973","unstructured":"Day, B.: Note on monoidal localisation. Bull. Austral. Math. Soc.\u00a08, 1\u201316 (1973)","journal-title":"Bull. Austral. Math. Soc."},{"key":"13_CR9","unstructured":"Day, B.: Monoidal functor categories and graphic Fourier transforms, ArXiv:math\/0612496 (2006)"},{"issue":"4","key":"13_CR10","first-page":"72","volume":"1","author":"B. Day","year":"1995","unstructured":"Day, B., Street, R.: Kan extensions along promonoidal functors. Theory and Applications of Categories\u00a01(4), 72\u201378 (1995)","journal-title":"Theory and Applications of Categories"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0022-4049(72)90001-1","volume":"2","author":"P. Freyd","year":"1972","unstructured":"Freyd, P., Kelly, G.M.: Categories of continuous functors I. J. Pure and Appl. Algebra\u00a02, 169\u2013191 (1972)","journal-title":"J. Pure and Appl. Algebra"},{"issue":"1","key":"13_CR12","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), 1\u2013101 (1987)","journal-title":"Theoretical Computer Science"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0022-4049(86)90005-8","volume":"43","author":"G.B. Im","year":"1986","unstructured":"Im, G.B., Kelly, G.M.: A universal property of the convolution monoidal structure. J. Pure and Appl. Algebra\u00a043, 75\u201388 (1986)","journal-title":"J. Pure and Appl. Algebra"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Kelly, G.M.: Doctrinal adjunction. Lecture Notes in Math., vol.\u00a0420, pp. 257\u2013280. Springer (1974)","DOI":"10.1007\/BFb0063105"},{"key":"13_CR15","unstructured":"Kelly, G.M.: Basic Concepts of Enriched Category Theory. LMS Lecture Notes, vol.\u00a064. Cambridge University Press (1982)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01220868","volume":"21","author":"A. Kock","year":"1970","unstructured":"Kock, A.: Monads on symmetric monoidal closed categories. Arch. Math.\u00a021, 1\u201310 (1970)","journal-title":"Arch. Math."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Kock, A.: Strong functors and monoidal monads. Archiv der Mathematik 23 (1972)","DOI":"10.1007\/BF01304852"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Lambek, J.: Completions of Categories. Lecture Notes in Math., vol.\u00a024. Springer (1966)","DOI":"10.1007\/BFb0077270"},{"key":"13_CR19","unstructured":"Lambek, J., Scott, P.J.: Introduction to Higher Order Categorical Logic. Cambridge University Press (1986)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Laplaza, M.L.: Coherence for distributivity. Lecture Notes in Math., vol.\u00a0281, pp. 29\u201365. Springer (1972)","DOI":"10.1007\/BFb0059555"},{"key":"13_CR21","unstructured":"Mac Lane, S.: Categories for the Working Mathematician, 2nd edn. Springer (1998)"},{"key":"13_CR22","unstructured":"Malherbe, O.: Categorical models of computation: partially traced categories and presheaf models of quantum computation. Ph.D. thesis, University of Ottawa (2010), Available from arXiv:1301.5087"},{"key":"13_CR23","unstructured":"Melli\u00e8s, P.-A.: Categorical models of linear logic revisited (2002) (Preprint), Appeared as: Categorical semantics of linear logic. In: Curien, P.-L., Herbelin, H., Krivine, J.-L., Melli\u00e8s, P.-A. (eds.) Interactive Models of Computation and Program Behaviour. Panoramas et Synth\u00e8ses, vol. 27. Soci\u00e9t\u00e9 Math\u00e9matique de France (2009)"},{"key":"13_CR24","unstructured":"Moggi, E.: Computational lambda-calculus and monads. Technical Report ECS-LFCS-88-66, Lab. for Foundations of Computer Science, U. Edinburgh (1988)"},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Information and Computation\u00a093(1), 55\u201392 (1991)","journal-title":"Information and Computation"},{"key":"13_CR26","unstructured":"Nielsen, A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Seely, R.: Linear logic, *-autonomous categories and cofree coalgebras. In: Gray, J.W., Scedrov, A. (eds.) Categories in Computer Science and Logic. Contemporary Mathematics, vol.\u00a092, pp. 371\u2013382. Amer. Math. Soc. (1989)","DOI":"10.1090\/conm\/092\/1003210"},{"issue":"4","key":"13_CR28","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0960129504004256","volume":"14","author":"P. Selinger","year":"2004","unstructured":"Selinger, P.: Towards a quantum programming language. Math. Structures in Comp. Sci.\u00a014(4), 527\u2013586 (2004)","journal-title":"Math. Structures in Comp. Sci."},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Selinger, P.: Dagger compact closed categories and completely positive maps. In: Selinger, P. (ed.) Proceedings of the Third International Workshop on Quantum Programming Languages (QPL 2005), Chicago. ENTCS, vol.\u00a0170, pp. 139\u2013163 (2007)","DOI":"10.1016\/j.entcs.2006.12.018"},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0960129506005238","volume":"16","author":"P. Selinger","year":"2006","unstructured":"Selinger, P., Valiron, B.: A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science\u00a016, 527\u2013552 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Selinger, P., Valiron, B.: On a fully abstract model for a quantum functional language. In: Proceedings of the Fourth International Workshop on Quantum Programming Languages. ENTCS, vol.\u00a0210, pp. 123\u2013137. Springer (2008)","DOI":"10.1016\/j.entcs.2008.04.022"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-540-78499-9_7","volume-title":"Foundations of Software Science and Computational Structures","author":"P. Selinger","year":"2008","unstructured":"Selinger, P., Valiron, B.: A linear-non-linear model for a computational call-by-value lambda calculus (Extended abstract). In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 81\u201396. Springer, Heidelberg (2008)"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Selinger, P., Valiron, B.: Quantum lambda calculus. In: Gay, S., Mackie, I. (eds.) Semantic Techniques in Quantum Computation, pp. 135\u2013172. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139193313.005"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Goldwasser, S. (ed.) Proc. 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE Computer Society Press (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"13_CR35","unstructured":"Valiron, B.: Semantics for a higher order functional programming language for quantum computation. Ph.D. thesis, University of Ottawa (2008)"}],"container-title":["Lecture Notes in Computer Science","Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38164-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T07:35:39Z","timestamp":1745998539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38164-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381638","9783642381645"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38164-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}