{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:01:21Z","timestamp":1725724881966},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,25]]},"DOI":"10.1145\/2500365.2500608","type":"proceedings-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T13:13:17Z","timestamp":1380114797000},"page":"305-318","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Structural recursion for querying ordered graphs"],"prefix":"10.1145","author":[{"given":"Soichiro","family":"Hidaka","sequence":"first","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"given":"Kazuyuki","family":"Asada","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Toyko, Japan"}]},{"given":"Hiroyuki","family":"Kato","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"given":"Keisuke","family":"Nakano","sequence":"additional","affiliation":[{"name":"University of Electro-Communications, Chofu-shi, Japan"}]}],"member":"320","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505879.2505903"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/248932"},{"key":"e_1_3_2_1_4_1","first-page":"9","volume-title":"Proc. of the Third International Workshop on Database Programming Languages(DBPL 91)","author":"Breazu-Tannen V.","year":"1991","unstructured":"V. Breazu-Tannen , P. Buneman , and S. Naqvi . Structural recursion as a query language . In Proc. of the Third International Workshop on Database Programming Languages(DBPL 91) , pages 9 -- 19 , 1991 . V. Breazu-Tannen, P. Buneman, and S. Naqvi. Structural recursion as a query language. In Proc. of the Third International Workshop on Database Programming Languages(DBPL 91), pages 9--19, 1991."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050084"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/95067.95082"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964013"},{"key":"e_1_3_2_1_8_1","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"Ehrig H.","year":"2006","unstructured":"H. Ehrig , K. Ehrig , U. Prange , and G. Taentzer . Fundamentals of Algebraic Graph Transformation . Springer-Verlag , 2006 . H. Ehrig, K. Ehrig, U. Prange, and G. Taentzer. Fundamentals of Algebraic Graph Transformation. Springer-Verlag, 2006."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258955"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237792"},{"key":"e_1_3_2_1_11_1","first-page":"282","volume-title":"MPC '95","author":"Gibbons J.","year":"1995","unstructured":"J. Gibbons . An initial-algebra approach to directed acyclic graphs. In Mathematics of Program Construction , MPC '95 , pages 282 -- 303 , London, UK , 1995 . Springer-Verlag. J. Gibbons. An initial-algebra approach to directed acyclic graphs. In Mathematics of Program Construction, MPC '95, pages 282--303, London, UK, 1995. Springer-Verlag."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90032-1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02273-9_11"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80563-2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863573"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32211-2_9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258964"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11877028_5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.07.017"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003062"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11768869_14"},{"key":"e_1_3_2_1_23_1","first-page":"2","volume-title":"LICS","author":"Kfoury A. J.","year":"1990","unstructured":"A. J. Kfoury and J. Tiuryn . Type reconstruction in finite-rank fragments of the polymorphic lambda-calculus (extended summary) . In LICS , pages 2 -- 11 , 1990 . A. J. Kfoury and J. Tiuryn. Type reconstruction in finite-rank fragments of the polymorphic lambda-calculus (extended summary). In LICS, pages 2--11, 1990."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199530"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31606-7_31"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/127960.128035"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/237842"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364541"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32784-1_12"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9110-5"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224221"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","Northeastern University"],"location":"Boston Massachusetts USA","acronym":"ICFP'13"},"container-title":["Proceedings of the 18th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2500365.2500608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T19:07:30Z","timestamp":1693854450000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,25]]},"references-count":30,"alternative-id":["10.1145\/2500365.2500608","10.1145\/2500365"],"URL":"https:\/\/doi.org\/10.1145\/2500365.2500608","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544174.2500608","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"}}]}}