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