|
|
キノシタ ヨシキ
Kinoshita Yoshiki 木下 佳樹 所属 神奈川大学 情報学部 計算機科学科 神奈川大学大学院 理学研究科 理学専攻(情報科学領域) 職種 教授 |
|
言語種別 | 英語 |
発行・発表の年月 | 2014/08 |
形態種別 | 学術雑誌 |
査読 | 査読あり |
標題 | Category theoretic structure of setoids |
執筆形態 | 共著 |
掲載誌名 | Theoretical Computer Science (Elsevier) |
巻・号・頁 | 546,pp.145-163 |
著者・共著者 | Yoshiki Kinoshita
John Power |
概要 | 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. |