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