74 search results - page 6 / 15 » Extending Context-Sensitivity in Term Rewriting |
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
92
Voted
FROCOS
2009
Springer
15 years 4 months ago
2009
Springer
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
72
Voted
CADE
2008
Springer
15 years 10 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...