XPi: A Typed Process Calculus for XML Messaging

  • Lucia Acciai
  • Michele Boreale
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3535)


We present XPi, a core calculus for XML messaging. XPi features asynchronous communications, pattern matching, name and code mobility, integration of static and dynamic typing. Flexibility and expressiveness of this calculus are illustrated by a few examples, some concerning description and discovery of web services. In XPi, a type system disciplines XML message handling at the level of channels, patterns, and processes. A run-time safety theorem ensures that in well-typed systems no service will ever receive documents it cannot understand, and that the offered services, even if re-defined, will be consistent with the declared channel capacities.


Pattern Match Channel Capacity Type Check Code Mobility Reduction Semantic 
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.


  1. 1.
    Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation 148(1), 1–70 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Andrews, T., Curbera, F., Thatte, S.: Business Process Execution Language for Web Wervices, v1.1 (2003),
  3. 3.
    Benzaken, V., Castagna, G., Frisch, A.: Cduce: An XML-Centric General- Purpose Language. In: Proceedings of the ACM International Conference on Functional Programming (2003)Google Scholar
  4. 4.
    Bierman, G.M., Sewell, P.: Iota: A concurrent XML scripting language with applications to Home Area Networking. Technical Report 577, University of Cambridge Computer Laboratory (2003)Google Scholar
  5. 5.
    Biztalk Server Home,
  6. 6.
    Bjorg, S., Meredith, L.G.: Contracts and Types. Communication of the ACM 46(10) (October 2003)Google Scholar
  7. 7.
    Boreale, M.: On the Expressiveness of Internal Mobility in Name-Passing Calculi. Theoretical Computer Science 195 (1998)Google Scholar
  8. 8.
    Brown, A., Laneve, C., Meredith, L.G.: πDuce: A process calculus with native XML datatypes (manuscript) (2004)Google Scholar
  9. 9.
    Cardelli, L., Ghelli, G.: TQL: A Query Language Semistruictured Data Based on the Ambient Logic. Mathematical Structures in Computer Science 14, 285–327 (2004)CrossRefzbMATHGoogle Scholar
  10. 10.
    Cardelli, L., Gordon, A.D.: Mobile ambients. Theoretical Computer Science 240(1) (2000)Google Scholar
  11. 11.
    Castagna, G., De Nicola, R., Varacca, D.: Semantic subtyping for the π-calculus. To appaear in Proc. of LICS’05 (2005)Google Scholar
  12. 12.
    Christensen, E., Curbera, F., Meredith, G., Weerawarana, S.: Web Services Description Language 1.1. W3C Note (2001),
  13. 13.
    Fallside, D.C.: XML Schema Part 0: Primer. W3C Recommendation (2001),
  14. 14.
    Gardner, P., Maffeis, S.: Modelling dynamic web data. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 130–146. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  15. 15.
    Hosoya, H., Pierce, B.: Regular Expression Pattern Matching for XML. Journal of Functional Programming (2002)Google Scholar
  16. 16.
    Hosoya, H., Pierce, B.: Xduce: A Statically Typed XML Processing Language. In: Proceedings of ACM Transaction on Internet Technology (2003)Google Scholar
  17. 17.
    Merro, M.: Locality and polyadicity in asynchronous name-passing calculi. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol. 1784, pp. 238–251. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  18. 18.
    Milner, R.: The Polyadic π-Calculus: a Tutorial. Technical Report ECS-LFCS-91- 180, LFCS, Dept. of Computer Science, Edinburgh University (1991)Google Scholar
  19. 19.
    Milner, R., Parrow, J., Walker, D.: A calculus of Mobile Processes, part I and II. Information and Computation 100, 1–41, 42–78 (1992)Google Scholar
  20. 20.
    Pierce, B., Sangiorgi, D.: Typing and Subtyping for Mobile Process. Mathematical Structures in Computer Science 6(5) (1996)Google Scholar
  21. 21.
    Sangiorgi, D.: The name discipline of uniform receptiveness. Theoretical Computer Science 221 (1999)Google Scholar
  22. 22.
    Sangiorgi, D., Milner, R.: Barbed bisimulation. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630. Springer, Heidelberg (1992)Google Scholar
  23. 23.
    Web services activity web site (2002),

Copyright information

© IFIP International Federation for Information Processing 2005

Authors and Affiliations

  • Lucia Acciai
    • 1
  • Michele Boreale
    • 2
  1. 1.Laboratoire d’Informatique Fondamentale de MarseilleUniversité de ProvenceFrance
  2. 2.Dipartimento di Sistemi e InformaticaUniversità di FirenzeItaly

Personalised recommendations