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