1. 15 Sep, 2016 1 commit
2. 23 Nov, 2014 1 commit
3. 20 Mar, 2014 1 commit
4. 11 Feb, 2014 1 commit
5. 10 Feb, 2014 1 commit
6. 30 Jan, 2013 1 commit
• reorganize examples/ · 4b1bc2b0
```- all programs with sessions are in examples/
- all programs without sessions are in examples/in_progress/
(if you have private sessions for those, just move them there)
- all pure logical problems are in logic/
(to simplify bench scripts and gallery building; they are few anyway)
- all OCaml programs are in examples/use_api/
- all strange stuff is in examples/misc/
(most of it should probably go)
- Claude's solutions for Foveoos 2011 are in examples/foveoos11-cm/
(why do we need two sets of solutions for quite simple problems?)
- hoare_logic, bitvectors, vacid_0_binary_heaps are in examples/

Bench scripts and documentation are updated.
Also, bench/bench is simplified a little bit.```
7. 12 Oct, 2012 1 commit
8. 05 Aug, 2011 1 commit
9. 29 Jun, 2011 1 commit
• several changes in syntax · aa2c430e
```- No more "and", "or", "implies", "iff", and "~".
Use "/\", "\/", "->", "<->", and "not" instead.

- No more "logic". Use "function" or "predicate".```
10. 20 May, 2011 1 commit
11. 16 May, 2011 1 commit
12. 30 Dec, 2010 1 commit
13. 29 Dec, 2010 1 commit
14. 26 Oct, 2010 1 commit
• verify termination (à la Fixpoint) of recursive logic definitions · f92739a1
```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!```
15. 18 Aug, 2010 1 commit
16. 04 Jul, 2010 1 commit
17. 02 Jul, 2010 1 commit
18. 01 Jul, 2010 1 commit
19. 25 Jun, 2010 2 commits