# The New Rewriting Engine of Dedukti

arXiv: https://arxiv.org/abs/2010.16115 · HTML: https://mlsanity.com/paper/2010.16115/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Oct 2020.

## Built on by (most cited first, 1 of 1)

- [Term Rewriting Based On Set Automaton Matching](https://mlsanity.com/paper/2202.08687/) (2022)

## Abstract (arXiv)

Dedukti is a type-checker for the λPi-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.