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