417 search results - page 12 / 84 » Orderings for Innermost Termination |
CADE
1994
Springer
15 years 3 months ago
1994
Springer
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
LICS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
RTA
1993
Springer
15 years 3 months ago
1993
Springer
Abstract. We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving...
CADE
2006
Springer
16 years 2 days ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
TWC
2008
14 years 11 months ago
2008
In this paper we propose a cross-layer handoff ordering scheme. The frame success rate (FSR) is adopted as the basis of prioritization. Different quality of service (QoS) requireme...