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