coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Nadeem Abdul Hamid <nadeem AT acm.org>
- To: coq-club AT pauillac.inria.fr
- Subject: [Coq-Club] Finding opaque dependencies
- Date: Sat, 7 Mar 2009 19:15:09 -0500
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=sender:message-id:from:to:content-type:content-transfer-encoding :mime-version:subject:date:x-mailer; b=RryUn8XOLnNbGc+DibR4gICwVcN/Oeopg+C25pN7x0xnOqSU7k3+11Jo1XP/WXDJi2 ofVgc/KaWnc5GLSlHxGV49hxqTUCYXhcglkTaJR6xeZnlpjYd7l689Q+Pby8ivNrO6G2 3pHQrff9sk5L5kHhU34Ww08iZoFlpcOmOSHzE=
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
I have a somewhat complicated fixpoint function that's been defined using Program, but in some parts of its definition I think I've ended up using opaque lemmas from the FSets library, so in certain cases the function doesn't reduce nicely to a simple result when I apply [compute]. So:
- is there any easy way in general to determine what opaque definitions might have been used?
- does anyway have any tips/tricks that they use in this sort of situation other than trying to identify the opaque lemmas and then essentially re-defining them as transparent?
Thanks,
--- nadeem
- [Coq-Club] Finding opaque dependencies, Nadeem Abdul Hamid
- Re: [Coq-Club] Finding opaque dependencies,
Matthieu Sozeau
- Re: [Coq-Club] Finding opaque dependencies, Nadeem Abdul Hamid
- Re: [Coq-Club] Finding opaque dependencies,
Adam Koprowski
- Re: [Coq-Club] Finding opaque dependencies, Matthieu Sozeau
- Re: [Coq-Club] Finding opaque dependencies,
Matthieu Sozeau
Archive powered by MhonArc 2.6.16.