Rewriting Techniques and Applications [[electronic resource] ] : 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings / / edited by Leo Bachmair
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Rewriting Techniques and Applications [[electronic resource] ] : 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings / / edited by Leo Bachmair
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Edizione: | 1st ed. 2000. |
| Descrizione fisica: | 1 online resource (X, 282 p.) |
| Disciplina: | 005.13/1 |
| Soggetto topico: | Software engineering |
| Mathematical logic | |
| Computer logic | |
| Programming languages (Electronic computers) | |
| Artificial intelligence | |
| Computer science—Mathematics | |
| Software Engineering/Programming and Operating Systems | |
| Mathematical Logic and Formal Languages | |
| Logics and Meanings of Programs | |
| Programming Languages, Compilers, Interpreters | |
| Artificial Intelligence | |
| Symbolic and Algebraic Manipulation | |
| Persona (resp. second.): | BachmairLeo |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references. |
| Nota di contenuto: | 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. |
| Titolo autorizzato: | Rewriting Techniques and Applications |
| ISBN: | 3-540-44980-9 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996466152503316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Lecture Notes in Computer Science, . 0302-9743 ; ; 1833