summary |
shortlog |
changelog |
graph |
tags |
branches |
files |
changeset |
file |
revisions |
annotate |
diff |
raw

NEWS

author | blanchet |

Tue Mar 22 12:39:37 2016 +0100 (2016-03-22) | |

changeset 62695 | b287b56a6ce5 |

parent 62693 | 0ae225877b68 |

child 62789 | ce15dd971965 |

permissions | -rw-r--r-- |

file header

1 Isabelle NEWS -- history of user-relevant changes

2 =================================================

4 (Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.)

7 New in this Isabelle version

8 ----------------------------

10 *** General ***

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

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

15 Isabelle2015).

18 *** Isar ***

20 * Command '\<proof>' is an alias for 'sorry', with different

21 typesetting. E.g. to produce proof holes in examples and documentation.

24 *** HOL ***

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

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

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

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

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

33 eliminated altogether.

35 * (Co)datatype package:

36 - New commands for defining corecursive functions and reasoning about

37 them in "~~/src/HOL/Library/BNF_Corec.thy": 'corec', 'corecursive',

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

39 method.

40 - The predicator :: ('a => bool) => 'a F => bool is now a first-class

41 citizen in bounded natural functors

42 - 'primrec' now allows nested calls through the predicator in addition

43 to the map function.

44 - 'bnf' automatically discharges reflexive proof obligations

45 - 'bnf' outputs a slightly modified proof obligation expressing rel in

46 terms of map and set

47 (not giving a specification for rel makes this one reflexive)

48 - 'bnf' outputs a new proof obligation expressing pred in terms of set

49 (not giving a specification for pred makes this one reflexive)

50 INCOMPATIBILITY: manual 'bnf' declarations may need adjustment

51 - Renamed lemmas:

52 rel_prod_apply ~> rel_prod_inject

53 pred_prod_apply ~> pred_prod_inject

54 INCOMPATIBILITY.

55 - The "size" plugin has been made compatible again with locales.

57 * Renamed split_if -> if_split and split_if_asm -> if_split_asm to

58 resemble the f.split naming convention, INCOMPATIBILITY.

60 * Characters (type char) are modelled as finite algebraic type

61 corresponding to {0..255}.

63 - Logical representation:

64 * 0 is instantiated to the ASCII zero character.

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

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

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

68 are non-canonical.

69 - Printing and parsing:

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

71 (as before).

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

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

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

75 is parsable for every numeral expression n.

76 * Non-canonical characters have no special syntax and are

77 printed as their logical representation.

78 - Explicit conversions from and to the natural numbers are

79 provided as char_of_nat, nat_of_char (as before).

80 - The auxiliary nibble type has been discontinued.

82 INCOMPATIBILITY.

84 * Multiset membership is now expressed using set_mset rather than count.

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

87 by default.

89 - Converting between "count M a = 0" and non-membership happens using

90 equations count_eq_zero_iff and not_in_iff.

92 - Rules count_inI and in_countE obtain facts of the form

93 "count M a = n" from membership.

95 - Rules count_in_diffI and in_diff_countE obtain facts of the form

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

98 INCOMPATIBILITY.

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

101 INCOMPATIBILITY.

103 * More complex analysis including Cauchy's inequality, Liouville theorem,

104 open mapping theorem, maximum modulus principle, Schwarz Lemma.

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

107 comprehension-like syntax analogously to "Inf (f ` A)" and "Sup (f ` A)".

109 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.

111 * The type class ordered_comm_monoid_add is now called

112 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add is

113 introduced as the combination of ordered_ab_semigroup_add + comm_monoid_add.

114 INCOMPATIBILITY.

116 * Introduced the type classes canonically_ordered_comm_monoid_add and dioid.

118 * Added topological_monoid

120 * Library/Complete_Partial_Order2.thy provides reasoning support for

121 proofs about monotonicity and continuity in chain-complete partial

122 orders and about admissibility conditions for fixpoint inductions.

124 * Library/Polynomial.thy contains also derivation of polynomials

125 but not gcd/lcm on polynomials over fields. This has been moved

126 to a separate theory Library/Polynomial_GCD_euclidean.thy, to

127 pave way for a possible future different type class instantiation

128 for polynomials over factorial rings. INCOMPATIBILITY.

130 * Dropped various legacy fact bindings, whose replacements are often

131 of a more general type also:

132 lcm_left_commute_nat ~> lcm.left_commute

133 lcm_left_commute_int ~> lcm.left_commute

134 gcd_left_commute_nat ~> gcd.left_commute

135 gcd_left_commute_int ~> gcd.left_commute

136 gcd_greatest_iff_nat ~> gcd_greatest_iff

137 gcd_greatest_iff_int ~> gcd_greatest_iff

138 coprime_dvd_mult_nat ~> coprime_dvd_mult

139 coprime_dvd_mult_int ~> coprime_dvd_mult

140 zpower_numeral_even ~> power_numeral_even

141 gcd_mult_cancel_nat ~> gcd_mult_cancel

142 gcd_mult_cancel_int ~> gcd_mult_cancel

143 div_gcd_coprime_nat ~> div_gcd_coprime

144 div_gcd_coprime_int ~> div_gcd_coprime

145 zpower_numeral_odd ~> power_numeral_odd

146 zero_less_int_conv ~> of_nat_0_less_iff

147 gcd_greatest_nat ~> gcd_greatest

148 gcd_greatest_int ~> gcd_greatest

149 coprime_mult_nat ~> coprime_mult

150 coprime_mult_int ~> coprime_mult

151 lcm_commute_nat ~> lcm.commute

152 lcm_commute_int ~> lcm.commute

153 int_less_0_conv ~> of_nat_less_0_iff

154 gcd_commute_nat ~> gcd.commute

155 gcd_commute_int ~> gcd.commute

156 Gcd_insert_nat ~> Gcd_insert

157 Gcd_insert_int ~> Gcd_insert

158 of_int_int_eq ~> of_int_of_nat_eq

159 lcm_least_nat ~> lcm_least

160 lcm_least_int ~> lcm_least

161 lcm_assoc_nat ~> lcm.assoc

162 lcm_assoc_int ~> lcm.assoc

163 int_le_0_conv ~> of_nat_le_0_iff

164 int_eq_0_conv ~> of_nat_eq_0_iff

165 Gcd_empty_nat ~> Gcd_empty

166 Gcd_empty_int ~> Gcd_empty

167 gcd_assoc_nat ~> gcd.assoc

168 gcd_assoc_int ~> gcd.assoc

169 zero_zle_int ~> of_nat_0_le_iff

170 lcm_dvd2_nat ~> dvd_lcm2

171 lcm_dvd2_int ~> dvd_lcm2

172 lcm_dvd1_nat ~> dvd_lcm1

173 lcm_dvd1_int ~> dvd_lcm1

174 gcd_zero_nat ~> gcd_eq_0_iff

175 gcd_zero_int ~> gcd_eq_0_iff

176 gcd_dvd2_nat ~> gcd_dvd2

177 gcd_dvd2_int ~> gcd_dvd2

178 gcd_dvd1_nat ~> gcd_dvd1

179 gcd_dvd1_int ~> gcd_dvd1

180 int_numeral ~> of_nat_numeral

181 lcm_ac_nat ~> ac_simps

182 lcm_ac_int ~> ac_simps

183 gcd_ac_nat ~> ac_simps

184 gcd_ac_int ~> ac_simps

185 abs_int_eq ~> abs_of_nat

186 zless_int ~> of_nat_less_iff

187 zdiff_int ~> of_nat_diff

188 zadd_int ~> of_nat_add

189 int_mult ~> of_nat_mult

190 int_Suc ~> of_nat_Suc

191 inj_int ~> inj_of_nat

192 int_1 ~> of_nat_1

193 int_0 ~> of_nat_0

194 Lcm_empty_nat ~> Lcm_empty

195 Lcm_empty_int ~> Lcm_empty

196 Lcm_insert_nat ~> Lcm_insert

197 Lcm_insert_int ~> Lcm_insert

198 comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd

199 comp_fun_idem_gcd_int ~> comp_fun_idem_gcd

200 comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm

201 comp_fun_idem_lcm_int ~> comp_fun_idem_lcm

202 Lcm_eq_0 ~> Lcm_eq_0_I

203 Lcm0_iff ~> Lcm_0_iff

204 Lcm_dvd_int ~> Lcm_least

205 divides_mult_nat ~> divides_mult

206 divides_mult_int ~> divides_mult

207 lcm_0_nat ~> lcm_0_right

208 lcm_0_int ~> lcm_0_right

209 lcm_0_left_nat ~> lcm_0_left

210 lcm_0_left_int ~> lcm_0_left

211 dvd_gcd_D1_nat ~> dvd_gcdD1

212 dvd_gcd_D1_int ~> dvd_gcdD1

213 dvd_gcd_D2_nat ~> dvd_gcdD2

214 dvd_gcd_D2_int ~> dvd_gcdD2

215 coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff

216 coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff

217 realpow_minus_mult ~> power_minus_mult

218 realpow_Suc_le_self ~> power_Suc_le_self

219 dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest

220 INCOMPATIBILITY.

222 * Session HOL-NSA has been renamed to HOL-Nonstandard_Analysis.

225 *** ML ***

227 * Antiquotation @{make_string} is available during Pure bootstrap --

228 with approximative output quality.

230 * Option ML_exception_debugger controls detailed exception trace via the

231 Poly/ML debugger. Relevant ML modules need to be compiled beforehand

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

233 debugger information requires consirable time and space: main

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

236 * Local_Theory.restore has been renamed to Local_Theory.reset to

237 emphasize its disruptive impact on the cumulative context, notably the

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

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

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

241 balanced blocks of Local_Theory.open_target versus

242 Local_Theory.close_target instead. Rare INCOMPATIBILITY.

244 * Structure TimeLimit (originally from the SML/NJ library) has been

245 replaced by structure Timeout, with slightly different signature.

246 INCOMPATIBILITY.

248 * Discontinued cd and pwd operations, which are not well-defined in a

249 multi-threaded environment. Note that files are usually located

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

251 File.full_path). Potential INCOMPATIBILITY.

254 *** System ***

256 * The Isabelle system environment always ensures that the main

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

258 "isabelle_scala_script".

260 * The Isabelle ML process is now managed directly by Isabelle/Scala, and

261 shell scripts merely provide optional command-line access. In

262 particular:

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

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

266 . command-line tool "isabelle console" as interactive wrapper;

267 . command-line tool "isabelle process" as batch mode wrapper.

269 * The executable "isabelle_process" has been discontinued. Tools and

270 prover front-ends should use ML_Process or Isabelle_Process in

271 Isabelle/Scala. INCOMPATIBILITY.

273 * New command-line tool "isabelle process" supports ML evaluation of

274 literal expressions (option -e) or files (option -f) in the context of a

275 given heap image. Errors lead to premature exit of the ML process with

276 return code 1.

278 * Command-line tool "isabelle console" provides option -r to help to

279 bootstrapping Isabelle/Pure interactively.

281 * Command-line tool "isabelle yxml" has been discontinued.

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

283 Isabelle/ML or Isabelle/Scala.

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

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

287 produce robust shell scripts under program control, without worrying

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

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

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

291 been discontinued.

293 * SML/NJ and old versions of Poly/ML are no longer supported.

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

296 much less disk space.

300 New in Isabelle2016 (February 2016)

301 -----------------------------------

303 *** General ***

305 * Eisbach is now based on Pure instead of HOL. Objects-logics may import

306 either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or

307 ~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that

308 the HOL-Eisbach session located in ~~/src/HOL/Eisbach/ contains further

309 examples that do require HOL.

311 * Better resource usage on all platforms (Linux, Windows, Mac OS X) for

312 both Isabelle/ML and Isabelle/Scala. Slightly reduced heap space usage.

314 * Former "xsymbols" syntax with Isabelle symbols is used by default,

315 without any special print mode. Important ASCII replacement syntax

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

317 has been removed (see below).

319 * Support for more arrow symbols, with rendering in LaTeX and Isabelle

320 fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>.

322 * Special notation \<struct> for the first implicit 'structure' in the

323 context has been discontinued. Rare INCOMPATIBILITY, use explicit

324 structure name instead, notably in indexed notation with block-subscript

325 (e.g. \<odot>\<^bsub>A\<^esub>).

327 * The glyph for \<diamond> in the IsabelleText font now corresponds better to its

328 counterpart \<box> as quantifier-like symbol. A small diamond is available as

329 \<diamondop>; the old symbol \<struct> loses this rendering and any special

330 meaning.

332 * Syntax for formal comments "-- text" now also supports the symbolic

333 form "\<comment> text". Command-line tool "isabelle update_cartouches -c" helps

334 to update old sources.

336 * Toplevel theorem statements have been simplified as follows:

338 theorems ~> lemmas

339 schematic_lemma ~> schematic_goal

340 schematic_theorem ~> schematic_goal

341 schematic_corollary ~> schematic_goal

343 Command-line tool "isabelle update_theorems" updates theory sources

344 accordingly.

346 * Toplevel theorem statement 'proposition' is another alias for

347 'theorem'.

349 * The old 'defs' command has been removed (legacy since Isabelle2014).

350 INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or

351 deferred definitions require a surrounding 'overloading' block.

354 *** Prover IDE -- Isabelle/Scala/jEdit ***

356 * IDE support for the source-level debugger of Poly/ML, to work with

357 Isabelle/ML and official Standard ML. Option "ML_debugger" and commands

358 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

359 'SML_file_no_debug' control compilation of sources with or without

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

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

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

363 any effect on the running ML program.

365 * The State panel manages explicit proof state output, with dynamic

366 auto-update according to cursor movement. Alternatively, the jEdit

367 action "isabelle.update-state" (shortcut S+ENTER) triggers manual

368 update.

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

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

372 enable option "editor_output_state".

374 * The text overview column (status of errors, warnings etc.) is updated

375 asynchronously, leading to much better editor reactivity. Moreover, the

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

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

378 visibility.

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

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

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

383 due to ad-hoc updates by auxiliary GUI components, such as the State

384 panel.

386 * Slightly improved scheduling for urgent print tasks (e.g. command

387 state output, interactive queries) wrt. long-running background tasks.

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

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

391 implicit: a popup will show up unconditionally.

393 * Additional abbreviations for syntactic completion may be specified in

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

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

397 * Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for

398 completion like "+o", "*o", ".o" etc. -- due to conflicts with other

399 ASCII syntax. INCOMPATIBILITY, use plain backslash-completion or define

400 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.

402 * Action "isabelle-emph" (with keyboard shortcut C+e LEFT) controls

403 emphasized text style; the effect is visible in document output, not in

404 the editor.

406 * Action "isabelle-reset" now uses keyboard shortcut C+e BACK_SPACE,

407 instead of former C+e LEFT.

409 * The command-line tool "isabelle jedit" and the isabelle.Main

410 application wrapper treat the default $USER_HOME/Scratch.thy more

411 uniformly, and allow the dummy file argument ":" to open an empty buffer

412 instead.

414 * New command-line tool "isabelle jedit_client" allows to connect to an

415 already running Isabelle/jEdit process. This achieves the effect of

416 single-instance applications seen on common GUI desktops.

418 * The default look-and-feel for Linux is the traditional "Metal", which

419 works better with GUI scaling for very high-resolution displays (e.g.

420 4K). Moreover, it is generally more robust than "Nimbus".

422 * Update to jedit-5.3.0, with improved GUI scaling and support of

423 high-resolution displays (e.g. 4K).

425 * The main Isabelle executable is managed as single-instance Desktop

426 application uniformly on all platforms: Linux, Windows, Mac OS X.

429 *** Document preparation ***

431 * Commands 'paragraph' and 'subparagraph' provide additional section

432 headings. Thus there are 6 levels of standard headings, as in HTML.

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

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

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

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

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

440 follows:

442 \<^item> itemize

443 \<^enum> enumerate

444 \<^descr> description

446 * There is a new short form for antiquotations with a single argument

447 that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and

448 \<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}.

449 \<^name> without following cartouche is equivalent to @{name}. The

450 standard Isabelle fonts provide glyphs to render important control

451 symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>".

453 * Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with

454 corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using

455 standard LaTeX macros of the same names.

457 * Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}.

458 Consequently, \<open>...\<close> without any decoration prints literal quasi-formal

459 text. Command-line tool "isabelle update_cartouches -t" helps to update

460 old sources, by approximative patching of the content of string and

461 cartouche tokens seen in theory sources.

463 * The @{text} antiquotation now ignores the antiquotation option

464 "source". The given text content is output unconditionally, without any

465 surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the

466 argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial

467 or terminal spaces are ignored.

469 * Antiquotations @{emph} and @{bold} output LaTeX source recursively,

470 adding appropriate text style markup. These may be used in the short

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

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

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

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

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

479 (Isar outer syntax with command keywords etc.). This may be used in the

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

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

483 documentation, with a hyperlink in the Prover IDE.

485 * Antiquotations @{command}, @{method}, @{attribute} print checked

486 entities of the Isar language.

488 * HTML presentation uses the standard IsabelleText font and Unicode

489 rendering of Isabelle symbols like Isabelle/Scala/jEdit. The former

490 print mode "HTML" loses its special meaning.

493 *** Isar ***

495 * Local goals ('have', 'show', 'hence', 'thus') allow structured rule

496 statements like fixes/assumes/shows in theorem specifications, but the

497 notation is postfix with keywords 'if' (or 'when') and 'for'. For

498 example:

500 have result: "C x y"

501 if "A x" and "B y"

502 for x :: 'a and y :: 'a

503 <proof>

505 The local assumptions are bound to the name "that". The result is

506 exported from context of the statement as usual. The above roughly

507 corresponds to a raw proof block like this:

509 {

510 fix x :: 'a and y :: 'a

511 assume that: "A x" "B y"

512 have "C x y" <proof>

513 }

514 note result = this

516 The keyword 'when' may be used instead of 'if', to indicate 'presume'

517 instead of 'assume' above.

519 * Assumptions ('assume', 'presume') allow structured rule statements

520 using 'if' and 'for', similar to 'have' etc. above. For example:

522 assume result: "C x y"

523 if "A x" and "B y"

524 for x :: 'a and y :: 'a

526 This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general

527 result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y".

529 Vacuous quantification in assumptions is omitted, i.e. a for-context

530 only effects propositions according to actual use of variables. For

531 example:

533 assume "A x" and "B y" for x and y

535 is equivalent to:

537 assume "\<And>x. A x" and "\<And>y. B y"

539 * The meaning of 'show' with Pure rule statements has changed: premises

540 are treated in the sense of 'assume', instead of 'presume'. This means,

541 a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as

542 follows:

544 show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"

546 or:

548 show "C x" if "A x" "B x" for x

550 Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:

552 show "C x" when "A x" "B x" for x

554 * New command 'consider' states rules for generalized elimination and

555 case splitting. This is like a toplevel statement "theorem obtains" used

556 within a proof body; or like a multi-branch 'obtain' without activation

557 of the local context elements yet.

559 * Proof method "cases" allows to specify the rule as first entry of

560 chained facts. This is particularly useful with 'consider':

562 consider (a) A | (b) B | (c) C <proof>

563 then have something

564 proof cases

565 case a

566 then show ?thesis <proof>

567 next

568 case b

569 then show ?thesis <proof>

570 next

571 case c

572 then show ?thesis <proof>

573 qed

575 * Command 'case' allows fact name and attribute specification like this:

577 case a: (c xs)

578 case a [attributes]: (c xs)

580 Facts that are introduced by invoking the case context are uniformly

581 qualified by "a"; the same name is used for the cumulative fact. The old

582 form "case (c xs) [attributes]" is no longer supported. Rare

583 INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,

584 and always put attributes in front.

586 * The standard proof method of commands 'proof' and '..' is now called

587 "standard" to make semantically clear what it is; the old name "default"

588 is still available as legacy for some time. Documentation now explains

589 '..' more accurately as "by standard" instead of "by rule".

591 * Nesting of Isar goal structure has been clarified: the context after

592 the initial backwards refinement is retained for the whole proof, within

593 all its context sections (as indicated via 'next'). This is e.g.

594 relevant for 'using', 'including', 'supply':

596 have "A \<and> A" if a: A for A

597 supply [simp] = a

598 proof

599 show A by simp

600 next

601 show A by simp

602 qed

604 * Command 'obtain' binds term abbreviations (via 'is' patterns) in the

605 proof body as well, abstracted over relevant parameters.

607 * Improved type-inference for theorem statement 'obtains': separate

608 parameter scope for of each clause.

610 * Term abbreviations via 'is' patterns also work for schematic

611 statements: result is abstracted over unknowns.

613 * Command 'subgoal' allows to impose some structure on backward

614 refinements, to avoid proof scripts degenerating into long of 'apply'

615 sequences. Further explanations and examples are given in the isar-ref

616 manual.

618 * Command 'supply' supports fact definitions during goal refinement

619 ('apply' scripts).

621 * Proof method "goal_cases" turns the current subgoals into cases within

622 the context; the conclusion is bound to variable ?case in each case. For

623 example:

625 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"

626 and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"

627 proof goal_cases

628 case (1 x)

629 then show ?case using \<open>A x\<close> \<open>B x\<close> sorry

630 next

631 case (2 y z)

632 then show ?case using \<open>U y\<close> \<open>V z\<close> sorry

633 qed

635 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"

636 and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"

637 proof goal_cases

638 case prems: 1

639 then show ?case using prems sorry

640 next

641 case prems: 2

642 then show ?case using prems sorry

643 qed

645 * The undocumented feature of implicit cases goal1, goal2, goal3, etc.

646 is marked as legacy, and will be removed eventually. The proof method

647 "goals" achieves a similar effect within regular Isar; often it can be

648 done more adequately by other means (e.g. 'consider').

650 * The vacuous fact "TERM x" may be established "by fact" or as `TERM x`

651 as well, not just "by this" or "." as before.

653 * Method "sleep" succeeds after a real-time delay (in seconds). This is

654 occasionally useful for demonstration and testing purposes.

657 *** Pure ***

659 * Qualifiers in locale expressions default to mandatory ('!') regardless

660 of the command. Previously, for 'locale' and 'sublocale' the default was

661 optional ('?'). The old synatx '!' has been discontinued.

662 INCOMPATIBILITY, remove '!' and add '?' as required.

664 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

665 commands. Previously, the keyword was 'where'. INCOMPATIBILITY.

667 * More gentle suppression of syntax along locale morphisms while

668 printing terms. Previously 'abbreviation' and 'notation' declarations

669 would be suppressed for morphisms except term identity. Now

670 'abbreviation' is also kept for morphims that only change the involved

671 parameters, and only 'notation' is suppressed. This can be of great help

672 when working with complex locale hierarchies, because proof states are

673 displayed much more succinctly. It also means that only notation needs

674 to be redeclared if desired, as illustrated by this example:

676 locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65)

677 begin

678 definition derived (infixl "\<odot>" 65) where ...

679 end

681 locale morphism =

682 left: struct composition + right: struct composition'

683 for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65)

684 begin

685 notation right.derived ("\<odot>''")

686 end

688 * Command 'global_interpretation' issues interpretations into global

689 theories, with optional rewrite definitions following keyword 'defines'.

691 * Command 'sublocale' accepts optional rewrite definitions after keyword

692 'defines'.

694 * Command 'permanent_interpretation' has been discontinued. Use

695 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

697 * Command 'print_definitions' prints dependencies of definitional

698 specifications. This functionality used to be part of 'print_theory'.

700 * Configuration option rule_insts_schematic has been discontinued

701 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

703 * Abbreviations in type classes now carry proper sort constraint. Rare

704 INCOMPATIBILITY in situations where the previous misbehaviour has been

705 exploited.

707 * Refinement of user-space type system in type classes: pseudo-local

708 operations behave more similar to abbreviations. Potential

709 INCOMPATIBILITY in exotic situations.

712 *** HOL ***

714 * The 'typedef' command has been upgraded from a partially checked

715 "axiomatization", to a full definitional specification that takes the

716 global collection of overloaded constant / type definitions into

717 account. Type definitions with open dependencies on overloaded

718 definitions need to be specified as "typedef (overloaded)". This

719 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

721 * Qualification of various formal entities in the libraries is done more

722 uniformly via "context begin qualified definition ... end" instead of

723 old-style "hide_const (open) ...". Consequently, both the defined

724 constant and its defining fact become qualified, e.g. Option.is_none and

725 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

727 * Some old and rarely used ASCII replacement syntax has been removed.

728 INCOMPATIBILITY, standard syntax with symbols should be used instead.

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

730 simplify porting old theories:

732 notation iff (infixr "<->" 25)

734 notation Times (infixr "<*>" 80)

736 type_notation Map.map (infixr "~=>" 0)

737 notation Map.map_comp (infixl "o'_m" 55)

739 type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21)

741 notation FuncSet.funcset (infixr "->" 60)

742 notation FuncSet.extensional_funcset (infixr "->\<^sub>E" 60)

744 notation Omega_Words_Fun.conc (infixr "conc" 65)

746 notation Preorder.equiv ("op ~~")

747 and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50)

749 notation (in topological_space) tendsto (infixr "--->" 55)

750 notation (in topological_space) LIMSEQ ("((_)/ ----> (_))" [60, 60] 60)

751 notation LIM ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)

753 notation NSA.approx (infixl "@=" 50)

754 notation NSLIMSEQ ("((_)/ ----NS> (_))" [60, 60] 60)

755 notation NSLIM ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)

757 * The alternative notation "\<Colon>" for type and sort constraints has been

758 removed: in LaTeX document output it looks the same as "::".

759 INCOMPATIBILITY, use plain "::" instead.

761 * Commands 'inductive' and 'inductive_set' work better when names for

762 intro rules are omitted: the "cases" and "induct" rules no longer

763 declare empty case_names, but no case_names at all. This allows to use

764 numbered cases in proofs, without requiring method "goal_cases".

766 * Inductive definitions ('inductive', 'coinductive', etc.) expose

767 low-level facts of the internal construction only if the option

768 "inductive_internals" is enabled. This refers to the internal predicate

769 definition and its monotonicity result. Rare INCOMPATIBILITY.

771 * Recursive function definitions ('fun', 'function', 'partial_function')

772 expose low-level facts of the internal construction only if the option

773 "function_internals" is enabled. Its internal inductive definition is

774 also subject to "inductive_internals". Rare INCOMPATIBILITY.

776 * BNF datatypes ('datatype', 'codatatype', etc.) expose low-level facts

777 of the internal construction only if the option "bnf_internals" is

778 enabled. This supersedes the former option "bnf_note_all". Rare

779 INCOMPATIBILITY.

781 * Combinator to represent case distinction on products is named

782 "case_prod", uniformly, discontinuing any input aliasses. Very popular

783 theorem aliasses have been retained.

785 Consolidated facts:

786 PairE ~> prod.exhaust

787 Pair_eq ~> prod.inject

788 pair_collapse ~> prod.collapse

789 Pair_fst_snd_eq ~> prod_eq_iff

790 split_twice ~> prod.case_distrib

791 split_weak_cong ~> prod.case_cong_weak

792 split_split ~> prod.split

793 split_split_asm ~> prod.split_asm

794 splitI ~> case_prodI

795 splitD ~> case_prodD

796 splitI2 ~> case_prodI2

797 splitI2' ~> case_prodI2'

798 splitE ~> case_prodE

799 splitE' ~> case_prodE'

800 split_pair ~> case_prod_Pair

801 split_eta ~> case_prod_eta

802 split_comp ~> case_prod_comp

803 mem_splitI ~> mem_case_prodI

804 mem_splitI2 ~> mem_case_prodI2

805 mem_splitE ~> mem_case_prodE

806 The_split ~> The_case_prod

807 cond_split_eta ~> cond_case_prod_eta

808 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

809 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

810 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

811 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

812 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

813 Domain_Collect_split ~> Domain_Collect_case_prod

814 Image_Collect_split ~> Image_Collect_case_prod

815 Range_Collect_split ~> Range_Collect_case_prod

816 Eps_split ~> Eps_case_prod

817 Eps_split_eq ~> Eps_case_prod_eq

818 split_rsp ~> case_prod_rsp

819 curry_split ~> curry_case_prod

820 split_curry ~> case_prod_curry

822 Changes in structure HOLogic:

823 split_const ~> case_prod_const

824 mk_split ~> mk_case_prod

825 mk_psplits ~> mk_ptupleabs

826 strip_psplits ~> strip_ptupleabs

828 INCOMPATIBILITY.

830 * The coercions to type 'real' have been reorganised. The function

831 'real' is no longer overloaded, but has type 'nat => real' and

832 abbreviates of_nat for that type. Also 'real_of_int :: int => real'

833 abbreviates of_int for that type. Other overloaded instances of 'real'

834 have been replaced by 'real_of_ereal' and 'real_of_float'.

836 Consolidated facts (among others):

837 real_of_nat_le_iff -> of_nat_le_iff

838 real_of_nat_numeral of_nat_numeral

839 real_of_int_zero of_int_0

840 real_of_nat_zero of_nat_0

841 real_of_one of_int_1

842 real_of_int_add of_int_add

843 real_of_nat_add of_nat_add

844 real_of_int_diff of_int_diff

845 real_of_nat_diff of_nat_diff

846 floor_subtract floor_diff_of_int

847 real_of_int_inject of_int_eq_iff

848 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

849 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

850 real_of_nat_ge_zero of_nat_0_le_iff

851 real_of_int_ceiling_ge le_of_int_ceiling

852 ceiling_less_eq ceiling_less_iff

853 ceiling_le_eq ceiling_le_iff

854 less_floor_eq less_floor_iff

855 floor_less_eq floor_less_iff

856 floor_divide_eq_div floor_divide_of_int_eq

857 real_of_int_zero_cancel of_nat_eq_0_iff

858 ceiling_real_of_int ceiling_of_int

860 INCOMPATIBILITY.

862 * Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has

863 been removed. INCOMPATIBILITY.

865 * Quickcheck setup for finite sets.

867 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

869 * Sledgehammer:

870 - The MaSh relevance filter has been sped up.

871 - Proof reconstruction has been improved, to minimize the incidence of

872 cases where Sledgehammer gives a proof that does not work.

873 - Auto Sledgehammer now minimizes and preplays the results.

874 - Handle Vampire 4.0 proof output without raising exception.

875 - Eliminated "MASH" environment variable. Use the "MaSh" option in

876 Isabelle/jEdit instead. INCOMPATIBILITY.

877 - Eliminated obsolete "blocking" option and related subcommands.

879 * Nitpick:

880 - Fixed soundness bug in translation of "finite" predicate.

881 - Fixed soundness bug in "destroy_constrs" optimization.

882 - Fixed soundness bug in translation of "rat" type.

883 - Removed "check_potential" and "check_genuine" options.

884 - Eliminated obsolete "blocking" option.

886 * (Co)datatype package:

887 - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF

888 structure on the raw type to an abstract type defined using typedef.

889 - Always generate "case_transfer" theorem.

890 - For mutual types, generate slightly stronger "rel_induct",

891 "rel_coinduct", and "coinduct" theorems. INCOMPATIBLITY.

892 - Allow discriminators and selectors with the same name as the type

893 being defined.

894 - Avoid various internal name clashes (e.g., 'datatype f = f').

896 * Transfer: new methods for interactive debugging of 'transfer' and

897 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

898 'transfer_prover_start' and 'transfer_prover_end'.

900 * New diagnostic command print_record for displaying record definitions.

902 * Division on integers is bootstrapped directly from division on

903 naturals and uses generic numeral algorithm for computations. Slight

904 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

905 simprocs binary_int_div and binary_int_mod

907 * Tightened specification of class semiring_no_zero_divisors. Minor

908 INCOMPATIBILITY.

910 * Class algebraic_semidom introduces common algebraic notions of

911 integral (semi)domains, particularly units. Although logically subsumed

912 by fields, is is not a super class of these in order not to burden

913 fields with notions that are trivial there.

915 * Class normalization_semidom specifies canonical representants for

916 equivalence classes of associated elements in an integral (semi)domain.

917 This formalizes associated elements as well.

919 * Abstract specification of gcd/lcm operations in classes semiring_gcd,

920 semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute

921 and gcd_int.commute are subsumed by gcd.commute, as well as

922 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

924 * Former constants Fields.divide (_ / _) and Divides.div (_ div _) are

925 logically unified to Rings.divide in syntactic type class Rings.divide,

926 with infix syntax (_ div _). Infix syntax (_ / _) for field division is

927 added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,

928 instantiations must refer to Rings.divide rather than the former

929 separate constants, hence infix syntax (_ / _) is usually not available

930 during instantiation.

932 * New cancellation simprocs for boolean algebras to cancel complementary

933 terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to

934 "top". INCOMPATIBILITY.

936 * Class uniform_space introduces uniform spaces btw topological spaces

937 and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be

938 introduced in the form of an uniformity. Some constants are more general

939 now, it may be necessary to add type class constraints.

941 open_real_def \<leadsto> open_dist

942 open_complex_def \<leadsto> open_dist

944 * Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.

946 * Library/Multiset:

947 - Renamed multiset inclusion operators:

948 < ~> <#

949 > ~> >#

950 <= ~> <=#

951 >= ~> >=#

952 \<le> ~> \<le>#

953 \<ge> ~> \<ge>#

954 INCOMPATIBILITY.

955 - Added multiset inclusion operator syntax:

956 \<subset>#

957 \<subseteq>#

958 \<supset>#

959 \<supseteq>#

960 - "'a multiset" is no longer an instance of the "order",

961 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

962 "semilattice_inf", and "semilattice_sup" type classes. The theorems

963 previously provided by these type classes (directly or indirectly)

964 are now available through the "subset_mset" interpretation

965 (e.g. add_mono ~> subset_mset.add_mono).

966 INCOMPATIBILITY.

967 - Renamed conversions:

968 multiset_of ~> mset

969 multiset_of_set ~> mset_set

970 set_of ~> set_mset

971 INCOMPATIBILITY

972 - Renamed lemmas:

973 mset_le_def ~> subseteq_mset_def

974 mset_less_def ~> subset_mset_def

975 less_eq_multiset.rep_eq ~> subseteq_mset_def

976 INCOMPATIBILITY

977 - Removed lemmas generated by lift_definition:

978 less_eq_multiset.abs_eq, less_eq_multiset.rsp,

979 less_eq_multiset.transfer, less_eq_multiset_def

980 INCOMPATIBILITY

982 * Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.

984 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

985 Bourbaki-Witt fixpoint theorem for increasing functions in

986 chain-complete partial orders.

988 * Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.

989 Minor INCOMPATIBILITY, use 'function' instead.

991 * Library/Periodic_Fun: a locale that provides convenient lemmas for

992 periodic functions.

994 * Library/Formal_Power_Series: proper definition of division (with

995 remainder) for formal power series; instances for Euclidean Ring and

996 GCD.

998 * HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.

1000 * HOL-Statespace: command 'statespace' uses mandatory qualifier for

1001 import of parent, as for general 'locale' expressions. INCOMPATIBILITY,

1002 remove '!' and add '?' as required.

1004 * HOL-Decision_Procs: The "approximation" method works with "powr"

1005 (exponentiation on real numbers) again.

1007 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

1008 integrals (= complex path integrals), Cauchy's integral theorem, winding

1009 numbers and Cauchy's integral formula, Liouville theorem, Fundamental

1010 Theorem of Algebra. Ported from HOL Light.

1012 * HOL-Multivariate_Analysis: topological concepts such as connected

1013 components, homotopic paths and the inside or outside of a set.

1015 * HOL-Multivariate_Analysis: radius of convergence of power series and

1016 various summability tests; Harmonic numbers and the Euler–Mascheroni

1017 constant; the Generalised Binomial Theorem; the complex and real

1018 Gamma/log-Gamma/Digamma/ Polygamma functions and their most important

1019 properties.

1021 * HOL-Probability: The central limit theorem based on Levy's uniqueness

1022 and continuity theorems, weak convergence, and characterisitc functions.

1024 * HOL-Data_Structures: new and growing session of standard data

1025 structures.

1028 *** ML ***

1030 * The following combinators for low-level profiling of the ML runtime

1031 system are available:

1033 profile_time (*CPU time*)

1034 profile_time_thread (*CPU time on this thread*)

1035 profile_allocations (*overall heap allocations*)

1037 * Antiquotation @{undefined} or \<^undefined> inlines (raise Match).

1039 * Antiquotation @{method NAME} inlines the (checked) name of the given

1040 Isar proof method.

1042 * Pretty printing of Poly/ML compiler output in Isabelle has been

1043 improved: proper treatment of break offsets and blocks with consistent

1044 breaks.

1046 * The auxiliary module Pure/display.ML has been eliminated. Its

1047 elementary thm print operations are now in Pure/more_thm.ML and thus

1048 called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.

1050 * Simproc programming interfaces have been simplified:

1051 Simplifier.make_simproc and Simplifier.define_simproc supersede various

1052 forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that

1053 term patterns for the left-hand sides are specified with implicitly

1054 fixed variables, like top-level theorem statements. INCOMPATIBILITY.

1056 * Instantiation rules have been re-organized as follows:

1058 Thm.instantiate (*low-level instantiation with named arguments*)

1059 Thm.instantiate' (*version with positional arguments*)

1061 Drule.infer_instantiate (*instantiation with type inference*)

1062 Drule.infer_instantiate' (*version with positional arguments*)

1064 The LHS only requires variable specifications, instead of full terms.

1065 Old cterm_instantiate is superseded by infer_instantiate.

1066 INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.

1068 * Old tactic shorthands atac, rtac, etac, dtac, ftac have been

1069 discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.

1070 instead (with proper context).

1072 * Thm.instantiate (and derivatives) no longer require the LHS of the

1073 instantiation to be certified: plain variables are given directly.

1075 * Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous

1076 quasi-bound variables (like the Simplifier), instead of accidentally

1077 named local fixes. This has the potential to improve stability of proof

1078 tools, but can also cause INCOMPATIBILITY for tools that don't observe

1079 the proof context discipline.

1081 * Isar proof methods are based on a slightly more general type

1082 context_tactic, which allows to change the proof context dynamically

1083 (e.g. to update cases) and indicate explicit Seq.Error results. Former

1084 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

1085 provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.

1088 *** System ***

1090 * Command-line tool "isabelle console" enables print mode "ASCII".

1092 * Command-line tool "isabelle update_then" expands old Isar command

1093 conflations:

1095 hence ~> then have

1096 thus ~> then show

1098 This syntax is more orthogonal and improves readability and

1099 maintainability of proofs.

1101 * Global session timeout is multiplied by timeout_scale factor. This

1102 allows to adjust large-scale tests (e.g. AFP) to overall hardware

1103 performance.

1105 * Property values in etc/symbols may contain spaces, if written with the

1106 replacement character "␣" (Unicode point 0x2324). For example:

1108 \<star> code: 0x0022c6 group: operator font: Deja␣Vu␣Sans␣Mono

1110 * Java runtime environment for x86_64-windows allows to use larger heap

1111 space.

1113 * Java runtime options are determined separately for 32bit vs. 64bit

1114 platforms as follows.

1116 - Isabelle desktop application: platform-specific files that are

1117 associated with the main app bundle

1119 - isabelle jedit: settings

1120 JEDIT_JAVA_SYSTEM_OPTIONS

1121 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

1123 - isabelle build: settings

1124 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

1126 * Bash shell function "jvmpath" has been renamed to "platform_path": it

1127 is relevant both for Poly/ML and JVM processes.

1129 * Poly/ML default platform architecture may be changed from 32bit to

1130 64bit via system option ML_system_64. A system restart (and rebuild) is

1131 required after change.

1133 * Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which

1134 both allow larger heap space than former x86-cygwin.

1136 * Heap images are 10-15% smaller due to less wasteful persistent theory

1137 content (using ML type theory_id instead of theory);

1141 New in Isabelle2015 (May 2015)

1142 ------------------------------

1144 *** General ***

1146 * Local theory specification commands may have a 'private' or

1147 'qualified' modifier to restrict name space accesses to the local scope,

1148 as provided by some "context begin ... end" block. For example:

1150 context

1151 begin

1153 private definition ...

1154 private lemma ...

1156 qualified definition ...

1157 qualified lemma ...

1159 lemma ...

1160 theorem ...

1162 end

1164 * Command 'experiment' opens an anonymous locale context with private

1165 naming policy.

1167 * Command 'notepad' requires proper nesting of begin/end and its proof

1168 structure in the body: 'oops' is no longer supported here. Minor

1169 INCOMPATIBILITY, use 'sorry' instead.

1171 * Command 'named_theorems' declares a dynamic fact within the context,

1172 together with an attribute to maintain the content incrementally. This

1173 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change

1174 of semantics due to external visual order vs. internal reverse order.

1176 * 'find_theorems': search patterns which are abstractions are

1177 schematically expanded before search. Search results match the naive

1178 expectation more closely, particularly wrt. abbreviations.

1179 INCOMPATIBILITY.

1181 * Commands 'method_setup' and 'attribute_setup' now work within a local

1182 theory context.

1184 * Outer syntax commands are managed authentically within the theory

1185 context, without implicit global state. Potential for accidental

1186 INCOMPATIBILITY, make sure that required theories are really imported.

1188 * Historical command-line terminator ";" is no longer accepted (and

1189 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle

1190 update_semicolons" to remove obsolete semicolons from old theory

1191 sources.

1193 * Structural composition of proof methods (meth1; meth2) in Isar

1194 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

1196 * The Eisbach proof method language allows to define new proof methods

1197 by combining existing ones with their usual syntax. The "match" proof

1198 method provides basic fact/term matching in addition to

1199 premise/conclusion matching through Subgoal.focus, and binds fact names

1200 from matches as well as term patterns within matches. The Isabelle

1201 documentation provides an entry "eisbach" for the Eisbach User Manual.

1202 Sources and various examples are in ~~/src/HOL/Eisbach/.

1205 *** Prover IDE -- Isabelle/Scala/jEdit ***

1207 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,

1208 the "sidekick" mode may be used for document structure.

1210 * Extended bracket matching based on Isar language structure. System

1211 option jedit_structure_limit determines maximum number of lines to scan

1212 in the buffer.

1214 * Support for BibTeX files: context menu, context-sensitive token

1215 marker, SideKick parser.

1217 * Document antiquotation @{cite} provides formal markup, which is

1218 interpreted semi-formally based on .bib files that happen to be open in

1219 the editor (hyperlinks, completion etc.).

1221 * Less waste of vertical space via negative line spacing (see Global

1222 Options / Text Area).

1224 * Improved graphview panel with optional output of PNG or PDF, for

1225 display of 'thy_deps', 'class_deps' etc.

1227 * The commands 'thy_deps' and 'class_deps' allow optional bounds to

1228 restrict the visualized hierarchy.

1230 * Improved scheduling for asynchronous print commands (e.g. provers

1231 managed by the Sledgehammer panel) wrt. ongoing document processing.

1234 *** Document preparation ***

1236 * Document markup commands 'chapter', 'section', 'subsection',

1237 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any

1238 context, even before the initial 'theory' command. Obsolete proof

1239 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been

1240 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'

1241 instead. The old 'header' command is still retained for some time, but

1242 should be replaced by 'chapter', 'section' etc. (using "isabelle

1243 update_header"). Minor INCOMPATIBILITY.

1245 * Official support for "tt" style variants, via \isatt{...} or

1246 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or

1247 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.

1248 as argument to other macros (such as footnotes).

1250 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"

1251 style.

1253 * Discontinued obsolete option "document_graph": session_graph.pdf is

1254 produced unconditionally for HTML browser_info and PDF-LaTeX document.

1256 * Diagnostic commands and document markup commands within a proof do not

1257 affect the command tag for output. Thus commands like 'thm' are subject

1258 to proof document structure, and no longer "stick out" accidentally.

1259 Commands 'text' and 'txt' merely differ in the LaTeX style, not their

1260 tags. Potential INCOMPATIBILITY in exotic situations.

1262 * System option "pretty_margin" is superseded by "thy_output_margin",

1263 which is also accessible via document antiquotation option "margin".

1264 Only the margin for document output may be changed, but not the global

1265 pretty printing: that is 76 for plain console output, and adapted

1266 dynamically in GUI front-ends. Implementations of document

1267 antiquotations need to observe the margin explicitly according to

1268 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

1270 * Specification of 'document_files' in the session ROOT file is

1271 mandatory for document preparation. The legacy mode with implicit

1272 copying of the document/ directory is no longer supported. Minor

1273 INCOMPATIBILITY.

1276 *** Pure ***

1278 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"

1279 etc.) allow an optional context of local variables ('for' declaration):

1280 these variables become schematic in the instantiated theorem; this

1281 behaviour is analogous to 'for' in attributes "where" and "of".

1282 Configuration option rule_insts_schematic (default false) controls use

1283 of schematic variables outside the context. Minor INCOMPATIBILITY,

1284 declare rule_insts_schematic = true temporarily and update to use local

1285 variable declarations or dummy patterns instead.

1287 * Explicit instantiation via attributes "where", "of", and proof methods

1288 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns

1289 ("_") that stand for anonymous local variables.

1291 * Generated schematic variables in standard format of exported facts are

1292 incremented to avoid material in the proof context. Rare

1293 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

1294 different index.

1296 * Lexical separation of signed and unsigned numerals: categories "num"

1297 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence

1298 of numeral signs, particularly in expressions involving infix syntax

1299 like "(- 1) ^ n".

1301 * Old inner token category "xnum" has been discontinued. Potential

1302 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"

1303 token category instead.

1306 *** HOL ***

1308 * New (co)datatype package:

1309 - The 'datatype_new' command has been renamed 'datatype'. The old

1310 command of that name is now called 'old_datatype' and is provided

1311 by "~~/src/HOL/Library/Old_Datatype.thy". See

1312 'isabelle doc datatypes' for information on porting.

1313 INCOMPATIBILITY.

1314 - Renamed theorems:

1315 disc_corec ~> corec_disc

1316 disc_corec_iff ~> corec_disc_iff

1317 disc_exclude ~> distinct_disc

1318 disc_exhaust ~> exhaust_disc

1319 disc_map_iff ~> map_disc_iff

1320 sel_corec ~> corec_sel

1321 sel_exhaust ~> exhaust_sel

1322 sel_map ~> map_sel

1323 sel_set ~> set_sel

1324 sel_split ~> split_sel

1325 sel_split_asm ~> split_sel_asm

1326 strong_coinduct ~> coinduct_strong

1327 weak_case_cong ~> case_cong_weak

1328 INCOMPATIBILITY.

1329 - The "no_code" option to "free_constructors", "datatype_new", and

1330 "codatatype" has been renamed "plugins del: code".

1331 INCOMPATIBILITY.

1332 - The rules "set_empty" have been removed. They are easy

1333 consequences of other set rules "by auto".

1334 INCOMPATIBILITY.

1335 - The rule "set_cases" is now registered with the "[cases set]"

1336 attribute. This can influence the behavior of the "cases" proof

1337 method when more than one case rule is applicable (e.g., an

1338 assumption is of the form "w : set ws" and the method "cases w"

1339 is invoked). The solution is to specify the case rule explicitly

1340 (e.g. "cases w rule: widget.exhaust").

1341 INCOMPATIBILITY.

1342 - Renamed theories:

1343 BNF_Comp ~> BNF_Composition

1344 BNF_FP_Base ~> BNF_Fixpoint_Base

1345 BNF_GFP ~> BNF_Greatest_Fixpoint

1346 BNF_LFP ~> BNF_Least_Fixpoint

1347 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

1348 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

1349 INCOMPATIBILITY.

1350 - Lifting and Transfer setup for basic HOL types sum and prod (also

1351 option) is now performed by the BNF package. Theories Lifting_Sum,

1352 Lifting_Product and Lifting_Option from Main became obsolete and

1353 were removed. Changed definitions of the relators rel_prod and

1354 rel_sum (using inductive).

1355 INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead

1356 of rel_prod_def and rel_sum_def.

1357 Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names

1358 changed (e.g. map_prod_transfer ~> prod.map_transfer).

1359 - Parametricity theorems for map functions, relators, set functions,

1360 constructors, case combinators, discriminators, selectors and

1361 (co)recursors are automatically proved and registered as transfer

1362 rules.

1364 * Old datatype package:

1365 - The old 'datatype' command has been renamed 'old_datatype', and

1366 'rep_datatype' has been renamed 'old_rep_datatype'. They are

1367 provided by "~~/src/HOL/Library/Old_Datatype.thy". See

1368 'isabelle doc datatypes' for information on porting.

1369 INCOMPATIBILITY.

1370 - Renamed theorems:

1371 weak_case_cong ~> case_cong_weak

1372 INCOMPATIBILITY.

1373 - Renamed theory:

1374 ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy

1375 INCOMPATIBILITY.

1377 * Nitpick:

1378 - Fixed soundness bug related to the strict and non-strict subset

1379 operations.

1381 * Sledgehammer:

1382 - CVC4 is now included with Isabelle instead of CVC3 and run by

1383 default.

1384 - Z3 is now always enabled by default, now that it is fully open

1385 source. The "z3_non_commercial" option is discontinued.

1386 - Minimization is now always enabled by default.

1387 Removed sub-command:

1388 min

1389 - Proof reconstruction, both one-liners and Isar, has been

1390 dramatically improved.

1391 - Improved support for CVC4 and veriT.

1393 * Old and new SMT modules:

1394 - The old 'smt' method has been renamed 'old_smt' and moved to

1395 'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,

1396 until applications have been ported to use the new 'smt' method. For

1397 the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must

1398 be installed, and the environment variable "OLD_Z3_SOLVER" must

1399 point to it.

1400 INCOMPATIBILITY.

1401 - The 'smt2' method has been renamed 'smt'.

1402 INCOMPATIBILITY.

1403 - New option 'smt_reconstruction_step_timeout' to limit the

1404 reconstruction time of Z3 proof steps in the new 'smt' method.

1405 - New option 'smt_statistics' to display statistics of the new 'smt'

1406 method, especially runtime statistics of Z3 proof reconstruction.

1408 * Lifting: command 'lift_definition' allows to execute lifted constants

1409 that have as a return type a datatype containing a subtype. This

1410 overcomes long-time limitations in the area of code generation and

1411 lifting, and avoids tedious workarounds.

1413 * Command and antiquotation "value" provide different evaluation slots

1414 (again), where the previous strategy (NBE after ML) serves as default.

1415 Minor INCOMPATIBILITY.

1417 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.

1419 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid

1420 non-termination in case of distributing a division. With this change

1421 field_simps is in some cases slightly less powerful, if it fails try to

1422 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

1424 * Separate class no_zero_divisors has been given up in favour of fully

1425 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

1427 * Class linordered_semidom really requires no zero divisors.

1428 INCOMPATIBILITY.

1430 * Classes division_ring, field and linordered_field always demand

1431 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,

1432 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

1434 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

1435 additive inverse operation. INCOMPATIBILITY.

1437 * Complex powers and square roots. The functions "ln" and "powr" are now

1438 overloaded for types real and complex, and 0 powr y = 0 by definition.

1439 INCOMPATIBILITY: type constraints may be necessary.

1441 * The functions "sin" and "cos" are now defined for any type of sort

1442 "{real_normed_algebra_1,banach}" type, so in particular on "real" and

1443 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be

1444 needed.

1446 * New library of properties of the complex transcendental functions sin,

1447 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.

1449 * The factorial function, "fact", now has type "nat => 'a" (of a sort

1450 that admits numeric types including nat, int, real and complex.

1451 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type

1452 constraint, and the combination "real (fact k)" is likely to be

1453 unsatisfactory. If a type conversion is still necessary, then use

1454 "of_nat (fact k)" or "real_of_nat (fact k)".

1456 * Removed functions "natfloor" and "natceiling", use "nat o floor" and

1457 "nat o ceiling" instead. A few of the lemmas have been retained and

1458 adapted: in their names "natfloor"/"natceiling" has been replaced by

1459 "nat_floor"/"nat_ceiling".

1461 * Qualified some duplicated fact names required for boostrapping the

1462 type class hierarchy:

1463 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

1464 field_inverse_zero ~> inverse_zero

1465 field_divide_inverse ~> divide_inverse

1466 field_inverse ~> left_inverse

1467 Minor INCOMPATIBILITY.

1469 * Eliminated fact duplicates:

1470 mult_less_imp_less_right ~> mult_right_less_imp_less

1471 mult_less_imp_less_left ~> mult_left_less_imp_less

1472 Minor INCOMPATIBILITY.

1474 * Fact consolidation: even_less_0_iff is subsumed by

1475 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

1477 * Generalized and consolidated some theorems concerning divsibility:

1478 dvd_reduce ~> dvd_add_triv_right_iff

1479 dvd_plus_eq_right ~> dvd_add_right_iff

1480 dvd_plus_eq_left ~> dvd_add_left_iff

1481 Minor INCOMPATIBILITY.

1483 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"

1484 and part of theory Main.

1485 even_def ~> even_iff_mod_2_eq_zero

1486 INCOMPATIBILITY.

1488 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor

1489 INCOMPATIBILITY.

1491 * Bootstrap of listsum as special case of abstract product over lists.

1492 Fact rename:

1493 listsum_def ~> listsum.eq_foldr

1494 INCOMPATIBILITY.

1496 * Product over lists via constant "listprod".

1498 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

1499 Cons_nth_drop_Suc.

1501 * New infrastructure for compiling, running, evaluating and testing

1502 generated code in target languages in HOL/Library/Code_Test. See

1503 HOL/Codegenerator_Test/Code_Test* for examples.

1505 * Library/Multiset:

1506 - Introduced "replicate_mset" operation.

1507 - Introduced alternative characterizations of the multiset ordering in

1508 "Library/Multiset_Order".

1509 - Renamed multiset ordering:

1510 <# ~> #<#

1511 <=# ~> #<=#

1512 \<subset># ~> #\<subset>#

1513 \<subseteq># ~> #\<subseteq>#

1514 INCOMPATIBILITY.

1515 - Introduced abbreviations for ill-named multiset operations:

1516 <#, \<subset># abbreviate < (strict subset)

1517 <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)

1518 INCOMPATIBILITY.

1519 - Renamed

1520 in_multiset_of ~> in_multiset_in_set

1521 Multiset.fold ~> fold_mset

1522 Multiset.filter ~> filter_mset

1523 INCOMPATIBILITY.

1524 - Removed mcard, is equal to size.

1525 - Added attributes:

1526 image_mset.id [simp]

1527 image_mset_id [simp]

1528 elem_multiset_of_set [simp, intro]

1529 comp_fun_commute_plus_mset [simp]

1530 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

1531 in_mset_fold_plus_iff [iff]

1532 set_of_Union_mset [simp]

1533 in_Union_mset_iff [iff]

1534 INCOMPATIBILITY.

1536 * Library/Sum_of_Squares: simplified and improved "sos" method. Always

1537 use local CSDP executable, which is much faster than the NEOS server.

1538 The "sos_cert" functionality is invoked as "sos" with additional

1539 argument. Minor INCOMPATIBILITY.

1541 * HOL-Decision_Procs: New counterexample generator quickcheck

1542 [approximation] for inequalities of transcendental functions. Uses

1543 hardware floating point arithmetic to randomly discover potential

1544 counterexamples. Counterexamples are certified with the "approximation"

1545 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for

1546 examples.

1548 * HOL-Probability: Reworked measurability prover

1549 - applies destructor rules repeatedly

1550 - removed application splitting (replaced by destructor rule)

1551 - added congruence rules to rewrite measure spaces under the sets

1552 projection

1554 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for

1555 single-step rewriting with subterm selection based on patterns.

1558 *** ML ***

1560 * Subtle change of name space policy: undeclared entries are now

1561 considered inaccessible, instead of accessible via the fully-qualified

1562 internal name. This mainly affects Name_Space.intern (and derivatives),

1563 which may produce an unexpected Long_Name.hidden prefix. Note that

1564 contemporary applications use the strict Name_Space.check (and

1565 derivatives) instead, which is not affected by the change. Potential

1566 INCOMPATIBILITY in rare applications of Name_Space.intern.

1568 * Subtle change of error semantics of Toplevel.proof_of: regular user

1569 ERROR instead of internal Toplevel.UNDEF.

1571 * Basic combinators map, fold, fold_map, split_list, apply are available

1572 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.

1574 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.

1575 INCOMPATIBILITY.

1577 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

1578 sections have been discontinued, in favour of the more elementary

1579 Multithreading.synchronized and its high-level derivative

1580 Synchronized.var (which is usually sufficient in applications). Subtle

1581 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be

1582 nested.

1584 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle

1585 change of semantics with minimal potential for INCOMPATIBILITY.

1587 * The main operations to certify logical entities are Thm.ctyp_of and

1588 Thm.cterm_of with a local context; old-style global theory variants are

1589 available as Thm.global_ctyp_of and Thm.global_cterm_of.

1590 INCOMPATIBILITY.

1592 * Elementary operations in module Thm are no longer pervasive.

1593 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,

1594 Thm.term_of etc.

1596 * Proper context for various elementary tactics: assume_tac,

1597 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

1598 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

1600 * Tactical PARALLEL_ALLGOALS is the most common way to refer to

1601 PARALLEL_GOALS.

1603 * Goal.prove_multi is superseded by the fully general Goal.prove_common,

1604 which also allows to specify a fork priority.

1606 * Antiquotation @{command_spec "COMMAND"} is superseded by

1607 @{command_keyword COMMAND} (usually without quotes and with PIDE

1608 markup). Minor INCOMPATIBILITY.

1610 * Cartouches within ML sources are turned into values of type

1611 Input.source (with formal position information).

1614 *** System ***

1616 * The Isabelle tool "update_cartouches" changes theory files to use

1617 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.

1619 * The Isabelle tool "build" provides new options -X, -k, -x.

1621 * Discontinued old-fashioned "codegen" tool. Code generation can always

1622 be externally triggered using an appropriate ROOT file plus a

1623 corresponding theory. Parametrization is possible using environment

1624 variables, or ML snippets in the most extreme cases. Minor

1625 INCOMPATIBILITY.

1627 * JVM system property "isabelle.threads" determines size of Scala thread

1628 pool, like Isabelle system option "threads" for ML.

1630 * JVM system property "isabelle.laf" determines the default Swing

1631 look-and-feel, via internal class name or symbolic name as in the jEdit

1632 menu Global Options / Appearance.

1634 * Support for Proof General and Isar TTY loop has been discontinued.

1635 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

1639 New in Isabelle2014 (August 2014)

1640 ---------------------------------

1642 *** General ***

1644 * Support for official Standard ML within the Isabelle context.

1645 Command 'SML_file' reads and evaluates the given Standard ML file.

1646 Toplevel bindings are stored within the theory context; the initial

1647 environment is restricted to the Standard ML implementation of

1648 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'

1649 and 'SML_export' allow to exchange toplevel bindings between the two

1650 separate environments. See also ~~/src/Tools/SML/Examples.thy for

1651 some examples.

1653 * Standard tactics and proof methods such as "clarsimp", "auto" and

1654 "safe" now preserve equality hypotheses "x = expr" where x is a free

1655 variable. Locale assumptions and chained facts containing "x"

1656 continue to be useful. The new method "hypsubst_thin" and the

1657 configuration option "hypsubst_thin" (within the attribute name space)

1658 restore the previous behavior. INCOMPATIBILITY, especially where

1659 induction is done after these methods or when the names of free and

1660 bound variables clash. As first approximation, old proofs may be

1661 repaired by "using [[hypsubst_thin = true]]" in the critical spot.

1663 * More static checking of proof methods, which allows the system to

1664 form a closure over the concrete syntax. Method arguments should be

1665 processed in the original proof context as far as possible, before

1666 operating on the goal state. In any case, the standard discipline for

1667 subgoal-addressing needs to be observed: no subgoals or a subgoal

1668 number that is out of range produces an empty result sequence, not an

1669 exception. Potential INCOMPATIBILITY for non-conformant tactical

1670 proof tools.

1672 * Lexical syntax (inner and outer) supports text cartouches with

1673 arbitrary nesting, and without escapes of quotes etc. The Prover IDE

1674 supports input via ` (backquote).

1676 * The outer syntax categories "text" (for formal comments and document

1677 markup commands) and "altstring" (for literal fact references) allow

1678 cartouches as well, in addition to the traditional mix of quotations.

1680 * Syntax of document antiquotation @{rail} now uses \<newline> instead

1681 of "\\", to avoid the optical illusion of escaped backslash within

1682 string token. General renovation of its syntax using text cartouches.

1683 Minor INCOMPATIBILITY.

1685 * Discontinued legacy_isub_isup, which was a temporary workaround for

1686 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts

1687 old identifier syntax with \<^isub> or \<^isup>. Potential

1688 INCOMPATIBILITY.

1690 * Document antiquotation @{url} produces markup for the given URL,

1691 which results in an active hyperlink within the text.

1693 * Document antiquotation @{file_unchecked} is like @{file}, but does

1694 not check existence within the file-system.

1696 * Updated and extended manuals: codegen, datatypes, implementation,

1697 isar-ref, jedit, system.

1700 *** Prover IDE -- Isabelle/Scala/jEdit ***

1702 * Improved Document panel: simplified interaction where every single

1703 mouse click (re)opens document via desktop environment or as jEdit

1704 buffer.

1706 * Support for Navigator plugin (with toolbar buttons), with connection

1707 to PIDE hyperlinks.

1709 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.

1710 Open text buffers take precedence over copies within the file-system.

1712 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for

1713 auxiliary ML files.

1715 * Improved syntactic and semantic completion mechanism, with simple

1716 templates, completion language context, name-space completion,

1717 file-name completion, spell-checker completion.

1719 * Refined GUI popup for completion: more robust key/mouse event

1720 handling and propagation to enclosing text area -- avoid loosing

1721 keystrokes with slow / remote graphics displays.

1723 * Completion popup supports both ENTER and TAB (default) to select an

1724 item, depending on Isabelle options.

1726 * Refined insertion of completion items wrt. jEdit text: multiple

1727 selections, rectangular selections, rectangular selection as "tall

1728 caret".

1730 * Integrated spell-checker for document text, comments etc. with

1731 completion popup and context-menu.

1733 * More general "Query" panel supersedes "Find" panel, with GUI access

1734 to commands 'find_theorems' and 'find_consts', as well as print

1735 operations for the context. Minor incompatibility in keyboard

1736 shortcuts etc.: replace action isabelle-find by isabelle-query.

1738 * Search field for all output panels ("Output", "Query", "Info" etc.)

1739 to highlight text via regular expression.

1741 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /

1742 General") allows to specify additional print modes for the prover

1743 process, without requiring old-fashioned command-line invocation of

1744 "isabelle jedit -m MODE".

1746 * More support for remote files (e.g. http) using standard Java

1747 networking operations instead of jEdit virtual file-systems.

1749 * Empty editors buffers that are no longer required (e.g.\ via theory

1750 imports) are automatically removed from the document model.

1752 * Improved monitor panel.

1754 * Improved Console/Scala plugin: more uniform scala.Console output,

1755 more robust treatment of threads and interrupts.

1757 * Improved management of dockable windows: clarified keyboard focus

1758 and window placement wrt. main editor view; optional menu item to

1759 "Detach" a copy where this makes sense.

1761 * New Simplifier Trace panel provides an interactive view of the

1762 simplification process, enabled by the "simp_trace_new" attribute

1763 within the context.

1766 *** Pure ***

1768 * Low-level type-class commands 'classes', 'classrel', 'arities' have

1769 been discontinued to avoid the danger of non-trivial axiomatization

1770 that is not immediately visible. INCOMPATIBILITY, use regular

1771 'instance' command with proof. The required OFCLASS(...) theorem

1772 might be postulated via 'axiomatization' beforehand, or the proof

1773 finished trivially if the underlying class definition is made vacuous

1774 (without any assumptions). See also Isabelle/ML operations

1775 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

1776 Axclass.arity_axiomatization.

1778 * Basic constants of Pure use more conventional names and are always

1779 qualified. Rare INCOMPATIBILITY, but with potentially serious

1780 consequences, notably for tools in Isabelle/ML. The following

1781 renaming needs to be applied:

1783 == ~> Pure.eq

1784 ==> ~> Pure.imp

1785 all ~> Pure.all

1786 TYPE ~> Pure.type

1787 dummy_pattern ~> Pure.dummy_pattern

1789 Systematic porting works by using the following theory setup on a

1790 *previous* Isabelle version to introduce the new name accesses for the

1791 old constants:

1793 setup {*

1794 fn thy => thy

1795 |> Sign.root_path

1796 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="

1797 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"

1798 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"

1799 |> Sign.restore_naming thy

1800 *}

1802 Thus ML antiquotations like @{const_name Pure.eq} may be used already.

1803 Later the application is moved to the current Isabelle version, and

1804 the auxiliary aliases are deleted.

1806 * Attributes "where" and "of" allow an optional context of local

1807 variables ('for' declaration): these variables become schematic in the

1808 instantiated theorem.

1810 * Obsolete attribute "standard" has been discontinued (legacy since

1811 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context

1812 where instantiations with schematic variables are intended (for

1813 declaration commands like 'lemmas' or attributes like "of"). The

1814 following temporary definition may help to port old applications:

1816 attribute_setup standard =

1817 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"

1819 * More thorough check of proof context for goal statements and

1820 attributed fact expressions (concerning background theory, declared

1821 hyps). Potential INCOMPATIBILITY, tools need to observe standard

1822 context discipline. See also Assumption.add_assumes and the more

1823 primitive Thm.assume_hyps.

1825 * Inner syntax token language allows regular quoted strings "..."

1826 (only makes sense in practice, if outer syntax is delimited

1827 differently, e.g. via cartouches).

1829 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,

1830 but the latter is retained some time as Proof General legacy.

1832 * Code generator preprocessor: explicit control of simp tracing on a

1833 per-constant basis. See attribute "code_preproc".

1836 *** HOL ***

1838 * Code generator: enforce case of identifiers only for strict target

1839 language requirements. INCOMPATIBILITY.

1841 * Code generator: explicit proof contexts in many ML interfaces.

1842 INCOMPATIBILITY.

1844 * Code generator: minimize exported identifiers by default. Minor

1845 INCOMPATIBILITY.

1847 * Code generation for SML and OCaml: dropped arcane "no_signatures"

1848 option. Minor INCOMPATIBILITY.

1850 * "declare [[code abort: ...]]" replaces "code_abort ...".

1851 INCOMPATIBILITY.

1853 * "declare [[code drop: ...]]" drops all code equations associated

1854 with the given constants.

1856 * Code generations are provided for make, fields, extend and truncate

1857 operations on records.

1859 * Command and antiquotation "value" are now hardcoded against nbe and

1860 ML. Minor INCOMPATIBILITY.

1862 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.

1864 * The symbol "\<newline>" may be used within char or string literals

1865 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.

1867 * Qualified String.implode and String.explode. INCOMPATIBILITY.

1869 * Simplifier: Enhanced solver of preconditions of rewrite rules can

1870 now deal with conjunctions. For help with converting proofs, the old

1871 behaviour of the simplifier can be restored like this: declare/using

1872 [[simp_legacy_precond]]. This configuration option will disappear

1873 again in the future. INCOMPATIBILITY.

1875 * Simproc "finite_Collect" is no longer enabled by default, due to

1876 spurious crashes and other surprises. Potential INCOMPATIBILITY.

1878 * Moved new (co)datatype package and its dependencies from session

1879 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',

1880 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now

1881 part of theory "Main".

1883 Theory renamings:

1884 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)

1885 Library/Wfrec.thy ~> Wfrec.thy

1886 Library/Zorn.thy ~> Zorn.thy

1887 Cardinals/Order_Relation.thy ~> Order_Relation.thy

1888 Library/Order_Union.thy ~> Cardinals/Order_Union.thy

1889 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

1890 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

1891 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

1892 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

1893 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

1894 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

1895 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

1896 BNF/BNF_Comp.thy ~> BNF_Comp.thy

1897 BNF/BNF_Def.thy ~> BNF_Def.thy

1898 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

1899 BNF/BNF_GFP.thy ~> BNF_GFP.thy

1900 BNF/BNF_LFP.thy ~> BNF_LFP.thy

1901 BNF/BNF_Util.thy ~> BNF_Util.thy

1902 BNF/Coinduction.thy ~> Coinduction.thy

1903 BNF/More_BNFs.thy ~> Library/More_BNFs.thy

1904 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy

1905 BNF/Examples/* ~> BNF_Examples/*

1907 New theories:

1908 Wellorder_Extension.thy (split from Zorn.thy)

1909 Library/Cardinal_Notations.thy

1910 Library/BNF_Axomatization.thy

1911 BNF_Examples/Misc_Primcorec.thy

1912 BNF_Examples/Stream_Processor.thy

1914 Discontinued theories:

1915 BNF/BNF.thy

1916 BNF/Equiv_Relations_More.thy

1918 INCOMPATIBILITY.

1920 * New (co)datatype package:

1921 - Command 'primcorec' is fully implemented.

1922 - Command 'datatype_new' generates size functions ("size_xxx" and

1923 "size") as required by 'fun'.

1924 - BNFs are integrated with the Lifting tool and new-style

1925 (co)datatypes with Transfer.

1926 - Renamed commands:

1927 datatype_new_compat ~> datatype_compat

1928 primrec_new ~> primrec

1929 wrap_free_constructors ~> free_constructors

1930 INCOMPATIBILITY.

1931 - The generated constants "xxx_case" and "xxx_rec" have been renamed

1932 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").

1933 INCOMPATIBILITY.

1934 - The constant "xxx_(un)fold" and related theorems are no longer

1935 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually

1936 using "prim(co)rec".

1937 INCOMPATIBILITY.

1938 - No discriminators are generated for nullary constructors by

1939 default, eliminating the need for the odd "=:" syntax.

1940 INCOMPATIBILITY.

1941 - No discriminators or selectors are generated by default by

1942 "datatype_new", unless custom names are specified or the new

1943 "discs_sels" option is passed.

1944 INCOMPATIBILITY.

1946 * Old datatype package:

1947 - The generated theorems "xxx.cases" and "xxx.recs" have been

1948 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->

1949 "sum.case"). INCOMPATIBILITY.

1950 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have

1951 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,

1952 "prod_case" ~> "case_prod"). INCOMPATIBILITY.

1954 * The types "'a list" and "'a option", their set and map functions,

1955 their relators, and their selectors are now produced using the new

1956 BNF-based datatype package.

1958 Renamed constants:

1959 Option.set ~> set_option

1960 Option.map ~> map_option

1961 option_rel ~> rel_option

1963 Renamed theorems:

1964 set_def ~> set_rec[abs_def]

1965 map_def ~> map_rec[abs_def]

1966 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")

1967 option.recs ~> option.rec

1968 list_all2_def ~> list_all2_iff

1969 set.simps ~> set_simps (or the slightly different "list.set")

1970 map.simps ~> list.map

1971 hd.simps ~> list.sel(1)

1972 tl.simps ~> list.sel(2-3)

1973 the.simps ~> option.sel

1975 INCOMPATIBILITY.

1977 * The following map functions and relators have been renamed:

1978 sum_map ~> map_sum

1979 map_pair ~> map_prod

1980 prod_rel ~> rel_prod

1981 sum_rel ~> rel_sum

1982 fun_rel ~> rel_fun

1983 set_rel ~> rel_set

1984 filter_rel ~> rel_filter

1985 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")

1986 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")

1987 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")

1989 INCOMPATIBILITY.

1991 * Lifting and Transfer:

1992 - a type variable as a raw type is supported

1993 - stronger reflexivity prover

1994 - rep_eq is always generated by lift_definition

1995 - setup for Lifting/Transfer is now automated for BNFs

1996 + holds for BNFs that do not contain a dead variable

1997 + relator_eq, relator_mono, relator_distr, relator_domain,

1998 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,

1999 right_unique, right_total, left_unique, left_total are proved

2000 automatically

2001 + definition of a predicator is generated automatically

2002 + simplification rules for a predicator definition are proved

2003 automatically for datatypes

2004 - consolidation of the setup of Lifting/Transfer

2005 + property that a relator preservers reflexivity is not needed any

2006 more

2007 Minor INCOMPATIBILITY.

2008 + left_total and left_unique rules are now transfer rules

2009 (reflexivity_rule attribute not needed anymore)

2010 INCOMPATIBILITY.

2011 + Domainp does not have to be a separate assumption in

2012 relator_domain theorems (=> more natural statement)

2013 INCOMPATIBILITY.

2014 - registration of code equations is more robust

2015 Potential INCOMPATIBILITY.

2016 - respectfulness proof obligation is preprocessed to a more readable

2017 form

2018 Potential INCOMPATIBILITY.

2019 - eq_onp is always unfolded in respectfulness proof obligation

2020 Potential INCOMPATIBILITY.

2021 - unregister lifting setup for Code_Numeral.integer and

2022 Code_Numeral.natural

2023 Potential INCOMPATIBILITY.

2024 - Lifting.invariant -> eq_onp

2025 INCOMPATIBILITY.

2027 * New internal SAT solver "cdclite" that produces models and proof

2028 traces. This solver replaces the internal SAT solvers "enumerate" and

2029 "dpll". Applications that explicitly used one of these two SAT

2030 solvers should use "cdclite" instead. In addition, "cdclite" is now

2031 the default SAT solver for the "sat" and "satx" proof methods and

2032 corresponding tactics; the old default can be restored using "declare

2033 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.

2035 * SMT module: A new version of the SMT module, temporarily called

2036 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,

2037 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also

2038 supported as oracles. Yices is no longer supported, because no version

2039 of the solver can handle both SMT-LIB 2 and quantifiers.

2041 * Activation of Z3 now works via "z3_non_commercial" system option

2042 (without requiring restart), instead of former settings variable

2043 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu

2044 Plugin Options / Isabelle / General.

2046 * Sledgehammer:

2047 - Z3 can now produce Isar proofs.

2048 - MaSh overhaul:

2049 . New SML-based learning algorithms eliminate the dependency on

2050 Python and increase performance and reliability.

2051 . MaSh and MeSh are now used by default together with the

2052 traditional MePo (Meng-Paulson) relevance filter. To disable

2053 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin

2054 Options / Isabelle / General to "none".

2055 - New option:

2056 smt_proofs

2057 - Renamed options:

2058 isar_compress ~> compress

2059 isar_try0 ~> try0

2061 INCOMPATIBILITY.

2063 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.

2065 * Nitpick:

2066 - Fixed soundness bug whereby mutually recursive datatypes could

2067 take infinite values.

2068 - Fixed soundness bug with low-level number functions such as

2069 "Abs_Integ" and "Rep_Integ".

2070 - Removed "std" option.

2071 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to

2072 "hide_types".

2074 * Metis: Removed legacy proof method 'metisFT'. Use 'metis

2075 (full_types)' instead. INCOMPATIBILITY.

2077 * Try0: Added 'algebra' and 'meson' to the set of proof methods.

2079 * Adjustion of INF and SUP operations:

2080 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.

2081 - Consolidated theorem names containing INFI and SUPR: have INF and

2082 SUP instead uniformly.

2083 - More aggressive normalization of expressions involving INF and Inf

2084 or SUP and Sup.

2085 - INF_image and SUP_image do not unfold composition.

2086 - Dropped facts INF_comp, SUP_comp.

2087 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

2088 simplifier implication in premises. Generalize and replace former

2089 INT_cong, SUP_cong

2091 INCOMPATIBILITY.

2093 * SUP and INF generalized to conditionally_complete_lattice.

2095 * Swapped orientation of facts image_comp and vimage_comp:

2097 image_compose ~> image_comp [symmetric]

2098 image_comp ~> image_comp [symmetric]

2099 vimage_compose ~> vimage_comp [symmetric]

2100 vimage_comp ~> vimage_comp [symmetric]

2102 INCOMPATIBILITY.

2104 * Theory reorganization: split of Big_Operators.thy into

2105 Groups_Big.thy and Lattices_Big.thy.

2107 * Consolidated some facts about big group operators:

2109 setsum_0' ~> setsum.neutral

2110 setsum_0 ~> setsum.neutral_const

2111 setsum_addf ~> setsum.distrib

2112 setsum_cartesian_product ~> setsum.cartesian_product

2113 setsum_cases ~> setsum.If_cases

2114 setsum_commute ~> setsum.commute

2115 setsum_cong ~> setsum.cong

2116 setsum_delta ~> setsum.delta

2117 setsum_delta' ~> setsum.delta'

2118 setsum_diff1' ~> setsum.remove

2119 setsum_empty ~> setsum.empty

2120 setsum_infinite ~> setsum.infinite

2121 setsum_insert ~> setsum.insert

2122 setsum_inter_restrict'' ~> setsum.inter_filter

2123 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

2124 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

2125 setsum_mono_zero_left ~> setsum.mono_neutral_left

2126 setsum_mono_zero_right ~> setsum.mono_neutral_right

2127 setsum_reindex ~> setsum.reindex

2128 setsum_reindex_cong ~> setsum.reindex_cong

2129 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

2130 setsum_restrict_set ~> setsum.inter_restrict

2131 setsum_Plus ~> setsum.Plus

2132 setsum_setsum_restrict ~> setsum.commute_restrict

2133 setsum_Sigma ~> setsum.Sigma

2134 setsum_subset_diff ~> setsum.subset_diff

2135 setsum_Un_disjoint ~> setsum.union_disjoint

2136 setsum_UN_disjoint ~> setsum.UNION_disjoint

2137 setsum_Un_Int ~> setsum.union_inter

2138 setsum_Union_disjoint ~> setsum.Union_disjoint

2139 setsum_UNION_zero ~> setsum.Union_comp

2140 setsum_Un_zero ~> setsum.union_inter_neutral

2141 strong_setprod_cong ~> setprod.strong_cong

2142 strong_setsum_cong ~> setsum.strong_cong

2143 setprod_1' ~> setprod.neutral

2144 setprod_1 ~> setprod.neutral_const

2145 setprod_cartesian_product ~> setprod.cartesian_product

2146 setprod_cong ~> setprod.cong

2147 setprod_delta ~> setprod.delta

2148 setprod_delta' ~> setprod.delta'

2149 setprod_empty ~> setprod.empty

2150 setprod_infinite ~> setprod.infinite

2151 setprod_insert ~> setprod.insert

2152 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

2153 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

2154 setprod_mono_one_left ~> setprod.mono_neutral_left

2155 setprod_mono_one_right ~> setprod.mono_neutral_right

2156 setprod_reindex ~> setprod.reindex

2157 setprod_reindex_cong ~> setprod.reindex_cong

2158 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

2159 setprod_Sigma ~> setprod.Sigma

2160 setprod_subset_diff ~> setprod.subset_diff

2161 setprod_timesf ~> setprod.distrib

2162 setprod_Un2 ~> setprod.union_diff2

2163 setprod_Un_disjoint ~> setprod.union_disjoint

2164 setprod_UN_disjoint ~> setprod.UNION_disjoint

2165 setprod_Un_Int ~> setprod.union_inter

2166 setprod_Union_disjoint ~> setprod.Union_disjoint

2167 setprod_Un_one ~> setprod.union_inter_neutral

2169 Dropped setsum_cong2 (simple variant of setsum.cong).

2170 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)

2171 Dropped setsum_reindex_id, setprod_reindex_id

2172 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).

2174 INCOMPATIBILITY.

2176 * Abolished slightly odd global lattice interpretation for min/max.

2178 Fact consolidations:

2179 min_max.inf_assoc ~> min.assoc

2180 min_max.inf_commute ~> min.commute

2181 min_max.inf_left_commute ~> min.left_commute

2182 min_max.inf_idem ~> min.idem

2183 min_max.inf_left_idem ~> min.left_idem

2184 min_max.inf_right_idem ~> min.right_idem

2185 min_max.sup_assoc ~> max.assoc

2186 min_max.sup_commute ~> max.commute

2187 min_max.sup_left_commute ~> max.left_commute

2188 min_max.sup_idem ~> max.idem

2189 min_max.sup_left_idem ~> max.left_idem

2190 min_max.sup_inf_distrib1 ~> max_min_distrib2

2191 min_max.sup_inf_distrib2 ~> max_min_distrib1

2192 min_max.inf_sup_distrib1 ~> min_max_distrib2

2193 min_max.inf_sup_distrib2 ~> min_max_distrib1

2194 min_max.distrib ~> min_max_distribs

2195 min_max.inf_absorb1 ~> min.absorb1

2196 min_max.inf_absorb2 ~> min.absorb2

2197 min_max.sup_absorb1 ~> max.absorb1

2198 min_max.sup_absorb2 ~> max.absorb2

2199 min_max.le_iff_inf ~> min.absorb_iff1

2200 min_max.le_iff_sup ~> max.absorb_iff2

2201 min_max.inf_le1 ~> min.cobounded1

2202 min_max.inf_le2 ~> min.cobounded2

2203 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

2204 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

2205 min_max.le_infI1 ~> min.coboundedI1

2206 min_max.le_infI2 ~> min.coboundedI2

2207 min_max.le_supI1 ~> max.coboundedI1

2208 min_max.le_supI2 ~> max.coboundedI2

2209 min_max.less_infI1 ~> min.strict_coboundedI1

2210 min_max.less_infI2 ~> min.strict_coboundedI2

2211 min_max.less_supI1 ~> max.strict_coboundedI1

2212 min_max.less_supI2 ~> max.strict_coboundedI2

2213 min_max.inf_mono ~> min.mono

2214 min_max.sup_mono ~> max.mono

2215 min_max.le_infI, min_max.inf_greatest ~> min.boundedI

2216 min_max.le_supI, min_max.sup_least ~> max.boundedI

2217 min_max.le_inf_iff ~> min.bounded_iff

2218 min_max.le_sup_iff ~> max.bounded_iff

2220 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,

2221 min.left_commute, min.left_idem, max.commute, max.assoc,

2222 max.left_commute, max.left_idem directly.

2224 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,

2225 min.cobounded2, max.cobounded1m max.cobounded2 directly.

2227 For min_ac or max_ac, prefer more general collection ac_simps.

2229 INCOMPATIBILITY.

2231 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>

2232 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

2234 * Qualified constant names Wellfounded.acc, Wellfounded.accp.

2235 INCOMPATIBILITY.

2237 * Fact generalization and consolidation:

2238 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

2240 INCOMPATIBILITY.

2242 * Purely algebraic definition of even. Fact generalization and

2243 consolidation:

2244 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

2245 even_zero_(nat|int) ~> even_zero

2247 INCOMPATIBILITY.

2249 * Abolished neg_numeral.

2250 - Canonical representation for minus one is "- 1".

2251 - Canonical representation for other negative numbers is "- (numeral _)".

2252 - When devising rule sets for number calculation, consider the

2253 following canonical cases: 0, 1, numeral _, - 1, - numeral _.

2254 - HOLogic.dest_number also recognizes numerals in non-canonical forms

2255 like "numeral One", "- numeral One", "- 0" and even "- ... - _".

2256 - Syntax for negative numerals is mere input syntax.

2258 INCOMPATIBILITY.

2260 * Reduced name variants for rules on associativity and commutativity:

2262 add_assoc ~> add.assoc

2263 add_commute ~> add.commute

2264 add_left_commute ~> add.left_commute

2265 mult_assoc ~> mult.assoc

2266 mult_commute ~> mult.commute

2267 mult_left_commute ~> mult.left_commute

2268 nat_add_assoc ~> add.assoc

2269 nat_add_commute ~> add.commute

2270 nat_add_left_commute ~> add.left_commute

2271 nat_mult_assoc ~> mult.assoc

2272 nat_mult_commute ~> mult.commute

2273 eq_assoc ~> iff_assoc

2274 eq_left_commute ~> iff_left_commute

2276 INCOMPATIBILITY.

2278 * Fact collections add_ac and mult_ac are considered old-fashioned.

2279 Prefer ac_simps instead, or specify rules

2280 (add|mult).(assoc|commute|left_commute) individually.

2282 * Elimination of fact duplicates:

2283 equals_zero_I ~> minus_unique

2284 diff_eq_0_iff_eq ~> right_minus_eq

2285 nat_infinite ~> infinite_UNIV_nat

2286 int_infinite ~> infinite_UNIV_int

2288 INCOMPATIBILITY.

2290 * Fact name consolidation:

2291 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

2292 minus_le_self_iff ~> neg_less_eq_nonneg

2293 le_minus_self_iff ~> less_eq_neg_nonpos

2294 neg_less_nonneg ~> neg_less_pos

2295 less_minus_self_iff ~> less_neg_neg [simp]

2297 INCOMPATIBILITY.

2299 * More simplification rules on unary and binary minus:

2300 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

2301 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

2302 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

2303 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

2304 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

2305 been taken away from fact collections algebra_simps and field_simps.

2306 INCOMPATIBILITY.

2308 To restore proofs, the following patterns are helpful:

2310 a) Arbitrary failing proof not involving "diff_def":

2311 Consider simplification with algebra_simps or field_simps.

2313 b) Lifting rules from addition to subtraction:

2314 Try with "using <rule for addition> of [... "- _" ...]" by simp".

2316 c) Simplification with "diff_def": just drop "diff_def".

2317 Consider simplification with algebra_simps or field_simps;

2318 or the brute way with

2319 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

2321 * Introduce bdd_above and bdd_below in theory

2322 Conditionally_Complete_Lattices, use them instead of explicitly

2323 stating boundedness of sets.

2325 * ccpo.admissible quantifies only over non-empty chains to allow more

2326 syntax-directed proof rules; the case of the empty chain shows up as

2327 additional case in fixpoint induction proofs. INCOMPATIBILITY.

2329 * Removed and renamed theorems in Series:

2330 summable_le ~> suminf_le

2331 suminf_le ~> suminf_le_const

2332 series_pos_le ~> setsum_le_suminf

2333 series_pos_less ~> setsum_less_suminf

2334 suminf_ge_zero ~> suminf_nonneg

2335 suminf_gt_zero ~> suminf_pos

2336 suminf_gt_zero_iff ~> suminf_pos_iff

2337 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

2338 suminf_0_le ~> suminf_nonneg [rotate]

2339 pos_summable ~> summableI_nonneg_bounded

2340 ratio_test ~> summable_ratio_test

2342 removed series_zero, replaced by sums_finite

2344 removed auxiliary lemmas:

2346 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

2347 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

2348 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

2349 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

2350 summable_convergent_sumr_iff, sumr_diff_mult_const

2352 INCOMPATIBILITY.

2354 * Replace (F)DERIV syntax by has_derivative:

2355 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"

2357 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

2359 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

2361 - removed constant isDiff

2363 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

2364 input syntax.

2366 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

2368 - Renamed FDERIV_... lemmas to has_derivative_...

2370 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

2372 - removed DERIV_intros, has_derivative_eq_intros

2374 - introduced derivative_intros and deriative_eq_intros which

2375 includes now rules for DERIV, has_derivative and

2376 has_vector_derivative.

2378 - Other renamings:

2379 differentiable_def ~> real_differentiable_def

2380 differentiableE ~> real_differentiableE

2381 fderiv_def ~> has_derivative_at

2382 field_fderiv_def ~> field_has_derivative_at

2383 isDiff_der ~> differentiable_def

2384 deriv_fderiv ~> has_field_derivative_def

2385 deriv_def ~> DERIV_def

2387 INCOMPATIBILITY.

2389 * Include more theorems in continuous_intros. Remove the

2390 continuous_on_intros, isCont_intros collections, these facts are now

2391 in continuous_intros.

2393 * Theorems about complex numbers are now stated only using Re and Im,

2394 the Complex constructor is not used anymore. It is possible to use

2395 primcorec to defined the behaviour of a complex-valued function.

2397 Removed theorems about the Complex constructor from the simpset, they

2398 are available as the lemma collection legacy_Complex_simps. This

2399 especially removes

2401 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

2403 Instead the reverse direction is supported with

2404 Complex_eq: "Complex a b = a + \<i> * b"

2406 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

2408 Renamings:

2409 Re/Im ~> complex.sel

2410 complex_Re/Im_zero ~> zero_complex.sel

2411 complex_Re/Im_add ~> plus_complex.sel

2412 complex_Re/Im_minus ~> uminus_complex.sel

2413 complex_Re/Im_diff ~> minus_complex.sel

2414 complex_Re/Im_one ~> one_complex.sel

2415 complex_Re/Im_mult ~> times_complex.sel

2416 complex_Re/Im_inverse ~> inverse_complex.sel

2417 complex_Re/Im_scaleR ~> scaleR_complex.sel

2418 complex_Re/Im_i ~> ii.sel

2419 complex_Re/Im_cnj ~> cnj.sel

2420 Re/Im_cis ~> cis.sel

2422 complex_divide_def ~> divide_complex_def

2423 complex_norm_def ~> norm_complex_def

2424 cmod_def ~> norm_complex_de

2426 Removed theorems:

2427 complex_zero_def

2428 complex_add_def

2429 complex_minus_def

2430 complex_diff_def

2431 complex_one_def

2432 complex_mult_def

2433 complex_inverse_def

2434 complex_scaleR_def

2436 INCOMPATIBILITY.

2438 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

2439 Conditionally_Complete_Lattices. INCOMPATIBILITY.

2441 * HOL-Library: new theory src/HOL/Library/Tree.thy.

2443 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

2444 is subsumed by session Kleene_Algebra in AFP.

2446 * HOL-Library / theory RBT: various constants and facts are hidden;

2447 lifting setup is unregistered. INCOMPATIBILITY.

2449 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

2451 * HOL-Word: bit representations prefer type bool over type bit.

2452 INCOMPATIBILITY.

2454 * HOL-Word:

2455 - Abandoned fact collection "word_arith_alts", which is a duplicate

2456 of "word_arith_wis".

2457 - Dropped first (duplicated) element in fact collections

2458 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

2459 "uint_word_arith_bintrs".

2461 * HOL-Number_Theory:

2462 - consolidated the proofs of the binomial theorem

2463 - the function fib is again of type nat => nat and not overloaded

2464 - no more references to Old_Number_Theory in the HOL libraries

2465 (except the AFP)

2467 INCOMPATIBILITY.

2469 * HOL-Multivariate_Analysis:

2470 - Type class ordered_real_vector for ordered vector spaces.

2471 - New theory Complex_Basic_Analysis defining complex derivatives,

2472 holomorphic functions, etc., ported from HOL Light's canal.ml.

2473 - Changed order of ordered_euclidean_space to be compatible with

2474 pointwise ordering on products. Therefore instance of

2475 conditionally_complete_lattice and ordered_real_vector.

2476 INCOMPATIBILITY: use box instead of greaterThanLessThan or

2477 explicit set-comprehensions with eucl_less for other (half-)open

2478 intervals.

2479 - removed dependencies on type class ordered_euclidean_space with

2480 introduction of "cbox" on euclidean_space

2481 - renamed theorems:

2482 interval ~> box

2483 mem_interval ~> mem_box

2484 interval_eq_empty ~> box_eq_empty

2485 interval_ne_empty ~> box_ne_empty

2486 interval_sing(1) ~> cbox_sing

2487 interval_sing(2) ~> box_sing

2488 subset_interval_imp ~> subset_box_imp

2489 subset_interval ~> subset_box

2490 open_interval ~> open_box

2491 closed_interval ~> closed_cbox

2492 interior_closed_interval ~> interior_cbox

2493 bounded_closed_interval ~> bounded_cbox

2494 compact_interval ~> compact_cbox

2495 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

2496 bounded_subset_closed_interval ~> bounded_subset_cbox

2497 mem_interval_componentwiseI ~> mem_box_componentwiseI

2498 convex_box ~> convex_prod

2499 rel_interior_real_interval ~> rel_interior_real_box

2500 convex_interval ~> convex_box

2501 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

2502 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

2503 content_closed_interval' ~> content_cbox'

2504 elementary_subset_interval ~> elementary_subset_box

2505 diameter_closed_interval ~> diameter_cbox

2506 frontier_closed_interval ~> frontier_cbox

2507 frontier_open_interval ~> frontier_box

2508 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

2509 closure_open_interval ~> closure_box

2510 open_closed_interval_convex ~> open_cbox_convex

2511 open_interval_midpoint ~> box_midpoint

2512 content_image_affinity_interval ~> content_image_affinity_cbox

2513 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

2514 bounded_interval ~> bounded_closed_interval + bounded_boxes

2516 - respective theorems for intervals over the reals:

2517 content_closed_interval + content_cbox

2518 has_integral + has_integral_real

2519 fine_division_exists + fine_division_exists_real

2520 has_integral_null + has_integral_null_real

2521 tagged_division_union_interval + tagged_division_union_interval_real

2522 has_integral_const + has_integral_const_real

2523 integral_const + integral_const_real

2524 has_integral_bound + has_integral_bound_real

2525 integrable_continuous + integrable_continuous_real

2526 integrable_subinterval + integrable_subinterval_real

2527 has_integral_reflect_lemma + has_integral_reflect_lemma_real

2528 integrable_reflect + integrable_reflect_real

2529 integral_reflect + integral_reflect_real

2530 image_affinity_interval + image_affinity_cbox

2531 image_smult_interval + image_smult_cbox

2532 integrable_const + integrable_const_ivl

2533 integrable_on_subinterval + integrable_on_subcbox

2535 - renamed theorems:

2536 derivative_linear ~> has_derivative_bounded_linear

2537 derivative_is_linear ~> has_derivative_linear

2538 bounded_linear_imp_linear ~> bounded_linear.linear

2540 * HOL-Probability:

2541 - Renamed positive_integral to nn_integral:

2543 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

2544 positive_integral_positive ~> nn_integral_nonneg

2546 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

2548 - replaced the Lebesgue integral on real numbers by the more general

2549 Bochner integral for functions into a real-normed vector space.

2551 integral_zero ~> integral_zero / integrable_zero

2552 integral_minus ~> integral_minus / integrable_minus

2553 integral_add ~> integral_add / integrable_add

2554 integral_diff ~> integral_diff / integrable_diff

2555 integral_setsum ~> integral_setsum / integrable_setsum

2556 integral_multc ~> integral_mult_left / integrable_mult_left

2557 integral_cmult ~> integral_mult_right / integrable_mult_right

2558 integral_triangle_inequality~> integral_norm_bound

2559 integrable_nonneg ~> integrableI_nonneg

2560 integral_positive ~> integral_nonneg_AE

2561 integrable_abs_iff ~> integrable_abs_cancel

2562 positive_integral_lim_INF ~> nn_integral_liminf

2563 lebesgue_real_affine ~> lborel_real_affine

2564 borel_integral_has_integral ~> has_integral_lebesgue_integral

2565 integral_indicator ~>

2566 integral_real_indicator / integrable_real_indicator

2567 positive_integral_fst ~> nn_integral_fst'

2568 positive_integral_fst_measurable ~> nn_integral_fst

2569 positive_integral_snd_measurable ~> nn_integral_snd

2571 integrable_fst_measurable ~>

2572 integral_fst / integrable_fst / AE_integrable_fst

2574 integrable_snd_measurable ~>

2575 integral_snd / integrable_snd / AE_integrable_snd

2577 integral_monotone_convergence ~>

2578 integral_monotone_convergence / integrable_monotone_convergence

2580 integral_monotone_convergence_at_top ~>

2581 integral_monotone_convergence_at_top /

2582 integrable_monotone_convergence_at_top

2584 has_integral_iff_positive_integral_lebesgue ~>

2585 has_integral_iff_has_bochner_integral_lebesgue_nonneg

2587 lebesgue_integral_has_integral ~>

2588 has_integral_integrable_lebesgue_nonneg

2590 positive_integral_lebesgue_has_integral ~>

2591 integral_has_integral_lebesgue_nonneg /

2592 integrable_has_integral_lebesgue_nonneg

2594 lebesgue_integral_real_affine ~>

2595 nn_integral_real_affine

2597 has_integral_iff_positive_integral_lborel ~>

2598 integral_has_integral_nonneg / integrable_has_integral_nonneg

2600 The following theorems where removed:

2602 lebesgue_integral_nonneg

2603 lebesgue_integral_uminus

2604 lebesgue_integral_cmult

2605 lebesgue_integral_multc

2606 lebesgue_integral_cmult_nonneg

2607 integral_cmul_indicator

2608 integral_real

2610 - Formalized properties about exponentially, Erlang, and normal

2611 distributed random variables.

2613 * HOL-Decision_Procs: Separate command 'approximate' for approximative

2614 computation in src/HOL/Decision_Procs/Approximation. Minor

2615 INCOMPATIBILITY.

2618 *** Scala ***

2620 * The signature and semantics of Document.Snapshot.cumulate_markup /

2621 select_markup have been clarified. Markup is now traversed in the

2622 order of reports given by the prover: later markup is usually more

2623 specific and may override results accumulated so far. The elements

2624 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

2626 * Substantial reworking of internal PIDE protocol communication

2627 channels. INCOMPATIBILITY.

2630 *** ML ***

2632 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

2633 compared (according to Thm.thm_ord), but assumed to be covered by the

2634 current background theory. Thus equivalent data produced in different

2635 branches of the theory graph usually coincides (e.g. relevant for

2636 theory merge). Note that the softer Thm.eq_thm_prop is often more

2637 appropriate than Thm.eq_thm.

2639 * Proper context for basic Simplifier operations: rewrite_rule,

2640 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

2641 pass runtime Proof.context (and ensure that the simplified entity

2642 actually belongs to it).

2644 * Proper context discipline for read_instantiate and instantiate_tac:

2645 variables that are meant to become schematic need to be given as

2646 fixed, and are generalized by the explicit context of local variables.

2647 This corresponds to Isar attributes "where" and "of" with 'for'

2648 declaration. INCOMPATIBILITY, also due to potential change of indices

2649 of schematic variables.

2651 * Moved ML_Compiler.exn_trace and other operations on exceptions to

2652 structure Runtime. Minor INCOMPATIBILITY.

2654 * Discontinued old Toplevel.debug in favour of system option

2655 "ML_exception_trace", which may be also declared within the context

2656 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

2658 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

2659 INCOMPATIBILITY.

2661 * Configuration option "ML_print_depth" controls the pretty-printing

2662 depth of the ML compiler within the context. The old print_depth in

2663 ML is still available as default_print_depth, but rarely used. Minor

2664 INCOMPATIBILITY.

2666 * Toplevel function "use" refers to raw ML bootstrap environment,

2667 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

2668 Note that 'ML_file' is the canonical command to load ML files into the

2669 formal context.

2671 * Simplified programming interface to define ML antiquotations, see

2672 structure ML_Antiquotation. Minor INCOMPATIBILITY.

2674 * ML antiquotation @{here} refers to its source position, which is

2675 occasionally useful for experimentation and diagnostic purposes.

2677 * ML antiquotation @{path} produces a Path.T value, similarly to

2678 Path.explode, but with compile-time check against the file-system and

2679 some PIDE markup. Note that unlike theory source, ML does not have a

2680 well-defined master directory, so an absolute symbolic path

2681 specification is usually required, e.g. "~~/src/HOL".

2683 * ML antiquotation @{print} inlines a function to print an arbitrary

2684 ML value, which is occasionally useful for diagnostic or demonstration

2685 purposes.

2688 *** System ***

2690 * Proof General with its traditional helper scripts is now an optional

2691 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

2692 component repository http://isabelle.in.tum.de/components/. Note that

2693 the "system" manual provides general explanations about add-on

2694 components, especially those that are not bundled with the release.

2696 * The raw Isabelle process executable has been renamed from

2697 "isabelle-process" to "isabelle_process", which conforms to common

2698 shell naming conventions, and allows to define a shell function within

2699 the Isabelle environment to avoid dynamic path lookup. Rare

2700 incompatibility for old tools that do not use the ISABELLE_PROCESS

2701 settings variable.

2703 * Former "isabelle tty" has been superseded by "isabelle console",

2704 with implicit build like "isabelle jedit", and without the mostly

2705 obsolete Isar TTY loop.

2707 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

2708 and PDF_VIEWER now refer to the actual programs, not shell

2709 command-lines. Discontinued option -c: invocation may be asynchronous

2710 via desktop environment, without any special precautions. Potential

2711 INCOMPATIBILITY with ambitious private settings.

2713 * Removed obsolete "isabelle unsymbolize". Note that the usual format

2714 for email communication is the Unicode rendering of Isabelle symbols,

2715 as produced by Isabelle/jEdit, for example.

2717 * Removed obsolete tool "wwwfind". Similar functionality may be

2718 integrated into Isabelle/jEdit eventually.

2720 * Improved 'display_drafts' concerning desktop integration and

2721 repeated invocation in PIDE front-end: re-use single file

2722 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

2724 * Session ROOT specifications require explicit 'document_files' for

2725 robust dependencies on LaTeX sources. Only these explicitly given

2726 files are copied to the document output directory, before document

2727 processing is started.

2729 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

2730 of TeX Live from Cygwin.

2734 New in Isabelle2013-2 (December 2013)

2735 -------------------------------------

2737 *** Prover IDE -- Isabelle/Scala/jEdit ***

2739 * More robust editing of running commands with internal forks,

2740 e.g. non-terminating 'by' steps.

2742 * More relaxed Sledgehammer panel: avoid repeated application of query

2743 after edits surrounding the command location.

2745 * More status information about commands that are interrupted

2746 accidentally (via physical event or Poly/ML runtime system signal,

2747 e.g. out-of-memory).

2750 *** System ***

2752 * More robust termination of external processes managed by

2753 Isabelle/ML: support cancellation of tasks within the range of

2754 milliseconds, as required for PIDE document editing with automatically

2755 tried tools (e.g. Sledgehammer).

2757 * Reactivated Isabelle/Scala kill command for external processes on

2758 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

2759 workaround for some Debian/Ubuntu Linux versions from 2013.

2763 New in Isabelle2013-1 (November 2013)

2764 -------------------------------------

2766 *** General ***

2768 * Discontinued obsolete 'uses' within theory header. Note that

2769 commands like 'ML_file' work without separate declaration of file

2770 dependencies. Minor INCOMPATIBILITY.

2772 * Discontinued redundant 'use' command, which was superseded by

2773 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

2775 * Simplified subscripts within identifiers, using plain \<^sub>

2776 instead of the second copy \<^isub> and \<^isup>. Superscripts are

2777 only for literal tokens within notation; explicit mixfix annotations

2778 for consts or fixed variables may be used as fall-back for unusual

2779 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

2780 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

2781 standardize symbols as a starting point for further manual cleanup.

2782 The ML reference variable "legacy_isub_isup" may be set as temporary

2783 workaround, to make the prover accept a subset of the old identifier

2784 syntax.

2786 * Document antiquotations: term style "isub" has been renamed to

2787 "sub". Minor INCOMPATIBILITY.

2789 * Uniform management of "quick_and_dirty" as system option (see also

2790 "isabelle options"), configuration option within the context (see also

2791 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

2792 INCOMPATIBILITY, need to use more official Isabelle means to access

2793 quick_and_dirty, instead of historical poking into mutable reference.

2795 * Renamed command 'print_configs' to 'print_options'. Minor

2796 INCOMPATIBILITY.

2798 * Proper diagnostic command 'print_state'. Old 'pr' (with its

2799 implicit change of some global references) is retained for now as

2800 control command, e.g. for ProofGeneral 3.7.x.

2802 * Discontinued 'print_drafts' command with its old-fashioned PS output

2803 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

2804 'display_drafts' instead and print via the regular document viewer.

2806 * Updated and extended "isar-ref" and "implementation" manual,

2807 eliminated old "ref" manual.

2810 *** Prover IDE -- Isabelle/Scala/jEdit ***

2812 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

2813 Documentation panel.

2815 * Dockable window "Documentation" provides access to Isabelle

2816 documentation.

2818 * Dockable window "Find" provides query operations for formal entities

2819 (GUI front-end to 'find_theorems' command).

2821 * Dockable window "Sledgehammer" manages asynchronous / parallel

2822 sledgehammer runs over existing document sources, independently of

2823 normal editing and checking process.

2825 * Dockable window "Timing" provides an overview of relevant command

2826 timing information, depending on option jedit_timing_threshold. The

2827 same timing information is shown in the extended tooltip of the

2828 command keyword, when hovering the mouse over it while the CONTROL or

2829 COMMAND modifier is pressed.

2831 * Improved dockable window "Theories": Continuous checking of proof

2832 document (visible and required parts) may be controlled explicitly,

2833 using check box or shortcut "C+e ENTER". Individual theory nodes may

2834 be marked explicitly as required and checked in full, using check box

2835 or shortcut "C+e SPACE".

2837 * Improved completion mechanism, which is now managed by the

2838 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

2839 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

2841 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

2842 isabelle.complete for explicit completion in Isabelle sources.

2843 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

2844 to resolve conflict.

2846 * Improved support of various "minor modes" for Isabelle NEWS,

2847 options, session ROOT etc., with completion and SideKick tree view.

2849 * Strictly monotonic document update, without premature cancellation of

2850 running transactions that are still needed: avoid reset/restart of

2851 such command executions while editing.

2853 * Support for asynchronous print functions, as overlay to existing

2854 document content.

2856 * Support for automatic tools in HOL, which try to prove or disprove

2857 toplevel theorem statements.

2859 * Action isabelle.reset-font-size resets main text area font size

2860 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

2861 also "Plugin Options / Isabelle / General"). It can be bound to some

2862 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

2864 * File specifications in jEdit (e.g. file browser) may refer to

2865 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

2866 obsolete $ISABELLE_HOME_WINDOWS variable.

2868 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

2869 / Global Options / Appearance".

2871 * Improved support of native Mac OS X functionality via "MacOSX"

2872 plugin, which is now enabled by default.

2875 *** Pure ***

2877 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

2878 In particular, 'interpretation' allows for non-persistent

2879 interpretation within "context ... begin ... end" blocks offering a

2880 light-weight alternative to 'sublocale'. See "isar-ref" manual for

2881 details.

2883 * Improved locales diagnostic command 'print_dependencies'.

2885 * Discontinued obsolete 'axioms' command, which has been marked as

2886 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

2887 instead, while observing its uniform scope for polymorphism.

2889 * Discontinued empty name bindings in 'axiomatization'.

2890 INCOMPATIBILITY.

2892 * System option "proofs" has been discontinued. Instead the global

2893 state of Proofterm.proofs is persistently compiled into logic images

2894 as required, notably HOL-Proofs. Users no longer need to change

2895 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

2897 * Syntax translation functions (print_translation etc.) always depend

2898 on Proof.context. Discontinued former "(advanced)" option -- this is

2899 now the default. Minor INCOMPATIBILITY.

2901 * Former global reference trace_unify_fail is now available as

2902 configuration option "unify_trace_failure" (global context only).

2904 * SELECT_GOAL now retains the syntactic context of the overall goal

2905 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

2906 situations.

2909 *** HOL ***

2911 * Stronger precedence of syntax for big intersection and union on

2912 sets, in accordance with corresponding lattice operations.

2913 INCOMPATIBILITY.

2915 * Notation "{p:A. P}" now allows tuple patterns as well.

2917 * Nested case expressions are now translated in a separate check phase

2918 rather than during parsing. The data for case combinators is separated

2919 from the datatype package. The declaration attribute

2920 "case_translation" can be used to register new case combinators:

2922 declare [[case_translation case_combinator constructor1 ... constructorN]]

2924 * Code generator:

2925 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

2926 'code_instance'.

2927 - 'code_identifier' declares name hints for arbitrary identifiers in

2928 generated code, subsuming 'code_modulename'.

2930 See the isar-ref manual for syntax diagrams, and the HOL theories for

2931 examples.

2933 * Attibute 'code': 'code' now declares concrete and abstract code

2934 equations uniformly. Use explicit 'code equation' and 'code abstract'

2935 to distinguish both when desired.

2937 * Discontinued theories Code_Integer and Efficient_Nat by a more

2938 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

2939 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

2940 generation for details. INCOMPATIBILITY.

2942 * Numeric types are mapped by default to target language numerals:

2943 natural (replaces former code_numeral) and integer (replaces former

2944 code_int). Conversions are available as integer_of_natural /

2945 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

2946 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

2947 ML). INCOMPATIBILITY.

2949 * Function package: For mutually recursive functions f and g, separate

2950 cases rules f.cases and g.cases are generated instead of unusable

2951 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

2952 in the case that the unusable rule was used nevertheless.

2954 * Function package: For each function f, new rules f.elims are

2955 generated, which eliminate equalities of the form "f x = t".

2957 * New command 'fun_cases' derives ad-hoc elimination rules for

2958 function equations as simplified instances of f.elims, analogous to

2959 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

2961 * Lifting:

2962 - parametrized correspondence relations are now supported:

2963 + parametricity theorems for the raw term can be specified in

2964 the command lift_definition, which allow us to generate stronger

2965 transfer rules

2966 + setup_lifting generates stronger transfer rules if parametric

2967 correspondence relation can be generated

2968 + various new properties of the relator must be specified to support

2969 parametricity

2970 + parametricity theorem for the Quotient relation can be specified

2971 - setup_lifting generates domain rules for the Transfer package

2972 - stronger reflexivity prover of respectfulness theorems for type

2973 copies

2974 - ===> and --> are now local. The symbols can be introduced

2975 by interpreting the locale lifting_syntax (typically in an

2976 anonymous context)

2977 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

2978 Main. Potential INCOMPATIBILITY

2979 - new commands for restoring and deleting Lifting/Transfer context:

2980 lifting_forget, lifting_update

2981 - the command print_quotmaps was renamed to print_quot_maps.

2982 INCOMPATIBILITY

2984 * Transfer:

2985 - better support for domains in Transfer: replace Domainp T

2986 by the actual invariant in a transferred goal

2987 - transfer rules can have as assumptions other transfer rules

2988 - Experimental support for transferring from the raw level to the

2989 abstract level: Transfer.transferred attribute

2990 - Attribute version of the transfer method: untransferred attribute

2992 * Reification and reflection:

2993 - Reification is now directly available in HOL-Main in structure

2994 "Reification".

2995 - Reflection now handles multiple lists with variables also.

2996 - The whole reflection stack has been decomposed into conversions.

2997 INCOMPATIBILITY.

2999 * Revised devices for recursive definitions over finite sets:

3000 - Only one fundamental fold combinator on finite set remains:

3001 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

3002 This is now identity on infinite sets.

3003 - Locales ("mini packages") for fundamental definitions with

3004 Finite_Set.fold: folding, folding_idem.

3005 - Locales comm_monoid_set, semilattice_order_set and

3006 semilattice_neutr_order_set for big operators on sets.

3007 See theory Big_Operators for canonical examples.

3008 Note that foundational constants comm_monoid_set.F and

3009 semilattice_set.F correspond to former combinators fold_image

3010 and fold1 respectively. These are now gone. You may use

3011 those foundational constants as substitutes, but it is

3012 preferable to interpret the above locales accordingly.

3013 - Dropped class ab_semigroup_idem_mult (special case of lattice,

3014 no longer needed in connection with Finite_Set.fold etc.)

3015 - Fact renames:

3016 card.union_inter ~> card_Un_Int [symmetric]

3017 card.union_disjoint ~> card_Un_disjoint

3018 INCOMPATIBILITY.

3020 * Locale hierarchy for abstract orderings and (semi)lattices.

3022 * Complete_Partial_Order.admissible is defined outside the type class

3023 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

3024 class predicate assumption or sort constraint when possible.

3025 INCOMPATIBILITY.

3027 * Introduce type class "conditionally_complete_lattice": Like a

3028 complete lattice but does not assume the existence of the top and

3029 bottom elements. Allows to generalize some lemmas about reals and

3030 extended reals. Removed SupInf and replaced it by the instantiation

3031 of conditionally_complete_lattice for real. Renamed lemmas about

3032 conditionally-complete lattice from Sup_... to cSup_... and from

3033 Inf_... to cInf_... to avoid hidding of similar complete lattice

3034 lemmas.

3036 * Introduce type class linear_continuum as combination of

3037 conditionally-complete lattices and inner dense linorders which have

3038 more than one element. INCOMPATIBILITY.

3040 * Introduced type classes order_top and order_bot. The old classes top

3041 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

3042 Rename bot -> order_bot, top -> order_top

3044 * Introduce type classes "no_top" and "no_bot" for orderings without

3045 top and bottom elements.

3047 * Split dense_linorder into inner_dense_order and no_top, no_bot.

3049 * Complex_Main: Unify and move various concepts from

3050 HOL-Multivariate_Analysis to HOL-Complex_Main.

3052 - Introduce type class (lin)order_topology and

3053 linear_continuum_topology. Allows to generalize theorems about

3054 limits and order. Instances are reals and extended reals.

3056 - continuous and continuos_on from Multivariate_Analysis:

3057 "continuous" is the continuity of a function at a filter. "isCont"

3058 is now an abbrevitation: "isCont x f == continuous (at _) f".

3060 Generalized continuity lemmas from isCont to continuous on an

3061 arbitrary filter.

3063 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

3064 compactness of closed intervals on reals. Continuous functions

3065 attain infimum and supremum on compact sets. The inverse of a

3066 continuous function is continuous, when the function is continuous

3067 on a compact set.

3069 - connected from Multivariate_Analysis. Use it to prove the

3070 intermediate value theorem. Show connectedness of intervals on

3071 linear_continuum_topology).

3073 - first_countable_topology from Multivariate_Analysis. Is used to

3074 show equivalence of properties on the neighbourhood filter of x and

3075 on all sequences converging to x.

3077 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

3078 theorems from Library/FDERIV.thy to Deriv.thy and base the

3079 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

3080 which are restricted to sets, i.e. to represent derivatives from

3081 left or right.

3083 - Removed the within-filter. It is replaced by the principal filter:

3085 F within X = inf F (principal X)

3087 - Introduce "at x within U" as a single constant, "at x" is now an

3088 abbreviation for "at x within UNIV"

3090 - Introduce named theorem collections tendsto_intros,

3091 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

3092 in tendsto_intros (or FDERIV_intros) are also available as

3093 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

3094 is replaced by a congruence rule. This allows to apply them as

3095 intro rules and then proving equivalence by the simplifier.

3097 - Restructured theories in HOL-Complex_Main:

3099 + Moved RealDef and RComplete into Real

3101 + Introduced Topological_Spaces and moved theorems about

3102 topological spaces, filters, limits and continuity to it

3104 + Renamed RealVector to Real_Vector_Spaces

3106 + Split Lim, SEQ, Series into Topological_Spaces,

3107 Real_Vector_Spaces, and Limits

3109 + Moved Ln and Log to Transcendental

3111 + Moved theorems about continuity from Deriv to Topological_Spaces

3113 - Remove various auxiliary lemmas.

3115 INCOMPATIBILITY.

3117 * Nitpick:

3118 - Added option "spy".

3119 - Reduce incidence of "too high arity" errors.

3121 * Sledgehammer:

3122 - Renamed option:

3123 isar_shrink ~> isar_compress

3124 INCOMPATIBILITY.

3125 - Added options "isar_try0", "spy".

3126 - Better support for "isar_proofs".

3127 - MaSh has been fined-tuned and now runs as a local server.

3129 * Improved support for ad hoc overloading of constants (see also

3130 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

3132 * Library/Polynomial.thy:

3133 - Use lifting for primitive definitions.

3134 - Explicit conversions from and to lists of coefficients, used for

3135 generated code.

3136 - Replaced recursion operator poly_rec by fold_coeffs.

3137 - Prefer pre-existing gcd operation for gcd.

3138 - Fact renames:

3139 poly_eq_iff ~> poly_eq_poly_eq_iff

3140 poly_ext ~> poly_eqI

3141 expand_poly_eq ~> poly_eq_iff

3142 IMCOMPATIBILITY.

3144 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

3145 case_of_simps to convert function definitions between a list of

3146 equations with patterns on the lhs and a single equation with case

3147 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

3149 * New Library/FSet.thy: type of finite sets defined as a subtype of

3150 sets defined by Lifting/Transfer.

3152 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

3154 * Consolidation of library theories on product orders:

3156 Product_Lattice ~> Product_Order -- pointwise order on products

3157 Product_ord ~> Product_Lexorder -- lexicographic order on products

3159 INCOMPATIBILITY.

3161 * Imperative-HOL: The MREC combinator is considered legacy and no

3162 longer included by default. INCOMPATIBILITY, use partial_function

3163 instead, or import theory Legacy_Mrec as a fallback.

3165 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

3166 ~~/src/HOL/Algebra/poly. Existing theories should be based on

3167 ~~/src/HOL/Library/Polynomial instead. The latter provides

3168 integration with HOL's type classes for rings. INCOMPATIBILITY.

3170 * HOL-BNF:

3171 - Various improvements to BNF-based (co)datatype package, including

3172 new commands "primrec_new", "primcorec", and

3173 "datatype_new_compat", as well as documentation. See

3174 "datatypes.pdf" for details.

3175 - New "coinduction" method to avoid some boilerplate (compared to

3176 coinduct).

3177 - Renamed keywords:

3178 data ~> datatype_new

3179 codata ~> codatatype

3180 bnf_def ~> bnf

3181 - Renamed many generated theorems, including

3182 discs ~> disc

3183 map_comp' ~> map_comp

3184 map_id' ~> map_id

3185 sels ~> sel

3186 set_map' ~> set_map

3187 sets ~> set

3188 IMCOMPATIBILITY.

3191 *** ML ***

3193 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

3194 "check_property" allows to check specifications of the form "ALL x y

3195 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

3196 Examples.thy in particular.

3198 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

3199 tracing output in the command transaction context instead of physical

3200 stdout. See also Toplevel.debug, Toplevel.debugging and

3201 ML_Compiler.exn_trace.

3203 * ML type "theory" is now immutable, without any special treatment of

3204 drafts or linear updates (which could lead to "stale theory" errors in

3205 the past). Discontinued obsolete operations like Theory.copy,

3206 Theory.checkpoint, and the auxiliary type theory_ref. Minor

3207 INCOMPATIBILITY.

3209 * More uniform naming of goal functions for skipped proofs:

3211 Skip_Proof.prove ~> Goal.prove_sorry

3212 Skip_Proof.prove_global ~> Goal.prove_sorry_global

3214 Minor INCOMPATIBILITY.

3216 * Simplifier tactics and tools use proper Proof.context instead of

3217 historic type simpset. Old-style declarations like addsimps,

3218 addsimprocs etc. operate directly on Proof.context. Raw type simpset

3219 retains its use as snapshot of the main Simplifier context, using

3220 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

3221 old tools by making them depend on (ctxt : Proof.context) instead of

3222 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

3224 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

3225 operate on Proof.context instead of claset, for uniformity with addIs,

3226 addEs, addDs etc. Note that claset_of and put_claset allow to manage

3227 clasets separately from the context.

3229 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

3230 INCOMPATIBILITY, use @{context} instead.

3232 * Antiquotation @{theory_context A} is similar to @{theory A}, but

3233 presents the result as initial Proof.context.

3236 *** System ***

3238 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

3239 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

3241 * Discontinued obsolete isabelle-process options -f and -u (former

3242 administrative aliases of option -e). Minor INCOMPATIBILITY.

3244 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

3245 settings variable.

3247 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

3248 document formats: dvi.gz, ps, ps.gz -- the default document format is

3249 always pdf.

3251 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

3252 specify global resources of the JVM process run by isabelle build.

3254 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

3255 to run Isabelle/Scala source files as standalone programs.

3257 * Improved "isabelle keywords" tool (for old-style ProofGeneral

3258 keyword tables): use Isabelle/Scala operations, which inspect outer

3259 syntax without requiring to build sessions first.

3261 * Sessions may be organized via 'chapter' specifications in the ROOT

3262 file, which determines a two-level hierarchy of browser info. The old

3263 tree-like organization via implicit sub-session relation (with its

3264 tendency towards erratic fluctuation of URLs) has been discontinued.

3265 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

3266 for HTML presentation of theories.

3270 New in Isabelle2013 (February 2013)

3271 -----------------------------------

3273 *** General ***

3275 * Theorem status about oracles and unfinished/failed future proofs is

3276 no longer printed by default, since it is incompatible with

3277 incremental / parallel checking of the persistent document model. ML

3278 function Thm.peek_status may be used to inspect a snapshot of the

3279 ongoing evaluation process. Note that in batch mode --- notably

3280 isabelle build --- the system ensures that future proofs of all

3281 accessible theorems in the theory context are finished (as before).

3283 * Configuration option show_markup controls direct inlining of markup

3284 into the printed representation of formal entities --- notably type

3285 and sort constraints. This enables Prover IDE users to retrieve that

3286 information via tooltips in the output window, for example.

3288 * Command 'ML_file' evaluates ML text from a file directly within the

3289 theory, without any predeclaration via 'uses' in the theory header.

3291 * Old command 'use' command and corresponding keyword 'uses' in the

3292 theory header are legacy features and will be discontinued soon.

3293 Tools that load their additional source files may imitate the

3294 'ML_file' implementation, such that the system can take care of

3295 dependencies properly.

3297 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

3298 is called fastforce / fast_force_tac already since Isabelle2011-1.

3300 * Updated and extended "isar-ref" and "implementation" manual, reduced

3301 remaining material in old "ref" manual.

3303 * Improved support for auxiliary contexts that indicate block structure

3304 for specifications. Nesting of "context fixes ... context assumes ..."

3305 and "class ... context ...".

3307 * Attribute "consumes" allows a negative value as well, which is

3308 interpreted relatively to the total number of premises of the rule in

3309 the target context. This form of declaration is stable when exported

3310 from a nested 'context' with additional assumptions. It is the

3311 preferred form for definitional packages, notably cases/rules produced

3312 in HOL/inductive and HOL/function.

3314 * More informative error messages for Isar proof commands involving

3315 lazy enumerations (method applications etc.).

3317 * Refined 'help' command to retrieve outer syntax commands according

3318 to name patterns (with clickable results).

3321 *** Prover IDE -- Isabelle/Scala/jEdit ***

3323 * Parallel terminal proofs ('by') are enabled by default, likewise

3324 proofs that are built into packages like 'datatype', 'function'. This

3325 allows to "run ahead" checking the theory specifications on the

3326 surface, while the prover is still crunching on internal

3327 justifications. Unfinished / cancelled proofs are restarted as

3328 required to complete full proof checking eventually.

3330 * Improved output panel with tooltips, hyperlinks etc. based on the

3331 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

3332 tooltips leads to some window that supports the same recursively,

3333 which can lead to stacks of tooltips as the semantic document content

3334 is explored. ESCAPE closes the whole stack, individual windows may be

3335 closed separately, or detached to become independent jEdit dockables.

3337 * Improved support for commands that produce graph output: the text

3338 message contains a clickable area to open a new instance of the graph

3339 browser on demand.

3341 * More robust incremental parsing of outer syntax (partial comments,

3342 malformed symbols). Changing the balance of open/close quotes and

3343 comment delimiters works more conveniently with unfinished situations

3344 that frequently occur in user interaction.

3346 * More efficient painting and improved reactivity when editing large

3347 files. More scalable management of formal document content.

3349 * Smarter handling of tracing messages: prover process pauses after

3350 certain number of messages per command transaction, with some user

3351 dialog to stop or continue. This avoids swamping the front-end with

3352 potentially infinite message streams.

3354 * More plugin options and preferences, based on Isabelle/Scala. The

3355 jEdit plugin option panel provides access to some Isabelle/Scala

3356 options, including tuning parameters for editor reactivity and color

3357 schemes.

3359 * Dockable window "Symbols" provides some editing support for Isabelle

3360 symbols.

3362 * Dockable window "Monitor" shows ML runtime statistics. Note that

3363 continuous display of the chart slows down the system.

3365 * Improved editing support for control styles: subscript, superscript,

3366 bold, reset of style -- operating on single symbols or text

3367 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

3369 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

3370 adjust the main text area font size, and its derivatives for output,

3371 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

3372 need to be adapted to local keyboard layouts.

3374 * More reactive completion popup by default: use \t (TAB) instead of

3375 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

3376 also "Plugin Options / SideKick / General / Code Completion Options".

3378 * Implicit check and build dialog of the specified logic session

3379 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

3380 demand, without bundling big platform-dependent heap images in the

3381 Isabelle distribution.

3383 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

3384 from Oracle provide better multi-platform experience. This version is

3385 now bundled exclusively with Isabelle.

3388 *** Pure ***

3390 * Code generation for Haskell: restrict unqualified imports from

3391 Haskell Prelude to a small set of fundamental operations.

3393 * Command 'export_code': relative file names are interpreted

3394 relatively to master directory of current theory rather than the

3395 rather arbitrary current working directory. INCOMPATIBILITY.

3397 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

3398 use regular rule composition via "OF" / "THEN", or explicit proof

3399 structure instead. Note that Isabelle/ML provides a variety of

3400 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

3401 with some care where this is really required.

3403 * Command 'typ' supports an additional variant with explicit sort

3404 constraint, to infer and check the most general type conforming to a

3405 given sort. Example (in HOL):

3407 typ "_ * _ * bool * unit" :: finite

3409 * Command 'locale_deps' visualizes all locales and their relations as

3410 a Hasse diagram.

3413 *** HOL ***

3415 * Sledgehammer:

3417 - Added MaSh relevance filter based on machine-learning; see the

3418 Sledgehammer manual for details.

3419 - Polished Isar proofs generated with "isar_proofs" option.

3420 - Rationalized type encodings ("type_enc" option).

3421 - Renamed "kill_provers" subcommand to "kill_all".

3422 - Renamed options:

3423 isar_proof ~> isar_proofs

3424 isar_shrink_factor ~> isar_shrink

3425 max_relevant ~> max_facts

3426 relevance_thresholds ~> fact_thresholds

3428 * Quickcheck: added an optimisation for equality premises. It is

3429 switched on by default, and can be switched off by setting the

3430 configuration quickcheck_optimise_equality to false.

3432 * Quotient: only one quotient can be defined by quotient_type

3433 INCOMPATIBILITY.

3435 * Lifting:

3436 - generation of an abstraction function equation in lift_definition

3437 - quot_del attribute

3438 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

3440 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

3441 expressions.

3443 * Preprocessing of the code generator rewrites set comprehensions into

3444 pointfree expressions.

3446 * The SMT solver Z3 has now by default a restricted set of directly

3447 supported features. For the full set of features (div/mod, nonlinear

3448 arithmetic, datatypes/records) with potential proof reconstruction

3449 failures, enable the configuration option "z3_with_extensions". Minor

3450 INCOMPATIBILITY.

3452 * Simplified 'typedef' specifications: historical options for implicit

3453 set definition and alternative name have been discontinued. The

3454 former behavior of "typedef (open) t = A" is now the default, but

3455 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

3456 accordingly.

3458 * Removed constant "chars"; prefer "Enum.enum" on type "char"

3459 directly. INCOMPATIBILITY.

3461 * Moved operation product, sublists and n_lists from theory Enum to

3462 List. INCOMPATIBILITY.

3464 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

3466 * Class "comm_monoid_diff" formalises properties of bounded

3467 subtraction, with natural numbers and multisets as typical instances.

3469 * Added combinator "Option.these" with type "'a option set => 'a set".

3471 * Theory "Transitive_Closure": renamed lemmas

3473 reflcl_tranclp -> reflclp_tranclp

3474 rtranclp_reflcl -> rtranclp_reflclp

3476 INCOMPATIBILITY.

3478 * Theory "Rings": renamed lemmas (in class semiring)

3480 left_distrib ~> distrib_right

3481 right_distrib ~> distrib_left

3483 INCOMPATIBILITY.

3485 * Generalized the definition of limits:

3487 - Introduced the predicate filterlim (LIM x F. f x :> G) which

3488 expresses that when the input values x converge to F then the

3489 output f x converges to G.

3491 - Added filters for convergence to positive (at_top) and negative

3492 infinity (at_bot).

3494 - Moved infinity in the norm (at_infinity) from

3495 Multivariate_Analysis to Complex_Main.

3497 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

3498 at_top".

3500 INCOMPATIBILITY.

3502 * Theory "Library/Option_ord" provides instantiation of option type to

3503 lattice type classes.

3505 * Theory "Library/Multiset": renamed

3507 constant fold_mset ~> Multiset.fold

3508 fact fold_mset_commute ~> fold_mset_comm

3510 INCOMPATIBILITY.

3512 * Renamed theory Library/List_Prefix to Library/Sublist, with related

3513 changes as follows.

3515 - Renamed constants (and related lemmas)

3517 prefix ~> prefixeq

3518 strict_prefix ~> prefix

3520 - Replaced constant "postfix" by "suffixeq" with swapped argument

3521 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

3522 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

3523 Renamed lemmas accordingly.

3525 - Added constant "list_hembeq" for homeomorphic embedding on

3526 lists. Added abbreviation "sublisteq" for special case

3527 "list_hembeq (op =)".

3529 - Theory Library/Sublist no longer provides "order" and "bot" type

3530 class instances for the prefix order (merely corresponding locale

3531 interpretations). The type class instances are now in theory

3532 Library/Prefix_Order.

3534 - The sublist relation of theory Library/Sublist_Order is now based

3535 on "Sublist.sublisteq". Renamed lemmas accordingly:

3537 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

3538 le_list_append_mono ~> Sublist.list_hembeq_append_mono

3539 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

3540 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

3541 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

3542 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

3543 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

3544 le_list_drop_many ~> Sublist.sublisteq_drop_many

3545 le_list_filter_left ~> Sublist.sublisteq_filter_left

3546 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

3547 le_list_rev_take_iff ~> Sublist.sublisteq_append

3548 le_list_same_length ~> Sublist.sublisteq_same_length

3549 le_list_take_many_iff ~> Sublist.sublisteq_append'

3550 less_eq_list.drop ~> less_eq_list_drop

3551 less_eq_list.induct ~> less_eq_list_induct

3552 not_le_list_length ~> Sublist.not_sublisteq_length

3554 INCOMPATIBILITY.

3556 * New theory Library/Countable_Set.

3558 * Theory Library/Debug and Library/Parallel provide debugging and

3559 parallel execution for code generated towards Isabelle/ML.

3561 * Theory Library/FuncSet: Extended support for Pi and extensional and

3562 introduce the extensional dependent function space "PiE". Replaced

3563 extensional_funcset by an abbreviation, and renamed lemmas from

3564 extensional_funcset to PiE as follows:

3566 extensional_empty ~> PiE_empty

3567 extensional_funcset_empty_domain ~> PiE_empty_domain

3568 extensional_funcset_empty_range ~> PiE_empty_range

3569 extensional_funcset_arb ~> PiE_arb

3570 extensional_funcset_mem ~> PiE_mem

3571 extensional_funcset_extend_domainI ~> PiE_fun_upd

3572 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

3573 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

3574 card_extensional_funcset ~> card_PiE

3575 finite_extensional_funcset ~> finite_PiE

3577 INCOMPATIBILITY.

3579 * Theory Library/FinFun: theory of almost everywhere constant

3580 functions (supersedes the AFP entry "Code Generation for Functions as

3581 Data").

3583 * Theory Library/Phantom: generic phantom type to make a type

3584 parameter appear in a constant's type. This alternative to adding

3585 TYPE('a) as another parameter avoids unnecessary closures in generated

3586 code.

3588 * Theory Library/RBT_Impl: efficient construction of red-black trees

3589 from sorted associative lists. Merging two trees with rbt_union may

3590 return a structurally different tree than before. Potential

3591 INCOMPATIBILITY.

3593 * Theory Library/IArray: immutable arrays with code generation.

3595 * Theory Library/Finite_Lattice: theory of finite lattices.

3597 * HOL/Multivariate_Analysis: replaced

3599 "basis :: 'a::euclidean_space => nat => real"

3600 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

3602 on euclidean spaces by using the inner product "_ \<bullet> _" with

3603 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

3604 "SUM i : Basis. f i * r i".

3606 With this change the following constants are also changed or removed:

3608 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

3609 a $$ i ~> inner a i (where i : Basis)

3610 cart_base i removed

3611 \<pi>, \<pi>' removed

3613 Theorems about these constants where removed.

3615 Renamed lemmas:

3617 component_le_norm ~> Basis_le_norm

3618 euclidean_eq ~> euclidean_eq_iff

3619 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

3620 euclidean_simps ~> inner_simps

3621 independent_basis ~> independent_Basis

3622 span_basis ~> span_Basis

3623 in_span_basis ~> in_span_Basis

3624 norm_bound_component_le ~> norm_boound_Basis_le

3625 norm_bound_component_lt ~> norm_boound_Basis_lt

3626 component_le_infnorm ~> Basis_le_infnorm

3628 INCOMPATIBILITY.

3630 * HOL/Probability:

3632 - Added simproc "measurable" to automatically prove measurability.

3634 - Added induction rules for sigma sets with disjoint union

3635 (sigma_sets_induct_disjoint) and for Borel-measurable functions

3636 (borel_measurable_induct).

3638 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

3639 projective family).

3641 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

3642 AFP entry "Ordinals_and_Cardinals").

3644 * HOL/BNF: New (co)datatype package based on bounded natural functors

3645 with support for mixed, nested recursion and interesting non-free

3646 datatypes.

3648 * HOL/Finite_Set and Relation: added new set and relation operations

3649 expressed by Finite_Set.fold.

3651 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

3652 trees for the code generator.

3654 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

3655 Lifting/Transfer.

3656 possible INCOMPATIBILITY.

3658 * HOL/Set: renamed Set.project -> Set.filter

3659 INCOMPATIBILITY.

3662 *** Document preparation ***

3664 * Dropped legacy antiquotations "term_style" and "thm_style", since

3665 styles may be given as arguments to "term" and "thm" already.

3666 Discontinued legacy styles "prem1" .. "prem19".

3668 * Default LaTeX rendering for \<euro> is now based on eurosym package,

3669 instead of slightly exotic babel/greek.

3671 * Document variant NAME may use different LaTeX entry point

3672 document/root_NAME.tex if that file exists, instead of the common

3673 document/root.tex.

3675 * Simplified custom document/build script, instead of old-style

3676 document/IsaMakefile. Minor INCOMPATIBILITY.

3679 *** ML ***

3681 * The default limit for maximum number of worker threads is now 8,

3682 instead of 4, in correspondence to capabilities of contemporary

3683 hardware and Poly/ML runtime system.

3685 * Type Seq.results and related operations support embedded error

3686 messages within lazy enumerations, and thus allow to provide

3687 informative errors in the absence of any usable results.

3689 * Renamed Position.str_of to Position.here to emphasize that this is a

3690 formal device to inline positions into message text, but not

3691 necessarily printing visible text.

3694 *** System ***

3696 * Advanced support for Isabelle sessions and build management, see

3697 "system" manual for the chapter of that name, especially the "isabelle

3698 build" tool and its examples. The "isabelle mkroot" tool prepares

3699 session root directories for use with "isabelle build", similar to

3700 former "isabelle mkdir" for "isabelle usedir". Note that this affects

3701 document preparation as well. INCOMPATIBILITY, isabelle usedir /

3702 mkdir / make are rendered obsolete.

3704 * Discontinued obsolete Isabelle/build script, it is superseded by the

3705 regular isabelle build tool. For example:

3707 isabelle build -s -b HOL

3709 * Discontinued obsolete "isabelle makeall".

3711 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

3712 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

3713 provides some traditional targets that invoke "isabelle build". Note

3714 that this is inefficient! Applications of Isabelle/HOL involving

3715 "isabelle make" should be upgraded to use "isabelle build" directly.

3717 * The "isabelle options" tool prints Isabelle system options, as

3718 required for "isabelle build", for example.

3720 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

3721 Minor INCOMPATIBILITY in command-line options.

3723 * The "isabelle install" tool has now a simpler command-line. Minor

3724 INCOMPATIBILITY.

3726 * The "isabelle components" tool helps to resolve add-on components

3727 that are not bundled, or referenced from a bare-bones repository

3728 version of Isabelle.

3730 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

3731 platform family: "linux", "macos", "windows".

3733 * The ML system is configured as regular component, and no longer

3734 picked up from some surrounding directory. Potential INCOMPATIBILITY

3735 for home-made settings.

3737 * Improved ML runtime statistics (heap, threads, future tasks etc.).

3739 * Discontinued support for Poly/ML 5.2.1, which was the last version

3740 without exception positions and advanced ML compiler/toplevel

3741 configuration.

3743 * Discontinued special treatment of Proof General -- no longer guess

3744 PROOFGENERAL_HOME based on accidental file-system layout. Minor

3745 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

3746 settings manually, or use a Proof General version that has been

3747 bundled as Isabelle component.

3751 New in Isabelle2012 (May 2012)

3752 ------------------------------

3754 *** General ***

3756 * Prover IDE (PIDE) improvements:

3758 - more robust Sledgehammer integration (as before the sledgehammer

3759 command-line needs to be typed into the source buffer)

3760 - markup for bound variables

3761 - markup for types of term variables (displayed as tooltips)

3762 - support for user-defined Isar commands within the running session

3763 - improved support for Unicode outside original 16bit range

3764 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

3766 * Forward declaration of outer syntax keywords within the theory

3767 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

3768 commands to be used in the same theory where defined.

3770 * Auxiliary contexts indicate block structure for specifications with

3771 additional parameters and assumptions. Such unnamed contexts may be

3772 nested within other targets, like 'theory', 'locale', 'class',

3773 'instantiation' etc. Results from the local context are generalized

3774 accordingly and applied to the enclosing target context. Example:

3776 context

3777 fixes x y z :: 'a

3778 assumes xy: "x = y" and yz: "y = z"

3779 begin

3781 lemma my_trans: "x = z" using xy yz by simp

3783 end

3785 thm my_trans

3787 The most basic application is to factor-out context elements of

3788 several fixes/assumes/shows theorem statements, e.g. see

3789 ~~/src/HOL/Isar_Examples/Group_Context.thy

3791 Any other local theory specification element works within the "context

3792 ... begin ... end" block as well.

3794 * Bundled declarations associate attributed fact expressions with a

3795 given name in the context. These may be later included in other

3796 contexts. This allows to manage context extensions casually, without

3797 the logical dependencies of locales and locale interpretation. See

3798 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

3800 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

3801 declaration, and results are standardized before being stored. Thus

3802 old-style "standard" after instantiation or composition of facts

3803 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

3804 indices of schematic variables.

3806 * Rule attributes in local theory declarations (e.g. locale or class)

3807 are now statically evaluated: the resulting theorem is stored instead

3808 of the original expression. INCOMPATIBILITY in rare situations, where

3809 the historic accident of dynamic re-evaluation in interpretations

3810 etc. was exploited.

3812 * New tutorial "Programming and Proving in Isabelle/HOL"

3813 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

3814 Structured Isar Proofs" ("isar-overview"), which has been removed. It

3815 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

3816 Logic" as the recommended beginners tutorial, but does not cover all

3817 of the material of that old tutorial.

3819 * Updated and extended reference manuals: "isar-ref",

3820 "implementation", "system"; reduced remaining material in old "ref"

3821 manual.

3824 *** Pure ***

3826 * Command 'definition' no longer exports the foundational "raw_def"

3827 into the user context. Minor INCOMPATIBILITY, may use the regular

3828 "def" result with attribute "abs_def" to imitate the old version.

3830 * Attribute "abs_def" turns an equation of the form "f x y == t" into

3831 "f == %x y. t", which ensures that "simp" or "unfold" steps always

3832 expand it. This also works for object-logic equality. (Formerly

3833 undocumented feature.)

3835 * Sort constraints are now propagated in simultaneous statements, just

3836 like type constraints. INCOMPATIBILITY in rare situations, where

3837 distinct sorts used to be assigned accidentally. For example:

3839 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

3841 lemma "P (x::'a)" and "Q (y::'a::bar)"

3842 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

3844 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

3845 tolerant against multiple unifiers, as long as the final result is

3846 unique. (As before, rules are composed in canonical right-to-left

3847 order to accommodate newly introduced premises.)

3849 * Renamed some inner syntax categories:

3851 num ~> num_token

3852 xnum ~> xnum_token

3853 xstr ~> str_token

3855 Minor INCOMPATIBILITY. Note that in practice "num_const" or

3856 "num_position" etc. are mainly used instead (which also include

3857 position information via constraints).

3859 * Simplified configuration options for syntax ambiguity: see

3860 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

3861 manual. Minor INCOMPATIBILITY.

3863 * Discontinued configuration option "syntax_positions": atomic terms

3864 in parse trees are always annotated by position constraints.

3866 * Old code generator for SML and its commands 'code_module',

3867 'code_library', 'consts_code', 'types_code' have been discontinued.

3868 Use commands of the generic code generator instead. INCOMPATIBILITY.

3870 * Redundant attribute "code_inline" has been discontinued. Use

3871 "code_unfold" instead. INCOMPATIBILITY.

3873 * Dropped attribute "code_unfold_post" in favor of the its dual

3874 "code_abbrev", which yields a common pattern in definitions like

3876 definition [code_abbrev]: "f = t"

3878 INCOMPATIBILITY.

3880 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

3881 instead. INCOMPATIBILITY.

3883 * Discontinued old "prems" fact, which used to refer to the accidental

3884 collection of foundational premises in the context (already marked as

3885 legacy since Isabelle2011).

3888 *** HOL ***

3890 * Type 'a set is now a proper type constructor (just as before

3891 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

3892 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

3893 sets separate, it is often sufficient to rephrase some set S that has

3894 been accidentally used as predicates by "%x. x : S", and some

3895 predicate P that has been accidentally used as set by "{x. P x}".

3896 Corresponding proofs in a first step should be pruned from any

3897 tinkering with former theorems mem_def and Collect_def as far as

3898 possible.

3900 For developments which deliberately mix predicates and sets, a

3901 planning step is necessary to determine what should become a predicate

3902 and what a set. It can be helpful to carry out that step in

3903 Isabelle2011-1 before jumping right into the current release.

3905 * Code generation by default implements sets as container type rather

3906 than predicates. INCOMPATIBILITY.

3908 * New type synonym 'a rel = ('a * 'a) set

3910 * The representation of numerals has changed. Datatype "num"

3911 represents strictly positive binary numerals, along with functions

3912 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent

3913 positive and negated numeric literals, respectively. See also

3914 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

3915 user theories may require adaptations as follows:

3917 - Theorems with number_ring or number_semiring constraints: These

3918 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

3920 - Theories defining numeric types: Remove number, number_semiring,

3921 and number_ring instances. Defer all theorems about numerals until

3922 after classes one and semigroup_add have been instantiated.

3924 - Numeral-only simp rules: Replace each rule having a "number_of v"

3925 pattern with two copies, one for numeral and one for neg_numeral.

3927 - Theorems about subclasses of semiring_1 or ring_1: These classes

3928 automatically support numerals now, so more simp rules and

3929 simprocs may now apply within the proof.

3931 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

3932 Redefine using other integer operations.

3934 * Transfer: New package intended to generalize the existing

3935 "descending" method and related theorem attributes from the Quotient

3936 package. (Not all functionality is implemented yet, but future

3937 development will focus on Transfer as an eventual replacement for the

3938 corresponding parts of the Quotient package.)

3940 - transfer_rule attribute: Maintains a collection of transfer rules,

3941 which relate constants at two different types. Transfer rules may

3942 relate different type instances of the same polymorphic constant,

3943 or they may relate an operation on a raw type to a corresponding

3944 operation on an abstract type (quotient or subtype). For example:

3946 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map

3947 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int

3949 - transfer method: Replaces a subgoal on abstract types with an

3950 equivalent subgoal on the corresponding raw types. Constants are

3951 replaced with corresponding ones according to the transfer rules.

3952 Goals are generalized over all free variables by default; this is

3953 necessary for variables whose types change, but can be overridden

3954 for specific variables with e.g. "transfer fixing: x y z". The

3955 variant transfer' method allows replacing a subgoal with one that

3956 is logically stronger (rather than equivalent).

3958 - relator_eq attribute: Collects identity laws for relators of

3959 various type constructors, e.g. "list_all2 (op =) = (op =)". The

3960 transfer method uses these lemmas to infer transfer rules for

3961 non-polymorphic constants on the fly.

3963 - transfer_prover method: Assists with proving a transfer rule for a

3964 new constant, provided the constant is defined in terms of other

3965 constants that already have transfer rules. It should be applied

3966 after unfolding the constant definitions.

3968 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

3969 from type nat to type int.

3971 * Lifting: New package intended to generalize the quotient_definition

3972 facility of the Quotient package; designed to work with Transfer.

3974 - lift_definition command: Defines operations on an abstract type in

3975 terms of a corresponding operation on a representation

3976 type. Example syntax:

3978 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"

3979 is List.insert

3981 Users must discharge a respectfulness proof obligation when each

3982 constant is defined. (For a type copy, i.e. a typedef with UNIV,

3983 the proof is discharged automatically.) The obligation is

3984 presented in a user-friendly, readable form; a respectfulness

3985 theorem in the standard format and a transfer rule are generated

3986 by the package.

3988 - Integration with code_abstype: For typedefs (e.g. subtypes

3989 corresponding to a datatype invariant, such as dlist),

3990 lift_definition generates a code certificate theorem and sets up

3991 code generation for each constant.

3993 - setup_lifting command: Sets up the Lifting package to work with a

3994 user-defined type. The user must provide either a quotient theorem

3995 or a type_definition theorem. The package configures transfer

3996 rules for equality and quantifiers on the type, and sets up the

3997 lift_definition command to work with the type.

3999 - Usage examples: See Quotient_Examples/Lift_DList.thy,

4000 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

4001 Word/Word.thy and Library/Float.thy.

4003 * Quotient package:

4005 - The 'quotient_type' command now supports a 'morphisms' option with

4006 rep and abs functions, similar to typedef.

4008 - 'quotient_type' sets up new types to work with the Lifting and

4009 Transfer packages, as with 'setup_lifting'.

4011 - The 'quotient_definition' command now requires the user to prove a

4012 respectfulness property at the point where the constant is

4013 defined, similar to lift_definition; INCOMPATIBILITY.

4015 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

4016 accordingly, INCOMPATIBILITY.

4018 * New diagnostic command 'find_unused_assms' to find potentially

4019 superfluous assumptions in theorems using Quickcheck.

4021 * Quickcheck:

4023 - Quickcheck returns variable assignments as counterexamples, which

4024 allows to reveal the underspecification of functions under test.

4025 For example, refuting "hd xs = x", it presents the variable

4026 assignment xs = [] and x = a1 as a counterexample, assuming that

4027 any property is false whenever "hd []" occurs in it.

4029 These counterexample are marked as potentially spurious, as

4030 Quickcheck also returns "xs = []" as a counterexample to the

4031 obvious theorem "hd xs = hd xs".

4033 After finding a potentially spurious counterexample, Quickcheck

4034 continues searching for genuine ones.

4036 By default, Quickcheck shows potentially spurious and genuine

4037 counterexamples. The option "genuine_only" sets quickcheck to only

4038 show genuine counterexamples.

4040 - The command 'quickcheck_generator' creates random and exhaustive

4041 value generators for a given type and operations.

4043 It generates values by using the operations as if they were

4044 constructors of that type.

4046 - Support for multisets.

4048 - Added "use_subtype" options.

4050 - Added "quickcheck_locale" configuration to specify how to process

4051 conjectures in a locale context.

4053 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

4054 and affecting 'rat' and 'real'.

4056 * Sledgehammer:

4057 - Integrated more tightly with SPASS, as described in the ITP 2012

4058 paper "More SPASS with Isabelle".

4059 - Made it try "smt" as a fallback if "metis" fails or times out.

4060 - Added support for the following provers: Alt-Ergo (via Why3 and

4061 TFF1), iProver, iProver-Eq.

4062 - Sped up the minimizer.

4063 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

4064 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

4065 - Renamed "sound" option to "strict".

4067 * Metis: Added possibility to specify lambda translations scheme as a

4068 parenthesized argument (e.g., "by (metis (lifting) ...)").

4070 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

4072 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

4074 * New "case_product" attribute to generate a case rule doing multiple

4075 case distinctions at the same time. E.g.

4077 list.exhaust [case_product nat.exhaust]

4079 produces a rule which can be used to perform case distinction on both

4080 a list and a nat.

4082 * New "eventually_elim" method as a generalized variant of the

4083 eventually_elim* rules. Supports structured proofs.

4085 * Typedef with implicit set definition is considered legacy. Use

4086 "typedef (open)" form instead, which will eventually become the

4087 default.

4089 * Record: code generation can be switched off manually with

4091 declare [[record_coden = false]] -- "default true"

4093 * Datatype: type parameters allow explicit sort constraints.

4095 * Concrete syntax for case expressions includes constraints for source

4096 positions, and thus produces Prover IDE markup for its bindings.

4097 INCOMPATIBILITY for old-style syntax translations that augment the

4098 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of

4099 one_case.

4101 * Clarified attribute "mono_set": pure declaration without modifying

4102 the result of the fact expression.

4104 * More default pred/set conversions on a couple of relation operations

4105 and predicates. Added powers of predicate relations. Consolidation

4106 of some relation theorems:

4108 converse_def ~> converse_unfold

4109 rel_comp_def ~> relcomp_unfold

4110 symp_def ~> (modified, use symp_def and sym_def instead)

4111 transp_def ~> transp_trans

4112 Domain_def ~> Domain_unfold

4113 Range_def ~> Domain_converse [symmetric]

4115 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

4117 See theory "Relation" for examples for making use of pred/set

4118 conversions by means of attributes "to_set" and "to_pred".

4120 INCOMPATIBILITY.

4122 * Renamed facts about the power operation on relations, i.e., relpow

4123 to match the constant's name:

4125 rel_pow_1 ~> relpow_1

4126 rel_pow_0_I ~> relpow_0_I

4127 rel_pow_Suc_I ~> relpow_Suc_I

4128 rel_pow_Suc_I2 ~> relpow_Suc_I2

4129 rel_pow_0_E ~> relpow_0_E

4130 rel_pow_Suc_E ~> relpow_Suc_E

4131 rel_pow_E ~> relpow_E

4132 rel_pow_Suc_D2 ~> relpow_Suc_D2

4133 rel_pow_Suc_E2 ~> relpow_Suc_E2

4134 rel_pow_Suc_D2' ~> relpow_Suc_D2'

4135 rel_pow_E2 ~> relpow_E2

4136 rel_pow_add ~> relpow_add

4137 rel_pow_commute ~> relpow

4138 rel_pow_empty ~> relpow_empty:

4139 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

4140 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

4141 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

4142 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

4143 rel_pow_fun_conv ~> relpow_fun_conv

4144 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

4145 rel_pow_finite_bounded ~> relpow_finite_bounded

4146 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

4147 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

4148 single_valued_rel_pow ~> single_valued_relpow

4150 INCOMPATIBILITY.

4152 * Theory Relation: Consolidated constant name for relation composition

4153 and corresponding theorem names:

4155 - Renamed constant rel_comp to relcomp.

4157 - Dropped abbreviation pred_comp. Use relcompp instead.

4159 - Renamed theorems:

4161 rel_compI ~> relcompI

4162 rel_compEpair ~> relcompEpair

4163 rel_compE ~> relcompE

4164 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

4165 rel_comp_empty1 ~> relcomp_empty1

4166 rel_comp_mono ~> relcomp_mono

4167 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

4168 rel_comp_distrib ~> relcomp_distrib

4169 rel_comp_distrib2 ~> relcomp_distrib2

4170 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

4171 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

4172 single_valued_rel_comp ~> single_valued_relcomp

4173 rel_comp_def ~> relcomp_unfold

4174 converse_rel_comp ~> converse_relcomp

4175 pred_compI ~> relcomppI

4176 pred_compE ~> relcomppE

4177 pred_comp_bot1 ~> relcompp_bot1

4178 pred_comp_bot2 ~> relcompp_bot2

4179 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

4180 pred_comp_mono ~> relcompp_mono

4181 pred_comp_distrib ~> relcompp_distrib

4182 pred_comp_distrib2 ~> relcompp_distrib2

4183 converse_pred_comp ~> converse_relcompp

4185 finite_rel_comp ~> finite_relcomp

4187 set_rel_comp ~> set_relcomp

4189 INCOMPATIBILITY.

4191 * Theory Divides: Discontinued redundant theorems about div and mod.

4192 INCOMPATIBILITY, use the corresponding generic theorems instead.

4194 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

4195 zdiv_self ~> div_self

4196 zmod_self ~> mod_self

4197 zdiv_zero ~> div_0

4198 zmod_zero ~> mod_0

4199 zdiv_zmod_equality ~> div_mod_equality2

4200 zdiv_zmod_equality2 ~> div_mod_equality

4201 zmod_zdiv_trivial ~> mod_div_trivial

4202 zdiv_zminus_zminus ~> div_minus_minus

4203 zmod_zminus_zminus ~> mod_minus_minus

4204 zdiv_zminus2 ~> div_minus_right

4205 zmod_zminus2 ~> mod_minus_right

4206 zdiv_minus1_right ~> div_minus1_right

4207 zmod_minus1_right ~> mod_minus1_right

4208 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

4209 zmod_zmult1_eq ~> mod_mult_right_eq

4210 zpower_zmod ~> power_mod

4211 zdvd_zmod ~> dvd_mod

4212 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

4213 mod_mult_distrib ~> mult_mod_left

4214 mod_mult_distrib2 ~> mult_mod_right

4216 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

4217 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

4219 * Finite_Set.fold now qualified. INCOMPATIBILITY.

4221 * Consolidated theorem names concerning fold combinators:

4223 inf_INFI_fold_inf ~> inf_INF_fold_inf

4224 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

4225 INFI_fold_inf ~> INF_fold_inf

4226 SUPR_fold_sup ~> SUP_fold_sup

4227 union_set ~> union_set_fold

4228 minus_set ~> minus_set_fold

4229 INFI_set_fold ~> INF_set_fold

4230 SUPR_set_fold ~> SUP_set_fold

4231 INF_code ~> INF_set_foldr

4232 SUP_code ~> SUP_set_foldr

4233 foldr.simps ~> foldr.simps (in point-free formulation)

4234 foldr_fold_rev ~> foldr_conv_fold

4235 foldl_fold ~> foldl_conv_fold

4236 foldr_foldr ~> foldr_conv_foldl

4237 foldl_foldr ~> foldl_conv_foldr

4238 fold_set_remdups ~> fold_set_fold_remdups

4239 fold_set ~> fold_set_fold

4240 fold1_set ~> fold1_set_fold

4242 INCOMPATIBILITY.

4244 * Dropped rarely useful theorems concerning fold combinators:

4245 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

4246 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

4247 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

4248 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

4249 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

4250 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

4251 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"

4252 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be

4253 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by

4254 unfolding "foldr_conv_fold" and "foldl_conv_fold".

4256 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

4257 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

4258 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

4259 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

4260 lemmas over fold rather than foldr, or make use of lemmas

4261 fold_conv_foldr and fold_rev.

4263 * Congruence rules Option.map_cong and Option.bind_cong for recursion

4264 through option types.

4266 * "Transitive_Closure.ntrancl": bounded transitive closure on

4267 relations.

4269 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

4271 * Theory Int: Discontinued many legacy theorems specific to type int.

4272 INCOMPATIBILITY, use the corresponding generic theorems instead.

4274 zminus_zminus ~> minus_minus

4275 zminus_0 ~> minus_zero

4276 zminus_zadd_distrib ~> minus_add_distrib

4277 zadd_commute ~> add_commute

4278 zadd_assoc ~> add_assoc

4279 zadd_left_commute ~> add_left_commute

4280 zadd_ac ~> add_ac

4281 zmult_ac ~> mult_ac

4282 zadd_0 ~> add_0_left

4283 zadd_0_right ~> add_0_right

4284 zadd_zminus_inverse2 ~> left_minus

4285 zmult_zminus ~> mult_minus_left

4286 zmult_commute ~> mult_commute

4287 zmult_assoc ~> mult_assoc

4288 zadd_zmult_distrib ~> left_distrib

4289 zadd_zmult_distrib2 ~> right_distrib

4290 zdiff_zmult_distrib ~> left_diff_distrib

4291 zdiff_zmult_distrib2 ~> right_diff_distrib

4292 zmult_1 ~> mult_1_left

4293 zmult_1_right ~> mult_1_right

4294 zle_refl ~> order_refl

4295 zle_trans ~> order_trans

4296 zle_antisym ~> order_antisym

4297 zle_linear ~> linorder_linear

4298 zless_linear ~> linorder_less_linear

4299 zadd_left_mono ~> add_left_mono

4300 zadd_strict_right_mono ~> add_strict_right_mono

4301 zadd_zless_mono ~> add_less_le_mono

4302 int_0_less_1 ~> zero_less_one

4303 int_0_neq_1 ~> zero_neq_one

4304 zless_le ~> less_le

4305 zpower_zadd_distrib ~> power_add

4306 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

4307 zero_le_zpower_abs ~> zero_le_power_abs

4309 * Theory Deriv: Renamed

4311 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

4313 * Theory Library/Multiset: Improved code generation of multisets.

4315 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

4316 are expressed via type classes again. The special syntax

4317 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

4318 setsum_set, which is now subsumed by Big_Operators.setsum.

4319 INCOMPATIBILITY.

4321 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

4322 use theory HOL/Library/Nat_Bijection instead.

4324 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

4325 trees is now inside a type class context. Names of affected

4326 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for

4327 theories working directly with raw red-black trees, adapt the names as

4328 follows:

4330 Operations:

4331 bulkload -> rbt_bulkload

4332 del_from_left -> rbt_del_from_left

4333 del_from_right -> rbt_del_from_right

4334 del -> rbt_del

4335 delete -> rbt_delete

4336 ins -> rbt_ins

4337 insert -> rbt_insert

4338 insertw -> rbt_insert_with

4339 insert_with_key -> rbt_insert_with_key

4340 map_entry -> rbt_map_entry

4341 lookup -> rbt_lookup

4342 sorted -> rbt_sorted

4343 tree_greater -> rbt_greater

4344 tree_less -> rbt_less

4345 tree_less_symbol -> rbt_less_symbol

4346 union -> rbt_union

4347 union_with -> rbt_union_with

4348 union_with_key -> rbt_union_with_key

4350 Lemmas:

4351 balance_left_sorted -> balance_left_rbt_sorted

4352 balance_left_tree_greater -> balance_left_rbt_greater

4353 balance_left_tree_less -> balance_left_rbt_less

4354 balance_right_sorted -> balance_right_rbt_sorted

4355 balance_right_tree_greater -> balance_right_rbt_greater

4356 balance_right_tree_less -> balance_right_rbt_less

4357 balance_sorted -> balance_rbt_sorted

4358 balance_tree_greater -> balance_rbt_greater

4359 balance_tree_less -> balance_rbt_less

4360 bulkload_is_rbt -> rbt_bulkload_is_rbt

4361 combine_sorted -> combine_rbt_sorted

4362 combine_tree_greater -> combine_rbt_greater

4363 combine_tree_less -> combine_rbt_less

4364 delete_in_tree -> rbt_delete_in_tree

4365 delete_is_rbt -> rbt_delete_is_rbt

4366 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

4367 del_from_left_tree_less -> rbt_del_from_left_rbt_less

4368 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

4369 del_from_right_tree_less -> rbt_del_from_right_rbt_less

4370 del_in_tree -> rbt_del_in_tree

4371 del_inv1_inv2 -> rbt_del_inv1_inv2

4372 del_sorted -> rbt_del_rbt_sorted

4373 del_tree_greater -> rbt_del_rbt_greater

4374 del_tree_less -> rbt_del_rbt_less

4375 dom_lookup_Branch -> dom_rbt_lookup_Branch

4376 entries_lookup -> entries_rbt_lookup

4377 finite_dom_lookup -> finite_dom_rbt_lookup

4378 insert_sorted -> rbt_insert_rbt_sorted

4379 insertw_is_rbt -> rbt_insertw_is_rbt

4380 insertwk_is_rbt -> rbt_insertwk_is_rbt

4381 insertwk_sorted -> rbt_insertwk_rbt_sorted

4382 insertw_sorted -> rbt_insertw_rbt_sorted

4383 ins_sorted -> ins_rbt_sorted

4384 ins_tree_greater -> ins_rbt_greater

4385 ins_tree_less -> ins_rbt_less

4386 is_rbt_sorted -> is_rbt_rbt_sorted

4387 lookup_balance -> rbt_lookup_balance

4388 lookup_bulkload -> rbt_lookup_rbt_bulkload

4389 lookup_delete -> rbt_lookup_rbt_delete

4390 lookup_Empty -> rbt_lookup_Empty

4391 lookup_from_in_tree -> rbt_lookup_from_in_tree

4392 lookup_in_tree -> rbt_lookup_in_tree

4393 lookup_ins -> rbt_lookup_ins

4394 lookup_insert -> rbt_lookup_rbt_insert

4395 lookup_insertw -> rbt_lookup_rbt_insertw

4396 lookup_insertwk -> rbt_lookup_rbt_insertwk

4397 lookup_keys -> rbt_lookup_keys

4398 lookup_map -> rbt_lookup_map

4399 lookup_map_entry -> rbt_lookup_rbt_map_entry

4400 lookup_tree_greater -> rbt_lookup_rbt_greater

4401 lookup_tree_less -> rbt_lookup_rbt_less

4402 lookup_union -> rbt_lookup_rbt_union

4403 map_entry_color_of -> rbt_map_entry_color_of

4404 map_entry_inv1 -> rbt_map_entry_inv1

4405 map_entry_inv2 -> rbt_map_entry_inv2

4406 map_entry_is_rbt -> rbt_map_entry_is_rbt

4407 map_entry_sorted -> rbt_map_entry_rbt_sorted

4408 map_entry_tree_greater -> rbt_map_entry_rbt_greater

4409 map_entry_tree_less -> rbt_map_entry_rbt_less

4410 map_tree_greater -> map_rbt_greater

4411 map_tree_less -> map_rbt_less

4412 map_sorted -> map_rbt_sorted

4413 paint_sorted -> paint_rbt_sorted

4414 paint_lookup -> paint_rbt_lookup

4415 paint_tree_greater -> paint_rbt_greater

4416 paint_tree_less -> paint_rbt_less

4417 sorted_entries -> rbt_sorted_entries

4418 tree_greater_eq_trans -> rbt_greater_eq_trans

4419 tree_greater_nit -> rbt_greater_nit

4420 tree_greater_prop -> rbt_greater_prop

4421 tree_greater_simps -> rbt_greater_simps

4422 tree_greater_trans -> rbt_greater_trans

4423 tree_less_eq_trans -> rbt_less_eq_trans

4424 tree_less_nit -> rbt_less_nit

4425 tree_less_prop -> rbt_less_prop

4426 tree_less_simps -> rbt_less_simps

4427 tree_less_trans -> rbt_less_trans

4428 tree_ord_props -> rbt_ord_props

4429 union_Branch -> rbt_union_Branch

4430 union_is_rbt -> rbt_union_is_rbt

4431 unionw_is_rbt -> rbt_unionw_is_rbt

4432 unionwk_is_rbt -> rbt_unionwk_is_rbt

4433 unionwk_sorted -> rbt_unionwk_rbt_sorted

4435 * Theory HOL/Library/Float: Floating point numbers are now defined as

4436 a subset of the real numbers. All operations are defined using the

4437 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

4439 Changed Operations:

4440 float_abs -> abs

4441 float_nprt -> nprt

4442 float_pprt -> pprt

4443 pow2 -> use powr

4444 round_down -> float_round_down

4445 round_up -> float_round_up

4446 scale -> exponent

4448 Removed Operations:

4449 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

4451 Renamed Lemmas:

4452 abs_float_def -> Float.compute_float_abs

4453 bitlen_ge0 -> bitlen_nonneg

4454 bitlen.simps -> Float.compute_bitlen

4455 float_components -> Float_mantissa_exponent

4456 float_divl.simps -> Float.compute_float_divl

4457 float_divr.simps -> Float.compute_float_divr

4458 float_eq_odd -> mult_powr_eq_mult_powr_iff

4459 float_power -> real_of_float_power

4460 lapprox_posrat_def -> Float.compute_lapprox_posrat

4461 lapprox_rat.simps -> Float.compute_lapprox_rat

4462 le_float_def' -> Float.compute_float_le

4463 le_float_def -> less_eq_float.rep_eq

4464 less_float_def' -> Float.compute_float_less

4465 less_float_def -> less_float.rep_eq

4466 normfloat_def -> Float.compute_normfloat

4467 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

4468 normfloat -> normfloat_def

4469 normfloat_unique -> use normfloat_def

4470 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

4471 one_float_def -> Float.compute_float_one

4472 plus_float_def -> Float.compute_float_plus

4473 rapprox_posrat_def -> Float.compute_rapprox_posrat

4474 rapprox_rat.simps -> Float.compute_rapprox_rat

4475 real_of_float_0 -> zero_float.rep_eq

4476 real_of_float_1 -> one_float.rep_eq

4477 real_of_float_abs -> abs_float.rep_eq

4478 real_of_float_add -> plus_float.rep_eq

4479 real_of_float_minus -> uminus_float.rep_eq

4480 real_of_float_mult -> times_float.rep_eq

4481 real_of_float_simp -> Float.rep_eq

4482 real_of_float_sub -> minus_float.rep_eq

4483 round_down.simps -> Float.compute_float_round_down

4484 round_up.simps -> Float.compute_float_round_up

4485 times_float_def -> Float.compute_float_times

4486 uminus_float_def -> Float.compute_float_uminus

4487 zero_float_def -> Float.compute_float_zero

4489 Lemmas not necessary anymore, use the transfer method:

4490 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

4491 float_divr, float_le_simp, float_less1_mantissa_bound,

4492 float_less_simp, float_less_zero, float_le_zero,

4493 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

4494 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

4495 lapprox_rat_bottom, normalized_float, rapprox_posrat,

4496 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

4497 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

4498 round_up, zero_le_float, zero_less_float

4500 * New theory HOL/Library/DAList provides an abstract type for

4501 association lists with distinct keys.

4503 * Session HOL/IMP: Added new theory of abstract interpretation of

4504 annotated commands.

4506 * Session HOL-Import: Re-implementation from scratch is faster,

4507 simpler, and more scalable. Requires a proof bundle, which is

4508 available as an external component. Discontinued old (and mostly

4509 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

4511 * Session HOL-Word: Discontinued many redundant theorems specific to

4512 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

4513 instead.

4515 word_sub_alt ~> word_sub_wi

4516 word_add_alt ~> word_add_def

4517 word_mult_alt ~> word_mult_def

4518 word_minus_alt ~> word_minus_def

4519 word_0_alt ~> word_0_wi

4520 word_1_alt ~> word_1_wi

4521 word_add_0 ~> add_0_left

4522 word_add_0_right ~> add_0_right

4523 word_mult_1 ~> mult_1_left

4524 word_mult_1_right ~> mult_1_right

4525 word_add_commute ~> add_commute

4526 word_add_assoc ~> add_assoc

4527 word_add_left_commute ~> add_left_commute

4528 word_mult_commute ~> mult_commute

4529 word_mult_assoc ~> mult_assoc

4530 word_mult_left_commute ~> mult_left_commute

4531 word_left_distrib ~> left_distrib

4532 word_right_distrib ~> right_distrib

4533 word_left_minus ~> left_minus

4534 word_diff_0_right ~> diff_0_right

4535 word_diff_self ~> diff_self

4536 word_sub_def ~> diff_minus

4537 word_diff_minus ~> diff_minus

4538 word_add_ac ~> add_ac

4539 word_mult_ac ~> mult_ac

4540 word_plus_ac0 ~> add_0_left add_0_right add_ac

4541 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

4542 word_order_trans ~> order_trans

4543 word_order_refl ~> order_refl

4544 word_order_antisym ~> order_antisym

4545 word_order_linear ~> linorder_linear

4546 lenw1_zero_neq_one ~> zero_neq_one

4547 word_number_of_eq ~> number_of_eq

4548 word_of_int_add_hom ~> wi_hom_add

4549 word_of_int_sub_hom ~> wi_hom_sub

4550 word_of_int_mult_hom ~> wi_hom_mult

4551 word_of_int_minus_hom ~> wi_hom_neg

4552 word_of_int_succ_hom ~> wi_hom_succ

4553 word_of_int_pred_hom ~> wi_hom_pred

4554 word_of_int_0_hom ~> word_0_wi

4555 word_of_int_1_hom ~> word_1_wi

4557 * Session HOL-Word: New proof method "word_bitwise" for splitting

4558 machine word equalities and inequalities into logical circuits,

4559 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

4560 multiplication, shifting by constants, bitwise operators and numeric

4561 constants. Requires fixed-length word types, not 'a word. Solves

4562 many standard word identities outright and converts more into first

4563 order problems amenable to blast or similar. See also examples in

4564 HOL/Word/Examples/WordExamples.thy.

4566 * Session HOL-Probability: Introduced the type "'a measure" to

4567 represent measures, this replaces the records 'a algebra and 'a

4568 measure_space. The locales based on subset_class now have two

4569 locale-parameters the space \<Omega> and the set of measurable sets M.

4570 The product of probability spaces uses now the same constant as the

4571 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

4572 measure". Most constants are defined now outside of locales and gain

4573 an additional parameter, like null_sets, almost_eventually or \<mu>'.

4574 Measure space constructions for distributions and densities now got

4575 their own constants distr and density. Instead of using locales to

4576 describe measure spaces with a finite space, the measure count_space

4577 and point_measure is introduced. INCOMPATIBILITY.

4579 Renamed constants:

4580 measure -> emeasure

4581 finite_measure.\<mu>' -> measure

4582 product_algebra_generator -> prod_algebra

4583 product_prob_space.emb -> prod_emb

4584 product_prob_space.infprod_algebra -> PiM

4586 Removed locales:

4587 completeable_measure_space

4588 finite_measure_space

4589 finite_prob_space

4590 finite_product_finite_prob_space

4591 finite_product_sigma_algebra

4592 finite_sigma_algebra

4593 measure_space

4594 pair_finite_prob_space

4595 pair_finite_sigma_algebra

4596 pair_finite_space

4597 pair_sigma_algebra

4598 product_sigma_algebra

4600 Removed constants:

4601 conditional_space

4602 distribution -> use distr measure, or distributed predicate

4603 image_space

4604 joint_distribution -> use distr measure, or distributed predicate

4605 pair_measure_generator

4606 product_prob_space.infprod_algebra -> use PiM

4607 subvimage

4609 Replacement theorems:

4610 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

4611 finite_measure.empty_measure -> measure_empty

4612 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

4613 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

4614 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

4615 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

4616 finite_measure.finite_measure -> finite_measure.emeasure_finite

4617 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

4618 finite_measure.positive_measure' -> measure_nonneg

4619 finite_measure.real_measure -> finite_measure.emeasure_real

4620 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

4621 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

4622 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

4623 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

4624 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

4625 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

4626 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

4627 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

4628 information_space.entropy_commute -> information_space.entropy_commute_simple

4629 information_space.entropy_eq -> information_space.entropy_simple_distributed

4630 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

4631 information_space.entropy_positive -> information_space.entropy_nonneg_simple

4632 information_space.entropy_uniform_max -> information_space.entropy_uniform

4633 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

4634 information_space.KL_eq_0 -> information_space.KL_same_eq_0

4635 information_space.KL_ge_0 -> information_space.KL_nonneg

4636 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

4637 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

4638 Int_stable_cuboids -> Int_stable_atLeastAtMost

4639 Int_stable_product_algebra_generator -> positive_integral

4640 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

4641 measure_space.additive -> emeasure_additive

4642 measure_space.AE_iff_null_set -> AE_iff_null

4643 measure_space.almost_everywhere_def -> eventually_ae_filter

4644 measure_space.almost_everywhere_vimage -> AE_distrD

4645 measure_space.continuity_from_above -> INF_emeasure_decseq

4646 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

4647 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

4648 measure_space.continuity_from_below -> SUP_emeasure_incseq

4649 measure_space_density -> emeasure_density

4650 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

4651 measure_space.integrable_vimage -> integrable_distr

4652 measure_space.integral_translated_density -> integral_density

4653 measure_space.integral_vimage -> integral_distr

4654 measure_space.measure_additive -> plus_emeasure

4655 measure_space.measure_compl -> emeasure_compl

4656 measure_space.measure_countable_increasing -> emeasure_countable_increasing

4657 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

4658 measure_space.measure_decseq -> decseq_emeasure

4659 measure_space.measure_Diff -> emeasure_Diff

4660 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

4661 measure_space.measure_eq_0 -> emeasure_eq_0

4662 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

4663 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

4664 measure_space.measure_incseq -> incseq_emeasure

4665 measure_space.measure_insert -> emeasure_insert

4666 measure_space.measure_mono -> emeasure_mono

4667 measure_space.measure_not_negative -> emeasure_not_MInf

4668 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

4669 measure_space.measure_setsum -> setsum_emeasure

4670 measure_space.measure_setsum_split -> setsum_emeasure_cover

4671 measure_space.measure_space_vimage -> emeasure_distr

4672 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

4673 measure_space.measure_subadditive -> subadditive

4674 measure_space.measure_top -> emeasure_space

4675 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

4676 measure_space.measure_Un_null_set -> emeasure_Un_null_set

4677 measure_space.positive_integral_translated_density -> positive_integral_density

4678 measure_space.positive_integral_vimage -> positive_integral_distr

4679 measure_space.real_continuity_from_above -> Lim_measure_decseq

4680 measure_space.real_continuity_from_below -> Lim_measure_incseq

4681 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

4682 measure_space.real_measure_Diff -> measure_Diff

4683 measure_space.real_measure_finite_Union -> measure_finite_Union

4684 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

4685 measure_space.real_measure_subadditive -> measure_subadditive

4686 measure_space.real_measure_Union -> measure_Union

4687 measure_space.real_measure_UNION -> measure_UNION

4688 measure_space.simple_function_vimage -> simple_function_comp

4689 measure_space.simple_integral_vimage -> simple_integral_distr

4690 measure_space.simple_integral_vimage -> simple_integral_distr

4691 measure_unique_Int_stable -> measure_eqI_generator_eq

4692 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

4693 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

4694 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

4695 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

4696 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

4697 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

4698 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

4699 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

4700 pair_sigma_algebra.sets_swap -> sets_pair_swap

4701 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

4702 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

4703 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

4704 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

4705 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

4706 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

4707 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

4708 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

4709 prob_space.measure_space_1 -> prob_space.emeasure_space_1

4710 prob_space.prob_space_vimage -> prob_space_distr

4711 prob_space.random_variable_restrict -> measurable_restrict

4712 prob_space_unique_Int_stable -> measure_eqI_prob_space

4713 product_algebraE -> prod_algebraE_all

4714 product_algebra_generator_der -> prod_algebra_eq_finite

4715 product_algebra_generator_into_space -> prod_algebra_sets_into_space

4716 product_algebraI -> sets_PiM_I_finite

4717 product_measure_exists -> product_sigma_finite.sigma_finite

4718 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

4719 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

4720 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

4721 product_prob_space.measurable_component -> measurable_component_singleton

4722 product_prob_space.measurable_emb -> measurable_prod_emb

4723 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

4724 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

4725 product_prob_space.measure_emb -> emeasure_prod_emb

4726 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

4727 product_sigma_algebra.product_algebra_into_space -> space_closed

4728 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

4729 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

4730 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

4731 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

4732 sets_product_algebra -> sets_PiM

4733 sigma_algebra.measurable_sigma -> measurable_measure_of

4734 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

4735 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

4736 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

4737 space_product_algebra -> space_PiM

4739 * Session HOL-TPTP: support to parse and import TPTP problems (all

4740 languages) into Isabelle/HOL.

4743 *** FOL ***

4745 * New "case_product" attribute (see HOL).

4748 *** ZF ***

4750 * Greater support for structured proofs involving induction or case

4751 analysis.

4753 * Much greater use of mathematical symbols.

4755 * Removal of many ML theorem bindings. INCOMPATIBILITY.

4758 *** ML ***

4760 * Antiquotation @{keyword "name"} produces a parser for outer syntax

4761 from a minor keyword introduced via theory header declaration.

4763 * Antiquotation @{command_spec "name"} produces the

4764 Outer_Syntax.command_spec from a major keyword introduced via theory

4765 header declaration; it can be passed to Outer_Syntax.command etc.

4767 * Local_Theory.define no longer hard-wires default theorem name

4768 "foo_def", but retains the binding as given. If that is Binding.empty

4769 / Attrib.empty_binding, the result is not registered as user-level

4770 fact. The Local_Theory.define_internal variant allows to specify a

4771 non-empty name (used for the foundation in the background theory),

4772 while omitting the fact binding in the user-context. Potential

4773 INCOMPATIBILITY for derived definitional packages: need to specify

4774 naming policy for primitive definitions more explicitly.

4776 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

4777 conformance with similar operations in structure Term and Logic.

4779 * Antiquotation @{attributes [...]} embeds attribute source

4780 representation into the ML text, which is particularly useful with

4781 declarations like Local_Theory.note.

4783 * Structure Proof_Context follows standard naming scheme. Old

4784 ProofContext has been discontinued. INCOMPATIBILITY.

4786 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

4787 change of semantics: update is applied to auxiliary local theory

4788 context as well.

4790 * Modernized some old-style infix operations:

4792 addeqcongs ~> Simplifier.add_eqcong

4793 deleqcongs ~> Simplifier.del_eqcong

4794 addcongs ~> Simplifier.add_cong

4795 delcongs ~> Simplifier.del_cong

4796 setmksimps ~> Simplifier.set_mksimps

4797 setmkcong ~> Simplifier.set_mkcong

4798 setmksym ~> Simplifier.set_mksym

4799 setmkeqTrue ~> Simplifier.set_mkeqTrue

4800 settermless ~> Simplifier.set_termless

4801 setsubgoaler ~> Simplifier.set_subgoaler

4802 addsplits ~> Splitter.add_split

4803 delsplits ~> Splitter.del_split

4806 *** System ***

4808 * USER_HOME settings variable points to cross-platform user home

4809 directory, which coincides with HOME on POSIX systems only. Likewise,

4810 the Isabelle path specification "~" now expands to $USER_HOME, instead

4811 of former $HOME. A different default for USER_HOME may be set

4812 explicitly in shell environment, before Isabelle settings are

4813 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

4814 the generic user home was intended.

4816 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

4817 notation, which is useful for the jEdit file browser, for example.

4819 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

4820 (not just JRE).

4824 New in Isabelle2011-1 (October 2011)

4825 ------------------------------------

4827 *** General ***

4829 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

4830 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

4832 - Management of multiple theory files directly from the editor

4833 buffer store -- bypassing the file-system (no requirement to save

4834 files for checking).

4836 - Markup of formal entities within the text buffer, with semantic

4837 highlighting, tooltips and hyperlinks to jump to defining source

4838 positions.

4840 - Improved text rendering, with sub/superscripts in the source

4841 buffer (including support for copy/paste wrt. output panel, HTML

4842 theory output and other non-Isabelle text boxes).

4844 - Refined scheduling of proof checking and printing of results,

4845 based on interactive editor view. (Note: jEdit folding and

4846 narrowing allows to restrict buffer perspectives explicitly.)

4848 - Reduced CPU performance requirements, usable on machines with few

4849 cores.

4851 - Reduced memory requirements due to pruning of unused document

4852 versions (garbage collection).

4854 See also ~~/src/Tools/jEdit/README.html for further information,

4855 including some remaining limitations.

4857 * Theory loader: source files are exclusively located via the master

4858 directory of each theory node (where the .thy file itself resides).

4859 The global load path (such as src/HOL/Library) has been discontinued.

4860 Note that the path element ~~ may be used to reference theories in the

4861 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".

4862 INCOMPATIBILITY.

4864 * Theory loader: source files are identified by content via SHA1

4865 digests. Discontinued former path/modtime identification and optional

4866 ISABELLE_FILE_IDENT plugin scripts.

4868 * Parallelization of nested Isar proofs is subject to

4869 Goal.parallel_proofs_threshold (default 100). See also isabelle

4870 usedir option -Q.

4872 * Name space: former unsynchronized references are now proper

4873 configuration options, with more conventional names:

4875 long_names ~> names_long

4876 short_names ~> names_short

4877 unique_names ~> names_unique

4879 Minor INCOMPATIBILITY, need to declare options in context like this:

4881 declare [[names_unique = false]]

4883 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note

4884 that the result needs to be unique, which means fact specifications

4885 may have to be refined after enriching a proof context.

4887 * Attribute "case_names" has been refined: the assumptions in each case

4888 can be named now by following the case name with [name1 name2 ...].

4890 * Isabelle/Isar reference manual has been updated and extended:

4891 - "Synopsis" provides a catalog of main Isar language concepts.

4892 - Formal references in syntax diagrams, via @{rail} antiquotation.

4893 - Updated material from classic "ref" manual, notably about

4894 "Classical Reasoner".

4897 *** HOL ***

4899 * Class bot and top require underlying partial order rather than

4900 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.

4902 * Class complete_lattice: generalized a couple of lemmas from sets;

4903 generalized theorems INF_cong and SUP_cong. New type classes for

4904 complete boolean algebras and complete linear orders. Lemmas

4905 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in

4906 class complete_linorder.

4908 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,

4909 Sup_fun_def, Inf_apply, Sup_apply.

4911 Removed redundant lemmas (the right hand side gives hints how to

4912 replace them for (metis ...), or (simp only: ...) proofs):

4914 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]

4915 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]

4916 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right

4917 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right

4918 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right

4919 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right

4920 Inter_def ~> INF_def, image_def

4921 Union_def ~> SUP_def, image_def

4922 INT_eq ~> INF_def, and image_def

4923 UN_eq ~> SUP_def, and image_def

4924 INF_subset ~> INF_superset_mono [OF _ order_refl]

4926 More consistent and comprehensive names:

4928 INTER_eq_Inter_image ~> INF_def

4929 UNION_eq_Union_image ~> SUP_def

4930 INFI_def ~> INF_def

4931 SUPR_def ~> SUP_def

4932 INF_leI ~> INF_lower

4933 INF_leI2 ~> INF_lower2

4934 le_INFI ~> INF_greatest

4935 le_SUPI ~> SUP_upper

4936 le_SUPI2 ~> SUP_upper2

4937 SUP_leI ~> SUP_least

4938 INFI_bool_eq ~> INF_bool_eq

4939 SUPR_bool_eq ~> SUP_bool_eq

4940 INFI_apply ~> INF_apply

4941 SUPR_apply ~> SUP_apply

4942 INTER_def ~> INTER_eq

4943 UNION_def ~> UNION_eq

4945 INCOMPATIBILITY.

4947 * Renamed theory Complete_Lattice to Complete_Lattices.

4948 INCOMPATIBILITY.

4950 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,

4951 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,

4952 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,

4953 Sup_insert are now declared as [simp]. INCOMPATIBILITY.

4955 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,

4956 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,

4957 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor

4958 INCOMPATIBILITY.

4960 * Added syntactic classes "inf" and "sup" for the respective

4961 constants. INCOMPATIBILITY: Changes in the argument order of the

4962 (mostly internal) locale predicates for some derived classes.

4964 * Theorem collections ball_simps and bex_simps do not contain theorems

4965 referring to UNION any longer; these have been moved to collection

4966 UN_ball_bex_simps. INCOMPATIBILITY.

4968 * Theory Archimedean_Field: floor now is defined as parameter of a

4969 separate type class floor_ceiling.

4971 * Theory Finite_Set: more coherent development of fold_set locales:

4973 locale fun_left_comm ~> locale comp_fun_commute

4974 locale fun_left_comm_idem ~> locale comp_fun_idem

4976 Both use point-free characterization; interpretation proofs may need

4977 adjustment. INCOMPATIBILITY.

4979 * Theory Limits: Type "'a net" has been renamed to "'a filter", in

4980 accordance with standard mathematical terminology. INCOMPATIBILITY.

4982 * Theory Complex_Main: The locale interpretations for the

4983 bounded_linear and bounded_bilinear locales have been removed, in

4984 order to reduce the number of duplicate lemmas. Users must use the

4985 original names for distributivity theorems, potential INCOMPATIBILITY.

4987 divide.add ~> add_divide_distrib

4988 divide.diff ~> diff_divide_distrib

4989 divide.setsum ~> setsum_divide_distrib

4990 mult.add_right ~> right_distrib

4991 mult.diff_right ~> right_diff_distrib

4992 mult_right.setsum ~> setsum_right_distrib

4993 mult_left.diff ~> left_diff_distrib

4995 * Theory Complex_Main: Several redundant theorems have been removed or

4996 replaced by more general versions. INCOMPATIBILITY.

4998 real_diff_def ~> minus_real_def

4999 real_divide_def ~> divide_real_def

5000 real_less_def ~> less_le

5001 real_abs_def ~> abs_real_def

5002 real_sgn_def ~> sgn_real_def

5003 real_mult_commute ~> mult_commute

5004 real_mult_assoc ~> mult_assoc

5005 real_mult_1 ~> mult_1_left

5006 real_add_mult_distrib ~> left_distrib

5007 real_zero_not_eq_one ~> zero_neq_one

5008 real_mult_inverse_left ~> left_inverse

5009 INVERSE_ZERO ~> inverse_zero

5010 real_le_refl ~> order_refl

5011 real_le_antisym ~> order_antisym

5012 real_le_trans ~> order_trans

5013 real_le_linear ~> linear

5014 real_le_eq_diff ~> le_iff_diff_le_0

5015 real_add_left_mono ~> add_left_mono

5016 real_mult_order ~> mult_pos_pos

5017 real_mult_less_mono2 ~> mult_strict_left_mono

5018 real_of_int_real_of_nat ~> real_of_int_of_nat_eq

5019 real_0_le_divide_iff ~> zero_le_divide_iff

5020 realpow_two_disj ~> power2_eq_iff

5021 real_squared_diff_one_factored ~> square_diff_one_factored

5022 realpow_two_diff ~> square_diff_square_factored

5023 reals_complete2 ~> complete_real

5024 real_sum_squared_expand ~> power2_sum

5025 exp_ln_eq ~> ln_unique

5026 expi_add ~> exp_add

5027 expi_zero ~> exp_zero

5028 lemma_DERIV_subst ~> DERIV_cong

5029 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff

5030 LIMSEQ_const ~> tendsto_const

5031 LIMSEQ_norm ~> tendsto_norm

5032 LIMSEQ_add ~> tendsto_add

5033 LIMSEQ_minus ~> tendsto_minus

5034 LIMSEQ_minus_cancel ~> tendsto_minus_cancel

5035 LIMSEQ_diff ~> tendsto_diff

5036 bounded_linear.LIMSEQ ~> bounded_linear.tendsto

5037 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto

5038 LIMSEQ_mult ~> tendsto_mult

5039 LIMSEQ_inverse ~> tendsto_inverse

5040 LIMSEQ_divide ~> tendsto_divide

5041 LIMSEQ_pow ~> tendsto_power

5042 LIMSEQ_setsum ~> tendsto_setsum

5043 LIMSEQ_setprod ~> tendsto_setprod

5044 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff

5045 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff

5046 LIMSEQ_imp_rabs ~> tendsto_rabs

5047 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]

5048 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]

5049 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]

5050 LIMSEQ_Complex ~> tendsto_Complex

5051 LIM_ident ~> tendsto_ident_at

5052 LIM_const ~> tendsto_const

5053 LIM_add ~> tendsto_add

5054 LIM_add_zero ~> tendsto_add_zero

5055 LIM_minus ~> tendsto_minus

5056 LIM_diff ~> tendsto_diff

5057 LIM_norm ~> tendsto_norm

5058 LIM_norm_zero ~> tendsto_norm_zero

5059 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel

5060 LIM_norm_zero_iff ~> tendsto_norm_zero_iff

5061 LIM_rabs ~> tendsto_rabs

5062 LIM_rabs_zero ~> tendsto_rabs_zero

5063 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel

5064 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff

5065 LIM_compose ~> tendsto_compose

5066 LIM_mult ~> tendsto_mult

5067 LIM_scaleR ~> tendsto_scaleR

5068 LIM_of_real ~> tendsto_of_real

5069 LIM_power ~> tendsto_power

5070 LIM_inverse ~> tendsto_inverse

5071 LIM_sgn ~> tendsto_sgn

5072 isCont_LIM_compose ~> isCont_tendsto_compose

5073 bounded_linear.LIM ~> bounded_linear.tendsto

5074 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero

5075 bounded_bilinear.LIM ~> bounded_bilinear.tendsto

5076 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero

5077 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero

5078 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero

5079 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]

5081 * Theory Complex_Main: The definition of infinite series was

5082 generalized. Now it is defined on the type class {topological_space,

5083 comm_monoid_add}. Hence it is useable also for extended real numbers.

5085 * Theory Complex_Main: The complex exponential function "expi" is now

5086 a type-constrained abbreviation for "exp :: complex => complex"; thus

5087 several polymorphic lemmas about "exp" are now applicable to "expi".

5089 * Code generation:

5091 - Theory Library/Code_Char_ord provides native ordering of

5092 characters in the target language.

5094 - Commands code_module and code_library are legacy, use export_code

5095 instead.

5097 - Method "evaluation" is legacy, use method "eval" instead.

5099 - Legacy evaluator "SML" is deactivated by default. May be

5100 reactivated by the following theory command:

5102 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}

5104 * Declare ext [intro] by default. Rare INCOMPATIBILITY.

5106 * New proof method "induction" that gives induction hypotheses the

5107 name "IH", thus distinguishing them from further hypotheses that come

5108 from rule induction. The latter are still called "hyps". Method

5109 "induction" is a thin wrapper around "induct" and follows the same

5110 syntax.

5112 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is

5113 still available as a legacy feature for some time.

5115 * Nitpick:

5116 - Added "need" and "total_consts" options.

5117 - Reintroduced "show_skolems" option by popular demand.

5118 - Renamed attribute: nitpick_def ~> nitpick_unfold.

5119 INCOMPATIBILITY.

5121 * Sledgehammer:

5122 - Use quasi-sound (and efficient) translations by default.

5123 - Added support for the following provers: E-ToFoF, LEO-II,

5124 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.

5125 - Automatically preplay and minimize proofs before showing them if

5126 this can be done within reasonable time.

5127 - sledgehammer available_provers ~> sledgehammer supported_provers.

5128 INCOMPATIBILITY.

5129 - Added "preplay_timeout", "slicing", "type_enc", "sound",

5130 "max_mono_iters", and "max_new_mono_instances" options.

5131 - Removed "explicit_apply" and "full_types" options as well as "Full

5132 Types" Proof General menu item. INCOMPATIBILITY.

5134 * Metis:

5135 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.

5136 - Obsoleted "metisFT" -- use "metis (full_types)" instead.

5137 INCOMPATIBILITY.

5139 * Command 'try':

5140 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and

5141 "elim:" options. INCOMPATIBILITY.

5142 - Introduced 'try' that not only runs 'try_methods' but also

5143 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.

5145 * Quickcheck:

5146 - Added "eval" option to evaluate terms for the found counterexample

5147 (currently only supported by the default (exhaustive) tester).

5148 - Added post-processing of terms to obtain readable counterexamples

5149 (currently only supported by the default (exhaustive) tester).

5150 - New counterexample generator quickcheck[narrowing] enables

5151 narrowing-based testing. Requires the Glasgow Haskell compiler

5152 with its installation location defined in the Isabelle settings

5153 environment as ISABELLE_GHC.

5154 - Removed quickcheck tester "SML" based on the SML code generator

5155 (formly in HOL/Library).

5157 * Function package: discontinued option "tailrec". INCOMPATIBILITY,

5158 use 'partial_function' instead.

5160 * Theory Library/Extended_Reals replaces now the positive extended

5161 reals found in probability theory. This file is extended by

5162 Multivariate_Analysis/Extended_Real_Limits.

5164 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,

5165 from where it must be imported explicitly if it is really required.

5166 INCOMPATIBILITY.

5168 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has

5169 been moved here. INCOMPATIBILITY.

5171 * Theory Library/Saturated provides type of numbers with saturated

5172 arithmetic.

5174 * Theory Library/Product_Lattice defines a pointwise ordering for the

5175 product type 'a * 'b, and provides instance proofs for various order

5176 and lattice type classes.

5178 * Theory Library/Countable now provides the "countable_datatype" proof

5179 method for proving "countable" class instances for datatypes.

5181 * Theory Library/Cset_Monad allows do notation for computable sets

5182 (cset) via the generic monad ad-hoc overloading facility.

5184 * Library: Theories of common data structures are split into theories

5185 for implementation, an invariant-ensuring type, and connection to an

5186 abstract type. INCOMPATIBILITY.

5188 - RBT is split into RBT and RBT_Mapping.

5189 - AssocList is split and renamed into AList and AList_Mapping.

5190 - DList is split into DList_Impl, DList, and DList_Cset.

5191 - Cset is split into Cset and List_Cset.

5193 * Theory Library/Nat_Infinity has been renamed to

5194 Library/Extended_Nat, with name changes of the following types and

5195 constants:

5197 type inat ~> type enat

5198 Fin ~> enat

5199 Infty ~> infinity (overloaded)

5200 iSuc ~> eSuc

5201 the_Fin ~> the_enat

5203 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has

5204 been renamed accordingly. INCOMPATIBILITY.

5206 * Session Multivariate_Analysis: The euclidean_space type class now

5207 fixes a constant "Basis :: 'a set" consisting of the standard

5208 orthonormal basis for the type. Users now have the option of

5209 quantifying over this set instead of using the "basis" function, e.g.

5210 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".

5212 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed

5213 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants

5214 "Cart_nth" and "Cart_lambda" have been respectively renamed to

5215 "vec_nth" and "vec_lambda"; theorems mentioning those names have

5216 changed to match. Definition theorems for overloaded constants now use

5217 the standard "foo_vec_def" naming scheme. A few other theorems have

5218 been renamed as follows (INCOMPATIBILITY):

5220 Cart_eq ~> vec_eq_iff

5221 dist_nth_le_cart ~> dist_vec_nth_le

5222 tendsto_vector ~> vec_tendstoI

5223 Cauchy_vector ~> vec_CauchyI

5225 * Session Multivariate_Analysis: Several duplicate theorems have been

5226 removed, and other theorems have been renamed or replaced with more

5227 general versions. INCOMPATIBILITY.

5229 finite_choice ~> finite_set_choice

5230 eventually_conjI ~> eventually_conj

5231 eventually_and ~> eventually_conj_iff

5232 eventually_false ~> eventually_False

5233 setsum_norm ~> norm_setsum

5234 Lim_sequentially ~> LIMSEQ_def

5235 Lim_ident_at ~> LIM_ident

5236 Lim_const ~> tendsto_const

5237 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]

5238 Lim_neg ~> tendsto_minus

5239 Lim_add ~> tendsto_add

5240 Lim_sub ~> tendsto_diff

5241 Lim_mul ~> tendsto_scaleR

5242 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]

5243 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]

5244 Lim_linear ~> bounded_linear.tendsto

5245 Lim_component ~> tendsto_euclidean_component

5246 Lim_component_cart ~> tendsto_vec_nth

5247 Lim_inner ~> tendsto_inner [OF tendsto_const]

5248 dot_lsum ~> inner_setsum_left

5249 dot_rsum ~> inner_setsum_right

5250 continuous_cmul ~> continuous_scaleR [OF continuous_const]

5251 continuous_neg ~> continuous_minus

5252 continuous_sub ~> continuous_diff

5253 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]

5254 continuous_mul ~> continuous_scaleR

5255 continuous_inv ~> continuous_inverse

5256 continuous_at_within_inv ~> continuous_at_within_inverse

5257 continuous_at_inv ~> continuous_at_inverse

5258 continuous_at_norm ~> continuous_norm [OF continuous_at_id]

5259 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]

5260 continuous_at_component ~> continuous_component [OF continuous_at_id]

5261 continuous_on_neg ~> continuous_on_minus

5262 continuous_on_sub ~> continuous_on_diff

5263 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]

5264 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]

5265 continuous_on_mul ~> continuous_on_scaleR

5266 continuous_on_mul_real ~> continuous_on_mult

5267 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]

5268 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]

5269 continuous_on_inverse ~> continuous_on_inv

5270 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus

5271 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff

5272 subset_interior ~> interior_mono

5273 subset_closure ~> closure_mono

5274 closure_univ ~> closure_UNIV

5275 real_arch_lt ~> reals_Archimedean2

5276 real_arch ~> reals_Archimedean3

5277 real_abs_norm ~> abs_norm_cancel

5278 real_abs_sub_norm ~> norm_triangle_ineq3

5279 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2

5281 * Session HOL-Probability:

5282 - Caratheodory's extension lemma is now proved for ring_of_sets.

5283 - Infinite products of probability measures are now available.

5284 - Sigma closure is independent, if the generator is independent

5285 - Use extended reals instead of positive extended

5286 reals. INCOMPATIBILITY.

5288 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.

5290 expand_fun_below ~> fun_below_iff

5291 below_fun_ext ~> fun_belowI

5292 expand_cfun_eq ~> cfun_eq_iff

5293 ext_cfun ~> cfun_eqI

5294 expand_cfun_below ~> cfun_below_iff

5295 below_cfun_ext ~> cfun_belowI

5296 monofun_fun_fun ~> fun_belowD

5297 monofun_fun_arg ~> monofunE

5298 monofun_lub_fun ~> adm_monofun [THEN admD]

5299 cont_lub_fun ~> adm_cont [THEN admD]

5300 cont2cont_Rep_CFun ~> cont2cont_APP

5301 cont_Rep_CFun_app ~> cont_APP_app

5302 cont_Rep_CFun_app_app ~> cont_APP_app_app

5303 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]

5304 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]

5305 contlub_cfun ~> lub_APP [symmetric]

5306 contlub_LAM ~> lub_LAM [symmetric]

5307 thelubI ~> lub_eqI

5308 UU_I ~> bottomI

5309 lift_distinct1 ~> lift.distinct(1)

5310 lift_distinct2 ~> lift.distinct(2)

5311 Def_not_UU ~> lift.distinct(2)

5312 Def_inject ~> lift.inject

5313 below_UU_iff ~> below_bottom_iff

5314 eq_UU_iff ~> eq_bottom_iff

5317 *** Document preparation ***

5319 * Antiquotation @{rail} layouts railroad syntax diagrams, see also

5320 isar-ref manual, both for description and actual application of the

5321 same.

5323 * Antiquotation @{value} evaluates the given term and presents its

5324 result.

5326 * Antiquotations: term style "isub" provides ad-hoc conversion of

5327 variables x1, y23 into subscripted form x\<^isub>1,

5328 y\<^isub>2\<^isub>3.

5330 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>

5331 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).

5333 * Localized \isabellestyle switch can be used within blocks or groups

5334 like this:

5336 \isabellestyle{it} %preferred default

5337 {\isabellestylett @{text "typewriter stuff"}}

5339 * Discontinued special treatment of hard tabulators. Implicit

5340 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual

5341 layouts.

5344 *** ML ***

5346 * The inner syntax of sort/type/term/prop supports inlined YXML

5347 representations within quoted string tokens. By encoding logical

5348 entities via Term_XML (in ML or Scala) concrete syntax can be

5349 bypassed, which is particularly useful for producing bits of text

5350 under external program control.

5352 * Antiquotations for ML and document preparation are managed as theory

5353 data, which requires explicit setup.

5355 * Isabelle_Process.is_active allows tools to check if the official

5356 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop

5357 (better known as Proof General).

5359 * Structure Proof_Context follows standard naming scheme. Old

5360 ProofContext is still available for some time as legacy alias.

5362 * Structure Timing provides various operations for timing; supersedes

5363 former start_timing/end_timing etc.

5365 * Path.print is the official way to show file-system paths to users

5366 (including quotes etc.).

5368 * Inner syntax: identifiers in parse trees of generic categories

5369 "logic", "aprop", "idt" etc. carry position information (disguised as

5370 type constraints). Occasional INCOMPATIBILITY with non-compliant

5371 translations that choke on unexpected type constraints. Positions can

5372 be stripped in ML translations via Syntax.strip_positions /

5373 Syntax.strip_positions_ast, or via the syntax constant

5374 "_strip_positions" within parse trees. As last resort, positions can

5375 be disabled via the configuration option Syntax.positions, which is

5376 called "syntax_positions" in Isar attribute syntax.

5378 * Discontinued special status of various ML structures that contribute

5379 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less

5380 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,

5381 refer directly to Ast.Constant, Lexicon.is_identifier,

5382 Syntax_Trans.mk_binder_tr etc.

5384 * Typed print translation: discontinued show_sorts argument, which is

5385 already available via context of "advanced" translation.

5387 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic

5388 goal states; body tactic needs to address all subgoals uniformly.

5390 * Slightly more special eq_list/eq_set, with shortcut involving

5391 pointer equality (assumes that eq relation is reflexive).

5393 * Classical tactics use proper Proof.context instead of historic types

5394 claset/clasimpset. Old-style declarations like addIs, addEs, addDs

5395 operate directly on Proof.context. Raw type claset retains its use as

5396 snapshot of the classical context, which can be recovered via

5397 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.

5398 INCOMPATIBILITY, classical tactics and derived proof methods require

5399 proper Proof.context.

5402 *** System ***

5404 * Discontinued support for Poly/ML 5.2, which was the last version

5405 without proper multithreading and TimeLimit implementation.

5407 * Discontinued old lib/scripts/polyml-platform, which has been

5408 obsolete since Isabelle2009-2.

5410 * Various optional external tools are referenced more robustly and

5411 uniformly by explicit Isabelle settings as follows:

5413 ISABELLE_CSDP (formerly CSDP_EXE)

5414 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)

5415 ISABELLE_OCAML (formerly EXEC_OCAML)

5416 ISABELLE_SWIPL (formerly EXEC_SWIPL)

5417 ISABELLE_YAP (formerly EXEC_YAP)

5419 Note that automated detection from the file-system or search path has

5420 been discontinued. INCOMPATIBILITY.

5422 * Scala layer provides JVM method invocation service for static

5423 methods of type (String)String, see Invoke_Scala.method in ML. For

5424 example:

5426 Invoke_Scala.method "java.lang.System.getProperty" "java.home"

5428 Together with YXML.string_of_body/parse_body and XML.Encode/Decode

5429 this allows to pass structured values between ML and Scala.

5431 * The IsabelleText fonts includes some further glyphs to support the

5432 Prover IDE. Potential INCOMPATIBILITY: users who happen to have

5433 installed a local copy (which is normally *not* required) need to

5434 delete or update it from ~~/lib/fonts/.

5438 New in Isabelle2011 (January 2011)

5439 ----------------------------------

5441 *** General ***

5443 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see

5444 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with

5445 useful tooltips and hyperlinks produced from its static analysis. The

5446 bundled component provides an executable Isabelle tool that can be run

5447 like this:

5449 Isabelle2011/bin/isabelle jedit

5451 * Significantly improved Isabelle/Isar implementation manual.

5453 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER

5454 (and thus refers to something like $HOME/.isabelle/Isabelle2011),

5455 while the default heap location within that directory lacks that extra

5456 suffix. This isolates multiple Isabelle installations from each

5457 other, avoiding problems with old settings in new versions.

5458 INCOMPATIBILITY, need to copy/upgrade old user settings manually.

5460 * Source files are always encoded as UTF-8, instead of old-fashioned

5461 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require

5462 the following package declarations:

5464 \usepackage[utf8]{inputenc}

5465 \usepackage{textcomp}

5467 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that

5468 a Unicode character is treated as a single symbol, not a sequence of

5469 non-ASCII bytes as before. Since Isabelle/ML string literals may

5470 contain symbols without further backslash escapes, Unicode can now be

5471 used here as well. Recall that Symbol.explode in ML provides a

5472 consistent view on symbols, while raw explode (or String.explode)

5473 merely give a byte-oriented representation.

5475 * Theory loader: source files are primarily located via the master

5476 directory of each theory node (where the .thy file itself resides).

5477 The global load path is still partially available as legacy feature.

5478 Minor INCOMPATIBILITY due to subtle change in file lookup: use

5479 explicit paths, relatively to the theory.

5481 * Special treatment of ML file names has been discontinued.

5482 Historically, optional extensions .ML or .sml were added on demand --

5483 at the cost of clarity of file dependencies. Recall that Isabelle/ML

5484 files exclusively use the .ML extension. Minor INCOMPATIBILITY.

5486 * Various options that affect pretty printing etc. are now properly

5487 handled within the context via configuration options, instead of

5488 unsynchronized references or print modes. There are both ML Config.T

5489 entities and Isar declaration attributes to access these.

5491 ML (Config.T) Isar (attribute)

5493 eta_contract eta_contract

5494 show_brackets show_brackets

5495 show_sorts show_sorts

5496 show_types show_types

5497 show_question_marks show_question_marks

5498 show_consts show_consts

5499 show_abbrevs show_abbrevs

5501 Syntax.ast_trace syntax_ast_trace

5502 Syntax.ast_stat syntax_ast_stat

5503 Syntax.ambiguity_level syntax_ambiguity_level

5505 Goal_Display.goals_limit goals_limit

5506 Goal_Display.show_main_goal show_main_goal

5508 Method.rule_trace rule_trace

5510 Thy_Output.display thy_output_display

5511 Thy_Output.quotes thy_output_quotes

5512 Thy_Output.indent thy_output_indent

5513 Thy_Output.source thy_output_source

5514 Thy_Output.break thy_output_break

5516 Note that corresponding "..._default" references in ML may only be

5517 changed globally at the ROOT session setup, but *not* within a theory.

5518 The option "show_abbrevs" supersedes the former print mode

5519 "no_abbrevs" with inverted meaning.

5521 * More systematic naming of some configuration options.

5522 INCOMPATIBILITY.

5524 trace_simp ~> simp_trace

5525 debug_simp ~> simp_debug

5527 * Support for real valued configuration options, using simplistic

5528 floating-point notation that coincides with the inner syntax for

5529 float_token.

5531 * Support for real valued preferences (with approximative PGIP type):

5532 front-ends need to accept "pgint" values in float notation.

5533 INCOMPATIBILITY.

5535 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from

5536 DejaVu Sans.

5538 * Discontinued support for Poly/ML 5.0 and 5.1 versions.

5541 *** Pure ***

5543 * Command 'type_synonym' (with single argument) replaces somewhat

5544 outdated 'types', which is still available as legacy feature for some

5545 time.

5547 * Command 'nonterminal' (with 'and' separated list of arguments)

5548 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.

5550 * Command 'notepad' replaces former 'example_proof' for

5551 experimentation in Isar without any result. INCOMPATIBILITY.

5553 * Locale interpretation commands 'interpret' and 'sublocale' accept

5554 lists of equations to map definitions in a locale to appropriate

5555 entities in the context of the interpretation. The 'interpretation'

5556 command already provided this functionality.

5558 * Diagnostic command 'print_dependencies' prints the locale instances

5559 that would be activated if the specified expression was interpreted in

5560 the current context. Variant "print_dependencies!" assumes a context

5561 without interpretations.

5563 * Diagnostic command 'print_interps' prints interpretations in proofs

5564 in addition to interpretations in theories.

5566 * Discontinued obsolete 'global' and 'local' commands to manipulate

5567 the theory name space. Rare INCOMPATIBILITY. The ML functions

5568 Sign.root_path and Sign.local_path may be applied directly where this

5569 feature is still required for historical reasons.

5571 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use

5572 'definition' instead.

5574 * The "prems" fact, which refers to the accidental collection of

5575 foundational premises in the context, is now explicitly marked as

5576 legacy feature and will be discontinued soon. Consider using "assms"

5577 of the head statement or reference facts by explicit names.

5579 * Document antiquotations @{class} and @{type} print classes and type

5580 constructors.

5582 * Document antiquotation @{file} checks file/directory entries within

5583 the local file system.

5586 *** HOL ***

5588 * Coercive subtyping: functions can be declared as coercions and type

5589 inference will add them as necessary upon input of a term. Theory

5590 Complex_Main declares real :: nat => real and real :: int => real as

5591 coercions. A coercion function f is declared like this:

5593 declare [[coercion f]]

5595 To lift coercions through type constructors (e.g. from nat => real to

5596 nat list => real list), map functions can be declared, e.g.

5598 declare [[coercion_map map]]

5600 Currently coercion inference is activated only in theories including

5601 real numbers, i.e. descendants of Complex_Main. This is controlled by

5602 the configuration option "coercion_enabled", e.g. it can be enabled in

5603 other theories like this:

5605 declare [[coercion_enabled]]

5607 * Command 'partial_function' provides basic support for recursive

5608 function definitions over complete partial orders. Concrete instances

5609 are provided for i) the option type, ii) tail recursion on arbitrary

5610 types, and iii) the heap monad of Imperative_HOL. See

5611 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy

5612 for examples.

5614 * Function package: f.psimps rules are no longer implicitly declared

5615 as [simp]. INCOMPATIBILITY.

5617 * Datatype package: theorems generated for executable equality (class

5618 "eq") carry proper names and are treated as default code equations.

5620 * Inductive package: now offers command 'inductive_simps' to

5621 automatically derive instantiated and simplified equations for

5622 inductive predicates, similar to 'inductive_cases'.

5624 * Command 'enriched_type' allows to register properties of the

5625 functorial structure of types.

5627 * Improved infrastructure for term evaluation using code generator

5628 techniques, in particular static evaluation conversions.

5630 * Code generator: Scala (2.8 or higher) has been added to the target

5631 languages.

5633 * Code generator: globbing constant expressions "*" and "Theory.*"

5634 have been replaced by the more idiomatic "_" and "Theory._".

5635 INCOMPATIBILITY.

5637 * Code generator: export_code without explicit file declaration prints

5638 to standard output. INCOMPATIBILITY.

5640 * Code generator: do not print function definitions for case

5641 combinators any longer.

5643 * Code generator: simplification with rules determined with

5644 src/Tools/Code/code_simp.ML and method "code_simp".

5646 * Code generator for records: more idiomatic representation of record

5647 types. Warning: records are not covered by ancient SML code

5648 generation any longer. INCOMPATIBILITY. In cases of need, a suitable

5649 rep_datatype declaration helps to succeed then:

5651 record 'a foo = ...

5652 ...

5653 rep_datatype foo_ext ...

5655 * Records: logical foundation type for records does not carry a

5656 '_type' suffix any longer (obsolete due to authentic syntax).

5657 INCOMPATIBILITY.

5659 * Quickcheck now by default uses exhaustive testing instead of random

5660 testing. Random testing can be invoked by "quickcheck [random]",

5661 exhaustive testing by "quickcheck [exhaustive]".

5663 * Quickcheck instantiates polymorphic types with small finite

5664 datatypes by default. This enables a simple execution mechanism to

5665 handle quantifiers and function equality over the finite datatypes.

5667 * Quickcheck random generator has been renamed from "code" to

5668 "random". INCOMPATIBILITY.

5670 * Quickcheck now has a configurable time limit which is set to 30

5671 seconds by default. This can be changed by adding [timeout = n] to the

5672 quickcheck command. The time limit for Auto Quickcheck is still set

5673 independently.

5675 * Quickcheck in locales considers interpretations of that locale for

5676 counter example search.

5678 * Sledgehammer:

5679 - Added "smt" and "remote_smt" provers based on the "smt" proof

5680 method. See the Sledgehammer manual for details ("isabelle doc

5681 sledgehammer").

5682 - Renamed commands:

5683 sledgehammer atp_info ~> sledgehammer running_provers

5684 sledgehammer atp_kill ~> sledgehammer kill_provers

5685 sledgehammer available_atps ~> sledgehammer available_provers

5686 INCOMPATIBILITY.

5687 - Renamed options:

5688 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]

5689 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]

5690 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]

5691 (and "ms" and "min" are no longer supported)

5692 INCOMPATIBILITY.

5694 * Nitpick:

5695 - Renamed options:

5696 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]

5697 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]

5698 INCOMPATIBILITY.

5699 - Added support for partial quotient types.

5700 - Added local versions of the "Nitpick.register_xxx" functions.

5701 - Added "whack" option.

5702 - Allow registration of quotient types as codatatypes.

5703 - Improved "merge_type_vars" option to merge more types.

5704 - Removed unsound "fast_descrs" option.

5705 - Added custom symmetry breaking for datatypes, making it possible to reach

5706 higher cardinalities.

5707 - Prevent the expansion of too large definitions.

5709 * Proof methods "metis" and "meson" now have configuration options

5710 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled

5711 to diagnose these tools. E.g.

5713 using [[metis_trace = true]]

5715 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available

5716 manually as command 'solve_direct'.

5718 * The default SMT solver Z3 must be enabled explicitly (due to

5719 licensing issues) by setting the environment variable

5720 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For

5721 commercial applications, the SMT solver CVC3 is provided as fall-back;

5722 changing the SMT solver is done via the configuration option

5723 "smt_solver".

5725 * Remote SMT solvers need to be referred to by the "remote_" prefix,

5726 i.e. "remote_cvc3" and "remote_z3".

5728 * Added basic SMT support for datatypes, records, and typedefs using

5729 the oracle mode (no proofs). Direct support of pairs has been dropped

5730 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT

5731 support for a similar behavior). Minor INCOMPATIBILITY.

5733 * Changed SMT configuration options:

5734 - Renamed:

5735 z3_proofs ~> smt_oracle (with inverted meaning)

5736 z3_trace_assms ~> smt_trace_used_facts

5737 INCOMPATIBILITY.

5738 - Added:

5739 smt_verbose

5740 smt_random_seed

5741 smt_datatypes

5742 smt_infer_triggers

5743 smt_monomorph_limit

5744 cvc3_options

5745 remote_cvc3_options

5746 remote_z3_options

5747 yices_options

5749 * Boogie output files (.b2i files) need to be declared in the theory

5750 header.

5752 * Simplification procedure "list_to_set_comprehension" rewrites list

5753 comprehensions applied to List.set to set comprehensions. Occasional

5754 INCOMPATIBILITY, may be deactivated like this:

5756 declare [[simproc del: list_to_set_comprehension]]

5758 * Removed old version of primrec package. INCOMPATIBILITY.

5760 * Removed simplifier congruence rule of "prod_case", as has for long

5761 been the case with "split". INCOMPATIBILITY.

5763 * String.literal is a type, but not a datatype. INCOMPATIBILITY.

5765 * Removed [split_format ... and ... and ...] version of

5766 [split_format]. Potential INCOMPATIBILITY.

5768 * Predicate "sorted" now defined inductively, with nice induction

5769 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.

5771 * Constant "contents" renamed to "the_elem", to free the generic name

5772 contents for other uses. INCOMPATIBILITY.

5774 * Renamed class eq and constant eq (for code generation) to class

5775 equal and constant equal, plus renaming of related facts and various

5776 tuning. INCOMPATIBILITY.

5778 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.

5780 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".

5781 INCOMPATIBILITY.

5783 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to

5784 avoid confusion with finite sets. INCOMPATIBILITY.

5786 * Abandoned locales equiv, congruent and congruent2 for equivalence

5787 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same

5788 for congruent(2)).

5790 * Some previously unqualified names have been qualified:

5792 types

5793 bool ~> HOL.bool

5794 nat ~> Nat.nat

5796 constants

5797 Trueprop ~> HOL.Trueprop

5798 True ~> HOL.True

5799 False ~> HOL.False

5800 op & ~> HOL.conj

5801 op | ~> HOL.disj

5802 op --> ~> HOL.implies

5803 op = ~> HOL.eq

5804 Not ~> HOL.Not

5805 The ~> HOL.The

5806 All ~> HOL.All

5807 Ex ~> HOL.Ex

5808 Ex1 ~> HOL.Ex1

5809 Let ~> HOL.Let

5810 If ~> HOL.If

5811 Ball ~> Set.Ball

5812 Bex ~> Set.Bex

5813 Suc ~> Nat.Suc

5814 Pair ~> Product_Type.Pair

5815 fst ~> Product_Type.fst

5816 snd ~> Product_Type.snd

5817 curry ~> Product_Type.curry

5818 op : ~> Set.member

5819 Collect ~> Set.Collect

5821 INCOMPATIBILITY.

5823 * More canonical naming convention for some fundamental definitions:

5825 bot_bool_eq ~> bot_bool_def

5826 top_bool_eq ~> top_bool_def

5827 inf_bool_eq ~> inf_bool_def

5828 sup_bool_eq ~> sup_bool_def

5829 bot_fun_eq ~> bot_fun_def

5830 top_fun_eq ~> top_fun_def

5831 inf_fun_eq ~> inf_fun_def

5832 sup_fun_eq ~> sup_fun_def

5834 INCOMPATIBILITY.

5836 * More stylized fact names:

5838 expand_fun_eq ~> fun_eq_iff

5839 expand_set_eq ~> set_eq_iff

5840 set_ext ~> set_eqI

5841 nat_number ~> eval_nat_numeral

5843 INCOMPATIBILITY.

5845 * Refactoring of code-generation specific operations in theory List:

5847 constants

5848 null ~> List.null

5850 facts

5851 mem_iff ~> member_def

5852 null_empty ~> null_def

5854 INCOMPATIBILITY. Note that these were not supposed to be used

5855 regularly unless for striking reasons; their main purpose was code

5856 generation.

5858 Various operations from the Haskell prelude are used for generating

5859 Haskell code.

5861 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term

5862 "surj f" is now an abbreviation of "range f = UNIV". The theorems

5863 bij_def and surj_def are unchanged. INCOMPATIBILITY.

5865 * Abolished some non-alphabetic type names: "prod" and "sum" replace

5866 "*" and "+" respectively. INCOMPATIBILITY.

5868 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write

5869 "Sum_Type.Plus" instead.

5871 * Constant "split" has been merged with constant "prod_case"; names of

5872 ML functions, facts etc. involving split have been retained so far,

5873 though. INCOMPATIBILITY.

5875 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"

5876 instead. INCOMPATIBILITY.

5878 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".

5879 INCOMPATIBILITY.

5881 * Former theory Library/Enum is now part of the HOL-Main image.

5882 INCOMPATIBILITY: all constants of the Enum theory now have to be

5883 referred to by its qualified name.

5885 enum ~> Enum.enum

5886 nlists ~> Enum.nlists

5887 product ~> Enum.product

5889 * Theory Library/Monad_Syntax provides do-syntax for monad types.

5890 Syntax in Library/State_Monad has been changed to avoid ambiguities.

5891 INCOMPATIBILITY.

5893 * Theory Library/SetsAndFunctions has been split into

5894 Library/Function_Algebras and Library/Set_Algebras; canonical names

5895 for instance definitions for functions; various improvements.

5896 INCOMPATIBILITY.

5898 * Theory Library/Multiset provides stable quicksort implementation of

5899 sort_key.

5901 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.

5902 INCOMPATIBILITY.

5904 * Session Multivariate_Analysis: introduced a type class for euclidean

5905 space. Most theorems are now stated in terms of euclidean spaces

5906 instead of finite cartesian products.

5908 types

5909 real ^ 'n ~> 'a::real_vector

5910 ~> 'a::euclidean_space

5911 ~> 'a::ordered_euclidean_space

5912 (depends on your needs)

5914 constants

5915 _ $ _ ~> _ $$ _

5916 \<chi> x. _ ~> \<chi>\<chi> x. _

5917 CARD('n) ~> DIM('a)

5919 Also note that the indices are now natural numbers and not from some

5920 finite type. Finite cartesian products of euclidean spaces, products

5921 of euclidean spaces the real and complex numbers are instantiated to

5922 be euclidean_spaces. INCOMPATIBILITY.

5924 * Session Probability: introduced pextreal as positive extended real

5925 numbers. Use pextreal as value for measures. Introduce the

5926 Radon-Nikodym derivative, product spaces and Fubini's theorem for

5927 arbitrary sigma finite measures. Introduces Lebesgue measure based on

5928 the integral in Multivariate Analysis. INCOMPATIBILITY.

5930 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.

5931 INCOMPATIBILITY.

5933 * Session SPARK (with image HOL-SPARK) provides commands to load and

5934 prove verification conditions generated by the SPARK Ada program

5935 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.

5938 *** HOL-Algebra ***

5940 * Theorems for additive ring operations (locale abelian_monoid and

5941 descendants) are generated by interpretation from their multiplicative

5942 counterparts. Names (in particular theorem names) have the mandatory

5943 qualifier 'add'. Previous theorem names are redeclared for

5944 compatibility.

5946 * Structure "int_ring" is now an abbreviation (previously a

5947 definition). This fits more natural with advanced interpretations.

5950 *** HOLCF ***

5952 * The domain package now runs in definitional mode by default: The

5953 former command 'new_domain' is now called 'domain'. To use the domain

5954 package in its original axiomatic mode, use 'domain (unsafe)'.

5955 INCOMPATIBILITY.

5957 * The new class "domain" is now the default sort. Class "predomain"

5958 is an unpointed version of "domain". Theories can be updated by

5959 replacing sort annotations as shown below. INCOMPATIBILITY.

5961 'a::type ~> 'a::countable

5962 'a::cpo ~> 'a::predomain

5963 'a::pcpo ~> 'a::domain

5965 * The old type class "rep" has been superseded by class "domain".

5966 Accordingly, users of the definitional package must remove any

5967 "default_sort rep" declarations. INCOMPATIBILITY.

5969 * The domain package (definitional mode) now supports unpointed

5970 predomain argument types, as long as they are marked 'lazy'. (Strict

5971 arguments must be in class "domain".) For example, the following

5972 domain definition now works:

5974 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")

5976 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class

5977 instances for types from main HOL: bool, nat, int, char, 'a + 'b,

5978 'a option, and 'a list. Additionally, it configures fixrec and the

5979 domain package to work with these types. For example:

5981 fixrec isInl :: "('a + 'b) u -> tr"

5982 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"

5984 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")

5986 * The "(permissive)" option of fixrec has been replaced with a

5987 per-equation "(unchecked)" option. See

5988 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.

5990 * The "bifinite" class no longer fixes a constant "approx"; the class

5991 now just asserts that such a function exists. INCOMPATIBILITY.

5993 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer

5994 defines an embedding of type 'a defl into udom by default; instances

5995 of "bifinite" and "domain" classes are available in

5996 src/HOL/HOLCF/Library/Defl_Bifinite.thy.

5998 * The syntax "REP('a)" has been replaced with "DEFL('a)".

6000 * The predicate "directed" has been removed. INCOMPATIBILITY.

6002 * The type class "finite_po" has been removed. INCOMPATIBILITY.

6004 * The function "cprod_map" has been renamed to "prod_map".

6005 INCOMPATIBILITY.

6007 * The monadic bind operator on each powerdomain has new binder syntax

6008 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents

6009 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".

6011 * The infix syntax for binary union on each powerdomain has changed

6012 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set

6013 syntax. INCOMPATIBILITY.

6015 * The constant "UU" has been renamed to "bottom". The syntax "UU" is

6016 still supported as an input translation.

6018 * Renamed some theorems (the original names are also still available).

6020 expand_fun_below ~> fun_below_iff

6021 below_fun_ext ~> fun_belowI

6022 expand_cfun_eq ~> cfun_eq_iff

6023 ext_cfun ~> cfun_eqI

6024 expand_cfun_below ~> cfun_below_iff

6025 below_cfun_ext ~> cfun_belowI

6026 cont2cont_Rep_CFun ~> cont2cont_APP

6028 * The Abs and Rep functions for various types have changed names.

6029 Related theorem names have also changed to match. INCOMPATIBILITY.

6031 Rep_CFun ~> Rep_cfun

6032 Abs_CFun ~> Abs_cfun

6033 Rep_Sprod ~> Rep_sprod

6034 Abs_Sprod ~> Abs_sprod

6035 Rep_Ssum ~> Rep_ssum

6036 Abs_Ssum ~> Abs_ssum

6038 * Lemmas with names of the form *_defined_iff or *_strict_iff have

6039 been renamed to *_bottom_iff. INCOMPATIBILITY.

6041 * Various changes to bisimulation/coinduction with domain package:

6043 - Definitions of "bisim" constants no longer mention definedness.

6044 - With mutual recursion, "bisim" predicate is now curried.

6045 - With mutual recursion, each type gets a separate coind theorem.

6046 - Variable names in bisim_def and coinduct rules have changed.

6048 INCOMPATIBILITY.

6050 * Case combinators generated by the domain package for type "foo" are

6051 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.

6053 * Several theorems have been renamed to more accurately reflect the

6054 names of constants and types involved. INCOMPATIBILITY.

6056 thelub_const ~> lub_const

6057 lub_const ~> is_lub_const

6058 thelubI ~> lub_eqI

6059 is_lub_lub ~> is_lubD2

6060 lubI ~> is_lub_lub

6061 unique_lub ~> is_lub_unique

6062 is_ub_lub ~> is_lub_rangeD1

6063 lub_bin_chain ~> is_lub_bin_chain

6064 lub_fun ~> is_lub_fun

6065 thelub_fun ~> lub_fun

6066 thelub_cfun ~> lub_cfun

6067 thelub_Pair ~> lub_Pair

6068 lub_cprod ~> is_lub_prod

6069 thelub_cprod ~> lub_prod

6070 minimal_cprod ~> minimal_prod

6071 inst_cprod_pcpo ~> inst_prod_pcpo

6072 UU_I ~> bottomI

6073 compact_UU ~> compact_bottom

6074 deflation_UU ~> deflation_bottom

6075 finite_deflation_UU ~> finite_deflation_bottom

6077 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.

6079 sq_ord_less_eq_trans ~> below_eq_trans

6080 sq_ord_eq_less_trans ~> eq_below_trans

6081 refl_less ~> below_refl

6082 trans_less ~> below_trans

6083 antisym_less ~> below_antisym

6084 antisym_less_inverse ~> po_eq_conv [THEN iffD1]

6085 box_less ~> box_below

6086 rev_trans_less ~> rev_below_trans

6087 not_less2not_eq ~> not_below2not_eq

6088 less_UU_iff ~> below_UU_iff

6089 flat_less_iff ~> flat_below_iff

6090 adm_less ~> adm_below

6091 adm_not_less ~> adm_not_below

6092 adm_compact_not_less ~> adm_compact_not_below

6093 less_fun_def ~> below_fun_def

6094 expand_fun_less ~> fun_below_iff

6095 less_fun_ext ~> fun_belowI

6096 less_discr_def ~> below_discr_def

6097 discr_less_eq ~> discr_below_eq

6098 less_unit_def ~> below_unit_def

6099 less_cprod_def ~> below_prod_def

6100 prod_lessI ~> prod_belowI

6101 Pair_less_iff ~> Pair_below_iff

6102 fst_less_iff ~> fst_below_iff

6103 snd_less_iff ~> snd_below_iff

6104 expand_cfun_less ~> cfun_below_iff

6105 less_cfun_ext ~> cfun_belowI

6106 injection_less ~> injection_below

6107 less_up_def ~> below_up_def

6108 not_Iup_less ~> not_Iup_below

6109 Iup_less ~> Iup_below

6110 up_less ~> up_below

6111 Def_inject_less_eq ~> Def_below_Def

6112 Def_less_is_eq ~> Def_below_iff

6113 spair_less_iff ~> spair_below_iff

6114 less_sprod ~> below_sprod

6115 spair_less ~> spair_below

6116 sfst_less_iff ~> sfst_below_iff

6117 ssnd_less_iff ~> ssnd_below_iff

6118 fix_least_less ~> fix_least_below

6119 dist_less_one ~> dist_below_one

6120 less_ONE ~> below_ONE

6121 ONE_less_iff ~> ONE_below_iff

6122 less_sinlD ~> below_sinlD

6123 less_sinrD ~> below_sinrD

6126 *** FOL and ZF ***

6128 * All constant names are now qualified internally and use proper

6129 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.

6132 *** ML ***

6134 * Antiquotation @{assert} inlines a function bool -> unit that raises

6135 Fail if the argument is false. Due to inlining the source position of

6136 failed assertions is included in the error output.

6138 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML

6139 text is in practice always evaluated with a stable theory checkpoint.

6140 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.

6142 * Antiquotation @{theory A} refers to theory A from the ancestry of

6143 the current context, not any accidental theory loader state as before.

6144 Potential INCOMPATIBILITY, subtle change in semantics.

6146 * Syntax.pretty_priority (default 0) configures the required priority

6147 of pretty-printed output and thus affects insertion of parentheses.

6149 * Syntax.default_root (default "any") configures the inner syntax

6150 category (nonterminal symbol) for parsing of terms.

6152 * Former exception Library.UnequalLengths now coincides with

6153 ListPair.UnequalLengths.

6155 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the

6156 main functionality is provided by structure Simplifier.

6158 * Renamed raw "explode" function to "raw_explode" to emphasize its

6159 meaning. Note that internally to Isabelle, Symbol.explode is used in

6160 almost all situations.

6162 * Discontinued obsolete function sys_error and exception SYS_ERROR.

6163 See implementation manual for further details on exceptions in

6164 Isabelle/ML.

6166 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its

6167 meaning.

6169 * Renamed structure PureThy to Pure_Thy and moved most of its

6170 operations to structure Global_Theory, to emphasize that this is

6171 rarely-used global-only stuff.

6173 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln

6174 instead (or tracing for high-volume output).

6176 * Configuration option show_question_marks only affects regular pretty

6177 printing of types and terms, not raw Term.string_of_vname.

6179 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare

6180 INCOMPATIBILITY, superseded by static antiquotations @{thm} and

6181 @{thms} for most purposes.

6183 * ML structure Unsynchronized is never opened, not even in Isar

6184 interaction mode as before. Old Unsynchronized.set etc. have been

6185 discontinued -- use plain := instead. This should be *rare* anyway,

6186 since modern tools always work via official context data, notably

6187 configuration options.

6189 * Parallel and asynchronous execution requires special care concerning

6190 interrupts. Structure Exn provides some convenience functions that

6191 avoid working directly with raw Interrupt. User code must not absorb

6192 interrupts -- intermediate handling (for cleanup etc.) needs to be

6193 followed by re-raising of the original exception. Another common

6194 source of mistakes are "handle _" patterns, which make the meaning of

6195 the program subject to physical effects of the environment.

6199 New in Isabelle2009-2 (June 2010)

6200 ---------------------------------

6202 *** General ***

6204 * Authentic syntax for *all* logical entities (type classes, type

6205 constructors, term constants): provides simple and robust

6206 correspondence between formal entities and concrete syntax. Within

6207 the parse tree / AST representations, "constants" are decorated by

6208 their category (class, type, const) and spelled out explicitly with

6209 their full internal name.

6211 Substantial INCOMPATIBILITY concerning low-level syntax declarations

6212 and translations (translation rules and translation functions in ML).

6213 Some hints on upgrading:

6215 - Many existing uses of 'syntax' and 'translations' can be replaced

6216 by more modern 'type_notation', 'notation' and 'abbreviation',

6217 which are independent of this issue.

6219 - 'translations' require markup within the AST; the term syntax

6220 provides the following special forms:

6222 CONST c -- produces syntax version of constant c from context

6223 XCONST c -- literally c, checked as constant from context

6224 c -- literally c, if declared by 'syntax'

6226 Plain identifiers are treated as AST variables -- occasionally the

6227 system indicates accidental variables via the error "rhs contains

6228 extra variables".

6230 Type classes and type constructors are marked according to their

6231 concrete syntax. Some old translations rules need to be written

6232 for the "type" category, using type constructor application

6233 instead of pseudo-term application of the default category

6234 "logic".

6236 - 'parse_translation' etc. in ML may use the following

6237 antiquotations:

6239 @{class_syntax c} -- type class c within parse tree / AST

6240 @{term_syntax c} -- type constructor c within parse tree / AST

6241 @{const_syntax c} -- ML version of "CONST c" above

6242 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)

6244 - Literal types within 'typed_print_translations', i.e. those *not*

6245 represented as pseudo-terms are represented verbatim. Use @{class

6246 c} or @{type_name c} here instead of the above syntax

6247 antiquotations.

6249 Note that old non-authentic syntax was based on unqualified base

6250 names, so all of the above "constant" names would coincide. Recall

6251 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to

6252 diagnose syntax problems.

6254 * Type constructors admit general mixfix syntax, not just infix.

6256 * Concrete syntax may be attached to local entities without a proof

6257 body, too. This works via regular mixfix annotations for 'fix',

6258 'def', 'obtain' etc. or via the explicit 'write' command, which is

6259 similar to the 'notation' command in theory specifications.

6261 * Discontinued unnamed infix syntax (legacy feature for many years) --

6262 need to specify constant name and syntax separately. Internal ML

6263 datatype constructors have been renamed from InfixName to Infix etc.

6264 Minor INCOMPATIBILITY.

6266 * Schematic theorem statements need to be explicitly markup as such,

6267 via commands 'schematic_lemma', 'schematic_theorem',

6268 'schematic_corollary'. Thus the relevance of the proof is made

6269 syntactically clear, which impacts performance in a parallel or

6270 asynchronous interactive environment. Minor INCOMPATIBILITY.

6272 * Use of cumulative prems via "!" in some proof methods has been

6273 discontinued (old legacy feature).

6275 * References 'trace_simp' and 'debug_simp' have been replaced by

6276 configuration options stored in the context. Enabling tracing (the

6277 case of debugging is similar) in proofs works via

6279 using [[trace_simp = true]]

6281 Tracing is then active for all invocations of the simplifier in