+0.5.7 - 15/02/2009 - Pàdoa release
+ * are_convertible bug solved, arguments of application where
+ compared allowing cumulativity. This allowed to prove Type0=Type1.
+ * cases tactic speedup in the simplest case of an inductive type
+ hose right parameters have all to be abstracted when the outtype is
+ built
+ * maction support added to output notation (adopted for "=" that
+ expands to "= \sub T" to show the equality type)
+ * generation of derived lemmas rewritten to be based on hooks that
+ are triggered every definition
+ * composition of coercions fixed, more composite are generated
+ * undo mechanism for coercions remade, should work better
+ * new command "prefer coercion foo" to reorder coercions.
+ * UTF-8 eq classes and virtuals described in the manual and
+ consistently printed in the TeX/UTF-8 table
+ * added a memory system for UTF-8 equivalence classes, so that
+ last choice is remembered and attempted first next time the same
+ eq class is walked trough