| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465689503316 |
|
|
Titolo |
Rewriting Techniques and Applications [[electronic resource] ] : Bordeaux, France, May 25-27, 1987. Proceedings / / edited by Pierre Lescanne |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1987.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VIII, 288 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 256 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Mathematical logic |
Computer logic |
Mathematical Logic and Formal Languages |
Logics and Meanings of Programs |
Mathematical Logic and Foundations |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
Sommario/riassunto |
|
This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987. |
|
|
|
|
|
|
|
| |