local variables and global variables that are either cheap to evaluate
   or used no more than once.

 - changed the printing of unused variables

 - cleaner (but heavier !) code generation scheme for automata

 - one automata example added
 - changed the reset condition in node calls (now a simple bool expr)
 - bug corrected in clock calculus
 - bug corrected in traceability info
 - added field in variables to test whether they are original 
   or created by normalization process: better error message 
   for causality problems

 Warning: this is the first working version of automata, needs further 
 testing (and debugging). AFAIK, the semantics is close to Lustre V6,
 but further changes may be needed to equate them.

 - debugging in progress, not usable yet

 - removed a potential source of bug in scheduler

 - corrected several bugs in inlining
 - STILL, BUGS REMAINING in inlined code !!??!!

  - added interface files (.lusi) in the language, that can be compiled on their own, giving an object file (.lusic) and a header file (.h)
  - modular code generation, from Lustre to C level included.
  - nice amount of code refactoring

   in order to ease the way .lusi interface files are handled.

   much more simple and efficient.

   weak (but still correct) optimization results.

   tuple expressions
 - added an algorithm that reuses dead or clock-disjoint 
   variables instead of declaring/using new ones.
   - NOT carefully tested. Use option -O 3 if you want 
     to give it a try
   - some output name may change from node to machine code,
     this point could be discussed...
   - further optimizations of machine code are now enabled
     (eg. merging case constructs)

Moved backends in separate folders

   - typing/clock calculus/normalization now work properly
   - still, a bug in annot generation (this one is for Ploc !!)
     in file normalization, line 396
 - bug corrected in subtyping
 - scheduling outcome changed:
   - variables appearing in a call output are gathered
   - ease the design of a reusability algorithm
 - liveness/reusability is still a work in progress

Merged branches specification_reorg_corelang_parser (see last commit message, moved definitions/functions btw files and changed eexpr type)

1. moved type def in lustrespec.ml
2. moved constructor and basic functions in corelang
3. Modified eexpr with prenext quantifiers

 could be useful for a finer variable elimination scheme at the Lustre level.
 to be continued...

  - exact definition of 'useless' may be further refined
  - display could certainly be improved