Regular Tree Language Recognition with Static Information

This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type system.

[1]  Frank Neven,et al.  Automata theory for XML researchers , 2002, SGMD.

[2]  Benjamin C. Pierce,et al.  Regular expression pattern matching for XML , 2003, POPL '01.

[3]  Michael Y. Levin.  Compiling regular patterns , 2003, ICFP '03.

[4]  Philip Wadler,et al.  The essence of XML , 2003, POPL '03.

[5]  Giuseppe Castagna,et al.  CDuce: an XML-centric general-purpose language , 2003, ACM SIGPLAN Notices.

[6]  Giuseppe Castagna,et al.  Semantic subtyping , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[7]  C. M. Sperberg-McQueen,et al.  Extensible Markup Language (XML) , 1997, World Wide Web J..

[8]  Helmut Seidl,et al.  Locating Matches of Tree Patterns in Forests , 1998, FSTTCS.

[9]  Benjamin C. Pierce,et al.  Regular Object Types , 2003, ECOOP.

[10]  C. M. Sperberg-McQueen,et al.  eXtensible Markup Language (XML) 1.0 (Second Edition) , 2000 .

[11]  Benjamin C. Pierce,et al.  Regular expression types for XML , 2005, ACM Trans. Program. Lang. Syst..