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