One-unambiguous regular languages
Information and Computation
XDuce: A statically typed XML processing language
ACM Transactions on Internet Technology (TOIT)
CDuce: an XML-centric general-purpose language
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Regular expression pattern matching for XML
Journal of Functional Programming
DTDs versus XML schema: a practical study
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Regular expression types for XML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
An edit operation-based approach to the inclusion problem for DTDs
Proceedings of the 2007 ACM symposium on Applied computing
XHaskell --- Adding Regular Expression Types to Haskell
Implementation and Application of Functional Languages
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
Language and Automata Theory and Applications
Efficient asymmetric inclusion between regular expression types
Proceedings of the 12th International Conference on Database Theory
Efficient inclusion for a class of XML types with interleaving and counting
DBPL'07 Proceedings of the 11th international conference on Database programming languages
A gentle introduction to semantic subtyping
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.01 |
Most type systems of statically typed XML processing languages are implemented based on regular expression types, where subtyping reduces to checking inclusion between tree automata, which is not efficient enough. The paper proposes the regular tree grammars with disjoint production rules and presents a subtyping method which is based on checking inclusion between regular expressions. The commonly used XML schema languages such as DTDs and XML Schemas can be described by the restricted grammars. The method works in a bottom-up way on the structures of type expressions. According to the regular expressions used in XML schema languages, different inclusion algorithms can be applied to this method. Experiments show the effectiveness of our method.