Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,006,426 papers from all fields of science
Search
Sign In
Create Free Account
Setoid
In mathematics, a setoid (also called an E-set) is a set (or type) equipped with an equivalence relation. Setoids are studied especially in proof…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Algorithm
Coq (software)
Curry–Howard correspondence
Extension (semantics)
Expand
Broader (2)
Category theory
Type theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Extensible and Efficient Automation Through Reflective Tactics
G. Malecha
,
Jesper Bengtson
European Symposium on Programming
2016
Corpus ID: 2183257
Foundational proof assistants simultaneously offer both expressive logics and strong guarantees. The price they pay for this…
Expand
2016
2016
A constructive manifestation of the Kleene-Kreisel continuous functionals
M. Escardó
,
Chuangjie Xu
Annals of Pure and Applied Logic
2016
Corpus ID: 10415521
2014
2014
Formalizing complex plane geometry
Filip Marić
,
Dan Petrovic
Annals of Mathematics and Artificial Intelligence
2014
Corpus ID: 254225301
Deep connections between complex numbers and geometry had been well known and carefully studied centuries ago. Fundamental…
Expand
2011
2011
Formalising Overlap Algebras in Matita†
C. Coen
,
E. Tassi
Mathematical Structures in Computer Science
2011
Corpus ID: 13010499
We describe some formal topological results, formalised in Matita 1/2, presented in predicative intuitionistic logic and in terms…
Expand
2011
2011
Type classes for efficient exact real arithmetic in Coq
R. Krebbers
,
Bas Spitters
Log. Methods Comput. Sci.
2011
Corpus ID: 218627153
Floating point operations are fast, but require continuous effort on the part of the user in order to ensure that the results are…
Expand
2011
2011
Superposition as a logical glue
A. Asperti
,
E. Tassi
Types for Proofs and Programs
2011
Corpus ID: 1177226
The typical mathematical language systematically exploits notational and logical abuses whose resolution requires not just the…
Expand
2011
2011
Computer Certified Efficient Exact Reals in Coq
R. Krebbers
,
Bas Spitters
Calculemus/MKM
2011
Corpus ID: 1674555
Floating point operations are fast, but require continuous effort on the part of the user in order to ensure that the results are…
Expand
2009
2009
L O ] 2 5 M ay 2 00 9 Synchronous Games , Simulations and λ-calculus
P. Hyvernat
2009
Corpus ID: 204976710
We refine a model for linear logic based on two well-known ingredients: games and simulations. We have already shown that usual…
Expand
2005
2005
On the Semantics of Coinductive Types in Martin-Löf Type Theory
F. Marchi
Conference on Algebra and Coalgebra in Computer…
2005
Corpus ID: 33083403
There are several approaches to the problem of giving a categorical semantics to Martin-Lof type theory with dependent sums and…
Expand
Review
2003
Review
2003
Setoids in type theory
G. Barthe
,
Venanzio Capretta
,
O. Pons
Journal of functional programming
2003
Corpus ID: 10069160
Formalising mathematics in dependent type theory often requires to represent sets as setoids, i.e. types with an explicit…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE