Regular expression pattern matching for XML

Journal of Functional Programming

Volumn 13, Issue 6, 2003, Pages 961-1004

  Hosoya, Haruo ^a   Pierce, Benjamin C ^b  

^a KYOTO UNIVERSITY   (Japan)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

REGULAR EXPRESSION PATTERNS;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; PATTERN MATCHING; SEMANTICS; THEOREM PROVING;

XML;

EID: 0242636425     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796802004410     Document Type: Article

References (35)

1. Abiteboul, S., Quass, D., McHugh, J., Widom, J. and Wiener, J. L. (1997) The Lorel query language for semistructured data. Int. J. Digital Libraries, 1(1), 68-88.
2. Aiken, A. and Wimmers, E. L. (1992) Solving systems of set constraints (extended abstract). Proceedings 7th Ann. IEEE Symposium on Logic in Computer Science, pp. 329-340.
3. Bray, T., Paoli, J., Sperberg-McQueen, C. M. and Maler, E. (2000) Extensible markup language (XML™). http://www. w3.org/XML/.
4. Burstall, R., MacQueen, D. and Sannella, D. (1980) HOPE: an experimental applicative language. Proceedings 1980 LISP Conference, pp. 136-143. Stanford, CA.
5. Cardelli, L. and Ghelli, G. (2000) A query language for semistructured data based on the Ambient Logic. Manuscript.
6. Cardelli, L. and Gordon, A. D. (2000) Anytime, anywhere. Modal logics for mobile ambients. Proceedings 27th ACM Symposium on Principles of Programming Languages, pp. 365-377.
7. Clark, J. (1999) XSL Transformations (XSLT). http://www.w3.org/TR/xslt.
8. Clark, J. and DeRose, S. (1999) XML path language (XPath). http://www.w3.org/TR/xpath.
9. Clark, J. and Murata, M. (2001) RELAX NG. http://www.relaxng.org.
10. Cluet, S. and Siméon, J. (1998) Using YAT to build a web server. Int. Workshop on the Web and Databases (WebDB).
11. Deutsch, A., Fernandez, M., Florescu, D., Levy, A. and Suciu, D. (1998) XML-QL: A Query Language for XML. http://www.w3.org/TR/NOTE-xml-ql.
12. Fähndrich, M. and Boyland, J. (1997) Statically checkable pattern abstractions. Proceedings Int. Conference on Functional Programming (ICFP), pp. 75-84.
13. Fallside, D. C. (2001) XML Schema Part 0: Primer, W3C Recommendation, http://www.w3.org/TR/xmlschema-0/.
14. Fankhauser, P., Fernández, M., Malhotra, A., Rys, M., Siméon, J. and Wadler, P. (2001) X Query 1.0 Formal Semantics. http://www.w3.org/TR/query-semantics/.
15. Gapeyev, V., Levin, M. and Pierce, B. (2000) Recursive subtyping revealed. Proceedings Int. Conference on Functional Programming (ICFP), pp. 221-232.
16. Gilleron, R., Tison, S. and Tommasi, M. (1999) Set constraints and automata. Infor. & Computation, 149(1), 1-41.
17. Hopcroft, J. E. and Ullman, J. D. (1979) Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
18. Hosoya, H. and Pierce, B. C. (2000) XDuce: A typed XML processing language. Proceedings 3rd Int. Workshop on the Web and Databases (WebDB2000): Lecture Notes in Computer Science 1997, pp. 226-244.
19. Hosoya, H., Vouillon, J. and Pierce, B. C. (2000) Regular expression types for XML. Proceedings Int. Conference on Functional Programming (ICFP), pp. 11-22.
20. Klarlund, N., Møller, A. and Schwartzbach, M. I. (2000) DSD: A schema language for XML. http://www.brics.dk/DSD/.
21. Leroy, X., Vouillon, J., Doligez, D. et al. (1996) The Objective Caml system. Software and documentation available from: http://pauillac.inria.fr/ocaml/.
22. Milner, R., Tofte, M. and Harper, R. (1990) The Definition of Standard ML. The MIT Press.
23. Milo, T. and Suciu, D. (1999) Type inference for queries on semistructured data. Proceedings Symposium on Principles of Database Systems, pp. 215-226.
24. Milo, T., Suciu, D. and Vianu, V. (2000) Typechecking for XML transformers. Proceedings 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 11-22. ACM.
25. Murata, M. (1997) Transformation of documents and schemas by patterns and contextual conditions. Principles of Document Processing '96: Lecture Notes in Computer Science 1293, pp. 153-169. Springer-Verlag.
26. Neumann, A. and Seidl, H. (1998) Locating matches of tree patterns in forests. 18th FSTTCS: Lecture Notes in Computer Science 1530, pp. 134-145.
27. Neven, F. and Schwentick, T. (2000) Expressive and efficient pattern languages for tree-structured data. Proceedings 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 145-156. ACM.
28. Papakonstantinou, Y. and Vianu, V. (2000) DTD Inference for Views of XML Data. Proceedings 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 35-46.
29. Peyton Jones, S. L., Hall, C. V., Hammond, K., Partain, W. and Wadler, P. (1993) The Glasgow Haskell compiler: a technical overview. Proceedings UK Joint Framework for Information Technology (JFIT) Technical Conference.
30. Puel, L. and Suárez, A. (1990) Compiling pattern matching by term decomposition. 1990 ACM Conference on Lisp and Functional Programming, pp. 272-281.
31. Queinnec, C. (1990) Compilation of non-linear, second order patterns on s-expressions. Programming Language Implementation and Logic Programming, 2nd International Workshop (PLILP'90): Lecture Notes in Computer Science, pp. 340-357. Springer-Verlag.
32. Seidl, H. (1990) Deciding equivalence of finite tree automata. SIAM J. Computing, 19(3): 424-437.
33. Slutzki, Giora. (1985). Alternating tree automata. Theor. Comput. Sci., 41, 305-318.
34. Sperberg-McQueen, C. M. and Burnard, L. (n.d.) A gentle introduction to SGML, http://www-tei.uic.edu/orgs/tei/sgml/teip3sg.
35. Wright, A. K. and Cartwright, R. (1994) A practical soft type system for scheme. Proceedings ACM Conference on Lisp and Functional Programming, pp. 250-262.