coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Edsko de Vries <devriese AT cs.tcd.ie>
- To: Adam Megacz <megacz AT cs.berkeley.edu>
- Cc: coq-club AT pauillac.inria.fr
- Subject: Re: [Coq-Club] Re: Dealing with equivalence classes
- Date: Thu, 7 Feb 2008 15:58:28 +0000
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
Hi,
Just to say: independently of whether using setoids helps me with the
problem I really need to solve, it has certainly made all my proofs in
BooleanAlgebraM much nicer :) Thanks! New formalization available at
http://www.cs.tcd.ie/~devriese/coq
(By the way, this does not yet include the proof that True is not
equivalent to False, because the proof as suggested on this list is a
semantic proof, and I had generalized the module so that I cannot write
the semantic interpretation function -- I might have to change that
again.)
Edsko
- [Coq-Club] Dealing with equivalence classes, Edsko de Vries
- [Coq-Club] Re: Dealing with equivalence classes,
Adam Megacz
- Re: [Coq-Club] Re: Dealing with equivalence classes,
Edsko de Vries
- Re: [Coq-Club] Re: Dealing with equivalence classes, Arnaud Spiwack
- [Coq-Club] Re: Dealing with equivalence classes, Adam Megacz
- Re: [Coq-Club] Re: Dealing with equivalence classes, Edsko de Vries
- Re: [Coq-Club] Re: Dealing with equivalence classes,
Edsko de Vries
- [Coq-Club] Re: Dealing with equivalence classes,
Adam Megacz
Archive powered by MhonArc 2.6.16.