Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Type-Checking partial proofs

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Type-Checking partial proofs


Chronological Thread 
  • From: Arnaud Spiwack <aspiwack AT lix.polytechnique.fr>
  • To: Pierre-Marie Pédrot <pierre-marie.pedrot AT inria.fr>
  • Cc: Jason Gross <jasongross9 AT gmail.com>, coq-club AT inria.fr
  • Subject: Re: [Coq-Club] Type-Checking partial proofs
  • Date: Mon, 2 Jul 2012 08:04:01 +0200

Well, I don't think there is any built in way to do that (chaining Show Proof with Check doesn't work unfortunately, because Coq doesn't parse existential variables, they are only printed). But it sounds easy enough to to add. Should we?

On 29 June 2012 12:08, Pierre-Marie Pédrot <pierre-marie.pedrot AT inria.fr> wrote:
On 29/06/2012 09:02, Jason Gross wrote:
I'm trying to diagnose an "Illegal application (Type Error)" that I get
on [Qed].  I'm pretty sure it comes from an implicit coercion or from a
[rewrite] or from [reflexivity], but I'm not sure..  Is there a way to

ask Coq to see if the proof built up so far type-checks?  I can use
[admit. Qed.], but this only works if there are no remaining existential
variables.

You may try to fiddle with the Show Proof command, but in the general case, I cannot figure out how to typecheck an incomplete proof-term...

PMP



  • Re: [Coq-Club] Type-Checking partial proofs, Arnaud Spiwack, 07/02/2012

Archive powered by MHonArc 2.6.18.

Top of Page