- 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".
-
- 18 Jun, 2011 2 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
- 03 Jun, 2011 1 commit
-
-
Andrei Paskevich authored
also, export Ty.ty_v_* traversal functions
-
- 24 May, 2011 1 commit
-
-
Jean-Christophe Filliâtre authored
-
- 16 May, 2011 1 commit
-
-
Andrei Paskevich authored
-
- 15 May, 2011 4 commits
-
-
Andrei Paskevich authored
move old fnT+fnF versions of t_map, t_fold, etc. to a submodule
-
Andrei Paskevich authored
-
Andrei Paskevich authored
Rename as little as possible and keep the API. Make all the necessary checks in Term and Decl. Remove the duplicate code in Term but keep it elsewhere. We will factorize the code as we go, without rush.
-
Andrei Paskevich authored
I love static typing!
-
- 14 May, 2011 1 commit
-
-
Andrei Paskevich authored
-
- 09 Mar, 2011 1 commit
-
-
Andrei Paskevich authored
-
- 05 Mar, 2011 2 commits
-
-
Andrei Paskevich authored
- the new syntax for localisation "labels" in Why is as follows: goal Toto #"file" line bchar echar# - after an ident #"file" line bchar echar" (A and B) - before a term/fmla - the new syntax for buffer relocation is as follows: ##"file" line char##
-
Andrei Paskevich authored
-
- 04 Mar, 2011 1 commit
-
-
MARCHE Claude authored
-
- 23 Feb, 2011 1 commit
-
-
Andrei Paskevich authored
-
- 21 Jan, 2011 1 commit
-
-
Andrei Paskevich authored
-
- 14 Jan, 2011 1 commit
-
-
Andrei Paskevich authored
-
- 26 Dec, 2010 1 commit
-
-
Andrei Paskevich authored
-
- 25 Dec, 2010 1 commit
-
-
Andrei Paskevich authored
-
- 13 Dec, 2010 1 commit
-
-
MARCHE Claude authored
-
- 04 Dec, 2010 1 commit
-
-
Andrei Paskevich authored
-
- 17 Nov, 2010 1 commit
-
-
Andrei Paskevich authored
-
- 29 Oct, 2010 1 commit
-
-
Andrei Paskevich authored
-
- 26 Oct, 2010 1 commit
-
-
Andrei Paskevich authored
the verification algorithm must always terminate and be reasonably performant in practice, but its worst-case complexity is unknown and probably exponential. What is quite easy when there is only one recursive definition, becomes difficult when there is a group of mutually recursive definitions. An educated discussion would be highly appreciated. BTW, I had to convert a couple of recursive "logic"s on integers into an abstract "logic" + axiom. Pretty much all of them supposed that the argument was non-negative, and thus were non-terminating!
-
- 11 Oct, 2010 1 commit
-
-
MARCHE Claude authored
-
- 02 Oct, 2010 1 commit
-
-
Andrei Paskevich authored
-
- 30 Aug, 2010 1 commit
-
-
Andrei Paskevich authored
-
- 27 Aug, 2010 3 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
- 18 Aug, 2010 1 commit
-
-
Jean-Christophe Filliâtre authored
= replaced by ls_equal in core/pretty (was discovered thanks to a Invalid_argument(equal: functional value)
-
- 17 Aug, 2010 1 commit
-
-
Andrei Paskevich authored
-
- 16 Aug, 2010 1 commit
-
-
Francois Bobot authored
-
- 11 Aug, 2010 1 commit
-
-
Andrei Paskevich authored
-
- 21 Jul, 2010 2 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-
- 20 Jul, 2010 1 commit
-
-
Andrei Paskevich authored
-
- 17 Jul, 2010 2 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-