( en | de | ru )

 

Disambiguation of "Réty, Pierre"

Author of the publication

copydeleteadd this publication to your clipboard
Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution.

, , , and . ICTAC, volume 6255 of Lecture Notes in Computer Science, page 60-75. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Pierre Gottschlich

Pierre Mattern

Pierre Mangold

Pierre Nyabyenda

Piérre Schulze

 

Other publications of authors with the same name

Conservative Type Extensions for XML Data., , , and . Trans. Large Scale Data Knowl. Centered Syst., (2013)Visibly Pushdown Languages and Term Rewriting., and . FroCoS, volume 4720 of Lecture Notes in Computer Science, page 252-266. Springer, (2007)An Attempt of Integration of LSE Narrowing and Directed Narrowing., and . UNIF, page 34-37. (1995)Over-approximating Descendants by Synchronized Tree Languages., , and . RTA, volume 21 of LIPIcs, page 128-142. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)TTSLI: An Implementation of Tree-Tuple Synchronized Languages., and . RTA, volume 2378 of Lecture Notes in Computer Science, page 376-379. Springer, (2002)NARROWER: A New Algorithm for Unification and Its Application to Logic Programming., , , and . RTA, volume 202 of Lecture Notes in Computer Science, page 141-157. Springer, (1985)Over-Approximating Terms Reachable by Context-Sensitive Rewriting., and . RP, volume 9328 of Lecture Notes in Computer Science, page 128-139. Springer, (2015)E-unification by means of tree tuple synchronized grammars., and . Discret. Math. Theor. Comput. Sci., 1 (1): 69-98 (1997)Synchronized Tree Languages Revisited and New Applications., , and . FoSSaCS, volume 2030 of Lecture Notes in Computer Science, page 214-229. Springer, (2001)Narrowing Directed by a Graph of Terms., and . RTA, volume 488 of Lecture Notes in Computer Science, page 112-123. Springer, (1991)