The Taming of the Rew: A Type Theory with Computational Assumptions - Archive ouverte HAL Access content directly
Journal Articles Proceedings of the ACM on Programming Languages Year : 2021

The Taming of the Rew: A Type Theory with Computational Assumptions


Dependently typed programming languages and proof assistants such as Agda and Coq rely on computation to automatically simplify expressions during type checking. To overcome the lack of certain programming primitives or logical principles in those systems, it is common to appeal to axioms to postulate their existence. However, one can only postulate the bare existence of an axiom, not its computational behaviour. Instead, users are forced to postulate equality proofs and appeal to them explicitly to simplify expressions, making axioms dramatically more complicated to work with than built-in primitives. On the other hand, the equality reflection rule from extensional type theory solves these problems by collapsing computation and equality, at the cost of having no practical type checking algorithm. This paper introduces Rewriting Type Theory (RTT), a type theory where it is possible to add computational assumptions in the form of rewrite rules. Rewrite rules go beyond the computational capabilities of intensional type theory, but in contrast to extensional type theory, they are applied automatically so type checking does not require input from the user. To ensure type soundness of RTT-as well as effective type checking-we provide a framework where confluence of user-defined rewrite rules can be checked modularly and automatically, and where adding new rewrite rules is guaranteed to preserve subject reduction. The properties of RTT have been formally verified using the MetaCoq framework and an implementation of rewrite rules is already available in the Agda proof assistant.
Fichier principal
Vignette du fichier
main_popl.pdf (732.73 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02901011 , version 1 (16-07-2020)
hal-02901011 , version 2 (08-10-2020)



Jesper Cockx, Nicolas Tabareau, Théo Winterhalter. The Taming of the Rew: A Type Theory with Computational Assumptions. Proceedings of the ACM on Programming Languages, 2021, POPL 2021, ⟨10.1145/3434341⟩. ⟨hal-02901011v2⟩
1691 View
1027 Download



Gmail Mastodon Facebook X LinkedIn More