Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] type conversion

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] type conversion


Chronological Thread 
  • From: julien.forest AT ensiie.fr
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] type conversion
  • Date: Mon, 27 Oct 2014 13:05:58 +0100


On Sun, 26 Oct 2014 16:29:18 +0100
Jean-François Dufourd
<jfd AT unistra.fr>
wrote:

Theorem subst: forall(T U:Type), T = U -> T -> U.
Proof.
intros. rewrite <-H. apply X.
Defined.

Require Import Arith.

Lemma test_subst: forall H : nat = nat,
subst nat nat H 5 = 5.

Hi,
your hypothesis H has exact type @eq Set nat nat while the subst Lemma
waits for an hypothesis (@eq Type nat nat). The conversion between Set
and Type does not seems to be automatic here.

Best regards,

Julien





Archive powered by MHonArc 2.6.18.

Top of Page