1385 search results - page 35 / 277 » Natural Rewriting for General Term Rewriting Systems |
123
click to vote
CORR
2006
Springer
15 years 2 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...
CIE
2008
Springer
15 years 4 months ago
2008
Springer
We revisit Girard's reducibility candidates by proposing a general of the notion of neutral terms. They are the terms which do not interact with some contexts called eliminati...
117
click to vote
CADE
2008
Springer
15 years 4 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
The publish-subscribe paradigm is an effective approach for data publishers to asynchronously disseminate relevant data to a large number of data subscribers. A lot of recent res...
116
click to vote
RTA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...