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