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