 15 Jun, 2018 1 commit


Andrei Paskevich authored
For the previous behaviour (no import), write "use/clone T as T". This shortens the most used "use/clone import" to simply "use/clone".

 14 Jun, 2018 1 commit


Andrei Paskevich authored
Clone "with axiom ." or "with goal ." to change the default ("with lemma ." is also accepted, just in case).

 01 Jun, 2018 1 commit


JeanChristophe Filliatre authored

 31 May, 2018 1 commit


JeanChristophe Filliatre authored
fixes issue #57 a new theory relations.WellFounded is introduced for this purpose (and must be imported whenever one wants to make use of a custom relation for a variant) it defines, inductively, a notion of accessibility for a given predicate R (x is accessible whenever all elements smaller than x for R are alreay accessible) whenever one has to prove that a variant decreases, a new VC is also generated, to show that the old value of the variant is accessible for the order relation note: accessibility being defined inductively, proving wellfoundedness is out of reach of SMT solvers; but at least this is sound now

 22 Dec, 2017 1 commit


Andrei Paskevich authored

 15 Dec, 2017 1 commit


Guillaume Melquiond authored

 03 Sep, 2014 1 commit


Andrei Paskevich authored
 update Coq and Isabelle realizations (TODO: PVS)

 21 Aug, 2014 1 commit


Guillaume Melquiond authored

 20 Aug, 2014 2 commits


Guillaume Melquiond authored

Guillaume Melquiond authored

 07 Apr, 2014 1 commit


Andrei Paskevich authored

 31 Mar, 2014 1 commit


Andrei Paskevich authored

 12 Oct, 2012 1 commit


Andrei Paskevich authored

 07 May, 2012 1 commit


MARCHE Claude authored

 22 Apr, 2012 1 commit


Guillaume Melquiond authored

 19 Sep, 2011 1 commit


JeanChristophe Filliatre authored

 22 Aug, 2011 1 commit


JeanChristophe Filliatre authored

 29 Jun, 2011 1 commit


Andrei Paskevich authored
 No more "and", "or", "implies", "iff", and "~". Use "/\", "\/", ">", "<>", and "not" instead.  No more "logic". Use "function" or "predicate".

 25 Jun, 2010 2 commits


JeanChristophe Filliâtre authored

JeanChristophe Filliâtre authored

 24 Jun, 2010 1 commit


Andrei Paskevich authored
in the logic language into (more or less) higherorder style. For example, logic func (x : int, y : int, 'a list) : (int, 'a) map list logic pred (bool, int * real) is now written: logic func (x y : int) (list 'a) : list (map int 'a) logic pred bool (int, real) Note that types use prefix notation (as in Coq) and the types of tuples are now written as (type1, type2, ..., typeN).  Use the same syntax of type expressions in the program language.  Allow binders of the form (x y:int) in the program language.

 21 Jun, 2010 2 commits


Andrei Paskevich authored

Andrei Paskevich authored

 02 Apr, 2010 1 commit


Andrei Paskevich authored

 30 Mar, 2010 2 commits


MARCHE Claude authored

MARCHE Claude authored

 25 Mar, 2010 1 commit


MARCHE Claude authored
