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