1 0.99.4 - 26/12/2018 - beta version for the 1.x series
2 * ported to lablgkt3, ulex-camlp5 1.2, ocaml 4.07
3 * bug fix: aliases were no longer added automatically to the script
5 0.99.3 - 06/05/2016 - beta version for the 1.x series
6 * cyclic sort hierarchies are now allowed through the "cyclic" keyword
7 * new syntax for let rec/corec with flavor specifier
8 * optional parameters added to the syntax of definitions
9 * new attribute "Implied" put beside "Generated" and "Provided";
10 it denotes an object provided not as defined by the user, but as
11 generated by another ITP
12 * the command "defined" is added as a presentational alternative to
14 * improved standard library and contributions
15 * improved binaries using matita components
16 * source code updated for the latest version of OCaml and related
20 0.99.1 - 17/11/2011 - alpha version for the 1.x series
21 * old kernel, unification, etc. removed
22 * new compact syntax for tactics
24 * experimental multi tabbed interface
25 * John Major equality and the computation version of the K axiom are
26 now in the standard library
27 * generation of inversion/destruct principles using either
28 Leibniz or John Major equalities
31 0.5.7 - 15/02/2009 - PĂ doa release
32 * are_convertible bug solved, arguments of application where
33 compared allowing cumulativity. This allowed to prove Type0=Type1.
34 * cases tactic speedup in the simplest case of an inductive type
35 hose right parameters have all to be abstracted when the outtype is
37 * maction support added to output notation (adopted for "=" that
38 expands to "= \sub T" to show the equality type)
39 * generation of derived lemmas rewritten to be based on hooks that
40 are triggered every definition
41 * composition of coercions fixed, more composite are generated
42 * undo mechanism for coercions remade, should work better
43 * new command "prefer coercion foo" to reorder coercions.
44 * UTF-8 eq classes and virtuals described in the manual and
45 consistently printed in the TeX/UTF-8 table
46 * added a memory system for UTF-8 equivalence classes, so that
47 last choice is remembered and attempted first next time the same
48 eq class is walked trough
49 * some core notation fixed to allow a better setoid-path
50 representation (foo ^-1 changed precedence)
51 * matita manual updated with a section regarding the usage of
52 the liveCD with the VirtualBox emulator
53 * liveCD fixed to allow to easily mount/unmount real host folders
55 * ttf-freefont package added to the liveCD together with gucharmap
56 * coercions from convertible types are not inserted for real, they
57 just behave as hints for the unification algorithm
58 * virtuals (eq classes) fixed w.r.t. greek letters
59 * some virtuals added to ease the writing of diamond (<>), box ([])
61 * code that generates eliminators fixed to use whd ~delta set to true
62 when counting products, this allows to used definitions as inductive
64 * match ... with rendering fixed to break the box containing
65 constructors arguments if needed (i.e. record projections
66 are now almost readable)
67 * fixed pattern matching over ast terms, Ast.Case construct can be
68 matched correctly. Look the o-algebra example if you are
70 * Mpadded MathML tag can be used in notation, it allows to overlap
71 symbols reducing the bounding box size
73 0.5.6 - 1/12/2008 - bugfix release
74 * more abstract disambiguation algorithm, simpler instantiation
75 to a different CIC/refiner
76 * natural deduction support improved in the first order case
77 * natural deduction lem rule does now support lemmas
78 with (up to) 3 premises (multicut rule, displayed as
81 0.5.5 - 17/11/2008 - bugfix release with students in mind
82 * by ... we proved fixed to use only the specified lemmas but
83 using full unification inside auto.
84 * new apply rule tactic, that exploits the goal type to
85 disambiguate the input term.
86 * new didactic/ library directory, with support for natural deduction
89 0.5.4 - 19/10/2008 - bugfix release
90 * When a file is opened, the cursor is placed at the begin of the
91 buffer and not atthe end as before
93 * More code in the direction of a fully functional matita status, that
94 improved undo reliability in the parser/notation modules
95 * matitac was seldom compiling up-to-date files, fixed
96 * Memory consumption durin proof construction cut down using Lazy.t
98 * mstyle support in notation for text color, font size
99 * AutoGui now scales fonts to the correct user-requested size
100 * Non linear pattern matching from the level of terms to the
101 one of content in interpretation command (if the same variable name
102 is used, the two captured terms must be alpha equivalent to match)
104 0.5.3 - 23/7/2008 - bugfix release
105 * many fixes concerning the CProp hiearchy
106 * coercion database simplified
107 * coercion hiding now works properly for coercions to funclass
108 * triangular pullback works better with coercions to the function space
109 * notation for lists fixed to add a break point after the separator
110 * notation for the existential is now user definable
111 * \infrule layout added, allows to display readable fractions
112 * better window for terms grammar and TeX/Unicode
113 * fixed a bug in the positivity check not considering some subterms
114 * fixed some GUI glitches thanks to glade-3
116 0.5.2 - 2/7/2008 - better-usability-for-the-working-constructivist release
117 * refinement of match fixed to prevent useless unfolding,
118 head_beta_reduce is used instead of whd ~delta:true
119 * CProp hierarchy, interleaved with type (used to be a single universe)
120 * Notation now allows to set the precedence level of subterms, avoiding
121 unnecessary parenthese
122 * UTF-8 / TeX conversion table is now available in the Help menu
123 * Notation subsystem described in the manual
124 * EBNF term grammar is now available in the View menu (and is in sync with
125 the currently loaded notation)
126 * Rewrite tactic (in hypothesis) now computes the right sort and
127 uses the right equality elimination principle
128 * URI free interpretation and coercion statements (scripts are almost
130 * elim and cases tactic now support a pattern to specify hypotheses that
131 are generalized before the elimination.
133 0.5.1 - 29/5/2008 - minor bug fix release
134 * visualization of inductive types reports the number of fixed parameters
135 * a wrong context was used to refine fixpoints arguments
136 when trying to optimize out the letin (grep for `AvoidLetIn):
137 (let rec f x = Fix... in f t ---> Fix... t)
138 * auto fixed to prefer goals with metavariables to closed ones,
139 added new syntax to specify the universe "auto by t1, t2, ...",
140 updated documentation describing all auto parameters
141 * declarative language syntax and documentation ported to the new
144 0.5.0 - 9/5/2008 - bugfix release
145 * first release not considered experimental
147 0.4.98 - ??/11/2007 - bugfix release
148 * compiles against camlp5 >= 5.0
149 * changed lablgtksourceview module name since it is now part of lablgtk2
151 0.4.97 - 16/11/2007 - initial release