author | nipkow |
Tue, 05 Jan 1999 17:27:59 +0100 | |
changeset 6059 | aa00e235ea27 |
parent 6057 | 395ea7617554 |
child 6063 | aa2ac7d21792 |
permissions | -rw-r--r-- |
5363 | 1 |
Isabelle NEWS -- history user-relevant changes |
2 |
============================================== |
|
2553 | 3 |
|
4981 | 4 |
New in this Isabelle version |
5 |
---------------------------- |
|
4649 | 6 |
|
5931 | 7 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
8 |
||
9 |
* HOL: Removed the obsolete syntax "Compl A"; use -A for set complement |
|
10 |
||
6057 | 11 |
*** Proof tools *** |
12 |
||
13 |
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a decision |
|
14 |
procedure for linear arithmetic. Currently it is used only for type `nat' in |
|
15 |
HOL (see below) but can, should and will be instantiated for other types and |
|
16 |
logics as well. |
|
17 |
||
6014 | 18 |
*** General *** |
19 |
||
20 |
* in locales, the "assumes" and "defines" parts may be omitted if empty; |
|
5973 | 21 |
|
6028 | 22 |
* new print_mode "xsymbols" for extended symbol support |
23 |
(e.g. genuiely long arrows) |
|
24 |
||
6057 | 25 |
*** HOL *** |
26 |
||
27 |
* There are now two decision procedures for linear arithmetic over nat: |
|
28 |
1. nat_arith_tac copes with arbitrary propositional formulae (quantified |
|
29 |
formulae are treated as atomic) involving `=', `<', `<=', 0, Suc, `+' and `-' |
|
30 |
(other operators are treated as atomic). It has to be invoked by hand and is |
|
31 |
a little bit slow. |
|
32 |
2. fast_nat_arith_tac is a cut-down version of nat_arith_tac: it does not do |
|
33 |
much propositional reasoning (hence the premises and the conclusion should be |
|
34 |
as atomic as possible) and does not know about `-' either. It is fast and is |
|
35 |
used automatically by the simplifier. |
|
6028 | 36 |
|
5973 | 37 |
*** Internal programming interfaces *** |
5781 | 38 |
|
39 |
* tuned current_goals_markers semantics: begin / end goal avoids |
|
40 |
printing empty lines; |
|
41 |
||
5973 | 42 |
* removed prs and prs_fn hook, which was broken because it did not |
43 |
include \n in its semantics, forcing writeln to add one |
|
44 |
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: |
|
45 |
string -> unit if you really want to output text without newline; |
|
46 |
||
5781 | 47 |
|
48 |
New in Isabelle98-1 (October 1998) |
|
49 |
---------------------------------- |
|
50 |
||
5127 | 51 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
4842 | 52 |
|
5726 | 53 |
* several changes of automated proof tools; |
5373 | 54 |
|
5726 | 55 |
* HOL: major changes to the inductive and datatype packages, including |
56 |
some minor incompatibilities of theory syntax; |
|
5214 | 57 |
|
5726 | 58 |
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now |
5217 | 59 |
called `inj_on'; |
5160 | 60 |
|
5275 | 61 |
* HOL: removed duplicate thms in Arith: |
62 |
less_imp_add_less should be replaced by trans_less_add1 |
|
63 |
le_imp_add_le should be replaced by trans_le_add1 |
|
5160 | 64 |
|
5726 | 65 |
* HOL: unary minus is now overloaded (new type constraints may be |
66 |
required); |
|
5490 | 67 |
|
5726 | 68 |
* HOL and ZF: unary minus for integers is now #- instead of #~. In |
69 |
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is |
|
70 |
now taken as an integer constant. |
|
5541 | 71 |
|
5726 | 72 |
* Pure: ML function 'theory_of' renamed to 'theory'; |
5397
034ed25535b9
* Pure: ML function 'theory_of' replaced by 'theory';
wenzelm
parents:
5373
diff
changeset
|
73 |
|
5363 | 74 |
|
5127 | 75 |
*** Proof tools *** |
4880 | 76 |
|
5657
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
77 |
* Simplifier: |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
78 |
1. Asm_full_simp_tac is now more aggressive. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
79 |
1. It will sometimes reorient premises if that increases their power to |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
80 |
simplify. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
81 |
2. It does no longer proceed strictly from left to right but may also |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
82 |
rotate premises to achieve further simplification. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
83 |
For compatibility reasons there is now Asm_lr_simp_tac which is like the |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
84 |
old Asm_full_simp_tac in that it does not rotate premises. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
85 |
2. The simplifier now knows a little bit about nat-arithmetic. |
4880 | 86 |
|
5127 | 87 |
* Classical reasoner: wrapper mechanism for the classical reasoner now |
88 |
allows for selected deletion of wrappers, by introduction of names for |
|
89 |
wrapper functionals. This implies that addbefore, addSbefore, |
|
90 |
addaltern, and addSaltern now take a pair (name, tactic) as argument, |
|
91 |
and that adding two tactics with the same name overwrites the first |
|
92 |
one (emitting a warning). |
|
4824 | 93 |
type wrapper = (int -> tactic) -> (int -> tactic) |
4649 | 94 |
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by |
4824 | 95 |
addWrapper, addSWrapper: claset * (string * wrapper) -> claset |
96 |
delWrapper, delSWrapper: claset * string -> claset |
|
4649 | 97 |
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; |
98 |
||
5705
56f2030c46c6
tuned (all proofs are INSTABLE by David's definition of instability);
wenzelm
parents:
5671
diff
changeset
|
99 |
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE |
5726 | 100 |
semantics; addbefore now affects only the unsafe part of step_tac |
101 |
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY |
|
102 |
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac |
|
103 |
by Force_tac; |
|
5524 | 104 |
|
5726 | 105 |
* Classical reasoner: setwrapper to setWrapper and compwrapper to |
106 |
compWrapper; added safe wrapper (and access functions for it); |
|
5524 | 107 |
|
5127 | 108 |
* HOL/split_all_tac is now much faster and fails if there is nothing |
5726 | 109 |
to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order |
110 |
and the names of the automatically generated variables have changed. |
|
111 |
split_all_tac has moved within claset() from unsafe wrappers to safe |
|
112 |
wrappers, which means that !!-bound variables are split much more |
|
113 |
aggressively, and safe_tac and clarify_tac now split such variables. |
|
114 |
If this splitting is not appropriate, use delSWrapper "split_all_tac". |
|
115 |
Note: the same holds for record_split_tac, which does the job of |
|
116 |
split_all_tac for record fields. |
|
5127 | 117 |
|
5726 | 118 |
* HOL/Simplifier: Rewrite rules for case distinctions can now be added |
119 |
permanently to the default simpset using Addsplits just like |
|
120 |
Addsimps. They can be removed via Delsplits just like |
|
121 |
Delsimps. Lower-case versions are also available. |
|
5127 | 122 |
|
5726 | 123 |
* HOL/Simplifier: The rule split_if is now part of the default |
124 |
simpset. This means that the simplifier will eliminate all occurrences |
|
125 |
of if-then-else in the conclusion of a goal. To prevent this, you can |
|
126 |
either remove split_if completely from the default simpset by |
|
127 |
`Delsplits [split_if]' or remove it in a specific call of the |
|
128 |
simplifier using `... delsplits [split_if]'. You can also add/delete |
|
129 |
other case splitting rules to/from the default simpset: every datatype |
|
130 |
generates suitable rules `split_t_case' and `split_t_case_asm' (where |
|
131 |
t is the name of the datatype). |
|
5127 | 132 |
|
5726 | 133 |
* Classical reasoner / Simplifier combination: new force_tac (and |
5127 | 134 |
derivatives Force_tac, force) combines rewriting and classical |
135 |
reasoning (and whatever other tools) similarly to auto_tac, but is |
|
5726 | 136 |
aimed to solve the given subgoal completely. |
5127 | 137 |
|
138 |
||
139 |
*** General *** |
|
140 |
||
5217 | 141 |
* new top-level commands `Goal' and `Goalw' that improve upon `goal' |
5127 | 142 |
and `goalw': the theory is no longer needed as an explicit argument - |
143 |
the current theory context is used; assumptions are no longer returned |
|
144 |
at the ML-level unless one of them starts with ==> or !!; it is |
|
5217 | 145 |
recommended to convert to these new commands using isatool fixgoal |
146 |
(backup your sources first!); |
|
4842 | 147 |
|
5217 | 148 |
* new top-level commands 'thm' and 'thms' for retrieving theorems from |
5207 | 149 |
the current theory context, and 'theory' to lookup stored theories; |
4806 | 150 |
|
5722 | 151 |
* new theory section 'locale' for declaring constants, assumptions and |
152 |
definitions that have local scope; |
|
153 |
||
5127 | 154 |
* new theory section 'nonterminals' for purely syntactic types; |
4858 | 155 |
|
5127 | 156 |
* new theory section 'setup' for generic ML setup functions |
157 |
(e.g. package initialization); |
|
4869 | 158 |
|
5131 | 159 |
* the distribution now includes Isabelle icons: see |
160 |
lib/logo/isabelle-{small,tiny}.xpm; |
|
161 |
||
5363 | 162 |
* isatool install - install binaries with absolute references to |
163 |
ISABELLE_HOME/bin; |
|
164 |
||
5572 | 165 |
* isatool logo -- create instances of the Isabelle logo (as EPS); |
166 |
||
5407 | 167 |
* print mode 'emacs' reserved for Isamode; |
168 |
||
5726 | 169 |
* support multiple print (ast) translations per constant name; |
170 |
||
4711 | 171 |
|
4661 | 172 |
*** HOL *** |
173 |
||
5710 | 174 |
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial'); |
5709 | 175 |
|
5217 | 176 |
* HOL/inductive package reorganized and improved: now supports mutual |
5267 | 177 |
definitions such as |
5217 | 178 |
|
179 |
inductive EVEN ODD |
|
180 |
intrs |
|
181 |
null "0 : EVEN" |
|
182 |
oddI "n : EVEN ==> Suc n : ODD" |
|
183 |
evenI "n : ODD ==> Suc n : EVEN" |
|
184 |
||
185 |
new theorem list "elims" contains an elimination rule for each of the |
|
186 |
recursive sets; inductive definitions now handle disjunctive premises |
|
187 |
correctly (also ZF); |
|
5214 | 188 |
|
5217 | 189 |
INCOMPATIBILITIES: requires Inductive as an ancestor; component |
190 |
"mutual_induct" no longer exists - the induction rule is always |
|
191 |
contained in "induct"; |
|
192 |
||
193 |
||
194 |
* HOL/datatype package re-implemented and greatly improved: now |
|
5267 | 195 |
supports mutually recursive datatypes such as |
5217 | 196 |
|
197 |
datatype |
|
198 |
'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp) |
|
199 |
| SUM ('a aexp) ('a aexp) |
|
200 |
| DIFF ('a aexp) ('a aexp) |
|
201 |
| NUM 'a |
|
202 |
and |
|
203 |
'a bexp = LESS ('a aexp) ('a aexp) |
|
204 |
| AND ('a bexp) ('a bexp) |
|
205 |
| OR ('a bexp) ('a bexp) |
|
206 |
||
5267 | 207 |
as well as indirectly recursive datatypes such as |
5214 | 208 |
|
5217 | 209 |
datatype |
210 |
('a, 'b) term = Var 'a |
|
211 |
| App 'b ((('a, 'b) term) list) |
|
5214 | 212 |
|
5217 | 213 |
The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs |
214 |
induction on mutually / indirectly recursive datatypes. |
|
215 |
||
216 |
Primrec equations are now stored in theory and can be accessed via |
|
217 |
<function_name>.simps. |
|
218 |
||
219 |
INCOMPATIBILITIES: |
|
5214 | 220 |
|
5217 | 221 |
- Theories using datatypes must now have theory Datatype as an |
222 |
ancestor. |
|
223 |
- The specific <typename>.induct_tac no longer exists - use the |
|
224 |
generic induct_tac instead. |
|
5226 | 225 |
- natE has been renamed to nat.exhaust - use exhaust_tac |
5217 | 226 |
instead of res_inst_tac ... natE. Note that the variable |
5226 | 227 |
names in nat.exhaust differ from the names in natE, this |
5217 | 228 |
may cause some "fragile" proofs to fail. |
229 |
- The theorems split_<typename>_case and split_<typename>_case_asm |
|
230 |
have been renamed to <typename>.split and <typename>.split_asm. |
|
231 |
- Since default sorts of type variables are now handled correctly, |
|
232 |
some datatype definitions may have to be annotated with explicit |
|
233 |
sort constraints. |
|
234 |
- Primrec definitions no longer require function name and type |
|
235 |
of recursive argument. |
|
5214 | 236 |
|
5217 | 237 |
Consider using isatool fixdatatype to adapt your theories and proof |
238 |
scripts to the new package (backup your sources first!). |
|
239 |
||
240 |
||
5726 | 241 |
* HOL/record package: considerably improved implementation; now |
242 |
includes concrete syntax for record types, terms, updates; theorems |
|
243 |
for surjective pairing and splitting !!-bound record variables; proof |
|
244 |
support is as follows: |
|
245 |
||
246 |
1) standard conversions (selectors or updates applied to record |
|
247 |
constructor terms) are part of the standard simpset; |
|
248 |
||
249 |
2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are |
|
250 |
made part of standard simpset and claset via addIffs; |
|
251 |
||
252 |
3) a tactic for record field splitting (record_split_tac) is part of |
|
253 |
the standard claset (addSWrapper); |
|
254 |
||
255 |
To get a better idea about these rules you may retrieve them via |
|
256 |
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is |
|
257 |
the name of your record type. |
|
258 |
||
259 |
The split tactic 3) conceptually simplifies by the following rule: |
|
260 |
||
261 |
"(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))" |
|
262 |
||
263 |
Thus any record variable that is bound by meta-all will automatically |
|
264 |
blow up into some record constructor term, consequently the |
|
265 |
simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall |
|
266 |
solve record problems automatically. |
|
267 |
||
5214 | 268 |
|
5125 | 269 |
* reorganized the main HOL image: HOL/Integ and String loaded by |
270 |
default; theory Main includes everything; |
|
271 |
||
5650 | 272 |
* automatic simplification of integer sums and comparisons, using cancellation; |
273 |
||
5526 | 274 |
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; |
5127 | 275 |
|
276 |
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset; |
|
277 |
||
278 |
* many new identities for unions, intersections, set difference, etc.; |
|
279 |
||
280 |
* expand_if, expand_split, expand_sum_case and expand_nat_case are now |
|
281 |
called split_if, split_split, split_sum_case and split_nat_case (to go |
|
282 |
with add/delsplits); |
|
5125 | 283 |
|
5127 | 284 |
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting |
285 |
(?x::unit) = (); this is made part of the default simpset, which COULD |
|
286 |
MAKE EXISTING PROOFS FAIL under rare circumstances (consider |
|
5207 | 287 |
'Delsimprocs [unit_eq_proc];' as last resort); also note that |
288 |
unit_abs_eta_conv is added in order to counter the effect of |
|
289 |
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by |
|
290 |
%u.f(); |
|
5125 | 291 |
|
5217 | 292 |
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which |
293 |
makes more sense); |
|
5109 | 294 |
|
5475 | 295 |
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule; |
296 |
It and 'sym RS equals0D' are now in the default claset, giving automatic |
|
297 |
disjointness reasoning but breaking a few old proofs. |
|
5267 | 298 |
|
5217 | 299 |
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1 |
300 |
to 'converse' from 'inverse' (for compatibility with ZF and some |
|
301 |
literature); |
|
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
302 |
|
5127 | 303 |
* HOL/recdef can now declare non-recursive functions, with {} supplied as |
304 |
the well-founded relation; |
|
4838 | 305 |
|
5490 | 306 |
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of |
307 |
Compl A. The "Compl" syntax remains available as input syntax for this |
|
308 |
release ONLY. |
|
309 |
||
5127 | 310 |
* HOL/Update: new theory of function updates: |
311 |
f(a:=b) == %x. if x=a then b else f x |
|
312 |
may also be iterated as in f(a:=b,c:=d,...); |
|
5077
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5075
diff
changeset
|
313 |
|
5127 | 314 |
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B; |
4899 | 315 |
|
5282 | 316 |
* HOL/List: |
317 |
- new function list_update written xs[i:=v] that updates the i-th |
|
318 |
list position. May also be iterated as in xs[i:=a,j:=b,...]. |
|
5428 | 319 |
- new function `upt' written [i..j(] which generates the list |
320 |
[i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper |
|
321 |
bound write [i..j], which is a shorthand for [i..j+1(]. |
|
5282 | 322 |
- new lexicographic orderings and corresponding wellfoundedness theorems. |
4779 | 323 |
|
5127 | 324 |
* HOL/Arith: |
325 |
- removed 'pred' (predecessor) function; |
|
326 |
- generalized some theorems about n-1; |
|
327 |
- many new laws about "div" and "mod"; |
|
328 |
- new laws about greatest common divisors (see theory ex/Primes); |
|
4766 | 329 |
|
5127 | 330 |
* HOL/Relation: renamed the relational operator r^-1 "converse" |
4842 | 331 |
instead of "inverse"; |
4711 | 332 |
|
5651 | 333 |
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness |
334 |
of the multiset ordering; |
|
335 |
||
5127 | 336 |
* directory HOL/Real: a construction of the reals using Dedekind cuts |
5651 | 337 |
(not included by default); |
4835 | 338 |
|
5127 | 339 |
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; |
4711 | 340 |
|
5651 | 341 |
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted |
342 |
programs, i.e. different program variables may have different types. |
|
343 |
||
5142 | 344 |
* calling (stac rew i) now fails if "rew" has no effect on the goal |
345 |
[previously, this check worked only if the rewrite rule was unconditional] |
|
5308 | 346 |
Now rew can involve either definitions or equalities (either == or =). |
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
347 |
|
5363 | 348 |
|
4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
349 |
*** ZF *** |
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
350 |
|
5332 | 351 |
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains |
352 |
only the theorems proved on ZF.ML; |
|
5160 | 353 |
|
5475 | 354 |
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule; |
355 |
It and 'sym RS equals0D' are now in the default claset, giving automatic |
|
356 |
disjointness reasoning but breaking a few old proofs. |
|
5267 | 357 |
|
5160 | 358 |
* ZF/Update: new theory of function updates |
359 |
with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z) |
|
360 |
may also be iterated as in f(a:=b,c:=d,...); |
|
361 |
||
4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
362 |
* in let x=t in u(x), neither t nor u(x) has to be an FOL term. |
4649 | 363 |
|
5142 | 364 |
* calling (stac rew i) now fails if "rew" has no effect on the goal |
365 |
[previously, this check worked only if the rewrite rule was unconditional] |
|
5308 | 366 |
Now rew can involve either definitions or equalities (either == or =). |
5142 | 367 |
|
5160 | 368 |
* case_tac provided for compatibility with HOL |
369 |
(like the old excluded_middle_tac, but with subgoals swapped) |
|
370 |
||
4842 | 371 |
|
5127 | 372 |
*** Internal programming interfaces *** |
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
373 |
|
5251 | 374 |
* Pure: several new basic modules made available for general use, see |
375 |
also src/Pure/README; |
|
5207 | 376 |
|
5008 | 377 |
* improved the theory data mechanism to support encapsulation (data |
378 |
kind name replaced by private Object.kind, acting as authorization |
|
5373 | 379 |
key); new type-safe user interface via functor TheoryDataFun; generic |
380 |
print_data function becomes basically useless; |
|
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
381 |
|
5251 | 382 |
* removed global_names compatibility flag -- all theory declarations |
383 |
are qualified by default; |
|
384 |
||
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
385 |
* module Pure/Syntax now offers quote / antiquote translation |
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
386 |
functions (useful for Hoare logic etc. with implicit dependencies); |
5373 | 387 |
see HOL/ex/Antiquote for an example use; |
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
388 |
|
5127 | 389 |
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset -> |
390 |
cterm -> thm; |
|
391 |
||
5207 | 392 |
* new tactical CHANGED_GOAL for checking that a tactic modifies a |
393 |
subgoal; |
|
5142 | 394 |
|
5251 | 395 |
* Display.print_goals function moved to Locale.print_goals; |
396 |
||
5731 | 397 |
* standard print function for goals supports current_goals_markers |
398 |
variable for marking begin of proof, end of proof, start of goal; the |
|
399 |
default is ("", "", ""); setting current_goals_markers := ("<proof>", |
|
400 |
"</proof>", "<goal>") causes SGML like tagged proof state printing, |
|
401 |
for example; |
|
402 |
||
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
403 |
|
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
404 |
|
4410 | 405 |
New in Isabelle98 (January 1998) |
406 |
-------------------------------- |
|
407 |
||
408 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
|
409 |
||
410 |
* changed lexical syntax of terms / types: dots made part of long |
|
411 |
identifiers, e.g. "%x.x" no longer possible, should be "%x. x"; |
|
412 |
||
413 |
* simpset (and claset) reference variable replaced by functions |
|
414 |
simpset / simpset_ref; |
|
415 |
||
416 |
* no longer supports theory aliases (via merge) and non-trivial |
|
417 |
implicit merge of thms' signatures; |
|
418 |
||
419 |
* most internal names of constants changed due to qualified names; |
|
420 |
||
421 |
* changed Pure/Sequence interface (see Pure/seq.ML); |
|
422 |
||
3454 | 423 |
|
3715 | 424 |
*** General Changes *** |
425 |
||
4174 | 426 |
* hierachically structured name spaces (for consts, types, axms, thms |
3943 | 427 |
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of |
4108 | 428 |
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY: |
429 |
isatool fixdots ensures space after dots (e.g. "%x. x"); set |
|
4174 | 430 |
long_names for fully qualified output names; NOTE: ML programs |
431 |
(special tactics, packages etc.) referring to internal names may have |
|
432 |
to be adapted to cope with fully qualified names; in case of severe |
|
433 |
backward campatibility problems try setting 'global_names' at compile |
|
434 |
time to have enrything declared within a flat name space; one may also |
|
435 |
fine tune name declarations in theories via the 'global' and 'local' |
|
436 |
section; |
|
4108 | 437 |
|
438 |
* reimplemented the implicit simpset and claset using the new anytype |
|
439 |
data filed in signatures; references simpset:simpset ref etc. are |
|
440 |
replaced by functions simpset:unit->simpset and |
|
441 |
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp |
|
442 |
to patch your ML files accordingly; |
|
3856 | 443 |
|
3857 | 444 |
* HTML output now includes theory graph data for display with Java |
445 |
applet or isatool browser; data generated automatically via isatool |
|
3901 | 446 |
usedir (see -i option, ISABELLE_USEDIR_OPTIONS); |
3857 | 447 |
|
3856 | 448 |
* defs may now be conditional; improved rewrite_goals_tac to handle |
449 |
conditional equations; |
|
450 |
||
4174 | 451 |
* defs now admits additional type arguments, using TYPE('a) syntax; |
452 |
||
3901 | 453 |
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always |
454 |
creates a new theory node; implicit merge of thms' signatures is |
|
4112 | 455 |
restricted to 'trivial' ones; COMPATIBILITY: one may have to use |
3901 | 456 |
transfer:theory->thm->thm in (rare) cases; |
457 |
||
3968
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
458 |
* improved handling of draft signatures / theories; draft thms (and |
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
459 |
ctyps, cterms) are automatically promoted to real ones; |
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
460 |
|
3901 | 461 |
* slightly changed interfaces for oracles: admit many per theory, named |
462 |
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle; |
|
463 |
||
464 |
* print_goals: optional output of const types (set show_consts and |
|
465 |
show_types); |
|
3851
fe9932a7cd46
print_goals: optional output of const types (set show_consts);
wenzelm
parents:
3846
diff
changeset
|
466 |
|
4388 | 467 |
* improved output of warnings (###) and errors (***); |
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset
|
468 |
|
4178
e64ff1c1bc70
subgoal_tac displays a warning if the new subgoal has type variables
paulson
parents:
4174
diff
changeset
|
469 |
* 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
|
470 |
|
3715 | 471 |
* removed old README and Makefiles; |
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset
|
472 |
|
3856 | 473 |
* 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
|
474 |
|
3715 | 475 |
* removed obsolete init_pps and init_database; |
476 |
||
477 |
* deleted the obsolete tactical STATE, which was declared by |
|
478 |
fun STATE tacfun st = tacfun st st; |
|
479 |
||
4388 | 480 |
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~ |
481 |
(which abbreviates $HOME); |
|
4269 | 482 |
|
483 |
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY: |
|
484 |
use isatool fixseq to adapt your ML programs (this works for fully |
|
485 |
qualified references to the Sequence structure only!); |
|
486 |
||
4381 | 487 |
* use_thy no longer requires writable current directory; it always |
488 |
reloads .ML *and* .thy file, if either one is out of date; |
|
4269 | 489 |
|
3715 | 490 |
|
491 |
*** Classical Reasoner *** |
|
492 |
||
3744 | 493 |
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new |
494 |
tactics that use classical reasoning to simplify a subgoal without |
|
495 |
splitting it into several subgoals; |
|
3715 | 496 |
|
3719 | 497 |
* Safe_tac: like safe_tac but uses the default claset; |
498 |
||
3715 | 499 |
|
500 |
*** Simplifier *** |
|
501 |
||
502 |
* added simplification meta rules: |
|
503 |
(asm_)(full_)simplify: simpset -> thm -> thm; |
|
504 |
||
505 |
* simplifier.ML no longer part of Pure -- has to be loaded by object |
|
506 |
logics (again); |
|
507 |
||
508 |
* added prems argument to simplification procedures; |
|
509 |
||
4325 | 510 |
* HOL, FOL, ZF: added infix function `addsplits': |
511 |
instead of `<simpset> setloop (split_tac <thms>)' |
|
512 |
you can simply write `<simpset> addsplits <thms>' |
|
513 |
||
3715 | 514 |
|
515 |
*** Syntax *** |
|
516 |
||
4174 | 517 |
* TYPE('a) syntax for type reflection terms; |
518 |
||
3985 | 519 |
* no longer handles consts with name "" -- declare as 'syntax' instead; |
3856 | 520 |
|
521 |
* pretty printer: changed order of mixfix annotation preference (again!); |
|
3846 | 522 |
|
3715 | 523 |
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; |
524 |
||
525 |
||
526 |
*** HOL *** |
|
527 |
||
5726 | 528 |
* HOL: there is a new splitter `split_asm_tac' that can be used e.g. |
4189 | 529 |
with `addloop' of the simplifier to faciliate case splitting in premises. |
530 |
||
4035 | 531 |
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions; |
3985 | 532 |
|
533 |
* HOL/Auth: new protocol proofs including some for the Internet |
|
4035 | 534 |
protocol TLS; |
3985 | 535 |
|
4125 | 536 |
* HOL/Map: new theory of `maps' a la VDM; |
3982 | 537 |
|
4335 | 538 |
* HOL/simplifier: simplification procedures nat_cancel_sums for |
539 |
cancelling out common nat summands from =, <, <= (in)equalities, or |
|
540 |
differences; simplification procedures nat_cancel_factor for |
|
541 |
cancelling common factor from =, <, <= (in)equalities over natural |
|
4373 | 542 |
sums; nat_cancel contains both kinds of procedures, it is installed by |
543 |
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL; |
|
4335 | 544 |
|
3580 | 545 |
* HOL/simplifier: terms of the form |
4325 | 546 |
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) |
3580 | 547 |
are rewritten to |
4035 | 548 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', |
549 |
and those of the form |
|
4325 | 550 |
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x) |
4035 | 551 |
are rewritten to |
552 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)', |
|
553 |
||
554 |
* HOL/datatype |
|
555 |
Each datatype `t' now comes with a theorem `split_t_case' of the form |
|
3580 | 556 |
|
4035 | 557 |
P(t_case f1 ... fn x) = |
558 |
( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) & |
|
559 |
... |
|
4189 | 560 |
(!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn)) |
4035 | 561 |
) |
562 |
||
4930
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
563 |
and a theorem `split_t_case_asm' of the form |
4189 | 564 |
|
565 |
P(t_case f1 ... fn x) = |
|
566 |
~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) | |
|
567 |
... |
|
568 |
(? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn)) |
|
569 |
) |
|
4930
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
570 |
which can be added to a simpset via `addsplits'. The existing theorems |
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
571 |
expand_list_case and expand_option_case have been renamed to |
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
572 |
split_list_case and split_option_case. |
4189 | 573 |
|
4361 | 574 |
* HOL/Arithmetic: |
575 |
- `pred n' is automatically converted to `n-1'. |
|
576 |
Users are strongly encouraged not to use `pred' any longer, |
|
577 |
because it will disappear altogether at some point. |
|
578 |
- Users are strongly encouraged to write "0 < n" rather than |
|
579 |
"n ~= 0". Theorems and proof tools have been modified towards this |
|
580 |
`standard'. |
|
4357 | 581 |
|
4502 | 582 |
* HOL/Lists: |
583 |
the function "set_of_list" has been renamed "set" (and its theorems too); |
|
584 |
the function "nth" now takes its arguments in the reverse order and |
|
585 |
has acquired the infix notation "!" as in "xs!n". |
|
3570 | 586 |
|
4154 | 587 |
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{}; |
588 |
||
589 |
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its |
|
590 |
specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x); |
|
591 |
||
4575 | 592 |
* HOL/record: extensible records with schematic structural subtyping |
593 |
(single inheritance); EXPERIMENTAL version demonstrating the encoding, |
|
594 |
still lacks various theorems and concrete record syntax; |
|
595 |
||
4125 | 596 |
|
3715 | 597 |
*** HOLCF *** |
3535 | 598 |
|
4125 | 599 |
* removed "axioms" and "generated by" sections; |
600 |
||
4123 | 601 |
* replaced "ops" section by extended "consts" section, which is capable of |
4125 | 602 |
handling the continuous function space "->" directly; |
603 |
||
604 |
* domain package: |
|
605 |
. proves theorems immediately and stores them in the theory, |
|
606 |
. creates hierachical name space, |
|
607 |
. now uses normal mixfix annotations (instead of cinfix...), |
|
608 |
. minor changes to some names and values (for consistency), |
|
609 |
. e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas, |
|
610 |
. separator between mutual domain defs: changed "," to "and", |
|
611 |
. improved handling of sort constraints; now they have to |
|
612 |
appear on the left-hand side of the equations only; |
|
4123 | 613 |
|
614 |
* fixed LAM <x,y,zs>.b syntax; |
|
3567 | 615 |
|
3744 | 616 |
* added extended adm_tac to simplifier in HOLCF -- can now discharge |
617 |
adm (%x. P (t x)), where P is chainfinite and t continuous; |
|
3579 | 618 |
|
619 |
||
3719 | 620 |
*** FOL and ZF *** |
621 |
||
5726 | 622 |
* FOL: there is a new splitter `split_asm_tac' that can be used e.g. |
4189 | 623 |
with `addloop' of the simplifier to faciliate case splitting in premises. |
624 |
||
3744 | 625 |
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as |
626 |
in HOL, they strip ALL and --> from proved theorems; |
|
627 |
||
3719 | 628 |
|
3579 | 629 |
|
3006 | 630 |
New in Isabelle94-8 (May 1997) |
631 |
------------------------------ |
|
2654 | 632 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
633 |
*** General Changes *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
634 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
635 |
* 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
|
636 |
still somewhat experimental); old Makefiles etc. still functional; |
2971 | 637 |
|
3205 | 638 |
* new 'Isabelle System Manual'; |
639 |
||
2825 | 640 |
* INSTALL text, together with ./configure and ./build scripts; |
2773 | 641 |
|
3006 | 642 |
* reimplemented type inference for greater efficiency, better error |
643 |
messages and clean internal interface; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
644 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
645 |
* 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
|
646 |
setting goals_limit); |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
647 |
|
3006 | 648 |
|
649 |
*** Syntax *** |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
650 |
|
3116 | 651 |
* supports alternative (named) syntax tables (parser and pretty |
652 |
printer); internal interface is provided by add_modesyntax(_i); |
|
653 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
654 |
* 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
|
655 |
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
|
656 |
"symbols" syntax table; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
657 |
|
2705 | 658 |
* added token_translation interface (may translate name tokens in |
2756 | 659 |
arbitrary ways, dependent on their type (free, bound, tfree, ...) and |
3116 | 660 |
the current print_mode); IMPORTANT: user print translation functions |
661 |
are responsible for marking newly introduced bounds |
|
662 |
(Syntax.mark_boundT); |
|
2705 | 663 |
|
2730 | 664 |
* token translations for modes "xterm" and "xterm_color" that display |
3006 | 665 |
names in bold, underline etc. or colors (which requires a color |
666 |
version of xterm); |
|
2730 | 667 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
668 |
* 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
|
669 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
670 |
* added typed_print_translation (like print_translation, but may |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
671 |
access type of constant); |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
672 |
|
3006 | 673 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
674 |
*** Classical Reasoner *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
675 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
676 |
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
|
677 |
some limitations. Blast_tac... |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
678 |
+ ignores addss, addbefore, addafter; this restriction is intrinsic |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
679 |
+ ignores elimination rules that don't have the correct format |
5726 | 680 |
(the conclusion MUST be a formula variable) |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
681 |
+ ignores types, which can make HOL proofs fail |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
682 |
+ 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
|
683 |
[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
|
684 |
+ 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
|
685 |
|
3107 | 686 |
* substitution with equality assumptions no longer permutes other |
687 |
assumptions; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
688 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
689 |
* 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
|
690 |
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper |
3107 | 691 |
(and access functions for it); |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
692 |
|
5726 | 693 |
* improved combination of classical reasoner and simplifier: |
3317 | 694 |
+ functions for handling clasimpsets |
695 |
+ improvement of addss: now the simplifier is called _after_ the |
|
696 |
safe steps. |
|
697 |
+ safe variant of addss called addSss: uses safe simplifications |
|
5726 | 698 |
_during_ the safe steps. It is more complete as it allows multiple |
3317 | 699 |
instantiations of unknowns (e.g. with slow_tac). |
3006 | 700 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
701 |
*** Simplifier *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
702 |
|
3006 | 703 |
* added interface for simplification procedures (functions that |
704 |
produce *proven* rewrite rules on the fly, depending on current |
|
705 |
redex); |
|
706 |
||
707 |
* ordering on terms as parameter (used for ordered rewriting); |
|
708 |
||
3107 | 709 |
* 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
|
710 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
711 |
* 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
|
712 |
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
|
713 |
functions setsolver and addsolver have been renamed to setSolver and |
3107 | 714 |
addSolver; added safe_asm_full_simp_tac; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
715 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
716 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
717 |
*** HOL *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
718 |
|
3042 | 719 |
* a generic induction tactic `induct_tac' which works for all datatypes and |
3107 | 720 |
also for type `nat'; |
3042 | 721 |
|
3316 | 722 |
* a generic case distinction tactic `exhaust_tac' which works for all |
723 |
datatypes and also for type `nat'; |
|
724 |
||
725 |
* each datatype comes with a function `size'; |
|
726 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
727 |
* patterns in case expressions allow tuple patterns as arguments to |
3107 | 728 |
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
|
729 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
730 |
* primrec now also works with type nat; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
731 |
|
3338 | 732 |
* recdef: a new declaration form, allows general recursive functions to be |
733 |
defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify. |
|
734 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
735 |
* the constant for negation has been renamed from "not" to "Not" to |
3107 | 736 |
harmonize with FOL, ZF, LK, etc.; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
737 |
|
3107 | 738 |
* HOL/ex/LFilter theory of a corecursive "filter" functional for |
739 |
infinite lists; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
740 |
|
3227 | 741 |
* HOL/Modelcheck demonstrates invocation of model checker oracle; |
742 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
743 |
* 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
|
744 |
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
|
745 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
746 |
* more examples in HOL/MiniML and HOL/Auth; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
747 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
748 |
* more default rewrite rules for quantifiers, union/intersection; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
749 |
|
3321 | 750 |
* a new constant `arbitrary == @x.False'; |
751 |
||
3107 | 752 |
* HOLCF/IOA replaces old HOL/IOA; |
753 |
||
5726 | 754 |
* HOLCF changes: derived all rules and arities |
755 |
+ axiomatic type classes instead of classes |
|
2653
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
756 |
+ typedef instead of faking type definitions |
2747 | 757 |
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc. |
2730 | 758 |
+ 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
|
759 |
+ eliminated the types void, one, tr |
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
760 |
+ 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
|
761 |
+ eliminated blift from Lift3.thy (use Def instead of blift) |
3107 | 762 |
all eliminated rules are derived as theorems --> no visible changes ; |
2649 | 763 |
|
3006 | 764 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
765 |
*** ZF *** |
2553 | 766 |
|
2865 | 767 |
* ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default |
768 |
rewrite rule; this may affect some proofs. eq_cs is gone but can be put back |
|
769 |
as ZF_cs addSIs [equalityI]; |
|
2553 | 770 |
|
2554 | 771 |
|
2732 | 772 |
|
2553 | 773 |
New in Isabelle94-7 (November 96) |
774 |
--------------------------------- |
|
775 |
||
776 |
* allowing negative levels (as offsets) in prlev and choplev; |
|
777 |
||
2554 | 778 |
* super-linear speedup for large simplifications; |
779 |
||
780 |
* FOL, ZF and HOL now use miniscoping: rewriting pushes |
|
781 |
quantifications in as far as possible (COULD MAKE EXISTING PROOFS |
|
782 |
FAIL); can suppress it using the command Delsimps (ex_simps @ |
|
783 |
all_simps); De Morgan laws are also now included, by default; |
|
784 |
||
785 |
* improved printing of ==> : ~: |
|
786 |
||
787 |
* new object-logic "Sequents" adds linear logic, while replacing LK |
|
788 |
and Modal (thanks to Sara Kalvala); |
|
789 |
||
790 |
* HOL/Auth: correctness proofs for authentication protocols; |
|
791 |
||
792 |
* HOL: new auto_tac combines rewriting and classical reasoning (many |
|
793 |
examples on HOL/Auth); |
|
794 |
||
795 |
* HOL: new command AddIffs for declaring theorems of the form P=Q to |
|
796 |
the rewriter and classical reasoner simultaneously; |
|
797 |
||
798 |
* function uresult no longer returns theorems in "standard" format; |
|
799 |
regain previous version by: val uresult = standard o uresult; |
|
800 |
||
801 |
||
802 |
||
803 |
New in Isabelle94-6 |
|
804 |
------------------- |
|
805 |
||
806 |
* oracles -- these establish an interface between Isabelle and trusted |
|
807 |
external reasoners, which may deliver results as theorems; |
|
808 |
||
809 |
* proof objects (in particular record all uses of oracles); |
|
810 |
||
811 |
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset; |
|
812 |
||
813 |
* "constdefs" section in theory files; |
|
814 |
||
815 |
* "primrec" section (HOL) no longer requires names; |
|
816 |
||
817 |
* internal type "tactic" now simply "thm -> thm Sequence.seq"; |
|
818 |
||
819 |
||
820 |
||
821 |
New in Isabelle94-5 |
|
822 |
------------------- |
|
823 |
||
824 |
* reduced space requirements; |
|
825 |
||
826 |
* automatic HTML generation from theories; |
|
827 |
||
828 |
* theory files no longer require "..." (quotes) around most types; |
|
829 |
||
830 |
* new examples, including two proofs of the Church-Rosser theorem; |
|
831 |
||
832 |
* non-curried (1994) version of HOL is no longer distributed; |
|
833 |
||
2553 | 834 |
|
2557 | 835 |
|
836 |
New in Isabelle94-4 |
|
837 |
------------------- |
|
838 |
||
2747 | 839 |
* greatly reduced space requirements; |
2557 | 840 |
|
841 |
* theory files (.thy) no longer require \...\ escapes at line breaks; |
|
842 |
||
5726 | 843 |
* searchable theorem database (see the section "Retrieving theorems" on |
2557 | 844 |
page 8 of the Reference Manual); |
845 |
||
846 |
* new examples, including Grabczewski's monumental case study of the |
|
847 |
Axiom of Choice; |
|
848 |
||
849 |
* The previous version of HOL renamed to Old_HOL; |
|
850 |
||
5726 | 851 |
* The new version of HOL (previously called CHOL) uses a curried syntax |
2557 | 852 |
for functions. Application looks like f a b instead of f(a,b); |
853 |
||
854 |
* Mutually recursive inductive definitions finally work in HOL; |
|
855 |
||
856 |
* In ZF, pattern-matching on tuples is now available in all abstractions and |
|
857 |
translates to the operator "split"; |
|
858 |
||
859 |
||
860 |
||
861 |
New in Isabelle94-3 |
|
862 |
------------------- |
|
863 |
||
5726 | 864 |
* new infix operator, addss, allowing the classical reasoner to |
2557 | 865 |
perform simplification at each step of its search. Example: |
5726 | 866 |
fast_tac (cs addss ss) |
2557 | 867 |
|
5726 | 868 |
* a new logic, CHOL, the same as HOL, but with a curried syntax |
869 |
for functions. Application looks like f a b instead of f(a,b). Also pairs |
|
2557 | 870 |
look like (a,b) instead of <a,b>; |
871 |
||
872 |
* PLEASE NOTE: CHOL will eventually replace HOL! |
|
873 |
||
874 |
* In CHOL, pattern-matching on tuples is now available in all abstractions. |
|
875 |
It translates to the operator "split". A new theory of integers is available; |
|
876 |
||
877 |
* In ZF, integer numerals now denote two's-complement binary integers. |
|
878 |
Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML; |
|
879 |
||
5726 | 880 |
* Many new examples: I/O automata, Church-Rosser theorem, equivalents |
2557 | 881 |
of the Axiom of Choice; |
882 |
||
883 |
||
884 |
||
885 |
New in Isabelle94-2 |
|
886 |
------------------- |
|
887 |
||
5726 | 888 |
* Significantly faster resolution; |
2557 | 889 |
|
890 |
* the different sections in a .thy file can now be mixed and repeated |
|
891 |
freely; |
|
892 |
||
893 |
* Database of theorems for FOL, HOL and ZF. New |
|
894 |
commands including qed, qed_goal and bind_thm store theorems in the database. |
|
895 |
||
896 |
* Simple database queries: return a named theorem (get_thm) or all theorems of |
|
897 |
a given theory (thms_of), or find out what theory a theorem was proved in |
|
898 |
(theory_of_thm); |
|
899 |
||
900 |
* Bugs fixed in the inductive definition and datatype packages; |
|
901 |
||
902 |
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs |
|
903 |
and HOL_dup_cs obsolete; |
|
904 |
||
905 |
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1 |
|
906 |
have been removed; |
|
907 |
||
908 |
* Simpler definition of function space in ZF; |
|
909 |
||
910 |
* new results about cardinal and ordinal arithmetic in ZF; |
|
911 |
||
912 |
* 'subtype' facility in HOL for introducing new types as subsets of existing |
|
913 |
types; |
|
914 |
||
915 |
||
2553 | 916 |
$Id$ |