Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Using Canonical Structures for proof automation

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Using Canonical Structures for proof automation


Chronological Thread 
  • From: Beta Ziliani <beta AT mpi-sws.org>
  • To: Jason Gross <jasongross9 AT gmail.com>
  • Cc: coq-club <coq-club AT inria.fr>
  • Subject: Re: [Coq-Club] Using Canonical Structures for proof automation
  • Date: Wed, 13 Mar 2013 10:03:52 +0100

Hi Jason,

I'll look at your file soon, but let me first address your PS:

On Wed, Mar 13, 2013 at 6:32 AM, Jason Gross
<jasongross9 AT gmail.com>
wrote:
>
> P.S. What's the difference between how ssreflect tactics use canonical
> structures, and how standard tactics use canonical structures?
>

For what I understand, it has to do with the fact that Coq has two
unification algorithms. Ssreflect's tactics use systematically one of
them, while Coq's apply, for instance, may end up using the two,
making unification seriously unpredictable. And canonical structures
are baked into the unification algorithm so predictability is crucial.

Cheers,
Beta



Archive powered by MHonArc 2.6.18.

Top of Page