124
click to vote
RTA
15 years 4 months ago
1995 Springer 
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
101
Voted
RTA
15 years 4 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...
98
Voted
RTA
15 years 4 months ago
1995 Springer 
We use computational systems to express a completion with constraints procedure that gives priority to simpliļ¬cations. Computational systems are rewrite theories enriched by stra...
75
Voted
RTA
15 years 4 months ago
1995 Springer  74
Voted
RTA
15 years 4 months ago
1995 Springer |
Theoretical Computer Science