Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Réty, Pierre"'
This paper proposes a set of tools to help dealing with XML database evolution. It aims at establishing a multi-system environment where a global integrated system works in harmony with some local original ones, allowing data translation in both dire
Externí odkaz:
http://arxiv.org/abs/1406.1423
Publikováno v:
In Journal of Computer and System Sciences September 2019 104:131-148
Autor:
Andrianarivelo, Nirina, Réty, Pierre
Publikováno v:
In Information Processing Letters March 2022 174
Autor:
Andrianarivelo, Nirina, Réty, Pierre
Publikováno v:
3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)
3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018), Jul 2018, Oxford, United Kingdom
3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018), Jul 2018, Oxford, United Kingdom
Prefix-constrained rewriting is a strict extension of context-sensitive rewriting. We study the confluence of prefix-constrained rewrite systems, which are composed of rules of the form L: l -> r where L is a regular string language that defines the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05e8d9d1139738e07488c117a566ca0e
https://hal-univ-orleans.archives-ouvertes.fr/hal-01780553
https://hal-univ-orleans.archives-ouvertes.fr/hal-01780553
Autor:
Réty, Pierre, Vuotto, Julie
Publikováno v:
In Electronic Notes in Theoretical Computer Science December 2002 70(6):176-195
Publikováno v:
[Research Report] RR-2009-06, 2009
Journées informatiques de la région centre (JIRC)
Journées informatiques de la région centre (JIRC), Jan 2010, Blois, France
Journées informatiques de la région centre (JIRC)
Journées informatiques de la région centre (JIRC), Jan 2010, Blois, France
Rapport de recherche LIFO
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f8dff347432c1980e239f7c289773762
https://hal.inria.fr/inria-00464116
https://hal.inria.fr/inria-00464116
Publikováno v:
19th Workshop on Unification (UNIF'2005)
19th Workshop on Unification (UNIF'2005), 2005, Japan
19th Workshop on Unification (UNIF'2005), 2005, Japan
Expressing descendants or the rewrite relation by tree-(tuple) languages allows to deal with R-matching and R-unification problems. We present in addition a new class of tree-tuple languages, more expressive than former ones, but having the same prop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6b0e8dafd31b7b1face19cf494b06e91
https://hal.archives-ouvertes.fr/hal-00102554
https://hal.archives-ouvertes.fr/hal-00102554
Publikováno v:
Rewriting Logic & Its Applications: 11th International Workshop, WRLA 2016, Held as a Satellite Event of ETAPS, Eindhoven, The Netherlands, April 2-3, 2016, Revised Selected Papers; 2016, p64-81, 18p
Publikováno v:
[Research Report] RR-2006-13, 2006
Rapport de recherche LIFO
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4c743883b78759cb9a8564fc5bd7a8d7
https://hal.inria.fr/inria-00464114
https://hal.inria.fr/inria-00464114