{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T23:10:14Z","timestamp":1773097814929,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,25]]},"DOI":"10.1145\/2500365.2500578","type":"proceedings-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T09:13:17Z","timestamp":1380100397000},"page":"209-220","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Unifying structured recursion schemes"],"prefix":"10.1145","author":[{"given":"Ralf","family":"Hinze","sequence":"first","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy","family":"Gibbons","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"159","volume-title":"ser. LNCS","author":"Backhouse R.","year":"1995","unstructured":"R. Backhouse , M. Bijsterveld , R. van Geldrop , and J. van der Woude , \"Categorical fixed point calculus,\" in CTCS , ser. LNCS , vol. 953 . Springer , 1995 , pp. 159 -- 179 . R. Backhouse, M. Bijsterveld, R. van Geldrop, and J. van der Woude, \"Categorical fixed point calculus,\" in CTCS, ser. LNCS, vol. 953. Springer, 1995, pp. 159--179."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129502003900"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/248932"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001650050047"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.08.005"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1215\/ijm\/1256068141"},{"key":"e_1_3_2_1_7_1","volume-title":"dissertation","author":"Fokkinga M. M.","year":"1992","unstructured":"M. M. Fokkinga , \"Law and order in algorithmics,\" Ph. D. dissertation , University of Twente , Feb. 1992 . M. M. Fokkinga, \"Law and order in algorithmics,\" Ph.D. dissertation, University of Twente, Feb. 1992."},{"issue":"4","key":"e_1_3_2_1_8_1","first-page":"81","article-title":"Tupling and mutumorphisms","volume":"1","author":"Fokkinga M. M.","year":"1990","unstructured":"M. M. Fokkinga , \"Law and order in algorithmics,\" Ph. D. , \" Tupling and mutumorphisms ,\" The Squiggolist , vol. 1 , no. 4 , pp. 81 -- 82 , Jun. 1990 . ----, \"Tupling and mutumorphisms,\" The Squiggolist, vol. 1, no. 4, pp. 81--82, Jun. 1990.","journal-title":"The Squiggolist"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00022-2"},{"key":"e_1_3_2_1_10_1","volume-title":"dissertation","author":"Hagino T.","year":"1987","unstructured":"T. Hagino , \"Category theoretic approach to data types,\" Ph. D. dissertation , University of Edinburgh , 1987 . T. Hagino, \"Category theoretic approach to data types,\" Ph.D. dissertation, University of Edinburgh, 1987."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2012.07.011"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034821"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396534"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1958-0131451-0"},{"key":"e_1_3_2_1_15_1","first-page":"544","volume-title":"AMS","volume":"16","author":"Kleisli H.","year":"1965","unstructured":"H. Kleisli , \"Every standard construction is induced by a pair of adjoint functors,\" Proc . AMS , vol. 16 , no. 3, pp. 544 -- 546 , Jun. 1965 . H. Kleisli, \"Every standard construction is induced by a pair of adjoint functors,\" Proc. AMS, vol. 16, no. 3, pp. 544--546, Jun. 1965."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01110627"},{"key":"e_1_3_2_1_17_1","volume-title":"Categories for the Working Mathematician","author":"Mac Lane S.","year":"1998","unstructured":"S. Mac Lane , Categories for the Working Mathematician , 2 nd ed., ser. Graduate Texts in Mathematics . Berlin : Springer-Verlag , 1998 . S. Mac Lane, Categories for the Working Mathematician, 2nd ed., ser. Graduate Texts in Mathematics. Berlin: Springer-Verlag, 1998.","edition":"2"},{"key":"e_1_3_2_1_18_1","volume-title":"dissertation","author":"Malcolm G.","year":"1990","unstructured":"G. Malcolm , \"Algebraic data types and program transformation,\" Ph. D. dissertation , University of Groningen , 1990 . G. Malcolm, \"Algebraic data types and program transformation,\" Ph.D. dissertation, University of Groningen, 1990."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(90)90023-7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.07.025"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211391"},{"key":"e_1_3_2_1_22_1","first-page":"124","volume-title":"Functional programming with bananas, lenses, envelopes and barbed wire,\" in FPLCA, ser. LNCS","author":"Meijer E.","year":"1991","unstructured":"E. Meijer , M. Fokkinga , and R. Paterson , \" Functional programming with bananas, lenses, envelopes and barbed wire,\" in FPLCA, ser. LNCS , vol. 523 . Springer , 1991 , pp. 124 -- 144 . E. Meijer, M. Fokkinga, and R. Paterson, \"Functional programming with bananas, lenses, envelopes and barbed wire,\" in FPLCA, ser. LNCS, vol. 523. Springer, 1991, pp. 124--144."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90069-X"},{"key":"e_1_3_2_1_24_1","first-page":"123","volume-title":"ser. LNM","author":"Palmquist P. H.","year":"1971","unstructured":"P. H. Palmquist , \"The double category of adjoint squares,\" in Midwest Category Seminar V , ser. LNM . Springer , 1971 , vol. 195 , pp. 123 -- 153 . P. H. Palmquist, \"The double category of adjoint squares,\" in Midwest Category Seminar V, ser. LNM. Springer, 1971, vol. 195, pp. 123--153."},{"key":"e_1_3_2_1_25_1","first-page":"49","volume-title":"Working Conference on Generic Programming","volume":"243","author":"Pardo A.","year":"2002","unstructured":"A. Pardo , \"Generic accumulations,\" in Working Conference on Generic Programming , vol. 243 . Kluwer Academic Publishers , Jul. 2002 , pp. 49 -- 78 . A. Pardo, \"Generic accumulations,\" in Working Conference on Generic Programming, vol. 243. Kluwer Academic Publishers, Jul. 2002, pp. 49--78."},{"issue":"1","key":"e_1_3_2_1_26_1","first-page":"5","article-title":"Primitive (co)recursion and course-of-value (co)iteration, categorically","volume":"10","author":"Uustalu T.","year":"1999","unstructured":"T. Uustalu and V. Vene , \" Primitive (co)recursion and course-of-value (co)iteration, categorically ,\" Informatica, Lith. Acad. Sci. , vol. 10 , no. 1 , pp. 5 -- 26 , 1999 . T. Uustalu and V. Vene, \"Primitive (co)recursion and course-of-value (co)iteration, categorically,\" Informatica, Lith. Acad. Sci., vol. 10, no. 1, pp. 5--26, 1999.","journal-title":"Informatica, Lith. Acad. Sci."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.05.029"},{"key":"e_1_3_2_1_28_1","first-page":"343","article-title":"Mendler-style inductive types, categorically","volume":"6","author":"Uustalu T.","year":"1999","unstructured":"T. Uustalu and V. Vene , \" Mendler-style inductive types, categorically ,\" Nordic J. Comput. , vol. 6 , pp. 343 -- 361 , 1999 . ----, \"Mendler-style inductive types, categorically,\" Nordic J. Comput., vol. 6, pp. 343--361, 1999.","journal-title":"Nordic J. Comput."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.02.020"},{"key":"e_1_3_2_1_30_1","first-page":"366","article-title":"Recursion schemes from comonads","volume":"8","author":"Uustalu T.","year":"2001","unstructured":"T. Uustalu , V. Vene , and A. Pardo , \" Recursion schemes from comonads ,\" Nordic J. Comput. , vol. 8 , pp. 366 -- 390 , Sep. 2001 . T. Uustalu, V. Vene, and A. Pardo, \"Recursion schemes from comonads,\" Nordic J. Comput., vol. 8, pp. 366--390, Sep. 2001.","journal-title":"Nordic J. Comput."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.3176\/phys.math.1998.3.01"},{"issue":"1","key":"e_1_3_2_1_32_1","first-page":"1","article-title":"Kleisli and Eilenberg-Moore constructions as parts of biadjoint situations","volume":"25","author":"Vidal J. C.","year":"2010","unstructured":"J. C. Vidal and J. S. Tur , \" Kleisli and Eilenberg-Moore constructions as parts of biadjoint situations ,\" Extracta Mathematicae , vol. 25 , no. 1 , pp. 1 -- 61 , 2010 . J. C. Vidal and J. S. Tur, \"Kleisli and Eilenberg-Moore constructions as parts of biadjoint situations,\" Extracta Mathematicae, vol. 25, no. 1, pp. 1--61, 2010.","journal-title":"Extracta Mathematicae"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","location":"Boston Massachusetts USA","acronym":"ICFP'13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","Northeastern University"]},"container-title":["Proceedings of the 18th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500578","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2500365.2500578","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:34:32Z","timestamp":1750217672000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,25]]},"references-count":32,"alternative-id":["10.1145\/2500365.2500578","10.1145\/2500365"],"URL":"https:\/\/doi.org\/10.1145\/2500365.2500578","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544174.2500578","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,9,25]]},"assertion":[{"value":"2013-09-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}