- 06 Jun, 2018 2 commits
-
-
MARCHE Claude authored
-
MARCHE Claude authored
-
- 05 Jun, 2018 10 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Jean-Christophe Filliâtre authored
-
Raphael Rieu-Helft authored
-
Andrei Paskevich authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
- 04 Jun, 2018 5 commits
-
-
Jean-Christophe Filliâtre authored
-
Andrei Paskevich authored
-
MARCHE Claude authored
-
MARCHE Claude authored
-
Raphael Rieu-Helft authored
-
- 01 Jun, 2018 13 commits
-
-
Andrei Paskevich authored
-
Sylvain Dailler authored
Black on red was not readable. Colors to be decided.
-
Sylvain Dailler authored
-
Sylvain Dailler authored
As a side effect, this also modifies reflection.ml accordingly.
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
- 31 May, 2018 10 commits
-
-
Jean-Christophe Filliâtre 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 well-foundedness is out of reach of SMT solvers; but at least this is sound now
-
Jean-Christophe Filliâtre authored
-
Andrei Paskevich authored
Also, move some model-related labelling from Parser to Vc.
-
Jean-Christophe Filliâtre authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Jean-Christophe Filliâtre authored
a branch is typed *after* unifying the type of the pattern with the type of the matched value fixes issue #124 (return type and coercions) done in both logic and programs
-
Jean-Christophe Filliâtre authored
-