Rewriting techniques and applications : 11th international conference, RTA 2000, Norwich, UK, July 10-12, 2000 : proceedings
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
1833 |
| Hasła przedmiotowe: | |
| Dostęp 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 |
| Komentarz: |
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, 11th international conference, RTA 2000, Norwich, UK, July 10-12, 2000, proceedings, Leo Bachmair (ed.), Berlin, Springer, 2000, 1 vol. (X-273 p.), Lecture notes in computer science, 3-540-67778-X • Rewriting Techniques and Applications, Texte imprimé, 9783662210703 |
Spis treści:
- Invited Talk
- Rewriting Logic and Maude: Concepts and Applications
- Invited Tutorial
- Tree Automata and Term Rewrite Systems
- Regular Papers
- Absolute Explicit Unification
- Termination and Confluence of Higher-Order Rewrite Systems
- A de Bruijn Notation for Higher-Order Rewriting
- Rewriting Techniques in Theoretical Physics
- Normal Forms and Reduction for Theories of Binary Relations
- Parallelism Constraints
- Linear Higher-Order Matching Is NP-Complete
- Standardization and Confluence for a Lambda Calculus with Generalized Applications
- Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
- Word Problems and Confluence Problems for Restricted Semi-Thue Systems
- The Explicit Representability of Implicit Generalizations
- On the Word Problem for Combinators
- An Algebra of Resolution
- Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems
- Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
- System Descriptions
- System Description: The Dependency Pair Method
- REM (Reduce Elan Machine): Core of the New ELAN Compiler
- TALP: A Tool for the Termination Analysis of Logic Programs.