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