-0.5.7 - .../01/2009 - Pàdoa release
+0.5.8 - ... - 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 tight 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
+
+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
projects / helm.git / blobdiff