Pierre Réty

Available identifiers

zbMath Open rety.pierreMaRDI QIDQ1675158

List of research outcomes

Publication	Date of Publication	Type
Approximating any logic program by a CS-program	2023-07-28	Paper
Narrowing directed by a graph of terms	2022-12-09	Paper
Modular termination of prefix-constrained term rewrite systems	2021-12-14	Paper
https://portal.mardi4nfdi.de/entity/Q4993332	2021-06-15	Paper
Towards more precise rewriting approximations	2019-06-25	Paper
Over-approximating terms reachable by context-sensitive rewriting	2017-10-27	Paper
https://portal.mardi4nfdi.de/entity/Q2958380	2017-02-01	Paper
Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems	2016-10-21	Paper
Towards More Precise Rewriting Approximations	2016-04-08	Paper
Regular sets of descendants by leftmost strategy	2013-08-23	Paper
Weak inclusion for recursive XML types	2012-09-20	Paper
Weak inclusion for XML types	2011-07-29	Paper
Minimal tree language extensions: a keystone of XML type compatibility and evolution	2010-08-31	Paper
Visibly Pushdown Languages and Term Rewriting	2008-09-16	Paper
Tree automata for rewrite strategies	2007-10-19	Paper
https://portal.mardi4nfdi.de/entity/Q4808762	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4808743	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q2771057	2002-06-02	Paper
https://portal.mardi4nfdi.de/entity/Q2778878	2002-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q4938423	2002-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4938601	2000-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q3836513	1999-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q3838765	1999-02-04	Paper
Basic narrowing revisited	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3779784	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3696486	1985-01-01	Paper

Research outcomes over time

This page was built for person: Pierre Réty