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