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