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