1. 11 Sep, 2011 2 commits
2. 10 Sep, 2011 2 commits
3. 21 Jul, 2011 1 commit
4. 13 Jul, 2011 1 commit
• Add support for generic printing of integers and reals. · 1ba8f1a6
Guillaume Melquiond authored
```Prover capabilities are now represented by a record enumerating each case and which syntax to use then.
This fixes output of nondecimal integers to provers (bug #12981).

TODO: check whether some provers support more than just decimal representations.```
5. 06 Jul, 2011 1 commit
6. 01 Jul, 2011 2 commits
7. 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".```
8. 18 Jun, 2011 2 commits
9. 03 Jun, 2011 1 commit
10. 24 May, 2011 1 commit
11. 16 May, 2011 1 commit
12. 15 May, 2011 4 commits
13. 14 May, 2011 1 commit
14. 09 Mar, 2011 1 commit
15. 05 Mar, 2011 2 commits
16. 04 Mar, 2011 1 commit
17. 23 Feb, 2011 1 commit
18. 21 Jan, 2011 1 commit
19. 14 Jan, 2011 1 commit
20. 26 Dec, 2010 1 commit
21. 25 Dec, 2010 1 commit
22. 13 Dec, 2010 1 commit
23. 04 Dec, 2010 1 commit
24. 17 Nov, 2010 1 commit
25. 29 Oct, 2010 1 commit
26. 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!```
27. 11 Oct, 2010 1 commit
28. 02 Oct, 2010 1 commit
29. 30 Aug, 2010 1 commit
30. 27 Aug, 2010 3 commits