88 search results - page 1 / 18 » Matching Systems for Concurrent Calculi |
ENTCS
2008
13 years 4 months ago
2008
Matching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and...
IFIPTCS
2010
13 years 2 months ago
2010
Abstract. Concurrent pattern calculus drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising fro...
FLOPS
2004
Springer
13 years 10 months ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
FSEN
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
ENTCS
2007
13 years 4 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...