Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Inductive family of finite types

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Inductive family of finite types


chronological Thread 
  • From: Adam Chlipala <adam AT chlipala.net>
  • To: Gert Smolka <smolka AT ps.uni-saarland.de>
  • Cc: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] Inductive family of finite types
  • Date: Tue, 28 Jun 2011 09:51:20 -0400

Gert Smolka wrote:
Unfortunately, I cannot prove

Lemma Fin1 (k : Fin 1) :
k = FinO 0.

Help would be appreciated.
Also, what is the "standard" way to define Fin?

Have you read the chapter "Dependent Data Structures" from CPDT?
    http://adam.chlipala.net/cpdt/
I think there's a fair chance it would answer not only these questions, but also others likely to be encountered when working with such datatypes.



Archive powered by MhonArc 2.6.16.

Top of Page