1458 search results - page 42 / 292 » Extended Term Rewriting Systems |
RTA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
ENTCS
2007
14 years 9 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
108
click to vote
WISE
2007
Springer
15 years 4 months ago
2007
Springer
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
LICS
1991
IEEE
15 years 1 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...