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