Improve the debugging of the unify step of the tallying. Fix a bug where substitutions were applied in the wrong order, yielding partially empty types.

Change the ordering use for types during constraint generation with one which is compatible with subtyping, when types are comparable.

 * add a makefile rule 'make .merlin' to generate a merlin project file
 * call ocaml with the -bin-annot if supported
 * add the *.cmt* files to .gitignore and to the makefile clean rule.

Further simplify the type algebra code, using the newly introduced combinators (map/fold/iter) over types.

Move the bool.ml{,i} files in types/ where they belong.

Add more test cases to the the pretty printer/parser test suite.

Fix various bugs in the pretty-printer (union of atoms not parenthesized, | instead of & for some toplevel variables)

Add a wrapper around the type printing function to prevent them from outputing illegal code (such as [(Char | (*--2)*)* ]. (which contains CDuce comments).

Implement some semantic simplification of BDDs. This fixes the exponential beahviour during the typing of the application of flatten.

Refactor the Bool/BoolVar code so that they share the same interface. Give access to the underlying atom module in BoolVar.

Improve pretty printing of Bdds and add debug directive to interactively inspect the internal representation of types.

exponentially large types in some cases. This simplifies types of the form:
T & 'a | T \ 'a into T.

because they appeared both on negative and positive occurences in bdds
that are equivalent to the empty type.

For instance t = ('a | (Int\'a) | Int)

We use product normalization to clean up this.

Use the new debugging infrastructure to see what is going on during constraint solving.