coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: t x <txrev319 AT gmail.com>
- To: coq-club <coq-club AT inria.fr>
- Subject: [Coq-Club] Transparent, Opaque, Ltac
- Date: Fri, 12 Jul 2013 18:52:07 -0700
Hi,
Consider this minimal failure case: https://gist.github.com/anonymous/1e3d9502fa56ca742b00
Question:
Is there anyway to have a Ltac change Transparent/Opaque flags? (For example, the following does not compile:
Ltac solve_foo :=
Transparent foo;
match goal with ...
How I'm running into this problem:
In my proofs, I want certain functions to be "barriers" -- to have "simpl" NOT unfold them, so that (1) I can pattern match on them and (2) there are different "levels" to the proof
Now, having pattern matched on them, I want to solve them using specific tactics -- and for this I do need to be able to unfold them.
Thus, is there a way for ltac to locally control whether terms are Opaque/Transparent?
- [Coq-Club] Transparent, Opaque, Ltac, t x, 07/13/2013
- Re: [Coq-Club] Transparent, Opaque, Ltac, Jason Gross, 07/13/2013
Archive powered by MHonArc 2.6.18.