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