{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:59:46Z","timestamp":1750309186710,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:00:00Z","timestamp":1725840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"JSPS Grant-in-Aid for Scientific Research (B)","award":["23K11057"],"award-info":[{"award-number":["23K11057"]}]},{"name":"Waseda University Grant for Special Research Projects","award":["2024C-436"],"award-info":[{"award-number":["2024C-436"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,9,9]]},"DOI":"10.1145\/3678232.3678243","type":"proceedings-article","created":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:17Z","timestamp":1725489317000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Grammar-based Pattern Matching and Type Checking for Difference Data Structures"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1106-4491","authenticated-orcid":false,"given":"Naoki","family":"Yamamoto","sequence":"first","affiliation":[{"name":"Waseda University, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3424-1844","authenticated-orcid":false,"given":"Kazunori","family":"Ueda","sequence":"additional","affiliation":[{"name":"Waseda University, Japan"}]}],"member":"320","published-online":{"date-parts":[[2024,9,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321488"},{"volume-title":"GP 2: efficient implementation of a graph programming language. Ph.\u00a0D. Dissertation. Department of Computer Science","author":"Bak Christopher","key":"e_1_3_2_1_2_1","unstructured":"Christopher Bak. 2015. GP 2: efficient implementation of a graph programming language. Ph.\u00a0D. Dissertation. Department of Computer Science, The University of York. https:\/\/etheses.whiterose.ac.uk\/12586\/"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012996816178"},{"volume-title":"Proceedings of the 7th IFIP Congress. North-Holland Pub. Co.","author":"L.","key":"e_1_3_2_1_4_1","unstructured":"Keith\u00a0L. Clark and Sten-\u00c5ke T\u00e4rnlund. 1977. A First Order Theory of Data and Programs. In Information Processing, Proceedings of the 7th IFIP Congress. North-Holland Pub. Co., Amsterdam, 939\u2013944."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2018.10.002"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263706"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(97)00023-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(98)10005-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-011-0186-x"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.11309\/jssst.28.4_137"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796801004026"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324139"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158628"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3"},{"volume-title":"Communicating and Mobile Systems: The Pi-Calculus","author":"Milner Robin","key":"e_1_3_2_1_18_1","unstructured":"Robin Milner. 1999. Communicating and Mobile Systems: The Pi-Calculus. Cambridge University Press, Cambridge."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3656450"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 31st JSSST Annual Conference(JSSST \u201914)","author":"Nara Kota","year":"2014","unstructured":"Kota Nara and Kazunori Ueda. 2014. A Graph Rewriting System and Its Implementation with Matching via Pattern Definitions. In Proceedings of the 31st JSSST Annual Conference(JSSST \u201914). Article PPL3-3, 11\u00a0pages. https:\/\/jssst.or.jp\/files\/user\/taikai\/2014\/PPL\/PPL3-3.pdf"},{"volume-title":"Types and Programming Languages","author":"Pierce C.","key":"e_1_3_2_1_21_1","unstructured":"Benjamin\u00a0C. Pierce. 2002. Types and Programming Languages. MIT press, Cambridge."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2002.1029817"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375602"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1142\/3303"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.31.112"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11417170_28"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25959-6_35"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5381\/jot.2018.17.1.a1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70590-1_27"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.043"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44471-9_15"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2017.06.002"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-011-0162-3"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.25088\/ComplexSystems.29.2.107"},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of the 86th National Convention of IPSJ.","author":"Yamada Keita","year":"2024","unstructured":"Keita Yamada, Naoki Yamamoto, and Kazunori Ueda. 2024. Graph Type Checking with Token Passing. In Proceedings of the 86th National Convention of IPSJ."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3217913"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3112903"}],"event":{"name":"PPDP 2024: 26th International Symposium on Principles and Practice of Declarative Programming","acronym":"PPDP 2024","location":"Milano Italy"},"container-title":["Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3678232.3678243","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3678232.3678243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:54:09Z","timestamp":1750287249000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3678232.3678243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,9]]},"references-count":38,"alternative-id":["10.1145\/3678232.3678243","10.1145\/3678232"],"URL":"https:\/\/doi.org\/10.1145\/3678232.3678243","relation":{},"subject":[],"published":{"date-parts":[[2024,9,9]]},"assertion":[{"value":"2024-09-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}