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