Skip to Main content Skip to Navigation
Conference papers

Setoid type theory - a syntactic translation

Abstract : We introduce setoid type theory, an intensional type theory with a proof-irrelevant universe of propositions and an equality type satisfying function extensionality, propositional extensionality and a definitional computation rule for transport. We justify the rules of setoid type theory by a syntactic translation into a pure type theory with a universe of propositions. We conjecture that our syntax is complete with regards to this translation.
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/hal-02281225
Contributor : Nicolas Tabareau <>
Submitted on : Sunday, September 8, 2019 - 11:55:23 PM
Last modification on : Thursday, February 27, 2020 - 1:08:08 AM
Document(s) archivé(s) le : Thursday, February 6, 2020 - 6:13:02 PM

File

mpc2019.pdf
Files produced by the author(s)

Identifiers

Citation

Thorsten Altenkirch, Simon Boulier, Ambrus Kaposi, Nicolas Tabareau. Setoid type theory - a syntactic translation. MPC 2019 - 13th International Conference on Mathematics of Program Construction, Oct 2019, Porto, Portugal. pp.155-196, ⟨10.1007/978-3-030-33636-3_7⟩. ⟨hal-02281225⟩

Share

Metrics

Record views

132

Files downloads

866