{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:10Z","timestamp":1750307710746,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,1,19]],"date-time":"2009-01-19T00:00:00Z","timestamp":1232323200000},"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":[[2009,1,19]]},"DOI":"10.1145\/1480945.1480955","type":"proceedings-article","created":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T14:41:38Z","timestamp":1232462498000},"page":"61-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Type-based specialization of xml transformations"],"prefix":"10.1145","author":[{"given":"Kazutaka","family":"Matsuda","sequence":"first","affiliation":[{"name":"The University of Tokyo, Tokyo, Japan"}]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"given":"Masato","family":"Takeichi","sequence":"additional","affiliation":[{"name":"The University of Tokyo, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2009,1,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944711"},{"key":"e_1_3_2_1_2_1","volume-title":"Introduction to Functional Programming Using Haskell","author":"Bird R. S.","year":"1998","unstructured":"R. S. Bird . Introduction to Functional Programming Using Haskell . Prentice Hall , 1998 . R. S. Bird. Introduction to Functional Programming Using Haskell. Prentice Hall, 1998."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1775283.1775306"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2008.01.006"},{"key":"e_1_3_2_1_6_1","volume-title":"Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata","author":"Comon H.","year":"1997","unstructured":"H. Comon , M. Dauchet , R. Gilleron , F. Jacquemard , D. Lugiez , S. Tison , and M. Tommasi . Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata , 1997 . release October, 1st 2002. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata, 1997. release October, 1st 2002."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683280"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-003-0120-0"},{"key":"e_1_3_2_1_9_1","first-page":"219","volume-title":"International Joint Conference on Artificial Intelligence (IJCAI-85)","author":"Eppstein D.","year":"1985","unstructured":"D. Eppstein . A heuristic approach to program inversion . In International Joint Conference on Artificial Intelligence (IJCAI-85) , pages 219 -- 221 , 1985 . D. Eppstein. A heuristic approach to program inversion. In International Joint Conference on Artificial Intelligence (IJCAI-85), pages 219--221, 1985."},{"key":"e_1_3_2_1_10_1","first-page":"661","volume-title":"IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004)","author":"Frisch A.","year":"2004","unstructured":"A. Frisch . Regular tree language recognition with static information. In Exploring New Frontiers of Theoretical Informatics , IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004) , pages 661 -- 674 , 2004 . A. Frisch. Regular tree language recognition with static information. In Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), pages 661--674, 2004."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664588"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24754-8_21"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071221.1071222"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Programming","author":"Gries D.","year":"1981","unstructured":"D. Gries . The Science of Programming , chapter 21 Inverting Programs. Springer , 1981 . D. Gries. The Science of Programming, chapter 21 Inverting Programs. Springer, 1981."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/767193.767195"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70844-5_11"},{"key":"e_1_3_2_1_18_1","volume-title":"Run","author":"Levin M. Y.","year":"2005","unstructured":"M. Y. Levin . Run , Xtatic, Run : Efficient Implementation of an Object-Oriented Language with Regular Pattern Matching. PhD thesis, University of Pennsylvania , 2005 . M. Y. Levin. Run, Xtatic, Run: Efficient Implementation of an Object-Oriented Language with Regular Pattern Matching. PhD thesis, University of Pennsylvania, 2005."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11601524_12"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24597-1_28"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065203"},{"key":"e_1_3_2_1_22_1","volume-title":"PLAN-X '08: Programming Languages Technologies for XML","author":"Maneth S.","year":"2008","unstructured":"S. Maneth and K. Nakano . XML type checking for macro tree transducers with holes . In PLAN-X '08: Programming Languages Technologies for XML , 2008 . S. Maneth and K. Nakano. XML type checking for macro tree transducers with holes. In PLAN-X '08: Programming Languages Technologies for XML, 2008."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11965893_18"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291162"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00030-2"},{"key":"e_1_3_2_1_26_1","volume-title":"J.-C","author":"Mohri M.","year":"2001","unstructured":"M. Mohri and M.-J. Nederhof . Regular approximation of context-free grammars through transformation . In J.-C . Junqua and G. van Noord, editors, Robusteness in Language and Speech Technology. Kluwer Academic Publishers , The Netherlands, 2001 . M. Mohri and M.-J. Nederhof. Regular approximation of context-free grammars through transformation. In J.-C. Junqua and G. van Noord, editors, Robusteness in Language and Speech Technology. Kluwer Academic Publishers, The Netherlands, 2001."},{"volume-title":"Hedge automata: a formal model for XML schemata","year":"1999","key":"e_1_3_2_1_27_1","unstructured":"Murata. Hedge automata: a formal model for XML schemata , 1999 . Available on: http:\/\/www.xml.gr.jp\/relax\/hedge_nice.html. Murata. Hedge automata: a formal model for XML schemata, 1999. Available on: http:\/\/www.xml.gr.jp\/relax\/hedge_nice.html."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111627.1111631"},{"key":"e_1_3_2_1_29_1","first-page":"188","volume-title":"Proceedings of the International Workshop on Rewriting in Proof and Computation (RPC'01)","author":"Nishida N.","year":"2001","unstructured":"N. Nishida , M. Sakai , and T. Sakabe . Generation of inverse term rewriting systems for pure treeless functions. In Y. Toyama, editor , Proceedings of the International Workshop on Rewriting in Proof and Computation (RPC'01) , pages 188 -- 198 , 10 2001 . N. Nishida, M. Sakai, and T. Sakabe. Generation of inverse term rewriting systems for pure treeless functions. In Y. Toyama, editor, Proceedings of the International Workshop on Rewriting in Proof and Computation (RPC'01), pages 188--198, 10 2001."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2003.05.001"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1946-08555-9"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90147-A"}],"event":{"name":"PEPM '09: Partial Evaluation and Program Manipulation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Savannah GA USA","acronym":"PEPM '09"},"container-title":["Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1480945.1480955","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1480945.1480955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:09Z","timestamp":1750253409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1480945.1480955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,19]]},"references-count":30,"alternative-id":["10.1145\/1480945.1480955","10.1145\/1480945"],"URL":"https:\/\/doi.org\/10.1145\/1480945.1480955","relation":{},"subject":[],"published":{"date-parts":[[2009,1,19]]},"assertion":[{"value":"2009-01-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}