This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

The New Rewriting Engine of Dedukti

Gabriel Hondet    Frédéric Blanqui
keywords:
rewriting, higher-order pattern-matching, decision trees
category:
System Description \relatedversion

Université Paris-Saclay, ENS Paris-Saclay, CNRS, Inria and Laboratoire Spécification et Vérification, 94235, Cachan, France Université Paris-Saclay, ENS Paris-Saclay, CNRS, Inria and Laboratoire Spécification et Vérification, 94235, Cachan, France \CopyrightInria \ccsdesc[500]Theory of computation Equational logic and rewriting \ccsdesc[500]Theory of computation Operational semantics https://hal.inria.fr/hal-02317471 \supplementhttps://github.com/deducteam/lambdapi.git

Acknowledgements.
The authors thank Bruno Barras and Rodolphe Lepigre for their help in developing the new rewriting engine of Dedukti. \EventEditorsZena M. Ariola \EventNoEds1 \EventLongTitle5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020) \EventShortTitleFSCD 2020 \EventAcronymFSCD \EventYear2020 \EventDateJune 29–July 5, 2020 \EventLocationParis, France \EventLogo \SeriesVolume167 \ArticleNo12