The SCEAS System
| |||||||

## Search the dblp DataBase
Pierre Réty:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Sébastien Limet, Pierre Réty
**Conditional Directed Narrowing.**[Citation Graph (0, 0)][DBLP] AMAST, 1996, pp:637-640 [Conf] - Valérie Gouranton, Pierre Réty, Helmut Seidl
**Synchronized Tree Languages Revisited and New Applications.**[Citation Graph (0, 0)][DBLP] FoSSaCS, 2001, pp:214-229 [Conf] - Pierre Réty
**Regular Sets of Descendants for Constructor-Based Rewrite Systems.**[Citation Graph (0, 0)][DBLP] LPAR, 1999, pp:148-160 [Conf] - Jacques Chabin, Pierre Réty
**Narrowing Directed by a Graph of Terms.**[Citation Graph (0, 0)][DBLP] RTA, 1991, pp:112-123 [Conf] - Benoit Lecland, Pierre Réty
**TTSLI: An Implementation of Tree-Tuple Synchronized Languages.**[Citation Graph (0, 0)][DBLP] RTA, 2002, pp:376-379 [Conf] - Sébastien Limet, Pierre Réty
**Solving Disequations Modulo Some Class of Rewrite Systems.**[Citation Graph (0, 0)][DBLP] RTA, 1998, pp:121-135 [Conf] - Sébastien Limet, Pierre Réty
**A New Result about the Decidability of the Existential One-Step Rewriting Theory.**[Citation Graph (0, 0)][DBLP] RTA, 1999, pp:118-132 [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] - Pierre Réty
**Improving Basic Narrowing Techniques.**[Citation Graph (0, 0)][DBLP] RTA, 1987, pp:228-241 [Conf] - Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne
**NARROWER: A New Algorithm for Unification and Its Application to Logic Programming.**[Citation Graph (0, 0)][DBLP] RTA, 1985, pp:141-157 [Conf] - Pierre Réty, Julie Vuotto
**Regular Sets of Descendants by Some Rewrite Strategies.**[Citation Graph (0, 0)][DBLP] RTA, 2002, pp:129-143 [Conf] - Sébastien Limet, Pierre Réty
**E-Unification by Means of Tree Tuple Synchronized Grammars.**[Citation Graph (0, 0)][DBLP] TAPSOFT, 1997, pp:429-440 [Conf] - Sébastien Limet, Pierre Réty
**E-unification by means of tree tuple synchronized grammars.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 1997, v:1, n:1, pp:69-98 [Journal] - Pierre Réty, Julie Vuotto
**Regular Sets of Descendants by Leftmost Strategy.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2002, v:70, n:6, pp:- [Journal] - Werner Nutt, Pierre Réty, Gert Smolka
**Basic Narrowing Revisited.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1989, v:7, n:3/4, pp:295-317 [Journal] - Pierre Réty, Julie Vuotto
**Tree automata for rewrite strategies.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 2005, v:40, n:1, pp:749-794 [Journal] - Jacques Chabin, Pierre Réty
**Visibly Pushdown Languages and Term Rewriting.**[Citation Graph (0, 0)][DBLP] FroCos, 2007, pp:252-266 [Conf] **Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |