10271 search results - page 532 / 2055 » Computer Science |
166
click to vote
CTRS
1992
15 years 10 months ago
1992
We show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the "binary path condition," sufficesfor establishing terminat...
158
click to vote
MFCS
1993
Springer
15 years 10 months ago
1993
Springer
We view the Chu space interpretation of linear logic as an alternative interpretation of the language of the Peirce calculus of binary relations. Chu spaces amount to K-valued bin...
135
click to vote
RTA
1993
Springer
15 years 10 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...
229
click to vote
RTA
1993
Springer
15 years 10 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 ...
151
click to vote
TLCA
1993
Springer
15 years 10 months ago
1993
Springer
This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and...