NEWS
author wenzelm
Thu Jul 08 18:28:02 1999 +0200 (1999-07-08)
changeset 6925 8d4d45ec6a3d
parent 6922 f5c5b81b3f14
child 7047 d103b875ef1d
permissions -rw-r--r--
theorems involving oracles are now printed with a suffixed [!];
wenzelm@6420
     1
wenzelm@5363
     2
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     3
==============================================
wenzelm@2553
     4
wenzelm@4981
     5
New in this Isabelle version
wenzelm@4981
     6
----------------------------
oheimb@4649
     7
paulson@5931
     8
*** Overview of INCOMPATIBILITIES (see below for more details) ***
paulson@5931
     9
paulson@6922
    10
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
paulson@6922
    11
are no longer simplified.  (This allows the simplifier to unfold recursive
paulson@6922
    12
functional programs.)  To restore the old behaviour, declare
paulson@6922
    13
	Delcongs [if_weak_cong];
paulson@6922
    14
wenzelm@6269
    15
* HOL: Removed the obsolete syntax "Compl A"; use -A for set
wenzelm@6269
    16
complement;
paulson@5931
    17
wenzelm@6269
    18
* HOL: the predicate "inj" is now defined by translation to "inj_on";
paulson@6174
    19
wenzelm@6386
    20
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
    21
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
    22
wenzelm@6269
    23
* ZF: The con_defs part of an inductive definition may no longer refer
wenzelm@6269
    24
to constants declared in the same theory;
nipkow@6057
    25
wenzelm@6269
    26
* HOL, ZF: the function mk_cases, generated by the inductive
wenzelm@6269
    27
definition package, has lost an argument.  To simplify its result, it
wenzelm@6269
    28
uses the default simpset instead of a supplied list of theorems.
paulson@6141
    29
nipkow@6057
    30
paulson@6069
    31
*** Proof tools ***
paulson@6069
    32
wenzelm@6343
    33
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a
wenzelm@6343
    34
decision procedure for linear arithmetic. Currently it is used for
wenzelm@6343
    35
types `nat' and `int' in HOL (see below) but can, should and will be
wenzelm@6343
    36
instantiated for other types and logics as well.
paulson@6069
    37
paulson@6069
    38
paulson@6014
    39
*** General ***
paulson@6014
    40
wenzelm@6751
    41
* Isabelle manuals now also available as PDF;
wenzelm@6751
    42
wenzelm@6671
    43
* improved browser info generation: better HTML markup (including
wenzelm@6671
    44
colors), graph views in several sizes; isatool usedir now provides a
wenzelm@6671
    45
proper interface for user theories (via -P option);
wenzelm@6671
    46
wenzelm@6449
    47
* theory loader rewritten from scratch (may not be fully
wenzelm@6449
    48
bug-compatible); old loadpath variable has been replaced by show_path,
wenzelm@6671
    49
add_path, del_path, reset_path functions; new operations such as
wenzelm@6671
    50
update_thy, touch_thy, remove_thy (see also isatool doc ref);
wenzelm@6449
    51
wenzelm@6343
    52
* in locales, the "assumes" and "defines" parts may be omitted if
wenzelm@6343
    53
empty;
wenzelm@5973
    54
wenzelm@6269
    55
* new print_mode "xsymbols" for extended symbol support (e.g. genuine
wenzelm@6269
    56
long arrows);
wenzelm@6259
    57
wenzelm@6343
    58
* new print_mode "HTML";
wenzelm@6343
    59
wenzelm@6259
    60
* path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm@6259
    61
wenzelm@6343
    62
* new flag show_tags controls display of tags of theorems (which are
wenzelm@6343
    63
basically just comments that may be attached by some tools);
wenzelm@6343
    64
wenzelm@6420
    65
* improved isatool install: option -k creates KDE application icon,
wenzelm@6420
    66
option -p DIR installs standalone binaries;
wenzelm@6415
    67
wenzelm@6413
    68
* added ML_PLATFORM setting (useful for cross-platform installations);
wenzelm@6671
    69
more robust handling of platform specific ML images for SML/NJ;
wenzelm@6413
    70
wenzelm@6461
    71
* Isamode 2.6 requires patch to accomodate change of Isabelle font
wenzelm@6461
    72
mode and goal output format:
wenzelm@6461
    73
wenzelm@6461
    74
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
wenzelm@6461
    75
244c244
wenzelm@6461
    76
<       (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
wenzelm@6461
    77
---
wenzelm@6533
    78
>       (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
wenzelm@6461
    79
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
wenzelm@6461
    80
181c181
wenzelm@6461
    81
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
wenzelm@6461
    82
---
wenzelm@6461
    83
> (defconst proofstate-proofstart-regexp "^Level [0-9]+"
wenzelm@6461
    84
oheimb@6028
    85
nipkow@6057
    86
*** HOL ***
nipkow@6057
    87
wenzelm@6343
    88
* There are now decision procedures for linear arithmetic over nat and
wenzelm@6343
    89
int:
nipkow@6131
    90
wenzelm@6343
    91
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
wenzelm@6343
    92
`+', `-', `Suc', `min', `max' and numerical constants; other subterms
wenzelm@6343
    93
are treated as atomic; subformulae not involving type `nat' or `int'
wenzelm@6343
    94
are ignored; quantified subformulae are ignored unless they are
wenzelm@6343
    95
positive universal or negative existential. The tactic has to be
wenzelm@6343
    96
invoked by hand and can be a little bit slow. In particular, the
wenzelm@6343
    97
running time is exponential in the number of occurrences of `min' and
wenzelm@6343
    98
`max', and `-' on `nat'.
nipkow@6131
    99
wenzelm@6343
   100
2. fast_arith_tac is a cut-down version of arith_tac: it only takes
wenzelm@6343
   101
(negated) (in)equalities among the premises and the conclusion into
wenzelm@6343
   102
account (i.e. no compound formulae) and does not know about `min' and
wenzelm@6343
   103
`max', and `-' on `nat'. It is fast and is used automatically by the
wenzelm@6343
   104
simplifier.
nipkow@6131
   105
wenzelm@6343
   106
NB: At the moment, these decision procedures do not cope with mixed
wenzelm@6343
   107
nat/int formulae where the two parts interact, such as `m < n ==>
wenzelm@6343
   108
int(m) < int(n)'.
oheimb@6028
   109
paulson@6922
   110
* Integer division and remainder can now be performed on constant arguments.  
paulson@6922
   111
paulson@6922
   112
* Many properties of integer multiplication, division and remainder are now
paulson@6922
   113
available.
paulson@6922
   114
nipkow@6403
   115
* New bounded quantifier syntax (input only):
nipkow@6403
   116
  ! x < y. P, ! x <= y. P, ? x < y. P, ? x <= y. P
nipkow@6403
   117
wenzelm@6278
   118
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
wenzelm@6278
   119
-- avoids syntactic ambiguities and treats state, transition, and
wenzelm@6278
   120
temporal levels more uniformly; introduces INCOMPATIBILITIES due to
wenzelm@6278
   121
changed syntax and (many) tactics;
wenzelm@6278
   122
wenzelm@6386
   123
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
   124
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
   125
wenzelm@6671
   126
* HOL/recdef (TFL): requires theory Recdef; 'congs' syntax now expects
wenzelm@6671
   127
comma separated list of theorem names rather than an ML expression;
wenzelm@6563
   128
wenzelm@6795
   129
* reset HOL_quantifiers by default, i.e. quantifiers are printed as
wenzelm@6795
   130
ALL/EX rather than !/?;
wenzelm@6795
   131
wenzelm@6269
   132
paulson@6064
   133
*** ZF ***
paulson@6064
   134
paulson@6064
   135
* new primrec section allows primitive recursive functions to be given
wenzelm@6269
   136
directly (as in HOL) over datatypes and the natural numbers;
paulson@6064
   137
wenzelm@6269
   138
* new tactics induct_tac and exhaust_tac for induction (or case
wenzelm@6269
   139
analysis) over datatypes and the natural numbers;
paulson@6064
   140
paulson@6064
   141
* the datatype declaration of type T now defines the recursor T_rec;
paulson@6064
   142
paulson@6141
   143
* simplification automatically does freeness reasoning for datatype
wenzelm@6269
   144
constructors;
paulson@6141
   145
wenzelm@6269
   146
* automatic type-inference, with AddTCs command to insert new
wenzelm@6269
   147
type-checking rules;
paulson@6155
   148
wenzelm@6269
   149
* datatype introduction rules are now added as Safe Introduction rules
wenzelm@6269
   150
to the claset;
paulson@6155
   151
wenzelm@6269
   152
* the syntax "if P then x else y" is now available in addition to
wenzelm@6269
   153
if(P,x,y);
wenzelm@6269
   154
paulson@6069
   155
wenzelm@6343
   156
*** Internal programming interfaces ***
wenzelm@6343
   157
wenzelm@6386
   158
* AxClass.axclass_tac lost the theory argument;
wenzelm@6386
   159
wenzelm@6343
   160
* tuned current_goals_markers semantics: begin / end goal avoids
wenzelm@6343
   161
printing empty lines;
wenzelm@6343
   162
wenzelm@6343
   163
* removed prs and prs_fn hook, which was broken because it did not
wenzelm@6343
   164
include \n in its semantics, forcing writeln to add one
wenzelm@6343
   165
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
wenzelm@6343
   166
string -> unit if you really want to output text without newline;
wenzelm@6343
   167
wenzelm@6343
   168
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
wenzelm@6343
   169
plain output, interface builders may have to enable 'isabelle_font'
wenzelm@6343
   170
mode to get Isabelle font glyphs as before;
wenzelm@6343
   171
wenzelm@6343
   172
* refined token_translation interface; INCOMPATIBILITY: output length
wenzelm@6343
   173
now of type real instead of int;
wenzelm@6343
   174
wenzelm@6343
   175
paulson@6064
   176
wenzelm@5781
   177
New in Isabelle98-1 (October 1998)
wenzelm@5781
   178
----------------------------------
wenzelm@5781
   179
wenzelm@5127
   180
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842
   181
wenzelm@5726
   182
* several changes of automated proof tools;
wenzelm@5373
   183
wenzelm@5726
   184
* HOL: major changes to the inductive and datatype packages, including
wenzelm@5726
   185
some minor incompatibilities of theory syntax;
berghofe@5214
   186
wenzelm@5726
   187
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
wenzelm@5217
   188
called `inj_on';
paulson@5160
   189
nipkow@5275
   190
* HOL: removed duplicate thms in Arith:
nipkow@5275
   191
  less_imp_add_less  should be replaced by  trans_less_add1
nipkow@5275
   192
  le_imp_add_le      should be replaced by  trans_le_add1
paulson@5160
   193
wenzelm@5726
   194
* HOL: unary minus is now overloaded (new type constraints may be
wenzelm@5726
   195
required);
paulson@5490
   196
wenzelm@5726
   197
* HOL and ZF: unary minus for integers is now #- instead of #~.  In
wenzelm@5726
   198
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
wenzelm@5726
   199
now taken as an integer constant.
paulson@5541
   200
wenzelm@5726
   201
* Pure: ML function 'theory_of' renamed to 'theory';
wenzelm@5397
   202
wenzelm@5363
   203
wenzelm@5127
   204
*** Proof tools ***
nipkow@4880
   205
nipkow@5657
   206
* Simplifier:
nipkow@5657
   207
  1. Asm_full_simp_tac is now more aggressive.
nipkow@5657
   208
     1. It will sometimes reorient premises if that increases their power to
nipkow@5657
   209
        simplify.
nipkow@5657
   210
     2. It does no longer proceed strictly from left to right but may also
nipkow@5657
   211
        rotate premises to achieve further simplification.
nipkow@5657
   212
     For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@5657
   213
     old Asm_full_simp_tac in that it does not rotate premises.
nipkow@5657
   214
  2. The simplifier now knows a little bit about nat-arithmetic.
nipkow@4880
   215
wenzelm@5127
   216
* Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127
   217
allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127
   218
wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127
   219
addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127
   220
and that adding two tactics with the same name overwrites the first
wenzelm@5127
   221
one (emitting a warning).
oheimb@4824
   222
  type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649
   223
  setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824
   224
  addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824
   225
  delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649
   226
  getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649
   227
wenzelm@5705
   228
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
wenzelm@5726
   229
semantics; addbefore now affects only the unsafe part of step_tac
wenzelm@5726
   230
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
wenzelm@5726
   231
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
wenzelm@5726
   232
by Force_tac;
oheimb@5524
   233
wenzelm@5726
   234
* Classical reasoner: setwrapper to setWrapper and compwrapper to
wenzelm@5726
   235
compWrapper; added safe wrapper (and access functions for it);
oheimb@5524
   236
wenzelm@5127
   237
* HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5726
   238
to split.  Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
wenzelm@5726
   239
and the names of the automatically generated variables have changed.
wenzelm@5726
   240
split_all_tac has moved within claset() from unsafe wrappers to safe
wenzelm@5726
   241
wrappers, which means that !!-bound variables are split much more
wenzelm@5726
   242
aggressively, and safe_tac and clarify_tac now split such variables.
wenzelm@5726
   243
If this splitting is not appropriate, use delSWrapper "split_all_tac".
wenzelm@5726
   244
Note: the same holds for record_split_tac, which does the job of
wenzelm@5726
   245
split_all_tac for record fields.
wenzelm@5127
   246
wenzelm@5726
   247
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
wenzelm@5726
   248
permanently to the default simpset using Addsplits just like
wenzelm@5726
   249
Addsimps. They can be removed via Delsplits just like
wenzelm@5726
   250
Delsimps. Lower-case versions are also available.
wenzelm@5127
   251
wenzelm@5726
   252
* HOL/Simplifier: The rule split_if is now part of the default
wenzelm@5726
   253
simpset. This means that the simplifier will eliminate all occurrences
wenzelm@5726
   254
of if-then-else in the conclusion of a goal. To prevent this, you can
wenzelm@5726
   255
either remove split_if completely from the default simpset by
wenzelm@5726
   256
`Delsplits [split_if]' or remove it in a specific call of the
wenzelm@5726
   257
simplifier using `... delsplits [split_if]'.  You can also add/delete
wenzelm@5726
   258
other case splitting rules to/from the default simpset: every datatype
wenzelm@5726
   259
generates suitable rules `split_t_case' and `split_t_case_asm' (where
wenzelm@5726
   260
t is the name of the datatype).
wenzelm@5127
   261
wenzelm@5726
   262
* Classical reasoner / Simplifier combination: new force_tac (and
wenzelm@5127
   263
derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127
   264
reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5726
   265
aimed to solve the given subgoal completely.
wenzelm@5127
   266
wenzelm@5127
   267
wenzelm@5127
   268
*** General ***
wenzelm@5127
   269
wenzelm@5217
   270
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127
   271
and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127
   272
the current theory context is used; assumptions are no longer returned
wenzelm@5127
   273
at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5217
   274
recommended to convert to these new commands using isatool fixgoal
wenzelm@5217
   275
(backup your sources first!);
wenzelm@4842
   276
wenzelm@5217
   277
* new top-level commands 'thm' and 'thms' for retrieving theorems from
wenzelm@5207
   278
the current theory context, and 'theory' to lookup stored theories;
paulson@4806
   279
paulson@5722
   280
* new theory section 'locale' for declaring constants, assumptions and
paulson@5722
   281
definitions that have local scope;
paulson@5722
   282
wenzelm@5127
   283
* new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858
   284
wenzelm@5127
   285
* new theory section 'setup' for generic ML setup functions
wenzelm@5127
   286
(e.g. package initialization);
wenzelm@4869
   287
wenzelm@5131
   288
* the distribution now includes Isabelle icons: see
wenzelm@5131
   289
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131
   290
wenzelm@5363
   291
* isatool install - install binaries with absolute references to
wenzelm@5363
   292
ISABELLE_HOME/bin;
wenzelm@5363
   293
wenzelm@5572
   294
* isatool logo -- create instances of the Isabelle logo (as EPS);
wenzelm@5572
   295
wenzelm@5407
   296
* print mode 'emacs' reserved for Isamode;
wenzelm@5407
   297
wenzelm@5726
   298
* support multiple print (ast) translations per constant name;
wenzelm@5726
   299
wenzelm@6925
   300
* theorems involving oracles are now printed with a suffixed [!];
wenzelm@6925
   301
wenzelm@4711
   302
paulson@4661
   303
*** HOL ***
paulson@4661
   304
wenzelm@5710
   305
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
nipkow@5709
   306
wenzelm@5217
   307
* HOL/inductive package reorganized and improved: now supports mutual
paulson@5267
   308
definitions such as
wenzelm@5217
   309
wenzelm@5217
   310
  inductive EVEN ODD
wenzelm@5217
   311
    intrs
wenzelm@5217
   312
      null "0 : EVEN"
wenzelm@5217
   313
      oddI "n : EVEN ==> Suc n : ODD"
wenzelm@5217
   314
      evenI "n : ODD ==> Suc n : EVEN"
wenzelm@5217
   315
wenzelm@5217
   316
new theorem list "elims" contains an elimination rule for each of the
wenzelm@5217
   317
recursive sets; inductive definitions now handle disjunctive premises
wenzelm@5217
   318
correctly (also ZF);
berghofe@5214
   319
wenzelm@5217
   320
INCOMPATIBILITIES: requires Inductive as an ancestor; component
wenzelm@5217
   321
"mutual_induct" no longer exists - the induction rule is always
wenzelm@5217
   322
contained in "induct";
wenzelm@5217
   323
wenzelm@5217
   324
wenzelm@5217
   325
* HOL/datatype package re-implemented and greatly improved: now
paulson@5267
   326
supports mutually recursive datatypes such as
wenzelm@5217
   327
wenzelm@5217
   328
  datatype
wenzelm@5217
   329
    'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
wenzelm@5217
   330
            | SUM ('a aexp) ('a aexp)
wenzelm@5217
   331
            | DIFF ('a aexp) ('a aexp)
wenzelm@5217
   332
            | NUM 'a
wenzelm@5217
   333
  and
wenzelm@5217
   334
    'a bexp = LESS ('a aexp) ('a aexp)
wenzelm@5217
   335
            | AND ('a bexp) ('a bexp)
wenzelm@5217
   336
            | OR ('a bexp) ('a bexp)
wenzelm@5217
   337
paulson@5267
   338
as well as indirectly recursive datatypes such as
berghofe@5214
   339
wenzelm@5217
   340
  datatype
wenzelm@5217
   341
    ('a, 'b) term = Var 'a
wenzelm@5217
   342
                  | App 'b ((('a, 'b) term) list)
berghofe@5214
   343
wenzelm@5217
   344
The new tactic  mutual_induct_tac [<var_1>, ..., <var_n>] i  performs
wenzelm@5217
   345
induction on mutually / indirectly recursive datatypes.
wenzelm@5217
   346
wenzelm@5217
   347
Primrec equations are now stored in theory and can be accessed via
wenzelm@5217
   348
<function_name>.simps.
wenzelm@5217
   349
wenzelm@5217
   350
INCOMPATIBILITIES:
berghofe@5214
   351
wenzelm@5217
   352
  - Theories using datatypes must now have theory Datatype as an
wenzelm@5217
   353
    ancestor.
wenzelm@5217
   354
  - The specific <typename>.induct_tac no longer exists - use the
wenzelm@5217
   355
    generic induct_tac instead.
berghofe@5226
   356
  - natE has been renamed to nat.exhaust - use exhaust_tac
wenzelm@5217
   357
    instead of res_inst_tac ... natE. Note that the variable
berghofe@5226
   358
    names in nat.exhaust differ from the names in natE, this
wenzelm@5217
   359
    may cause some "fragile" proofs to fail.
wenzelm@5217
   360
  - The theorems split_<typename>_case and split_<typename>_case_asm
wenzelm@5217
   361
    have been renamed to <typename>.split and <typename>.split_asm.
wenzelm@5217
   362
  - Since default sorts of type variables are now handled correctly,
wenzelm@5217
   363
    some datatype definitions may have to be annotated with explicit
wenzelm@5217
   364
    sort constraints.
wenzelm@5217
   365
  - Primrec definitions no longer require function name and type
wenzelm@5217
   366
    of recursive argument.
berghofe@5214
   367
wenzelm@5217
   368
Consider using isatool fixdatatype to adapt your theories and proof
wenzelm@5217
   369
scripts to the new package (backup your sources first!).
wenzelm@5217
   370
wenzelm@5217
   371
wenzelm@5726
   372
* HOL/record package: considerably improved implementation; now
wenzelm@5726
   373
includes concrete syntax for record types, terms, updates; theorems
wenzelm@5726
   374
for surjective pairing and splitting !!-bound record variables; proof
wenzelm@5726
   375
support is as follows:
wenzelm@5726
   376
wenzelm@5726
   377
  1) standard conversions (selectors or updates applied to record
wenzelm@5726
   378
constructor terms) are part of the standard simpset;
wenzelm@5726
   379
wenzelm@5726
   380
  2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
wenzelm@5726
   381
made part of standard simpset and claset via addIffs;
wenzelm@5726
   382
wenzelm@5726
   383
  3) a tactic for record field splitting (record_split_tac) is part of
wenzelm@5726
   384
the standard claset (addSWrapper);
wenzelm@5726
   385
wenzelm@5726
   386
To get a better idea about these rules you may retrieve them via
wenzelm@5726
   387
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
wenzelm@5726
   388
the name of your record type.
wenzelm@5726
   389
wenzelm@5726
   390
The split tactic 3) conceptually simplifies by the following rule:
wenzelm@5726
   391
wenzelm@5726
   392
  "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
wenzelm@5726
   393
wenzelm@5726
   394
Thus any record variable that is bound by meta-all will automatically
wenzelm@5726
   395
blow up into some record constructor term, consequently the
wenzelm@5726
   396
simplifications of 1), 2) apply.  Thus force_tac, auto_tac etc. shall
wenzelm@5726
   397
solve record problems automatically.
wenzelm@5726
   398
berghofe@5214
   399
wenzelm@5125
   400
* reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125
   401
default; theory Main includes everything;
wenzelm@5125
   402
paulson@5650
   403
* automatic simplification of integer sums and comparisons, using cancellation;
paulson@5650
   404
oheimb@5526
   405
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
wenzelm@5127
   406
wenzelm@5127
   407
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5127
   408
wenzelm@5127
   409
* many new identities for unions, intersections, set difference, etc.;
wenzelm@5127
   410
wenzelm@5127
   411
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127
   412
called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127
   413
with add/delsplits);
wenzelm@5125
   414
wenzelm@5127
   415
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127
   416
(?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127
   417
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5207
   418
'Delsimprocs [unit_eq_proc];' as last resort); also note that
wenzelm@5207
   419
unit_abs_eta_conv is added in order to counter the effect of
wenzelm@5207
   420
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
wenzelm@5207
   421
%u.f();
wenzelm@5125
   422
wenzelm@5217
   423
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
wenzelm@5217
   424
makes more sense);
berghofe@5109
   425
paulson@5475
   426
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
   427
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
   428
  disjointness reasoning but breaking a few old proofs.
paulson@5267
   429
wenzelm@5217
   430
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
wenzelm@5217
   431
to 'converse' from 'inverse' (for compatibility with ZF and some
wenzelm@5217
   432
literature);
wenzelm@5085
   433
wenzelm@5127
   434
* HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127
   435
the well-founded relation;
oheimb@4838
   436
paulson@5490
   437
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
paulson@5490
   438
    Compl A.  The "Compl" syntax remains available as input syntax for this
paulson@5490
   439
    release ONLY.
paulson@5490
   440
wenzelm@5127
   441
* HOL/Update: new theory of function updates:
wenzelm@5127
   442
    f(a:=b) == %x. if x=a then b else f x
wenzelm@5127
   443
may also be iterated as in f(a:=b,c:=d,...);
nipkow@5077
   444
wenzelm@5127
   445
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899
   446
nipkow@5282
   447
* HOL/List:
nipkow@5282
   448
  - new function list_update written xs[i:=v] that updates the i-th
nipkow@5282
   449
    list position. May also be iterated as in xs[i:=a,j:=b,...].
nipkow@5428
   450
  - new function `upt' written [i..j(] which generates the list
nipkow@5428
   451
    [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
nipkow@5428
   452
    bound write [i..j], which is a shorthand for [i..j+1(].
nipkow@5282
   453
  - new lexicographic orderings and corresponding wellfoundedness theorems.
paulson@4779
   454
wenzelm@5127
   455
* HOL/Arith:
wenzelm@5127
   456
  - removed 'pred' (predecessor) function;
wenzelm@5127
   457
  - generalized some theorems about n-1;
wenzelm@5127
   458
  - many new laws about "div" and "mod";
wenzelm@5127
   459
  - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766
   460
wenzelm@5127
   461
* HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842
   462
instead of "inverse";
wenzelm@4711
   463
nipkow@5651
   464
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
nipkow@5651
   465
  of the multiset ordering;
nipkow@5651
   466
wenzelm@5127
   467
* directory HOL/Real: a construction of the reals using Dedekind cuts
nipkow@5651
   468
  (not included by default);
nipkow@4835
   469
wenzelm@5127
   470
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711
   471
nipkow@5651
   472
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
nipkow@5651
   473
  programs, i.e. different program variables may have different types.
nipkow@5651
   474
paulson@5142
   475
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
   476
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
   477
  Now rew can involve either definitions or equalities (either == or =).
wenzelm@5002
   478
wenzelm@5363
   479
paulson@4879
   480
*** ZF ***
paulson@4879
   481
paulson@5332
   482
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
paulson@5332
   483
  only the theorems proved on ZF.ML;
paulson@5160
   484
paulson@5475
   485
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
   486
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
   487
  disjointness reasoning but breaking a few old proofs.
paulson@5267
   488
paulson@5160
   489
* ZF/Update: new theory of function updates
paulson@5160
   490
    with default rewrite rule  f(x:=y) ` z = if(z=x, y, f`z)
paulson@5160
   491
  may also be iterated as in f(a:=b,c:=d,...);
paulson@5160
   492
paulson@4879
   493
* in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649
   494
paulson@5142
   495
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
   496
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
   497
  Now rew can involve either definitions or equalities (either == or =).
paulson@5142
   498
paulson@5160
   499
* case_tac provided for compatibility with HOL
paulson@5160
   500
    (like the old excluded_middle_tac, but with subgoals swapped)
paulson@5160
   501
wenzelm@4842
   502
wenzelm@5127
   503
*** Internal programming interfaces ***
wenzelm@5002
   504
wenzelm@5251
   505
* Pure: several new basic modules made available for general use, see
wenzelm@5251
   506
also src/Pure/README;
wenzelm@5207
   507
wenzelm@5008
   508
* improved the theory data mechanism to support encapsulation (data
wenzelm@5008
   509
kind name replaced by private Object.kind, acting as authorization
wenzelm@5373
   510
key); new type-safe user interface via functor TheoryDataFun; generic
wenzelm@5373
   511
print_data function becomes basically useless;
wenzelm@5002
   512
wenzelm@5251
   513
* removed global_names compatibility flag -- all theory declarations
wenzelm@5251
   514
are qualified by default;
wenzelm@5251
   515
wenzelm@5085
   516
* module Pure/Syntax now offers quote / antiquote translation
wenzelm@5085
   517
functions (useful for Hoare logic etc. with implicit dependencies);
wenzelm@5373
   518
see HOL/ex/Antiquote for an example use;
wenzelm@5085
   519
wenzelm@5127
   520
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
wenzelm@5127
   521
cterm -> thm;
wenzelm@5127
   522
wenzelm@5207
   523
* new tactical CHANGED_GOAL for checking that a tactic modifies a
wenzelm@5207
   524
subgoal;
paulson@5142
   525
wenzelm@5251
   526
* Display.print_goals function moved to Locale.print_goals;
wenzelm@5251
   527
wenzelm@5731
   528
* standard print function for goals supports current_goals_markers
wenzelm@5731
   529
variable for marking begin of proof, end of proof, start of goal; the
wenzelm@5731
   530
default is ("", "", ""); setting current_goals_markers := ("<proof>",
wenzelm@5731
   531
"</proof>", "<goal>") causes SGML like tagged proof state printing,
wenzelm@5731
   532
for example;
wenzelm@5731
   533
wenzelm@5002
   534
wenzelm@5002
   535
wenzelm@4410
   536
New in Isabelle98 (January 1998)
wenzelm@4410
   537
--------------------------------
wenzelm@4410
   538
wenzelm@4410
   539
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4410
   540
wenzelm@4410
   541
* changed lexical syntax of terms / types: dots made part of long
wenzelm@4410
   542
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
wenzelm@4410
   543
wenzelm@4410
   544
* simpset (and claset) reference variable replaced by functions
wenzelm@4410
   545
simpset / simpset_ref;
wenzelm@4410
   546
wenzelm@4410
   547
* no longer supports theory aliases (via merge) and non-trivial
wenzelm@4410
   548
implicit merge of thms' signatures;
wenzelm@4410
   549
wenzelm@4410
   550
* most internal names of constants changed due to qualified names;
wenzelm@4410
   551
wenzelm@4410
   552
* changed Pure/Sequence interface (see Pure/seq.ML);
wenzelm@4410
   553
wenzelm@3454
   554
paulson@3715
   555
*** General Changes ***
paulson@3715
   556
wenzelm@4174
   557
* hierachically structured name spaces (for consts, types, axms, thms
wenzelm@3943
   558
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
wenzelm@4108
   559
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
wenzelm@4108
   560
isatool fixdots ensures space after dots (e.g. "%x. x"); set
wenzelm@4174
   561
long_names for fully qualified output names; NOTE: ML programs
wenzelm@4174
   562
(special tactics, packages etc.) referring to internal names may have
wenzelm@4174
   563
to be adapted to cope with fully qualified names; in case of severe
wenzelm@4174
   564
backward campatibility problems try setting 'global_names' at compile
wenzelm@4174
   565
time to have enrything declared within a flat name space; one may also
wenzelm@4174
   566
fine tune name declarations in theories via the 'global' and 'local'
wenzelm@4174
   567
section;
wenzelm@4108
   568
wenzelm@4108
   569
* reimplemented the implicit simpset and claset using the new anytype
wenzelm@4108
   570
data filed in signatures; references simpset:simpset ref etc. are
wenzelm@4108
   571
replaced by functions simpset:unit->simpset and
wenzelm@4108
   572
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
wenzelm@4108
   573
to patch your ML files accordingly;
paulson@3856
   574
wenzelm@3857
   575
* HTML output now includes theory graph data for display with Java
wenzelm@3857
   576
applet or isatool browser; data generated automatically via isatool
wenzelm@3901
   577
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
wenzelm@3857
   578
paulson@3856
   579
* defs may now be conditional; improved rewrite_goals_tac to handle
paulson@3856
   580
conditional equations;
paulson@3856
   581
wenzelm@4174
   582
* defs now admits additional type arguments, using TYPE('a) syntax;
wenzelm@4174
   583
wenzelm@3901
   584
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
wenzelm@3901
   585
creates a new theory node; implicit merge of thms' signatures is
wenzelm@4112
   586
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
wenzelm@3901
   587
transfer:theory->thm->thm in (rare) cases;
wenzelm@3901
   588
wenzelm@3968
   589
* improved handling of draft signatures / theories; draft thms (and
wenzelm@3968
   590
ctyps, cterms) are automatically promoted to real ones;
wenzelm@3968
   591
wenzelm@3901
   592
* slightly changed interfaces for oracles: admit many per theory, named
wenzelm@3901
   593
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
wenzelm@3901
   594
wenzelm@3901
   595
* print_goals: optional output of const types (set show_consts and
wenzelm@3901
   596
show_types);
wenzelm@3851
   597
wenzelm@4388
   598
* improved output of warnings (###) and errors (***);
wenzelm@3697
   599
paulson@4178
   600
* subgoal_tac displays a warning if the new subgoal has type variables;
paulson@4178
   601
paulson@3715
   602
* removed old README and Makefiles;
wenzelm@3697
   603
paulson@3856
   604
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
wenzelm@3670
   605
paulson@3715
   606
* removed obsolete init_pps and init_database;
paulson@3715
   607
paulson@3715
   608
* deleted the obsolete tactical STATE, which was declared by
paulson@3715
   609
    fun STATE tacfun st = tacfun st st;
paulson@3715
   610
wenzelm@4388
   611
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
wenzelm@4388
   612
(which abbreviates $HOME);
wenzelm@4269
   613
wenzelm@4269
   614
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
wenzelm@4269
   615
use isatool fixseq to adapt your ML programs (this works for fully
wenzelm@4269
   616
qualified references to the Sequence structure only!);
wenzelm@4269
   617
wenzelm@4381
   618
* use_thy no longer requires writable current directory; it always
wenzelm@4381
   619
reloads .ML *and* .thy file, if either one is out of date;
wenzelm@4269
   620
paulson@3715
   621
paulson@3715
   622
*** Classical Reasoner ***
paulson@3715
   623
wenzelm@3744
   624
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
wenzelm@3744
   625
tactics that use classical reasoning to simplify a subgoal without
wenzelm@3744
   626
splitting it into several subgoals;
paulson@3715
   627
paulson@3719
   628
* Safe_tac: like safe_tac but uses the default claset;
paulson@3719
   629
paulson@3715
   630
paulson@3715
   631
*** Simplifier ***
paulson@3715
   632
paulson@3715
   633
* added simplification meta rules:
paulson@3715
   634
    (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3715
   635
paulson@3715
   636
* simplifier.ML no longer part of Pure -- has to be loaded by object
paulson@3715
   637
logics (again);
paulson@3715
   638
paulson@3715
   639
* added prems argument to simplification procedures;
paulson@3715
   640
paulson@4325
   641
* HOL, FOL, ZF: added infix function `addsplits':
paulson@4325
   642
  instead of `<simpset> setloop (split_tac <thms>)'
paulson@4325
   643
  you can simply write `<simpset> addsplits <thms>'
paulson@4325
   644
paulson@3715
   645
paulson@3715
   646
*** Syntax ***
paulson@3715
   647
wenzelm@4174
   648
* TYPE('a) syntax for type reflection terms;
wenzelm@4174
   649
wenzelm@3985
   650
* no longer handles consts with name "" -- declare as 'syntax' instead;
paulson@3856
   651
paulson@3856
   652
* pretty printer: changed order of mixfix annotation preference (again!);
wenzelm@3846
   653
paulson@3715
   654
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
paulson@3715
   655
paulson@3715
   656
paulson@3715
   657
*** HOL ***
paulson@3715
   658
wenzelm@5726
   659
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
   660
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
   661
nipkow@4035
   662
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
wenzelm@3985
   663
wenzelm@3985
   664
* HOL/Auth: new protocol proofs including some for the Internet
nipkow@4035
   665
  protocol TLS;
wenzelm@3985
   666
wenzelm@4125
   667
* HOL/Map: new theory of `maps' a la VDM;
nipkow@3982
   668
wenzelm@4335
   669
* HOL/simplifier: simplification procedures nat_cancel_sums for
wenzelm@4335
   670
cancelling out common nat summands from =, <, <= (in)equalities, or
wenzelm@4335
   671
differences; simplification procedures nat_cancel_factor for
wenzelm@4335
   672
cancelling common factor from =, <, <= (in)equalities over natural
wenzelm@4373
   673
sums; nat_cancel contains both kinds of procedures, it is installed by
wenzelm@4373
   674
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
wenzelm@4335
   675
nipkow@3580
   676
* HOL/simplifier: terms of the form
paulson@4325
   677
  `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)'  (or t=x)
nipkow@3580
   678
  are rewritten to
nipkow@4035
   679
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
nipkow@4035
   680
  and those of the form
paulson@4325
   681
  `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)'  (or t=x)
nipkow@4035
   682
  are rewritten to
nipkow@4035
   683
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
nipkow@4035
   684
nipkow@4035
   685
* HOL/datatype
nipkow@4035
   686
  Each datatype `t' now comes with a theorem `split_t_case' of the form
nipkow@3580
   687
nipkow@4035
   688
  P(t_case f1 ... fn x) =
nipkow@4035
   689
     ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
nipkow@4035
   690
        ...
oheimb@4189
   691
       (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
nipkow@4035
   692
     )
nipkow@4035
   693
oheimb@4930
   694
  and a theorem `split_t_case_asm' of the form
oheimb@4189
   695
oheimb@4189
   696
  P(t_case f1 ... fn x) =
oheimb@4189
   697
    ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
oheimb@4189
   698
        ...
oheimb@4189
   699
       (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
oheimb@4189
   700
     )
oheimb@4930
   701
  which can be added to a simpset via `addsplits'. The existing theorems
oheimb@4930
   702
  expand_list_case and expand_option_case have been renamed to
oheimb@4930
   703
  split_list_case and split_option_case.
oheimb@4189
   704
nipkow@4361
   705
* HOL/Arithmetic:
nipkow@4361
   706
  - `pred n' is automatically converted to `n-1'.
nipkow@4361
   707
    Users are strongly encouraged not to use `pred' any longer,
nipkow@4361
   708
    because it will disappear altogether at some point.
nipkow@4361
   709
  - Users are strongly encouraged to write "0 < n" rather than
nipkow@4361
   710
    "n ~= 0". Theorems and proof tools have been modified towards this
nipkow@4361
   711
    `standard'.
nipkow@4357
   712
nipkow@4502
   713
* HOL/Lists:
nipkow@4502
   714
  the function "set_of_list" has been renamed "set" (and its theorems too);
nipkow@4502
   715
  the function "nth" now takes its arguments in the reverse order and
nipkow@4502
   716
  has acquired the infix notation "!" as in "xs!n".
paulson@3570
   717
paulson@4154
   718
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
paulson@4154
   719
paulson@4154
   720
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
paulson@4154
   721
  specialist theorems (like UN1_I) are gone.  Similarly for (INT x.B x);
paulson@4154
   722
wenzelm@4575
   723
* HOL/record: extensible records with schematic structural subtyping
wenzelm@4575
   724
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
wenzelm@4575
   725
still lacks various theorems and concrete record syntax;
wenzelm@4575
   726
wenzelm@4125
   727
paulson@3715
   728
*** HOLCF ***
wenzelm@3535
   729
wenzelm@4125
   730
* removed "axioms" and "generated by" sections;
wenzelm@4125
   731
oheimb@4123
   732
* replaced "ops" section by extended "consts" section, which is capable of
wenzelm@4125
   733
  handling the continuous function space "->" directly;
wenzelm@4125
   734
wenzelm@4125
   735
* domain package:
wenzelm@4125
   736
  . proves theorems immediately and stores them in the theory,
wenzelm@4125
   737
  . creates hierachical name space,
wenzelm@4125
   738
  . now uses normal mixfix annotations (instead of cinfix...),
wenzelm@4125
   739
  . minor changes to some names and values (for consistency),
wenzelm@4125
   740
  . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
wenzelm@4125
   741
  . separator between mutual domain defs: changed "," to "and",
wenzelm@4125
   742
  . improved handling of sort constraints;  now they have to
wenzelm@4125
   743
    appear on the left-hand side of the equations only;
oheimb@4123
   744
oheimb@4123
   745
* fixed LAM <x,y,zs>.b syntax;
wenzelm@3567
   746
wenzelm@3744
   747
* added extended adm_tac to simplifier in HOLCF -- can now discharge
wenzelm@3744
   748
adm (%x. P (t x)), where P is chainfinite and t continuous;
wenzelm@3579
   749
wenzelm@3579
   750
paulson@3719
   751
*** FOL and ZF ***
paulson@3719
   752
wenzelm@5726
   753
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
   754
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
   755
wenzelm@3744
   756
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
wenzelm@3744
   757
in HOL, they strip ALL and --> from proved theorems;
wenzelm@3744
   758
paulson@3719
   759
wenzelm@3579
   760
wenzelm@3006
   761
New in Isabelle94-8 (May 1997)
wenzelm@3006
   762
------------------------------
wenzelm@2654
   763
paulson@3002
   764
*** General Changes ***
paulson@3002
   765
paulson@3002
   766
* new utilities to build / run / maintain Isabelle etc. (in parts
paulson@3002
   767
still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2971
   768
wenzelm@3205
   769
* new 'Isabelle System Manual';
wenzelm@3205
   770
wenzelm@2825
   771
* INSTALL text, together with ./configure and ./build scripts;
wenzelm@2773
   772
wenzelm@3006
   773
* reimplemented type inference for greater efficiency, better error
wenzelm@3006
   774
messages and clean internal interface;
paulson@3002
   775
paulson@3002
   776
* prlim command for dealing with lots of subgoals (an easier way of
paulson@3002
   777
setting goals_limit);
paulson@3002
   778
wenzelm@3006
   779
wenzelm@3006
   780
*** Syntax ***
paulson@3002
   781
wenzelm@3116
   782
* supports alternative (named) syntax tables (parser and pretty
wenzelm@3116
   783
printer); internal interface is provided by add_modesyntax(_i);
wenzelm@3116
   784
paulson@3002
   785
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
paulson@3002
   786
be used in conjunction with the Isabelle symbol font; uses the
paulson@3002
   787
"symbols" syntax table;
paulson@3002
   788
wenzelm@2705
   789
* added token_translation interface (may translate name tokens in
wenzelm@2756
   790
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
wenzelm@3116
   791
the current print_mode); IMPORTANT: user print translation functions
wenzelm@3116
   792
are responsible for marking newly introduced bounds
wenzelm@3116
   793
(Syntax.mark_boundT);
wenzelm@2705
   794
wenzelm@2730
   795
* token translations for modes "xterm" and "xterm_color" that display
wenzelm@3006
   796
names in bold, underline etc. or colors (which requires a color
wenzelm@3006
   797
version of xterm);
wenzelm@2730
   798
paulson@3002
   799
* infixes may now be declared with names independent of their syntax;
paulson@3002
   800
paulson@3002
   801
* added typed_print_translation (like print_translation, but may
paulson@3002
   802
access type of constant);
paulson@3002
   803
wenzelm@3006
   804
paulson@3002
   805
*** Classical Reasoner ***
paulson@3002
   806
paulson@3002
   807
Blast_tac: a new tactic!  It is often more powerful than fast_tac, but has
paulson@3002
   808
some limitations.  Blast_tac...
paulson@3002
   809
  + ignores addss, addbefore, addafter; this restriction is intrinsic
paulson@3002
   810
  + ignores elimination rules that don't have the correct format
wenzelm@5726
   811
        (the conclusion MUST be a formula variable)
paulson@3002
   812
  + ignores types, which can make HOL proofs fail
paulson@3002
   813
  + rules must not require higher-order unification, e.g. apply_type in ZF
paulson@3002
   814
    [message "Function Var's argument not a bound variable" relates to this]
paulson@3002
   815
  + its proof strategy is more general but can actually be slower
paulson@3002
   816
wenzelm@3107
   817
* substitution with equality assumptions no longer permutes other
wenzelm@3107
   818
assumptions;
paulson@3002
   819
paulson@3002
   820
* minor changes in semantics of addafter (now called addaltern); renamed
paulson@3002
   821
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
wenzelm@3107
   822
(and access functions for it);
paulson@3002
   823
wenzelm@5726
   824
* improved combination of classical reasoner and simplifier:
oheimb@3317
   825
  + functions for handling clasimpsets
oheimb@3317
   826
  + improvement of addss: now the simplifier is called _after_ the
oheimb@3317
   827
    safe steps.
oheimb@3317
   828
  + safe variant of addss called addSss: uses safe simplifications
wenzelm@5726
   829
    _during_ the safe steps. It is more complete as it allows multiple
oheimb@3317
   830
    instantiations of unknowns (e.g. with slow_tac).
wenzelm@3006
   831
paulson@3002
   832
*** Simplifier ***
paulson@3002
   833
wenzelm@3006
   834
* added interface for simplification procedures (functions that
wenzelm@3006
   835
produce *proven* rewrite rules on the fly, depending on current
wenzelm@3006
   836
redex);
wenzelm@3006
   837
wenzelm@3006
   838
* ordering on terms as parameter (used for ordered rewriting);
wenzelm@3006
   839
wenzelm@3107
   840
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
paulson@3002
   841
paulson@3002
   842
* the solver is now split into a safe and an unsafe part.
paulson@3002
   843
This should be invisible for the normal user, except that the
paulson@3002
   844
functions setsolver and addsolver have been renamed to setSolver and
wenzelm@3107
   845
addSolver; added safe_asm_full_simp_tac;
paulson@3002
   846
paulson@3002
   847
paulson@3002
   848
*** HOL ***
paulson@3002
   849
nipkow@3042
   850
* a generic induction tactic `induct_tac' which works for all datatypes and
wenzelm@3107
   851
also for type `nat';
nipkow@3042
   852
nipkow@3316
   853
* a generic case distinction tactic `exhaust_tac' which works for all
nipkow@3316
   854
datatypes and also for type `nat';
nipkow@3316
   855
nipkow@3316
   856
* each datatype comes with a function `size';
nipkow@3316
   857
paulson@3002
   858
* patterns in case expressions allow tuple patterns as arguments to
wenzelm@3107
   859
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
paulson@3002
   860
paulson@3002
   861
* primrec now also works with type nat;
paulson@3002
   862
paulson@3338
   863
* recdef: a new declaration form, allows general recursive functions to be
paulson@3338
   864
defined in theory files.  See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
paulson@3338
   865
paulson@3002
   866
* the constant for negation has been renamed from "not" to "Not" to
wenzelm@3107
   867
harmonize with FOL, ZF, LK, etc.;
paulson@3002
   868
wenzelm@3107
   869
* HOL/ex/LFilter theory of a corecursive "filter" functional for
wenzelm@3107
   870
infinite lists;
paulson@3002
   871
wenzelm@3227
   872
* HOL/Modelcheck demonstrates invocation of model checker oracle;
wenzelm@3227
   873
paulson@3002
   874
* HOL/ex/Ring.thy declares cring_simp, which solves equational
paulson@3002
   875
problems in commutative rings, using axiomatic type classes for + and *;
paulson@3002
   876
paulson@3002
   877
* more examples in HOL/MiniML and HOL/Auth;
paulson@3002
   878
paulson@3002
   879
* more default rewrite rules for quantifiers, union/intersection;
paulson@3002
   880
nipkow@3321
   881
* a new constant `arbitrary == @x.False';
nipkow@3321
   882
wenzelm@3107
   883
* HOLCF/IOA replaces old HOL/IOA;
wenzelm@3107
   884
wenzelm@5726
   885
* HOLCF changes: derived all rules and arities
wenzelm@5726
   886
  + axiomatic type classes instead of classes
slotosch@2653
   887
  + typedef instead of faking type definitions
paulson@2747
   888
  + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
wenzelm@2730
   889
  + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
slotosch@2653
   890
  + eliminated the types void, one, tr
slotosch@2653
   891
  + use unit lift and bool lift (with translations) instead of one and tr
slotosch@2653
   892
  + eliminated blift from Lift3.thy (use Def instead of blift)
wenzelm@3107
   893
  all eliminated rules are derived as theorems --> no visible changes ;
oheimb@2649
   894
wenzelm@3006
   895
paulson@3002
   896
*** ZF ***
wenzelm@2553
   897
paulson@2865
   898
* ZF now has Fast_tac, Simp_tac and Auto_tac.  Union_iff is a now a default
paulson@2865
   899
rewrite rule; this may affect some proofs.  eq_cs is gone but can be put back
paulson@2865
   900
as ZF_cs addSIs [equalityI];
wenzelm@2553
   901
wenzelm@2554
   902
wenzelm@2732
   903
wenzelm@2553
   904
New in Isabelle94-7 (November 96)
wenzelm@2553
   905
---------------------------------
wenzelm@2553
   906
wenzelm@2553
   907
* allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553
   908
wenzelm@2554
   909
* super-linear speedup for large simplifications;
wenzelm@2554
   910
wenzelm@2554
   911
* FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554
   912
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554
   913
FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554
   914
all_simps); De Morgan laws are also now included, by default;
wenzelm@2554
   915
wenzelm@2554
   916
* improved printing of ==>  :  ~:
wenzelm@2554
   917
wenzelm@2554
   918
* new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554
   919
and Modal (thanks to Sara Kalvala);
wenzelm@2554
   920
wenzelm@2554
   921
* HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554
   922
wenzelm@2554
   923
* HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554
   924
examples on HOL/Auth);
wenzelm@2554
   925
wenzelm@2554
   926
* HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554
   927
the rewriter and classical reasoner simultaneously;
wenzelm@2554
   928
wenzelm@2554
   929
* function uresult no longer returns theorems in "standard" format;
wenzelm@2554
   930
regain previous version by: val uresult = standard o uresult;
wenzelm@2554
   931
wenzelm@2554
   932
wenzelm@2554
   933
wenzelm@2554
   934
New in Isabelle94-6
wenzelm@2554
   935
-------------------
wenzelm@2554
   936
wenzelm@2554
   937
* oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554
   938
external reasoners, which may deliver results as theorems;
wenzelm@2554
   939
wenzelm@2554
   940
* proof objects (in particular record all uses of oracles);
wenzelm@2554
   941
wenzelm@2554
   942
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554
   943
wenzelm@2554
   944
* "constdefs" section in theory files;
wenzelm@2554
   945
wenzelm@2554
   946
* "primrec" section (HOL) no longer requires names;
wenzelm@2554
   947
wenzelm@2554
   948
* internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554
   949
wenzelm@2554
   950
wenzelm@2554
   951
wenzelm@2554
   952
New in Isabelle94-5
wenzelm@2554
   953
-------------------
wenzelm@2554
   954
wenzelm@2554
   955
* reduced space requirements;
wenzelm@2554
   956
wenzelm@2554
   957
* automatic HTML generation from theories;
wenzelm@2554
   958
wenzelm@2554
   959
* theory files no longer require "..." (quotes) around most types;
wenzelm@2554
   960
wenzelm@2554
   961
* new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554
   962
wenzelm@2554
   963
* non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554
   964
wenzelm@2553
   965
paulson@2557
   966
paulson@2557
   967
New in Isabelle94-4
paulson@2557
   968
-------------------
paulson@2557
   969
paulson@2747
   970
* greatly reduced space requirements;
paulson@2557
   971
paulson@2557
   972
* theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557
   973
wenzelm@5726
   974
* searchable theorem database (see the section "Retrieving theorems" on
paulson@2557
   975
page 8 of the Reference Manual);
paulson@2557
   976
paulson@2557
   977
* new examples, including Grabczewski's monumental case study of the
paulson@2557
   978
Axiom of Choice;
paulson@2557
   979
paulson@2557
   980
* The previous version of HOL renamed to Old_HOL;
paulson@2557
   981
wenzelm@5726
   982
* The new version of HOL (previously called CHOL) uses a curried syntax
paulson@2557
   983
for functions.  Application looks like f a b instead of f(a,b);
paulson@2557
   984
paulson@2557
   985
* Mutually recursive inductive definitions finally work in HOL;
paulson@2557
   986
paulson@2557
   987
* In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557
   988
translates to the operator "split";
paulson@2557
   989
paulson@2557
   990
paulson@2557
   991
paulson@2557
   992
New in Isabelle94-3
paulson@2557
   993
-------------------
paulson@2557
   994
wenzelm@5726
   995
* new infix operator, addss, allowing the classical reasoner to
paulson@2557
   996
perform simplification at each step of its search.  Example:
wenzelm@5726
   997
        fast_tac (cs addss ss)
paulson@2557
   998
wenzelm@5726
   999
* a new logic, CHOL, the same as HOL, but with a curried syntax
wenzelm@5726
  1000
for functions.  Application looks like f a b instead of f(a,b).  Also pairs
paulson@2557
  1001
look like (a,b) instead of <a,b>;
paulson@2557
  1002
paulson@2557
  1003
* PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557
  1004
paulson@2557
  1005
* In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557
  1006
It translates to the operator "split".  A new theory of integers is available;
paulson@2557
  1007
paulson@2557
  1008
* In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557
  1009
Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
paulson@2557
  1010
wenzelm@5726
  1011
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
paulson@2557
  1012
of the Axiom of Choice;
paulson@2557
  1013
paulson@2557
  1014
paulson@2557
  1015
paulson@2557
  1016
New in Isabelle94-2
paulson@2557
  1017
-------------------
paulson@2557
  1018
wenzelm@5726
  1019
* Significantly faster resolution;
paulson@2557
  1020
paulson@2557
  1021
* the different sections in a .thy file can now be mixed and repeated
paulson@2557
  1022
freely;
paulson@2557
  1023
paulson@2557
  1024
* Database of theorems for FOL, HOL and ZF.  New
paulson@2557
  1025
commands including qed, qed_goal and bind_thm store theorems in the database.
paulson@2557
  1026
paulson@2557
  1027
* Simple database queries: return a named theorem (get_thm) or all theorems of
paulson@2557
  1028
a given theory (thms_of), or find out what theory a theorem was proved in
paulson@2557
  1029
(theory_of_thm);
paulson@2557
  1030
paulson@2557
  1031
* Bugs fixed in the inductive definition and datatype packages;
paulson@2557
  1032
paulson@2557
  1033
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
paulson@2557
  1034
and HOL_dup_cs obsolete;
paulson@2557
  1035
paulson@2557
  1036
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
paulson@2557
  1037
have been removed;
paulson@2557
  1038
paulson@2557
  1039
* Simpler definition of function space in ZF;
paulson@2557
  1040
paulson@2557
  1041
* new results about cardinal and ordinal arithmetic in ZF;
paulson@2557
  1042
paulson@2557
  1043
* 'subtype' facility in HOL for introducing new types as subsets of existing
paulson@2557
  1044
types;
paulson@2557
  1045
paulson@2557
  1046
wenzelm@2553
  1047
$Id$