Results 261 to 270 of about 12,133 (300)
, 1999 This chapter introduces term rewriting and some of its applications from different points of view. Rewriting is first presented as an abstract relation on a set, and properties of such relations, mainly confluence and well-foundedness, are introduced. A more concrete notion of rewriting is then defined on first-order terms.
Kirchner, Hélène, Hélène Kirchner
core +5 more sources
Innermost many-sorted term rewriting on GPUs [PDF]
Science of Computer Programming, 2023 This article presents a way to implement many-sorted term rewriting on a GPU. This is done by letting the GPU repeatedly perform a massively parallel evaluation of all subterms.
Jan Friso Groote +2 more
exaly +2 more sources
EQUATIONAL TERM GRAPH REWRITING [PDF]
Fundamenta Informaticae, 1996 We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and concurrency theory. Specifically, a homomorphism is a functional bisimulation.
Zena M. Ariola, Jan Willem Klop
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
1998
This textbook offers a unified and self-contained introduction to the field of term rewriting. It covers all the basic material (abstract reduction systems, termination, confluence, completion, and combination problems), but also some important and closely connected subjects: universal algebra, unification theory, Gröbner bases and Buchberger's ...
Franz Baader, Tobias Nipkow
openaire +1 more source
This textbook offers a unified and self-contained introduction to the field of term rewriting. It covers all the basic material (abstract reduction systems, termination, confluence, completion, and combination problems), but also some important and closely connected subjects: universal algebra, unification theory, Gröbner bases and Buchberger's ...
Franz Baader, Tobias Nipkow
openaire +1 more source
A Rewriting Machine and Optimization of Strategies of Term Rewriting
Cybernetics and Systems Analysis, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Letichevskii A, Khomenko V
openaire +2 more sources
1996
We discuss some aspects of term graph rewriting based on systems of recursion equations. This is done for first-order signatures as well as lambda calculus. Also relations with infinitary rewriting are discussed.
openaire +1 more source
We discuss some aspects of term graph rewriting based on systems of recursion equations. This is done for first-order signatures as well as lambda calculus. Also relations with infinitary rewriting are discussed.
openaire +1 more source
1990
An induction method called term rewriting induction is proposed for proving properties of term rewriting systems. It is shown that the Knuth-Bendix completion-based inductive proof procedures construct term rewriting induction proofs. It has been widely held heretofore that these procedures construct proofs by consistency, and cannot be justified as ...
openaire +1 more source
An induction method called term rewriting induction is proposed for proving properties of term rewriting systems. It is shown that the Knuth-Bendix completion-based inductive proof procedures construct term rewriting induction proofs. It has been widely held heretofore that these procedures construct proofs by consistency, and cannot be justified as ...
openaire +1 more source