author  haftmann 
Fri, 01 Sep 2006 08:36:51 +0200  
changeset 20453  855f07fabd76 
parent 20375  e91be828ce4e 
child 20485  3078fd2eec7b 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

4 
New in this Isabelle release 
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 

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

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

19 
keywords. INCOMPATIBILITY, use double quotes. 
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 

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

47 
* class_package.ML offers a combination of axclasses and locales to achieve 
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

48 
Haskelllike type classes in Isabelle. See HOL/ex/Classpackage.thy for examples. 
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

49 

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

50 
* Yet another code generator framework allows to generate executable code 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

51 
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

52 

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

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

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

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

56 
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

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

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

59 

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

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

61 

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

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

63 

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

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

65 

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

66 
[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

67 
[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

68 
[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

69 
[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

70 

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

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

72 

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

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

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

75 

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

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

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

78 

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

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

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

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

82 

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

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

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

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

86 

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

87 
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

88 

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

89 
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

90 

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

93 

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

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

97 
correspondence to type class and instance declarations. 

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

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

19711  100 

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

102 
instantiation that matches an instance against the most general 

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

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

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

106 
recursion over such type arguments. Incomplete specification patterns 

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

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

111 

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

114 

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

116 
then guess x and y by clarify 

117 

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

119 
proof tools being involved here. 

120 

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

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

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

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

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

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

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

129 

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

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

18020  133 

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

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

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

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

138 

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

139 
* 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

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

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

142 

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

145 

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

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

149 

18540  150 
* Isar: added command 'unfolding', which is structurally similar to 
151 
'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

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

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

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

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

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

158 
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

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

160 

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

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

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

166 
originally first one. 

19220  167 

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

168 
* 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

169 
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

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

171 

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

174 
(essentially a disjunction of cases with local parameters and 

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

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

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

179 
assumes "EX x. P x" 

180 
obtains x where "P x" 

181 

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

183 
assumes "A & B" 

184 
obtains A and B 

185 

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

187 
assumes "A  B" 

188 
obtains 

189 
A 

190 
 B 

191 

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

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

196 
obtains "~ thesis" 

197 

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

18901  200 

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

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

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

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

206 
case_names). 

18901  207 

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

210 
toplevel lemma. 

211 

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

214 

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

217 
to occur. 

218 

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

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

220 
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

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

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

223 

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

224 
* 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

225 
'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

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

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

228 

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

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

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

233 

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

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

237 

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

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

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

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

241 

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

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

245 

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

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

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

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

253 

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

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

257 
'translations' in common applications. 

19084  258 

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

259 
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

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

261 
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

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

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

266 
 parameter renamings are no longer required to be injective. 

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

268 
locale endom = homom mult mult h. 

269 

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

270 
* 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

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

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

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

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

275 
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

276 
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

277 

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

278 
* 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

279 
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

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

281 
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

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

283 

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

284 
* 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

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

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

287 

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

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

291 
(using objectlogic connectives for this purpose has been long 

292 
obsolete anyway). The subsequent proof patterns illustrate advanced 

293 
techniques of natural induction; general datatypes and inductive sets 

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

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

18239  297 
parameters: 
18233  298 

299 
lemma 

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

301 
assumes a: "A n x" 

302 
shows "P n x" 

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

304 
proof (induct n fixing: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 

18248  305 
case 0 
18233  306 
show ?case sorry 
307 
next 

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

18233  311 
show ?case sorry 
312 
qed 

313 

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

319 
lemma 

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

321 
assumes a: "A (a x)" 

322 
shows "P (a x)" 

323 
using a 

324 
proof (induct n == "a x" fixing: x) 

325 
... 

326 

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

329 

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

332 
encodings: 

333 

334 
lemma 

335 
fixes n :: nat 

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

18267  337 
proof (induct n fixing: thesis) 
338 
case 0 

339 
obtain x where "P 0 x" and "Q 0 x" sorry 

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

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

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

345 
then show thesis by (rule Suc.prems) 

346 
qed 

347 

348 
Here the 'fixing: thesis' specification essentially modifies the scope 

349 
of the formal thesis parameter, in order to the get the whole 

350 
existence statement through the induction as expected. 

18233  351 

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

352 
* 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

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

354 
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

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

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

357 

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

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

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

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

361 

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

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

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

364 

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

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

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

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

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

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

370 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

389 

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

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

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

392 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

420 

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

421 
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

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

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

424 

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

427 
"a : A ==> P2 a" 

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

429 
"b : B ==> Q2 b" 

430 
"b : B ==> Q3 b" 

431 
proof (induct set: A B) 

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

432 

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

435 

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

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

439 
have been suppressed. 

440 

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

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

442 
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

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

444 

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

447 
least one premise. 

448 

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

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

453 

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

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

455 
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

456 
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

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

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

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

460 

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

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

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

463 
for example "A > B" => "Pi A (%_. B)". 
17779  464 

17865  465 

17806  466 
*** HOL *** 
467 

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

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

471 
because the functions are compiled to ML first. 

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

473 
an identifier. 

474 

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

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

478 

19279  479 
* 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

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

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

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

483 
op * ~> HOL.times 
19277  484 
op < ~> Orderings.less 
485 
op <= ~> Orderings.less_eq 

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

486 

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

487 
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

488 

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

491 
may go wrong. 

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

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

493 

19277  494 
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

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

496 

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

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

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

501 
distribution). 

502 
INCOMPATIBILITY: rewrite proofs 

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

503 

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

504 
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

505 
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

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

507 

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

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

512 

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

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

17779  516 

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

19211  519 
* Theorem Cons_eq_map_conv no longer has attribute `simp'. 
520 

19279  521 
* Theorem setsum_mult renamed to setsum_right_distrib. 
522 

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

525 

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

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

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

530 

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

533 

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

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

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

536 

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

537 
* 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

538 

18446  539 
* Library: added theory Coinductive_List of potentially infinite lists 
540 
as greatest fixedpoint. 

18399  541 

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

544 

19855  545 
* New proof method "evaluation" for efficiently solving a goal 
546 
(i.e. a boolean expression) by compiling it to ML. The goal is 

547 
"proved" (via the oracle "Evaluation") if it evaluates to True. 

548 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset

549 
* Linear arithmetic now splits certain operators (e.g. min, max, abs) also 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset

550 
when invoked by the simplifier. This results in the simplifier being more 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset

551 
powerful on arithmetic goals. 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset

552 
INCOMPATIBILTY: rewrite proofs. Set fast_arith_split_limit to 0 to obtain 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset

553 
the old behavior. 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset

554 

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

555 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  556 

20327  557 
* New method: 
558 
reify eqs (t), where eqs are equations for an interpretation 

559 
I :: 'a list => 'b => 'c and t::'c is an optional parameter, 

560 
computes a term s::'b and a list xs::'a list and proves the theorem 

561 
I xs s = t. This is also known as reification or quoting. The resulting theorem is applied to the subgoal to substitute t with I xs s. 

562 
If t is omitted, the subgoal itself is reified. 

563 

564 
* New method: 

565 
reflection corr_thm eqs (t). The parameters eqs and (t) are as explained above. corr_thm is a theorem for 

566 
I vs (f t) = I vs t, where f is supposed to be a computable function (in the sense of code generattion). The method uses reify to compute s and xs as above then applies corr_thm and uses normalization by evaluation to "prove" f s = r and finally gets the theorem t = r, which is again applied to the subgoal. An Example is available in HOL/ex/ReflectionEx.thy. 

567 

20375  568 
* Reflection: Automatic refification now handels binding, an example is available in HOL/ex/ReflectionEx.thy 
20169  569 
*** HOLAlgebra *** 
570 

571 
* Method algebra is now set up via an attribute. For examples see CRing.thy. 

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

572 
INCOMPATIBILITY: the method is now weaker on combinations of algebraic 
0e0ea63fe768
Restructured algebra library, added ideals and quotient rings.
ballarin
parents:
20217
diff
changeset

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

574 

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

575 
* Formalisation of ideals and the quotient construction over rings, contributed 
0e0ea63fe768
Restructured algebra library, added ideals and quotient rings.
ballarin
parents:
20217
diff
changeset

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

577 

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

578 
* Renamed `CRing.thy' to `Ring.thy'. INCOMPATIBILITY. 
20169  579 

19653  580 
*** HOLComplex *** 
581 

582 
* Theory Real: new method ferrack implements quantifier elimination 

583 
for linear arithmetic over the reals. The quantifier elimination 

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

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

586 

587 

17878  588 
*** ML *** 
589 

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

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

591 

20348  592 
Semantically identical functions "equal_list" and "eq_list" have been 
593 
unified to "eq_list". 

594 

595 
* Pure/library: 

596 

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

597 
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

598 
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

599 

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

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

603 
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

604 
sequence. "fold_burrow" has an additional context. 
18540  605 

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

607 
"unflat" from the user. 

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

608 

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

611 

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

612 
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

613 
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

614 

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

617 
given more convenient names and signatures reminiscent of similar 

618 
functions for alists, tables, etc: 

18051  619 

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

621 
val nth_update: int * 'a > 'a list > 'a list 

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

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

624 

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

627 

19653  628 
* Pure/library: general ``divide_and_conquer'' combinator on lists. 
629 

19032  630 
* Pure/General/name_mangler.ML provides a functor for generic name 
18446  631 
mangling (bijective mapping from any expression values to strings). 
632 

19032  633 
* Pure/General/rat.ML implements rational numbers. 
634 

635 
* 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

636 
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

637 
admits slightly more efficient complex applications. 
18446  638 

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

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

643 
* 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

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

645 

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

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

18738  649 
minimizing code duplication. Thm.rule_attribute and 
650 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

654 

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

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

658 

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

660 
explicit proofs of class axioms and super class relations performed 

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

662 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

663 
AxClass.axiomatize_class/classrel/arity supercede 

664 
Sign.add_classes/classrel/arities. 

665 

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

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

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

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

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

670 
attributes, methods, etc. 
18642  671 

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

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

675 
fold_map combinators. 

18051  676 

18020  677 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  678 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  679 
achieve the old behaviour. 
680 

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

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

683 
statements. 

684 

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

685 
* 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

686 
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

687 
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

688 

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

691 
some popular functions from term.ML: 

692 

693 
Term.variant > Name.variant 

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

695 
Term.invent_names > Name.invent_list 

696 

697 
Note that lowlevel renaming rarely occurs in new code  operations 

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

699 

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

700 
* 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

701 
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

702 
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

703 
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

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

705 

18567  706 
* 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

707 
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

708 
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

709 
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

710 
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

711 
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

712 
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

713 
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

714 

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

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

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

718 
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

719 
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

720 

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

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

722 

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

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

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

726 

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

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

728 

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

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

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

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

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

733 

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

734 
* 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

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

736 

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

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

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

739 

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

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

741 
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

742 
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

743 
batch mode. 
18567  744 

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

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

17890  748 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  749 
(solver, looper etc.) may depend on arbitrary proof data. 
750 

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

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

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

754 
former Simplifier.inherit_bounds, which is already included here  

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

17878  757 

758 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

761 
INCOMPATIBILITY. 

762 

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

765 

17878  766 

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

767 

17720  768 
New in Isabelle2005 (October 2005) 
769 
 

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

770 

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

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

772 

15130  773 
* Theory headers: the new header syntax for Isar theories is 
774 

775 
theory <name> 

16234  776 
imports <theory1> ... <theoryN> 
777 
uses <file1> ... <fileM> 

15130  778 
begin 
779 

16234  780 
where the 'uses' part is optional. The previous syntax 
781 

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

783 

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

17371  786 
nonIsar theories now, but these will disappear soon. 
15130  787 

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

788 
* Theory loader: parent theories can now also be referred to via 
16234  789 
relative and absolute paths. 
790 

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

791 
* 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

792 
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

793 
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

794 
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

795 
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

796 
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

797 
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

798 
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

799 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  800 

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

801 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  802 

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

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

805 
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

806 

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

807 
* 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

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

809 

17385  810 
* Communication with Proof General is now 8bit clean, which means that 
811 
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

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

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

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

17385  817 

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

820 
faster. 

821 

15703  822 

823 
*** Document preparation *** 

824 

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

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

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

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

830 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

831 

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

832 
* 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

833 
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

834 
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

835 
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

836 
"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

837 
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

838 
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

839 
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

840 
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

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

842 

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

843 
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

844 
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

845 
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

846 
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

847 
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

848 
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

849 
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

850 
specified above. 
16234  851 

17402  852 
* Several new antiquotations: 
15979  853 

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

855 

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

857 

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

15979  860 

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

16234  862 
theorem applying a "style" to it 
863 

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

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

865 

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

17393  868 
conclusion of a metalogical statement theorem, and 'prem1' .. 'prem19' 
16234  869 
to print the specified premise. TermStyle.add_style provides an ML 
870 
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

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

872 
typechecked ML expressions verbatim. 
16234  873 

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

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

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

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

878 

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

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

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

882 

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

883 
* 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

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

885 

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

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

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

888 

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

889 
* 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

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

891 

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

892 
* 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

893 
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

894 
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

895 

16234  896 

897 
*** Pure *** 

898 

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

900 
automatic typeinference of declared constants; additional support for 

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

902 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

903 
sequential dependencies of definitions within a single 'constdefs' 

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

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

906 

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

908 
indexed syntax provides a notational device for subscripted 

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

910 
expressions. Secondly, in a local context with structure 

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

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

913 
show_structs controls printing of implicit structures. Typical 

914 
applications of these concepts involve record types and locales. 

915 

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

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

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

919 

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

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

922 
parsing/printing, see also isarref manual. 

923 

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

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

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

928 
INCOMPATIBILITY. 

929 

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

930 
* 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

931 
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

932 
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

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

934 

16234  935 
* Improved internal renaming of symbolic identifiers  attach primes 
936 
instead of base 26 numbers. 

937 

938 
* New flag show_question_marks controls printing of leading question 

939 
marks in schematic variable names. 

940 

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

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

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

944 

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

946 
by simp 

947 

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

949 

17548  950 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  951 
annotations as "(00...)". 
952 

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

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

955 
Before that distinction was only partially implemented via type class 

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

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

958 
exotic syntax specifications may require further adaption 

17691  959 
(e.g. Cube/Cube.thy). 
16234  960 

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

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

963 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

964 
specifications. 

965 

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

968 

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

971 
Limit. 

972 

973 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

979 
allow for use in a context of fixed variables. 

980 

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

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

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

984 

17597  985 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  986 

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

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

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

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

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

993 

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

995 
selections of theorems in named facts via index ranges. 

996 

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

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

998 
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

999 
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

1000 

17397  1001 
* 'hide': option '(open)' hides only base names. 
1002 

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

1003 
* 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

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

1005 

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

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

1009 
must be quoted when used as identifiers. 

1010 

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

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

1013 
quoted when used as identifier. 

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

1014 

16234  1015 

1016 
*** Locales *** 

17095  1017 

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

1020 
proof obligations from the expression specification. After the 

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

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

1023 
commands is a follows: 

1024 

17095  1025 
(1) interpretation expr inst 
1026 
(2) interpretation target < expr 

1027 
(3) interpret expr inst 

17385  1028 

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

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

1033 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  1039 

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

1041 
'interpret' instead. 

1042 

17385  1043 
* New context element 'constrains' for adding type constraints to 
1044 
parameters. 

1045 

1046 
* Context expressions: renaming of parameters with syntax 

1047 
redeclaration. 

17095  1048 

1049 
* Locale declaration: 'includes' disallowed. 

1050 

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

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

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

1055 
to attribute arguments as expected. 

1056 

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

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

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

1060 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

1066 
values to argument tokens explicitly. 

1067 

1068 
* Changed parameter management in theorem generation for long goal 

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

1070 
theorem statement in rare situations. 

1071 

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

1074 

16234  1075 

1076 
*** Provers *** 

1077 

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

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

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

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

1082 
still available as 'simplesubst'. 

1083 

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

1085 
and quasi orders. 

1086 

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

1088 
reflexivetransitive closure of relations. 

1089 

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

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

1092 

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

1094 
is peformed already. Objectlogics merely need to finish their 

1095 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  1096 

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

1097 

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

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

1099 

16234  1100 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  1101 

1102 
syntax (epsilon) 

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

1104 

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

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

1108 
becomes available as variable, constant etc. INCOMPATIBILITY, 

1109 

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

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

17371  1112 
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

1113 
support corresponding Isar calculations. 
16234  1114 

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

1116 
instead of ":". 

1117 

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

1119 

1120 
Old New 

1121 
{..n(} {..<n} 

1122 
{)n..} {n<..} 

1123 
{m..n(} {m..<n} 

1124 
{)m..n} {m<..n} 

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

1126 

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

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

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

15046  1130 

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

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

1133 

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

1136 
interface. 

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

1137 

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

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

1143 
Some new syntax forms are available: 

1144 

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

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

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

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

1149 

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

1151 
function "Summation", which has been discontinued. 

1152 

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

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

1155 
(insert F x)'. 

1156 

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

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

1159 
typedefs, inductive datatypes and recursion. 

1160 

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

1163 
HOL/ex/SAT_Examples.thy for examples. 

17619  1164 

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

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

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

1169 
in unstructured proof scripts. 

1170 

1171 
* Reworked implementation of records. Improved scalability for 

1172 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

1179 
<record_name>_ext_type. 

1180 

1181 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

1184 
quite long. 

1185 

1186 
New simproc record_upd_simproc for simplification of multiple record 

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

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

1189 
occasionally, since simplification is more powerful by default. 

1190 

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

1191 
* 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

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

1193 

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

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

1197 
old proofs break occasionally as simplification may now solve more 

1198 
goals than previously. 

1199 

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

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

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

1203 
just like y <= x. 

1204 

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

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

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

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

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

1210 
enabled/disabled by the reference use_let_simproc. Potential 

1211 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  1212 

16563  1213 
* Classical reasoning: the meson method now accepts theorems as arguments. 
1214 

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

1217 

16891  1218 
* Theory OrderedGroup and Ring_and_Field: various additions and 
1219 
improvements to faciliate calculations involving equalities and 

1220 
inequalities. 

1221 

1222 
The following theorems have been eliminated or modified 

1223 
(INCOMPATIBILITY): 

16888  1224 

1225 
abs_eq now named abs_of_nonneg 

17371  1226 
abs_of_ge_0 now named abs_of_nonneg 
1227 
abs_minus_eq now named abs_of_nonpos 

16888  1228 
imp_abs_id now named abs_of_nonneg 
1229 
imp_abs_neg_id now named abs_of_nonpos 

1230 
mult_pos now named mult_pos_pos 

1231 
mult_pos_le now named mult_nonneg_nonneg 

1232 
mult_pos_neg_le now named mult_nonneg_nonpos 

1233 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

1234 
mult_neg now named mult_neg_neg 

1235 
mult_neg_le now named mult_nonpos_nonpos 

1236 

16891  1237 
* Theory Parity: added rules for simplifying exponents. 
1238 

17092  1239 
* Theory List: 
1240 

1241 
The following theorems have been eliminated or modified 

1242 
(INCOMPATIBILITY): 

1243 

1244 
list_all_Nil now named list_all.simps(1) 

1245 
list_all_Cons now named list_all.simps(2) 

1246 
list_all_conv now named list_all_iff 

1247 
set_mem_eq now named mem_iff 

1248 

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

1251 

16888  1252 

1253 
*** HOLComplex *** 

1254 

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

1257 

1258 
The following theorems have been eliminated or modified 

1259 
(INCOMPATIBILITY): 

1260 

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

1261 
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

1262 
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

1263 
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

1264 
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

1265 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  1266 

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

16888  1268 

16962  1269 
* Theory Ln is new, with properties of the natural logarithm 
1270 

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

1273 

1274 
hypreal = real star 

1275 
hypnat = nat star 

1276 
hcomplex = complex star 

1277 

1278 
* Hyperreal: Many groups of similarlydefined constants have been 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1279 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  1280 

1281 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

1282 

1283 
starset < starsetNat, starsetC 

1284 
*s* < *sNat*, *sc* 

1285 
starset_n < starsetNat_n, starsetC_n 

1286 
*sn* < *sNatn*, *scn* 

1287 
InternalSets < InternalNatSets, InternalCSets 

1288 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1289 
starfun < starfun{Nat,Nat2,C,RC,CR} 
17423  1290 
*f* < *fNat*, *fNat2*, *fc*, *fRc*, *fcR* 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1291 
starfun_n < starfun{Nat,Nat2,C,RC,CR}_n 
17423  1292 
*fn* < *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn* 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1293 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  1294 

1295 
* 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

1296 
theorems specific to various axiomatic type classes (INCOMPATIBILITY): 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1297 

c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1298 
add_commute < {hypreal,hypnat,hcomplex}_add_commute 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1299 
add_assoc < {hypreal,hypnat,hcomplex}_add_assocs 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1300 
OrderedGroup.add_0 < {hypreal,hypnat,hcomplex}_add_zero_left 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1301 
OrderedGroup.add_0_right < {hypreal,hcomplex}_add_zero_right 
17423  1302 
right_minus < hypreal_add_minus 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1303 
left_minus < {hypreal,hcomplex}_add_minus_left 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1304 
mult_commute < {hypreal,hypnat,hcomplex}_mult_commute 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1305 
mult_assoc < {hypreal,hypnat,hcomplex}_mult_assoc 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1306 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  1307 
mult_1_right < hcomplex_mult_one_right 
1308 
mult_zero_left < hcomplex_mult_zero_left 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1309 
left_distrib < {hypreal,hypnat,hcomplex}_add_mult_distrib 
17423  1310 
right_distrib < hypnat_add_mult_distrib2 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1311 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  1312 
right_inverse < hypreal_mult_inverse 
1313 
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

1314 
order_refl < {hypreal,hypnat}_le_refl 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1315 
order_trans < {hypreal,hypnat}_le_trans 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1316 
order_antisym < {hypreal,hypnat}_le_anti_sym 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1317 
order_less_le < {hypreal,hypnat}_less_le 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1318 
linorder_linear < {hypreal,hypnat}_le_linear 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1319 
add_left_mono < {hypreal,hypnat}_add_left_mono 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1320 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  1321 
add_nonneg_nonneg < hypreal_le_add_order 
1322 

1323 
* Hyperreal: Separate theorems having to do with typespecific 

1324 
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

1325 
new polymorphic constants (INCOMPATIBILITY): 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1326 

c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1327 
STAR_UNIV_set < {STAR_real,NatStar_real,STARC_complex}_set 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1328 
STAR_empty_set < {STAR,NatStar,STARC}_empty_set 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1329 
STAR_Un < {STAR,NatStar,STARC}_Un 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1330 
STAR_Int < {STAR,NatStar,STARC}_Int 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1331 
STAR_Compl < {STAR,NatStar,STARC}_Compl 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1332 
STAR_subset < {STAR,NatStar,STARC}_subset 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1333 
STAR_mem < {STAR,NatStar,STARC}_mem 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1334 
STAR_mem_Compl < {STAR,STARC}_mem_Compl 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1335 
STAR_diff < {STAR,STARC}_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1336 
STAR_star_of_image_subset < {STAR_hypreal_of_real, NatStar_hypreal_of_real, 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1337 
STARC_hcomplex_of_complex}_image_subset 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1338 
starset_n_Un < starset{Nat,C}_n_Un 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1339 
starset_n_Int < starset{Nat,C}_n_Int 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1340 
starset_n_Compl < starset{Nat,C}_n_Compl 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1341 
starset_n_diff < starset{Nat,C}_n_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1342 
InternalSets_Un < Internal{Nat,C}Sets_Un 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1343 
InternalSets_Int < Internal{Nat,C}Sets_Int 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1344 
InternalSets_Compl < Internal{Nat,C}Sets_Compl 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1345 
InternalSets_diff < Internal{Nat,C}Sets_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1346 
InternalSets_UNIV_diff < Internal{Nat,C}Sets_UNIV_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1347 
InternalSets_starset_n < Internal{Nat,C}Sets_starset{Nat,C}_n 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1348 
starset_starset_n_eq < starset{Nat,C}_starset{Nat,C}_n_eq 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1349 
starset_n_starset < starset{Nat,C}_n_starset{Nat,C} 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1350 
starfun_n_starfun < starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR} 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1351 
starfun < starfun{Nat,Nat2,C,RC,CR} 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1352 
starfun_mult < starfun{Nat,Nat2,C,RC,CR}_mult 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1353 
starfun_add < starfun{Nat,Nat2,C,RC,CR}_add 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1354 
starfun_minus < starfun{Nat,Nat2,C,RC,CR}_minus 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1355 
starfun_diff < starfun{C,RC,CR}_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1356 
starfun_o < starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1357 
starfun_o2 < starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1358 
starfun_const_fun < starfun{Nat,Nat2,C,RC,CR}_const_fun 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1359 
starfun_inverse < starfun{Nat,C,RC,CR}_inverse 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1360 
starfun_eq < starfun{Nat,Nat2,C,RC,CR}_eq 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1361 
starfun_eq_iff < starfun{C,RC,CR}_eq_iff 
17423  1362 
starfun_Id < starfunC_Id 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1363 
starfun_approx < starfun{Nat,CR}_approx 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1364 
starfun_capprox < starfun{C,RC}_capprox 
17423  1365 
starfun_abs < starfunNat_rabs 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1366 
starfun_lambda_cancel < starfun{C,CR,RC}_lambda_cancel 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1367 
starfun_lambda_cancel2 < starfun{C,CR,RC}_lambda_cancel2 
17423  1368 
starfun_mult_HFinite_approx < starfunCR_mult_HFinite_capprox 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1369 
starfun_mult_CFinite_capprox < starfun{C,RC}_mult_CFinite_capprox 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1370 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  1371 
starfun_add_approx < starfunCR_add_approx 
1372 
starfun_inverse_inverse < starfunC_inverse_inverse 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1373 
starfun_divide < starfun{C,CR,RC}_divide 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1374 
starfun_n < starfun{Nat,C}_n 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1375 
starfun_n_mult < starfun{Nat,C}_n_mult 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1376 
starfun_n_add < starfun{Nat,C}_n_add 
17423  1377 
starfun_n_add_minus < starfunNat_n_add_minus 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1378 
starfun_n_const_fun < starfun{Nat,C}_n_const_fun 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1379 
starfun_n_minus < starfun{Nat,C}_n_minus 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1380 
starfun_n_eq < starfun{Nat,C}_n_eq 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1381 

c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1382 
star_n_add < {hypreal,hypnat,hcomplex}_add 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1383 
star_n_minus < {hypreal,hcomplex}_minus 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1384 
star_n_diff < {hypreal,hcomplex}_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1385 
star_n_mult < {hypreal,hcomplex}_mult 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1386 
star_n_inverse < {hypreal,hcomplex}_inverse 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1387 
star_n_le < {hypreal,hypnat}_le 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1388 
star_n_less < {hypreal,hypnat}_less 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1389 
star_n_zero_num < {hypreal,hypnat,hcomplex}_zero_num 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1390 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  1391 
star_n_abs < hypreal_hrabs 
1392 
star_n_divide < hcomplex_divide 

1393 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1394 
star_of_add < {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1395 
star_of_minus < {hypreal_of_real,hcomplex_of_complex}_minus 
17423  1396 
star_of_diff < hypreal_of_real_diff 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1397 
star_of_mult < {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1398 
star_of_one < {hypreal_of_real,hcomplex_of_complex}_one 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1399 
star_of_zero < {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1400 
star_of_le < {hypreal_of_real,hypnat_of_nat}_le_iff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1401 
star_of_less < {hypreal_of_real,hypnat_of_nat}_less_iff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1402 
star_of_eq < {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1403 
star_of_inverse < {hypreal_of_real,hcomplex_of_complex}_inverse 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1404 
star_of_divide < {hypreal_of_real,hcomplex_of_complex}_divide 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1405 
star_of_of_nat < {hypreal_of_real,hcomplex_of_complex}_of_nat 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1406 
star_of_of_int < {hypreal_of_real,hcomplex_of_complex}_of_int 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

1407 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  1408 
star_of_number_less < number_of_less_hypreal_of_real_iff 
1409 
star_of_number_le < number_of_le_hypreal_of_real_iff 

1410 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 