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