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