Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science
DOI: 10.1109/lics.1994.316071
|View full text |Cite
|
Sign up to set email alerts
|

The groupoid model refutes uniqueness of identity proofs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
62
0
1

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 64 publications
(66 citation statements)
references
References 2 publications
3
62
0
1
Order By: Relevance
“…Using some earlier results, which I shall not treat here (see [230] for further references), Hofmann and Streicher [116], [117] homotopies. This geometrical viewpoint is not only intuitively appealing but also allows for a fruitful conceptual reconstruction of the initial groupoid model.…”
Section: Homotopy Type Theorymentioning
confidence: 99%
“…Using some earlier results, which I shall not treat here (see [230] for further references), Hofmann and Streicher [116], [117] homotopies. This geometrical viewpoint is not only intuitively appealing but also allows for a fruitful conceptual reconstruction of the initial groupoid model.…”
Section: Homotopy Type Theorymentioning
confidence: 99%
“…It is based on the unstated assumption that the equality type itself is proof-irrelevant: if there are several distinct proofs of x ≡ x , then x ∈ [x ] does not correspond directly to the positions of x in [x ]. However, in the absence of the K rule the equality type is not necessarily proof-irrelevant [9]. Fortunately, and maybe surprisingly, one can prove that the two definitions of bag equivalence above are equivalent even in the absence of proof-irrelevance (see Sect.…”
Section: Bag Equivalence For Listsmentioning
confidence: 96%
“…Axiom K and the elimination rule for Heq are not derivable in CIC [4], but it is no surprise that they are derivable with the new rule: Less-or-equal relation on natural numbers. We show two examples concerning the relation less-or-equal for natural numbers defined inductively as follows:…”
Section: Examplesmentioning
confidence: 99%
“…He already observed that the axiom K is derivable in his setting. Hofmann and Streicher [4] later proved that pattern matching is not a conservative extension of Type Theory, by showing that K is not derivable in Type Theory. Finally, Goguen et al [3] proved that pattern matching can be translated into a Type Theory with K as an axiom, showing that K is sufficient to support pattern matching -this result was already discovered by McBride [5].…”
Section: Metatheorymentioning
confidence: 99%