1458 search results - page 29 / 292 » Extended Term Rewriting Systems |
JFLP
2002
13 years 7 months ago
2002
In this paper we extend the lazy narrowing calculus lnc of Middeldorp, Okui, and Ida [26] to conditional rewrite systems. The resulting lazy conditional narrowing calculus lcnc is...
RTA
1991
Springer
13 years 11 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
ALP
1994
Springer
13 years 11 months ago
1994
Springer
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present ...
CONCUR
2003
Springer
14 years 19 days ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...