{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:53Z","timestamp":1761611213778},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418269"},{"type":"electronic","value":"9783540452713"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45271-0_15","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T14:10:56Z","timestamp":1181398256000},"page":"226-244","source":"Crossref","is-referenced-by-count":45,"title":["XDuce: A Typed XML Processing Language (Preliminary Report)"],"prefix":"10.1007","author":[{"given":"Haruo","family":"Hosoya","sequence":"first","affiliation":[]},{"given":"Benjamin C.","family":"Pierce","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s007990050001","volume":"1","author":"S. Abiteboul","year":"1997","unstructured":"Serge Abiteboul, Dallan Quass, Jason McHugh, Jennifer Widom, and Janet L. Wiener. The Lorel query language for semistructured data. International Journal on Digital Libraries, 1(1):68\u201388, 1997.","journal-title":"International Journal on Digital Libraries"},{"key":"15_CR2","unstructured":"Peter Buneman and Benjamin Pierce. Union types for semistructured data. In Proceedings of the International Database Programming Languages Workshop, September 1999. Also available as University of Pennsylvania Dept. of CIS technical report MS-CIS-99-09."},{"key":"15_CR3","unstructured":"Hubert Common, Max Dauchet, R\u00e9my Gilleron, Florent Jacquemard, Denis Lugiez, Sophie Tison, and Marc Tommasi. Tree automata techniques and applications. Draft book; available electronically on http:\/\/www.grappa.univ-lille3.fr\/tata ."},{"key":"15_CR4","unstructured":"Sudarshan S. Chawathe. Comparing hierarchical data in external memory. In Proceedings of the Twenty-fifth International Conference on Very Large Data Bases, pages 90\u2013101, Edinburgh, Scotland, U.K., September 1999."},{"key":"15_CR5","unstructured":"Sophie Cluet and Jerome Simeon. Using YAT to build a web server. In Intl. Workshop on the Web and Databases (WebDB), 1998."},{"key":"15_CR6","unstructured":"Alin Deutsch, Mary Fernandez, Daniela Florescu, Alon Levy, and Dan Suciu. XML-QL: A Query Language for XML. http:\/\/www.w3.org\/TR\/NOTE-xml-ql ."},{"key":"15_CR7","unstructured":"+Haruo Hosoya and Benjamin Pierce. Tree automata and pattern matching. Available through http:\/\/www.cis.upenn.edu\/~hahosoya\/papers\/tapat-full.ps , July 2000."},{"key":"15_CR8","unstructured":"John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Haruo Hosoya, J\u00e9r\u00f4me Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), 2000.","DOI":"10.1145\/351240.351242"},{"key":"15_CR10","unstructured":"Erik Meijer and Mark Shields. XM\u03bb: A functional programming language for constructing and manipulating XML documents. Submitted to USENIX 2000 Technical Conference, 1999."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Tova Milo, Dan Suciu, and Victor Vianu. Typechecking for XML transformers. In Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 11\u201322. ACM, May 2000.","DOI":"10.1145\/335168.335171"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Yannis Papakonstantinou and Victor Vianu. DTD Inference for Views of XML Data. In Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 35\u201346, Dallas, Texas, May 2000.","DOI":"10.1145\/335168.335173"},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"H. Seidl","year":"1990","unstructured":"Hermut Seidl. Deciding equivalence of finite tree automata. SIAM Journal of Computing, 19(3):424\u2013437, June 1990.","journal-title":"SIAM Journal of Computing"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1145\/317636.317794","volume-title":"Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99)","author":"M. Wallace","year":"1999","unstructured":"Malcolm Wallace and Colin Ranciman. Haskell and XML: Generic combinators or type-based translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99), volume 34\u20139 of ACM Sigplan Notices, pages 148\u2013159, N.Y., September 27\u201329 1999. ACM Press."}],"container-title":["Lecture Notes in Computer Science","The World Wide Web and Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45271-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T20:05:50Z","timestamp":1556481950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45271-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418269","9783540452713"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45271-0_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}