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