- 23 Jul, 2012 2 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
- 20 Jul, 2012 17 commits
-
-
Andrei Paskevich authored
-
Jean-Christophe Filliâtre authored
-
Andrei Paskevich authored
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
lgondelman authored
Transformation induction sur l'ordre lexicographique suivant la définition des types : les labels d'utilisateur pris en compte
-
Jean-Christophe Filliâtre authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Jean-Christophe Filliâtre authored
the original file is properly saved and restored upon completion (whatever the result is)
-
- 19 Jul, 2012 7 commits
-
-
Jean-Christophe Filliâtre authored
-
Andrei Paskevich authored
-
MARCHE Claude authored
-
MARCHE Claude authored
-
MARCHE Claude authored
-
MARCHE Claude authored
-
MARCHE Claude authored
-
- 18 Jul, 2012 14 commits
-
-
Guillaume Melquiond authored
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
Leon Gondelman authored
First working prototype of induction tactic working with lexicographic orders according to type definition
-
Andrei Paskevich authored
-
MARCHE Claude authored
-
MARCHE Claude authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
Alt-Ergo still fails at proving the following goal about distributivity though. theory Test use import bool.Bool goal G: forall x y z:bool. andb (orb x y) z = orb (andb x z) (andb y z) end
-
Guillaume Melquiond authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-