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