Subject: Ssreflect Users Discussion List
List archive
- From: <>
- To:
- Subject: Re: RE: wildcards insertion in the Specialising assumptions mechanism
- Date: Wed, 2 Jul 2008 14:47:56 +0200 (CEST)
> Namely, that unresolved wildcards are generalized, as in the ML let, rather
> than generating a type error outright.
That would imply that as long as the application is saturated at the end,
I will not get such type error. This is a simple criterion I can keep in
mind.
> > Goal p a ->True.
> > move => pa. generalize (f_p pa).
>
> True, but
> have:= f_p pa.
> will work, because have also performs this ML-let-style treatment of
> wildcards. Note that
> move: (f_p pa).
> will not work, however, because move attempts to fill wildcards by matching
> a
> subterm in the goal.
Perhaps I prefer only to use "move/f_p", but not to set Implicit Arguments.
Thus I avoid having two semantics for the application.
Best,
Keiko
- wildcards insertion in the Specialising assumptions mechanism, keiko.nakata, 07/01/2008
- RE: wildcards insertion in the Specialising assumptions mechanism, Georges Gonthier, 07/01/2008
- <Possible follow-up(s)>
- Re: RE: wildcards insertion in the Specialising assumptions mechanism, keiko.nakata, 07/02/2008
- RE: RE: wildcards insertion in the Specialising assumptions mechanism, Georges Gonthier, 07/02/2008
- Re: RE: RE: wildcards insertion in the Specialising assumptions mechanism, keiko.nakata, 07/02/2008
- RE: RE: RE: wildcards insertion in the Specialising assumptions mechanism, Georges Gonthier, 07/02/2008
- Re: wildcards insertion in the Specialising assumptions mechanism, keiko.nakata, 07/02/2008
- RE: wildcards insertion in the Specialising assumptions mechanism, Georges Gonthier, 07/02/2008
- Re: RE: wildcards insertion in the Specialising assumptions mechanism, keiko.nakata, 07/02/2008
Archive powered by MHonArc 2.6.18.