author  haftmann 
Wed, 21 Dec 2005 13:25:20 +0100  
changeset 18450  e57731ba01dd 
parent 18446  6c558efcc754 
child 18480  8ac97f71369d 
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 

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

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

19 
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

20 
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

21 
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

22 
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

23 
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

24 
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

25 

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

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

27 

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

28 

17865  29 
*** Document preparation *** 
30 

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

17865  33 

34 

17779  35 
*** Pure *** 
36 

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

39 

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

41 
then guess x and y by clarify 

42 

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

44 
proof tools being involved here. 

45 

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

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

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

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

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

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

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

54 

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

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

18020  58 

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

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

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

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

63 

18308  64 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
65 

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

67 

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

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

71 
(using objectlogic connectives for this purpose has been long 

72 
obsolete anyway). The subsequent proof patterns illustrate advanced 

73 
techniques of natural induction; general datatypes and inductive sets 

18267  74 
work analogously (see also src/HOL/Lambda for realistic examples). 
75 

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

18239  77 
parameters: 
18233  78 

79 
lemma 

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

81 
assumes a: "A n x" 

82 
shows "P n x" 

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

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

18248  85 
case 0 
18233  86 
show ?case sorry 
87 
next 

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

18233  91 
show ?case sorry 
92 
qed 

93 

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

99 
lemma 

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

101 
assumes a: "A (a x)" 

102 
shows "P (a x)" 

103 
using a 

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

105 
... 

106 

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

109 

110 
(3) This is how to perform existential reasoning ('obtain') by 

111 
induction, while avoiding explicit objectlogic encodings: 

112 

113 
fix n :: nat 

114 
obtain x :: 'a where "P n x" and "Q n x" 

115 
proof (induct n fixing: thesis) 

116 
case 0 

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

18399  118 
then show thesis by (rule 0) 
18267  119 
next 
120 
case (Suc n) 

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

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

123 
then show thesis by (rule Suc.prems) 

124 
qed 

125 

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

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

128 
existence statement through the induction as expected. 

18233  129 

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

132 

17779  133 
* Input syntax now supports dummy variable binding "%_. b", where the 
134 
body does not mention the bound variable. Note that dummy patterns 

135 
implicitly depend on their context of bounds, which makes "{_. _}" 

17780  136 
match any set comprehension as expected. Potential INCOMPATIBILITY  
137 
parse translations need to cope with syntactic constant "_idtdummy" in 

138 
the binding position. 

139 

140 
* Removed obsolete syntactic constant "_K" and its associated parse 

141 
translation. INCOMPATIBILITY  use dummy abstraction instead, for 

17779  142 
example "A > B" => "Pi A (%_. B)". 
143 

17865  144 

17806  145 
*** HOL *** 
146 

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

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

150 

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

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

17779  154 

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

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

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

159 

18446  160 
* Library: added theory Coinductive_List of potentially infinite lists 
161 
as greatest fixedpoint. 

18399  162 

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

163 

17878  164 
*** ML *** 
165 

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

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

167 

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

168 
val burrow: ('a list > 'b list) > 'a list list > 'b list list 
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

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

170 

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

171 
The semantics of "burrow" is: "take a function with *simulatanously* transforms 
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

172 
a list of value, and apply it *simulatanously* to a list of list of values of the 
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

173 
appropriate type". Confer this with "map" which would *not* apply its argument 
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

174 
function simulatanously but in sequence. "burrow_split" allows the transformator 
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

175 
function to yield an additional side result. 
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

176 

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

177 
Both actually avoid the usage of "unflat" since they hide away "unflat" 
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

178 
from the user. 
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

179 

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

182 

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

183 
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

184 
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

185 

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

188 
given more convenient names and signatures reminiscent of similar 

189 
functions for alists, tables, etc: 

18051  190 

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

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

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

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

195 

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

198 

199 
* Pure/General: name_mangler.ML provides a functor for generic name 

200 
mangling (bijective mapping from any expression values to strings). 

201 

202 
* Pure/General: rat.ML implements rational numbers. 

203 

204 
* Pure: several functions of signature "... > theory > theory * ..." 

205 
have been reoriented to "... > theory > ... * theory" in order to 

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

207 
fold_map combinators. 

18051  208 

18020  209 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  210 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  211 
achieve the old behaviour. 
212 

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

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

215 
statements. 

216 

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

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

218 
init/conclude/finish and tactical prove operations (replacing former 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

219 
Tactic.prove). Note that OldGoals.prove_goalw_cterm has long been 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

220 
obsolete, it is illbehaved in a local proof context (e.g. with local 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

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

222 

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

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

17890  226 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  227 
(solver, looper etc.) may depend on arbitrary proof data. 
228 

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

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

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

232 
former Simplifier.inherit_bounds, which is already included here  

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

17878  235 

236 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

239 
INCOMPATIBILITY. 

240 

241 

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

242 

17720  243 
New in Isabelle2005 (October 2005) 
244 
 

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

245 

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

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

247 

15130  248 
* Theory headers: the new header syntax for Isar theories is 
249 

250 
theory <name> 

16234  251 
imports <theory1> ... <theoryN> 
252 
uses <file1> ... <fileM> 

15130  253 
begin 
254 

16234  255 
where the 'uses' part is optional. The previous syntax 
256 

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

258 

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

17371  261 
nonIsar theories now, but these will disappear soon. 
15130  262 

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

263 
* Theory loader: parent theories can now also be referred to via 
16234  264 
relative and absolute paths. 
265 

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

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

267 
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

268 
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

269 
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

270 
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

271 
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

272 
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

273 
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

274 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  275 

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

276 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  277 

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

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

280 
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

281 

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

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

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

284 

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

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

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

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

17385  292 

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

295 
faster. 

296 

15703  297 

298 
*** Document preparation *** 

299 

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

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

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

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

305 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

306 

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

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

308 
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

309 
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

310 
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

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

312 
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

313 
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

314 
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

315 
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

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

317 

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

318 
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

319 
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

320 
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

321 
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

322 
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

323 
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

324 
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

325 
specified above. 
16234  326 

17402  327 
* Several new antiquotations: 
15979  328 

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

330 

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

332 

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

15979  335 

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

16234  337 
theorem applying a "style" to it 
338 

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

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

340 

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

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

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

347 
typechecked ML expressions verbatim. 
16234  348 

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

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

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

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

353 

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

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

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

357 

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

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

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

360 

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

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

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

363 

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

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

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

366 

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

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

368 
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

369 
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

370 

16234  371 

372 
*** Pure *** 

373 

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

375 
automatic typeinference of declared constants; additional support for 

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

377 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

378 
sequential dependencies of definitions within a single 'constdefs' 

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

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

381 

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

383 
indexed syntax provides a notational device for subscripted 

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

385 
expressions. Secondly, in a local context with structure 

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

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

388 
show_structs controls printing of implicit structures. Typical 

389 
applications of these concepts involve record types and locales. 

390 

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

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

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

394 

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

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

397 
parsing/printing, see also isarref manual. 

398 

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

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

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

403 
INCOMPATIBILITY. 

404 

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

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

406 
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

407 
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

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

409 

16234  410 
* Improved internal renaming of symbolic identifiers  attach primes 
411 
instead of base 26 numbers. 

412 

413 
* New flag show_question_marks controls printing of leading question 

414 
marks in schematic variable names. 

415 

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

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

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

419 

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

421 
by simp 

422 

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

424 

17548  425 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  426 
annotations as "(00...)". 
427 

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

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

430 
Before that distinction was only partially implemented via type class 

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

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

433 
exotic syntax specifications may require further adaption 

17691  434 
(e.g. Cube/Cube.thy). 
16234  435 

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

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

438 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

439 
specifications. 

440 

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

443 

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

446 
Limit. 

447 

448 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

454 
allow for use in a context of fixed variables. 

455 

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

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

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

459 

17597  460 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  461 

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

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

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

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

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

468 

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

470 
selections of theorems in named facts via index ranges. 

471 

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

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

473 
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

474 
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

475 

17397  476 
* 'hide': option '(open)' hides only base names. 
477 

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

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

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

480 

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

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

484 
must be quoted when used as identifiers. 

485 

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

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

488 
quoted when used as identifier. 

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

489 

16234  490 

491 
*** Locales *** 

17095  492 

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

495 
proof obligations from the expression specification. After the 

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

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

498 
commands is a follows: 

499 

17095  500 
(1) interpretation expr inst 
501 
(2) interpretation target < expr 

502 
(3) interpret expr inst 

17385  503 

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

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

508 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  514 

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

516 
'interpret' instead. 

517 

17385  518 
* New context element 'constrains' for adding type constraints to 
519 
parameters. 

520 

521 
* Context expressions: renaming of parameters with syntax 

522 
redeclaration. 

17095  523 

524 
* Locale declaration: 'includes' disallowed. 

525 

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

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

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

530 
to attribute arguments as expected. 

531 

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

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

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

535 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

541 
values to argument tokens explicitly. 

542 

543 
* Changed parameter management in theorem generation for long goal 

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

545 
theorem statement in rare situations. 

546 

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

549 

16234  550 

551 
*** Provers *** 

552 

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

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

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

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

557 
still available as 'simplesubst'. 

558 

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

560 
and quasi orders. 

561 

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

563 
reflexivetransitive closure of relations. 

564 

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

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

567 

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

569 
is peformed already. Objectlogics merely need to finish their 

570 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  571 

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

572 

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

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

574 

16234  575 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  576 

577 
syntax (epsilon) 

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

579 

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

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

583 
becomes available as variable, constant etc. INCOMPATIBILITY, 

584 

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

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

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

588 
support corresponding Isar calculations. 
16234  589 

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

591 
instead of ":". 

592 

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

594 

595 
Old New 

596 
{..n(} {..<n} 

597 
{)n..} {n<..} 

598 
{m..n(} {m..<n} 

599 
{)m..n} {m<..n} 

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

601 

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

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

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

15046  605 

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

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

608 

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

611 
interface. 

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

612 

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

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

618 
Some new syntax forms are available: 

619 

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

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

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

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

624 

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

626 
function "Summation", which has been discontinued. 

627 

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

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

630 
(insert F x)'. 

631 

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

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

634 
typedefs, inductive datatypes and recursion. 

635 

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

638 
HOL/ex/SAT_Examples.thy for examples. 

17619  639 

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

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

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

644 
in unstructured proof scripts. 

645 

646 
* Reworked implementation of records. Improved scalability for 

647 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

654 
<record_name>_ext_type. 

655 

656 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

659 
quite long. 

660 

661 
New simproc record_upd_simproc for simplification of multiple record 

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

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

664 
occasionally, since simplification is more powerful by default. 

665 

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

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

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

668 

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

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

672 
old proofs break occasionally as simplification may now solve more 

673 
goals than previously. 

674 

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

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

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

678 
just like y <= x. 

679 

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

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

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

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

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

685 
enabled/disabled by the reference use_let_simproc. Potential 

686 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  687 

16563  688 
* Classical reasoning: the meson method now accepts theorems as arguments. 
689 

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

692 

16891  693 
* Theory OrderedGroup and Ring_and_Field: various additions and 
694 
improvements to faciliate calculations involving equalities and 

695 
inequalities. 

696 

697 
The following theorems have been eliminated or modified 

698 
(INCOMPATIBILITY): 

16888  699 

700 
abs_eq now named abs_of_nonneg 

17371  701 
abs_of_ge_0 now named abs_of_nonneg 
702 
abs_minus_eq now named abs_of_nonpos 

16888  703 
imp_abs_id now named abs_of_nonneg 
704 
imp_abs_neg_id now named abs_of_nonpos 

705 
mult_pos now named mult_pos_pos 

706 
mult_pos_le now named mult_nonneg_nonneg 

707 
mult_pos_neg_le now named mult_nonneg_nonpos 

708 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

709 
mult_neg now named mult_neg_neg 

710 
mult_neg_le now named mult_nonpos_nonpos 

711 

16891  712 
* Theory Parity: added rules for simplifying exponents. 
713 

17092  714 
* Theory List: 
715 

716 
The following theorems have been eliminated or modified 

717 
(INCOMPATIBILITY): 

718 

719 
list_all_Nil now named list_all.simps(1) 

720 
list_all_Cons now named list_all.simps(2) 

721 
list_all_conv now named list_all_iff 

722 
set_mem_eq now named mem_iff 

723 

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

726 

16888  727 

728 
*** HOLComplex *** 

729 

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

732 

733 
The following theorems have been eliminated or modified 

734 
(INCOMPATIBILITY): 

735 

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

736 
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

737 
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

738 
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

739 
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

740 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  741 

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

16888  743 

16962  744 
* Theory Ln is new, with properties of the natural logarithm 
745 

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

748 

749 
hypreal = real star 

750 
hypnat = nat star 

751 
hcomplex = complex star 

752 

753 
* Hyperreal: Many groups of similarlydefined constants have been 

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

754 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  755 

756 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

757 

758 
starset < starsetNat, starsetC 

759 
*s* < *sNat*, *sc* 

760 
starset_n < starsetNat_n, starsetC_n 

761 
*sn* < *sNatn*, *scn* 

762 
InternalSets < InternalNatSets, InternalCSets 

763 

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

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

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

768 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  769 

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

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

772 

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

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

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

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

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

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

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

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

781 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  782 
mult_1_right < hcomplex_mult_one_right 
783 
mult_zero_left < hcomplex_mult_zero_left 

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

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

786 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  787 
right_inverse < hypreal_mult_inverse 
788 
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

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

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

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

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

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

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

795 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  796 
add_nonneg_nonneg < hypreal_le_add_order 
797 

798 
* Hyperreal: Separate theorems having to do with typespecific 

799 
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

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

801 

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

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

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

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

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

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

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

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

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

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

811 
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

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

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

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

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

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

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

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

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

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

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

822 
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

823 
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

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

825 
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

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

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

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

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

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

831 
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

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

833 
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

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

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

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

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

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

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

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

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

845 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  846 
starfun_add_approx < starfunCR_add_approx 
847 
starfun_inverse_inverse < starfunC_inverse_inverse 

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

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

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

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

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

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

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

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

856 

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

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

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

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

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

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

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

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

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

865 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  866 
star_n_abs < hypreal_hrabs 
867 
star_n_divide < hcomplex_divide 

868 

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

869 
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

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

872 
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

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

874 
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

875 
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

876 
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

877 
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

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

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

880 
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

881 
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

882 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  883 
star_of_number_less < number_of_less_hypreal_of_real_iff 
884 
star_of_number_le < number_of_le_hypreal_of_real_iff 

885 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

886 
star_of_less_number < hypreal_of_real_less_number_of_iff 

887 
star_of_le_number < hypreal_of_real_le_number_of_iff 

888 
star_of_power < hypreal_of_real_power 

889 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

890 

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

891 
* Hyperreal: new method "transfer" that implements the transfer 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

892 
principle of nonstandard analysis. With a subgoal that mentions 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

893 
nonstandard types like "'a star", the command "apply transfer" 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

894 
replaces it with an equivalent one that mentions only standard types. 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

895 
To be successful, all free variables must have standard types; non 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

896 
standard variables must have explicit universal quantifiers. 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

897 

17641  898 
* Hyperreal: A theory of Taylor series. 
899 

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

900 

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

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

902 

17533  903 
* Discontinued special version of 'constdefs' (which used to support 
904 
continuous functions) in favor of the general Pure one with full 

905 
typeinference. 

906 

907 
* New simplification procedure for solving continuity conditions; it 

908 
is much faster on terms with many nested lambda abstractions (cubic 

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

909 
instead of exponential time). 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

910 

17533  911 
* New syntax for domain package: selector names are now optional. 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

912 
Parentheses should be omitted unless argument is lazy, for example: 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

913 

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

914 
domain 'a stream = cons "'a" (lazy "'a stream") 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

915 

17533  916 
* New command 'fixrec' for defining recursive functions with pattern 
917 
matching; defining multiple functions with mutual recursion is also 

918 
supported. Patterns may include the constants cpair, spair, up, sinl, 

919 
sinr, or any data constructor defined by the domain package. The given 

920 
equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for 

921 
syntax and examples. 

922 

923 
* New commands 'cpodef' and 'pcpodef' for defining predicate subtypes 

924 
of cpo and pcpo types. Syntax is exactly like the 'typedef' command, 

925 
but the proof obligation additionally includes an admissibility 

926 
requirement. The packages generate instances of class cpo or pcpo, 

927 
with continuity and strictness theorems for Rep and Abs. 

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

928 

17584  929 
* HOLCF: Many theorems have been renamed according to a more standard naming 
930 
scheme (INCOMPATIBILITY): 

931 

932 
foo_inject: "foo$x = foo$y ==> x = y" 

933 
foo_eq: "(foo$x = foo$y) = (x = y)" 

934 
foo_less: "(foo$x << foo$y) = (x << y)" 

935 
foo_strict: "foo$UU = UU" 

936 
foo_defined: "... ==> foo$x ~= UU" 

937 
foo_defined_iff: "(foo$x = UU) = (x = UU)" 

938 

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

939 

14885  940 
*** ZF *** 
941 

16234  942 
* ZF/ex: theories Group and Ring provide examples in abstract algebra, 
943 
including the First Isomorphism Theorem (on quotienting by the kernel 

944 
of a homomorphism). 

15089
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

945 

430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

946 
* ZF/Simplifier: install second copy of type solver that actually 
16234  947 
makes use of TC rules declared to Isar proof contexts (or locales); 
948 
the old version is still required for ML proof scripts. 

15703  949 

950 

17445  951 
*** Cube *** 
952 

953 
* Converted to Isar theory format; use locales instead of axiomatic 

954 
theories. 

955 

956 

15703  957 
*** ML *** 
958 

15973  959 
* Pure/library.ML no longer defines its own option datatype, but uses 
16234  960 
that of the SML basis, which has constructors NONE and SOME instead of 
961 
None and Some, as well as exception Option.Option instead of OPTION. 

962 
The functions the, if_none, is_some, is_none have been adapted 

963 
accordingly, while Option.map replaces apsome. 

15973  964 

16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

965 
* Pure/library.ML: the exception LIST has been given up in favour of 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

966 
the standard exceptions Empty and Subscript, as well as 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

967 
Library.UnequalLengths. Function like Library.hd and Library.tl are 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

968 
superceded by the standard hd and tl functions etc. 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

969 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

970 
A number of basic list functions are no longer exported to the ML 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

971 
toplevel, as they are variants of predefined functions. The following 
16234  972 
suggests how one can translate existing code: 
15973  973 

974 
rev_append xs ys = List.revAppend (xs, ys) 

975 
nth_elem (i, xs) = List.nth (xs, i) 

976 
last_elem xs = List.last xs 

977 
flat xss = List.concat xss 

16234  978 
seq fs = List.app fs 
15973  979 
partition P xs = List.partition P xs 
980 
mapfilter f xs = List.mapPartial f xs 

981 

16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

982 
* Pure/library.ML: several combinators for linear functional 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

983 
transformations, notably reverse application and composition: 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

984 

17371  985 
x > f f #> g 
986 
(x, y) > f f #> g 

16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

987 

17495  988 
* Pure/library.ML: introduced/changed precedence of infix operators: 
989 

990 
infix 1 > > > >> >> >>> #> #>; 

991 
infix 2 ?; 

992 
infix 3 o oo ooo oooo; 

993 
infix 4 ~~ upto downto; 

994 

995 
Maybe INCOMPATIBILITY when any of those is used in conjunction with other 

996 
infix operators. 

997 

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

998 
* Pure/library.ML: natural list combinators fold, fold_rev, and 
16869  999 
fold_map support linear functional transformations and nesting. For 
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1000 
example: 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1001 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1002 
fold f [x1, ..., xN] y = 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1003 
y > f x1 > ... > f xN 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1004 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1005 
(fold o fold) f [xs1, ..., xsN] y = 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1006 
y > fold f xs1 > ... > fold f xsN 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1007 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1008 
fold f [x1, ..., xN] = 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1009 
f x1 #> ... #> f xN 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1010 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1011 
(fold o fold) f [xs1, ..., xsN] = 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1012 
fold f xs1 #> ... #> fold f xsN 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

1013 

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

1014 
* Pure/library.ML: the following selectors on type 'a option are 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

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

1016 

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

1017 
the: 'a option > 'a (*partial*) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1018 
these: 'a option > 'a where 'a = 'b list 
17402  1019 
the_default: 'a > 'a option > 'a 
1020 
the_list: 'a option > 'a list 

1021 

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

1022 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1023 
basic operations for association lists, following natural argument 
17564  1024 
order; moreover the explicit equality predicate passed here avoids 
17495  1025 
potentially expensive polymorphic runtime equality checks. 
1026 
The old functions may be expressed as follows: 

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

1027 

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

1028 
assoc = uncurry (AList.lookup (op =)) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1029 
assocs = these oo AList.lookup (op =) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1030 
overwrite = uncurry (AList.update (op =)) o swap 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1031 

17564  1032 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
1033 

1034 
val make: ('a > 'b) > 'a list > ('a * 'b) list 

1035 
val find: ('a * 'b > bool) > ('c * 'b) list > 'a > 'c list 

1036 

1037 
replacing make_keylist and keyfilter (occassionally used) 

1038 
Naive rewrites: 

1039 

1040 
make_keylist = AList.make 

1041 
keyfilter = AList.find (op =) 

1042 

1043 
* eq_fst and eq_snd now take explicit equality parameter, thus 

1044 
avoiding eqtypes. Naive rewrites: 

1045 

1046 
eq_fst = eq_fst (op =) 

1047 
eq_snd = eq_snd (op =) 

1048 

1049 
* Removed deprecated apl and apr (rarely used). 

1050 
Naive rewrites: 

1051 

1052 
apl (n, op) =>>= curry op n 

1053 
apr (op, m) =>>= fn n => op (n, m) 

1054 

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

1055 
* Pure/General: structure OrdList (cf. Pure/General/ord_list.ML) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1056 
provides a reasonably efficient lightweight implementation of sets as 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

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

1058 

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

1059 
* Pure/General: generic tables (cf. Pure/General/table.ML) provide a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1060 
few new operations; existing lookup and update are now curried to 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1061 
follow natural argument order (for use with fold etc.); 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1062 
INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1063 

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

1064 
* Pure/General: output via the Isabelle channels of 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1065 
writeln/warning/error etc. is now passed through Output.output, with a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1066 
hook for arbitrary transformations depending on the print_mode 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1067 
(cf. Output.add_mode  the first active mode that provides a output 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1068 
function wins). Already formatted output may be embedded into further 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1069 
text via Output.raw; the result of Pretty.string_of/str_of and derived 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1070 
functions (string_of_term/cterm/thm etc.) is already marked raw to 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1071 
accommodate easy composition of diagnostic messages etc. Programmers 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1072 
rarely need to care about Output.output or Output.raw at all, with 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1073 
some notable exceptions: Output.output is required when bypassing the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1074 
standard channels (writeln etc.), or in token translations to produce 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1075 
properly formatted results; Output.raw is required when capturing 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1076 
already output material that will eventually be presented to the user 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1077 
a second time. For the default print mode, both Output.output and 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1078 
Output.raw have no effect. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1079 

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

1080 
* Pure/General: Output.time_accumulator NAME creates an operator ('a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1081 
> 'b) > 'a > 'b to measure runtime and count invocations; the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1082 
cumulative results are displayed at the end of a batch session. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1083 

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

1084 
* Pure/General: File.sysify_path and File.quote_sysify path have been 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1085 
replaced by File.platform_path and File.shell_path (with appropriate 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1086 
hooks). This provides a clean interface for unusual systems where the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1087 
internal and external process view of file names are different. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1088 

16689
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1089 
* Pure: more efficient orders for basic syntactic entities: added 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1090 
fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1091 
and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1092 
NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1093 
orders now  potential INCOMPATIBILITY for code that depends on a 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1094 
particular order for Symtab.keys, Symtab.dest, etc. (consider using 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1095 
Library.sort_strings on result). 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1096 

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

1097 
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1098 
fold_types traverse types/terms from left to right, observing natural 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1099 
argument order. Supercedes previous foldl_XXX versions, add_frees, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1100 
add_vars etc. have been adapted as well: INCOMPATIBILITY. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1101 

16151  1102 
* Pure: name spaces have been refined, with significant changes of the 
16234  1103 
internal interfaces  INCOMPATIBILITY. Renamed cond_extern(_table) 
1104 
to extern(_table). The plain name entry path is superceded by a 

1105 
general 'naming' context, which also includes the 'policy' to produce 

1106 
a fully qualified name and external accesses of a fully qualified 

1107 
name; NameSpace.extend is superceded by context dependent 

1108 
Sign.declare_name. Several theory and proof context operations modify 

1109 
the naming context. Especially note Theory.restore_naming and 

1110 
ProofContext.restore_naming to get back to a sane state; note that 

1111 
Theory.add_path is no longer sufficient to recover from 

1112 
Theory.absolute_path in particular. 

1113 

1114 
* Pure: new flags short_names (default false) and unique_names 

1115 
(default true) for controlling output of qualified names. If 

1116 
short_names is set, names are printed unqualified. If unique_names is 

1117 
reset, the name prefix is reduced to the minimum required to achieve 

1118 
the original result when interning again, even if there is an overlap 

1119 
with earlier declarations. 

16151  1120 

16456
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1121 
* Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1122 
now 'extend', and 'merge' gets an additional Pretty.pp argument 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1123 
(useful for printing error messages). INCOMPATIBILITY. 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1124 

451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1125 
* Pure: major reorganization of the theory context. Type Sign.sg and 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1126 
Theory.theory are now identified, referring to the universal 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1127 
Context.theory (see Pure/context.ML). Actual signature and theory 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1128 
content is managed as theory data. The old code and interfaces were 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1129 
spread over many files and structures; the new arrangement introduces 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1130 
considerable INCOMPATIBILITY to gain more clarity: 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1131 

451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1132 
Context  theory management operations (name, identity, inclusion, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1133 
parents, ancestors, merge, etc.), plus generic theory data; 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1134 

451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1135 
Sign  logical signature and syntax operations (declaring consts, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1136 
types, etc.), plus certify/read for common entities; 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1137 

451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1138 
Theory  logical theory operations (stating axioms, definitions, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1139 
oracles), plus a copy of logical signature operations (consts, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1140 
types, etc.); also a few basic management operations (Theory.copy, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1141 
Theory.merge, etc.) 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1142 

451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1143 
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1144 
etc.) as well as the sign field in Thm.rep_thm etc. have been retained 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1145 
for convenience  they merely return the theory. 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1146 

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

1147 
* Pure: type Type.tsig is superceded by theory in most interfaces. 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

1148 

16547
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

1149 
* Pure: the Isar proof context type is already defined early in Pure 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

1150 
as Context.proof (note that ProofContext.context and Proof.context are 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

1151 
aliases, where the latter is the preferred name). This enables other 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

1152 
Isabelle components to refer to that type even before Isar is present. 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

1153 

16373
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1154 
* Pure/sign/theory: discontinued named name spaces (i.e. classK, 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1155 
typeK, constK, axiomK, oracleK), but provide explicit operations for 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1156 
any of these kinds. For example, Sign.intern typeK is now 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1157 
Sign.intern_type, Theory.hide_space Sign.typeK is now 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1158 
Theory.hide_types. Also note that former 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1159 
Theory.hide_classes/types/consts are now 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1160 
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1161 
internalize their arguments! INCOMPATIBILITY. 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1162 

16506
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

1163 
* Pure: get_thm interface (of PureThy and ProofContext) expects 
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

1164 
datatype thmref (with constructors Name and NameSelection) instead of 
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

1165 
plain string  INCOMPATIBILITY; 
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

1166 

16151  1167 
* Pure: cases produced by proof methods specify options, where NONE 
16234  1168 
means to remove case bindings  INCOMPATIBILITY in 
1169 
(RAW_)METHOD_CASES. 

16151  1170 

16373
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1171 
* Pure: the following operations retrieve axioms or theorems from a 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1172 
theory node or theory hierarchy, respectively: 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1173 

9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1174 
Theory.axioms_of: theory > (string * term) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1175 
Theory.all_axioms_of: theory > (string * term) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1176 
PureThy.thms_of: theory > (string * thm) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1177 
PureThy.all_thms_of: theory > (string * thm) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1178 

16718  1179 
* Pure: print_tac now outputs the goal through the trace channel. 
1180 

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

1181 
* Isar toplevel: improved diagnostics, mostly for Poly/ML only. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1182 
Reference Toplevel.debug (default false) controls detailed printing 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1183 
and tracing of lowlevel exceptions; Toplevel.profiling (default 0) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1184 
controls execution profiling  set to 1 for time and 2 for space 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1185 
(both increase the runtime). 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1186 

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

1187 
* Isar session: The initial use of ROOT.ML is now always timed, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1188 
i.e. the log will show the actual process times, in contrast to the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1189 
elapsed wallclock time that the outer shell wrapper produces. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1190 

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

1191 
* Simplifier: improved handling of bound variables (nameless 
16997
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

1192 
representation, avoid allocating new strings). Simprocs that invoke 
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

1193 
the Simplifier recursively should use Simplifier.inherit_bounds to 
17720  1194 
avoid local name clashes. Failure to do so produces warnings 
1195 
"Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds 

1196 
for further details. 

16234  1197 

17166  1198 
* ML functions legacy_bindings and use_legacy_bindings produce ML fact 
1199 
bindings for all theorems stored within a given theory; this may help 

1200 
in porting nonIsar theories to Isar ones, while keeping ML proof 

1201 
scripts for the time being. 

1202 

17457  1203 
* ML operator HTML.with_charset specifies the charset begin used for 
1204 
generated HTML files. For example: 

1205 

1206 
HTML.with_charset "utf8" use_thy "Hebrew"; 

17538  1207 
HTML.with_charset "utf8" use_thy "Chinese"; 
17457  1208 

16234  1209 

1210 
*** System *** 

1211 

1212 
* Allow symlinks to all proper Isabelle executables (Isabelle, 

1213 
isabelle, isatool etc.). 

1214 

1215 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

1216 
isatool doc, isatool mkdir, display_drafts etc.). 

1217 

1218 
* isatool usedir: option f allows specification of the ML file to be 

1219 
used by Isabelle; default is ROOT.ML. 

1220 

16251
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

1221 
* New isatool version outputs the version identifier of the Isabelle 
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

1222 
distribution being used. 
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

1223 

121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

1224 
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format 
16234  1225 
(containing Boolean satisfiability problems) into Isabelle/HOL 
1226 
theories. 

15703  1227 

1228 

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

1229 

14606  1230 
New in Isabelle2004 (April 2004) 
1231 
 

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

1232 

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

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

1234 

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

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

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

1237 

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

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

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

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

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

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

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

1247 
existing theory and ML files. 

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

1248 

14237  1249 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
1250 

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

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

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

14233  1255 

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

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

14333  1260 

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

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

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

1264 

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

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

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

14224  1269 
rather than definitionally, such as the metalogic connectives. 
1270 

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

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

1273 

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

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

1278 

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

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

1280 

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

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

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

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

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

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

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

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

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

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

1290 

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

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

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

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

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

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

1296 

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

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

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

1299 
and derived forms. 
14283  1300 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1322 

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

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

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

1325 

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

1326 

14136  1327 
*** HOL *** 
1328 

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

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

1332 
can be used like any other Isabelle image. See 

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

1334 

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

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

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

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

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

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

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

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

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

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

1344 

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

1348 
* Numerics: 

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

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

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

14389  1356 

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

14255  1359 
* Records: 
1360 
 Record types are now by default printed with their type abbreviation 

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

1362 
the reference "print_record_type_abbr". 

14731  1363 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  1364 
(not enabled by default). 
14427  1365 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
1366 
EX x. x = sel r to True (not enabled by default). 

14255  1367 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  1368 

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

14136  1372 

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

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

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

1376 

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

14731  1380 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  1381 
matrix theory to linear programming. 
14136  1382 

14380  1383 
* Unions and Intersections: 
15119  1384 
The latex output syntax of UN and INT has been changed 
1385 
from "\Union x \in A. B" to "\Union_{x \in A} B" 

1386 
i.e. the index formulae has become a subscript. 

1387 
Similarly for "\Union x. B", and for \Inter instead of \Union. 

14380  1388 

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

14418  1392 
like in normal math, and corresponding versions for < and for intersection. 
1393 

15677  1394 
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard 
1395 
lexicographic dictonary ordering has been added as "lexord". 

1396 

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

14380  1399 

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

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

1403 

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

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

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

1408 
for examples. 

14464  1409 

14606
0be6c11e7128
Pure: 'instance' now h 