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: Dmitry Grebeniuk <gdsfh1 AT gmail.com>
  • To: Beta Ziliani <coq-club AT inria.fr>
  • Subject: Re: [Coq-Club] Using Canonical Structures for proof automation
  • Date: Wed, 13 Mar 2013 14:26:37 +0200

Hello.

> 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.

So, canonical structures are useless without
ssreflect, or user should just avoid using some
tactics like "apply" while using canonical structures?



Archive powered by MHonArc 2.6.18.

Top of Page