Results 271 to 280 of about 12,133 (300)

Fairness in term rewriting systems

1985
The notion of fair derivation in a term-rewriting system is introduced, whereby every rewrite rule enabled infinitely often along a derivation is infinitely-often applied. A term-rewriting system is fairly-terminating iff all its fair derivations are finite.
Sara Porat, Nissim Francez
openaire   +2 more sources

Transfinite Rewriting Semantics for Term Rewriting Systems

2001
We provide some new results concerning the use of transfinite rewriting for giving semantics to rewrite systems. We especially (but not only) consider the computation of possibly infinite constructor terms by transfinite rewriting due to their interest in many programming languages. We reconsider the problem of compressing transfinite rewrite sequences
openaire   +1 more source

Proof Terms for Infinitary Rewriting

2014
We generalize the notion of proof term to the realm of transfinite reduction. Proof terms represent reductions in the first-order term format, thereby facilitating their formal analysis. Transfinite reductions can be faithfully represented as infinitary proof terms, unique up to infinitary associativity.
Carlos Lombardi, Alejandro Ríos 0001, Roel de Vrijer   +2 more
openaire   +1 more source

Term Rewriting Systems and Algebra

1984
This paper presents two ideas for proving theorems in algebra. First the equivalence of two presentations of algebras is verified by attempting to make them equivalent to the same noetherian and confluent set of rewrite rules. Second the knuth-Bendix procedures that performs that conevergence often fails by generating too big or non directable rules ...
openaire   +1 more source

Murg term rewrite systems

Information Processing Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Constrained Term Rewriting tooL

2015
This paper discusses Ctrl, a tool to analyse --- both automatically and manually --- term rewriting with logical constraints. Ctrl can be used with TRSs on arbitrary underlying logics, and automatically analyse various properties such as termination, confluence and quasi-reductivity.
Cynthia Kop, Naoki Nishida 0001
openaire   +1 more source

Term rewriting with sharing and memoïzation

2005
Jungle evaluation is an approach to define term rewriting with sharing based on graph grammars. This approach preserves important properties of term rewriting like termination, and confluence for terminating systems (under mild restrictions).
openaire   +1 more source

Type removal in term rewriting

1993
A property of many-sorted term rewriting systems is called persistent if it is not affected by removing the corresponding typing restriction. Persistency turns out to be a generalization of direct sum modularity. It is a more powerful tool for proving confluence and normalization properties.
openaire   +2 more sources

Relative Undecidability in Term Rewriting

Information and Computation, 2002
Aart Middeldorp, Hans Zantema
exaly   +2 more sources

Term rewriting with traversal functions

ACM Transactions on Software Engineering and Methodology, 2003
Paul Klint, Jürgen J Vinju
exaly