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