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

 22 Dec, 2017 1 commit


Andrei Paskevich authored

 15 Dec, 2017 1 commit


Guillaume Melquiond authored

 20 Aug, 2015 1 commit


Andrei Paskevich authored
except for modules/impset.mlw (because of Fset) and modules/mach/* (because of program cloning), the standard library now typechecks. This is still very much the work in progress. Many functions and predicates have still to be converted to "let function" and "let predicate". Here are some TODOs:  do not require the return type for "val predicate", "val lemma", etc.  do not require explicit variant for "let rec" if the code passes the termination check in Decl (see list.why)  what should become "val ghost function" and what should stay just "function" (see array.mlw, matrix.mlw, string.mlw, etc)?  some defined functions in algebra.why and relations.why had to be removed, so that they can be implemented with "let function" in int.mlw (since they are defined, they cannot be instantiated with letfunctions). This seems too restrictive. One way out would be to authorise instantiation of defined functions (with a VC).  should we keep the keyword "model"? reuse of "abstract" in types breaks syntax coloring ("abstract" requires closing "end" in programs but not in types; maybe we can drop that "end" again?).

 01 Sep, 2012 1 commit


Guillaume Melquiond authored
Add monoids to the algebraic hierarchy.

 18 May, 2012 1 commit


MARCHE Claude authored

 22 Apr, 2012 2 commits


Guillaume Melquiond authored

Guillaume Melquiond authored

 20 Apr, 2012 1 commit


MARCHE Claude authored

 19 Apr, 2012 1 commit


MARCHE Claude authored

 06 Feb, 2012 1 commit


JeanChristophe Filliatre authored
note that 'function' is still allowed

 14 Dec, 2011 1 commit


Andrei Paskevich authored

 05 Sep, 2011 1 commit


MARCHE Claude authored

 04 Sep, 2011 1 commit


MARCHE Claude authored

 01 Jul, 2011 2 commits


MARCHE Claude authored

MARCHE Claude 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".

 21 Jun, 2011 1 commit


JeanChristophe Filliatre authored

 16 Jun, 2011 1 commit


JeanChristophe authored

 09 May, 2011 1 commit


JeanChristophe Filliatre authored

 08 Apr, 2011 1 commit


JeanChristophe Filliatre authored

 26 Oct, 2010 1 commit


Andrei Paskevich authored

 25 Oct, 2010 1 commit


Andrei Paskevich authored

 19 Oct, 2010 1 commit


MARCHE Claude authored

 09 Jul, 2010 1 commit


Andrei Paskevich authored
 bring driver syntax closer to that of theories  some simple API improvements

 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

 24 Mar, 2010 1 commit


MARCHE Claude authored

 23 Mar, 2010 1 commit


JeanChristophe Filliâtre authored
