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