 07 Sep, 2018 1 commit


Raphael RieuHelft authored

 14 Aug, 2018 1 commit


Raphaël RieuHelft authored

 05 Jul, 2018 1 commit


Andrei Paskevich authored

 04 Jul, 2018 1 commit


JeanChristophe Filliatre authored
to the HTML online version of the standard library

 02 Jul, 2018 1 commit


Andrei Paskevich authored

 23 Jun, 2018 1 commit


Guillaume Melquiond authored

 21 Jun, 2018 1 commit


Andrei Paskevich authored

 17 Jun, 2018 1 commit


JeanChristophe Filliatre authored
the constructive version is now in witness.Nat the nonconstructive version is witness.Witness

 15 Jun, 2018 2 commits


Andrei Paskevich authored

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 5 commits


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

JeanChristophe Filliatre authored

JeanChristophe Filliatre authored

Guillaume Melquiond authored
"\`\`" could have been used too, but it is a bit unreadable.

Guillaume Melquiond authored

 13 Jun, 2018 1 commit


JeanChristophe Filliatre authored
exhibits, constructively, a nonnegative integer n such that p n whenever we can prove the existence of such an integer

 07 Jun, 2018 1 commit


Raphael RieuHelft authored

 06 Jun, 2018 1 commit


MARCHE Claude authored

 05 Jun, 2018 1 commit


Andrei Paskevich authored

 01 Jun, 2018 4 commits


JeanChristophe Filliatre authored

JeanChristophe Filliatre authored

JeanChristophe Filliatre authored

JeanChristophe Filliatre authored

 31 May, 2018 2 commits


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

JeanChristophe Filliatre authored

 24 May, 2018 1 commit


JeanChristophe Filliatre authored

 17 May, 2018 1 commit


JeanChristophe Filliatre authored
the model is a sequence of integers, of type 'seq int' the idea is to lower the pollution of VCs with values of int63 (and subsequent to_int operations) drawbacks:  this new type of arrays is not compatible with the one from mach.array.Array63  when using both, we cannot use syntax [] and []< for both types in programs (no overloading in programs) and thus we have to use A.([]) and A.([]<) for one of them

 16 May, 2018 1 commit


Guillaume Melquiond authored

 15 May, 2018 1 commit


JeanChristophe Filliatre authored
(name the lambda that is passed to numof)

 14 May, 2018 1 commit


JeanChristophe Filliatre authored
instead of a function of type int>'a a coercion is declared from arrays to sequences, so that notation a[i] in the logic now refers to the sequence operation small caveat: you have to open module seq.Seq to be able to use this notation

 30 Apr, 2018 1 commit


JeanChristophe Filliatre authored

 10 Apr, 2018 1 commit


JeanChristophe Filliatre authored

 04 Apr, 2018 1 commit


Raphael RieuHelft authored

 13 Mar, 2018 1 commit


Guillaume Melquiond authored

 09 Mar, 2018 1 commit


Raphael RieuHelft authored

 06 Mar, 2018 1 commit


Guillaume Melquiond authored

 26 Feb, 2018 1 commit


Raphael RieuHelft authored

 21 Feb, 2018 1 commit


Raphael RieuHelft authored

 14 Feb, 2018 1 commit


Raphael RieuHelft authored

 07 Feb, 2018 1 commit


MARCHE Claude authored
