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