Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] what exactly are the Prop analysis rules?

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] what exactly are the Prop analysis rules?


Chronological Thread 
  • From: Guillaume Melquiond <guillaume.melquiond AT inria.fr>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] what exactly are the Prop analysis rules?
  • Date: Mon, 04 Aug 2014 19:02:08 +0200

On 04/08/2014 18:20, Jonathan wrote:
How can you argue that a value of type "False \/ P" contains no
information? There are two constructors!

I can have a rewrite rule "False \/ P <-> P", which of course is
reversible. I am under the impression that a rewrite, by being
reversible, demonstrates that the two sides contain the same
information. So, there must not be any extra information in the "False
\/" part, so to speak. Is that incorrect?

Yes. As already pointed out by Arnaud, True \/ True is equivalent to True, which is a singleton type, yet it is isomorphic to bool, which is definitely not a singleton type. So just knowing about an equivalence is not enough for deciding whether a type can be destructed.

Best regards,

Guillaume



Archive powered by MHonArc 2.6.18.

Top of Page