author  haftmann 
Fri, 10 Mar 2017 13:47:35 +0100  
changeset 65170  53675f36820d 
parent 65099  30d0b2f1df76 
child 65329  4f3da52cec02 
permissions  rwrr 
57491  1 
Isabelle NEWS  history of userrelevant changes 
2 
================================================= 

2553  3 

62114
a7cf464933f7
generate HTML version of NEWS, with proper symbol rendering;
wenzelm
parents:
62111
diff
changeset

4 
(Note: Isabelle/jEdit shows a treeview of the NEWS file in Sidekick.) 
60006  5 

64603  6 

64439  7 
New in this Isabelle version 
8 
 

9 

64986  10 
*** General *** 
11 

12 
* Document antiquotations @{prf} and @{full_prf} output proof terms 

13 
(again) in the same way as commands 'prf' and 'full_prf'. 

14 

65055  15 
* Computations generated by the code generator can be embedded directly 
16 
into ML, alongside with @{code} antiquotations, using the following 

17 
antiquotations: 

18 

19 
@{computation ... terms: ... datatypes: ...} : 

20 
((term > term) > 'ml option > 'a) > Proof.context > term > 'a 

21 
@{computation_conv ... terms: ... datatypes: ...} : 

22 
(Proof.context > 'ml > conv) > Proof.context > conv 

65045
b69ef432438d
avoid Unicode that conflicts with Isabelle symbol rendering;
wenzelm
parents:
65042
diff
changeset

23 
@{computation_check terms: ... datatypes: ...} : Proof.context > conv 
65041  24 

65055  25 
See src/HOL/ex/Computations.thy, 
26 
src/HOL/Decision_Procs/Commutative_Ring.thy and 

27 
src/HOL/Decision_Procs/Reflective_Field.thy for examples and the 

28 
tutorial on code generation. 

65041  29 

64986  30 

64602  31 
*** Prover IDE  Isabelle/Scala/jEdit *** 
32 

33 
* Commandline invocation "isabelle jedit R l LOGIC" opens the ROOT 

34 
entry of the specified logic session in the editor, while its parent is 

35 
used for formal checking. 

36 

64842  37 
* The PIDE document model maintains file content independently of the 
38 
status of jEdit editor buffers. Reloading jEdit buffers no longer causes 

39 
changes of formal document content. Theory dependencies are always 

40 
resolved internally, without the need for corresponding editor buffers. 

41 
The system option "jedit_auto_load" has been discontinued: it is 

42 
effectively always enabled. 

43 

64867  44 
* The Theories dockable provides a "Purge" button, in order to restrict 
45 
the document model to theories that are required for open editor 

46 
buffers. 

47 

64602  48 

64593
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

49 
*** HOL *** 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

50 

65170
53675f36820d
restored surj as output abbreviation, amending 6af79184bef3
haftmann
parents:
65099
diff
changeset

51 
* Constant "surj" is a full input/output abbreviation (again). 
53675f36820d
restored surj as output abbreviation, amending 6af79184bef3
haftmann
parents:
65099
diff
changeset

52 
Minor INCOMPATIBILITY. 
53675f36820d
restored surj as output abbreviation, amending 6af79184bef3
haftmann
parents:
65099
diff
changeset

53 

65050  54 
* Theory Library/FinFun has been moved to AFP (again). INCOMPATIBILITY. 
55 

64917  56 
* Some old and rarely used ASCII replacement syntax has been removed. 
57 
INCOMPATIBILITY, standard syntax with symbols should be used instead. 

58 
The subsequent commands help to reproduce the old forms, e.g. to 

59 
simplify porting old theories: 

60 

61 
syntax (ASCII) 

62 
"_PiE" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set" ("(3PIE _:_./ _)" 10) 

63 
"_Pi" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set" ("(3PI _:_./ _)" 10) 

64 
"_lam" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a \<Rightarrow> 'b)" ("(3%_:_./ _)" [0,0,3] 3) 

65 

64632  66 
* Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively. 
67 
INCOMPATIBILITY. 

68 

65064
a4abec71279a
Renamed ii to imaginary_unit in order to free up ii as a variable name. Also replaced some legacy def commands
paulson <lp15@cam.ac.uk>
parents:
65057
diff
changeset

69 
* Renamed ii to imaginary_unit in order to free up ii as a variable name. 
a4abec71279a
Renamed ii to imaginary_unit in order to free up ii as a variable name. Also replaced some legacy def commands
paulson <lp15@cam.ac.uk>
parents:
65057
diff
changeset

70 
The syntax \<i> remains available. 
a4abec71279a
Renamed ii to imaginary_unit in order to free up ii as a variable name. Also replaced some legacy def commands
paulson <lp15@cam.ac.uk>
parents:
65057
diff
changeset

71 
INCOMPATIBILITY. 
a4abec71279a
Renamed ii to imaginary_unit in order to free up ii as a variable name. Also replaced some legacy def commands
paulson <lp15@cam.ac.uk>
parents:
65057
diff
changeset

72 

64787  73 
* Dropped abbreviations transP, antisymP, single_valuedP; 
64634  74 
use constants transp, antisymp, single_valuedp instead. 
75 
INCOMPATIBILITY. 

64633
5ebcf6c525f1
prefer existing logical constant over abbreviation
haftmann
parents:
64632
diff
changeset

76 

64785  77 
* Algebraic type class hierarchy of euclidean (semi)rings in HOL: 
78 
euclidean_(semi)ring, euclidean_(semi)ring_cancel, 

79 
unique_euclidean_(semi)ring; instantiation requires 

80 
provision of a euclidean size. 

81 

64786
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

82 
* Reworking of theory Euclidean_Algorithm in session HOLNumber_Theory: 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

83 
 Euclidean induction is available as rule eucl_induct; 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

84 
 Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm, 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

85 
Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

86 
easy instantiation of euclidean (semi)rings as GCD (semi)rings. 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

87 
 Coefficients obtained by extended euclidean algorithm are 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

88 
available as "bezout_coefficients". 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

89 
INCOMPATIBILITY. 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

90 

64787  91 
* Named collection mod_simps covers various congruence rules 
92 
concerning mod, replacing former zmod_simps. 

93 
INCOMPATIBILITY. 

94 

64593
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

95 
* Swapped orientation of congruence rules mod_add_left_eq, 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

96 
mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq, 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

97 
mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq, 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

98 
mod_diff_eq. INCOMPATIBILITY. 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

99 

50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

100 
* Generalized some facts: 
64876  101 
measure_induct_rule 
102 
measure_induct 

64593
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

103 
zminus_zmod ~> mod_minus_eq 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

104 
zdiff_zmod_left ~> mod_diff_left_eq 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

105 
zdiff_zmod_right ~> mod_diff_right_eq 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

106 
zmod_eq_dvd_iff ~> mod_eq_dvd_iff 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

107 
INCOMPATIBILITY. 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

108 

64532
fc2835a932d9
don't generate 'size_gen_o_map' property if its type variable is too limited anyway to be useful
blanchet
parents:
64529
diff
changeset

109 
* (Co)datatype package: 
fc2835a932d9
don't generate 'size_gen_o_map' property if its type variable is too limited anyway to be useful
blanchet
parents:
64529
diff
changeset

110 
 The 'size_gen_o_map' lemma is no longer generated for datatypes 
fc2835a932d9
don't generate 'size_gen_o_map' property if its type variable is too limited anyway to be useful
blanchet
parents:
64529
diff
changeset

111 
with type class annotations. As a result, the tactic that derives 
fc2835a932d9
don't generate 'size_gen_o_map' property if its type variable is too limited anyway to be useful
blanchet
parents:
64529
diff
changeset

112 
it no longer fails on nested datatypes. Slight INCOMPATIBILITY. 
fc2835a932d9
don't generate 'size_gen_o_map' property if its type variable is too limited anyway to be useful
blanchet
parents:
64529
diff
changeset

113 

65099
30d0b2f1df76
KnasterTarski fixed point theorem and Galois Connections.
ballarin
parents:
65073
diff
changeset

114 
* Session HOLAlgebra extended by additional lattice theory: the 
30d0b2f1df76
KnasterTarski fixed point theorem and Galois Connections.
ballarin
parents:
65073
diff
changeset

115 
KnasterTarski fixed point theorem and Galois Connections. 
30d0b2f1df76
KnasterTarski fixed point theorem and Galois Connections.
ballarin
parents:
65073
diff
changeset

116 

64898  117 
* Session HOLAnalysis: more material involving arcs, paths, covering 
118 
spaces, innessential maps, retracts. Major results include the Jordan 

65057
799bbbb3a395
Some new lemmas thanks to Lukas Bulwahn. Also, NEWS.
paulson <lp15@cam.ac.uk>
parents:
65056
diff
changeset

119 
Curve Theorem and the Great Picard Theorem. 
64846  120 

64543
6b13586ef1a2
remove typo in bij_swap_compose_bij theorem name; tune proof
bulwahn
parents:
64532
diff
changeset

121 
* The theorem in Permutations has been renamed: 
6b13586ef1a2
remove typo in bij_swap_compose_bij theorem name; tune proof
bulwahn
parents:
64532
diff
changeset

122 
bij_swap_ompose_bij ~> bij_swap_compose_bij 
64602  123 

65055  124 
* Session HOLLibrary: The simprocs on subsets operators of multisets 
125 
have been renamed: 

65027
2b8583507891
renaming multiset simprocs
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
64986
diff
changeset

126 
msetless_cancel_numerals ~> msetsubset_cancel 
2b8583507891
renaming multiset simprocs
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
64986
diff
changeset

127 
msetle_cancel_numerals ~> msetsubset_eq_cancel 
2b8583507891
renaming multiset simprocs
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
64986
diff
changeset

128 
INCOMPATIBILITY. 
2b8583507891
renaming multiset simprocs
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
64986
diff
changeset

129 

65055  130 
* Session HOLLibrary: The suffix _numerals has been removed from the 
131 
name of the simprocs on multisets. INCOMPATIBILITY. 

65027
2b8583507891
renaming multiset simprocs
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
64986
diff
changeset

132 

60331  133 

64844  134 
*** System *** 
135 

65056  136 
* Option parallel_proofs is 1 by default (instead of more aggressive 2). 
137 
This requires less heap space and avoids burning parallel CPU cycles, 

138 
while full subproof parallelization is enabled for repeated builds 

139 
(according to parallel_subproofs_threshold). 

140 

64844  141 
* Prover IDE support for the Visual Studio Code editor and language 
142 
server protocol, via the "isabelle vscode_server" tool (see also 

143 
src/Tools/VSCode/README.md). The example application within the VS code 

144 
editor is called "Isabelle" and available from its online repository 

145 
(the "Marketplace"). It serves as example for further potential IDE 

146 
frontends. 

147 

64900  148 
* ISABELLE_SCALA_BUILD_OPTIONS has been renamed to 
149 
ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY. 

150 

65073  151 
* Isabelle settings ISABELLE_WINDOWS_PLATFORM, 
152 
ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the 

153 
native Windows platform (independently of the Cygwin installation). This 

154 
is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32, 

155 
ISABELLE_PLATFORM64. 

65072  156 

64900  157 

64844  158 

64072  159 
New in Isabelle20161 (December 2016) 
160 
 

62216  161 

62440  162 
*** General *** 
163 

64390  164 
* Splitter in proof methods "simp", "auto" and friends: 
165 
 The syntax "split add" has been discontinued, use plain "split", 

166 
INCOMPATIBILITY. 

167 
 For situations with many conditional or case expressions, there is 

168 
an alternative splitting strategy that can be much faster. It is 

169 
selected by writing "split!" instead of "split". It applies safe 

170 
introduction and elimination rules after each split rule. As a 

171 
result the subgoal may be split into several subgoals. 

172 

63273  173 
* Command 'bundle' provides a local theory target to define a bundle 
174 
from the body of specification commands (such as 'declare', 

175 
'declaration', 'notation', 'lemmas', 'lemma'). For example: 

176 

177 
bundle foo 

178 
begin 

179 
declare a [simp] 

180 
declare b [intro] 

181 
end 

63272  182 

63282  183 
* Command 'unbundle' is like 'include', but works within a local theory 
184 
context. Unlike "context includes ... begin", the effect of 'unbundle' 

185 
on the target context persists, until different declarations are given. 

186 

63977  187 
* Simplified outer syntax: uniform category "name" includes long 
188 
identifiers. Former "xname" / "nameref" / "name reference" has been 

189 
discontinued. 

190 

191 
* Embedded content (e.g. the inner syntax of types, terms, props) may be 

192 
delimited uniformly via cartouches. This works better than oldfashioned 

193 
quotes when sublanguages are nested. 

194 

195 
* Mixfix annotations support general block properties, with syntax 

196 
"(\<open>x=a y=b z \<dots>\<close>". Notable property names are "indent", "consistent", 

197 
"unbreakable", "markup". The existing notation "(DIGITS" is equivalent 

198 
to "(\<open>indent=DIGITS\<close>". The former notation "(00" for unbreakable blocks 

199 
is superseded by "(\<open>unbreabable\<close>"  rare INCOMPATIBILITY. 

63650  200 

63383  201 
* Proof method "blast" is more robust wrt. corner cases of Pure 
202 
statements without objectlogic judgment. 

203 

63624
994d1a1105ef
more informative 'prf' and 'full_prf', based on HOL/Proofs/ex/XML_Data.thy;
wenzelm
parents:
63610
diff
changeset

204 
* Commands 'prf' and 'full_prf' are somewhat more informative (again): 
63977  205 
proof terms are reconstructed and cleaned from administrative thm nodes. 
206 

207 
* Code generator: config option "code_timing" triggers measurements of 

208 
different phases of code generation. See src/HOL/ex/Code_Timing.thy for 

209 
examples. 

210 

211 
* Code generator: implicits in Scala (stemming from type class 

212 
instances) are generated into companion object of corresponding type 

213 
class, to resolve some situations where ambiguities may occur. 

214 

64390  215 
* Solve direct: option "solve_direct_strict_warnings" gives explicit 
216 
warnings for lemma statements with trivial proofs. 

64013
048b7dbfdfa3
option to report results of solve_direct as explicit warnings
haftmann
parents:
63995
diff
changeset

217 

64602  218 

62904  219 
*** Prover IDE  Isabelle/Scala/jEdit *** 
220 

64527  221 
* More aggressive flushing of machinegenerated input, according to 
222 
system option editor_generated_input_delay (in addition to existing 

223 
editor_input_delay for regular user edits). This may affect overall PIDE 

224 
reactivity and CPU usage. 

225 

64390  226 
* Syntactic indentation according to Isabelle outer syntax. Action 
227 
"indentlines" (shortcut C+i) indents the current line according to 

228 
command keywords and some command substructure. Action 

229 
"isabelle.newline" (shortcut ENTER) indents the old and the new line 

230 
according to command keywords only; see also option 

231 
"jedit_indent_newline". 

232 

233 
* Semantic indentation for unstructured proof scripts ('apply' etc.) via 

234 
number of subgoals. This requires information of ongoing document 

235 
processing and may thus lag behind, when the user is editing too 

236 
quickly; see also option "jedit_script_indent" and 

237 
"jedit_script_indent_limit". 

238 

239 
* Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed' 

240 
are treated as delimiters for fold structure; 'begin' and 'end' 

241 
structure of theory specifications is treated as well. 

242 

243 
* Command 'proof' provides information about proof outline with cases, 

244 
e.g. for proof methods "cases", "induct", "goal_cases". 

245 

246 
* Completion templates for commands involving "begin ... end" blocks, 

247 
e.g. 'context', 'notepad'. 

248 

249 
* Sidekick parser "isabellecontext" shows nesting of context blocks 

250 
according to 'begin' and 'end' structure. 

251 

63977  252 
* Highlighting of entity def/ref positions wrt. cursor. 
253 

254 
* Action "isabelle.selectentity" (shortcut CS+ENTER) selects all 

64514  255 
occurrences of the formal entity at the caret position. This facilitates 
63977  256 
systematic renaming. 
257 

258 
* PIDE document markup works across multiple Isar commands, e.g. the 

259 
results established at the end of a proof are properly identified in the 

260 
theorem statement. 

261 

262 
* Cartouche abbreviations work both for " and ` to accomodate typical 

263 
situations where old ASCII notation may be updated. 

264 

63875  265 
* Dockable window "Symbols" also provides access to 'abbrevs' from the 
266 
outer syntax of the current theory buffer. This provides clickable 

267 
syntax templates, including entries with empty abbrevs name (which are 

268 
inaccessible via keyboard completion). 

269 

63022  270 
* IDE support for the Isabelle/Pure bootstrap process, with the 
271 
following independent stages: 

272 

273 
src/Pure/ROOT0.ML 

274 
src/Pure/ROOT.ML 

275 
src/Pure/Pure.thy 

276 
src/Pure/ML_Bootstrap.thy 

277 

278 
The ML ROOT files act like quasitheories in the context of theory 

279 
ML_Bootstrap: this allows continuous checking of all loaded ML files. 

280 
The theory files are presented with a modified header to import Pure 

281 
from the running Isabelle instance. Results from changed versions of 

282 
each stage are *not* propagated to the next stage, and isolated from the 

283 
actual Isabelle/Pure that runs the IDE itself. The sequential 

63307  284 
dependencies of the above files are only observed for batch build. 
62904  285 

63977  286 
* Isabelle/ML and Standard ML files are presented in Sidekick with the 
287 
tree structure of section headings: this special comment format is 

288 
described in "implementation" chapter 0, e.g. (*** section ***). 

63461  289 

63581  290 
* Additional abbreviations for syntactic completion may be specified 
63871  291 
within the theory header as 'abbrevs'. The theory syntax for 'keywords' 
292 
has been simplified accordingly: optional abbrevs need to go into the 

293 
new 'abbrevs' section. 

294 

295 
* Global abbreviations via $ISABELLE_HOME/etc/abbrevs and 

296 
$ISABELLE_HOME_USER/etc/abbrevs are no longer supported. Minor 

297 
INCOMPATIBILITY, use 'abbrevs' within theory header instead. 

63579  298 

64390  299 
* Action "isabelle.keymapmerge" asks the user to resolve pending 
300 
Isabelle keymap changes that are in conflict with the current jEdit 

301 
keymap; nonconflicting changes are always applied implicitly. This 

302 
action is automatically invoked on Isabelle/jEdit startup and thus 

303 
increases chances that users see new keyboard shortcuts when reusing 

304 
old keymaps. 

305 

63675  306 
* ML and document antiquotations for filesystems paths are more uniform 
307 
and diverse: 

308 

309 
@{path NAME}  no filesystem check 

310 
@{file NAME}  check for plain file 

311 
@{dir NAME}  check for directory 

312 

313 
Minor INCOMPATIBILITY, former uses of @{file} and @{file_unchecked} may 

314 
have to be changed. 

63669  315 

316 

63977  317 
*** Document preparation *** 
318 

319 
* New symbol \<circle>, e.g. for temporal operator. 

320 

64073  321 
* New document and ML antiquotation @{locale} for locales, similar to 
322 
existing antiquotation @{class}. 

323 

63977  324 
* Mixfix annotations support delimiters like \<^control>\<open>cartouche\<close>  
325 
this allows special forms of document output. 

326 

327 
* Raw LaTeX output now works via \<^latex>\<open>...\<close> instead of raw control 

328 
symbol \<^raw:...>. INCOMPATIBILITY, notably for LaTeXsugar.thy and its 

329 
derivatives. 

330 

331 
* \<^raw:...> symbols are no longer supported. 

332 

333 
* Old 'header' command is no longer supported (legacy since 

334 
Isabelle2015). 

335 

336 

62312
5e5a881ebc12
command '\<proof>' is an alias for 'sorry', with different typesetting;
wenzelm
parents:
62284
diff
changeset

337 
*** Isar *** 
5e5a881ebc12
command '\<proof>' is an alias for 'sorry', with different typesetting;
wenzelm
parents:
62284
diff
changeset

338 

63180  339 
* Many specification elements support structured statements with 'if' / 
340 
'for' eigencontext, e.g. 'axiomatization', 'abbreviation', 

341 
'definition', 'inductive', 'function'. 

342 

63094
056ea294c256
toplevel theorem statements support 'if'/'for' eigencontext;
wenzelm
parents:
63078
diff
changeset

343 
* Toplevel theorem statements support eigencontext notation with 'if' / 
63284  344 
'for' (in postfix), which corresponds to 'assumes' / 'fixes' in the 
63094
056ea294c256
toplevel theorem statements support 'if'/'for' eigencontext;
wenzelm
parents:
63078
diff
changeset

345 
traditional long statement form (in prefix). Local premises are called 
056ea294c256
toplevel theorem statements support 'if'/'for' eigencontext;
wenzelm
parents:
63078
diff
changeset

346 
"that" or "assms", respectively. Empty premises are *not* bound in the 
056ea294c256
toplevel theorem statements support 'if'/'for' eigencontext;
wenzelm
parents:
63078
diff
changeset

347 
context: INCOMPATIBILITY. 
056ea294c256
toplevel theorem statements support 'if'/'for' eigencontext;
wenzelm
parents:
63078
diff
changeset

348 

63039  349 
* Command 'define' introduces a local (nonpolymorphic) definition, with 
350 
optional abstraction over local parameters. The syntax resembles 

63043  351 
'definition' and 'obtain'. It fits better into the Isar language than 
352 
old 'def', which is now a legacy feature. 

63039  353 

63059
3f577308551e
'obtain' supports structured statements (similar to 'define');
wenzelm
parents:
63043
diff
changeset

354 
* Command 'obtain' supports structured statements with 'if' / 'for' 
3f577308551e
'obtain' supports structured statements (similar to 'define');
wenzelm
parents:
63043
diff
changeset

355 
context. 
3f577308551e
'obtain' supports structured statements (similar to 'define');
wenzelm
parents:
63043
diff
changeset

356 

62312
5e5a881ebc12
command '\<proof>' is an alias for 'sorry', with different typesetting;
wenzelm
parents:
62284
diff
changeset

357 
* Command '\<proof>' is an alias for 'sorry', with different 
5e5a881ebc12
command '\<proof>' is an alias for 'sorry', with different typesetting;
wenzelm
parents:
62284
diff
changeset

358 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  359 

63977  360 
* The defining position of a literal fact \<open>prop\<close> is maintained more 
361 
carefully, and made accessible as hyperlink in the Prover IDE. 

362 

363 
* Commands 'finally' and 'ultimately' used to expose the result as 

364 
literal fact: this accidental behaviour has been discontinued. Rare 

365 
INCOMPATIBILITY, use more explicit means to refer to facts in Isar. 

366 

367 
* Command 'axiomatization' has become more restrictive to correspond 

368 
better to internal axioms as singleton facts with mandatory name. Minor 

369 
INCOMPATIBILITY. 

62939  370 

63259  371 
* Proof methods may refer to the main facts via the dynamic fact 
372 
"method_facts". This is particularly useful for Eisbach method 

373 
definitions. 

374 

63527  375 
* Proof method "use" allows to modify the main facts of a given method 
376 
expression, e.g. 

63259  377 

378 
(use facts in simp) 

379 
(use facts in \<open>simp add: ...\<close>) 

380 

63977  381 
* The old proof method "default" has been removed (legacy since 
382 
Isabelle2016). INCOMPATIBILITY, use "standard" instead. 

383 

62216  384 

63165
c12845e8e80a
examples and documentation for code generator time measurements
haftmann
parents:
63161
diff
changeset

385 
*** Pure *** 
c12845e8e80a
examples and documentation for code generator time measurements
haftmann
parents:
63161
diff
changeset

386 

63977  387 
* Pure provides basic versions of proof methods "simp" and "simp_all" 
388 
that only know about metaequality (==). Potential INCOMPATIBILITY in 

389 
theory imports that merge Pure with e.g. Main of Isabelle/HOL: the order 

390 
is relevant to avoid confusion of Pure.simp vs. HOL.simp. 

391 

392 
* The command 'unfolding' and proof method "unfold" include a second 

393 
stage where given equations are passed through the attribute "abs_def" 

394 
before rewriting. This ensures that definitions are fully expanded, 

395 
regardless of the actual parameters that are provided. Rare 

396 
INCOMPATIBILITY in some corner cases: use proof method (simp only:) 

397 
instead, or declare [[unfold_abs_def = false]] in the proof context. 

398 

399 
* Typeinference improves sorts of newly introduced type variables for 

400 
the objectlogic, using its base sort (i.e. HOL.type for Isabelle/HOL). 

401 
Thus terms like "f x" or "\<And>x. P x" without any further syntactic context 

402 
produce x::'a::type in HOL instead of x::'a::{} in Pure. Rare 

403 
INCOMPATIBILITY, need to provide explicit type constraints for Pure 

404 
types where this is really intended. 

63350
705229ed856e
compiling implicit instances into companion objects for classes avoids ambiguities
haftmann
parents:
63343
diff
changeset

405 

63165
c12845e8e80a
examples and documentation for code generator time measurements
haftmann
parents:
63161
diff
changeset

406 

62327  407 
*** HOL *** 
408 

63977  409 
* New proof method "argo" using the builtin Argo solver based on SMT 
410 
technology. The method can be used to prove goals of quantifierfree 

411 
propositional logic, goals based on a combination of quantifierfree 

412 
propositional logic with equality, and goals based on a combination of 

413 
quantifierfree propositional logic with linear real arithmetic 

414 
including min/max/abs. See HOL/ex/Argo_Examples.thy for examples. 

415 

64390  416 
* The new "nunchaku" program integrates the Nunchaku model finder. The 
417 
tool is experimental. See ~~/src/HOL/Nunchaku/Nunchaku.thy for details. 

418 

63977  419 
* Metis: The problem encoding has changed very slightly. This might 
63785  420 
break existing proofs. INCOMPATIBILITY. 
421 

63116  422 
* Sledgehammer: 
63967
2aa42596edc3
new material on paths, etc. Also rationalisation
paulson <lp15@cam.ac.uk>
parents:
63963
diff
changeset

423 
 The MaSh relevance filter is now faster than before. 
63116  424 
 Produce syntactically correct Vampire 4.0 problem files. 
425 

62327  426 
* (Co)datatype package: 
62693  427 
 New commands for defining corecursive functions and reasoning about 
428 
them in "~~/src/HOL/Library/BNF_Corec.thy": 'corec', 'corecursive', 

429 
'friend_of_corec', and 'corecursion_upto'; and 'corec_unique' proof 

62842  430 
method. See 'isabelle doc corec'. 
63977  431 
 The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a firstclass 
63855  432 
citizen in bounded natural functors. 
62693  433 
 'primrec' now allows nested calls through the predicator in addition 
62327  434 
to the map function. 
63855  435 
 'bnf' automatically discharges reflexive proof obligations. 
62693  436 
 'bnf' outputs a slightly modified proof obligation expressing rel in 
62332  437 
terms of map and set 
63855  438 
(not giving a specification for rel makes this one reflexive). 
62693  439 
 'bnf' outputs a new proof obligation expressing pred in terms of set 
63855  440 
(not giving a specification for pred makes this one reflexive). 
441 
INCOMPATIBILITY: manual 'bnf' declarations may need adjustment. 

62335  442 
 Renamed lemmas: 
443 
rel_prod_apply ~> rel_prod_inject 

444 
pred_prod_apply ~> pred_prod_inject 

445 
INCOMPATIBILITY. 

62536
656e9653c645
made 'size' plugin compatible with locales again (and added regression test)
blanchet
parents:
62525
diff
changeset

446 
 The "size" plugin has been made compatible again with locales. 
63855  447 
 The theorems about "rel" and "set" may have a slightly different (but 
448 
equivalent) form. 

449 
INCOMPATIBILITY. 

62327  450 

63977  451 
* The 'coinductive' command produces a proper coinduction rule for 
452 
mutual coinductive predicates. This new rule replaces the old rule, 

453 
which exposed details of the internal fixpoint construction and was 

454 
hard to use. INCOMPATIBILITY. 

455 

456 
* New abbreviations for negated existence (but not bounded existence): 

457 

458 
\<nexists>x. P x \<equiv> \<not> (\<exists>x. P x) 

459 
\<nexists>!x. P x \<equiv> \<not> (\<exists>!x. P x) 

460 

461 
* The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@" 

462 
has been removed for output. It is retained for input only, until it is 

463 
eliminated altogether. 

464 

465 
* The unique existence quantifier no longer provides 'binder' syntax, 

466 
but uses syntax translations (as for bounded unique existence). Thus 

467 
iterated quantification \<exists>!x y. P x y with its slightly confusing 

468 
sequential meaning \<exists>!x. \<exists>!y. P x y is no longer possible. Instead, 

469 
pattern abstraction admits simultaneous unique existence \<exists>!(x, y). P x y 

470 
(analogous to existing notation \<exists>!(x, y)\<in>A. P x y). Potential 

471 
INCOMPATIBILITY in rare situations. 

472 

473 
* Conventional syntax "%(). t" for unit abstractions. Slight syntactic 

474 
INCOMPATIBILITY. 

475 

64390  476 
* Renamed constants and corresponding theorems: 
477 

478 
setsum ~> sum 

479 
setprod ~> prod 

480 
listsum ~> sum_list 

481 
listprod ~> prod_list 

482 

483 
INCOMPATIBILITY. 

484 

485 
* Sligthly more standardized theorem names: 

486 
sgn_times ~> sgn_mult 

487 
sgn_mult' ~> Real_Vector_Spaces.sgn_mult 

488 
divide_zero_left ~> div_0 

489 
zero_mod_left ~> mod_0 

490 
divide_zero ~> div_by_0 

491 
divide_1 ~> div_by_1 

492 
nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left 

493 
div_mult_self1_is_id ~> nonzero_mult_div_cancel_left 

494 
nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right 

495 
div_mult_self2_is_id ~> nonzero_mult_div_cancel_right 

496 
is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left 

497 
is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right 

498 
mod_div_equality ~> div_mult_mod_eq 

499 
mod_div_equality2 ~> mult_div_mod_eq 

500 
mod_div_equality3 ~> mod_div_mult_eq 

501 
mod_div_equality4 ~> mod_mult_div_eq 

502 
minus_div_eq_mod ~> minus_div_mult_eq_mod 

503 
minus_div_eq_mod2 ~> minus_mult_div_eq_mod 

504 
minus_mod_eq_div ~> minus_mod_eq_div_mult 

505 
minus_mod_eq_div2 ~> minus_mod_eq_mult_div 

506 
div_mod_equality' ~> minus_mod_eq_div_mult [symmetric] 

507 
mod_div_equality' ~> minus_div_mult_eq_mod [symmetric] 

508 
zmod_zdiv_equality ~> mult_div_mod_eq [symmetric] 

509 
zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric] 

510 
Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

511 
mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

512 
zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

513 
div_1 ~> div_by_Suc_0 

514 
mod_1 ~> mod_by_Suc_0 

515 
INCOMPATIBILITY. 

516 

517 
* New type class "idom_abs_sgn" specifies algebraic properties 

518 
of sign and absolute value functions. Type class "sgn_if" has 

519 
disappeared. Slight INCOMPATIBILITY. 

520 

521 
* Dedicated syntax LENGTH('a) for length of types. 

522 

63977  523 
* Characters (type char) are modelled as finite algebraic type 
524 
corresponding to {0..255}. 

525 

526 
 Logical representation: 

527 
* 0 is instantiated to the ASCII zero character. 

528 
* All other characters are represented as "Char n" 

529 
with n being a raw numeral expression less than 256. 

530 
* Expressions of the form "Char n" with n greater than 255 

531 
are noncanonical. 

532 
 Printing and parsing: 

533 
* Printable characters are printed and parsed as "CHR ''\<dots>''" 

534 
(as before). 

535 
* The ASCII zero character is printed and parsed as "0". 

536 
* All other canonical characters are printed as "CHR 0xXX" 

537 
with XX being the hexadecimal character code. "CHR n" 

538 
is parsable for every numeral expression n. 

539 
* Noncanonical characters have no special syntax and are 

540 
printed as their logical representation. 

541 
 Explicit conversions from and to the natural numbers are 

542 
provided as char_of_nat, nat_of_char (as before). 

543 
 The auxiliary nibble type has been discontinued. 

544 

545 
INCOMPATIBILITY. 

546 

547 
* Type class "div" with operation "mod" renamed to type class "modulo" 

548 
with operation "modulo", analogously to type class "divide". This 

549 
eliminates the need to qualify any of those names in the presence of 

550 
infix "mod" syntax. INCOMPATIBILITY. 

551 

63979  552 
* Statements and proofs of KnasterTarski fixpoint combinators lfp/gfp 
553 
have been clarified. The fixpoint properties are lfp_fixpoint, its 

554 
symmetric lfp_unfold (as before), and the duals for gfp. Auxiliary items 

555 
for the proof (lfp_lemma2 etc.) are no longer exported, but can be 

556 
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY. 

557 

63977  558 
* Constant "surj" is a mere input abbreviation, to avoid hiding an 
559 
equation in term output. Minor INCOMPATIBILITY. 

560 

561 
* Command 'code_reflect' accepts empty constructor lists for datatypes, 

562 
which renders those abstract effectively. 

563 

564 
* Command 'export_code' checks given constants for abstraction 

565 
violations: a small guarantee that given constants specify a safe 

566 
interface for the generated code. 

567 

568 
* Code generation for Scala: ambiguous implicts in class diagrams are 

569 
spelt out explicitly. 

570 

571 
* Static evaluators (Code_Evaluation.static_* in Isabelle/ML) rely on 

572 
explicitly provided auxiliary definitions for required type class 

64390  573 
dictionaries rather than halfworking magic. INCOMPATIBILITY, see the 
574 
tutorial on code generation for details. 

575 

576 
* Theory Set_Interval: substantial new theorems on indexed sums and 

577 
products. 

63977  578 

579 
* Locale bijection establishes convenient default simp rules such as 

580 
"inv f (f a) = a" for total bijections. 

581 

582 
* Abstract locales semigroup, abel_semigroup, semilattice, 

583 
semilattice_neutr, ordering, ordering_top, semilattice_order, 

584 
semilattice_neutr_order, comm_monoid_set, semilattice_set, 

585 
semilattice_neutr_set, semilattice_order_set, 

586 
semilattice_order_neutr_set monoid_list, comm_monoid_list, 

587 
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified 

588 
syntax uniformly that does not clash with corresponding global syntax. 

589 
INCOMPATIBILITY. 

590 

591 
* Former locale lifting_syntax is now a bundle, which is easier to 

592 
include in a local context or theorem statement, e.g. "context includes 

593 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

594 

63807  595 
* Some old / obsolete theorems have been renamed / removed, potential 
596 
INCOMPATIBILITY. 

597 

598 
nat_less_cases  removed, use linorder_cases instead 

599 
inv_image_comp  removed, use image_inv_f_f instead 

600 
image_surj_f_inv_f ~> image_f_inv_f 

63113  601 

63456
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

602 
* Some theorems about groups and orders have been generalised from 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

603 
groups to semigroups that are also monoids: 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

604 
le_add_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

605 
le_add_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

606 
less_add_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

607 
less_add_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

608 
add_le_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

609 
add_le_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

610 
add_less_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

611 
add_less_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

612 

3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

613 
* Some simplifications theorems about rings have been removed, since 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

614 
superseeded by a more general version: 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

615 
less_add_cancel_left_greater_zero ~> less_add_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

616 
less_add_cancel_right_greater_zero ~> less_add_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

617 
less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

618 
less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

619 
less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

620 
less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

621 
less_add_cancel_left_less_zero ~> add_less_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

622 
less_add_cancel_right_less_zero ~> add_less_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

623 
INCOMPATIBILITY. 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

624 

62407  625 
* Renamed split_if > if_split and split_if_asm > if_split_asm to 
626 
resemble the f.split naming convention, INCOMPATIBILITY. 

62396  627 

63977  628 
* Added class topological_monoid. 
629 

64391  630 
* The following theorems have been renamed: 
631 

64457  632 
setsum_left_distrib ~> sum_distrib_right 
633 
setsum_right_distrib ~> sum_distrib_left 

64391  634 

635 
INCOMPATIBILITY. 

636 

637 
* Compound constants INFIMUM and SUPREMUM are mere abbreviations now. 

638 
INCOMPATIBILITY. 

639 

640 
* "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional 

641 
comprehensionlike syntax analogously to "Inf (f ` A)" and "Sup (f ` 

642 
A)". 

643 

644 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 

645 

646 
* The type class ordered_comm_monoid_add is now called 

647 
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add 

648 
is introduced as the combination of ordered_ab_semigroup_add + 

649 
comm_monoid_add. INCOMPATIBILITY. 

650 

651 
* Introduced the type classes canonically_ordered_comm_monoid_add and 

652 
dioid. 

653 

654 
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When 

655 
instantiating linordered_semiring_strict and ordered_ab_group_add, an 

656 
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might 

657 
be required. INCOMPATIBILITY. 

63117  658 

62348  659 
* Dropped various legacy fact bindings, whose replacements are often 
660 
of a more general type also: 

661 
lcm_left_commute_nat ~> lcm.left_commute 

662 
lcm_left_commute_int ~> lcm.left_commute 

663 
gcd_left_commute_nat ~> gcd.left_commute 

664 
gcd_left_commute_int ~> gcd.left_commute 

665 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

666 
gcd_greatest_iff_int ~> gcd_greatest_iff 

667 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

668 
coprime_dvd_mult_int ~> coprime_dvd_mult 

669 
zpower_numeral_even ~> power_numeral_even 

670 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

671 
gcd_mult_cancel_int ~> gcd_mult_cancel 

672 
div_gcd_coprime_nat ~> div_gcd_coprime 

673 
div_gcd_coprime_int ~> div_gcd_coprime 

674 
zpower_numeral_odd ~> power_numeral_odd 

675 
zero_less_int_conv ~> of_nat_0_less_iff 

676 
gcd_greatest_nat ~> gcd_greatest 

677 
gcd_greatest_int ~> gcd_greatest 

678 
coprime_mult_nat ~> coprime_mult 

679 
coprime_mult_int ~> coprime_mult 

680 
lcm_commute_nat ~> lcm.commute 

681 
lcm_commute_int ~> lcm.commute 

682 
int_less_0_conv ~> of_nat_less_0_iff 

683 
gcd_commute_nat ~> gcd.commute 

684 
gcd_commute_int ~> gcd.commute 

685 
Gcd_insert_nat ~> Gcd_insert 

686 
Gcd_insert_int ~> Gcd_insert 

687 
of_int_int_eq ~> of_int_of_nat_eq 

688 
lcm_least_nat ~> lcm_least 

689 
lcm_least_int ~> lcm_least 

690 
lcm_assoc_nat ~> lcm.assoc 

691 
lcm_assoc_int ~> lcm.assoc 

692 
int_le_0_conv ~> of_nat_le_0_iff 

693 
int_eq_0_conv ~> of_nat_eq_0_iff 

694 
Gcd_empty_nat ~> Gcd_empty 

695 
Gcd_empty_int ~> Gcd_empty 

696 
gcd_assoc_nat ~> gcd.assoc 

697 
gcd_assoc_int ~> gcd.assoc 

698 
zero_zle_int ~> of_nat_0_le_iff 

699 
lcm_dvd2_nat ~> dvd_lcm2 

700 
lcm_dvd2_int ~> dvd_lcm2 

701 
lcm_dvd1_nat ~> dvd_lcm1 

702 
lcm_dvd1_int ~> dvd_lcm1 

703 
gcd_zero_nat ~> gcd_eq_0_iff 

704 
gcd_zero_int ~> gcd_eq_0_iff 

705 
gcd_dvd2_nat ~> gcd_dvd2 

706 
gcd_dvd2_int ~> gcd_dvd2 

707 
gcd_dvd1_nat ~> gcd_dvd1 

708 
gcd_dvd1_int ~> gcd_dvd1 

709 
int_numeral ~> of_nat_numeral 

710 
lcm_ac_nat ~> ac_simps 

711 
lcm_ac_int ~> ac_simps 

712 
gcd_ac_nat ~> ac_simps 

713 
gcd_ac_int ~> ac_simps 

714 
abs_int_eq ~> abs_of_nat 

715 
zless_int ~> of_nat_less_iff 

716 
zdiff_int ~> of_nat_diff 

717 
zadd_int ~> of_nat_add 

718 
int_mult ~> of_nat_mult 

719 
int_Suc ~> of_nat_Suc 

720 
inj_int ~> inj_of_nat 

721 
int_1 ~> of_nat_1 

722 
int_0 ~> of_nat_0 

62353
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

723 
Lcm_empty_nat ~> Lcm_empty 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

724 
Lcm_empty_int ~> Lcm_empty 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

725 
Lcm_insert_nat ~> Lcm_insert 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

726 
Lcm_insert_int ~> Lcm_insert 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

727 
comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

728 
comp_fun_idem_gcd_int ~> comp_fun_idem_gcd 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

729 
comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

730 
comp_fun_idem_lcm_int ~> comp_fun_idem_lcm 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

731 
Lcm_eq_0 ~> Lcm_eq_0_I 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

732 
Lcm0_iff ~> Lcm_0_iff 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

733 
Lcm_dvd_int ~> Lcm_least 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

734 
divides_mult_nat ~> divides_mult 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

735 
divides_mult_int ~> divides_mult 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

736 
lcm_0_nat ~> lcm_0_right 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

737 
lcm_0_int ~> lcm_0_right 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

738 
lcm_0_left_nat ~> lcm_0_left 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

739 
lcm_0_left_int ~> lcm_0_left 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

740 
dvd_gcd_D1_nat ~> dvd_gcdD1 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

741 
dvd_gcd_D1_int ~> dvd_gcdD1 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

742 
dvd_gcd_D2_nat ~> dvd_gcdD2 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

743 
dvd_gcd_D2_int ~> dvd_gcdD2 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

744 
coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

745 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  746 
realpow_minus_mult ~> power_minus_mult 
747 
realpow_Suc_le_self ~> power_Suc_le_self 

62353
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

748 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  749 
INCOMPATIBILITY. 
750 

63967
2aa42596edc3
new material on paths, etc. Also rationalisation
paulson <lp15@cam.ac.uk>
parents:
63963
diff
changeset

751 
* Renamed HOL/Quotient_Examples/FSet.thy to 
63977  752 
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY. 
753 

64390  754 
* Session HOLLibrary: theory FinFun bundles "finfun_syntax" and 
755 
"no_finfun_syntax" allow to control optional syntax in local contexts; 

756 
this supersedes former theory FinFun_Syntax. INCOMPATIBILITY, e.g. use 

757 
"unbundle finfun_syntax" to imitate import of 

758 
"~~/src/HOL/Library/FinFun_Syntax". 

759 

760 
* Session HOLLibrary: theory Multiset_Permutations (executably) defines 

761 
the set of permutations of a given set or multiset, i.e. the set of all 

762 
lists that contain every element of the carrier (multi)set exactly 

763 
once. 

764 

765 
* Session HOLLibrary: multiset membership is now expressed using 

766 
set_mset rather than count. 

767 

768 
 Expressions "count M a > 0" and similar simplify to membership 

769 
by default. 

770 

771 
 Converting between "count M a = 0" and nonmembership happens using 

772 
equations count_eq_zero_iff and not_in_iff. 

773 

774 
 Rules count_inI and in_countE obtain facts of the form 

775 
"count M a = n" from membership. 

776 

777 
 Rules count_in_diffI and in_diff_countE obtain facts of the form 

778 
"count M a = n + count N a" from membership on difference sets. 

779 

780 
INCOMPATIBILITY. 

781 

782 
* Session HOLLibrary: theory LaTeXsugar uses newstyle "dummy_pats" for 

783 
displaying equations in functional programming style  variables 

784 
present on the lefthand but not on the righhand side are replaced by 

785 
underscores. 

786 

787 
* Session HOLLibrary: theory Combinator_PER provides combinator to 

788 
build partial equivalence relations from a predicate and an equivalence 

789 
relation. 

790 

791 
* Session HOLLibrary: theory Perm provides basic facts about almost 

792 
everywhere fix bijections. 

793 

794 
* Session HOLLibrary: theory Normalized_Fraction allows viewing an 

795 
element of a field of fractions as a normalized fraction (i.e. a pair of 

796 
numerator and denominator such that the two are coprime and the 

797 
denominator is normalized wrt. unit factors). 

798 

799 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 

800 

801 
* Session HOLMultivariate_Analysis has been renamed to HOLAnalysis. 

802 

803 
* Session HOLAnalysis: measure theory has been moved here from 

804 
HOLProbability. When importing HOLAnalysis some theorems need 

805 
additional name spaces prefixes due to name clashes. INCOMPATIBILITY. 

806 

807 
* Session HOLAnalysis: more complex analysis including Cauchy's 

808 
inequality, Liouville theorem, open mapping theorem, maximum modulus 

809 
principle, Residue theorem, Schwarz Lemma. 

810 

811 
* Session HOLAnalysis: Theory of polyhedra: faces, extreme points, 

812 
polytopes, and the Kreinâ€“Milman Minkowski theorem. 

813 

814 
* Session HOLAnalysis: Numerous results ported from the HOL Light 

815 
libraries: homeomorphisms, continuous function extensions, invariance of 

816 
domain. 

817 

818 
* Session HOLProbability: the type of emeasure and nn_integral was 

819 
changed from ereal to ennreal, INCOMPATIBILITY. 

820 

821 
emeasure :: 'a measure \<Rightarrow> 'a set \<Rightarrow> ennreal 

822 
nn_integral :: 'a measure \<Rightarrow> ('a \<Rightarrow> ennreal) \<Rightarrow> ennreal 

823 

824 
* Session HOLProbability: Code generation and QuickCheck for 

825 
Probability Mass Functions. 

826 

827 
* Session HOLProbability: theory Random_Permutations contains some 

828 
theory about choosing a permutation of a set uniformly at random and 

829 
folding over a list in random order. 

830 

831 
* Session HOLProbability: theory SPMF formalises discrete 

832 
subprobability distributions. 

833 

834 
* Session HOLLibrary: the names of multiset theorems have been 

835 
normalised to distinguish which ordering the theorems are about 

836 

837 
mset_less_eqI ~> mset_subset_eqI 

838 
mset_less_insertD ~> mset_subset_insertD 

839 
mset_less_eq_count ~> mset_subset_eq_count 

840 
mset_less_diff_self ~> mset_subset_diff_self 

841 
mset_le_exists_conv ~> mset_subset_eq_exists_conv 

842 
mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel 

843 
mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel 

844 
mset_le_mono_add ~> mset_subset_eq_mono_add 

845 
mset_le_add_left ~> mset_subset_eq_add_left 

846 
mset_le_add_right ~> mset_subset_eq_add_right 

847 
mset_le_single ~> mset_subset_eq_single 

848 
mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute 

849 
diff_le_self ~> diff_subset_eq_self 

850 
mset_leD ~> mset_subset_eqD 

851 
mset_lessD ~> mset_subsetD 

852 
mset_le_insertD ~> mset_subset_eq_insertD 

853 
mset_less_of_empty ~> mset_subset_of_empty 

854 
mset_less_size ~> mset_subset_size 

855 
wf_less_mset_rel ~> wf_subset_mset_rel 

856 
count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq 

857 
mset_remdups_le ~> mset_remdups_subset_eq 

858 
ms_lesseq_impl ~> subset_eq_mset_impl 

859 

860 
Some functions have been renamed: 

861 
ms_lesseq_impl > subset_eq_mset_impl 

862 

863 
* HOLLibrary: multisets are now ordered with the multiset ordering 

864 
#\<subseteq># ~> \<le> 

865 
#\<subset># ~> < 

866 
le_multiset ~> less_eq_multiset 

867 
less_multiset ~> le_multiset 

868 
INCOMPATIBILITY. 

869 

870 
* Session HOLLibrary: the prefix multiset_order has been discontinued: 

871 
the theorems can be directly accessed. As a consequence, the lemmas 

872 
"order_multiset" and "linorder_multiset" have been discontinued, and the 

873 
interpretations "multiset_linorder" and "multiset_wellorder" have been 

874 
replaced by instantiations. INCOMPATIBILITY. 

875 

876 
* Session HOLLibrary: some theorems about the multiset ordering have 

877 
been renamed: 

878 

879 
le_multiset_def ~> less_eq_multiset_def 

880 
less_multiset_def ~> le_multiset_def 

881 
less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset 

882 
mult_less_not_refl ~> mset_le_not_refl 

883 
mult_less_trans ~> mset_le_trans 

884 
mult_less_not_sym ~> mset_le_not_sym 

885 
mult_less_asym ~> mset_le_asym 

886 
mult_less_irrefl ~> mset_le_irrefl 

887 
union_less_mono2{,1,2} ~> union_le_mono2{,1,2} 

888 

889 
le_multiset\<^sub>H\<^sub>O ~> less_eq_multiset\<^sub>H\<^sub>O 

890 
le_multiset_total ~> less_eq_multiset_total 

891 
less_multiset_right_total ~> subset_eq_imp_le_multiset 

892 
le_multiset_empty_left ~> less_eq_multiset_empty_left 

893 
le_multiset_empty_right ~> less_eq_multiset_empty_right 

894 
less_multiset_empty_right ~> le_multiset_empty_left 

895 
less_multiset_empty_left ~> le_multiset_empty_right 

896 
union_less_diff_plus ~> union_le_diff_plus 

897 
ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset 

898 
less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty 

899 
le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty 

900 
INCOMPATIBILITY. 

901 

902 
* Session HOLLibrary: the lemma mset_map has now the attribute [simp]. 

903 
INCOMPATIBILITY. 

904 

905 
* Session HOLLibrary: some theorems about multisets have been removed. 

906 
INCOMPATIBILITY, use the following replacements: 

907 

908 
le_multiset_plus_plus_left_iff ~> add_less_cancel_right 

909 
less_multiset_plus_plus_left_iff ~> add_less_cancel_right 

910 
le_multiset_plus_plus_right_iff ~> add_less_cancel_left 

911 
less_multiset_plus_plus_right_iff ~> add_less_cancel_left 

912 
add_eq_self_empty_iff ~> add_cancel_left_right 

913 
mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right 

914 
mset_less_add_bothsides ~> subset_mset.add_less_cancel_right 

915 
mset_le_add_bothsides ~> subset_mset.add_less_cancel_right 

916 
empty_inter ~> subset_mset.inf_bot_left 

917 
inter_empty ~> subset_mset.inf_bot_right 

918 
empty_sup ~> subset_mset.sup_bot_left 

919 
sup_empty ~> subset_mset.sup_bot_right 

920 
bdd_below_multiset ~> subset_mset.bdd_above_bot 

921 
subset_eq_empty ~> subset_mset.le_zero_eq 

922 
le_empty ~> subset_mset.le_zero_eq 

923 
mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

924 
mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

925 

926 
* Session HOLLibrary: some typeclass constraints about multisets have 

927 
been reduced from ordered or linordered to preorder. Multisets have the 

928 
additional typeclasses order_bot, no_top, 

929 
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add, 

930 
linordered_cancel_ab_semigroup_add, and 

931 
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY. 

932 

933 
* Session HOLLibrary: there are some new simplification rules about 

934 
multisets, the multiset ordering, and the subset ordering on multisets. 

935 
INCOMPATIBILITY. 

936 

937 
* Session HOLLibrary: the subset ordering on multisets has now the 

938 
interpretations ordered_ab_semigroup_monoid_add_imp_le and 

939 
bounded_lattice_bot. INCOMPATIBILITY. 

940 

941 
* Session HOLLibrary, theory Multiset: single has been removed in favor 

942 
of add_mset that roughly corresponds to Set.insert. Some theorems have 

943 
removed or changed: 

944 

945 
single_not_empty ~> add_mset_not_empty or empty_not_add_mset 

946 
fold_mset_insert ~> fold_mset_add_mset 

947 
image_mset_insert ~> image_mset_add_mset 

948 
union_single_eq_diff 

949 
multi_self_add_other_not_self 

950 
diff_single_eq_union 

951 
INCOMPATIBILITY. 

952 

953 
* Session HOLLibrary, theory Multiset: some theorems have been changed 

954 
to use add_mset instead of single: 

955 

956 
mset_add 

957 
multi_self_add_other_not_self 

958 
diff_single_eq_union 

959 
union_single_eq_diff 

960 
union_single_eq_member 

961 
add_eq_conv_diff 

962 
insert_noteq_member 

963 
add_eq_conv_ex 

964 
multi_member_split 

965 
multiset_add_sub_el_shuffle 

966 
mset_subset_eq_insertD 

967 
mset_subset_insertD 

968 
insert_subset_eq_iff 

969 
insert_union_subset_iff 

970 
multi_psub_of_add_self 

971 
inter_add_left1 

972 
inter_add_left2 

973 
inter_add_right1 

974 
inter_add_right2 

975 
sup_union_left1 

976 
sup_union_left2 

977 
sup_union_right1 

978 
sup_union_right2 

979 
size_eq_Suc_imp_eq_union 

980 
multi_nonempty_split 

981 
mset_insort 

982 
mset_update 

983 
mult1I 

984 
less_add 

985 
mset_zip_take_Cons_drop_twice 

986 
rel_mset_Zero 

987 
msed_map_invL 

988 
msed_map_invR 

989 
msed_rel_invL 

990 
msed_rel_invR 

991 
le_multiset_right_total 

992 
multiset_induct 

993 
multiset_induct2_size 

994 
multiset_induct2 

995 
INCOMPATIBILITY. 

996 

997 
* Session HOLLibrary, theory Multiset: the definitions of some 

998 
constants have changed to use add_mset instead of adding a single 

999 
element: 

1000 

1001 
image_mset 

1002 
mset 

1003 
replicate_mset 

1004 
mult1 

1005 
pred_mset 

1006 
rel_mset' 

1007 
mset_insort 

1008 

1009 
INCOMPATIBILITY. 

1010 

1011 
* Session HOLLibrary, theory Multiset: due to the above changes, the 

1012 
attributes of some multiset theorems have been changed: 

1013 

1014 
insert_DiffM [] ~> [simp] 

1015 
insert_DiffM2 [simp] ~> [] 

1016 
diff_add_mset_swap [simp] 

1017 
fold_mset_add_mset [simp] 

1018 
diff_diff_add [simp] (for multisets only) 

1019 
diff_cancel [simp] ~> [] 

1020 
count_single [simp] ~> [] 

1021 
set_mset_single [simp] ~> [] 

1022 
size_multiset_single [simp] ~> [] 

1023 
size_single [simp] ~> [] 

1024 
image_mset_single [simp] ~> [] 

1025 
mset_subset_eq_mono_add_right_cancel [simp] ~> [] 

1026 
mset_subset_eq_mono_add_left_cancel [simp] ~> [] 

1027 
fold_mset_single [simp] ~> [] 

1028 
subset_eq_empty [simp] ~> [] 

1029 
empty_sup [simp] ~> [] 

1030 
sup_empty [simp] ~> [] 

1031 
inter_empty [simp] ~> [] 

1032 
empty_inter [simp] ~> [] 

1033 
INCOMPATIBILITY. 

1034 

64391  1035 
* Session HOLLibrary, theory Multiset: the order of the variables in 
64390  1036 
the second cases of multiset_induct, multiset_induct2_size, 
1037 
multiset_induct2 has been changed (e.g. Add A a ~> Add a A). 

1038 
INCOMPATIBILITY. 

1039 

1040 
* Session HOLLibrary, theory Multiset: there is now a simplification 

1041 
procedure on multisets. It mimics the behavior of the procedure on 

1042 
natural numbers. INCOMPATIBILITY. 

1043 

1044 
* Session HOLLibrary, theory Multiset: renamed sums and products of 

1045 
multisets: 

1046 

1047 
msetsum ~> sum_mset 

1048 
msetprod ~> prod_mset 

1049 

1050 
* Session HOLLibrary, theory Multiset: the notation for intersection 

1051 
and union of multisets have been changed: 

1052 

1053 
#\<inter> ~> \<inter># 

1054 
#\<union> ~> \<union># 

1055 

1056 
INCOMPATIBILITY. 

1057 

1058 
* Session HOLLibrary, theory Multiset: the lemma 

1059 
one_step_implies_mult_aux on multisets has been removed, use 

1060 
one_step_implies_mult instead. INCOMPATIBILITY. 

1061 

1062 
* Session HOLLibrary: theory Complete_Partial_Order2 provides reasoning 

1063 
support for monotonicity and continuity in chaincomplete partial orders 

1064 
and about admissibility conditions for fixpoint inductions. 

1065 

64523  1066 
* Session HOLLibrary: theory Library/Polynomial contains also 
1067 
derivation of polynomials (formerly in Library/Poly_Deriv) but not 

1068 
gcd/lcm on polynomials over fields. This has been moved to a separate 

1069 
theory Library/Polynomial_GCD_euclidean.thy, to pave way for a possible 

1070 
future different type class instantiation for polynomials over factorial 

1071 
rings. INCOMPATIBILITY. 

64390  1072 

1073 
* Session HOLLibrary: theory Sublist provides function "prefixes" with 

1074 
the following renaming 

1075 

1076 
prefixeq > prefix 

1077 
prefix > strict_prefix 

1078 
suffixeq > suffix 

1079 
suffix > strict_suffix 

1080 

1081 
Added theory of longest common prefixes. 

64389  1082 

64391  1083 
* Session HOLNumber_Theory: algebraic foundation for primes: 
1084 
Generalisation of predicate "prime" and introduction of predicates 

1085 
"prime_elem", "irreducible", a "prime_factorization" function, and the 

1086 
"factorial_ring" typeclass with instance proofs for nat, int, poly. Some 

1087 
theorems now have different names, most notably "prime_def" is now 

1088 
"prime_nat_iff". INCOMPATIBILITY. 

1089 

1090 
* Session Old_Number_Theory has been removed, after porting remaining 

1091 
theories. 

1092 

64551  1093 
* Session HOLTypes_To_Sets provides an experimental extension of 
1094 
HigherOrder Logic to allow translation of types to sets. 

1095 

63198
c583ca33076a
adhoc overloading for standard operations on type Rat.rat;
wenzelm
parents:
63184
diff
changeset

1096 

62498  1097 
*** ML *** 
1098 

63227
d3ed7f00e818
Integer.lcm normalizes the sign as in HOL/GCD.thy;
wenzelm
parents:
63226
diff
changeset

1099 
* Integer.gcd and Integer.lcm use efficient operations from the Poly/ML 
63228  1100 
library (notably for big integers). Subtle change of semantics: 
1101 
Integer.gcd and Integer.lcm both normalize the sign, results are never 

1102 
negative. This coincides with the definitions in HOL/GCD.thy. 

1103 
INCOMPATIBILITY. 

63227
d3ed7f00e818
Integer.lcm normalizes the sign as in HOL/GCD.thy;
wenzelm
parents:
63226
diff
changeset

1104 

63212  1105 
* Structure Rat for rational numbers is now an integral part of 
63215  1106 
Isabelle/ML, with special notation @int/nat or @int for numerals (an 
1107 
abbreviation for antiquotation @{Pure.rat argument}) and ML pretty 

63212  1108 
printing. Standard operations on type Rat.rat are provided via adhoc 
63215  1109 
overloading of +  * / < <= > >= ~ abs. INCOMPATIBILITY, need to 
63212  1110 
use + instead of +/ etc. Moreover, exception Rat.DIVZERO has been 
1111 
superseded by General.Div. 

63198
c583ca33076a
adhoc overloading for standard operations on type Rat.rat;
wenzelm
parents:
63184
diff
changeset

1112 

64390  1113 
* ML antiquotation @{path} is superseded by @{file}, which ensures that 
1114 
the argument is a plain file. Minor INCOMPATIBILITY. 

1115 

1116 
* Antiquotation @{make_string} is available during Pure bootstrap  

1117 
with approximative output quality. 

1118 

1119 
* Lowlevel ML system structures (like PolyML and RunCall) are no longer 

1120 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 

1121 

62861  1122 
* The ML function "ML" provides easy access to runtime compilation. 
1123 
This is particularly useful for conditional compilation, without 

1124 
requiring separate files. 

1125 

62498  1126 
* Option ML_exception_debugger controls detailed exception trace via the 
1127 
Poly/ML debugger. Relevant ML modules need to be compiled beforehand 

1128 
with ML_file_debug, or with ML_file and option ML_debugger enabled. Note 

1129 
debugger information requires consirable time and space: main 

1130 
Isabelle/HOL with full debugger support may need ML_system_64. 

1131 

62514  1132 
* Local_Theory.restore has been renamed to Local_Theory.reset to 
1133 
emphasize its disruptive impact on the cumulative context, notably the 

1134 
scope of 'private' or 'qualified' names. Note that Local_Theory.reset is 

1135 
only appropriate when targets are managed, e.g. starting from a global 

1136 
theory and returning to it. Regular definitional packages should use 

1137 
balanced blocks of Local_Theory.open_target versus 

1138 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

1139 

62519  1140 
* Structure TimeLimit (originally from the SML/NJ library) has been 
1141 
replaced by structure Timeout, with slightly different signature. 

1142 
INCOMPATIBILITY. 

1143 

62551  1144 
* Discontinued cd and pwd operations, which are not welldefined in a 
1145 
multithreaded environment. Note that files are usually located 

1146 
relatively to the master directory of a theory (see also 

1147 
File.full_path). Potential INCOMPATIBILITY. 

1148 

63352  1149 
* Binding.empty_atts supersedes Thm.empty_binding and 
1150 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

1151 

62498  1152 

62354  1153 
*** System *** 
1154 

64390  1155 
* SML/NJ and old versions of Poly/ML are no longer supported. 
1156 

1157 
* Poly/ML heaps now follow the hierarchy of sessions, and thus require 

1158 
much less disk space. 

63226  1159 

62591  1160 
* The Isabelle ML process is now managed directly by Isabelle/Scala, and 
1161 
shell scripts merely provide optional commandline access. In 

1162 
particular: 

1163 

1164 
. Scala module ML_Process to connect to the raw ML process, 

1165 
with interaction via stdin/stdout/stderr or in batch mode; 

1166 
. commandline tool "isabelle console" as interactive wrapper; 

1167 
. commandline tool "isabelle process" as batch mode wrapper. 

62588
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1168 

cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1169 
* The executable "isabelle_process" has been discontinued. Tools and 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1170 
prover frontends should use ML_Process or Isabelle_Process in 
62591  1171 
Isabelle/Scala. INCOMPATIBILITY. 
62588
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1172 

cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1173 
* New commandline tool "isabelle process" supports ML evaluation of 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1174 
literal expressions (option e) or files (option f) in the context of a 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1175 
given heap image. Errors lead to premature exit of the ML process with 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1176 
return code 1. 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1177 

64390  1178 
* The commandline tool "isabelle build" supports option N for cyclic 
1179 
shuffling of NUMA CPU nodes. This may help performance tuning on Linux 

1180 
servers with separate CPU/memory modules. 

1181 

1182 
* System option "threads" (for the size of the Isabelle/ML thread farm) 

1183 
is also passed to the underlying ML runtime system as gcthreads, 

64274  1184 
unless there is already a default provided via ML_OPTIONS settings. 
1185 

63827
b24d0e53dd03
option "checkpoint" helps to finetune global heap space management;
wenzelm
parents:
63821
diff
changeset

1186 
* System option "checkpoint" helps to finetune the global heap space 
b24d0e53dd03
option "checkpoint" helps to finetune global heap space management;
wenzelm
parents:
63821
diff
changeset

1187 
management of isabelle build. This is relevant for big sessions that may 
b24d0e53dd03
option "checkpoint" helps to finetune global heap space management;
wenzelm
parents:
63821
diff
changeset

1188 
exhaust the small 32bit address space of the ML process (which is used 
b24d0e53dd03
option "checkpoint" helps to finetune global heap space management;
wenzelm
parents:
63821
diff
changeset

1189 
by default). 
b24d0e53dd03
option "checkpoint" helps to finetune global heap space management;
wenzelm
parents:
63821
diff
changeset

1190 

64308  1191 
* System option "profiling" specifies the mode for global ML profiling 
64342  1192 
in "isabelle build". Possible values are "time", "allocations". The 
1193 
commandline tool "isabelle profiling_report" helps to digest the 

1194 
resulting log files. 

64308  1195 

63986
c7a4b03727ae
options for process policy, notably for multiprocessor machines;
wenzelm
parents:
63979
diff
changeset

1196 
* System option "ML_process_policy" specifies an optional command prefix 
c7a4b03727ae
options for process policy, notably for multiprocessor machines;
wenzelm
parents:
63979
diff
changeset

1197 
for the underlying ML process, e.g. to control CPU affinity on 
63987
ac96fe9224f6
just one option is enough  "isabelle jedit" java process may be prefixed directly in the shell;
wenzelm
parents:
63986
diff
changeset

1198 
multiprocessor systems. The "isabelle jedit" tool allows to override the 
ac96fe9224f6
just one option is enough  "isabelle jedit" java process may be prefixed directly in the shell;
wenzelm
parents:
63986
diff
changeset

1199 
implicit default via option p. 
63986
c7a4b03727ae
options for process policy, notably for multiprocessor machines;
wenzelm
parents:
63979
diff
changeset

1200 

64390  1201 
* Commandline tool "isabelle console" provides option r to help to 
1202 
bootstrapping Isabelle/Pure interactively. 

1203 

1204 
* Commandline tool "isabelle yxml" has been discontinued. 

1205 
INCOMPATIBILITY, use operations from the modules "XML" and "YXML" in 

1206 
Isabelle/ML or Isabelle/Scala. 

1207 

1208 
* Many Isabelle tools that require a Java runtime system refer to the 

1209 
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64, 

1210 
depending on the underlying platform. The settings for "isabelle build" 

1211 
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been 

1212 
discontinued. Potential INCOMPATIBILITY. 

1213 

1214 
* The Isabelle system environment always ensures that the main 

1215 
executables are found within the shell search $PATH: "isabelle" and 

1216 
"isabelle_scala_script". 

1217 

1218 
* Isabelle tools may consist of .scala files: the Scala compiler is 

1219 
invoked on the spot. The source needs to define some object that extends 

1220 
Isabelle_Tool.Body. 

1221 

1222 
* File.bash_string, File.bash_path etc. represent Isabelle/ML and 

1223 
Isabelle/Scala strings authentically within GNU bash. This is useful to 

1224 
produce robust shell scripts under program control, without worrying 

1225 
about spaces or special characters. Note that user output works via 

1226 
Path.print (ML) or Path.toString (Scala). INCOMPATIBILITY, the old (and 

1227 
less versatile) operations File.shell_quote, File.shell_path etc. have 

1228 
been discontinued. 

1229 

63995  1230 
* The isabelle_java executable allows to run a Java process within the 
1231 
name space of Java and Scala components that are bundled with Isabelle, 

1232 
but without the Isabelle settings environment. 

1233 

64390  1234 
* Isabelle/Scala: the SSH module supports ssh and sftp connections, for 
1235 
remote commandexecution and filesystem access. This resembles 

1236 
operations from module File and Isabelle_System to some extent. Note 

1237 
that Path specifications need to be resolved remotely via 

1238 
ssh.remote_path instead of File.standard_path: the implicit process 

1239 
environment is different, Isabelle settings are not available remotely. 

1240 

1241 
* Isabelle/Scala: the Mercurial module supports repositories via the 

1242 
regular hg commandline interface. The repositroy clone and working 

1243 
directory may reside on a local or remote filesystem (via ssh 

1244 
connection). 

64265  1245 

62354  1246 

1247 

62031  1248 
New in Isabelle2016 (February 2016) 
62016  1249 
 
60138  1250 

61337  1251 
*** General *** 
1252 

62168
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1253 
* Eisbach is now based on Pure instead of HOL. Objectslogics may import 
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1254 
either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or 
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1255 
~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that 
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1256 
the HOLEisbach session located in ~~/src/HOL/Eisbach/ contains further 
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1257 
examples that do require HOL. 
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1258 

62157  1259 
* Better resource usage on all platforms (Linux, Windows, Mac OS X) for 
1260 
both Isabelle/ML and Isabelle/Scala. Slightly reduced heap space usage. 

1261 

62017  1262 
* Former "xsymbols" syntax with Isabelle symbols is used by default, 
1263 
without any special print mode. Important ASCII replacement syntax 

1264 
remains available under print mode "ASCII", but less important syntax 

1265 
has been removed (see below). 

1266 

62109  1267 
* Support for more arrow symbols, with rendering in LaTeX and Isabelle 
1268 
fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>. 

62017  1269 

62108
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1270 
* Special notation \<struct> for the first implicit 'structure' in the 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1271 
context has been discontinued. Rare INCOMPATIBILITY, use explicit 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1272 
structure name instead, notably in indexed notation with blocksubscript 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1273 
(e.g. \<odot>\<^bsub>A\<^esub>). 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1274 

0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1275 
* The glyph for \<diamond> in the IsabelleText font now corresponds better to its 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1276 
counterpart \<box> as quantifierlike symbol. A small diamond is available as 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1277 
\<diamondop>; the old symbol \<struct> loses this rendering and any special 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1278 
meaning. 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1279 

62017  1280 
* Syntax for formal comments " text" now also supports the symbolic 
1281 
form "\<comment> text". Commandline tool "isabelle update_cartouches c" helps 

1282 
to update old sources. 

1283 

61337  1284 
* Toplevel theorem statements have been simplified as follows: 
1285 

1286 
theorems ~> lemmas 

1287 
schematic_lemma ~> schematic_goal 

1288 
schematic_theorem ~> schematic_goal 

1289 
schematic_corollary ~> schematic_goal 

1290 

1291 
Commandline tool "isabelle update_theorems" updates theory sources 

1292 
accordingly. 

1293 

61338  1294 
* Toplevel theorem statement 'proposition' is another alias for 
1295 
'theorem'. 

1296 

62169  1297 
* The old 'defs' command has been removed (legacy since Isabelle2014). 
1298 
INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or 

1299 
deferred definitions require a surrounding 'overloading' block. 

1300 

61337  1301 

60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset

1302 
*** Prover IDE  Isabelle/Scala/jEdit *** 
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset

1303 

60986  1304 
* IDE support for the sourcelevel debugger of Poly/ML, to work with 
62253  1305 
Isabelle/ML and official Standard ML. Option "ML_debugger" and commands 
1306 
'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug', 

1307 
'SML_file_no_debug' control compilation of sources with or without 

1308 
debugging information. The Debugger panel allows to set breakpoints (via 

1309 
context menu), step through stopped threads, evaluate local ML 

1310 
expressions etc. At least one Debugger view needs to be active to have 

1311 
any effect on the running ML program. 

60984  1312 

61803  1313 
* The State panel manages explicit proof state output, with dynamic 
1314 
autoupdate according to cursor movement. Alternatively, the jEdit 

1315 
action "isabelle.updatestate" (shortcut S+ENTER) triggers manual 

1316 
update. 

61729  1317 

1318 
* The Output panel no longer shows proof state output by default, to 

1319 
avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or 

1320 
enable option "editor_output_state". 

61215  1321 

61803  1322 
* The text overview column (status of errors, warnings etc.) is updated 
1323 
asynchronously, leading to much better editor reactivity. Moreover, the 

1324 
full document node content is taken into account. The width of the 

1325 
column is scaled according to the main text area font, for improved 

1326 
visibility. 

1327 

1328 
* The main text area no longer changes its color hue in outdated 

1329 
situations. The text overview column takes over the role to indicate 

1330 
unfinished edits in the PIDE pipeline. This avoids flashing text display 

1331 
due to adhoc updates by auxiliary GUI components, such as the State 

1332 
panel. 

1333 

62254
81cbea2babd9
tuned NEWS: longrunning tasks can still prevent urgent tasks from being started, due to start_execution pri = 0;
wenzelm
parents:
62253
diff
changeset

1334 
* Slightly improved scheduling for urgent print tasks (e.g. command 
81cbea2babd9
tuned NEWS: longrunning tasks can still prevent urgent tasks from being started, due to start_execution pri = 0;
wenzelm
parents:
62253
diff
changeset

1335 
state output, interactive queries) wrt. longrunning background tasks. 
62017  1336 

1337 
* Completion of symbols via prefix of \<name> or \<^name> or \name is 

1338 
always possible, independently of the language context. It is never 

1339 
implicit: a popup will show up unconditionally. 

1340 

1341 
* Additional abbreviations for syntactic completion may be specified in 

1342 
$ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with 

1343 
support for simple templates using ASCII 007 (bell) as placeholder. 

1344 

62234
7cc9d7b822ae
discontinued irregular abbrevs: ".o" counts as word, "+o", "*o", "o" are occasionally used as ASCII notation, "*o" is in conflict with "(*o" in comments;
wenzelm
parents:
62231
diff
changeset

1345 
* Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for 
7cc9d7b822ae
discontinued irregular abbrevs: ".o" counts as word, "+o", "*o", "o" are occasionally used as ASCII notation, "*o" is in conflict with "(*o" in comments;
wenzelm
parents:
62231
diff
changeset

1346 
completion like "+o", "*o", ".o" etc.  due to conflicts with other 
7cc9d7b822ae
discontinued irregular abbrevs: ".o" counts as word, "+o", "*o", "o" are occasionally used as ASCII notation, "*o" is in conflict with "(*o" in comments;
wenzelm
parents:
62231
diff
changeset

1347 
ASCII syntax. INCOMPATIBILITY, use plain backslashcompletion or define 
7cc9d7b822ae
discontinued irregular abbrevs: ".o" counts as word, "+o", "*o", "o" are occasionally used as ASCII notation, "*o" is in conflict with "(*o" in comments;
wenzelm
parents:
62231
diff
changeset

1348 
suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs. 
7cc9d7b822ae
discontinued irregular abbrevs: ".o" counts as word, "+o", "*o", "o" are occasionally used as ASCII notation, "*o" is in conflict with "(*o" in comments;
wenzelm
parents:
62231
diff
changeset

1349 

61483  1350 
* Action "isabelleemph" (with keyboard shortcut C+e LEFT) controls 
1351 
emphasized text style; the effect is visible in document output, not in 

1352 
the editor. 

1353 

1354 
* Action "isabellereset" now uses keyboard shortcut C+e BACK_SPACE, 

1355 
instead of former C+e LEFT. 

1356 

61512
933463440449
more uniform commandline for "isabelle jedit" and the isabelle.Main app wrapper;
wenzelm
parents:
61501
diff
changeset

1357 
* The commandline tool "isabelle jedit" and the isabelle.Main 
62027  1358 
application wrapper treat the default $USER_HOME/Scratch.thy more 
61512
933463440449
more uniform commandline for "isabelle jedit" and the isabelle.Main app wrapper;
wenzelm
parents:
61501
diff
changeset

1359 
uniformly, and allow the dummy file argument ":" to open an empty buffer 
933463440449
more uniform commandline for "isabelle jedit" and the isabelle.Main app wrapper;
wenzelm
parents:
61501
diff
changeset

1360 
instead. 
933463440449
more uniform commandline for "isabelle jedit" and the isabelle.Main app wrapper;
wenzelm
parents:
61501
diff
changeset

1361 

62017  1362 
* New commandline tool "isabelle jedit_client" allows to connect to an 
1363 
already running Isabelle/jEdit process. This achieves the effect of 

1364 
singleinstance applications seen on common GUI desktops. 

1365 

61529
82fc5a6231a2
back to traditional Metal as default, and thus evade current problems with Nimbus scrollbar slider;
wenzelm
parents:
61520
diff
changeset

1366 
* The default lookandfeel for Linux is the traditional "Metal", which 
82fc5a6231a2
back to traditional Metal as default, and thus evade current problems with Nimbus scrollbar slider;
wenzelm
parents:
61520
diff
changeset

1367 
works better with GUI scaling for very highresolution displays (e.g. 
82fc5a6231a2
back to traditional Metal as default, and thus evade current problems with Nimbus scrollbar slider;
wenzelm
parents:
61520
diff
changeset

1368 
4K). Moreover, it is generally more robust than "Nimbus". 
82fc5a6231a2
back to traditional Metal as default, and thus evade current problems with Nimbus scrollbar slider;
wenzelm
parents:
61520
diff
changeset

1369 

62163  1370 
* Update to jedit5.3.0, with improved GUI scaling and support of 
1371 
highresolution displays (e.g. 4K). 

1372 

62034  1373 
* The main Isabelle executable is managed as singleinstance Desktop 
1374 
application uniformly on all platforms: Linux, Windows, Mac OS X. 

1375 

60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset

1376 

61405  1377 
*** Document preparation *** 
1378 

62017  1379 
* Commands 'paragraph' and 'subparagraph' provide additional section 
1380 
headings. Thus there are 6 levels of standard headings, as in HTML. 

1381 

1382 
* Command 'text_raw' has been clarified: input text is processed as in 

1383 
'text' (with antiquotations and control symbols). The key difference is 

1384 
the lack of the surrounding isabelle markup environment in output. 

1385 

1386 
* Text is structured in paragraphs and nested lists, using notation that 

1387 
is similar to Markdown. The control symbols for list items are as 

1388 
follows: 

1389 

1390 
\<^item> itemize 

1391 
\<^enum> enumerate 

1392 
\<^descr> description 

1393 

61491
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1394 
* There is a new short form for antiquotations with a single argument 
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1395 
that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and 
61595  1396 
\<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}. 
1397 
\<^name> without following cartouche is equivalent to @{name}. The 

61501  1398 
standard Isabelle fonts provide glyphs to render important control 
1399 
symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>". 

61491
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1400 

61595  1401 
* Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with 
1402 
corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using 

1403 
standard LaTeX macros of the same names. 

1404 

61491
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1405 
* Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}. 
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1406 
Consequently, \<open>...\<close> without any decoration prints literal quasiformal 
61492  1407 
text. Commandline tool "isabelle update_cartouches t" helps to update 
1408 
old sources, by approximative patching of the content of string and 

1409 
cartouche tokens seen in theory sources. 

61491
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1410 

97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1411 
* The @{text} antiquotation now ignores the antiquotation option 
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1412 
"source". The given text content is output unconditionally, without any 
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1413 
surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the 
61494  1414 
argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial 
1415 
or terminal spaces are ignored. 

61491
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1416 

62017  1417 
* Antiquotations @{emph} and @{bold} output LaTeX source recursively, 
1418 
adding appropriate text style markup. These may be used in the short 

1419 
form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>. 

1420 

1421 
* Document antiquotation @{footnote} outputs LaTeX source recursively, 

1422 
marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>. 

1423 

1424 
* Antiquotation @{verbatim [display]} supports option "indent". 

1425 

1426 
* Antiquotation @{theory_text} prints uninterpreted theory source text 

62231
25f4a9cd8b68
tuned markup, e.g. relevant for Rendering.tooltip;
wenzelm
parents:
62209
diff
changeset

1427 
(Isar outer syntax with command keywords etc.). This may be used in the 
25f4a9cd8b68
tuned markup, e.g. relevant for Rendering.tooltip;
wenzelm
parents:
62209
diff
changeset

1428 
short form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent". 
62017  1429 

1430 
* Antiquotation @{doc ENTRY} provides a reference to the given 

1431 
documentation, with a hyperlink in the Prover IDE. 

1432 

038ee85c95e4
misc tuning for release;
wen 