Towards explicit rewrite rules in the λΠ-calculus modulo - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Towards explicit rewrite rules in the λΠ-calculus modulo


This paper provides a new presentation of the λΠ-calculus modulo where the addition of rewrite rules is made explicit. The λΠ-calculus modulo is a variant of the λ-calculus with dependent types where β-reduction is extended with user-defined rewrite rules. Its expressiveness makes it suitable to serve as an output language for theorem provers, certified development tools or proof assistants. Addition of rewrite rules becomes an iterative process and rules previously added can be used to type new rules. We also discuss the condition rewrite rules must satisfy in order to preserve the Subject Reduction property and we give a criterion weaker than the usual one. Finally we describe the new version of Dedukti, a type-checker for the λΠ-calculus modulo for which we assess its efficiency in comparison with Coq, Twelf and Maude.
Fichier principal
Vignette du fichier
article.pdf (163.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00921340 , version 1 (20-12-2013)
hal-00921340 , version 2 (14-01-2014)


  • HAL Id : hal-00921340 , version 2


Ronan Saillard. Towards explicit rewrite rules in the λΠ-calculus modulo. IWIL - 10th International Workshop on the Implementation of Logics, Dec 2013, Stellenbosch, South Africa. ⟨hal-00921340v2⟩
245 View
194 Download


Gmail Facebook X LinkedIn More