9 search results - page 1 / 2 » lics 1991 |
LICS
1991
IEEE
13 years 7 months ago
1991
IEEE
LICS
1991
IEEE
13 years 7 months ago
1991
IEEE
LICS
1991
IEEE
13 years 7 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
LICS
1991
IEEE
13 years 7 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
LICS
1991
IEEE
13 years 7 months ago
1991
IEEE
Starting from a logic which speci es how to make deductions from a set of sentences (a ` at theory'), a way to generalise this toa partiallyordered bag ofsentences (a `struct...