1000 search results - page 121 / 200 » Nominal rewriting systems |
148
click to vote
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
164
Voted
RTA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
161
Voted
COOPIS
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper we propose a mediator architecture for the querying and integration of Web-accessible XML data sources. Our contributions are (i) the definition of a simple but expr...
154
Voted
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level r...
163
click to vote
ERSHOV
1999
Springer
15 years 10 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...