Concurrent Pattern Calculus - Theoretical Computer Science Access content directly
Conference Papers Year : 2010

Concurrent Pattern Calculus

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.
Fichier principal
Vignette du fichier
03230244.pdf (195.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01054456 , version 1 (06-08-2014)

Licence

Attribution

Identifiers

Cite

Thomas Given-Wilson, Daniele Gorla, Barry Jay. Concurrent Pattern Calculus. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.244-258, ⟨10.1007/978-3-642-15240-5_18⟩. ⟨hal-01054456⟩
115 View
118 Download

Altmetric

Share

Gmail Facebook X LinkedIn More