author  haftmann 
Wed, 05 Apr 2017 13:47:40 +0200  
changeset 65389  6f9c6ae27984 
parent 65329  4f3da52cec02 
child 65396  b42167902f57 
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 

65329  48 
* Update to jedit5.4.0. 
49 

64602  50 

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

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

52 

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

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

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

55 

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

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

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

61 
simplify porting old theories: 

62 

63 
syntax (ASCII) 

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

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

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

67 

64632  68 
* Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively. 
69 
INCOMPATIBILITY. 

70 

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

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

72 
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

73 
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

74 

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

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

78 

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

81 
unique_euclidean_(semi)ring; instantiation requires 

82 
provision of a euclidean size. 

83 

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

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

85 
 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

86 
 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

87 
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

88 
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

89 
 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

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

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

92 

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

95 
INCOMPATIBILITY. 

96 

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

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

98 
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

99 
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

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

101 

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

102 
* Generalized some facts: 
64876  103 
measure_induct_rule 
104 
measure_induct 

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

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

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

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

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

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

110 

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

111 
* (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

112 
 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

113 
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

114 
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

115 

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

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

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

118 

64898  119 
* Session HOLAnalysis: more material involving arcs, paths, covering 
120 
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

121 
Curve Theorem and the Great Picard Theorem. 
64846  122 

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

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

124 
bij_swap_ompose_bij ~> bij_swap_compose_bij 
64602  125 

65055  126 
* Session HOLLibrary: The simprocs on subsets operators of multisets 
127 
have been renamed: 

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

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

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

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

131 

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

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

134 

60331  135 

64844  136 
*** System *** 
137 

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

140 
while full subproof parallelization is enabled for repeated builds 

141 
(according to parallel_subproofs_threshold). 

142 

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

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

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

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

148 
frontends. 

149 

64900  150 
* ISABELLE_SCALA_BUILD_OPTIONS has been renamed to 
151 
ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY. 

152 

65073  153 
* Isabelle settings ISABELLE_WINDOWS_PLATFORM, 
154 
ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the 

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

156 
is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32, 

157 
ISABELLE_PLATFORM64. 

65072  158 

64900  159 

64844  160 

64072  161 
New in Isabelle20161 (December 2016) 
162 
 

62216  163 

62440  164 
*** General *** 
165 

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

168 
INCOMPATIBILITY. 

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

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

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

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

173 
result the subgoal may be split into several subgoals. 

174 

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

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

178 

179 
bundle foo 

180 
begin 

181 
declare a [simp] 

182 
declare b [intro] 

183 
end 

63272  184 

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

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

188 

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

191 
discontinued. 

192 

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

194 
delimited uniformly via cartouches. This works better than oldfashioned 

195 
quotes when sublanguages are nested. 

196 

197 
* Mixfix annotations support general block properties, with syntax 

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

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

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

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

63650  202 

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

205 

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

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

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

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

211 
examples. 

212 

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

214 
instances) are generated into companion object of corresponding type 

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

216 

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

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

219 

64602  220 

62904  221 
*** Prover IDE  Isabelle/Scala/jEdit *** 
222 

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

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

226 
reactivity and CPU usage. 

227 

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

230 
command keywords and some command substructure. Action 

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

232 
according to command keywords only; see also option 

233 
"jedit_indent_newline". 

234 

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

236 
number of subgoals. This requires information of ongoing document 

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

238 
quickly; see also option "jedit_script_indent" and 

239 
"jedit_script_indent_limit". 

240 

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

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

243 
structure of theory specifications is treated as well. 

244 

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

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

247 

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

249 
e.g. 'context', 'notepad'. 

250 

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

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

253 

63977  254 
* Highlighting of entity def/ref positions wrt. cursor. 
255 

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

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

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

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

262 
theorem statement. 

263 

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

265 
situations where old ASCII notation may be updated. 

266 

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

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

270 
inaccessible via keyboard completion). 

271 

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

274 

275 
src/Pure/ROOT0.ML 

276 
src/Pure/ROOT.ML 

277 
src/Pure/Pure.thy 

278 
src/Pure/ML_Bootstrap.thy 

279 

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

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

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

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

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

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

63307  286 
dependencies of the above files are only observed for batch build. 
62904  287 

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

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

63461  291 

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

295 
new 'abbrevs' section. 

296 

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

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

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

63579  300 

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

303 
keymap; nonconflicting changes are always applied implicitly. This 

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

305 
increases chances that users see new keyboard shortcuts when reusing 

306 
old keymaps. 

307 

63675  308 
* ML and document antiquotations for filesystems paths are more uniform 
309 
and diverse: 

310 

311 
@{path NAME}  no filesystem check 

312 
@{file NAME}  check for plain file 

313 
@{dir NAME}  check for directory 

314 

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

316 
have to be changed. 

63669  317 

318 

63977  319 
*** Document preparation *** 
320 

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

322 

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

325 

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

328 

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

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

331 
derivatives. 

332 

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

334 

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

336 
Isabelle2015). 

337 

338 

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

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

340 

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

343 
'definition', 'inductive', 'function'. 

344 

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

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

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

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

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

350 

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

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

63039  355 

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

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

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

358 

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

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

360 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  361 

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

364 

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

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

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

368 

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

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

371 
INCOMPATIBILITY. 

62939  372 

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

375 
definitions. 

376 

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

63259  379 

380 
(use facts in simp) 

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

382 

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

385 

62216  386 

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

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

388 

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

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

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

393 

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

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

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

397 
regardless of the actual parameters that are provided. Rare 

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

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

400 

401 
* Typeinference improves sorts of newly introduced type variables for 

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

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

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

405 
INCOMPATIBILITY, need to provide explicit type constraints for Pure 

406 
types where this is really intended. 

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

407 

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

408 

62327  409 
*** HOL *** 
410 

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

413 
propositional logic, goals based on a combination of quantifierfree 

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

415 
quantifierfree propositional logic with linear real arithmetic 

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

417 

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

420 

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

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

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

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

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

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

62335  444 
 Renamed lemmas: 
445 
rel_prod_apply ~> rel_prod_inject 

446 
pred_prod_apply ~> pred_prod_inject 

447 
INCOMPATIBILITY. 

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

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

451 
INCOMPATIBILITY. 

62327  452 

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

455 
which exposed details of the internal fixpoint construction and was 

456 
hard to use. INCOMPATIBILITY. 

457 

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

459 

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

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

462 

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

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

465 
eliminated altogether. 

466 

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

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

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

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

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

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

473 
INCOMPATIBILITY in rare situations. 

474 

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

476 
INCOMPATIBILITY. 

477 

64390  478 
* Renamed constants and corresponding theorems: 
479 

480 
setsum ~> sum 

481 
setprod ~> prod 

482 
listsum ~> sum_list 

483 
listprod ~> prod_list 

484 

485 
INCOMPATIBILITY. 

486 

487 
* Sligthly more standardized theorem names: 

488 
sgn_times ~> sgn_mult 

489 
sgn_mult' ~> Real_Vector_Spaces.sgn_mult 

490 
divide_zero_left ~> div_0 

491 
zero_mod_left ~> mod_0 

492 
divide_zero ~> div_by_0 

493 
divide_1 ~> div_by_1 

494 
nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left 

495 
div_mult_self1_is_id ~> nonzero_mult_div_cancel_left 

496 
nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right 

497 
div_mult_self2_is_id ~> nonzero_mult_div_cancel_right 

498 
is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left 

499 
is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right 

500 
mod_div_equality ~> div_mult_mod_eq 

501 
mod_div_equality2 ~> mult_div_mod_eq 

502 
mod_div_equality3 ~> mod_div_mult_eq 

503 
mod_div_equality4 ~> mod_mult_div_eq 

504 
minus_div_eq_mod ~> minus_div_mult_eq_mod 

505 
minus_div_eq_mod2 ~> minus_mult_div_eq_mod 

506 
minus_mod_eq_div ~> minus_mod_eq_div_mult 

507 
minus_mod_eq_div2 ~> minus_mod_eq_mult_div 

508 
div_mod_equality' ~> minus_mod_eq_div_mult [symmetric] 

509 
mod_div_equality' ~> minus_div_mult_eq_mod [symmetric] 

510 
zmod_zdiv_equality ~> mult_div_mod_eq [symmetric] 

511 
zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric] 

512 
Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

513 
mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

514 
zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

515 
div_1 ~> div_by_Suc_0 

516 
mod_1 ~> mod_by_Suc_0 

517 
INCOMPATIBILITY. 

518 

519 
* New type class "idom_abs_sgn" specifies algebraic properties 

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

521 
disappeared. Slight INCOMPATIBILITY. 

522 

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

524 

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

527 

528 
 Logical representation: 

529 
* 0 is instantiated to the ASCII zero character. 

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

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

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

533 
are noncanonical. 

534 
 Printing and parsing: 

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

536 
(as before). 

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

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

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

540 
is parsable for every numeral expression n. 

541 
* Noncanonical characters have no special syntax and are 

542 
printed as their logical representation. 

543 
 Explicit conversions from and to the natural numbers are 

544 
provided as char_of_nat, nat_of_char (as before). 

545 
 The auxiliary nibble type has been discontinued. 

546 

547 
INCOMPATIBILITY. 

548 

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

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

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

552 
infix "mod" syntax. INCOMPATIBILITY. 

553 

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

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

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

558 
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY. 

559 

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

562 

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

564 
which renders those abstract effectively. 

565 

566 
* Command 'export_code' checks given constants for abstraction 

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

568 
interface for the generated code. 

569 

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

571 
spelt out explicitly. 

572 

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

574 
explicitly provided auxiliary definitions for required type class 

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

577 

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

579 
products. 

63977  580 

581 
* Locale bijection establishes convenient default simp rules such as 

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

583 

584 
* Abstract locales semigroup, abel_semigroup, semilattice, 

585 
semilattice_neutr, ordering, ordering_top, semilattice_order, 

586 
semilattice_neutr_order, comm_monoid_set, semilattice_set, 

587 
semilattice_neutr_set, semilattice_order_set, 

588 
semilattice_order_neutr_set monoid_list, comm_monoid_list, 

589 
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified 

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

591 
INCOMPATIBILITY. 

592 

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

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

595 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

596 

63807  597 
* Some old / obsolete theorems have been renamed / removed, potential 
598 
INCOMPATIBILITY. 

599 

600 
nat_less_cases  removed, use linorder_cases instead 

601 
inv_image_comp  removed, use image_inv_f_f instead 

602 
image_surj_f_inv_f ~> image_f_inv_f 

63113  603 

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

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

605 
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

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

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

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

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

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

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

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

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

614 

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

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

616 
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

617 
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

618 
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

619 
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

620 
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

621 
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

622 
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

623 
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

624 
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

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

626 

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

62396  629 

63977  630 
* Added class topological_monoid. 
631 

64391  632 
* The following theorems have been renamed: 
633 

64457  634 
setsum_left_distrib ~> sum_distrib_right 
635 
setsum_right_distrib ~> sum_distrib_left 

64391  636 

637 
INCOMPATIBILITY. 

638 

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

640 
INCOMPATIBILITY. 

641 

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

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

644 
A)". 

645 

646 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 

647 

648 
* The type class ordered_comm_monoid_add is now called 

649 
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add 

650 
is introduced as the combination of ordered_ab_semigroup_add + 

651 
comm_monoid_add. INCOMPATIBILITY. 

652 

653 
* Introduced the type classes canonically_ordered_comm_monoid_add and 

654 
dioid. 

655 

656 
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When 

657 
instantiating linordered_semiring_strict and ordered_ab_group_add, an 

658 
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might 

659 
be required. INCOMPATIBILITY. 

63117  660 

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

663 
lcm_left_commute_nat ~> lcm.left_commute 

664 
lcm_left_commute_int ~> lcm.left_commute 

665 
gcd_left_commute_nat ~> gcd.left_commute 

666 
gcd_left_commute_int ~> gcd.left_commute 

667 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

668 
gcd_greatest_iff_int ~> gcd_greatest_iff 

669 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

670 
coprime_dvd_mult_int ~> coprime_dvd_mult 

671 
zpower_numeral_even ~> power_numeral_even 

672 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

673 
gcd_mult_cancel_int ~> gcd_mult_cancel 

674 
div_gcd_coprime_nat ~> div_gcd_coprime 

675 
div_gcd_coprime_int ~> div_gcd_coprime 

676 
zpower_numeral_odd ~> power_numeral_odd 

677 
zero_less_int_conv ~> of_nat_0_less_iff 

678 
gcd_greatest_nat ~> gcd_greatest 

679 
gcd_greatest_int ~> gcd_greatest 

680 
coprime_mult_nat ~> coprime_mult 

681 
coprime_mult_int ~> coprime_mult 

682 
lcm_commute_nat ~> lcm.commute 

683 
lcm_commute_int ~> lcm.commute 

684 
int_less_0_conv ~> of_nat_less_0_iff 

685 
gcd_commute_nat ~> gcd.commute 

686 
gcd_commute_int ~> gcd.commute 

687 
Gcd_insert_nat ~> Gcd_insert 

688 
Gcd_insert_int ~> Gcd_insert 

689 
of_int_int_eq ~> of_int_of_nat_eq 

690 
lcm_least_nat ~> lcm_least 

691 
lcm_least_int ~> lcm_least 

692 
lcm_assoc_nat ~> lcm.assoc 

693 
lcm_assoc_int ~> lcm.assoc 

694 
int_le_0_conv ~> of_nat_le_0_iff 

695 
int_eq_0_conv ~> of_nat_eq_0_iff 

696 
Gcd_empty_nat ~> Gcd_empty 

697 
Gcd_empty_int ~> Gcd_empty 

698 
gcd_assoc_nat ~> gcd.assoc 

699 
gcd_assoc_int ~> gcd.assoc 

700 
zero_zle_int ~> of_nat_0_le_iff 

701 
lcm_dvd2_nat ~> dvd_lcm2 

702 
lcm_dvd2_int ~> dvd_lcm2 

703 
lcm_dvd1_nat ~> dvd_lcm1 

704 
lcm_dvd1_int ~> dvd_lcm1 

705 
gcd_zero_nat ~> gcd_eq_0_iff 

706 
gcd_zero_int ~> gcd_eq_0_iff 

707 
gcd_dvd2_nat ~> gcd_dvd2 

708 
gcd_dvd2_int ~> gcd_dvd2 

709 
gcd_dvd1_nat ~> gcd_dvd1 

710 
gcd_dvd1_int ~> gcd_dvd1 

711 
int_numeral ~> of_nat_numeral 

712 
lcm_ac_nat ~> ac_simps 

713 
lcm_ac_int ~> ac_simps 

714 
gcd_ac_nat ~> ac_simps 

715 
gcd_ac_int ~> ac_simps 

716 
abs_int_eq ~> abs_of_nat 

717 
zless_int ~> of_nat_less_iff 

718 
zdiff_int ~> of_nat_diff 

719 
zadd_int ~> of_nat_add 

720 
int_mult ~> of_nat_mult 

721 
int_Suc ~> of_nat_Suc 

722 
inj_int ~> inj_of_nat 

723 
int_1 ~> of_nat_1 

724 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

747 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  748 
realpow_minus_mult ~> power_minus_mult 
749 
realpow_Suc_le_self ~> power_Suc_le_self 

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

750 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  751 
INCOMPATIBILITY. 
752 

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

753 
* Renamed HOL/Quotient_Examples/FSet.thy to 
63977  754 
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY. 
755 

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

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

759 
"unbundle finfun_syntax" to imitate import of 

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

761 

762 
* Session HOLLibrary: theory Multiset_Permutations (executably) defines 

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

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

765 
once. 

766 

767 
* Session HOLLibrary: multiset membership is now expressed using 

768 
set_mset rather than count. 

769 

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

771 
by default. 

772 

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

774 
equations count_eq_zero_iff and not_in_iff. 

775 

776 
 Rules count_inI and in_countE obtain facts of the form 

777 
"count M a = n" from membership. 

778 

779 
 Rules count_in_diffI and in_diff_countE obtain facts of the form 

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

781 

782 
INCOMPATIBILITY. 

783 

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

785 
displaying equations in functional programming style  variables 

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

787 
underscores. 

788 

789 
* Session HOLLibrary: theory Combinator_PER provides combinator to 

790 
build partial equivalence relations from a predicate and an equivalence 

791 
relation. 

792 

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

794 
everywhere fix bijections. 

795 

796 
* Session HOLLibrary: theory Normalized_Fraction allows viewing an 

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

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

799 
denominator is normalized wrt. unit factors). 

800 

801 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 

802 

803 
* Session HOLMultivariate_Analysis has been renamed to HOLAnalysis. 

804 

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

806 
HOLProbability. When importing HOLAnalysis some theorems need 

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

808 

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

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

811 
principle, Residue theorem, Schwarz Lemma. 

812 

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

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

815 

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

817 
libraries: homeomorphisms, continuous function extensions, invariance of 

818 
domain. 

819 

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

821 
changed from ereal to ennreal, INCOMPATIBILITY. 

822 

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

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

825 

826 
* Session HOLProbability: Code generation and QuickCheck for 

827 
Probability Mass Functions. 

828 

829 
* Session HOLProbability: theory Random_Permutations contains some 

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

831 
folding over a list in random order. 

832 

833 
* Session HOLProbability: theory SPMF formalises discrete 

834 
subprobability distributions. 

835 

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

837 
normalised to distinguish which ordering the theorems are about 

838 

839 
mset_less_eqI ~> mset_subset_eqI 

840 
mset_less_insertD ~> mset_subset_insertD 

841 
mset_less_eq_count ~> mset_subset_eq_count 

842 
mset_less_diff_self ~> mset_subset_diff_self 

843 
mset_le_exists_conv ~> mset_subset_eq_exists_conv 

844 
mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel 

845 
mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel 

846 
mset_le_mono_add ~> mset_subset_eq_mono_add 

847 
mset_le_add_left ~> mset_subset_eq_add_left 

848 
mset_le_add_right ~> mset_subset_eq_add_right 

849 
mset_le_single ~> mset_subset_eq_single 

850 
mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute 

851 
diff_le_self ~> diff_subset_eq_self 

852 
mset_leD ~> mset_subset_eqD 

853 
mset_lessD ~> mset_subsetD 

854 
mset_le_insertD ~> mset_subset_eq_insertD 

855 
mset_less_of_empty ~> mset_subset_of_empty 

856 
mset_less_size ~> mset_subset_size 

857 
wf_less_mset_rel ~> wf_subset_mset_rel 

858 
count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq 

859 
mset_remdups_le ~> mset_remdups_subset_eq 

860 
ms_lesseq_impl ~> subset_eq_mset_impl 

861 

862 
Some functions have been renamed: 

863 
ms_lesseq_impl > subset_eq_mset_impl 

864 

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

866 
#\<subseteq># ~> \<le> 

867 
#\<subset># ~> < 

868 
le_multiset ~> less_eq_multiset 

869 
less_multiset ~> le_multiset 

870 
INCOMPATIBILITY. 

871 

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

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

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

875 
interpretations "multiset_linorder" and "multiset_wellorder" have been 

876 
replaced by instantiations. INCOMPATIBILITY. 

877 

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

879 
been renamed: 

880 

881 
le_multiset_def ~> less_eq_multiset_def 

882 
less_multiset_def ~> le_multiset_def 

883 
less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset 

884 
mult_less_not_refl ~> mset_le_not_refl 

885 
mult_less_trans ~> mset_le_trans 

886 
mult_less_not_sym ~> mset_le_not_sym 

887 
mult_less_asym ~> mset_le_asym 

888 
mult_less_irrefl ~> mset_le_irrefl 

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

890 

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

892 
le_multiset_total ~> less_eq_multiset_total 

893 
less_multiset_right_total ~> subset_eq_imp_le_multiset 

894 
le_multiset_empty_left ~> less_eq_multiset_empty_left 

895 
le_multiset_empty_right ~> less_eq_multiset_empty_right 

896 
less_multiset_empty_right ~> le_multiset_empty_left 

897 
less_multiset_empty_left ~> le_multiset_empty_right 

898 
union_less_diff_plus ~> union_le_diff_plus 

899 
ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset 

900 
less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty 

901 
le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty 

902 
INCOMPATIBILITY. 

903 

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

905 
INCOMPATIBILITY. 

906 

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

908 
INCOMPATIBILITY, use the following replacements: 

909 

910 
le_multiset_plus_plus_left_iff ~> add_less_cancel_right 

911 
less_multiset_plus_plus_left_iff ~> add_less_cancel_right 

912 
le_multiset_plus_plus_right_iff ~> add_less_cancel_left 

913 
less_multiset_plus_plus_right_iff ~> add_less_cancel_left 

914 
add_eq_self_empty_iff ~> add_cancel_left_right 

915 
mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right 

916 
mset_less_add_bothsides ~> subset_mset.add_less_cancel_right 

917 
mset_le_add_bothsides ~> subset_mset.add_less_cancel_right 

918 
empty_inter ~> subset_mset.inf_bot_left 

919 
inter_empty ~> subset_mset.inf_bot_right 

920 
empty_sup ~> subset_mset.sup_bot_left 

921 
sup_empty ~> subset_mset.sup_bot_right 

922 
bdd_below_multiset ~> subset_mset.bdd_above_bot 

923 
subset_eq_empty ~> subset_mset.le_zero_eq 

924 
le_empty ~> subset_mset.le_zero_eq 

925 
mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

926 
mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

927 

928 
* Session HOLLibrary: some typeclass constraints about multisets have 

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

930 
additional typeclasses order_bot, no_top, 

931 
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add, 

932 
linordered_cancel_ab_semigroup_add, and 

933 
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY. 

934 

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

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

937 
INCOMPATIBILITY. 

938 

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

940 
interpretations ordered_ab_semigroup_monoid_add_imp_le and 

941 
bounded_lattice_bot. INCOMPATIBILITY. 

942 

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

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

945 
removed or changed: 

946 

947 
single_not_empty ~> add_mset_not_empty or empty_not_add_mset 

948 
fold_mset_insert ~> fold_mset_add_mset 

949 
image_mset_insert ~> image_mset_add_mset 

950 
union_single_eq_diff 

951 
multi_self_add_other_not_self 

952 
diff_single_eq_union 

953 
INCOMPATIBILITY. 

954 

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

956 
to use add_mset instead of single: 

957 

958 
mset_add 

959 
multi_self_add_other_not_self 

960 
diff_single_eq_union 

961 
union_single_eq_diff 

962 
union_single_eq_member 

963 
add_eq_conv_diff 

964 
insert_noteq_member 

965 
add_eq_conv_ex 

966 
multi_member_split 

967 
multiset_add_sub_el_shuffle 

968 
mset_subset_eq_insertD 

969 
mset_subset_insertD 

970 
insert_subset_eq_iff 

971 
insert_union_subset_iff 

972 
multi_psub_of_add_self 

973 
inter_add_left1 

974 
inter_add_left2 

975 
inter_add_right1 

976 
inter_add_right2 

977 
sup_union_left1 

978 
sup_union_left2 

979 
sup_union_right1 

980 
sup_union_right2 

981 
size_eq_Suc_imp_eq_union 

982 
multi_nonempty_split 

983 
mset_insort 

984 
mset_update 

985 
mult1I 

986 
less_add 

987 
mset_zip_take_Cons_drop_twice 

988 
rel_mset_Zero 

989 
msed_map_invL 

990 
msed_map_invR 

991 
msed_rel_invL 

992 
msed_rel_invR 

993 
le_multiset_right_total 

994 
multiset_induct 

995 
multiset_induct2_size 

996 
multiset_induct2 

997 
INCOMPATIBILITY. 

998 

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

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

1001 
element: 

1002 

1003 
image_mset 

1004 
mset 

1005 
replicate_mset 

1006 
mult1 

1007 
pred_mset 

1008 
rel_mset' 

1009 
mset_insort 

1010 

1011 
INCOMPATIBILITY. 

1012 

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

1014 
attributes of some multiset theorems have been changed: 

1015 

1016 
insert_DiffM [] ~> [simp] 

1017 
insert_DiffM2 [simp] ~> [] 

1018 
diff_add_mset_swap [simp] 

1019 
fold_mset_add_mset [simp] 

1020 
diff_diff_add [simp] (for multisets only) 

1021 
diff_cancel [simp] ~> [] 

1022 
count_single [simp] ~> [] 

1023 
set_mset_single [simp] ~> [] 

1024 
size_multiset_single [simp] ~> [] 

1025 
size_single [simp] ~> [] 

1026 
image_mset_single [simp] ~> [] 

1027 
mset_subset_eq_mono_add_right_cancel [simp] ~> [] 

1028 
mset_subset_eq_mono_add_left_cancel [simp] ~> [] 

1029 
fold_mset_single [simp] ~> [] 

1030 
subset_eq_empty [simp] ~> [] 

1031 
empty_sup [simp] ~> [] 

1032 
sup_empty [simp] ~> [] 

1033 
inter_empty [simp] ~> [] 

1034 
empty_inter [simp] ~> [] 

1035 
INCOMPATIBILITY. 

1036 

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

1040 
INCOMPATIBILITY. 

1041 

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

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

1044 
natural numbers. INCOMPATIBILITY. 

1045 

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

1047 
multisets: 

1048 

1049 
msetsum ~> sum_mset 

1050 
msetprod ~> prod_mset 

1051 

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

1053 
and union of multisets have been changed: 

1054 

1055 
#\<inter> ~> \<inter># 

1056 
#\<union> ~> \<union># 

1057 

1058 
INCOMPATIBILITY. 

1059 

1060 
* Session HOLLibrary, theory Multiset: the lemma 

1061 
one_step_implies_mult_aux on multisets has been removed, use 

1062 
one_step_implies_mult instead. INCOMPATIBILITY. 

1063 

1064 
* Session HOLLibrary: theory Complete_Partial_Order2 provides reasoning 

1065 
support for monotonicity and continuity in chaincomplete partial orders 

1066 
and about admissibility conditions for fixpoint inductions. 

1067 

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

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

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

1072 
future different type class instantiation for polynomials over factorial 

1073 
rings. INCOMPATIBILITY. 

64390  1074 

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

1076 
the following renaming 

1077 

1078 
prefixeq > prefix 

1079 
prefix > strict_prefix 

1080 
suffixeq > suffix 

1081 
suffix > strict_suffix 

1082 

1083 
Added theory of longest common prefixes. 

64389  1084 

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

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

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

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

1090 
"prime_nat_iff". INCOMPATIBILITY. 

1091 

1092 
* Session Old_Number_Theory has been removed, after porting remaining 

1093 
theories. 

1094 

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

1097 

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

1098 

62498  1099 
*** ML *** 
1100 

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

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

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

1105 
INCOMPATIBILITY. 

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

1106 

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

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

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

1114 

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

1117 

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

1119 
with approximative output quality. 

1120 

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

1122 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 

1123 

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

1126 
requiring separate files. 

1127 

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

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

1131 
debugger information requires consirable time and space: main 

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

1133 

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

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

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

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

1139 
balanced blocks of Local_Theory.open_target versus 

1140 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

1141 

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

1144 
INCOMPATIBILITY. 

1145 

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

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

1149 
File.full_path). Potential INCOMPATIBILITY. 

1150 

63352  1151 
* Binding.empty_atts supersedes Thm.empty_binding and 
1152 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

1153 

62498  1154 

62354  1155 
*** System *** 
1156 

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

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

1160 
much less disk space. 

63226  1161 

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

1164 
particular: 

1165 

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

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

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

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

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

1170 

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

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

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

1174 

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

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

1176 
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

1177 
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

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

1179 

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

1182 
servers with separate CPU/memory modules. 

1183 

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

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

64274  1186 
unless there is already a default provided via ML_OPTIONS settings. 
1187 

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

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

1189 
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

1190 
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

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

1192 

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

1196 
resulting log files. 

64308  1197 

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

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

1199 
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

1200 
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

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

1202 

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

1205 

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

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

1208 
Isabelle/ML or Isabelle/Scala. 

1209 

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

1211 
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64, 

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

1213 
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been 

1214 
discontinued. Potential INCOMPATIBILITY. 

1215 

1216 
* The Isabelle system environment always ensures that the main 

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

1218 
"isabelle_scala_script". 

1219 

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

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

1222 
Isabelle_Tool.Body. 

1223 

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

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

1226 
produce robust shell scripts under program control, without worrying 

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

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

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

1230 
been discontinued. 

1231 

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

1234 
but without the Isabelle settings environment. 

1235 

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

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

1239 
that Path specifications need to be resolved remotely via 

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

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

1242 

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

1244 
regular hg commandline interface. The repositroy clone and working 

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

1246 
connection). 

64265  1247 

62354  1248 

1249 

62031  1250 
New in Isabelle2016 (February 2016) 
62016  1251 
 
60138  1252 

61337  1253 
*** General *** 
1254 

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

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

1256 
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

1257 
~~/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

1258 
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

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

1260 

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

1263 

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

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

1267 
has been removed (see below). 

1268 

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

62017  1271 

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

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

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

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

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

1276 

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

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

1278 
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

1279 
\<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

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

1281 

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

1284 
to update old sources. 

1285 

61337  1286 
* Toplevel theorem statements have been simplified as follows: 
1287 

1288 
theorems ~> lemmas 

1289 
schematic_lemma ~> schematic_goal 

1290 
schematic_theorem ~> schematic_goal 

1291 
schematic_corollary ~> schematic_goal 

1292 

1293 
Commandline tool "isabelle update_theorems" updates theory sources 

1294 
accordingly. 

1295 

61338  1296 
* Toplevel theorem statement 'proposition' is another alias for 
1297 
'theorem'. 

1298 

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

1301 
deferred definitions require a surrounding 'overloading' block. 

1302 

61337  1303 

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

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

1305 

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

1309 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

1313 
any effect on the running ML program. 

60984  1314 

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

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

1318 
update. 

61729  1319 

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

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

1322 
enable option "editor_output_state". 

61215  1323 

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

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

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

1328 
visibility. 

1329 

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

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

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

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

1334 
panel. 

1335 

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

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

1337 
state output, interactive queries) wrt. longrunning background tasks. 
62017  1338 

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

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

1341 
implicit: a popup will show up unconditionally. 

1342 

1343 
* Additional abbreviations for syntactic completion may be specified in 

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

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

1346 

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

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

1348 
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

1349 
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

1350 
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

1351 

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

1354 
the editor. 

1355 

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

1357 
instead of former C+e LEFT. 

1358 

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

1359 
* The commandline tool "isabelle jedit" and the isabelle.Main 
62027  1360 
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

1361 
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

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

1363 

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

1366 
singleinstance applications seen on common GUI desktops. 

1367 

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

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

1369 
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

1370 
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

1371 

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

1374 

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

1377 

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

1378 

61405  1379 
*** Document preparation *** 
1380 

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

1383 

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

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

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

1387 

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

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

1390 
follows: 

1391 

1392 
\<^item> itemize 

1393 
\<^enum> enumerate 

1394 
\<^descr> description 

1395 

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

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

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

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

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

1402 

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

1405 
standard LaTeX macros of the same names. 

1406 

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

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

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

1411 
cartouche tokens seen in theory sources. 

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

1412 

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

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

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

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

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

1418 

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

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

1422 

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

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

1425 

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

1427 

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

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

1429 
(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

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

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

038ee85c95e4
misc tuning for release;
wenzelm
