coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Zoe Paraskevopoulou <zoe.paraskevopoulou AT gmail.com>
- To: coq-club AT inria.fr
- Subject: Re: [Coq-Club] Program Fixpoint and simpl
- Date: Tue, 31 Mar 2015 01:04:12 +0200
I see, it gets quite technical indeed.
> On Mar 30, 2015, at 5:32 PM, Matthieu Sozeau
> <mattam AT mattam.org>
> wrote:
>
> Aha, it's non-trivial indeed but you can do the unfolding trick. Maybe
> you didn't get the right induction hypothesis because you need to redo
> the well-founded induction in the lemma, and also generalize by the ie
> variable.
I fact my naive approach didn't get me that far, I was stuck when I was
trying to prove extensional equivalence with the unfolded definition, so I
never got into the final lemma where well founded induction is required to
handle the abstraction case.
Thanks again,
Zoe
- [Coq-Club] Program Fixpoint and simpl, Zoe Paraskevopoulou, 03/29/2015
- Re: [Coq-Club] Program Fixpoint and simpl, Jonathan Leivent, 03/30/2015
- Re: [Coq-Club] Program Fixpoint and simpl, Zoe Paraskevopoulou, 03/30/2015
- Re: [Coq-Club] Program Fixpoint and simpl, Matthieu Sozeau, 03/30/2015
- Re: [Coq-Club] Program Fixpoint and simpl, Zoe Paraskevopoulou, 03/31/2015
- Re: [Coq-Club] Program Fixpoint and simpl, Matthieu Sozeau, 03/30/2015
- Re: [Coq-Club] Program Fixpoint and simpl, Zoe Paraskevopoulou, 03/30/2015
- Re: [Coq-Club] Program Fixpoint and simpl, James Wilcox, 03/30/2015
- Re: [Coq-Club] Program Fixpoint and simpl, Matthieu Sozeau, 03/30/2015
- Re: [Coq-Club] Program Fixpoint and simpl, Jonathan Leivent, 03/30/2015
Archive powered by MHonArc 2.6.18.