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