{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T14:44:15Z","timestamp":1750344255224,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,28]],"date-time":"2013-09-28T00:00:00Z","timestamp":1380326400000},"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,28]]},"DOI":"10.1145\/2502488.2502489","type":"proceedings-article","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T19:57:05Z","timestamp":1379447825000},"page":"61-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Programming macro tree transducers"],"prefix":"10.1145","author":[{"given":"Patrick","family":"Bahr","sequence":"first","affiliation":[{"name":"University of Copenhagen, Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence E.","family":"Day","sequence":"additional","affiliation":[{"name":"University of Nottingham, Nottingham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31113-0_14"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2036918.2036930"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"P.\n       \n      Bahr\n     and \n      \n      \n      T.\n       \n      Hvitved\n      \n  \n  . \n  Parametric compositional data types. In J. Chapman and P. B. Levy editors MSFP '12 volume \n  76\n   of \n  EPTCS pages \n  3\n  --\n  24 2012\n  .  P. Bahr and T. Hvitved. Parametric compositional data types. In J. Chapman and P. B. Levy editors MSFP '12 volume 76 of EPTCS pages 3--24 2012.","DOI":"10.4204\/EPTCS.76.3"},{"key":"e_1_3_2_1_4_1","unstructured":"P. Bahr and T. Hvitved.textttcompdata Haskell library 2013. URL http:\/\/hackage.haskell.org\/package\/compdata. moduletextttData.Comp.MacroAutomata.  P. Bahr and T. Hvitved.textttcompdata Haskell library 2013. URL http:\/\/hackage.haskell.org\/package\/compdata. moduletextttData.Comp.MacroAutomata."},{"key":"e_1_3_2_1_5_1","unstructured":"H. Comon M. Dauchet R. Gilleron C. L\u00f6ding F. Jacquemard D. Lugiez S. Tison and M. Tommasi. Tree Automata Techniques and Applications. 2007. Draft.  H. Comon M. Dauchet R. Gilleron C. L\u00f6ding F. Jacquemard D. Lugiez S. Tison and M. Tommasi. Tree Automata Techniques and Applications. 2007. Draft."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90003-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01704020"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.05.015"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90066-2"},{"key":"e_1_3_2_1_10_1","first-page":"261","article-title":"On attributed tree transducers","volume":"5","author":"F\u00fcl\u00f6p Z.","year":"1981","journal-title":"Acta Cybernet."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000135"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"J.\n       \n      Gibbons\n    .\n      \n  \n   \n  Upwards and downwards accumulations on trees. In R. Bird C. Morgan and J. Woodcock editors MPC '93 volume \n  669\n   of \n  LNCS pages \n  122\n  --\n  138\n  . \n  Springer 1993\n  .   J. Gibbons. Upwards and downwards accumulations on trees. In R. Bird C. Morgan and J. Woodcock editors MPC '93 volume 669 of LNCS pages 122--138. Springer 1993.","DOI":"10.1007\/3-540-56625-2_11"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00022-2"},{"key":"e_1_3_2_1_14_1","unstructured":"J. Gibbons. Accumulating attributes (for Doaitse Swierstra on his retirement). In J. Hage and A. Dijkstra editors Een Lawine van Ontwortelde Bomen: Liber Amicorum voor Doaitse Swierstra pages 87--102. 2013.  J. Gibbons. Accumulating attributes (for Doaitse Swierstra on his retirement). In J. Hage and A. Dijkstra editors Een Lawine van Ontwortelde Bomen: Liber Amicorum voor Doaitse Swierstra pages 87--102. 2013."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"I.\n       \n      Hasuo B.\n       \n      Jacobs and \n      \n      \n      T.\n       \n      Uustalu\n      \n  \n  . \n  Categorical views on computations on trees (extended abstract). In L. Arge C. Cachin T. Jurdzinski and A. Tarlecki editors ICALP '07 volume \n  4596\n   of \n  LNCS pages \n  619\n  --\n  630\n  . \n  Springer 2007\n  .   I. Hasuo B. Jacobs and T. Uustalu. Categorical views on computations on trees (extended abstract). In L. Arge C. Cachin T. Jurdzinski and A. Tarlecki editors ICALP '07 volume 4596 of LNCS pages 619--630. Springer 2007.","DOI":"10.1007\/978-3-540-73420-8_54"},{"volume-title":"Cambridge University Press","year":"2010","author":"Hosoya H.","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","first-page":"203","volume-title":"Haskell Workshop '01","author":"Jones S.","year":"2001"},{"volume-title":"Technischen Universit\u00e4t Dresden","year":"2003","author":"J\u00fcrgensen C.","key":"e_1_3_2_1_18_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129503004109"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30586-6_1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"A.\n       \n      K\u00fchnemann\n    .\n      \n  \n   \n  Benefits of tree transducers for optimizing functional programs. In V. Arvind and S. Ramanujam editors Foundations of Software Technology and Theoretical Computer Science volume \n  1530\n   of \n  LNCS pages \n  146\n  --\n  157\n  . \n  Springer Berlin \/ Heidelberg 1998\n  .   A. K\u00fchnemann. Benefits of tree transducers for optimizing functional programs. In V. Arvind and S. Ramanujam editors Foundations of Software Technology and Theoretical Computer Science volume 1530 of LNCS pages 146--157. Springer Berlin \/ Heidelberg 1998.","DOI":"10.1007\/978-3-540-49382-2_13"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"A.\n       \n      K\u00fchnemann\n    .\n      \n  \n   \n  Comparison of deforestation techniques for functional programs and for tree transducers. In A. Middeldorp and T. Sato editors FLOPS '99 volume \n  1722\n   of \n  LNCS pages \n  114\n  --\n  130\n  . \n  Springer 1999\n  .   A. K\u00fchnemann. Comparison of deforestation techniques for functional programs and for tree transducers. In A. Middeldorp and T. Sato editors FLOPS '99 volume 1722 of LNCS pages 114--130. Springer 1999.","DOI":"10.1007\/10705424_8"},{"volume-title":"Dresden University of Technology","year":"2001","author":"K\u00fchnemann A.","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103746.2103752"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"E.\n       \n      Meijer M.\n       \n      Fokkinga and \n      \n      \n      R.\n       \n      Paterson\n      \n  \n  . \n  Functional programming with bananas lenses envelopes and barbed wire. In J. Hughes editor FPCA '91 volume \n  523\n   of \n  LNCS pages \n  124\n  --\n  144\n  . \n  Springer 1991\n  .   E. Meijer M. Fokkinga and R. Paterson. Functional programming with bananas lenses envelopes and barbed wire. In J. Hughes editor FPCA '91 volume 523 of LNCS pages 124--144. Springer 1991.","DOI":"10.1007\/3540543961_7"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/210376.197409"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01695769"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01192143"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796808006758"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/800169.805427"},{"volume-title":"Springer-Verlag","year":"1997","author":"Thomas W.","key":"e_1_3_2_1_31_1"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"S.\n       \n      Tison\n    .\n      \n  \n   \n  Tree automata and term rewrite systems. In L. Bachmair editor RTA '00 volume \n  1833\n   of \n  LNCS pages \n  27\n  --\n  30\n  . \n  Springer 2000\n  .   S. Tison. Tree automata and term rewrite systems. In L. Bachmair editor RTA '00 volume 1833 of LNCS pages 27--30. Springer 2000.","DOI":"10.1007\/10721975_2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596586"},{"key":"e_1_3_2_1_34_1","series-title":"LNCS","first-page":"57","volume-title":"RTA '02","author":"Voigtl\u00e4nder J.","year":"2002"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1235-9"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99404"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90147-A"},{"key":"e_1_3_2_1_38_1","first-page":"1","article-title":"Decidability results concerning tree transducers I","volume":"5","author":"\u00c9sik Z.","year":"1981","journal-title":"Acta Cybernet."}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Boston Massachusetts USA","acronym":"ICFP'13"},"container-title":["Proceedings of the 9th ACM SIGPLAN workshop on Generic programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502488.2502489","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2502488.2502489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:36Z","timestamp":1750231716000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502488.2502489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,28]]},"references-count":38,"alternative-id":["10.1145\/2502488.2502489","10.1145\/2502488"],"URL":"https:\/\/doi.org\/10.1145\/2502488.2502489","relation":{},"subject":[],"published":{"date-parts":[[2013,9,28]]},"assertion":[{"value":"2013-09-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}