1 0.5.9 - 22/12/2014 - minor fixes + library upgrade
2 * Ported to new version of OCaml libraries
3 * the USER name is used by default for mangling the DB table names.
4 The latter cannot contain dots and other special characters. A check
7 0.5.8 - 02/12/2009 - toward the 1.x series
8 * Complete rewriting of paramodulation code (thanks to Maxime Denes),
9 that is abstract over the data type embedded in the fisrt order
10 theory the procedure is able to handle.
11 Can be used as a stand-alone prover, and partecipated
12 to the CASC22 beating many older systems ;-)
13 * new (compact) kernel:
15 * height (inter object dependency) driven conversion
16 * compact metavariable representation
17 * experimental irrelevant arguments handling in convesion
18 (in the spirit of proof irrelevance)
19 * explicit predicative universes
21 * bi-directional type inference
23 * implicit vector (expands to the right number of implicits)
25 * new type for tactics, with a global view on the ongoing proof
26 * heavily based on the refiner
27 * work with terms labelled with their contexts
28 * new auto (prolog like) proof search tactic:
29 * works on a set of goals
30 * non uniform context support:
31 * arbitrary tactics can be called to attack a goal (hardcoded
32 at the OCaml level), for now just apply and intro
34 * the standard library (now we have two of them) is not
35 distributed pre-compiled
36 * standard library .ma files can be included from everywhere since
37 they are in a standard path
38 * including a file of the standard library triggers its compilation
41 0.5.7 - 15/02/2009 - PĂ doa release
42 * are_convertible bug solved, arguments of application where
43 compared allowing cumulativity. This allowed to prove Type0=Type1.
44 * cases tactic speedup in the simplest case of an inductive type
45 hose right parameters have all to be abstracted when the outtype is
47 * maction support added to output notation (adopted for "=" that
48 expands to "= \sub T" to show the equality type)
49 * generation of derived lemmas rewritten to be based on hooks that
50 are triggered every definition
51 * composition of coercions fixed, more composite are generated
52 * undo mechanism for coercions remade, should work better
53 * new command "prefer coercion foo" to reorder coercions.
54 * UTF-8 eq classes and virtuals described in the manual and
55 consistently printed in the TeX/UTF-8 table
56 * added a memory system for UTF-8 equivalence classes, so that
57 last choice is remembered and attempted first next time the same
58 eq class is walked trough
59 * some core notation fixed to allow a better setoid-path
60 representation (foo ^-1 changed precedence)
61 * matita manual updated with a section regarding the usage of
62 the liveCD with the VirtualBox emulator
63 * liveCD fixed to allow to easily mount/unmount real host folders
65 * ttf-freefont package added to the liveCD together with gucharmap
66 * coercions from convertible types are not inserted for real, they
67 just behave as hints for the unification algorithm
68 * virtuals (eq classes) fixed w.r.t. greek letters
69 * some virtuals added to ease the writing of diamond (<>), box ([])
71 * code that generates eliminators fixed to use whd ~delta set to true
72 when counting products, this allows to used definitions as inductive
74 * match ... with rendering fixed to break the box containing
75 constructors arguments if needed (i.e. record projections
76 are now almost readable)
77 * fixed pattern matching over ast terms, Ast.Case construct can be
78 matched correctly. Look the o-algebra example if you are
80 * Mpadded MathML tag can be used in notation, it allows to overlap
81 symbols reducing the bounding box size
83 0.5.6 - 1/12/2008 - bugfix release
84 * more abstract disambiguation algorithm, simpler instantiation
85 to a different CIC/refiner
86 * natural deduction support improved in the first order case
87 * natural deduction lem rule does now support lemmas
88 with (up to) 3 premises (multicut rule, displayed as
91 0.5.5 - 17/11/2008 - bugfix release with students in mind
92 * by ... we proved fixed to use only the specified lemmas but
93 using full unification inside auto.
94 * new apply rule tactic, that exploits the goal type to
95 disambiguate the input term.
96 * new didactic/ library directory, with support for natural deduction
99 0.5.4 - 19/10/2008 - bugfix release
100 * When a file is opened, the cursor is placed at the begin of the
101 buffer and not atthe end as before
103 * More code in the direction of a fully functional matita status, that
104 improved undo reliability in the parser/notation modules
105 * matitac was seldom compiling up-to-date files, fixed
106 * Memory consumption durin proof construction cut down using Lazy.t
108 * mstyle support in notation for text color, font size
109 * AutoGui now scales fonts to the correct user-requested size
110 * Non linear pattern matching from the level of terms to the
111 one of content in interpretation command (if the same variable name
112 is used, the two captured terms must be alpha equivalent to match)
114 0.5.3 - 23/7/2008 - bugfix release
115 * many fixes concerning the CProp hiearchy
116 * coercion database simplified
117 * coercion hiding now works properly for coercions to funclass
118 * triangular pullback works better with coercions to the function space
119 * notation for lists fixed to add a break point after the separator
120 * notation for the existential is now user definable
121 * \infrule layout added, allows to display readable fractions
122 * better window for terms grammar and TeX/Unicode
123 * fixed a bug in the positivity check not considering some subterms
124 * fixed some GUI glitches thanks to glade-3
126 0.5.2 - 2/7/2008 - better-usability-for-the-working-constructivist release
127 * refinement of match fixed to prevent useless unfolding,
128 head_beta_reduce is used instead of whd ~delta:true
129 * CProp hierarchy, interleaved with type (used to be a single universe)
130 * Notation now allows to set the precedence level of subterms, avoiding
131 unnecessary parenthese
132 * UTF-8 / TeX conversion table is now available in the Help menu
133 * Notation subsystem described in the manual
134 * EBNF term grammar is now available in the View menu (and is in sync with
135 the currently loaded notation)
136 * Rewrite tactic (in hypothesis) now computes the right sort and
137 uses the right equality elimination principle
138 * URI free interpretation and coercion statements (scripts are almost
140 * elim and cases tactic now support a pattern to specify hypotheses that
141 are generalized before the elimination.
143 0.5.1 - 29/5/2008 - minor bug fix release
144 * visualization of inductive types reports the number of fixed parameters
145 * a wrong context was used to refine fixpoints arguments
146 when trying to optimize out the letin (grep for `AvoidLetIn):
147 (let rec f x = Fix... in f t ---> Fix... t)
148 * auto fixed to prefer goals with metavariables to closed ones,
149 added new syntax to specify the universe "auto by t1, t2, ...",
150 updated documentation describing all auto parameters
151 * declarative language syntax and documentation ported to the new
154 0.5.0 - 9/5/2008 - bugfix release
155 * first release not considered experimental
157 0.4.98 - ??/11/2007 - bugfix release
158 * compiles against camlp5 >= 5.0
159 * changed lablgtksourceview module name since it is now part of lablgtk2
161 0.4.97 - 16/11/2007 - initial release