Rewriting Techniques and Applications : 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings

Bachmair, Leo

ISBN 10: 354067778X / ISBN 13: 9783540677789

Editore: Springer 2000-06, 2000

Riguardo questo articolo

Codice articolo 6666-IUK-9783540677789

Dati bibliografici

Titolo: Rewriting Techniques and Applications : 11th...

Casa editrice: Springer 2000-06

Data di pubblicazione: 2000

Legatura: PF

Condizione: New

Descrizione articolo

Riassunto:

RichardKennaway(Norwich) PublicityChair Jos´ eMeseguer(MenloPark) RTAOrganizingCommittee HubertComon(Cachan) TobiasNipkow(Munich) NachumDershowitz,chair(Urbana) MichaelRusinowitch(Nancy) Jos´ eMeseguer(MenloPark) YoshihitoToyama(Tatsunokuchi) External Referees VII ExternalReferees Y. Akama T. Aoto T. Arts F. Blanqui R. Bloo A. Boudet J. Chrzaszcz E. Contejean D. Dougherty K. Erk M. Fernandez W. Fokkink G. Godoy B. Gramlich T. Ida F. Jacquemard S. Kahrs Y. Kaji D. Kesner K. Kusakari F. Lang C. Luth ¨ M. Leucker J. Levy R. Matthes R. Mayr B. Monate J. J. MorenoNavarro M. Nagayama P. Narendran J. Niehren R. Nieuwenhuis K. Ogata E. Ohlebusch S. Okui C. -H. L.

Contenuti:

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.