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