Add to ORKGFormally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs are compiled into Minimal Term Rewriting Systems (MTRSs), a subclass of TRSs in which all rules have an extremely simple form. A notion of simulation of (rewrite) relations is presented, under which an MTRSs can be said to simulate a TRS. The MTRS rules can be directly interpreted as instructions for an extremely simple Abstract Rewriting Machine (ARM). Favourable practical results have already been obtained with an earlier version of ARM
(eng) We propose Addressed Term Rewriting Systems (ATRS) as a solution to the still-standing problem...
In this paper, we propose the notion of reducibility of symbols in term rewriting systems (TRSs). Fo...
Transformations from conditional term rewriting systems (CTRSs) over (original) signatures into term...
A simple, efficient, and correct compilation technique for left-linear Term Rewriting Systems (TRSs)...
A new compilation technique for left-linear term-rewriting systems is presented, where rewrite rules...
textabstractA new compilation technique for left-linear term rewriting systems is presented, where r...
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules...
A simple, efficient, and correct compilation technique for left-linear Term Rewriting Systems (TRSs)...
Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, wher...
This thesis considers three aspects of the (efficient) implementation of term rewrite systems. For e...
Many systems are at least partly or implicitly based on term rewriting. Examples are functional lang...
textabstractMany systems are at least partly or implicitly based on term rewriting. Examples are fun...
. Monads can be used to model term rewriting systems by generalising the well-known equivalence betw...
Abstract. We present a translation function from nominal rewriting systems (NRSs) to combinatory red...
Given the set ℐ of terms, a congruence ∼ on ℐ and a set N of representatives for ∼, we say a term re...
(eng) We propose Addressed Term Rewriting Systems (ATRS) as a solution to the still-standing problem...
In this paper, we propose the notion of reducibility of symbols in term rewriting systems (TRSs). Fo...
Transformations from conditional term rewriting systems (CTRSs) over (original) signatures into term...
A simple, efficient, and correct compilation technique for left-linear Term Rewriting Systems (TRSs)...
A new compilation technique for left-linear term-rewriting systems is presented, where rewrite rules...
textabstractA new compilation technique for left-linear term rewriting systems is presented, where r...
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules...
A simple, efficient, and correct compilation technique for left-linear Term Rewriting Systems (TRSs)...
Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, wher...
This thesis considers three aspects of the (efficient) implementation of term rewrite systems. For e...
Many systems are at least partly or implicitly based on term rewriting. Examples are functional lang...
textabstractMany systems are at least partly or implicitly based on term rewriting. Examples are fun...
. Monads can be used to model term rewriting systems by generalising the well-known equivalence betw...
Abstract. We present a translation function from nominal rewriting systems (NRSs) to combinatory red...
Given the set ℐ of terms, a congruence ∼ on ℐ and a set N of representatives for ∼, we say a term re...
(eng) We propose Addressed Term Rewriting Systems (ATRS) as a solution to the still-standing problem...
In this paper, we propose the notion of reducibility of symbols in term rewriting systems (TRSs). Fo...
Transformations from conditional term rewriting systems (CTRSs) over (original) signatures into term...