{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T17:55:03Z","timestamp":1693850103269},"reference-count":39,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4429,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00127-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"165-207","source":"Crossref","is-referenced-by-count":9,"title":["Fusion of recursive programs with computational effects"],"prefix":"10.1016","volume":"260","author":[{"given":"Alberto","family":"Pardo","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00127-4_BIB1","first-page":"1","article-title":"Domain theory","volume":"vol. 3","author":"Abramsky","year":"1994"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB2","volume":"vol. 1608","author":"Augusteijn","year":"1999"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB3","volume":"vol. 1608","author":"Backhouse","year":"1999"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB4","series-title":"Introduction to Functional Programming using Haskell","author":"Bird","year":"1998"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB5","series-title":"Algebra of Programming","author":"Bird","year":"1997"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB6","unstructured":"M.M. Fokkinga, Law and order in algorithmics, Ph. D. Thesis, Universiteit Twente, The Netherlands, 1992."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB7","unstructured":"M.M. Fokkinga, Monadic maps and folds for arbitrary datatypes, Memoranda Informatica 94-28, University of Twente, June 1994."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB8","doi-asserted-by":"crossref","unstructured":"P. Freyd, Recursive types reduced to inductive types, 5th IEEE Symp. on Logic in Computer Science, 1990, pp. 498\u2013507.","DOI":"10.1109\/LICS.1990.113772"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB9","doi-asserted-by":"crossref","unstructured":"J. Gibbons, G. Jones, The under-appreciated unfold, Proc. 3rd ACM SIGPLAN Internat. Conf. on Functional Programming, ACM, New York, September 1998.","DOI":"10.1145\/289423.289455"},{"issue":"1","key":"10.1016\/S0304-3975(00)00127-4_BIB10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1017\/S096012950000013X","article-title":"The theory of semi-functors","volume":"3","author":"Hoofman","year":"1993","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB11","unstructured":"Z. Hu, H. Iwasaki, Promotional transformation of monadic programs, Fuji International Workshop on Functional and Logic Programming, World Scientific, Singapore, July 1995, pp. 196\u2013210, available from http:\/\/www.ipl.t.u-tokyo.ac.jp\/\u00a0\u0303hu\/."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB12","doi-asserted-by":"crossref","unstructured":"G. Hutton, Fold and unfold for program semantics, Proc. 3rd ACM SIGPLAN Internat. Conf. on Functional Programming, ACM, New York, September 1998.","DOI":"10.1145\/289423.289457"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB13","unstructured":"H. Iwasaki, Z. Hu, M. Takeichi, Towards manipulation of mutually recursive functions, 3rd Fuji Internat. Symp. on Functional and Logic Programming (FLOPS\u201998), World Scientific, Singapore, April 1998, available from http:\/\/www.ipl.t.u-tokyo.ac.jp\/\u00a0\u0303hu\/."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB14","first-page":"222","article-title":"A Tutorial on (Co)Algebras and (Co)Induction","volume":"62","author":"Jacobs","year":"1997","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB15","unstructured":"J. Jeuring, Theories for algorithm calculation, Ph.D. Thesis, Utrecht University, 1993."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB16","article-title":"Polytypic programming","volume":"vol. 1129","author":"Jeuring","year":"1996"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01752392","article-title":"Algebraic specification of data types","volume":"14","author":"Lehmann","year":"1981","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0167-6423(90)90023-7","article-title":"Data structures and program transformation","volume":"14","author":"Malcolm","year":"1990","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB19","series-title":"Algebraic approaches to program semantics, Texts and Monographs in Computer Science","author":"Manes","year":"1986"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB20","volume":"vol. 91","author":"Meijer","year":"1992"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB21","doi-asserted-by":"crossref","unstructured":"E. Meijer, M. Fokkinga, R. Paterson, Functional programming with bananas, lenses, envelopes and barbed wire, Proc. Functional Programming Languages and Computer Architecture\u201991, Lecture Notes in Computer Science, vol. 523, Springer, Berlin, August 1991.","DOI":"10.1007\/3540543961_7"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB22","doi-asserted-by":"crossref","unstructured":"E. Meijer, G. Hutton, Bananas in space: extending fold and unfold to exponential types, Proc. Functional Programming Languages and Computer Architecture\u201995, 1995, pp. 324\u2013333.","DOI":"10.1145\/224164.224225"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB23","unstructured":"E. Meijer, G. Hutton, Monadic Parser combinators, Tech. Rep. NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham, 1996."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB24","first-page":"228","article-title":"Merging monads and folds for functional programming","volume":"vol. 925","author":"Meijer","year":"1995"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB25","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","article-title":"Notions of computation and monads","volume":"93","author":"Moggi","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB26","doi-asserted-by":"crossref","unstructured":"E. Moggi, G. Bell\u00e8, C.B. Jay, Monads, shapely functors and traversals, Tech. Rep. DISI-TR-98-06, Universit\u00e1 Genova, 1998.","DOI":"10.1016\/S1571-0661(05)80316-0"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB27","first-page":"304","volume":"vol. 802","author":"Mulry","year":"1993"},{"issue":"4","key":"10.1016\/S0304-3975(00)00127-4_BIB28","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1017\/S0956796800001489","article-title":"Simple and efficient purely functional queues and deques","volume":"5","author":"Okasaki","year":"1995","journal-title":"J. Funct. Programming"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB29","doi-asserted-by":"crossref","unstructured":"Y. Onoue, Z. Hu, H. Iwasaki, M. Takeichi, A calculational fusion system HYLO, IFIP TC 2 Working Conf. on Algorithmic Languages and Calculi, Le Bischenberg, France, Chapman & Hall, London, February 1997, pp. 76\u2013106.","DOI":"10.1007\/978-0-387-35264-0_4"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB30","unstructured":"A. Pardo, A calculational approach to recursive programs with effects, Ph.D. Thesis, Technische Universit\u00e4t Darmstadt, 1999, forthcoming."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB31","unstructured":"J. Peterson et al., Report on the programming language Haskell (version 1.3), Tech. Rep. YALEU\/DCS\/RR-1107, Yale University, 1996."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB32","doi-asserted-by":"crossref","unstructured":"S. Peyton Jones, J. Launchbury, Lazy functional state threads, SIGPLAN Symp. on Programming Language Design and Implementation (PLDI\u201994), 1994, pp. 24\u201335.","DOI":"10.1145\/773473.178246"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB33","series-title":"Imperative functional programming, Proc. 20th Annu. ACM Symp. on Principles of Programming Languages","author":"Peyton-Jones","year":"1993"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB34","series-title":"Denotational Semantics, A Methodology for Language Development","author":"Schmidt","year":"1986"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB35","doi-asserted-by":"crossref","unstructured":"A. Takano, E. Meijer, Shortcut to deforestation in calculational form, Proc. Functional Programming Languages and Computer Architecture\u201995, 1995.","DOI":"10.1145\/224164.224221"},{"key":"10.1016\/S0304-3975(00)00127-4_BIB36","unstructured":"D. Tuijnman, A categorical approach to functional programming, Ph.D. Thesis, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Ulm, Germany, January 1996."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB37","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","article-title":"Deforestation: transforming programs to eliminate trees","volume":"73","author":"Wadler","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB38","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1017\/S0960129500001560","article-title":"Comprehending mondas","volume":"2","author":"Wadler","year":"1992","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00127-4_BIB39","doi-asserted-by":"crossref","unstructured":"P. Wadler, Monads for functional programming, in: Advanced Functional Programming, Lecture Notes in Computer Science, vol. 925, Springer, Berlin, 1995.","DOI":"10.1007\/3-540-59451-5_2"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001274?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001274?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T22:17:17Z","timestamp":1680819437000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001274"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00127-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}