The New Rewriting Engine of Dedukti - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

The New Rewriting Engine of Dedukti


Dedukti is a type-checker for the λΠ-calculus modulo rewriting, an extension of Edinburgh’s logicalframework LF where functions and type symbols can be defined by rewrite rules. It thereforecontains an engine for rewriting LF terms and types according to the rewrite rules given by the user.A key component of this engine is the matching algorithm to find which rules can be fired. In thispaper, we describe the class of rewrite rules supported by Dedukti and the new implementation ofthe matching algorithm. Dedukti supports non-linear rewrite rules on terms with binders usinghigher-order pattern-matching as in Combinatory Reduction Systems (CRS). The new matchingalgorithm extends the technique of decision trees introduced by Luc Maranget in the OCamlcompiler to this more general context.
Fichier principal
Vignette du fichier
fscd20.pdf (535.47 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-02981561 , version 1 (28-10-2020)
hal-02981561 , version 2 (05-11-2021)



Gabriel Hondet, Frédéric Blanqui. The New Rewriting Engine of Dedukti. FSCD 2020 - 5th International Conference on Formal Structures for Computation and Deduction, Jun 2020, Paris, France. pp.16, ⟨10.4230/LIPIcs.FSCD.2020.35⟩. ⟨hal-02981561v2⟩
111 View
252 Download



Gmail Facebook X LinkedIn More