Skip to Content.
Sympa Menu

coq-club - [Coq-Club] Complexity of proof terms generated by the inversion tactic

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

[Coq-Club] Complexity of proof terms generated by the inversion tactic


chronological Thread 
  • From: Robin Green <greenrd AT greenrd.org>
  • To: coq-club AT pauillac.inria.fr
  • Subject: [Coq-Club] Complexity of proof terms generated by the inversion tactic
  • Date: Sat, 4 Jul 2009 02:57:54 +0100
  • List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
  • Organization: Swansea University

If I use Proof. ... Defined. to build a term, and I use inversion in
the proof, the generated proof term can be quite complicated. If I use
"info inversion" to see what tactics are being used in that proof step,
the output is quite long. So it looks like it would be a lot of work
for me to understand how the inversion tactic works in this particular
situation.

Is there any way, apart from using the simple inversion tactic, to make
the proof terms less complicated for a proof involving inversion? Or at
least, in some sense easier to work with in a subsequent proof
involving that definition?
-- 
Robin





Archive powered by MhonArc 2.6.16.

Top of Page