author  wenzelm 
Sat, 04 Nov 2006 19:25:36 +0100  
changeset 21170  01ef0dbd51ae 
parent 21125  9b7d35ca1eef 
child 21200  2f6e276bfb93 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

20807  4 
New in this Isabelle version 
17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

5 
 
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

6 

58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

7 
*** General *** 
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

8 

17918
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

9 
* Theory syntax: the header format ``theory A = B + C:'' has been 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

10 
discontinued in favour of ``theory A imports B C begin''. Use isatool 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

11 
fixheaders to convert existing theory files. INCOMPATIBILITY. 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

12 

93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

13 
* Theory syntax: the old nonIsar theory file format has been 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

14 
discontinued altogether. Note that ML proof scripts may still be used 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

15 
with Isar theories; migration is usually quite simple with the ML 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

16 
function use_legacy_bindings. INCOMPATIBILITY. 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

17 

20807  18 
* Theory syntax: some popular names (e.g. "class", "if", "fun") are 
19 
now keywords. INCOMPATIBILITY, use double quotes. 

19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

20 

17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

21 
* Legacy goal package: reduced interface to the bare minimum required 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

22 
to keep existing proof scripts running. Most other userlevel 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

23 
functions are now part of the OldGoals structure, which is *not* open 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

24 
by default (consider isatool expandshort before open OldGoals). 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

25 
Removed top_sg, prin, printyp, pprint_term/typ altogether, because 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

26 
these tend to cause confusion about the actual goal (!) context being 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

27 
used here, which is not necessarily the same as the_context(). 
17918
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

28 

17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

29 
* Command 'find_theorems': support "*" wildcard in "name:" criterion. 
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

30 

20370  31 
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now 1 
32 
by default, which means that "prems" (and also "fixed variables") are 

33 
suppressed from proof state output. Note that the ProofGeneral 

34 
settings mechanism allows to change and save options persistently, but 

35 
older versions of Isabelle will fail to start up if a negative prems 

36 
limit is imposed. 

37 

17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

38 

17865  39 
*** Document preparation *** 
40 

17869  41 
* Added antiquotations @{ML_type text} and @{ML_struct text} which 
42 
check the given source text as ML type/structure, printing verbatim. 

17865  43 

44 

17779  45 
*** Pure *** 
46 

20807  47 
* class_package.ML offers a combination of axclasses and locales to 
48 
achieve Haskelllike type classes in Isabelle. See 

49 
HOL/ex/Classpackage.thy for examples. 

50 

51 
* Yet another code generator framework allows to generate executable 

52 
code for ML and Haskell (including "class"es). A short usage sketch: 

20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

53 

8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

54 
internal compilation: 
21125  55 
code_gen <list of constants (term syntax)> (SML *) 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

56 
writing SML code to a file: 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

57 
code_gen <list of constants (term syntax)> (SML <filename>) 
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

58 
writing Haskell code to a bunch of files: 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

59 
code_gen <list of constants (term syntax)> (Haskell <filename>) 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

60 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

61 
Reasonable default setup of framework in HOL/Main. 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

62 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

63 
See HOL/ex/Code*.thy for examples. 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

64 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

65 
Theorem attributs for selecting and transforming function equations theorems: 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

66 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

67 
[code fun]: select a theorem as function equation for a specific constant 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

68 
[code nofun]: deselect a theorem as function equation for a specific constant 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

69 
[code inline]: select an equation theorem for unfolding (inlining) in place 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

70 
[code noinline]: deselect an equation theorem for unfolding (inlining) in place 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

71 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

72 
Userdefined serializations (target in {SML, Haskell}): 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

73 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

74 
code_const <andlist of constants (term syntax)> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

75 
{(target) <andlist of const target syntax>}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

76 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

77 
code_type <andlist of type constructors> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

78 
{(target) <andlist of type target syntax>}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

79 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

80 
code_instance <andlist of instances> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

81 
{(target)}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

82 
where instance ::= <type constructor> :: <class> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

83 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

84 
code_class <and_list of classes> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

85 
{(target) <andlist of class target syntax>}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

86 
where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}? 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

87 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

88 
For code_instance and code_class, target SML is silently ignored. 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

89 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

90 
See HOL theories and HOL/ex/Code*.thy for usage examples. 
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

91 

19254  92 
* Command 'no_translations' removes translation rules from theory 
93 
syntax. 

94 

19625
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

95 
* Overloaded definitions are now actually checked for acyclic 
19714  96 
dependencies. The overloading scheme is slightly more general than 
97 
that of Haskell98, although Isabelle does not demand an exact 

98 
correspondence to type class and instance declarations. 

99 
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more 

100 
exotic versions of overloading  at the discretion of the user! 

19711  101 

102 
Polymorphic constants are represented via type arguments, i.e. the 

103 
instantiation that matches an instance against the most general 

104 
declaration given in the signature. For example, with the declaration 

105 
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented 

106 
as c(nat). Overloading is essentially simultaneous structural 

107 
recursion over such type arguments. Incomplete specification patterns 

19714  108 
impose global constraints on all occurrences, e.g. c('a * 'a) on the 
19715  109 
LHS means that more general c('a * 'b) will be disallowed on any RHS. 
19714  110 
Command 'print_theory' outputs the normalized system of recursive 
111 
equations, see section "definitions". 

19625
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

112 

17865  113 
* Isar: improper proof element 'guess' is like 'obtain', but derives 
114 
the obtained context from the course of reasoning! For example: 

115 

116 
assume "EX x y. A x & B y"  "any previous fact" 

117 
then guess x and y by clarify 

118 

119 
This technique is potentially adventurous, depending on the facts and 

120 
proof tools being involved here. 

121 

18020  122 
* Isar: known facts from the proof context may be specified as literal 
123 
propositions, using ASCII backquote syntax. This works wherever 

124 
named facts used to be allowed so far, in proof commands, proof 

125 
methods, attributes etc. Literal facts are retrieved from the context 

126 
according to unification of type and term parameters. For example, 

127 
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known 

128 
theorems in the current context, then these are valid literal facts: 

129 
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc. 

130 

131 
There is also a proof method "fact" which does the same composition 

18044  132 
for explicit goal states, e.g. the following proof texts coincide with 
133 
certain special cases of literal facts: 

18020  134 

135 
have "A" by fact == note `A` 

136 
have "A ==> B" by fact == note `A ==> B` 

137 
have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x` 

138 
have "P a ==> Q a" by fact == note `P a ==> Q a` 

139 

20118
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

140 
* Isar: ":" (colon) is no longer a symbolic identifier character in 
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

141 
outer syntax. Thus symbolic identifiers may be used without 
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

142 
additional white space in declarations like this: ``assume *: A''. 
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

143 

20013  144 
* Isar: 'print_facts' prints all local facts of the current context, 
145 
both named and unnamed ones. 

146 

18308  147 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
148 

149 
def x == "t" and y == "u" 

150 

18540  151 
* Isar: added command 'unfolding', which is structurally similar to 
152 
'using', but affects both the goal state and facts by unfolding given 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

153 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  154 
'unfolded' attribute may be replaced by firstclass proof text. 
155 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

156 
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded', 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

157 
and command 'unfolding' now all support objectlevel equalities 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

158 
(potentially conditional). The underlying notion of rewrite rule is 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

159 
analogous to the 'rule_format' attribute, but *not* that of the 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

160 
Simplifier (which is usually more generous). 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

161 

19220  162 
* Isar: the goal restriction operator [N] (default N = 1) evaluates a 
163 
method expression within a sandbox consisting of the first N 

19240  164 
subgoals, which need to exist. For example, ``simp_all [3]'' 
165 
simplifies the first three subgoals, while (rule foo, simp_all)[] 

166 
simplifies all new goals that emerge from applying rule foo to the 

167 
originally first one. 

19220  168 

19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

169 
* Isar: schematic goals are no longer restricted to higherorder 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

170 
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

171 
expected. 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

172 

18901  173 
* Isar: the conclusion of a long theorem statement is now either 
174 
'shows' (a simultaneous conjunction, as before), or 'obtains' 

175 
(essentially a disjunction of cases with local parameters and 

176 
assumptions). The latter allows to express general elimination rules 

18910  177 
adequately; in this notation common elimination rules look like this: 
18901  178 

179 
lemma exE:  "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis" 

180 
assumes "EX x. P x" 

181 
obtains x where "P x" 

182 

183 
lemma conjE:  "A & B ==> (A ==> B ==> thesis) ==> thesis" 

184 
assumes "A & B" 

185 
obtains A and B 

186 

187 
lemma disjE:  "A  B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis" 

188 
assumes "A  B" 

189 
obtains 

190 
A 

191 
 B 

192 

18910  193 
The subsequent classical rules even refer to the formal "thesis" 
18901  194 
explicitly: 
195 

196 
lemma classical:  "(~ thesis ==> thesis) ==> thesis" 

197 
obtains "~ thesis" 

198 

18910  199 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
200 
obtains "thesis ==> something" 

18901  201 

202 
The actual proof of an 'obtains' statement is analogous to that of the 

18910  203 
Isar proof element 'obtain', only that there may be several cases. 
204 
Optional case names may be specified in parentheses; these will be 

205 
available both in the present proof and as annotations in the 

206 
resulting rule, for later use with the 'cases' method (cf. attribute 

207 
case_names). 

18901  208 

19263  209 
* Isar: 'print_statement' prints theorems from the current theory or 
210 
proof context in long statement form, according to the syntax of a 

211 
toplevel lemma. 

212 

18901  213 
* Isar: 'obtain' takes an optional case name for the local context 
214 
introduction rule (default "that"). 

215 

19587  216 
* Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use 
217 
explicit (is "_ ==> ?foo") in the rare cases where this still happens 

218 
to occur. 

219 

19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

220 
* Pure: syntax "CONST name" produces a fully internalized constant 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

221 
according to the current context. This is particularly useful for 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

222 
syntax translations that should refer to internal constant 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

223 
representations independently of name spaces. 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

224 

c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

225 
* Isar/locales: 'const_syntax' provides a robust interface to the 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

226 
'syntax' primitive that also works in a locale context. Type 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

227 
declaration and internal syntactic representation of given constants 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

228 
retrieved from the context. 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

229 

19665  230 
* Isar/locales: new derived specification elements 'axiomatization', 
231 
'definition', 'abbreviation', which support typeinference, admit 

19083  232 
objectlevel specifications (equality, equivalence). See also the 
233 
isarref manual. Examples: 

19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

234 

19665  235 
axiomatization 
236 
eq (infix "===" 50) 

237 
where eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

238 

19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

239 
definition 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

240 
"f x y = x + y + 1" 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

241 
"g x = f x x" 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

242 

19363  243 
abbreviation 
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

244 
neq (infix "=!=" 50) 
19363  245 
"x =!= y == ~ (x === y)" 
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

246 

19083  247 
These specifications may be also used in a locale context. Then the 
248 
constants being introduced depend on certain fixed parameters, and the 

249 
constant name is qualified by the locale base name. An internal 

250 
abbreviation takes care for convenient input and output, making the 

19088  251 
parameters implicit and using the original short name. See also 
19083  252 
HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
253 
entities from a monomorphic theory. 

254 

255 
Presently, abbreviations are only available 'in' a target locale, but 

19363  256 
not inherited by general import expressions. Also note that 
257 
'abbreviation' may be used as a typesafe replacement for 'syntax' + 

258 
'translations' in common applications. 

19084  259 

19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

260 
Concrete syntax is attached to specified constants in internal form, 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

261 
independently of name spaces. The parse tree representation is 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

262 
slightly different  use 'const_syntax' instead of raw 'syntax', and 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

263 
'translations' with explicit "CONST" markup to accommodate this. 
19665  264 

19783  265 
* Isar/locales: improved parameter handling: 
266 
 use of locales "var" and "struct" no longer necessary; 

267 
 parameter renamings are no longer required to be injective. 

268 
This enables, for example, to define a locale for endomorphisms thus: 

269 
locale endom = homom mult mult h. 

270 

19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

271 
* Isar/locales: changed the way locales with predicates are defined. 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

272 
Instead of accumulating the specification, the imported expression is 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

273 
now an interpretation. 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

274 
INCOMPATIBILITY: different normal form of locale expressions. 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

275 
In particular, in interpretations of locales with predicates, 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

276 
goals repesenting already interpreted fragments are not removed 
19984
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

277 
automatically. Use methods `intro_locales' and `unfold_locales'; see below. 
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

278 

29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

279 
* Isar/locales: new methods `intro_locales' and `unfold_locales' provide 
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

280 
backward reasoning on locales predicates. The methods are aware of 
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

281 
interpretations and discharge corresponding goals. `intro_locales' is 
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

282 
less aggressive then `unfold_locales' and does not unfold predicates to 
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

283 
assumptions. 
19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

284 

fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

285 
* Isar/locales: the order in which locale fragments are accumulated 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

286 
has changed. This enables to override declarations from fragments 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

287 
due to interpretations  for example, unwanted simp rules. 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

288 

18233  289 
* Provers/induct: improved internal context management to support 
290 
local fixes and defines onthefly. Thus explicit metalevel 

291 
connectives !! and ==> are rarely required anymore in inductive goals 

292 
(using objectlogic connectives for this purpose has been long 

293 
obsolete anyway). The subsequent proof patterns illustrate advanced 

294 
techniques of natural induction; general datatypes and inductive sets 

18267  295 
work analogously (see also src/HOL/Lambda for realistic examples). 
296 

297 
(1) This is how to ``strengthen'' an inductive goal wrt. certain 

18239  298 
parameters: 
18233  299 

300 
lemma 

301 
fixes n :: nat and x :: 'a 

302 
assumes a: "A n x" 

303 
shows "P n x" 

304 
using a  {* make induct insert fact a *} 

20503  305 
proof (induct n arbitrary: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 
18248  306 
case 0 
18233  307 
show ?case sorry 
308 
next 

18248  309 
case (Suc n) 
18239  310 
note `!!x. A n x ==> P n x`  {* induction hypothesis, according to induction rule *} 
311 
note `A (Suc n) x`  {* induction premise, stemming from fact a *} 

18233  312 
show ?case sorry 
313 
qed 

314 

18267  315 
(2) This is how to perform induction over ``expressions of a certain 
18233  316 
form'', using a locally defined inductive parameter n == "a x" 
18239  317 
together with strengthening (the latter is usually required to get 
18267  318 
sufficiently flexible induction hypotheses): 
18233  319 

320 
lemma 

321 
fixes a :: "'a => nat" 

322 
assumes a: "A (a x)" 

323 
shows "P (a x)" 

324 
using a 

20503  325 
proof (induct n == "a x" arbitrary: x) 
18233  326 
... 
327 

18267  328 
See also HOL/Isar_examples/Puzzle.thy for an application of the this 
329 
particular technique. 

330 

18901  331 
(3) This is how to perform existential reasoning ('obtains' or 
332 
'obtain') by induction, while avoiding explicit objectlogic 

333 
encodings: 

334 

335 
lemma 

336 
fixes n :: nat 

337 
obtains x :: 'a where "P n x" and "Q n x" 

20503  338 
proof (induct n arbitrary: thesis) 
18267  339 
case 0 
340 
obtain x where "P 0 x" and "Q 0 x" sorry 

18399  341 
then show thesis by (rule 0) 
18267  342 
next 
343 
case (Suc n) 

344 
obtain x where "P n x" and "Q n x" by (rule Suc.hyps) 

345 
obtain x where "P (Suc n) x" and "Q (Suc n) x" sorry 

346 
then show thesis by (rule Suc.prems) 

347 
qed 

348 

20503  349 
Here the 'arbitrary: thesis' specification essentially modifies the 
350 
scope of the formal thesis parameter, in order to the get the whole 

18267  351 
existence statement through the induction as expected. 
18233  352 

18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

353 
* Provers/induct: mutual induction rules are now specified as a list 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

354 
of rule sharing the same induction cases. HOL packages usually 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

355 
provide foo_bar.inducts for mutually defined items foo and bar 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

356 
(e.g. inductive sets or datatypes). INCOMPATIBILITY, users need to 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

357 
specify mutual induction rules differently, i.e. like this: 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

358 

96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

359 
(induct rule: foo_bar.inducts) 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

360 
(induct set: foo bar) 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

361 
(induct type: foo bar) 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

362 

96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

363 
The ML function ProjectRule.projections turns oldstyle rules into the 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

364 
new format. 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

365 

96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

366 
* Provers/induct: improved handling of simultaneous goals. Instead of 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

367 
introducing objectlevel conjunction, the statement is now split into 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

368 
several conclusions, while the corresponding symbolic cases are 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

369 
nested accordingly. INCOMPATIBILITY, proofs need to be structured 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

370 
explicitly. For example: 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

371 

8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

372 
lemma 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

373 
fixes n :: nat 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

374 
shows "P n" and "Q n" 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

375 
proof (induct n) 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

376 
case 0 case 1 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

377 
show "P 0" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

378 
next 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

379 
case 0 case 2 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

380 
show "Q 0" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

381 
next 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

382 
case (Suc n) case 1 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

383 
note `P n` and `Q n` 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

384 
show "P (Suc n)" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

385 
next 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

386 
case (Suc n) case 2 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

387 
note `P n` and `Q n` 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

388 
show "Q (Suc n)" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

389 
qed 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

390 

18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

391 
The split into subcases may be deferred as follows  this is 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

392 
particularly relevant for goal statements with local premises. 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

393 

b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

394 
lemma 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

395 
fixes n :: nat 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

396 
shows "A n ==> P n" and "B n ==> Q n" 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

397 
proof (induct n) 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

398 
case 0 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

399 
{ 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

400 
case 1 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

401 
note `A 0` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

402 
show "P 0" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

403 
next 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

404 
case 2 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

405 
note `B 0` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

406 
show "Q 0" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

407 
} 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

408 
next 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

409 
case (Suc n) 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

410 
note `A n ==> P n` and `B n ==> Q n` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

411 
{ 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

412 
case 1 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

413 
note `A (Suc n)` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

414 
show "P (Suc n)" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

415 
next 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

416 
case 2 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

417 
note `B (Suc n)` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

418 
show "Q (Suc n)" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

419 
} 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

420 
qed 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

421 

18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

422 
If simultaneous goals are to be used with mutual rules, the statement 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

423 
needs to be structured carefully as a twolevel conjunction, using 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

424 
lists of propositions separated by 'and': 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

425 

18507  426 
lemma 
427 
shows "a : A ==> P1 a" 

428 
"a : A ==> P2 a" 

429 
and "b : B ==> Q1 b" 

430 
"b : B ==> Q2 b" 

431 
"b : B ==> Q3 b" 

432 
proof (induct set: A B) 

18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

433 

18399  434 
* Provers/induct: support coinduction as well. See 
435 
src/HOL/Library/Coinductive_List.thy for various examples. 

436 

20919
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

437 
* Attribute "symmetric" produces result with standardized schematic 
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

438 
variables (index 0). Potential INCOMPATIBILITY. 
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

439 

18674  440 
* Simplifier: by default the simplifier trace only shows top level rewrites 
441 
now. That is, trace_simp_depth_limit is set to 1 by default. Thus there is 

442 
less danger of being flooded by the trace. The trace indicates where parts 

443 
have been suppressed. 

444 

18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

445 
* Provers/classical: removed obsolete classical version of elim_format 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

446 
attribute; classical elim/dest rules are now treated uniformly when 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

447 
manipulating the claset. 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

448 

18694  449 
* Provers/classical: stricter checks to ensure that supplied intro, 
450 
dest and elim rules are wellformed; dest and elim rules must have at 

451 
least one premise. 

452 

453 
* Provers/classical: attributes dest/elim/intro take an optional 

18695  454 
weight argument for the rule (just as the Pure versions). Weights are 
18696  455 
ignored by automated tools, but determine the search order of single 
18694  456 
rule steps. 
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18549
diff
changeset

457 

18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

458 
* Syntax: input syntax now supports dummy variable binding "%_. b", 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

459 
where the body does not mention the bound variable. Note that dummy 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

460 
patterns implicitly depend on their context of bounds, which makes 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

461 
"{_. _}" match any set comprehension as expected. Potential 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

462 
INCOMPATIBILITY  parse translations need to cope with syntactic 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

463 
constant "_idtdummy" in the binding position. 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

464 

ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

465 
* Syntax: removed obsolete syntactic constant "_K" and its associated 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

466 
parse translation. INCOMPATIBILITY  use dummy abstraction instead, 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

467 
for example "A > B" => "Pi A (%_. B)". 
17779  468 

20582
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

469 
* Pure: 'class_deps' command visualizes the subclass relation, using 
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

470 
the graph browser tool. 
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

471 

20620
8b26f58c5646
* Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents:
20607
diff
changeset

472 
* Pure: 'print_theory' now suppresses entities with internal name 
8b26f58c5646
* Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents:
20607
diff
changeset

473 
(trailing "_") by default; use '!' option for full details. 
8b26f58c5646
* Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents:
20607
diff
changeset

474 

17865  475 

17806  476 
*** HOL *** 
477 

21099  478 
* Constant "List.list_all2" in List.thy now uses authentic syntax. 
479 
INCOMPATIBILITY: translations containing list_all2 may go wrong. On Isar 

480 
level, use abbreviations instead. 

481 

482 
* Constant "List.op mem" in List.thy now has proper name: "List.memberl" 

483 
INCOMPATIBILITY: rarely occuring name references (e.g. ``List.op mem.simps'') 

484 
require renaming (e.g. ``List.memberl.simps''). 

485 

20712
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

486 
* Renamed constants in HOL.thy: 
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

487 
0 ~> HOL.zero 
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

488 
1 ~> HOL.one 
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

489 
INCOMPATIBILITY: ML code directly refering to constant names may need adaption 
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

490 
This in general only affects handwritten proof tactics, simprocs and so on. 
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

491 

20607  492 
* New theory OperationalEquality providing class 'eq' with constant 'eq', 
493 
allowing for code generation with polymorphic equality. 

494 

20485  495 
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has been 
20500  496 
abandoned in favour of plain 'int'. INCOMPATIBILITY  Significant changes 
497 
for setting up numeral syntax for types: 

20485  498 

499 
 new constants Numeral.pred and Numeral.succ instead 

500 
of former Numeral.bin_pred and Numeral.bin_succ. 

501 
 Use integer operations instead of bin_add, bin_mult and so on. 

502 
 Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps. 

503 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

504 

505 
See HOL/Integ/IntArith.thy for an example setup. 

506 

19895  507 
* New top level command 'normal_form' computes the normal form of a term 
508 
that may contain free variables. For example 'normal_form "rev[a,b,c]"' 

509 
prints '[b,c,a]'. This command is suitable for heavyduty computations 

510 
because the functions are compiled to ML first. 

511 
INCOMPATIBILITY: new keywords 'normal_form' must quoted when used as 

512 
an identifier. 

513 

17996  514 
* Alternative iff syntax "A <> B" for equality on bool (with priority 
515 
25 like >); output depends on the "iff" print_mode, the default is 

516 
"A = B" (with priority 50). 

517 

19279  518 
* Renamed constants in HOL.thy and Orderings.thy: 
19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

519 
op + ~> HOL.plus 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

520 
op  ~> HOL.minus 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

521 
uminus ~> HOL.uminus 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

522 
op * ~> HOL.times 
19277  523 
op < ~> Orderings.less 
524 
op <= ~> Orderings.less_eq 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

525 

77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

526 
Adaptions may be required in the following cases: 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

527 

19377  528 
a) Userdefined constants using any of the names "plus", "minus", "times", 
529 
"less" or "less_eq". The standard syntax translations for "+", "" and "*" 

530 
may go wrong. 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

531 
INCOMPATIBILITY: use more specific names. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

532 

19277  533 
b) Variables named "plus", "minus", "times", "less", "less_eq" 
19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

534 
INCOMPATIBILITY: use more specific names. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

535 

19377  536 
c) Permutative equations (e.g. "a + b = b + a") 
537 
Since the change of names also changes the order of terms, permutative 

538 
rewrite rules may get applied in a different order. Experience shows that 

539 
this is rarely the case (only two adaptions in the whole Isabelle 

540 
distribution). 

541 
INCOMPATIBILITY: rewrite proofs 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

542 

77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

543 
d) ML code directly refering to constant names 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

544 
This in general only affects handwritten proof tactics, simprocs and so on. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

545 
INCOMPATIBILITY: grep your sourcecode and replace names. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

546 

18674  547 
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only). 
548 

20716
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset

549 
* Relation composition operator "op O" now has precedence 75 and binds 
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset

550 
stronger than union and intersection. INCOMPATIBILITY. 
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset

551 

19377  552 
* The old set interval syntax "{m..n(}" (and relatives) has been removed. 
553 
Use "{m..<n}" (and relatives) instead. 

554 

17865  555 
* In the context of the assumption "~(s = t)" the Simplifier rewrites 
556 
"t = s" to False (by simproc "neq_simproc"). For backward 

557 
compatibility this can be disabled by ML "reset use_neq_simproc". 

17779  558 

18979  559 
* "m dvd n" where m and n are numbers is evaluated to True/False by simp. 
560 

19211  561 
* Theorem Cons_eq_map_conv no longer has attribute `simp'. 
562 

19279  563 
* Theorem setsum_mult renamed to setsum_right_distrib. 
564 

19211  565 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
566 
'rule' method. 

567 

17809
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset

568 
* Tactics 'sat' and 'satx' reimplemented, several improvements: goals 
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset

569 
no longer need to be stated as "<prems> ==> False", equivalences (i.e. 
17865  570 
"=" on type bool) are handled, variable names of the form "lit_<n>" 
571 
are no longer reserved, significant speedup. 

572 

20136  573 
* Tactics 'sat' and 'satx' can now replay MiniSat proof traces. zChaff is 
574 
still supported as well. 

575 

18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

576 
* inductive and datatype: provide projections of mutual rules, bundled 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

577 
as foo_bar.inducts; 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

578 

20807  579 
* Library: theory Infinite_Set has been moved to the library. 
580 

19572
a4b3176f19dd
* Library: theory Accessible_Part has been move to main HOL.
wenzelm
parents:
19508
diff
changeset

581 
* Library: theory Accessible_Part has been move to main HOL. 
a4b3176f19dd
* Library: theory Accessible_Part has been move to main HOL.
wenzelm
parents:
19508
diff
changeset

582 

18446  583 
* Library: added theory Coinductive_List of potentially infinite lists 
584 
as greatest fixedpoint. 

18399  585 

19254  586 
* Library: added theory AssocList which implements (finite) maps as 
19252  587 
association lists. 
17809
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset

588 

20807  589 
* New proof method "evaluation" for efficiently solving a goal (i.e. a 
590 
boolean expression) by compiling it to ML. The goal is "proved" (via 

591 
the oracle "Evaluation") if it evaluates to True. 

592 

593 
* Linear arithmetic now splits certain operators (e.g. min, max, abs) 

594 
also when invoked by the simplifier. This results in the simplifier 

21056  595 
being more powerful on arithmetic goals. INCOMPATIBILITY. Set 
20807  596 
fast_arith_split_limit to 0 to obtain the old behavior. 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset

597 

20067
26bac504ef90
hex and binary numerals (contributed by Rafal Kolanski)
kleing
parents:
20040
diff
changeset

598 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  599 

20807  600 
* New method: reify eqs (t), where eqs are equations for an 
601 
interpretation I :: 'a list => 'b => 'c and t::'c is an optional 

602 
parameter, computes a term s::'b and a list xs::'a list and proves the 

603 
theorem I xs s = t. This is also known as reification or quoting. The 

604 
resulting theorem is applied to the subgoal to substitute t with I xs 

605 
s. If t is omitted, the subgoal itself is reified. 

606 

607 
* New method: reflection corr_thm eqs (t). The parameters eqs and (t) 

608 
are as explained above. corr_thm is a theorem for I vs (f t) = I vs t, 

609 
where f is supposed to be a computable function (in the sense of code 

610 
generattion). The method uses reify to compute s and xs as above then 

611 
applies corr_thm and uses normalization by evaluation to "prove" f s = 

612 
r and finally gets the theorem t = r, which is again applied to the 

613 
subgoal. An Example is available in HOL/ex/ReflectionEx.thy. 

614 

615 
* Reflection: Automatic refification now handels binding, an example 

616 
is available in HOL/ex/ReflectionEx.thy 

617 

618 

20169  619 
*** HOLAlgebra *** 
620 

21170  621 
* Formalisation of ideals and the quotient construction over rings. 
622 

623 
* Order and lattice theory no longer based on records. 

624 
INCOMPATIBILITY. 

625 

626 
* Method algebra is now set up via an attribute. For examples see 

627 
CRing.thy. INCOMPATIBILITY: the method is now weaker on combinations 

628 
of algebraic structures. 

20318
0e0ea63fe768
Restructured algebra library, added ideals and quotient rings.
ballarin
parents:
20217
diff
changeset

629 

0e0ea63fe768
Restructured algebra library, added ideals and quotient rings.
ballarin
parents:
20217
diff
changeset

630 
* Renamed `CRing.thy' to `Ring.thy'. INCOMPATIBILITY. 
20169  631 

20807  632 

19653  633 
*** HOLComplex *** 
634 

635 
* Theory Real: new method ferrack implements quantifier elimination 

636 
for linear arithmetic over the reals. The quantifier elimination 

637 
feature is used only for decision, for compatibility with arith. This 

638 
means a goal is either solved or left unchanged, no simplification. 

639 

640 

17878  641 
*** ML *** 
642 

21056  643 
* Pure/table: 
644 

645 
Function `...tab.foldl` removed. 

646 
INCOMPATIBILITY: use `...tabfold` instead 

647 

20857  648 
* Pure/library: 
649 

21056  650 
`gen_rem(s)` abandoned in favour of `remove` / `subtract`. 
20951
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

651 
INCOMPATIBILITY: 
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

652 
rewrite "gen_rem eq (xs, x)" to "remove (eq o swap) x xs" 
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

653 
rewrite "gen_rems eq (xs, ys)" to "subtract (eq o swap) ys xs" 
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

654 
drop "swap" if "eq" is symmetric. 
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

655 

868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

656 
* Pure/library: 
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

657 

21056  658 
infixes `ins` `ins_string` `ins_int` have been abandoned in favour of `insert`. 
20857  659 
INCOMPATIBILITY: rewrite "x ins(_...) xs" to "insert (op =) x xs" 
660 

20607  661 
* Pure/General/susp.ML: 
662 

663 
New module for delayed evaluations. 

664 

18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

665 
* Pure/library: 
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

666 

20348  667 
Semantically identical functions "equal_list" and "eq_list" have been 
668 
unified to "eq_list". 

669 

670 
* Pure/library: 

671 

18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

672 
val burrow: ('a list > 'b list) > 'a list list > 'b list list 
18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18540
diff
changeset

673 
val fold_burrow: ('a list > 'c > 'b list * 'd) > 'a list list > 'c > 'b list list * 'd 
18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

674 

18540  675 
The semantics of "burrow" is: "take a function with *simulatanously* 
676 
transforms a list of value, and apply it *simulatanously* to a list of 

677 
list of values of the appropriate type". Confer this with "map" which 

678 
would *not* apply its argument function simulatanously but in 

18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18540
diff
changeset

679 
sequence. "fold_burrow" has an additional context. 
18540  680 

681 
Both actually avoid the usage of "unflat" since they hide away 

682 
"unflat" from the user. 

18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

683 

18446  684 
* Pure/library: functions map2 and fold2 with curried syntax for 
685 
simultanous mapping and folding: 

686 

18422
875451c9d253
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18399
diff
changeset

687 
val map2: ('a > 'b > 'c) > 'a list > 'b list > 'c list 
875451c9d253
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18399
diff
changeset

688 
val fold2: ('a > 'b > 'c > 'c) > 'a list > 'b list > 'c > 'c 
875451c9d253
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18399
diff
changeset

689 

18446  690 
* Pure/library: indexed lists  some functions in the Isabelle library 
691 
treating lists over 'a as finite mappings from [0...n] to 'a have been 

692 
given more convenient names and signatures reminiscent of similar 

693 
functions for alists, tables, etc: 

18051  694 

695 
val nth: 'a list > int > 'a 

696 
val nth_map: int > ('a > 'a) > 'a list > 'a list 

697 
val fold_index: (int * 'a > 'b > 'b) > 'a list > 'b > 'b 

698 

18446  699 
Note that fold_index starts counting at index 0, not 1 like foldln 
700 
used to. 

701 

19653  702 
* Pure/library: general ``divide_and_conquer'' combinator on lists. 
703 

19032  704 
* Pure/General/name_mangler.ML provides a functor for generic name 
21109  705 
mangling (bijective mapping from expression values to strings). 
18446  706 

19032  707 
* Pure/General/rat.ML implements rational numbers. 
708 

709 
* Pure/General/table.ML: the join operations now works via exceptions 

19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

710 
DUP/SAME instead of type option. This is simpler in simple cases, and 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

711 
admits slightly more efficient complex applications. 
18446  712 

18642  713 
* Pure: datatype Context.generic joins theory/Proof.context and 
18644  714 
provides some facilities for code that works in either kind of 
18642  715 
context, notably GenericDataFun for uniform theory and proof data. 
716 

18862
bd83590be0f7
* Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents:
18815
diff
changeset

717 
* Pure: 'advanced' translation functions (parse_translation etc.) now 
bd83590be0f7
* Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents:
18815
diff
changeset

718 
use Context.generic instead of just theory. 
bd83590be0f7
* Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents:
18815
diff
changeset

719 

18737  720 
* Pure: simplified internal attribute type, which is now always 
721 
Context.generic * thm > Context.generic * thm. Global (theory) 

722 
vs. local (Proof.context) attributes have been discontinued, while 

18738  723 
minimizing code duplication. Thm.rule_attribute and 
724 
Thm.declaration_attribute build canonical attributes; see also 

19006
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

725 
structure Context for further operations on Context.generic, notably 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

726 
GenericDataFun. INCOMPATIBILITY, need to adapt attribute type 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

727 
declarations and definitions. 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

728 

19508  729 
* Pure/kernel: consts certification ignores sort constraints given in 
730 
signature declarations. (This information is not relevant to the 

731 
logic, but only for type inference.) IMPORTANT INTERNAL CHANGE. 

732 

733 
* Pure: axiomatic type classes are now purely definitional, with 

734 
explicit proofs of class axioms and super class relations performed 

735 
internally. See Pure/axclass.ML for the main internal interfaces  

736 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

737 
AxClass.axiomatize_class/classrel/arity supercede 

738 
Sign.add_classes/classrel/arities. 

739 

19006
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

740 
* Pure/Isar: Args/Attrib parsers operate on Context.generic  
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

741 
global/local versions on theory vs. Proof.context have been 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

742 
discontinued; Attrib.syntax and Method.syntax have been adapted 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

743 
accordingly. INCOMPATIBILITY, need to adapt parser expressions for 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

744 
attributes, methods, etc. 
18642  745 

18446  746 
* Pure: several functions of signature "... > theory > theory * ..." 
747 
have been reoriented to "... > theory > ... * theory" in order to 

748 
allow natural usage in combination with the >, >>, > and 

749 
fold_map combinators. 

18051  750 

18020  751 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  752 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  753 
achieve the old behaviour. 
754 

755 
* Pure: the "Goal" constant is now called "prop", supporting a 

756 
slightly more general idea of ``protecting'' metalevel rule 

757 
statements. 

758 

20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

759 
* Pure: Logic.(un)varify only works in a global context, which is now 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

760 
enforced instead of silently assumed. INCOMPATIBILITY, may use 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

761 
Logic.legacy_(un)varify as temporary workaround. 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

762 

20090  763 
* Pure: structure Name provides scalable operations for generating 
764 
internal variable names, notably Name.variants etc. This replaces 

765 
some popular functions from term.ML: 

766 

767 
Term.variant > Name.variant 

768 
Term.variantlist > Name.variant_list (*canonical argument order*) 

769 
Term.invent_names > Name.invent_list 

770 

771 
Note that lowlevel renaming rarely occurs in new code  operations 

772 
from structure Variable are used instead (see below). 

773 

20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

774 
* Pure: structure Variable provides fundamental operations for proper 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

775 
treatment of fixed/schematic variables in a context. For example, 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

776 
Variable.import introduces fixes for schematics of given facts and 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

777 
Variable.export reverses the effect (up to renaming)  this replaces 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

778 
various freeze_thaw operations. 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

779 

18567  780 
* Pure: structure Goal provides simple interfaces for 
17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

781 
init/conclude/finish and tactical prove operations (replacing former 
20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

782 
Tactic.prove). Goal.prove is the canonical way to prove results 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

783 
within a given context; Goal.prove_global is a degraded version for 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

784 
theory level goals, including a global Drule.standard. Note that 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

785 
OldGoals.prove_goalw_cterm has long been obsolete, since it is 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

786 
illbehaved in a local proof context (e.g. with local fixes/assumes or 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

787 
in a locale context). 
17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

788 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

789 
* Isar: simplified treatment of userlevel errors, using exception 
18687  790 
ERROR of string uniformly. Function error now merely raises ERROR, 
18686
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

791 
without any side effect on output channels. The Isar toplevel takes 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

792 
care of proper display of ERROR exceptions. ML code may use plain 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

793 
handle/can/try; cat_error may be used to concatenate errors like this: 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

794 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

795 
... handle ERROR msg => cat_error msg "..." 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

796 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

797 
Toplevel ML code (run directly or through the Isar toplevel) may be 
18687  798 
embedded into the Isar toplevel with exception display/debug like 
799 
this: 

18686
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

800 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

801 
Isar.toplevel (fn () => ...) 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

802 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

803 
INCOMPATIBILITY, removed special transform_error facilities, removed 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

804 
obsolete variants of userlevel exceptions (ERROR_MESSAGE, 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

805 
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL) 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

806 
 use plain ERROR instead. 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

807 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

808 
* Isar: theory setup now has type (theory > theory), instead of a 
18722
0888eca0f1be
* ML/Isar: theory setup has type (theory > theory);
wenzelm
parents:
18696
diff
changeset

809 
list. INCOMPATIBILITY, may use #> to compose setup functions. 
0888eca0f1be
* ML/Isar: theory setup has type (theory > theory);
wenzelm
parents:
18696
diff
changeset

810 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

811 
* Isar: installed ML toplevel pretty printer for type Proof.context, 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

812 
subject to ProofContext.debug/verbose flags. 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

813 

cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

814 
* Isar: Toplevel.theory_to_proof admits transactions that modify the 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

815 
theory before entering a proof state. Transactions now always see a 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

816 
quasifunctional intermediate checkpoint, both in interactive and 
18590
f6a553aa3d81
Pure/Isar: Toplevel.theory_to_proof admits transactions that modify the theory;
wenzelm
parents:
18568
diff
changeset

817 
batch mode. 
18567  818 

17878  819 
* Simplifier: the simpset of a running simplification process now 
820 
contains a proof context (cf. Simplifier.the_context), which is the 

821 
very context that the initial simpset has been retrieved from (by 

17890  822 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  823 
(solver, looper etc.) may depend on arbitrary proof data. 
824 

825 
* Simplifier.inherit_context inherits the proof context (plus the 

826 
local bounds) of the current simplification process; any simproc 

827 
etc. that calls the Simplifier recursively should do this! Removed 

828 
former Simplifier.inherit_bounds, which is already included here  

17890  829 
INCOMPATIBILITY. Tools based on lowlevel rewriting may even have to 
830 
specify an explicit context using Simplifier.context/theory_context. 

17878  831 

832 
* Simplifier/Classical Reasoner: more abstract interfaces 

833 
change_simpset/claset for modifying the simpset/claset reference of a 

834 
theory; raw versions simpset/claset_ref etc. have been discontinued  

835 
INCOMPATIBILITY. 

836 

18540  837 
* Provers: more generic wrt. syntax of objectlogics, avoid hardwired 
838 
"Trueprop" etc. 

839 

17878  840 

20988
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

841 
*** System *** 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

842 

0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

843 
* isabelleprocess: option S (secure mode) disables some critical 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

844 
operations, notably runtime compilation and evaluation of ML source 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

845 
code. 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

846 

17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

847 

17720  848 
New in Isabelle2005 (October 2005) 
849 
 

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

850 

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

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

852 

15130  853 
* Theory headers: the new header syntax for Isar theories is 
854 

855 
theory <name> 

16234  856 
imports <theory1> ... <theoryN> 
857 
uses <file1> ... <fileM> 

15130  858 
begin 
859 

16234  860 
where the 'uses' part is optional. The previous syntax 
861 

862 
theory <name> = <theory1> + ... + <theoryN>: 

863 

16717  864 
will disappear in the next release. Use isatool fixheaders to convert 
865 
existing theory files. Note that there is no change in ancient 

17371  866 
nonIsar theories now, but these will disappear soon. 
15130  867 

15475
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

868 
* Theory loader: parent theories can now also be referred to via 
16234  869 
relative and absolute paths. 
870 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

871 
* Command 'find_theorems' searches for a list of criteria instead of a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

872 
list of constants. Known criteria are: intro, elim, dest, name:string, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

873 
simp:term, and any term. Criteria can be preceded by '' to select 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

874 
theorems that do not match. Intro, elim, dest select theorems that 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

875 
match the current goal, name:s selects theorems whose fully qualified 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

876 
name contain s, and simp:term selects all simplification rules whose 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

877 
lhs match term. Any other term is interpreted as pattern and selects 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

878 
all theorems matching the pattern. Available in ProofGeneral under 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

879 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  880 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

881 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  882 

883 
prints the last 100 theorems matching the pattern "(_::nat) + _ + _", 

884 
matching the current goal as introduction rule and not having "HOL." 

885 
in their name (i.e. not being defined in theory HOL). 

16013
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

886 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

887 
* Command 'thms_containing' has been discontinued in favour of 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

888 
'find_theorems'; INCOMPATIBILITY. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

889 

17385  890 
* Communication with Proof General is now 8bit clean, which means that 
891 
Unicode text in UTF8 encoding may be used within theory texts (both 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

892 
formal and informal parts). Cf. option U of the Isabelle Proof 
17538  893 
General interface. Here are some simple examples (cf. src/HOL/ex): 
894 

895 
http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html 

896 
http://isabelle.in.tum.de/library/HOL/ex/Chinese.html 

17385  897 

17425  898 
* Improved efficiency of the Simplifier and, to a lesser degree, the 
899 
Classical Reasoner. Typical big applications run around 2 times 

900 
faster. 

901 

15703  902 

903 
*** Document preparation *** 

904 

16234  905 
* Commands 'display_drafts' and 'print_drafts' perform simple output 
906 
of raw sources. Only those symbols that do not require additional 

907 
LaTeX packages (depending on comments in isabellesym.sty) are 

908 
displayed properly, everything else is left verbatim. isatool display 

909 
and isatool print are used as front ends (these are subject to the 

910 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

911 

17047
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

912 
* Command tags control specific markup of certain regions of text, 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

913 
notably folding and hiding. Predefined tags include "theory" (for 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

914 
theory begin and end), "proof" for proof commands, and "ML" for 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

915 
commands involving ML code; the additional tags "visible" and 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

916 
"invisible" are unused by default. Users may give explicit tag 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

917 
specifications in the text, e.g. ''by %invisible (auto)''. The 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

918 
interpretation of tags is determined by the LaTeX job during document 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

919 
preparation: see option V of isatool usedir, or options n and t of 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

920 
isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag, 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

921 
\isadroptag. 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

922 

e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

923 
Several document versions may be produced at the same time via isatool 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

924 
usedir (the generated index.html will link all of them). Typical 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

925 
specifications include ''V document=theory,proof,ML'' to present 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

926 
theory/proof/ML parts faithfully, ''V outline=/proof,/ML'' to fold 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

927 
proof and ML commands, and ''V mutilated=theory,proof,ML'' to omit 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

928 
these parts without any formal replacement text. The Isabelle site 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

929 
default settings produce ''document'' and ''outline'' versions as 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

930 
specified above. 
16234  931 

17402  932 
* Several new antiquotations: 
15979  933 

934 
@{term_type term} prints a term with its type annotated; 

935 

936 
@{typeof term} prints the type of a term; 

937 

16234  938 
@{const const} is the same as @{term const}, but checks that the 
939 
argument is a known logical constant; 

15979  940 

941 
@{term_style style term} and @{thm_style style thm} print a term or 

16234  942 
theorem applying a "style" to it 
943 

17117
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

944 
@{ML text} 
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

945 

16234  946 
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of 
947 
definitions, equations, inequations etc., 'concl' printing only the 

17393  948 
conclusion of a metalogical statement theorem, and 'prem1' .. 'prem19' 
16234  949 
to print the specified premise. TermStyle.add_style provides an ML 
950 
interface for introducing further styles. See also the "LaTeX Sugar" 

17117
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

951 
document practical applications. The ML antiquotation prints 
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

952 
typechecked ML expressions verbatim. 
16234  953 

17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

954 
* Markup commands 'chapter', 'section', 'subsection', 'subsubsection', 
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

955 
and 'text' support optional locale specification '(in loc)', which 
17269  956 
specifies the default context for interpreting antiquotations. For 
957 
example: 'text (in lattice) {* @{thm inf_assoc}*}'. 

17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

958 

dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

959 
* Option 'locale=NAME' of antiquotations specifies an alternative 
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

960 
context interpreting the subsequent argument. For example: @{thm 
17269  961 
[locale=lattice] inf_assoc}. 
17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

962 

17097
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

963 
* Proper output of proof terms (@{prf ...} and @{full_prf ...}) within 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

964 
a proof context. 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

965 

78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

966 
* Proper output of antiquotations for theory commands involving a 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

967 
proof context (such as 'locale' or 'theorem (in loc) ...'). 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

968 

17193
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

969 
* Delimiters of outer tokens (string etc.) now produce separate LaTeX 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

970 
macros (\isachardoublequoteopen, isachardoublequoteclose etc.). 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

971 

83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

972 
* isatool usedir: new option C (default true) controls whether option 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

973 
D should include a copy of the original document directory; C false 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

974 
prevents unwanted effects such as copying of administrative CVS data. 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

975 

16234  976 

977 
*** Pure *** 

978 

979 
* Considerably improved version of 'constdefs' command. Now performs 

980 
automatic typeinference of declared constants; additional support for 

981 
local structure declarations (cf. locales and HOL records), see also 

982 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

983 
sequential dependencies of definitions within a single 'constdefs' 

984 
section; moreover, the declared name needs to be an identifier. If 

985 
all fails, consider to fall back on 'consts' and 'defs' separately. 

986 

987 
* Improved indexed syntax and implicit structures. First of all, 

988 
indexed syntax provides a notational device for subscripted 

989 
application, using the new syntax \<^bsub>term\<^esub> for arbitrary 

990 
expressions. Secondly, in a local context with structure 

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

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

993 
show_structs controls printing of implicit structures. Typical 

994 
applications of these concepts involve record types and locales. 

995 

996 
* New command 'no_syntax' removes grammar declarations (and 

997 
translations) resulting from the given syntax specification, which is 

998 
interpreted in the same manner as for the 'syntax' command. 

999 

1000 
* 'Advanced' translation functions (parse_translation etc.) may depend 

1001 
on the signature of the theory context being presently used for 

1002 
parsing/printing, see also isarref manual. 

1003 

16856  1004 
* Improved 'oracle' command provides a typesafe interface to turn an 
1005 
ML expression of type theory > T > term into a primitive rule of 

1006 
type theory > T > thm (i.e. the functionality of Thm.invoke_oracle 

1007 
is already included here); see also FOL/ex/IffExample.thy; 

1008 
INCOMPATIBILITY. 

1009 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1010 
* axclass: name space prefix for class "c" is now "c_class" (was "c" 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1011 
before); "cI" is no longer bound, use "c.intro" instead. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1012 
INCOMPATIBILITY. This change avoids clashes of fact bindings for 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1013 
axclasses vs. locales. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1014 

16234  1015 
* Improved internal renaming of symbolic identifiers  attach primes 
1016 
instead of base 26 numbers. 

1017 

1018 
* New flag show_question_marks controls printing of leading question 

1019 
marks in schematic variable names. 

1020 

1021 
* In schematic variable names, *any* symbol following \<^isub> or 

1022 
\<^isup> is now treated as part of the base name. For example, the 

1023 
following works without printing of awkward ".0" indexes: 

1024 

1025 
lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1" 

1026 
by simp 

1027 

1028 
* Inner syntax includes (*(*nested*) comments*). 

1029 

17548  1030 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  1031 
annotations as "(00...)". 
1032 

1033 
* Clear separation of logical types and nonterminals, where the latter 

1034 
may only occur in 'syntax' specifications or type abbreviations. 

1035 
Before that distinction was only partially implemented via type class 

1036 
"logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper 

1037 
use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very 

1038 
exotic syntax specifications may require further adaption 

17691  1039 
(e.g. Cube/Cube.thy). 
16234  1040 

1041 
* Removed obsolete type class "logic", use the top sort {} instead. 

1042 
Note that nonlogical types should be declared as 'nonterminals' 

1043 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

1044 
specifications. 

1045 

17095  1046 
* Attributes 'induct' and 'cases': type or set names may now be 
1047 
locally fixed variables as well. 

1048 

16234  1049 
* Simplifier: can now control the depth to which conditional rewriting 
1050 
is traced via the PG menu Isabelle > Settings > Trace Simp Depth 

1051 
Limit. 

1052 

1053 
* Simplifier: simplification procedures may now take the current 

1054 
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc 

1055 
interface), which is very useful for calling the Simplifier 

1056 
recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs 

1057 
is gone  use prems_of_ss on the simpset instead. Moreover, the 

1058 
lowlevel mk_simproc no longer applies Logic.varify internally, to 

1059 
allow for use in a context of fixed variables. 

1060 

1061 
* thin_tac now works even if the assumption being deleted contains !! 

1062 
or ==>. More generally, erule now works even if the major premise of 

1063 
the elimination rule contains !! or ==>. 

1064 

17597  1065 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  1066 

16234  1067 
* Reorganized bootstrapping of the Pure theories; CPure is now derived 
1068 
from Pure, which contains all common declarations already. Both 

1069 
theories are defined via plain Isabelle/Isar .thy files. 

1070 
INCOMPATIBILITY: elements of CPure (such as the CPure.intro / 

1071 
CPure.elim / CPure.dest attributes) now appear in the Pure name space; 

1072 
use isatool fixcpure to adapt your theory and ML sources. 

1073 

1074 
* New syntax 'name(ij, i, i, ...)' for referring to specific 

1075 
selections of theorems in named facts via index ranges. 

1076 

17097
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1077 
* 'print_theorems': in theory mode, really print the difference 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1078 
wrt. the last state (works for interactive theory development only), 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1079 
in proof mode print all local facts (cf. 'print_facts'); 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1080 

17397  1081 
* 'hide': option '(open)' hides only base names. 
1082 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1083 
* More efficient treatment of intermediate checkpoints in interactive 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1084 
theory development. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1085 

17663
28be54ff74f8
Added entries for code_module, code_library, and value.
berghofe
parents:
17641
diff
changeset

1086 
* Code generator is now invoked via code_module (incremental code 
17664  1087 
generation) and code_library (modular code generation, ML structures 
1088 
for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains' 

1089 
must be quoted when used as identifiers. 

1090 

1091 
* New 'value' command for reading, evaluating and printing terms using 

1092 
the code generator. INCOMPATIBILITY: command keyword 'value' must be 

1093 
quoted when used as identifier. 

17663
28be54ff74f8
Added entries for code_module, code_library, and value.
berghofe
parents:
17641
diff
changeset

1094 

16234  1095 

1096 
*** Locales *** 

17095  1097 

17385  1098 
* New commands for the interpretation of locale expressions in 
1099 
theories (1), locales (2) and proof contexts (3). These generate 

1100 
proof obligations from the expression specification. After the 

1101 
obligations have been discharged, theorems of the expression are added 

1102 
to the theory, target locale or proof context. The synopsis of the 

1103 
commands is a follows: 

1104 

17095  1105 
(1) interpretation expr inst 
1106 
(2) interpretation target < expr 

1107 
(3) interpret expr inst 

17385  1108 

17095  1109 
Interpretation in theories and proof contexts require a parameter 
1110 
instantiation of terms from the current context. This is applied to 

17385  1111 
specifications and theorems of the interpreted expression. 
1112 
Interpretation in locales only permits parameter renaming through the 

1113 
locale expression. Interpretation is smart in that interpretations 

1114 
that are active already do not occur in proof obligations, neither are 

1115 
instantiated theorems stored in duplicate. Use 'print_interps' to 

1116 
inspect active interpretations of a particular locale. For details, 

17436  1117 
see the Isar Reference manual. Examples can be found in 
1118 
HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy. 

16234  1119 

1120 
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use 

1121 
'interpret' instead. 

1122 

17385  1123 
* New context element 'constrains' for adding type constraints to 
1124 
parameters. 

1125 

1126 
* Context expressions: renaming of parameters with syntax 

1127 
redeclaration. 

17095  1128 

1129 
* Locale declaration: 'includes' disallowed. 

1130 

16234  1131 
* Proper static binding of attribute syntax  i.e. types / terms / 
1132 
facts mentioned as arguments are always those of the locale definition 

1133 
context, independently of the context of later invocations. Moreover, 

1134 
locale operations (renaming and type / term instantiation) are applied 

1135 
to attribute arguments as expected. 

1136 

1137 
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of 

1138 
actual attributes; rare situations may require Attrib.attribute to 

1139 
embed those attributes into Attrib.src that lack concrete syntax. 

1140 
Attribute implementations need to cooperate properly with the static 

1141 
binding mechanism. Basic parsers Args.XXX_typ/term/prop and 

1142 
Attrib.XXX_thm etc. already do the right thing without further 

1143 
intervention. Only unusual applications  such as "where" or "of" 

1144 
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both 

1145 
on the context and the facts involved  may have to assign parsed 

1146 
values to argument tokens explicitly. 

1147 

1148 
* Changed parameter management in theorem generation for long goal 

1149 
statements with 'includes'. INCOMPATIBILITY: produces a different 

1150 
theorem statement in rare situations. 

1151 

17228  1152 
* Locale inspection command 'print_locale' omits notes elements. Use 
1153 
'print_locale!' to have them included in the output. 

1154 

16234  1155 

1156 
*** Provers *** 

1157 

1158 
* Provers/hypsubst.ML: improved version of the subst method, for 

1159 
singlestep rewriting: it now works in bound variable contexts. New is 

1160 
'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may 

1161 
rewrite a different subterm than the original subst method, which is 

1162 
still available as 'simplesubst'. 

1163 

1164 
* Provers/quasi.ML: new transitivity reasoners for transitivity only 

1165 
and quasi orders. 

1166 

1167 
* Provers/trancl.ML: new transitivity reasoner for transitive and 

1168 
reflexivetransitive closure of relations. 

1169 

1170 
* Provers/blast.ML: new reference depth_limit to make blast's depth 

1171 
limit (previously hardcoded with a value of 20) userdefinable. 

1172 

1173 
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup 

1174 
is peformed already. Objectlogics merely need to finish their 

1175 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  1176 

15475
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

1177 

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

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

1179 

16234  1180 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  1181 

1182 
syntax (epsilon) 

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

1184 

16234  1185 
The symbol \<some> is displayed as the alternative epsilon of LaTeX 
1186 
and xsymbol; use option 'm epsilon' to get it actually printed. 

1187 
Moreover, the mathematically important symbolic identifier \<epsilon> 

1188 
becomes available as variable, constant etc. INCOMPATIBILITY, 

1189 

1190 
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x". 

1191 
Similarly for all quantifiers: "ALL x > y" etc. The xsymbol for >= 

17371  1192 
is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to 
17016
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

1193 
support corresponding Isar calculations. 
16234  1194 

1195 
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>" 

1196 
instead of ":". 

1197 

1198 
* theory SetInterval: changed the syntax for open intervals: 

1199 

1200 
Old New 

1201 
{..n(} {..<n} 

1202 
{)n..} {n<..} 

1203 
{m..n(} {m..<n} 

1204 
{)m..n} {m<..n} 

1205 
{)m..n(} {m<..<n} 

1206 

1207 
The old syntax is still supported but will disappear in the next 

1208 
release. For conversion use the following Emacs search and replace 

1209 
patterns (these are not perfect but work quite well): 

15046  1210 

1211 
{)\([^\.]*\)\.\. > {\1<\.\.} 

1212 
\.\.\([^(}]*\)(} > \.\.<\1} 

1213 

17533  1214 
* Theory Commutative_Ring (in Library): method comm_ring for proving 
1215 
equalities in commutative rings; method 'algebra' provides a generic 

1216 
interface. 

17389
b4743198b939
Method comm_ring for proving equalities in commutative rings.
wenzelm
parents:
17385
diff
changeset

1217 

b4743198b939
Method comm_ring for proving equalities in commutative rings.
wenzelm
parents:
17385
diff
changeset

1218 
* Theory Finite_Set: changed the syntax for 'setsum', summation over 
16234  1219 
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is 
17371  1220 
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can 
17189  1221 
be a tuple pattern. 
16234  1222 

1223 
Some new syntax forms are available: 

1224 

1225 
"\<Sum>x  P. e" for "setsum (%x. e) {x. P}" 

1226 
"\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}" 

1227 
"\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}" 

1228 
"\<Sum>x < k. e" for "setsum (%x. e) {..<k}" 

1229 

1230 
The latter form "\<Sum>x < k. e" used to be based on a separate 

1231 
function "Summation", which has been discontinued. 

1232 

1233 
* theory Finite_Set: in structured induction proofs, the insert case 

1234 
is now 'case (insert x F)' instead of the old counterintuitive 'case 

1235 
(insert F x)'. 

1236 

1237 
* The 'refute' command has been extended to support a much larger 

1238 
fragment of HOL, including axiomatic type classes, constdefs and 

1239 
typedefs, inductive datatypes and recursion. 

1240 

17700  1241 
* New tactics 'sat' and 'satx' to prove propositional tautologies. 
1242 
Requires zChaff with proof generation to be installed. See 

1243 
HOL/ex/SAT_Examples.thy for examples. 

17619  1244 

16234  1245 
* Datatype induction via method 'induct' now preserves the name of the 
1246 
induction variable. For example, when proving P(xs::'a list) by 

1247 
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather 

1248 
than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY 

1249 
in unstructured proof scripts. 

1250 

1251 
* Reworked implementation of records. Improved scalability for 

1252 
records with many fields, avoiding performance problems for type 

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

1254 
of nested extension types. Therefore the record type only grows linear 

1255 
in the number of extensions and not in the number of fields. The 

1256 
toplevel (users) view on records is preserved. Potential 

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

1258 
old record representation. The type generated for a record is called 

1259 
<record_name>_ext_type. 

1260 

1261 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

1262 
proofs triggered by a record definition or a simproc (if 

1263 
quick_and_dirty is enabled). Definitions of large records can take 

1264 
quite long. 

1265 

1266 
New simproc record_upd_simproc for simplification of multiple record 

1267 
updates enabled by default. Moreover, trivial updates are also 

1268 
removed: r(x := x r) = r. INCOMPATIBILITY: old proofs break 

1269 
occasionally, since simplification is more powerful by default. 

1270 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1271 
* typedef: proper support for polymorphic sets, which contain extra 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1272 
typevariables in the term. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1273 

16234  1274 
* Simplifier: automatically reasons about transitivity chains 
1275 
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics 

1276 
provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY: 

1277 
old proofs break occasionally as simplification may now solve more 

1278 
goals than previously. 

1279 

1280 
* Simplifier: converts x <= y into x = y if assumption y <= x is 

1281 
present. Works for all partial orders (class "order"), in particular 

1282 
numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y 

1283 
just like y <= x. 

1284 

1285 
* Simplifier: new simproc for "let x = a in f x". If a is a free or 

1286 
bound variable or a constant then the let is unfolded. Otherwise 

1287 
first a is simplified to b, and then f b is simplified to g. If 

1288 
possible we abstract b from g arriving at "let x = b in h x", 

1289 
otherwise we unfold the let and arrive at g. The simproc can be 

1290 
enabled/disabled by the reference use_let_simproc. Potential 

1291 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  1292 

16563  1293 
* Classical reasoning: the meson method now accepts theorems as arguments. 
1294 

17595  1295 
* Prover support: prerelease of the IsabelleATP linkup, which runs background 
1296 
jobs to provide advice on the provability of subgoals. 

1297 

16891  1298 
* Theory OrderedGroup and Ring_and_Field: various additions and 
1299 
improvements to faciliate calculations involving equalities and 

1300 
inequalities. 

1301 

1302 
The following theorems have been eliminated or modified 

1303 
(INCOMPATIBILITY): 

16888  1304 

1305 
abs_eq now named abs_of_nonneg 

17371  1306 
abs_of_ge_0 now named abs_of_nonneg 
1307 
abs_minus_eq now named abs_of_nonpos 

16888  1308 
imp_abs_id now named abs_of_nonneg 
1309 
imp_abs_neg_id now named abs_of_nonpos 

1310 
mult_pos now named mult_pos_pos 

1311 
mult_pos_le now named mult_nonneg_nonneg 

1312 
mult_pos_neg_le now named mult_nonneg_nonpos 

1313 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

1314 
mult_neg now named mult_neg_neg 

1315 
mult_neg_le now named mult_nonpos_nonpos 

1316 

16891  1317 
* Theory Parity: added rules for simplifying exponents. 
1318 

17092  1319 
* Theory List: 
1320 

1321 
The following theorems have been eliminated or modified 

1322 
(INCOMPATIBILITY): 

1323 

1324 
list_all_Nil now named list_all.simps(1) 

1325 
list_all_Cons now named list_all.simps(2) 

1326 
list_all_conv now named list_all_iff 

1327 
set_mem_eq now named mem_iff 

1328 

16929  1329 
* Theories SetsAndFunctions and BigO (see HOL/Library) support 
1330 
asymptotic "big O" calculations. See the notes in BigO.thy. 

1331 

16888  1332 

1333 
*** HOLComplex *** 

1334 

16891  1335 
* Theory RealDef: better support for embedding natural numbers and 
1336 
integers in the reals. 

1337 

1338 
The following theorems have been eliminated or modified 

1339 
(INCOMPATIBILITY): 

1340 

17016
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

1341 
exp_ge_add_one_self now requires no hypotheses 
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

1342 
real_of_int_add reversed direction of equality (use [symmetric]) 
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

1343 
real_of_int_minus reversed direction of equality (use [symmetric]) 
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

1344 
real_of_int_diff reversed direction of equality (use [symmetric]) 
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

1345 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  1346 

1347 
* Theory RComplete: expanded support for floor and ceiling functions. 

16888  1348 

16962  1349 
* Theory Ln is new, with properties of the natural logarithm 
1350 

17423  1351 
* Hyperreal: There is a new type constructor "star" for making 
1352 
nonstandard types. The old type names are now type synonyms: 

1353 

1354 
hypreal = real star 

1355 
hypnat = nat star 

1356 
hcomplex = complex star 

1357 

1358 
* Hyperreal: Many groups of similarlydefined constants have been 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1359 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  1360 

1361 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

1362 

1363 
starset < starsetNat, starsetC 

1364 
*s* < *sNat*, *sc* 

1365 
starset_n < starsetNat_n, starsetC_n 

1366 
*sn* < *sNatn*, *scn* 

1367 
InternalSets < InternalNatSets, InternalCSets 

1368 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1369 
starfun < starfun{Nat,Nat2,C,RC,CR} 
17423  1370 
*f* < *fNat*, *fNat2*, *fc*, *fRc*, *fcR* 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1371 
starfun_n < starfun{Nat,Nat2,C,RC,CR}_n 
17423  1372 
*fn* < *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn* 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1373 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  1374 

1375 
* Hyperreal: Many typespecific theorems have been removed in favor of 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1376 
theorems specific to various axiomatic type classes (INCOMPATIBILITY): 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1377 

c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1378 
add_commute < {hypreal,hypnat,hcomplex}_add_commute 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1379 
add_assoc < {hypreal,hypnat,hcomplex}_add_assocs 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1380 
OrderedGroup.add_0 < {hypreal,hypnat,hcomplex}_add_zero_left 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1381 
OrderedGroup.add_0_right < {hypreal,hcomplex}_add_zero_right 
17423  1382 
right_minus < hypreal_add_minus 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1383 
left_minus < {hypreal,hcomplex}_add_minus_left 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1384 
mult_commute < {hypreal,hypnat,hcomplex}_mult_commute 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1385 
mult_assoc < {hypreal,hypnat,hcomplex}_mult_assoc 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1386 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  1387 
mult_1_right < hcomplex_mult_one_right 
1388 
mult_zero_left < hcomplex_mult_zero_left 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1389 
left_distrib < {hypreal,hypnat,hcomplex}_add_mult_distrib 
17423  1390 
right_distrib < hypnat_add_mult_distrib2 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1391 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  1392 
right_inverse < hypreal_mult_inverse 
1393 
left_inverse < hypreal_mult_inverse_left, hcomplex_mult_inv_left 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1394 
order_refl < {hypreal,hypnat}_le_refl 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1395 
order_trans < {hypreal,hypnat}_le_trans 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1396 
order_antisym < {hypreal,hypnat}_le_anti_sym 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1397 
order_less_le < {hypreal,hypnat}_less_le 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1398 
linorder_linear < {hypreal,hypnat}_le_linear 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1399 
add_left_mono < {hypreal,hypnat}_add_left_mono 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1400 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  1401 
add_nonneg_nonneg < hypreal_le_add_order 
1402 

1403 
* Hyperreal: Separate theorems having to do with typespecific 

1404 
versions of constants have been merged into theorems that apply to the 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1405 
new polymorphic constants (INCOMPATIBILITY): 