Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Abuse of coercions gives weird results in coqtop.

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Abuse of coercions gives weird results in coqtop.


chronological Thread 
  • From: Georgi Guninski <guninski AT guninski.com>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] Abuse of coercions gives weird results in coqtop.
  • Date: Mon, 30 May 2011 11:55:11 +0300
  • Header: best read with a sniffer

On Sun, May 29, 2011 at 04:20:40PM +0300, Georgi Guninski wrote:
> On Sun, May 29, 2011 at 04:14:45PM +0300, Georgi Guninski wrote:
> > 
> > I have problem getting a real contradiction though.
> > 
> > Attached is source code.
> >
>

Inductive t : Type := FUCKMS : t.
(* ^ like True *)
Definition expr2 (v:t) : Type := False.
Coercion expr2: t >-> Sortclass.

Lemma l1: exists a : t, a->False.
Proof.
eexists. 
instantiate(1:=FUCKMS). (* wtf, don't really need this*)
compute. trivial. 
Qed.




Archive powered by MhonArc 2.6.16.

Top of Page