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