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