29 search results - page 1 / 6 » A Finite Basis for Failure Semantics |
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
FOSSACS
2004
Springer
13 years 8 months ago
2004
Springer
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readines...
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...
LOPSTR
1994
Springer
13 years 9 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...