1. 12 Oct, 2012 1 commit
2. 04 Sep, 2012 1 commit
3. 03 Sep, 2012 1 commit
4. 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".```
5. 03 Jun, 2011 1 commit
6. 03 Mar, 2011 1 commit
7. 25 Feb, 2011 1 commit
8. 29 Oct, 2010 1 commit
9. 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!```
10. 25 Aug, 2010 1 commit
11. 17 Jul, 2010 1 commit
12. 24 Jun, 2010 1 commit
• - Convert the syntax of prototype declarations and type expressions · ddfa942e
```  in the logic language into (more or less) higher-order style.
For example,

logic func (x : int, y : int, 'a list) : (int, 'a) map list

logic pred (bool, int * real)

is now written:

logic func (x y : int) (list 'a) : list (map int 'a)

logic pred bool (int, real)

Note that types use prefix notation (as in Coq) and the types
of tuples are now written as (type1, type2, ..., typeN).

- Use the same syntax of type expressions in the program language.

- Allow binders of the form (x y:int) in the program language.
```
13. 21 Jun, 2010 2 commits
14. 24 Mar, 2010 1 commit
• several modifications around namespaces: · b8a9808d
```- do not add to the new namespace the old instantiated names
- namespaces with the same name are merged instead of raising
an exception.