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