Rewriting Techniques and Applications (eBook, PDF)

11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings
Redaktion: Bachmair, Leo

• Format: PDF

Produktbeschreibung

This book constitutes the refereed proceedings of the 11th International Conference on Rewriting Techniques and Applications, RTA 2000, held in Norwich, UK, in July 2000.The 15 revised full papers and three system descriptions presented together with two invited contributions were carefully reviewed and selected from 44 submissions. All current aspects of rewriting are addressed.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 282
• Erscheinungstermin: 30. Dezember 2006
• Englisch
• ISBN-13: 9783540449805
• Artikelnr.: 53107043

Inhaltsangabe

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.