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