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