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