6 search results - page 1 / 2 » Solution to the Problem of Zantema on a Persistent Property ... |
PLILP
1998
Springer
13 years 9 months ago
1998
Springer
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system (R), ...
RTA
1993
Springer
13 years 9 months ago
1993
Springer
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
FROCOS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
ENTCS
2006
13 years 4 months ago
2006
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very ...
JAR
2010
12 years 11 months ago
2010
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...