UID:
edocfu_9959186093302883
Format:
1 online resource (VIII, 288 p.)
Edition:
1st ed. 1987.
Edition:
Online edition Springer Lecture Notes Archive ; 041142-5
ISBN:
3-540-47421-8
Series Statement:
Lecture Notes in Computer Science, 256
Content:
This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.
Note:
Bibliographic Level Mode of Issuance: Monograph
,
Term-rewriting implementation of equational logic programming -- Optimizing equational programs -- A compiler for conditional term rewriting systems -- How to choose the weights in the Knuth Bendix ordering -- Detecting looping simplifications -- Combinatorial hypermap rewriting -- The word problem for finitely presented monoids and finite canonical rewriting systems -- Term rewriting systems with priorities -- A gap between linear and non linear term-rewriting systems -- Code generator generation based on template-driven target term rewriting -- Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction -- Groups presented by certain classes of finite length-reducing string-rewriting systems -- Some results about confluence on a given congruence class -- Ground confluence -- Structured contextual rewriting -- Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes -- Completion for rewriting modulo a congruence -- On equational theories, unification and decidability -- A general complete E-unification procedure -- Improving basic narrowing techniques -- Strategy-controlled reduction and narrowing -- Algorithmic complexity of term rewriting systems -- Optimal speedups for parallel pattern matching in trees.
,
English
In:
Springer eBooks
Additional Edition:
ISBN 3-540-17220-3
Language:
English
DOI:
10.1007/3-540-17220-3
URL:
http://dx.doi.org/10.1007/3-540-17220-3
