Skip to main content

Towards Types for Web Rule Languages

  • Chapter
  • 691 Accesses

Part of the Lecture Notes in Computer Science book series (LNISA,volume 3564)

Abstract

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.

Keywords

  • Regular Expression
  • Regular Language
  • Data Term
  • Tree Automaton
  • Tree Language

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   74.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  2. Alon, N., Milo, T., Neven, F., Suciu, D., Vianu, V.: XML with data values: Typechecking revisited. J. Comput. Syst. Sci. 66(4), 688–727 (2003)

    CrossRef  MATH  MathSciNet  Google Scholar 

  3. 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)

    Google Scholar 

  4. Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation 142(2), 182–206 (1998)

    CrossRef  MATH  MathSciNet  Google Scholar 

  5. Bry, F., Drabent, W., Małuszyński, J.: On subtyping of treestructured data: A polynomial approach. In: Ohlbach, H.J., Schaffert, S. (eds.) PPSWR 2004. LNCS, vol. 3208, pp. 1–18. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  6. Clark, J., Murata, M. (eds.): RELAX NG specification (December 2001), http://www.oasis-open.org/committees/relax-ng/spec-20011203.html

  7. Common, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), http://www.grappa.univ-ille3.fr/tata/

  8. Dart, P., Zobel, J.: A regular type language for logic programs. In: Pfenning, F. (ed.) Types in Logic Programming, pp. 157–187. The MIT Press, Cambridge (1992)

    Google Scholar 

  9. Drabent, W., Maluszynski, J., Pietrzak, P.: Using parametric set constraints for locating errors in CLP programs. Theory and Practice of Logic Programming 2(4–5), 549–610 (2002)

    CrossRef  MATH  MathSciNet  Google Scholar 

  10. Extensible markup language (XML) 1.0 (second edition), W3C recommendation (October 6, 2000), http://www.w3.org/TR/REC-xml

  11. Fallside, D.C. (ed.): XML Schema part 0: Primer. W3C Recommendation (2001), http://www.w3.org/TR/xmlschema-0/

  12. Gallagher, J., de Waal, D.A.: Fast and precise regular approximations of logic programs. In: Van Hentenryck, P. (ed.) Proc. of the Eleventh International Conference on Logic Programming, pp. 599–613. The MIT Press, Cambridge (1994)

    Google Scholar 

  13. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. BeyondWords, vol. 3. Springer-Verlag, Heidelberg (1997)

    Google Scholar 

  14. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  15. Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. In: ICFP 2000, pp. 11–22 (2000)

    Google Scholar 

  16. Donald, E.: Fundamental Algorithms, 2nd edn. The Art of Computer Programming. Addison-Wesley, Reading (1973)

    Google Scholar 

  17. Martens, W., Neven, F.: Frontiers of tractability for typechecking simple XML transformations. In: PODS 2004, pp. 23–34 (2004)

    Google Scholar 

  18. Murata, M., Lee, D., Mani, M.: Taxonomy of XML schema languages using formal language theory. In: Extreme Markup Langages, Montreal, Canada (2001), http://www.cs.ucla.edu/~dongwon/paper/

  19. Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory (2003) (submitted)

    Google Scholar 

  20. Neven, F., Schwentick, T.: XML schemas without order. Unpublished (1999)

    Google Scholar 

  21. 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)

    Google Scholar 

  22. 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)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Drabent, W. (2005). Towards Types for Web Rule Languages. In: Eisinger, N., Małuszyński, J. (eds) Reasoning Web. Lecture Notes in Computer Science, vol 3564. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11526988_10

Download citation

  • DOI: https://doi.org/10.1007/11526988_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27828-3

  • Online ISBN: 978-3-540-31675-6

  • eBook Packages: Computer ScienceComputer Science (R0)