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