Rewriting techniques and applications : Dijon, France, May 20 22, 1985
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
202 |
| Soggetti: | |
| Accesso online: | 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, first International conference on... Dijon, 20-22 May 1985, ed. by Jean-Pierre Jouannaud, Berlin, Springer, 1985, 1 vol. (VI-440 p.), Lecture notes in computer science, 3-540-15976-2 • Rewriting Techniques and Applications, Texte imprimé, 9783662176191 |
Sommario:
- Basic features and development of the critical-pair/completion procedure
- Contextual rewriting
- Thue systems as rewriting systems
- Deciding algebraic properties of monoids presented by finite church-rosser Thue systems
- Two applications of equational theories to database theory
- An experiment in partial evaluation: The generation of a compiler generator
- NARROWER: a new algorithm for unification and its application to Logic Programming
- Solving type equations by graph rewriting
- Termination
- Path of subterms ordering and recursive decomposition ordering revisited
- Associative path orderings
- A procedure for automatically proving the termination of a set of rewrite rules
- Petrireve: Proving Petri net properties with rewriting systems
- Fairness in term rewriting systems
- Two results in term rewriting theorem proving
- Handling function definitions through innermost superposition and rewriting
- An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras
- Combining unification algorithms for confined regular equational theories
- An algebraic approach to unification under associativity and commutativity
- Unification problems with one-sided distributivity
- Fast many-to-one matching algorithms
- Complexity of matching problems
- The set of unifiers in typed ?-calculus as regular expression
- Equational systems for category theory and intuitionistic logic.