coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Thery Laurent <thery AT ns.di.univaq.it>
- To: Sylvie.Boldo AT inria.fr
- Cc: coq-club AT pauillac.inria.fr
- Subject: Re: [Coq-Club]ring_simplify
- Date: Thu, 15 Mar 2007 03:41:35 +0100 (CET)
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
Well, it IS more readable, no doubt about it. I see 2 possible answers that would solve my problem:
* having a flag to turn it down if wanted
* using a different pow such that a^2=a*a, knowing that this pow will be used in a^b with b >=2 (this is the real case as ring_simplify will use pow only when it is at least a square.
I would vote for 2 but I' m scare it would break many proofs in the
real library.
A third solution is to rewrite with the ad-hoc theorem x^2 = x * x when
needed.
--
Laurent
- [Coq-Club]ring_simplify, Sylvie . Boldo
- Re: [Coq-Club]ring_simplify,
Thery Laurent
- Re: [Coq-Club]ring_simplify,
Sylvie . Boldo
- Re: [Coq-Club]ring_simplify, Benjamin Gregoire
- Re: [Coq-Club]ring_simplify, Thery Laurent
- Re: [Coq-Club]ring_simplify,
Sylvie . Boldo
- Re: [Coq-Club]ring_simplify, Bruno Barras
- Re: [Coq-Club]ring_simplify,
Sylvie . Boldo
- Re: [Coq-Club]ring_simplify,
Sylvie . Boldo
- Re: [Coq-Club]ring_simplify, Benjamin Gregoire
- Re: [Coq-Club]ring_simplify,
Thery Laurent
Archive powered by MhonArc 2.6.16.