9 search results - page 1 / 2 » lics 1991 |
164
Voted
LICS
1991
IEEE
15 years 11 months ago
1991
IEEE
193
Voted
LICS
1991
IEEE
15 years 11 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,...
226
click to vote
LICS
1991
IEEE
15 years 11 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 ...
197
click to vote
LICS
1991
IEEE
15 years 11 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...