default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th RTA 2000: Norwich, UK
- Leo Bachmair:
Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, Proceedings. Lecture Notes in Computer Science 1833, Springer 2000, ISBN 3-540-67778-X
Invited Talk
- José Meseguer:
Rewriting Logic and Maude: Concepts and Applications. 1-26
Invited Tutorial
- Sophie Tison
:
Tree Automata and Term Rewrite Systems. 27-30
Regular Papers
- Nikolaj S. Bjørner, César A. Muñoz:
Absolute Explicit Unification. 31-46 - Frédéric Blanqui:
Termination and Confluence of Higher-Order Rewrite Systems. 47-61 - Eduardo Bonelli, Delia Kesner, Alejandro Ríos:
A de Bruijn Notation for Higher-Order Rewriting. 62-79 - Evelyne Contejean, Antoine Coste, Benjamin Monate:
Rewriting Techniques in Theoretical Physics. 80-94 - Daniel J. Dougherty, Claudio Gutierrez:
Normal Forms and Reduction for Theories of Binary Relations. 95-109 - Katrin Erk, Joachim Niehren:
Parallelism Constraints. 110-126 - Philippe de Groote:
Linear Higher-Order Matching Is NP-Complete. 127-140 - Felix Joachimski, Ralph Matthes:
Standardization and Confluence for a Lambda Calculus with Generalized Applications. 141-155 - Jordi Levy, Mateu Villaret:
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints. 156-171 - Markus Lohrey:
Word Problems and Confluence Problems for Restricted Semi-Thue Systems. 172-186 - Reinhard Pichler:
The Explicit Representability of Implicit Generalizations. 187-202 - Richard Statman:
On the Word Problem for Combinators. 203-213 - Georg Struth:
An Algebra of Resolution. 214-228 - Jürgen Stuber:
Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems. 229-245 - Toshinori Takai, Yuichi Kaji, Hiroyuki Seki:
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. 246-260
System Descriptions
- Thomas Arts:
System Description: The Dependency Pair Method. 261-264 - Pierre-Etienne Moreau:
REM (Reduce Elan Machine): Core of the New ELAN Compiler. 265-269 - Enno Ohlebusch, Claus Claves, Claude Marché:
TALP: A Tool for the Termination Analysis of Logic Programs. 270-273
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-19 20:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
