Term rewriting systems
Reachability in Conditional Term Rewriting Systems
... of reachable terms for unrestricted join conditional term rewriting systems.. This.[r] ...
14
Term rewriting systems .net framework
... 5.2.6 Term Execution If a term has been speci ed, the rewrite rules are applied over ...terminating term rewriting systems and in nite computations, a limit of rewrites is spec- i ed by ...
107
Parallelization of Termination Checker of Term Rewriting Systems
... of Term Rewriting Systems Rui Ding, Haruhiko Sato, and Masahito Kurihara, Abstract—Inductive theorem proving plays an important role in the field of formal verification of ...The rewriting in- ...
6
Natural Narrowing for General Term Rewriting Systems
... In this paper, we propose an efficient lazy narrowing strategy called natural narrowing which can be applied to general term rewriting systems with no restrictions whatsoever.. An import[r] ...
22
Termination of linear bounded term rewriting systems
... linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of ...linear systems for which every derivation can be replaced ...
16
A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems
... Departamento de Sistemas Inform´aticos y Computaci ´on Universidad Complutense de Madrid, Spain [email protected] A BSTRACT . Formalisms involving some degree of nondeterminism are frequent in computer sci- ence. In ...
12
Approximation and Normalization Results for Typeable Term Rewriting Systems
... for term rewriting systems extended with application, and define a notion of (finite) approximation on ...rewrite systems satisfying a general scheme for recursive definitions, every typeable ...
18
Proving Reachability Properties on Term Rewriting Systems with Strategies
... Term rewriting systems [BN98], TRS for short, are a convenient way of repre- senting computer programs: a term represents the current stage of the compu- tation and rewriting rules ...
8
A faithful encoding of programmable strategies into term rewriting systems
... using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and declarative rewriting strategies are used to control their ...plain term ...
15
Confluence of nearly orthogonal infinitary term rewriting systems
... [email protected] Abstract We give a relatively simple coinductive proof of confluence, modulo equivalence of root-active terms, of nearly orthogonal infinitary term rewriting systems. Nearly ...
21
Polygraphs for termination of left-linear term rewriting systems
... INRIA Lorraine – LORIA – [email protected] 5 Abstract – We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind ...
16
Faithful (Meta-)Encodings Of Programmable Strategies Into Term Rewriting Systems
... Abstract. Rewriting is a formalism widely used in computer science and mathematical ...using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to ...
55
Characterizing and proving operational termination of deterministic conditional term rewriting systems
... We investigate the practically crucial property of operational termination of deterministic conditional term rewriting systems (DCTRSs), an important declarative programming para- digm. We show that ...
30
Dependency pairs for proving termination properties of conditional term rewriting systems
... computational systems as the absence of infinite inferences in the computational logic describing the operational semantics of the ...Conditional Term Rewriting Systems we show that ...
52
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
... Termination is one of the central properties of term rewriting systems (TRSs for short), where we say a TRS terminates if it does not admit any infinite reduction sequence. Since termination is ...
14
Homological Computations for Term Rewriting Systems
... in rewriting theory [10]: by adding derivable relations, in good cases one can obtain a set of relations which are much better behaved from a computational point of view, such as being confluent and terminating, ...
17
Reachability Analysis over Term Rewriting Systems
... Unité de recherche INRIA Lorraine, Technopôle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LÈS NANCY Unité de recherche INRIA Rennes, Irisa, [r] ...
44
Reachability Analysis over Term Rewriting Systems
... Unité de recherche INRIA Lorraine, Technopôle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LÈS NANCY Unité de recherche INRIA Rennes, Irisa, [r] ...
44
Multiset Path Orderings and Their Application to Termination of Term Rewriting Systems
... Plaisted (1978b) introduced a syntactic order on terms which consists in comparing terms by first comparing their root symbols according to a given precedence, and, in case of equality, recursively comparing the ...
16
MoL 2011 16: Completing partial algebra models of term rewriting systems
... orthogonal term rewriting system and which satisfy a certain condition on head-normal forms can be ...of term rewriting system and therefore can be taken ...
51