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