Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Induction with type constraints

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Induction with type constraints


chronological Thread 
  • From: Adam Chlipala <adamc AT csail.mit.edu>
  • To: Eric Finster <ericfinster AT gmail.com>
  • Cc: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] Induction with type constraints
  • Date: Sat, 26 Nov 2011 11:02:46 -0500

Eric Finster wrote:
Based on Adam's response (thanks Adam!) I came up with the following:

    Fixpoint zero_len_eq (A : Type) n (v : Vect A n) :=
      match v in (Vect _ n) return (match n with O =>  identity _ _ | S
_ =>  unit end) with
        | VNil =>  identity_refl (VNil A)
        | VCons _ _ _ =>  tt
      end.

Which looks like some good progress.

I should also have pointed to Section 12.3.4 of CPDT, which should definitely clear this up. In general, I feel anyone who's doing serious proving with Coq should read the whole book. ;)



Archive powered by MhonArc 2.6.16.

Top of Page