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