Searching for "Order-Sorted Term Rewriting." – sorted by Relevance.
-
On Modularity of Completeness in Order-Sorted Term Rewriting Systems
- On Modularity of Completeness in Order-Sorted Term Rewriting Systems Yoshinobu Kawabe
- Add To MetaCart
-
Order-Sorted Dependency Pairs ∗
- be modeled as order-sorted term rewriting systems (OS-TRSs). Often, termination of such programs heavily
- Add To MetaCart
-
Introducing TRIM
- specification into TRIM code. The fact that TRIM supports order sorted term rewriting natively differentiates
- Add To MetaCart
-
Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions
- algebra, and operational semantics given by order-sorted term rewriting [19, 14, 15, 23]. Our experience
- Cited by 186 (29 self) – Add To MetaCart
-
CafeOBJ User's Manual --- ver.1.3 ---
- semantics is given by a conditional order-sorted term rewriting system. These theoretical bases
- Add To MetaCart
-
Termination of Order-Sorted Rewriting with Non-Minimal Signatures Yoshinobu KAWABE
- termination. key words: Order-Sorted Term Rewriting Systems, Termination, Non-minimal Signatures 1
- Add To MetaCart
-
Interchange Format for Inter-Operability of Tools and Translation - The SALSA and . . .
- the variants including term rewriting with priority, with strategies, order-sorted term rewriting, etc.), (many-sorted
- Add To MetaCart
-
Partial Derivatives of Regular Expressions and Finite Automata Constructions
- program consists of several order-sorted term-rewriting systems implementing, in particular, Def.4
- Cited by 27 (0 self) – Add To MetaCart
-
CafeOBJ User's Manual - ver.1.4
- the operational semantics is given by a conditional order-sorted term rewriting system. These theoretical bases
- Cited by 3 (1 self) – Add To MetaCart
-
Modularity in Many-sorted Term Rewriting Systems
- and infinite rewriting, conditional term rewriting, term rewriting with rule priorities and order-sorted term
- Cited by 1 (0 self) – Add To MetaCart

