NEWS
author oheimb
Mon Feb 17 16:50:59 1997 +0100 (1997-02-17)
changeset 2649 2edc5b01e5a7
parent 2639 2c38796b33b9
child 2653 f1a6997cdc06
permissions -rw-r--r--
improved description of recent changes
wenzelm@2553
     1
wenzelm@2553
     2
Isabelle NEWS -- history of user-visible changes
wenzelm@2553
     3
================================================
wenzelm@2553
     4
oheimb@2649
     5
New in Isabelle94-8 (??????????? 1997 FIXME)
oheimb@2649
     6
---------------------------------------
oheimb@2649
     7
oheimb@2639
     8
* simplifier: new functions delcongs, deleqcongs, and Delcongs. richer rep_ss.
oheimb@2639
     9
oheimb@2639
    10
* simplifier: the solver is now split into a safe and an unsafe part.
oheimb@2639
    11
  This should be invisible for the normal user, except that the functions
oheimb@2639
    12
  setsolver and addsolver have been renamed to setSolver and addSolver.
oheimb@2639
    13
  added safe_asm_full_simp_tac. 
oheimb@2639
    14
oheimb@2649
    15
* classical reasoner: little changes in semantics of addafter (now: addaltern),
oheimb@2649
    16
  renamed setwrapper to setWrapper, addwrapper to addWrapper
oheimb@2639
    17
  added safe wrapper (and access functions for it)
oheimb@2639
    18
oheimb@2649
    19
* improved combination of classical reasoner and simplifier: 
oheimb@2639
    20
  new addss, auto_tac, functions for handling clasimpsets, ...
oheimb@2639
    21
  Now, the simplification is safe (therefore moved to safe_step_tac) and thus
oheimb@2649
    22
  more complete, as multiple instantiation of unknowns (with slow_tac) possible
oheimb@2649
    23
  COULD MAKE EXISTING PROOFS FAIL; in case of problems with unstable old proofs:
oheimb@2649
    24
                                   use unsafe_addss and unsafe_auto_tac
wenzelm@2553
    25
wenzelm@2556
    26
* HOL: primrec now also works with type nat;
wenzelm@2553
    27
wenzelm@2553
    28
* new utilities to build / run / maintain Isabelle etc. (in parts
wenzelm@2555
    29
still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2553
    30
wenzelm@2553
    31
* simplifier: termless order as parameter; added interface for
wenzelm@2553
    32
simplification procedures (functions that produce *proven* rewrite
wenzelm@2553
    33
rules on the fly, depending on current redex);
wenzelm@2553
    34
wenzelm@2553
    35
* now supports alternative (named) syntax tables (parser and pretty
wenzelm@2553
    36
printer); internal interface is provided by add_modesyntax(_i);
wenzelm@2553
    37
wenzelm@2553
    38
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
wenzelm@2553
    39
be used in conjunction with the isabelle symbol font; uses the
wenzelm@2553
    40
"symbols" syntax table;
wenzelm@2553
    41
wenzelm@2553
    42
* infixes may now be declared with names independent of their syntax;
wenzelm@2553
    43
wenzelm@2555
    44
* added typed_print_translation (like print_translation, but may
wenzelm@2555
    45
access type of constant);
wenzelm@2553
    46
wenzelm@2553
    47
* prlim command for dealing with lots of subgoals (an easier way of
wenzelm@2553
    48
setting goals_limit);
wenzelm@2553
    49
wenzelm@2553
    50
* HOL/ex/Ring.thy declares cring_simp, which solves equational
wenzelm@2553
    51
problems in commutative rings, using axiomatic type classes for + and *;
wenzelm@2553
    52
wenzelm@2553
    53
* ZF now has Fast_tac, Simp_tac and Auto_tac.  WARNING: don't use
wenzelm@2553
    54
ZF.thy anymore!  Contains fewer defs and could make a bogus simpset.
wenzelm@2553
    55
Beware of Union_iff.  eq_cs is gone, can be put back as ZF_cs addSIs
wenzelm@2553
    56
[equalityI];
wenzelm@2553
    57
wenzelm@2553
    58
* more examples in HOL/MiniML and HOL/Auth;
wenzelm@2553
    59
wenzelm@2553
    60
* more default rewrite rules in HOL for quantifiers, union/intersection;
wenzelm@2553
    61
wenzelm@2556
    62
* the NEWS file;
wenzelm@2553
    63
wenzelm@2554
    64
wenzelm@2553
    65
New in Isabelle94-7 (November 96)
wenzelm@2553
    66
---------------------------------
wenzelm@2553
    67
wenzelm@2553
    68
* allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553
    69
wenzelm@2554
    70
* super-linear speedup for large simplifications;
wenzelm@2554
    71
wenzelm@2554
    72
* FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554
    73
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554
    74
FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554
    75
all_simps); De Morgan laws are also now included, by default;
wenzelm@2554
    76
wenzelm@2554
    77
* improved printing of ==>  :  ~:
wenzelm@2554
    78
wenzelm@2554
    79
* new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554
    80
and Modal (thanks to Sara Kalvala);
wenzelm@2554
    81
wenzelm@2554
    82
* HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554
    83
wenzelm@2554
    84
* HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554
    85
examples on HOL/Auth);
wenzelm@2554
    86
wenzelm@2554
    87
* HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554
    88
the rewriter and classical reasoner simultaneously;
wenzelm@2554
    89
wenzelm@2554
    90
* function uresult no longer returns theorems in "standard" format;
wenzelm@2554
    91
regain previous version by: val uresult = standard o uresult;
wenzelm@2554
    92
wenzelm@2554
    93
wenzelm@2554
    94
wenzelm@2554
    95
New in Isabelle94-6
wenzelm@2554
    96
-------------------
wenzelm@2554
    97
wenzelm@2554
    98
* oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554
    99
external reasoners, which may deliver results as theorems;
wenzelm@2554
   100
wenzelm@2554
   101
* proof objects (in particular record all uses of oracles);
wenzelm@2554
   102
wenzelm@2554
   103
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554
   104
wenzelm@2554
   105
* "constdefs" section in theory files;
wenzelm@2554
   106
wenzelm@2554
   107
* "primrec" section (HOL) no longer requires names;
wenzelm@2554
   108
wenzelm@2554
   109
* internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554
   110
wenzelm@2554
   111
wenzelm@2554
   112
wenzelm@2554
   113
New in Isabelle94-5
wenzelm@2554
   114
-------------------
wenzelm@2554
   115
wenzelm@2554
   116
* reduced space requirements;
wenzelm@2554
   117
wenzelm@2554
   118
* automatic HTML generation from theories;
wenzelm@2554
   119
wenzelm@2554
   120
* theory files no longer require "..." (quotes) around most types;
wenzelm@2554
   121
wenzelm@2554
   122
* new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554
   123
wenzelm@2554
   124
* non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554
   125
wenzelm@2553
   126
paulson@2557
   127
paulson@2557
   128
New in Isabelle94-4
paulson@2557
   129
-------------------
paulson@2557
   130
paulson@2557
   131
* greatly space requirements;
paulson@2557
   132
paulson@2557
   133
* theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557
   134
paulson@2557
   135
* searchable theorem database (see the section "Retrieving theorems" on 
paulson@2557
   136
page 8 of the Reference Manual);
paulson@2557
   137
paulson@2557
   138
* new examples, including Grabczewski's monumental case study of the
paulson@2557
   139
Axiom of Choice;
paulson@2557
   140
paulson@2557
   141
* The previous version of HOL renamed to Old_HOL;
paulson@2557
   142
paulson@2557
   143
* The new version of HOL (previously called CHOL) uses a curried syntax 
paulson@2557
   144
for functions.  Application looks like f a b instead of f(a,b);
paulson@2557
   145
paulson@2557
   146
* Mutually recursive inductive definitions finally work in HOL;
paulson@2557
   147
paulson@2557
   148
* In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557
   149
translates to the operator "split";
paulson@2557
   150
paulson@2557
   151
paulson@2557
   152
paulson@2557
   153
New in Isabelle94-3
paulson@2557
   154
-------------------
paulson@2557
   155
paulson@2557
   156
* new infix operator, addss, allowing the classical reasoner to 
paulson@2557
   157
perform simplification at each step of its search.  Example:
paulson@2557
   158
	fast_tac (cs addss ss)
paulson@2557
   159
paulson@2557
   160
* a new logic, CHOL, the same as HOL, but with a curried syntax 
paulson@2557
   161
for functions.  Application looks like f a b instead of f(a,b).  Also pairs 
paulson@2557
   162
look like (a,b) instead of <a,b>;
paulson@2557
   163
paulson@2557
   164
* PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557
   165
paulson@2557
   166
* In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557
   167
It translates to the operator "split".  A new theory of integers is available;
paulson@2557
   168
paulson@2557
   169
* In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557
   170
Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
paulson@2557
   171
paulson@2557
   172
* Many new examples: I/O automata, Church-Rosser theorem, equivalents 
paulson@2557
   173
of the Axiom of Choice;
paulson@2557
   174
paulson@2557
   175
paulson@2557
   176
paulson@2557
   177
New in Isabelle94-2
paulson@2557
   178
-------------------
paulson@2557
   179
paulson@2557
   180
* Significantly faster resolution;  
paulson@2557
   181
paulson@2557
   182
* the different sections in a .thy file can now be mixed and repeated
paulson@2557
   183
freely;
paulson@2557
   184
paulson@2557
   185
* Database of theorems for FOL, HOL and ZF.  New
paulson@2557
   186
commands including qed, qed_goal and bind_thm store theorems in the database.
paulson@2557
   187
paulson@2557
   188
* Simple database queries: return a named theorem (get_thm) or all theorems of
paulson@2557
   189
a given theory (thms_of), or find out what theory a theorem was proved in
paulson@2557
   190
(theory_of_thm);
paulson@2557
   191
paulson@2557
   192
* Bugs fixed in the inductive definition and datatype packages;
paulson@2557
   193
paulson@2557
   194
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
paulson@2557
   195
and HOL_dup_cs obsolete;
paulson@2557
   196
paulson@2557
   197
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
paulson@2557
   198
have been removed;
paulson@2557
   199
paulson@2557
   200
* Simpler definition of function space in ZF;
paulson@2557
   201
paulson@2557
   202
* new results about cardinal and ordinal arithmetic in ZF;
paulson@2557
   203
paulson@2557
   204
* 'subtype' facility in HOL for introducing new types as subsets of existing
paulson@2557
   205
types;
paulson@2557
   206
paulson@2557
   207
wenzelm@2553
   208
$Id$