coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Claudio Sacerdoti Coen <sacerdot AT cs.unibo.it>
- To: anoun AT labri.fr
- Cc: coq-club AT pauillac.inria.fr
- Subject: Re: [Coq-Club] problem setoid
- Date: Tue, 15 Feb 2005 17:03:08 +0100
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
Hi,
> I need to add inductives predicates defined within sort Set as morphisms
> but as
> we saw below this is not possible using the cvs version of Coq
> How can we solve that?
the problem is not that you cannot define predicates of type Set as
morphisms, but that you cannot define them as relations (setoids).
Indeed, the solution would be to declare eqSet as a setoid, but this is
not accepted by Coq since it is not a Coq relation (i.e. it does not have
type T -> T -> Prop for some T).
The latter limitation is hard-coded in the current reflexive implementation
of the tactic. Simply replacing relation with a suitable relationT
predicate in the Coq source does not work because of contravariance issues
in the typing relation and renaming of hypotheses by tactics.
I am investigating whether these issues can be solved, but this will
require a bit of time.
Regards,
C.S.C.
--
----------------------------------------------------------------
Real name: Claudio Sacerdoti Coen
Doctor in Computer Science, University of Bologna
E-mail:
sacerdot AT cs.unibo.it
http://www.cs.unibo.it/~sacerdot
----------------------------------------------------------------
- [Coq-Club] problem setoid, anoun
- Re: [Coq-Club] problem setoid, Claudio Sacerdoti Coen
- Re: [Coq-Club] problem setoid, Claudio Sacerdoti Coen
- Re: [Coq-Club] problem setoid, Claudio Sacerdoti Coen
Archive powered by MhonArc 2.6.16.