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