coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Jieung Kim <gbali AT kaist.ac.kr>
- To: Adam Chlipala <adam AT chlipala.net>, Coq Club <coq-club AT inria.fr>
- Subject: Re: [Coq-Club] Problem with a simple proof
- Date: Thu, 7 Apr 2011 23:29:38 +0900
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:sender:in-reply-to:references:from:date :x-google-sender-auth:message-id:subject:to:content-type; b=IVDxblS+D3cmKcSf4QdVzZh7wUC1DOHsOVjBBXzIgN9lE9NSbGAA/9Db3YACgMSAsO wa+9MmTX93/eUqBjYEu5XxyQ2M/ckBvZO9h60u7fxd9haineMvBlMEU0RNd5CbaoyOU3 XhOULGATFMDwZfGP8Mhb/SwuSoCO49vTiyWFw=
Dear Adam Chlipala,
Thank you for your advice.
2011/4/7 Adam Chlipala <adam AT chlipala.net>
Jieung Kim wrote:Is this a proof that you've already worked out informally? That's an appropriate first step before asking for Coq-specific advice, in which case you should be asking how to encode particular steps of your informal proof, rather than the theorem overall.
I have one more question about a proof.
For example, In this case, I think I cannot prove~(sub_ty t1 t2).*
*Lemma sub_ty_same_or_not: forall t1 t2, (sub_ty t1 t2) \/
This theorem looks provable to me.
--
Jieung Kim ( 김지응 )
Programming Language Research Group, KAIST
E-mail : gbali at kaist.ac.kr
je1004k at gmail.com
Homepage : plrg.kaist.ac.kr/kje
- [Coq-Club] Problem with a simple proof, Jieung Kim
- Re: [Coq-Club] Problem with a simple proof,
Pierre Casteran
- Re: [Coq-Club] Problem with a simple proof,
Jieung Kim
- Re: [Coq-Club] Problem with a simple proof,
Adam Chlipala
- Re: [Coq-Club] Problem with a simple proof, Jieung Kim
- Re: [Coq-Club] Problem with a simple proof,
Pierre Casteran
- Re: [Coq-Club] Problem with a simple proof, Jieung Kim
- Re: [Coq-Club] Problem with a simple proof,
Adam Chlipala
- Re: [Coq-Club] Problem with a simple proof,
Jieung Kim
- Re: [Coq-Club] Problem with a simple proof,
Pierre Casteran
Archive powered by MhonArc 2.6.16.