Determinization of conditional term rewriting systems
نویسندگان
چکیده
منابع مشابه
Determinization of conditional term rewriting systems
This paper discusses determinization of conditional term rewriting systems with oriented constructor rules. We present a rule-based transformation system, which transforms a non-deterministic one into a deterministic one, together with examples of the transformation. We prove that the transformation system is simulation sound and simulation complete. We also prove that the transformation system...
متن کاملMembership Conditional Term Rewriting Systems
We propose a new type of conditional term rewriting system: the membership-conditional term rewriting system, in which, each rewriting rule can have membership conditions which restrict the substitution values for the variables occurring in the rule. For example, the rule f(x, x, y) . g(x, y) if x ∈ T ′ yields the reduction f(M, M, N) → g(M, N) only when M is in the term set T ′. We study the c...
متن کاملAbstraction of Conditional Term Rewriting Systems
This paper introduces the notion of abstract domains for constructor-based conditional term rewriting systems and deenes the notion of abstract term rewriting systems (abstract TRS) over these domains. These new term rewriting systems are mainly used to determine or to approximate the normal forms of ground instances of concrete terms (with variables). We propose a method to compute such an abs...
متن کاملCombinations of Simplifying Conditional Term Rewriting Systems
A conditional term rewriting system (CTRS) is called simplifying if there exists a simpliication ordering > on terms such that the left-hand side of any rewrite rule is greater than the right-hand side and the terms occurring in the conditions of that rule. If a simplifying join CTRS consists of nitely many rules, it is terminating and the applicability of a rewrite rule is decidable by recursi...
متن کاملConditional Term Graph Rewriting
For eeciency reasons, term rewriting is usually implemented by graph rewriting. It is known that graph rewriting is a sound and complete implementation of (almost) orthogonal term rewriting systems; see BEG + 87]. In this paper, we extend the result to properly oriented orthogonal conditional systems with strict equality. In these systems extra variables are allowed in conditions and right-hand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.09.005