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