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