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