Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Eelco Visser |
Stratego: A Language for Program Transformation Based on Rewriting Strategies. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Sébastien Limet, Pierre Réty, Helmut Seidl |
Weakly Regular Relations and Applications. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Michio Oyamaguchi, Yoshikatsu Ohta |
The Unification Problem for Confluent Right-Ground Term Rewriting Systems. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | René Vestergaard, James Brotherston |
A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Michaël Rusinowitch |
Rewriting for Deduction and Verification. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Denis Béchet |
Universal Interaction Systems with Only Two Agents. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Femke van Raamsdonk |
On Termination of Higher-Order Rewriting. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Armin Kühnemann, Robert Glück, Kazuhiko Kakehi 0001 |
Relating Accumulative and Non-accumulative Functional Programs. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Jordi Levy, Mateu Villaret |
Context Unification and Traversal Equations. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Jens R. Woinowski |
A Normal Form for Church-Rosser Language Systems. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Konstantin Korovin, Andrei Voronkov |
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Dieter Hofbauer |
Termination Proofs by Context-Dependent Interpretations. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Jorge Sousa Pinto |
Parallel Evaluation of Interaction Nets with MPINE. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Georg Struth |
Deriving Focused Calculi for Transitive Relations. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Alexandre Boudet, Evelyne Contejean |
Combining Pattern E-Unification Algorithms. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Christophe Ringeissen |
Matching with Free Function Symbols - A Simple Extension of Matching? |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren |
Beta Reduction Constraints. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Markus Lohrey |
On the Parallel Complexity of Tree Automata. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Toshinori Takai, Yuichi Kaji, Hiroyuki Seki |
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Markus Lohrey |
Word Problems and Confluence Problems for Restricted Semi-Thue Systems. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Richard Statman |
On the Word Problem for Combinators. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Reinhard Pichler |
The Explicit Representability of Implicit Generalizations. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Daniel J. Dougherty, Claudio Gutierrez 0001 |
Normal Forms and Reduction for Theories of Binary Relations. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Nikolaj S. Bjørner, César A. Muñoz |
Absolute Explicit Unification. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Pierre-Etienne Moreau |
REM (Reduce Elan Machine): Core of the New ELAN Compiler. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Enno Ohlebusch, Claus Claves, Claude Marché |
TALP: A Tool for the Termination Analysis of Logic Programs. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Evelyne Contejean, Antoine Coste, Benjamin Monate |
Rewriting Techniques in Theoretical Physics. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Katrin Erk, Joachim Niehren |
Parallelism Constraints. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | José Meseguer 0001 |
Rewriting Logic and Maude: Concepts and Applications. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Jordi Levy, Mateu Villaret |
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Leo Bachmair (eds.) |
Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, Proceedings |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Eduardo Bonelli, Delia Kesner, Alejandro Ríos 0001 |
A de Bruijn Notation for Higher-Order Rewriting. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Sophie Tison |
Tree Automata and Term Rewrite Systems. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Philippe de Groote |
Linear Higher-Order Matching Is NP-Complete. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Felix Joachimski, Ralph Matthes |
Standardization and Confluence for a Lambda Calculus with Generalized Applications. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Frédéric Blanqui |
Termination and Confluence of Higher-Order Rewrite Systems. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Georg Struth |
An Algebra of Resolution. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Jürgen Stuber |
Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Arts |
System Description: The Dependency Pair Method. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada |
The Calculus of algebraic Constructions. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Manfred Göbel |
Fast Rewriting of Symmetric Polynomials. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
dynamic power sum representation, fast rewriting techniques, Symmetric polynomials |
1 | Francisco Javier López-Fraguas, Jaime Sánchez-Hernández |
TOY: A Multiparadigm Declarative System. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Gilles Dowek, Thérèse Hardin, Claude Kirchner |
HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Jürgen Stuber |
Theory Path Orderings. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Manuel Clavel, Francisco Durán 0001, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer 0001, Jose F. Quesada |
The Maude System. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Femke van Raamsdonk |
Higher-Order Rewriting. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Roberto Di Cosmo, Stefano Guerrini |
Strong Normalization of Proof Nets Modulo Structural Congruences. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
Linear Logic, Proof Nets, Strong Normalization |
1 | Nachum Dershowitz, Subrata Mitra |
Jeopardy. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Takashi Nagaya, Yoshihito Toyama |
Decidability for Left-Linaer Growing Term Rewriting Systems. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Frédéric Saubion, Igor Stéphan |
On Implementation of Tree Synchronized Languages. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
Tree Synchronized Grammars, Prolog Implementation, Linear Logic, Proof Systems |
1 | Jürgen Giesl, Aart Middeldorp |
Transforming Context-Sensitive Rewrite Systems. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Friedrich Otto |
On the Connections between Rewriting and Formal Language Theory. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Albert Rubio |
A Fully Syntactic AC-RPO. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Stephan Kepser, Jörn Richts |
UNIMOK: A System for Combining Equational Unification Algorithm. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Eelco Visser |
Strategic Pattern Matching. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi |
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Robert Nieuwenhuis, José Miguel Rivero |
Solved Forms for Path Ordering Constraints. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Maria C. F. Ferreira, A. L. Ribeiro |
Context-Sensitive AC-Rewriting. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Philippe de Groote |
On the Strong Normalisation of Natural Deduction with Permutation-Conversions. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Christiane Frougny, Jacques Sakarovitch |
A Rewrite System Associated with Quadratic Pisot Units. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Hélène Touzet |
A Characterisation of Multiply Recursive Functions with Higman's Lemma. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Leo Bachmair, C. R. Ramakrishnan 0001, I. V. Ramakrishnan, Ashish Tiwari 0001 |
Normalization via Rewrite Closures. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Courcelle |
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Vincent van Oostrom |
Normalisation in Weakly Orthogonal Rewriting. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Franz Baader, Cesare Tinelli |
Deciding the Word Problem in the Union of Equational Theories Sharing Constructors. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Rakesh M. Verma, Shalitha Senanayake |
LarrowR2: A Laboratory fro Rapid Term Graph Rewriting. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Sébastien Limet, Pierre Réty |
A New Result about the Decidability of the Existential One-Step Rewriting Theory. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Dieter Hofbauer, Maria Huber |
Test Sets for the Universal and Existential Closure of Regular Tree Languages. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Jerzy Marcinkowski |
Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Paliath Narendran, Michaël Rusinowitch (eds.) |
Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener |
Automatic Monoids Versus Monoids with Finite Convergent Presentations. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Hongwei Xi |
Towards Automated Termination Proofs through "Freezing". |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Renate A. Schmidt |
E-Unification for Subsystems of S4. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Tobias Nipkow (eds.) |
Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Hubert Comon |
About Proofs by Consistency (Abstract). |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Claude Marché, Xavier Urbain |
Termination of Associative-Commutative Rewriting by Dependency Pairs. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Florent Jacquemard, Christoph Meyer 0001, Christoph Weidenbach |
Unification in Extension of Shallow Equational Theories. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez |
Algorithms and Reductions for Rewriting Problems. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Jan Willem Klop |
Origin Tracking in Term Rewriting (Abstract). |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Qing Guo, Paliath Narendran, Sandeep K. Shukla |
Unification and Matching in Process Algebras. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Genet |
Decidable Approximations of Sets of Descendants and Sets of Normal Forms. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Takahito Aoto 0001, Yoshihito Toyama |
Termination Transformation by Tree Lifting Ordering. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Olivier Danvy, Kristoffer Høgsbro Rose |
Higher-Order Rewriting and Partial Evaluation. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Enno Ohlebusch |
Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Nachum Dershowitz, Ralf Treinen |
An On-line Problem Database. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Yohji Akama |
SN Combinators and Partial Combinatory Algebras. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Satoshi Okui |
Simultaneous Critical Pairs and Church-Rosser Property. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Martin Müller 0001, Joachim Niehren |
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Waldmann |
Normalization of S-Terms is Decidable. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov |
The Decidability of Simultaneous Rigid E-Unification with One Variable. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Manfred Schmidt-Schauß, Klaus U. Schulz |
On the Exponent of Periodicity of Minimal Solutions of Context Equation. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Arts, Jürgen Giesl |
Modularity of Termination Using Dependency pairs. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Witold Charatonik, Andreas Podelski |
Co-definite Set Constraints. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Sébastien Limet, Pierre Réty |
Solving Disequations Modulo Some Class of Rewrite Systems. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Jordi Levy |
Decidable and Undecidable Second-Order Unification Problems. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Dirk Fuchs |
Coupling Saturation-Based Provers by Exchanging Positive/Negative Information. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
1 | Vincent van Oostrom |
Finite Family Developments. |
RTA |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Andrea Sattler-Klein |
New Undecidablility Results for Finitely Presented Monoids. |
RTA |
1997 |
DBLP DOI BibTeX RDF |
|
1 | Evelyne Contejean, Claude Marché, Landy Rabehasaina |
Rewrite Systems for Natural, Integral, and Rational Arithmetic. |
RTA |
1997 |
DBLP DOI BibTeX RDF |
|
1 | William McCune |
Well-Behaved Search and the Robbins Problem. |
RTA |
1997 |
DBLP DOI BibTeX RDF |
|