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