{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T04:10:34Z","timestamp":1743221434181,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298219"},{"type":"electronic","value":"9783642298226"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29822-6_13","type":"book-chapter","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T13:21:09Z","timestamp":1337520069000},"page":"136-150","source":"Crossref","is-referenced-by-count":0,"title":["Correct Looping Arrows from Cyclic Terms"],"prefix":"10.1007","author":[{"given":"Makoto","family":"Hamana","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1051\/ita:2003020","volume":"37","author":"N. Benton","year":"2003","unstructured":"Benton, N., Hyland, M.: Traced premonoidal categories. Theoretical Informatics and Applications\u00a037(4), 273\u2013299 (2003)","journal-title":"Theoretical Informatics and Applications"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Crole, R.L.: Categories for Types. Cambridge Mathematical Textbook (1993)","DOI":"10.1017\/CBO9781139172707"},{"key":"13_CR3","unstructured":"Ghani, N., Hamana, M., Uustalu, T., Vene, V.: Representing cyclic structures as nested datatypes. In: Proceedings of Trends in Functional Programming, pp. 173\u2013188 (2006)"},{"key":"13_CR4","unstructured":"Hasegawa, M.: Models of Sharing Graphs: A Categorical Semantics of let and letrec. PhD thesis, University of Edinburgh (1997)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Heunen, C., Jacobs, B.: Arrows, like monads, are monoids. In: Proc. of MFPS 22. ENTCS, vol.\u00a0158, pp. 219\u2013236 (2006)","DOI":"10.1016\/j.entcs.2006.04.012"},{"issue":"1-3","key":"13_CR6","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. Comput. Program.\u00a037(1-3), 67\u2013111 (2000)","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0305004100074338","volume":"119","author":"A. Joyal","year":"1996","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society\u00a0119(3), 447\u2013468 (1996)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1017\/S095679680999027X","volume":"20","author":"S. Lindley","year":"2010","unstructured":"Lindley, S., Wadler, P., Yallop, J.: The arrow calculus. Journal of Functional Programming\u00a020(1), 51\u201369 (2010)","journal-title":"Journal of Functional Programming"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Paterson, R.: A new notation for arrows. In: Proc. of ICFP 2001, pp. 229\u2013240 (2001)","DOI":"10.1145\/507669.507664"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Paterson, R.: Arrows and computation. In: The Fun of Programming, Cornerstones of Computing, pp. 201\u2013222. Palgrave Macmillan (2003)","DOI":"10.1007\/978-1-349-91518-7_10"},{"issue":"5","key":"13_CR11","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. Mathematical Structures in Computer Science\u00a07(5), 453\u2013468 (1997)","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/3-540-48523-6_59","volume-title":"Automata, Languages and Programming","author":"J. Power","year":"1999","unstructured":"Power, J., Thielecke, H.: Closed Freyd- and \u03ba-categories. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 625\u2013634. Springer, Heidelberg (1999)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Simpson, A.K., Plotkin, G.D.: Complete axioms for categorical fixed-point operators. In: Proc. of LICS 2000, pp. 30\u201341 (2000)","DOI":"10.1109\/LICS.2000.855753"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29822-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:21:53Z","timestamp":1743157313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29822-6_13"}},"subtitle":["Traced Categorical Interpretation in Haskell"],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298219","9783642298226"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29822-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}