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