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

NEWS

author | wenzelm |

Wed Jan 20 20:19:05 2016 +0100 (2016-01-20 ago) | |

changeset 62216 | 5fb86150a579 |

parent 62209 | 009c6e0b44bb |

child 62284 | 1fd4831e9f93 |

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

back to post-release mode -- after fork point;

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

12 New in Isabelle2016 (February 2016)

13 -----------------------------------

15 *** General ***

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

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

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

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

21 examples that do require HOL.

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

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

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

27 without any special print mode. Important ASCII replacement syntax

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

29 has been removed (see below).

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

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

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

35 context has been discontinued. Rare INCOMPATIBILITY, use explicit

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

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

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

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

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

42 meaning.

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

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

46 to update old sources.

48 * Toplevel theorem statements have been simplified as follows:

50 theorems ~> lemmas

51 schematic_lemma ~> schematic_goal

52 schematic_theorem ~> schematic_goal

53 schematic_corollary ~> schematic_goal

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

56 accordingly.

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

59 'theorem'.

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

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

63 deferred definitions require a surrounding 'overloading' block.

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

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

69 Isabelle/ML and official Standard ML. Configuration option "ML_debugger"

70 and commands 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

71 'SML_file_no_debug' control compilation of sources with debugging

72 information. The Debugger panel allows to set breakpoints (via context

73 menu), step through stopped threads, evaluate local ML expressions etc.

74 At least one Debugger view needs to be active to have any effect on the

75 running ML program.

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

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

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

80 update.

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

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

84 enable option "editor_output_state".

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

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

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

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

90 visibility.

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

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

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

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

96 panel.

98 * Improved scheduling for urgent print tasks (e.g. command state output,

99 interactive queries) wrt. long-running background tasks.

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

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

103 implicit: a popup will show up unconditionally.

105 * Additional abbreviations for syntactic completion may be specified in

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

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

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

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

111 the editor.

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

114 instead of former C+e LEFT.

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

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

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

119 instead.

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

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

123 single-instance applications seen on common GUI desktops.

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

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

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

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

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

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

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

136 *** Document preparation ***

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

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

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

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

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

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

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

147 follows:

149 \<^item> itemize

150 \<^enum> enumerate

151 \<^descr> description

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

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

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

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

157 standard Isabelle fonts provide glyphs to render important control

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

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

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

162 standard LaTeX macros of the same names.

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

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

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

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

168 cartouche tokens seen in theory sources.

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

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

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

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

174 or terminal spaces are ignored.

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

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

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

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

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

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

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

186 (outer syntax with command keywords etc.). This may be used in the short

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

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

190 documentation, with a hyperlink in the Prover IDE.

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

193 entities of the Isar language.

195 * HTML presentation uses the standard IsabelleText font and Unicode

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

197 print mode "HTML" loses its special meaning.

200 *** Isar ***

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

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

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

205 example:

207 have result: "C x y"

208 if "A x" and "B y"

209 for x :: 'a and y :: 'a

210 <proof>

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

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

214 corresponds to a raw proof block like this:

216 {

217 fix x :: 'a and y :: 'a

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

219 have "C x y" <proof>

220 }

221 note result = this

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

224 instead of 'assume' above.

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

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

229 assume result: "C x y"

230 if "A x" and "B y"

231 for x :: 'a and y :: 'a

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

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

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

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

238 example:

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

242 is equivalent to:

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

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

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

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

249 follows:

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

253 or:

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

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

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

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

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

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

264 of the local context elements yet.

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

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

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

270 then have something

271 proof cases

272 case a

273 then show ?thesis <proof>

274 next

275 case b

276 then show ?thesis <proof>

277 next

278 case c

279 then show ?thesis <proof>

280 qed

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

284 case a: (c xs)

285 case a [attributes]: (c xs)

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

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

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

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

291 and always put attributes in front.

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

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

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

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

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

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

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

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

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

304 supply [simp] = a

305 proof

306 show A by simp

307 next

308 show A by simp

309 qed

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

312 proof body as well, abstracted over relevant parameters.

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

315 parameter scope for of each clause.

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

318 statements: result is abstracted over unknowns.

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

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

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

323 manual.

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

326 ('apply' scripts).

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

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

330 example:

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

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

334 proof goal_cases

335 case (1 x)

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

337 next

338 case (2 y z)

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

340 qed

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

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

344 proof goal_cases

345 case prems: 1

346 then show ?case using prems sorry

347 next

348 case prems: 2

349 then show ?case using prems sorry

350 qed

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

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

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

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

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

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

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

361 occasionally useful for demonstration and testing purposes.

364 *** Pure ***

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

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

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

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

371 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

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

374 * More gentle suppression of syntax along locale morphisms while

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

376 would be suppressed for morphisms except term identity. Now

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

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

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

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

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

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

384 begin

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

386 end

388 locale morphism =

389 left: struct composition + right: struct composition'

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

391 begin

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

393 end

395 * Command 'global_interpretation' issues interpretations into global

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

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

399 'defines'.

401 * Command 'permanent_interpretation' has been discontinued. Use

402 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

404 * Command 'print_definitions' prints dependencies of definitional

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

407 * Configuration option rule_insts_schematic has been discontinued

408 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

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

411 INCOMPATIBILITY in situations where the previous misbehaviour has been

412 exploited.

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

415 operations behave more similar to abbreviations. Potential

416 INCOMPATIBILITY in exotic situations.

419 *** HOL ***

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

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

423 global collection of overloaded constant / type definitions into

424 account. Type definitions with open dependencies on overloaded

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

426 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

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

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

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

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

432 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

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

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

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

437 simplify porting old theories:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

466 INCOMPATIBILITY, use plain "::" instead.

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

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

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

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

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

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

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

476 definition and its monotonicity result. Rare INCOMPATIBILITY.

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

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

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

481 also subject to "inductive_internals". Rare INCOMPATIBILITY.

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

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

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

486 INCOMPATIBILITY.

488 * Combinator to represent case distinction on products is named

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

490 theorem aliasses have been retained.

492 Consolidated facts:

493 PairE ~> prod.exhaust

494 Pair_eq ~> prod.inject

495 pair_collapse ~> prod.collapse

496 Pair_fst_snd_eq ~> prod_eq_iff

497 split_twice ~> prod.case_distrib

498 split_weak_cong ~> prod.case_cong_weak

499 split_split ~> prod.split

500 split_split_asm ~> prod.split_asm

501 splitI ~> case_prodI

502 splitD ~> case_prodD

503 splitI2 ~> case_prodI2

504 splitI2' ~> case_prodI2'

505 splitE ~> case_prodE

506 splitE' ~> case_prodE'

507 split_pair ~> case_prod_Pair

508 split_eta ~> case_prod_eta

509 split_comp ~> case_prod_comp

510 mem_splitI ~> mem_case_prodI

511 mem_splitI2 ~> mem_case_prodI2

512 mem_splitE ~> mem_case_prodE

513 The_split ~> The_case_prod

514 cond_split_eta ~> cond_case_prod_eta

515 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

516 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

517 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

518 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

519 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

520 Domain_Collect_split ~> Domain_Collect_case_prod

521 Image_Collect_split ~> Image_Collect_case_prod

522 Range_Collect_split ~> Range_Collect_case_prod

523 Eps_split ~> Eps_case_prod

524 Eps_split_eq ~> Eps_case_prod_eq

525 split_rsp ~> case_prod_rsp

526 curry_split ~> curry_case_prod

527 split_curry ~> case_prod_curry

529 Changes in structure HOLogic:

530 split_const ~> case_prod_const

531 mk_split ~> mk_case_prod

532 mk_psplits ~> mk_ptupleabs

533 strip_psplits ~> strip_ptupleabs

535 INCOMPATIBILITY.

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

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

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

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

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

543 Consolidated facts (among others):

544 real_of_nat_le_iff -> of_nat_le_iff

545 real_of_nat_numeral of_nat_numeral

546 real_of_int_zero of_int_0

547 real_of_nat_zero of_nat_0

548 real_of_one of_int_1

549 real_of_int_add of_int_add

550 real_of_nat_add of_nat_add

551 real_of_int_diff of_int_diff

552 real_of_nat_diff of_nat_diff

553 floor_subtract floor_diff_of_int

554 real_of_int_inject of_int_eq_iff

555 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

556 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

557 real_of_nat_ge_zero of_nat_0_le_iff

558 real_of_int_ceiling_ge le_of_int_ceiling

559 ceiling_less_eq ceiling_less_iff

560 ceiling_le_eq ceiling_le_iff

561 less_floor_eq less_floor_iff

562 floor_less_eq floor_less_iff

563 floor_divide_eq_div floor_divide_of_int_eq

564 real_of_int_zero_cancel of_nat_eq_0_iff

565 ceiling_real_of_int ceiling_of_int

567 INCOMPATIBILITY.

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

570 been removed. INCOMPATIBILITY.

572 * Quickcheck setup for finite sets.

574 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

576 * Sledgehammer:

577 - The MaSh relevance filter has been sped up.

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

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

580 - Auto Sledgehammer now minimizes and preplays the results.

581 - Handle Vampire 4.0 proof output without raising exception.

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

583 Isabelle/jEdit instead. INCOMPATIBILITY.

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

586 * Nitpick:

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

588 - Fixed soundness bug in "destroy_constrs" optimization.

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

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

591 - Eliminated obsolete "blocking" option.

593 * (Co)datatype package:

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

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

596 - Always generate "case_transfer" theorem.

597 - For mutual types, generate slightly stronger "rel_induct", "rel_coinduct",

598 and "coinduct" theorems. INCOMPATIBLITY.

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

600 being defined.

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

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

604 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

605 'transfer_prover_start' and 'transfer_prover_end'.

607 * New diagnostic command print_record for displaying record definitions.

609 * Division on integers is bootstrapped directly from division on

610 naturals and uses generic numeral algorithm for computations. Slight

611 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

612 simprocs binary_int_div and binary_int_mod

614 * Tightened specification of class semiring_no_zero_divisors. Minor

615 INCOMPATIBILITY.

617 * Class algebraic_semidom introduces common algebraic notions of

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

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

620 fields with notions that are trivial there.

622 * Class normalization_semidom specifies canonical representants for

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

624 This formalizes associated elements as well.

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

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

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

629 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

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

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

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

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

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

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

637 during instantiation.

639 * New cancellation simprocs for boolean algebras to cancel complementary

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

641 "top". INCOMPATIBILITY.

643 * Class uniform_space introduces uniform spaces btw topological spaces

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

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

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

648 open_real_def \<leadsto> open_dist

649 open_complex_def \<leadsto> open_dist

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

653 * Library/Multiset:

654 - Renamed multiset inclusion operators:

655 < ~> <#

656 > ~> >#

657 <= ~> <=#

658 >= ~> >=#

659 \<le> ~> \<le>#

660 \<ge> ~> \<ge>#

661 INCOMPATIBILITY.

662 - Added multiset inclusion operator syntax:

663 \<subset>#

664 \<subseteq>#

665 \<supset>#

666 \<supseteq>#

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

668 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

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

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

671 are now available through the "subset_mset" interpretation

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

673 INCOMPATIBILITY.

674 - Renamed conversions:

675 multiset_of ~> mset

676 multiset_of_set ~> mset_set

677 set_of ~> set_mset

678 INCOMPATIBILITY

679 - Renamed lemmas:

680 mset_le_def ~> subseteq_mset_def

681 mset_less_def ~> subset_mset_def

682 less_eq_multiset.rep_eq ~> subseteq_mset_def

683 INCOMPATIBILITY

684 - Removed lemmas generated by lift_definition:

685 less_eq_multiset.abs_eq, less_eq_multiset.rsp less_eq_multiset.transfer

686 less_eq_multiset_def

687 INCOMPATIBILITY

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

691 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

692 Bourbaki-Witt fixpoint theorem for increasing functions in

693 chain-complete partial orders.

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

696 Minor INCOMPATIBILITY, use 'function' instead.

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

699 periodic functions.

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

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

703 GCD.

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

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

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

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

711 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

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

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

714 Theorem of Algebra. Ported from HOL Light.

716 * HOL-Multivariate_Analysis: topological concepts such as connected

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

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

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

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

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

723 properties.

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

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

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

729 structures.

732 *** ML ***

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

735 system are available:

737 profile_time (*CPU time*)

738 profile_time_thread (*CPU time on this thread*)

739 profile_allocations (*overall heap allocations*)

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

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

744 Isar proof method.

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

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

748 breaks.

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

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

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

754 * Simproc programming interfaces have been simplified:

755 Simplifier.make_simproc and Simplifier.define_simproc supersede various

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

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

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

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

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

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

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

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

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

769 Old cterm_instantiate is superseded by infer_instantiate.

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

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

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

774 instead (with proper context).

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

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

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

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

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

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

783 the proof context discipline.

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

786 context_tactic, which allows to change the proof context dynamically

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

788 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

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

792 *** System ***

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

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

797 conflations:

799 hence ~> then have

800 thus ~> then show

802 This syntax is more orthogonal and improves readability and

803 maintainability of proofs.

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

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

807 performance.

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

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

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

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

815 space.

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

818 platforms as follows.

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

821 associated with the main app bundle

823 - isabelle jedit: settings

824 JEDIT_JAVA_SYSTEM_OPTIONS

825 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

827 - isabelle build: settings

828 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

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

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

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

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

835 required after change.

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

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

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

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

845 New in Isabelle2015 (May 2015)

846 ------------------------------

848 *** General ***

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

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

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

854 context

855 begin

857 private definition ...

858 private lemma ...

860 qualified definition ...

861 qualified lemma ...

863 lemma ...

864 theorem ...

866 end

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

869 naming policy.

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

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

873 INCOMPATIBILITY, use 'sorry' instead.

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

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

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

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

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

881 schematically expanded before search. Search results match the naive

882 expectation more closely, particularly wrt. abbreviations.

883 INCOMPATIBILITY.

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

886 theory context.

888 * Outer syntax commands are managed authentically within the theory

889 context, without implicit global state. Potential for accidental

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

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

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

894 update_semicolons" to remove obsolete semicolons from old theory

895 sources.

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

898 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

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

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

902 method provides basic fact/term matching in addition to

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

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

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

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

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

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

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

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

915 option jedit_structure_limit determines maximum number of lines to scan

916 in the buffer.

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

919 marker, SideKick parser.

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

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

923 the editor (hyperlinks, completion etc.).

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

926 Options / Text Area).

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

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

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

932 restrict the visualized hierarchy.

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

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

938 *** Document preparation ***

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

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

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

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

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

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

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

947 update_header"). Minor INCOMPATIBILITY.

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

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

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

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

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

955 style.

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

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

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

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

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

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

964 tags. Potential INCOMPATIBILITY in exotic situations.

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

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

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

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

970 dynamically in GUI front-ends. Implementations of document

971 antiquotations need to observe the margin explicitly according to

972 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

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

975 mandatory for document preparation. The legacy mode with implicit

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

977 INCOMPATIBILITY.

980 *** Pure ***

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

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

984 these variables become schematic in the instantiated theorem; this

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

986 Configuration option rule_insts_schematic (default false) controls use

987 of schematic variables outside the context. Minor INCOMPATIBILITY,

988 declare rule_insts_schematic = true temporarily and update to use local

989 variable declarations or dummy patterns instead.

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

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

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

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

996 incremented to avoid material in the proof context. Rare

997 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

998 different index.

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

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

1002 of numeral signs, particularly in expressions involving infix syntax

1003 like "(- 1) ^ n".

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

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

1007 token category instead.

1010 *** HOL ***

1012 * New (co)datatype package:

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

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

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

1016 'isabelle doc datatypes' for information on porting.

1017 INCOMPATIBILITY.

1018 - Renamed theorems:

1019 disc_corec ~> corec_disc

1020 disc_corec_iff ~> corec_disc_iff

1021 disc_exclude ~> distinct_disc

1022 disc_exhaust ~> exhaust_disc

1023 disc_map_iff ~> map_disc_iff

1024 sel_corec ~> corec_sel

1025 sel_exhaust ~> exhaust_sel

1026 sel_map ~> map_sel

1027 sel_set ~> set_sel

1028 sel_split ~> split_sel

1029 sel_split_asm ~> split_sel_asm

1030 strong_coinduct ~> coinduct_strong

1031 weak_case_cong ~> case_cong_weak

1032 INCOMPATIBILITY.

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

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

1035 INCOMPATIBILITY.

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

1037 consequences of other set rules "by auto".

1038 INCOMPATIBILITY.

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

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

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

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

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

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

1045 INCOMPATIBILITY.

1046 - Renamed theories:

1047 BNF_Comp ~> BNF_Composition

1048 BNF_FP_Base ~> BNF_Fixpoint_Base

1049 BNF_GFP ~> BNF_Greatest_Fixpoint

1050 BNF_LFP ~> BNF_Least_Fixpoint

1051 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

1052 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

1053 INCOMPATIBILITY.

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

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

1056 Lifting_Product and Lifting_Option from Main became obsolete and

1057 were removed. Changed definitions of the relators rel_prod and

1058 rel_sum (using inductive).

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

1060 of rel_prod_def and rel_sum_def.

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

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

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

1064 constructors, case combinators, discriminators, selectors and

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

1066 rules.

1068 * Old datatype package:

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

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

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

1072 'isabelle doc datatypes' for information on porting.

1073 INCOMPATIBILITY.

1074 - Renamed theorems:

1075 weak_case_cong ~> case_cong_weak

1076 INCOMPATIBILITY.

1077 - Renamed theory:

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

1079 INCOMPATIBILITY.

1081 * Nitpick:

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

1083 operations.

1085 * Sledgehammer:

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

1087 default.

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

1089 source. The "z3_non_commercial" option is discontinued.

1090 - Minimization is now always enabled by default.

1091 Removed sub-command:

1092 min

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

1094 dramatically improved.

1095 - Improved support for CVC4 and veriT.

1097 * Old and new SMT modules:

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

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

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

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

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

1103 point to it.

1104 INCOMPATIBILITY.

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

1106 INCOMPATIBILITY.

1107 - New option 'smt_reconstruction_step_timeout' to limit the

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

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

1110 method, especially runtime statistics of Z3 proof reconstruction.

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

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

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

1115 lifting, and avoids tedious workarounds.

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

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

1119 Minor INCOMPATIBILITY.

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

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

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

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

1126 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

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

1129 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

1131 * Class linordered_semidom really requires no zero divisors.

1132 INCOMPATIBILITY.

1134 * Classes division_ring, field and linordered_field always demand

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

1136 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

1138 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

1139 additive inverse operation. INCOMPATIBILITY.

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

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

1143 INCOMPATIBILITY: type constraints may be necessary.

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

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

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

1148 needed.

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

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

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

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

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

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

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

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

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

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

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

1163 "nat_floor"/"nat_ceiling".

1165 * Qualified some duplicated fact names required for boostrapping the

1166 type class hierarchy:

1167 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

1168 field_inverse_zero ~> inverse_zero

1169 field_divide_inverse ~> divide_inverse

1170 field_inverse ~> left_inverse

1171 Minor INCOMPATIBILITY.

1173 * Eliminated fact duplicates:

1174 mult_less_imp_less_right ~> mult_right_less_imp_less

1175 mult_less_imp_less_left ~> mult_left_less_imp_less

1176 Minor INCOMPATIBILITY.

1178 * Fact consolidation: even_less_0_iff is subsumed by

1179 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

1181 * Generalized and consolidated some theorems concerning divsibility:

1182 dvd_reduce ~> dvd_add_triv_right_iff

1183 dvd_plus_eq_right ~> dvd_add_right_iff

1184 dvd_plus_eq_left ~> dvd_add_left_iff

1185 Minor INCOMPATIBILITY.

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

1188 and part of theory Main.

1189 even_def ~> even_iff_mod_2_eq_zero

1190 INCOMPATIBILITY.

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

1193 INCOMPATIBILITY.

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

1196 Fact rename:

1197 listsum_def ~> listsum.eq_foldr

1198 INCOMPATIBILITY.

1200 * Product over lists via constant "listprod".

1202 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

1203 Cons_nth_drop_Suc.

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

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

1207 HOL/Codegenerator_Test/Code_Test* for examples.

1209 * Library/Multiset:

1210 - Introduced "replicate_mset" operation.

1211 - Introduced alternative characterizations of the multiset ordering in

1212 "Library/Multiset_Order".

1213 - Renamed multiset ordering:

1214 <# ~> #<#

1215 <=# ~> #<=#

1216 \<subset># ~> #\<subset>#

1217 \<subseteq># ~> #\<subseteq>#

1218 INCOMPATIBILITY.

1219 - Introduced abbreviations for ill-named multiset operations:

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

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

1222 INCOMPATIBILITY.

1223 - Renamed

1224 in_multiset_of ~> in_multiset_in_set

1225 Multiset.fold ~> fold_mset

1226 Multiset.filter ~> filter_mset

1227 INCOMPATIBILITY.

1228 - Removed mcard, is equal to size.

1229 - Added attributes:

1230 image_mset.id [simp]

1231 image_mset_id [simp]

1232 elem_multiset_of_set [simp, intro]

1233 comp_fun_commute_plus_mset [simp]

1234 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

1235 in_mset_fold_plus_iff [iff]

1236 set_of_Union_mset [simp]

1237 in_Union_mset_iff [iff]

1238 INCOMPATIBILITY.

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

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

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

1243 argument. Minor INCOMPATIBILITY.

1245 * HOL-Decision_Procs: New counterexample generator quickcheck

1246 [approximation] for inequalities of transcendental functions. Uses

1247 hardware floating point arithmetic to randomly discover potential

1248 counterexamples. Counterexamples are certified with the "approximation"

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

1250 examples.

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

1253 (exponentiation on real numbers) again.

1255 * HOL-Probability: Reworked measurability prover

1256 - applies destructor rules repeatedly

1257 - removed application splitting (replaced by destructor rule)

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

1259 projection

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

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

1265 *** ML ***

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

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

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

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

1271 contemporary applications use the strict Name_Space.check (and

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

1273 INCOMPATIBILITY in rare applications of Name_Space.intern.

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

1276 ERROR instead of internal Toplevel.UNDEF.

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

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

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

1282 INCOMPATIBILITY.

1284 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

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

1286 Multithreading.synchronized and its high-level derivative

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

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

1289 nested.

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

1292 change of semantics with minimal potential for INCOMPATIBILITY.

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

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

1296 available as Thm.global_ctyp_of and Thm.global_cterm_of.

1297 INCOMPATIBILITY.

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

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

1301 Thm.term_of etc.

1303 * Proper context for various elementary tactics: assume_tac,

1304 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

1305 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

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

1308 PARALLEL_GOALS.

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

1311 which also allows to specify a fork priority.

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

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

1315 markup). Minor INCOMPATIBILITY.

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

1318 Input.source (with formal position information).

1321 *** System ***

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

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

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

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

1329 be externally triggered using an appropriate ROOT file plus a

1330 corresponding theory. Parametrization is possible using environment

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

1332 INCOMPATIBILITY.

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

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

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

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

1339 menu Global Options / Appearance.

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

1342 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

1346 New in Isabelle2014 (August 2014)

1347 ---------------------------------

1349 *** General ***

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

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

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

1354 environment is restricted to the Standard ML implementation of

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

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

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

1358 some examples.

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

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

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

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

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

1365 restore the previous behavior. INCOMPATIBILITY, especially where

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

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

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

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

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

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

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

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

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

1376 exception. Potential INCOMPATIBILITY for non-conformant tactical

1377 proof tools.

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

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

1381 supports input via ` (backquote).

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

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

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

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

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

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

1390 Minor INCOMPATIBILITY.

1392 * Discontinued legacy_isub_isup, which was a temporary workaround for

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

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

1395 INCOMPATIBILITY.

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

1398 which results in an active hyperlink within the text.

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

1401 not check existence within the file-system.

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

1404 isar-ref, jedit, system.

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

1409 * Improved Document panel: simplified interaction where every single

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

1411 buffer.

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

1414 to PIDE hyperlinks.

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

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

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

1420 auxiliary ML files.

1422 * Improved syntactic and semantic completion mechanism, with simple

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

1424 file-name completion, spell-checker completion.

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

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

1428 keystrokes with slow / remote graphics displays.

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

1431 item, depending on Isabelle options.

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

1434 selections, rectangular selections, rectangular selection as "tall

1435 caret".

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

1438 completion popup and context-menu.

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

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

1442 operations for the context. Minor incompatibility in keyboard

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

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

1446 to highlight text via regular expression.

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

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

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

1451 "isabelle jedit -m MODE".

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

1454 networking operations instead of jEdit virtual file-systems.

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

1457 imports) are automatically removed from the document model.

1459 * Improved monitor panel.

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

1462 more robust treatment of threads and interrupts.

1464 * Improved management of dockable windows: clarified keyboard focus

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

1466 "Detach" a copy where this makes sense.

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

1469 simplification process, enabled by the "simp_trace_new" attribute

1470 within the context.

1473 *** Pure ***

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

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

1477 that is not immediately visible. INCOMPATIBILITY, use regular

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

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

1480 finished trivially if the underlying class definition is made vacuous

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

1482 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

1483 Axclass.arity_axiomatization.

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

1486 qualified. Rare INCOMPATIBILITY, but with potentially serious

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

1488 renaming needs to be applied:

1490 == ~> Pure.eq

1491 ==> ~> Pure.imp

1492 all ~> Pure.all

1493 TYPE ~> Pure.type

1494 dummy_pattern ~> Pure.dummy_pattern

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

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

1498 old constants:

1500 setup {*

1501 fn thy => thy

1502 |> Sign.root_path

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

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

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

1506 |> Sign.restore_naming thy

1507 *}

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

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

1511 the auxiliary aliases are deleted.

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

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

1515 instantiated theorem.

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

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

1519 where instantiations with schematic variables are intended (for

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

1521 following temporary definition may help to port old applications:

1523 attribute_setup standard =

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

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

1527 attributed fact expressions (concerning background theory, declared

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

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

1530 primitive Thm.assume_hyps.

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

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

1534 differently, e.g. via cartouches).

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

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

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

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

1543 *** HOL ***

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

1546 language requirements. INCOMPATIBILITY.

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

1549 INCOMPATIBILITY.

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

1552 INCOMPATIBILITY.

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

1555 option. Minor INCOMPATIBILITY.

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

1558 INCOMPATIBILITY.

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

1561 with the given constants.

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

1564 operations on records.

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

1567 ML. Minor INCOMPATIBILITY.

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

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

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

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

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

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

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

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

1580 again in the future. INCOMPATIBILITY.

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

1583 spurious crashes and other surprises. Potential INCOMPATIBILITY.

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

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

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

1588 part of theory "Main".

1590 Theory renamings:

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

1592 Library/Wfrec.thy ~> Wfrec.thy

1593 Library/Zorn.thy ~> Zorn.thy

1594 Cardinals/Order_Relation.thy ~> Order_Relation.thy

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

1596 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

1597 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

1598 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

1599 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

1600 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

1601 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

1602 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

1603 BNF/BNF_Comp.thy ~> BNF_Comp.thy

1604 BNF/BNF_Def.thy ~> BNF_Def.thy

1605 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

1606 BNF/BNF_GFP.thy ~> BNF_GFP.thy

1607 BNF/BNF_LFP.thy ~> BNF_LFP.thy

1608 BNF/BNF_Util.thy ~> BNF_Util.thy

1609 BNF/Coinduction.thy ~> Coinduction.thy

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

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

1612 BNF/Examples/* ~> BNF_Examples/*

1614 New theories:

1615 Wellorder_Extension.thy (split from Zorn.thy)

1616 Library/Cardinal_Notations.thy

1617 Library/BNF_Axomatization.thy

1618 BNF_Examples/Misc_Primcorec.thy

1619 BNF_Examples/Stream_Processor.thy

1621 Discontinued theories:

1622 BNF/BNF.thy

1623 BNF/Equiv_Relations_More.thy

1625 INCOMPATIBILITY.

1627 * New (co)datatype package:

1628 - Command 'primcorec' is fully implemented.

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

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

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

1632 (co)datatypes with Transfer.

1633 - Renamed commands:

1634 datatype_new_compat ~> datatype_compat

1635 primrec_new ~> primrec

1636 wrap_free_constructors ~> free_constructors

1637 INCOMPATIBILITY.

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

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

1640 INCOMPATIBILITY.

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

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

1643 using "prim(co)rec".

1644 INCOMPATIBILITY.

1645 - No discriminators are generated for nullary constructors by

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

1647 INCOMPATIBILITY.

1648 - No discriminators or selectors are generated by default by

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

1650 "discs_sels" option is passed.

1651 INCOMPATIBILITY.

1653 * Old datatype package:

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

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

1656 "sum.case"). INCOMPATIBILITY.

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

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

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

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

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

1663 BNF-based datatype package.

1665 Renamed constants:

1666 Option.set ~> set_option

1667 Option.map ~> map_option

1668 option_rel ~> rel_option

1670 Renamed theorems:

1671 set_def ~> set_rec[abs_def]

1672 map_def ~> map_rec[abs_def]

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

1674 option.recs ~> option.rec

1675 list_all2_def ~> list_all2_iff

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

1677 map.simps ~> list.map

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

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

1680 the.simps ~> option.sel

1682 INCOMPATIBILITY.

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

1685 sum_map ~> map_sum

1686 map_pair ~> map_prod

1687 prod_rel ~> rel_prod

1688 sum_rel ~> rel_sum

1689 fun_rel ~> rel_fun

1690 set_rel ~> rel_set

1691 filter_rel ~> rel_filter

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

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

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

1696 INCOMPATIBILITY.

1698 * Lifting and Transfer:

1699 - a type variable as a raw type is supported

1700 - stronger reflexivity prover

1701 - rep_eq is always generated by lift_definition

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

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

1704 + relator_eq, relator_mono, relator_distr, relator_domain,

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

1706 right_unique, right_total, left_unique, left_total are proved

1707 automatically

1708 + definition of a predicator is generated automatically

1709 + simplification rules for a predicator definition are proved

1710 automatically for datatypes

1711 - consolidation of the setup of Lifting/Transfer

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

1713 more

1714 Minor INCOMPATIBILITY.

1715 + left_total and left_unique rules are now transfer rules

1716 (reflexivity_rule attribute not needed anymore)

1717 INCOMPATIBILITY.

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

1719 relator_domain theorems (=> more natural statement)

1720 INCOMPATIBILITY.

1721 - registration of code equations is more robust

1722 Potential INCOMPATIBILITY.

1723 - respectfulness proof obligation is preprocessed to a more readable

1724 form

1725 Potential INCOMPATIBILITY.

1726 - eq_onp is always unfolded in respectfulness proof obligation

1727 Potential INCOMPATIBILITY.

1728 - unregister lifting setup for Code_Numeral.integer and

1729 Code_Numeral.natural

1730 Potential INCOMPATIBILITY.

1731 - Lifting.invariant -> eq_onp

1732 INCOMPATIBILITY.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1751 Plugin Options / Isabelle / General.

1753 * Sledgehammer:

1754 - Z3 can now produce Isar proofs.

1755 - MaSh overhaul:

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

1757 Python and increase performance and reliability.

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

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

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

1761 Options / Isabelle / General to "none".

1762 - New option:

1763 smt_proofs

1764 - Renamed options:

1765 isar_compress ~> compress

1766 isar_try0 ~> try0

1768 INCOMPATIBILITY.

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

1772 * Nitpick:

1773 - Fixed soundness bug whereby mutually recursive datatypes could

1774 take infinite values.

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

1776 "Abs_Integ" and "Rep_Integ".

1777 - Removed "std" option.

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

1779 "hide_types".

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

1782 (full_types)' instead. INCOMPATIBILITY.

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

1786 * Adjustion of INF and SUP operations:

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

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

1789 SUP instead uniformly.

1790 - More aggressive normalization of expressions involving INF and Inf

1791 or SUP and Sup.

1792 - INF_image and SUP_image do not unfold composition.

1793 - Dropped facts INF_comp, SUP_comp.

1794 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

1795 simplifier implication in premises. Generalize and replace former

1796 INT_cong, SUP_cong

1798 INCOMPATIBILITY.

1800 * SUP and INF generalized to conditionally_complete_lattice.

1802 * Swapped orientation of facts image_comp and vimage_comp:

1804 image_compose ~> image_comp [symmetric]

1805 image_comp ~> image_comp [symmetric]

1806 vimage_compose ~> vimage_comp [symmetric]

1807 vimage_comp ~> vimage_comp [symmetric]

1809 INCOMPATIBILITY.

1811 * Theory reorganization: split of Big_Operators.thy into

1812 Groups_Big.thy and Lattices_Big.thy.

1814 * Consolidated some facts about big group operators:

1816 setsum_0' ~> setsum.neutral

1817 setsum_0 ~> setsum.neutral_const

1818 setsum_addf ~> setsum.distrib

1819 setsum_cartesian_product ~> setsum.cartesian_product

1820 setsum_cases ~> setsum.If_cases

1821 setsum_commute ~> setsum.commute

1822 setsum_cong ~> setsum.cong

1823 setsum_delta ~> setsum.delta

1824 setsum_delta' ~> setsum.delta'

1825 setsum_diff1' ~> setsum.remove

1826 setsum_empty ~> setsum.empty

1827 setsum_infinite ~> setsum.infinite

1828 setsum_insert ~> setsum.insert

1829 setsum_inter_restrict'' ~> setsum.inter_filter

1830 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

1831 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

1832 setsum_mono_zero_left ~> setsum.mono_neutral_left

1833 setsum_mono_zero_right ~> setsum.mono_neutral_right

1834 setsum_reindex ~> setsum.reindex

1835 setsum_reindex_cong ~> setsum.reindex_cong

1836 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

1837 setsum_restrict_set ~> setsum.inter_restrict

1838 setsum_Plus ~> setsum.Plus

1839 setsum_setsum_restrict ~> setsum.commute_restrict

1840 setsum_Sigma ~> setsum.Sigma

1841 setsum_subset_diff ~> setsum.subset_diff

1842 setsum_Un_disjoint ~> setsum.union_disjoint

1843 setsum_UN_disjoint ~> setsum.UNION_disjoint

1844 setsum_Un_Int ~> setsum.union_inter

1845 setsum_Union_disjoint ~> setsum.Union_disjoint

1846 setsum_UNION_zero ~> setsum.Union_comp

1847 setsum_Un_zero ~> setsum.union_inter_neutral

1848 strong_setprod_cong ~> setprod.strong_cong

1849 strong_setsum_cong ~> setsum.strong_cong

1850 setprod_1' ~> setprod.neutral

1851 setprod_1 ~> setprod.neutral_const

1852 setprod_cartesian_product ~> setprod.cartesian_product

1853 setprod_cong ~> setprod.cong

1854 setprod_delta ~> setprod.delta

1855 setprod_delta' ~> setprod.delta'

1856 setprod_empty ~> setprod.empty

1857 setprod_infinite ~> setprod.infinite

1858 setprod_insert ~> setprod.insert

1859 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

1860 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

1861 setprod_mono_one_left ~> setprod.mono_neutral_left

1862 setprod_mono_one_right ~> setprod.mono_neutral_right

1863 setprod_reindex ~> setprod.reindex

1864 setprod_reindex_cong ~> setprod.reindex_cong

1865 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

1866 setprod_Sigma ~> setprod.Sigma

1867 setprod_subset_diff ~> setprod.subset_diff

1868 setprod_timesf ~> setprod.distrib

1869 setprod_Un2 ~> setprod.union_diff2

1870 setprod_Un_disjoint ~> setprod.union_disjoint

1871 setprod_UN_disjoint ~> setprod.UNION_disjoint

1872 setprod_Un_Int ~> setprod.union_inter

1873 setprod_Union_disjoint ~> setprod.Union_disjoint

1874 setprod_Un_one ~> setprod.union_inter_neutral

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

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

1878 Dropped setsum_reindex_id, setprod_reindex_id

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

1881 INCOMPATIBILITY.

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

1885 Fact consolidations:

1886 min_max.inf_assoc ~> min.assoc

1887 min_max.inf_commute ~> min.commute

1888 min_max.inf_left_commute ~> min.left_commute

1889 min_max.inf_idem ~> min.idem

1890 min_max.inf_left_idem ~> min.left_idem

1891 min_max.inf_right_idem ~> min.right_idem

1892 min_max.sup_assoc ~> max.assoc

1893 min_max.sup_commute ~> max.commute

1894 min_max.sup_left_commute ~> max.left_commute

1895 min_max.sup_idem ~> max.idem

1896 min_max.sup_left_idem ~> max.left_idem

1897 min_max.sup_inf_distrib1 ~> max_min_distrib2

1898 min_max.sup_inf_distrib2 ~> max_min_distrib1

1899 min_max.inf_sup_distrib1 ~> min_max_distrib2

1900 min_max.inf_sup_distrib2 ~> min_max_distrib1

1901 min_max.distrib ~> min_max_distribs

1902 min_max.inf_absorb1 ~> min.absorb1

1903 min_max.inf_absorb2 ~> min.absorb2

1904 min_max.sup_absorb1 ~> max.absorb1

1905 min_max.sup_absorb2 ~> max.absorb2

1906 min_max.le_iff_inf ~> min.absorb_iff1

1907 min_max.le_iff_sup ~> max.absorb_iff2

1908 min_max.inf_le1 ~> min.cobounded1

1909 min_max.inf_le2 ~> min.cobounded2

1910 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

1911 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

1912 min_max.le_infI1 ~> min.coboundedI1

1913 min_max.le_infI2 ~> min.coboundedI2

1914 min_max.le_supI1 ~> max.coboundedI1

1915 min_max.le_supI2 ~> max.coboundedI2

1916 min_max.less_infI1 ~> min.strict_coboundedI1

1917 min_max.less_infI2 ~> min.strict_coboundedI2

1918 min_max.less_supI1 ~> max.strict_coboundedI1

1919 min_max.less_supI2 ~> max.strict_coboundedI2

1920 min_max.inf_mono ~> min.mono

1921 min_max.sup_mono ~> max.mono

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

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

1924 min_max.le_inf_iff ~> min.bounded_iff

1925 min_max.le_sup_iff ~> max.bounded_iff

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

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

1929 max.left_commute, max.left_idem directly.

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

1932 min.cobounded2, max.cobounded1m max.cobounded2 directly.

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

1936 INCOMPATIBILITY.

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

1939 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

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

1942 INCOMPATIBILITY.

1944 * Fact generalization and consolidation:

1945 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

1947 INCOMPATIBILITY.

1949 * Purely algebraic definition of even. Fact generalization and

1950 consolidation:

1951 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

1952 even_zero_(nat|int) ~> even_zero

1954 INCOMPATIBILITY.

1956 * Abolished neg_numeral.

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

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

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

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

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

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

1963 - Syntax for negative numerals is mere input syntax.

1965 INCOMPATIBILITY.

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

1969 add_assoc ~> add.assoc

1970 add_commute ~> add.commute

1971 add_left_commute ~> add.left_commute

1972 mult_assoc ~> mult.assoc

1973 mult_commute ~> mult.commute

1974 mult_left_commute ~> mult.left_commute

1975 nat_add_assoc ~> add.assoc

1976 nat_add_commute ~> add.commute

1977 nat_add_left_commute ~> add.left_commute

1978 nat_mult_assoc ~> mult.assoc

1979 nat_mult_commute ~> mult.commute

1980 eq_assoc ~> iff_assoc

1981 eq_left_commute ~> iff_left_commute

1983 INCOMPATIBILITY.

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

1986 Prefer ac_simps instead, or specify rules

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

1989 * Elimination of fact duplicates:

1990 equals_zero_I ~> minus_unique

1991 diff_eq_0_iff_eq ~> right_minus_eq

1992 nat_infinite ~> infinite_UNIV_nat

1993 int_infinite ~> infinite_UNIV_int

1995 INCOMPATIBILITY.

1997 * Fact name consolidation:

1998 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

1999 minus_le_self_iff ~> neg_less_eq_nonneg

2000 le_minus_self_iff ~> less_eq_neg_nonpos

2001 neg_less_nonneg ~> neg_less_pos

2002 less_minus_self_iff ~> less_neg_neg [simp]

2004 INCOMPATIBILITY.

2006 * More simplification rules on unary and binary minus:

2007 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

2008 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

2009 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

2010 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

2011 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

2012 been taken away from fact collections algebra_simps and field_simps.

2013 INCOMPATIBILITY.

2015 To restore proofs, the following patterns are helpful:

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

2018 Consider simplification with algebra_simps or field_simps.

2020 b) Lifting rules from addition to subtraction:

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

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

2024 Consider simplification with algebra_simps or field_simps;

2025 or the brute way with

2026 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

2028 * Introduce bdd_above and bdd_below in theory

2029 Conditionally_Complete_Lattices, use them instead of explicitly

2030 stating boundedness of sets.

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

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

2034 additional case in fixpoint induction proofs. INCOMPATIBILITY.

2036 * Removed and renamed theorems in Series:

2037 summable_le ~> suminf_le

2038 suminf_le ~> suminf_le_const

2039 series_pos_le ~> setsum_le_suminf

2040 series_pos_less ~> setsum_less_suminf

2041 suminf_ge_zero ~> suminf_nonneg

2042 suminf_gt_zero ~> suminf_pos

2043 suminf_gt_zero_iff ~> suminf_pos_iff

2044 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

2045 suminf_0_le ~> suminf_nonneg [rotate]

2046 pos_summable ~> summableI_nonneg_bounded

2047 ratio_test ~> summable_ratio_test

2049 removed series_zero, replaced by sums_finite

2051 removed auxiliary lemmas:

2053 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

2054 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

2055 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

2056 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

2057 summable_convergent_sumr_iff, sumr_diff_mult_const

2059 INCOMPATIBILITY.

2061 * Replace (F)DERIV syntax by has_derivative:

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

2064 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

2066 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

2068 - removed constant isDiff

2070 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

2071 input syntax.

2073 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

2075 - Renamed FDERIV_... lemmas to has_derivative_...

2077 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

2079 - removed DERIV_intros, has_derivative_eq_intros

2081 - introduced derivative_intros and deriative_eq_intros which

2082 includes now rules for DERIV, has_derivative and

2083 has_vector_derivative.

2085 - Other renamings:

2086 differentiable_def ~> real_differentiable_def

2087 differentiableE ~> real_differentiableE

2088 fderiv_def ~> has_derivative_at

2089 field_fderiv_def ~> field_has_derivative_at

2090 isDiff_der ~> differentiable_def

2091 deriv_fderiv ~> has_field_derivative_def

2092 deriv_def ~> DERIV_def

2094 INCOMPATIBILITY.

2096 * Include more theorems in continuous_intros. Remove the

2097 continuous_on_intros, isCont_intros collections, these facts are now

2098 in continuous_intros.

2100 * Theorems about complex numbers are now stated only using Re and Im,

2101 the Complex constructor is not used anymore. It is possible to use

2102 primcorec to defined the behaviour of a complex-valued function.

2104 Removed theorems about the Complex constructor from the simpset, they

2105 are available as the lemma collection legacy_Complex_simps. This

2106 especially removes

2108 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

2110 Instead the reverse direction is supported with

2111 Complex_eq: "Complex a b = a + \<i> * b"

2113 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

2115 Renamings:

2116 Re/Im ~> complex.sel

2117 complex_Re/Im_zero ~> zero_complex.sel

2118 complex_Re/Im_add ~> plus_complex.sel

2119 complex_Re/Im_minus ~> uminus_complex.sel

2120 complex_Re/Im_diff ~> minus_complex.sel

2121 complex_Re/Im_one ~> one_complex.sel

2122 complex_Re/Im_mult ~> times_complex.sel

2123 complex_Re/Im_inverse ~> inverse_complex.sel

2124 complex_Re/Im_scaleR ~> scaleR_complex.sel

2125 complex_Re/Im_i ~> ii.sel

2126 complex_Re/Im_cnj ~> cnj.sel

2127 Re/Im_cis ~> cis.sel

2129 complex_divide_def ~> divide_complex_def

2130 complex_norm_def ~> norm_complex_def

2131 cmod_def ~> norm_complex_de

2133 Removed theorems:

2134 complex_zero_def

2135 complex_add_def

2136 complex_minus_def

2137 complex_diff_def

2138 complex_one_def

2139 complex_mult_def

2140 complex_inverse_def

2141 complex_scaleR_def

2143 INCOMPATIBILITY.

2145 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

2146 Conditionally_Complete_Lattices. INCOMPATIBILITY.

2148 * HOL-Library: new theory src/HOL/Library/Tree.thy.

2150 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

2151 is subsumed by session Kleene_Algebra in AFP.

2153 * HOL-Library / theory RBT: various constants and facts are hidden;

2154 lifting setup is unregistered. INCOMPATIBILITY.

2156 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

2158 * HOL-Word: bit representations prefer type bool over type bit.

2159 INCOMPATIBILITY.

2161 * HOL-Word:

2162 - Abandoned fact collection "word_arith_alts", which is a duplicate

2163 of "word_arith_wis".

2164 - Dropped first (duplicated) element in fact collections

2165 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

2166 "uint_word_arith_bintrs".

2168 * HOL-Number_Theory:

2169 - consolidated the proofs of the binomial theorem

2170 - the function fib is again of type nat => nat and not overloaded

2171 - no more references to Old_Number_Theory in the HOL libraries

2172 (except the AFP)

2174 INCOMPATIBILITY.

2176 * HOL-Multivariate_Analysis:

2177 - Type class ordered_real_vector for ordered vector spaces.

2178 - New theory Complex_Basic_Analysis defining complex derivatives,

2179 holomorphic functions, etc., ported from HOL Light's canal.ml.

2180 - Changed order of ordered_euclidean_space to be compatible with

2181 pointwise ordering on products. Therefore instance of

2182 conditionally_complete_lattice and ordered_real_vector.

2183 INCOMPATIBILITY: use box instead of greaterThanLessThan or

2184 explicit set-comprehensions with eucl_less for other (half-)open

2185 intervals.

2186 - removed dependencies on type class ordered_euclidean_space with

2187 introduction of "cbox" on euclidean_space

2188 - renamed theorems:

2189 interval ~> box

2190 mem_interval ~> mem_box

2191 interval_eq_empty ~> box_eq_empty

2192 interval_ne_empty ~> box_ne_empty

2193 interval_sing(1) ~> cbox_sing

2194 interval_sing(2) ~> box_sing

2195 subset_interval_imp ~> subset_box_imp

2196 subset_interval ~> subset_box

2197 open_interval ~> open_box

2198 closed_interval ~> closed_cbox

2199 interior_closed_interval ~> interior_cbox

2200 bounded_closed_interval ~> bounded_cbox

2201 compact_interval ~> compact_cbox

2202 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

2203 bounded_subset_closed_interval ~> bounded_subset_cbox

2204 mem_interval_componentwiseI ~> mem_box_componentwiseI

2205 convex_box ~> convex_prod

2206 rel_interior_real_interval ~> rel_interior_real_box

2207 convex_interval ~> convex_box

2208 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

2209 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

2210 content_closed_interval' ~> content_cbox'

2211 elementary_subset_interval ~> elementary_subset_box

2212 diameter_closed_interval ~> diameter_cbox

2213 frontier_closed_interval ~> frontier_cbox

2214 frontier_open_interval ~> frontier_box

2215 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

2216 closure_open_interval ~> closure_box

2217 open_closed_interval_convex ~> open_cbox_convex

2218 open_interval_midpoint ~> box_midpoint

2219 content_image_affinity_interval ~> content_image_affinity_cbox

2220 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

2221 bounded_interval ~> bounded_closed_interval + bounded_boxes

2223 - respective theorems for intervals over the reals:

2224 content_closed_interval + content_cbox

2225 has_integral + has_integral_real

2226 fine_division_exists + fine_division_exists_real

2227 has_integral_null + has_integral_null_real

2228 tagged_division_union_interval + tagged_division_union_interval_real

2229 has_integral_const + has_integral_const_real

2230 integral_const + integral_const_real

2231 has_integral_bound + has_integral_bound_real

2232 integrable_continuous + integrable_continuous_real

2233 integrable_subinterval + integrable_subinterval_real

2234 has_integral_reflect_lemma + has_integral_reflect_lemma_real

2235 integrable_reflect + integrable_reflect_real

2236 integral_reflect + integral_reflect_real

2237 image_affinity_interval + image_affinity_cbox

2238 image_smult_interval + image_smult_cbox

2239 integrable_const + integrable_const_ivl

2240 integrable_on_subinterval + integrable_on_subcbox

2242 - renamed theorems:

2243 derivative_linear ~> has_derivative_bounded_linear

2244 derivative_is_linear ~> has_derivative_linear

2245 bounded_linear_imp_linear ~> bounded_linear.linear

2247 * HOL-Probability:

2248 - Renamed positive_integral to nn_integral:

2250 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

2251 positive_integral_positive ~> nn_integral_nonneg

2253 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

2255 - replaced the Lebesgue integral on real numbers by the more general

2256 Bochner integral for functions into a real-normed vector space.

2258 integral_zero ~> integral_zero / integrable_zero

2259 integral_minus ~> integral_minus / integrable_minus

2260 integral_add ~> integral_add / integrable_add

2261 integral_diff ~> integral_diff / integrable_diff

2262 integral_setsum ~> integral_setsum / integrable_setsum

2263 integral_multc ~> integral_mult_left / integrable_mult_left

2264 integral_cmult ~> integral_mult_right / integrable_mult_right

2265 integral_triangle_inequality~> integral_norm_bound

2266 integrable_nonneg ~> integrableI_nonneg

2267 integral_positive ~> integral_nonneg_AE

2268 integrable_abs_iff ~> integrable_abs_cancel

2269 positive_integral_lim_INF ~> nn_integral_liminf

2270 lebesgue_real_affine ~> lborel_real_affine

2271 borel_integral_has_integral ~> has_integral_lebesgue_integral

2272 integral_indicator ~>

2273 integral_real_indicator / integrable_real_indicator

2274 positive_integral_fst ~> nn_integral_fst'

2275 positive_integral_fst_measurable ~> nn_integral_fst

2276 positive_integral_snd_measurable ~> nn_integral_snd

2278 integrable_fst_measurable ~>

2279 integral_fst / integrable_fst / AE_integrable_fst

2281 integrable_snd_measurable ~>

2282 integral_snd / integrable_snd / AE_integrable_snd

2284 integral_monotone_convergence ~>

2285 integral_monotone_convergence / integrable_monotone_convergence

2287 integral_monotone_convergence_at_top ~>

2288 integral_monotone_convergence_at_top /

2289 integrable_monotone_convergence_at_top

2291 has_integral_iff_positive_integral_lebesgue ~>

2292 has_integral_iff_has_bochner_integral_lebesgue_nonneg

2294 lebesgue_integral_has_integral ~>

2295 has_integral_integrable_lebesgue_nonneg

2297 positive_integral_lebesgue_has_integral ~>

2298 integral_has_integral_lebesgue_nonneg /

2299 integrable_has_integral_lebesgue_nonneg

2301 lebesgue_integral_real_affine ~>

2302 nn_integral_real_affine

2304 has_integral_iff_positive_integral_lborel ~>

2305 integral_has_integral_nonneg / integrable_has_integral_nonneg

2307 The following theorems where removed:

2309 lebesgue_integral_nonneg

2310 lebesgue_integral_uminus

2311 lebesgue_integral_cmult

2312 lebesgue_integral_multc

2313 lebesgue_integral_cmult_nonneg

2314 integral_cmul_indicator

2315 integral_real

2317 - Formalized properties about exponentially, Erlang, and normal

2318 distributed random variables.

2320 * HOL-Decision_Procs: Separate command 'approximate' for approximative

2321 computation in src/HOL/Decision_Procs/Approximation. Minor

2322 INCOMPATIBILITY.

2325 *** Scala ***

2327 * The signature and semantics of Document.Snapshot.cumulate_markup /

2328 select_markup have been clarified. Markup is now traversed in the

2329 order of reports given by the prover: later markup is usually more

2330 specific and may override results accumulated so far. The elements

2331 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

2333 * Substantial reworking of internal PIDE protocol communication

2334 channels. INCOMPATIBILITY.

2337 *** ML ***

2339 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

2340 compared (according to Thm.thm_ord), but assumed to be covered by the

2341 current background theory. Thus equivalent data produced in different

2342 branches of the theory graph usually coincides (e.g. relevant for

2343 theory merge). Note that the softer Thm.eq_thm_prop is often more

2344 appropriate than Thm.eq_thm.

2346 * Proper context for basic Simplifier operations: rewrite_rule,

2347 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

2348 pass runtime Proof.context (and ensure that the simplified entity

2349 actually belongs to it).

2351 * Proper context discipline for read_instantiate and instantiate_tac:

2352 variables that are meant to become schematic need to be given as

2353 fixed, and are generalized by the explicit context of local variables.

2354 This corresponds to Isar attributes "where" and "of" with 'for'

2355 declaration. INCOMPATIBILITY, also due to potential change of indices

2356 of schematic variables.

2358 * Moved ML_Compiler.exn_trace and other operations on exceptions to

2359 structure Runtime. Minor INCOMPATIBILITY.

2361 * Discontinued old Toplevel.debug in favour of system option

2362 "ML_exception_trace", which may be also declared within the context

2363 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

2365 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

2366 INCOMPATIBILITY.

2368 * Configuration option "ML_print_depth" controls the pretty-printing

2369 depth of the ML compiler within the context. The old print_depth in

2370 ML is still available as default_print_depth, but rarely used. Minor

2371 INCOMPATIBILITY.

2373 * Toplevel function "use" refers to raw ML bootstrap environment,

2374 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

2375 Note that 'ML_file' is the canonical command to load ML files into the

2376 formal context.

2378 * Simplified programming interface to define ML antiquotations, see

2379 structure ML_Antiquotation. Minor INCOMPATIBILITY.

2381 * ML antiquotation @{here} refers to its source position, which is

2382 occasionally useful for experimentation and diagnostic purposes.

2384 * ML antiquotation @{path} produces a Path.T value, similarly to

2385 Path.explode, but with compile-time check against the file-system and

2386 some PIDE markup. Note that unlike theory source, ML does not have a

2387 well-defined master directory, so an absolute symbolic path

2388 specification is usually required, e.g. "~~/src/HOL".

2390 * ML antiquotation @{print} inlines a function to print an arbitrary

2391 ML value, which is occasionally useful for diagnostic or demonstration

2392 purposes.

2395 *** System ***

2397 * Proof General with its traditional helper scripts is now an optional

2398 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

2399 component repository http://isabelle.in.tum.de/components/. Note that

2400 the "system" manual provides general explanations about add-on

2401 components, especially those that are not bundled with the release.

2403 * The raw Isabelle process executable has been renamed from

2404 "isabelle-process" to "isabelle_process", which conforms to common

2405 shell naming conventions, and allows to define a shell function within

2406 the Isabelle environment to avoid dynamic path lookup. Rare

2407 incompatibility for old tools that do not use the ISABELLE_PROCESS

2408 settings variable.

2410 * Former "isabelle tty" has been superseded by "isabelle console",

2411 with implicit build like "isabelle jedit", and without the mostly

2412 obsolete Isar TTY loop.

2414 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

2415 and PDF_VIEWER now refer to the actual programs, not shell

2416 command-lines. Discontinued option -c: invocation may be asynchronous

2417 via desktop environment, without any special precautions. Potential

2418 INCOMPATIBILITY with ambitious private settings.

2420 * Removed obsolete "isabelle unsymbolize". Note that the usual format

2421 for email communication is the Unicode rendering of Isabelle symbols,

2422 as produced by Isabelle/jEdit, for example.

2424 * Removed obsolete tool "wwwfind". Similar functionality may be

2425 integrated into Isabelle/jEdit eventually.

2427 * Improved 'display_drafts' concerning desktop integration and

2428 repeated invocation in PIDE front-end: re-use single file

2429 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

2431 * Session ROOT specifications require explicit 'document_files' for

2432 robust dependencies on LaTeX sources. Only these explicitly given

2433 files are copied to the document output directory, before document

2434 processing is started.

2436 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

2437 of TeX Live from Cygwin.

2441 New in Isabelle2013-2 (December 2013)

2442 -------------------------------------

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

2446 * More robust editing of running commands with internal forks,

2447 e.g. non-terminating 'by' steps.

2449 * More relaxed Sledgehammer panel: avoid repeated application of query

2450 after edits surrounding the command location.

2452 * More status information about commands that are interrupted

2453 accidentally (via physical event or Poly/ML runtime system signal,

2454 e.g. out-of-memory).

2457 *** System ***

2459 * More robust termination of external processes managed by

2460 Isabelle/ML: support cancellation of tasks within the range of

2461 milliseconds, as required for PIDE document editing with automatically

2462 tried tools (e.g. Sledgehammer).

2464 * Reactivated Isabelle/Scala kill command for external processes on

2465 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

2466 workaround for some Debian/Ubuntu Linux versions from 2013.

2470 New in Isabelle2013-1 (November 2013)

2471 -------------------------------------

2473 *** General ***

2475 * Discontinued obsolete 'uses' within theory header. Note that

2476 commands like 'ML_file' work without separate declaration of file

2477 dependencies. Minor INCOMPATIBILITY.

2479 * Discontinued redundant 'use' command, which was superseded by

2480 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

2482 * Simplified subscripts within identifiers, using plain \<^sub>

2483 instead of the second copy \<^isub> and \<^isup>. Superscripts are

2484 only for literal tokens within notation; explicit mixfix annotations

2485 for consts or fixed variables may be used as fall-back for unusual

2486 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

2487 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

2488 standardize symbols as a starting point for further manual cleanup.

2489 The ML reference variable "legacy_isub_isup" may be set as temporary

2490 workaround, to make the prover accept a subset of the old identifier

2491 syntax.

2493 * Document antiquotations: term style "isub" has been renamed to

2494 "sub". Minor INCOMPATIBILITY.

2496 * Uniform management of "quick_and_dirty" as system option (see also

2497 "isabelle options"), configuration option within the context (see also

2498 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

2499 INCOMPATIBILITY, need to use more official Isabelle means to access

2500 quick_and_dirty, instead of historical poking into mutable reference.

2502 * Renamed command 'print_configs' to 'print_options'. Minor

2503 INCOMPATIBILITY.

2505 * Proper diagnostic command 'print_state'. Old 'pr' (with its

2506 implicit change of some global references) is retained for now as

2507 control command, e.g. for ProofGeneral 3.7.x.

2509 * Discontinued 'print_drafts' command with its old-fashioned PS output

2510 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

2511 'display_drafts' instead and print via the regular document viewer.

2513 * Updated and extended "isar-ref" and "implementation" manual,

2514 eliminated old "ref" manual.

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

2519 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

2520 Documentation panel.

2522 * Dockable window "Documentation" provides access to Isabelle

2523 documentation.

2525 * Dockable window "Find" provides query operations for formal entities

2526 (GUI front-end to 'find_theorems' command).

2528 * Dockable window "Sledgehammer" manages asynchronous / parallel

2529 sledgehammer runs over existing document sources, independently of

2530 normal editing and checking process.

2532 * Dockable window "Timing" provides an overview of relevant command

2533 timing information, depending on option jedit_timing_threshold. The

2534 same timing information is shown in the extended tooltip of the

2535 command keyword, when hovering the mouse over it while the CONTROL or

2536 COMMAND modifier is pressed.

2538 * Improved dockable window "Theories": Continuous checking of proof

2539 document (visible and required parts) may be controlled explicitly,

2540 using check box or shortcut "C+e ENTER". Individual theory nodes may

2541 be marked explicitly as required and checked in full, using check box

2542 or shortcut "C+e SPACE".

2544 * Improved completion mechanism, which is now managed by the

2545 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

2546 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

2548 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

2549 isabelle.complete for explicit completion in Isabelle sources.

2550 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

2551 to resolve conflict.

2553 * Improved support of various "minor modes" for Isabelle NEWS,

2554 options, session ROOT etc., with completion and SideKick tree view.

2556 * Strictly monotonic document update, without premature cancellation of

2557 running transactions that are still needed: avoid reset/restart of

2558 such command executions while editing.

2560 * Support for asynchronous print functions, as overlay to existing

2561 document content.

2563 * Support for automatic tools in HOL, which try to prove or disprove

2564 toplevel theorem statements.

2566 * Action isabelle.reset-font-size resets main text area font size

2567 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

2568 also "Plugin Options / Isabelle / General"). It can be bound to some

2569 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

2571 * File specifications in jEdit (e.g. file browser) may refer to

2572 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

2573 obsolete $ISABELLE_HOME_WINDOWS variable.

2575 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

2576 / Global Options / Appearance".

2578 * Improved support of native Mac OS X functionality via "MacOSX"

2579 plugin, which is now enabled by default.

2582 *** Pure ***

2584 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

2585 In particular, 'interpretation' allows for non-persistent

2586 interpretation within "context ... begin ... end" blocks offering a

2587 light-weight alternative to 'sublocale'. See "isar-ref" manual for

2588 details.

2590 * Improved locales diagnostic command 'print_dependencies'.

2592 * Discontinued obsolete 'axioms' command, which has been marked as

2593 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

2594 instead, while observing its uniform scope for polymorphism.

2596 * Discontinued empty name bindings in 'axiomatization'.

2597 INCOMPATIBILITY.

2599 * System option "proofs" has been discontinued. Instead the global

2600 state of Proofterm.proofs is persistently compiled into logic images

2601 as required, notably HOL-Proofs. Users no longer need to change

2602 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

2604 * Syntax translation functions (print_translation etc.) always depend

2605 on Proof.context. Discontinued former "(advanced)" option -- this is

2606 now the default. Minor INCOMPATIBILITY.

2608 * Former global reference trace_unify_fail is now available as

2609 configuration option "unify_trace_failure" (global context only).

2611 * SELECT_GOAL now retains the syntactic context of the overall goal

2612 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

2613 situations.

2616 *** HOL ***

2618 * Stronger precedence of syntax for big intersection and union on

2619 sets, in accordance with corresponding lattice operations.

2620 INCOMPATIBILITY.

2622 * Notation "{p:A. P}" now allows tuple patterns as well.

2624 * Nested case expressions are now translated in a separate check phase

2625 rather than during parsing. The data for case combinators is separated

2626 from the datatype package. The declaration attribute

2627 "case_translation" can be used to register new case combinators:

2629 declare [[case_translation case_combinator constructor1 ... constructorN]]

2631 * Code generator:

2632 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

2633 'code_instance'.

2634 - 'code_identifier' declares name hints for arbitrary identifiers in

2635 generated code, subsuming 'code_modulename'.

2637 See the isar-ref manual for syntax diagrams, and the HOL theories for

2638 examples.

2640 * Attibute 'code': 'code' now declares concrete and abstract code

2641 equations uniformly. Use explicit 'code equation' and 'code abstract'

2642 to distinguish both when desired.

2644 * Discontinued theories Code_Integer and Efficient_Nat by a more

2645 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

2646 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

2647 generation for details. INCOMPATIBILITY.

2649 * Numeric types are mapped by default to target language numerals:

2650 natural (replaces former code_numeral) and integer (replaces former

2651 code_int). Conversions are available as integer_of_natural /

2652 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

2653 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

2654 ML). INCOMPATIBILITY.

2656 * Function package: For mutually recursive functions f and g, separate

2657 cases rules f.cases and g.cases are generated instead of unusable

2658 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

2659 in the case that the unusable rule was used nevertheless.

2661 * Function package: For each function f, new rules f.elims are

2662 generated, which eliminate equalities of the form "f x = t".

2664 * New command 'fun_cases' derives ad-hoc elimination rules for

2665 function equations as simplified instances of f.elims, analogous to

2666 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

2668 * Lifting:

2669 - parametrized correspondence relations are now supported:

2670 + parametricity theorems for the raw term can be specified in

2671 the command lift_definition, which allow us to generate stronger

2672 transfer rules

2673 + setup_lifting generates stronger transfer rules if parametric

2674 correspondence relation can be generated

2675 + various new properties of the relator must be specified to support

2676 parametricity

2677 + parametricity theorem for the Quotient relation can be specified

2678 - setup_lifting generates domain rules for the Transfer package

2679 - stronger reflexivity prover of respectfulness theorems for type

2680 copies

2681 - ===> and --> are now local. The symbols can be introduced

2682 by interpreting the locale lifting_syntax (typically in an

2683 anonymous context)

2684 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

2685 Main. Potential INCOMPATIBILITY

2686 - new commands for restoring and deleting Lifting/Transfer context:

2687 lifting_forget, lifting_update

2688 - the command print_quotmaps was renamed to print_quot_maps.

2689 INCOMPATIBILITY

2691 * Transfer:

2692 - better support for domains in Transfer: replace Domainp T

2693 by the actual invariant in a transferred goal

2694 - transfer rules can have as assumptions other transfer rules

2695 - Experimental support for transferring from the raw level to the

2696 abstract level: Transfer.transferred attribute

2697 - Attribute version of the transfer method: untransferred attribute

2699 * Reification and reflection:

2700 - Reification is now directly available in HOL-Main in structure

2701 "Reification".

2702 - Reflection now handles multiple lists with variables also.

2703 - The whole reflection stack has been decomposed into conversions.

2704 INCOMPATIBILITY.

2706 * Revised devices for recursive definitions over finite sets:

2707 - Only one fundamental fold combinator on finite set remains:

2708 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

2709 This is now identity on infinite sets.

2710 - Locales ("mini packages") for fundamental definitions with

2711 Finite_Set.fold: folding, folding_idem.

2712 - Locales comm_monoid_set, semilattice_order_set and

2713 semilattice_neutr_order_set for big operators on sets.

2714 See theory Big_Operators for canonical examples.

2715 Note that foundational constants comm_monoid_set.F and

2716 semilattice_set.F correspond to former combinators fold_image

2717 and fold1 respectively. These are now gone. You may use

2718 those foundational constants as substitutes, but it is

2719 preferable to interpret the above locales accordingly.

2720 - Dropped class ab_semigroup_idem_mult (special case of lattice,

2721 no longer needed in connection with Finite_Set.fold etc.)

2722 - Fact renames:

2723 card.union_inter ~> card_Un_Int [symmetric]

2724 card.union_disjoint ~> card_Un_disjoint

2725 INCOMPATIBILITY.

2727 * Locale hierarchy for abstract orderings and (semi)lattices.

2729 * Complete_Partial_Order.admissible is defined outside the type class

2730 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

2731 class predicate assumption or sort constraint when possible.

2732 INCOMPATIBILITY.

2734 * Introduce type class "conditionally_complete_lattice": Like a

2735 complete lattice but does not assume the existence of the top and

2736 bottom elements. Allows to generalize some lemmas about reals and

2737 extended reals. Removed SupInf and replaced it by the instantiation

2738 of conditionally_complete_lattice for real. Renamed lemmas about

2739 conditionally-complete lattice from Sup_... to cSup_... and from

2740 Inf_... to cInf_... to avoid hidding of similar complete lattice

2741 lemmas.

2743 * Introduce type class linear_continuum as combination of

2744 conditionally-complete lattices and inner dense linorders which have

2745 more than one element. INCOMPATIBILITY.

2747 * Introduced type classes order_top and order_bot. The old classes top

2748 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

2749 Rename bot -> order_bot, top -> order_top

2751 * Introduce type classes "no_top" and "no_bot" for orderings without

2752 top and bottom elements.

2754 * Split dense_linorder into inner_dense_order and no_top, no_bot.

2756 * Complex_Main: Unify and move various concepts from

2757 HOL-Multivariate_Analysis to HOL-Complex_Main.

2759 - Introduce type class (lin)order_topology and

2760 linear_continuum_topology. Allows to generalize theorems about

2761 limits and order. Instances are reals and extended reals.

2763 - continuous and continuos_on from Multivariate_Analysis:

2764 "continuous" is the continuity of a function at a filter. "isCont"

2765 is now an abbrevitation: "isCont x f == continuous (at _) f".

2767 Generalized continuity lemmas from isCont to continuous on an

2768 arbitrary filter.

2770 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

2771 compactness of closed intervals on reals. Continuous functions

2772 attain infimum and supremum on compact sets. The inverse of a

2773 continuous function is continuous, when the function is continuous

2774 on a compact set.

2776 - connected from Multivariate_Analysis. Use it to prove the

2777 intermediate value theorem. Show connectedness of intervals on

2778 linear_continuum_topology).

2780 - first_countable_topology from Multivariate_Analysis. Is used to

2781 show equivalence of properties on the neighbourhood filter of x and

2782 on all sequences converging to x.

2784 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

2785 theorems from Library/FDERIV.thy to Deriv.thy and base the

2786 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

2787 which are restricted to sets, i.e. to represent derivatives from

2788 left or right.

2790 - Removed the within-filter. It is replaced by the principal filter:

2792 F within X = inf F (principal X)

2794 - Introduce "at x within U" as a single constant, "at x" is now an

2795 abbreviation for "at x within UNIV"

2797 - Introduce named theorem collections tendsto_intros,

2798 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

2799 in tendsto_intros (or FDERIV_intros) are also available as

2800 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

2801 is replaced by a congruence rule. This allows to apply them as

2802 intro rules and then proving equivalence by the simplifier.

2804 - Restructured theories in HOL-Complex_Main:

2806 + Moved RealDef and RComplete into Real

2808 + Introduced Topological_Spaces and moved theorems about

2809 topological spaces, filters, limits and continuity to it

2811 + Renamed RealVector to Real_Vector_Spaces

2813 + Split Lim, SEQ, Series into Topological_Spaces,

2814 Real_Vector_Spaces, and Limits

2816 + Moved Ln and Log to Transcendental

2818 + Moved theorems about continuity from Deriv to Topological_Spaces

2820 - Remove various auxiliary lemmas.

2822 INCOMPATIBILITY.

2824 * Nitpick:

2825 - Added option "spy".

2826 - Reduce incidence of "too high arity" errors.

2828 * Sledgehammer:

2829 - Renamed option:

2830 isar_shrink ~> isar_compress

2831 INCOMPATIBILITY.

2832 - Added options "isar_try0", "spy".

2833 - Better support for "isar_proofs".

2834 - MaSh has been fined-tuned and now runs as a local server.

2836 * Improved support for ad hoc overloading of constants (see also

2837 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

2839 * Library/Polynomial.thy:

2840 - Use lifting for primitive definitions.

2841 - Explicit conversions from and to lists of coefficients, used for

2842 generated code.

2843 - Replaced recursion operator poly_rec by fold_coeffs.

2844 - Prefer pre-existing gcd operation for gcd.

2845 - Fact renames:

2846 poly_eq_iff ~> poly_eq_poly_eq_iff

2847 poly_ext ~> poly_eqI

2848 expand_poly_eq ~> poly_eq_iff

2849 IMCOMPATIBILITY.

2851 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

2852 case_of_simps to convert function definitions between a list of

2853 equations with patterns on the lhs and a single equation with case

2854 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

2856 * New Library/FSet.thy: type of finite sets defined as a subtype of

2857 sets defined by Lifting/Transfer.

2859 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

2861 * Consolidation of library theories on product orders:

2863 Product_Lattice ~> Product_Order -- pointwise order on products

2864 Product_ord ~> Product_Lexorder -- lexicographic order on products

2866 INCOMPATIBILITY.

2868 * Imperative-HOL: The MREC combinator is considered legacy and no

2869 longer included by default. INCOMPATIBILITY, use partial_function

2870 instead, or import theory Legacy_Mrec as a fallback.

2872 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

2873 ~~/src/HOL/Algebra/poly. Existing theories should be based on

2874 ~~/src/HOL/Library/Polynomial instead. The latter provides

2875 integration with HOL's type classes for rings. INCOMPATIBILITY.

2877 * HOL-BNF:

2878 - Various improvements to BNF-based (co)datatype package, including

2879 new commands "primrec_new", "primcorec", and

2880 "datatype_new_compat", as well as documentation. See

2881 "datatypes.pdf" for details.

2882 - New "coinduction" method to avoid some boilerplate (compared to

2883 coinduct).

2884 - Renamed keywords:

2885 data ~> datatype_new

2886 codata ~> codatatype

2887 bnf_def ~> bnf

2888 - Renamed many generated theorems, including

2889 discs ~> disc

2890 map_comp' ~> map_comp

2891 map_id' ~> map_id

2892 sels ~> sel

2893 set_map' ~> set_map

2894 sets ~> set

2895 IMCOMPATIBILITY.

2898 *** ML ***

2900 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

2901 "check_property" allows to check specifications of the form "ALL x y

2902 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

2903 Examples.thy in particular.

2905 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

2906 tracing output in the command transaction context instead of physical

2907 stdout. See also Toplevel.debug, Toplevel.debugging and

2908 ML_Compiler.exn_trace.

2910 * ML type "theory" is now immutable, without any special treatment of

2911 drafts or linear updates (which could lead to "stale theory" errors in

2912 the past). Discontinued obsolete operations like Theory.copy,

2913 Theory.checkpoint, and the auxiliary type theory_ref. Minor

2914 INCOMPATIBILITY.

2916 * More uniform naming of goal functions for skipped proofs:

2918 Skip_Proof.prove ~> Goal.prove_sorry

2919 Skip_Proof.prove_global ~> Goal.prove_sorry_global

2921 Minor INCOMPATIBILITY.

2923 * Simplifier tactics and tools use proper Proof.context instead of

2924 historic type simpset. Old-style declarations like addsimps,

2925 addsimprocs etc. operate directly on Proof.context. Raw type simpset

2926 retains its use as snapshot of the main Simplifier context, using

2927 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

2928 old tools by making them depend on (ctxt : Proof.context) instead of

2929 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

2931 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

2932 operate on Proof.context instead of claset, for uniformity with addIs,

2933 addEs, addDs etc. Note that claset_of and put_claset allow to manage

2934 clasets separately from the context.

2936 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

2937 INCOMPATIBILITY, use @{context} instead.

2939 * Antiquotation @{theory_context A} is similar to @{theory A}, but

2940 presents the result as initial Proof.context.

2943 *** System ***

2945 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

2946 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

2948 * Discontinued obsolete isabelle-process options -f and -u (former

2949 administrative aliases of option -e). Minor INCOMPATIBILITY.

2951 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

2952 settings variable.

2954 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

2955 document formats: dvi.gz, ps, ps.gz -- the default document format is

2956 always pdf.

2958 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

2959 specify global resources of the JVM process run by isabelle build.

2961 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

2962 to run Isabelle/Scala source files as standalone programs.

2964 * Improved "isabelle keywords" tool (for old-style ProofGeneral

2965 keyword tables): use Isabelle/Scala operations, which inspect outer

2966 syntax without requiring to build sessions first.

2968 * Sessions may be organized via 'chapter' specifications in the ROOT

2969 file, which determines a two-level hierarchy of browser info. The old

2970 tree-like organization via implicit sub-session relation (with its

2971 tendency towards erratic fluctuation of URLs) has been discontinued.

2972 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

2973 for HTML presentation of theories.

2977 New in Isabelle2013 (February 2013)

2978 -----------------------------------

2980 *** General ***

2982 * Theorem status about oracles and unfinished/failed future proofs is

2983 no longer printed by default, since it is incompatible with

2984 incremental / parallel checking of the persistent document model. ML

2985 function Thm.peek_status may be used to inspect a snapshot of the

2986 ongoing evaluation process. Note that in batch mode --- notably

2987 isabelle build --- the system ensures that future proofs of all

2988 accessible theorems in the theory context are finished (as before).

2990 * Configuration option show_markup controls direct inlining of markup

2991 into the printed representation of formal entities --- notably type

2992 and sort constraints. This enables Prover IDE users to retrieve that

2993 information via tooltips in the output window, for example.

2995 * Command 'ML_file' evaluates ML text from a file directly within the

2996 theory, without any predeclaration via 'uses' in the theory header.

2998 * Old command 'use' command and corresponding keyword 'uses' in the

2999 theory header are legacy features and will be discontinued soon.

3000 Tools that load their additional source files may imitate the

3001 'ML_file' implementation, such that the system can take care of

3002 dependencies properly.

3004 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

3005 is called fastforce / fast_force_tac already since Isabelle2011-1.

3007 * Updated and extended "isar-ref" and "implementation" manual, reduced

3008 remaining material in old "ref" manual.

3010 * Improved support for auxiliary contexts that indicate block structure

3011 for specifications. Nesting of "context fixes ... context assumes ..."

3012 and "class ... context ...".

3014 * Attribute "consumes" allows a negative value as well, which is

3015 interpreted relatively to the total number of premises of the rule in

3016 the target context. This form of declaration is stable when exported

3017 from a nested 'context' with additional assumptions. It is the

3018 preferred form for definitional packages, notably cases/rules produced

3019 in HOL/inductive and HOL/function.

3021 * More informative error messages for Isar proof commands involving

3022 lazy enumerations (method applications etc.).

3024 * Refined 'help' command to retrieve outer syntax commands according

3025 to name patterns (with clickable results).

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

3030 * Parallel terminal proofs ('by') are enabled by default, likewise

3031 proofs that are built into packages like 'datatype', 'function'. This

3032 allows to "run ahead" checking the theory specifications on the

3033 surface, while the prover is still crunching on internal

3034 justifications. Unfinished / cancelled proofs are restarted as

3035 required to complete full proof checking eventually.

3037 * Improved output panel with tooltips, hyperlinks etc. based on the

3038 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

3039 tooltips leads to some window that supports the same recursively,

3040 which can lead to stacks of tooltips as the semantic document content

3041 is explored. ESCAPE closes the whole stack, individual windows may be

3042 closed separately, or detached to become independent jEdit dockables.

3044 * Improved support for commands that produce graph output: the text

3045 message contains a clickable area to open a new instance of the graph

3046 browser on demand.

3048 * More robust incremental parsing of outer syntax (partial comments,

3049 malformed symbols). Changing the balance of open/close quotes and

3050 comment delimiters works more conveniently with unfinished situations

3051 that frequently occur in user interaction.

3053 * More efficient painting and improved reactivity when editing large

3054 files. More scalable management of formal document content.

3056 * Smarter handling of tracing messages: prover process pauses after

3057 certain number of messages per command transaction, with some user

3058 dialog to stop or continue. This avoids swamping the front-end with

3059 potentially infinite message streams.

3061 * More plugin options and preferences, based on Isabelle/Scala. The

3062 jEdit plugin option panel provides access to some Isabelle/Scala

3063 options, including tuning parameters for editor reactivity and color

3064 schemes.

3066 * Dockable window "Symbols" provides some editing support for Isabelle

3067 symbols.

3069 * Dockable window "Monitor" shows ML runtime statistics. Note that

3070 continuous display of the chart slows down the system.

3072 * Improved editing support for control styles: subscript, superscript,

3073 bold, reset of style -- operating on single symbols or text

3074 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

3076 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

3077 adjust the main text area font size, and its derivatives for output,

3078 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

3079 need to be adapted to local keyboard layouts.

3081 * More reactive completion popup by default: use \t (TAB) instead of

3082 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

3083 also "Plugin Options / SideKick / General / Code Completion Options".

3085 * Implicit check and build dialog of the specified logic session

3086 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

3087 demand, without bundling big platform-dependent heap images in the

3088 Isabelle distribution.

3090 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

3091 from Oracle provide better multi-platform experience. This version is

3092 now bundled exclusively with Isabelle.

3095 *** Pure ***

3097 * Code generation for Haskell: restrict unqualified imports from

3098 Haskell Prelude to a small set of fundamental operations.

3100 * Command 'export_code': relative file names are interpreted

3101 relatively to master directory of current theory rather than the

3102 rather arbitrary current working directory. INCOMPATIBILITY.

3104 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

3105 use regular rule composition via "OF" / "THEN", or explicit proof

3106 structure instead. Note that Isabelle/ML provides a variety of

3107 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

3108 with some care where this is really required.

3110 * Command 'typ' supports an additional variant with explicit sort

3111 constraint, to infer and check the most general type conforming to a

3112 given sort. Example (in HOL):

3114 typ "_ * _ * bool * unit" :: finite

3116 * Command 'locale_deps' visualizes all locales and their relations as

3117 a Hasse diagram.

3120 *** HOL ***

3122 * Sledgehammer:

3124 - Added MaSh relevance filter based on machine-learning; see the

3125 Sledgehammer manual for details.

3126 - Polished Isar proofs generated with "isar_proofs" option.

3127 - Rationalized type encodings ("type_enc" option).

3128 - Renamed "kill_provers" subcommand to "kill_all".

3129 - Renamed options:

3130 isar_proof ~> isar_proofs

3131 isar_shrink_factor ~> isar_shrink

3132 max_relevant ~> max_facts

3133 relevance_thresholds ~> fact_thresholds

3135 * Quickcheck: added an optimisation for equality premises. It is

3136 switched on by default, and can be switched off by setting the

3137 configuration quickcheck_optimise_equality to false.

3139 * Quotient: only one quotient can be defined by quotient_type

3140 INCOMPATIBILITY.

3142 * Lifting:

3143 - generation of an abstraction function equation in lift_definition

3144 - quot_del attribute

3145 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

3147 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

3148 expressions.

3150 * Preprocessing of the code generator rewrites set comprehensions into

3151 pointfree expressions.

3153 * The SMT solver Z3 has now by default a restricted set of directly

3154 supported features. For the full set of features (div/mod, nonlinear

3155 arithmetic, datatypes/records) with potential proof reconstruction

3156 failures, enable the configuration option "z3_with_extensions". Minor

3157 INCOMPATIBILITY.

3159 * Simplified 'typedef' specifications: historical options for implicit

3160 set definition and alternative name have been discontinued. The

3161 former behavior of "typedef (open) t = A" is now the default, but

3162 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

3163 accordingly.

3165 * Removed constant "chars"; prefer "Enum.enum" on type "char"

3166 directly. INCOMPATIBILITY.

3168 * Moved operation product, sublists and n_lists from theory Enum to

3169 List. INCOMPATIBILITY.

3171 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

3173 * Class "comm_monoid_diff" formalises properties of bounded

3174 subtraction, with natural numbers and multisets as typical instances.

3176 * Added combinator "Option.these" with type "'a option set => 'a set".

3178 * Theory "Transitive_Closure": renamed lemmas

3180 reflcl_tranclp -> reflclp_tranclp

3181 rtranclp_reflcl -> rtranclp_reflclp

3183 INCOMPATIBILITY.

3185 * Theory "Rings": renamed lemmas (in class semiring)

3187 left_distrib ~> distrib_right

3188 right_distrib ~> distrib_left

3190 INCOMPATIBILITY.

3192 * Generalized the definition of limits:

3194 - Introduced the predicate filterlim (LIM x F. f x :> G) which

3195 expresses that when the input values x converge to F then the

3196 output f x converges to G.

3198 - Added filters for convergence to positive (at_top) and negative

3199 infinity (at_bot).

3201 - Moved infinity in the norm (at_infinity) from

3202 Multivariate_Analysis to Complex_Main.

3204 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

3205 at_top".

3207 INCOMPATIBILITY.

3209 * Theory "Library/Option_ord" provides instantiation of option type to

3210 lattice type classes.

3212 * Theory "Library/Multiset": renamed

3214 constant fold_mset ~> Multiset.fold

3215 fact fold_mset_commute ~> fold_mset_comm

3217 INCOMPATIBILITY.

3219 * Renamed theory Library/List_Prefix to Library/Sublist, with related

3220 changes as follows.

3222 - Renamed constants (and related lemmas)

3224 prefix ~> prefixeq

3225 strict_prefix ~> prefix

3227 - Replaced constant "postfix" by "suffixeq" with swapped argument

3228 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

3229 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

3230 Renamed lemmas accordingly.

3232 - Added constant "list_hembeq" for homeomorphic embedding on

3233 lists. Added abbreviation "sublisteq" for special case

3234 "list_hembeq (op =)".

3236 - Theory Library/Sublist no longer provides "order" and "bot" type

3237 class instances for the prefix order (merely corresponding locale

3238 interpretations). The type class instances are now in theory

3239 Library/Prefix_Order.

3241 - The sublist relation of theory Library/Sublist_Order is now based

3242 on "Sublist.sublisteq". Renamed lemmas accordingly:

3244 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

3245 le_list_append_mono ~> Sublist.list_hembeq_append_mono

3246 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

3247 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

3248 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

3249 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

3250 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

3251 le_list_drop_many ~> Sublist.sublisteq_drop_many

3252 le_list_filter_left ~> Sublist.sublisteq_filter_left

3253 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

3254 le_list_rev_take_iff ~> Sublist.sublisteq_append

3255 le_list_same_length ~> Sublist.sublisteq_same_length

3256 le_list_take_many_iff ~> Sublist.sublisteq_append'

3257 less_eq_list.drop ~> less_eq_list_drop

3258 less_eq_list.induct ~> less_eq_list_induct

3259 not_le_list_length ~> Sublist.not_sublisteq_length

3261 INCOMPATIBILITY.

3263 * New theory Library/Countable_Set.

3265 * Theory Library/Debug and Library/Parallel provide debugging and

3266 parallel execution for code generated towards Isabelle/ML.

3268 * Theory Library/FuncSet: Extended support for Pi and extensional and

3269 introduce the extensional dependent function space "PiE". Replaced

3270 extensional_funcset by an abbreviation, and renamed lemmas from

3271 extensional_funcset to PiE as follows:

3273 extensional_empty ~> PiE_empty

3274 extensional_funcset_empty_domain ~> PiE_empty_domain

3275 extensional_funcset_empty_range ~> PiE_empty_range

3276 extensional_funcset_arb ~> PiE_arb

3277 extensional_funcset_mem ~> PiE_mem

3278 extensional_funcset_extend_domainI ~> PiE_fun_upd

3279 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

3280 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

3281 card_extensional_funcset ~> card_PiE

3282 finite_extensional_funcset ~> finite_PiE

3284 INCOMPATIBILITY.

3286 * Theory Library/FinFun: theory of almost everywhere constant

3287 functions (supersedes the AFP entry "Code Generation for Functions as

3288 Data").

3290 * Theory Library/Phantom: generic phantom type to make a type

3291 parameter appear in a constant's type. This alternative to adding

3292 TYPE('a) as another parameter avoids unnecessary closures in generated

3293 code.

3295 * Theory Library/RBT_Impl: efficient construction of red-black trees

3296 from sorted associative lists. Merging two trees with rbt_union may

3297 return a structurally different tree than before. Potential

3298 INCOMPATIBILITY.

3300 * Theory Library/IArray: immutable arrays with code generation.

3302 * Theory Library/Finite_Lattice: theory of finite lattices.

3304 * HOL/Multivariate_Analysis: replaced

3306 "basis :: 'a::euclidean_space => nat => real"

3307 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

3309 on euclidean spaces by using the inner product "_ \<bullet> _" with

3310 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

3311 "SUM i : Basis. f i * r i".

3313 With this change the following constants are also changed or removed:

3315 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

3316 a $$ i ~> inner a i (where i : Basis)

3317 cart_base i removed

3318 \<pi>, \<pi>' removed

3320 Theorems about these constants where removed.

3322 Renamed lemmas:

3324 component_le_norm ~> Basis_le_norm

3325 euclidean_eq ~> euclidean_eq_iff

3326 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

3327 euclidean_simps ~> inner_simps

3328 independent_basis ~> independent_Basis

3329 span_basis ~> span_Basis

3330 in_span_basis ~> in_span_Basis

3331 norm_bound_component_le ~> norm_boound_Basis_le

3332 norm_bound_component_lt ~> norm_boound_Basis_lt

3333 component_le_infnorm ~> Basis_le_infnorm

3335 INCOMPATIBILITY.

3337 * HOL/Probability:

3339 - Added simproc "measurable" to automatically prove measurability.

3341 - Added induction rules for sigma sets with disjoint union

3342 (sigma_sets_induct_disjoint) and for Borel-measurable functions

3343 (borel_measurable_induct).

3345 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

3346 projective family).

3348 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

3349 AFP entry "Ordinals_and_Cardinals").

3351 * HOL/BNF: New (co)datatype package based on bounded natural functors

3352 with support for mixed, nested recursion and interesting non-free

3353 datatypes.

3355 * HOL/Finite_Set and Relation: added new set and relation operations

3356 expressed by Finite_Set.fold.

3358 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

3359 trees for the code generator.

3361 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

3362 Lifting/Transfer.

3363 possible INCOMPATIBILITY.

3365 * HOL/Set: renamed Set.project -> Set.filter

3366 INCOMPATIBILITY.

3369 *** Document preparation ***

3371 * Dropped legacy antiquotations "term_style" and "thm_style", since

3372 styles may be given as arguments to "term" and "thm" already.

3373 Discontinued legacy styles "prem1" .. "prem19".

3375 * Default LaTeX rendering for \<euro> is now based on eurosym package,

3376 instead of slightly exotic babel/greek.

3378 * Document variant NAME may use different LaTeX entry point

3379 document/root_NAME.tex if that file exists, instead of the common

3380 document/root.tex.

3382 * Simplified custom document/build script, instead of old-style

3383 document/IsaMakefile. Minor INCOMPATIBILITY.

3386 *** ML ***

3388 * The default limit for maximum number of worker threads is now 8,

3389 instead of 4, in correspondence to capabilities of contemporary

3390 hardware and Poly/ML runtime system.

3392 * Type Seq.results and related operations support embedded error

3393 messages within lazy enumerations, and thus allow to provide

3394 informative errors in the absence of any usable results.

3396 * Renamed Position.str_of to Position.here to emphasize that this is a

3397 formal device to inline positions into message text, but not

3398 necessarily printing visible text.

3401 *** System ***

3403 * Advanced support for Isabelle sessions and build management, see

3404 "system" manual for the chapter of that name, especially the "isabelle

3405 build" tool and its examples. The "isabelle mkroot" tool prepares

3406 session root directories for use with "isabelle build", similar to

3407 former "isabelle mkdir" for "isabelle usedir". Note that this affects

3408 document preparation as well. INCOMPATIBILITY, isabelle usedir /

3409 mkdir / make are rendered obsolete.

3411 * Discontinued obsolete Isabelle/build script, it is superseded by the

3412 regular isabelle build tool. For example:

3414 isabelle build -s -b HOL

3416 * Discontinued obsolete "isabelle makeall".

3418 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

3419 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

3420 provides some traditional targets that invoke "isabelle build". Note

3421 that this is inefficient! Applications of Isabelle/HOL involving

3422 "isabelle make" should be upgraded to use "isabelle build" directly.

3424 * The "isabelle options" tool prints Isabelle system options, as

3425 required for "isabelle build", for example.

3427 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

3428 Minor INCOMPATIBILITY in command-line options.

3430 * The "isabelle install" tool has now a simpler command-line. Minor

3431 INCOMPATIBILITY.

3433 * The "isabelle components" tool helps to resolve add-on components

3434 that are not bundled, or referenced from a bare-bones repository

3435 version of Isabelle.

3437 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

3438 platform family: "linux", "macos", "windows".

3440 * The ML system is configured as regular component, and no longer

3441 picked up from some surrounding directory. Potential INCOMPATIBILITY

3442 for home-made settings.

3444 * Improved ML runtime statistics (heap, threads, future tasks etc.).

3446 * Discontinued support for Poly/ML 5.2.1, which was the last version

3447 without exception positions and advanced ML compiler/toplevel

3448 configuration.

3450 * Discontinued special treatment of Proof General -- no longer guess

3451 PROOFGENERAL_HOME based on accidental file-system layout. Minor

3452 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

3453 settings manually, or use a Proof General version that has been

3454 bundled as Isabelle component.

3458 New in Isabelle2012 (May 2012)

3459 ------------------------------

3461 *** General ***

3463 * Prover IDE (PIDE) improvements:

3465 - more robust Sledgehammer integration (as before the sledgehammer

3466 command-line needs to be typed into the source buffer)

3467 - markup for bound variables

3468 - markup for types of term variables (displayed as tooltips)

3469 - support for user-defined Isar commands within the running session

3470 - improved support for Unicode outside original 16bit range

3471 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

3473 * Forward declaration of outer syntax keywords within the theory

3474 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

3475 commands to be used in the same theory where defined.

3477 * Auxiliary contexts indicate block structure for specifications with

3478 additional parameters and assumptions. Such unnamed contexts may be

3479 nested within other targets, like 'theory', 'locale', 'class',

3480 'instantiation' etc. Results from the local context are generalized

3481 accordingly and applied to the enclosing target context. Example:

3483 context

3484 fixes x y z :: 'a

3485 assumes xy: "x = y" and yz: "y = z"

3486 begin

3488 lemma my_trans: "x = z" using xy yz by simp

3490 end

3492 thm my_trans

3494 The most basic application is to factor-out context elements of

3495 several fixes/assumes/shows theorem statements, e.g. see

3496 ~~/src/HOL/Isar_Examples/Group_Context.thy

3498 Any other local theory specification element works within the "context

3499 ... begin ... end" block as well.

3501 * Bundled declarations associate attributed fact expressions with a

3502 given name in the context. These may be later included in other

3503 contexts. This allows to manage context extensions casually, without

3504 the logical dependencies of locales and locale interpretation. See

3505 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

3507 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

3508 declaration, and results are standardized before being stored. Thus

3509 old-style "standard" after instantiation or composition of facts

3510 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

3511 indices of schematic variables.

3513 * Rule attributes in local theory declarations (e.g. locale or class)

3514 are now statically evaluated: the resulting theorem is stored instead

3515 of the original expression. INCOMPATIBILITY in rare situations, where

3516 the historic accident of dynamic re-evaluation in interpretations

3517 etc. was exploited.

3519 * New tutorial "Programming and Proving in Isabelle/HOL"

3520 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

3521 Structured Isar Proofs" ("isar-overview"), which has been removed. It

3522 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

3523 Logic" as the recommended beginners tutorial, but does not cover all

3524 of the material of that old tutorial.

3526 * Updated and extended reference manuals: "isar-ref",

3527 "implementation", "system"; reduced remaining material in old "ref"

3528 manual.

3531 *** Pure ***

3533 * Command 'definition' no longer exports the foundational "raw_def"

3534 into the user context. Minor INCOMPATIBILITY, may use the regular

3535 "def" result with attribute "abs_def" to imitate the old version.

3537 * Attribute "abs_def" turns an equation of the form "f x y == t" into

3538 "f == %x y. t", which ensures that "simp" or "unfold" steps always

3539 expand it. This also works for object-logic equality. (Formerly

3540 undocumented feature.)

3542 * Sort constraints are now propagated in simultaneous statements, just

3543 like type constraints. INCOMPATIBILITY in rare situations, where

3544 distinct sorts used to be assigned accidentally. For example:

3546 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

3548 lemma "P (x::'a)" and "Q (y::'a::bar)"

3549 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

3551 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

3552 tolerant against multiple unifiers, as long as the final result is

3553 unique. (As before, rules are composed in canonical right-to-left

3554 order to accommodate newly introduced premises.)

3556 * Renamed some inner syntax categories:

3558 num ~> num_token

3559 xnum ~> xnum_token

3560 xstr ~> str_token

3562 Minor INCOMPATIBILITY. Note that in practice "num_const" or

3563 "num_position" etc. are mainly used instead (which also include

3564 position information via constraints).

3566 * Simplified configuration options for syntax ambiguity: see

3567 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

3568 manual. Minor INCOMPATIBILITY.

3570 * Discontinued configuration option "syntax_positions": atomic terms

3571 in parse trees are always annotated by position constraints.

3573 * Old code generator for SML and its commands 'code_module',

3574 'code_library', 'consts_code', 'types_code' have been discontinued.

3575 Use commands of the generic code generator instead. INCOMPATIBILITY.

3577 * Redundant attribute "code_inline" has been discontinued. Use

3578 "code_unfold" instead. INCOMPATIBILITY.

3580 * Dropped attribute "code_unfold_post" in favor of the its dual

3581 "code_abbrev", which yields a common pattern in definitions like

3583 definition [code_abbrev]: "f = t"

3585 INCOMPATIBILITY.

3587 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

3588 instead. INCOMPATIBILITY.

3590 * Discontinued old "prems" fact, which used to refer to the accidental

3591 collection of foundational premises in the context (already marked as

3592 legacy since Isabelle2011).

3595 *** HOL ***

3597 * Type 'a set is now a proper type constructor (just as before

3598 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

3599 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

3600 sets separate, it is often sufficient to rephrase some set S that has

3601 been accidentally used as predicates by "%x. x : S", and some

3602 predicate P that has been accidentally used as set by "{x. P x}".

3603 Corresponding proofs in a first step should be pruned from any

3604 tinkering with former theorems mem_def and Collect_def as far as

3605 possible.

3607 For developments which deliberately mix predicates and sets, a

3608 planning step is necessary to determine what should become a predicate

3609 and what a set. It can be helpful to carry out that step in

3610 Isabelle2011-1 before jumping right into the current release.

3612 * Code generation by default implements sets as container type rather

3613 than predicates. INCOMPATIBILITY.

3615 * New type synonym 'a rel = ('a * 'a) set

3617 * The representation of numerals has changed. Datatype "num"

3618 represents strictly positive binary numerals, along with functions

3619 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent

3620 positive and negated numeric literals, respectively. See also

3621 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

3622 user theories may require adaptations as follows:

3624 - Theorems with number_ring or number_semiring constraints: These

3625 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

3627 - Theories defining numeric types: Remove number, number_semiring,

3628 and number_ring instances. Defer all theorems about numerals until

3629 after classes one and semigroup_add have been instantiated.

3631 - Numeral-only simp rules: Replace each rule having a "number_of v"

3632 pattern with two copies, one for numeral and one for neg_numeral.

3634 - Theorems about subclasses of semiring_1 or ring_1: These classes

3635 automatically support numerals now, so more simp rules and

3636 simprocs may now apply within the proof.

3638 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

3639 Redefine using other integer operations.

3641 * Transfer: New package intended to generalize the existing

3642 "descending" method and related theorem attributes from the Quotient

3643 package. (Not all functionality is implemented yet, but future

3644 development will focus on Transfer as an eventual replacement for the

3645 corresponding parts of the Quotient package.)

3647 - transfer_rule attribute: Maintains a collection of transfer rules,

3648 which relate constants at two different types. Transfer rules may

3649 relate different type instances of the same polymorphic constant,

3650 or they may relate an operation on a raw type to a corresponding

3651 operation on an abstract type (quotient or subtype). For example:

3653 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map

3654 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int

3656 - transfer method: Replaces a subgoal on abstract types with an

3657 equivalent subgoal on the corresponding raw types. Constants are

3658 replaced with corresponding ones according to the transfer rules.

3659 Goals are generalized over all free variables by default; this is

3660 necessary for variables whose types change, but can be overridden

3661 for specific variables with e.g. "transfer fixing: x y z". The

3662 variant transfer' method allows replacing a subgoal with one that

3663 is logically stronger (rather than equivalent).

3665 - relator_eq attribute: Collects identity laws for relators of

3666 various type constructors, e.g. "list_all2 (op =) = (op =)". The

3667 transfer method uses these lemmas to infer transfer rules for

3668 non-polymorphic constants on the fly.

3670 - transfer_prover method: Assists with proving a transfer rule for a

3671 new constant, provided the constant is defined in terms of other

3672 constants that already have transfer rules. It should be applied

3673 after unfolding the constant definitions.

3675 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

3676 from type nat to type int.

3678 * Lifting: New package intended to generalize the quotient_definition

3679 facility of the Quotient package; designed to work with Transfer.

3681 - lift_definition command: Defines operations on an abstract type in

3682 terms of a corresponding operation on a representation

3683 type. Example syntax:

3685 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"

3686 is List.insert

3688 Users must discharge a respectfulness proof obligation when each

3689 constant is defined. (For a type copy, i.e. a typedef with UNIV,

3690 the proof is discharged automatically.) The obligation is

3691 presented in a user-friendly, readable form; a respectfulness

3692 theorem in the standard format and a transfer rule are generated

3693 by the package.

3695 - Integration with code_abstype: For typedefs (e.g. subtypes

3696 corresponding to a datatype invariant, such as dlist),

3697 lift_definition generates a code certificate theorem and sets up

3698 code generation for each constant.

3700 - setup_lifting command: Sets up the Lifting package to work with a

3701 user-defined type. The user must provide either a quotient theorem

3702 or a type_definition theorem. The package configures transfer

3703 rules for equality and quantifiers on the type, and sets up the

3704 lift_definition command to work with the type.

3706 - Usage examples: See Quotient_Examples/Lift_DList.thy,

3707 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

3708 Word/Word.thy and Library/Float.thy.

3710 * Quotient package:

3712 - The 'quotient_type' command now supports a 'morphisms' option with

3713 rep and abs functions, similar to typedef.

3715 - 'quotient_type' sets up new types to work with the Lifting and

3716 Transfer packages, as with 'setup_lifting'.

3718 - The 'quotient_definition' command now requires the user to prove a

3719 respectfulness property at the point where the constant is

3720 defined, similar to lift_definition; INCOMPATIBILITY.

3722 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

3723 accordingly, INCOMPATIBILITY.

3725 * New diagnostic command 'find_unused_assms' to find potentially

3726 superfluous assumptions in theorems using Quickcheck.

3728 * Quickcheck:

3730 - Quickcheck returns variable assignments as counterexamples, which

3731 allows to reveal the underspecification of functions under test.

3732 For example, refuting "hd xs = x", it presents the variable

3733 assignment xs = [] and x = a1 as a counterexample, assuming that

3734 any property is false whenever "hd []" occurs in it.

3736 These counterexample are marked as potentially spurious, as

3737 Quickcheck also returns "xs = []" as a counterexample to the

3738 obvious theorem "hd xs = hd xs".

3740 After finding a potentially spurious counterexample, Quickcheck

3741 continues searching for genuine ones.

3743 By default, Quickcheck shows potentially spurious and genuine

3744 counterexamples. The option "genuine_only" sets quickcheck to only

3745 show genuine counterexamples.

3747 - The command 'quickcheck_generator' creates random and exhaustive

3748 value generators for a given type and operations.

3750 It generates values by using the operations as if they were

3751 constructors of that type.

3753 - Support for multisets.

3755 - Added "use_subtype" options.

3757 - Added "quickcheck_locale" configuration to specify how to process

3758 conjectures in a locale context.

3760 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

3761 and affecting 'rat' and 'real'.

3763 * Sledgehammer:

3764 - Integrated more tightly with SPASS, as described in the ITP 2012

3765 paper "More SPASS with Isabelle".

3766 - Made it try "smt" as a fallback if "metis" fails or times out.

3767 - Added support for the following provers: Alt-Ergo (via Why3 and

3768 TFF1), iProver, iProver-Eq.

3769 - Sped up the minimizer.

3770 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

3771 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

3772 - Renamed "sound" option to "strict".

3774 * Metis: Added possibility to specify lambda translations scheme as a

3775 parenthesized argument (e.g., "by (metis (lifting) ...)").

3777 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

3779 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

3781 * New "case_product" attribute to generate a case rule doing multiple

3782 case distinctions at the same time. E.g.

3784 list.exhaust [case_product nat.exhaust]

3786 produces a rule which can be used to perform case distinction on both

3787 a list and a nat.

3789 * New "eventually_elim" method as a generalized variant of the

3790 eventually_elim* rules. Supports structured proofs.

3792 * Typedef with implicit set definition is considered legacy. Use

3793 "typedef (open)" form instead, which will eventually become the

3794 default.

3796 * Record: code generation can be switched off manually with

3798 declare [[record_coden = false]] -- "default true"

3800 * Datatype: type parameters allow explicit sort constraints.

3802 * Concrete syntax for case expressions includes constraints for source

3803 positions, and thus produces Prover IDE markup for its bindings.

3804 INCOMPATIBILITY for old-style syntax translations that augment the

3805 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of

3806 one_case.

3808 * Clarified attribute "mono_set": pure declaration without modifying

3809 the result of the fact expression.

3811 * More default pred/set conversions on a couple of relation operations

3812 and predicates. Added powers of predicate relations. Consolidation

3813 of some relation theorems:

3815 converse_def ~> converse_unfold

3816 rel_comp_def ~> relcomp_unfold

3817 symp_def ~> (modified, use symp_def and sym_def instead)

3818 transp_def ~> transp_trans

3819 Domain_def ~> Domain_unfold

3820 Range_def ~> Domain_converse [symmetric]

3822 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

3824 See theory "Relation" for examples for making use of pred/set

3825 conversions by means of attributes "to_set" and "to_pred".

3827 INCOMPATIBILITY.

3829 * Renamed facts about the power operation on relations, i.e., relpow

3830 to match the constant's name:

3832 rel_pow_1 ~> relpow_1

3833 rel_pow_0_I ~> relpow_0_I

3834 rel_pow_Suc_I ~> relpow_Suc_I

3835 rel_pow_Suc_I2 ~> relpow_Suc_I2

3836 rel_pow_0_E ~> relpow_0_E

3837 rel_pow_Suc_E ~> relpow_Suc_E

3838 rel_pow_E ~> relpow_E

3839 rel_pow_Suc_D2 ~> relpow_Suc_D2

3840 rel_pow_Suc_E2 ~> relpow_Suc_E2

3841 rel_pow_Suc_D2' ~> relpow_Suc_D2'

3842 rel_pow_E2 ~> relpow_E2

3843 rel_pow_add ~> relpow_add

3844 rel_pow_commute ~> relpow

3845 rel_pow_empty ~> relpow_empty:

3846 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

3847 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

3848 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

3849 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

3850 rel_pow_fun_conv ~> relpow_fun_conv

3851 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

3852 rel_pow_finite_bounded ~> relpow_finite_bounded

3853 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

3854 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

3855 single_valued_rel_pow ~> single_valued_relpow

3857 INCOMPATIBILITY.

3859 * Theory Relation: Consolidated constant name for relation composition

3860 and corresponding theorem names:

3862 - Renamed constant rel_comp to relcomp.

3864 - Dropped abbreviation pred_comp. Use relcompp instead.

3866 - Renamed theorems:

3868 rel_compI ~> relcompI

3869 rel_compEpair ~> relcompEpair

3870 rel_compE ~> relcompE

3871 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

3872 rel_comp_empty1 ~> relcomp_empty1

3873 rel_comp_mono ~> relcomp_mono

3874 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

3875 rel_comp_distrib ~> relcomp_distrib

3876 rel_comp_distrib2 ~> relcomp_distrib2

3877 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

3878 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

3879 single_valued_rel_comp ~> single_valued_relcomp

3880 rel_comp_def ~> relcomp_unfold

3881 converse_rel_comp ~> converse_relcomp

3882 pred_compI ~> relcomppI

3883 pred_compE ~> relcomppE

3884 pred_comp_bot1 ~> relcompp_bot1

3885 pred_comp_bot2 ~> relcompp_bot2

3886 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

3887 pred_comp_mono ~> relcompp_mono

3888 pred_comp_distrib ~> relcompp_distrib

3889 pred_comp_distrib2 ~> relcompp_distrib2

3890 converse_pred_comp ~> converse_relcompp

3892 finite_rel_comp ~> finite_relcomp

3894 set_rel_comp ~> set_relcomp

3896 INCOMPATIBILITY.

3898 * Theory Divides: Discontinued redundant theorems about div and mod.

3899 INCOMPATIBILITY, use the corresponding generic theorems instead.

3901 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

3902 zdiv_self ~> div_self

3903 zmod_self ~> mod_self

3904 zdiv_zero ~> div_0

3905 zmod_zero ~> mod_0

3906 zdiv_zmod_equality ~> div_mod_equality2

3907 zdiv_zmod_equality2 ~> div_mod_equality

3908 zmod_zdiv_trivial ~> mod_div_trivial

3909 zdiv_zminus_zminus ~> div_minus_minus

3910 zmod_zminus_zminus ~> mod_minus_minus

3911 zdiv_zminus2 ~> div_minus_right

3912 zmod_zminus2 ~> mod_minus_right

3913 zdiv_minus1_right ~> div_minus1_right

3914 zmod_minus1_right ~> mod_minus1_right

3915 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

3916 zmod_zmult1_eq ~> mod_mult_right_eq

3917 zpower_zmod ~> power_mod

3918 zdvd_zmod ~> dvd_mod

3919 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

3920 mod_mult_distrib ~> mult_mod_left

3921 mod_mult_distrib2 ~> mult_mod_right

3923 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

3924 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

3926 * Finite_Set.fold now qualified. INCOMPATIBILITY.

3928 * Consolidated theorem names concerning fold combinators:

3930 inf_INFI_fold_inf ~> inf_INF_fold_inf

3931 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

3932 INFI_fold_inf ~> INF_fold_inf

3933 SUPR_fold_sup ~> SUP_fold_sup

3934 union_set ~> union_set_fold

3935 minus_set ~> minus_set_fold

3936 INFI_set_fold ~> INF_set_fold

3937 SUPR_set_fold ~> SUP_set_fold

3938 INF_code ~> INF_set_foldr

3939 SUP_code ~> SUP_set_foldr

3940 foldr.simps ~> foldr.simps (in point-free formulation)

3941 foldr_fold_rev ~> foldr_conv_fold

3942 foldl_fold ~> foldl_conv_fold

3943 foldr_foldr ~> foldr_conv_foldl

3944 foldl_foldr ~> foldl_conv_foldr

3945 fold_set_remdups ~> fold_set_fold_remdups

3946 fold_set ~> fold_set_fold

3947 fold1_set ~> fold1_set_fold

3949 INCOMPATIBILITY.

3951 * Dropped rarely useful theorems concerning fold combinators:

3952 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

3953 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

3954 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

3955 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

3956 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

3957 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

3958 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"

3959 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be

3960 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by

3961 unfolding "foldr_conv_fold" and "foldl_conv_fold".

3963 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

3964 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

3965 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

3966 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

3967 lemmas over fold rather than foldr, or make use of lemmas

3968 fold_conv_foldr and fold_rev.

3970 * Congruence rules Option.map_cong and Option.bind_cong for recursion

3971 through option types.

3973 * "Transitive_Closure.ntrancl": bounded transitive closure on

3974 relations.

3976 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

3978 * Theory Int: Discontinued many legacy theorems specific to type int.

3979 INCOMPATIBILITY, use the corresponding generic theorems instead.

3981 zminus_zminus ~> minus_minus

3982 zminus_0 ~> minus_zero

3983 zminus_zadd_distrib ~> minus_add_distrib

3984 zadd_commute ~> add_commute

3985 zadd_assoc ~> add_assoc

3986 zadd_left_commute ~> add_left_commute

3987 zadd_ac ~> add_ac

3988 zmult_ac ~> mult_ac

3989 zadd_0 ~> add_0_left

3990 zadd_0_right ~> add_0_right

3991 zadd_zminus_inverse2 ~> left_minus

3992 zmult_zminus ~> mult_minus_left

3993 zmult_commute ~> mult_commute

3994 zmult_assoc ~> mult_assoc

3995 zadd_zmult_distrib ~> left_distrib

3996 zadd_zmult_distrib2 ~> right_distrib

3997 zdiff_zmult_distrib ~> left_diff_distrib

3998 zdiff_zmult_distrib2 ~> right_diff_distrib

3999 zmult_1 ~> mult_1_left

4000 zmult_1_right ~> mult_1_right

4001 zle_refl ~> order_refl

4002 zle_trans ~> order_trans

4003 zle_antisym ~> order_antisym

4004 zle_linear ~> linorder_linear

4005 zless_linear ~> linorder_less_linear

4006 zadd_left_mono ~> add_left_mono

4007 zadd_strict_right_mono ~> add_strict_right_mono

4008 zadd_zless_mono ~> add_less_le_mono

4009 int_0_less_1 ~> zero_less_one

4010 int_0_neq_1 ~> zero_neq_one

4011 zless_le ~> less_le

4012 zpower_zadd_distrib ~> power_add

4013 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

4014 zero_le_zpower_abs ~> zero_le_power_abs

4016 * Theory Deriv: Renamed

4018 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

4020 * Theory Library/Multiset: Improved code generation of multisets.

4022 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

4023 are expressed via type classes again. The special syntax

4024 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

4025 setsum_set, which is now subsumed by Big_Operators.setsum.

4026 INCOMPATIBILITY.

4028 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

4029 use theory HOL/Library/Nat_Bijection instead.

4031 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

4032 trees is now inside a type class context. Names of affected

4033 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for

4034 theories working directly with raw red-black trees, adapt the names as

4035 follows:

4037 Operations:

4038 bulkload -> rbt_bulkload

4039 del_from_left -> rbt_del_from_left

4040 del_from_right -> rbt_del_from_right

4041 del -> rbt_del

4042 delete -> rbt_delete

4043 ins -> rbt_ins

4044 insert -> rbt_insert

4045 insertw -> rbt_insert_with

4046 insert_with_key -> rbt_insert_with_key

4047 map_entry -> rbt_map_entry

4048 lookup -> rbt_lookup

4049 sorted -> rbt_sorted

4050 tree_greater -> rbt_greater

4051 tree_less -> rbt_less

4052 tree_less_symbol -> rbt_less_symbol

4053 union -> rbt_union

4054 union_with -> rbt_union_with

4055 union_with_key -> rbt_union_with_key

4057 Lemmas:

4058 balance_left_sorted -> balance_left_rbt_sorted

4059 balance_left_tree_greater -> balance_left_rbt_greater

4060 balance_left_tree_less -> balance_left_rbt_less

4061 balance_right_sorted -> balance_right_rbt_sorted

4062 balance_right_tree_greater -> balance_right_rbt_greater

4063 balance_right_tree_less -> balance_right_rbt_less

4064 balance_sorted -> balance_rbt_sorted

4065 balance_tree_greater -> balance_rbt_greater

4066 balance_tree_less -> balance_rbt_less

4067 bulkload_is_rbt -> rbt_bulkload_is_rbt

4068 combine_sorted -> combine_rbt_sorted

4069 combine_tree_greater -> combine_rbt_greater

4070 combine_tree_less -> combine_rbt_less

4071 delete_in_tree -> rbt_delete_in_tree

4072 delete_is_rbt -> rbt_delete_is_rbt

4073 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

4074 del_from_left_tree_less -> rbt_del_from_left_rbt_less

4075 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

4076 del_from_right_tree_less -> rbt_del_from_right_rbt_less

4077 del_in_tree -> rbt_del_in_tree

4078 del_inv1_inv2 -> rbt_del_inv1_inv2

4079 del_sorted -> rbt_del_rbt_sorted

4080 del_tree_greater -> rbt_del_rbt_greater

4081 del_tree_less -> rbt_del_rbt_less

4082 dom_lookup_Branch -> dom_rbt_lookup_Branch

4083 entries_lookup -> entries_rbt_lookup

4084 finite_dom_lookup -> finite_dom_rbt_lookup

4085 insert_sorted -> rbt_insert_rbt_sorted

4086 insertw_is_rbt -> rbt_insertw_is_rbt

4087 insertwk_is_rbt -> rbt_insertwk_is_rbt

4088 insertwk_sorted -> rbt_insertwk_rbt_sorted

4089 insertw_sorted -> rbt_insertw_rbt_sorted

4090 ins_sorted -> ins_rbt_sorted

4091 ins_tree_greater -> ins_rbt_greater

4092 ins_tree_less -> ins_rbt_less

4093 is_rbt_sorted -> is_rbt_rbt_sorted

4094 lookup_balance -> rbt_lookup_balance

4095 lookup_bulkload -> rbt_lookup_rbt_bulkload

4096 lookup_delete -> rbt_lookup_rbt_delete

4097 lookup_Empty -> rbt_lookup_Empty

4098 lookup_from_in_tree -> rbt_lookup_from_in_tree

4099 lookup_in_tree -> rbt_lookup_in_tree

4100 lookup_ins -> rbt_lookup_ins

4101 lookup_insert -> rbt_lookup_rbt_insert

4102 lookup_insertw -> rbt_lookup_rbt_insertw

4103 lookup_insertwk -> rbt_lookup_rbt_insertwk

4104 lookup_keys -> rbt_lookup_keys

4105 lookup_map -> rbt_lookup_map

4106 lookup_map_entry -> rbt_lookup_rbt_map_entry

4107 lookup_tree_greater -> rbt_lookup_rbt_greater

4108 lookup_tree_less -> rbt_lookup_rbt_less

4109 lookup_union -> rbt_lookup_rbt_union

4110 map_entry_color_of -> rbt_map_entry_color_of

4111 map_entry_inv1 -> rbt_map_entry_inv1

4112 map_entry_inv2 -> rbt_map_entry_inv2

4113 map_entry_is_rbt -> rbt_map_entry_is_rbt

4114 map_entry_sorted -> rbt_map_entry_rbt_sorted

4115 map_entry_tree_greater -> rbt_map_entry_rbt_greater

4116 map_entry_tree_less -> rbt_map_entry_rbt_less

4117 map_tree_greater -> map_rbt_greater

4118 map_tree_less -> map_rbt_less

4119 map_sorted -> map_rbt_sorted

4120 paint_sorted -> paint_rbt_sorted

4121 paint_lookup -> paint_rbt_lookup

4122 paint_tree_greater -> paint_rbt_greater

4123 paint_tree_less -> paint_rbt_less

4124 sorted_entries -> rbt_sorted_entries

4125 tree_greater_eq_trans -> rbt_greater_eq_trans

4126 tree_greater_nit -> rbt_greater_nit

4127 tree_greater_prop -> rbt_greater_prop

4128 tree_greater_simps -> rbt_greater_simps

4129 tree_greater_trans -> rbt_greater_trans

4130 tree_less_eq_trans -> rbt_less_eq_trans

4131 tree_less_nit -> rbt_less_nit

4132 tree_less_prop -> rbt_less_prop

4133 tree_less_simps -> rbt_less_simps

4134 tree_less_trans -> rbt_less_trans

4135 tree_ord_props -> rbt_ord_props

4136 union_Branch -> rbt_union_Branch

4137 union_is_rbt -> rbt_union_is_rbt

4138 unionw_is_rbt -> rbt_unionw_is_rbt

4139 unionwk_is_rbt -> rbt_unionwk_is_rbt

4140 unionwk_sorted -> rbt_unionwk_rbt_sorted

4142 * Theory HOL/Library/Float: Floating point numbers are now defined as

4143 a subset of the real numbers. All operations are defined using the

4144 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

4146 Changed Operations:

4147 float_abs -> abs

4148 float_nprt -> nprt

4149 float_pprt -> pprt

4150 pow2 -> use powr

4151 round_down -> float_round_down

4152 round_up -> float_round_up

4153 scale -> exponent

4155 Removed Operations:

4156 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

4158 Renamed Lemmas:

4159 abs_float_def -> Float.compute_float_abs

4160 bitlen_ge0 -> bitlen_nonneg

4161 bitlen.simps -> Float.compute_bitlen

4162 float_components -> Float_mantissa_exponent

4163 float_divl.simps -> Float.compute_float_divl

4164 float_divr.simps -> Float.compute_float_divr

4165 float_eq_odd -> mult_powr_eq_mult_powr_iff

4166 float_power -> real_of_float_power

4167 lapprox_posrat_def -> Float.compute_lapprox_posrat

4168 lapprox_rat.simps -> Float.compute_lapprox_rat

4169 le_float_def' -> Float.compute_float_le

4170 le_float_def -> less_eq_float.rep_eq

4171 less_float_def' -> Float.compute_float_less

4172 less_float_def -> less_float.rep_eq

4173 normfloat_def -> Float.compute_normfloat

4174 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

4175 normfloat -> normfloat_def

4176 normfloat_unique -> use normfloat_def

4177 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

4178 one_float_def -> Float.compute_float_one

4179 plus_float_def -> Float.compute_float_plus

4180 rapprox_posrat_def -> Float.compute_rapprox_posrat

4181 rapprox_rat.simps -> Float.compute_rapprox_rat

4182 real_of_float_0 -> zero_float.rep_eq

4183 real_of_float_1 -> one_float.rep_eq

4184 real_of_float_abs -> abs_float.rep_eq

4185 real_of_float_add -> plus_float.rep_eq

4186 real_of_float_minus -> uminus_float.rep_eq

4187 real_of_float_mult -> times_float.rep_eq

4188 real_of_float_simp -> Float.rep_eq

4189 real_of_float_sub -> minus_float.rep_eq

4190 round_down.simps -> Float.compute_float_round_down

4191 round_up.simps -> Float.compute_float_round_up

4192 times_float_def -> Float.compute_float_times

4193 uminus_float_def -> Float.compute_float_uminus

4194 zero_float_def -> Float.compute_float_zero

4196 Lemmas not necessary anymore, use the transfer method:

4197 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

4198 float_divr, float_le_simp, float_less1_mantissa_bound,

4199 float_less_simp, float_less_zero, float_le_zero,

4200 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

4201 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

4202 lapprox_rat_bottom, normalized_float, rapprox_posrat,

4203 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

4204 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

4205 round_up, zero_le_float, zero_less_float

4207 * New theory HOL/Library/DAList provides an abstract type for

4208 association lists with distinct keys.

4210 * Session HOL/IMP: Added new theory of abstract interpretation of

4211 annotated commands.

4213 * Session HOL-Import: Re-implementation from scratch is faster,

4214 simpler, and more scalable. Requires a proof bundle, which is

4215 available as an external component. Discontinued old (and mostly

4216 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

4218 * Session HOL-Word: Discontinued many redundant theorems specific to

4219 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

4220 instead.

4222 word_sub_alt ~> word_sub_wi

4223 word_add_alt ~> word_add_def

4224 word_mult_alt ~> word_mult_def

4225 word_minus_alt ~> word_minus_def

4226 word_0_alt ~> word_0_wi

4227 word_1_alt ~> word_1_wi

4228 word_add_0 ~> add_0_left

4229 word_add_0_right ~> add_0_right

4230 word_mult_1 ~> mult_1_left

4231 word_mult_1_right ~> mult_1_right

4232 word_add_commute ~> add_commute

4233 word_add_assoc ~> add_assoc

4234 word_add_left_commute ~> add_left_commute

4235 word_mult_commute ~> mult_commute

4236 word_mult_assoc ~> mult_assoc

4237 word_mult_left_commute ~> mult_left_commute

4238 word_left_distrib ~> left_distrib

4239 word_right_distrib ~> right_distrib

4240 word_left_minus ~> left_minus

4241 word_diff_0_right ~> diff_0_right

4242 word_diff_self ~> diff_self

4243 word_sub_def ~> diff_minus

4244 word_diff_minus ~> diff_minus

4245 word_add_ac ~> add_ac

4246 word_mult_ac ~> mult_ac

4247 word_plus_ac0 ~> add_0_left add_0_right add_ac

4248 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

4249 word_order_trans ~> order_trans

4250 word_order_refl ~> order_refl

4251 word_order_antisym ~> order_antisym

4252 word_order_linear ~> linorder_linear

4253 lenw1_zero_neq_one ~> zero_neq_one

4254 word_number_of_eq ~> number_of_eq

4255 word_of_int_add_hom ~> wi_hom_add

4256 word_of_int_sub_hom ~> wi_hom_sub

4257 word_of_int_mult_hom ~> wi_hom_mult

4258 word_of_int_minus_hom ~> wi_hom_neg

4259 word_of_int_succ_hom ~> wi_hom_succ

4260 word_of_int_pred_hom ~> wi_hom_pred

4261 word_of_int_0_hom ~> word_0_wi

4262 word_of_int_1_hom ~> word_1_wi

4264 * Session HOL-Word: New proof method "word_bitwise" for splitting

4265 machine word equalities and inequalities into logical circuits,

4266 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

4267 multiplication, shifting by constants, bitwise operators and numeric

4268 constants. Requires fixed-length word types, not 'a word. Solves

4269 many standard word identities outright and converts more into first

4270 order problems amenable to blast or similar. See also examples in

4271 HOL/Word/Examples/WordExamples.thy.

4273 * Session HOL-Probability: Introduced the type "'a measure" to

4274 represent measures, this replaces the records 'a algebra and 'a

4275 measure_space. The locales based on subset_class now have two

4276 locale-parameters the space \<Omega> and the set of measurable sets M.

4277 The product of probability spaces uses now the same constant as the

4278 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

4279 measure". Most constants are defined now outside of locales and gain

4280 an additional parameter, like null_sets, almost_eventually or \<mu>'.

4281 Measure space constructions for distributions and densities now got

4282 their own constants distr and density. Instead of using locales to

4283 describe measure spaces with a finite space, the measure count_space

4284 and point_measure is introduced. INCOMPATIBILITY.

4286 Renamed constants:

4287 measure -> emeasure

4288 finite_measure.\<mu>' -> measure

4289 product_algebra_generator -> prod_algebra

4290 product_prob_space.emb -> prod_emb

4291 product_prob_space.infprod_algebra -> PiM

4293 Removed locales:

4294 completeable_measure_space

4295 finite_measure_space

4296 finite_prob_space

4297 finite_product_finite_prob_space

4298 finite_product_sigma_algebra

4299 finite_sigma_algebra

4300 measure_space

4301 pair_finite_prob_space

4302 pair_finite_sigma_algebra

4303 pair_finite_space

4304 pair_sigma_algebra

4305 product_sigma_algebra

4307 Removed constants:

4308 conditional_space

4309 distribution -> use distr measure, or distributed predicate

4310 image_space

4311 joint_distribution -> use distr measure, or distributed predicate

4312 pair_measure_generator

4313 product_prob_space.infprod_algebra -> use PiM

4314 subvimage

4316 Replacement theorems:

4317 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

4318 finite_measure.empty_measure -> measure_empty

4319 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

4320 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

4321 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

4322 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

4323 finite_measure.finite_measure -> finite_measure.emeasure_finite

4324 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

4325 finite_measure.positive_measure' -> measure_nonneg

4326 finite_measure.real_measure -> finite_measure.emeasure_real

4327 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

4328 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

4329 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

4330 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

4331 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

4332 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

4333 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

4334 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

4335 information_space.entropy_commute -> information_space.entropy_commute_simple

4336 information_space.entropy_eq -> information_space.entropy_simple_distributed

4337 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

4338 information_space.entropy_positive -> information_space.entropy_nonneg_simple

4339 information_space.entropy_uniform_max -> information_space.entropy_uniform

4340 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

4341 information_space.KL_eq_0 -> information_space.KL_same_eq_0

4342 information_space.KL_ge_0 -> information_space.KL_nonneg

4343 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

4344 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

4345 Int_stable_cuboids -> Int_stable_atLeastAtMost

4346 Int_stable_product_algebra_generator -> positive_integral

4347 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

4348 measure_space.additive -> emeasure_additive

4349 measure_space.AE_iff_null_set -> AE_iff_null

4350 measure_space.almost_everywhere_def -> eventually_ae_filter

4351 measure_space.almost_everywhere_vimage -> AE_distrD

4352 measure_space.continuity_from_above -> INF_emeasure_decseq

4353 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

4354 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

4355 measure_space.continuity_from_below -> SUP_emeasure_incseq

4356 measure_space_density -> emeasure_density

4357 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

4358 measure_space.integrable_vimage -> integrable_distr

4359 measure_space.integral_translated_density -> integral_density

4360 measure_space.integral_vimage -> integral_distr

4361 measure_space.measure_additive -> plus_emeasure

4362 measure_space.measure_compl -> emeasure_compl

4363 measure_space.measure_countable_increasing -> emeasure_countable_increasing

4364 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

4365 measure_space.measure_decseq -> decseq_emeasure

4366 measure_space.measure_Diff -> emeasure_Diff

4367 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

4368 measure_space.measure_eq_0 -> emeasure_eq_0

4369 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

4370 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

4371 measure_space.measure_incseq -> incseq_emeasure

4372 measure_space.measure_insert -> emeasure_insert

4373 measure_space.measure_mono -> emeasure_mono

4374 measure_space.measure_not_negative -> emeasure_not_MInf

4375 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

4376 measure_space.measure_setsum -> setsum_emeasure

4377 measure_space.measure_setsum_split -> setsum_emeasure_cover

4378 measure_space.measure_space_vimage -> emeasure_distr

4379 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

4380 measure_space.measure_subadditive -> subadditive

4381 measure_space.measure_top -> emeasure_space

4382 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

4383 measure_space.measure_Un_null_set -> emeasure_Un_null_set

4384 measure_space.positive_integral_translated_density -> positive_integral_density

4385 measure_space.positive_integral_vimage -> positive_integral_distr

4386 measure_space.real_continuity_from_above -> Lim_measure_decseq

4387 measure_space.real_continuity_from_below -> Lim_measure_incseq

4388 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

4389 measure_space.real_measure_Diff -> measure_Diff

4390 measure_space.real_measure_finite_Union -> measure_finite_Union

4391 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

4392 measure_space.real_measure_subadditive -> measure_subadditive

4393 measure_space.real_measure_Union -> measure_Union

4394 measure_space.real_measure_UNION -> measure_UNION

4395 measure_space.simple_function_vimage -> simple_function_comp

4396 measure_space.simple_integral_vimage -> simple_integral_distr

4397 measure_space.simple_integral_vimage -> simple_integral_distr

4398 measure_unique_Int_stable -> measure_eqI_generator_eq

4399 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

4400 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

4401 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

4402 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

4403 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

4404 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

4405 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

4406 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

4407 pair_sigma_algebra.sets_swap -> sets_pair_swap

4408 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

4409 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

4410 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

4411 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

4412 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

4413 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

4414 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

4415 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

4416 prob_space.measure_space_1 -> prob_space.emeasure_space_1

4417 prob_space.prob_space_vimage -> prob_space_distr

4418 prob_space.random_variable_restrict -> measurable_restrict

4419 prob_space_unique_Int_stable -> measure_eqI_prob_space

4420 product_algebraE -> prod_algebraE_all

4421 product_algebra_generator_der -> prod_algebra_eq_finite

4422 product_algebra_generator_into_space -> prod_algebra_sets_into_space

4423 product_algebraI -> sets_PiM_I_finite

4424 product_measure_exists -> product_sigma_finite.sigma_finite

4425 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

4426 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

4427 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

4428 product_prob_space.measurable_component -> measurable_component_singleton

4429 product_prob_space.measurable_emb -> measurable_prod_emb

4430 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

4431 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

4432 product_prob_space.measure_emb -> emeasure_prod_emb

4433 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

4434 product_sigma_algebra.product_algebra_into_space -> space_closed

4435 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

4436 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

4437 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

4438 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

4439 sets_product_algebra -> sets_PiM

4440 sigma_algebra.measurable_sigma -> measurable_measure_of

4441 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

4442 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

4443 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

4444 space_product_algebra -> space_PiM

4446 * Session HOL-TPTP: support to parse and import TPTP problems (all

4447 languages) into Isabelle/HOL.

4450 *** FOL ***

4452 * New "case_product" attribute (see HOL).

4455 *** ZF ***

4457 * Greater support for structured proofs involving induction or case

4458 analysis.

4460 * Much greater use of mathematical symbols.

4462 * Removal of many ML theorem bindings. INCOMPATIBILITY.

4465 *** ML ***

4467 * Antiquotation @{keyword "name"} produces a parser for outer syntax

4468 from a minor keyword introduced via theory header declaration.

4470 * Antiquotation @{command_spec "name"} produces the

4471 Outer_Syntax.command_spec from a major keyword introduced via theory

4472 header declaration; it can be passed to Outer_Syntax.command etc.

4474 * Local_Theory.define no longer hard-wires default theorem name

4475 "foo_def", but retains the binding as given. If that is Binding.empty

4476 / Attrib.empty_binding, the result is not registered as user-level

4477 fact. The Local_Theory.define_internal variant allows to specify a

4478 non-empty name (used for the foundation in the background theory),

4479 while omitting the fact binding in the user-context. Potential

4480 INCOMPATIBILITY for derived definitional packages: need to specify

4481 naming policy for primitive definitions more explicitly.

4483 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

4484 conformance with similar operations in structure Term and Logic.

4486 * Antiquotation @{attributes [...]} embeds attribute source

4487 representation into the ML text, which is particularly useful with

4488 declarations like Local_Theory.note.

4490 * Structure Proof_Context follows standard naming scheme. Old

4491 ProofContext has been discontinued. INCOMPATIBILITY.

4493 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

4494 change of semantics: update is applied to auxiliary local theory

4495 context as well.

4497 * Modernized some old-style infix operations:

4499 addeqcongs ~> Simplifier.add_eqcong

4500 deleqcongs ~> Simplifier.del_eqcong

4501 addcongs ~> Simplifier.add_cong

4502 delcongs ~> Simplifier.del_cong

4503 setmksimps ~> Simplifier.set_mksimps

4504 setmkcong ~> Simplifier.set_mkcong

4505 setmksym ~> Simplifier.set_mksym

4506 setmkeqTrue ~> Simplifier.set_mkeqTrue

4507 settermless ~> Simplifier.set_termless

4508 setsubgoaler ~> Simplifier.set_subgoaler

4509 addsplits ~> Splitter.add_split

4510 delsplits ~> Splitter.del_split

4513 *** System ***

4515 * USER_HOME settings variable points to cross-platform user home

4516 directory, which coincides with HOME on POSIX systems only. Likewise,

4517 the Isabelle path specification "~" now expands to $USER_HOME, instead

4518 of former $HOME. A different default for USER_HOME may be set

4519 explicitly in shell environment, before Isabelle settings are

4520 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

4521 the generic user home was intended.

4523 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

4524 notation, which is useful for the jEdit file browser, for example.

4526 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

4527 (not just JRE).

4531 New in Isabelle2011-1 (October 2011)

4532 ------------------------------------

4534 *** General ***

4536 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

4537 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

4539 - Management of multiple theory files directly from the editor

4540 buffer store -- bypassing the file-system (no requirement to save

4541 files for checking).

4543 - Markup of formal entities within the text buffer, with semantic

4544 highlighting, tooltips and hyperlinks to jump to defining source

4545 positions.

4547 - Improved text rendering, with sub/superscripts in the source

4548 buffer (including support for copy/paste wrt. output panel, HTML

4549 theory output and other non-Isabelle text boxes).

4551 - Refined scheduling of proof checking and printing of results,

4552 based on interactive editor view. (Note: jEdit folding and

4553 narrowing allows to restrict buffer perspectives explicitly.)

4555 - Reduced CPU performance requirements, usable on machines with few

4556 cores.

4558 - Reduced memory requirements due to pruning of unused document

4559 versions (garbage collection).

4561 See also ~~/src/Tools/jEdit/README.html for further information,

4562 including some remaining limitations.

4564 * Theory loader: source files are exclusively located via the master

4565 directory of each theory node (where the .thy file itself resides).

4566 The global load path (such as src/HOL/Library) has been discontinued.

4567 Note that the path element ~~ may be used to reference theories in the

4568 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".

4569 INCOMPATIBILITY.

4571 * Theory loader: source files are identified by content via SHA1

4572 digests. Discontinued former path/modtime identification and optional

4573 ISABELLE_FILE_IDENT plugin scripts.

4575 * Parallelization of nested Isar proofs is subject to

4576 Goal.parallel_proofs_threshold (default 100). See also isabelle

4577 usedir option -Q.

4579 * Name space: former unsynchronized references are now proper

4580 configuration options, with more conventional names:

4582 long_names ~> names_long

4583 short_names ~> names_short

4584 unique_names ~> names_unique

4586 Minor INCOMPATIBILITY, need to declare options in context like this:

4588 declare [[names_unique = false]]

4590 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note

4591 that the result needs to be unique, which means fact specifications

4592 may have to be refined after enriching a proof context.

4594 * Attribute "case_names" has been refined: the assumptions in each case

4595 can be named now by following the case name with [name1 name2 ...].

4597 * Isabelle/Isar reference manual has been updated and extended:

4598 - "Synopsis" provides a catalog of main Isar language concepts.

4599 - Formal references in syntax diagrams, via @{rail} antiquotation.

4600 - Updated material from classic "ref" manual, notably about

4601 "Classical Reasoner".

4604 *** HOL ***

4606 * Class bot and top require underlying partial order rather than

4607 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.

4609 * Class complete_lattice: generalized a couple of lemmas from sets;

4610 generalized theorems INF_cong and SUP_cong. New type classes for

4611 complete boolean algebras and complete linear orders. Lemmas

4612 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in

4613 class complete_linorder.

4615 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,

4616 Sup_fun_def, Inf_apply, Sup_apply.

4618 Removed redundant lemmas (the right hand side gives hints how to

4619 replace them for (metis ...), or (simp only: ...) proofs):

4621 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]

4622 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]

4623 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right

4624 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right

4625 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right

4626 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right

4627 Inter_def ~> INF_def, image_def

4628 Union_def ~> SUP_def, image_def

4629 INT_eq ~> INF_def, and image_def

4630 UN_eq ~> SUP_def, and image_def

4631 INF_subset ~> INF_superset_mono [OF _ order_refl]

4633 More consistent and comprehensive names:

4635 INTER_eq_Inter_image ~> INF_def

4636 UNION_eq_Union_image ~> SUP_def

4637 INFI_def ~> INF_def

4638 SUPR_def ~> SUP_def

4639 INF_leI ~> INF_lower

4640 INF_leI2 ~> INF_lower2

4641 le_INFI ~> INF_greatest

4642 le_SUPI ~> SUP_upper

4643 le_SUPI2 ~> SUP_upper2

4644 SUP_leI ~> SUP_least

4645 INFI_bool_eq ~> INF_bool_eq

4646 SUPR_bool_eq ~> SUP_bool_eq

4647 INFI_apply ~> INF_apply

4648 SUPR_apply ~> SUP_apply

4649 INTER_def ~> INTER_eq

4650 UNION_def ~> UNION_eq

4652 INCOMPATIBILITY.

4654 * Renamed theory Complete_Lattice to Complete_Lattices.

4655 INCOMPATIBILITY.

4657 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,

4658 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,

4659 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,

4660 Sup_insert are now declared as [simp]. INCOMPATIBILITY.

4662 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,

4663 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,

4664 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor

4665 INCOMPATIBILITY.

4667 * Added syntactic classes "inf" and "sup" for the respective

4668 constants. INCOMPATIBILITY: Changes in the argument order of the

4669 (mostly internal) locale predicates for some derived classes.

4671 * Theorem collections ball_simps and bex_simps do not contain theorems

4672 referring to UNION any longer; these have been moved to collection

4673 UN_ball_bex_simps. INCOMPATIBILITY.

4675 * Theory Archimedean_Field: floor now is defined as parameter of a

4676 separate type class floor_ceiling.

4678 * Theory Finite_Set: more coherent development of fold_set locales:

4680 locale fun_left_comm ~> locale comp_fun_commute

4681 locale fun_left_comm_idem ~> locale comp_fun_idem

4683 Both use point-free characterization; interpretation proofs may need

4684 adjustment. INCOMPATIBILITY.

4686 * Theory Limits: Type "'a net" has been renamed to "'a filter", in

4687 accordance with standard mathematical terminology. INCOMPATIBILITY.

4689 * Theory Complex_Main: The locale interpretations for the

4690 bounded_linear and bounded_bilinear locales have been removed, in

4691 order to reduce the number of duplicate lemmas. Users must use the

4692 original names for distributivity theorems, potential INCOMPATIBILITY.

4694 divide.add ~> add_divide_distrib

4695 divide.diff ~> diff_divide_distrib

4696 divide.setsum ~> setsum_divide_distrib

4697 mult.add_right ~> right_distrib

4698 mult.diff_right ~> right_diff_distrib

4699 mult_right.setsum ~> setsum_right_distrib

4700 mult_left.diff ~> left_diff_distrib

4702 * Theory Complex_Main: Several redundant theorems have been removed or

4703 replaced by more general versions. INCOMPATIBILITY.

4705 real_diff_def ~> minus_real_def

4706 real_divide_def ~> divide_real_def

4707 real_less_def ~> less_le

4708 real_abs_def ~> abs_real_def

4709 real_sgn_def ~> sgn_real_def

4710 real_mult_commute ~> mult_commute

4711 real_mult_assoc ~> mult_assoc

4712 real_mult_1 ~> mult_1_left

4713 real_add_mult_distrib ~> left_distrib

4714 real_zero_not_eq_one ~> zero_neq_one

4715 real_mult_inverse_left ~> left_inverse

4716 INVERSE_ZERO ~> inverse_zero

4717 real_le_refl ~> order_refl

4718 real_le_antisym ~> order_antisym

4719 real_le_trans ~> order_trans

4720 real_le_linear ~> linear

4721 real_le_eq_diff ~> le_iff_diff_le_0

4722 real_add_left_mono ~> add_left_mono

4723 real_mult_order ~> mult_pos_pos

4724 real_mult_less_mono2 ~> mult_strict_left_mono

4725 real_of_int_real_of_nat ~> real_of_int_of_nat_eq

4726 real_0_le_divide_iff ~> zero_le_divide_iff

4727 realpow_two_disj ~> power2_eq_iff

4728 real_squared_diff_one_factored ~> square_diff_one_factored

4729 realpow_two_diff ~> square_diff_square_factored

4730 reals_complete2 ~> complete_real

4731 real_sum_squared_expand ~> power2_sum

4732 exp_ln_eq ~> ln_unique

4733 expi_add ~> exp_add

4734 expi_zero ~> exp_zero

4735 lemma_DERIV_subst ~> DERIV_cong

4736 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff

4737 LIMSEQ_const ~> tendsto_const

4738 LIMSEQ_norm ~> tendsto_norm

4739 LIMSEQ_add ~> tendsto_add

4740 LIMSEQ_minus ~> tendsto_minus

4741 LIMSEQ_minus_cancel ~> tendsto_minus_cancel

4742 LIMSEQ_diff ~> tendsto_diff

4743 bounded_linear.LIMSEQ ~> bounded_linear.tendsto

4744 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto

4745 LIMSEQ_mult ~> tendsto_mult

4746 LIMSEQ_inverse ~> tendsto_inverse

4747 LIMSEQ_divide ~> tendsto_divide

4748 LIMSEQ_pow ~> tendsto_power

4749 LIMSEQ_setsum ~> tendsto_setsum

4750 LIMSEQ_setprod ~> tendsto_setprod

4751 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff

4752 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff

4753 LIMSEQ_imp_rabs ~> tendsto_rabs

4754 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]

4755 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]

4756 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]

4757 LIMSEQ_Complex ~> tendsto_Complex

4758 LIM_ident ~> tendsto_ident_at

4759 LIM_const ~> tendsto_const

4760 LIM_add ~> tendsto_add

4761 LIM_add_zero ~> tendsto_add_zero

4762 LIM_minus ~> tendsto_minus

4763 LIM_diff ~> tendsto_diff

4764 LIM_norm ~> tendsto_norm

4765 LIM_norm_zero ~> tendsto_norm_zero

4766 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel

4767 LIM_norm_zero_iff ~> tendsto_norm_zero_iff

4768 LIM_rabs ~> tendsto_rabs

4769 LIM_rabs_zero ~> tendsto_rabs_zero

4770 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel

4771 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff

4772 LIM_compose ~> tendsto_compose

4773 LIM_mult ~> tendsto_mult

4774 LIM_scaleR ~> tendsto_scaleR

4775 LIM_of_real ~> tendsto_of_real

4776 LIM_power ~> tendsto_power

4777 LIM_inverse ~> tendsto_inverse

4778 LIM_sgn ~> tendsto_sgn

4779 isCont_LIM_compose ~> isCont_tendsto_compose

4780 bounded_linear.LIM ~> bounded_linear.tendsto

4781 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero

4782 bounded_bilinear.LIM ~> bounded_bilinear.tendsto

4783 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero

4784 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero

4785 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero

4786 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]

4788 * Theory Complex_Main: The definition of infinite series was

4789 generalized. Now it is defined on the type class {topological_space,

4790 comm_monoid_add}. Hence it is useable also for extended real numbers.

4792 * Theory Complex_Main: The complex exponential function "expi" is now

4793 a type-constrained abbreviation for "exp :: complex => complex"; thus

4794 several polymorphic lemmas about "exp" are now applicable to "expi".

4796 * Code generation:

4798 - Theory Library/Code_Char_ord provides native ordering of

4799 characters in the target language.

4801 - Commands code_module and code_library are legacy, use export_code

4802 instead.

4804 - Method "evaluation" is legacy, use method "eval" instead.

4806 - Legacy evaluator "SML" is deactivated by default. May be

4807 reactivated by the following theory command:

4809 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}

4811 * Declare ext [intro] by default. Rare INCOMPATIBILITY.

4813 * New proof method "induction" that gives induction hypotheses the

4814 name "IH", thus distinguishing them from further hypotheses that come

4815 from rule induction. The latter are still called "hyps". Method

4816 "induction" is a thin wrapper around "induct" and follows the same

4817 syntax.

4819 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is

4820 still available as a legacy feature for some time.

4822 * Nitpick:

4823 - Added "need" and "total_consts" options.

4824 - Reintroduced "show_skolems" option by popular demand.

4825 - Renamed attribute: nitpick_def ~> nitpick_unfold.

4826 INCOMPATIBILITY.

4828 * Sledgehammer:

4829 - Use quasi-sound (and efficient) translations by default.

4830 - Added support for the following provers: E-ToFoF, LEO-II,

4831 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.

4832 - Automatically preplay and minimize proofs before showing them if

4833 this can be done within reasonable time.

4834 - sledgehammer available_provers ~> sledgehammer supported_provers.

4835 INCOMPATIBILITY.

4836 - Added "preplay_timeout", "slicing", "type_enc", "sound",

4837 "max_mono_iters", and "max_new_mono_instances" options.

4838 - Removed "explicit_apply" and "full_types" options as well as "Full

4839 Types" Proof General menu item. INCOMPATIBILITY.

4841 * Metis:

4842 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.

4843 - Obsoleted "metisFT" -- use "metis (full_types)" instead.

4844 INCOMPATIBILITY.

4846 * Command 'try':

4847 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and

4848 "elim:" options. INCOMPATIBILITY.

4849 - Introduced 'try' that not only runs 'try_methods' but also

4850 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.

4852 * Quickcheck:

4853 - Added "eval" option to evaluate terms for the found counterexample

4854 (currently only supported by the default (exhaustive) tester).

4855 - Added post-processing of terms to obtain readable counterexamples

4856 (currently only supported by the default (exhaustive) tester).

4857 - New counterexample generator quickcheck[narrowing] enables

4858 narrowing-based testing. Requires the Glasgow Haskell compiler

4859 with its installation location defined in the Isabelle settings

4860 environment as ISABELLE_GHC.

4861 - Removed quickcheck tester "SML" based on the SML code generator

4862 (formly in HOL/Library).

4864 * Function package: discontinued option "tailrec". INCOMPATIBILITY,

4865 use 'partial_function' instead.

4867 * Theory Library/Extended_Reals replaces now the positive extended

4868 reals found in probability theory. This file is extended by

4869 Multivariate_Analysis/Extended_Real_Limits.

4871 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,

4872 from where it must be imported explicitly if it is really required.

4873 INCOMPATIBILITY.

4875 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has

4876 been moved here. INCOMPATIBILITY.

4878 * Theory Library/Saturated provides type of numbers with saturated

4879 arithmetic.

4881 * Theory Library/Product_Lattice defines a pointwise ordering for the

4882 product type 'a * 'b, and provides instance proofs for various order

4883 and lattice type classes.

4885 * Theory Library/Countable now provides the "countable_datatype" proof

4886 method for proving "countable" class instances for datatypes.

4888 * Theory Library/Cset_Monad allows do notation for computable sets

4889 (cset) via the generic monad ad-hoc overloading facility.

4891 * Library: Theories of common data structures are split into theories

4892 for implementation, an invariant-ensuring type, and connection to an

4893 abstract type. INCOMPATIBILITY.

4895 - RBT is split into RBT and RBT_Mapping.

4896 - AssocList is split and renamed into AList and AList_Mapping.

4897 - DList is split into DList_Impl, DList, and DList_Cset.

4898 - Cset is split into Cset and List_Cset.

4900 * Theory Library/Nat_Infinity has been renamed to

4901 Library/Extended_Nat, with name changes of the following types and

4902 constants:

4904 type inat ~> type enat

4905 Fin ~> enat

4906 Infty ~> infinity (overloaded)

4907 iSuc ~> eSuc

4908 the_Fin ~> the_enat

4910 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has

4911 been renamed accordingly. INCOMPATIBILITY.

4913 * Session Multivariate_Analysis: The euclidean_space type class now

4914 fixes a constant "Basis :: 'a set" consisting of the standard

4915 orthonormal basis for the type. Users now have the option of

4916 quantifying over this set instead of using the "basis" function, e.g.

4917 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".

4919 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed

4920 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants

4921 "Cart_nth" and "Cart_lambda" have been respectively renamed to

4922 "vec_nth" and "vec_lambda"; theorems mentioning those names have

4923 changed to match. Definition theorems for overloaded constants now use

4924 the standard "foo_vec_def" naming scheme. A few other theorems have

4925 been renamed as follows (INCOMPATIBILITY):

4927 Cart_eq ~> vec_eq_iff

4928 dist_nth_le_cart ~> dist_vec_nth_le

4929 tendsto_vector ~> vec_tendstoI

4930 Cauchy_vector ~> vec_CauchyI

4932 * Session Multivariate_Analysis: Several duplicate theorems have been

4933 removed, and other theorems have been renamed or replaced with more

4934 general versions. INCOMPATIBILITY.

4936 finite_choice ~> finite_set_choice

4937 eventually_conjI ~> eventually_conj

4938 eventually_and ~> eventually_conj_iff

4939 eventually_false ~> eventually_False

4940 setsum_norm ~> norm_setsum

4941 Lim_sequentially ~> LIMSEQ_def

4942 Lim_ident_at ~> LIM_ident

4943 Lim_const ~> tendsto_const

4944 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]

4945 Lim_neg ~> tendsto_minus

4946 Lim_add ~> tendsto_add

4947 Lim_sub ~> tendsto_diff

4948 Lim_mul ~> tendsto_scaleR

4949 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]

4950 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]

4951 Lim_linear ~> bounded_linear.tendsto

4952 Lim_component ~> tendsto_euclidean_component

4953 Lim_component_cart ~> tendsto_vec_nth

4954 Lim_inner ~> tendsto_inner [OF tendsto_const]

4955 dot_lsum ~> inner_setsum_left

4956 dot_rsum ~> inner_setsum_right

4957 continuous_cmul ~> continuous_scaleR [OF continuous_const]

4958 continuous_neg ~> continuous_minus

4959 continuous_sub ~> continuous_diff

4960 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]

4961 continuous_mul ~> continuous_scaleR

4962 continuous_inv ~> continuous_inverse

4963 continuous_at_within_inv ~> continuous_at_within_inverse

4964 continuous_at_inv ~> continuous_at_inverse

4965 continuous_at_norm ~> continuous_norm [OF continuous_at_id]

4966 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]

4967 continuous_at_component ~> continuous_component [OF continuous_at_id]

4968 continuous_on_neg ~> continuous_on_minus

4969 continuous_on_sub ~> continuous_on_diff

4970 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]

4971 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]

4972 continuous_on_mul ~> continuous_on_scaleR

4973 continuous_on_mul_real ~> continuous_on_mult

4974 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]

4975 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]

4976 continuous_on_inverse ~> continuous_on_inv

4977 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus

4978 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff

4979 subset_interior ~> interior_mono

4980 subset_closure ~> closure_mono

4981 closure_univ ~> closure_UNIV

4982 real_arch_lt ~> reals_Archimedean2

4983 real_arch ~> reals_Archimedean3

4984 real_abs_norm ~> abs_norm_cancel

4985 real_abs_sub_norm ~> norm_triangle_ineq3

4986 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2

4988 * Session HOL-Probability:

4989 - Caratheodory's extension lemma is now proved for ring_of_sets.

4990 - Infinite products of probability measures are now available.

4991 - Sigma closure is independent, if the generator is independent

4992 - Use extended reals instead of positive extended

4993 reals. INCOMPATIBILITY.

4995 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.

4997 expand_fun_below ~> fun_below_iff

4998 below_fun_ext ~> fun_belowI

4999 expand_cfun_eq ~> cfun_eq_iff

5000 ext_cfun ~> cfun_eqI

5001 expand_cfun_below ~> cfun_below_iff

5002 below_cfun_ext ~> cfun_belowI

5003 monofun_fun_fun ~> fun_belowD

5004 monofun_fun_arg ~> monofunE

5005 monofun_lub_fun ~> adm_monofun [THEN admD]

5006 cont_lub_fun ~> adm_cont [THEN admD]

5007 cont2cont_Rep_CFun ~> cont2cont_APP

5008 cont_Rep_CFun_app ~> cont_APP_app

5009 cont_Rep_CFun_app_app ~> cont_APP_app_app

5010 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]

5011 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]

5012 contlub_cfun ~> lub_APP [symmetric]

5013 contlub_LAM ~> lub_LAM [symmetric]

5014 thelubI ~> lub_eqI

5015 UU_I ~> bottomI

5016 lift_distinct1 ~> lift.distinct(1)

5017 lift_distinct2 ~> lift.distinct(2)

5018 Def_not_UU ~> lift.distinct(2)

5019 Def_inject ~> lift.inject

5020 below_UU_iff ~> below_bottom_iff

5021 eq_UU_iff ~> eq_bottom_iff

5024 *** Document preparation ***

5026 * Antiquotation @{rail} layouts railroad syntax diagrams, see also

5027 isar-ref manual, both for description and actual application of the

5028 same.

5030 * Antiquotation @{value} evaluates the given term and presents its

5031 result.

5033 * Antiquotations: term style "isub" provides ad-hoc conversion of

5034 variables x1, y23 into subscripted form x\<^isub>1,

5035 y\<^isub>2\<^isub>3.

5037 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>

5038 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).

5040 * Localized \isabellestyle switch can be used within blocks or groups

5041 like this:

5043 \isabellestyle{it} %preferred default

5044 {\isabellestylett @{text "typewriter stuff"}}

5046 * Discontinued special treatment of hard tabulators. Implicit

5047 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual

5048 layouts.

5051 *** ML ***

5053 * The inner syntax of sort/type/term/prop supports inlined YXML

5054 representations within quoted string tokens. By encoding logical

5055 entities via Term_XML (in ML or Scala) concrete syntax can be

5056 bypassed, which is particularly useful for producing bits of text

5057 under external program control.

5059 * Antiquotations for ML and document preparation are managed as theory

5060 data, which requires explicit setup.

5062 * Isabelle_Process.is_active allows tools to check if the official

5063 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop

5064 (better known as Proof General).

5066 * Structure Proof_Context follows standard naming scheme. Old

5067 ProofContext is still available for some time as legacy alias.

5069 * Structure Timing provides various operations for timing; supersedes

5070 former start_timing/end_timing etc.

5072 * Path.print is the official way to show file-system paths to users

5073 (including quotes etc.).

5075 * Inner syntax: identifiers in parse trees of generic categories

5076 "logic", "aprop", "idt" etc. carry position information (disguised as

5077 type constraints). Occasional INCOMPATIBILITY with non-compliant

5078 translations that choke on unexpected type constraints. Positions can

5079 be stripped in ML translations via Syntax.strip_positions /

5080 Syntax.strip_positions_ast, or via the syntax constant

5081 "_strip_positions" within parse trees. As last resort, positions can

5082 be disabled via the configuration option Syntax.positions, which is

5083 called "syntax_positions" in Isar attribute syntax.

5085 * Discontinued special status of various ML structures that contribute

5086 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less

5087 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,

5088 refer directly to Ast.Constant, Lexicon.is_identifier,

5089 Syntax_Trans.mk_binder_tr etc.

5091 * Typed print translation: discontinued show_sorts argument, which is

5092 already available via context of "advanced" translation.

5094 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic

5095 goal states; body tactic needs to address all subgoals uniformly.

5097 * Slightly more special eq_list/eq_set, with shortcut involving

5098 pointer equality (assumes that eq relation is reflexive).

5100 * Classical tactics use proper Proof.context instead of historic types

5101 claset/clasimpset. Old-style declarations like addIs, addEs, addDs

5102 operate directly on Proof.context. Raw type claset retains its use as

5103 snapshot of the classical context, which can be recovered via

5104 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.

5105 INCOMPATIBILITY, classical tactics and derived proof methods require

5106 proper Proof.context.

5109 *** System ***

5111 * Discontinued support for Poly/ML 5.2, which was the last version

5112 without proper multithreading and TimeLimit implementation.

5114 * Discontinued old lib/scripts/polyml-platform, which has been

5115 obsolete since Isabelle2009-2.

5117 * Various optional external tools are referenced more robustly and

5118 uniformly by explicit Isabelle settings as follows:

5120 ISABELLE_CSDP (formerly CSDP_EXE)

5121 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)

5122 ISABELLE_OCAML (formerly EXEC_OCAML)

5123 ISABELLE_SWIPL (formerly EXEC_SWIPL)

5124 ISABELLE_YAP (formerly EXEC_YAP)

5126 Note that automated detection from the file-system or search path has

5127 been discontinued. INCOMPATIBILITY.

5129 * Scala layer provides JVM method invocation service for static

5130 methods of type (String)String, see Invoke_Scala.method in ML. For

5131 example:

5133 Invoke_Scala.method "java.lang.System.getProperty" "java.home"

5135 Together with YXML.string_of_body/parse_body and XML.Encode/Decode

5136 this allows to pass structured values between ML and Scala.

5138 * The IsabelleText fonts includes some further glyphs to support the

5139 Prover IDE. Potential INCOMPATIBILITY: users who happen to have

5140 installed a local copy (which is normally *not* required) need to

5141 delete or update it from ~~/lib/fonts/.

5145 New in Isabelle2011 (January 2011)

5146 ----------------------------------

5148 *** General ***

5150 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see

5151 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with

5152 useful tooltips and hyperlinks produced from its static analysis. The

5153 bundled component provides an executable Isabelle tool that can be run

5154 like this:

5156 Isabelle2011/bin/isabelle jedit

5158 * Significantly improved Isabelle/Isar implementation manual.

5160 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER

5161 (and thus refers to something like $HOME/.isabelle/Isabelle2011),

5162 while the default heap location within that directory lacks that extra

5163 suffix. This isolates multiple Isabelle installations from each

5164 other, avoiding problems with old settings in new versions.

5165 INCOMPATIBILITY, need to copy/upgrade old user settings manually.

5167 * Source files are always encoded as UTF-8, instead of old-fashioned

5168 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require

5169 the following package declarations:

5171 \usepackage[utf8]{inputenc}

5172 \usepackage{textcomp}

5174 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that

5175 a Unicode character is treated as a single symbol, not a sequence of

5176 non-ASCII bytes as before. Since Isabelle/ML string literals may

5177 contain symbols without further backslash escapes, Unicode can now be

5178 used here as well. Recall that Symbol.explode in ML provides a

5179 consistent view on symbols, while raw explode (or String.explode)

5180 merely give a byte-oriented representation.

5182 * Theory loader: source files are primarily located via the master

5183 directory of each theory node (where the .thy file itself resides).

5184 The global load path is still partially available as legacy feature.

5185 Minor INCOMPATIBILITY due to subtle change in file lookup: use

5186 explicit paths, relatively to the theory.

5188 * Special treatment of ML file names has been discontinued.

5189 Historically, optional extensions .ML or .sml were added on demand --

5190 at the cost of clarity of file dependencies. Recall that Isabelle/ML

5191 files exclusively use the .ML extension. Minor INCOMPATIBILITY.

5193 * Various options that affect pretty printing etc. are now properly

5194 handled within the context via configuration options, instead of

5195 unsynchronized references or print modes. There are both ML Config.T

5196 entities and Isar declaration attributes to access these.

5198 ML (Config.T) Isar (attribute)

5200 eta_contract eta_contract

5201 show_brackets show_brackets

5202 show_sorts show_sorts

5203 show_types show_types

5204 show_question_marks show_question_marks

5205 show_consts show_consts

5206 show_abbrevs show_abbrevs

5208 Syntax.ast_trace syntax_ast_trace

5209 Syntax.ast_stat syntax_ast_stat

5210 Syntax.ambiguity_level syntax_ambiguity_level

5212 Goal_Display.goals_limit goals_limit

5213 Goal_Display.show_main_goal show_main_goal

5215 Method.rule_trace rule_trace

5217 Thy_Output.display thy_output_display

5218 Thy_Output.quotes thy_output_quotes

5219 Thy_Output.indent thy_output_indent

5220 Thy_Output.source thy_output_source

5221 Thy_Output.break thy_output_break

5223 Note that corresponding "..._default" references in ML may only be

5224 changed globally at the ROOT session setup, but *not* within a theory.

5225 The option "show_abbrevs" supersedes the former print mode

5226 "no_abbrevs" with inverted meaning.

5228 * More systematic naming of some configuration options.

5229 INCOMPATIBILITY.

5231 trace_simp ~> simp_trace

5232 debug_simp ~> simp_debug

5234 * Support for real valued configuration options, using simplistic

5235 floating-point notation that coincides with the inner syntax for

5236 float_token.

5238 * Support for real valued preferences (with approximative PGIP type):

5239 front-ends need to accept "pgint" values in float notation.

5240 INCOMPATIBILITY.

5242 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from

5243 DejaVu Sans.

5245 * Discontinued support for Poly/ML 5.0 and 5.1 versions.

5248 *** Pure ***

5250 * Command 'type_synonym' (with single argument) replaces somewhat

5251 outdated 'types', which is still available as legacy feature for some

5252 time.

5254 * Command 'nonterminal' (with 'and' separated list of arguments)

5255 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.

5257 * Command 'notepad' replaces former 'example_proof' for

5258 experimentation in Isar without any result. INCOMPATIBILITY.

5260 * Locale interpretation commands 'interpret' and 'sublocale' accept

5261 lists of equations to map definitions in a locale to appropriate

5262 entities in the context of the interpretation. The 'interpretation'

5263 command already provided this functionality.

5265 * Diagnostic command 'print_dependencies' prints the locale instances

5266 that would be activated if the specified expression was interpreted in

5267 the current context. Variant "print_dependencies!" assumes a context

5268 without interpretations.

5270 * Diagnostic command 'print_interps' prints interpretations in proofs

5271 in addition to interpretations in theories.

5273 * Discontinued obsolete 'global' and 'local' commands to manipulate

5274 the theory name space. Rare INCOMPATIBILITY. The ML functions

5275 Sign.root_path and Sign.local_path may be applied directly where this

5276 feature is still required for historical reasons.

5278 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use

5279 'definition' instead.

5281 * The "prems" fact, which refers to the accidental collection of

5282 foundational premises in the context, is now explicitly marked as

5283 legacy feature and will be discontinued soon. Consider using "assms"

5284 of the head statement or reference facts by explicit names.

5286 * Document antiquotations @{class} and @{type} print classes and type

5287 constructors.

5289 * Document antiquotation @{file} checks file/directory entries within

5290 the local file system.

5293 *** HOL ***

5295 * Coercive subtyping: functions can be declared as coercions and type

5296 inference will add them as necessary upon input of a term. Theory

5297 Complex_Main declares real :: nat => real and real :: int => real as

5298 coercions. A coercion function f is declared like this:

5300 declare [[coercion f]]

5302 To lift coercions through type constructors (e.g. from nat => real to

5303 nat list => real list), map functions can be declared, e.g.

5305 declare [[coercion_map map]]

5307 Currently coercion inference is activated only in theories including

5308 real numbers, i.e. descendants of Complex_Main. This is controlled by

5309 the configuration option "coercion_enabled", e.g. it can be enabled in

5310 other theories like this:

5312 declare [[coercion_enabled]]

5314 * Command 'partial_function' provides basic support for recursive

5315 function definitions over complete partial orders. Concrete instances

5316 are provided for i) the option type, ii) tail recursion on arbitrary

5317 types, and iii) the heap monad of Imperative_HOL. See

5318 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy

5319 for examples.

5321 * Function package: f.psimps rules are no longer implicitly declared

5322 as [simp]. INCOMPATIBILITY.

5324 * Datatype package: theorems generated for executable equality (class

5325 "eq") carry proper names and are treated as default code equations.

5327 * Inductive package: now offers command 'inductive_simps' to

5328 automatically derive instantiated and simplified equations for

5329 inductive predicates, similar to 'inductive_cases'.

5331 * Command 'enriched_type' allows to register properties of the

5332 functorial structure of types.

5334 * Improved infrastructure for term evaluation using code generator

5335 techniques, in particular static evaluation conversions.

5337 * Code generator: Scala (2.8 or higher) has been added to the target

5338 languages.

5340 * Code generator: globbing constant expressions "*" and "Theory.*"

5341 have been replaced by the more idiomatic "_" and "Theory._".

5342 INCOMPATIBILITY.

5344 * Code generator: export_code without explicit file declaration prints

5345 to standard output. INCOMPATIBILITY.

5347 * Code generator: do not print function definitions for case

5348 combinators any longer.

5350 * Code generator: simplification with rules determined with

5351 src/Tools/Code/code_simp.ML and method "code_simp".

5353 * Code generator for records: more idiomatic representation of record

5354 types. Warning: records are not covered by ancient SML code

5355 generation any longer. INCOMPATIBILITY. In cases of need, a suitable

5356 rep_datatype declaration helps to succeed then:

5358 record 'a foo = ...

5359 ...

5360 rep_datatype foo_ext ...

5362 * Records: logical foundation type for records does not carry a

5363 '_type' suffix any longer (obsolete due to authentic syntax).

5364 INCOMPATIBILITY.

5366 * Quickcheck now by default uses exhaustive testing instead of random

5367 testing. Random testing can be invoked by "quickcheck [random]",

5368 exhaustive testing by "quickcheck [exhaustive]".

5370 * Quickcheck instantiates polymorphic types with small finite

5371 datatypes by default. This enables a simple execution mechanism to

5372 handle quantifiers and function equality over the finite datatypes.

5374 * Quickcheck random generator has been renamed from "code" to

5375 "random". INCOMPATIBILITY.

5377 * Quickcheck now has a configurable time limit which is set to 30

5378 seconds by default. This can be changed by adding [timeout = n] to the

5379 quickcheck command. The time limit for Auto Quickcheck is still set

5380 independently.

5382 * Quickcheck in locales considers interpretations of that locale for

5383 counter example search.

5385 * Sledgehammer:

5386 - Added "smt" and "remote_smt" provers based on the "smt" proof

5387 method. See the Sledgehammer manual for details ("isabelle doc

5388 sledgehammer").

5389 - Renamed commands:

5390 sledgehammer atp_info ~> sledgehammer running_provers

5391 sledgehammer atp_kill ~> sledgehammer kill_provers

5392 sledgehammer available_atps ~> sledgehammer available_provers

5393 INCOMPATIBILITY.

5394 - Renamed options:

5395 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]

5396 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]

5397 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]

5398 (and "ms" and "min" are no longer supported)

5399 INCOMPATIBILITY.

5401 * Nitpick:

5402 - Renamed options:

5403 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]

5404 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]

5405 INCOMPATIBILITY.

5406 - Added support for partial quotient types.

5407 - Added local versions of the "Nitpick.register_xxx" functions.

5408 - Added "whack" option.

5409 - Allow registration of quotient types as codatatypes.

5410 - Improved "merge_type_vars" option to merge more types.

5411 - Removed unsound "fast_descrs" option.

5412 - Added custom symmetry breaking for datatypes, making it possible to reach

5413 higher cardinalities.

5414 - Prevent the expansion of too large definitions.

5416 * Proof methods "metis" and "meson" now have configuration options

5417 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled

5418 to diagnose these tools. E.g.

5420 using [[metis_trace = true]]

5422 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available

5423 manually as command 'solve_direct'.

5425 * The default SMT solver Z3 must be enabled explicitly (due to

5426 licensing issues) by setting the environment variable

5427 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For

5428 commercial applications, the SMT solver CVC3 is provided as fall-back;

5429 changing the SMT solver is done via the configuration option

5430 "smt_solver".

5432 * Remote SMT solvers need to be referred to by the "remote_" prefix,

5433 i.e. "remote_cvc3" and "remote_z3".

5435 * Added basic SMT support for datatypes, records, and typedefs using

5436 the oracle mode (no proofs). Direct support of pairs has been dropped

5437 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT

5438 support for a similar behavior). Minor INCOMPATIBILITY.

5440 * Changed SMT configuration options:

5441 - Renamed:

5442 z3_proofs ~> smt_oracle (with inverted meaning)

5443 z3_trace_assms ~> smt_trace_used_facts

5444 INCOMPATIBILITY.

5445 - Added:

5446 smt_verbose

5447 smt_random_seed

5448 smt_datatypes

5449 smt_infer_triggers

5450 smt_monomorph_limit

5451 cvc3_options

5452 remote_cvc3_options

5453 remote_z3_options

5454 yices_options

5456 * Boogie output files (.b2i files) need to be declared in the theory

5457 header.

5459 * Simplification procedure "list_to_set_comprehension" rewrites list

5460 comprehensions applied to List.set to set comprehensions. Occasional

5461 INCOMPATIBILITY, may be deactivated like this:

5463 declare [[simproc del: list_to_set_comprehension]]

5465 * Removed old version of primrec package. INCOMPATIBILITY.

5467 * Removed simplifier congruence rule of "prod_case", as has for long

5468 been the case with "split". INCOMPATIBILITY.

5470 * String.literal is a type, but not a datatype. INCOMPATIBILITY.

5472 * Removed [split_format ... and ... and ...] version of

5473 [split_format]. Potential INCOMPATIBILITY.

5475 * Predicate "sorted" now defined inductively, with nice induction

5476 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.

5478 * Constant "contents" renamed to "the_elem", to free the generic name

5479 contents for other uses. INCOMPATIBILITY.

5481 * Renamed class eq and constant eq (for code generation) to class

5482 equal and constant equal, plus renaming of related facts and various

5483 tuning. INCOMPATIBILITY.

5485 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.

5487 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".

5488 INCOMPATIBILITY.

5490 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to

5491 avoid confusion with finite sets. INCOMPATIBILITY.

5493 * Abandoned locales equiv, congruent and congruent2 for equivalence

5494 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same

5495 for congruent(2)).

5497 * Some previously unqualified names have been qualified:

5499 types

5500 bool ~> HOL.bool

5501 nat ~> Nat.nat

5503 constants

5504 Trueprop ~> HOL.Trueprop

5505 True ~> HOL.True

5506 False ~> HOL.False

5507 op & ~> HOL.conj

5508 op | ~> HOL.disj

5509 op --> ~> HOL.implies

5510 op = ~> HOL.eq

5511 Not ~> HOL.Not

5512 The ~> HOL.The

5513 All ~> HOL.All

5514 Ex ~> HOL.Ex

5515 Ex1 ~> HOL.Ex1

5516 Let ~> HOL.Let

5517 If ~> HOL.If

5518 Ball ~> Set.Ball

5519 Bex ~> Set.Bex

5520 Suc ~> Nat.Suc

5521 Pair ~> Product_Type.Pair

5522 fst ~> Product_Type.fst

5523 snd ~> Product_Type.snd

5524 curry ~> Product_Type.curry

5525 op : ~> Set.member

5526 Collect ~> Set.Collect

5528 INCOMPATIBILITY.

5530 * More canonical naming convention for some fundamental definitions:

5532 bot_bool_eq ~> bot_bool_def

5533 top_bool_eq ~> top_bool_def

5534 inf_bool_eq ~> inf_bool_def

5535 sup_bool_eq ~> sup_bool_def

5536 bot_fun_eq ~> bot_fun_def

5537 top_fun_eq ~> top_fun_def

5538 inf_fun_eq ~> inf_fun_def

5539 sup_fun_eq ~> sup_fun_def

5541 INCOMPATIBILITY.

5543 * More stylized fact names:

5545 expand_fun_eq ~> fun_eq_iff

5546 expand_set_eq ~> set_eq_iff

5547 set_ext ~> set_eqI

5548 nat_number ~> eval_nat_numeral

5550 INCOMPATIBILITY.

5552 * Refactoring of code-generation specific operations in theory List:

5554 constants

5555 null ~> List.null

5557 facts

5558 mem_iff ~> member_def

5559 null_empty ~> null_def

5561 INCOMPATIBILITY. Note that these were not supposed to be used

5562 regularly unless for striking reasons; their main purpose was code

5563 generation.

5565 Various operations from the Haskell prelude are used for generating

5566 Haskell code.

5568 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term

5569 "surj f" is now an abbreviation of "range f = UNIV". The theorems

5570 bij_def and surj_def are unchanged. INCOMPATIBILITY.

5572 * Abolished some non-alphabetic type names: "prod" and "sum" replace

5573 "*" and "+" respectively. INCOMPATIBILITY.

5575 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write

5576 "Sum_Type.Plus" instead.

5578 * Constant "split" has been merged with constant "prod_case"; names of

5579 ML functions, facts etc. involving split have been retained so far,

5580 though. INCOMPATIBILITY.

5582 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"

5583 instead. INCOMPATIBILITY.

5585 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".

5586 INCOMPATIBILITY.

5588 * Former theory Library/Enum is now part of the HOL-Main image.

5589 INCOMPATIBILITY: all constants of the Enum theory now have to be

5590 referred to by its qualified name.

5592 enum ~> Enum.enum

5593 nlists ~> Enum.nlists

5594 product ~> Enum.product

5596 * Theory Library/Monad_Syntax provides do-syntax for monad types.

5597 Syntax in Library/State_Monad has been changed to avoid ambiguities.

5598 INCOMPATIBILITY.

5600 * Theory Library/SetsAndFunctions has been split into

5601 Library/Function_Algebras and Library/Set_Algebras; canonical names

5602 for instance definitions for functions; various improvements.

5603 INCOMPATIBILITY.

5605 * Theory Library/Multiset provides stable quicksort implementation of

5606 sort_key.

5608 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.

5609 INCOMPATIBILITY.

5611 * Session Multivariate_Analysis: introduced a type class for euclidean

5612 space. Most theorems are now stated in terms of euclidean spaces

5613 instead of finite cartesian products.

5615 types

5616 real ^ 'n ~> 'a::real_vector

5617 ~> 'a::euclidean_space

5618 ~> 'a::ordered_euclidean_space

5619 (depends on your needs)

5621 constants

5622 _ $ _ ~> _ $$ _

5623 \<chi> x. _ ~> \<chi>\<chi> x. _

5624 CARD('n) ~> DIM('a)

5626 Also note that the indices are now natural numbers and not from some

5627 finite type. Finite cartesian products of euclidean spaces, products

5628 of euclidean spaces the real and complex numbers are instantiated to

5629 be euclidean_spaces. INCOMPATIBILITY.

5631 * Session Probability: introduced pextreal as positive extended real

5632 numbers. Use pextreal as value for measures. Introduce the

5633 Radon-Nikodym derivative, product spaces and Fubini's theorem for

5634 arbitrary sigma finite measures. Introduces Lebesgue measure based on

5635 the integral in Multivariate Analysis. INCOMPATIBILITY.

5637 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.

5638 INCOMPATIBILITY.

5640 * Session SPARK (with image HOL-SPARK) provides commands to load and

5641 prove verification conditions generated by the SPARK Ada program

5642 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.

5645 *** HOL-Algebra ***

5647 * Theorems for additive ring operations (locale abelian_monoid and

5648 descendants) are generated by interpretation from their multiplicative

5649 counterparts. Names (in particular theorem names) have the mandatory

5650 qualifier 'add'. Previous theorem names are redeclared for

5651 compatibility.

5653 * Structure "int_ring" is now an abbreviation (previously a

5654 definition). This fits more natural with advanced interpretations.

5657 *** HOLCF ***

5659 * The domain package now runs in definitional mode by default: The

5660 former command 'new_domain' is now called 'domain'. To use the domain

5661 package in its original axiomatic mode, use 'domain (unsafe)'.

5662 INCOMPATIBILITY.

5664 * The new class "domain" is now the default sort. Class "predomain"

5665 is an unpointed version of "domain". Theories can be updated by

5666 replacing sort annotations as shown below. INCOMPATIBILITY.

5668 'a::type ~> 'a::countable

5669 'a::cpo ~> 'a::predomain

5670 'a::pcpo ~> 'a::domain

5672 * The old type class "rep" has been superseded by class "domain".

5673 Accordingly, users of the definitional package must remove any

5674 "default_sort rep" declarations. INCOMPATIBILITY.

5676 * The domain package (definitional mode) now supports unpointed

5677 predomain argument types, as long as they are marked 'lazy'. (Strict

5678 arguments must be in class "domain".) For example, the following

5679 domain definition now works:

5681 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")

5683 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class

5684 instances for types from main HOL: bool, nat, int, char, 'a + 'b,

5685 'a option, and 'a list. Additionally, it configures fixrec and the

5686 domain package to work with these types. For example:

5688 fixrec isInl :: "('a + 'b) u -> tr"

5689 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"

5691 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")

5693 * The "(permissive)" option of fixrec has been replaced with a

5694 per-equation "(unchecked)" option. See

5695 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.

5697 * The "bifinite" class no longer fixes a constant "approx"; the class

5698 now just asserts that such a function exists. INCOMPATIBILITY.

5700 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer

5701 defines an embedding of type 'a defl into udom by default; instances

5702 of "bifinite" and "domain" classes are available in

5703 src/HOL/HOLCF/Library/Defl_Bifinite.thy.

5705 * The syntax "REP('a)" has been replaced with "DEFL('a)".

5707 * The predicate "directed" has been removed. INCOMPATIBILITY.

5709 * The type class "finite_po" has been removed. INCOMPATIBILITY.

5711 * The function "cprod_map" has been renamed to "prod_map".

5712 INCOMPATIBILITY.

5714 * The monadic bind operator on each powerdomain has new binder syntax

5715 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents

5716 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".

5718 * The infix syntax for binary union on each powerdomain has changed

5719 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set

5720 syntax. INCOMPATIBILITY.

5722 * The constant "UU" has been renamed to "bottom". The syntax "UU" is

5723 still supported as an input translation.

5725 * Renamed some theorems (the original names are also still available).

5727 expand_fun_below ~> fun_below_iff

5728 below_fun_ext ~> fun_belowI

5729 expand_cfun_eq ~> cfun_eq_iff

5730 ext_cfun ~> cfun_eqI

5731 expand_cfun_below ~> cfun_below_iff

5732 below_cfun_ext ~> cfun_belowI

5733 cont2cont_Rep_CFun ~> cont2cont_APP

5735 * The Abs and Rep functions for various types have changed names.

5736 Related theorem names have also changed to match. INCOMPATIBILITY.

5738 Rep_CFun ~> Rep_cfun

5739 Abs_CFun ~> Abs_cfun

5740 Rep_Sprod ~> Rep_sprod

5741 Abs_Sprod ~> Abs_sprod

5742 Rep_Ssum ~> Rep_ssum

5743 Abs_Ssum ~> Abs_ssum

5745 * Lemmas with names of the form *_defined_iff or *_strict_iff have

5746 been renamed to *_bottom_iff. INCOMPATIBILITY.

5748 * Various changes to bisimulation/coinduction with domain package:

5750 - Definitions of "bisim" constants no longer mention definedness.

5751 - With mutual recursion, "bisim" predicate is now curried.

5752 - With mutual recursion, each type gets a separate coind theorem.

5753 - Variable names in bisim_def and coinduct rules have changed.

5755 INCOMPATIBILITY.

5757 * Case combinators generated by the domain package for type "foo" are

5758 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.

5760 * Several theorems have been renamed to more accurately reflect the

5761 names of constants and types involved. INCOMPATIBILITY.

5763 thelub_const ~> lub_const

5764 lub_const ~> is_lub_const

5765 thelubI ~> lub_eqI

5766 is_lub_lub ~> is_lubD2

5767 lubI ~> is_lub_lub

5768 unique_lub ~> is_lub_unique

5769 is_ub_lub ~> is_lub_rangeD1

5770 lub_bin_chain ~> is_lub_bin_chain

5771 lub_fun ~> is_lub_fun

5772 thelub_fun ~> lub_fun

5773 thelub_cfun ~> lub_cfun

5774 thelub_Pair ~> lub_Pair

5775 lub_cprod ~> is_lub_prod

5776 thelub_cprod ~> lub_prod

5777 minimal_cprod ~> minimal_prod

5778 inst_cprod_pcpo ~> inst_prod_pcpo

5779 UU_I ~> bottomI

5780 compact_UU ~> compact_bottom

5781 deflation_UU ~> deflation_bottom

5782 finite_deflation_UU ~> finite_deflation_bottom

5784 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.

5786 sq_ord_less_eq_trans ~> below_eq_trans

5787 sq_ord_eq_less_trans ~> eq_below_trans

5788 refl_less ~> below_refl

5789 trans_less ~> below_trans

5790 antisym_less ~> below_antisym

5791 antisym_less_inverse ~> po_eq_conv [THEN iffD1]

5792 box_less ~> box_below

5793 rev_trans_less ~> rev_below_trans

5794 not_less2not_eq ~> not_below2not_eq

5795 less_UU_iff ~> below_UU_iff

5796 flat_less_iff ~> flat_below_iff

5797 adm_less ~> adm_below

5798 adm_not_less ~> adm_not_below

5799 adm_compact_not_less ~> adm_compact_not_below

5800 less_fun_def ~> below_fun_def

5801 expand_fun_less ~> fun_below_iff

5802 less_fun_ext ~> fun_belowI

5803 less_discr_def ~> below_discr_def

5804 discr_less_eq ~> discr_below_eq

5805 less_unit_def ~> below_unit_def

5806 less_cprod_def ~> below_prod_def

5807 prod_lessI ~> prod_belowI

5808 Pair_less_iff ~> Pair_below_iff

5809 fst_less_iff ~> fst_below_iff

5810 snd_less_iff ~> snd_below_iff

5811 expand_cfun_less ~> cfun_below_iff

5812 less_cfun_ext ~> cfun_belowI

5813 injection_less ~> injection_below

5814 less_up_def ~> below_up_def

5815 not_Iup_less ~> not_Iup_below

5816 Iup_less ~> Iup_below

5817 up_less ~> up_below

5818 Def_inject_less_eq ~> Def_below_Def

5819 Def_less_is_eq ~> Def_below_iff

5820 spair_less_iff ~> spair_below_iff

5821 less_sprod ~> below_sprod

5822 spair_less ~> spair_below

5823 sfst_less_iff ~> sfst_below_iff

5824 ssnd_less_iff ~> ssnd_below_iff

5825 fix_least_less ~> fix_least_below

5826 dist_less_one ~> dist_below_one

5827 less_ONE ~> below_ONE

5828 ONE_less_iff ~> ONE_below_iff

5829 less_sinlD ~> below_sinlD

5830 less_sinrD ~> below_sinrD

5833 *** FOL and ZF ***

5835 * All constant names are now qualified internally and use proper

5836 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.

5839 *** ML ***

5841 * Antiquotation @{assert} inlines a function bool -> unit that raises

5842 Fail if the argument is false. Due to inlining the source position of

5843 failed assertions is included in the error output.

5845 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML

5846 text is in practice always evaluated with a stable theory checkpoint.

5847 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.

5849 * Antiquotation @{theory A} refers to theory A from the ancestry of

5850 the current context, not any accidental theory loader state as before.

5851 Potential INCOMPATIBILITY, subtle change in semantics.

5853 * Syntax.pretty_priority (default 0) configures the required priority

5854 of pretty-printed output and thus affects insertion of parentheses.

5856 * Syntax.default_root (default "any") configures the inner syntax

5857 category (nonterminal symbol) for parsing of terms.

5859 * Former exception Library.UnequalLengths now coincides with

5860 ListPair.UnequalLengths.

5862 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the

5863 main functionality is provided by structure Simplifier.

5865 * Renamed raw "explode" function to "raw_explode" to emphasize its

5866 meaning. Note that internally to Isabelle, Symbol.explode is used in

5867 almost all situations.

5869 * Discontinued obsolete function sys_error and exception SYS_ERROR.

5870 See implementation manual for further details on exceptions in

5871 Isabelle/ML.

5873 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its

5874 meaning.

5876 * Renamed structure PureThy to Pure_Thy and moved most of its

5877 operations to structure Global_Theory, to emphasize that this is

5878 rarely-used global-only stuff.

5880 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln

5881 instead (or tracing for high-volume output).

5883 * Configuration option show_question_marks only affects regular pretty

5884 printing of types and terms, not raw Term.string_of_vname.

5886 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare

5887 INCOMPATIBILITY, superseded by static antiquotations @{thm} and

5888 @{thms} for most purposes.

5890 * ML structure Unsynchronized is never opened, not even in Isar

5891 interaction mode as before. Old Unsynchronized.set etc. have been

5892 discontinued -- use plain := instead. This should be *rare* anyway,

5893 since modern tools always work via official context data, notably

5894 configuration options.

5896 * Parallel and asynchronous execution requires special care concerning

5897 interrupts. Structure Exn provides some convenience functions that

5898 avoid working directly with raw Interrupt. User code must not absorb

5899 interrupts -- intermediate handling (for cleanup etc.) needs to be

5900 followed by re-raising of the original exception. Another common

5901 source of mistakes are "handle _" patterns, which make the meaning of

5902 the program subject to physical effects of the environment.

5906 New in Isabelle2009-2 (June 2010)

5907 ---------------------------------

5909 *** General ***

5911 * Authentic syntax for *all* logical entities (type classes, type

5912 constructors, term constants): provides simple and robust

5913 correspondence between formal entities and concrete syntax. Within

5914 the parse tree / AST representations, "constants" are decorated by

5915 their category (class, type, const) and spelled out explicitly with

5916 their full internal name.

5918 Substantial INCOMPATIBILITY concerning low-level syntax declarations

5919 and translations (translation rules and translation functions in ML).

5920 Some hints on upgrading:

5922 - Many existing uses of 'syntax' and 'translations' can be replaced

5923 by more modern 'type_notation', 'notation' and 'abbreviation',

5924 which are independent of this issue.

5926 - 'translations' require markup within the AST; the term syntax

5927 provides the following special forms:

5929 CONST c -- produces syntax version of constant c from context

5930 XCONST c -- literally c, checked as constant from context

5931 c -- literally c, if declared by 'syntax'

5933 Plain identifiers are treated as AST variables -- occasionally the

5934 system indicates accidental variables via the error "rhs contains

5935 extra variables".

5937 Type classes and type constructors are marked according to their

5938 concrete syntax. Some old translations rules need to be written

5939 for the "type" category, using type constructor application

5940 instead of pseudo-term application of the default category

5941 "logic".

5943 - 'parse_translation' etc. in ML may use the following

5944 antiquotations:

5946 @{class_syntax c} -- type class c within parse tree / AST

5947 @{term_syntax c} -- type constructor c within parse tree / AST

5948 @{const_syntax c} -- ML version of "CONST c" above

5949 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)

5951 - Literal types within 'typed_print_translations', i.e. those *not*

5952 represented as pseudo-terms are represented verbatim. Use @{class

5953 c} or @{type_name c} here instead of the above syntax

5954 antiquotations.

5956 Note that old non-authentic syntax was based on unqualified base

5957 names, so all of the above "constant" names would coincide. Recall

5958 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to

5959 diagnose syntax problems.

5961 * Type constructors admit general mixfix syntax, not just infix.

5963 * Concrete syntax may be attached to local entities without a proof

5964 body, too. This works via regular mixfix annotations for 'fix',

5965 'def', 'obtain' etc. or via the explicit 'write' command, which is

5966 similar to the 'notation' command in theory specifications.

5968 * Discontinued unnamed infix syntax (legacy feature for many years) --

5969 need to specify constant name and syntax separately. Internal ML

5970 datatype constructors have been renamed from InfixName to Infix etc.

5971 Minor INCOMPATIBILITY.

5973 * Schematic theorem statements need to be explicitly markup as such,

5974 via commands 'schematic_lemma', 'schematic_theorem',

5975 'schematic_corollary'. Thus the relevance of the proof is made

5976 syntactically clear, which impacts performance in a parallel or

5977 asynchronous interactive environment. Minor INCOMPATIBILITY.

5979 * Use of cumulative prems via "!" in some proof methods has been

5980 discontinued (old legacy feature).

5982 * References 'trace_simp' and 'debug_simp' have been replaced by

5983 configuration options stored in the context. Enabling tracing (the

5984 case of debugging is similar) in proofs works via

5986 using [[trace_simp = true]]

5988 Tracing is then active for all invocations of the simplifier in

5989 subsequent goal refinement steps. Tracing may also still be enabled or

5990 disabled via the ProofGeneral settings menu.

5992 * Separate commands 'hide_class', 'hide_type', 'hide_const',

5993 'hide_fact' replace the former 'hide' KIND command. Minor

5994 INCOMPATIBILITY.

5996 * Improved parallelism of proof term normalization: usedir -p2 -q0 is

5997 more efficient than combinations with -q1 or -q2.

6000 *** Pure ***

6002 * Proofterms record type-class reasoning explicitly, using the

6003 "unconstrain" operation internally. This eliminates all sort

6004 constraints from a theorem and proof, introducing explicit

6005 OFCLASS-premises. On the proof term level, this operation is

6006 automatically applied at theorem boundaries, such that closed proofs

6007 are always free of sort constraints. INCOMPATIBILITY for tools that

6008 inspect proof terms.

6010 * Local theory specifications may depend on extra type variables that

6011 are not present in the result type -- arguments TYPE('a) :: 'a itself

6012 are added internally. For example:

6014 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"

6016 * Predicates of locales introduced by classes carry a mandatory

6017 "class" prefix. INCOMPATIBILITY.

6019 * Vacuous class specifications observe default sort. INCOMPATIBILITY.

6021 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use

6022 'class' instead.

6024 * Command 'code_reflect' allows to incorporate generated ML code into

6025 runtime environment; replaces immature code_datatype antiquotation.

6026 INCOMPATIBILITY.

6028 * Code generator: simple concept for abstract datatypes obeying

6029 invariants.

6031 * Code generator: details of internal data cache have no impact on the

6032 user space functionality any longer.

6034 * Methods "unfold_locales" and "intro_locales" ignore non-locale

6035 subgoals. This is more appropriate for interpretations with 'where'.

6036 INCOMPATIBILITY.

6038 * Command 'example_proof' opens an empty proof body. This allows to

6039 experiment with Isar, without producing any persistent result.

6041 * Commands 'type_notation' and 'no_type_notation' declare type syntax

6042 within a local theory context, with explicit checking of the

6043 constructors involved (in contrast to the raw 'syntax' versions).

6045 * Commands 'types' and 'typedecl' now work within a local theory

6046 context -- without introducing dependencies on parameters or

6047 assumptions, which is not possible in Isabelle/Pure.

6049 * Command 'defaultsort' has been renamed to 'default_sort', it works

6050 within a local theory context. Minor INCOMPATIBILITY.

6053 *** HOL ***

6055 * Command 'typedef' now works within a local theory context -- without

6056 introducing dependencies on parameters or assumptions, which is not

6057 possible in Isabelle/Pure/HOL. Note that the logical environment may

6058 contain multiple interpretations of local typedefs (with different

6059 non-emptiness proofs), even in a global theory context.

6061 * New package for quotient types. Commands 'quotient_type' and

6062 'quotient_definition' may be used for defining types and constants by

6063 quotient constructions. An example is the type of integers created by

6064 quotienting pairs of natural numbers:

6066 fun

6067 intrel :: "(nat * nat) => (nat * nat) => bool"

6068 where

6069 "intrel (x, y) (u, v) = (x + v = u + y)"

6071 quotient_type int = "nat * nat" / intrel

6072 by (auto simp add: equivp_def expand_fun_eq)

6074 quotient_definition

6075 "0::int" is "(0::nat, 0::nat)"

6077 The method "lifting" can be used to lift of theorems from the

6078 underlying "raw" type to the quotient type. The example

6079 src/HOL/Quotient_Examples/FSet.thy includes such a quotient

6080 construction and provides a reasoning infrastructure for finite sets.

6082 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid

6083 clash with new theory Quotient in Main HOL.

6085 * Moved the SMT binding into the main HOL session, eliminating

6086 separate HOL-SMT session.

6088 * List membership infix mem operation is only an input abbreviation.

6089 INCOMPATIBILITY.

6091 * Theory Library/Word.thy has been removed. Use library Word/Word.thy

6092 for future developements; former Library/Word.thy is still present in

6093 the AFP entry RSAPPS.

6095 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no

6096 longer shadowed. INCOMPATIBILITY.

6098 * Dropped theorem duplicate comp_arith; use semiring_norm instead.

6099 INCOMPATIBILITY.

6101 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.

6102 INCOMPATIBILITY.

6104 * Dropped normalizing_semiring etc; use the facts in semiring classes

6105 instead. INCOMPATIBILITY.

6107 * Dropped several real-specific versions of lemmas about floor and

6108 ceiling; use the generic lemmas from theory "Archimedean_Field"

6109 instead. INCOMPATIBILITY.

6111 floor_number_of_eq ~> floor_number_of

6112 le_floor_eq_number_of ~> number_of_le_floor

6113 le_floor_eq_zero ~> zero_le_floor

6114 le_floor_eq_one ~> one_le_floor

6115 floor_less_eq_number_of ~> floor_less_number_of

6116 floor_less_eq_zero ~> floor_less_zero

6117 floor_less_eq_one ~> floor_less_one

6118 less_floor_eq_number_of ~> number_of_less_floor

6119 less_floor_eq_zero ~> zero_less_floor

6120 less_floor_eq_one ~> one_less_floor

6121 floor_le_eq_number_of ~> floor_le_number_of

6122 floor_le_eq_zero ~> floor_le_zero

6123 floor_le_eq_one ~> floor_le_one

6124 floor_subtract_number_of ~> floor_diff_number_of

6125 floor_subtract_one ~> floor_diff_one

6126 ceiling_number_of_eq ~> ceiling_number_of

6127 ceiling_le_eq_number_of ~> ceiling_le_number_of

6128 ceiling_le_zero_eq ~> ceiling_le_zero

6129 ceiling_le_eq_one ~> ceiling_le_one

6130 less_ceiling_eq_number_of ~> number_of_less_ceiling

6131 less_ceiling_eq_zero ~> zero_less_ceiling

6132 less_ceiling_eq_one ~> one_less_ceiling

6133 ceiling_less_eq_number_of ~> ceiling_less_number_of

6134 ceiling_less_eq_zero ~> ceiling_less_zero

6135 ceiling_less_eq_one ~> ceiling_less_one

6136 le_ceiling_eq_number_of ~> number_of_le_ceiling

6137 le_ceiling_eq_zero ~> zero_le_ceiling

6138 le_ceiling_eq_one ~> one_le_ceiling

6139 ceiling_subtract_number_of ~> ceiling_diff_number_of

6140 ceiling_subtract_one ~> ceiling_diff_one

6142 * Theory "Finite_Set": various folding_XXX locales facilitate the

6143 application of the various fold combinators on finite sets.

6145 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"

6146 provides abstract red-black tree type which is backed by "RBT_Impl" as

6147 implementation. INCOMPATIBILITY.

6149 * Theory Library/Coinductive_List has been removed -- superseded by

6150 AFP/thys/Coinductive.

6152 * Theory PReal, including the type "preal" and related operations, has

6153 been removed. INCOMPATIBILITY.

6155 * Real: new development using Cauchy Sequences.

6157 * Split off theory "Big_Operators" containing setsum, setprod,

6158 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.

6160 * Theory "Rational" renamed to "Rat", for consistency with "Nat",

6161 "Int" etc. INCOMPATIBILITY.

6163 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.

6165 * New set of rules "ac_simps" provides combined assoc / commute

6166 rewrites for all interpretations of the appropriate generic locales.

6168 * Renamed theory "OrderedGroup" to "Groups" and split theory

6169 "Ring_and_Field" into theories "Rings" and "Fields"; for more

6170 appropriate and more consistent names suitable for name prefixes

6171 within the HOL theories. INCOMPATIBILITY.

6173 * Some generic constants have been put to appropriate theories:

6174 - less_eq, less: Orderings

6175 - zero, one, plus, minus, uminus, times, abs, sgn: Groups

6176 - inverse, divide: Rings

6177 INCOMPATIBILITY.

6179 * More consistent naming of type classes involving orderings (and

6180 lattices):

6182 lower_semilattice ~> semilattice_inf

6183 upper_semilattice ~> semilattice_sup

6185 dense_linear_order ~> dense_linorder

6187 pordered_ab_group_add ~> ordered_ab_group_add

6188 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs

6189 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add

6190 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le

6191 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add

6192 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring

6193 pordered_cancel_semiring ~> ordered_cancel_semiring

6194 pordered_comm_monoid_add ~> ordered_comm_monoid_add

6195 pordered_comm_ring ~> ordered_comm_ring

6196 pordered_comm_semiring ~> ordered_comm_semiring

6197 pordered_ring ~> ordered_ring

6198 pordered_ring_abs ~> ordered_ring_abs

6199 pordered_semiring ~> ordered_semiring

6201 ordered_ab_group_add ~> linordered_ab_group_add

6202 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add

6203 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add

6204 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict

6205 ordered_field ~> linordered_field

6206 ordered_field_no_lb ~> linordered_field_no_lb

6207 ordered_field_no_ub ~> linordered_field_no_ub

6208 ordered_field_dense_linear_order ~> dense_linordered_field

6209 ordered_idom ~> linordered_idom

6210 ordered_ring ~> linordered_ring

6211 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor

6212 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor

6213 ordered_ring_strict ~> linordered_ring_strict

6214 ordered_semidom ~> linordered_semidom

6215 ordered_semiring ~> linordered_semiring

6216 ordered_semiring_1 ~> linordered_semiring_1

6217 ordered_semiring_1_strict ~> linordered_semiring_1_strict

6218 ordered_semiring_strict ~> linordered_semiring_strict

6220 The following slightly odd type classes have been moved to a

6221 separate theory Library/Lattice_Algebras:

6223 lordered_ab_group_add ~> lattice_ab_group_add

6224 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs

6225 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add

6226 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add

6227 lordered_ring ~> lattice_ring

6229 INCOMPATIBILITY.

6231 * Refined field classes:

6232 - classes division_ring_inverse_zero, field_inverse_zero,

6233 linordered_field_inverse_zero include rule inverse 0 = 0 --

6234 subsumes former division_by_zero class;

6235 - numerous lemmas have been ported from field to division_ring.

6236 INCOMPATIBILITY.

6238 * Refined algebra theorem collections:

6239 - dropped theorem group group_simps, use algebra_simps instead;

6240 - dropped theorem group ring_simps, use field_simps instead;

6241 - proper theorem collection field_simps subsumes former theorem

6242 groups field_eq_simps and field_simps;

6243 - dropped lemma eq_minus_self_iff which is a duplicate for

6244 equal_neg_zero.

6245 INCOMPATIBILITY.

6247 * Theory Finite_Set and List: some lemmas have been generalized from

6248 sets to lattices:

6250 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf

6251 fun_left_comm_idem_union ~> fun_left_comm_idem_sup

6252 inter_Inter_fold_inter ~> inf_Inf_fold_inf

6253 union_Union_fold_union ~> sup_Sup_fold_sup

6254 Inter_fold_inter ~> Inf_fold_inf

6255 Union_fold_union ~> Sup_fold_sup

6256 inter_INTER_fold_inter ~> inf_INFI_fold_inf

6257 union_UNION_fold_union ~> sup_SUPR_fold_sup

6258 INTER_fold_inter ~> INFI_fold_inf

6259 UNION_fold_union ~> SUPR_fold_sup

6261 * Theory "Complete_Lattice": lemmas top_def and bot_def have been

6262 replaced by the more convenient lemmas Inf_empty and Sup_empty.

6263 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed

6264 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace

6265 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right

6266 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.

6268 * Reorganized theory Multiset: swapped notation of pointwise and

6269 multiset order:

6271 - pointwise ordering is instance of class order with standard syntax

6272 <= and <;

6273 - multiset ordering has syntax <=# and <#; partial order properties

6274 are provided by means of interpretation with prefix

6275 multiset_order;