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