A typed calculus for querying distributed XML documents

  • Authors:
  • Lucia Acciai;Michele Boreale;Silvano Dal Zilio

  • Affiliations:
  • Laboratoire d'Informatique Fondamentale de Marseille, CNRS and Université de Provence, France;Dipartimento di Sistemi e Informatica, Università di Firenze, Italy;Laboratoire d'Informatique Fondamentale de Marseille, CNRS and Université de Provence, France

  • Venue:
  • TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the problems related to querying large, distributed XML documents. Our proposal takes the form of a new process calculus in which XML data are processes that can be queried by means of concurrent pattern-matching expressions. What we achieve is a functional, strongly-typed programming model based on three main ingredients: an asynchronous process calculus that draws features from π-calculus and concurrent-ML; a model where both documents and expressions are represented as processes, and where evaluation is represented as a parallel composition of the two; a static type system based on regular expression types.