Setoids in Type Theory (2000)
Cached
Download Links
- [ftp-sop.inria.fr]
- [ftp-sop.inria.fr]
- [www.cs.kun.nl]
- DBLP
Other Repositories/Bibliography
by
Gilles Barthe
,
Venanzio Capretta
,
Olivier Pons
| Citations: | 19 - 2 self |
BibTeX
@MISC{Barthe00setoidsin,
author = {Gilles Barthe and Venanzio Capretta and Olivier Pons},
title = {Setoids in Type Theory},
year = {2000}
}
Years of Citing Articles
OpenURL
Abstract
Formalising mathematics in dependent type theory often requires to use setoids, i.e. types with an explicit equality relation, as a representation of sets. This paper surveys some possible denitions of setoids and assesses their suitability as a basis for developing mathematics. In particular, we argue that a commonly advocated approach to partial setoids is unsuitable, and more generally that total setoids seem better suited for formalising mathematics. 1







