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