IFIP International Conference on Theoretical Computer Science

TCS 2010: Theoretical Computer Science pp 244-258

Concurrent Pattern Calculus

  • Thomas Given-Wilson
  • Daniele Gorla
  • Barry Jay
Conference paper

DOI: 10.1007/978-3-642-15240-5_18

Volume 323 of the book series IFIP Advances in Information and Communication Technology (IFIPAICT)

Abstract

Concurrent pattern calculus drives interaction between processes by unifying patterns, just as sequential pattern calculus drives computation by matching a pattern against a data structure. By generalising from pattern matching to unification, interaction becomes symmetrical, with information flowing in both directions. This provides a natural language for describing any form of exchange or trade. Many popular process calculi can be encoded in concurrent pattern calculus.

Download to read the full conference paper text

Copyright information

© IFIP 2010

Authors and Affiliations

  • Thomas Given-Wilson
    • 1
  • Daniele Gorla
    • 2
  • Barry Jay
    • 1
  1. 1.Centre for Quantum Computation and Intelligent Systems &, School of SoftwareUniversity of TechnologySydney
  2. 2.Dip. di InformaticaUniv. di Roma “La Sapienza”