Descriptive typing rules for xcerpt

Authors:
Sacha Berger;Emmanuel Coquery;Włodzimierz Drabent;Artur Wilk
Affiliations:
Institute for Computer Science, University of Munich, Germany;INRIA Rocquencourt and Conservatoire des Arts et Métiers, France;IPI PAN, Polish Academy of Sciences, Warszawa, Poland;IDA, Linköping University, Linköping, Sweden
Venue:
PPSWR'05 Proceedings of the Third international conference on Principles and Practice of Semantic Web Reasoning
Year:
2005

Citing 2
Cited 7

Data on the Web: from relations to semistructured data and XML

Data on the Web: from relations to semistructured data and XML
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Beyond XML and RDF: the versatile web query language xcerpt

Proceedings of the 15th international conference on World Wide Web
Type inference for datalog and its application to query optimisation

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Type inference for datalog with complex type hierarchies

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Completing queries: rewriting of incomplete web queries under schema constraints

RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Towards more precise typing rules for Xcerpt

PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Effective and efficient data access in the versatile web query language xcerpt

PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
A prototype of a descriptive type system for Xcerpt

PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an approximation of its semantics. The rules can also be seen as an abstract form of a type inference algorithm (presented in previous work), and as a stage in a formal soundness proof of the algorithm. The paper considers a substantial fragment of Xcerpt; the main restriction is that we deal with data terms corresponding to trees (instead of general graphs), and we do not deal with Xcerpt rule chaining. We provide a formal semantics for the fragment of Xcerpt and a soundness theorem for the presented type system.