NEWS
author wenzelm
Fri Jul 10 15:24:22 1998 +0200 (1998-07-10)
changeset 5131 dd4ac220b8b4
parent 5128 66c4d554e93f
child 5140 216a5dab14b6
permissions -rw-r--r--
the distribution now includes Isabelle icons: see
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5127
     1
wenzelm@2553
     2
Isabelle NEWS -- history of user-visible changes
wenzelm@2553
     3
================================================
wenzelm@2553
     4
wenzelm@4981
     5
New in this Isabelle version
wenzelm@4981
     6
----------------------------
oheimb@4649
     7
wenzelm@5127
     8
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842
     9
wenzelm@5127
    10
* HOL/inductive requires Inductive.thy as an ancestor;
wenzelm@5127
    11
wenzelm@5127
    12
wenzelm@5127
    13
*** Proof tools ***
nipkow@4880
    14
paulson@5075
    15
* Simplifier: Asm_full_simp_tac is now more aggressive.
nipkow@4880
    16
  1. It will sometimes reorient premises if that increases their power to
nipkow@4880
    17
     simplify.
nipkow@4880
    18
  2. It does no longer proceed strictly from left to right but may also
nipkow@4880
    19
     rotate premises to achieve further simplification.
nipkow@4880
    20
  For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@4880
    21
  old Asm_full_simp_tac in that it does not rotate premises.
nipkow@4880
    22
wenzelm@5127
    23
* Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127
    24
allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127
    25
wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127
    26
addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127
    27
and that adding two tactics with the same name overwrites the first
wenzelm@5127
    28
one (emitting a warning).
oheimb@4824
    29
  type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649
    30
  setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824
    31
  addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824
    32
  delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649
    33
  getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649
    34
wenzelm@5127
    35
* HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5127
    36
to split.  Existing (fragile) proofs may require adaption because the
wenzelm@5127
    37
order and the names of the automatically generated variables have
wenzelm@5127
    38
changed.  split_all_tac has moved within claset() from unsafe wrappers
wenzelm@5127
    39
to safe wrappers, which means that !!-bound variables are split much
wenzelm@5127
    40
more aggressively, and safe_tac and clarify_tac now split such
wenzelm@5127
    41
variables.  If this splitting is not appropriate, use delSWrapper
wenzelm@5127
    42
"split_all_tac".
wenzelm@5127
    43
wenzelm@5127
    44
* HOL/Simplifier:
wenzelm@5127
    45
wenzelm@5127
    46
 - Rewrite rules for case distinctions can now be added permanently to
wenzelm@5127
    47
   the default simpset using Addsplits just like Addsimps. They can be
wenzelm@5127
    48
   removed via Delsplits just like Delsimps. Lower-case versions are
wenzelm@5127
    49
   also available.
wenzelm@5127
    50
wenzelm@5127
    51
 - The rule split_if is now part of the default simpset. This means
wenzelm@5127
    52
   that the simplifier will eliminate all occurrences of if-then-else
wenzelm@5127
    53
   in the conclusion of a goal. To prevent this, you can either remove
wenzelm@5127
    54
   split_if completely from the default simpset by `Delsplits
wenzelm@5127
    55
   [split_if]' or remove it in a specific call of the simplifier using
wenzelm@5127
    56
   `... delsplits [split_if]'.  You can also add/delete other case
wenzelm@5127
    57
   splitting rules to/from the default simpset: every datatype
wenzelm@5127
    58
   generates suitable rules `split_t_case' and `split_t_case_asm'
wenzelm@5127
    59
   (where t is the name of the datatype).
wenzelm@5127
    60
wenzelm@5127
    61
* Classical reasoner - Simplifier combination: new force_tac (and
wenzelm@5127
    62
derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127
    63
reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5127
    64
aimed to solve the given subgoal completely;
wenzelm@5127
    65
wenzelm@5127
    66
wenzelm@5127
    67
*** General ***
wenzelm@5127
    68
wenzelm@5127
    69
* new toplevel commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127
    70
and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127
    71
the current theory context is used; assumptions are no longer returned
wenzelm@5127
    72
at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5127
    73
recommended to convert to these new commands using isatool fixgoal (as
wenzelm@5127
    74
usual, backup your sources first!);
wenzelm@4842
    75
wenzelm@5059
    76
* new toplevel commands 'thm' and 'thms' for retrieving theorems from
wenzelm@4842
    77
the current theory context;
paulson@4806
    78
wenzelm@5127
    79
* new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858
    80
wenzelm@5127
    81
* new theory section 'setup' for generic ML setup functions
wenzelm@5127
    82
(e.g. package initialization);
wenzelm@4869
    83
wenzelm@5131
    84
* the distribution now includes Isabelle icons: see
wenzelm@5131
    85
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131
    86
wenzelm@4711
    87
paulson@4661
    88
*** HOL ***
paulson@4661
    89
wenzelm@5125
    90
* reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125
    91
default; theory Main includes everything;
wenzelm@5125
    92
wenzelm@5127
    93
* added option_map_eq_Some to the default simpset claset;
wenzelm@5127
    94
wenzelm@5127
    95
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5127
    96
wenzelm@5127
    97
* many new identities for unions, intersections, set difference, etc.;
wenzelm@5127
    98
wenzelm@5127
    99
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127
   100
called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127
   101
with add/delsplits);
wenzelm@5125
   102
wenzelm@5127
   103
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127
   104
(?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127
   105
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5127
   106
'Delsimprocs [unit_eq_proc];' as last resort);
wenzelm@5125
   107
wenzelm@5127
   108
* HOL/record package: now includes concrete syntax for record terms
wenzelm@5127
   109
(still lacks important theorems, like surjective pairing and split);
wenzelm@5127
   110
wenzelm@5127
   111
* HOL/inductive package reorganized and improved: now supports mutual
wenzelm@5127
   112
definitions such as
berghofe@5109
   113
berghofe@5109
   114
  inductive EVEN ODD
berghofe@5109
   115
    intrs
berghofe@5109
   116
      null " 0 : EVEN"
berghofe@5109
   117
      oddI "n : EVEN ==> Suc n : ODD"
berghofe@5109
   118
      evenI "n : ODD ==> Suc n : EVEN"
berghofe@5109
   119
wenzelm@5127
   120
new component "elims" of the structure created by the package contains
wenzelm@5127
   121
an elimination rule for each of the recursive sets; requires
wenzelm@5127
   122
Inductive.thy as an ancestor; component "mutual_induct" no longer
wenzelm@5127
   123
exists - the induction rule is always contained in "induct"; inductive
wenzelm@5127
   124
definitions now handle disjunctive premises correctly (also ZF);
wenzelm@5085
   125
wenzelm@5127
   126
* HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127
   127
the well-founded relation;
oheimb@4838
   128
wenzelm@5127
   129
* HOL/Update: new theory of function updates:
wenzelm@5127
   130
    f(a:=b) == %x. if x=a then b else f x
wenzelm@5127
   131
may also be iterated as in f(a:=b,c:=d,...);
nipkow@5077
   132
wenzelm@5127
   133
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899
   134
nipkow@5077
   135
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow@5077
   136
  list position. May also be iterated as in xs[i:=a,j:=b,...].
paulson@4779
   137
wenzelm@5127
   138
* HOL/Arith:
wenzelm@5127
   139
  - removed 'pred' (predecessor) function;
wenzelm@5127
   140
  - generalized some theorems about n-1;
wenzelm@5127
   141
  - many new laws about "div" and "mod";
wenzelm@5127
   142
  - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766
   143
wenzelm@5127
   144
* HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842
   145
instead of "inverse";
wenzelm@4711
   146
wenzelm@5127
   147
* directory HOL/Real: a construction of the reals using Dedekind cuts
wenzelm@5127
   148
(not included by default);
nipkow@4835
   149
wenzelm@5127
   150
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711
   151
wenzelm@5002
   152
paulson@4879
   153
*** ZF ***
paulson@4879
   154
paulson@4879
   155
* in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649
   156
wenzelm@4842
   157
wenzelm@5127
   158
*** Internal programming interfaces ***
wenzelm@5002
   159
wenzelm@5008
   160
* improved the theory data mechanism to support encapsulation (data
wenzelm@5008
   161
kind name replaced by private Object.kind, acting as authorization
wenzelm@5008
   162
key); new type-safe user interface via functor TheoryDataFun;
wenzelm@5002
   163
wenzelm@5085
   164
* module Pure/Syntax now offers quote / antiquote translation
wenzelm@5085
   165
functions (useful for Hoare logic etc. with implicit dependencies);
wenzelm@5085
   166
wenzelm@5127
   167
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
wenzelm@5127
   168
cterm -> thm;
wenzelm@5127
   169
wenzelm@5128
   170
* Pure: several new basic modules made available for general use, see
wenzelm@5128
   171
also src/Pure/README;
wenzelm@5128
   172
wenzelm@5002
   173
wenzelm@5002
   174
wenzelm@4410
   175
New in Isabelle98 (January 1998)
wenzelm@4410
   176
--------------------------------
wenzelm@4410
   177
wenzelm@4410
   178
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4410
   179
wenzelm@4410
   180
* changed lexical syntax of terms / types: dots made part of long
wenzelm@4410
   181
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
wenzelm@4410
   182
wenzelm@4410
   183
* simpset (and claset) reference variable replaced by functions
wenzelm@4410
   184
simpset / simpset_ref;
wenzelm@4410
   185
wenzelm@4410
   186
* no longer supports theory aliases (via merge) and non-trivial
wenzelm@4410
   187
implicit merge of thms' signatures;
wenzelm@4410
   188
wenzelm@4410
   189
* most internal names of constants changed due to qualified names;
wenzelm@4410
   190
wenzelm@4410
   191
* changed Pure/Sequence interface (see Pure/seq.ML);
wenzelm@4410
   192
wenzelm@3454
   193
paulson@3715
   194
*** General Changes ***
paulson@3715
   195
wenzelm@4174
   196
* hierachically structured name spaces (for consts, types, axms, thms
wenzelm@3943
   197
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
wenzelm@4108
   198
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
wenzelm@4108
   199
isatool fixdots ensures space after dots (e.g. "%x. x"); set
wenzelm@4174
   200
long_names for fully qualified output names; NOTE: ML programs
wenzelm@4174
   201
(special tactics, packages etc.) referring to internal names may have
wenzelm@4174
   202
to be adapted to cope with fully qualified names; in case of severe
wenzelm@4174
   203
backward campatibility problems try setting 'global_names' at compile
wenzelm@4174
   204
time to have enrything declared within a flat name space; one may also
wenzelm@4174
   205
fine tune name declarations in theories via the 'global' and 'local'
wenzelm@4174
   206
section;
wenzelm@4108
   207
wenzelm@4108
   208
* reimplemented the implicit simpset and claset using the new anytype
wenzelm@4108
   209
data filed in signatures; references simpset:simpset ref etc. are
wenzelm@4108
   210
replaced by functions simpset:unit->simpset and
wenzelm@4108
   211
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
wenzelm@4108
   212
to patch your ML files accordingly;
paulson@3856
   213
wenzelm@3857
   214
* HTML output now includes theory graph data for display with Java
wenzelm@3857
   215
applet or isatool browser; data generated automatically via isatool
wenzelm@3901
   216
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
wenzelm@3857
   217
paulson@3856
   218
* defs may now be conditional; improved rewrite_goals_tac to handle
paulson@3856
   219
conditional equations;
paulson@3856
   220
wenzelm@4174
   221
* defs now admits additional type arguments, using TYPE('a) syntax;
wenzelm@4174
   222
wenzelm@3901
   223
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
wenzelm@3901
   224
creates a new theory node; implicit merge of thms' signatures is
wenzelm@4112
   225
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
wenzelm@3901
   226
transfer:theory->thm->thm in (rare) cases;
wenzelm@3901
   227
wenzelm@3968
   228
* improved handling of draft signatures / theories; draft thms (and
wenzelm@3968
   229
ctyps, cterms) are automatically promoted to real ones;
wenzelm@3968
   230
wenzelm@3901
   231
* slightly changed interfaces for oracles: admit many per theory, named
wenzelm@3901
   232
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
wenzelm@3901
   233
wenzelm@3901
   234
* print_goals: optional output of const types (set show_consts and
wenzelm@3901
   235
show_types);
wenzelm@3851
   236
wenzelm@4388
   237
* improved output of warnings (###) and errors (***);
wenzelm@3697
   238
paulson@4178
   239
* subgoal_tac displays a warning if the new subgoal has type variables;
paulson@4178
   240
paulson@3715
   241
* removed old README and Makefiles;
wenzelm@3697
   242
paulson@3856
   243
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
wenzelm@3670
   244
paulson@3715
   245
* removed obsolete init_pps and init_database;
paulson@3715
   246
paulson@3715
   247
* deleted the obsolete tactical STATE, which was declared by
paulson@3715
   248
    fun STATE tacfun st = tacfun st st;
paulson@3715
   249
wenzelm@4388
   250
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
wenzelm@4388
   251
(which abbreviates $HOME);
wenzelm@4269
   252
wenzelm@4269
   253
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
wenzelm@4269
   254
use isatool fixseq to adapt your ML programs (this works for fully
wenzelm@4269
   255
qualified references to the Sequence structure only!);
wenzelm@4269
   256
wenzelm@4381
   257
* use_thy no longer requires writable current directory; it always
wenzelm@4381
   258
reloads .ML *and* .thy file, if either one is out of date;
wenzelm@4269
   259
paulson@3715
   260
paulson@3715
   261
*** Classical Reasoner ***
paulson@3715
   262
wenzelm@3744
   263
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
wenzelm@3744
   264
tactics that use classical reasoning to simplify a subgoal without
wenzelm@3744
   265
splitting it into several subgoals;
paulson@3715
   266
paulson@3719
   267
* Safe_tac: like safe_tac but uses the default claset;
paulson@3719
   268
paulson@3715
   269
paulson@3715
   270
*** Simplifier ***
paulson@3715
   271
paulson@3715
   272
* added simplification meta rules:
paulson@3715
   273
    (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3715
   274
paulson@3715
   275
* simplifier.ML no longer part of Pure -- has to be loaded by object
paulson@3715
   276
logics (again);
paulson@3715
   277
paulson@3715
   278
* added prems argument to simplification procedures;
paulson@3715
   279
paulson@4325
   280
* HOL, FOL, ZF: added infix function `addsplits':
paulson@4325
   281
  instead of `<simpset> setloop (split_tac <thms>)'
paulson@4325
   282
  you can simply write `<simpset> addsplits <thms>'
paulson@4325
   283
paulson@3715
   284
paulson@3715
   285
*** Syntax ***
paulson@3715
   286
wenzelm@4174
   287
* TYPE('a) syntax for type reflection terms;
wenzelm@4174
   288
wenzelm@3985
   289
* no longer handles consts with name "" -- declare as 'syntax' instead;
paulson@3856
   290
paulson@3856
   291
* pretty printer: changed order of mixfix annotation preference (again!);
wenzelm@3846
   292
paulson@3715
   293
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
paulson@3715
   294
paulson@3715
   295
paulson@3715
   296
*** HOL ***
paulson@3715
   297
oheimb@4207
   298
* HOL: there is a new splitter `split_asm_tac' that can be used e.g. 
oheimb@4189
   299
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
   300
nipkow@4035
   301
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
wenzelm@3985
   302
wenzelm@3985
   303
* HOL/Auth: new protocol proofs including some for the Internet
nipkow@4035
   304
  protocol TLS;
wenzelm@3985
   305
wenzelm@4125
   306
* HOL/Map: new theory of `maps' a la VDM;
nipkow@3982
   307
wenzelm@4335
   308
* HOL/simplifier: simplification procedures nat_cancel_sums for
wenzelm@4335
   309
cancelling out common nat summands from =, <, <= (in)equalities, or
wenzelm@4335
   310
differences; simplification procedures nat_cancel_factor for
wenzelm@4335
   311
cancelling common factor from =, <, <= (in)equalities over natural
wenzelm@4373
   312
sums; nat_cancel contains both kinds of procedures, it is installed by
wenzelm@4373
   313
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
wenzelm@4335
   314
nipkow@3580
   315
* HOL/simplifier: terms of the form
paulson@4325
   316
  `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)'  (or t=x)
nipkow@3580
   317
  are rewritten to
nipkow@4035
   318
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
nipkow@4035
   319
  and those of the form
paulson@4325
   320
  `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)'  (or t=x)
nipkow@4035
   321
  are rewritten to
nipkow@4035
   322
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
nipkow@4035
   323
nipkow@4035
   324
* HOL/datatype
nipkow@4035
   325
  Each datatype `t' now comes with a theorem `split_t_case' of the form
nipkow@3580
   326
nipkow@4035
   327
  P(t_case f1 ... fn x) =
nipkow@4035
   328
     ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
nipkow@4035
   329
        ...
oheimb@4189
   330
       (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
nipkow@4035
   331
     )
nipkow@4035
   332
oheimb@4930
   333
  and a theorem `split_t_case_asm' of the form
oheimb@4189
   334
oheimb@4189
   335
  P(t_case f1 ... fn x) =
oheimb@4189
   336
    ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
oheimb@4189
   337
        ...
oheimb@4189
   338
       (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
oheimb@4189
   339
     )
oheimb@4930
   340
  which can be added to a simpset via `addsplits'. The existing theorems
oheimb@4930
   341
  expand_list_case and expand_option_case have been renamed to
oheimb@4930
   342
  split_list_case and split_option_case.
oheimb@4189
   343
nipkow@4361
   344
* HOL/Arithmetic:
nipkow@4361
   345
  - `pred n' is automatically converted to `n-1'.
nipkow@4361
   346
    Users are strongly encouraged not to use `pred' any longer,
nipkow@4361
   347
    because it will disappear altogether at some point.
nipkow@4361
   348
  - Users are strongly encouraged to write "0 < n" rather than
nipkow@4361
   349
    "n ~= 0". Theorems and proof tools have been modified towards this
nipkow@4361
   350
    `standard'.
nipkow@4357
   351
nipkow@4502
   352
* HOL/Lists:
nipkow@4502
   353
  the function "set_of_list" has been renamed "set" (and its theorems too);
nipkow@4502
   354
  the function "nth" now takes its arguments in the reverse order and
nipkow@4502
   355
  has acquired the infix notation "!" as in "xs!n".
paulson@3570
   356
paulson@4154
   357
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
paulson@4154
   358
paulson@4154
   359
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
paulson@4154
   360
  specialist theorems (like UN1_I) are gone.  Similarly for (INT x.B x);
paulson@4154
   361
wenzelm@4575
   362
* HOL/record: extensible records with schematic structural subtyping
wenzelm@4575
   363
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
wenzelm@4575
   364
still lacks various theorems and concrete record syntax;
wenzelm@4575
   365
wenzelm@4125
   366
paulson@3715
   367
*** HOLCF ***
wenzelm@3535
   368
wenzelm@4125
   369
* removed "axioms" and "generated by" sections;
wenzelm@4125
   370
oheimb@4123
   371
* replaced "ops" section by extended "consts" section, which is capable of
wenzelm@4125
   372
  handling the continuous function space "->" directly;
wenzelm@4125
   373
wenzelm@4125
   374
* domain package:
wenzelm@4125
   375
  . proves theorems immediately and stores them in the theory,
wenzelm@4125
   376
  . creates hierachical name space,
wenzelm@4125
   377
  . now uses normal mixfix annotations (instead of cinfix...),
wenzelm@4125
   378
  . minor changes to some names and values (for consistency),
wenzelm@4125
   379
  . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
wenzelm@4125
   380
  . separator between mutual domain defs: changed "," to "and",
wenzelm@4125
   381
  . improved handling of sort constraints;  now they have to
wenzelm@4125
   382
    appear on the left-hand side of the equations only;
oheimb@4123
   383
oheimb@4123
   384
* fixed LAM <x,y,zs>.b syntax;
wenzelm@3567
   385
wenzelm@3744
   386
* added extended adm_tac to simplifier in HOLCF -- can now discharge
wenzelm@3744
   387
adm (%x. P (t x)), where P is chainfinite and t continuous;
wenzelm@3579
   388
wenzelm@3579
   389
paulson@3719
   390
*** FOL and ZF ***
paulson@3719
   391
oheimb@4207
   392
* FOL: there is a new splitter `split_asm_tac' that can be used e.g. 
oheimb@4189
   393
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
   394
wenzelm@3744
   395
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
wenzelm@3744
   396
in HOL, they strip ALL and --> from proved theorems;
wenzelm@3744
   397
paulson@3719
   398
wenzelm@3579
   399
wenzelm@3006
   400
New in Isabelle94-8 (May 1997)
wenzelm@3006
   401
------------------------------
wenzelm@2654
   402
paulson@3002
   403
*** General Changes ***
paulson@3002
   404
paulson@3002
   405
* new utilities to build / run / maintain Isabelle etc. (in parts
paulson@3002
   406
still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2971
   407
wenzelm@3205
   408
* new 'Isabelle System Manual';
wenzelm@3205
   409
wenzelm@2825
   410
* INSTALL text, together with ./configure and ./build scripts;
wenzelm@2773
   411
wenzelm@3006
   412
* reimplemented type inference for greater efficiency, better error
wenzelm@3006
   413
messages and clean internal interface;
paulson@3002
   414
paulson@3002
   415
* prlim command for dealing with lots of subgoals (an easier way of
paulson@3002
   416
setting goals_limit);
paulson@3002
   417
wenzelm@3006
   418
wenzelm@3006
   419
*** Syntax ***
paulson@3002
   420
wenzelm@3116
   421
* supports alternative (named) syntax tables (parser and pretty
wenzelm@3116
   422
printer); internal interface is provided by add_modesyntax(_i);
wenzelm@3116
   423
paulson@3002
   424
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
paulson@3002
   425
be used in conjunction with the Isabelle symbol font; uses the
paulson@3002
   426
"symbols" syntax table;
paulson@3002
   427
wenzelm@2705
   428
* added token_translation interface (may translate name tokens in
wenzelm@2756
   429
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
wenzelm@3116
   430
the current print_mode); IMPORTANT: user print translation functions
wenzelm@3116
   431
are responsible for marking newly introduced bounds
wenzelm@3116
   432
(Syntax.mark_boundT);
wenzelm@2705
   433
wenzelm@2730
   434
* token translations for modes "xterm" and "xterm_color" that display
wenzelm@3006
   435
names in bold, underline etc. or colors (which requires a color
wenzelm@3006
   436
version of xterm);
wenzelm@2730
   437
paulson@3002
   438
* infixes may now be declared with names independent of their syntax;
paulson@3002
   439
paulson@3002
   440
* added typed_print_translation (like print_translation, but may
paulson@3002
   441
access type of constant);
paulson@3002
   442
wenzelm@3006
   443
paulson@3002
   444
*** Classical Reasoner ***
paulson@3002
   445
paulson@3002
   446
Blast_tac: a new tactic!  It is often more powerful than fast_tac, but has
paulson@3002
   447
some limitations.  Blast_tac...
paulson@3002
   448
  + ignores addss, addbefore, addafter; this restriction is intrinsic
paulson@3002
   449
  + ignores elimination rules that don't have the correct format
paulson@3002
   450
	(the conclusion MUST be a formula variable)
paulson@3002
   451
  + ignores types, which can make HOL proofs fail
paulson@3002
   452
  + rules must not require higher-order unification, e.g. apply_type in ZF
paulson@3002
   453
    [message "Function Var's argument not a bound variable" relates to this]
paulson@3002
   454
  + its proof strategy is more general but can actually be slower
paulson@3002
   455
wenzelm@3107
   456
* substitution with equality assumptions no longer permutes other
wenzelm@3107
   457
assumptions;
paulson@3002
   458
paulson@3002
   459
* minor changes in semantics of addafter (now called addaltern); renamed
paulson@3002
   460
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
wenzelm@3107
   461
(and access functions for it);
paulson@3002
   462
oheimb@3317
   463
* improved combination of classical reasoner and simplifier: 
oheimb@3317
   464
  + functions for handling clasimpsets
oheimb@3317
   465
  + improvement of addss: now the simplifier is called _after_ the
oheimb@3317
   466
    safe steps.
oheimb@3317
   467
  + safe variant of addss called addSss: uses safe simplifications
oheimb@3317
   468
    _during_ the safe steps. It is more complete as it allows multiple 
oheimb@3317
   469
    instantiations of unknowns (e.g. with slow_tac).
wenzelm@3006
   470
paulson@3002
   471
*** Simplifier ***
paulson@3002
   472
wenzelm@3006
   473
* added interface for simplification procedures (functions that
wenzelm@3006
   474
produce *proven* rewrite rules on the fly, depending on current
wenzelm@3006
   475
redex);
wenzelm@3006
   476
wenzelm@3006
   477
* ordering on terms as parameter (used for ordered rewriting);
wenzelm@3006
   478
wenzelm@3107
   479
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
paulson@3002
   480
paulson@3002
   481
* the solver is now split into a safe and an unsafe part.
paulson@3002
   482
This should be invisible for the normal user, except that the
paulson@3002
   483
functions setsolver and addsolver have been renamed to setSolver and
wenzelm@3107
   484
addSolver; added safe_asm_full_simp_tac;
paulson@3002
   485
paulson@3002
   486
paulson@3002
   487
*** HOL ***
paulson@3002
   488
nipkow@3042
   489
* a generic induction tactic `induct_tac' which works for all datatypes and
wenzelm@3107
   490
also for type `nat';
nipkow@3042
   491
nipkow@3316
   492
* a generic case distinction tactic `exhaust_tac' which works for all
nipkow@3316
   493
datatypes and also for type `nat';
nipkow@3316
   494
nipkow@3316
   495
* each datatype comes with a function `size';
nipkow@3316
   496
paulson@3002
   497
* patterns in case expressions allow tuple patterns as arguments to
wenzelm@3107
   498
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
paulson@3002
   499
paulson@3002
   500
* primrec now also works with type nat;
paulson@3002
   501
paulson@3338
   502
* recdef: a new declaration form, allows general recursive functions to be
paulson@3338
   503
defined in theory files.  See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
paulson@3338
   504
paulson@3002
   505
* the constant for negation has been renamed from "not" to "Not" to
wenzelm@3107
   506
harmonize with FOL, ZF, LK, etc.;
paulson@3002
   507
wenzelm@3107
   508
* HOL/ex/LFilter theory of a corecursive "filter" functional for
wenzelm@3107
   509
infinite lists;
paulson@3002
   510
wenzelm@3227
   511
* HOL/Modelcheck demonstrates invocation of model checker oracle;
wenzelm@3227
   512
paulson@3002
   513
* HOL/ex/Ring.thy declares cring_simp, which solves equational
paulson@3002
   514
problems in commutative rings, using axiomatic type classes for + and *;
paulson@3002
   515
paulson@3002
   516
* more examples in HOL/MiniML and HOL/Auth;
paulson@3002
   517
paulson@3002
   518
* more default rewrite rules for quantifiers, union/intersection;
paulson@3002
   519
nipkow@3321
   520
* a new constant `arbitrary == @x.False';
nipkow@3321
   521
wenzelm@3107
   522
* HOLCF/IOA replaces old HOL/IOA;
wenzelm@3107
   523
slotosch@2653
   524
* HOLCF changes: derived all rules and arities 
slotosch@2653
   525
  + axiomatic type classes instead of classes 
slotosch@2653
   526
  + typedef instead of faking type definitions
paulson@2747
   527
  + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
wenzelm@2730
   528
  + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
slotosch@2653
   529
  + eliminated the types void, one, tr
slotosch@2653
   530
  + use unit lift and bool lift (with translations) instead of one and tr
slotosch@2653
   531
  + eliminated blift from Lift3.thy (use Def instead of blift)
wenzelm@3107
   532
  all eliminated rules are derived as theorems --> no visible changes ;
oheimb@2649
   533
wenzelm@3006
   534
paulson@3002
   535
*** ZF ***
wenzelm@2553
   536
paulson@2865
   537
* ZF now has Fast_tac, Simp_tac and Auto_tac.  Union_iff is a now a default
paulson@2865
   538
rewrite rule; this may affect some proofs.  eq_cs is gone but can be put back
paulson@2865
   539
as ZF_cs addSIs [equalityI];
wenzelm@2553
   540
wenzelm@2554
   541
wenzelm@2732
   542
wenzelm@2553
   543
New in Isabelle94-7 (November 96)
wenzelm@2553
   544
---------------------------------
wenzelm@2553
   545
wenzelm@2553
   546
* allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553
   547
wenzelm@2554
   548
* super-linear speedup for large simplifications;
wenzelm@2554
   549
wenzelm@2554
   550
* FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554
   551
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554
   552
FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554
   553
all_simps); De Morgan laws are also now included, by default;
wenzelm@2554
   554
wenzelm@2554
   555
* improved printing of ==>  :  ~:
wenzelm@2554
   556
wenzelm@2554
   557
* new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554
   558
and Modal (thanks to Sara Kalvala);
wenzelm@2554
   559
wenzelm@2554
   560
* HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554
   561
wenzelm@2554
   562
* HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554
   563
examples on HOL/Auth);
wenzelm@2554
   564
wenzelm@2554
   565
* HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554
   566
the rewriter and classical reasoner simultaneously;
wenzelm@2554
   567
wenzelm@2554
   568
* function uresult no longer returns theorems in "standard" format;
wenzelm@2554
   569
regain previous version by: val uresult = standard o uresult;
wenzelm@2554
   570
wenzelm@2554
   571
wenzelm@2554
   572
wenzelm@2554
   573
New in Isabelle94-6
wenzelm@2554
   574
-------------------
wenzelm@2554
   575
wenzelm@2554
   576
* oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554
   577
external reasoners, which may deliver results as theorems;
wenzelm@2554
   578
wenzelm@2554
   579
* proof objects (in particular record all uses of oracles);
wenzelm@2554
   580
wenzelm@2554
   581
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554
   582
wenzelm@2554
   583
* "constdefs" section in theory files;
wenzelm@2554
   584
wenzelm@2554
   585
* "primrec" section (HOL) no longer requires names;
wenzelm@2554
   586
wenzelm@2554
   587
* internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554
   588
wenzelm@2554
   589
wenzelm@2554
   590
wenzelm@2554
   591
New in Isabelle94-5
wenzelm@2554
   592
-------------------
wenzelm@2554
   593
wenzelm@2554
   594
* reduced space requirements;
wenzelm@2554
   595
wenzelm@2554
   596
* automatic HTML generation from theories;
wenzelm@2554
   597
wenzelm@2554
   598
* theory files no longer require "..." (quotes) around most types;
wenzelm@2554
   599
wenzelm@2554
   600
* new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554
   601
wenzelm@2554
   602
* non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554
   603
wenzelm@2553
   604
paulson@2557
   605
paulson@2557
   606
New in Isabelle94-4
paulson@2557
   607
-------------------
paulson@2557
   608
paulson@2747
   609
* greatly reduced space requirements;
paulson@2557
   610
paulson@2557
   611
* theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557
   612
paulson@2557
   613
* searchable theorem database (see the section "Retrieving theorems" on 
paulson@2557
   614
page 8 of the Reference Manual);
paulson@2557
   615
paulson@2557
   616
* new examples, including Grabczewski's monumental case study of the
paulson@2557
   617
Axiom of Choice;
paulson@2557
   618
paulson@2557
   619
* The previous version of HOL renamed to Old_HOL;
paulson@2557
   620
paulson@2557
   621
* The new version of HOL (previously called CHOL) uses a curried syntax 
paulson@2557
   622
for functions.  Application looks like f a b instead of f(a,b);
paulson@2557
   623
paulson@2557
   624
* Mutually recursive inductive definitions finally work in HOL;
paulson@2557
   625
paulson@2557
   626
* In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557
   627
translates to the operator "split";
paulson@2557
   628
paulson@2557
   629
paulson@2557
   630
paulson@2557
   631
New in Isabelle94-3
paulson@2557
   632
-------------------
paulson@2557
   633
paulson@2557
   634
* new infix operator, addss, allowing the classical reasoner to 
paulson@2557
   635
perform simplification at each step of its search.  Example:
paulson@2557
   636
	fast_tac (cs addss ss)
paulson@2557
   637
paulson@2557
   638
* a new logic, CHOL, the same as HOL, but with a curried syntax 
paulson@2557
   639
for functions.  Application looks like f a b instead of f(a,b).  Also pairs 
paulson@2557
   640
look like (a,b) instead of <a,b>;
paulson@2557
   641
paulson@2557
   642
* PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557
   643
paulson@2557
   644
* In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557
   645
It translates to the operator "split".  A new theory of integers is available;
paulson@2557
   646
paulson@2557
   647
* In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557
   648
Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
paulson@2557
   649
paulson@2557
   650
* Many new examples: I/O automata, Church-Rosser theorem, equivalents 
paulson@2557
   651
of the Axiom of Choice;
paulson@2557
   652
paulson@2557
   653
paulson@2557
   654
paulson@2557
   655
New in Isabelle94-2
paulson@2557
   656
-------------------
paulson@2557
   657
paulson@2557
   658
* Significantly faster resolution;  
paulson@2557
   659
paulson@2557
   660
* the different sections in a .thy file can now be mixed and repeated
paulson@2557
   661
freely;
paulson@2557
   662
paulson@2557
   663
* Database of theorems for FOL, HOL and ZF.  New
paulson@2557
   664
commands including qed, qed_goal and bind_thm store theorems in the database.
paulson@2557
   665
paulson@2557
   666
* Simple database queries: return a named theorem (get_thm) or all theorems of
paulson@2557
   667
a given theory (thms_of), or find out what theory a theorem was proved in
paulson@2557
   668
(theory_of_thm);
paulson@2557
   669
paulson@2557
   670
* Bugs fixed in the inductive definition and datatype packages;
paulson@2557
   671
paulson@2557
   672
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
paulson@2557
   673
and HOL_dup_cs obsolete;
paulson@2557
   674
paulson@2557
   675
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
paulson@2557
   676
have been removed;
paulson@2557
   677
paulson@2557
   678
* Simpler definition of function space in ZF;
paulson@2557
   679
paulson@2557
   680
* new results about cardinal and ordinal arithmetic in ZF;
paulson@2557
   681
paulson@2557
   682
* 'subtype' facility in HOL for introducing new types as subsets of existing
paulson@2557
   683
types;
paulson@2557
   684
paulson@2557
   685
wenzelm@2553
   686
$Id$