Fast and precise regular approximations of logic programs
Proceedings of the eleventh international conference on Logic programming
Handbook of formal languages, vol. 3
One-unambiguous regular languages
Information and Computation
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Regular expression types for XML
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
XML with data values: typechecking revisited
Journal of Computer and System Sciences - Special issu on PODS 2001
Frontiers of tractability for typechecking simple XML transformations
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Using parametric set constraints for locating errors in CLP programs
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
Various schema languages have been introduced to describe (classes of) Web documents (DTD, XML Schema, Relax NG). We present mathematical treatment of their main features. We are interested in the sets of documents a schema defines; such sets will be called types. Using a mathematical formalism makes it possible to discuss chosen aspects of a schema language in a precise and simple way. Otherwise they are hidden among numerous details of a large and sophisticated schema language. Our goal is typing of rule languages, more precisely approximately describing their semantics by means of types. Thus we are interested in formalisms for types that facilitate constructing (efficient) algorithms performing those operations on types that are needed in type checking and type inference for rules.