Encoding Type Universes Without Using Matching Modulo Associativity and Commutativity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Encoding Type Universes Without Using Matching Modulo Associativity and Commutativity

Abstract

The encoding of proof systems and type theories in logical frameworks is key to allow the translation of proofs from one system to the other. The λΠ-calculus modulo rewriting is a powerful logical framework in which various systems have already been encoded, including type systems with an infinite hierarchy of type universes equipped with a unary successor operator and a binary max operator: Matita, Coq, Agda and Lean. However, to decide the word problem in this max-successor algebra, all the encodings proposed so far use rewriting with matching modulo associativity and commutativity (AC), which is of high complexity and difficult to integrate in usual algorithms for β-reduction and type-checking. In this paper, we show that we do not need matching modulo AC by enforcing terms to be in some special canonical form wrt associativity and commutativity, and by using rewriting rules taking advantage of this canonical form. This work has been implemented in the proof assistant Lambdapi.
No file

Dates and versions

hal-03708036 , version 1 (28-06-2022)

Identifiers

Cite

Frédéric Blanqui. Encoding Type Universes Without Using Matching Modulo Associativity and Commutativity. FSCD 2022 - 7th International Conference on Formal Structures for Computation and Deduction, Aug 2022, Haifa, Israel. pp.14, ⟨10.4230/LIPIcs.FSCD.2022.24⟩. ⟨hal-03708036⟩
39 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More