coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- 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: Thu, 14 Mar 2013 16:12:27 +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.
One more question.
Can you please explain briefly, what these
algorithms are, and what's the difference between
"apply rsimplify_morphisms." and
"refine (rsimplify_morphisms _)."?
- [Coq-Club] Using Canonical Structures for proof automation, Jason Gross, 03/09/2013
- Re: [Coq-Club] Using Canonical Structures for proof automation, Beta Ziliani, 03/11/2013
- Re: [Coq-Club] Using Canonical Structures for proof automation, Jason Gross, 03/13/2013
- Re: [Coq-Club] Using Canonical Structures for proof automation, Beta Ziliani, 03/13/2013
- Re: [Coq-Club] Using Canonical Structures for proof automation, Dmitry Grebeniuk, 03/13/2013
- Re: [Coq-Club] Using Canonical Structures for proof automation, Dmitry Grebeniuk, 03/14/2013
- Re: [Coq-Club] Using Canonical Structures for proof automation, Beta Ziliani, 03/13/2013
- Re: [Coq-Club] Using Canonical Structures for proof automation, Jason Gross, 03/13/2013
- Re: [Coq-Club] Using Canonical Structures for proof automation, Beta Ziliani, 03/13/2013
- Re: [Coq-Club] Using Canonical Structures for proof automation, Jason Gross, 03/13/2013
- Re: [Coq-Club] Using Canonical Structures for proof automation, Beta Ziliani, 03/11/2013
Archive powered by MHonArc 2.6.18.