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