Skip to Main content Skip to Navigation
Conference papers

The New Rewriting Engine of Dedukti

Abstract : Dedukti is a type-checker for the λΠ-calculus modulo rewriting, an extension of Edinburgh’s logical framework LF where functions and type symbols can be defined by rewrite rules. It therefore contains 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 this paper, we describe the class of rewrite rules supported by Dedukti and the new implementation of the matching algorithm. Dedukti supports non-linear rewrite rules on terms with binders using higher-order pattern-matching as in Combinatory Reduction Systems (CRS). The new matching algorithm extends the technique of decision trees introduced by Luc Maranget in the OCaml compiler to this more general context.
Complete list of metadatas
Contributor : Frédéric Blanqui <>
Submitted on : Wednesday, October 28, 2020 - 9:48:01 AM
Last modification on : Wednesday, November 4, 2020 - 3:35:03 AM


Files produced by the author(s)




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



Record views


Files downloads