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