Searching for "Extended Term Rewriting Systems." – sorted by Relevance.
-
Combining Computer Algebra and Rule Based Reasoning
- /295958 e-mail: hbuendgen@(email omitted); Abstract: We present extended term rewriting systems
- Cited by 4 (2 self) – Add To MetaCart
-
Preserving Confluence for Rewrite Systems with Built-in Operations
- -Bendix completion procedure can be extended to term rewriting systems with built-in AC-operators (e. g., [Peterson
- Cited by 2 (2 self) – Add To MetaCart
-
Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem
- will extend this to term rewriting systems, but let us first see how to treat signatures. 2 At some points
- Cited by 7 (2 self) – Add To MetaCart
-
Datum
- DIPLOMARBEIT Transformation of Conditional Term Rewriting Systems ausgeführt am Institut für
- Add To MetaCart
-
A Common Intermediate Language and its Use in Partitioning Concurrent Declarative Programs
- (B)])g As with Kernel 1 , it is possible to show that the extended term-rewriting system is confluent. In order
- Cited by 2 (0 self) – Add To MetaCart
-
Termination of Narrowing Revisited 1
- into solving the corresponding reachability problem ∃¯x. (s ≈ t) → ∗ true in the extended term rewriting system
- Add To MetaCart
-
Linear-algebraic *-calculus
- . The first mecha-nism is obtained as we extend the term rewrite system to handle linear maps -- themselves
- Add To MetaCart
-
Compilation of Concurrent Declarative Languages
- that the extended term-rewriting system is confluent. In order to express the notion of guards present
- Cited by 1 (1 self) – Add To MetaCart
-
A Monadic Multi-stage Metalanguage
- of Combinatory Reduction Systems (CRS) [Klo80], which extends Term Rewriting Systems (TRS) with binders
- Cited by 9 (6 self) – Add To MetaCart

