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