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