A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Incorporating extensional equality into a dependent intensional type system such as the Calculus of Constructions provides with stronger type-checking capabilities and makes the proof development closer to intuition. Since strong forms of extensionality lead to undecidable type-checking, a good trade-off is to extend intensional equality with a decidable first-order theory T , as done in CoqMT, which uses matching modulo T for the weak and strong elimination rules, we call these rulesfatcat:iml3juwmojd6vaidh3u5pekksq