author  schirmer 
Wed, 30 Jun 2004 14:04:58 +0200  
changeset 15012  28fa57b57209 
parent 15011  35be762f58f9 
child 15018  0a84ca4e0f90 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

4 
New in this Isabelle release 
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

5 
 
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

6 

8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

7 
*** General *** 
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

8 

15011  9 
* Pure: Simplification procedures can now take the current simpset as 
10 
an additional argument; This is useful for calling the simplifier 

11 
recursively. See the functions MetaSimplifier.full_{mk_simproc, 

12 
simproc,simproc_i}. 

13 

14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

14 
* Pure: considerably improved version of 'constdefs' command. Now 
14731  15 
performs automatic typeinference of declared constants; additional 
16 
support for local structure declarations (cf. locales and HOL 

17 
records), see also isarref manual. Potential INCOMPATIBILITY: need 

18 
to observe strictly sequential dependencies of definitions within a 

19 
single 'constdefs' section; moreover, the declared name needs to be 

20 
an identifier. If all fails, consider to fall back on 'consts' and 

21 
'defs' separately. 

14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

22 

14698
7e4dec3fd515
improvd indexed syntax and implicit structures; tuned renaming of symbolic identifiers
wenzelm
parents:
14682
diff
changeset

23 
* Pure: improved indexed syntax and implicit structures. First of 
14731  24 
all, indexed syntax provides a notational device for subscripted 
25 
application, using the new syntax \<^bsub>term\<^esub> for arbitrary 

26 
expressions. Secondly, in a local context with structure 

27 
declarations, number indexes \<^sub>n or the empty index (default 

28 
number 1) refer to a certain fixed variable implicitly; option 

29 
show_structs controls printing of implicit structures. Typical 

30 
applications of these concepts involve record types and locales. 

31 

14795
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

32 
* Pure: clear separation of logical types and nonterminals, where the 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

33 
latter may only occur in 'syntax' specifications or type 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

34 
abbreviations. Before that distinction was only partially 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

35 
implemented via type class "logic" vs. "{}". Potential 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

36 
INCOMPATIBILITY in rare cases of improper use of 'types'/'consts' 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

37 
instead of 'nonterminals'/'syntax'. Some very exotic syntax 
14816
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

38 
specifications may require further adaption (e.g. Cube/Base.thy). 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

39 

14854  40 
* Pure: removed obsolete type class "logic", use the top sort {} 
41 
instead. Note that nonlogical types should be declared as 

42 
'nonterminals' rather than 'types'. INCOMPATIBILITY for new 

43 
objectlogic specifications. 

44 

14816
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

45 
* Pure/Syntax: inner syntax includes (*(*nested*) comments*). 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

46 

b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

47 
* Pure/Syntax: pretty pinter now supports unbreakable blocks, 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

48 
specified in mixfix annotations as "(00...)". 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

49 

b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

50 
* Pure/Syntax: 'advanced' translation functions (parse_translation 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

51 
etc.) may depend on the signature of the theory context being 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

52 
presently used for parsing/printing, see also isarref manual. 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

53 

b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

54 
* Pure: tuned internal renaming of symbolic identifiers  attach 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

55 
primes instead of base 26 numbers. 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

56 

14897
577f95db94e4
* Document preparation: antiquotations provide option 'locale=NAME';
wenzelm
parents:
14885
diff
changeset

57 
* Document preparation: antiquotations now provide the option 
577f95db94e4
* Document preparation: antiquotations provide option 'locale=NAME';
wenzelm
parents:
14885
diff
changeset

58 
'locale=NAME' to specify an alternative context used for evaluating 
577f95db94e4
* Document preparation: antiquotations provide option 'locale=NAME';
wenzelm
parents:
14885
diff
changeset

59 
and printing the subsequent argument, as in @{thm [locale=LC] 
14919  60 
fold_commute}, for example. 
14897
577f95db94e4
* Document preparation: antiquotations provide option 'locale=NAME';
wenzelm
parents:
14885
diff
changeset

61 

14934  62 
* Document preparation: commands 'display_drafts' and 'print_drafts' 
63 
perform simple output of raw sources. Only those symbols that do 

64 
not require additional LaTeX packages (depending on comments in 

65 
isabellesym.sty) are displayed properly, everything else is left 

66 
verbatim. We use isatool display and isatool print as front ends; 

67 
these are subject to the DVI_VIEWER and PRINT_COMMAND settings, 

68 
respectively. 

69 

14917  70 
* ML: output via the Isabelle channels of writeln/warning/error 
71 
etc. is now passed through Output.output, with a hook for arbitrary 

72 
transformations depending on the print_mode (cf. Output.add_mode  

73 
the first active mode that provides a output function wins). 

74 
Already formatted output may be embedded into further text via 

75 
Output.raw; the result of Pretty.string_of/str_of and derived 

76 
functions (string_of_term/cterm/thm etc.) is already marked raw to 

77 
accommodate easy composition of diagnostic messages etc. 

78 
Programmers rarely need to care about Output.output or Output.raw at 

79 
all, with some notable exceptions: Output.output is required when 

80 
bypassing the standard channels (writeln etc.), or in token 

81 
translations to produce properly formatted results; Output.raw is 

82 
required when capturing already output material that will eventually 

14972  83 
be presented to the user a second time. For the default print mode, 
84 
both Output.output and Output.raw have no effect. 

14795
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

85 

14707  86 

14700
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset

87 
*** HOL *** 
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset

88 

14731  89 
* HOL/record: reimplementation of records. Improved scalability for 
90 
records with many fields, avoiding performance problems for type 

91 
inference. Records are no longer composed of nested field types, but 

92 
of nested extension types. Therefore the record type only grows 

93 
linear in the number of extensions and not in the number of fields. 

94 
The toplevel (users) view on records is preserved. Potential 

95 
INCOMPATIBILITY only in strange cases, where the theory depends on 

96 
the old record representation. The type generated for a record is 

97 
called <record_name>_ext_type. 

98 

15012
28fa57b57209
Added reference record_definition_quick_and_dirty_sensitive, to
schirmer
parents:
15011
diff
changeset

99 
* HOL/record: Reference record_definition_quick_and_dirty_sensitive 
28fa57b57209
Added reference record_definition_quick_and_dirty_sensitive, to
schirmer
parents:
15011
diff
changeset

100 
can be enabled to skip the proofs triggered by a record definition 
28fa57b57209
Added reference record_definition_quick_and_dirty_sensitive, to
schirmer
parents:
15011
diff
changeset

101 
(if quick_and_dirty is enabled). Definitions of large records can 
28fa57b57209
Added reference record_definition_quick_and_dirty_sensitive, to
schirmer
parents:
15011
diff
changeset

102 
take quite long. 
28fa57b57209
Added reference record_definition_quick_and_dirty_sensitive, to
schirmer
parents:
15011
diff
changeset

103 

14878  104 
* HOL: symbolic syntax of Hilbert Choice Operator is now as follows: 
105 

106 
syntax (epsilon) 

107 
"_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10) 

108 

109 
The symbol \<some> is displayed as the alternative epsilon of LaTeX 

110 
and xsymbol; use option 'm epsilon' to get it actually printed. 

111 
Moreover, the mathematically important symbolic identifier 

112 
\<epsilon> becomes available as variable, constant etc. 

113 

14731  114 
* Simplifier: "record_upd_simproc" for simplification of multiple 
115 
record updates enabled by default. INCOMPATIBILITY: old proofs 

116 
break occasionally, since simplification is more powerful by 

117 
default. 

118 

14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

119 

14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

120 
*** HOLCF *** 
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

121 

a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

122 
* HOLCF: discontinued special version of 'constdefs' (which used to 
14731  123 
support continuous functions) in favor of the general Pure one with 
124 
full typeinference. 

14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

125 

a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

126 

14885  127 
*** ZF *** 
128 

129 
* ZF/ex/{Group,Ring}: examples in abstract algebra, including the First 

130 
Isomorphism Theorem (on quotienting by the kernel of a homomorphism). 

131 

132 

14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

133 

14606  134 
New in Isabelle2004 (April 2004) 
135 
 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

136 

14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

137 
*** General *** 
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

138 

14398
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

139 
* Provers/order.ML: new efficient reasoner for partial and linear orders. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

140 
Replaces linorder.ML. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

141 

14606  142 
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic 
143 
(\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler 

14173  144 
(\<a>...\<z>), are now considered normal letters, and can therefore 
145 
be used anywhere where an ASCII letter (a...zA...Z) has until 

146 
now. COMPATIBILITY: This obviously changes the parsing of some 

147 
terms, especially where a symbol has been used as a binder, say 

148 
'\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed 

149 
as an identifier. Fix it by inserting a space around former 

150 
symbols. Call 'isatool fixgreek' to try to fix parsing errors in 

151 
existing theory and ML files. 

14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

152 

14237  153 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
154 

14731  155 
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now 
156 
allowed in identifiers. Similar to Greek letters \<^isub> is now considered 

157 
a normal (but invisible) letter. For multiple letter subscripts repeat 

158 
\<^isub> like this: x\<^isub>1\<^isub>2. 

14233  159 

14333  160 
* Pure: There are now sub/superscripts that can span more than one 
161 
character. Text between \<^bsub> and \<^esub> is set in subscript in 

14606  162 
ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in 
163 
superscript. The new control characters are not identifier parts. 

14333  164 

14561
c53396af770e
* raw control symbols are of the form \<^raw:...> now.
schirmer
parents:
14556
diff
changeset

165 
* Pure: Controlsymbols of the form \<^raw:...> will literally print the 
14606  166 
content of "..." to the latex file instead of \isacntrl... . The "..." 
167 
may consist of any printable characters excluding the end bracket >. 

14361
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset

168 

14237  169 
* Pure: Using new Isar command "finalconsts" (or the ML functions 
170 
Theory.add_finals or Theory.add_finals_i) it is now possible to 

171 
declare constants "final", which prevents their being given a definition 

172 
later. It is useful for constants whose behaviour is fixed axiomatically 

14224  173 
rather than definitionally, such as the metalogic connectives. 
174 

14606  175 
* Pure: 'instance' now handles general arities with general sorts 
176 
(i.e. intersections of classes), 

14503
255ad604e08e
Added check that Theory.ML does not occur in the files section of the theory
skalberg
parents:
14480
diff
changeset

177 

14547  178 
* Presentation: generated HTML now uses a CSS style sheet to make layout 
14731  179 
(somewhat) independent of content. It is copied from lib/html/isabelle.css. 
14547  180 
It can be changed to alter the colors/layout of generated pages. 
181 

14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

182 

14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

183 
*** Isar *** 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

184 

14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

185 
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac, 
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

186 
cut_tac, subgoal_tac and thin_tac: 
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

187 
 Now understand static (Isar) contexts. As a consequence, users of Isar 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

188 
locales are no longer forced to write Isar proof scripts. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

189 
For details see Isar Reference Manual, paragraph 4.3.2: Further tactic 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

190 
emulations. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

191 
 INCOMPATIBILITY: names of variables to be instantiated may no 
14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

192 
longer be enclosed in quotes. Instead, precede variable name with `?'. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

193 
This is consistent with the instantiation attribute "where". 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

194 

14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset

195 
* Attributes "where" and "of": 
14285
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

196 
 Now take type variables of instantiated theorem into account when reading 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

197 
the instantiation string. This fixes a bug that caused instantiated 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

198 
theorems to have too special types in some circumstances. 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

199 
 "where" permits explicit instantiations of type variables. 
14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset

200 

14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

201 
* Calculation commands "moreover" and "also" no longer interfere with 
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

202 
current facts ("this"), admitting arbitrary combinations with "then" 
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

203 
and derived forms. 
14283  204 

14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

205 
* Locales: 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

206 
 Goal statements involving the context element "includes" no longer 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

207 
generate theorems with internal delta predicates (those ending on 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

208 
"_axioms") in the premise. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

209 
Resolve particular premise with <locale>.intro to obtain old form. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

210 
 Fixed bug in type inference ("unify_frozen") that prevented mix of target 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

211 
specification and "includes" elements in goal statement. 
14254
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset

212 
 Rule sets <locale>.intro and <locale>.axioms no longer declared as 
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset

213 
[intro?] and [elim?] (respectively) by default. 
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

214 
 Experimental command for instantiation of locales in proof contexts: 
14551  215 
instantiate <label>[<attrs>]: <loc> 
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

216 
Instantiates locale <loc> and adds all its theorems to the current context 
14551  217 
taking into account their attributes. Label and attrs are optional 
218 
modifiers, like in theorem declarations. If present, names of 

219 
instantiated theorems are qualified with <label>, and the attributes 

220 
<attrs> are applied after any attributes these theorems might have already. 

221 
If the locale has assumptions, a chained fact of the form 

14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

222 
"<loc> t1 ... tn" is expected from which instantiations of the parameters 
14551  223 
are derived. The command does not support oldstyle locales declared 
224 
with "locale (open)". 

225 
A few (very simple) examples can be found in FOL/ex/LocaleInst.thy. 

14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

226 

dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

227 
* HOL: Tactic emulation methods induct_tac and case_tac understand static 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

228 
(Isar) contexts. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

229 

14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

230 

14136  231 
*** HOL *** 
232 

14624  233 
* Proof import: new image HOL4 contains the imported library from 
234 
the HOL4 system with about 2500 theorems. It is imported by 

235 
replaying proof terms produced by HOL4 in Isabelle. The HOL4 image 

236 
can be used like any other Isabelle image. See 

237 
HOL/Import/HOL/README for more information. 

238 

14398
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

239 
* Simplifier: 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

240 
 Much improved handling of linear and partial orders. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

241 
Reasoners for linear and partial orders are set up for type classes 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

242 
"linorder" and "order" respectively, and are added to the default simpset 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

243 
as solvers. This means that the simplifier can build transitivity chains 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

244 
to solve goals from the assumptions. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

245 
 INCOMPATIBILITY: old proofs break occasionally. Typically, applications 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

246 
of blast or auto after simplification become unnecessary because the goal 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

247 
is solved by simplification already. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

248 

14731  249 
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws, 
14389  250 
all proved in axiomatic type classes for semirings, rings and fields. 
251 

252 
* Numerics: 

253 
 Numeric types (nat, int, and in HOLComplex rat, real, complex, etc.) are 

14731  254 
now formalized using the Ring_and_Field theory mentioned above. 
14389  255 
 INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently 
256 
than before, because now they are set up once in a generic manner. 

14731  257 
 INCOMPATIBILITY: many typespecific arithmetic laws have gone. 
14480  258 
Look for the general versions in Ring_and_Field (and Power if they concern 
259 
exponentiation). 

14389  260 

14401  261 
* Type "rat" of the rational numbers is now available in HOLComplex. 
14389  262 

14255  263 
* Records: 
264 
 Record types are now by default printed with their type abbreviation 

265 
instead of the list of all field types. This can be configured via 

266 
the reference "print_record_type_abbr". 

14731  267 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  268 
(not enabled by default). 
14427  269 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
270 
EX x. x = sel r to True (not enabled by default). 

14255  271 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  272 

14136  273 
* 'specification' command added, allowing for definition by 
14224  274 
specification. There is also an 'ax_specification' command that 
275 
introduces the new constants axiomatically. 

14136  276 

14375  277 
* arith(_tac) is now able to generate counterexamples for reals as well. 
278 

14399
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset

279 
* HOLAlgebra: new locale "ring" for noncommutative rings. 
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset

280 

14243  281 
* HOLex: InductiveInvariant_examples illustrates advanced recursive function 
14610  282 
definitions, thanks to Sava Krsti\'{c} and John Matthews. 
283 

14731  284 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  285 
matrix theory to linear programming. 
14136  286 

14380  287 
* Unions and Intersections: 
288 
The xsymbol output syntax of UN and INT has been changed 

289 
from "\<Union>x \<in> A. B" to "\<Union\<^bsub>x \<in> A\<^esub> B" 

290 
i.e. the index formulae has become a subscript, like in normal math. 

291 
Similarly for "\<Union>x. B", and for \<Inter> instead of \<Union>. 

292 
The subscript version is also accepted as input syntax. 

293 

14418  294 
* Unions and Intersections over Intervals: 
14731  295 
There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is 
296 
also an xsymbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A" 

14418  297 
like in normal math, and corresponding versions for < and for intersection. 
298 

14401  299 
* ML: the legacy theory structures Int and List have been removed. They had 
300 
conflicted with ML Basis Library structures having the same names. 

14380  301 

14464  302 
* 'refute' command added to search for (finite) countermodels. Only works 
303 
for a fragment of HOL. The installation of an external SAT solver is 

304 
highly recommended. See "HOL/Refute.thy" for details. 

305 

14602  306 
* 'quickcheck' command: Allows to find counterexamples by evaluating 
307 
formulae under an assignment of free variables to random values. 

308 
In contrast to 'refute', it can deal with inductive datatypes, 

309 
but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy" 

310 
for examples. 

14464  311 

14606  312 

14536  313 
*** HOLCF *** 
314 

315 
* Streams now come with concatenation and are part of the HOLCF image 

316 

14572  317 

318 

14136  319 
New in Isabelle2003 (May 2003) 
14606  320 
 
14136  321 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

322 
*** General *** 
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

323 

13618  324 
* Provers/simplifier: 
325 

13781  326 
 Completely reimplemented method simp (ML: Asm_full_simp_tac): 
13618  327 
Assumptions are now subject to complete mutual simplification, 
328 
not just from left to right. The simplifier now preserves 

329 
the order of assumptions. 

330 

331 
Potential INCOMPATIBILITY: 

332 

13781  333 
 simp sometimes diverges where the old version did 
334 
not, e.g. invoking simp on the goal 

13618  335 

336 
[ P (f x); y = x; f x = f y ] ==> Q 

337 

13781  338 
now gives rise to the infinite reduction sequence 
339 

340 
P(f x) (f x = f y)> P(f y) (y = x)> P(f x) (f x = f y)> ... 

341 

342 
Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this 

343 
kind of problem. 

344 

345 
 Tactics combining classical reasoner and simplification (such as auto) 

346 
are also affected by this change, because many of them rely on 

347 
simp. They may sometimes diverge as well or yield a different numbers 

348 
of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto 

349 
in case of problems. Sometimes subsequent calls to the classical 

350 
reasoner will fail because a preceeding call to the simplifier too 

351 
eagerly simplified the goal, e.g. deleted redundant premises. 

13618  352 

353 
 The simplifier trace now shows the names of the applied rewrite rules 

354 

13829  355 
 You can limit the number of recursive invocations of the simplifier 
356 
during conditional rewriting (where the simplifie tries to solve the 

357 
conditions before applying the rewrite rule): 

358 
ML "simp_depth_limit := n" 

359 
where n is an integer. Thus you can force termination where previously 

360 
the simplifier would diverge. 

361 

13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset

362 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  363 

13938  364 
 No longer aborts on failed congruence proof. Instead, the 
365 
congruence is ignored. 

366 

14008  367 
* Pure: New generic framework for extracting programs from constructive 
368 
proofs. See HOL/Extraction.thy for an example instantiation, as well 

369 
as HOL/Extraction for some case studies. 

370 

13868  371 
* Pure: The main goal of the proof state is no longer shown by default, only 
372 
the subgoals. This behaviour is controlled by a new flag. 

13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset

373 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  374 
(ML: Proof.show_main_goal). 
375 

376 
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all 

377 
rules whose conclusion matches subgoal 1: 

378 
PG menu: Isabelle/Isar > Show me > matching rules 

379 
The rules are ordered by how closely they match the subgoal. 

380 
In particular, rules that solve a subgoal outright are displayed first 

381 
(or rather last, the way they are printed). 

382 
(ML: ProofGeneral.print_intros()) 

383 

384 
* Pure: New flag trace_unify_fail causes unification to print 

13781  385 
diagnostic information (PG: in trace buffer) when it fails. This is 
386 
useful for figuring out why single step proofs like rule, erule or 

387 
assumption failed. 

388 

13815  389 
* Pure: Locale specifications now produce predicate definitions 
13410
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

390 
according to the body of text (covering assumptions modulo local 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

391 
definitions); predicate "loc_axioms" covers newly introduced text, 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

392 
while "loc" is cumulative wrt. all included locale expressions; the 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

393 
latter view is presented only on export into the global theory 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

394 
context; potential INCOMPATIBILITY, use "(open)" option to fall back 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

395 
on the old view without predicates; 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

396 

13459
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

397 
* Pure: predefined locales "var" and "struct" are useful for sharing 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

398 
parameters (as in CASL, for example); just specify something like 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

399 
``var x + var y + struct M'' as import; 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

400 

13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

401 
* Pure: improved thms_containing: proper indexing of facts instead of 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

402 
raw theorems; check validity of results wrt. current name space; 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

403 
include local facts of proof configuration (also covers active 
13541  404 
locales), cover fixed variables in index; may use "_" in term 
405 
specification; an optional limit for the number of printed facts may 

406 
be given (the default is 40); 

407 

408 
* Pure: disallow duplicate fact bindings within newstyle theory files 

409 
(batchmode only); 

13540
aede0306e214
* Pure: disallow duplicate fact bindings within newstyle theory files;
wenzelm
parents:
13522
diff
changeset

410 

13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

411 
* Provers: improved induct method: assumptions introduced by case 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

412 
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

413 
the goal statement); "foo" still refers to all facts collectively; 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

414 

13550  415 
* Provers: the function blast.overloaded has been removed: all constants 
416 
are regarded as potentially overloaded, which improves robustness in exchange 

417 
for slight decrease in efficiency; 

418 

13781  419 
* Provers/linorder: New generic prover for transitivity reasoning over 
420 
linear orders. Note: this prover is not efficient! 

421 

13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

422 
* Isar: preview of problems to finish 'show' now produce an error 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

423 
rather than just a warning (in interactive mode); 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

424 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

425 

13158  426 
*** HOL *** 
427 

13899  428 
* arith(_tac) 
429 

430 
 Produces a counter example if it cannot prove a goal. 

431 
Note that the counter example may be spurious if the goal is not a formula 

432 
of quantifierfree linear arithmetic. 

433 
In ProofGeneral the counter example appears in the trace buffer. 

434 

435 
 Knows about div k and mod k where k is a numeral of type nat or int. 

436 

437 
 Calls full Presburger arithmetic (by Amine Chaieb) if quantifierfree 

438 
linear arithmetic fails. This takes account of quantifiers and divisibility. 

14731  439 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  440 

441 
* simp's arithmetic capabilities have been enhanced a bit: it now 

442 
takes ~= in premises into account (by performing a case split); 

443 

444 
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands 

445 
are distributed over a sum of terms; 

446 

13735  447 
* New tactic "trans_tac" and method "trans" instantiate 
448 
Provers/linorder.ML for axclasses "order" and "linorder" (predicates 

14731  449 
"<=", "<" and "="). 
450 

451 
* function INCOMPATIBILITIES: Pisets have been redefined and moved from main 

13587  452 
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp"; 
453 

13443  454 
* 'typedef' command has new option "open" to suppress the set 
455 
definition; 

456 

13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

457 
* functions Min and Max on finite sets have been introduced (theory 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

458 
Finite_Set); 
13492  459 

13443  460 
* attribute [symmetric] now works for relations as well; it turns 
461 
(x,y) : R^1 into (y,x) : R, and vice versa; 

462 

13613  463 
* induct over a !!quantified statement (say !!x1..xn): 
464 
each "case" automatically performs "fix x1 .. xn" with exactly those names. 

465 

13899  466 
* Map: `empty' is no longer a constant but a syntactic abbreviation for 
467 
%x. None. Warning: empty_def now refers to the previously hidden definition 

468 
of the empty set. 

469 

14018  470 
* Algebra: formalization of classical algebra. Intended as base for 
471 
any algebraic development in Isabelle. Currently covers group theory 

472 
(up to Sylow's theorem) and ring theory (Universal Property of 

473 
Univariate Polynomials). Contributions welcome; 

13960  474 

475 
* GroupTheory: deleted, since its material has been moved to Algebra; 

476 

14731  477 
* Complex: new directory of the complex numbers with numeric constants, 
478 
nonstandard complex numbers, and some complex analysis, standard and 

13966
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

479 
nonstandard (Jacques Fleuriot); 
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

480 

2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

481 
* HOLComplex: new image for analysis, replacing HOLReal and HOLHyperreal; 
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

482 

14731  483 
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques 
13966
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

484 
Fleuriot); 
13960  485 

13549  486 
* Real/HahnBanach: updated and adapted to locales; 
487 

13995  488 
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad, 
489 
Gray and Kramer); 

13872  490 

491 
* UNITY: added the MeierSanders theory of progress sets; 

492 

14011  493 
* MicroJava: bytecode verifier and lightweight bytecode verifier 
494 
as abstract algorithms, instantiated to the JVM; 

495 

14010  496 
* Bali: Java source language formalization. Type system, operational 
497 
semantics, axiomatic semantics. Supported language features: 

498 
classes, interfaces, objects,virtual methods, static methods, 

499 
static/instance fields, arrays, access modifiers, definite 

500 
assignment, exceptions. 

13549  501 

14011  502 

13549  503 
*** ZF *** 
504 

505 
* ZF/Constructible: consistency proof for AC (Gödel's constructible 

506 
universe, etc.); 

507 

13872  508 
* Main ZF: virtually all theories converted to newstyle format; 
13518  509 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

510 

13478  511 
*** ML *** 
512 

513 
* Pure: Tactic.prove provides sane interface for internal proofs; 

514 
omits the infamous "standard" operation, so this is more appropriate 

515 
than prove_goalw_cterm in many situations (e.g. in simprocs); 

516 

517 
* Pure: improved error reporting of simprocs; 

518 

519 
* Provers: Simplifier.simproc(_i) provides sane interface for setting 

520 
up simprocs; 

521 

522 

13953  523 
*** Document preparation *** 
524 

525 
* uses \par instead of \\ for line breaks in theory text. This may 

526 
shift some page breaks in large documents. To get the old behaviour 

527 
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex. 

528 

14731  529 
* minimized dependencies of isabelle.sty and isabellesym.sty on 
13953  530 
other packages 
531 

532 
* \<euro> now needs package babel/greek instead of marvosym (which 

533 
broke \Rightarrow) 

534 

14731  535 
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
13954  536 
textcomp package) 
13953  537 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

538 

14572  539 

12984  540 
New in Isabelle2002 (March 2002) 
541 
 

11474  542 

11572  543 
*** Document preparation *** 
544 

11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

545 
* greatly simplified document preparation setup, including more 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

546 
graceful interpretation of isatool usedir i/d/D options, and more 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

547 
instructive isatool mkdir; users should basically be able to get 
12899
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

548 
started with "isatool mkdir HOL Test && isatool make"; alternatively, 
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

549 
users may run a separate document processing stage manually like this: 
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

550 
"isatool usedir D output HOL Test && isatool document Test/output"; 
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

551 

b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

552 
* theory dependency graph may now be incorporated into documents; 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

553 
isatool usedir g true will produce session_graph.eps/.pdf for use 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

554 
with \includegraphics of LaTeX; 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

555 

11864
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

556 
* proper spacing of consecutive markup elements, especially text 
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

557 
blocks after section headings; 
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

558 

11572  559 
* support bold style (for single symbols only), input syntax is like 
560 
this: "\<^bold>\<alpha>" or "\<^bold>A"; 

561 

11814  562 
* \<bullet> is now output as bold \cdot by default, which looks much 
11572  563 
better in printed text; 
564 

11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

565 
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>; 
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

566 
note that these symbols are currently unavailable in Proof General / 
12769  567 
XSymbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>; 
12690  568 

569 
* isatool latex no longer depends on changed TEXINPUTS, instead 

570 
isatool document copies the Isabelle style files to the target 

571 
location; 

11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

572 

11572  573 

11633  574 
*** Isar *** 
575 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

576 
* Pure/Provers: improved proof by cases and induction; 
12280  577 
 'case' command admits impromptu naming of parameters (such as 
578 
"case (Suc n)"); 

579 
 'induct' method divinates rule instantiation from the inductive 

580 
claim; no longer requires excessive ?P bindings for proper 

581 
instantiation of cases; 

582 
 'induct' method properly enumerates all possibilities of set/type 

583 
rules; as a consequence facts may be also passed through *type* 

584 
rules without further ado; 

585 
 'induct' method now derives symbolic cases from the *rulified* 

586 
rule (before it used to rulify cases stemming from the internal 

587 
atomized version); this means that the context of a nonatomic 

588 
statement becomes is included in the hypothesis, avoiding the 

589 
slightly cumbersome show "PROP ?case" form; 

590 
 'induct' may now use elimstyle induction rules without chaining 

591 
facts, using ``missing'' premises from the goal state; this allows 

592 
rules stemming from inductive sets to be applied in unstructured 

593 
scripts, while still benefitting from proper handling of nonatomic 

594 
statements; NB: major inductive premises need to be put first, all 

595 
the rest of the goal is passed through the induction; 

596 
 'induct' proper support for mutual induction involving nonatomic 

597 
rule statements (uses the new concept of simultaneous goals, see 

598 
below); 

12853  599 
 append all possible rule selections, but only use the first 
600 
success (no backtracking); 

11995
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

601 
 removed obsolete "(simplified)" and "(stripped)" options of methods; 
12754
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

602 
 undeclared rule case names default to numbers 1, 2, 3, ...; 
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

603 
 added 'print_induct_rules' (covered by help item in recent Proof 
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

604 
General versions); 
11995
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

605 
 moved induct/cases attributes to Pure, methods to Provers; 
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

606 
 generic method setup instantiated for FOL and HOL; 
11986
26b95a6f3f79
 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset

607 

12163
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

608 
* Pure: support multiple simultaneous goal statements, for example 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

609 
"have a: A and b: B" (same for 'theorem' etc.); being a pure 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

610 
metalevel mechanism, this acts as if several individual goals had 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

611 
been stated separately; in particular common proof methods need to be 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

612 
repeated in order to cover all claims; note that a single elimination 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

613 
step is *not* sufficient to establish the two conjunctions, so this 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

614 
fails: 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

615 

04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

616 
assume "A & B" then have A and B .. (*".." fails*) 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

617 

04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

618 
better use "obtain" in situations as above; alternative refer to 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

619 
multistep methods like 'auto', 'simp_all', 'blast+' etc.; 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

620 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

621 
* Pure: proper integration with ``locales''; unlike the original 
12210
2f510d8d8291
* ZF: newstyle theory commands '(co)inductive', '(co)datatype',
wenzelm
parents:
12177
diff
changeset

622 
version by Florian Kammüller, Isar locales package highlevel proof 
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

623 
contexts rather than raw logical ones (e.g. we admit to include 
12280  624 
attributes everywhere); operations on locales include merge and 
12964  625 
rename; support for implicit arguments (``structures''); simultaneous 
626 
typeinference over imports and text; see also HOL/ex/Locales.thy for 

627 
some examples; 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

628 

12707
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

629 
* Pure: the following commands have been ``localized'', supporting a 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

630 
target locale specification "(in name)": 'lemma', 'theorem', 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

631 
'corollary', 'lemmas', 'theorems', 'declare'; the results will be 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

632 
stored both within the locale and at the theory level (exported and 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

633 
qualified by the locale name); 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

634 

12964  635 
* Pure: theory goals may now be specified in ``long'' form, with 
636 
adhoc contexts consisting of arbitrary locale elements. for example 

637 
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and 

638 
definitions may be given, too); the result is a metalevel rule with 

639 
the context elements being discharged in the obvious way; 

640 

641 
* Pure: new proof command 'using' allows to augment currently used 

642 
facts after a goal statement ('using' is syntactically analogous to 

643 
'apply', but acts on the goal's facts only); this allows chained facts 

644 
to be separated into parts given before and after a claim, as in 

645 
``from a and b have C using d and e <proof>''; 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

646 

11722  647 
* Pure: renamed "antecedent" case to "rule_context"; 
648 

12964  649 
* Pure: new 'judgment' command records explicit information about the 
650 
objectlogic embedding (used by several tools internally); no longer 

651 
use hardwired "Trueprop"; 

652 

11738  653 
* Pure: added 'corollary' command; 
654 

11722  655 
* Pure: fixed 'token_translation' command; 
656 

11899  657 
* Pure: removed obsolete 'exported' attribute; 
658 

11933  659 
* Pure: dummy pattern "_" in is/let is now automatically lifted over 
660 
bound variables: "ALL x. P x > Q x" (is "ALL x. _ > ?C x") 

11899  661 
supersedes more cumbersome ... (is "ALL x. _ x > ?C x"); 
662 

11952
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

663 
* Pure: method 'atomize' presents local goal premises as objectlevel 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

664 
statements (atomic metalevel propositions); setup controlled via 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

665 
rewrite rules declarations of 'atomize' attribute; example 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

666 
application: 'induct' method with proper rule statements in improper 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

667 
proof *scripts*; 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

668 

12106
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

669 
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.) 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

670 
now consider the syntactic context of assumptions, giving a better 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

671 
chance to get typeinference of the arguments right (this is 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

672 
especially important for locales); 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

673 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

674 
* Pure: "sorry" no longer requires quick_and_dirty in interactive 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

675 
mode; 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

676 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

677 
* Pure/obtain: the formal conclusion "thesis", being marked as 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

678 
``internal'', may no longer be reference directly in the text; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

679 
potential INCOMPATIBILITY, may need to use "?thesis" in rare 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

680 
situations; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

681 

9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

682 
* Pure: generic 'sym' attribute which declares a rule both as pure 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

683 
'elim?' and for the 'symmetric' operation; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

684 

12877
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

685 
* Pure: marginal comments ``'' may now occur just anywhere in the 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

686 
text; the fixed correlation with particular command syntax has been 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

687 
discontinued; 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

688 

13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

689 
* Pure: new method 'rules' is particularly wellsuited for proof 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

690 
search in intuitionistic logic; a bit slower than 'blast' or 'fast', 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

691 
but often produces more compact proof terms with less detours; 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

692 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

693 
* Pure/Provers/classical: simplified integration with pure rule 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

694 
attributes and methods; the classical "intro?/elim?/dest?" 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

695 
declarations coincide with the pure ones; the "rule" method no longer 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

696 
includes classically swapped intros; "intro" and "elim" methods no 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

697 
longer pick rules from the context; also got rid of ML declarations 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

698 
AddXIs/AddXEs/AddXDs; all of this has some potential for 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

699 
INCOMPATIBILITY; 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

700 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

701 
* Provers/classical: attribute 'swapped' produces classical inversions 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

702 
of introduction rules; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

703 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

704 
* Provers/simplifier: 'simplified' attribute may refer to explicit 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

705 
rules instead of full simplifier context; 'iff' attribute handles 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

706 
conditional rules; 
11936
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset

707 

11745
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset

708 
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms; 
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset

709 

11690  710 
* HOL: 'recdef' now fails on unfinished automated proofs, use 
11633  711 
"(permissive)" option to recover old behavior; 
712 

11933  713 
* HOL: 'inductive' no longer features separate (collective) attributes 
714 
for 'intros' (was found too confusing); 

715 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

716 
* HOL: properly declared induction rules less_induct and 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

717 
wf_induct_rule; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

718 

11788
60054fee3c16
canonical 'cases'/'induct' rules for ntuples (n=3..7)
kleing
parents:
11745
diff
changeset

719 

11474  720 
*** HOL *** 
721 

11702  722 
* HOL: moved over to sane numeral syntax; the new policy is as 
723 
follows: 

724 

725 
 0 and 1 are polymorphic constants, which are defined on any 

726 
numeric type (nat, int, real etc.); 

727 

728 
 2, 3, 4, ... and 1, 2, 3, ... are polymorphic numerals, based 

729 
binary representation internally; 

730 

731 
 type nat has special constructor Suc, and generally prefers Suc 0 

732 
over 1::nat and Suc (Suc 0) over 2::nat; 

733 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

734 
This change may cause significant problems of INCOMPATIBILITY; here 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

735 
are some hints on converting existing sources: 
11702  736 

737 
 due to the new "num" token, "0" and "1" etc. are now atomic 

738 
entities, so expressions involving "" (unary or binary minus) need 

739 
to be spaced properly; 

740 

741 
 existing occurrences of "1" may need to be constraint "1::nat" or 

742 
even replaced by Suc 0; similar for old "2"; 

743 

744 
 replace "#nnn" by "nnn", and "#nnn" by "nnn"; 

745 

746 
 remove all special provisions on numerals in proofs; 

747 

13042  748 
* HOL: simp rules nat_number expand numerals on nat to Suc/0 
12837  749 
representation (depends on bin_arith_simps in the default context); 
750 

12736  751 
* HOL: symbolic syntax for x^2 (numeral 2); 
752 

12335
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

753 
* HOL: the class of all HOL types is now called "type" rather than 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

754 
"term"; INCOMPATIBILITY, need to adapt references to this type class 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

755 
in axclass/classes, instance/arities, and (usually rare) occurrences 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

756 
in typings (of consts etc.); internally the class is called 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

757 
"HOL.type", ML programs should refer to HOLogic.typeS; 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

758 

12280  759 
* HOL/record package improvements: 
760 
 new derived operations "fields" to build a partial record section, 

761 
"extend" to promote a fixed record to a record scheme, and 

762 
"truncate" for the reverse; cf. theorems "xxx.defs", which are *not* 

763 
declared as simp by default; 

12587
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset

764 
 shared operations ("more", "fields", etc.) now need to be always 
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset

765 
qualified)  potential INCOMPATIBILITY; 
12280  766 
 removed "make_scheme" operations (use "make" with "extend")  
767 
INCOMPATIBILITY; 

11937  768 
 removed "more" class (simply use "term")  INCOMPATIBILITY; 
12253  769 
 provides cases/induct rules for use with corresponding Isar 
770 
methods (for concrete records, record schemes, concrete more 

12280  771 
parts, and schematic more parts  in that order); 
11930  772 
 internal definitions directly based on a lightweight abstract 
773 
theory of product types over typedef rather than datatype; 

774 

13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

775 
* HOL: generic code generator for generating executable ML code from 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

776 
specifications; specific support for HOL constructs such as inductive 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

777 
datatypes and sets, as well as recursive functions; can be invoked 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

778 
via 'generate_code' theory section; 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

779 

11933  780 
* HOL: canonical cases/induct rules for ntuples (n = 3..7); 
781 

13824  782 
* HOL: consolidated and renamed several theories. In particular: 
14731  783 
Ord.thy has been absorbed into HOL.thy 
784 
String.thy has been absorbed into List.thy 

785 

11802
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

786 
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A" 
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

787 
(beware of argument permutation!); 
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

788 

11657  789 
* HOL: linorder_less_split superseded by linorder_cases; 
790 

12917  791 
* HOL/List: "nodups" renamed to "distinct"; 
12889  792 

11633  793 
* HOL: added "The" definite description operator; move Hilbert's "Eps" 
13824  794 
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES: 
795 
 Ex_def has changed, now need to use some_eq_ex 

11437  796 

11572  797 
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so 
798 
in this (rare) case use: 

799 

800 
delSWrapper "split_all_tac" 

801 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

802 

803 
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS 

11474  804 
MAY FAIL; 
11361  805 

11572  806 
* HOL: introduced f^n = f o ... o f; warning: due to the limits of 
807 
Isabelle's type classes, ^ on functions and relations has too general 

808 
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be 

809 
necessary to attach explicit type constraints; 

11307  810 

12917  811 
* HOL/Relation: the prefix name of the infix "O" has been changed from 
812 
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been 

813 
renamed accordingly (eg "compI" > "rel_compI"). 

12489  814 

11487
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset

815 
* HOL: syntax translations now work properly with numerals and records 
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset

816 
expressions; 
11474  817 

12457
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset

818 
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead 
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset

819 
of "lam"  INCOMPATIBILITY; 
11474  820 

11933  821 
* HOL: got rid of some global declarations (potential INCOMPATIBILITY 
822 
for ML tools): const "()" renamed "Product_Type.Unity", type "unit" 

823 
renamed "Product_Type.unit"; 

11611  824 

12564  825 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
826 

12924  827 
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or 
828 
the "cases" method); 

829 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

830 
* HOL/GroupTheory: group theory examples including Sylow's theorem (by 
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

831 
Florian Kammüller); 
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

832 

12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

833 
* HOL/IMP: updated and converted to newstyle theory format; several 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

834 
parts turned into readable document, with proper Isar proof texts and 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

835 
some explanations (by Gerwin Klein); 
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

836 

12734  837 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
838 

12690  839 
* HOLHyperreal is now a logic image; 
840 

11611  841 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

842 
*** HOLCF *** 
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

843 

12622  844 
* Isar: consts/constdefs supports mixfix syntax for continuous 
845 
operations; 

846 

847 
* Isar: domain package adapted to newstyle theory format, e.g. see 

848 
HOLCF/ex/Dnat.thy; 

849 

850 
* theory Lift: proper use of rep_datatype lift instead of ML hacks  

12280  851 
potential INCOMPATIBILITY; now use plain induct_tac instead of former 
852 
lift.induct_tac, always use UU instead of Undef; 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

853 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

854 
* HOLCF/IMP: updated and converted to newstyle theory; 
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

855 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

856 

11474  857 
*** ZF *** 
858 

12622  859 
* Isar: proper integration of logicspecific tools and packages, 
860 
including theory commands '(co)inductive', '(co)datatype', 

861 
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases', 

862 
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC'); 

863 

864 
* theory Main no longer includes AC; for the Axiom of Choice, base 

865 
your theory on Main_ZFC; 

866 

867 
* the integer library now covers quotients and remainders, with many 

868 
laws relating division to addition, multiplication, etc.; 

12563  869 

12280  870 
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a 
871 
typeless version of the formalism; 

872 

13025  873 
* ZF/AC, Coind, IMP, Resid: updated and converted to newstyle theory 
874 
format; 

12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

875 

12280  876 
* ZF/Induct: new directory for examples of inductive definitions, 
12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

877 
including theory Multiset for multiset orderings; converted to 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

878 
newstyle theory format; 
12177
b1c16d685a99
* ZF: newstyle theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset

879 

13025  880 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  881 

11474  882 

883 
*** General *** 

884 

12280  885 
* Pure/kernel: metalevel proof terms (by Stefan Berghofer); reference 
886 
variable proof controls level of detail: 0 = no proofs (only oracle 

887 
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see 

888 
also ref manual for further ML interfaces; 

889 

890 
* Pure/axclass: removed obsolete ML interface 

891 
goal_subclass/goal_arity; 

892 

893 
* Pure/syntax: new token syntax "num" for plain numerals (without "#" 

894 
of "xnum"); potential INCOMPATIBILITY, since 0, 1 etc. are now 

895 
separate tokens, so expressions involving minus need to be spaced 

896 
properly; 

897 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

898 
* Pure/syntax: support nonoriented infixes, using keyword "infix" 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

899 
rather than "infixl" or "infixr"; 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

900 

f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

901 
* Pure/syntax: concrete syntax for dummy type variables admits genuine 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

902 
sort constraint specifications in type inference; e.g. "x::_::foo" 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

903 
ensures that the type of "x" is of sort "foo" (but not necessarily a 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

904 
type variable); 
12280  905 

906 
* Pure/syntax: print modes "type_brackets" and "no_type_brackets" 

907 
control output of nested => (types); the default behavior is 

908 
"type_brackets"; 

909 

910 
* Pure/syntax: builtin parse translation for "_constify" turns valued 

11817  911 
tokens into AST constants; 
11474  912 

12280  913 
* Pure/syntax: prefer later declarations of translations and print 
914 
translation functions; potential INCOMPATIBILITY: need to reverse 

915 
multiple declarations for same syntax element constant; 

916 

12832
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

917 
* Pure/show_hyps reset by default (in accordance to existing Isar 
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

918 
practice); 
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

919 

12280  920 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
921 
addSafter; 

922 

923 
* Provers/clasimp: ``iff'' declarations now handle conditional rules 

924 
as well; 

12253  925 

12538  926 
* system: tested support for MacOS X; should be able to get Isabelle + 
927 
Proof General to work in a plain Terminal after installing Poly/ML 

928 
(e.g. from the Isabelle distribution area) and GNU bash alone 

929 
(e.g. from http://www.apple.com); full X11, XEmacs and XSymbol 

930 
support requires further installations, e.g. from 

931 
http://fink.sourceforge.net/); 

932 

12280  933 
* system: support Poly/ML 4.1.1 (able to manage larger heaps); 
11551  934 

12753
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

935 
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead 
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

936 
of 40 MB), cf. ML_OPTIONS; 
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

937 

11633  938 
* system: Proof General keywords specification is now part of the 
939 
Isabelle distribution (see etc/isarkeywords.el); 

940 

12728  941 
* system: support for persistent Proof General sessions (refrain from 
942 
outdating all loaded theories on startup); user may create writable 

943 
logic images like this: ``isabelle q HOL Test''; 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

944 

11551  945 
* system: smart selection of Isabelle process versus Isabelle 
11572  946 
interface, accommodates caseinsensitive file systems (e.g. HFS+); may 
947 
run both "isabelle" and "Isabelle" even if file names are badly 

948 
damaged (executable inspects the case of the first letter of its own 

949 
name); added separate "isabelleprocess" and "isabelleinterface"; 

11551  950 

12472  951 
* system: refrain from any attempt at filtering input streams; no 
952 
longer support ``8bit'' encoding of old isabelle font, instead proper 

953 
isolatin characters may now be used; the related isatools 

954 
"symbolinput" and "nonascii" have disappeared as well; 

955 

956 
* system: removed old "xterm" interface (the print modes "xterm" and 

957 
"xterm_color" are still available for direct use in a suitable 

958 
terminal); 

959 

11314  960 

11169
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset

961 

11062  962 
New in Isabelle992 (February 2001) 
963 
 

964 

10224  965 
*** Overview of INCOMPATIBILITIES *** 
966 

11241  967 
* HOL: please note that theories in the Library and elsewhere often use the 
968 
newstyle (Isar) format; to refer to their theorems in an ML script you must 

12622  969 
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; 
11241  970 

11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

971 
* HOL: inductive package no longer splits induction rule aggressively, 
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

972 
but only as far as specified by the introductions given; the old 
11130  973 
format may be recovered via ML function complete_split_rule or attribute 
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

974 
'split_rule (complete)'; 
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

975 

10998  976 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
977 
gfp_Tarski to gfp_unfold; 

10224  978 

10288  979 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
980 

10858  981 
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a 
982 
relation); infix "^^" has been renamed "``"; infix "``" has been 

983 
renamed "`"; "univalent" has been renamed "single_valued"; 

10793  984 

10998  985 
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse" 
986 
operation; 

987 

10868  988 
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>; 
10856  989 

10391  990 
* Isar: 'obtain' no longer declares "that" fact as simp/intro; 
991 

10401
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

992 
* Isar/HOL: method 'induct' now handles nonatomic goals; as a 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

993 
consequence, it is no longer monotonic wrt. the local goal context 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

994 
(which is now passed through the inductive cases); 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

995 

10976
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

996 
* Document preparation: renamed standard symbols \<ll> to \<lless> and 
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

997 
\<gg> to \<ggreater>; 
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

998 

10224  999 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1000 
*** Document preparation *** 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1001 

10858  1002 
* \isabellestyle{NAME} selects version of Isabelle output (currently 
1003 
available: are "it" for near mathmode beststyle output, "sl" for 

1004 
slanted text style, and "tt" for plain typewriter; if no 

1005 
\isabellestyle command is given, output is according to slanted 

1006 
typewriter); 

1007 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1008 
* support sub/super scripts (for single symbols only), input syntax is 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1009 
like this: "A\<^sup>*" or "A\<^sup>\<star>"; 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1010 

10858  1011 
* some more standard symbols; see Appendix A of the system manual for 
11062  1012 
the complete list of symbols defined in isabellesym.sty; 
10858  1013 

10998  1014 
* improved isabelle style files; more abstract symbol implementation 
1015 
(should now use \isamath{...} and \isatext{...} in custom symbol 

1016 
definitions); 

1017 

10634  1018 
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals 
1019 
state; Note that presentation of goal states does not conform to 

1020 
actual humanreadable proof documents. Please do not include goal 

1021 
states into document output unless you really know what you are doing! 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1022 

11062  1023 
* proper indentation of antiquoted output with proportional LaTeX 
1024 
fonts; 

10862  1025 

11050
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

1026 
* no_document ML operator temporarily disables LaTeX document 
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

1027 
generation; 
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

1028 

11062  1029 
* isatool unsymbolize tunes sources for plain ASCII communication; 
1030 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1031 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1032 
*** Isar *** 
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1033 

10547  1034 
* Pure: Isar now suffers initial goal statements to contain unbound 
1035 
schematic variables (this does not conform to actual readable proof 

1036 
documents, due to unpredictable outcome and noncompositional proof 

1037 
checking); users who know what they are doing may use schematic goals 

1038 
for Prologstyle synthesis of proven results; 

1039 

10391  1040 
* Pure: assumption method (an implicit finishing) now handles actual 
1041 
rules as well; 

1042 

1043 
* Pure: improved 'obtain'  moved to Pure, insert "that" into 

1044 
initial goal, declare "that" only as Pure intro (only for single 

1045 
steps); the "that" rule assumption may now be involved in implicit 

1046 
finishing, thus ".." becomes a feasible for trivial obtains; 

1047 

1048 
* Pure: default proof step now includes 'intro_classes'; thus trivial 

1049 
instance proofs may be performed by ".."; 

1050 

1051 
* Pure: ?thesis / ?this / "..." now work for pure metalevel 

1052 
statements as well; 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1053 

11097  1054 
* Pure: more robust selection of calculational rules; 
1055 

10858  1056 
* Pure: the builtin notion of 'finished' goal now includes the ==refl 
1057 
rule (as well as the assumption rule); 

1058 

1059 
* Pure: 'thm_deps' command visualizes dependencies of theorems and 

1060 
lemmas, using the graph browser tool; 

1061 

10944  1062 
* Pure: predict failure of "show" in interactive mode; 
1063 

11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1064 
* Pure: 'thms_containing' now takes actual terms as arguments; 
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1065 

10401
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1066 
* HOL: improved method 'induct'  now handles nonatomic goals 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1067 
(potential INCOMPATIBILITY); tuned error handling; 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1068 

10557  1069 
* HOL: cases and induct rules now provide explicit hints about the 
10547  1070 
number of facts to be consumed (0 for "type" and 1 for "set" rules); 
1071 
any remaining facts are inserted into the goal verbatim; 

1072 

10858  1073 
* HOL: local contexts (aka cases) may now contain term bindings as 
1074 
well; the 'cases' and 'induct' methods new provide a ?case binding for 

1075 
the result to be shown in each case; 

1076 

10770  1077 
* HOL: added 'recdef_tc' command; 
1078 

11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1079 
* isatool convert assists in eliminating legacy ML scripts; 
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1080 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1081 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1082 
*** HOL *** 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1083 

87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1084 
* HOL/Library: a collection of generic theories to be used together 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1085 
with main HOL; the theory loader path already includes this directory 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1086 
by default; the following existing theories have been moved here: 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1087 
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While 
10337  1088 
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix); 
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1089 

10966  1090 
* HOL/Unix: "Some aspects of Unix filesystem security", a typical 
1091 
modelling and verification task performed in Isabelle/HOL + 

1092 
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel). 

1093 

11094  1094 
* HOL/Algebra: special summation operator SUM no longer exists, it has 
1095 
been replaced by setsum; infix 'assoc' now has priority 50 (like 

1096 
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to 

1097 
'domain', this makes the theory consistent with mathematical 

1098 
literature; 

1099 

10514  1100 
* HOL basics: added overloaded operations "inverse" and "divide" 
10726  1101 
(infix "/"), syntax for generic "abs" operation, generic summation 
11094  1102 
operator \<Sum>; 
10452
abeefb0a79ae
* added overloaded operations "inverse" and "divide" (infix "/");
wenzelm
parents:
10428
diff
changeset

1103 

10391  1104 
* HOL/typedef: simplified package, provide more useful rules (see also 
1105 
HOL/subset.thy); 

1106 

10915
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1107 
* HOL/datatype: induction rule for arbitrarily branching datatypes is 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1108 
now expressed as a proper nested rule (oldstyle tactic scripts may 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1109 
require atomize_strip_tac to cope with nonatomic premises); 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1110 

6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1111 
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1112 
to "split_conv" (old name still available for compatibility); 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1113 

6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1114 
* HOL: improved concrete syntax for strings (e.g. allows translation 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1115 
rules with string literals); 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1116 

12245  1117 
* HOLRealHyperreal: this extends HOLReal with the hyperreals 
1118 
and Fleuriot's mechanization of analysis, including the transcendental 

1119 
functions for the reals; 

10756  1120 

11094  1121 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  1122 

10858  1123 

10474  1124 
*** CTT *** 
1125 

10547  1126 
* CTT: xsymbol support for Pi, Sigma, >, : (membership); note that 
1127 
"lam" is displayed as TWO lambdasymbols 

10474  1128 

10547  1129 
* CTT: theory Main now available, containing everything (that is, Bool 
1130 
and Arith); 

1131 

10474  1132 

10391  1133 
*** General *** 
1134 

10547  1135 
* Pure: the Simplifier has been implemented properly as a derived rule 
1136 
outside of the actual kernel (at last!); the overall performance 

1137 
penalty in practical applications is about 50%, while reliability of 

1138 
the Isabelle inference kernel has been greatly improved; 

1139 

11112  1140 
* print modes "brackets" and "no_brackets" control output of nested => 
1141 
(types) and ==> (props); the default behaviour is "brackets"; 

1142 

10391  1143 
* Provers: fast_tac (and friends) now handle actual objectlogic rules 
1144 
as assumptions as well; 

1145 

11124  1146 
* system: support Poly/ML 4.0; 
1147 

1148 
* system: isatool install handles KDE version 1 or 2; 

1149 

10391  1150 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1151 

10103  1152 
New in Isabelle991 (October 2000) 
1153 
 

8015  1154 

10003  1155 
*** Overview of INCOMPATIBILITIES *** 
8014  1156 

8848  1157 
* HOL: simplification of natural numbers is much changed; to partly 
1158 
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n) 

1159 
issue the following ML commands: 

1160 

1161 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

1162 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  1163 

10129  1164 
* HOL: simplification no longer dives into caseexpressions; this is 
1165 
controlled by "t.weak_case_cong" for each datatype t; 

10003  1166 

1167 
* HOL: nat_less_induct renamed to less_induct; 

1168 

1169 
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool 

1170 
fixsome to patch .thy and .ML sources automatically; 

8967  1171 

10003  1172 
select_equality > some_equality 
1173 
select_eq_Ex > some_eq_ex 

1174 
selectI2EX > someI2_ex 

1175 
selectI2 > someI2 

1176 
selectI > someI 

1177 
select1_equality > some1_equality 

1178 
Eps_sym_eq > some_sym_eq_trivial 

1179 
Eps_eq > some_eq_trivial 

1180 

1181 
* HOL: exhaust_tac on datatypes superceded by new generic case_tac; 

1182 

1183 
* HOL: removed obsolete theorem binding expand_if (refer to split_if 

1184 
instead); 

1185 

1186 
* HOL: the recursion equations generated by 'recdef' are now called 

1187 
f.simps instead of f.rules; 

1188 

1189 
* HOL: qed_spec_mp now also handles bounded ALL as well; 

1190 

1191 
* HOL: 0 is now overloaded, so the type constraint ":: nat" may 

1192 
sometimes be needed; 

1193 

1194 
* HOL: the constant for "f``x" is now "image" rather than "op ``"; 

8014  1195 

10065  1196 
* HOL: the constant for "f``x" is now "vimage" rather than "op ``"; 
1197 

9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

1198 
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian 
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

1199 
product is now "<*>" instead of "Times"; the lexicographic product is 
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

1200 
now "<*lex*>" instead of "**"; 
8705  1201 

10003  1202 
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part 
1203 
of main HOL, but was unused); better use HOL's datatype package; 

9971  1204 

10137
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1205 
* HOL: removed "symbols" syntax for constant "override" of theory Map; 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1206 
the old syntax may be recovered as follows: 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1207 

d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1208 
syntax (symbols) 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1209 
override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)" 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1210 
(infixl "\\<oplus>" 100) 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1211 

8848  1212 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
1213 

8887
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

1214 
* HOL/ML: even fewer consts are declared as global (see theories Ord, 
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

1215 
Lfp, Gfp, WF); this only affects ML packages that refer to const names 
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

1216 
internally; 
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

1217 

10003  1218 
* HOL and ZF: syntax for quotienting wrt an equivalence relation 
1219 
changed from A/r to A//r; 

9908  1220 

10003  1221 
* ZF: new treatment of arithmetic (nat & int) may break some old 
1222 
proofs; 

8921
7c04c98132c4
* Pure: changed syntax of local blocks from {{ }} to { };
wenzelm
parents:
8887
diff
changeset

1223 

10003  1224 
* Isar: renamed some attributes (RS > THEN, simplify > simplified, 
1225 
rulify > rule_format, elimify > elim_format, ...); 

9542  1226 

9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

1227 
* Isar/Provers: intro/elim/dest attributes changed; renamed 
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

1228 
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one 
9937  1229 
should have to change intro!! to intro? only); replaced "delrule" by 
1230 
"rule del"; 

9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

1231 

9612  1232 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
1233 

9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

1234 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  1235 

10003  1236 
* LaTeX document preparation: several changes of isabelle.sty (see 
1237 
lib/texinputs); 

8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset

1238 

8014  1239 

8487  1240 
*** Document preparation *** 
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1241 

9198
0ab3c81e9425
* formal comments (text blocks etc.) in newstyle theories may now
wenzelm
parents:
9185
diff
changeset

1242 
* formal comments (text blocks etc.) in newstyle theories may now 
9753  1243 
contain antiquotations of thm/prop/term/typ/text to be presented 
1244 
according to latex print mode; concrete syntax is like this: 

1245 
@{term[show_types] "f(x) = a + x"}; 

9198
0ab3c81e9425
* formal comments (text blocks etc.) in newstyle theories may now
wenzelm
parents:
9185
diff
changeset

1246 

8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1247 
* isatool mkdir provides easy setup of Isabelle session directories, 
8518  1248 
including proper document sources; 
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1249 

a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1250 
* generated LaTeX sources are now deleted after successful run 
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1251 
(isatool document c); may retain a copy somewhere else via D option 
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1252 
of isatool usedir; 
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1253 

8566  1254 
* isatool usedir D now lets isatool latex o sty update the Isabelle 
10003  1255 
style files, achieving selfcontained LaTeX sources and simplifying 
1256 
LaTeX debugging; 

8566  1257 

8518  1258 
* oldstyle theories now produce (crude) LaTeX output as well; 
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1259 

9057
af1ca1acf292
* browser info session directories are now selfcontained (may be put
wenzelm
parents:
9052
diff
changeset

1260 
* browser info session directories are now selfcontained (may be put 
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

1261 
on WWW server seperately); improved graphs of nested sessions; removed 
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

1262 
graph for 'all sessions'; 
9057
af1ca1acf292
* browser info session directories are now selfcontained (may be put
wenzelm
parents:
9052
diff
changeset

1263 

10003  1264 
* several improvements in isabelle style files; \isabellestyle{it} 
1265 
produces fake math mode output; \isamarkupheader is now \section by 

1266 
default; see lib/texinputs/isabelle.sty etc.; 

9489
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

1267 

8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1268 

8184  1269 
*** Isar *** 
1270 

10003  1271 
* Isar/Pure: local results and corresponding term bindings are now 
1272 
subject to HindleyMilner polymorphism (similar to ML); this 

1273 
accommodates incremental typeinference very nicely; 

8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset

1274 

10003  1275 
* Isar/Pure: new derived language element 'obtain' supports 
1276 
generalized existence reasoning; 

8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset

1277 

10003  1278 
* Isar/Pure: new calculational elements 'moreover' and 'ultimately' 
1279 
support accumulation of results, without applying any rules yet; 

1280 
useful to collect intermediate results without explicit name 

1281 
references, and for use with transitivity rules with more than 2 

1282 
premises; 

8184  1283 

10003  1284 
* Isar/Pure: scalable support for caseanalysis type proofs: new 
1285 
'case' language element refers to local contexts symbolically, as 

1286 
produced by certain proof methods; internally, case names are attached 

1287 
to theorems as "tags"; 

8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

1288 

10003  1289 
* Isar/Pure: theory command 'hide' removes declarations from 
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

1290 
class/type/const name spaces; 
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

1291 

10003  1292 
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to 
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

1293 
indicate potential overloading; 
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

1294 

10003  1295 
* Isar/Pure: changed syntax of local blocks from {{ }} to { }; 
8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset

1296 

10003  1297 
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write 
1298 
"{a,b,c}" instead of {a,b,c}; 

9011
0cfc347f8d19
Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms to
wenzelm
parents:
8994
diff
changeset

1299 

10003  1300 
* Isar/Pure now provides its own version of intro/elim/dest 
1301 
attributes; useful for building new logics, but beware of confusion 

1302 
with the version in Provers/classical; 

9612  1303 

10003  1304 
* Isar/Pure: the local context of (nonatomic) goals is provided via 
1305 
case name 'antecedent'; 

8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

1306 

10003  1307 
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms 
1308 
to the current context is now done automatically); 

9383
c21fa1c48de0
* HOL: removed obsolete expand_if = split_if; theorems if_splits =
wenzelm
parents:
9349
diff
changeset

1309 

10003  1310 
* Isar/Pure: theory command 'method_setup' provides a simple interface 
1311 
for definining proof methods in ML; 

9612  1312 

10003  1313 
* Isar/Provers: intro/elim/dest attributes changed; renamed 
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

1314 
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in 
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

1315 
most cases, one should have to change intro!! to intro? only); 
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

1316 
replaced "delrule" by "rule del"; 
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset

1317 

10003  1318 
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and 
1319 
'symmetric' attribute (the latter supercedes [RS sym]); 

1320 

1321 
* Isar/Provers: splitter support (via 'split' attribute and 'simp' 

1322 
method modifier); 'simp' method: 'only:' modifier removes loopers as 

1323 
well (including splits); 

1324 

1325 
* Isar/Provers: Simplifier and Classical methods now support all kind 

1326 
of modifiers used in the past, including 'cong', 'iff', etc. 

1327 

1328 
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination 

1329 
of Simplifier and Classical reasoner); 

1330 

1331 
* Isar/HOL: new proof method 'cases' and improved version of 'induct' 

1332 
now support named cases; major packages (inductive, datatype, primrec, 

1333 
recdef) support case names and properly name parameters; 

9612  1334 

10003  1335 
* Isar/HOL: new transitivity rules for substitution in inequalities  
1336 
monotonicity conditions are extracted to be proven at end of 

1337 
calculations; 

1338 

1339 
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof 

1340 
method anyway; 

1341 

1342 
* Isar/HOL: removed old expand_if = split_if; theorems if_splits = 

1343 
split_if split_if_asm; datatype package provides theorems foo.splits = 

1344 
foo.split foo.split_asm for each datatype; 

1345 

1346 
* Isar/HOL: tuned inductive package, rename "intrs" to "intros" 

1347 
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof 

1348 
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note: 

1349 
use "(cases (simplified))" method in proper proof texts); 

1350 

1351 
* Isar/HOL: added global 'arith_split' attribute for 'arith' method; 

1352 

1353 
* Isar: names of theorems etc. may be natural numbers as well; 

1354 

1355 
* Isar: 'pr' command: optional arguments for goals_limit and 

9724
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset

1356 
ProofContext.prems_limit; no longer prints theory contexts, but only 
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset

1357 
proof states; 
8487  1358 

10003  1359 
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit 
8518  1360 
additional print modes to be specified; e.g. "pr(latex)" will print 
1361 
proof state according to the Isabelle LaTeX style; 

8487  1362 

10003  1363 
* Isar: improved support for emulating tactic scripts, including proof 
9612  1364 
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac', 
1365 
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac' 

1366 
(for HOL datatypes); 

8534  1367 

10003  1368 
* Isar: simplified (more robust) goal selection of proof methods: 1st 
1369 
goal, all goals, or explicit goal specifier (tactic emulation); thus 

1370 
'proof method scripts' have to be in depthfirst order; 

8673
987ea1a559d0
Isar: simplified (more robust) goal selection of proof methods;
wenzelm
parents:
8655
diff
changeset

1371 

10003  1372 
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and'; 
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset

1373 

10003  1374 
* Isar: removed 'help' command, which hasn't been too helpful anyway; 
1375 
should instead use individual commands for printing items 

1376 
(print_commands, print_methods etc.); 

9224
0da360494917
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm
parents:
9198
diff
changeset

1377 

10003  1378 
* Isar: added 'nothing'  the empty list of theorems; 
9239  1379 

8184  1380 

8014  1381 
*** HOL *** 
1382 

10080  1383 
* HOL/MicroJava: formalization of a fragment of Java, together with a 
1384 
corresponding virtual machine and a specification of its bytecode 

1385 
verifier and a lightweight bytecode verifier, including proofs of 

1386 
typesafety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and 

1387 
Cornelia Pusch (see also the homepage of project Bali at 

1388 
http://isabelle.in.tum.de/Bali/); 

1389 

8518  1390 
* HOL/Algebra: new theory of rings and univariate polynomials, by 
1391 
Clemens Ballarin; 

8014  1392 

10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

1393 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  1394 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
1395 
Rasmussen; 

8570  1396 

10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

1397 
* HOL/Lattice: fundamental concepts of lattice theory and order 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

1398 
structures, including duals, properties of bounds versus algebraic 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

1399 
laws, lattice operations versus settheoretic ones, the KnasterTarski 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

1400 
Theorem for complete lattices etc.; may also serve as a demonstration 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

1401 
for abstract algebraic reasoning using axiomatic type classes, and 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

1402 
mathematicsstyle proof in Isabelle/Isar; by Markus Wenzel; 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

1403 

10003  1404 
* HOL/Prolog: a (barebones) implementation of LambdaProlog, by David 
1405 
von Oheimb; 

9542  1406 

10164
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
