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