Concurrent pattern calculus (CPC) drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising from pattern matching to pattern unification, interaction becomes symmetrical, with information flowing in both directions. CPC provides a natural language to express trade where information exchange is pivotal to interaction. The unification allows some patterns to be more discriminating than others; hence, the behavioural theory must take this aspect into account, so that bisimulation becomes subject to compatibility of patterns. Many popular process calculi can be encoded in CPC; this allows for a gain in expressiveness, formalised through encodings. © T. Given-Wilson...
1 Introduction The study of concurrency is often conducted with the aid of process calculi. Undoubt-...
International audienceThe benchmark for computation is typically given as Turing computability; the ...
Abstract. Concurrent traces are sequences of computational steps where independent steps can be perm...
International audienceConcurrent pattern calculus (CPC) drives interaction between processes by comp...
Concurrent pattern calculus drives interaction between processes by unifying patterns, just as seque...
International audienceConcurrent pattern calculus drives interaction between processes by unifying p...
Concurrent Pattern Calculus (CPC) is a minimal calculus whose communication mechanism is based on a ...
International audienceConcurrent Pattern Calculus (CPC) is a minimal calculus whose communication me...
The expressiveness of communication primitives has been explored in a common framework based on the ...
Session types provide a static guarantee that concurrent programs respect communication protocols. R...
International audienceComputation can be considered by taking into account two dimensions: extension...
The principle behind concurrent logic programming is a set of processes which co-operate in monotoni...
International audienceWe introduce a geometry of interaction model for Mazza's multiport interaction...
The expressiveness of communication primitives has been explored in a common framework based on the ...
AbstractWe extend the π-calculus with polyadic synchronisation, a generalisation of the communicatio...
1 Introduction The study of concurrency is often conducted with the aid of process calculi. Undoubt-...
International audienceThe benchmark for computation is typically given as Turing computability; the ...
Abstract. Concurrent traces are sequences of computational steps where independent steps can be perm...
International audienceConcurrent pattern calculus (CPC) drives interaction between processes by comp...
Concurrent pattern calculus drives interaction between processes by unifying patterns, just as seque...
International audienceConcurrent pattern calculus drives interaction between processes by unifying p...
Concurrent Pattern Calculus (CPC) is a minimal calculus whose communication mechanism is based on a ...
International audienceConcurrent Pattern Calculus (CPC) is a minimal calculus whose communication me...
The expressiveness of communication primitives has been explored in a common framework based on the ...
Session types provide a static guarantee that concurrent programs respect communication protocols. R...
International audienceComputation can be considered by taking into account two dimensions: extension...
The principle behind concurrent logic programming is a set of processes which co-operate in monotoni...
International audienceWe introduce a geometry of interaction model for Mazza's multiport interaction...
The expressiveness of communication primitives has been explored in a common framework based on the ...
AbstractWe extend the π-calculus with polyadic synchronisation, a generalisation of the communicatio...
1 Introduction The study of concurrency is often conducted with the aid of process calculi. Undoubt-...
International audienceThe benchmark for computation is typically given as Turing computability; the ...
Abstract. Concurrent traces are sequences of computational steps where independent steps can be perm...