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