{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:12:07Z","timestamp":1774987927512,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642120312","type":"print"},{"value":"9783642120329","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_21","type":"book-chapter","created":{"date-parts":[[2010,3,7]],"date-time":"2010-03-07T20:07:56Z","timestamp":1267992476000},"page":"297-311","source":"Crossref","is-referenced-by-count":35,"title":["Monads Need Not Be Endofunctors"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Altenkirch","sequence":"first","affiliation":[]},{"given":"James","family":"Chapman","sequence":"additional","affiliation":[]},{"given":"Tarmo","family":"Uustalu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.002","volume":"342","author":"M. Abbott","year":"2005","unstructured":"Abbott, M., Altenkirch, T., Ghani, N.: Containers\u2014constructing strictly positive types. Theor. Comput. Sci.\u00a0342(1), 3\u201327 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/LICS.2004.1319636","volume-title":"Proc. of 19th Ann. IEEE Symp. on Logic in Computer Science, LICS 2004","author":"S. Abramsky","year":"2004","unstructured":"Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: Proc. of 19th Ann. IEEE Symp. on Logic in Computer Science, LICS 2004, pp. 415\u2013425. IEEE CS Press, Los Alamitos (2004)"},{"key":"21_CR3","unstructured":"Agda\u00a0team: Agda (2009), \n                    \n                      http:\/\/appserv.cs.chalmers.se\/users\/ulfn\/wiki\/agda.php"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1017\/CBO9781139193313.006","volume-title":"Semantic Techniques in Quantum Computation","author":"T. Altenkirch","year":"2009","unstructured":"Altenkirch, T., Green, A.: The Quantum IO Monad. In: Gay, S., McKie, I. (eds.) Semantic Techniques in Quantum Computation, pp. 173\u2013205. Cambridge Univ. Press, Cambridge (2009)"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-48168-0_32","volume-title":"Computer Science Logic","author":"T. Altenkirch","year":"1999","unstructured":"Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 453\u2013468. Springer, Heidelberg (1999)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/571157.571161","volume-title":"Proc. of 4th ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming, PPDP\u00a02002","author":"M. Fiore","year":"2002","unstructured":"Fiore, M.: Semantic analysis of normalisation by evaluation for typed lambda calculus. In: Proc. of 4th ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming, PPDP\u00a02002, pp. 26\u201337. ACM Press, New York (2002)"},{"key":"21_CR7","first-page":"193","volume-title":"Proc. of 14th Ann. IEEE Symp. on Logic in Computer Science, LICS\u00a01999","author":"M. Fiore","year":"1999","unstructured":"Fiore, M., Plotkin, G., Turi, D.: Abstract syntax and variable binding. In: Proc. of 14th Ann. IEEE Symp. on Logic in Computer Science, LICS\u00a01999, pp. 193\u2013202. IEEE CS Press, Los Alamitos (1999)"},{"key":"21_CR8","series-title":"Electron. Notes in Theor. Comput. Sci","first-page":"219","volume-title":"Proc. of 22nd Ann. Conf. on Mathematical Foundations of Programming Semantics, MFPS XXII","author":"C. Heunen","year":"2006","unstructured":"Heunen, C., Jacobs, B.: Arrows, like monads, are monoids. In: Brookes, S., Mislove, M. (eds.) Proc. of 22nd Ann. Conf. on Mathematical Foundations of Programming Semantics, MFPS XXII. Electron. Notes in Theor. Comput. Sci, vol.\u00a0158, pp. 219\u2013236. Elsevier, Amsterdam (2006)"},{"issue":"1-3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0167-6423(99)00023-4","volume":"37","author":"J. Hughes","year":"2000","unstructured":"Hughes, J.: Generalising monads to arrows. Sci. of Comput. Program.\u00a037(1-3), 67\u2013111 (2000)","journal-title":"Sci. of Comput. Program."},{"issue":"3-4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0956796809007308","volume":"19","author":"B. Jacobs","year":"2009","unstructured":"Jacobs, B., Heunen, C., Hasuo, I.: Categorical semantics for arrows. J. of Funct. Program.\u00a019(3-4), 403\u2013438 (2009)","journal-title":"J. of Funct. Program."},{"key":"21_CR11","unstructured":"Jaskelioff, M.: Lifting of Operations in Modular Monadic Semantics. PhD thesis, University of Nottingham (2009)"},{"key":"21_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9860-1","volume-title":"Algebraic Theories","author":"E.G. Manes","year":"1976","unstructured":"Manes, E.G.: Algebraic Theories. Springer, Heidelberg (1976)"},{"issue":"1","key":"21_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0956796807006326","volume":"18","author":"C. McBride","year":"2008","unstructured":"McBride, C., Paterson, R.: Applicative programming with effects. J. of Funct. Program.\u00a018(1), 1\u201313 (2008)","journal-title":"J. of Funct. Program."},{"key":"21_CR14","first-page":"277","volume-title":"Proc. of 24th Ann. IEEE Symp. on Logic in Computer Science, LICS\u00a02009","author":"P. Morris","year":"2009","unstructured":"Morris, P., Altenkirch, T.: Indexed containers. In: Proc. of 24th Ann. IEEE Symp. on Logic in Computer Science, LICS\u00a02009, pp. 277\u2013285. IEEE CS Press, Los Alamitos (2009)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/1596550.1596553","volume-title":"Proc. of 14th Int. Conf. on Functinal Programming, ICFP 2009","author":"D. Piponi","year":"2009","unstructured":"Piponi, D.: Commutative monads, diagrams and knots. In: Proc. of 14th Int. Conf. on Functinal Programming, ICFP 2009, p. 231. ACM Press, New York (2009) (see the video)"},{"issue":"5","key":"21_CR16","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1017\/S0960129597002375","volume":"7","author":"J. Power","year":"1997","unstructured":"Power, J., Robinson, E.: Premonoidal categories and notions of computation. Math. Struct. in Comput. Sci.\u00a07(5), 453\u2013468 (1997)","journal-title":"Math. Struct. in Comput. Sci."},{"issue":"3-4","key":"21_CR17","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1017\/S0956796809007321","volume":"19","author":"J.M. Spivey","year":"2009","unstructured":"Spivey, J.M.: Algebras for combinatorial search. J. of Funct. Program.\u00a019(3-4), 469\u2013487 (2009)","journal-title":"J. of Funct. Program."},{"key":"21_CR18","series-title":"Electron. Notes in Theor. Comput. Sci.","first-page":"263","volume-title":"Proc. of 9th Int. Wksh. on Coalgebraic Methods in Computer Science, CMCS 2008","author":"T. Uustalu","year":"2008","unstructured":"Uustalu, T., Vene, V.: Comonadic notions of computation. In: Adam\u00e9k, J., Kupke, C. (eds.) Proc. of 9th Int. Wksh. on Coalgebraic Methods in Computer Science, CMCS 2008. Electron. Notes in Theor. Comput. Sci., vol.\u00a0203(5), pp. 263\u2013284. Elsevier, Amsterdam (2008)"},{"issue":"3","key":"21_CR19","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1017\/S0960129506005287","volume":"16","author":"J.K. Vizzotto","year":"2006","unstructured":"Vizzotto, J.K., Altenkirch, T., Sabry, A.: Structuring quantum effects: Superoperators as arrows. Math. Struct. in Comput. Sci.\u00a016(3), 453\u2013468 (2006)","journal-title":"Math. Struct. in Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:47:01Z","timestamp":1606168021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}