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