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