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

NEWS

author | wenzelm |

Sat Jan 09 12:58:57 2016 +0100 (2016-01-09 ago) | |

changeset 62108 | 0046bacc5f5b |

parent 62107 | f74a33b14200 |

child 62109 | d65f80949ff1 |

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

\<struct> loses its rendering and is superseded by \<diamondop>;

tuned;

tuned;

1 Isabelle NEWS -- history of user-relevant changes

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

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

7 New in Isabelle2016 (February 2016)

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

10 *** General ***

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

13 without any special print mode. Important ASCII replacement syntax

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

15 has been removed (see below).

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

18 Isabelle fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>

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

21 context has been discontinued. Rare INCOMPATIBILITY, use explicit

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

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

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

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

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

28 meaning.

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

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

32 to update old sources.

34 * Toplevel theorem statements have been simplified as follows:

36 theorems ~> lemmas

37 schematic_lemma ~> schematic_goal

38 schematic_theorem ~> schematic_goal

39 schematic_corollary ~> schematic_goal

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

42 accordingly.

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

45 'theorem'.

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

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

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

52 and commands 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

53 'SML_file_no_debug' control compilation of sources with debugging

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

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

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

57 running ML program.

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

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

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

62 update.

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

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

66 enable option "editor_output_state".

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

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

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

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

72 visibility.

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

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

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

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

78 panel.

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

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

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

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

85 implicit: a popup will show up unconditionally.

87 * Additional abbreviations for syntactic completion may be specified in

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

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

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

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

93 the editor.

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

96 instead of former C+e LEFT.

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

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

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

101 instead.

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

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

105 single-instance applications seen on common GUI desktops.

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

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

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

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

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

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

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

118 *** Document preparation ***

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

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

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

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

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

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

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

129 follows:

131 \<^item> itemize

132 \<^enum> enumerate

133 \<^descr> description

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

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

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

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

139 standard Isabelle fonts provide glyphs to render important control

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

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

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

144 standard LaTeX macros of the same names.

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

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

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

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

150 cartouche tokens seen in theory sources.

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

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

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

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

156 or terminal spaces are ignored.

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

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

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

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

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

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

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

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

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

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

172 documentation, with a hyperlink in the Prover IDE.

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

175 entities of the Isar language.

177 * HTML presentation uses the standard IsabelleText font and Unicode

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

179 print mode "HTML" loses its special meaning.

182 *** Isar ***

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

185 rule statements like fixes/assumes/shows in theorem specifications, but

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

187 example:

189 have result: "C x y"

190 if "A x" and "B y"

191 for x :: 'a and y :: 'a

192 <proof>

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

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

196 corresponds to a raw proof block like this:

198 {

199 fix x :: 'a and y :: 'a

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

201 have "C x y" <proof>

202 }

203 note result = this

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

206 instead of 'assume' above.

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

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

211 assume result: "C x y"

212 if "A x" and "B y"

213 for x :: 'a and y :: 'a

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

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

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

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

220 example:

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

224 is equivalent to:

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

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

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

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

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

234 or:

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

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

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

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

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

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

245 of the local context elements yet.

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

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

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

251 then have something

252 proof cases

253 case a

254 then show ?thesis <proof>

255 next

256 case b

257 then show ?thesis <proof>

258 next

259 case c

260 then show ?thesis <proof>

261 qed

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

265 case a: (c xs)

266 case a [attributes]: (c xs)

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

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

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

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

272 and always put attributes in front.

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

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

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

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

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

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

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

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

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

285 supply [simp] = a

286 proof

287 show A by simp

288 next

289 show A by simp

290 qed

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

293 proof body as well, abstracted over relevant parameters.

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

296 parameter scope for of each clause.

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

299 statements: result is abstracted over unknowns.

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

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

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

304 manual.

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

307 ('apply' scripts).

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

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

311 example:

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

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

315 proof goal_cases

316 case (1 x)

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

318 next

319 case (2 y z)

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

321 qed

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

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

325 proof goal_cases

326 case prems: 1

327 then show ?case using prems sorry

328 next

329 case prems: 2

330 then show ?case using prems sorry

331 qed

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

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

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

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

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

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

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

342 occasionally useful for demonstration and testing purposes.

345 *** Pure ***

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

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

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

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

352 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

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

355 * More gentle suppression of syntax along locale morphisms while

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

357 would be suppressed for morphisms except term identity. Now

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

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

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

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

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

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

365 begin

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

367 end

369 locale morphism =

370 left: struct composition + right: struct composition'

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

372 begin

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

374 end

376 * Command 'global_interpretation' issues interpretations into global

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

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

380 'defines'.

382 * Command 'permanent_interpretation' has been discontinued. Use

383 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

385 * Command 'print_definitions' prints dependencies of definitional

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

388 * Configuration option rule_insts_schematic has been discontinued

389 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

391 * Abbreviations in type classes now carry proper sort constraint.

392 Rare INCOMPATIBILITY in situations where the previous misbehaviour

393 has been exploited.

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

396 operations behave more similar to abbreviations. Potential

397 INCOMPATIBILITY in exotic situations.

400 *** HOL ***

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

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

404 global collection of overloaded constant / type definitions into

405 account. Type definitions with open dependencies on overloaded

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

407 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

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

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

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

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

413 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

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

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

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

418 simplify porting old theories:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

447 INCOMPATIBILITY, use plain "::" instead.

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

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

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

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

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

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

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

457 definition and its monotonicity result. Rare INCOMPATIBILITY.

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

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

461 "function_internals" is enabled. Rare INCOMPATIBILITY.

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

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

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

466 INCOMPATIBILITY.

468 * Combinator to represent case distinction on products is named

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

470 theorem aliasses have been retained.

472 Consolidated facts:

473 PairE ~> prod.exhaust

474 Pair_eq ~> prod.inject

475 pair_collapse ~> prod.collapse

476 Pair_fst_snd_eq ~> prod_eq_iff

477 split_twice ~> prod.case_distrib

478 split_weak_cong ~> prod.case_cong_weak

479 split_split ~> prod.split

480 split_split_asm ~> prod.split_asm

481 splitI ~> case_prodI

482 splitD ~> case_prodD

483 splitI2 ~> case_prodI2

484 splitI2' ~> case_prodI2'

485 splitE ~> case_prodE

486 splitE' ~> case_prodE'

487 split_pair ~> case_prod_Pair

488 split_eta ~> case_prod_eta

489 split_comp ~> case_prod_comp

490 mem_splitI ~> mem_case_prodI

491 mem_splitI2 ~> mem_case_prodI2

492 mem_splitE ~> mem_case_prodE

493 The_split ~> The_case_prod

494 cond_split_eta ~> cond_case_prod_eta

495 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

496 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

497 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

498 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

499 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

500 Domain_Collect_split ~> Domain_Collect_case_prod

501 Image_Collect_split ~> Image_Collect_case_prod

502 Range_Collect_split ~> Range_Collect_case_prod

503 Eps_split ~> Eps_case_prod

504 Eps_split_eq ~> Eps_case_prod_eq

505 split_rsp ~> case_prod_rsp

506 curry_split ~> curry_case_prod

507 split_curry ~> case_prod_curry

509 Changes in structure HOLogic:

510 split_const ~> case_prod_const

511 mk_split ~> mk_case_prod

512 mk_psplits ~> mk_ptupleabs

513 strip_psplits ~> strip_ptupleabs

515 INCOMPATIBILITY.

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

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

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

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

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

523 Consolidated facts (among others):

524 real_of_nat_le_iff -> of_nat_le_iff

525 real_of_nat_numeral of_nat_numeral

526 real_of_int_zero of_int_0

527 real_of_nat_zero of_nat_0

528 real_of_one of_int_1

529 real_of_int_add of_int_add

530 real_of_nat_add of_nat_add

531 real_of_int_diff of_int_diff

532 real_of_nat_diff of_nat_diff

533 floor_subtract floor_diff_of_int

534 real_of_int_inject of_int_eq_iff

535 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

536 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

537 real_of_nat_ge_zero of_nat_0_le_iff

538 real_of_int_ceiling_ge le_of_int_ceiling

539 ceiling_less_eq ceiling_less_iff

540 ceiling_le_eq ceiling_le_iff

541 less_floor_eq less_floor_iff

542 floor_less_eq floor_less_iff

543 floor_divide_eq_div floor_divide_of_int_eq

544 real_of_int_zero_cancel of_nat_eq_0_iff

545 ceiling_real_of_int ceiling_of_int

547 INCOMPATIBILITY.

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

550 been removed. INCOMPATIBILITY.

552 * Quickcheck setup for finite sets.

554 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

556 * Sledgehammer:

557 - The MaSh relevance filter has been sped up.

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

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

560 - Auto Sledgehammer now minimizes and preplays the results.

561 - Handle Vampire 4.0 proof output without raising exception.

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

563 Isabelle/jEdit instead. INCOMPATIBILITY.

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

566 * Nitpick:

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

568 - Fixed soundness bug in "destroy_constrs" optimization.

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

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

571 - Eliminated obsolete "blocking" option.

573 * (Co)datatype package:

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

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

576 - Always generate "case_transfer" theorem.

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

578 being defined.

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

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

582 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

583 'transfer_prover_start' and 'transfer_prover_end'.

585 * Division on integers is bootstrapped directly from division on

586 naturals and uses generic numeral algorithm for computations. Slight

587 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

588 simprocs binary_int_div and binary_int_mod

590 * Tightened specification of class semiring_no_zero_divisors. Minor

591 INCOMPATIBILITY.

593 * Class algebraic_semidom introduces common algebraic notions of

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

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

596 fields with notions that are trivial there.

598 * Class normalization_semidom specifies canonical representants for

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

600 This formalizes associated elements as well.

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

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

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

605 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

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

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

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

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

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

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

613 during instantiation.

615 * New cancellation simprocs for boolean algebras to cancel complementary

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

617 "top". INCOMPATIBILITY.

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

621 * Library/Multiset:

622 - Renamed multiset inclusion operators:

623 < ~> <#

624 \<subset> ~> \<subset>#

625 <= ~> <=#

626 \<le> ~> \<le>#

627 \<subseteq> ~> \<subseteq>#

628 INCOMPATIBILITY.

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

630 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

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

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

633 are now available through the "subset_mset" interpretation

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

635 INCOMPATIBILITY.

636 - Renamed conversions:

637 multiset_of ~> mset

638 multiset_of_set ~> mset_set

639 set_of ~> set_mset

640 INCOMPATIBILITY

641 - Renamed lemmas:

642 mset_le_def ~> subseteq_mset_def

643 mset_less_def ~> subset_mset_def

644 less_eq_multiset.rep_eq ~> subseteq_mset_def

645 INCOMPATIBILITY

646 - Removed lemmas generated by lift_definition:

647 less_eq_multiset.abs_eq, less_eq_multiset.rsp less_eq_multiset.transfer

648 less_eq_multiset_def

649 INCOMPATIBILITY

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

653 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

654 Bourbaki-Witt fixpoint theorem for increasing functions in

655 chain-complete partial orders.

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

658 Minor INCOMPATIBILITY, use 'function' instead.

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

661 periodic functions.

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

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

665 GCD.

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

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

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

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

673 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

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

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

676 Theorem of Algebra. Ported from HOL Light.

678 * HOL-Multivariate_Analysis: topological concepts such as connected

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

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

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

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

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

685 properties.

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

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

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

691 structures.

694 *** ML ***

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

697 system are available:

699 profile_time (*CPU time*)

700 profile_time_thread (*CPU time on this thread*)

701 profile_allocations (*overall heap allocations*)

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

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

706 Isar proof method.

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

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

710 breaks.

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

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

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

716 * Simproc programming interfaces have been simplified:

717 Simplifier.make_simproc and Simplifier.define_simproc supersede various

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

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

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

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

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

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

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

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

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

731 Old cterm_instantiate is superseded by infer_instantiate.

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

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

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

736 instead (with proper context).

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

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

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

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

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

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

745 the proof context discipline.

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

748 context_tactic, which allows to change the proof context dynamically

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

750 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

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

754 *** System ***

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

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

759 conflations:

761 hence ~> then have

762 thus ~> then show

764 This syntax is more orthogonal and improves readability and

765 maintainability of proofs.

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

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

769 performance.

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

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

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

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

777 space.

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

780 platforms as follows.

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

783 associated with the main app bundle

785 - isabelle jedit: settings

786 JEDIT_JAVA_SYSTEM_OPTIONS

787 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

789 - isabelle build: settings

790 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

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

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

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

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

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

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

800 is required after change.

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

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

807 New in Isabelle2015 (May 2015)

808 ------------------------------

810 *** General ***

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

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

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

816 context

817 begin

819 private definition ...

820 private lemma ...

822 qualified definition ...

823 qualified lemma ...

825 lemma ...

826 theorem ...

828 end

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

831 naming policy.

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

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

835 INCOMPATIBILITY, use 'sorry' instead.

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

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

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

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

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

843 schematically expanded before search. Search results match the naive

844 expectation more closely, particularly wrt. abbreviations.

845 INCOMPATIBILITY.

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

848 theory context.

850 * Outer syntax commands are managed authentically within the theory

851 context, without implicit global state. Potential for accidental

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

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

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

856 update_semicolons" to remove obsolete semicolons from old theory

857 sources.

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

860 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

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

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

864 method provides basic fact/term matching in addition to

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

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

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

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

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

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

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

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

877 option jedit_structure_limit determines maximum number of lines to scan

878 in the buffer.

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

881 marker, SideKick parser.

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

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

885 the editor (hyperlinks, completion etc.).

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

888 Options / Text Area).

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

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

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

894 restrict the visualized hierarchy.

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

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

900 *** Document preparation ***

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

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

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

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

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

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

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

909 update_header"). Minor INCOMPATIBILITY.

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

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

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

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

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

917 style.

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

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

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

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

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

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

926 tags. Potential INCOMPATIBILITY in exotic situations.

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

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

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

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

932 dynamically in GUI front-ends. Implementations of document

933 antiquotations need to observe the margin explicitly according to

934 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

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

937 mandatory for document preparation. The legacy mode with implicit

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

939 INCOMPATIBILITY.

942 *** Pure ***

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

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

946 these variables become schematic in the instantiated theorem; this

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

948 Configuration option rule_insts_schematic (default false) controls use

949 of schematic variables outside the context. Minor INCOMPATIBILITY,

950 declare rule_insts_schematic = true temporarily and update to use local

951 variable declarations or dummy patterns instead.

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

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

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

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

958 incremented to avoid material in the proof context. Rare

959 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

960 different index.

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

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

964 of numeral signs, particularly in expressions involving infix syntax

965 like "(- 1) ^ n".

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

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

969 token category instead.

972 *** HOL ***

974 * New (co)datatype package:

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

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

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

978 'isabelle doc datatypes' for information on porting.

979 INCOMPATIBILITY.

980 - Renamed theorems:

981 disc_corec ~> corec_disc

982 disc_corec_iff ~> corec_disc_iff

983 disc_exclude ~> distinct_disc

984 disc_exhaust ~> exhaust_disc

985 disc_map_iff ~> map_disc_iff

986 sel_corec ~> corec_sel

987 sel_exhaust ~> exhaust_sel

988 sel_map ~> map_sel

989 sel_set ~> set_sel

990 sel_split ~> split_sel

991 sel_split_asm ~> split_sel_asm

992 strong_coinduct ~> coinduct_strong

993 weak_case_cong ~> case_cong_weak

994 INCOMPATIBILITY.

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

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

997 INCOMPATIBILITY.

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

999 consequences of other set rules "by auto".

1000 INCOMPATIBILITY.

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

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

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

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

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

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

1007 INCOMPATIBILITY.

1008 - Renamed theories:

1009 BNF_Comp ~> BNF_Composition

1010 BNF_FP_Base ~> BNF_Fixpoint_Base

1011 BNF_GFP ~> BNF_Greatest_Fixpoint

1012 BNF_LFP ~> BNF_Least_Fixpoint

1013 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

1014 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

1015 INCOMPATIBILITY.

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

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

1018 Lifting_Product and Lifting_Option from Main became obsolete and

1019 were removed. Changed definitions of the relators rel_prod and

1020 rel_sum (using inductive).

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

1022 of rel_prod_def and rel_sum_def.

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

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

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

1026 constructors, case combinators, discriminators, selectors and

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

1028 rules.

1030 * Old datatype package:

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

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

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

1034 'isabelle doc datatypes' for information on porting.

1035 INCOMPATIBILITY.

1036 - Renamed theorems:

1037 weak_case_cong ~> case_cong_weak

1038 INCOMPATIBILITY.

1039 - Renamed theory:

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

1041 INCOMPATIBILITY.

1043 * Nitpick:

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

1045 operations.

1047 * Sledgehammer:

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

1049 default.

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

1051 source. The "z3_non_commercial" option is discontinued.

1052 - Minimization is now always enabled by default.

1053 Removed sub-command:

1054 min

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

1056 dramatically improved.

1057 - Improved support for CVC4 and veriT.

1059 * Old and new SMT modules:

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

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

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

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

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

1065 point to it.

1066 INCOMPATIBILITY.

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

1068 INCOMPATIBILITY.

1069 - New option 'smt_reconstruction_step_timeout' to limit the

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

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

1072 method, especially runtime statistics of Z3 proof reconstruction.

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

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

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

1077 lifting, and avoids tedious workarounds.

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

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

1081 Minor INCOMPATIBILITY.

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

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

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

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

1088 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

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

1091 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

1093 * Class linordered_semidom really requires no zero divisors.

1094 INCOMPATIBILITY.

1096 * Classes division_ring, field and linordered_field always demand

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

1098 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

1100 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

1101 additive inverse operation. INCOMPATIBILITY.

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

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

1105 INCOMPATIBILITY: type constraints may be necessary.

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

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

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

1110 needed.

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

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

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

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

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

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

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

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

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

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

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

1125 "nat_floor"/"nat_ceiling".

1127 * Qualified some duplicated fact names required for boostrapping the

1128 type class hierarchy:

1129 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

1130 field_inverse_zero ~> inverse_zero

1131 field_divide_inverse ~> divide_inverse

1132 field_inverse ~> left_inverse

1133 Minor INCOMPATIBILITY.

1135 * Eliminated fact duplicates:

1136 mult_less_imp_less_right ~> mult_right_less_imp_less

1137 mult_less_imp_less_left ~> mult_left_less_imp_less

1138 Minor INCOMPATIBILITY.

1140 * Fact consolidation: even_less_0_iff is subsumed by

1141 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

1143 * Generalized and consolidated some theorems concerning divsibility:

1144 dvd_reduce ~> dvd_add_triv_right_iff

1145 dvd_plus_eq_right ~> dvd_add_right_iff

1146 dvd_plus_eq_left ~> dvd_add_left_iff

1147 Minor INCOMPATIBILITY.

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

1150 and part of theory Main.

1151 even_def ~> even_iff_mod_2_eq_zero

1152 INCOMPATIBILITY.

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

1155 INCOMPATIBILITY.

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

1158 Fact rename:

1159 listsum_def ~> listsum.eq_foldr

1160 INCOMPATIBILITY.

1162 * Product over lists via constant "listprod".

1164 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

1165 Cons_nth_drop_Suc.

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

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

1169 HOL/Codegenerator_Test/Code_Test* for examples.

1171 * Library/Multiset:

1172 - Introduced "replicate_mset" operation.

1173 - Introduced alternative characterizations of the multiset ordering in

1174 "Library/Multiset_Order".

1175 - Renamed multiset ordering:

1176 <# ~> #<#

1177 <=# ~> #<=#

1178 \<subset># ~> #\<subset>#

1179 \<subseteq># ~> #\<subseteq>#

1180 INCOMPATIBILITY.

1181 - Introduced abbreviations for ill-named multiset operations:

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

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

1184 INCOMPATIBILITY.

1185 - Renamed

1186 in_multiset_of ~> in_multiset_in_set

1187 Multiset.fold ~> fold_mset

1188 Multiset.filter ~> filter_mset

1189 INCOMPATIBILITY.

1190 - Removed mcard, is equal to size.

1191 - Added attributes:

1192 image_mset.id [simp]

1193 image_mset_id [simp]

1194 elem_multiset_of_set [simp, intro]

1195 comp_fun_commute_plus_mset [simp]

1196 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

1197 in_mset_fold_plus_iff [iff]

1198 set_of_Union_mset [simp]

1199 in_Union_mset_iff [iff]

1200 INCOMPATIBILITY.

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

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

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

1205 argument. Minor INCOMPATIBILITY.

1207 * HOL-Decision_Procs: New counterexample generator quickcheck

1208 [approximation] for inequalities of transcendental functions. Uses

1209 hardware floating point arithmetic to randomly discover potential

1210 counterexamples. Counterexamples are certified with the "approximation"

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

1212 examples.

1214 * HOL-Probability: Reworked measurability prover

1215 - applies destructor rules repeatedly

1216 - removed application splitting (replaced by destructor rule)

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

1218 projection

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

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

1224 *** ML ***

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

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

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

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

1230 contemporary applications use the strict Name_Space.check (and

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

1232 INCOMPATIBILITY in rare applications of Name_Space.intern.

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

1235 ERROR instead of internal Toplevel.UNDEF.

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

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

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

1241 INCOMPATIBILITY.

1243 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

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

1245 Multithreading.synchronized and its high-level derivative

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

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

1248 nested.

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

1251 change of semantics with minimal potential for INCOMPATIBILITY.

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

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

1255 available as Thm.global_ctyp_of and Thm.global_cterm_of.

1256 INCOMPATIBILITY.

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

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

1260 Thm.term_of etc.

1262 * Proper context for various elementary tactics: assume_tac,

1263 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

1264 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

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

1267 PARALLEL_GOALS.

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

1270 which also allows to specify a fork priority.

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

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

1274 markup). Minor INCOMPATIBILITY.

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

1277 Input.source (with formal position information).

1280 *** System ***

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

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

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

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

1288 be externally triggered using an appropriate ROOT file plus a

1289 corresponding theory. Parametrization is possible using environment

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

1291 INCOMPATIBILITY.

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

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

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

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

1298 menu Global Options / Appearance.

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

1301 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

1305 New in Isabelle2014 (August 2014)

1306 ---------------------------------

1308 *** General ***

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

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

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

1313 environment is restricted to the Standard ML implementation of

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

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

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

1317 some examples.

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

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

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

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

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

1324 restore the previous behavior. INCOMPATIBILITY, especially where

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

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

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

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

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

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

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

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

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

1335 exception. Potential INCOMPATIBILITY for non-conformant tactical

1336 proof tools.

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

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

1340 supports input via ` (backquote).

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

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

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

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

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

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

1349 Minor INCOMPATIBILITY.

1351 * Discontinued legacy_isub_isup, which was a temporary workaround for

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

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

1354 INCOMPATIBILITY.

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

1357 which results in an active hyperlink within the text.

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

1360 not check existence within the file-system.

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

1363 isar-ref, jedit, system.

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

1368 * Improved Document panel: simplified interaction where every single

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

1370 buffer.

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

1373 to PIDE hyperlinks.

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

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

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

1379 auxiliary ML files.

1381 * Improved syntactic and semantic completion mechanism, with simple

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

1383 file-name completion, spell-checker completion.

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

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

1387 keystrokes with slow / remote graphics displays.

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

1390 item, depending on Isabelle options.

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

1393 selections, rectangular selections, rectangular selection as "tall

1394 caret".

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

1397 completion popup and context-menu.

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

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

1401 operations for the context. Minor incompatibility in keyboard

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

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

1405 to highlight text via regular expression.

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

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

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

1410 "isabelle jedit -m MODE".

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

1413 networking operations instead of jEdit virtual file-systems.

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

1416 imports) are automatically removed from the document model.

1418 * Improved monitor panel.

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

1421 more robust treatment of threads and interrupts.

1423 * Improved management of dockable windows: clarified keyboard focus

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

1425 "Detach" a copy where this makes sense.

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

1428 simplification process, enabled by the "simp_trace_new" attribute

1429 within the context.

1432 *** Pure ***

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

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

1436 that is not immediately visible. INCOMPATIBILITY, use regular

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

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

1439 finished trivially if the underlying class definition is made vacuous

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

1441 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

1442 Axclass.arity_axiomatization.

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

1445 qualified. Rare INCOMPATIBILITY, but with potentially serious

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

1447 renaming needs to be applied:

1449 == ~> Pure.eq

1450 ==> ~> Pure.imp

1451 all ~> Pure.all

1452 TYPE ~> Pure.type

1453 dummy_pattern ~> Pure.dummy_pattern

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

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

1457 old constants:

1459 setup {*

1460 fn thy => thy

1461 |> Sign.root_path

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

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

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

1465 |> Sign.restore_naming thy

1466 *}

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

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

1470 the auxiliary aliases are deleted.

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

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

1474 instantiated theorem.

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

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

1478 where instantiations with schematic variables are intended (for

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

1480 following temporary definition may help to port old applications:

1482 attribute_setup standard =

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

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

1486 attributed fact expressions (concerning background theory, declared

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

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

1489 primitive Thm.assume_hyps.

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

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

1493 differently, e.g. via cartouches).

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

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

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

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

1502 *** HOL ***

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

1505 language requirements. INCOMPATIBILITY.

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

1508 INCOMPATIBILITY.

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

1511 INCOMPATIBILITY.

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

1514 option. Minor INCOMPATIBILITY.

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

1517 INCOMPATIBILITY.

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

1520 with the given constants.

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

1523 operations on records.

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

1526 ML. Minor INCOMPATIBILITY.

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

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

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

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

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

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

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

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

1539 again in the future. INCOMPATIBILITY.

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

1542 spurious crashes and other surprises. Potential INCOMPATIBILITY.

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

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

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

1547 part of theory "Main".

1549 Theory renamings:

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

1551 Library/Wfrec.thy ~> Wfrec.thy

1552 Library/Zorn.thy ~> Zorn.thy

1553 Cardinals/Order_Relation.thy ~> Order_Relation.thy

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

1555 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

1556 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

1557 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

1558 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

1559 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

1560 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

1561 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

1562 BNF/BNF_Comp.thy ~> BNF_Comp.thy

1563 BNF/BNF_Def.thy ~> BNF_Def.thy

1564 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

1565 BNF/BNF_GFP.thy ~> BNF_GFP.thy

1566 BNF/BNF_LFP.thy ~> BNF_LFP.thy

1567 BNF/BNF_Util.thy ~> BNF_Util.thy

1568 BNF/Coinduction.thy ~> Coinduction.thy

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

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

1571 BNF/Examples/* ~> BNF_Examples/*

1573 New theories:

1574 Wellorder_Extension.thy (split from Zorn.thy)

1575 Library/Cardinal_Notations.thy

1576 Library/BNF_Axomatization.thy

1577 BNF_Examples/Misc_Primcorec.thy

1578 BNF_Examples/Stream_Processor.thy

1580 Discontinued theories:

1581 BNF/BNF.thy

1582 BNF/Equiv_Relations_More.thy

1584 INCOMPATIBILITY.

1586 * New (co)datatype package:

1587 - Command 'primcorec' is fully implemented.

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

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

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

1591 (co)datatypes with Transfer.

1592 - Renamed commands:

1593 datatype_new_compat ~> datatype_compat

1594 primrec_new ~> primrec

1595 wrap_free_constructors ~> free_constructors

1596 INCOMPATIBILITY.

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

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

1599 INCOMPATIBILITY.

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

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

1602 using "prim(co)rec".

1603 INCOMPATIBILITY.

1604 - No discriminators are generated for nullary constructors by

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

1606 INCOMPATIBILITY.

1607 - No discriminators or selectors are generated by default by

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

1609 "discs_sels" option is passed.

1610 INCOMPATIBILITY.

1612 * Old datatype package:

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

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

1615 "sum.case"). INCOMPATIBILITY.

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

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

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

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

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

1622 BNF-based datatype package.

1624 Renamed constants:

1625 Option.set ~> set_option

1626 Option.map ~> map_option

1627 option_rel ~> rel_option

1629 Renamed theorems:

1630 set_def ~> set_rec[abs_def]

1631 map_def ~> map_rec[abs_def]

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

1633 option.recs ~> option.rec

1634 list_all2_def ~> list_all2_iff

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

1636 map.simps ~> list.map

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

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

1639 the.simps ~> option.sel

1641 INCOMPATIBILITY.

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

1644 sum_map ~> map_sum

1645 map_pair ~> map_prod

1646 prod_rel ~> rel_prod

1647 sum_rel ~> rel_sum

1648 fun_rel ~> rel_fun

1649 set_rel ~> rel_set

1650 filter_rel ~> rel_filter

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

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

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

1655 INCOMPATIBILITY.

1657 * Lifting and Transfer:

1658 - a type variable as a raw type is supported

1659 - stronger reflexivity prover

1660 - rep_eq is always generated by lift_definition

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

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

1663 + relator_eq, relator_mono, relator_distr, relator_domain,

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

1665 right_unique, right_total, left_unique, left_total are proved

1666 automatically

1667 + definition of a predicator is generated automatically

1668 + simplification rules for a predicator definition are proved

1669 automatically for datatypes

1670 - consolidation of the setup of Lifting/Transfer

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

1672 more

1673 Minor INCOMPATIBILITY.

1674 + left_total and left_unique rules are now transfer rules

1675 (reflexivity_rule attribute not needed anymore)

1676 INCOMPATIBILITY.

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

1678 relator_domain theorems (=> more natural statement)

1679 INCOMPATIBILITY.

1680 - registration of code equations is more robust

1681 Potential INCOMPATIBILITY.

1682 - respectfulness proof obligation is preprocessed to a more readable

1683 form

1684 Potential INCOMPATIBILITY.

1685 - eq_onp is always unfolded in respectfulness proof obligation

1686 Potential INCOMPATIBILITY.

1687 - unregister lifting setup for Code_Numeral.integer and

1688 Code_Numeral.natural

1689 Potential INCOMPATIBILITY.

1690 - Lifting.invariant -> eq_onp

1691 INCOMPATIBILITY.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1710 Plugin Options / Isabelle / General.

1712 * Sledgehammer:

1713 - Z3 can now produce Isar proofs.

1714 - MaSh overhaul:

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

1716 Python and increase performance and reliability.

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

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

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

1720 Options / Isabelle / General to "none".

1721 - New option:

1722 smt_proofs

1723 - Renamed options:

1724 isar_compress ~> compress

1725 isar_try0 ~> try0

1727 INCOMPATIBILITY.

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

1731 * Nitpick:

1732 - Fixed soundness bug whereby mutually recursive datatypes could

1733 take infinite values.

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

1735 "Abs_Integ" and "Rep_Integ".

1736 - Removed "std" option.

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

1738 "hide_types".

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

1741 (full_types)' instead. INCOMPATIBILITY.

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

1745 * Adjustion of INF and SUP operations:

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

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

1748 SUP instead uniformly.

1749 - More aggressive normalization of expressions involving INF and Inf

1750 or SUP and Sup.

1751 - INF_image and SUP_image do not unfold composition.

1752 - Dropped facts INF_comp, SUP_comp.

1753 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

1754 simplifier implication in premises. Generalize and replace former

1755 INT_cong, SUP_cong

1757 INCOMPATIBILITY.

1759 * SUP and INF generalized to conditionally_complete_lattice.

1761 * Swapped orientation of facts image_comp and vimage_comp:

1763 image_compose ~> image_comp [symmetric]

1764 image_comp ~> image_comp [symmetric]

1765 vimage_compose ~> vimage_comp [symmetric]

1766 vimage_comp ~> vimage_comp [symmetric]

1768 INCOMPATIBILITY.

1770 * Theory reorganization: split of Big_Operators.thy into

1771 Groups_Big.thy and Lattices_Big.thy.

1773 * Consolidated some facts about big group operators:

1775 setsum_0' ~> setsum.neutral

1776 setsum_0 ~> setsum.neutral_const

1777 setsum_addf ~> setsum.distrib

1778 setsum_cartesian_product ~> setsum.cartesian_product

1779 setsum_cases ~> setsum.If_cases

1780 setsum_commute ~> setsum.commute

1781 setsum_cong ~> setsum.cong

1782 setsum_delta ~> setsum.delta

1783 setsum_delta' ~> setsum.delta'

1784 setsum_diff1' ~> setsum.remove

1785 setsum_empty ~> setsum.empty

1786 setsum_infinite ~> setsum.infinite

1787 setsum_insert ~> setsum.insert

1788 setsum_inter_restrict'' ~> setsum.inter_filter

1789 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

1790 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

1791 setsum_mono_zero_left ~> setsum.mono_neutral_left

1792 setsum_mono_zero_right ~> setsum.mono_neutral_right

1793 setsum_reindex ~> setsum.reindex

1794 setsum_reindex_cong ~> setsum.reindex_cong

1795 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

1796 setsum_restrict_set ~> setsum.inter_restrict

1797 setsum_Plus ~> setsum.Plus

1798 setsum_setsum_restrict ~> setsum.commute_restrict

1799 setsum_Sigma ~> setsum.Sigma

1800 setsum_subset_diff ~> setsum.subset_diff

1801 setsum_Un_disjoint ~> setsum.union_disjoint

1802 setsum_UN_disjoint ~> setsum.UNION_disjoint

1803 setsum_Un_Int ~> setsum.union_inter

1804 setsum_Union_disjoint ~> setsum.Union_disjoint

1805 setsum_UNION_zero ~> setsum.Union_comp

1806 setsum_Un_zero ~> setsum.union_inter_neutral

1807 strong_setprod_cong ~> setprod.strong_cong

1808 strong_setsum_cong ~> setsum.strong_cong

1809 setprod_1' ~> setprod.neutral

1810 setprod_1 ~> setprod.neutral_const

1811 setprod_cartesian_product ~> setprod.cartesian_product

1812 setprod_cong ~> setprod.cong

1813 setprod_delta ~> setprod.delta

1814 setprod_delta' ~> setprod.delta'

1815 setprod_empty ~> setprod.empty

1816 setprod_infinite ~> setprod.infinite

1817 setprod_insert ~> setprod.insert

1818 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

1819 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

1820 setprod_mono_one_left ~> setprod.mono_neutral_left

1821 setprod_mono_one_right ~> setprod.mono_neutral_right

1822 setprod_reindex ~> setprod.reindex

1823 setprod_reindex_cong ~> setprod.reindex_cong

1824 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

1825 setprod_Sigma ~> setprod.Sigma

1826 setprod_subset_diff ~> setprod.subset_diff

1827 setprod_timesf ~> setprod.distrib

1828 setprod_Un2 ~> setprod.union_diff2

1829 setprod_Un_disjoint ~> setprod.union_disjoint

1830 setprod_UN_disjoint ~> setprod.UNION_disjoint

1831 setprod_Un_Int ~> setprod.union_inter

1832 setprod_Union_disjoint ~> setprod.Union_disjoint

1833 setprod_Un_one ~> setprod.union_inter_neutral

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

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

1837 Dropped setsum_reindex_id, setprod_reindex_id

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

1840 INCOMPATIBILITY.

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

1844 Fact consolidations:

1845 min_max.inf_assoc ~> min.assoc

1846 min_max.inf_commute ~> min.commute

1847 min_max.inf_left_commute ~> min.left_commute

1848 min_max.inf_idem ~> min.idem

1849 min_max.inf_left_idem ~> min.left_idem

1850 min_max.inf_right_idem ~> min.right_idem

1851 min_max.sup_assoc ~> max.assoc

1852 min_max.sup_commute ~> max.commute

1853 min_max.sup_left_commute ~> max.left_commute

1854 min_max.sup_idem ~> max.idem

1855 min_max.sup_left_idem ~> max.left_idem

1856 min_max.sup_inf_distrib1 ~> max_min_distrib2

1857 min_max.sup_inf_distrib2 ~> max_min_distrib1

1858 min_max.inf_sup_distrib1 ~> min_max_distrib2

1859 min_max.inf_sup_distrib2 ~> min_max_distrib1

1860 min_max.distrib ~> min_max_distribs

1861 min_max.inf_absorb1 ~> min.absorb1

1862 min_max.inf_absorb2 ~> min.absorb2

1863 min_max.sup_absorb1 ~> max.absorb1

1864 min_max.sup_absorb2 ~> max.absorb2

1865 min_max.le_iff_inf ~> min.absorb_iff1

1866 min_max.le_iff_sup ~> max.absorb_iff2

1867 min_max.inf_le1 ~> min.cobounded1

1868 min_max.inf_le2 ~> min.cobounded2

1869 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

1870 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

1871 min_max.le_infI1 ~> min.coboundedI1

1872 min_max.le_infI2 ~> min.coboundedI2

1873 min_max.le_supI1 ~> max.coboundedI1

1874 min_max.le_supI2 ~> max.coboundedI2

1875 min_max.less_infI1 ~> min.strict_coboundedI1

1876 min_max.less_infI2 ~> min.strict_coboundedI2

1877 min_max.less_supI1 ~> max.strict_coboundedI1

1878 min_max.less_supI2 ~> max.strict_coboundedI2

1879 min_max.inf_mono ~> min.mono

1880 min_max.sup_mono ~> max.mono

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

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

1883 min_max.le_inf_iff ~> min.bounded_iff

1884 min_max.le_sup_iff ~> max.bounded_iff

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

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

1888 max.left_commute, max.left_idem directly.

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

1891 min.cobounded2, max.cobounded1m max.cobounded2 directly.

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

1895 INCOMPATIBILITY.

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

1898 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

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

1901 INCOMPATIBILITY.

1903 * Fact generalization and consolidation:

1904 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

1906 INCOMPATIBILITY.

1908 * Purely algebraic definition of even. Fact generalization and

1909 consolidation:

1910 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

1911 even_zero_(nat|int) ~> even_zero

1913 INCOMPATIBILITY.

1915 * Abolished neg_numeral.

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

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

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

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

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

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

1922 - Syntax for negative numerals is mere input syntax.

1924 INCOMPATIBILITY.

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

1928 add_assoc ~> add.assoc

1929 add_commute ~> add.commute

1930 add_left_commute ~> add.left_commute

1931 mult_assoc ~> mult.assoc

1932 mult_commute ~> mult.commute

1933 mult_left_commute ~> mult.left_commute

1934 nat_add_assoc ~> add.assoc

1935 nat_add_commute ~> add.commute

1936 nat_add_left_commute ~> add.left_commute

1937 nat_mult_assoc ~> mult.assoc

1938 nat_mult_commute ~> mult.commute

1939 eq_assoc ~> iff_assoc

1940 eq_left_commute ~> iff_left_commute

1942 INCOMPATIBILITY.

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

1945 Prefer ac_simps instead, or specify rules

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

1948 * Elimination of fact duplicates:

1949 equals_zero_I ~> minus_unique

1950 diff_eq_0_iff_eq ~> right_minus_eq

1951 nat_infinite ~> infinite_UNIV_nat

1952 int_infinite ~> infinite_UNIV_int

1954 INCOMPATIBILITY.

1956 * Fact name consolidation:

1957 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

1958 minus_le_self_iff ~> neg_less_eq_nonneg

1959 le_minus_self_iff ~> less_eq_neg_nonpos

1960 neg_less_nonneg ~> neg_less_pos

1961 less_minus_self_iff ~> less_neg_neg [simp]

1963 INCOMPATIBILITY.

1965 * More simplification rules on unary and binary minus:

1966 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

1967 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

1968 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

1969 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

1970 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

1971 been taken away from fact collections algebra_simps and field_simps.

1972 INCOMPATIBILITY.

1974 To restore proofs, the following patterns are helpful:

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

1977 Consider simplification with algebra_simps or field_simps.

1979 b) Lifting rules from addition to subtraction:

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

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

1983 Consider simplification with algebra_simps or field_simps;

1984 or the brute way with

1985 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

1987 * Introduce bdd_above and bdd_below in theory

1988 Conditionally_Complete_Lattices, use them instead of explicitly

1989 stating boundedness of sets.

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

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

1993 additional case in fixpoint induction proofs. INCOMPATIBILITY.

1995 * Removed and renamed theorems in Series:

1996 summable_le ~> suminf_le

1997 suminf_le ~> suminf_le_const

1998 series_pos_le ~> setsum_le_suminf

1999 series_pos_less ~> setsum_less_suminf

2000 suminf_ge_zero ~> suminf_nonneg

2001 suminf_gt_zero ~> suminf_pos

2002 suminf_gt_zero_iff ~> suminf_pos_iff

2003 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

2004 suminf_0_le ~> suminf_nonneg [rotate]

2005 pos_summable ~> summableI_nonneg_bounded

2006 ratio_test ~> summable_ratio_test

2008 removed series_zero, replaced by sums_finite

2010 removed auxiliary lemmas:

2012 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

2013 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

2014 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

2015 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

2016 summable_convergent_sumr_iff, sumr_diff_mult_const

2018 INCOMPATIBILITY.

2020 * Replace (F)DERIV syntax by has_derivative:

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

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

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

2027 - removed constant isDiff

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

2030 input syntax.

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

2034 - Renamed FDERIV_... lemmas to has_derivative_...

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

2038 - removed DERIV_intros, has_derivative_eq_intros

2040 - introduced derivative_intros and deriative_eq_intros which

2041 includes now rules for DERIV, has_derivative and

2042 has_vector_derivative.

2044 - Other renamings:

2045 differentiable_def ~> real_differentiable_def

2046 differentiableE ~> real_differentiableE

2047 fderiv_def ~> has_derivative_at

2048 field_fderiv_def ~> field_has_derivative_at

2049 isDiff_der ~> differentiable_def

2050 deriv_fderiv ~> has_field_derivative_def

2051 deriv_def ~> DERIV_def

2053 INCOMPATIBILITY.

2055 * Include more theorems in continuous_intros. Remove the

2056 continuous_on_intros, isCont_intros collections, these facts are now

2057 in continuous_intros.

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

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

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

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

2064 are available as the lemma collection legacy_Complex_simps. This

2065 especially removes

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

2069 Instead the reverse direction is supported with

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

2072 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

2074 Renamings:

2075 Re/Im ~> complex.sel

2076 complex_Re/Im_zero ~> zero_complex.sel

2077 complex_Re/Im_add ~> plus_complex.sel

2078 complex_Re/Im_minus ~> uminus_complex.sel

2079 complex_Re/Im_diff ~> minus_complex.sel

2080 complex_Re/Im_one ~> one_complex.sel

2081 complex_Re/Im_mult ~> times_complex.sel

2082 complex_Re/Im_inverse ~> inverse_complex.sel

2083 complex_Re/Im_scaleR ~> scaleR_complex.sel

2084 complex_Re/Im_i ~> ii.sel

2085 complex_Re/Im_cnj ~> cnj.sel

2086 Re/Im_cis ~> cis.sel

2088 complex_divide_def ~> divide_complex_def

2089 complex_norm_def ~> norm_complex_def

2090 cmod_def ~> norm_complex_de

2092 Removed theorems:

2093 complex_zero_def

2094 complex_add_def

2095 complex_minus_def

2096 complex_diff_def

2097 complex_one_def

2098 complex_mult_def

2099 complex_inverse_def

2100 complex_scaleR_def

2102 INCOMPATIBILITY.

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

2105 Conditionally_Complete_Lattices. INCOMPATIBILITY.

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

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

2110 is subsumed by session Kleene_Algebra in AFP.

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

2113 lifting setup is unregistered. INCOMPATIBILITY.

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

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

2118 INCOMPATIBILITY.

2120 * HOL-Word:

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

2122 of "word_arith_wis".

2123 - Dropped first (duplicated) element in fact collections

2124 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

2125 "uint_word_arith_bintrs".

2127 * HOL-Number_Theory:

2128 - consolidated the proofs of the binomial theorem

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

2130 - no more references to Old_Number_Theory in the HOL libraries

2131 (except the AFP)

2133 INCOMPATIBILITY.

2135 * HOL-Multivariate_Analysis:

2136 - Type class ordered_real_vector for ordered vector spaces.

2137 - New theory Complex_Basic_Analysis defining complex derivatives,

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

2139 - Changed order of ordered_euclidean_space to be compatible with

2140 pointwise ordering on products. Therefore instance of

2141 conditionally_complete_lattice and ordered_real_vector.

2142 INCOMPATIBILITY: use box instead of greaterThanLessThan or

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

2144 intervals.

2145 - removed dependencies on type class ordered_euclidean_space with

2146 introduction of "cbox" on euclidean_space

2147 - renamed theorems:

2148 interval ~> box

2149 mem_interval ~> mem_box

2150 interval_eq_empty ~> box_eq_empty

2151 interval_ne_empty ~> box_ne_empty

2152 interval_sing(1) ~> cbox_sing

2153 interval_sing(2) ~> box_sing

2154 subset_interval_imp ~> subset_box_imp

2155 subset_interval ~> subset_box

2156 open_interval ~> open_box

2157 closed_interval ~> closed_cbox

2158 interior_closed_interval ~> interior_cbox

2159 bounded_closed_interval ~> bounded_cbox

2160 compact_interval ~> compact_cbox

2161 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

2162 bounded_subset_closed_interval ~> bounded_subset_cbox

2163 mem_interval_componentwiseI ~> mem_box_componentwiseI

2164 convex_box ~> convex_prod

2165 rel_interior_real_interval ~> rel_interior_real_box

2166 convex_interval ~> convex_box

2167 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

2168 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

2169 content_closed_interval' ~> content_cbox'

2170 elementary_subset_interval ~> elementary_subset_box

2171 diameter_closed_interval ~> diameter_cbox

2172 frontier_closed_interval ~> frontier_cbox

2173 frontier_open_interval ~> frontier_box

2174 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

2175 closure_open_interval ~> closure_box

2176 open_closed_interval_convex ~> open_cbox_convex

2177 open_interval_midpoint ~> box_midpoint

2178 content_image_affinity_interval ~> content_image_affinity_cbox

2179 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

2180 bounded_interval ~> bounded_closed_interval + bounded_boxes

2182 - respective theorems for intervals over the reals:

2183 content_closed_interval + content_cbox

2184 has_integral + has_integral_real

2185 fine_division_exists + fine_division_exists_real

2186 has_integral_null + has_integral_null_real

2187 tagged_division_union_interval + tagged_division_union_interval_real

2188 has_integral_const + has_integral_const_real

2189 integral_const + integral_const_real

2190 has_integral_bound + has_integral_bound_real

2191 integrable_continuous + integrable_continuous_real

2192 integrable_subinterval + integrable_subinterval_real

2193 has_integral_reflect_lemma + has_integral_reflect_lemma_real

2194 integrable_reflect + integrable_reflect_real

2195 integral_reflect + integral_reflect_real

2196 image_affinity_interval + image_affinity_cbox

2197 image_smult_interval + image_smult_cbox

2198 integrable_const + integrable_const_ivl

2199 integrable_on_subinterval + integrable_on_subcbox

2201 - renamed theorems:

2202 derivative_linear ~> has_derivative_bounded_linear

2203 derivative_is_linear ~> has_derivative_linear

2204 bounded_linear_imp_linear ~> bounded_linear.linear

2206 * HOL-Probability:

2207 - Renamed positive_integral to nn_integral:

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

2210 positive_integral_positive ~> nn_integral_nonneg

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

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

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

2217 integral_zero ~> integral_zero / integrable_zero

2218 integral_minus ~> integral_minus / integrable_minus

2219 integral_add ~> integral_add / integrable_add

2220 integral_diff ~> integral_diff / integrable_diff

2221 integral_setsum ~> integral_setsum / integrable_setsum

2222 integral_multc ~> integral_mult_left / integrable_mult_left

2223 integral_cmult ~> integral_mult_right / integrable_mult_right

2224 integral_triangle_inequality~> integral_norm_bound

2225 integrable_nonneg ~> integrableI_nonneg

2226 integral_positive ~> integral_nonneg_AE

2227 integrable_abs_iff ~> integrable_abs_cancel

2228 positive_integral_lim_INF ~> nn_integral_liminf

2229 lebesgue_real_affine ~> lborel_real_affine

2230 borel_integral_has_integral ~> has_integral_lebesgue_integral

2231 integral_indicator ~>

2232 integral_real_indicator / integrable_real_indicator

2233 positive_integral_fst ~> nn_integral_fst'

2234 positive_integral_fst_measurable ~> nn_integral_fst

2235 positive_integral_snd_measurable ~> nn_integral_snd

2237 integrable_fst_measurable ~>

2238 integral_fst / integrable_fst / AE_integrable_fst

2240 integrable_snd_measurable ~>

2241 integral_snd / integrable_snd / AE_integrable_snd

2243 integral_monotone_convergence ~>

2244 integral_monotone_convergence / integrable_monotone_convergence

2246 integral_monotone_convergence_at_top ~>

2247 integral_monotone_convergence_at_top /

2248 integrable_monotone_convergence_at_top

2250 has_integral_iff_positive_integral_lebesgue ~>

2251 has_integral_iff_has_bochner_integral_lebesgue_nonneg

2253 lebesgue_integral_has_integral ~>

2254 has_integral_integrable_lebesgue_nonneg

2256 positive_integral_lebesgue_has_integral ~>

2257 integral_has_integral_lebesgue_nonneg /

2258 integrable_has_integral_lebesgue_nonneg

2260 lebesgue_integral_real_affine ~>

2261 nn_integral_real_affine

2263 has_integral_iff_positive_integral_lborel ~>

2264 integral_has_integral_nonneg / integrable_has_integral_nonneg

2266 The following theorems where removed:

2268 lebesgue_integral_nonneg

2269 lebesgue_integral_uminus

2270 lebesgue_integral_cmult

2271 lebesgue_integral_multc

2272 lebesgue_integral_cmult_nonneg

2273 integral_cmul_indicator

2274 integral_real

2276 - Formalized properties about exponentially, Erlang, and normal

2277 distributed random variables.

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

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

2281 INCOMPATIBILITY.

2284 *** Scala ***

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

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

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

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

2290 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

2292 * Substantial reworking of internal PIDE protocol communication

2293 channels. INCOMPATIBILITY.

2296 *** ML ***

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

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

2300 current background theory. Thus equivalent data produced in different

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

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

2303 appropriate than Thm.eq_thm.

2305 * Proper context for basic Simplifier operations: rewrite_rule,

2306 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

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

2308 actually belongs to it).

2310 * Proper context discipline for read_instantiate and instantiate_tac:

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

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

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

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

2315 of schematic variables.

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

2318 structure Runtime. Minor INCOMPATIBILITY.

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

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

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

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

2325 INCOMPATIBILITY.

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

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

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

2330 INCOMPATIBILITY.

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

2333 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

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

2335 formal context.

2337 * Simplified programming interface to define ML antiquotations, see

2338 structure ML_Antiquotation. Minor INCOMPATIBILITY.

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

2341 occasionally useful for experimentation and diagnostic purposes.

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

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

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

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

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

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

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

2351 purposes.

2354 *** System ***

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

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

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

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

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

2362 * The raw Isabelle process executable has been renamed from

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

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

2365 the Isabelle environment to avoid dynamic path lookup. Rare

2366 incompatibility for old tools that do not use the ISABELLE_PROCESS

2367 settings variable.

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

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

2371 obsolete Isar TTY loop.

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

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

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

2376 via desktop environment, without any special precautions. Potential

2377 INCOMPATIBILITY with ambitious private settings.

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

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

2381 as produced by Isabelle/jEdit, for example.

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

2384 integrated into Isabelle/jEdit eventually.

2386 * Improved 'display_drafts' concerning desktop integration and

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

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

2390 * Session ROOT specifications require explicit 'document_files' for

2391 robust dependencies on LaTeX sources. Only these explicitly given

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

2393 processing is started.

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

2396 of TeX Live from Cygwin.

2400 New in Isabelle2013-2 (December 2013)

2401 -------------------------------------

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

2405 * More robust editing of running commands with internal forks,

2406 e.g. non-terminating 'by' steps.

2408 * More relaxed Sledgehammer panel: avoid repeated application of query

2409 after edits surrounding the command location.

2411 * More status information about commands that are interrupted

2412 accidentally (via physical event or Poly/ML runtime system signal,

2413 e.g. out-of-memory).

2416 *** System ***

2418 * More robust termination of external processes managed by

2419 Isabelle/ML: support cancellation of tasks within the range of

2420 milliseconds, as required for PIDE document editing with automatically

2421 tried tools (e.g. Sledgehammer).

2423 * Reactivated Isabelle/Scala kill command for external processes on

2424 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

2425 workaround for some Debian/Ubuntu Linux versions from 2013.

2429 New in Isabelle2013-1 (November 2013)

2430 -------------------------------------

2432 *** General ***

2434 * Discontinued obsolete 'uses' within theory header. Note that

2435 commands like 'ML_file' work without separate declaration of file

2436 dependencies. Minor INCOMPATIBILITY.

2438 * Discontinued redundant 'use' command, which was superseded by

2439 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

2441 * Simplified subscripts within identifiers, using plain \<^sub>

2442 instead of the second copy \<^isub> and \<^isup>. Superscripts are

2443 only for literal tokens within notation; explicit mixfix annotations

2444 for consts or fixed variables may be used as fall-back for unusual

2445 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

2446 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

2447 standardize symbols as a starting point for further manual cleanup.

2448 The ML reference variable "legacy_isub_isup" may be set as temporary

2449 workaround, to make the prover accept a subset of the old identifier

2450 syntax.

2452 * Document antiquotations: term style "isub" has been renamed to

2453 "sub". Minor INCOMPATIBILITY.

2455 * Uniform management of "quick_and_dirty" as system option (see also

2456 "isabelle options"), configuration option within the context (see also

2457 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

2458 INCOMPATIBILITY, need to use more official Isabelle means to access

2459 quick_and_dirty, instead of historical poking into mutable reference.

2461 * Renamed command 'print_configs' to 'print_options'. Minor

2462 INCOMPATIBILITY.

2464 * Proper diagnostic command 'print_state'. Old 'pr' (with its

2465 implicit change of some global references) is retained for now as

2466 control command, e.g. for ProofGeneral 3.7.x.

2468 * Discontinued 'print_drafts' command with its old-fashioned PS output

2469 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

2470 'display_drafts' instead and print via the regular document viewer.

2472 * Updated and extended "isar-ref" and "implementation" manual,

2473 eliminated old "ref" manual.

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

2478 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

2479 Documentation panel.

2481 * Dockable window "Documentation" provides access to Isabelle

2482 documentation.

2484 * Dockable window "Find" provides query operations for formal entities

2485 (GUI front-end to 'find_theorems' command).

2487 * Dockable window "Sledgehammer" manages asynchronous / parallel

2488 sledgehammer runs over existing document sources, independently of

2489 normal editing and checking process.

2491 * Dockable window "Timing" provides an overview of relevant command

2492 timing information, depending on option jedit_timing_threshold. The

2493 same timing information is shown in the extended tooltip of the

2494 command keyword, when hovering the mouse over it while the CONTROL or

2495 COMMAND modifier is pressed.

2497 * Improved dockable window "Theories": Continuous checking of proof

2498 document (visible and required parts) may be controlled explicitly,

2499 using check box or shortcut "C+e ENTER". Individual theory nodes may

2500 be marked explicitly as required and checked in full, using check box

2501 or shortcut "C+e SPACE".

2503 * Improved completion mechanism, which is now managed by the

2504 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

2505 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

2507 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

2508 isabelle.complete for explicit completion in Isabelle sources.

2509 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

2510 to resolve conflict.

2512 * Improved support of various "minor modes" for Isabelle NEWS,

2513 options, session ROOT etc., with completion and SideKick tree view.

2515 * Strictly monotonic document update, without premature cancellation of

2516 running transactions that are still needed: avoid reset/restart of

2517 such command executions while editing.

2519 * Support for asynchronous print functions, as overlay to existing

2520 document content.

2522 * Support for automatic tools in HOL, which try to prove or disprove

2523 toplevel theorem statements.

2525 * Action isabelle.reset-font-size resets main text area font size

2526 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

2527 also "Plugin Options / Isabelle / General"). It can be bound to some

2528 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

2530 * File specifications in jEdit (e.g. file browser) may refer to

2531 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

2532 obsolete $ISABELLE_HOME_WINDOWS variable.

2534 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

2535 / Global Options / Appearance".

2537 * Improved support of native Mac OS X functionality via "MacOSX"

2538 plugin, which is now enabled by default.

2541 *** Pure ***

2543 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

2544 In particular, 'interpretation' allows for non-persistent

2545 interpretation within "context ... begin ... end" blocks offering a

2546 light-weight alternative to 'sublocale'. See "isar-ref" manual for

2547 details.

2549 * Improved locales diagnostic command 'print_dependencies'.

2551 * Discontinued obsolete 'axioms' command, which has been marked as

2552 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

2553 instead, while observing its uniform scope for polymorphism.

2555 * Discontinued empty name bindings in 'axiomatization'.

2556 INCOMPATIBILITY.

2558 * System option "proofs" has been discontinued. Instead the global

2559 state of Proofterm.proofs is persistently compiled into logic images

2560 as required, notably HOL-Proofs. Users no longer need to change

2561 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

2563 * Syntax translation functions (print_translation etc.) always depend

2564 on Proof.context. Discontinued former "(advanced)" option -- this is

2565 now the default. Minor INCOMPATIBILITY.

2567 * Former global reference trace_unify_fail is now available as

2568 configuration option "unify_trace_failure" (global context only).

2570 * SELECT_GOAL now retains the syntactic context of the overall goal

2571 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

2572 situations.

2575 *** HOL ***

2577 * Stronger precedence of syntax for big intersection and union on

2578 sets, in accordance with corresponding lattice operations.

2579 INCOMPATIBILITY.

2581 * Notation "{p:A. P}" now allows tuple patterns as well.

2583 * Nested case expressions are now translated in a separate check phase

2584 rather than during parsing. The data for case combinators is separated

2585 from the datatype package. The declaration attribute

2586 "case_translation" can be used to register new case combinators:

2588 declare [[case_translation case_combinator constructor1 ... constructorN]]

2590 * Code generator:

2591 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

2592 'code_instance'.

2593 - 'code_identifier' declares name hints for arbitrary identifiers in

2594 generated code, subsuming 'code_modulename'.

2596 See the isar-ref manual for syntax diagrams, and the HOL theories for

2597 examples.

2599 * Attibute 'code': 'code' now declares concrete and abstract code

2600 equations uniformly. Use explicit 'code equation' and 'code abstract'

2601 to distinguish both when desired.

2603 * Discontinued theories Code_Integer and Efficient_Nat by a more

2604 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

2605 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

2606 generation for details. INCOMPATIBILITY.

2608 * Numeric types are mapped by default to target language numerals:

2609 natural (replaces former code_numeral) and integer (replaces former

2610 code_int). Conversions are available as integer_of_natural /

2611 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

2612 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

2613 ML). INCOMPATIBILITY.

2615 * Function package: For mutually recursive functions f and g, separate

2616 cases rules f.cases and g.cases are generated instead of unusable

2617 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

2618 in the case that the unusable rule was used nevertheless.

2620 * Function package: For each function f, new rules f.elims are

2621 generated, which eliminate equalities of the form "f x = t".

2623 * New command 'fun_cases' derives ad-hoc elimination rules for

2624 function equations as simplified instances of f.elims, analogous to

2625 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

2627 * Lifting:

2628 - parametrized correspondence relations are now supported:

2629 + parametricity theorems for the raw term can be specified in

2630 the command lift_definition, which allow us to generate stronger

2631 transfer rules

2632 + setup_lifting generates stronger transfer rules if parametric

2633 correspondence relation can be generated

2634 + various new properties of the relator must be specified to support

2635 parametricity

2636 + parametricity theorem for the Quotient relation can be specified

2637 - setup_lifting generates domain rules for the Transfer package

2638 - stronger reflexivity prover of respectfulness theorems for type

2639 copies

2640 - ===> and --> are now local. The symbols can be introduced

2641 by interpreting the locale lifting_syntax (typically in an

2642 anonymous context)

2643 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

2644 Main. Potential INCOMPATIBILITY

2645 - new commands for restoring and deleting Lifting/Transfer context:

2646 lifting_forget, lifting_update

2647 - the command print_quotmaps was renamed to print_quot_maps.

2648 INCOMPATIBILITY

2650 * Transfer:

2651 - better support for domains in Transfer: replace Domainp T

2652 by the actual invariant in a transferred goal

2653 - transfer rules can have as assumptions other transfer rules

2654 - Experimental support for transferring from the raw level to the

2655 abstract level: Transfer.transferred attribute

2656 - Attribute version of the transfer method: untransferred attribute

2658 * Reification and reflection:

2659 - Reification is now directly available in HOL-Main in structure

2660 "Reification".

2661 - Reflection now handles multiple lists with variables also.

2662 - The whole reflection stack has been decomposed into conversions.

2663 INCOMPATIBILITY.

2665 * Revised devices for recursive definitions over finite sets:

2666 - Only one fundamental fold combinator on finite set remains:

2667 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

2668 This is now identity on infinite sets.

2669 - Locales ("mini packages") for fundamental definitions with

2670 Finite_Set.fold: folding, folding_idem.

2671 - Locales comm_monoid_set, semilattice_order_set and

2672 semilattice_neutr_order_set for big operators on sets.

2673 See theory Big_Operators for canonical examples.

2674 Note that foundational constants comm_monoid_set.F and

2675 semilattice_set.F correspond to former combinators fold_image

2676 and fold1 respectively. These are now gone. You may use

2677 those foundational constants as substitutes, but it is

2678 preferable to interpret the above locales accordingly.

2679 - Dropped class ab_semigroup_idem_mult (special case of lattice,

2680 no longer needed in connection with Finite_Set.fold etc.)

2681 - Fact renames:

2682 card.union_inter ~> card_Un_Int [symmetric]

2683 card.union_disjoint ~> card_Un_disjoint

2684 INCOMPATIBILITY.

2686 * Locale hierarchy for abstract orderings and (semi)lattices.

2688 * Complete_Partial_Order.admissible is defined outside the type class

2689 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

2690 class predicate assumption or sort constraint when possible.

2691 INCOMPATIBILITY.

2693 * Introduce type class "conditionally_complete_lattice": Like a

2694 complete lattice but does not assume the existence of the top and

2695 bottom elements. Allows to generalize some lemmas about reals and

2696 extended reals. Removed SupInf and replaced it by the instantiation

2697 of conditionally_complete_lattice for real. Renamed lemmas about

2698 conditionally-complete lattice from Sup_... to cSup_... and from

2699 Inf_... to cInf_... to avoid hidding of similar complete lattice

2700 lemmas.

2702 * Introduce type class linear_continuum as combination of

2703 conditionally-complete lattices and inner dense linorders which have

2704 more than one element. INCOMPATIBILITY.

2706 * Introduced type classes order_top and order_bot. The old classes top

2707 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

2708 Rename bot -> order_bot, top -> order_top

2710 * Introduce type classes "no_top" and "no_bot" for orderings without

2711 top and bottom elements.

2713 * Split dense_linorder into inner_dense_order and no_top, no_bot.

2715 * Complex_Main: Unify and move various concepts from

2716 HOL-Multivariate_Analysis to HOL-Complex_Main.

2718 - Introduce type class (lin)order_topology and

2719 linear_continuum_topology. Allows to generalize theorems about

2720 limits and order. Instances are reals and extended reals.

2722 - continuous and continuos_on from Multivariate_Analysis:

2723 "continuous" is the continuity of a function at a filter. "isCont"

2724 is now an abbrevitation: "isCont x f == continuous (at _) f".

2726 Generalized continuity lemmas from isCont to continuous on an

2727 arbitrary filter.

2729 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

2730 compactness of closed intervals on reals. Continuous functions

2731 attain infimum and supremum on compact sets. The inverse of a

2732 continuous function is continuous, when the function is continuous

2733 on a compact set.

2735 - connected from Multivariate_Analysis. Use it to prove the

2736 intermediate value theorem. Show connectedness of intervals on

2737 linear_continuum_topology).

2739 - first_countable_topology from Multivariate_Analysis. Is used to

2740 show equivalence of properties on the neighbourhood filter of x and

2741 on all sequences converging to x.

2743 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

2744 theorems from Library/FDERIV.thy to Deriv.thy and base the

2745 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

2746 which are restricted to sets, i.e. to represent derivatives from

2747 left or right.

2749 - Removed the within-filter. It is replaced by the principal filter:

2751 F within X = inf F (principal X)

2753 - Introduce "at x within U" as a single constant, "at x" is now an

2754 abbreviation for "at x within UNIV"

2756 - Introduce named theorem collections tendsto_intros,

2757 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

2758 in tendsto_intros (or FDERIV_intros) are also available as

2759 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

2760 is replaced by a congruence rule. This allows to apply them as

2761 intro rules and then proving equivalence by the simplifier.

2763 - Restructured theories in HOL-Complex_Main:

2765 + Moved RealDef and RComplete into Real

2767 + Introduced Topological_Spaces and moved theorems about

2768 topological spaces, filters, limits and continuity to it

2770 + Renamed RealVector to Real_Vector_Spaces

2772 + Split Lim, SEQ, Series into Topological_Spaces,

2773 Real_Vector_Spaces, and Limits

2775 + Moved Ln and Log to Transcendental

2777 + Moved theorems about continuity from Deriv to Topological_Spaces

2779 - Remove various auxiliary lemmas.

2781 INCOMPATIBILITY.

2783 * Nitpick:

2784 - Added option "spy".

2785 - Reduce incidence of "too high arity" errors.

2787 * Sledgehammer:

2788 - Renamed option:

2789 isar_shrink ~> isar_compress

2790 INCOMPATIBILITY.

2791 - Added options "isar_try0", "spy".

2792 - Better support for "isar_proofs".

2793 - MaSh has been fined-tuned and now runs as a local server.

2795 * Improved support for ad hoc overloading of constants (see also

2796 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

2798 * Library/Polynomial.thy:

2799 - Use lifting for primitive definitions.

2800 - Explicit conversions from and to lists of coefficients, used for

2801 generated code.

2802 - Replaced recursion operator poly_rec by fold_coeffs.

2803 - Prefer pre-existing gcd operation for gcd.

2804 - Fact renames:

2805 poly_eq_iff ~> poly_eq_poly_eq_iff

2806 poly_ext ~> poly_eqI

2807 expand_poly_eq ~> poly_eq_iff

2808 IMCOMPATIBILITY.

2810 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

2811 case_of_simps to convert function definitions between a list of

2812 equations with patterns on the lhs and a single equation with case

2813 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

2815 * New Library/FSet.thy: type of finite sets defined as a subtype of

2816 sets defined by Lifting/Transfer.

2818 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

2820 * Consolidation of library theories on product orders:

2822 Product_Lattice ~> Product_Order -- pointwise order on products

2823 Product_ord ~> Product_Lexorder -- lexicographic order on products

2825 INCOMPATIBILITY.

2827 * Imperative-HOL: The MREC combinator is considered legacy and no

2828 longer included by default. INCOMPATIBILITY, use partial_function

2829 instead, or import theory Legacy_Mrec as a fallback.

2831 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

2832 ~~/src/HOL/Algebra/poly. Existing theories should be based on

2833 ~~/src/HOL/Library/Polynomial instead. The latter provides

2834 integration with HOL's type classes for rings. INCOMPATIBILITY.

2836 * HOL-BNF:

2837 - Various improvements to BNF-based (co)datatype package, including

2838 new commands "primrec_new", "primcorec", and

2839 "datatype_new_compat", as well as documentation. See

2840 "datatypes.pdf" for details.

2841 - New "coinduction" method to avoid some boilerplate (compared to

2842 coinduct).

2843 - Renamed keywords:

2844 data ~> datatype_new

2845 codata ~> codatatype

2846 bnf_def ~> bnf

2847 - Renamed many generated theorems, including

2848 discs ~> disc

2849 map_comp' ~> map_comp

2850 map_id' ~> map_id

2851 sels ~> sel

2852 set_map' ~> set_map

2853 sets ~> set

2854 IMCOMPATIBILITY.

2857 *** ML ***

2859 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

2860 "check_property" allows to check specifications of the form "ALL x y

2861 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

2862 Examples.thy in particular.

2864 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

2865 tracing output in the command transaction context instead of physical

2866 stdout. See also Toplevel.debug, Toplevel.debugging and

2867 ML_Compiler.exn_trace.

2869 * ML type "theory" is now immutable, without any special treatment of

2870 drafts or linear updates (which could lead to "stale theory" errors in

2871 the past). Discontinued obsolete operations like Theory.copy,

2872 Theory.checkpoint, and the auxiliary type theory_ref. Minor

2873 INCOMPATIBILITY.

2875 * More uniform naming of goal functions for skipped proofs:

2877 Skip_Proof.prove ~> Goal.prove_sorry

2878 Skip_Proof.prove_global ~> Goal.prove_sorry_global

2880 Minor INCOMPATIBILITY.

2882 * Simplifier tactics and tools use proper Proof.context instead of

2883 historic type simpset. Old-style declarations like addsimps,

2884 addsimprocs etc. operate directly on Proof.context. Raw type simpset

2885 retains its use as snapshot of the main Simplifier context, using

2886 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

2887 old tools by making them depend on (ctxt : Proof.context) instead of

2888 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

2890 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

2891 operate on Proof.context instead of claset, for uniformity with addIs,

2892 addEs, addDs etc. Note that claset_of and put_claset allow to manage

2893 clasets separately from the context.

2895 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

2896 INCOMPATIBILITY, use @{context} instead.

2898 * Antiquotation @{theory_context A} is similar to @{theory A}, but

2899 presents the result as initial Proof.context.

2902 *** System ***

2904 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

2905 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

2907 * Discontinued obsolete isabelle-process options -f and -u (former

2908 administrative aliases of option -e). Minor INCOMPATIBILITY.

2910 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

2911 settings variable.

2913 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

2914 document formats: dvi.gz, ps, ps.gz -- the default document format is

2915 always pdf.

2917 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

2918 specify global resources of the JVM process run by isabelle build.

2920 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

2921 to run Isabelle/Scala source files as standalone programs.

2923 * Improved "isabelle keywords" tool (for old-style ProofGeneral

2924 keyword tables): use Isabelle/Scala operations, which inspect outer

2925 syntax without requiring to build sessions first.

2927 * Sessions may be organized via 'chapter' specifications in the ROOT

2928 file, which determines a two-level hierarchy of browser info. The old

2929 tree-like organization via implicit sub-session relation (with its

2930 tendency towards erratic fluctuation of URLs) has been discontinued.

2931 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

2932 for HTML presentation of theories.

2936 New in Isabelle2013 (February 2013)

2937 -----------------------------------

2939 *** General ***

2941 * Theorem status about oracles and unfinished/failed future proofs is

2942 no longer printed by default, since it is incompatible with

2943 incremental / parallel checking of the persistent document model. ML

2944 function Thm.peek_status may be used to inspect a snapshot of the

2945 ongoing evaluation process. Note that in batch mode --- notably

2946 isabelle build --- the system ensures that future proofs of all

2947 accessible theorems in the theory context are finished (as before).

2949 * Configuration option show_markup controls direct inlining of markup

2950 into the printed representation of formal entities --- notably type

2951 and sort constraints. This enables Prover IDE users to retrieve that

2952 information via tooltips in the output window, for example.

2954 * Command 'ML_file' evaluates ML text from a file directly within the

2955 theory, without any predeclaration via 'uses' in the theory header.

2957 * Old command 'use' command and corresponding keyword 'uses' in the

2958 theory header are legacy features and will be discontinued soon.

2959 Tools that load their additional source files may imitate the

2960 'ML_file' implementation, such that the system can take care of

2961 dependencies properly.

2963 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

2964 is called fastforce / fast_force_tac already since Isabelle2011-1.

2966 * Updated and extended "isar-ref" and "implementation" manual, reduced

2967 remaining material in old "ref" manual.

2969 * Improved support for auxiliary contexts that indicate block structure

2970 for specifications. Nesting of "context fixes ... context assumes ..."

2971 and "class ... context ...".

2973 * Attribute "consumes" allows a negative value as well, which is

2974 interpreted relatively to the total number of premises of the rule in

2975 the target context. This form of declaration is stable when exported

2976 from a nested 'context' with additional assumptions. It is the

2977 preferred form for definitional packages, notably cases/rules produced

2978 in HOL/inductive and HOL/function.

2980 * More informative error messages for Isar proof commands involving

2981 lazy enumerations (method applications etc.).

2983 * Refined 'help' command to retrieve outer syntax commands according

2984 to name patterns (with clickable results).

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

2989 * Parallel terminal proofs ('by') are enabled by default, likewise

2990 proofs that are built into packages like 'datatype', 'function'. This

2991 allows to "run ahead" checking the theory specifications on the

2992 surface, while the prover is still crunching on internal

2993 justifications. Unfinished / cancelled proofs are restarted as

2994 required to complete full proof checking eventually.

2996 * Improved output panel with tooltips, hyperlinks etc. based on the

2997 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

2998 tooltips leads to some window that supports the same recursively,

2999 which can lead to stacks of tooltips as the semantic document content

3000 is explored. ESCAPE closes the whole stack, individual windows may be

3001 closed separately, or detached to become independent jEdit dockables.

3003 * Improved support for commands that produce graph output: the text

3004 message contains a clickable area to open a new instance of the graph

3005 browser on demand.

3007 * More robust incremental parsing of outer syntax (partial comments,

3008 malformed symbols). Changing the balance of open/close quotes and

3009 comment delimiters works more conveniently with unfinished situations

3010 that frequently occur in user interaction.

3012 * More efficient painting and improved reactivity when editing large

3013 files. More scalable management of formal document content.

3015 * Smarter handling of tracing messages: prover process pauses after

3016 certain number of messages per command transaction, with some user

3017 dialog to stop or continue. This avoids swamping the front-end with

3018 potentially infinite message streams.

3020 * More plugin options and preferences, based on Isabelle/Scala. The

3021 jEdit plugin option panel provides access to some Isabelle/Scala

3022 options, including tuning parameters for editor reactivity and color

3023 schemes.

3025 * Dockable window "Symbols" provides some editing support for Isabelle

3026 symbols.

3028 * Dockable window "Monitor" shows ML runtime statistics. Note that

3029 continuous display of the chart slows down the system.

3031 * Improved editing support for control styles: subscript, superscript,

3032 bold, reset of style -- operating on single symbols or text

3033 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

3035 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

3036 adjust the main text area font size, and its derivatives for output,

3037 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

3038 need to be adapted to local keyboard layouts.

3040 * More reactive completion popup by default: use \t (TAB) instead of

3041 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

3042 also "Plugin Options / SideKick / General / Code Completion Options".

3044 * Implicit check and build dialog of the specified logic session

3045 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

3046 demand, without bundling big platform-dependent heap images in the

3047 Isabelle distribution.

3049 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

3050 from Oracle provide better multi-platform experience. This version is

3051 now bundled exclusively with Isabelle.

3054 *** Pure ***

3056 * Code generation for Haskell: restrict unqualified imports from

3057 Haskell Prelude to a small set of fundamental operations.

3059 * Command 'export_code': relative file names are interpreted

3060 relatively to master directory of current theory rather than the

3061 rather arbitrary current working directory. INCOMPATIBILITY.

3063 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

3064 use regular rule composition via "OF" / "THEN", or explicit proof

3065 structure instead. Note that Isabelle/ML provides a variety of

3066 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

3067 with some care where this is really required.

3069 * Command 'typ' supports an additional variant with explicit sort

3070 constraint, to infer and check the most general type conforming to a

3071 given sort. Example (in HOL):

3073 typ "_ * _ * bool * unit" :: finite

3075 * Command 'locale_deps' visualizes all locales and their relations as

3076 a Hasse diagram.

3079 *** HOL ***

3081 * Sledgehammer:

3083 - Added MaSh relevance filter based on machine-learning; see the

3084 Sledgehammer manual for details.

3085 - Polished Isar proofs generated with "isar_proofs" option.

3086 - Rationalized type encodings ("type_enc" option).

3087 - Renamed "kill_provers" subcommand to "kill_all".

3088 - Renamed options:

3089 isar_proof ~> isar_proofs

3090 isar_shrink_factor ~> isar_shrink

3091 max_relevant ~> max_facts

3092 relevance_thresholds ~> fact_thresholds

3094 * Quickcheck: added an optimisation for equality premises. It is

3095 switched on by default, and can be switched off by setting the

3096 configuration quickcheck_optimise_equality to false.

3098 * Quotient: only one quotient can be defined by quotient_type

3099 INCOMPATIBILITY.

3101 * Lifting:

3102 - generation of an abstraction function equation in lift_definition

3103 - quot_del attribute

3104 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

3106 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

3107 expressions.

3109 * Preprocessing of the code generator rewrites set comprehensions into

3110 pointfree expressions.

3112 * The SMT solver Z3 has now by default a restricted set of directly

3113 supported features. For the full set of features (div/mod, nonlinear

3114 arithmetic, datatypes/records) with potential proof reconstruction

3115 failures, enable the configuration option "z3_with_extensions". Minor

3116 INCOMPATIBILITY.

3118 * Simplified 'typedef' specifications: historical options for implicit

3119 set definition and alternative name have been discontinued. The

3120 former behavior of "typedef (open) t = A" is now the default, but

3121 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

3122 accordingly.

3124 * Removed constant "chars"; prefer "Enum.enum" on type "char"

3125 directly. INCOMPATIBILITY.

3127 * Moved operation product, sublists and n_lists from theory Enum to

3128 List. INCOMPATIBILITY.

3130 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

3132 * Class "comm_monoid_diff" formalises properties of bounded

3133 subtraction, with natural numbers and multisets as typical instances.

3135 * Added combinator "Option.these" with type "'a option set => 'a set".

3137 * Theory "Transitive_Closure": renamed lemmas

3139 reflcl_tranclp -> reflclp_tranclp

3140 rtranclp_reflcl -> rtranclp_reflclp

3142 INCOMPATIBILITY.

3144 * Theory "Rings": renamed lemmas (in class semiring)

3146 left_distrib ~> distrib_right

3147 right_distrib ~> distrib_left

3149 INCOMPATIBILITY.

3151 * Generalized the definition of limits:

3153 - Introduced the predicate filterlim (LIM x F. f x :> G) which

3154 expresses that when the input values x converge to F then the

3155 output f x converges to G.

3157 - Added filters for convergence to positive (at_top) and negative

3158 infinity (at_bot).

3160 - Moved infinity in the norm (at_infinity) from

3161 Multivariate_Analysis to Complex_Main.

3163 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

3164 at_top".

3166 INCOMPATIBILITY.

3168 * Theory "Library/Option_ord" provides instantiation of option type to

3169 lattice type classes.

3171 * Theory "Library/Multiset": renamed

3173 constant fold_mset ~> Multiset.fold

3174 fact fold_mset_commute ~> fold_mset_comm

3176 INCOMPATIBILITY.

3178 * Renamed theory Library/List_Prefix to Library/Sublist, with related

3179 changes as follows.

3181 - Renamed constants (and related lemmas)

3183 prefix ~> prefixeq

3184 strict_prefix ~> prefix

3186 - Replaced constant "postfix" by "suffixeq" with swapped argument

3187 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

3188 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

3189 Renamed lemmas accordingly.

3191 - Added constant "list_hembeq" for homeomorphic embedding on

3192 lists. Added abbreviation "sublisteq" for special case

3193 "list_hembeq (op =)".

3195 - Theory Library/Sublist no longer provides "order" and "bot" type

3196 class instances for the prefix order (merely corresponding locale

3197 interpretations). The type class instances are now in theory

3198 Library/Prefix_Order.

3200 - The sublist relation of theory Library/Sublist_Order is now based

3201 on "Sublist.sublisteq". Renamed lemmas accordingly:

3203 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

3204 le_list_append_mono ~> Sublist.list_hembeq_append_mono

3205 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

3206 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

3207 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

3208 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

3209 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

3210 le_list_drop_many ~> Sublist.sublisteq_drop_many

3211 le_list_filter_left ~> Sublist.sublisteq_filter_left

3212 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

3213 le_list_rev_take_iff ~> Sublist.sublisteq_append

3214 le_list_same_length ~> Sublist.sublisteq_same_length

3215 le_list_take_many_iff ~> Sublist.sublisteq_append'

3216 less_eq_list.drop ~> less_eq_list_drop

3217 less_eq_list.induct ~> less_eq_list_induct

3218 not_le_list_length ~> Sublist.not_sublisteq_length

3220 INCOMPATIBILITY.

3222 * New theory Library/Countable_Set.

3224 * Theory Library/Debug and Library/Parallel provide debugging and

3225 parallel execution for code generated towards Isabelle/ML.

3227 * Theory Library/FuncSet: Extended support for Pi and extensional and

3228 introduce the extensional dependent function space "PiE". Replaced

3229 extensional_funcset by an abbreviation, and renamed lemmas from

3230 extensional_funcset to PiE as follows:

3232 extensional_empty ~> PiE_empty

3233 extensional_funcset_empty_domain ~> PiE_empty_domain

3234 extensional_funcset_empty_range ~> PiE_empty_range

3235 extensional_funcset_arb ~> PiE_arb

3236 extensional_funcset_mem ~> PiE_mem

3237 extensional_funcset_extend_domainI ~> PiE_fun_upd

3238 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

3239 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

3240 card_extensional_funcset ~> card_PiE

3241 finite_extensional_funcset ~> finite_PiE

3243 INCOMPATIBILITY.

3245 * Theory Library/FinFun: theory of almost everywhere constant

3246 functions (supersedes the AFP entry "Code Generation for Functions as

3247 Data").

3249 * Theory Library/Phantom: generic phantom type to make a type

3250 parameter appear in a constant's type. This alternative to adding

3251 TYPE('a) as another parameter avoids unnecessary closures in generated

3252 code.

3254 * Theory Library/RBT_Impl: efficient construction of red-black trees

3255 from sorted associative lists. Merging two trees with rbt_union may

3256 return a structurally different tree than before. Potential

3257 INCOMPATIBILITY.

3259 * Theory Library/IArray: immutable arrays with code generation.

3261 * Theory Library/Finite_Lattice: theory of finite lattices.

3263 * HOL/Multivariate_Analysis: replaced

3265 "basis :: 'a::euclidean_space => nat => real"

3266 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

3268 on euclidean spaces by using the inner product "_ \<bullet> _" with

3269 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

3270 "SUM i : Basis. f i * r i".

3272 With this change the following constants are also changed or removed:

3274 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

3275 a $$ i ~> inner a i (where i : Basis)

3276 cart_base i removed

3277 \<pi>, \<pi>' removed

3279 Theorems about these constants where removed.

3281 Renamed lemmas:

3283 component_le_norm ~> Basis_le_norm

3284 euclidean_eq ~> euclidean_eq_iff

3285 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

3286 euclidean_simps ~> inner_simps

3287 independent_basis ~> independent_Basis

3288 span_basis ~> span_Basis

3289 in_span_basis ~> in_span_Basis

3290 norm_bound_component_le ~> norm_boound_Basis_le

3291 norm_bound_component_lt ~> norm_boound_Basis_lt

3292 component_le_infnorm ~> Basis_le_infnorm

3294 INCOMPATIBILITY.

3296 * HOL/Probability:

3298 - Added simproc "measurable" to automatically prove measurability.

3300 - Added induction rules for sigma sets with disjoint union

3301 (sigma_sets_induct_disjoint) and for Borel-measurable functions

3302 (borel_measurable_induct).

3304 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

3305 projective family).

3307 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

3308 AFP entry "Ordinals_and_Cardinals").

3310 * HOL/BNF: New (co)datatype package based on bounded natural functors

3311 with support for mixed, nested recursion and interesting non-free

3312 datatypes.

3314 * HOL/Finite_Set and Relation: added new set and relation operations

3315 expressed by Finite_Set.fold.

3317 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

3318 trees for the code generator.

3320 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

3321 Lifting/Transfer.

3322 possible INCOMPATIBILITY.

3324 * HOL/Set: renamed Set.project -> Set.filter

3325 INCOMPATIBILITY.

3328 *** Document preparation ***

3330 * Dropped legacy antiquotations "term_style" and "thm_style", since

3331 styles may be given as arguments to "term" and "thm" already.

3332 Discontinued legacy styles "prem1" .. "prem19".

3334 * Default LaTeX rendering for \<euro> is now based on eurosym package,

3335 instead of slightly exotic babel/greek.

3337 * Document variant NAME may use different LaTeX entry point

3338 document/root_NAME.tex if that file exists, instead of the common

3339 document/root.tex.

3341 * Simplified custom document/build script, instead of old-style

3342 document/IsaMakefile. Minor INCOMPATIBILITY.

3345 *** ML ***

3347 * The default limit for maximum number of worker threads is now 8,

3348 instead of 4, in correspondence to capabilities of contemporary

3349 hardware and Poly/ML runtime system.

3351 * Type Seq.results and related operations support embedded error

3352 messages within lazy enumerations, and thus allow to provide

3353 informative errors in the absence of any usable results.

3355 * Renamed Position.str_of to Position.here to emphasize that this is a

3356 formal device to inline positions into message text, but not

3357 necessarily printing visible text.

3360 *** System ***

3362 * Advanced support for Isabelle sessions and build management, see

3363 "system" manual for the chapter of that name, especially the "isabelle

3364 build" tool and its examples. The "isabelle mkroot" tool prepares

3365 session root directories for use with "isabelle build", similar to

3366 former "isabelle mkdir" for "isabelle usedir". Note that this affects

3367 document preparation as well. INCOMPATIBILITY, isabelle usedir /

3368 mkdir / make are rendered obsolete.

3370 * Discontinued obsolete Isabelle/build script, it is superseded by the

3371 regular isabelle build tool. For example:

3373 isabelle build -s -b HOL

3375 * Discontinued obsolete "isabelle makeall".

3377 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

3378 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

3379 provides some traditional targets that invoke "isabelle build". Note

3380 that this is inefficient! Applications of Isabelle/HOL involving

3381 "isabelle make" should be upgraded to use "isabelle build" directly.

3383 * The "isabelle options" tool prints Isabelle system options, as

3384 required for "isabelle build", for example.

3386 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

3387 Minor INCOMPATIBILITY in command-line options.

3389 * The "isabelle install" tool has now a simpler command-line. Minor

3390 INCOMPATIBILITY.

3392 * The "isabelle components" tool helps to resolve add-on components

3393 that are not bundled, or referenced from a bare-bones repository

3394 version of Isabelle.

3396 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

3397 platform family: "linux", "macos", "windows".

3399 * The ML system is configured as regular component, and no longer

3400 picked up from some surrounding directory. Potential INCOMPATIBILITY

3401 for home-made settings.

3403 * Improved ML runtime statistics (heap, threads, future tasks etc.).

3405 * Discontinued support for Poly/ML 5.2.1, which was the last version

3406 without exception positions and advanced ML compiler/toplevel

3407 configuration.

3409 * Discontinued special treatment of Proof General -- no longer guess

3410 PROOFGENERAL_HOME based on accidental file-system layout. Minor

3411 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

3412 settings manually, or use a Proof General version that has been

3413 bundled as Isabelle component.

3417 New in Isabelle2012 (May 2012)

3418 ------------------------------

3420 *** General ***

3422 * Prover IDE (PIDE) improvements:

3424 - more robust Sledgehammer integration (as before the sledgehammer

3425 command-line needs to be typed into the source buffer)

3426 - markup for bound variables

3427 - markup for types of term variables (displayed as tooltips)

3428 - support for user-defined Isar commands within the running session

3429 - improved support for Unicode outside original 16bit range

3430 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

3432 * Forward declaration of outer syntax keywords within the theory

3433 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

3434 commands to be used in the same theory where defined.

3436 * Auxiliary contexts indicate block structure for specifications with

3437 additional parameters and assumptions. Such unnamed contexts may be

3438 nested within other targets, like 'theory', 'locale', 'class',

3439 'instantiation' etc. Results from the local context are generalized

3440 accordingly and applied to the enclosing target context. Example:

3442 context

3443 fixes x y z :: 'a

3444 assumes xy: "x = y" and yz: "y = z"

3445 begin

3447 lemma my_trans: "x = z" using xy yz by simp

3449 end

3451 thm my_trans

3453 The most basic application is to factor-out context elements of

3454 several fixes/assumes/shows theorem statements, e.g. see

3455 ~~/src/HOL/Isar_Examples/Group_Context.thy

3457 Any other local theory specification element works within the "context

3458 ... begin ... end" block as well.

3460 * Bundled declarations associate attributed fact expressions with a

3461 given name in the context. These may be later included in other

3462 contexts. This allows to manage context extensions casually, without

3463 the logical dependencies of locales and locale interpretation. See

3464 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

3466 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

3467 declaration, and results are standardized before being stored. Thus

3468 old-style "standard" after instantiation or composition of facts

3469 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

3470 indices of schematic variables.

3472 * Rule attributes in local theory declarations (e.g. locale or class)

3473 are now statically evaluated: the resulting theorem is stored instead

3474 of the original expression. INCOMPATIBILITY in rare situations, where

3475 the historic accident of dynamic re-evaluation in interpretations

3476 etc. was exploited.

3478 * New tutorial "Programming and Proving in Isabelle/HOL"

3479 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

3480 Structured Isar Proofs" ("isar-overview"), which has been removed. It

3481 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

3482 Logic" as the recommended beginners tutorial, but does not cover all

3483 of the material of that old tutorial.

3485 * Updated and extended reference manuals: "isar-ref",

3486 "implementation", "system"; reduced remaining material in old "ref"

3487 manual.

3490 *** Pure ***

3492 * Command 'definition' no longer exports the foundational "raw_def"

3493 into the user context. Minor INCOMPATIBILITY, may use the regular

3494 "def" result with attribute "abs_def" to imitate the old version.

3496 * Attribute "abs_def" turns an equation of the form "f x y == t" into

3497 "f == %x y. t", which ensures that "simp" or "unfold" steps always

3498 expand it. This also works for object-logic equality. (Formerly

3499 undocumented feature.)

3501 * Sort constraints are now propagated in simultaneous statements, just

3502 like type constraints. INCOMPATIBILITY in rare situations, where

3503 distinct sorts used to be assigned accidentally. For example:

3505 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

3507 lemma "P (x::'a)" and "Q (y::'a::bar)"

3508 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

3510 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

3511 tolerant against multiple unifiers, as long as the final result is

3512 unique. (As before, rules are composed in canonical right-to-left

3513 order to accommodate newly introduced premises.)

3515 * Renamed some inner syntax categories:

3517 num ~> num_token

3518 xnum ~> xnum_token

3519 xstr ~> str_token

3521 Minor INCOMPATIBILITY. Note that in practice "num_const" or

3522 "num_position" etc. are mainly used instead (which also include

3523 position information via constraints).

3525 * Simplified configuration options for syntax ambiguity: see

3526 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

3527 manual. Minor INCOMPATIBILITY.

3529 * Discontinued configuration option "syntax_positions": atomic terms

3530 in parse trees are always annotated by position constraints.

3532 * Old code generator for SML and its commands 'code_module',

3533 'code_library', 'consts_code', 'types_code' have been discontinued.

3534 Use commands of the generic code generator instead. INCOMPATIBILITY.

3536 * Redundant attribute "code_inline" has been discontinued. Use

3537 "code_unfold" instead. INCOMPATIBILITY.

3539 * Dropped attribute "code_unfold_post" in favor of the its dual

3540 "code_abbrev", which yields a common pattern in definitions like

3542 definition [code_abbrev]: "f = t"

3544 INCOMPATIBILITY.

3546 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

3547 instead. INCOMPATIBILITY.

3549 * Discontinued old "prems" fact, which used to refer to the accidental

3550 collection of foundational premises in the context (already marked as

3551 legacy since Isabelle2011).

3554 *** HOL ***

3556 * Type 'a set is now a proper type constructor (just as before

3557 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

3558 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

3559 sets separate, it is often sufficient to rephrase some set S that has

3560 been accidentally used as predicates by "%x. x : S", and some

3561 predicate P that has been accidentally used as set by "{x. P x}".

3562 Corresponding proofs in a first step should be pruned from any

3563 tinkering with former theorems mem_def and Collect_def as far as

3564 possible.

3566 For developments which deliberately mix predicates and sets, a

3567 planning step is necessary to determine what should become a predicate

3568 and what a set. It can be helpful to carry out that step in

3569 Isabelle2011-1 before jumping right into the current release.

3571 * Code generation by default implements sets as container type rather

3572 than predicates. INCOMPATIBILITY.

3574 * New type synonym 'a rel = ('a * 'a) set

3576 * The representation of numerals has changed. Datatype "num"

3577 represents strictly positive binary numerals, along with functions

3578 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent

3579 positive and negated numeric literals, respectively. See also

3580 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

3581 user theories may require adaptations as follows:

3583 - Theorems with number_ring or number_semiring constraints: These

3584 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

3586 - Theories defining numeric types: Remove number, number_semiring,

3587 and number_ring instances. Defer all theorems about numerals until

3588 after classes one and semigroup_add have been instantiated.

3590 - Numeral-only simp rules: Replace each rule having a "number_of v"

3591 pattern with two copies, one for numeral and one for neg_numeral.

3593 - Theorems about subclasses of semiring_1 or ring_1: These classes

3594 automatically support numerals now, so more simp rules and

3595 simprocs may now apply within the proof.

3597 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

3598 Redefine using other integer operations.

3600 * Transfer: New package intended to generalize the existing

3601 "descending" method and related theorem attributes from the Quotient

3602 package. (Not all functionality is implemented yet, but future

3603 development will focus on Transfer as an eventual replacement for the

3604 corresponding parts of the Quotient package.)

3606 - transfer_rule attribute: Maintains a collection of transfer rules,

3607 which relate constants at two different types. Transfer rules may

3608 relate different type instances of the same polymorphic constant,

3609 or they may relate an operation on a raw type to a corresponding

3610 operation on an abstract type (quotient or subtype). For example:

3612 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map

3613 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int

3615 - transfer method: Replaces a subgoal on abstract types with an

3616 equivalent subgoal on the corresponding raw types. Constants are

3617 replaced with corresponding ones according to the transfer rules.

3618 Goals are generalized over all free variables by default; this is

3619 necessary for variables whose types change, but can be overridden

3620 for specific variables with e.g. "transfer fixing: x y z". The

3621 variant transfer' method allows replacing a subgoal with one that

3622 is logically stronger (rather than equivalent).

3624 - relator_eq attribute: Collects identity laws for relators of

3625 various type constructors, e.g. "list_all2 (op =) = (op =)". The

3626 transfer method uses these lemmas to infer transfer rules for

3627 non-polymorphic constants on the fly.

3629 - transfer_prover method: Assists with proving a transfer rule for a

3630 new constant, provided the constant is defined in terms of other

3631 constants that already have transfer rules. It should be applied

3632 after unfolding the constant definitions.

3634 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

3635 from type nat to type int.

3637 * Lifting: New package intended to generalize the quotient_definition

3638 facility of the Quotient package; designed to work with Transfer.

3640 - lift_definition command: Defines operations on an abstract type in

3641 terms of a corresponding operation on a representation

3642 type. Example syntax:

3644 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"

3645 is List.insert

3647 Users must discharge a respectfulness proof obligation when each

3648 constant is defined. (For a type copy, i.e. a typedef with UNIV,

3649 the proof is discharged automatically.) The obligation is

3650 presented in a user-friendly, readable form; a respectfulness

3651 theorem in the standard format and a transfer rule are generated

3652 by the package.

3654 - Integration with code_abstype: For typedefs (e.g. subtypes

3655 corresponding to a datatype invariant, such as dlist),

3656 lift_definition generates a code certificate theorem and sets up

3657 code generation for each constant.

3659 - setup_lifting command: Sets up the Lifting package to work with a

3660 user-defined type. The user must provide either a quotient theorem

3661 or a type_definition theorem. The package configures transfer

3662 rules for equality and quantifiers on the type, and sets up the

3663 lift_definition command to work with the type.

3665 - Usage examples: See Quotient_Examples/Lift_DList.thy,

3666 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

3667 Word/Word.thy and Library/Float.thy.

3669 * Quotient package:

3671 - The 'quotient_type' command now supports a 'morphisms' option with

3672 rep and abs functions, similar to typedef.

3674 - 'quotient_type' sets up new types to work with the Lifting and

3675 Transfer packages, as with 'setup_lifting'.

3677 - The 'quotient_definition' command now requires the user to prove a

3678 respectfulness property at the point where the constant is

3679 defined, similar to lift_definition; INCOMPATIBILITY.

3681 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

3682 accordingly, INCOMPATIBILITY.

3684 * New diagnostic command 'find_unused_assms' to find potentially

3685 superfluous assumptions in theorems using Quickcheck.

3687 * Quickcheck:

3689 - Quickcheck returns variable assignments as counterexamples, which

3690 allows to reveal the underspecification of functions under test.

3691 For example, refuting "hd xs = x", it presents the variable

3692 assignment xs = [] and x = a1 as a counterexample, assuming that

3693 any property is false whenever "hd []" occurs in it.

3695 These counterexample are marked as potentially spurious, as

3696 Quickcheck also returns "xs = []" as a counterexample to the

3697 obvious theorem "hd xs = hd xs".

3699 After finding a potentially spurious counterexample, Quickcheck

3700 continues searching for genuine ones.

3702 By default, Quickcheck shows potentially spurious and genuine

3703 counterexamples. The option "genuine_only" sets quickcheck to only

3704 show genuine counterexamples.

3706 - The command 'quickcheck_generator' creates random and exhaustive

3707 value generators for a given type and operations.

3709 It generates values by using the operations as if they were

3710 constructors of that type.

3712 - Support for multisets.

3714 - Added "use_subtype" options.

3716 - Added "quickcheck_locale" configuration to specify how to process

3717 conjectures in a locale context.

3719 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

3720 and affecting 'rat' and 'real'.

3722 * Sledgehammer:

3723 - Integrated more tightly with SPASS, as described in the ITP 2012

3724 paper "More SPASS with Isabelle".

3725 - Made it try "smt" as a fallback if "metis" fails or times out.

3726 - Added support for the following provers: Alt-Ergo (via Why3 and

3727 TFF1), iProver, iProver-Eq.

3728 - Sped up the minimizer.

3729 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

3730 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

3731 - Renamed "sound" option to "strict".

3733 * Metis: Added possibility to specify lambda translations scheme as a

3734 parenthesized argument (e.g., "by (metis (lifting) ...)").

3736 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

3738 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

3740 * New "case_product" attribute to generate a case rule doing multiple

3741 case distinctions at the same time. E.g.

3743 list.exhaust [case_product nat.exhaust]

3745 produces a rule which can be used to perform case distinction on both

3746 a list and a nat.

3748 * New "eventually_elim" method as a generalized variant of the

3749 eventually_elim* rules. Supports structured proofs.

3751 * Typedef with implicit set definition is considered legacy. Use

3752 "typedef (open)" form instead, which will eventually become the

3753 default.

3755 * Record: code generation can be switched off manually with

3757 declare [[record_coden = false]] -- "default true"

3759 * Datatype: type parameters allow explicit sort constraints.

3761 * Concrete syntax for case expressions includes constraints for source

3762 positions, and thus produces Prover IDE markup for its bindings.

3763 INCOMPATIBILITY for old-style syntax translations that augment the

3764 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of

3765 one_case.

3767 * Clarified attribute "mono_set": pure declaration without modifying

3768 the result of the fact expression.

3770 * More default pred/set conversions on a couple of relation operations

3771 and predicates. Added powers of predicate relations. Consolidation

3772 of some relation theorems:

3774 converse_def ~> converse_unfold

3775 rel_comp_def ~> relcomp_unfold

3776 symp_def ~> (modified, use symp_def and sym_def instead)

3777 transp_def ~> transp_trans

3778 Domain_def ~> Domain_unfold

3779 Range_def ~> Domain_converse [symmetric]

3781 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

3783 See theory "Relation" for examples for making use of pred/set

3784 conversions by means of attributes "to_set" and "to_pred".

3786 INCOMPATIBILITY.

3788 * Renamed facts about the power operation on relations, i.e., relpow

3789 to match the constant's name:

3791 rel_pow_1 ~> relpow_1

3792 rel_pow_0_I ~> relpow_0_I

3793 rel_pow_Suc_I ~> relpow_Suc_I

3794 rel_pow_Suc_I2 ~> relpow_Suc_I2

3795 rel_pow_0_E ~> relpow_0_E

3796 rel_pow_Suc_E ~> relpow_Suc_E

3797 rel_pow_E ~> relpow_E

3798 rel_pow_Suc_D2 ~> relpow_Suc_D2

3799 rel_pow_Suc_E2 ~> relpow_Suc_E2

3800 rel_pow_Suc_D2' ~> relpow_Suc_D2'

3801 rel_pow_E2 ~> relpow_E2

3802 rel_pow_add ~> relpow_add

3803 rel_pow_commute ~> relpow

3804 rel_pow_empty ~> relpow_empty:

3805 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

3806 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

3807 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

3808 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

3809 rel_pow_fun_conv ~> relpow_fun_conv

3810 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

3811 rel_pow_finite_bounded ~> relpow_finite_bounded

3812 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

3813 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

3814 single_valued_rel_pow ~> single_valued_relpow

3816 INCOMPATIBILITY.

3818 * Theory Relation: Consolidated constant name for relation composition

3819 and corresponding theorem names:

3821 - Renamed constant rel_comp to relcomp.

3823 - Dropped abbreviation pred_comp. Use relcompp instead.

3825 - Renamed theorems:

3827 rel_compI ~> relcompI

3828 rel_compEpair ~> relcompEpair

3829 rel_compE ~> relcompE

3830 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

3831 rel_comp_empty1 ~> relcomp_empty1

3832 rel_comp_mono ~> relcomp_mono

3833 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

3834 rel_comp_distrib ~> relcomp_distrib

3835 rel_comp_distrib2 ~> relcomp_distrib2

3836 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

3837 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

3838 single_valued_rel_comp ~> single_valued_relcomp

3839 rel_comp_def ~> relcomp_unfold

3840 converse_rel_comp ~> converse_relcomp

3841 pred_compI ~> relcomppI

3842 pred_compE ~> relcomppE

3843 pred_comp_bot1 ~> relcompp_bot1

3844 pred_comp_bot2 ~> relcompp_bot2

3845 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

3846 pred_comp_mono ~> relcompp_mono

3847 pred_comp_distrib ~> relcompp_distrib

3848 pred_comp_distrib2 ~> relcompp_distrib2

3849 converse_pred_comp ~> converse_relcompp

3851 finite_rel_comp ~> finite_relcomp

3853 set_rel_comp ~> set_relcomp

3855 INCOMPATIBILITY.

3857 * Theory Divides: Discontinued redundant theorems about div and mod.

3858 INCOMPATIBILITY, use the corresponding generic theorems instead.

3860 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

3861 zdiv_self ~> div_self

3862 zmod_self ~> mod_self

3863 zdiv_zero ~> div_0

3864 zmod_zero ~> mod_0

3865 zdiv_zmod_equality ~> div_mod_equality2

3866 zdiv_zmod_equality2 ~> div_mod_equality

3867 zmod_zdiv_trivial ~> mod_div_trivial

3868 zdiv_zminus_zminus ~> div_minus_minus

3869 zmod_zminus_zminus ~> mod_minus_minus

3870 zdiv_zminus2 ~> div_minus_right

3871 zmod_zminus2 ~> mod_minus_right

3872 zdiv_minus1_right ~> div_minus1_right

3873 zmod_minus1_right ~> mod_minus1_right

3874 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

3875 zmod_zmult1_eq ~> mod_mult_right_eq

3876 zpower_zmod ~> power_mod

3877 zdvd_zmod ~> dvd_mod

3878 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

3879 mod_mult_distrib ~> mult_mod_left

3880 mod_mult_distrib2 ~> mult_mod_right

3882 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

3883 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

3885 * Finite_Set.fold now qualified. INCOMPATIBILITY.

3887 * Consolidated theorem names concerning fold combinators:

3889 inf_INFI_fold_inf ~> inf_INF_fold_inf

3890 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

3891 INFI_fold_inf ~> INF_fold_inf

3892 SUPR_fold_sup ~> SUP_fold_sup

3893 union_set ~> union_set_fold

3894 minus_set ~> minus_set_fold

3895 INFI_set_fold ~> INF_set_fold

3896 SUPR_set_fold ~> SUP_set_fold

3897 INF_code ~> INF_set_foldr

3898 SUP_code ~> SUP_set_foldr

3899 foldr.simps ~> foldr.simps (in point-free formulation)

3900 foldr_fold_rev ~> foldr_conv_fold

3901 foldl_fold ~> foldl_conv_fold

3902 foldr_foldr ~> foldr_conv_foldl

3903 foldl_foldr ~> foldl_conv_foldr

3904 fold_set_remdups ~> fold_set_fold_remdups

3905 fold_set ~> fold_set_fold

3906 fold1_set ~> fold1_set_fold

3908 INCOMPATIBILITY.

3910 * Dropped rarely useful theorems concerning fold combinators:

3911 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

3912 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

3913 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

3914 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

3915 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

3916 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

3917 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"

3918 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be

3919 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by

3920 unfolding "foldr_conv_fold" and "foldl_conv_fold".

3922 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

3923 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

3924 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

3925 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

3926 lemmas over fold rather than foldr, or make use of lemmas

3927 fold_conv_foldr and fold_rev.

3929 * Congruence rules Option.map_cong and Option.bind_cong for recursion

3930 through option types.

3932 * "Transitive_Closure.ntrancl": bounded transitive closure on

3933 relations.

3935 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

3937 * Theory Int: Discontinued many legacy theorems specific to type int.

3938 INCOMPATIBILITY, use the corresponding generic theorems instead.

3940 zminus_zminus ~> minus_minus

3941 zminus_0 ~> minus_zero

3942 zminus_zadd_distrib ~> minus_add_distrib

3943 zadd_commute ~> add_commute

3944 zadd_assoc ~> add_assoc

3945 zadd_left_commute ~> add_left_commute

3946 zadd_ac ~> add_ac

3947 zmult_ac ~> mult_ac

3948 zadd_0 ~> add_0_left

3949 zadd_0_right ~> add_0_right

3950 zadd_zminus_inverse2 ~> left_minus

3951 zmult_zminus ~> mult_minus_left

3952 zmult_commute ~> mult_commute

3953 zmult_assoc ~> mult_assoc

3954 zadd_zmult_distrib ~> left_distrib

3955 zadd_zmult_distrib2 ~> right_distrib

3956 zdiff_zmult_distrib ~> left_diff_distrib

3957 zdiff_zmult_distrib2 ~> right_diff_distrib

3958 zmult_1 ~> mult_1_left

3959 zmult_1_right ~> mult_1_right

3960 zle_refl ~> order_refl

3961 zle_trans ~> order_trans

3962 zle_antisym ~> order_antisym

3963 zle_linear ~> linorder_linear

3964 zless_linear ~> linorder_less_linear

3965 zadd_left_mono ~> add_left_mono

3966 zadd_strict_right_mono ~> add_strict_right_mono

3967 zadd_zless_mono ~> add_less_le_mono

3968 int_0_less_1 ~> zero_less_one

3969 int_0_neq_1 ~> zero_neq_one

3970 zless_le ~> less_le

3971 zpower_zadd_distrib ~> power_add

3972 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

3973 zero_le_zpower_abs ~> zero_le_power_abs

3975 * Theory Deriv: Renamed

3977 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

3979 * Theory Library/Multiset: Improved code generation of multisets.

3981 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

3982 are expressed via type classes again. The special syntax

3983 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

3984 setsum_set, which is now subsumed by Big_Operators.setsum.

3985 INCOMPATIBILITY.

3987 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

3988 use theory HOL/Library/Nat_Bijection instead.

3990 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

3991 trees is now inside a type class context. Names of affected

3992 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for

3993 theories working directly with raw red-black trees, adapt the names as

3994 follows:

3996 Operations:

3997 bulkload -> rbt_bulkload

3998 del_from_left -> rbt_del_from_left

3999 del_from_right -> rbt_del_from_right

4000 del -> rbt_del

4001 delete -> rbt_delete

4002 ins -> rbt_ins

4003 insert -> rbt_insert

4004 insertw -> rbt_insert_with

4005 insert_with_key -> rbt_insert_with_key

4006 map_entry -> rbt_map_entry

4007 lookup -> rbt_lookup

4008 sorted -> rbt_sorted

4009 tree_greater -> rbt_greater

4010 tree_less -> rbt_less

4011 tree_less_symbol -> rbt_less_symbol

4012 union -> rbt_union

4013 union_with -> rbt_union_with

4014 union_with_key -> rbt_union_with_key

4016 Lemmas:

4017 balance_left_sorted -> balance_left_rbt_sorted

4018 balance_left_tree_greater -> balance_left_rbt_greater

4019 balance_left_tree_less -> balance_left_rbt_less

4020 balance_right_sorted -> balance_right_rbt_sorted

4021 balance_right_tree_greater -> balance_right_rbt_greater

4022 balance_right_tree_less -> balance_right_rbt_less

4023 balance_sorted -> balance_rbt_sorted

4024 balance_tree_greater -> balance_rbt_greater

4025 balance_tree_less -> balance_rbt_less

4026 bulkload_is_rbt -> rbt_bulkload_is_rbt

4027 combine_sorted -> combine_rbt_sorted

4028 combine_tree_greater -> combine_rbt_greater

4029 combine_tree_less -> combine_rbt_less

4030 delete_in_tree -> rbt_delete_in_tree

4031 delete_is_rbt -> rbt_delete_is_rbt

4032 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

4033 del_from_left_tree_less -> rbt_del_from_left_rbt_less

4034 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

4035 del_from_right_tree_less -> rbt_del_from_right_rbt_less

4036 del_in_tree -> rbt_del_in_tree

4037 del_inv1_inv2 -> rbt_del_inv1_inv2

4038 del_sorted -> rbt_del_rbt_sorted

4039 del_tree_greater -> rbt_del_rbt_greater

4040 del_tree_less -> rbt_del_rbt_less

4041 dom_lookup_Branch -> dom_rbt_lookup_Branch

4042 entries_lookup -> entries_rbt_lookup

4043 finite_dom_lookup -> finite_dom_rbt_lookup

4044 insert_sorted -> rbt_insert_rbt_sorted

4045 insertw_is_rbt -> rbt_insertw_is_rbt

4046 insertwk_is_rbt -> rbt_insertwk_is_rbt

4047 insertwk_sorted -> rbt_insertwk_rbt_sorted

4048 insertw_sorted -> rbt_insertw_rbt_sorted

4049 ins_sorted -> ins_rbt_sorted

4050 ins_tree_greater -> ins_rbt_greater

4051 ins_tree_less -> ins_rbt_less

4052 is_rbt_sorted -> is_rbt_rbt_sorted

4053 lookup_balance -> rbt_lookup_balance

4054 lookup_bulkload -> rbt_lookup_rbt_bulkload

4055 lookup_delete -> rbt_lookup_rbt_delete

4056 lookup_Empty -> rbt_lookup_Empty

4057 lookup_from_in_tree -> rbt_lookup_from_in_tree

4058 lookup_in_tree -> rbt_lookup_in_tree

4059 lookup_ins -> rbt_lookup_ins

4060 lookup_insert -> rbt_lookup_rbt_insert

4061 lookup_insertw -> rbt_lookup_rbt_insertw

4062 lookup_insertwk -> rbt_lookup_rbt_insertwk

4063 lookup_keys -> rbt_lookup_keys

4064 lookup_map -> rbt_lookup_map

4065 lookup_map_entry -> rbt_lookup_rbt_map_entry

4066 lookup_tree_greater -> rbt_lookup_rbt_greater

4067 lookup_tree_less -> rbt_lookup_rbt_less

4068 lookup_union -> rbt_lookup_rbt_union

4069 map_entry_color_of -> rbt_map_entry_color_of

4070 map_entry_inv1 -> rbt_map_entry_inv1

4071 map_entry_inv2 -> rbt_map_entry_inv2

4072 map_entry_is_rbt -> rbt_map_entry_is_rbt

4073 map_entry_sorted -> rbt_map_entry_rbt_sorted

4074 map_entry_tree_greater -> rbt_map_entry_rbt_greater

4075 map_entry_tree_less -> rbt_map_entry_rbt_less

4076 map_tree_greater -> map_rbt_greater

4077 map_tree_less -> map_rbt_less

4078 map_sorted -> map_rbt_sorted

4079 paint_sorted -> paint_rbt_sorted

4080 paint_lookup -> paint_rbt_lookup

4081 paint_tree_greater -> paint_rbt_greater

4082 paint_tree_less -> paint_rbt_less

4083 sorted_entries -> rbt_sorted_entries

4084 tree_greater_eq_trans -> rbt_greater_eq_trans

4085 tree_greater_nit -> rbt_greater_nit

4086 tree_greater_prop -> rbt_greater_prop

4087 tree_greater_simps -> rbt_greater_simps

4088 tree_greater_trans -> rbt_greater_trans

4089 tree_less_eq_trans -> rbt_less_eq_trans

4090 tree_less_nit -> rbt_less_nit

4091 tree_less_prop -> rbt_less_prop

4092 tree_less_simps -> rbt_less_simps

4093 tree_less_trans -> rbt_less_trans

4094 tree_ord_props -> rbt_ord_props

4095 union_Branch -> rbt_union_Branch

4096 union_is_rbt -> rbt_union_is_rbt

4097 unionw_is_rbt -> rbt_unionw_is_rbt

4098 unionwk_is_rbt -> rbt_unionwk_is_rbt

4099 unionwk_sorted -> rbt_unionwk_rbt_sorted

4101 * Theory HOL/Library/Float: Floating point numbers are now defined as

4102 a subset of the real numbers. All operations are defined using the

4103 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

4105 Changed Operations:

4106 float_abs -> abs

4107 float_nprt -> nprt

4108 float_pprt -> pprt

4109 pow2 -> use powr

4110 round_down -> float_round_down

4111 round_up -> float_round_up

4112 scale -> exponent

4114 Removed Operations:

4115 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

4117 Renamed Lemmas:

4118 abs_float_def -> Float.compute_float_abs

4119 bitlen_ge0 -> bitlen_nonneg

4120 bitlen.simps -> Float.compute_bitlen

4121 float_components -> Float_mantissa_exponent

4122 float_divl.simps -> Float.compute_float_divl

4123 float_divr.simps -> Float.compute_float_divr

4124 float_eq_odd -> mult_powr_eq_mult_powr_iff

4125 float_power -> real_of_float_power

4126 lapprox_posrat_def -> Float.compute_lapprox_posrat

4127 lapprox_rat.simps -> Float.compute_lapprox_rat

4128 le_float_def' -> Float.compute_float_le

4129 le_float_def -> less_eq_float.rep_eq

4130 less_float_def' -> Float.compute_float_less

4131 less_float_def -> less_float.rep_eq

4132 normfloat_def -> Float.compute_normfloat

4133 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

4134 normfloat -> normfloat_def

4135 normfloat_unique -> use normfloat_def

4136 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

4137 one_float_def -> Float.compute_float_one

4138 plus_float_def -> Float.compute_float_plus

4139 rapprox_posrat_def -> Float.compute_rapprox_posrat

4140 rapprox_rat.simps -> Float.compute_rapprox_rat

4141 real_of_float_0 -> zero_float.rep_eq

4142 real_of_float_1 -> one_float.rep_eq

4143 real_of_float_abs -> abs_float.rep_eq

4144 real_of_float_add -> plus_float.rep_eq

4145 real_of_float_minus -> uminus_float.rep_eq

4146 real_of_float_mult -> times_float.rep_eq

4147 real_of_float_simp -> Float.rep_eq

4148 real_of_float_sub -> minus_float.rep_eq

4149 round_down.simps -> Float.compute_float_round_down

4150 round_up.simps -> Float.compute_float_round_up

4151 times_float_def -> Float.compute_float_times

4152 uminus_float_def -> Float.compute_float_uminus

4153 zero_float_def -> Float.compute_float_zero

4155 Lemmas not necessary anymore, use the transfer method:

4156 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

4157 float_divr, float_le_simp, float_less1_mantissa_bound,

4158 float_less_simp, float_less_zero, float_le_zero,

4159 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

4160 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

4161 lapprox_rat_bottom, normalized_float, rapprox_posrat,

4162 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

4163 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

4164 round_up, zero_le_float, zero_less_float

4166 * New theory HOL/Library/DAList provides an abstract type for

4167 association lists with distinct keys.

4169 * Session HOL/IMP: Added new theory of abstract interpretation of

4170 annotated commands.

4172 * Session HOL-Import: Re-implementation from scratch is faster,

4173 simpler, and more scalable. Requires a proof bundle, which is

4174 available as an external component. Discontinued old (and mostly

4175 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

4177 * Session HOL-Word: Discontinued many redundant theorems specific to

4178 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

4179 instead.

4181 word_sub_alt ~> word_sub_wi

4182 word_add_alt ~> word_add_def

4183 word_mult_alt ~> word_mult_def

4184 word_minus_alt ~> word_minus_def

4185 word_0_alt ~> word_0_wi

4186 word_1_alt ~> word_1_wi

4187 word_add_0 ~> add_0_left

4188 word_add_0_right ~> add_0_right

4189 word_mult_1 ~> mult_1_left

4190 word_mult_1_right ~> mult_1_right

4191 word_add_commute ~> add_commute

4192 word_add_assoc ~> add_assoc

4193 word_add_left_commute ~> add_left_commute

4194 word_mult_commute ~> mult_commute

4195 word_mult_assoc ~> mult_assoc

4196 word_mult_left_commute ~> mult_left_commute

4197 word_left_distrib ~> left_distrib

4198 word_right_distrib ~> right_distrib

4199 word_left_minus ~> left_minus

4200 word_diff_0_right ~> diff_0_right

4201 word_diff_self ~> diff_self

4202 word_sub_def ~> diff_minus

4203 word_diff_minus ~> diff_minus

4204 word_add_ac ~> add_ac

4205 word_mult_ac ~> mult_ac

4206 word_plus_ac0 ~> add_0_left add_0_right add_ac

4207 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

4208 word_order_trans ~> order_trans

4209 word_order_refl ~> order_refl

4210 word_order_antisym ~> order_antisym

4211 word_order_linear ~> linorder_linear

4212 lenw1_zero_neq_one ~> zero_neq_one

4213 word_number_of_eq ~> number_of_eq

4214 word_of_int_add_hom ~> wi_hom_add

4215 word_of_int_sub_hom ~> wi_hom_sub

4216 word_of_int_mult_hom ~> wi_hom_mult

4217 word_of_int_minus_hom ~> wi_hom_neg

4218 word_of_int_succ_hom ~> wi_hom_succ

4219 word_of_int_pred_hom ~> wi_hom_pred

4220 word_of_int_0_hom ~> word_0_wi

4221 word_of_int_1_hom ~> word_1_wi

4223 * Session HOL-Word: New proof method "word_bitwise" for splitting

4224 machine word equalities and inequalities into logical circuits,

4225 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

4226 multiplication, shifting by constants, bitwise operators and numeric

4227 constants. Requires fixed-length word types, not 'a word. Solves

4228 many standard word identities outright and converts more into first

4229 order problems amenable to blast or similar. See also examples in

4230 HOL/Word/Examples/WordExamples.thy.

4232 * Session HOL-Probability: Introduced the type "'a measure" to

4233 represent measures, this replaces the records 'a algebra and 'a

4234 measure_space. The locales based on subset_class now have two

4235 locale-parameters the space \<Omega> and the set of measurable sets M.

4236 The product of probability spaces uses now the same constant as the

4237 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

4238 measure". Most constants are defined now outside of locales and gain

4239 an additional parameter, like null_sets, almost_eventually or \<mu>'.

4240 Measure space constructions for distributions and densities now got

4241 their own constants distr and density. Instead of using locales to

4242 describe measure spaces with a finite space, the measure count_space

4243 and point_measure is introduced. INCOMPATIBILITY.

4245 Renamed constants:

4246 measure -> emeasure

4247 finite_measure.\<mu>' -> measure

4248 product_algebra_generator -> prod_algebra

4249 product_prob_space.emb -> prod_emb

4250 product_prob_space.infprod_algebra -> PiM

4252 Removed locales:

4253 completeable_measure_space

4254 finite_measure_space

4255 finite_prob_space

4256 finite_product_finite_prob_space

4257 finite_product_sigma_algebra

4258 finite_sigma_algebra

4259 measure_space

4260 pair_finite_prob_space

4261 pair_finite_sigma_algebra

4262 pair_finite_space

4263 pair_sigma_algebra

4264 product_sigma_algebra

4266 Removed constants:

4267 conditional_space

4268 distribution -> use distr measure, or distributed predicate

4269 image_space

4270 joint_distribution -> use distr measure, or distributed predicate

4271 pair_measure_generator

4272 product_prob_space.infprod_algebra -> use PiM

4273 subvimage

4275 Replacement theorems:

4276 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

4277 finite_measure.empty_measure -> measure_empty

4278 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

4279 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

4280 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

4281 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

4282 finite_measure.finite_measure -> finite_measure.emeasure_finite

4283 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

4284 finite_measure.positive_measure' -> measure_nonneg

4285 finite_measure.real_measure -> finite_measure.emeasure_real

4286 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

4287 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

4288 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

4289 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

4290 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

4291 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

4292 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

4293 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

4294 information_space.entropy_commute -> information_space.entropy_commute_simple

4295 information_space.entropy_eq -> information_space.entropy_simple_distributed

4296 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

4297 information_space.entropy_positive -> information_space.entropy_nonneg_simple

4298 information_space.entropy_uniform_max -> information_space.entropy_uniform

4299 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

4300 information_space.KL_eq_0 -> information_space.KL_same_eq_0

4301 information_space.KL_ge_0 -> information_space.KL_nonneg

4302 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

4303 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

4304 Int_stable_cuboids -> Int_stable_atLeastAtMost

4305 Int_stable_product_algebra_generator -> positive_integral

4306 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

4307 measure_space.additive -> emeasure_additive

4308 measure_space.AE_iff_null_set -> AE_iff_null

4309 measure_space.almost_everywhere_def -> eventually_ae_filter

4310 measure_space.almost_everywhere_vimage -> AE_distrD

4311 measure_space.continuity_from_above -> INF_emeasure_decseq

4312 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

4313 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

4314 measure_space.continuity_from_below -> SUP_emeasure_incseq

4315 measure_space_density -> emeasure_density

4316 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

4317 measure_space.integrable_vimage -> integrable_distr

4318 measure_space.integral_translated_density -> integral_density

4319 measure_space.integral_vimage -> integral_distr

4320 measure_space.measure_additive -> plus_emeasure

4321 measure_space.measure_compl -> emeasure_compl

4322 measure_space.measure_countable_increasing -> emeasure_countable_increasing

4323 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

4324 measure_space.measure_decseq -> decseq_emeasure

4325 measure_space.measure_Diff -> emeasure_Diff

4326 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

4327 measure_space.measure_eq_0 -> emeasure_eq_0

4328 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

4329 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

4330 measure_space.measure_incseq -> incseq_emeasure

4331 measure_space.measure_insert -> emeasure_insert

4332 measure_space.measure_mono -> emeasure_mono

4333 measure_space.measure_not_negative -> emeasure_not_MInf

4334 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

4335 measure_space.measure_setsum -> setsum_emeasure

4336 measure_space.measure_setsum_split -> setsum_emeasure_cover

4337 measure_space.measure_space_vimage -> emeasure_distr

4338 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

4339 measure_space.measure_subadditive -> subadditive

4340 measure_space.measure_top -> emeasure_space

4341 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

4342 measure_space.measure_Un_null_set -> emeasure_Un_null_set

4343 measure_space.positive_integral_translated_density -> positive_integral_density

4344 measure_space.positive_integral_vimage -> positive_integral_distr

4345 measure_space.real_continuity_from_above -> Lim_measure_decseq

4346 measure_space.real_continuity_from_below -> Lim_measure_incseq

4347 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

4348 measure_space.real_measure_Diff -> measure_Diff

4349 measure_space.real_measure_finite_Union -> measure_finite_Union

4350 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

4351 measure_space.real_measure_subadditive -> measure_subadditive

4352 measure_space.real_measure_Union -> measure_Union

4353 measure_space.real_measure_UNION -> measure_UNION

4354 measure_space.simple_function_vimage -> simple_function_comp

4355 measure_space.simple_integral_vimage -> simple_integral_distr

4356 measure_space.simple_integral_vimage -> simple_integral_distr

4357 measure_unique_Int_stable -> measure_eqI_generator_eq

4358 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

4359 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

4360 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

4361 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

4362 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

4363 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

4364 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

4365 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

4366 pair_sigma_algebra.sets_swap -> sets_pair_swap

4367 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

4368 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

4369 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

4370 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

4371 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

4372 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

4373 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

4374 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

4375 prob_space.measure_space_1 -> prob_space.emeasure_space_1

4376 prob_space.prob_space_vimage -> prob_space_distr

4377 prob_space.random_variable_restrict -> measurable_restrict

4378 prob_space_unique_Int_stable -> measure_eqI_prob_space

4379 product_algebraE -> prod_algebraE_all

4380 product_algebra_generator_der -> prod_algebra_eq_finite

4381 product_algebra_generator_into_space -> prod_algebra_sets_into_space

4382 product_algebraI -> sets_PiM_I_finite

4383 product_measure_exists -> product_sigma_finite.sigma_finite

4384 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

4385 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

4386 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

4387 product_prob_space.measurable_component -> measurable_component_singleton

4388 product_prob_space.measurable_emb -> measurable_prod_emb

4389 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

4390 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

4391 product_prob_space.measure_emb -> emeasure_prod_emb

4392 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

4393 product_sigma_algebra.product_algebra_into_space -> space_closed

4394 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

4395 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

4396 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

4397 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

4398 sets_product_algebra -> sets_PiM

4399 sigma_algebra.measurable_sigma -> measurable_measure_of

4400 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

4401 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

4402 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

4403 space_product_algebra -> space_PiM

4405 * Session HOL-TPTP: support to parse and import TPTP problems (all

4406 languages) into Isabelle/HOL.

4409 *** FOL ***

4411 * New "case_product" attribute (see HOL).

4414 *** ZF ***

4416 * Greater support for structured proofs involving induction or case

4417 analysis.

4419 * Much greater use of mathematical symbols.

4421 * Removal of many ML theorem bindings. INCOMPATIBILITY.

4424 *** ML ***

4426 * Antiquotation @{keyword "name"} produces a parser for outer syntax

4427 from a minor keyword introduced via theory header declaration.

4429 * Antiquotation @{command_spec "name"} produces the

4430 Outer_Syntax.command_spec from a major keyword introduced via theory

4431 header declaration; it can be passed to Outer_Syntax.command etc.

4433 * Local_Theory.define no longer hard-wires default theorem name

4434 "foo_def", but retains the binding as given. If that is Binding.empty

4435 / Attrib.empty_binding, the result is not registered as user-level

4436 fact. The Local_Theory.define_internal variant allows to specify a

4437 non-empty name (used for the foundation in the background theory),

4438 while omitting the fact binding in the user-context. Potential

4439 INCOMPATIBILITY for derived definitional packages: need to specify

4440 naming policy for primitive definitions more explicitly.

4442 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

4443 conformance with similar operations in structure Term and Logic.

4445 * Antiquotation @{attributes [...]} embeds attribute source

4446 representation into the ML text, which is particularly useful with

4447 declarations like Local_Theory.note.

4449 * Structure Proof_Context follows standard naming scheme. Old

4450 ProofContext has been discontinued. INCOMPATIBILITY.

4452 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

4453 change of semantics: update is applied to auxiliary local theory

4454 context as well.

4456 * Modernized some old-style infix operations:

4458 addeqcongs ~> Simplifier.add_eqcong

4459 deleqcongs ~> Simplifier.del_eqcong

4460 addcongs ~> Simplifier.add_cong

4461 delcongs ~> Simplifier.del_cong

4462 setmksimps ~> Simplifier.set_mksimps

4463 setmkcong ~> Simplifier.set_mkcong

4464 setmksym ~> Simplifier.set_mksym

4465 setmkeqTrue ~> Simplifier.set_mkeqTrue

4466 settermless ~> Simplifier.set_termless

4467 setsubgoaler ~> Simplifier.set_subgoaler

4468 addsplits ~> Splitter.add_split

4469 delsplits ~> Splitter.del_split

4472 *** System ***

4474 * USER_HOME settings variable points to cross-platform user home

4475 directory, which coincides with HOME on POSIX systems only. Likewise,

4476 the Isabelle path specification "~" now expands to $USER_HOME, instead

4477 of former $HOME. A different default for USER_HOME may be set

4478 explicitly in shell environment, before Isabelle settings are

4479 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

4480 the generic user home was intended.

4482 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

4483 notation, which is useful for the jEdit file browser, for example.

4485 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

4486 (not just JRE).

4490 New in Isabelle2011-1 (October 2011)

4491 ------------------------------------

4493 *** General ***

4495 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

4496 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

4498 - Management of multiple theory files directly from the editor

4499 buffer store -- bypassing the file-system (no requirement to save

4500 files for checking).

4502 - Markup of formal entities within the text buffer, with semantic

4503 highlighting, tooltips and hyperlinks to jump to defining source

4504 positions.

4506 - Improved text rendering, with sub/superscripts in the source

4507 buffer (including support for copy/paste wrt. output panel, HTML

4508 theory output and other non-Isabelle text boxes).

4510 - Refined scheduling of proof checking and printing of results,

4511 based on interactive editor view. (Note: jEdit folding and

4512 narrowing allows to restrict buffer perspectives explicitly.)

4514 - Reduced CPU performance requirements, usable on machines with few

4515 cores.

4517 - Reduced memory requirements due to pruning of unused document

4518 versions (garbage collection).

4520 See also ~~/src/Tools/jEdit/README.html for further information,

4521 including some remaining limitations.

4523 * Theory loader: source files are exclusively located via the master

4524 directory of each theory node (where the .thy file itself resides).

4525 The global load path (such as src/HOL/Library) has been discontinued.

4526 Note that the path element ~~ may be used to reference theories in the

4527 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".

4528 INCOMPATIBILITY.

4530 * Theory loader: source files are identified by content via SHA1

4531 digests. Discontinued former path/modtime identification and optional

4532 ISABELLE_FILE_IDENT plugin scripts.

4534 * Parallelization of nested Isar proofs is subject to

4535 Goal.parallel_proofs_threshold (default 100). See also isabelle

4536 usedir option -Q.

4538 * Name space: former unsynchronized references are now proper

4539 configuration options, with more conventional names:

4541 long_names ~> names_long

4542 short_names ~> names_short

4543 unique_names ~> names_unique

4545 Minor INCOMPATIBILITY, need to declare options in context like this:

4547 declare [[names_unique = false]]

4549 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note

4550 that the result needs to be unique, which means fact specifications

4551 may have to be refined after enriching a proof context.

4553 * Attribute "case_names" has been refined: the assumptions in each case

4554 can be named now by following the case name with [name1 name2 ...].

4556 * Isabelle/Isar reference manual has been updated and extended:

4557 - "Synopsis" provides a catalog of main Isar language concepts.

4558 - Formal references in syntax diagrams, via @{rail} antiquotation.

4559 - Updated material from classic "ref" manual, notably about

4560 "Classical Reasoner".

4563 *** HOL ***

4565 * Class bot and top require underlying partial order rather than

4566 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.

4568 * Class complete_lattice: generalized a couple of lemmas from sets;

4569 generalized theorems INF_cong and SUP_cong. New type classes for

4570 complete boolean algebras and complete linear orders. Lemmas

4571 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in

4572 class complete_linorder.

4574 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,

4575 Sup_fun_def, Inf_apply, Sup_apply.

4577 Removed redundant lemmas (the right hand side gives hints how to

4578 replace them for (metis ...), or (simp only: ...) proofs):

4580 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]

4581 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]

4582 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right

4583 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right

4584 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right

4585 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right

4586 Inter_def ~> INF_def, image_def

4587 Union_def ~> SUP_def, image_def

4588 INT_eq ~> INF_def, and image_def

4589 UN_eq ~> SUP_def, and image_def

4590 INF_subset ~> INF_superset_mono [OF _ order_refl]

4592 More consistent and comprehensive names:

4594 INTER_eq_Inter_image ~> INF_def

4595 UNION_eq_Union_image ~> SUP_def

4596 INFI_def ~> INF_def

4597 SUPR_def ~> SUP_def

4598 INF_leI ~> INF_lower

4599 INF_leI2 ~> INF_lower2

4600 le_INFI ~> INF_greatest

4601 le_SUPI ~> SUP_upper

4602 le_SUPI2 ~> SUP_upper2

4603 SUP_leI ~> SUP_least

4604 INFI_bool_eq ~> INF_bool_eq

4605 SUPR_bool_eq ~> SUP_bool_eq

4606 INFI_apply ~> INF_apply

4607 SUPR_apply ~> SUP_apply

4608 INTER_def ~> INTER_eq

4609 UNION_def ~> UNION_eq

4611 INCOMPATIBILITY.

4613 * Renamed theory Complete_Lattice to Complete_Lattices.

4614 INCOMPATIBILITY.

4616 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,

4617 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,

4618 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,

4619 Sup_insert are now declared as [simp]. INCOMPATIBILITY.

4621 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,

4622 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,

4623 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor

4624 INCOMPATIBILITY.

4626 * Added syntactic classes "inf" and "sup" for the respective

4627 constants. INCOMPATIBILITY: Changes in the argument order of the

4628 (mostly internal) locale predicates for some derived classes.

4630 * Theorem collections ball_simps and bex_simps do not contain theorems

4631 referring to UNION any longer; these have been moved to collection

4632 UN_ball_bex_simps. INCOMPATIBILITY.

4634 * Theory Archimedean_Field: floor now is defined as parameter of a

4635 separate type class floor_ceiling.

4637 * Theory Finite_Set: more coherent development of fold_set locales:

4639 locale fun_left_comm ~> locale comp_fun_commute

4640 locale fun_left_comm_idem ~> locale comp_fun_idem

4642 Both use point-free characterization; interpretation proofs may need

4643 adjustment. INCOMPATIBILITY.

4645 * Theory Limits: Type "'a net" has been renamed to "'a filter", in

4646 accordance with standard mathematical terminology. INCOMPATIBILITY.

4648 * Theory Complex_Main: The locale interpretations for the

4649 bounded_linear and bounded_bilinear locales have been removed, in

4650 order to reduce the number of duplicate lemmas. Users must use the

4651 original names for distributivity theorems, potential INCOMPATIBILITY.

4653 divide.add ~> add_divide_distrib

4654 divide.diff ~> diff_divide_distrib

4655 divide.setsum ~> setsum_divide_distrib

4656 mult.add_right ~> right_distrib

4657 mult.diff_right ~> right_diff_distrib

4658 mult_right.setsum ~> setsum_right_distrib

4659 mult_left.diff ~> left_diff_distrib

4661 * Theory Complex_Main: Several redundant theorems have been removed or

4662 replaced by more general versions. INCOMPATIBILITY.

4664 real_diff_def ~> minus_real_def

4665 real_divide_def ~> divide_real_def

4666 real_less_def ~> less_le

4667 real_abs_def ~> abs_real_def

4668 real_sgn_def ~> sgn_real_def

4669 real_mult_commute ~> mult_commute

4670 real_mult_assoc ~> mult_assoc

4671 real_mult_1 ~> mult_1_left

4672 real_add_mult_distrib ~> left_distrib

4673 real_zero_not_eq_one ~> zero_neq_one

4674 real_mult_inverse_left ~> left_inverse

4675 INVERSE_ZERO ~> inverse_zero

4676 real_le_refl ~> order_refl

4677 real_le_antisym ~> order_antisym

4678 real_le_trans ~> order_trans

4679 real_le_linear ~> linear

4680 real_le_eq_diff ~> le_iff_diff_le_0

4681 real_add_left_mono ~> add_left_mono

4682 real_mult_order ~> mult_pos_pos

4683 real_mult_less_mono2 ~> mult_strict_left_mono

4684 real_of_int_real_of_nat ~> real_of_int_of_nat_eq

4685 real_0_le_divide_iff ~> zero_le_divide_iff

4686 realpow_two_disj ~> power2_eq_iff

4687 real_squared_diff_one_factored ~> square_diff_one_factored

4688 realpow_two_diff ~> square_diff_square_factored

4689 reals_complete2 ~> complete_real

4690 real_sum_squared_expand ~> power2_sum

4691 exp_ln_eq ~> ln_unique

4692 expi_add ~> exp_add

4693 expi_zero ~> exp_zero

4694 lemma_DERIV_subst ~> DERIV_cong

4695 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff

4696 LIMSEQ_const ~> tendsto_const

4697 LIMSEQ_norm ~> tendsto_norm

4698 LIMSEQ_add ~> tendsto_add

4699 LIMSEQ_minus ~> tendsto_minus

4700 LIMSEQ_minus_cancel ~> tendsto_minus_cancel

4701 LIMSEQ_diff ~> tendsto_diff

4702 bounded_linear.LIMSEQ ~> bounded_linear.tendsto

4703 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto

4704 LIMSEQ_mult ~> tendsto_mult

4705 LIMSEQ_inverse ~> tendsto_inverse

4706 LIMSEQ_divide ~> tendsto_divide

4707 LIMSEQ_pow ~> tendsto_power

4708 LIMSEQ_setsum ~> tendsto_setsum

4709 LIMSEQ_setprod ~> tendsto_setprod

4710 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff

4711 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff

4712 LIMSEQ_imp_rabs ~> tendsto_rabs

4713 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]

4714 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]

4715 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]

4716 LIMSEQ_Complex ~> tendsto_Complex

4717 LIM_ident ~> tendsto_ident_at

4718 LIM_const ~> tendsto_const

4719 LIM_add ~> tendsto_add

4720 LIM_add_zero ~> tendsto_add_zero

4721 LIM_minus ~> tendsto_minus

4722 LIM_diff ~> tendsto_diff

4723 LIM_norm ~> tendsto_norm

4724 LIM_norm_zero ~> tendsto_norm_zero

4725 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel

4726 LIM_norm_zero_iff ~> tendsto_norm_zero_iff

4727 LIM_rabs ~> tendsto_rabs

4728 LIM_rabs_zero ~> tendsto_rabs_zero

4729 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel

4730 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff

4731 LIM_compose ~> tendsto_compose

4732 LIM_mult ~> tendsto_mult

4733 LIM_scaleR ~> tendsto_scaleR

4734 LIM_of_real ~> tendsto_of_real

4735 LIM_power ~> tendsto_power

4736 LIM_inverse ~> tendsto_inverse

4737 LIM_sgn ~> tendsto_sgn

4738 isCont_LIM_compose ~> isCont_tendsto_compose

4739 bounded_linear.LIM ~> bounded_linear.tendsto

4740 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero

4741 bounded_bilinear.LIM ~> bounded_bilinear.tendsto

4742 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero

4743 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero

4744 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero

4745 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]

4747 * Theory Complex_Main: The definition of infinite series was

4748 generalized. Now it is defined on the type class {topological_space,

4749 comm_monoid_add}. Hence it is useable also for extended real numbers.

4751 * Theory Complex_Main: The complex exponential function "expi" is now

4752 a type-constrained abbreviation for "exp :: complex => complex"; thus

4753 several polymorphic lemmas about "exp" are now applicable to "expi".

4755 * Code generation:

4757 - Theory Library/Code_Char_ord provides native ordering of

4758 characters in the target language.

4760 - Commands code_module and code_library are legacy, use export_code

4761 instead.

4763 - Method "evaluation" is legacy, use method "eval" instead.

4765 - Legacy evaluator "SML" is deactivated by default. May be

4766 reactivated by the following theory command:

4768 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}

4770 * Declare ext [intro] by default. Rare INCOMPATIBILITY.

4772 * New proof method "induction" that gives induction hypotheses the

4773 name "IH", thus distinguishing them from further hypotheses that come

4774 from rule induction. The latter are still called "hyps". Method

4775 "induction" is a thin wrapper around "induct" and follows the same

4776 syntax.

4778 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is

4779 still available as a legacy feature for some time.

4781 * Nitpick:

4782 - Added "need" and "total_consts" options.

4783 - Reintroduced "show_skolems" option by popular demand.

4784 - Renamed attribute: nitpick_def ~> nitpick_unfold.

4785 INCOMPATIBILITY.

4787 * Sledgehammer:

4788 - Use quasi-sound (and efficient) translations by default.

4789 - Added support for the following provers: E-ToFoF, LEO-II,

4790 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.

4791 - Automatically preplay and minimize proofs before showing them if

4792 this can be done within reasonable time.

4793 - sledgehammer available_provers ~> sledgehammer supported_provers.

4794 INCOMPATIBILITY.

4795 - Added "preplay_timeout", "slicing", "type_enc", "sound",

4796 "max_mono_iters", and "max_new_mono_instances" options.

4797 - Removed "explicit_apply" and "full_types" options as well as "Full

4798 Types" Proof General menu item. INCOMPATIBILITY.

4800 * Metis:

4801 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.

4802 - Obsoleted "metisFT" -- use "metis (full_types)" instead.

4803 INCOMPATIBILITY.

4805 * Command 'try':

4806 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and

4807 "elim:" options. INCOMPATIBILITY.

4808 - Introduced 'try' that not only runs 'try_methods' but also

4809 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.

4811 * Quickcheck:

4812 - Added "eval" option to evaluate terms for the found counterexample

4813 (currently only supported by the default (exhaustive) tester).

4814 - Added post-processing of terms to obtain readable counterexamples

4815 (currently only supported by the default (exhaustive) tester).

4816 - New counterexample generator quickcheck[narrowing] enables

4817 narrowing-based testing. Requires the Glasgow Haskell compiler

4818 with its installation location defined in the Isabelle settings

4819 environment as ISABELLE_GHC.

4820 - Removed quickcheck tester "SML" based on the SML code generator

4821 (formly in HOL/Library).

4823 * Function package: discontinued option "tailrec". INCOMPATIBILITY,

4824 use 'partial_function' instead.

4826 * Theory Library/Extended_Reals replaces now the positive extended

4827 reals found in probability theory. This file is extended by

4828 Multivariate_Analysis/Extended_Real_Limits.

4830 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,

4831 from where it must be imported explicitly if it is really required.

4832 INCOMPATIBILITY.

4834 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has

4835 been moved here. INCOMPATIBILITY.

4837 * Theory Library/Saturated provides type of numbers with saturated

4838 arithmetic.

4840 * Theory Library/Product_Lattice defines a pointwise ordering for the

4841 product type 'a * 'b, and provides instance proofs for various order

4842 and lattice type classes.

4844 * Theory Library/Countable now provides the "countable_datatype" proof

4845 method for proving "countable" class instances for datatypes.

4847 * Theory Library/Cset_Monad allows do notation for computable sets

4848 (cset) via the generic monad ad-hoc overloading facility.

4850 * Library: Theories of common data structures are split into theories

4851 for implementation, an invariant-ensuring type, and connection to an

4852 abstract type. INCOMPATIBILITY.

4854 - RBT is split into RBT and RBT_Mapping.

4855 - AssocList is split and renamed into AList and AList_Mapping.

4856 - DList is split into DList_Impl, DList, and DList_Cset.

4857 - Cset is split into Cset and List_Cset.

4859 * Theory Library/Nat_Infinity has been renamed to

4860 Library/Extended_Nat, with name changes of the following types and

4861 constants:

4863 type inat ~> type enat

4864 Fin ~> enat

4865 Infty ~> infinity (overloaded)

4866 iSuc ~> eSuc

4867 the_Fin ~> the_enat

4869 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has

4870 been renamed accordingly. INCOMPATIBILITY.

4872 * Session Multivariate_Analysis: The euclidean_space type class now

4873 fixes a constant "Basis :: 'a set" consisting of the standard

4874 orthonormal basis for the type. Users now have the option of

4875 quantifying over this set instead of using the "basis" function, e.g.

4876 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".

4878 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed

4879 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants

4880 "Cart_nth" and "Cart_lambda" have been respectively renamed to

4881 "vec_nth" and "vec_lambda"; theorems mentioning those names have

4882 changed to match. Definition theorems for overloaded constants now use

4883 the standard "foo_vec_def" naming scheme. A few other theorems have

4884 been renamed as follows (INCOMPATIBILITY):

4886 Cart_eq ~> vec_eq_iff

4887 dist_nth_le_cart ~> dist_vec_nth_le

4888 tendsto_vector ~> vec_tendstoI

4889 Cauchy_vector ~> vec_CauchyI

4891 * Session Multivariate_Analysis: Several duplicate theorems have been

4892 removed, and other theorems have been renamed or replaced with more

4893 general versions. INCOMPATIBILITY.

4895 finite_choice ~> finite_set_choice

4896 eventually_conjI ~> eventually_conj

4897 eventually_and ~> eventually_conj_iff

4898 eventually_false ~> eventually_False

4899 setsum_norm ~> norm_setsum

4900 Lim_sequentially ~> LIMSEQ_def

4901 Lim_ident_at ~> LIM_ident

4902 Lim_const ~> tendsto_const

4903 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]

4904 Lim_neg ~> tendsto_minus

4905 Lim_add ~> tendsto_add

4906 Lim_sub ~> tendsto_diff

4907 Lim_mul ~> tendsto_scaleR

4908 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]

4909 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]

4910 Lim_linear ~> bounded_linear.tendsto

4911 Lim_component ~> tendsto_euclidean_component

4912 Lim_component_cart ~> tendsto_vec_nth

4913 Lim_inner ~> tendsto_inner [OF tendsto_const]

4914 dot_lsum ~> inner_setsum_left

4915 dot_rsum ~> inner_setsum_right

4916 continuous_cmul ~> continuous_scaleR [OF continuous_const]

4917 continuous_neg ~> continuous_minus

4918 continuous_sub ~> continuous_diff

4919 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]

4920 continuous_mul ~> continuous_scaleR

4921 continuous_inv ~> continuous_inverse

4922 continuous_at_within_inv ~> continuous_at_within_inverse

4923 continuous_at_inv ~> continuous_at_inverse

4924 continuous_at_norm ~> continuous_norm [OF continuous_at_id]

4925 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]

4926 continuous_at_component ~> continuous_component [OF continuous_at_id]

4927 continuous_on_neg ~> continuous_on_minus

4928 continuous_on_sub ~> continuous_on_diff

4929 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]

4930 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]

4931 continuous_on_mul ~> continuous_on_scaleR

4932 continuous_on_mul_real ~> continuous_on_mult

4933 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]

4934 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]

4935 continuous_on_inverse ~> continuous_on_inv

4936 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus

4937 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff

4938 subset_interior ~> interior_mono

4939 subset_closure ~> closure_mono

4940 closure_univ ~> closure_UNIV

4941 real_arch_lt ~> reals_Archimedean2

4942 real_arch ~> reals_Archimedean3

4943 real_abs_norm ~> abs_norm_cancel

4944 real_abs_sub_norm ~> norm_triangle_ineq3

4945 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2

4947 * Session HOL-Probability:

4948 - Caratheodory's extension lemma is now proved for ring_of_sets.

4949 - Infinite products of probability measures are now available.

4950 - Sigma closure is independent, if the generator is independent

4951 - Use extended reals instead of positive extended

4952 reals. INCOMPATIBILITY.

4954 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.

4956 expand_fun_below ~> fun_below_iff

4957 below_fun_ext ~> fun_belowI

4958 expand_cfun_eq ~> cfun_eq_iff

4959 ext_cfun ~> cfun_eqI

4960 expand_cfun_below ~> cfun_below_iff

4961 below_cfun_ext ~> cfun_belowI

4962 monofun_fun_fun ~> fun_belowD

4963 monofun_fun_arg ~> monofunE

4964 monofun_lub_fun ~> adm_monofun [THEN admD]

4965 cont_lub_fun ~> adm_cont [THEN admD]

4966 cont2cont_Rep_CFun ~> cont2cont_APP

4967 cont_Rep_CFun_app ~> cont_APP_app

4968 cont_Rep_CFun_app_app ~> cont_APP_app_app

4969 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]

4970 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]

4971 contlub_cfun ~> lub_APP [symmetric]

4972 contlub_LAM ~> lub_LAM [symmetric]

4973 thelubI ~> lub_eqI

4974 UU_I ~> bottomI

4975 lift_distinct1 ~> lift.distinct(1)

4976 lift_distinct2 ~> lift.distinct(2)

4977 Def_not_UU ~> lift.distinct(2)

4978 Def_inject ~> lift.inject

4979 below_UU_iff ~> below_bottom_iff

4980 eq_UU_iff ~> eq_bottom_iff

4983 *** Document preparation ***

4985 * Antiquotation @{rail} layouts railroad syntax diagrams, see also

4986 isar-ref manual, both for description and actual application of the

4987 same.

4989 * Antiquotation @{value} evaluates the given term and presents its

4990 result.

4992 * Antiquotations: term style "isub" provides ad-hoc conversion of

4993 variables x1, y23 into subscripted form x\<^isub>1,

4994 y\<^isub>2\<^isub>3.

4996 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>

4997 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).

4999 * Localized \isabellestyle switch can be used within blocks or groups

5000 like this:

5002 \isabellestyle{it} %preferred default

5003 {\isabellestylett @{text "typewriter stuff"}}

5005 * Discontinued special treatment of hard tabulators. Implicit

5006 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual

5007 layouts.

5010 *** ML ***

5012 * The inner syntax of sort/type/term/prop supports inlined YXML

5013 representations within quoted string tokens. By encoding logical

5014 entities via Term_XML (in ML or Scala) concrete syntax can be

5015 bypassed, which is particularly useful for producing bits of text

5016 under external program control.

5018 * Antiquotations for ML and document preparation are managed as theory

5019 data, which requires explicit setup.

5021 * Isabelle_Process.is_active allows tools to check if the official

5022 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop

5023 (better known as Proof General).

5025 * Structure Proof_Context follows standard naming scheme. Old

5026 ProofContext is still available for some time as legacy alias.

5028 * Structure Timing provides various operations for timing; supersedes

5029 former start_timing/end_timing etc.

5031 * Path.print is the official way to show file-system paths to users

5032 (including quotes etc.).

5034 * Inner syntax: identifiers in parse trees of generic categories

5035 "logic", "aprop", "idt" etc. carry position information (disguised as

5036 type constraints). Occasional INCOMPATIBILITY with non-compliant

5037 translations that choke on unexpected type constraints. Positions can

5038 be stripped in ML translations via Syntax.strip_positions /

5039 Syntax.strip_positions_ast, or via the syntax constant

5040 "_strip_positions" within parse trees. As last resort, positions can

5041 be disabled via the configuration option Syntax.positions, which is

5042 called "syntax_positions" in Isar attribute syntax.

5044 * Discontinued special status of various ML structures that contribute

5045 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less

5046 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,

5047 refer directly to Ast.Constant, Lexicon.is_identifier,

5048 Syntax_Trans.mk_binder_tr etc.

5050 * Typed print translation: discontinued show_sorts argument, which is

5051 already available via context of "advanced" translation.

5053 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic

5054 goal states; body tactic needs to address all subgoals uniformly.

5056 * Slightly more special eq_list/eq_set, with shortcut involving

5057 pointer equality (assumes that eq relation is reflexive).

5059 * Classical tactics use proper Proof.context instead of historic types

5060 claset/clasimpset. Old-style declarations like addIs, addEs, addDs

5061 operate directly on Proof.context. Raw type claset retains its use as

5062 snapshot of the classical context, which can be recovered via

5063 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.

5064 INCOMPATIBILITY, classical tactics and derived proof methods require

5065 proper Proof.context.

5068 *** System ***

5070 * Discontinued support for Poly/ML 5.2, which was the last version

5071 without proper multithreading and TimeLimit implementation.

5073 * Discontinued old lib/scripts/polyml-platform, which has been

5074 obsolete since Isabelle2009-2.

5076 * Various optional external tools are referenced more robustly and

5077 uniformly by explicit Isabelle settings as follows:

5079 ISABELLE_CSDP (formerly CSDP_EXE)

5080 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)

5081 ISABELLE_OCAML (formerly EXEC_OCAML)

5082 ISABELLE_SWIPL (formerly EXEC_SWIPL)

5083 ISABELLE_YAP (formerly EXEC_YAP)

5085 Note that automated detection from the file-system or search path has

5086 been discontinued. INCOMPATIBILITY.

5088 * Scala layer provides JVM method invocation service for static

5089 methods of type (String)String, see Invoke_Scala.method in ML. For

5090 example:

5092 Invoke_Scala.method "java.lang.System.getProperty" "java.home"

5094 Together with YXML.string_of_body/parse_body and XML.Encode/Decode

5095 this allows to pass structured values between ML and Scala.

5097 * The IsabelleText fonts includes some further glyphs to support the

5098 Prover IDE. Potential INCOMPATIBILITY: users who happen to have

5099 installed a local copy (which is normally *not* required) need to

5100 delete or update it from ~~/lib/fonts/.

5104 New in Isabelle2011 (January 2011)

5105 ----------------------------------

5107 *** General ***

5109 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see

5110 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with

5111 useful tooltips and hyperlinks produced from its static analysis. The

5112 bundled component provides an executable Isabelle tool that can be run

5113 like this:

5115 Isabelle2011/bin/isabelle jedit

5117 * Significantly improved Isabelle/Isar implementation manual.

5119 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER

5120 (and thus refers to something like $HOME/.isabelle/Isabelle2011),

5121 while the default heap location within that directory lacks that extra

5122 suffix. This isolates multiple Isabelle installations from each

5123 other, avoiding problems with old settings in new versions.

5124 INCOMPATIBILITY, need to copy/upgrade old user settings manually.

5126 * Source files are always encoded as UTF-8, instead of old-fashioned

5127 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require

5128 the following package declarations:

5130 \usepackage[utf8]{inputenc}

5131 \usepackage{textcomp}

5133 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that

5134 a Unicode character is treated as a single symbol, not a sequence of

5135 non-ASCII bytes as before. Since Isabelle/ML string literals may

5136 contain symbols without further backslash escapes, Unicode can now be

5137 used here as well. Recall that Symbol.explode in ML provides a

5138 consistent view on symbols, while raw explode (or String.explode)

5139 merely give a byte-oriented representation.

5141 * Theory loader: source files are primarily located via the master

5142 directory of each theory node (where the .thy file itself resides).

5143 The global load path is still partially available as legacy feature.

5144 Minor INCOMPATIBILITY due to subtle change in file lookup: use

5145 explicit paths, relatively to the theory.

5147 * Special treatment of ML file names has been discontinued.

5148 Historically, optional extensions .ML or .sml were added on demand --

5149 at the cost of clarity of file dependencies. Recall that Isabelle/ML

5150 files exclusively use the .ML extension. Minor INCOMPATIBILITY.

5152 * Various options that affect pretty printing etc. are now properly

5153 handled within the context via configuration options, instead of

5154 unsynchronized references or print modes. There are both ML Config.T

5155 entities and Isar declaration attributes to access these.

5157 ML (Config.T) Isar (attribute)

5159 eta_contract eta_contract

5160 show_brackets show_brackets

5161 show_sorts show_sorts

5162 show_types show_types

5163 show_question_marks show_question_marks

5164 show_consts show_consts

5165 show_abbrevs show_abbrevs

5167 Syntax.ast_trace syntax_ast_trace

5168 Syntax.ast_stat syntax_ast_stat

5169 Syntax.ambiguity_level syntax_ambiguity_level

5171 Goal_Display.goals_limit goals_limit

5172 Goal_Display.show_main_goal show_main_goal

5174 Method.rule_trace rule_trace

5176 Thy_Output.display thy_output_display

5177 Thy_Output.quotes thy_output_quotes

5178 Thy_Output.indent thy_output_indent

5179 Thy_Output.source thy_output_source

5180 Thy_Output.break thy_output_break

5182 Note that corresponding "..._default" references in ML may only be

5183 changed globally at the ROOT session setup, but *not* within a theory.

5184 The option "show_abbrevs" supersedes the former print mode

5185 "no_abbrevs" with inverted meaning.

5187 * More systematic naming of some configuration options.

5188 INCOMPATIBILITY.

5190 trace_simp ~> simp_trace

5191 debug_simp ~> simp_debug

5193 * Support for real valued configuration options, using simplistic

5194 floating-point notation that coincides with the inner syntax for

5195 float_token.

5197 * Support for real valued preferences (with approximative PGIP type):

5198 front-ends need to accept "pgint" values in float notation.

5199 INCOMPATIBILITY.

5201 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from

5202 DejaVu Sans.

5204 * Discontinued support for Poly/ML 5.0 and 5.1 versions.

5207 *** Pure ***

5209 * Command 'type_synonym' (with single argument) replaces somewhat

5210 outdated 'types', which is still available as legacy feature for some

5211 time.

5213 * Command 'nonterminal' (with 'and' separated list of arguments)

5214 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.

5216 * Command 'notepad' replaces former 'example_proof' for

5217 experimentation in Isar without any result. INCOMPATIBILITY.

5219 * Locale interpretation commands 'interpret' and 'sublocale' accept

5220 lists of equations to map definitions in a locale to appropriate

5221 entities in the context of the interpretation. The 'interpretation'

5222 command already provided this functionality.

5224 * Diagnostic command 'print_dependencies' prints the locale instances

5225 that would be activated if the specified expression was interpreted in

5226 the current context. Variant "print_dependencies!" assumes a context

5227 without interpretations.

5229 * Diagnostic command 'print_interps' prints interpretations in proofs

5230 in addition to interpretations in theories.

5232 * Discontinued obsolete 'global' and 'local' commands to manipulate

5233 the theory name space. Rare INCOMPATIBILITY. The ML functions

5234 Sign.root_path and Sign.local_path may be applied directly where this

5235 feature is still required for historical reasons.

5237 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use

5238 'definition' instead.

5240 * The "prems" fact, which refers to the accidental collection of

5241 foundational premises in the context, is now explicitly marked as

5242 legacy feature and will be discontinued soon. Consider using "assms"

5243 of the head statement or reference facts by explicit names.

5245 * Document antiquotations @{class} and @{type} print classes and type

5246 constructors.

5248 * Document antiquotation @{file} checks file/directory entries within

5249 the local file system.

5252 *** HOL ***

5254 * Coercive subtyping: functions can be declared as coercions and type

5255 inference will add them as necessary upon input of a term. Theory

5256 Complex_Main declares real :: nat => real and real :: int => real as

5257 coercions. A coercion function f is declared like this:

5259 declare [[coercion f]]

5261 To lift coercions through type constructors (e.g. from nat => real to

5262 nat list => real list), map functions can be declared, e.g.

5264 declare [[coercion_map map]]

5266 Currently coercion inference is activated only in theories including

5267 real numbers, i.e. descendants of Complex_Main. This is controlled by

5268 the configuration option "coercion_enabled", e.g. it can be enabled in

5269 other theories like this:

5271 declare [[coercion_enabled]]

5273 * Command 'partial_function' provides basic support for recursive

5274 function definitions over complete partial orders. Concrete instances

5275 are provided for i) the option type, ii) tail recursion on arbitrary

5276 types, and iii) the heap monad of Imperative_HOL. See

5277 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy

5278 for examples.

5280 * Function package: f.psimps rules are no longer implicitly declared

5281 as [simp]. INCOMPATIBILITY.

5283 * Datatype package: theorems generated for executable equality (class

5284 "eq") carry proper names and are treated as default code equations.

5286 * Inductive package: now offers command 'inductive_simps' to

5287 automatically derive instantiated and simplified equations for

5288 inductive predicates, similar to 'inductive_cases'.

5290 * Command 'enriched_type' allows to register properties of the

5291 functorial structure of types.

5293 * Improved infrastructure for term evaluation using code generator

5294 techniques, in particular static evaluation conversions.

5296 * Code generator: Scala (2.8 or higher) has been added to the target

5297 languages.

5299 * Code generator: globbing constant expressions "*" and "Theory.*"

5300 have been replaced by the more idiomatic "_" and "Theory._".

5301 INCOMPATIBILITY.

5303 * Code generator: export_code without explicit file declaration prints

5304 to standard output. INCOMPATIBILITY.

5306 * Code generator: do not print function definitions for case

5307 combinators any longer.

5309 * Code generator: simplification with rules determined with

5310 src/Tools/Code/code_simp.ML and method "code_simp".

5312 * Code generator for records: more idiomatic representation of record

5313 types. Warning: records are not covered by ancient SML code

5314 generation any longer. INCOMPATIBILITY. In cases of need, a suitable

5315 rep_datatype declaration helps to succeed then:

5317 record 'a foo = ...

5318 ...

5319 rep_datatype foo_ext ...

5321 * Records: logical foundation type for records does not carry a

5322 '_type' suffix any longer (obsolete due to authentic syntax).

5323 INCOMPATIBILITY.

5325 * Quickcheck now by default uses exhaustive testing instead of random

5326 testing. Random testing can be invoked by "quickcheck [random]",

5327 exhaustive testing by "quickcheck [exhaustive]".

5329 * Quickcheck instantiates polymorphic types with small finite

5330 datatypes by default. This enables a simple execution mechanism to

5331 handle quantifiers and function equality over the finite datatypes.

5333 * Quickcheck random generator has been renamed from "code" to

5334 "random". INCOMPATIBILITY.

5336 * Quickcheck now has a configurable time limit which is set to 30

5337 seconds by default. This can be changed by adding [timeout = n] to the

5338 quickcheck command. The time limit for Auto Quickcheck is still set

5339 independently.

5341 * Quickcheck in locales considers interpretations of that locale for

5342 counter example search.

5344 * Sledgehammer:

5345 - Added "smt" and "remote_smt" provers based on the "smt" proof

5346 method. See the Sledgehammer manual for details ("isabelle doc

5347 sledgehammer").

5348 - Renamed commands:

5349 sledgehammer atp_info ~> sledgehammer running_provers

5350 sledgehammer atp_kill ~> sledgehammer kill_provers

5351 sledgehammer available_atps ~> sledgehammer available_provers

5352 INCOMPATIBILITY.

5353 - Renamed options:

5354 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]

5355 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]

5356 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]

5357 (and "ms" and "min" are no longer supported)

5358 INCOMPATIBILITY.

5360 * Nitpick:

5361 - Renamed options:

5362 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]

5363 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]

5364 INCOMPATIBILITY.

5365 - Added support for partial quotient types.

5366 - Added local versions of the "Nitpick.register_xxx" functions.

5367 - Added "whack" option.

5368 - Allow registration of quotient types as codatatypes.

5369 - Improved "merge_type_vars" option to merge more types.

5370 - Removed unsound "fast_descrs" option.

5371 - Added custom symmetry breaking for datatypes, making it possible to reach

5372 higher cardinalities.

5373 - Prevent the expansion of too large definitions.

5375 * Proof methods "metis" and "meson" now have configuration options

5376 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled

5377 to diagnose these tools. E.g.

5379 using [[metis_trace = true]]

5381 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available

5382 manually as command 'solve_direct'.

5384 * The default SMT solver Z3 must be enabled explicitly (due to

5385 licensing issues) by setting the environment variable

5386 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For

5387 commercial applications, the SMT solver CVC3 is provided as fall-back;

5388 changing the SMT solver is done via the configuration option

5389 "smt_solver".

5391 * Remote SMT solvers need to be referred to by the "remote_" prefix,

5392 i.e. "remote_cvc3" and "remote_z3".

5394 * Added basic SMT support for datatypes, records, and typedefs using

5395 the oracle mode (no proofs). Direct support of pairs has been dropped

5396 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT

5397 support for a similar behavior). Minor INCOMPATIBILITY.

5399 * Changed SMT configuration options:

5400 - Renamed:

5401 z3_proofs ~> smt_oracle (with inverted meaning)

5402 z3_trace_assms ~> smt_trace_used_facts

5403 INCOMPATIBILITY.

5404 - Added:

5405 smt_verbose

5406 smt_random_seed

5407 smt_datatypes

5408 smt_infer_triggers

5409 smt_monomorph_limit

5410 cvc3_options

5411 remote_cvc3_options

5412 remote_z3_options

5413 yices_options

5415 * Boogie output files (.b2i files) need to be declared in the theory

5416 header.

5418 * Simplification procedure "list_to_set_comprehension" rewrites list

5419 comprehensions applied to List.set to set comprehensions. Occasional

5420 INCOMPATIBILITY, may be deactivated like this:

5422 declare [[simproc del: list_to_set_comprehension]]

5424 * Removed old version of primrec package. INCOMPATIBILITY.

5426 * Removed simplifier congruence rule of "prod_case", as has for long

5427 been the case with "split". INCOMPATIBILITY.

5429 * String.literal is a type, but not a datatype. INCOMPATIBILITY.

5431 * Removed [split_format ... and ... and ...] version of

5432 [split_format]. Potential INCOMPATIBILITY.

5434 * Predicate "sorted" now defined inductively, with nice induction

5435 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.

5437 * Constant "contents" renamed to "the_elem", to free the generic name

5438 contents for other uses. INCOMPATIBILITY.

5440 * Renamed class eq and constant eq (for code generation) to class

5441 equal and constant equal, plus renaming of related facts and various

5442 tuning. INCOMPATIBILITY.

5444 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.

5446 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".

5447 INCOMPATIBILITY.

5449 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to

5450 avoid confusion with finite sets. INCOMPATIBILITY.

5452 * Abandoned locales equiv, congruent and congruent2 for equivalence

5453 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same

5454 for congruent(2)).

5456 * Some previously unqualified names have been qualified:

5458 types

5459 bool ~> HOL.bool

5460 nat ~> Nat.nat

5462 constants

5463 Trueprop ~> HOL.Trueprop

5464 True ~> HOL.True

5465 False ~> HOL.False

5466 op & ~> HOL.conj

5467 op | ~> HOL.disj

5468 op --> ~> HOL.implies

5469 op = ~> HOL.eq

5470 Not ~> HOL.Not

5471 The ~> HOL.The

5472 All ~> HOL.All

5473 Ex ~> HOL.Ex

5474 Ex1 ~> HOL.Ex1

5475 Let ~> HOL.Let

5476 If ~> HOL.If

5477 Ball ~> Set.Ball

5478 Bex ~> Set.Bex

5479 Suc ~> Nat.Suc

5480 Pair ~> Product_Type.Pair

5481 fst ~> Product_Type.fst

5482 snd ~> Product_Type.snd

5483 curry ~> Product_Type.curry

5484 op : ~> Set.member

5485 Collect ~> Set.Collect

5487 INCOMPATIBILITY.

5489 * More canonical naming convention for some fundamental definitions:

5491 bot_bool_eq ~> bot_bool_def

5492 top_bool_eq ~> top_bool_def

5493 inf_bool_eq ~> inf_bool_def

5494 sup_bool_eq ~> sup_bool_def

5495 bot_fun_eq ~> bot_fun_def

5496 top_fun_eq ~> top_fun_def

5497 inf_fun_eq ~> inf_fun_def

5498 sup_fun_eq ~> sup_fun_def

5500 INCOMPATIBILITY.

5502 * More stylized fact names:

5504 expand_fun_eq ~> fun_eq_iff

5505 expand_set_eq ~> set_eq_iff

5506 set_ext ~> set_eqI

5507 nat_number ~> eval_nat_numeral

5509 INCOMPATIBILITY.

5511 * Refactoring of code-generation specific operations in theory List:

5513 constants

5514 null ~> List.null

5516 facts

5517 mem_iff ~> member_def

5518 null_empty ~> null_def

5520 INCOMPATIBILITY. Note that these were not supposed to be used

5521 regularly unless for striking reasons; their main purpose was code

5522 generation.

5524 Various operations from the Haskell prelude are used for generating

5525 Haskell code.

5527 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term

5528 "surj f" is now an abbreviation of "range f = UNIV". The theorems

5529 bij_def and surj_def are unchanged. INCOMPATIBILITY.

5531 * Abolished some non-alphabetic type names: "prod" and "sum" replace

5532 "*" and "+" respectively. INCOMPATIBILITY.

5534 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write

5535 "Sum_Type.Plus" instead.

5537 * Constant "split" has been merged with constant "prod_case"; names of

5538 ML functions, facts etc. involving split have been retained so far,

5539 though. INCOMPATIBILITY.

5541 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"

5542 instead. INCOMPATIBILITY.

5544 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".

5545 INCOMPATIBILITY.

5547 * Former theory Library/Enum is now part of the HOL-Main image.

5548 INCOMPATIBILITY: all constants of the Enum theory now have to be

5549 referred to by its qualified name.

5551 enum ~> Enum.enum

5552 nlists ~> Enum.nlists

5553 product ~> Enum.product

5555 * Theory Library/Monad_Syntax provides do-syntax for monad types.

5556 Syntax in Library/State_Monad has been changed to avoid ambiguities.

5557 INCOMPATIBILITY.

5559 * Theory Library/SetsAndFunctions has been split into

5560 Library/Function_Algebras and Library/Set_Algebras; canonical names

5561 for instance definitions for functions; various improvements.

5562 INCOMPATIBILITY.

5564 * Theory Library/Multiset provides stable quicksort implementation of

5565 sort_key.

5567 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.

5568 INCOMPATIBILITY.

5570 * Session Multivariate_Analysis: introduced a type class for euclidean

5571 space. Most theorems are now stated in terms of euclidean spaces

5572 instead of finite cartesian products.

5574 types

5575 real ^ 'n ~> 'a::real_vector

5576 ~> 'a::euclidean_space

5577 ~> 'a::ordered_euclidean_space

5578 (depends on your needs)

5580 constants

5581 _ $ _ ~> _ $$ _

5582 \<chi> x. _ ~> \<chi>\<chi> x. _

5583 CARD('n) ~> DIM('a)

5585 Also note that the indices are now natural numbers and not from some

5586 finite type. Finite cartesian products of euclidean spaces, products

5587 of euclidean spaces the real and complex numbers are instantiated to

5588 be euclidean_spaces. INCOMPATIBILITY.

5590 * Session Probability: introduced pextreal as positive extended real

5591 numbers. Use pextreal as value for measures. Introduce the

5592 Radon-Nikodym derivative, product spaces and Fubini's theorem for

5593 arbitrary sigma finite measures. Introduces Lebesgue measure based on

5594 the integral in Multivariate Analysis. INCOMPATIBILITY.

5596 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.

5597 INCOMPATIBILITY.

5599 * Session SPARK (with image HOL-SPARK) provides commands to load and

5600 prove verification conditions generated by the SPARK Ada program

5601 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.

5604 *** HOL-Algebra ***

5606 * Theorems for additive ring operations (locale abelian_monoid and

5607 descendants) are generated by interpretation from their multiplicative

5608 counterparts. Names (in particular theorem names) have the mandatory

5609 qualifier 'add'. Previous theorem names are redeclared for

5610 compatibility.

5612 * Structure "int_ring" is now an abbreviation (previously a

5613 definition). This fits more natural with advanced interpretations.

5616 *** HOLCF ***

5618 * The domain package now runs in definitional mode by default: The

5619 former command 'new_domain' is now called 'domain'. To use the domain

5620 package in its original axiomatic mode, use 'domain (unsafe)'.

5621 INCOMPATIBILITY.

5623 * The new class "domain" is now the default sort. Class "predomain"

5624 is an unpointed version of "domain". Theories can be updated by

5625 replacing sort annotations as shown below. INCOMPATIBILITY.

5627 'a::type ~> 'a::countable

5628 'a::cpo ~> 'a::predomain

5629 'a::pcpo ~> 'a::domain

5631 * The old type class "rep" has been superseded by class "domain".

5632 Accordingly, users of the definitional package must remove any

5633 "default_sort rep" declarations. INCOMPATIBILITY.

5635 * The domain package (definitional mode) now supports unpointed

5636 predomain argument types, as long as they are marked 'lazy'. (Strict

5637 arguments must be in class "domain".) For example, the following

5638 domain definition now works:

5640 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")

5642 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class

5643 instances for types from main HOL: bool, nat, int, char, 'a + 'b,

5644 'a option, and 'a list. Additionally, it configures fixrec and the

5645 domain package to work with these types. For example:

5647 fixrec isInl :: "('a + 'b) u -> tr"

5648 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"

5650 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")

5652 * The "(permissive)" option of fixrec has been replaced with a

5653 per-equation "(unchecked)" option. See

5654 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.

5656 * The "bifinite" class no longer fixes a constant "approx"; the class

5657 now just asserts that such a function exists. INCOMPATIBILITY.

5659 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer

5660 defines an embedding of type 'a defl into udom by default; instances

5661 of "bifinite" and "domain" classes are available in

5662 src/HOL/HOLCF/Library/Defl_Bifinite.thy.

5664 * The syntax "REP('a)" has been replaced with "DEFL('a)".

5666 * The predicate "directed" has been removed. INCOMPATIBILITY.

5668 * The type class "finite_po" has been removed. INCOMPATIBILITY.

5670 * The function "cprod_map" has been renamed to "prod_map".

5671 INCOMPATIBILITY.

5673 * The monadic bind operator on each powerdomain has new binder syntax

5674 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents

5675 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".

5677 * The infix syntax for binary union on each powerdomain has changed

5678 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set

5679 syntax. INCOMPATIBILITY.

5681 * The constant "UU" has been renamed to "bottom". The syntax "UU" is

5682 still supported as an input translation.

5684 * Renamed some theorems (the original names are also still available).

5686 expand_fun_below ~> fun_below_iff

5687 below_fun_ext ~> fun_belowI

5688 expand_cfun_eq ~> cfun_eq_iff

5689 ext_cfun ~> cfun_eqI

5690 expand_cfun_below ~> cfun_below_iff

5691 below_cfun_ext ~> cfun_belowI

5692 cont2cont_Rep_CFun ~> cont2cont_APP

5694 * The Abs and Rep functions for various types have changed names.

5695 Related theorem names have also changed to match. INCOMPATIBILITY.

5697 Rep_CFun ~> Rep_cfun

5698 Abs_CFun ~> Abs_cfun

5699 Rep_Sprod ~> Rep_sprod

5700 Abs_Sprod ~> Abs_sprod

5701 Rep_Ssum ~> Rep_ssum

5702 Abs_Ssum ~> Abs_ssum

5704 * Lemmas with names of the form *_defined_iff or *_strict_iff have

5705 been renamed to *_bottom_iff. INCOMPATIBILITY.

5707 * Various changes to bisimulation/coinduction with domain package:

5709 - Definitions of "bisim" constants no longer mention definedness.

5710 - With mutual recursion, "bisim" predicate is now curried.

5711 - With mutual recursion, each type gets a separate coind theorem.

5712 - Variable names in bisim_def and coinduct rules have changed.

5714 INCOMPATIBILITY.

5716 * Case combinators generated by the domain package for type "foo" are

5717 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.

5719 * Several theorems have been renamed to more accurately reflect the

5720 names of constants and types involved. INCOMPATIBILITY.

5722 thelub_const ~> lub_const

5723 lub_const ~> is_lub_const

5724 thelubI ~> lub_eqI

5725 is_lub_lub ~> is_lubD2

5726 lubI ~> is_lub_lub

5727 unique_lub ~> is_lub_unique

5728 is_ub_lub ~> is_lub_rangeD1

5729 lub_bin_chain ~> is_lub_bin_chain

5730 lub_fun ~> is_lub_fun

5731 thelub_fun ~> lub_fun

5732 thelub_cfun ~> lub_cfun

5733 thelub_Pair ~> lub_Pair

5734 lub_cprod ~> is_lub_prod

5735 thelub_cprod ~> lub_prod

5736 minimal_cprod ~> minimal_prod

5737 inst_cprod_pcpo ~> inst_prod_pcpo

5738 UU_I ~> bottomI

5739 compact_UU ~> compact_bottom

5740 deflation_UU ~> deflation_bottom

5741 finite_deflation_UU ~> finite_deflation_bottom

5743 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.

5745 sq_ord_less_eq_trans ~> below_eq_trans

5746 sq_ord_eq_less_trans ~> eq_below_trans

5747 refl_less ~> below_refl

5748 trans_less ~> below_trans

5749 antisym_less ~> below_antisym

5750 antisym_less_inverse ~> po_eq_conv [THEN iffD1]

5751 box_less ~> box_below

5752 rev_trans_less ~> rev_below_trans

5753 not_less2not_eq ~> not_below2not_eq

5754 less_UU_iff ~> below_UU_iff

5755 flat_less_iff ~> flat_below_iff

5756 adm_less ~> adm_below

5757 adm_not_less ~> adm_not_below

5758 adm_compact_not_less ~> adm_compact_not_below

5759 less_fun_def ~> below_fun_def

5760 expand_fun_less ~> fun_below_iff

5761 less_fun_ext ~> fun_belowI

5762 less_discr_def ~> below_discr_def

5763 discr_less_eq ~> discr_below_eq

5764 less_unit_def ~> below_unit_def

5765 less_cprod_def ~> below_prod_def

5766 prod_lessI ~> prod_belowI

5767 Pair_less_iff ~> Pair_below_iff

5768 fst_less_iff ~> fst_below_iff

5769 snd_less_iff ~> snd_below_iff

5770 expand_cfun_less ~> cfun_below_iff

5771 less_cfun_ext ~> cfun_belowI

5772 injection_less ~> injection_below

5773 less_up_def ~> below_up_def

5774 not_Iup_less ~> not_Iup_below

5775 Iup_less ~> Iup_below

5776 up_less ~> up_below

5777 Def_inject_less_eq ~> Def_below_Def

5778 Def_less_is_eq ~> Def_below_iff

5779 spair_less_iff ~> spair_below_iff

5780 less_sprod ~> below_sprod

5781 spair_less ~> spair_below

5782 sfst_less_iff ~> sfst_below_iff

5783 ssnd_less_iff ~> ssnd_below_iff

5784 fix_least_less ~> fix_least_below

5785 dist_less_one ~> dist_below_one

5786 less_ONE ~> below_ONE

5787 ONE_less_iff ~> ONE_below_iff

5788 less_sinlD ~> below_sinlD

5789 less_sinrD ~> below_sinrD

5792 *** FOL and ZF ***

5794 * All constant names are now qualified internally and use proper

5795 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.

5798 *** ML ***

5800 * Antiquotation @{assert} inlines a function bool -> unit that raises

5801 Fail if the argument is false. Due to inlining the source position of

5802 failed assertions is included in the error output.

5804 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML

5805 text is in practice always evaluated with a stable theory checkpoint.

5806 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.

5808 * Antiquotation @{theory A} refers to theory A from the ancestry of

5809 the current context, not any accidental theory loader state as before.

5810 Potential INCOMPATIBILITY, subtle change in semantics.

5812 * Syntax.pretty_priority (default 0) configures the required priority

5813 of pretty-printed output and thus affects insertion of parentheses.

5815 * Syntax.default_root (default "any") configures the inner syntax

5816 category (nonterminal symbol) for parsing of terms.

5818 * Former exception Library.UnequalLengths now coincides with

5819 ListPair.UnequalLengths.

5821 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the

5822 main functionality is provided by structure Simplifier.

5824 * Renamed raw "explode" function to "raw_explode" to emphasize its

5825 meaning. Note that internally to Isabelle, Symbol.explode is used in

5826 almost all situations.

5828 * Discontinued obsolete function sys_error and exception SYS_ERROR.

5829 See implementation manual for further details on exceptions in

5830 Isabelle/ML.

5832 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its

5833 meaning.

5835 * Renamed structure PureThy to Pure_Thy and moved most of its

5836 operations to structure Global_Theory, to emphasize that this is

5837 rarely-used global-only stuff.

5839 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln

5840 instead (or tracing for high-volume output).

5842 * Configuration option show_question_marks only affects regular pretty

5843 printing of types and terms, not raw Term.string_of_vname.

5845 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare

5846 INCOMPATIBILITY, superseded by static antiquotations @{thm} and

5847 @{thms} for most purposes.

5849 * ML structure Unsynchronized is never opened, not even in Isar

5850 interaction mode as before. Old Unsynchronized.set etc. have been

5851 discontinued -- use plain := instead. This should be *rare* anyway,

5852 since modern tools always work via official context data, notably

5853 configuration options.

5855 * Parallel and asynchronous execution requires special care concerning

5856 interrupts. Structure Exn provides some convenience functions that

5857 avoid working directly with raw Interrupt. User code must not absorb

5858 interrupts -- intermediate handling (for cleanup etc.) needs to be

5859 followed by re-raising of the original exception. Another common

5860 source of mistakes are "handle _" patterns, which make the meaning of

5861 the program subject to physical effects of the environment.

5865 New in Isabelle2009-2 (June 2010)

5866 ---------------------------------

5868 *** General ***

5870 * Authentic syntax for *all* logical entities (type classes, type

5871 constructors, term constants): provides simple and robust

5872 correspondence between formal entities and concrete syntax. Within

5873 the parse tree / AST representations, "constants" are decorated by

5874 their category (class, type, const) and spelled out explicitly with

5875 their full internal name.

5877 Substantial INCOMPATIBILITY concerning low-level syntax declarations

5878 and translations (translation rules and translation functions in ML).

5879 Some hints on upgrading:

5881 - Many existing uses of 'syntax' and 'translations' can be replaced

5882 by more modern 'type_notation', 'notation' and 'abbreviation',

5883 which are independent of this issue.

5885 - 'translations' require markup within the AST; the term syntax

5886 provides the following special forms:

5888 CONST c -- produces syntax version of constant c from context

5889 XCONST c -- literally c, checked as constant from context

5890 c -- literally c, if declared by 'syntax'

5892 Plain identifiers are treated as AST variables -- occasionally the

5893 system indicates accidental variables via the error "rhs contains

5894 extra variables".

5896 Type classes and type constructors are marked according to their

5897 concrete syntax. Some old translations rules need to be written

5898 for the "type" category, using type constructor application

5899 instead of pseudo-term application of the default category

5900 "logic".

5902 - 'parse_translation' etc. in ML may use the following

5903 antiquotations:

5905 @{class_syntax c} -- type class c within parse tree / AST

5906 @{term_syntax c} -- type constructor c within parse tree / AST

5907 @{const_syntax c} -- ML version of "CONST c" above

5908 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)

5910 - Literal types within 'typed_print_translations', i.e. those *not*

5911 represented as pseudo-terms are represented verbatim. Use @{class

5912 c} or @{type_name c} here instead of the above syntax

5913 antiquotations.

5915 Note that old non-authentic syntax was based on unqualified base

5916 names, so all of the above "constant" names would coincide. Recall

5917 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to

5918 diagnose syntax problems.

5920 * Type constructors admit general mixfix syntax, not just infix.

5922 * Concrete syntax may be attached to local entities without a proof

5923 body, too. This works via regular mixfix annotations for 'fix',

5924 'def', 'obtain' etc. or via the explicit 'write' command, which is

5925 similar to the 'notation' command in theory specifications.

5927 * Discontinued unnamed infix syntax (legacy feature for many years) --

5928 need to specify constant name and syntax separately. Internal ML

5929 datatype constructors have been renamed from InfixName to Infix etc.

5930 Minor INCOMPATIBILITY.

5932 * Schematic theorem statements need to be explicitly markup as such,

5933 via commands 'schematic_lemma', 'schematic_theorem',

5934 'schematic_corollary'. Thus the relevance of the proof is made

5935 syntactically clear, which impacts performance in a parallel or

5936 asynchronous interactive environment. Minor INCOMPATIBILITY.

5938 * Use of cumulative prems via "!" in some proof methods has been

5939 discontinued (old legacy feature).

5941 * References 'trace_simp' and 'debug_simp' have been replaced by

5942 configuration options stored in the context. Enabling tracing (the

5943 case of debugging is similar) in proofs works via

5945 using [[trace_simp = true]]

5947 Tracing is then active for all invocations of the simplifier in

5948 subsequent goal refinement steps. Tracing may also still be enabled or

5949 disabled via the ProofGeneral settings menu.

5951 * Separate commands 'hide_class', 'hide_type', 'hide_const',

5952 'hide_fact' replace the former 'hide' KIND command. Minor

5953 INCOMPATIBILITY.

5955 * Improved parallelism of proof term normalization: usedir -p2 -q0 is

5956 more efficient than combinations with -q1 or -q2.

5959 *** Pure ***

5961 * Proofterms record type-class reasoning explicitly, using the

5962 "unconstrain" operation internally. This eliminates all sort

5963 constraints from a theorem and proof, introducing explicit

5964 OFCLASS-premises. On the proof term level, this operation is

5965 automatically applied at theorem boundaries, such that closed proofs

5966 are always free of sort constraints. INCOMPATIBILITY for tools that

5967 inspect proof terms.

5969 * Local theory specifications may depend on extra type variables that

5970 are not present in the result type -- arguments TYPE('a) :: 'a itself

5971 are added internally. For example:

5973 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"

5975 * Predicates of locales introduced by classes carry a mandatory

5976 "class" prefix. INCOMPATIBILITY.

5978 * Vacuous class specifications observe default sort. INCOMPATIBILITY.

5980 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use

5981 'class' instead.

5983 * Command 'code_reflect' allows to incorporate generated ML code into

5984 runtime environment; replaces immature code_datatype antiquotation.

5985 INCOMPATIBILITY.

5987 * Code generator: simple concept for abstract datatypes obeying

5988 invariants.

5990 * Code generator: details of internal data cache have no impact on the

5991 user space functionality any longer.

5993 * Methods "unfold_locales" and "intro_locales" ignore non-locale

5994 subgoals. This is more appropriate for interpretations with 'where'.

5995 INCOMPATIBILITY.

5997 * Command 'example_proof' opens an empty proof body. This allows to

5998 experiment with Isar, without producing any persistent result.

6000 * Commands 'type_notation' and 'no_type_notation' declare type syntax

6001 within a local theory context, with explicit checking of the

6002 constructors involved (in contrast to the raw 'syntax' versions).

6004 * Commands 'types' and 'typedecl' now work within a local theory

6005 context -- without introducing dependencies on parameters or

6006 assumptions, which is not possible in Isabelle/Pure.

6008 * Command 'defaultsort' has been renamed to 'default_sort', it works

6009 within a local theory context. Minor INCOMPATIBILITY.

6012 *** HOL ***

6014 * Command 'typedef' now works within a local theory context -- without

6015 introducing dependencies on parameters or assumptions, which is not

6016 possible in Isabelle/Pure/HOL. Note that the logical environment may

6017 contain multiple interpretations of local typedefs (with different

6018 non-emptiness proofs), even in a global theory context.

6020 * New package for quotient types. Commands 'quotient_type' and

6021 'quotient_definition' may be used for defining types and constants by

6022 quotient constructions. An example is the type of integers created by

6023 quotienting pairs of natural numbers:

6025 fun

6026 intrel :: "(nat * nat) => (nat * nat) => bool"

6027 where

6028 "intrel (x, y) (u, v) = (x + v = u + y)"

6030 quotient_type int = "nat * nat" / intrel

6031 by (auto simp add: equivp_def expand_fun_eq)

6033 quotient_definition

6034 "0::int" is "(0::nat, 0::nat)"

6036 The method "lifting" can be used to lift of theorems from the

6037 underlying "raw" type to the quotient type. The example

6038 src/HOL/Quotient_Examples/FSet.thy includes such a quotient

6039 construction and provides a reasoning infrastructure for finite sets.

6041 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid

6042 clash with new theory Quotient in Main HOL.

6044 * Moved the SMT binding into the main HOL session, eliminating

6045 separate HOL-SMT session.

6047 * List membership infix mem operation is only an input abbreviation.

6048 INCOMPATIBILITY.

6050 * Theory Library/Word.thy has been removed. Use library Word/Word.thy

6051 for future developements; former Library/Word.thy is still present in

6052 the AFP entry RSAPPS.

6054 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no

6055 longer shadowed. INCOMPATIBILITY.

6057 * Dropped theorem duplicate comp_arith; use semiring_norm instead.

6058 INCOMPATIBILITY.

6060 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.

6061 INCOMPATIBILITY.

6063 * Dropped normalizing_semiring etc; use the facts in semiring classes

6064 instead. INCOMPATIBILITY.

6066 * Dropped several real-specific versions of lemmas about floor and

6067 ceiling; use the generic lemmas from theory "Archimedean_Field"

6068 instead. INCOMPATIBILITY.

6070 floor_number_of_eq ~> floor_number_of

6071 le_floor_eq_number_of ~> number_of_le_floor

6072 le_floor_eq_zero ~> zero_le_floor

6073 le_floor_eq_one ~> one_le_floor

6074 floor_less_eq_number_of ~> floor_less_number_of

6075 floor_less_eq_zero ~> floor_less_zero

6076 floor_less_eq_one ~> floor_less_one

6077 less_floor_eq_number_of ~> number_of_less_floor

6078 less_floor_eq_zero ~> zero_less_floor

6079 less_floor_eq_one ~> one_less_floor

6080 floor_le_eq_number_of ~> floor_le_number_of

6081 floor_le_eq_zero ~> floor_le_zero

6082 floor_le_eq_one ~> floor_le_one

6083 floor_subtract_number_of ~> floor_diff_number_of

6084 floor_subtract_one ~> floor_diff_one

6085 ceiling_number_of_eq ~> ceiling_number_of

6086 ceiling_le_eq_number_of ~> ceiling_le_number_of

6087 ceiling_le_zero_eq ~> ceiling_le_zero

6088 ceiling_le_eq_one ~> ceiling_le_one

6089 less_ceiling_eq_number_of ~> number_of_less_ceiling

6090 less_ceiling_eq_zero ~> zero_less_ceiling

6091 less_ceiling_eq_one ~> one_less_ceiling

6092 ceiling_less_eq_number_of ~> ceiling_less_number_of

6093 ceiling_less_eq_zero ~> ceiling_less_zero

6094 ceiling_less_eq_one ~> ceiling_less_one

6095 le_ceiling_eq_number_of ~> number_of_le_ceiling

6096 le_ceiling_eq_zero ~> zero_le_ceiling

6097 le_ceiling_eq_one ~> one_le_ceiling

6098 ceiling_subtract_number_of ~> ceiling_diff_number_of

6099 ceiling_subtract_one ~> ceiling_diff_one

6101 * Theory "Finite_Set": various folding_XXX locales facilitate the

6102 application of the various fold combinators on finite sets.

6104 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"

6105 provides abstract red-black tree type which is backed by "RBT_Impl" as

6106 implementation. INCOMPATIBILITY.

6108 * Theory Library/Coinductive_List has been removed -- superseded by

6109 AFP/thys/Coinductive.

6111 * Theory PReal, including the type "preal" and related operations, has

6112 been removed. INCOMPATIBILITY.

6114 * Real: new development using Cauchy Sequences.

6116 * Split off theory "Big_Operators" containing setsum, setprod,

6117 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.

6119 * Theory "Rational" renamed to "Rat", for consistency with "Nat",

6120 "Int" etc. INCOMPATIBILITY.

6122 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.

6124 * New set of rules "ac_simps" provides combined assoc / commute

6125 rewrites for all interpretations of the appropriate generic locales.

6127 * Renamed theory "OrderedGroup" to "Groups" and split theory

6128 "Ring_and_Field" into theories "Rings" and "Fields"; for more

6129 appropriate and more consistent names suitable for name prefixes

6130 within the HOL theories. INCOMPATIBILITY.

6132 * Some generic constants have been put to appropriate theories:

6133 - less_eq, less: Orderings

6134 - zero, one, plus, minus, uminus, times, abs, sgn: Groups

6135 - inverse, divide: Rings

6136 INCOMPATIBILITY.

6138 * More consistent naming of type classes involving orderings (and

6139 lattices):

6141 lower_semilattice ~> semilattice_inf

6142 upper_semilattice ~> semilattice_sup

6144 dense_linear_order ~> dense_linorder

6146 pordered_ab_group_add ~> ordered_ab_group_add

6147 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs

6148 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add

6149 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le

6150 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add

6151 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring

6152 pordered_cancel_semiring ~> ordered_cancel_semiring

6153 pordered_comm_monoid_add ~> ordered_comm_monoid_add

6154 pordered_comm_ring ~> ordered_comm_ring

6155 pordered_comm_semiring ~> ordered_comm_semiring

6156 pordered_ring ~> ordered_ring

6157 pordered_ring_abs ~> ordered_ring_abs

6158 pordered_semiring ~> ordered_semiring

6160 ordered_ab_group_add ~> linordered_ab_group_add

6161 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add

6162 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add

6163 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict

6164 ordered_field ~> linordered_field

6165 ordered_field_no_lb ~> linordered_field_no_lb

6166 ordered_field_no_ub ~> linordered_field_no_ub

6167 ordered_field_dense_linear_order ~> dense_linordered_field

6168 ordered_idom ~> linordered_idom

6169 ordered_ring ~> linordered_ring

6170 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor

6171 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor

6172 ordered_ring_strict ~> linordered_ring_strict

6173 ordered_semidom ~> linordered_semidom

6174 ordered_semiring ~> linordered_semiring

6175 ordered_semiring_1 ~> linordered_semiring_1

6176 ordered_semiring_1_strict ~> linordered_semiring_1_strict

6177 ordered_semiring_strict ~> linordered_semiring_strict

6179 The following slightly odd type classes have been moved to a

6180 separate theory Library/Lattice_Algebras:

6182 lordered_ab_group_add ~> lattice_ab_group_add

6183 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs

6184 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add

6185 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add

6186 lordered_ring ~> lattice_ring

6188 INCOMPATIBILITY.

6190 * Refined field classes:

6191 - classes division_ring_inverse_zero, field_inverse_zero,

6192 linordered_field_inverse_zero include rule inverse 0 = 0 --

6193 subsumes former division_by_zero class;

6194 - numerous lemmas have been ported from field to division_ring.

6195 INCOMPATIBILITY.

6197 * Refined algebra theorem collections:

6198 - dropped theorem group group_simps, use algebra_simps instead;

6199 - dropped theorem group ring_simps, use field_simps instead;

6200 - proper theorem collection field_simps subsumes former theorem

6201 groups field_eq_simps and field_simps;

6202 - dropped lemma eq_minus_self_iff which is a duplicate for

6203 equal_neg_zero.

6204 INCOMPATIBILITY.

6206 * Theory Finite_Set and List: some lemmas have been generalized from

6207 sets to lattices:

6209 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf

6210 fun_left_comm_idem_union ~> fun_left_comm_idem_sup

6211 inter_Inter_fold_inter ~> inf_Inf_fold_inf

6212 union_Union_fold_union ~> sup_Sup_fold_sup

6213 Inter_fold_inter ~> Inf_fold_inf

6214 Union_fold_union ~> Sup_fold_sup

6215 inter_INTER_fold_inter ~> inf_INFI_fold_inf

6216 union_UNION_fold_union ~> sup_SUPR_fold_sup

6217 INTER_fold_inter ~> INFI_fold_inf

6218 UNION_fold_union ~> SUPR_fold_sup

6220 * Theory "Complete_Lattice": lemmas top_def and bot_def have been

6221 replaced by the more convenient lemmas Inf_empty and Sup_empty.

6222 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed

6223 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace

6224 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right

6225 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.

6227 * Reorganized theory Multiset: swapped notation of pointwise and

6228 multiset order:

6230 - pointwise ordering is instance of class order with standard syntax

6231 <= and <;

6232 - multiset ordering has syntax <=# and <#; partial order properties

6233 are provided by means of interpretation with prefix

6234 multiset_order;

6235 - less duplication, less historical organization of sections,

6236 conversion from associations lists to multisets, rudimentary code

6237 generation;

6238 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,

6239 if needed.

6241 Renamed:

6243 multiset_eq_conv_count_eq ~> multiset_ext_iff

6244 multi_count_ext ~> multiset_ext

6245 diff_union_inverse2 ~> diff_union_cancelR

6247 INCOMPATIBILITY.

6249 * Theory Permutation: replaced local "remove" by List.remove1.

6251 * Code generation: ML and OCaml code is decorated with signatures.

6253 * Theory List: added transpose.

6255 * Library/Nat_Bijection.thy is a collection of bijective functions

6256 between nat and other types, which supersedes the older libraries

6257 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.

6259 Constants:

6260 Nat_Int_Bij.nat2_to_nat ~> prod_encode

6261 Nat_Int_Bij.nat_to_nat2 ~> prod_decode

6262 Nat_Int_Bij.int_to_nat_bij ~> int_encode

6263 Nat_Int_Bij.nat_to_int_bij ~> int_decode

6264 Countable.pair_encode ~> prod_encode

6265 NatIso.prod2nat ~> prod_encode

6266 NatIso.nat2prod ~> prod_decode

6267 NatIso.sum2nat ~> sum_encode

6268 NatIso.nat2sum ~> sum_decode

6269 NatIso.list2nat ~> list_encode

6270 NatIso.nat2list ~> list_decode

6271 NatIso.set2nat ~> set_encode

6272 NatIso.nat2set ~> set_decode

6274 Lemmas:

6275 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode