NEWS
author paulson
Mon Sep 29 11:28:23 1997 +0200 (1997-09-29)
changeset 3719 6a142dab2a08
parent 3715 6e074b41c735
child 3744 9921561ade57
permissions -rw-r--r--
Safe_tac; qed_spec_mp in FOL
wenzelm@2553
     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
paulson@3715
    10
* improved output of warnings / errors;
wenzelm@3697
    11
paulson@3715
    12
* removed old README and Makefiles;
wenzelm@3697
    13
paulson@3715
    14
* defs may now be conditional; improved rewrite_goals_tac to handle
paulson@3715
    15
conditional equations;
mueller@3671
    16
wenzelm@3670
    17
* replaced print_goals_ref hook by print_current_goals_fn and
wenzelm@3670
    18
  result_error_fn;
wenzelm@3670
    19
paulson@3715
    20
* removed obsolete init_pps and init_database;
paulson@3715
    21
paulson@3715
    22
* deleted the obsolete tactical STATE, which was declared by
paulson@3715
    23
    fun STATE tacfun st = tacfun st st;
paulson@3715
    24
paulson@3715
    25
paulson@3715
    26
*** Classical Reasoner ***
paulson@3715
    27
paulson@3715
    28
* Clarify_tac. clarify_tac, clarify_step_tac, Clarify_step_tac :
paulson@3715
    29
   new tactics that use classical reasoning to simplify a subgoal 
paulson@3715
    30
   without splitting it into several subgoals;
paulson@3715
    31
paulson@3719
    32
* Safe_tac: like safe_tac but uses the default claset;
paulson@3719
    33
paulson@3715
    34
paulson@3715
    35
*** Simplifier ***
paulson@3715
    36
paulson@3715
    37
* added simplification meta rules:
paulson@3715
    38
    (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3715
    39
paulson@3715
    40
* simplifier.ML no longer part of Pure -- has to be loaded by object
paulson@3715
    41
logics (again);
paulson@3715
    42
paulson@3715
    43
* added prems argument to simplification procedures;
paulson@3715
    44
paulson@3715
    45
paulson@3715
    46
*** Syntax ***
paulson@3715
    47
paulson@3715
    48
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
paulson@3715
    49
paulson@3715
    50
paulson@3715
    51
*** HOL ***
paulson@3715
    52
nipkow@3580
    53
* HOL/simplifier: terms of the form
nipkow@3580
    54
  `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
nipkow@3580
    55
  are rewritten to
nipkow@3580
    56
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)'
nipkow@3580
    57
paulson@3658
    58
* HOL/Lists: the function "set_of_list" has been renamed "set" (and its 
wenzelm@3670
    59
  theorems too);
paulson@3570
    60
wenzelm@3454
    61
paulson@3715
    62
*** HOLCF ***
wenzelm@3535
    63
paulson@3715
    64
* HOLCF: fixed LAM <x,y,zs>.b syntax (may break some unusual cases);
wenzelm@3567
    65
paulson@3715
    66
* added extended adm_tac to simplifier in HOLCF.  Can now discharge
paulson@3715
    67
  adm (%x. P (t x)), where P is chainfinite and t continuous.
wenzelm@3579
    68
wenzelm@3579
    69
paulson@3719
    70
*** FOL and ZF ***
paulson@3719
    71
paulson@3719
    72
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available.  As 
paulson@3719
    73
  in HOL, they strip ALL and --> from proved theorems;
paulson@3719
    74
wenzelm@3579
    75
wenzelm@3006
    76
New in Isabelle94-8 (May 1997)
wenzelm@3006
    77
------------------------------
wenzelm@2654
    78
paulson@3002
    79
*** General Changes ***
paulson@3002
    80
paulson@3002
    81
* new utilities to build / run / maintain Isabelle etc. (in parts
paulson@3002
    82
still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2971
    83
wenzelm@3205
    84
* new 'Isabelle System Manual';
wenzelm@3205
    85
wenzelm@2825
    86
* INSTALL text, together with ./configure and ./build scripts;
wenzelm@2773
    87
wenzelm@3006
    88
* reimplemented type inference for greater efficiency, better error
wenzelm@3006
    89
messages and clean internal interface;
paulson@3002
    90
paulson@3002
    91
* prlim command for dealing with lots of subgoals (an easier way of
paulson@3002
    92
setting goals_limit);
paulson@3002
    93
wenzelm@3006
    94
wenzelm@3006
    95
*** Syntax ***
paulson@3002
    96
wenzelm@3116
    97
* supports alternative (named) syntax tables (parser and pretty
wenzelm@3116
    98
printer); internal interface is provided by add_modesyntax(_i);
wenzelm@3116
    99
paulson@3002
   100
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
paulson@3002
   101
be used in conjunction with the Isabelle symbol font; uses the
paulson@3002
   102
"symbols" syntax table;
paulson@3002
   103
wenzelm@2705
   104
* added token_translation interface (may translate name tokens in
wenzelm@2756
   105
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
wenzelm@3116
   106
the current print_mode); IMPORTANT: user print translation functions
wenzelm@3116
   107
are responsible for marking newly introduced bounds
wenzelm@3116
   108
(Syntax.mark_boundT);
wenzelm@2705
   109
wenzelm@2730
   110
* token translations for modes "xterm" and "xterm_color" that display
wenzelm@3006
   111
names in bold, underline etc. or colors (which requires a color
wenzelm@3006
   112
version of xterm);
wenzelm@2730
   113
paulson@3002
   114
* infixes may now be declared with names independent of their syntax;
paulson@3002
   115
paulson@3002
   116
* added typed_print_translation (like print_translation, but may
paulson@3002
   117
access type of constant);
paulson@3002
   118
wenzelm@3006
   119
paulson@3002
   120
*** Classical Reasoner ***
paulson@3002
   121
paulson@3002
   122
Blast_tac: a new tactic!  It is often more powerful than fast_tac, but has
paulson@3002
   123
some limitations.  Blast_tac...
paulson@3002
   124
  + ignores addss, addbefore, addafter; this restriction is intrinsic
paulson@3002
   125
  + ignores elimination rules that don't have the correct format
paulson@3002
   126
	(the conclusion MUST be a formula variable)
paulson@3002
   127
  + ignores types, which can make HOL proofs fail
paulson@3002
   128
  + rules must not require higher-order unification, e.g. apply_type in ZF
paulson@3002
   129
    [message "Function Var's argument not a bound variable" relates to this]
paulson@3002
   130
  + its proof strategy is more general but can actually be slower
paulson@3002
   131
wenzelm@3107
   132
* substitution with equality assumptions no longer permutes other
wenzelm@3107
   133
assumptions;
paulson@3002
   134
paulson@3002
   135
* minor changes in semantics of addafter (now called addaltern); renamed
paulson@3002
   136
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
wenzelm@3107
   137
(and access functions for it);
paulson@3002
   138
oheimb@3317
   139
* improved combination of classical reasoner and simplifier: 
oheimb@3317
   140
  + functions for handling clasimpsets
oheimb@3317
   141
  + improvement of addss: now the simplifier is called _after_ the
oheimb@3317
   142
    safe steps.
oheimb@3317
   143
  + safe variant of addss called addSss: uses safe simplifications
oheimb@3317
   144
    _during_ the safe steps. It is more complete as it allows multiple 
oheimb@3317
   145
    instantiations of unknowns (e.g. with slow_tac).
wenzelm@3006
   146
paulson@3002
   147
*** Simplifier ***
paulson@3002
   148
wenzelm@3006
   149
* added interface for simplification procedures (functions that
wenzelm@3006
   150
produce *proven* rewrite rules on the fly, depending on current
wenzelm@3006
   151
redex);
wenzelm@3006
   152
wenzelm@3006
   153
* ordering on terms as parameter (used for ordered rewriting);
wenzelm@3006
   154
wenzelm@3107
   155
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
paulson@3002
   156
paulson@3002
   157
* the solver is now split into a safe and an unsafe part.
paulson@3002
   158
This should be invisible for the normal user, except that the
paulson@3002
   159
functions setsolver and addsolver have been renamed to setSolver and
wenzelm@3107
   160
addSolver; added safe_asm_full_simp_tac;
paulson@3002
   161
paulson@3002
   162
paulson@3002
   163
*** HOL ***
paulson@3002
   164
nipkow@3042
   165
* a generic induction tactic `induct_tac' which works for all datatypes and
wenzelm@3107
   166
also for type `nat';
nipkow@3042
   167
nipkow@3316
   168
* a generic case distinction tactic `exhaust_tac' which works for all
nipkow@3316
   169
datatypes and also for type `nat';
nipkow@3316
   170
nipkow@3316
   171
* each datatype comes with a function `size';
nipkow@3316
   172
paulson@3002
   173
* patterns in case expressions allow tuple patterns as arguments to
wenzelm@3107
   174
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
paulson@3002
   175
paulson@3002
   176
* primrec now also works with type nat;
paulson@3002
   177
paulson@3338
   178
* recdef: a new declaration form, allows general recursive functions to be
paulson@3338
   179
defined in theory files.  See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
paulson@3338
   180
paulson@3002
   181
* the constant for negation has been renamed from "not" to "Not" to
wenzelm@3107
   182
harmonize with FOL, ZF, LK, etc.;
paulson@3002
   183
wenzelm@3107
   184
* HOL/ex/LFilter theory of a corecursive "filter" functional for
wenzelm@3107
   185
infinite lists;
paulson@3002
   186
wenzelm@3227
   187
* HOL/Modelcheck demonstrates invocation of model checker oracle;
wenzelm@3227
   188
paulson@3002
   189
* HOL/ex/Ring.thy declares cring_simp, which solves equational
paulson@3002
   190
problems in commutative rings, using axiomatic type classes for + and *;
paulson@3002
   191
paulson@3002
   192
* more examples in HOL/MiniML and HOL/Auth;
paulson@3002
   193
paulson@3002
   194
* more default rewrite rules for quantifiers, union/intersection;
paulson@3002
   195
nipkow@3321
   196
* a new constant `arbitrary == @x.False';
nipkow@3321
   197
wenzelm@3107
   198
* HOLCF/IOA replaces old HOL/IOA;
wenzelm@3107
   199
slotosch@2653
   200
* HOLCF changes: derived all rules and arities 
slotosch@2653
   201
  + axiomatic type classes instead of classes 
slotosch@2653
   202
  + typedef instead of faking type definitions
paulson@2747
   203
  + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
wenzelm@2730
   204
  + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
slotosch@2653
   205
  + eliminated the types void, one, tr
slotosch@2653
   206
  + use unit lift and bool lift (with translations) instead of one and tr
slotosch@2653
   207
  + eliminated blift from Lift3.thy (use Def instead of blift)
wenzelm@3107
   208
  all eliminated rules are derived as theorems --> no visible changes ;
oheimb@2649
   209
wenzelm@3006
   210
paulson@3002
   211
*** ZF ***
wenzelm@2553
   212
paulson@2865
   213
* ZF now has Fast_tac, Simp_tac and Auto_tac.  Union_iff is a now a default
paulson@2865
   214
rewrite rule; this may affect some proofs.  eq_cs is gone but can be put back
paulson@2865
   215
as ZF_cs addSIs [equalityI];
wenzelm@2553
   216
wenzelm@2554
   217
wenzelm@2732
   218
wenzelm@2553
   219
New in Isabelle94-7 (November 96)
wenzelm@2553
   220
---------------------------------
wenzelm@2553
   221
wenzelm@2553
   222
* allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553
   223
wenzelm@2554
   224
* super-linear speedup for large simplifications;
wenzelm@2554
   225
wenzelm@2554
   226
* FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554
   227
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554
   228
FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554
   229
all_simps); De Morgan laws are also now included, by default;
wenzelm@2554
   230
wenzelm@2554
   231
* improved printing of ==>  :  ~:
wenzelm@2554
   232
wenzelm@2554
   233
* new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554
   234
and Modal (thanks to Sara Kalvala);
wenzelm@2554
   235
wenzelm@2554
   236
* HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554
   237
wenzelm@2554
   238
* HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554
   239
examples on HOL/Auth);
wenzelm@2554
   240
wenzelm@2554
   241
* HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554
   242
the rewriter and classical reasoner simultaneously;
wenzelm@2554
   243
wenzelm@2554
   244
* function uresult no longer returns theorems in "standard" format;
wenzelm@2554
   245
regain previous version by: val uresult = standard o uresult;
wenzelm@2554
   246
wenzelm@2554
   247
wenzelm@2554
   248
wenzelm@2554
   249
New in Isabelle94-6
wenzelm@2554
   250
-------------------
wenzelm@2554
   251
wenzelm@2554
   252
* oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554
   253
external reasoners, which may deliver results as theorems;
wenzelm@2554
   254
wenzelm@2554
   255
* proof objects (in particular record all uses of oracles);
wenzelm@2554
   256
wenzelm@2554
   257
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554
   258
wenzelm@2554
   259
* "constdefs" section in theory files;
wenzelm@2554
   260
wenzelm@2554
   261
* "primrec" section (HOL) no longer requires names;
wenzelm@2554
   262
wenzelm@2554
   263
* internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554
   264
wenzelm@2554
   265
wenzelm@2554
   266
wenzelm@2554
   267
New in Isabelle94-5
wenzelm@2554
   268
-------------------
wenzelm@2554
   269
wenzelm@2554
   270
* reduced space requirements;
wenzelm@2554
   271
wenzelm@2554
   272
* automatic HTML generation from theories;
wenzelm@2554
   273
wenzelm@2554
   274
* theory files no longer require "..." (quotes) around most types;
wenzelm@2554
   275
wenzelm@2554
   276
* new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554
   277
wenzelm@2554
   278
* non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554
   279
wenzelm@2553
   280
paulson@2557
   281
paulson@2557
   282
New in Isabelle94-4
paulson@2557
   283
-------------------
paulson@2557
   284
paulson@2747
   285
* greatly reduced space requirements;
paulson@2557
   286
paulson@2557
   287
* theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557
   288
paulson@2557
   289
* searchable theorem database (see the section "Retrieving theorems" on 
paulson@2557
   290
page 8 of the Reference Manual);
paulson@2557
   291
paulson@2557
   292
* new examples, including Grabczewski's monumental case study of the
paulson@2557
   293
Axiom of Choice;
paulson@2557
   294
paulson@2557
   295
* The previous version of HOL renamed to Old_HOL;
paulson@2557
   296
paulson@2557
   297
* The new version of HOL (previously called CHOL) uses a curried syntax 
paulson@2557
   298
for functions.  Application looks like f a b instead of f(a,b);
paulson@2557
   299
paulson@2557
   300
* Mutually recursive inductive definitions finally work in HOL;
paulson@2557
   301
paulson@2557
   302
* In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557
   303
translates to the operator "split";
paulson@2557
   304
paulson@2557
   305
paulson@2557
   306
paulson@2557
   307
New in Isabelle94-3
paulson@2557
   308
-------------------
paulson@2557
   309
paulson@2557
   310
* new infix operator, addss, allowing the classical reasoner to 
paulson@2557
   311
perform simplification at each step of its search.  Example:
paulson@2557
   312
	fast_tac (cs addss ss)
paulson@2557
   313
paulson@2557
   314
* a new logic, CHOL, the same as HOL, but with a curried syntax 
paulson@2557
   315
for functions.  Application looks like f a b instead of f(a,b).  Also pairs 
paulson@2557
   316
look like (a,b) instead of <a,b>;
paulson@2557
   317
paulson@2557
   318
* PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557
   319
paulson@2557
   320
* In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557
   321
It translates to the operator "split".  A new theory of integers is available;
paulson@2557
   322
paulson@2557
   323
* In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557
   324
Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
paulson@2557
   325
paulson@2557
   326
* Many new examples: I/O automata, Church-Rosser theorem, equivalents 
paulson@2557
   327
of the Axiom of Choice;
paulson@2557
   328
paulson@2557
   329
paulson@2557
   330
paulson@2557
   331
New in Isabelle94-2
paulson@2557
   332
-------------------
paulson@2557
   333
paulson@2557
   334
* Significantly faster resolution;  
paulson@2557
   335
paulson@2557
   336
* the different sections in a .thy file can now be mixed and repeated
paulson@2557
   337
freely;
paulson@2557
   338
paulson@2557
   339
* Database of theorems for FOL, HOL and ZF.  New
paulson@2557
   340
commands including qed, qed_goal and bind_thm store theorems in the database.
paulson@2557
   341
paulson@2557
   342
* Simple database queries: return a named theorem (get_thm) or all theorems of
paulson@2557
   343
a given theory (thms_of), or find out what theory a theorem was proved in
paulson@2557
   344
(theory_of_thm);
paulson@2557
   345
paulson@2557
   346
* Bugs fixed in the inductive definition and datatype packages;
paulson@2557
   347
paulson@2557
   348
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
paulson@2557
   349
and HOL_dup_cs obsolete;
paulson@2557
   350
paulson@2557
   351
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
paulson@2557
   352
have been removed;
paulson@2557
   353
paulson@2557
   354
* Simpler definition of function space in ZF;
paulson@2557
   355
paulson@2557
   356
* new results about cardinal and ordinal arithmetic in ZF;
paulson@2557
   357
paulson@2557
   358
* 'subtype' facility in HOL for introducing new types as subsets of existing
paulson@2557
   359
types;
paulson@2557
   360
paulson@2557
   361
wenzelm@2553
   362
$Id$