|
|
Conferences in DBLP
- Henk Barendregt
Computing and Proving. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:1- [Conf]
- Michaël Rusinowitch
Rewriting for Deduction and Verification. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:2- [Conf]
- Denis Bechet
Universal Interaction Systems with Only Two Agents. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:3-14 [Conf]
- Alessandro Berarducci, Corrado Böhm
General Recursion on Second Order Term Algebras. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:15-30 [Conf]
- Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren
Beta Reduction Constraints. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:31-46 [Conf]
- Eduardo Bonelli, Delia Kesner, Alejandro Ríos
From Higher-Order to First-Order Rewriting. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:47-62 [Conf]
- Alexandre Boudet, Evelyne Contejean
Combining Pattern E-Unification Algorithms. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:63-76 [Conf]
- Horatiu Cirstea, Claude Kirchner, Luigi Liquori
Matching Power. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:77-92 [Conf]
- Jürgen Giesl, Deepak Kapur
Dependency Pairs for Equational Rewriting. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:93-108 [Conf]
- Dieter Hofbauer
Termination Proofs by Context-Dependent Interpretations. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:108-121 [Conf]
- Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom
Uniform Normalisation beyond Orthogonality. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:122-136 [Conf]
- Konstantin Korovin, Andrei Voronkov
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:137-153 [Conf]
- Armin Kühnemann, Robert Glück, Kazuhiko Kakehi
Relating Accumulative and Non-accumulative Functional Programs. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:154-168 [Conf]
- Jordi Levy, Mateu Villaret
Context Unification and Traversal Equations. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:169-184 [Conf]
- Sébastien Limet, Pierre Réty, Helmut Seidl
Weakly Regular Relations and Applications. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:185-200 [Conf]
- Markus Lohrey
On the Parallel Complexity of Tree Automata. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:201-215 [Conf]
- Salvador Lucas
Transfinite Rewriting Semantics for Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:216-230 [Conf]
- Christopher Lynch, Barbara Morawska
Goal-Directed E-Unification. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:231-245 [Conf]
- Michio Oyamaguchi, Yoshikatsu Ohta
The Unification Problem for Confluent Right-Ground Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:246-260 [Conf]
- Femke van Raamsdonk
On Termination of Higher-Order Rewriting. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:261-275 [Conf]
- Christophe Ringeissen
Matching with Free Function Symbols - A Simple Extension of Matching? [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:276-290 [Conf]
- Georg Struth
Deriving Focused Calculi for Transitive Relations. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:291-305 [Conf]
- René Vestergaard, James Brotherston
A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:306-321 [Conf]
- Jens R. Woinowski
A Normal Form for Church-Rosser Language Systems. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:322-337 [Conf]
- Toshiyuki Yamada
Confluence and Termination of Simply Typed Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:338-352 [Conf]
- Jorge Sousa Pinto
Parallel Evaluation of Interaction Nets with MPINE. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:353-356 [Conf]
- Eelco Visser
Stratego: A Language for Program Transformation Based on Rewriting Strategies. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:357-362 [Conf]
|
