Rewriting techniques and applications : Bordeaux, France, May 25-27, 1987 : proceedings
This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
256 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Rewriting techniques and applications, Bordeaux, France, May 25-27, 1987, proceedings, [2nd International conference on rewriting techniques and applications, RTA-87, held in Bordeaux...], éd. by Pierre Lescanne, Berlin, Springer, 1987, 1 vol. (VI-285 p.), Lecture notes in computer science, 3-540-17220-3 • Rewriting Techniques and Applications, Texte imprimé, 9783662197769 |
Taula de continguts:
- 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.