1385 search results - page 38 / 277 » Natural Rewriting for General Term Rewriting Systems |
CADE
1992
Springer
15 years 6 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
132
click to vote
RTA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
107
click to vote
RTA
1995
Springer
15 years 5 months ago
1995
Springer
In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable...
ENTCS
2008
15 years 2 months ago
2008
Rewrite theories and their associated Kripke structures constitute a flexible and executable framework in which a wide range of systems can be studied. We present a general notion...
107
click to vote
PPDP
2007
Springer
15 years 8 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...