Category theoretic structure of setoids

Yoshiki Kinoshita, John Power

OAI: oai:purehost.bath.ac.uk:publications/6b628f3e-193b-42bf-acc8-3a24cd3a72e4 • DOI: https://doi.org/10.1016/j.tcs.2014.03.006

A setoid is a set together with a constructive representation of an equivalence relation on it. Here, we give category theoretic support to the notion. We first define a category Setoid and prove it is cartesian closed with coproducts. We then enrich it in the cartesian closed category Equiv of sets and classical equivalence relations, extend the above results, and prove that Setoid as an Equiv-enriched category has a relaxed form of equalisers. We then recall the definition of E-category, generalising that of Equiv-enriched category, and show that Setoid as an E-category has a relaxed form of coequalisers. In doing all this, we carefully compare our category theoretic constructs with Agda code for type-theoretic constructs on setoids.

setoid Proof assistant proof irrelevance Cartesian closed category coproduct Equiv-category Equiv-inserter E-category E-coinserter