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