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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: from relations to semistructured data and XML. Morgan Kaufmann Publishers Inc., San Francisco (2000)
Berger, S., Coquery, E., Drabent, W., Wilk, A.: Descriptive Typing Rules for Xcerpt and their Soundness. Technical report, REWERSE (2005), Available at http://rewerse.net/publications.html/#REWERSE-TR-2005-01
Brüggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology (April 2001)
Bry, F., Drabent, W., Maluszynski, J.: On subtyping of tree-structured data: A polynomial approach. In: Ohlbach, H.J., Schaffert, S. (eds.) PPSWR 2004. LNCS, vol. 3208, pp. 1–18. Springer, Heidelberg (2004)
Bry, F., Furche, T., Badea, L., Koch, C., Schaffert, S., Berger, S.: Identification of Design Principles. Deliverable I4-D2, REWERSE (2004), At http://rewerse.net/publications.html/#REWERSE-DEL-2004-I4-D2
Bry, F., Schaffert, S.: An Entailment Relation for Reasoning on the Web. In: Dignum, F.P.M., Cortés, U. (eds.) AMEC 2000. LNCS (LNAI), vol. 2003. Springer, Heidelberg (2001)
Cardelli, L.: Type Systems. In: Tucker, A.B. (ed.) The Handbook of Computer Science and Engineering, ch. 97-1, 2nd edn., CRC Press, Boca Raton (2004)
Cirstea, H., Coquery, E., Drabent, W., Fages, F., Kirchner, C., Liquori, L., Wack, B., Wilk, A.: Types for REWERSE reasoning and query languages. Deliverable I3-D4, REWERSE (2005), Available at http://rewerse.net/publications.html/#REWERSE-DEL-2005-I3-D4
Hopcroft, J.E., Ullmann, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory (2003) (Submitted)
Schaffert, S.: Xcerpt: A Rule-Based Query and Transformation Language for the Web. PhD thesis, University of Munich (2004)
Schaffert, S., Bry, F.: Querying the Web Reconsidered: A Practical Introduction to Xcerpt. In: Proceedings of Extreme Markup Languages 2004, Montreal, Quebec, Canada, August 2–6 (2004)
Wilk, A., Drabent, W.: On types for XML query language Xcerpt. In: Bry, F., Henze, N., Małuszyński, J. (eds.) PPSWR 2003. LNCS, vol. 2901, pp. 128–145. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berger, S., Coquery, E., Drabent, W., Wilk, A. (2005). Descriptive Typing Rules for Xcerpt . In: Fages, F., Soliman, S. (eds) Principles and Practice of Semantic Web Reasoning. PPSWR 2005. Lecture Notes in Computer Science, vol 3703. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11552222_9
Download citation
DOI: https://doi.org/10.1007/11552222_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28793-3
Online ISBN: 978-3-540-32028-9
eBook Packages: Computer ScienceComputer Science (R0)