summary |
shortlog |
changelog |
graph |
tags |
branches |
files |
changeset |
file |
revisions |
annotate |
diff |
raw

NEWS

author | paulson |

Fri Jan 31 17:51:42 1997 +0100 (1997-01-31) | |

changeset 2576 | 390c9fb786b5 |

parent 2557 | dffebc6ab0a1 |

child 2639 | 2c38796b33b9 |

permissions | -rw-r--r-- |

Declaration of ccontr (classical contradiction) for HOL compatibility

2 Isabelle NEWS -- history of user-visible changes

3 ================================================

6 New in Isabelle94-8 (??????????? 1997 FIXME)

7 ---------------------------------------

9 * HOL: primrec now also works with type nat;

11 * new utilities to build / run / maintain Isabelle etc. (in parts

12 still somewhat experimental); old Makefiles etc. still functional;

14 * simplifier: termless order as parameter; added interface for

15 simplification procedures (functions that produce *proven* rewrite

16 rules on the fly, depending on current redex);

18 * now supports alternative (named) syntax tables (parser and pretty

19 printer); internal interface is provided by add_modesyntax(_i);

21 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to

22 be used in conjunction with the isabelle symbol font; uses the

23 "symbols" syntax table;

25 * infixes may now be declared with names independent of their syntax;

27 * added typed_print_translation (like print_translation, but may

28 access type of constant);

30 * prlim command for dealing with lots of subgoals (an easier way of

31 setting goals_limit);

33 * HOL/ex/Ring.thy declares cring_simp, which solves equational

34 problems in commutative rings, using axiomatic type classes for + and *;

36 * ZF now has Fast_tac, Simp_tac and Auto_tac. WARNING: don't use

37 ZF.thy anymore! Contains fewer defs and could make a bogus simpset.

38 Beware of Union_iff. eq_cs is gone, can be put back as ZF_cs addSIs

39 [equalityI];

41 * more examples in HOL/MiniML and HOL/Auth;

43 * more default rewrite rules in HOL for quantifiers, union/intersection;

45 * the NEWS file;

48 New in Isabelle94-7 (November 96)

49 ---------------------------------

51 * allowing negative levels (as offsets) in prlev and choplev;

53 * super-linear speedup for large simplifications;

55 * FOL, ZF and HOL now use miniscoping: rewriting pushes

56 quantifications in as far as possible (COULD MAKE EXISTING PROOFS

57 FAIL); can suppress it using the command Delsimps (ex_simps @

58 all_simps); De Morgan laws are also now included, by default;

60 * improved printing of ==> : ~:

62 * new object-logic "Sequents" adds linear logic, while replacing LK

63 and Modal (thanks to Sara Kalvala);

65 * HOL/Auth: correctness proofs for authentication protocols;

67 * HOL: new auto_tac combines rewriting and classical reasoning (many

68 examples on HOL/Auth);

70 * HOL: new command AddIffs for declaring theorems of the form P=Q to

71 the rewriter and classical reasoner simultaneously;

73 * function uresult no longer returns theorems in "standard" format;

74 regain previous version by: val uresult = standard o uresult;

78 New in Isabelle94-6

79 -------------------

81 * oracles -- these establish an interface between Isabelle and trusted

82 external reasoners, which may deliver results as theorems;

84 * proof objects (in particular record all uses of oracles);

86 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;

88 * "constdefs" section in theory files;

90 * "primrec" section (HOL) no longer requires names;

92 * internal type "tactic" now simply "thm -> thm Sequence.seq";

96 New in Isabelle94-5

97 -------------------

99 * reduced space requirements;

101 * automatic HTML generation from theories;

103 * theory files no longer require "..." (quotes) around most types;

105 * new examples, including two proofs of the Church-Rosser theorem;

107 * non-curried (1994) version of HOL is no longer distributed;

111 New in Isabelle94-4

112 -------------------

114 * greatly space requirements;

116 * theory files (.thy) no longer require \...\ escapes at line breaks;

118 * searchable theorem database (see the section "Retrieving theorems" on

119 page 8 of the Reference Manual);

121 * new examples, including Grabczewski's monumental case study of the

122 Axiom of Choice;

124 * The previous version of HOL renamed to Old_HOL;

126 * The new version of HOL (previously called CHOL) uses a curried syntax

127 for functions. Application looks like f a b instead of f(a,b);

129 * Mutually recursive inductive definitions finally work in HOL;

131 * In ZF, pattern-matching on tuples is now available in all abstractions and

132 translates to the operator "split";

136 New in Isabelle94-3

137 -------------------

139 * new infix operator, addss, allowing the classical reasoner to

140 perform simplification at each step of its search. Example:

141 fast_tac (cs addss ss)

143 * a new logic, CHOL, the same as HOL, but with a curried syntax

144 for functions. Application looks like f a b instead of f(a,b). Also pairs

145 look like (a,b) instead of <a,b>;

147 * PLEASE NOTE: CHOL will eventually replace HOL!

149 * In CHOL, pattern-matching on tuples is now available in all abstractions.

150 It translates to the operator "split". A new theory of integers is available;

152 * In ZF, integer numerals now denote two's-complement binary integers.

153 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;

155 * Many new examples: I/O automata, Church-Rosser theorem, equivalents

156 of the Axiom of Choice;

160 New in Isabelle94-2

161 -------------------

163 * Significantly faster resolution;

165 * the different sections in a .thy file can now be mixed and repeated

166 freely;

168 * Database of theorems for FOL, HOL and ZF. New

169 commands including qed, qed_goal and bind_thm store theorems in the database.

171 * Simple database queries: return a named theorem (get_thm) or all theorems of

172 a given theory (thms_of), or find out what theory a theorem was proved in

173 (theory_of_thm);

175 * Bugs fixed in the inductive definition and datatype packages;

177 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs

178 and HOL_dup_cs obsolete;

180 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1

181 have been removed;

183 * Simpler definition of function space in ZF;

185 * new results about cardinal and ordinal arithmetic in ZF;

187 * 'subtype' facility in HOL for introducing new types as subsets of existing

188 types;

191 $Id$