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