32 search results - page 3 / 7 » Concurrent Rewriting for Graphs with Equivalences |
125
click to vote
GG
2008
Springer
14 years 11 months ago
2008
Springer
Behavior preservation, namely the fact that the behavior of a model is not altered by the transformations, is a crucial property in refactoring. The most common approaches to behav...
101
click to vote
ENTCS
2007
14 years 10 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
ENTCS
2002
14 years 9 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
LICS
1994
IEEE
15 years 2 months ago
1994
IEEE
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
FSTTCS
2003
Springer
15 years 3 months ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...