wenzelm@3943
|
1 |
|
wenzelm@2553
|
2 |
Isabelle NEWS -- history of user-visible changes
|
wenzelm@2553
|
3 |
================================================
|
wenzelm@2553
|
4 |
|
wenzelm@3454
|
5 |
New in Isabelle???? (DATE ????)
|
wenzelm@3454
|
6 |
-------------------------------
|
wenzelm@3454
|
7 |
|
paulson@3715
|
8 |
*** General Changes ***
|
wenzelm@3697
|
9 |
|
wenzelm@4174
|
10 |
* hierachically structured name spaces (for consts, types, axms, thms
|
wenzelm@3943
|
11 |
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
|
wenzelm@4108
|
12 |
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
|
wenzelm@4108
|
13 |
isatool fixdots ensures space after dots (e.g. "%x. x"); set
|
wenzelm@4174
|
14 |
long_names for fully qualified output names; NOTE: ML programs
|
wenzelm@4174
|
15 |
(special tactics, packages etc.) referring to internal names may have
|
wenzelm@4174
|
16 |
to be adapted to cope with fully qualified names; in case of severe
|
wenzelm@4174
|
17 |
backward campatibility problems try setting 'global_names' at compile
|
wenzelm@4174
|
18 |
time to have enrything declared within a flat name space; one may also
|
wenzelm@4174
|
19 |
fine tune name declarations in theories via the 'global' and 'local'
|
wenzelm@4174
|
20 |
section;
|
wenzelm@4108
|
21 |
|
wenzelm@4108
|
22 |
* reimplemented the implicit simpset and claset using the new anytype
|
wenzelm@4108
|
23 |
data filed in signatures; references simpset:simpset ref etc. are
|
wenzelm@4108
|
24 |
replaced by functions simpset:unit->simpset and
|
wenzelm@4108
|
25 |
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
|
wenzelm@4108
|
26 |
to patch your ML files accordingly;
|
paulson@3856
|
27 |
|
wenzelm@3857
|
28 |
* HTML output now includes theory graph data for display with Java
|
wenzelm@3857
|
29 |
applet or isatool browser; data generated automatically via isatool
|
wenzelm@3901
|
30 |
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
|
wenzelm@3857
|
31 |
|
paulson@3856
|
32 |
* defs may now be conditional; improved rewrite_goals_tac to handle
|
paulson@3856
|
33 |
conditional equations;
|
paulson@3856
|
34 |
|
wenzelm@4174
|
35 |
* defs now admits additional type arguments, using TYPE('a) syntax;
|
wenzelm@4174
|
36 |
|
wenzelm@3901
|
37 |
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
|
wenzelm@3901
|
38 |
creates a new theory node; implicit merge of thms' signatures is
|
wenzelm@4112
|
39 |
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
|
wenzelm@3901
|
40 |
transfer:theory->thm->thm in (rare) cases;
|
wenzelm@3901
|
41 |
|
wenzelm@3968
|
42 |
* improved handling of draft signatures / theories; draft thms (and
|
wenzelm@3968
|
43 |
ctyps, cterms) are automatically promoted to real ones;
|
wenzelm@3968
|
44 |
|
wenzelm@3901
|
45 |
* slightly changed interfaces for oracles: admit many per theory, named
|
wenzelm@3901
|
46 |
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
|
wenzelm@3901
|
47 |
|
wenzelm@3901
|
48 |
* print_goals: optional output of const types (set show_consts and
|
wenzelm@3901
|
49 |
show_types);
|
wenzelm@3851
|
50 |
|
wenzelm@3744
|
51 |
* improved output of warnings (###) / errors (***);
|
wenzelm@3697
|
52 |
|
paulson@4178
|
53 |
* subgoal_tac displays a warning if the new subgoal has type variables;
|
paulson@4178
|
54 |
|
paulson@3715
|
55 |
* removed old README and Makefiles;
|
paulson@3715
|
56 |
|
paulson@3856
|
57 |
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
|
wenzelm@3670
|
58 |
|
paulson@3715
|
59 |
* removed obsolete init_pps and init_database;
|
paulson@3715
|
60 |
|
paulson@3715
|
61 |
* deleted the obsolete tactical STATE, which was declared by
|
paulson@3715
|
62 |
fun STATE tacfun st = tacfun st st;
|
paulson@3715
|
63 |
|
wenzelm@4269
|
64 |
* cd, use, use etc. now support path variables, e.g. ~ (which
|
wenzelm@4269
|
65 |
abbreviates $HOME), or $ISABELLE_HOME;
|
wenzelm@4269
|
66 |
|
wenzelm@4269
|
67 |
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
|
wenzelm@4269
|
68 |
use isatool fixseq to adapt your ML programs (this works for fully
|
wenzelm@4269
|
69 |
qualified references to the Sequence structure only!);
|
wenzelm@4269
|
70 |
|
wenzelm@4269
|
71 |
|
paulson@3715
|
72 |
|
paulson@3715
|
73 |
*** Classical Reasoner ***
|
paulson@3715
|
74 |
|
wenzelm@3744
|
75 |
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
|
wenzelm@3744
|
76 |
tactics that use classical reasoning to simplify a subgoal without
|
wenzelm@3744
|
77 |
splitting it into several subgoals;
|
paulson@3715
|
78 |
|
paulson@3719
|
79 |
* Safe_tac: like safe_tac but uses the default claset;
|
paulson@3719
|
80 |
|
paulson@3715
|
81 |
|
paulson@3715
|
82 |
*** Simplifier ***
|
paulson@3715
|
83 |
|
paulson@3715
|
84 |
* added simplification meta rules:
|
paulson@3715
|
85 |
(asm_)(full_)simplify: simpset -> thm -> thm;
|
paulson@3715
|
86 |
|
paulson@3715
|
87 |
* simplifier.ML no longer part of Pure -- has to be loaded by object
|
paulson@3715
|
88 |
logics (again);
|
paulson@3715
|
89 |
|
paulson@3715
|
90 |
* added prems argument to simplification procedures;
|
paulson@3715
|
91 |
|
paulson@4325
|
92 |
* HOL, FOL, ZF: added infix function `addsplits':
|
paulson@4325
|
93 |
instead of `<simpset> setloop (split_tac <thms>)'
|
paulson@4325
|
94 |
you can simply write `<simpset> addsplits <thms>'
|
paulson@4325
|
95 |
|
paulson@3715
|
96 |
|
paulson@3715
|
97 |
*** Syntax ***
|
paulson@3715
|
98 |
|
wenzelm@4174
|
99 |
* TYPE('a) syntax for type reflection terms;
|
wenzelm@4174
|
100 |
|
wenzelm@3985
|
101 |
* no longer handles consts with name "" -- declare as 'syntax' instead;
|
paulson@3856
|
102 |
|
paulson@3856
|
103 |
* pretty printer: changed order of mixfix annotation preference (again!);
|
wenzelm@3846
|
104 |
|
paulson@3715
|
105 |
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
|
paulson@3715
|
106 |
|
paulson@3715
|
107 |
|
paulson@3715
|
108 |
*** HOL ***
|
paulson@3715
|
109 |
|
oheimb@4207
|
110 |
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
|
oheimb@4189
|
111 |
with `addloop' of the simplifier to faciliate case splitting in premises.
|
oheimb@4189
|
112 |
|
nipkow@4035
|
113 |
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
|
wenzelm@3985
|
114 |
|
wenzelm@3985
|
115 |
* HOL/Auth: new protocol proofs including some for the Internet
|
nipkow@4035
|
116 |
protocol TLS;
|
wenzelm@3985
|
117 |
|
wenzelm@4125
|
118 |
* HOL/Map: new theory of `maps' a la VDM;
|
nipkow@3982
|
119 |
|
wenzelm@4335
|
120 |
* HOL/simplifier: simplification procedures nat_cancel_sums for
|
wenzelm@4335
|
121 |
cancelling out common nat summands from =, <, <= (in)equalities, or
|
wenzelm@4335
|
122 |
differences; simplification procedures nat_cancel_factor for
|
wenzelm@4335
|
123 |
cancelling common factor from =, <, <= (in)equalities over natural
|
wenzelm@4335
|
124 |
sums; nat_cancel contains both kinds of procedures;
|
wenzelm@4335
|
125 |
|
nipkow@3580
|
126 |
* HOL/simplifier: terms of the form
|
paulson@4325
|
127 |
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
|
nipkow@3580
|
128 |
are rewritten to
|
nipkow@4035
|
129 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
|
nipkow@4035
|
130 |
and those of the form
|
paulson@4325
|
131 |
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
|
nipkow@4035
|
132 |
are rewritten to
|
nipkow@4035
|
133 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
|
nipkow@3580
|
134 |
|
nipkow@4035
|
135 |
* HOL/datatype
|
nipkow@4035
|
136 |
Each datatype `t' now comes with a theorem `split_t_case' of the form
|
nipkow@4035
|
137 |
|
nipkow@4035
|
138 |
P(t_case f1 ... fn x) =
|
nipkow@4035
|
139 |
( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
|
nipkow@4035
|
140 |
...
|
oheimb@4189
|
141 |
(!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
|
nipkow@4035
|
142 |
)
|
nipkow@4035
|
143 |
|
nipkow@4070
|
144 |
which can be added to a simpset via `addsplits'. The existing theorems
|
nipkow@4070
|
145 |
expand_list_case and expand_option_case have been renamed to
|
nipkow@4070
|
146 |
split_list_case and split_option_case.
|
nipkow@4035
|
147 |
|
oheimb@4207
|
148 |
Additionally, there is a theorem `split_t_case_asm' of the form
|
oheimb@4189
|
149 |
|
oheimb@4189
|
150 |
P(t_case f1 ... fn x) =
|
oheimb@4189
|
151 |
~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
|
oheimb@4189
|
152 |
...
|
oheimb@4189
|
153 |
(? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
|
oheimb@4189
|
154 |
)
|
oheimb@4189
|
155 |
|
oheimb@4207
|
156 |
it be used with the new `split_asm_tac'.
|
oheimb@4189
|
157 |
|
nipkow@4361
|
158 |
* HOL/Arithmetic:
|
nipkow@4361
|
159 |
- `pred n' is automatically converted to `n-1'.
|
nipkow@4361
|
160 |
Users are strongly encouraged not to use `pred' any longer,
|
nipkow@4361
|
161 |
because it will disappear altogether at some point.
|
nipkow@4361
|
162 |
- Users are strongly encouraged to write "0 < n" rather than
|
nipkow@4361
|
163 |
"n ~= 0". Theorems and proof tools have been modified towards this
|
nipkow@4361
|
164 |
`standard'.
|
nipkow@4357
|
165 |
|
nipkow@4035
|
166 |
* HOL/Lists: the function "set_of_list" has been renamed "set"
|
nipkow@4035
|
167 |
(and its theorems too);
|
paulson@3570
|
168 |
|
paulson@4154
|
169 |
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
|
paulson@4154
|
170 |
|
paulson@4154
|
171 |
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
|
paulson@4154
|
172 |
specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
|
paulson@4154
|
173 |
|
wenzelm@4125
|
174 |
|
paulson@3715
|
175 |
*** HOLCF ***
|
wenzelm@3511
|
176 |
|
wenzelm@4125
|
177 |
* removed "axioms" and "generated by" sections;
|
wenzelm@4125
|
178 |
|
oheimb@4123
|
179 |
* replaced "ops" section by extended "consts" section, which is capable of
|
wenzelm@4125
|
180 |
handling the continuous function space "->" directly;
|
wenzelm@4125
|
181 |
|
wenzelm@4125
|
182 |
* domain package:
|
wenzelm@4125
|
183 |
. proves theorems immediately and stores them in the theory,
|
wenzelm@4125
|
184 |
. creates hierachical name space,
|
wenzelm@4125
|
185 |
. now uses normal mixfix annotations (instead of cinfix...),
|
wenzelm@4125
|
186 |
. minor changes to some names and values (for consistency),
|
wenzelm@4125
|
187 |
. e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
|
wenzelm@4125
|
188 |
. separator between mutual domain defs: changed "," to "and",
|
wenzelm@4125
|
189 |
. improved handling of sort constraints; now they have to
|
wenzelm@4125
|
190 |
appear on the left-hand side of the equations only;
|
oheimb@4123
|
191 |
|
oheimb@4123
|
192 |
* fixed LAM <x,y,zs>.b syntax;
|
wenzelm@3535
|
193 |
|
wenzelm@3744
|
194 |
* added extended adm_tac to simplifier in HOLCF -- can now discharge
|
wenzelm@3744
|
195 |
adm (%x. P (t x)), where P is chainfinite and t continuous;
|
wenzelm@3579
|
196 |
|
wenzelm@3579
|
197 |
|
paulson@3719
|
198 |
*** FOL and ZF ***
|
paulson@3719
|
199 |
|
oheimb@4207
|
200 |
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
|
oheimb@4189
|
201 |
with `addloop' of the simplifier to faciliate case splitting in premises.
|
oheimb@4189
|
202 |
|
wenzelm@3744
|
203 |
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
|
wenzelm@3744
|
204 |
in HOL, they strip ALL and --> from proved theorems;
|
wenzelm@3744
|
205 |
|
paulson@3719
|
206 |
|
wenzelm@3579
|
207 |
|
wenzelm@3006
|
208 |
New in Isabelle94-8 (May 1997)
|
wenzelm@3006
|
209 |
------------------------------
|
wenzelm@2654
|
210 |
|
paulson@3002
|
211 |
*** General Changes ***
|
paulson@3002
|
212 |
|
paulson@3002
|
213 |
* new utilities to build / run / maintain Isabelle etc. (in parts
|
paulson@3002
|
214 |
still somewhat experimental); old Makefiles etc. still functional;
|
wenzelm@2971
|
215 |
|
wenzelm@3205
|
216 |
* new 'Isabelle System Manual';
|
wenzelm@3205
|
217 |
|
wenzelm@2825
|
218 |
* INSTALL text, together with ./configure and ./build scripts;
|
wenzelm@2773
|
219 |
|
wenzelm@3006
|
220 |
* reimplemented type inference for greater efficiency, better error
|
wenzelm@3006
|
221 |
messages and clean internal interface;
|
paulson@3002
|
222 |
|
paulson@3002
|
223 |
* prlim command for dealing with lots of subgoals (an easier way of
|
paulson@3002
|
224 |
setting goals_limit);
|
paulson@3002
|
225 |
|
wenzelm@3006
|
226 |
|
wenzelm@3006
|
227 |
*** Syntax ***
|
paulson@3002
|
228 |
|
wenzelm@3116
|
229 |
* supports alternative (named) syntax tables (parser and pretty
|
wenzelm@3116
|
230 |
printer); internal interface is provided by add_modesyntax(_i);
|
wenzelm@3116
|
231 |
|
paulson@3002
|
232 |
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
|
paulson@3002
|
233 |
be used in conjunction with the Isabelle symbol font; uses the
|
paulson@3002
|
234 |
"symbols" syntax table;
|
paulson@3002
|
235 |
|
wenzelm@2705
|
236 |
* added token_translation interface (may translate name tokens in
|
wenzelm@2756
|
237 |
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
|
wenzelm@3116
|
238 |
the current print_mode); IMPORTANT: user print translation functions
|
wenzelm@3116
|
239 |
are responsible for marking newly introduced bounds
|
wenzelm@3116
|
240 |
(Syntax.mark_boundT);
|
wenzelm@2705
|
241 |
|
wenzelm@2730
|
242 |
* token translations for modes "xterm" and "xterm_color" that display
|
wenzelm@3006
|
243 |
names in bold, underline etc. or colors (which requires a color
|
wenzelm@3006
|
244 |
version of xterm);
|
wenzelm@2730
|
245 |
|
paulson@3002
|
246 |
* infixes may now be declared with names independent of their syntax;
|
paulson@3002
|
247 |
|
paulson@3002
|
248 |
* added typed_print_translation (like print_translation, but may
|
paulson@3002
|
249 |
access type of constant);
|
paulson@3002
|
250 |
|
wenzelm@3006
|
251 |
|
paulson@3002
|
252 |
*** Classical Reasoner ***
|
paulson@3002
|
253 |
|
paulson@3002
|
254 |
Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
|
paulson@3002
|
255 |
some limitations. Blast_tac...
|
paulson@3002
|
256 |
+ ignores addss, addbefore, addafter; this restriction is intrinsic
|
paulson@3002
|
257 |
+ ignores elimination rules that don't have the correct format
|
paulson@3002
|
258 |
(the conclusion MUST be a formula variable)
|
paulson@3002
|
259 |
+ ignores types, which can make HOL proofs fail
|
paulson@3002
|
260 |
+ rules must not require higher-order unification, e.g. apply_type in ZF
|
paulson@3002
|
261 |
[message "Function Var's argument not a bound variable" relates to this]
|
paulson@3002
|
262 |
+ its proof strategy is more general but can actually be slower
|
paulson@3002
|
263 |
|
wenzelm@3107
|
264 |
* substitution with equality assumptions no longer permutes other
|
wenzelm@3107
|
265 |
assumptions;
|
paulson@3002
|
266 |
|
paulson@3002
|
267 |
* minor changes in semantics of addafter (now called addaltern); renamed
|
paulson@3002
|
268 |
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
|
wenzelm@3107
|
269 |
(and access functions for it);
|
paulson@3002
|
270 |
|
oheimb@3317
|
271 |
* improved combination of classical reasoner and simplifier:
|
oheimb@3317
|
272 |
+ functions for handling clasimpsets
|
oheimb@3317
|
273 |
+ improvement of addss: now the simplifier is called _after_ the
|
oheimb@3317
|
274 |
safe steps.
|
oheimb@3317
|
275 |
+ safe variant of addss called addSss: uses safe simplifications
|
oheimb@3317
|
276 |
_during_ the safe steps. It is more complete as it allows multiple
|
oheimb@3317
|
277 |
instantiations of unknowns (e.g. with slow_tac).
|
wenzelm@3006
|
278 |
|
paulson@3002
|
279 |
*** Simplifier ***
|
paulson@3002
|
280 |
|
wenzelm@3006
|
281 |
* added interface for simplification procedures (functions that
|
wenzelm@3006
|
282 |
produce *proven* rewrite rules on the fly, depending on current
|
wenzelm@3006
|
283 |
redex);
|
wenzelm@3006
|
284 |
|
wenzelm@3006
|
285 |
* ordering on terms as parameter (used for ordered rewriting);
|
wenzelm@3006
|
286 |
|
wenzelm@3107
|
287 |
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
|
paulson@3002
|
288 |
|
paulson@3002
|
289 |
* the solver is now split into a safe and an unsafe part.
|
paulson@3002
|
290 |
This should be invisible for the normal user, except that the
|
paulson@3002
|
291 |
functions setsolver and addsolver have been renamed to setSolver and
|
wenzelm@3107
|
292 |
addSolver; added safe_asm_full_simp_tac;
|
paulson@3002
|
293 |
|
paulson@3002
|
294 |
|
paulson@3002
|
295 |
*** HOL ***
|
paulson@3002
|
296 |
|
nipkow@3042
|
297 |
* a generic induction tactic `induct_tac' which works for all datatypes and
|
wenzelm@3107
|
298 |
also for type `nat';
|
nipkow@3042
|
299 |
|
nipkow@3316
|
300 |
* a generic case distinction tactic `exhaust_tac' which works for all
|
nipkow@3316
|
301 |
datatypes and also for type `nat';
|
nipkow@3316
|
302 |
|
nipkow@3316
|
303 |
* each datatype comes with a function `size';
|
nipkow@3316
|
304 |
|
paulson@3002
|
305 |
* patterns in case expressions allow tuple patterns as arguments to
|
wenzelm@3107
|
306 |
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
|
paulson@3002
|
307 |
|
paulson@3002
|
308 |
* primrec now also works with type nat;
|
paulson@3002
|
309 |
|
paulson@3338
|
310 |
* recdef: a new declaration form, allows general recursive functions to be
|
paulson@3338
|
311 |
defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
|
paulson@3338
|
312 |
|
paulson@3002
|
313 |
* the constant for negation has been renamed from "not" to "Not" to
|
wenzelm@3107
|
314 |
harmonize with FOL, ZF, LK, etc.;
|
paulson@3002
|
315 |
|
wenzelm@3107
|
316 |
* HOL/ex/LFilter theory of a corecursive "filter" functional for
|
wenzelm@3107
|
317 |
infinite lists;
|
paulson@3002
|
318 |
|
wenzelm@3227
|
319 |
* HOL/Modelcheck demonstrates invocation of model checker oracle;
|
wenzelm@3227
|
320 |
|
paulson@3002
|
321 |
* HOL/ex/Ring.thy declares cring_simp, which solves equational
|
paulson@3002
|
322 |
problems in commutative rings, using axiomatic type classes for + and *;
|
paulson@3002
|
323 |
|
paulson@3002
|
324 |
* more examples in HOL/MiniML and HOL/Auth;
|
paulson@3002
|
325 |
|
paulson@3002
|
326 |
* more default rewrite rules for quantifiers, union/intersection;
|
paulson@3002
|
327 |
|
nipkow@3321
|
328 |
* a new constant `arbitrary == @x.False';
|
nipkow@3321
|
329 |
|
wenzelm@3107
|
330 |
* HOLCF/IOA replaces old HOL/IOA;
|
wenzelm@3107
|
331 |
|
slotosch@2653
|
332 |
* HOLCF changes: derived all rules and arities
|
slotosch@2653
|
333 |
+ axiomatic type classes instead of classes
|
slotosch@2653
|
334 |
+ typedef instead of faking type definitions
|
paulson@2747
|
335 |
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
|
wenzelm@2730
|
336 |
+ new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
|
slotosch@2653
|
337 |
+ eliminated the types void, one, tr
|
slotosch@2653
|
338 |
+ use unit lift and bool lift (with translations) instead of one and tr
|
slotosch@2653
|
339 |
+ eliminated blift from Lift3.thy (use Def instead of blift)
|
wenzelm@3107
|
340 |
all eliminated rules are derived as theorems --> no visible changes ;
|
oheimb@2649
|
341 |
|
wenzelm@3006
|
342 |
|
paulson@3002
|
343 |
*** ZF ***
|
wenzelm@2553
|
344 |
|
paulson@2865
|
345 |
* ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
|
paulson@2865
|
346 |
rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
|
paulson@2865
|
347 |
as ZF_cs addSIs [equalityI];
|
wenzelm@2553
|
348 |
|
wenzelm@2554
|
349 |
|
wenzelm@2732
|
350 |
|
wenzelm@2553
|
351 |
New in Isabelle94-7 (November 96)
|
wenzelm@2553
|
352 |
---------------------------------
|
wenzelm@2553
|
353 |
|
wenzelm@2553
|
354 |
* allowing negative levels (as offsets) in prlev and choplev;
|
wenzelm@2553
|
355 |
|
wenzelm@2554
|
356 |
* super-linear speedup for large simplifications;
|
wenzelm@2554
|
357 |
|
wenzelm@2554
|
358 |
* FOL, ZF and HOL now use miniscoping: rewriting pushes
|
wenzelm@2554
|
359 |
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
|
wenzelm@2554
|
360 |
FAIL); can suppress it using the command Delsimps (ex_simps @
|
wenzelm@2554
|
361 |
all_simps); De Morgan laws are also now included, by default;
|
wenzelm@2554
|
362 |
|
wenzelm@2554
|
363 |
* improved printing of ==> : ~:
|
wenzelm@2554
|
364 |
|
wenzelm@2554
|
365 |
* new object-logic "Sequents" adds linear logic, while replacing LK
|
wenzelm@2554
|
366 |
and Modal (thanks to Sara Kalvala);
|
wenzelm@2554
|
367 |
|
wenzelm@2554
|
368 |
* HOL/Auth: correctness proofs for authentication protocols;
|
wenzelm@2554
|
369 |
|
wenzelm@2554
|
370 |
* HOL: new auto_tac combines rewriting and classical reasoning (many
|
wenzelm@2554
|
371 |
examples on HOL/Auth);
|
wenzelm@2554
|
372 |
|
wenzelm@2554
|
373 |
* HOL: new command AddIffs for declaring theorems of the form P=Q to
|
wenzelm@2554
|
374 |
the rewriter and classical reasoner simultaneously;
|
wenzelm@2554
|
375 |
|
wenzelm@2554
|
376 |
* function uresult no longer returns theorems in "standard" format;
|
wenzelm@2554
|
377 |
regain previous version by: val uresult = standard o uresult;
|
wenzelm@2554
|
378 |
|
wenzelm@2554
|
379 |
|
wenzelm@2554
|
380 |
|
wenzelm@2554
|
381 |
New in Isabelle94-6
|
wenzelm@2554
|
382 |
-------------------
|
wenzelm@2554
|
383 |
|
wenzelm@2554
|
384 |
* oracles -- these establish an interface between Isabelle and trusted
|
wenzelm@2554
|
385 |
external reasoners, which may deliver results as theorems;
|
wenzelm@2554
|
386 |
|
wenzelm@2554
|
387 |
* proof objects (in particular record all uses of oracles);
|
wenzelm@2554
|
388 |
|
wenzelm@2554
|
389 |
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
|
wenzelm@2554
|
390 |
|
wenzelm@2554
|
391 |
* "constdefs" section in theory files;
|
wenzelm@2554
|
392 |
|
wenzelm@2554
|
393 |
* "primrec" section (HOL) no longer requires names;
|
wenzelm@2554
|
394 |
|
wenzelm@2554
|
395 |
* internal type "tactic" now simply "thm -> thm Sequence.seq";
|
wenzelm@2554
|
396 |
|
wenzelm@2554
|
397 |
|
wenzelm@2554
|
398 |
|
wenzelm@2554
|
399 |
New in Isabelle94-5
|
wenzelm@2554
|
400 |
-------------------
|
wenzelm@2554
|
401 |
|
wenzelm@2554
|
402 |
* reduced space requirements;
|
wenzelm@2554
|
403 |
|
wenzelm@2554
|
404 |
* automatic HTML generation from theories;
|
wenzelm@2554
|
405 |
|
wenzelm@2554
|
406 |
* theory files no longer require "..." (quotes) around most types;
|
wenzelm@2554
|
407 |
|
wenzelm@2554
|
408 |
* new examples, including two proofs of the Church-Rosser theorem;
|
wenzelm@2554
|
409 |
|
wenzelm@2554
|
410 |
* non-curried (1994) version of HOL is no longer distributed;
|
wenzelm@2554
|
411 |
|
wenzelm@2553
|
412 |
|
paulson@2557
|
413 |
|
paulson@2557
|
414 |
New in Isabelle94-4
|
paulson@2557
|
415 |
-------------------
|
paulson@2557
|
416 |
|
paulson@2747
|
417 |
* greatly reduced space requirements;
|
paulson@2557
|
418 |
|
paulson@2557
|
419 |
* theory files (.thy) no longer require \...\ escapes at line breaks;
|
paulson@2557
|
420 |
|
paulson@2557
|
421 |
* searchable theorem database (see the section "Retrieving theorems" on
|
paulson@2557
|
422 |
page 8 of the Reference Manual);
|
paulson@2557
|
423 |
|
paulson@2557
|
424 |
* new examples, including Grabczewski's monumental case study of the
|
paulson@2557
|
425 |
Axiom of Choice;
|
paulson@2557
|
426 |
|
paulson@2557
|
427 |
* The previous version of HOL renamed to Old_HOL;
|
paulson@2557
|
428 |
|
paulson@2557
|
429 |
* The new version of HOL (previously called CHOL) uses a curried syntax
|
paulson@2557
|
430 |
for functions. Application looks like f a b instead of f(a,b);
|
paulson@2557
|
431 |
|
paulson@2557
|
432 |
* Mutually recursive inductive definitions finally work in HOL;
|
paulson@2557
|
433 |
|
paulson@2557
|
434 |
* In ZF, pattern-matching on tuples is now available in all abstractions and
|
paulson@2557
|
435 |
translates to the operator "split";
|
paulson@2557
|
436 |
|
paulson@2557
|
437 |
|
paulson@2557
|
438 |
|
paulson@2557
|
439 |
New in Isabelle94-3
|
paulson@2557
|
440 |
-------------------
|
paulson@2557
|
441 |
|
paulson@2557
|
442 |
* new infix operator, addss, allowing the classical reasoner to
|
paulson@2557
|
443 |
perform simplification at each step of its search. Example:
|
paulson@2557
|
444 |
fast_tac (cs addss ss)
|
paulson@2557
|
445 |
|
paulson@2557
|
446 |
* a new logic, CHOL, the same as HOL, but with a curried syntax
|
paulson@2557
|
447 |
for functions. Application looks like f a b instead of f(a,b). Also pairs
|
paulson@2557
|
448 |
look like (a,b) instead of <a,b>;
|
paulson@2557
|
449 |
|
paulson@2557
|
450 |
* PLEASE NOTE: CHOL will eventually replace HOL!
|
paulson@2557
|
451 |
|
paulson@2557
|
452 |
* In CHOL, pattern-matching on tuples is now available in all abstractions.
|
paulson@2557
|
453 |
It translates to the operator "split". A new theory of integers is available;
|
paulson@2557
|
454 |
|
paulson@2557
|
455 |
* In ZF, integer numerals now denote two's-complement binary integers.
|
paulson@2557
|
456 |
Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
|
paulson@2557
|
457 |
|
paulson@2557
|
458 |
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
|
paulson@2557
|
459 |
of the Axiom of Choice;
|
paulson@2557
|
460 |
|
paulson@2557
|
461 |
|
paulson@2557
|
462 |
|
paulson@2557
|
463 |
New in Isabelle94-2
|
paulson@2557
|
464 |
-------------------
|
paulson@2557
|
465 |
|
paulson@2557
|
466 |
* Significantly faster resolution;
|
paulson@2557
|
467 |
|
paulson@2557
|
468 |
* the different sections in a .thy file can now be mixed and repeated
|
paulson@2557
|
469 |
freely;
|
paulson@2557
|
470 |
|
paulson@2557
|
471 |
* Database of theorems for FOL, HOL and ZF. New
|
paulson@2557
|
472 |
commands including qed, qed_goal and bind_thm store theorems in the database.
|
paulson@2557
|
473 |
|
paulson@2557
|
474 |
* Simple database queries: return a named theorem (get_thm) or all theorems of
|
paulson@2557
|
475 |
a given theory (thms_of), or find out what theory a theorem was proved in
|
paulson@2557
|
476 |
(theory_of_thm);
|
paulson@2557
|
477 |
|
paulson@2557
|
478 |
* Bugs fixed in the inductive definition and datatype packages;
|
paulson@2557
|
479 |
|
paulson@2557
|
480 |
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
|
paulson@2557
|
481 |
and HOL_dup_cs obsolete;
|
paulson@2557
|
482 |
|
paulson@2557
|
483 |
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
|
paulson@2557
|
484 |
have been removed;
|
paulson@2557
|
485 |
|
paulson@2557
|
486 |
* Simpler definition of function space in ZF;
|
paulson@2557
|
487 |
|
paulson@2557
|
488 |
* new results about cardinal and ordinal arithmetic in ZF;
|
paulson@2557
|
489 |
|
paulson@2557
|
490 |
* 'subtype' facility in HOL for introducing new types as subsets of existing
|
paulson@2557
|
491 |
types;
|
paulson@2557
|
492 |
|
paulson@2557
|
493 |
|
wenzelm@2553
|
494 |
$Id$
|