RTA
1995
Springer
13 years 11 months ago
1995
Springer
RTA
1995
Springer
13 years 11 months ago
1995
Springer
RTA
1995
Springer
13 years 11 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 ...
RTA
1995
Springer
13 years 11 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
RTA
1995
Springer
13 years 11 months ago
1995
Springer
RTA
1995
Springer
13 years 11 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...
MFCS
1995
Springer
13 years 11 months ago
1995
Springer
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...
MFCS
1995
Springer
13 years 11 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
MFCS
1995
Springer
13 years 11 months ago
1995
Springer
MFCS
1995
Springer
13 years 11 months ago
1995
Springer
In AS , we de ned a notion of measure on the complexity class P in the spirit of the work of Lutz L92 that provides a notion of measure on complexity classes at least as large as...