X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fdist%2FChangeLog;h=a0a1c51a9dc6442819675d44ed7ea103c5f726c5;hb=732ffd3b5cb77cbacb60b95c1d52d3b63bd56c3b;hp=46609ad4cba6d3741f05fb7f302033b757e6654c;hpb=84e6cbe962c9a534be48542c098d7bb0d90be9a1;p=helm.git diff --git a/helm/software/matita/dist/ChangeLog b/helm/software/matita/dist/ChangeLog index 46609ad4c..a0a1c51a9 100644 --- a/helm/software/matita/dist/ChangeLog +++ b/helm/software/matita/dist/ChangeLog @@ -1,4 +1,46 @@ -0.5.7 - .../01/2009 - Pàdoa release +0.5.8 - 02/12/2009 - toward the 1.x series + * Complete rewriting of paramodulation code (thanks to Maxime Denes), + that is abstract over the data type embedded in the fisrt order + theory the procedure is able to handle. + Can be used as a stand-alone prover, and partecipated + to the CASC22 beating many older systems ;-) + * new (compact) kernel: + * toplevel fixpoints + * height (inter object dependency) driven conversion + * compact metavariable representation + * experimental irrelevant arguments handling in convesion + (in the spirit of proof irrelevance) + * explicit predicative universes + * new refiner: + * bi-directional type inference + * unification hints + * implicit vector (expands to the right number of implicits) + * new basic tactics: + * new type for tactics, with a global view on the ongoing proof + * heavily based on the refiner + * work with terms labelled with their contexts + * new auto (prolog like) proof search tactic: + * works on a set of goals + * non uniform context support: + * arbitrary tactics can be called to attack a goal (hardcoded + at the OCaml level), for now just apply and intro + * new installation: + * the standard library (now we have two of them) is not + distributed pre-compiled + * standard library .ma files can be included from everywhere since + they are in a standard path + * including a file of the standard library triggers its compilation + in the user's space + * gtksourceview2 based text widget (lablgtk >= 2.14) + +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