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