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