Titlebook: Rewriting Techniques and Applications; Bordeaux, France, Ma Pierre Lescanne Conference proceedings 1987 Springer-Verlag Berlin Heidelberg 1

轿车

Conference proceedings 1987This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.

腐烂

https://doi.org/10.1007/3-540-17220-3Monoid; algorithms; automata; complexity; logic; programming; term rewriting

NIL

guardianship

Rewriting Techniques and Applications978-3-540-47421-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

Deference

0302-9743 Overview: This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.978-3-540-17220-8978-3-540-47421-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

愉快么

A compiler for conditional term rewriting systems,In this paper, we present a . for conditional term rewriting systems. With respect to traditional interpreters, the gain in execution time that we obtain is of several orders of magnitude. We discuss several optimizations, among which a method to share code in the premises of the conditional rules, well-adapted to algebraic specifications.

Defense

Term rewriting systems with priorities,Term rewriting systems with rules of different priority are introduced. The semantics are explained in detail and several examples are discussed. . Partial support received from the European Communities under Esprit contract no. 432, Meteor (An integrated formal approach to industrial software development).

nepotism

不真

Structured contextual rewriting,In this paper, we develop a mechanism, which we call ., (SCS for short,) to deal with some non-finitely-based algebraic specifications. The sufficient condition for confluence and termination of this kind of systems is also considered, based on a generalization of the approach by O‘Donell.

音乐会

Completion for rewriting modulo a congruence,We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our methods as equational inference systems and describe techniques for reasoning about such systems.