{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:58Z","timestamp":1750306258092,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,2]],"date-time":"2017-01-02T00:00:00Z","timestamp":1483315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15K15966, 15H02681, 25540001, 24700020, 22800003"],"award-info":[{"award-number":["15K15966, 15H02681, 25540001, 24700020, 22800003"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1,2]]},"DOI":"10.1145\/3018882.3018883","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T21:20:29Z","timestamp":1482441629000},"page":"71-82","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction"],"prefix":"10.1145","author":[{"given":"Kazutaka","family":"Matsuda","sequence":"first","affiliation":[{"name":"Tohoku University, Japan"}]},{"given":"Kazuyuki","family":"Asada","sequence":"additional","affiliation":[{"name":"University of Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2017,1,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007990050005"},{"key":"e_1_3_2_1_2_1","series-title":"LNCS","first-page":"106","volume-title":"TACS","author":"Zena","unstructured":"Zena M. Ariola and Stefan Blom. Cyclic lambda calculi . In TACS , volume 1281 of LNCS , pages 77\u2013 106 . Springer, 1997. Zena M. Ariola and Stefan Blom. Cyclic lambda calculi. In TACS, volume 1281 of LNCS, pages 77\u2013106. Springer, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2379538.2379539"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11663430_13"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233368"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"350","volume-title":"ICDT","author":"Buneman Peter","unstructured":"Peter Buneman , Susan B. Davidson , Mary F. Fernandez , and Dan Suciu . Adding structure to unstructured data . In ICDT , volume 1186 of LNCS , pages 336\u2013 350 . Springer, 1997. Peter Buneman, Susan B. Davidson, Mary F. Fernandez, and Dan Suciu. Adding structure to unstructured data. In ICDT, volume 1186 of LNCS, pages 336\u2013350. Springer, 1997."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050084"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298591"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364541"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00361-X"},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","first-page":"292","volume-title":"WG","author":"Erwig Martin","unstructured":"Martin Erwig . Graph algorithms = iteration + data structures? the structure of graph algorithms and a corresponding style of programming . In WG , volume 657 of LNCS , pages 277\u2013 292 . Springer, 1992. Martin Erwig. Graph algorithms = iteration + data structures? the structure of graph algorithms and a corresponding style of programming. In WG, volume 657 of LNCS, pages 277\u2013292. Springer, 1992."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796801004075"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237792"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596556"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11581741_21"},{"key":"e_1_3_2_1_17_1","volume-title":"Initial algebra semantics for cyclic sharing tree structures. Logical Methods in Computer Science, 6(3)","author":"Hamana Makoto","year":"2010","unstructured":"Makoto Hamana . Initial algebra semantics for cyclic sharing tree structures. Logical Methods in Computer Science, 6(3) , 2010 . Makoto Hamana. Initial algebra semantics for cyclic sharing tree structures. Logical Methods in Computer Science, 6(3), 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863573"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32211-2_9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500608"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2011.6100104"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2003476.2003482"},{"key":"e_1_3_2_1_23_1","unstructured":"Jean-Baptiste Jeannin Dexter Kozen and Alexandra Silva. Cocaml: Programming with coinductive types. http:\/\/www.cs.cornell. edu\/~kozen\/Papers\/cocaml.pdf 2013.  Jean-Baptiste Jeannin Dexter Kozen and Alexandra Silva. Cocaml: Programming with coinductive types. http:\/\/www.cs.cornell. edu\/~kozen\/Papers\/cocaml.pdf 2013."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003062"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11768869_14"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199530"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211391"},{"key":"e_1_3_2_1_29_1","series-title":"LNCS","first-page":"144","volume-title":"FPCA","author":"Meijer Erik","unstructured":"Erik Meijer , Maarten M. Fokkinga , and Ross Paterson . Functional programming with bananas, lenses, envelopes and barbed wire . In FPCA , volume 523 of LNCS , pages 124\u2013 144 . Springer, 1991. Erik Meijer, Maarten M. Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In FPCA, volume 523 of LNCS, pages 124\u2013144. Springer, 1991."},{"key":"e_1_3_2_1_30_1","volume-title":"Communicating and mobile systems - the Pi-calculus","author":"Milner Robin","year":"1999","unstructured":"Robin Milner . Communicating and mobile systems - the Pi-calculus . Cambridge University Press , 1999 . ISBN 978-0-521-65869-0. Robin Milner. Communicating and mobile systems - the Pi-calculus. Cambridge University Press, 1999. ISBN 978-0-521-65869-0."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809990219"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003457"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/236337.236339"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190241"},{"key":"e_1_3_2_1_35_1","first-page":"260","volume-title":"ICDE","author":"Papakonstantinou Yannis","unstructured":"Yannis Papakonstantinou , Hector Garcia-Molina , and Jennifer Widom . Object exchange across heterogeneous information sources . In ICDE , pages 251\u2013 260 . IEEE Computer Society, 1995. Yannis Papakonstantinou, Hector Garcia-Molina, and Jennifer Widom. Object exchange across heterogeneous information sources. In ICDE, pages 251\u2013260. IEEE Computer Society, 1995."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800002008"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.2307\/2271658"},{"key":"e_1_3_2_1_38_1","series-title":"LNCS","first-page":"327","volume-title":"APLAS","author":"Unno Hiroshi","unstructured":"Hiroshi Unno , Naoshi Tabuchi , and Naoki Kobayashi . Verification of tree-processing programs via higher-order model checking . In APLAS , volume 6461 of LNCS , pages 312\u2013 327 . Springer, 2010. Hiroshi Unno, Naoshi Tabuchi, and Naoki Kobayashi. Verification of tree-processing programs via higher-order model checking. In APLAS, volume 6461 of LNCS, pages 312\u2013327. Springer, 2010."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/2337223.2337287"}],"event":{"name":"POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Paris France","acronym":"POPL '17"},"container-title":["Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018882.3018883","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3018882.3018883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:12Z","timestamp":1750220652000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018882.3018883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,2]]},"references-count":39,"alternative-id":["10.1145\/3018882.3018883","10.1145\/3018882"],"URL":"https:\/\/doi.org\/10.1145\/3018882.3018883","relation":{},"subject":[],"published":{"date-parts":[[2017,1,2]]},"assertion":[{"value":"2017-01-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}