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