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

NEWS

author | wenzelm |

Fri Jan 24 18:24:04 1997 +0100 (1997-01-24) | |

changeset 2554 | 1b160cd50130 |

parent 2553 | ed941505cab7 |

child 2555 | 29b27a74c7d8 |

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

*** empty log message ***

2 Isabelle NEWS -- history of user-visible changes

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

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

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

9 * the NEWS file;

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

12 still somewhat experimental);

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 also gets

28 the type of the 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;

47 New in Isabelle94-7 (November 96)

48 ---------------------------------

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

52 * super-linear speedup for large simplifications;

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

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

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

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

59 * improved printing of ==> : ~:

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

62 and Modal (thanks to Sara Kalvala);

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

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

67 examples on HOL/Auth);

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

70 the rewriter and classical reasoner simultaneously;

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

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

77 New in Isabelle94-6

78 -------------------

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

81 external reasoners, which may deliver results as theorems;

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

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

87 * "constdefs" section in theory files;

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

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

95 New in Isabelle94-5

96 -------------------

98 * reduced space requirements;

100 * automatic HTML generation from theories;

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

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

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

109 $Id$