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