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