coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- 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.
- [Coq-Club] Inductive family of finite types, Gert Smolka
- Re: [Coq-Club] Inductive family of finite types, Adam Chlipala
- <Possible follow-ups>
- Re: [Coq-Club] Inductive family of finite types,
Paolo Herms
- Re: [Coq-Club] Inductive family of finite types,
Gert Smolka
- Re: [Coq-Club] Inductive family of finite types,
Adam Chlipala
- Re: [Coq-Club] Inductive family of finite types,
Gert Smolka
- Re: [Coq-Club] Inductive family of finite types, Daniel Schepler
- Re: [Coq-Club] Inductive family of finite types,
Gert Smolka
- Re: [Coq-Club] Inductive family of finite types,
Adam Chlipala
- Re: [Coq-Club] Inductive family of finite types,
Gert Smolka
- Re: [Coq-Club] Inductive family of finite types, ahrens
Archive powered by MhonArc 2.6.16.