2007 |
17 | EE | Jacques Chabin,
Pierre Réty:
Visibly Pushdown Languages and Term Rewriting.
FroCos 2007: 252-266 |
2005 |
16 | EE | Pierre Réty,
Julie Vuotto:
Tree automata for rewrite strategies.
J. Symb. Comput. 40(1): 749-794 (2005) |
2002 |
15 | EE | Pierre Réty,
Julie Vuotto:
Regular Sets of Descendants by Some Rewrite Strategies.
RTA 2002: 129-143 |
14 | EE | Benoit Lecland,
Pierre Réty:
TTSLI: An Implementation of Tree-Tuple Synchronized Languages.
RTA 2002: 376-379 |
13 | EE | Pierre Réty,
Julie Vuotto:
Regular Sets of Descendants by Leftmost Strategy.
Electr. Notes Theor. Comput. Sci. 70(6): (2002) |
2001 |
12 | EE | Valérie Gouranton,
Pierre Réty,
Helmut Seidl:
Synchronized Tree Languages Revisited and New Applications.
FoSSaCS 2001: 214-229 |
11 | EE | Sébastien Limet,
Pierre Réty,
Helmut Seidl:
Weakly Regular Relations and Applications.
RTA 2001: 185-200 |
1999 |
10 | | Pierre Réty:
Regular Sets of Descendants for Constructor-Based Rewrite Systems.
LPAR 1999: 148-160 |
9 | EE | Sébastien Limet,
Pierre Réty:
A New Result about the Decidability of the Existential One-Step Rewriting Theory.
RTA 1999: 118-132 |
1998 |
8 | EE | Sébastien Limet,
Pierre Réty:
Solving Disequations Modulo Some Class of Rewrite Systems.
RTA 1998: 121-135 |
1997 |
7 | | Sébastien Limet,
Pierre Réty:
E-Unification by Means of Tree Tuple Synchronized Grammars.
TAPSOFT 1997: 429-440 |
6 | EE | Sébastien Limet,
Pierre Réty:
E-unification by means of tree tuple synchronized grammars.
Discrete Mathematics & Theoretical Computer Science 1(1): 69-98 (1997) |
1996 |
5 | | Sébastien Limet,
Pierre Réty:
Conditional Directed Narrowing.
AMAST 1996: 637-640 |
1991 |
4 | | Jacques Chabin,
Pierre Réty:
Narrowing Directed by a Graph of Terms.
RTA 1991: 112-123 |
1989 |
3 | | Werner Nutt,
Pierre Réty,
Gert Smolka:
Basic Narrowing Revisited.
J. Symb. Comput. 7(3/4): 295-317 (1989) |
1987 |
2 | | Pierre Réty:
Improving Basic Narrowing Techniques.
RTA 1987: 228-241 |
1985 |
1 | | Pierre Réty,
Claude Kirchner,
Hélène Kirchner,
Pierre Lescanne:
NARROWER: A New Algorithm for Unification and Its Application to Logic Programming.
RTA 1985: 141-157 |