{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:31:03Z","timestamp":1720625463338},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5688,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1998]]},"DOI":"10.1016\/s1571-0661(04)00055-6","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"105-139","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Monadic Corecursion \u2014Definition, Fusion Laws, and Applications\u2014"],"prefix":"10.1016","volume":"11","author":[{"given":"Alberto","family":"Pardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB1","series-title":"Introduction to Functional Programming","author":"Bird","year":"1988"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB2","series-title":"A Classical Mind","first-page":"17","article-title":"Relational program derivation and context-free language recognition","author":"Bird","year":"1994"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB3","unstructured":"J. Peterson et. al. Report on the programming language Haskell (version 1.3). Technical Report YALEU\/DCS\/RR-1107, Yale University, 1996."},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Maarten M. Fokkinga. Law and Order in Algorithmics. PhD thesis, Universiteit Twente, The Netherlands, 1992.","DOI":"10.1007\/BF03180568"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB5","unstructured":"M.M. Fokkinga. Monadic maps and folds for arbitrary datatypes. Memoranda Informatica 94-28, University of Twente, June 1994."},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB6","doi-asserted-by":"crossref","unstructured":"P. Freyd. Recursive types reduced to inductive types. In 5th IEEE Symposium on Logic in Computer Science, pages 498\u2013507, 1990.","DOI":"10.1109\/LICS.1990.113772"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB7","series-title":"Fuji International Workshop on Functional and Logic Programming","first-page":"196","article-title":"Promotional Transformation of Monadic Programs","author":"Hu","year":"1995"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB8","unstructured":"J. Jeuring. Theories for Algorithm Calculation. PhD thesis, Utrecht University, 1993."},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB9","doi-asserted-by":"crossref","unstructured":"J. Jeuring and Patrik Jansson. Polytypic Programming. In Advanced Functional Programming, LNCS 1129. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61628-4_3"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB10","first-page":"24","article-title":"Lazy functional state threads","author":"Peyton Jones","year":"1994","journal-title":"SIGPLAN PLDI'94"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB11","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":"Mathematical Systems Theory"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB12","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":"Science of Computer Programming"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB13","doi-asserted-by":"crossref","unstructured":"E.G. Manes and M.A. Arbib. Algebraic Approaches to Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4962-7"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB14","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01211391","article-title":"Paramorphisms","volume":"4","author":"Meertens","year":"1992","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB15","unstructured":"E. Meijer. More Advice on Proving a Program Correct: Improve a Correct Compiler. Available from http:\/\/www.cs.ruu.nl\/~erik\/."},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB16","doi-asserted-by":"crossref","unstructured":"E. Meijer, M. Fokkinga, and R. Paterson. Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. In Proceedings of the ACM FPCA'91, LNCS 523. Springer-Verlag, August 1991.","DOI":"10.1007\/3540543961_7"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB17","series-title":"ACM FPCA '95, SIGPLAN-SIGARCH-WG2.8","first-page":"324","article-title":"Bananas in space: Extending fold and unfold to exponential types","author":"Meijer","year":"1995"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB18","unstructured":"E. Meijer and G. Hutton. Monadic Parser Combinators. Technical Report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham, 1996."},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB19","series-title":"Advanced Functional Programming, LNCS 925","first-page":"228","article-title":"Merging Monads and Folds for Functional Programming","author":"Meijer","year":"1995"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB20","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":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB21","doi-asserted-by":"crossref","unstructured":"P.S. Mulry. Lifting Theorems for Kleisli Categories. In 9th International Conference on Mathematical Foundations of Programming Semantics, LNCS 802, pages 304\u2013319. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-58027-1_15"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB22","doi-asserted-by":"crossref","unstructured":"Y. Onoue, Z. Hu, H. Iwasaki, and M. Takeichi. A Calculational Fusion System HYLO. In IFIP TC 2 Working Conference on Algorithmic Languages and Calculi, Le Bischenberg, France, pages 76\u2013106. Chapman & Hall, February 1997.","DOI":"10.1007\/978-0-387-35264-0_4"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB23","unstructured":"A. Pardo. A Calculational Approach to Monadic and Comonadic Programs, forthcoming PhD Thesis. Technische Universit\u00e4t Darmstadt, 1998."},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB24","doi-asserted-by":"crossref","unstructured":"S. Peyton-Jones and P. Wadler. Imperative Functional Programming. In Proceedings of 20th Annual ACM Symposium on Principles of Programming Languages, Charlotte, North Carolina, 1993.","DOI":"10.1145\/158511.158524"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB25","series-title":"Denotational Semantics. A Methodology for Language Development","author":"Schmidt","year":"1986"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB26","doi-asserted-by":"crossref","unstructured":"A. Takano and E. Meijer. Shortcut to Deforestation in Calculational Form. In Proceedings of FPCA '95, 1995.","DOI":"10.1145\/224164.224221"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB27","unstructured":"D. Tuijnman. A Categorical Approach to Functional Programming. PhD thesis, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Ulm, Germany, Januar 1996."},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB28","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1017\/S0960129500001560","article-title":"Comprehending Monads","volume":"2","author":"Wadler","year":"1992","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)00055-6_NEWBIB29","series-title":"Advanced Functional Programming","article-title":"Monads for functional programming","author":"Wadler","year":"1995"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000556?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000556?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T12:31:25Z","timestamp":1585485085000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104000556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":29,"alternative-id":["S1571066104000556"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00055-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}