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