74 search results - page 1 / 15 » Extending Context-Sensitivity in Term Rewriting |
CORR
2009
Springer
13 years 8 months ago
2009
Springer
ENTCS
2008
13 years 11 months ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
RTA
2004
Springer
14 years 4 months ago
2004
Springer
Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in esta...
FOSSACS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
RTA
2004
Springer
14 years 4 months ago
2004
Springer
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...