coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Nuno Gaspar <nmpgaspar AT gmail.com>
- To: coq-club <coq-club AT inria.fr>
- Subject: [Coq-Club] ltac problem
- Date: Fri, 16 Mar 2012 14:29:37 +0100
Hello.
I found what seems to me a weird behavior. Consider the following scenario:
Lemma yup:
false = true -> False.
Proof.
intro. solve [congruence].
Qed.
As expected, it succeeds proving. Now, in the following I just define a tactic that would do exactly the same, and yet, for some reason it fails.
Ltac so H := solve [H].
Lemma wtf:
false = true -> False.
Proof.
intro. so congruence. (*fails here*)
I do not understand why the above fails. Help please :)
Bart: Look at me, I'm a grad student, I'm 30 years old and I made $600 dollars last year.
Marge: Bart! Don't make fun of grad students, they just made a terrible life choice.
- [Coq-Club] ltac problem, Nuno Gaspar
- Re: [Coq-Club] ltac problem,
Adam Chlipala
- Re: [Coq-Club] ltac problem, Nuno Gaspar
- Re: [Coq-Club] ltac problem,
Arthur Charguéraud
- Re: [Coq-Club] ltac problem, Hugo Herbelin
- Re: [Coq-Club] ltac problem,
Adam Chlipala
Archive powered by MhonArc 2.6.16.