NEWS
author paulson
Sat Sep 23 16:08:23 2000 +0200 (2000-09-23)
changeset 10065 ddb3a014f721
parent 10003 bd2ef19a0275
child 10080 8fb8c17d1cb5
permissions -rw-r--r--
renaming the inverse image operator in HOL
wenzelm@9814
     1
wenzelm@5363
     2
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     3
==============================================
wenzelm@2553
     4
wenzelm@10003
     5
New in Isabelle99-1 (September 2000)
wenzelm@10003
     6
------------------------------------
wenzelm@8015
     7
wenzelm@10003
     8
*** Overview of INCOMPATIBILITIES ***
paulson@8014
     9
wenzelm@8848
    10
* HOL: simplification of natural numbers is much changed; to partly
wenzelm@8848
    11
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
wenzelm@8848
    12
issue the following ML commands:
wenzelm@8848
    13
wenzelm@8848
    14
  Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
wenzelm@8848
    15
  Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
paulson@8788
    16
wenzelm@10003
    17
* HOL: simplification no longer dives into case-expressions;
wenzelm@10003
    18
wenzelm@10003
    19
* HOL: nat_less_induct renamed to less_induct;
wenzelm@10003
    20
wenzelm@10003
    21
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool
wenzelm@10003
    22
fixsome to patch .thy and .ML sources automatically;
paulson@8967
    23
wenzelm@10003
    24
  select_equality  -> some_equality
wenzelm@10003
    25
  select_eq_Ex     -> some_eq_ex
wenzelm@10003
    26
  selectI2EX       -> someI2_ex
wenzelm@10003
    27
  selectI2         -> someI2
wenzelm@10003
    28
  selectI          -> someI
wenzelm@10003
    29
  select1_equality -> some1_equality
wenzelm@10003
    30
  Eps_sym_eq       -> some_sym_eq_trivial
wenzelm@10003
    31
  Eps_eq           -> some_eq_trivial
wenzelm@10003
    32
wenzelm@10003
    33
* HOL: exhaust_tac on datatypes superceded by new generic case_tac;
wenzelm@10003
    34
wenzelm@10003
    35
* HOL: removed obsolete theorem binding expand_if (refer to split_if
wenzelm@10003
    36
instead);
wenzelm@10003
    37
wenzelm@10003
    38
* HOL: the recursion equations generated by 'recdef' are now called
wenzelm@10003
    39
f.simps instead of f.rules;
wenzelm@10003
    40
wenzelm@10003
    41
* HOL: qed_spec_mp now also handles bounded ALL as well;
wenzelm@10003
    42
wenzelm@10003
    43
* HOL: 0 is now overloaded, so the type constraint ":: nat" may
wenzelm@10003
    44
sometimes be needed;
wenzelm@10003
    45
wenzelm@10003
    46
* HOL: the constant for "f``x" is now "image" rather than "op ``";
paulson@8014
    47
paulson@10065
    48
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
paulson@10065
    49
wenzelm@9330
    50
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
wenzelm@9330
    51
product is now "<*>" instead of "Times"; the lexicographic product is
wenzelm@9330
    52
now "<*lex*>" instead of "**";
nipkow@8705
    53
wenzelm@10003
    54
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part
wenzelm@10003
    55
of main HOL, but was unused); better use HOL's datatype package;
paulson@9971
    56
wenzelm@8848
    57
* HOL/Real: "rabs" replaced by overloaded "abs" function;
wenzelm@8848
    58
wenzelm@8887
    59
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm@8887
    60
Lfp, Gfp, WF); this only affects ML packages that refer to const names
wenzelm@8887
    61
internally;
wenzelm@8887
    62
wenzelm@10003
    63
* HOL and ZF: syntax for quotienting wrt an equivalence relation
wenzelm@10003
    64
changed from A/r to A//r;
wenzelm@9908
    65
wenzelm@10003
    66
* ZF: new treatment of arithmetic (nat & int) may break some old
wenzelm@10003
    67
proofs;
wenzelm@8921
    68
wenzelm@10003
    69
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
wenzelm@10003
    70
rulify -> rule_format, elimify -> elim_format, ...);
paulson@9542
    71
wenzelm@9941
    72
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
    73
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
wenzelm@9937
    74
should have to change intro!! to intro? only); replaced "delrule" by
wenzelm@9937
    75
"rule del";
wenzelm@9437
    76
wenzelm@9612
    77
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
wenzelm@9612
    78
wenzelm@9437
    79
* Provers: strengthened force_tac by using new first_best_tac;
oheimb@9402
    80
wenzelm@10003
    81
* LaTeX document preparation: several changes of isabelle.sty (see
wenzelm@10003
    82
lib/texinputs);
wenzelm@8729
    83
paulson@8014
    84
wenzelm@8487
    85
*** Document preparation ***
wenzelm@8358
    86
wenzelm@9198
    87
* formal comments (text blocks etc.) in new-style theories may now
wenzelm@9753
    88
contain antiquotations of thm/prop/term/typ/text to be presented
wenzelm@9753
    89
according to latex print mode; concrete syntax is like this:
wenzelm@9753
    90
@{term[show_types] "f(x) = a + x"};
wenzelm@9198
    91
wenzelm@8358
    92
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm@8518
    93
including proper document sources;
wenzelm@8358
    94
wenzelm@8358
    95
* generated LaTeX sources are now deleted after successful run
wenzelm@8358
    96
(isatool document -c); may retain a copy somewhere else via -D option
wenzelm@8358
    97
of isatool usedir;
wenzelm@8358
    98
wenzelm@8566
    99
* isatool usedir -D now lets isatool latex -o sty update the Isabelle
wenzelm@10003
   100
style files, achieving self-contained LaTeX sources and simplifying
wenzelm@10003
   101
LaTeX debugging;
wenzelm@8566
   102
wenzelm@8518
   103
* old-style theories now produce (crude) LaTeX output as well;
wenzelm@8358
   104
wenzelm@9057
   105
* browser info session directories are now self-contained (may be put
wenzelm@9437
   106
on WWW server seperately); improved graphs of nested sessions; removed
wenzelm@9437
   107
graph for 'all sessions';
wenzelm@9057
   108
wenzelm@10003
   109
* several improvements in isabelle style files; \isabellestyle{it}
wenzelm@10003
   110
produces fake math mode output; \isamarkupheader is now \section by
wenzelm@10003
   111
default; see lib/texinputs/isabelle.sty etc.;
wenzelm@9489
   112
wenzelm@8358
   113
wenzelm@8184
   114
*** Isar ***
wenzelm@8184
   115
wenzelm@10003
   116
* Isar/Pure: local results and corresponding term bindings are now
wenzelm@10003
   117
subject to Hindley-Milner polymorphism (similar to ML); this
wenzelm@10003
   118
accommodates incremental type-inference very nicely;
wenzelm@8283
   119
wenzelm@10003
   120
* Isar/Pure: new derived language element 'obtain' supports
wenzelm@10003
   121
generalized existence reasoning;
wenzelm@8621
   122
wenzelm@10003
   123
* Isar/Pure: new calculational elements 'moreover' and 'ultimately'
wenzelm@10003
   124
support accumulation of results, without applying any rules yet;
wenzelm@10003
   125
useful to collect intermediate results without explicit name
wenzelm@10003
   126
references, and for use with transitivity rules with more than 2
wenzelm@10003
   127
premises;
wenzelm@8184
   128
wenzelm@10003
   129
* Isar/Pure: scalable support for case-analysis type proofs: new
wenzelm@10003
   130
'case' language element refers to local contexts symbolically, as
wenzelm@10003
   131
produced by certain proof methods; internally, case names are attached
wenzelm@10003
   132
to theorems as "tags";
wenzelm@8440
   133
wenzelm@10003
   134
* Isar/Pure: theory command 'hide' removes declarations from
wenzelm@9330
   135
class/type/const name spaces;
wenzelm@9330
   136
wenzelm@10003
   137
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to
wenzelm@9330
   138
indicate potential overloading;
wenzelm@9330
   139
wenzelm@10003
   140
* Isar/Pure: changed syntax of local blocks from {{ }} to { };
wenzelm@8621
   141
wenzelm@10003
   142
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write
wenzelm@10003
   143
"{a,b,c}" instead of {a,b,c};
wenzelm@9011
   144
wenzelm@10003
   145
* Isar/Pure now provides its own version of intro/elim/dest
wenzelm@10003
   146
attributes; useful for building new logics, but beware of confusion
wenzelm@10003
   147
with the version in Provers/classical;
wenzelm@9612
   148
wenzelm@10003
   149
* Isar/Pure: the local context of (non-atomic) goals is provided via
wenzelm@10003
   150
case name 'antecedent';
wenzelm@8440
   151
wenzelm@10003
   152
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
wenzelm@10003
   153
to the current context is now done automatically);
wenzelm@9383
   154
wenzelm@10003
   155
* Isar/Pure: theory command 'method_setup' provides a simple interface
wenzelm@10003
   156
for definining proof methods in ML;
wenzelm@9612
   157
wenzelm@10003
   158
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
   159
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
wenzelm@9941
   160
most cases, one should have to change intro!! to intro? only);
wenzelm@9941
   161
replaced "delrule" by "rule del";
wenzelm@8283
   162
wenzelm@10003
   163
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and
wenzelm@10003
   164
'symmetric' attribute (the latter supercedes [RS sym]);
wenzelm@10003
   165
wenzelm@10003
   166
* Isar/Provers: splitter support (via 'split' attribute and 'simp'
wenzelm@10003
   167
method modifier); 'simp' method: 'only:' modifier removes loopers as
wenzelm@10003
   168
well (including splits);
wenzelm@10003
   169
wenzelm@10003
   170
* Isar/Provers: Simplifier and Classical methods now support all kind
wenzelm@10003
   171
of modifiers used in the past, including 'cong', 'iff', etc.
wenzelm@10003
   172
wenzelm@10003
   173
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
wenzelm@10003
   174
of Simplifier and Classical reasoner);
wenzelm@10003
   175
wenzelm@10003
   176
* Isar/HOL: new proof method 'cases' and improved version of 'induct'
wenzelm@10003
   177
now support named cases; major packages (inductive, datatype, primrec,
wenzelm@10003
   178
recdef) support case names and properly name parameters;
wenzelm@9612
   179
wenzelm@10003
   180
* Isar/HOL: new transitivity rules for substitution in inequalities --
wenzelm@10003
   181
monotonicity conditions are extracted to be proven at end of
wenzelm@10003
   182
calculations;
wenzelm@10003
   183
wenzelm@10003
   184
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
wenzelm@10003
   185
method anyway;
wenzelm@10003
   186
wenzelm@10003
   187
* Isar/HOL: removed old expand_if = split_if; theorems if_splits =
wenzelm@10003
   188
split_if split_if_asm; datatype package provides theorems foo.splits =
wenzelm@10003
   189
foo.split foo.split_asm for each datatype;
wenzelm@10003
   190
wenzelm@10003
   191
* Isar/HOL: tuned inductive package, rename "intrs" to "intros"
wenzelm@10003
   192
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof
wenzelm@10003
   193
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
wenzelm@10003
   194
use "(cases (simplified))" method in proper proof texts);
wenzelm@10003
   195
wenzelm@10003
   196
* Isar/HOL: added global 'arith_split' attribute for 'arith' method;
wenzelm@10003
   197
wenzelm@10003
   198
* Isar: names of theorems etc. may be natural numbers as well;
wenzelm@10003
   199
wenzelm@10003
   200
* Isar: 'pr' command: optional arguments for goals_limit and
wenzelm@9724
   201
ProofContext.prems_limit; no longer prints theory contexts, but only
wenzelm@9724
   202
proof states;
wenzelm@8487
   203
wenzelm@10003
   204
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
wenzelm@8518
   205
additional print modes to be specified; e.g. "pr(latex)" will print
wenzelm@8518
   206
proof state according to the Isabelle LaTeX style;
wenzelm@8487
   207
wenzelm@10003
   208
* Isar: improved support for emulating tactic scripts, including proof
wenzelm@9612
   209
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
wenzelm@9612
   210
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
wenzelm@9612
   211
(for HOL datatypes);
wenzelm@8534
   212
wenzelm@10003
   213
* Isar: simplified (more robust) goal selection of proof methods: 1st
wenzelm@10003
   214
goal, all goals, or explicit goal specifier (tactic emulation); thus
wenzelm@10003
   215
'proof method scripts' have to be in depth-first order;
wenzelm@8673
   216
wenzelm@10003
   217
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
wenzelm@8729
   218
wenzelm@10003
   219
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm@10003
   220
should instead use individual commands for printing items
wenzelm@10003
   221
(print_commands, print_methods etc.);
wenzelm@9224
   222
wenzelm@10003
   223
* Isar: added 'nothing' --- the empty list of theorems;
wenzelm@9239
   224
wenzelm@8184
   225
paulson@8014
   226
*** HOL ***
paulson@8014
   227
wenzelm@8518
   228
* HOL/Algebra: new theory of rings and univariate polynomials, by
wenzelm@8518
   229
Clemens Ballarin;
paulson@8014
   230
wenzelm@10003
   231
* HOL/NumberTheory: Fundamental Theorem of Arithmetic, Chinese
wenzelm@10003
   232
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
wenzelm@10003
   233
Rasmussen;
wenzelm@8570
   234
wenzelm@10003
   235
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
wenzelm@10003
   236
von Oheimb;
paulson@9542
   237
wenzelm@10003
   238
* HOL/Lambda: converted into new-style theory and document;
paulson@9542
   239
wenzelm@10003
   240
* HOL/ex/Multiquote: example of multiple nested quotations and
wenzelm@10003
   241
anti-quotations -- basically a generalized version of de-Bruijn
wenzelm@10003
   242
representation; very useful in avoiding lifting of operations;
wenzelm@8848
   243
wenzelm@9612
   244
* HOL/record: added general record equality rule to simpset; fixed
wenzelm@9612
   245
select-update simplification procedure to handle extended records as
wenzelm@9612
   246
well; admit "r" as field name;
paulson@9542
   247
paulson@8967
   248
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with
paulson@8967
   249
other numeric types and also as the identity of groups, rings, etc.;
paulson@8967
   250
paulson@8967
   251
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
paulson@8967
   252
Types nat and int belong to this axclass;
paulson@8967
   253
wenzelm@10003
   254
* HOL: greatly improved simplification involving numerals of type nat, int, real:
paulson@8788
   255
   (i + #8 + j) = Suc k simplifies to  #7 + (i + j) = k
paulson@8832
   256
   i*j + k + j*#3*i     simplifies to  #4*(i*j) + k
paulson@8832
   257
  two terms #m*u and #n*u are replaced by #(m+n)*u
paulson@8832
   258
    (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
paulson@8832
   259
  and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
paulson@8832
   260
    or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
paulson@8736
   261
wenzelm@10003
   262
* HOL: meson_tac is available (previously in ex/meson.ML); it is a
wenzelm@10003
   263
powerful prover for predicate logic but knows nothing of clasets; see
wenzelm@10003
   264
ex/mesontest.ML and ex/mesontest2.ML for example applications;
paulson@9835
   265
wenzelm@8848
   266
* HOL: new version of "case_tac" subsumes both boolean case split and
wenzelm@8440
   267
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
wenzelm@8518
   268
exists, may define val exhaust_tac = case_tac for ad-hoc portability;
wenzelm@8440
   269
wenzelm@8848
   270
* HOL: simplification no longer dives into case-expressions: only the
wenzelm@8848
   271
selector expression is simplified, but not the remaining arms. To
wenzelm@8848
   272
enable full simplification of case-expressions for datatype t, you
wenzelm@8848
   273
need to remove t.weak_case_cong from the simpset, either permanently
wenzelm@10003
   274
(Delcongs [thm"t.weak_case_cong"];) or locally (delcongs [...]).
nipkow@8603
   275
wenzelm@8848
   276
* HOL/recdef: the recursion equations generated by 'recdef' for
wenzelm@8848
   277
function 'f' are now called f.simps instead of f.rules; if all
wenzelm@8848
   278
termination conditions are proved automatically, these simplification
wenzelm@8848
   279
rules are added to the simpset, as in primrec; rules may be named
wenzelm@8848
   280
individually as well, resulting in a separate list of theorems for
wenzelm@8848
   281
each equation;
wenzelm@8848
   282
wenzelm@9489
   283
* HOL/While is a new theory that provides a while-combinator. It
wenzelm@9489
   284
permits the definition of tail-recursive functions without the
wenzelm@9489
   285
provision of a termination measure. The latter is necessary once the
wenzelm@9489
   286
invariant proof rule for while is applied.
nipkow@9457
   287
wenzelm@10003
   288
* HOL: new (overloaded) notation for the set of elements below/above
wenzelm@10003
   289
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
nipkow@8925
   290
wenzelm@8848
   291
* HOL: theorems impI, allI, ballI bound as "strip";
wenzelm@8848
   292
wenzelm@10003
   293
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
nipkow@9746
   294
induct_tac th "x1 ... xn" expects th to have a conclusion of the form
nipkow@9746
   295
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
nipkow@9746
   296
wenzelm@10003
   297
* HOL/Real: "rabs" replaced by overloaded "abs" function;
nipkow@9737
   298
wenzelm@10003
   299
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of
wenzelm@10003
   300
main HOL, but was unused);
nipkow@8626
   301
wenzelm@10003
   302
* HOL: fewer consts declared as global (e.g. have to refer to
wenzelm@10003
   303
"Lfp.lfp" instead of "lfp" internally; affects ML packages only);
wenzelm@8887
   304
wenzelm@10003
   305
* HOL: tuned AST representation of nested pairs, avoiding bogus output
wenzelm@10003
   306
in case of overlap with user translations (e.g. judgements over
wenzelm@10003
   307
tuples); (note that the underlying logical represenation is still
wenzelm@10003
   308
bogus);
wenzelm@9349
   309
nipkow@8412
   310
paulson@9542
   311
*** ZF ***
paulson@9542
   312
wenzelm@10003
   313
* ZF: simplification automatically cancels common terms in arithmetic
wenzelm@10003
   314
expressions over nat and int;
paulson@9542
   315
wenzelm@10003
   316
* ZF: new treatment of nat to minimize type-checking: all operators
wenzelm@10003
   317
coerce their operands to a natural number using the function natify,
wenzelm@10003
   318
making the algebraic laws unconditional;
paulson@9542
   319
wenzelm@10003
   320
* ZF: as above, for int: operators coerce their operands to an integer
wenzelm@10003
   321
using the function intify;
paulson@9542
   322
wenzelm@10003
   323
* ZF: the integer library now contains many of the usual laws for the
wenzelm@10003
   324
orderings, including $<=, and monotonicity laws for $+ and $*;
paulson@9542
   325
wenzelm@10003
   326
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
wenzelm@10003
   327
simplification;
paulson@9388
   328
wenzelm@10003
   329
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
wenzelm@10003
   330
to the simplifier and classical reasoner simultaneously;
paulson@9388
   331
paulson@9388
   332
wenzelm@8358
   333
*** General ***
wenzelm@8358
   334
wenzelm@10003
   335
* Provers: blast_tac now handles actual object-logic rules as
wenzelm@10003
   336
assumptions; note that auto_tac uses blast_tac internally as well;
wenzelm@10003
   337
wenzelm@10003
   338
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
wenzelm@10003
   339
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
wenzelm@10003
   340
wenzelm@9941
   341
* Provers: delrules now handles destruct rules as well (no longer need
wenzelm@9941
   342
explicit make_elim);
wenzelm@9941
   343
wenzelm@10003
   344
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
wenzelm@10003
   345
  [| inj ?f;          ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
   346
use instead the strong form,
wenzelm@10003
   347
  [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
   348
in HOL, FOL and ZF the function cla_make_elim will create such rules
wenzelm@10003
   349
from destruct-rules;
wenzelm@9489
   350
wenzelm@9709
   351
* Provers: Simplifier.easy_setup provides a fast path to basic
wenzelm@9709
   352
Simplifier setup for new object-logics;
wenzelm@9709
   353
wenzelm@9709
   354
* Pure: AST translation rules no longer require constant head on LHS;
wenzelm@9349
   355
wenzelm@9709
   356
* Pure: improved name spaces: ambiguous output is qualified; support
wenzelm@9709
   357
for hiding of names;
wenzelm@8729
   358
wenzelm@10003
   359
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
wenzelm@10003
   360
XSYMBOL_HOME; no longer need to do manual configuration in most
wenzelm@10003
   361
situations;
wenzelm@10003
   362
wenzelm@9709
   363
* system: compression of ML heaps images may now be controlled via -c
wenzelm@9709
   364
option of isabelle and isatool usedir (currently only observed by
wenzelm@9709
   365
Poly/ML);
wenzelm@8358
   366
wenzelm@9981
   367
* system: isatool installfonts may handle X-Symbol fonts as well (very
wenzelm@9981
   368
useful for remote X11);
wenzelm@9981
   369
wenzelm@9709
   370
* system: provide TAGS file for Isabelle sources;
wenzelm@9052
   371
wenzelm@9288
   372
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument
wenzelm@9288
   373
order;
wenzelm@9288
   374
wenzelm@8994
   375
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm@8994
   376
timing flag supersedes proof_timing and Toplevel.trace;
wenzelm@8994
   377
wenzelm@10003
   378
* ML: new combinators |>> and |>>> for incremental transformations
wenzelm@10003
   379
with secondary results (e.g. certain theory extensions):
wenzelm@10003
   380
wenzelm@9330
   381
* ML: PureThy.add_defs gets additional argument to indicate potential
wenzelm@9330
   382
overloading (usually false);
wenzelm@9330
   383
wenzelm@10003
   384
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
wenzelm@10003
   385
results;
wenzelm@8440
   386
wenzelm@8358
   387
wenzelm@8015
   388
wenzelm@7986
   389
New in Isabelle99 (October 1999)
wenzelm@7986
   390
--------------------------------
oheimb@4649
   391
paulson@5931
   392
*** Overview of INCOMPATIBILITIES (see below for more details) ***
paulson@5931
   393
paulson@6922
   394
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
paulson@6922
   395
are no longer simplified.  (This allows the simplifier to unfold recursive
paulson@6922
   396
functional programs.)  To restore the old behaviour, declare
wenzelm@7215
   397
wenzelm@7215
   398
    Delcongs [if_weak_cong];
paulson@6922
   399
wenzelm@6269
   400
* HOL: Removed the obsolete syntax "Compl A"; use -A for set
wenzelm@6269
   401
complement;
paulson@5931
   402
wenzelm@6269
   403
* HOL: the predicate "inj" is now defined by translation to "inj_on";
paulson@6174
   404
berghofe@7847
   405
* HOL/datatype: mutual_induct_tac no longer exists --
berghofe@7847
   406
  use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
berghofe@7847
   407
wenzelm@6386
   408
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
   409
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
   410
wenzelm@6269
   411
* ZF: The con_defs part of an inductive definition may no longer refer
wenzelm@6269
   412
to constants declared in the same theory;
nipkow@6057
   413
wenzelm@6269
   414
* HOL, ZF: the function mk_cases, generated by the inductive
wenzelm@6269
   415
definition package, has lost an argument.  To simplify its result, it
wenzelm@6269
   416
uses the default simpset instead of a supplied list of theorems.
paulson@6141
   417
wenzelm@7215
   418
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
   419
nipkow@7619
   420
* Simplifier: the type of the infix ML functions
wenzelm@8729
   421
        setSSolver addSSolver setSolver addSolver
nipkow@7619
   422
is now  simpset * solver -> simpset  where `solver' is a new abstract type
nipkow@7619
   423
for packaging solvers. A solver is created via
wenzelm@8729
   424
        mk_solver: string -> (thm list -> int -> tactic) -> solver
nipkow@7619
   425
where the string argument is only a comment.
nipkow@6057
   426
wenzelm@7647
   427
paulson@6069
   428
*** Proof tools ***
paulson@6069
   429
wenzelm@6343
   430
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a
wenzelm@6343
   431
decision procedure for linear arithmetic. Currently it is used for
wenzelm@7593
   432
types `nat', `int', and `real' in HOL (see below); it can, should and
wenzelm@7593
   433
will be instantiated for other types and logics as well.
paulson@6069
   434
nipkow@7324
   435
* The simplifier now accepts rewrite rules with flexible heads, eg
nipkow@7324
   436
     hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
nipkow@7324
   437
  They are applied like any rule with a non-pattern lhs, i.e. by first-order
nipkow@7324
   438
  matching.
paulson@6069
   439
wenzelm@7593
   440
paulson@6014
   441
*** General ***
paulson@6014
   442
wenzelm@7986
   443
* New Isabelle/Isar subsystem provides an alternative to traditional
wenzelm@7215
   444
tactical theorem proving; together with the ProofGeneral/isar user
wenzelm@7215
   445
interface it offers an interactive environment for developing human
wenzelm@7215
   446
readable proof documents (Isar == Intelligible semi-automated
wenzelm@7886
   447
reasoning); for further information see isatool doc isar-ref,
wenzelm@7986
   448
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
wenzelm@7886
   449
wenzelm@9612
   450
* improved and simplified presentation of theories: better HTML markup
wenzelm@9612
   451
(including colors), graph views in several sizes; isatool usedir now
wenzelm@9612
   452
provides a proper interface for user theories (via -P option); actual
wenzelm@9612
   453
document preparation based on (PDF)LaTeX is available as well (for
wenzelm@9612
   454
new-style theories only); see isatool doc system for more information;
wenzelm@7215
   455
wenzelm@7252
   456
* native support for Proof General, both for classic Isabelle and
wenzelm@7986
   457
Isabelle/Isar;
wenzelm@7215
   458
wenzelm@7791
   459
* ML function thm_deps visualizes dependencies of theorems and lemmas,
wenzelm@7791
   460
using the graph browser tool;
wenzelm@7791
   461
wenzelm@6751
   462
* Isabelle manuals now also available as PDF;
wenzelm@6751
   463
wenzelm@6449
   464
* theory loader rewritten from scratch (may not be fully
wenzelm@6449
   465
bug-compatible); old loadpath variable has been replaced by show_path,
wenzelm@6671
   466
add_path, del_path, reset_path functions; new operations such as
wenzelm@7593
   467
update_thy, touch_thy, remove_thy, use/update_thy_only (see also
wenzelm@7593
   468
isatool doc ref);
wenzelm@6449
   469
wenzelm@7215
   470
* improved isatool install: option -k creates KDE application icon,
wenzelm@7215
   471
option -p DIR installs standalone binaries;
wenzelm@7215
   472
wenzelm@7215
   473
* added ML_PLATFORM setting (useful for cross-platform installations);
wenzelm@7215
   474
more robust handling of platform specific ML images for SML/NJ;
wenzelm@7215
   475
wenzelm@7886
   476
* the settings environment is now statically scoped, i.e. it is never
wenzelm@7986
   477
created again in sub-processes invoked from isabelle, isatool, or
wenzelm@7886
   478
Isabelle;
wenzelm@7886
   479
wenzelm@7215
   480
* path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm@7215
   481
wenzelm@6343
   482
* in locales, the "assumes" and "defines" parts may be omitted if
wenzelm@6343
   483
empty;
wenzelm@5973
   484
wenzelm@6269
   485
* new print_mode "xsymbols" for extended symbol support (e.g. genuine
wenzelm@6269
   486
long arrows);
wenzelm@6259
   487
wenzelm@6343
   488
* new print_mode "HTML";
wenzelm@6343
   489
wenzelm@6343
   490
* new flag show_tags controls display of tags of theorems (which are
wenzelm@6343
   491
basically just comments that may be attached by some tools);
wenzelm@6343
   492
wenzelm@6461
   493
* Isamode 2.6 requires patch to accomodate change of Isabelle font
wenzelm@6461
   494
mode and goal output format:
wenzelm@6461
   495
wenzelm@6461
   496
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
wenzelm@6461
   497
244c244
wenzelm@6461
   498
<       (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
wenzelm@6461
   499
---
wenzelm@6533
   500
>       (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
wenzelm@6461
   501
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
wenzelm@6461
   502
181c181
wenzelm@6461
   503
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
wenzelm@6461
   504
---
wenzelm@6461
   505
> (defconst proofstate-proofstart-regexp "^Level [0-9]+"
wenzelm@6461
   506
wenzelm@7450
   507
* function bind_thms stores lists of theorems (cf. bind_thm);
wenzelm@7450
   508
wenzelm@7593
   509
* new shorthand tactics ftac, eatac, datac, fatac;
wenzelm@7593
   510
wenzelm@7593
   511
* qed (and friends) now accept "" as result name; in that case the
wenzelm@7986
   512
theorem is not stored, but proper checks and presentation of the
wenzelm@7986
   513
result still apply;
wenzelm@7593
   514
wenzelm@7805
   515
* theorem database now also indexes constants "Trueprop", "all",
wenzelm@7805
   516
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
wenzelm@7805
   517
oheimb@6028
   518
nipkow@6057
   519
*** HOL ***
nipkow@6057
   520
wenzelm@7215
   521
** HOL arithmetic **
wenzelm@7215
   522
wenzelm@6343
   523
* There are now decision procedures for linear arithmetic over nat and
wenzelm@6343
   524
int:
nipkow@6131
   525
wenzelm@6343
   526
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
wenzelm@6343
   527
`+', `-', `Suc', `min', `max' and numerical constants; other subterms
wenzelm@6343
   528
are treated as atomic; subformulae not involving type `nat' or `int'
wenzelm@6343
   529
are ignored; quantified subformulae are ignored unless they are
wenzelm@6343
   530
positive universal or negative existential. The tactic has to be
wenzelm@6343
   531
invoked by hand and can be a little bit slow. In particular, the
wenzelm@6343
   532
running time is exponential in the number of occurrences of `min' and
wenzelm@6343
   533
`max', and `-' on `nat'.
nipkow@6131
   534
wenzelm@6343
   535
2. fast_arith_tac is a cut-down version of arith_tac: it only takes
wenzelm@6343
   536
(negated) (in)equalities among the premises and the conclusion into
wenzelm@6343
   537
account (i.e. no compound formulae) and does not know about `min' and
wenzelm@6343
   538
`max', and `-' on `nat'. It is fast and is used automatically by the
wenzelm@6343
   539
simplifier.
nipkow@6131
   540
wenzelm@6343
   541
NB: At the moment, these decision procedures do not cope with mixed
wenzelm@6343
   542
nat/int formulae where the two parts interact, such as `m < n ==>
wenzelm@6343
   543
int(m) < int(n)'.
oheimb@6028
   544
wenzelm@7215
   545
* HOL/Numeral provides a generic theory of numerals (encoded
wenzelm@7313
   546
efficiently as bit strings); setup for types nat/int/real is in place;
wenzelm@7215
   547
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
wenzelm@7215
   548
int, existing theories and proof scripts may require a few additional
wenzelm@7215
   549
type constraints;
wenzelm@7215
   550
wenzelm@7215
   551
* integer division and remainder can now be performed on constant
wenzelm@7215
   552
arguments;
paulson@7157
   553
wenzelm@7215
   554
* many properties of integer multiplication, division and remainder
wenzelm@7215
   555
are now available;
paulson@6922
   556
paulson@7287
   557
* An interface to the Stanford Validity Checker (SVC) is available through the
paulson@7287
   558
tactic svc_tac.  Propositional tautologies and theorems of linear arithmetic
paulson@7287
   559
are proved automatically.  SVC must be installed separately, and its results
paulson@7287
   560
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
paulson@7287
   561
invocation of the underlying oracle).  For SVC see
paulson@7444
   562
  http://verify.stanford.edu/SVC
paulson@6922
   563
wenzelm@7125
   564
* IsaMakefile: the HOL-Real target now builds an actual image;
wenzelm@7125
   565
wenzelm@7215
   566
wenzelm@7215
   567
** HOL misc **
wenzelm@7215
   568
wenzelm@7595
   569
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm@7595
   570
(in Isabelle/Isar) -- by Gertrud Bauer;
wenzelm@7595
   571
wenzelm@7691
   572
* HOL/BCV: generic model of bytecode verification, i.e. data-flow
wenzelm@7691
   573
analysis for assembly languages with subtypes;
wenzelm@7691
   574
wenzelm@6278
   575
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
wenzelm@6278
   576
-- avoids syntactic ambiguities and treats state, transition, and
wenzelm@6278
   577
temporal levels more uniformly; introduces INCOMPATIBILITIES due to
wenzelm@6278
   578
changed syntax and (many) tactics;
wenzelm@6278
   579
wenzelm@7791
   580
* HOL/inductive: Now also handles more general introduction rules such
wenzelm@7791
   581
  as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
wenzelm@7791
   582
  theorems are now maintained within the theory (maintained via the
wenzelm@7791
   583
  "mono" attribute);
berghofe@7780
   584
wenzelm@7238
   585
* HOL/datatype: Now also handles arbitrarily branching datatypes
wenzelm@7238
   586
  (using function types) such as
wenzelm@7238
   587
wenzelm@7238
   588
  datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
berghofe@7047
   589
wenzelm@7326
   590
* HOL/record: record_simproc (part of the default simpset) takes care
wenzelm@7326
   591
of selectors applied to updated records; record_split_tac is no longer
wenzelm@7327
   592
part of the default claset; update_defs may now be removed from the
wenzelm@7327
   593
simpset in many cases; COMPATIBILITY: old behavior achieved by
wenzelm@7326
   594
wenzelm@7326
   595
  claset_ref () := claset() addSWrapper record_split_wrapper;
wenzelm@7326
   596
  Delsimprocs [record_simproc]
wenzelm@7326
   597
wenzelm@6386
   598
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
   599
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
   600
paulson@7287
   601
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
paulson@7287
   602
names rather than an ML expression;
paulson@7287
   603
paulson@7287
   604
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
paulson@7287
   605
supplied later.  Program schemes can be defined, such as
paulson@7287
   606
    "While B C s = (if B s then While B C (C s) else s)"
paulson@7287
   607
where the well-founded relation can be chosen after B and C have been given.
wenzelm@6563
   608
wenzelm@7215
   609
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
   610
INCOMPATIBILITY: while [] and infix # syntax is still there, of
wenzelm@7215
   611
course, ML tools referring to List.list.op # etc. have to be adapted;
wenzelm@7215
   612
wenzelm@7238
   613
* HOL_quantifiers flag superseded by "HOL" print mode, which is
wenzelm@7238
   614
disabled by default; run isabelle with option -m HOL to get back to
wenzelm@7238
   615
the original Gordon/HOL-style output;
wenzelm@7238
   616
wenzelm@7238
   617
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
wenzelm@7238
   618
ALL x<=y. P, EX x<y. P, EX x<=y. P;
wenzelm@7238
   619
wenzelm@7238
   620
* HOL basic syntax simplified (more orthogonal): all variants of
wenzelm@7238
   621
All/Ex now support plain / symbolic / HOL notation; plain syntax for
wenzelm@7238
   622
Eps operator is provided as well: "SOME x. P[x]";
wenzelm@7238
   623
berghofe@7320
   624
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
wenzelm@7261
   625
wenzelm@7280
   626
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
wenzelm@7280
   627
thus available for user theories;
wenzelm@7280
   628
wenzelm@7300
   629
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
wenzelm@7300
   630
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
wenzelm@7300
   631
time;
wenzelm@7300
   632
wenzelm@7986
   633
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
wenzelm@7986
   634
several times and then mp;
oheimb@7492
   635
wenzelm@7215
   636
paulson@7113
   637
*** LK ***
paulson@7113
   638
wenzelm@7215
   639
* the notation <<...>> is now available as a notation for sequences of
wenzelm@7215
   640
formulas;
paulson@7113
   641
paulson@7113
   642
* the simplifier is now installed
paulson@7113
   643
wenzelm@8729
   644
* the axiom system has been generalized (thanks to Soren Heilmann)
paulson@7113
   645
paulson@7113
   646
* the classical reasoner now has a default rule database
paulson@7113
   647
paulson@7113
   648
paulson@6064
   649
*** ZF ***
paulson@6064
   650
paulson@6064
   651
* new primrec section allows primitive recursive functions to be given
wenzelm@6269
   652
directly (as in HOL) over datatypes and the natural numbers;
paulson@6064
   653
wenzelm@6269
   654
* new tactics induct_tac and exhaust_tac for induction (or case
wenzelm@6269
   655
analysis) over datatypes and the natural numbers;
paulson@6064
   656
paulson@6064
   657
* the datatype declaration of type T now defines the recursor T_rec;
paulson@6064
   658
paulson@6141
   659
* simplification automatically does freeness reasoning for datatype
wenzelm@6269
   660
constructors;
paulson@6141
   661
wenzelm@6269
   662
* automatic type-inference, with AddTCs command to insert new
wenzelm@6269
   663
type-checking rules;
paulson@6155
   664
wenzelm@6269
   665
* datatype introduction rules are now added as Safe Introduction rules
wenzelm@6269
   666
to the claset;
paulson@6155
   667
wenzelm@6269
   668
* the syntax "if P then x else y" is now available in addition to
wenzelm@6269
   669
if(P,x,y);
wenzelm@6269
   670
paulson@6069
   671
wenzelm@6343
   672
*** Internal programming interfaces ***
wenzelm@6343
   673
wenzelm@7919
   674
* tuned simplifier trace output; new flag debug_simp;
wenzelm@7919
   675
wenzelm@7420
   676
* structures Vartab / Termtab (instances of TableFun) offer efficient
wenzelm@7420
   677
tables indexed by indexname_ord / term_ord (compatible with aconv);
wenzelm@7420
   678
wenzelm@6386
   679
* AxClass.axclass_tac lost the theory argument;
wenzelm@6386
   680
wenzelm@6343
   681
* tuned current_goals_markers semantics: begin / end goal avoids
wenzelm@6343
   682
printing empty lines;
wenzelm@6343
   683
wenzelm@6343
   684
* removed prs and prs_fn hook, which was broken because it did not
wenzelm@6343
   685
include \n in its semantics, forcing writeln to add one
wenzelm@6343
   686
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
wenzelm@6343
   687
string -> unit if you really want to output text without newline;
wenzelm@6343
   688
wenzelm@6343
   689
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
wenzelm@6343
   690
plain output, interface builders may have to enable 'isabelle_font'
wenzelm@6343
   691
mode to get Isabelle font glyphs as before;
wenzelm@6343
   692
wenzelm@6343
   693
* refined token_translation interface; INCOMPATIBILITY: output length
wenzelm@6343
   694
now of type real instead of int;
wenzelm@6343
   695
wenzelm@7196
   696
* theory loader actions may be traced via new ThyInfo.add_hook
wenzelm@7196
   697
interface (see src/Pure/Thy/thy_info.ML); example application: keep
wenzelm@7196
   698
your own database of information attached to *whole* theories -- as
wenzelm@7196
   699
opposed to intra-theory data slots offered via TheoryDataFun;
wenzelm@7196
   700
wenzelm@7647
   701
* proper handling of dangling sort hypotheses (at last!);
wenzelm@7647
   702
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
wenzelm@7647
   703
extra sort hypotheses that can be witnessed from the type signature;
wenzelm@7986
   704
the force_strip_shyps flag is gone, any remaining shyps are simply
wenzelm@7986
   705
left in the theorem (with a warning issued by strip_shyps_warning);
wenzelm@7647
   706
wenzelm@6343
   707
paulson@6064
   708
wenzelm@5781
   709
New in Isabelle98-1 (October 1998)
wenzelm@5781
   710
----------------------------------
wenzelm@5781
   711
wenzelm@5127
   712
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842
   713
wenzelm@5726
   714
* several changes of automated proof tools;
wenzelm@5373
   715
wenzelm@5726
   716
* HOL: major changes to the inductive and datatype packages, including
wenzelm@5726
   717
some minor incompatibilities of theory syntax;
berghofe@5214
   718
wenzelm@5726
   719
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
wenzelm@5217
   720
called `inj_on';
paulson@5160
   721
nipkow@5275
   722
* HOL: removed duplicate thms in Arith:
nipkow@5275
   723
  less_imp_add_less  should be replaced by  trans_less_add1
nipkow@5275
   724
  le_imp_add_le      should be replaced by  trans_le_add1
paulson@5160
   725
wenzelm@5726
   726
* HOL: unary minus is now overloaded (new type constraints may be
wenzelm@5726
   727
required);
paulson@5490
   728
wenzelm@5726
   729
* HOL and ZF: unary minus for integers is now #- instead of #~.  In
wenzelm@5726
   730
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
wenzelm@5726
   731
now taken as an integer constant.
paulson@5541
   732
wenzelm@5726
   733
* Pure: ML function 'theory_of' renamed to 'theory';
wenzelm@5397
   734
wenzelm@5363
   735
wenzelm@5127
   736
*** Proof tools ***
nipkow@4880
   737
nipkow@5657
   738
* Simplifier:
nipkow@5657
   739
  1. Asm_full_simp_tac is now more aggressive.
nipkow@5657
   740
     1. It will sometimes reorient premises if that increases their power to
nipkow@5657
   741
        simplify.
nipkow@5657
   742
     2. It does no longer proceed strictly from left to right but may also
nipkow@5657
   743
        rotate premises to achieve further simplification.
nipkow@5657
   744
     For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@5657
   745
     old Asm_full_simp_tac in that it does not rotate premises.
nipkow@5657
   746
  2. The simplifier now knows a little bit about nat-arithmetic.
nipkow@4880
   747
wenzelm@5127
   748
* Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127
   749
allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127
   750
wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127
   751
addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127
   752
and that adding two tactics with the same name overwrites the first
wenzelm@5127
   753
one (emitting a warning).
oheimb@4824
   754
  type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649
   755
  setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824
   756
  addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824
   757
  delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649
   758
  getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649
   759
wenzelm@5705
   760
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
wenzelm@5726
   761
semantics; addbefore now affects only the unsafe part of step_tac
wenzelm@5726
   762
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
wenzelm@5726
   763
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
wenzelm@5726
   764
by Force_tac;
oheimb@5524
   765
wenzelm@5726
   766
* Classical reasoner: setwrapper to setWrapper and compwrapper to
wenzelm@5726
   767
compWrapper; added safe wrapper (and access functions for it);
oheimb@5524
   768
wenzelm@5127
   769
* HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5726
   770
to split.  Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
wenzelm@5726
   771
and the names of the automatically generated variables have changed.
wenzelm@5726
   772
split_all_tac has moved within claset() from unsafe wrappers to safe
wenzelm@5726
   773
wrappers, which means that !!-bound variables are split much more
wenzelm@5726
   774
aggressively, and safe_tac and clarify_tac now split such variables.
wenzelm@5726
   775
If this splitting is not appropriate, use delSWrapper "split_all_tac".
wenzelm@5726
   776
Note: the same holds for record_split_tac, which does the job of
wenzelm@5726
   777
split_all_tac for record fields.
wenzelm@5127
   778
wenzelm@5726
   779
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
wenzelm@5726
   780
permanently to the default simpset using Addsplits just like
wenzelm@5726
   781
Addsimps. They can be removed via Delsplits just like
wenzelm@5726
   782
Delsimps. Lower-case versions are also available.
wenzelm@5127
   783
wenzelm@5726
   784
* HOL/Simplifier: The rule split_if is now part of the default
wenzelm@5726
   785
simpset. This means that the simplifier will eliminate all occurrences
wenzelm@5726
   786
of if-then-else in the conclusion of a goal. To prevent this, you can
wenzelm@5726
   787
either remove split_if completely from the default simpset by
wenzelm@5726
   788
`Delsplits [split_if]' or remove it in a specific call of the
wenzelm@5726
   789
simplifier using `... delsplits [split_if]'.  You can also add/delete
wenzelm@5726
   790
other case splitting rules to/from the default simpset: every datatype
wenzelm@5726
   791
generates suitable rules `split_t_case' and `split_t_case_asm' (where
wenzelm@5726
   792
t is the name of the datatype).
wenzelm@5127
   793
wenzelm@5726
   794
* Classical reasoner / Simplifier combination: new force_tac (and
wenzelm@5127
   795
derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127
   796
reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5726
   797
aimed to solve the given subgoal completely.
wenzelm@5127
   798
wenzelm@5127
   799
wenzelm@5127
   800
*** General ***
wenzelm@5127
   801
wenzelm@5217
   802
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127
   803
and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127
   804
the current theory context is used; assumptions are no longer returned
wenzelm@5127
   805
at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5217
   806
recommended to convert to these new commands using isatool fixgoal
wenzelm@5217
   807
(backup your sources first!);
wenzelm@4842
   808
wenzelm@5217
   809
* new top-level commands 'thm' and 'thms' for retrieving theorems from
wenzelm@5207
   810
the current theory context, and 'theory' to lookup stored theories;
paulson@4806
   811
paulson@5722
   812
* new theory section 'locale' for declaring constants, assumptions and
paulson@5722
   813
definitions that have local scope;
paulson@5722
   814
wenzelm@5127
   815
* new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858
   816
wenzelm@5127
   817
* new theory section 'setup' for generic ML setup functions
wenzelm@5127
   818
(e.g. package initialization);
wenzelm@4869
   819
wenzelm@5131
   820
* the distribution now includes Isabelle icons: see
wenzelm@5131
   821
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131
   822
wenzelm@5363
   823
* isatool install - install binaries with absolute references to
wenzelm@5363
   824
ISABELLE_HOME/bin;
wenzelm@5363
   825
wenzelm@5572
   826
* isatool logo -- create instances of the Isabelle logo (as EPS);
wenzelm@5572
   827
wenzelm@5407
   828
* print mode 'emacs' reserved for Isamode;
wenzelm@5407
   829
wenzelm@5726
   830
* support multiple print (ast) translations per constant name;
wenzelm@5726
   831
wenzelm@6925
   832
* theorems involving oracles are now printed with a suffixed [!];
wenzelm@6925
   833
wenzelm@4711
   834
paulson@4661
   835
*** HOL ***
paulson@4661
   836
wenzelm@5710
   837
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
nipkow@5709
   838
wenzelm@5217
   839
* HOL/inductive package reorganized and improved: now supports mutual
paulson@5267
   840
definitions such as
wenzelm@5217
   841
wenzelm@5217
   842
  inductive EVEN ODD
wenzelm@5217
   843
    intrs
wenzelm@5217
   844
      null "0 : EVEN"
wenzelm@5217
   845
      oddI "n : EVEN ==> Suc n : ODD"
wenzelm@5217
   846
      evenI "n : ODD ==> Suc n : EVEN"
wenzelm@5217
   847
wenzelm@5217
   848
new theorem list "elims" contains an elimination rule for each of the
wenzelm@5217
   849
recursive sets; inductive definitions now handle disjunctive premises
wenzelm@5217
   850
correctly (also ZF);
berghofe@5214
   851
wenzelm@5217
   852
INCOMPATIBILITIES: requires Inductive as an ancestor; component
wenzelm@5217
   853
"mutual_induct" no longer exists - the induction rule is always
wenzelm@5217
   854
contained in "induct";
wenzelm@5217
   855
wenzelm@5217
   856
wenzelm@5217
   857
* HOL/datatype package re-implemented and greatly improved: now
paulson@5267
   858
supports mutually recursive datatypes such as
wenzelm@5217
   859
wenzelm@5217
   860
  datatype
wenzelm@5217
   861
    'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
wenzelm@5217
   862
            | SUM ('a aexp) ('a aexp)
wenzelm@5217
   863
            | DIFF ('a aexp) ('a aexp)
wenzelm@5217
   864
            | NUM 'a
wenzelm@5217
   865
  and
wenzelm@5217
   866
    'a bexp = LESS ('a aexp) ('a aexp)
wenzelm@5217
   867
            | AND ('a bexp) ('a bexp)
wenzelm@5217
   868
            | OR ('a bexp) ('a bexp)
wenzelm@5217
   869
paulson@5267
   870
as well as indirectly recursive datatypes such as
berghofe@5214
   871
wenzelm@5217
   872
  datatype
wenzelm@5217
   873
    ('a, 'b) term = Var 'a
wenzelm@5217
   874
                  | App 'b ((('a, 'b) term) list)
berghofe@5214
   875
wenzelm@5217
   876
The new tactic  mutual_induct_tac [<var_1>, ..., <var_n>] i  performs
wenzelm@5217
   877
induction on mutually / indirectly recursive datatypes.
wenzelm@5217
   878
wenzelm@5217
   879
Primrec equations are now stored in theory and can be accessed via
wenzelm@5217
   880
<function_name>.simps.
wenzelm@5217
   881
wenzelm@5217
   882
INCOMPATIBILITIES:
berghofe@5214
   883
wenzelm@5217
   884
  - Theories using datatypes must now have theory Datatype as an
wenzelm@5217
   885
    ancestor.
wenzelm@5217
   886
  - The specific <typename>.induct_tac no longer exists - use the
wenzelm@5217
   887
    generic induct_tac instead.
berghofe@5226
   888
  - natE has been renamed to nat.exhaust - use exhaust_tac
wenzelm@5217
   889
    instead of res_inst_tac ... natE. Note that the variable
berghofe@5226
   890
    names in nat.exhaust differ from the names in natE, this
wenzelm@5217
   891
    may cause some "fragile" proofs to fail.
wenzelm@5217
   892
  - The theorems split_<typename>_case and split_<typename>_case_asm
wenzelm@5217
   893
    have been renamed to <typename>.split and <typename>.split_asm.
wenzelm@5217
   894
  - Since default sorts of type variables are now handled correctly,
wenzelm@5217
   895
    some datatype definitions may have to be annotated with explicit
wenzelm@5217
   896
    sort constraints.
wenzelm@5217
   897
  - Primrec definitions no longer require function name and type
wenzelm@5217
   898
    of recursive argument.
berghofe@5214
   899
wenzelm@5217
   900
Consider using isatool fixdatatype to adapt your theories and proof
wenzelm@5217
   901
scripts to the new package (backup your sources first!).
wenzelm@5217
   902
wenzelm@5217
   903
wenzelm@5726
   904
* HOL/record package: considerably improved implementation; now
wenzelm@5726
   905
includes concrete syntax for record types, terms, updates; theorems
wenzelm@5726
   906
for surjective pairing and splitting !!-bound record variables; proof
wenzelm@5726
   907
support is as follows:
wenzelm@5726
   908
wenzelm@5726
   909
  1) standard conversions (selectors or updates applied to record
wenzelm@5726
   910
constructor terms) are part of the standard simpset;
wenzelm@5726
   911
wenzelm@5726
   912
  2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
wenzelm@5726
   913
made part of standard simpset and claset via addIffs;
wenzelm@5726
   914
wenzelm@5726
   915
  3) a tactic for record field splitting (record_split_tac) is part of
wenzelm@5726
   916
the standard claset (addSWrapper);
wenzelm@5726
   917
wenzelm@5726
   918
To get a better idea about these rules you may retrieve them via
wenzelm@5726
   919
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
wenzelm@5726
   920
the name of your record type.
wenzelm@5726
   921
wenzelm@5726
   922
The split tactic 3) conceptually simplifies by the following rule:
wenzelm@5726
   923
wenzelm@5726
   924
  "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
wenzelm@5726
   925
wenzelm@5726
   926
Thus any record variable that is bound by meta-all will automatically
wenzelm@5726
   927
blow up into some record constructor term, consequently the
wenzelm@5726
   928
simplifications of 1), 2) apply.  Thus force_tac, auto_tac etc. shall
wenzelm@5726
   929
solve record problems automatically.
wenzelm@5726
   930
berghofe@5214
   931
wenzelm@5125
   932
* reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125
   933
default; theory Main includes everything;
wenzelm@5125
   934
paulson@5650
   935
* automatic simplification of integer sums and comparisons, using cancellation;
paulson@5650
   936
oheimb@5526
   937
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
wenzelm@5127
   938
wenzelm@5127
   939
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5127
   940
wenzelm@5127
   941
* many new identities for unions, intersections, set difference, etc.;
wenzelm@5127
   942
wenzelm@5127
   943
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127
   944
called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127
   945
with add/delsplits);
wenzelm@5125
   946
wenzelm@5127
   947
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127
   948
(?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127
   949
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5207
   950
'Delsimprocs [unit_eq_proc];' as last resort); also note that
wenzelm@5207
   951
unit_abs_eta_conv is added in order to counter the effect of
wenzelm@5207
   952
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
wenzelm@5207
   953
%u.f();
wenzelm@5125
   954
wenzelm@5217
   955
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
wenzelm@5217
   956
makes more sense);
berghofe@5109
   957
paulson@5475
   958
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
   959
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
   960
  disjointness reasoning but breaking a few old proofs.
paulson@5267
   961
wenzelm@5217
   962
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
wenzelm@5217
   963
to 'converse' from 'inverse' (for compatibility with ZF and some
wenzelm@5217
   964
literature);
wenzelm@5085
   965
wenzelm@5127
   966
* HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127
   967
the well-founded relation;
oheimb@4838
   968
paulson@5490
   969
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
paulson@5490
   970
    Compl A.  The "Compl" syntax remains available as input syntax for this
paulson@5490
   971
    release ONLY.
paulson@5490
   972
wenzelm@5127
   973
* HOL/Update: new theory of function updates:
wenzelm@5127
   974
    f(a:=b) == %x. if x=a then b else f x
wenzelm@5127
   975
may also be iterated as in f(a:=b,c:=d,...);
nipkow@5077
   976
wenzelm@5127
   977
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899
   978
nipkow@5282
   979
* HOL/List:
nipkow@5282
   980
  - new function list_update written xs[i:=v] that updates the i-th
nipkow@5282
   981
    list position. May also be iterated as in xs[i:=a,j:=b,...].
nipkow@5428
   982
  - new function `upt' written [i..j(] which generates the list
nipkow@5428
   983
    [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
nipkow@5428
   984
    bound write [i..j], which is a shorthand for [i..j+1(].
nipkow@5282
   985
  - new lexicographic orderings and corresponding wellfoundedness theorems.
paulson@4779
   986
wenzelm@5127
   987
* HOL/Arith:
wenzelm@5127
   988
  - removed 'pred' (predecessor) function;
wenzelm@5127
   989
  - generalized some theorems about n-1;
wenzelm@5127
   990
  - many new laws about "div" and "mod";
wenzelm@5127
   991
  - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766
   992
wenzelm@5127
   993
* HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842
   994
instead of "inverse";
wenzelm@4711
   995
nipkow@5651
   996
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
nipkow@5651
   997
  of the multiset ordering;
nipkow@5651
   998
wenzelm@5127
   999
* directory HOL/Real: a construction of the reals using Dedekind cuts
nipkow@5651
  1000
  (not included by default);
nipkow@4835
  1001
wenzelm@5127
  1002
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711
  1003
nipkow@5651
  1004
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
nipkow@5651
  1005
  programs, i.e. different program variables may have different types.
nipkow@5651
  1006
paulson@5142
  1007
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  1008
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  1009
  Now rew can involve either definitions or equalities (either == or =).
wenzelm@5002
  1010
wenzelm@5363
  1011
paulson@4879
  1012
*** ZF ***
paulson@4879
  1013
paulson@5332
  1014
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
paulson@5332
  1015
  only the theorems proved on ZF.ML;
paulson@5160
  1016
paulson@5475
  1017
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  1018
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  1019
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  1020
paulson@5160
  1021
* ZF/Update: new theory of function updates
paulson@5160
  1022
    with default rewrite rule  f(x:=y) ` z = if(z=x, y, f`z)
paulson@5160
  1023
  may also be iterated as in f(a:=b,c:=d,...);
paulson@5160
  1024
paulson@4879
  1025
* in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649
  1026
paulson@5142
  1027
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  1028
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  1029
  Now rew can involve either definitions or equalities (either == or =).
paulson@5142
  1030
paulson@5160
  1031
* case_tac provided for compatibility with HOL
paulson@5160
  1032
    (like the old excluded_middle_tac, but with subgoals swapped)
paulson@5160
  1033
wenzelm@4842
  1034
wenzelm@5127
  1035
*** Internal programming interfaces ***
wenzelm@5002
  1036
wenzelm@5251
  1037
* Pure: several new basic modules made available for general use, see
wenzelm@5251
  1038
also src/Pure/README;
wenzelm@5207
  1039
wenzelm@5008
  1040
* improved the theory data mechanism to support encapsulation (data
wenzelm@5008
  1041
kind name replaced by private Object.kind, acting as authorization
wenzelm@5373
  1042
key); new type-safe user interface via functor TheoryDataFun; generic
wenzelm@5373
  1043
print_data function becomes basically useless;
wenzelm@5002
  1044
wenzelm@5251
  1045
* removed global_names compatibility flag -- all theory declarations
wenzelm@5251
  1046
are qualified by default;
wenzelm@5251
  1047
wenzelm@5085
  1048
* module Pure/Syntax now offers quote / antiquote translation
wenzelm@5085
  1049
functions (useful for Hoare logic etc. with implicit dependencies);
wenzelm@5373
  1050
see HOL/ex/Antiquote for an example use;
wenzelm@5085
  1051
wenzelm@5127
  1052
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
wenzelm@5127
  1053
cterm -> thm;
wenzelm@5127
  1054
wenzelm@5207
  1055
* new tactical CHANGED_GOAL for checking that a tactic modifies a
wenzelm@5207
  1056
subgoal;
paulson@5142
  1057
wenzelm@5251
  1058
* Display.print_goals function moved to Locale.print_goals;
wenzelm@5251
  1059
wenzelm@5731
  1060
* standard print function for goals supports current_goals_markers
wenzelm@5731
  1061
variable for marking begin of proof, end of proof, start of goal; the
wenzelm@5731
  1062
default is ("", "", ""); setting current_goals_markers := ("<proof>",
wenzelm@5731
  1063
"</proof>", "<goal>") causes SGML like tagged proof state printing,
wenzelm@5731
  1064
for example;
wenzelm@5731
  1065
wenzelm@5002
  1066
wenzelm@5002
  1067
wenzelm@4410
  1068
New in Isabelle98 (January 1998)
wenzelm@4410
  1069
--------------------------------
wenzelm@4410
  1070
wenzelm@4410
  1071
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4410
  1072
wenzelm@4410
  1073
* changed lexical syntax of terms / types: dots made part of long
wenzelm@4410
  1074
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
wenzelm@4410
  1075
wenzelm@4410
  1076
* simpset (and claset) reference variable replaced by functions
wenzelm@4410
  1077
simpset / simpset_ref;
wenzelm@4410
  1078
wenzelm@4410
  1079
* no longer supports theory aliases (via merge) and non-trivial
wenzelm@4410
  1080
implicit merge of thms' signatures;
wenzelm@4410
  1081
wenzelm@4410
  1082
* most internal names of constants changed due to qualified names;
wenzelm@4410
  1083
wenzelm@4410
  1084
* changed Pure/Sequence interface (see Pure/seq.ML);
wenzelm@4410
  1085
wenzelm@3454
  1086
paulson@3715
  1087
*** General Changes ***
paulson@3715
  1088
wenzelm@4174
  1089
* hierachically structured name spaces (for consts, types, axms, thms
wenzelm@3943
  1090
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
wenzelm@4108
  1091
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
wenzelm@4108
  1092
isatool fixdots ensures space after dots (e.g. "%x. x"); set
wenzelm@4174
  1093
long_names for fully qualified output names; NOTE: ML programs
wenzelm@4174
  1094
(special tactics, packages etc.) referring to internal names may have
wenzelm@4174
  1095
to be adapted to cope with fully qualified names; in case of severe
wenzelm@4174
  1096
backward campatibility problems try setting 'global_names' at compile
wenzelm@4174
  1097
time to have enrything declared within a flat name space; one may also
wenzelm@4174
  1098
fine tune name declarations in theories via the 'global' and 'local'
wenzelm@4174
  1099
section;
wenzelm@4108
  1100
wenzelm@4108
  1101
* reimplemented the implicit simpset and claset using the new anytype
wenzelm@4108
  1102
data filed in signatures; references simpset:simpset ref etc. are
wenzelm@4108
  1103
replaced by functions simpset:unit->simpset and
wenzelm@4108
  1104
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
wenzelm@4108
  1105
to patch your ML files accordingly;
paulson@3856
  1106
wenzelm@3857
  1107
* HTML output now includes theory graph data for display with Java
wenzelm@3857
  1108
applet or isatool browser; data generated automatically via isatool
wenzelm@3901
  1109
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
wenzelm@3857
  1110
paulson@3856
  1111
* defs may now be conditional; improved rewrite_goals_tac to handle
paulson@3856
  1112
conditional equations;
paulson@3856
  1113
wenzelm@4174
  1114
* defs now admits additional type arguments, using TYPE('a) syntax;
wenzelm@4174
  1115
wenzelm@3901
  1116
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
wenzelm@3901
  1117
creates a new theory node; implicit merge of thms' signatures is
wenzelm@4112
  1118
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
wenzelm@3901
  1119
transfer:theory->thm->thm in (rare) cases;
wenzelm@3901
  1120
wenzelm@3968
  1121
* improved handling of draft signatures / theories; draft thms (and
wenzelm@3968
  1122
ctyps, cterms) are automatically promoted to real ones;
wenzelm@3968
  1123
wenzelm@3901
  1124
* slightly changed interfaces for oracles: admit many per theory, named
wenzelm@3901
  1125
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
wenzelm@3901
  1126
wenzelm@3901
  1127
* print_goals: optional output of const types (set show_consts and
wenzelm@3901
  1128
show_types);
wenzelm@3851
  1129
wenzelm@4388
  1130
* improved output of warnings (###) and errors (***);
wenzelm@3697
  1131
paulson@4178
  1132
* subgoal_tac displays a warning if the new subgoal has type variables;
paulson@4178
  1133
paulson@3715
  1134
* removed old README and Makefiles;
wenzelm@3697
  1135
paulson@3856
  1136
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
wenzelm@3670
  1137
paulson@3715
  1138
* removed obsolete init_pps and init_database;
paulson@3715
  1139
paulson@3715
  1140
* deleted the obsolete tactical STATE, which was declared by
paulson@3715
  1141
    fun STATE tacfun st = tacfun st st;
paulson@3715
  1142
wenzelm@4388
  1143
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
wenzelm@4388
  1144
(which abbreviates $HOME);
wenzelm@4269
  1145
wenzelm@4269
  1146
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
wenzelm@4269
  1147
use isatool fixseq to adapt your ML programs (this works for fully
wenzelm@4269
  1148
qualified references to the Sequence structure only!);
wenzelm@4269
  1149
wenzelm@4381
  1150
* use_thy no longer requires writable current directory; it always
wenzelm@4381
  1151
reloads .ML *and* .thy file, if either one is out of date;
wenzelm@4269
  1152
paulson@3715
  1153
paulson@3715
  1154
*** Classical Reasoner ***
paulson@3715
  1155
wenzelm@3744
  1156
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
wenzelm@3744
  1157
tactics that use classical reasoning to simplify a subgoal without
wenzelm@3744
  1158
splitting it into several subgoals;
paulson@3715
  1159
paulson@3719
  1160
* Safe_tac: like safe_tac but uses the default claset;
paulson@3719
  1161
paulson@3715
  1162
paulson@3715
  1163
*** Simplifier ***
paulson@3715
  1164
paulson@3715
  1165
* added simplification meta rules:
paulson@3715
  1166
    (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3715
  1167
paulson@3715
  1168
* simplifier.ML no longer part of Pure -- has to be loaded by object
paulson@3715
  1169
logics (again);
paulson@3715
  1170
paulson@3715
  1171
* added prems argument to simplification procedures;
paulson@3715
  1172
paulson@4325
  1173
* HOL, FOL, ZF: added infix function `addsplits':
paulson@4325
  1174
  instead of `<simpset> setloop (split_tac <thms>)'
paulson@4325
  1175
  you can simply write `<simpset> addsplits <thms>'
paulson@4325
  1176
paulson@3715
  1177
paulson@3715
  1178
*** Syntax ***
paulson@3715
  1179
wenzelm@4174
  1180
* TYPE('a) syntax for type reflection terms;
wenzelm@4174
  1181
wenzelm@3985
  1182
* no longer handles consts with name "" -- declare as 'syntax' instead;
paulson@3856
  1183
paulson@3856
  1184
* pretty printer: changed order of mixfix annotation preference (again!);
wenzelm@3846
  1185
paulson@3715
  1186
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
paulson@3715
  1187
paulson@3715
  1188
paulson@3715
  1189
*** HOL ***
paulson@3715
  1190
wenzelm@5726
  1191
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  1192
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  1193
nipkow@4035
  1194
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
wenzelm@3985
  1195
wenzelm@3985
  1196
* HOL/Auth: new protocol proofs including some for the Internet
nipkow@4035
  1197
  protocol TLS;
wenzelm@3985
  1198
wenzelm@4125
  1199
* HOL/Map: new theory of `maps' a la VDM;
nipkow@3982
  1200
wenzelm@4335
  1201
* HOL/simplifier: simplification procedures nat_cancel_sums for
wenzelm@4335
  1202
cancelling out common nat summands from =, <, <= (in)equalities, or
wenzelm@4335
  1203
differences; simplification procedures nat_cancel_factor for
wenzelm@4335
  1204
cancelling common factor from =, <, <= (in)equalities over natural
wenzelm@4373
  1205
sums; nat_cancel contains both kinds of procedures, it is installed by
wenzelm@4373
  1206
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
wenzelm@4335
  1207
nipkow@3580
  1208
* HOL/simplifier: terms of the form
paulson@4325
  1209
  `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)'  (or t=x)
nipkow@3580
  1210
  are rewritten to
nipkow@4035
  1211
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
nipkow@4035
  1212
  and those of the form
paulson@4325
  1213
  `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)'  (or t=x)
nipkow@4035
  1214
  are rewritten to
nipkow@4035
  1215
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
nipkow@4035
  1216
nipkow@4035
  1217
* HOL/datatype
nipkow@4035
  1218
  Each datatype `t' now comes with a theorem `split_t_case' of the form
nipkow@3580
  1219
nipkow@4035
  1220
  P(t_case f1 ... fn x) =
nipkow@4035
  1221
     ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
nipkow@4035
  1222
        ...
oheimb@4189
  1223
       (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
nipkow@4035
  1224
     )
nipkow@4035
  1225
oheimb@4930
  1226
  and a theorem `split_t_case_asm' of the form
oheimb@4189
  1227
oheimb@4189
  1228
  P(t_case f1 ... fn x) =
oheimb@4189
  1229
    ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
oheimb@4189
  1230
        ...
oheimb@4189
  1231
       (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
oheimb@4189
  1232
     )
oheimb@4930
  1233
  which can be added to a simpset via `addsplits'. The existing theorems
oheimb@4930
  1234
  expand_list_case and expand_option_case have been renamed to
oheimb@4930
  1235
  split_list_case and split_option_case.
oheimb@4189
  1236
nipkow@4361
  1237
* HOL/Arithmetic:
nipkow@4361
  1238
  - `pred n' is automatically converted to `n-1'.
nipkow@4361
  1239
    Users are strongly encouraged not to use `pred' any longer,
nipkow@4361
  1240
    because it will disappear altogether at some point.
nipkow@4361
  1241
  - Users are strongly encouraged to write "0 < n" rather than
nipkow@4361
  1242
    "n ~= 0". Theorems and proof tools have been modified towards this
nipkow@4361
  1243
    `standard'.
nipkow@4357
  1244
nipkow@4502
  1245
* HOL/Lists:
nipkow@4502
  1246
  the function "set_of_list" has been renamed "set" (and its theorems too);
nipkow@4502
  1247
  the function "nth" now takes its arguments in the reverse order and
nipkow@4502
  1248
  has acquired the infix notation "!" as in "xs!n".
paulson@3570
  1249
paulson@4154
  1250
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
paulson@4154
  1251
paulson@4154
  1252
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
paulson@4154
  1253
  specialist theorems (like UN1_I) are gone.  Similarly for (INT x.B x);
paulson@4154
  1254
wenzelm@4575
  1255
* HOL/record: extensible records with schematic structural subtyping
wenzelm@4575
  1256
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
wenzelm@4575
  1257
still lacks various theorems and concrete record syntax;
wenzelm@4575
  1258
wenzelm@4125
  1259
paulson@3715
  1260
*** HOLCF ***
wenzelm@3535
  1261
wenzelm@4125
  1262
* removed "axioms" and "generated by" sections;
wenzelm@4125
  1263
oheimb@4123
  1264
* replaced "ops" section by extended "consts" section, which is capable of
wenzelm@4125
  1265
  handling the continuous function space "->" directly;
wenzelm@4125
  1266
wenzelm@4125
  1267
* domain package:
wenzelm@4125
  1268
  . proves theorems immediately and stores them in the theory,
wenzelm@4125
  1269
  . creates hierachical name space,
wenzelm@4125
  1270
  . now uses normal mixfix annotations (instead of cinfix...),
wenzelm@4125
  1271
  . minor changes to some names and values (for consistency),
wenzelm@4125
  1272
  . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
wenzelm@4125
  1273
  . separator between mutual domain defs: changed "," to "and",
wenzelm@4125
  1274
  . improved handling of sort constraints;  now they have to
wenzelm@4125
  1275
    appear on the left-hand side of the equations only;
oheimb@4123
  1276
oheimb@4123
  1277
* fixed LAM <x,y,zs>.b syntax;
wenzelm@3567
  1278
wenzelm@3744
  1279
* added extended adm_tac to simplifier in HOLCF -- can now discharge
wenzelm@3744
  1280
adm (%x. P (t x)), where P is chainfinite and t continuous;
wenzelm@3579
  1281
wenzelm@3579
  1282
paulson@3719
  1283
*** FOL and ZF ***
paulson@3719
  1284
wenzelm@5726
  1285
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  1286
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  1287
wenzelm@3744
  1288
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
wenzelm@3744
  1289
in HOL, they strip ALL and --> from proved theorems;
wenzelm@3744
  1290
paulson@3719
  1291
wenzelm@3579
  1292
wenzelm@3006
  1293
New in Isabelle94-8 (May 1997)
wenzelm@3006
  1294
------------------------------
wenzelm@2654
  1295
paulson@3002
  1296
*** General Changes ***
paulson@3002
  1297
paulson@3002
  1298
* new utilities to build / run / maintain Isabelle etc. (in parts
paulson@3002
  1299
still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2971
  1300
wenzelm@3205
  1301
* new 'Isabelle System Manual';
wenzelm@3205
  1302
wenzelm@2825
  1303
* INSTALL text, together with ./configure and ./build scripts;
wenzelm@2773
  1304
wenzelm@3006
  1305
* reimplemented type inference for greater efficiency, better error
wenzelm@3006
  1306
messages and clean internal interface;
paulson@3002
  1307
paulson@3002
  1308
* prlim command for dealing with lots of subgoals (an easier way of
paulson@3002
  1309
setting goals_limit);
paulson@3002
  1310
wenzelm@3006
  1311
wenzelm@3006
  1312
*** Syntax ***
paulson@3002
  1313
wenzelm@3116
  1314
* supports alternative (named) syntax tables (parser and pretty
wenzelm@3116
  1315
printer); internal interface is provided by add_modesyntax(_i);
wenzelm@3116
  1316
paulson@3002
  1317
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
paulson@3002
  1318
be used in conjunction with the Isabelle symbol font; uses the
paulson@3002
  1319
"symbols" syntax table;
paulson@3002
  1320
wenzelm@2705
  1321
* added token_translation interface (may translate name tokens in
wenzelm@2756
  1322
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
wenzelm@3116
  1323
the current print_mode); IMPORTANT: user print translation functions
wenzelm@3116
  1324
are responsible for marking newly introduced bounds
wenzelm@3116
  1325
(Syntax.mark_boundT);
wenzelm@2705
  1326
wenzelm@2730
  1327
* token translations for modes "xterm" and "xterm_color" that display
wenzelm@3006
  1328
names in bold, underline etc. or colors (which requires a color
wenzelm@3006
  1329
version of xterm);
wenzelm@2730
  1330
paulson@3002
  1331
* infixes may now be declared with names independent of their syntax;
paulson@3002
  1332
paulson@3002
  1333
* added typed_print_translation (like print_translation, but may
paulson@3002
  1334
access type of constant);
paulson@3002
  1335
wenzelm@3006
  1336
paulson@3002
  1337
*** Classical Reasoner ***
paulson@3002
  1338
paulson@3002
  1339
Blast_tac: a new tactic!  It is often more powerful than fast_tac, but has
paulson@3002
  1340
some limitations.  Blast_tac...
paulson@3002
  1341
  + ignores addss, addbefore, addafter; this restriction is intrinsic
paulson@3002
  1342
  + ignores elimination rules that don't have the correct format
wenzelm@5726
  1343
        (the conclusion MUST be a formula variable)
paulson@3002
  1344
  + ignores types, which can make HOL proofs fail
paulson@3002
  1345
  + rules must not require higher-order unification, e.g. apply_type in ZF
paulson@3002
  1346
    [message "Function Var's argument not a bound variable" relates to this]
paulson@3002
  1347
  + its proof strategy is more general but can actually be slower
paulson@3002
  1348
wenzelm@3107
  1349
* substitution with equality assumptions no longer permutes other
wenzelm@3107
  1350
assumptions;
paulson@3002
  1351
paulson@3002
  1352
* minor changes in semantics of addafter (now called addaltern); renamed
paulson@3002
  1353
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
wenzelm@3107
  1354
(and access functions for it);
paulson@3002
  1355
wenzelm@5726
  1356
* improved combination of classical reasoner and simplifier:
oheimb@3317
  1357
  + functions for handling clasimpsets
oheimb@3317
  1358
  + improvement of addss: now the simplifier is called _after_ the
oheimb@3317
  1359
    safe steps.
oheimb@3317
  1360
  + safe variant of addss called addSss: uses safe simplifications
wenzelm@5726
  1361
    _during_ the safe steps. It is more complete as it allows multiple
oheimb@3317
  1362
    instantiations of unknowns (e.g. with slow_tac).
wenzelm@3006
  1363
paulson@3002
  1364
*** Simplifier ***
paulson@3002
  1365
wenzelm@3006
  1366
* added interface for simplification procedures (functions that
wenzelm@3006
  1367
produce *proven* rewrite rules on the fly, depending on current
wenzelm@3006
  1368
redex);
wenzelm@3006
  1369
wenzelm@3006
  1370
* ordering on terms as parameter (used for ordered rewriting);
wenzelm@3006
  1371
wenzelm@3107
  1372
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
paulson@3002
  1373
paulson@3002
  1374
* the solver is now split into a safe and an unsafe part.
paulson@3002
  1375
This should be invisible for the normal user, except that the
paulson@3002
  1376
functions setsolver and addsolver have been renamed to setSolver and
wenzelm@3107
  1377
addSolver; added safe_asm_full_simp_tac;
paulson@3002
  1378
paulson@3002
  1379
paulson@3002
  1380
*** HOL ***
paulson@3002
  1381
nipkow@3042
  1382
* a generic induction tactic `induct_tac' which works for all datatypes and
wenzelm@3107
  1383
also for type `nat';
nipkow@3042
  1384
nipkow@3316
  1385
* a generic case distinction tactic `exhaust_tac' which works for all
nipkow@3316
  1386
datatypes and also for type `nat';
nipkow@3316
  1387
nipkow@3316
  1388
* each datatype comes with a function `size';
nipkow@3316
  1389
paulson@3002
  1390
* patterns in case expressions allow tuple patterns as arguments to
wenzelm@3107
  1391
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
paulson@3002
  1392
paulson@3002
  1393
* primrec now also works with type nat;
paulson@3002
  1394
paulson@3338
  1395
* recdef: a new declaration form, allows general recursive functions to be
paulson@3338
  1396
defined in theory files.  See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
paulson@3338
  1397
paulson@3002
  1398
* the constant for negation has been renamed from "not" to "Not" to
wenzelm@3107
  1399
harmonize with FOL, ZF, LK, etc.;
paulson@3002
  1400
wenzelm@3107
  1401
* HOL/ex/LFilter theory of a corecursive "filter" functional for
wenzelm@3107
  1402
infinite lists;
paulson@3002
  1403
wenzelm@3227
  1404
* HOL/Modelcheck demonstrates invocation of model checker oracle;
wenzelm@3227
  1405
paulson@3002
  1406
* HOL/ex/Ring.thy declares cring_simp, which solves equational
paulson@3002
  1407
problems in commutative rings, using axiomatic type classes for + and *;
paulson@3002
  1408
paulson@3002
  1409
* more examples in HOL/MiniML and HOL/Auth;
paulson@3002
  1410
paulson@3002
  1411
* more default rewrite rules for quantifiers, union/intersection;
paulson@3002
  1412
nipkow@3321
  1413
* a new constant `arbitrary == @x.False';
nipkow@3321
  1414
wenzelm@3107
  1415
* HOLCF/IOA replaces old HOL/IOA;
wenzelm@3107
  1416
wenzelm@5726
  1417
* HOLCF changes: derived all rules and arities
wenzelm@5726
  1418
  + axiomatic type classes instead of classes
slotosch@2653
  1419
  + typedef instead of faking type definitions
paulson@2747
  1420
  + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
wenzelm@2730
  1421
  + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
slotosch@2653
  1422
  + eliminated the types void, one, tr
slotosch@2653
  1423
  + use unit lift and bool lift (with translations) instead of one and tr
slotosch@2653
  1424
  + eliminated blift from Lift3.thy (use Def instead of blift)
wenzelm@3107
  1425
  all eliminated rules are derived as theorems --> no visible changes ;
oheimb@2649
  1426
wenzelm@3006
  1427
paulson@3002
  1428
*** ZF ***
wenzelm@2553
  1429
paulson@2865
  1430
* ZF now has Fast_tac, Simp_tac and Auto_tac.  Union_iff is a now a default
paulson@2865
  1431
rewrite rule; this may affect some proofs.  eq_cs is gone but can be put back
paulson@2865
  1432
as ZF_cs addSIs [equalityI];
wenzelm@2553
  1433
wenzelm@2554
  1434
wenzelm@2732
  1435
wenzelm@2553
  1436
New in Isabelle94-7 (November 96)
wenzelm@2553
  1437
---------------------------------
wenzelm@2553
  1438
wenzelm@2553
  1439
* allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553
  1440
wenzelm@2554
  1441
* super-linear speedup for large simplifications;
wenzelm@2554
  1442
wenzelm@2554
  1443
* FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554
  1444
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554
  1445
FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554
  1446
all_simps); De Morgan laws are also now included, by default;
wenzelm@2554
  1447
wenzelm@2554
  1448
* improved printing of ==>  :  ~:
wenzelm@2554
  1449
wenzelm@2554
  1450
* new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554
  1451
and Modal (thanks to Sara Kalvala);
wenzelm@2554
  1452
wenzelm@2554
  1453
* HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554
  1454
wenzelm@2554
  1455
* HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554
  1456
examples on HOL/Auth);
wenzelm@2554
  1457
wenzelm@2554
  1458
* HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554
  1459
the rewriter and classical reasoner simultaneously;
wenzelm@2554
  1460
wenzelm@2554
  1461
* function uresult no longer returns theorems in "standard" format;
wenzelm@2554
  1462
regain previous version by: val uresult = standard o uresult;
wenzelm@2554
  1463
wenzelm@2554
  1464
wenzelm@2554
  1465
wenzelm@2554
  1466
New in Isabelle94-6
wenzelm@2554
  1467
-------------------
wenzelm@2554
  1468
wenzelm@2554
  1469
* oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554
  1470
external reasoners, which may deliver results as theorems;
wenzelm@2554
  1471
wenzelm@2554
  1472
* proof objects (in particular record all uses of oracles);
wenzelm@2554
  1473
wenzelm@2554
  1474
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554
  1475
wenzelm@2554
  1476
* "constdefs" section in theory files;
wenzelm@2554
  1477
wenzelm@2554
  1478
* "primrec" section (HOL) no longer requires names;
wenzelm@2554
  1479
wenzelm@2554
  1480
* internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554
  1481
wenzelm@2554
  1482
wenzelm@2554
  1483
wenzelm@2554
  1484
New in Isabelle94-5
wenzelm@2554
  1485
-------------------
wenzelm@2554
  1486
wenzelm@2554
  1487
* reduced space requirements;
wenzelm@2554
  1488
wenzelm@2554
  1489
* automatic HTML generation from theories;
wenzelm@2554
  1490
wenzelm@2554
  1491
* theory files no longer require "..." (quotes) around most types;
wenzelm@2554
  1492
wenzelm@2554
  1493
* new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554
  1494
wenzelm@2554
  1495
* non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554
  1496
wenzelm@2553
  1497
paulson@2557
  1498
paulson@2557
  1499
New in Isabelle94-4
paulson@2557
  1500
-------------------
paulson@2557
  1501
paulson@2747
  1502
* greatly reduced space requirements;
paulson@2557
  1503
paulson@2557
  1504
* theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557
  1505
wenzelm@5726
  1506
* searchable theorem database (see the section "Retrieving theorems" on
paulson@2557
  1507
page 8 of the Reference Manual);
paulson@2557
  1508
paulson@2557
  1509
* new examples, including Grabczewski's monumental case study of the
paulson@2557
  1510
Axiom of Choice;
paulson@2557
  1511
paulson@2557
  1512
* The previous version of HOL renamed to Old_HOL;
paulson@2557
  1513
wenzelm@5726
  1514
* The new version of HOL (previously called CHOL) uses a curried syntax
paulson@2557
  1515
for functions.  Application looks like f a b instead of f(a,b);
paulson@2557
  1516
paulson@2557
  1517
* Mutually recursive inductive definitions finally work in HOL;
paulson@2557
  1518
paulson@2557
  1519
* In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557
  1520
translates to the operator "split";
paulson@2557
  1521
paulson@2557
  1522
paulson@2557
  1523
paulson@2557
  1524
New in Isabelle94-3
paulson@2557
  1525
-------------------
paulson@2557
  1526
wenzelm@5726
  1527
* new infix operator, addss, allowing the classical reasoner to
paulson@2557
  1528
perform simplification at each step of its search.  Example:
wenzelm@5726
  1529
        fast_tac (cs addss ss)
paulson@2557
  1530
wenzelm@5726
  1531
* a new logic, CHOL, the same as HOL, but with a curried syntax
wenzelm@5726
  1532
for functions.  Application looks like f a b instead of f(a,b).  Also pairs
paulson@2557
  1533
look like (a,b) instead of <a,b>;
paulson@2557
  1534
paulson@2557
  1535
* PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557
  1536
paulson@2557
  1537
* In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557
  1538
It translates to the operator "split".  A new theory of integers is available;
paulson@2557
  1539
paulson@2557
  1540
* In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557
  1541
Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
paulson@2557
  1542
wenzelm@5726
  1543
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
paulson@2557
  1544
of the Axiom of Choice;
paulson@2557
  1545
paulson@2557
  1546
paulson@2557
  1547
paulson@2557
  1548
New in Isabelle94-2
paulson@2557
  1549
-------------------
paulson@2557
  1550
wenzelm@5726
  1551
* Significantly faster resolution;
paulson@2557
  1552
paulson@2557
  1553
* the different sections in a .thy file can now be mixed and repeated
paulson@2557
  1554
freely;
paulson@2557
  1555
paulson@2557
  1556
* Database of theorems for FOL, HOL and ZF.  New
paulson@2557
  1557
commands including qed, qed_goal and bind_thm store theorems in the database.
paulson@2557
  1558
paulson@2557
  1559
* Simple database queries: return a named theorem (get_thm) or all theorems of
paulson@2557
  1560
a given theory (thms_of), or find out what theory a theorem was proved in
paulson@2557
  1561
(theory_of_thm);
paulson@2557
  1562
paulson@2557
  1563
* Bugs fixed in the inductive definition and datatype packages;
paulson@2557
  1564
paulson@2557
  1565
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
paulson@2557
  1566
and HOL_dup_cs obsolete;
paulson@2557
  1567
paulson@2557
  1568
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
paulson@2557
  1569
have been removed;
paulson@2557
  1570
paulson@2557
  1571
* Simpler definition of function space in ZF;
paulson@2557
  1572
paulson@2557
  1573
* new results about cardinal and ordinal arithmetic in ZF;
paulson@2557
  1574
paulson@2557
  1575
* 'subtype' facility in HOL for introducing new types as subsets of existing
paulson@2557
  1576
types;
paulson@2557
  1577
paulson@2557
  1578
wenzelm@2553
  1579
$Id$