Generic Encodings of Constructor Rewriting Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Generic Encodings of Constructor Rewriting Systems


Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages, with the negation over patterns. We propose in this paper a concise and clear algorithm computing the difference over patterns which can be used to define generic encodings of constructor term rewriting systems with negation and order into classical term rewriting systems. As a direct consequence, established methods used for term rewriting systems can be applied to analyze properties of the extended systems. The approach can also be seen as a generic compiler which targets any language providing basic pattern matching primitives. The formalism provides also a new method for deciding if a set of patterns subsumes a given pattern and thus, for checking the presence of useless patterns or the completeness of a set of patterns.
Fichier principal
Vignette du fichier
paper.pdf (235.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02130396 , version 1 (15-05-2019)
hal-02130396 , version 2 (25-02-2020)





Horatiu Cirstea, Pierre-Etienne Moreau. Generic Encodings of Constructor Rewriting Systems. PPDP '19: Principles and Practice of Programming Languages 2019, Oct 2019, Porto, Portugal. pp.19, ⟨10.1145/3354166.3354173⟩. ⟨hal-02130396v2⟩
59 View
107 Download



Gmail Facebook X LinkedIn More