- 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".
-
- 22 Jun, 2011 1 commit
-
-
MARCHE Claude authored
experimental distance of terms dropped
-
- 18 Jun, 2011 2 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
- 17 Jun, 2011 1 commit
-
-
Andrei Paskevich authored
-
- 16 Jun, 2011 3 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Jean-Christophe authored
-
- 15 Jun, 2011 1 commit
-
-
Andrei Paskevich authored
in particular, there is no more need to define intermediate sorts or to close the set of protected types wrt subtyping
-
- 13 Jun, 2011 1 commit
-
-
Andrei Paskevich authored
-
- 12 Jun, 2011 3 commits
-
-
Andrei Paskevich authored
You must run ./config.status after this commit
-
Andrei Paskevich authored
-
Andrei Paskevich authored
- provide a method to mark proof attempts as obsolete (thus, we can replay a saved tree even if the source file hasn't changed) - cleaning applies to a subtree (like transformations and provers), not only at the first level - obsolete proof attempts do not count as successuful
-
- 11 Jun, 2011 2 commits
-
-
Andrei Paskevich authored
also apply transformations to the proved subgoals if "all subgoals" is selected (just as we do it for provers)
-
Andrei Paskevich authored
- create_env_of_loadpath is now provided in Env instead of Lexer - find_channel functions now depend on format to determine the suitable extensions
-
- 10 Jun, 2011 2 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
- 07 Jun, 2011 4 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
also preserve proposition names in split_premise when possible
-
- 05 Jun, 2011 1 commit
-
-
Andrei Paskevich authored
What was its purpose in the first place? Integers are protected in Simplify anyway and then we can simply forget the difference between the infinite sorts (as we do in encoding_tptp).
-
- 04 Jun, 2011 3 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
- 03 Jun, 2011 6 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
This permits using them in transformations, as they also preserve the term structure. Export Term.t_ty_map and Term.t_app_map. We can generalize t_s_map to cover t_app_map, but this requires computing the list of types for every application, which we rarely need.
-
Andrei Paskevich authored
which gives us a cheap test for recursive defitions. We could also make an effort to ignore the conclusions in inductive predicate definitions but it's probably not worth it.
-
Andrei Paskevich authored
also, export Ty.ty_v_* traversal functions
-
- 02 Jun, 2011 1 commit
-
-
Andrei Paskevich authored
-
- 31 May, 2011 8 commits
-
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Jean-Christophe Filliâtre authored
-