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