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

NEWS

author | wenzelm |

Fri Dec 22 17:49:51 2017 +0100 (19 months ago) | |

changeset 67262 | 46540a2ead4b |

parent 67261 | bce56b5a35d5 |

child 67263 | 449a989f42cd |

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

action "isabelle.draft" for plain-text preview;

1 Isabelle NEWS -- history of user-relevant changes

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

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

7 New in this Isabelle version

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

10 *** General ***

12 * The old 'def' command has been discontinued (legacy since

13 Isbelle2016-1). INCOMPATIBILITY, use 'define' instead -- usually with

14 object-logic equality or equivalence.

16 * Session-qualified theory names are mandatory: it is no longer possible

17 to refer to unqualified theories from the parent session.

18 INCOMPATIBILITY for old developments that have not been updated to

19 Isabelle2017 yet (using the "isabelle imports" tool).

21 * Theory header 'abbrevs' specifications need to be separated by 'and'.

22 INCOMPATIBILITY.

24 * Only the most fundamental theory names are global, usually the entry

25 points to major logic sessions: Pure, Main, Complex_Main, HOLCF, IFOL,

26 FOL, ZF, ZFC etc. INCOMPATIBILITY, need to use qualified names for

27 formerly global "HOL-Probability.Probability" and "HOL-SPARK.SPARK".

29 * Command 'external_file' declares the formal dependency on the given

30 file name, such that the Isabelle build process knows about it, but

31 without specific Prover IDE management.

33 * Session ROOT entries no longer allow specification of 'files'. Rare

34 INCOMPATIBILITY, use command 'external_file' within a proper theory

35 context.

37 * Session root directories may be specified multiple times: each

38 accessible ROOT file is processed only once. This facilitates

39 specification of $ISABELLE_HOME_USER/ROOTS or command-line options like

40 -d or -D for "isabelle build" and "isabelle jedit". Example:

42 isabelle build -D '~~/src/ZF'

45 *** Isabelle/jEdit Prover IDE ***

47 * PIDE markup for session ROOT files: allows to complete session names,

48 follow links to theories and document files etc.

50 * Completion supports theory header imports, using theory base name.

51 E.g. "Prob" may be completed to "HOL-Probability.Probability".

53 * The command-line tool "isabelle jedit" provides more flexible options

54 for session selection:

55 - options -P opens the parent session image of -l

56 - options -A and -B modify the meaning of -l to produce a base

57 image on the spot, based on the specified ancestor (or parent)

58 - option -F focuses on the specified logic session

59 - option -R has changed: it only opens the session ROOT entry

60 - option -S sets up the development environment to edit the

61 specified session: it abbreviates -B -F -R -l

63 Examples:

64 isabelle jedit -d '$AFP' -S Formal_SSA -A HOL

65 isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis

67 * Named control symbols (without special Unicode rendering) are shown as

68 bold-italic keyword. This is particularly useful for the short form of

69 antiquotations with control symbol: \<^name>\<open>argument\<close>. The action

70 "isabelle.antiquoted_cartouche" turns an antiquotation with 0 or 1

71 arguments into this format.

73 * Action "isabelle.preview" is able to present more file formats,

74 notably bibtex database files and plain text files.

76 * Action "isabelle.draft" is similar to "isabelle.preview", but shows a

77 plain-text document draft.

80 *** Isabelle/VSCode Prover IDE ***

82 * HTML preview of theories and other file-formats similar to

83 Isabelle/jEdit.

86 *** Document preparation ***

88 * System option "document_tags" specifies a default for otherwise

89 untagged commands. This is occasionally useful to control the global

90 visibility of commands via session options (e.g. in ROOT).

92 * Document markup commands ('section', 'text' etc.) are implicitly

93 tagged as "document" and visible by default. This avoids the application

94 of option "document_tags" to these commands.

96 * Isabelle names are mangled into LaTeX macro names to allow the full

97 identifier syntax with underscore, prime, digits. This is relevant for

98 antiquotations in control symbol notation, e.g. \<^const_name> becomes

99 \isactrlconstUNDERSCOREname.

101 * Document antiquotation @{session name} checks and prints the given

102 session name verbatim.

104 * Document preparation with skip_proofs option now preserves the content

105 more accurately: only terminal proof steps ('by' etc.) are skipped.

107 * Command-line tool "isabelle document" has been re-implemented in

108 Isabelle/Scala, with simplified arguments and explicit errors from the

109 latex and bibtex process. Minor INCOMPATIBILITY.

112 *** HOL ***

114 * A new command parametric_constant for proving parametricity of

115 non-recursive definitions. For constants that are not fully parametric the

116 command will infer conditions on relations (e.g., bi_unique, bi_total, or

117 type class conditions such as "respects 0") sufficient for parametricity.

118 See ~~/src/HOL/ex/Conditional_Parametricity_Examples for some examples.

120 * SMT module:

121 - The 'smt_oracle' option is now necessary when using the 'smt' method

122 with a solver other than Z3. INCOMPATIBILITY.

123 - The encoding to first-order logic is now more complete in the

124 presence of higher-order quantifiers. An 'smt_explicit_application'

125 option has been added to control this. INCOMPATIBILITY.

127 * Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide

128 instances of rat, real, complex as factorial rings etc. Import

129 HOL-Computational_Algebra.Field_as_Ring explicitly in case of need.

130 INCOMPATIBILITY.

132 * Fact mod_mult_self4 (on nat) renamed to mod_mult_self3', to avoid

133 clash with fact mod_mult_self4 (on more generic semirings).

134 INCOMPATIBILITY.

136 * Facts sum.commute(_restrict) and prod.commute(_restrict) renamed to

137 sum.swap(_restrict) and prod.swap(_restrict), to avoid name clashes on

138 interpretation of abstract locales. INCOMPATIBILITY.

140 * Predicate pairwise_coprime abolished, use "pairwise coprime" instead.

141 INCOMPATIBILITY.

143 * Session HOL-Analysis: Moebius functions and the Riemann mapping

144 theorem.

146 * Class linordered_semiring_1 covers zero_less_one also, ruling out

147 pathologic instances. Minor INCOMPATIBILITY.

149 * Removed nat-int transfer machinery. Rare INCOMPATIBILITY.

151 * Predicate coprime is now a real definition, not a mere

152 abbreviation. INCOMPATIBILITY.

154 * Code generation: Code generation takes an explicit option

155 "case_insensitive" to accomodate case-insensitive file systems.

158 *** System ***

160 * Session ROOT entry: empty 'document_files' means there is no document

161 for this session. There is no need to specify options [document = false]

162 anymore.

164 * The command-line tool "isabelle mkroot" now always produces a document

165 outline: its options have been adapted accordingly. INCOMPATIBILITY.

167 * The command-line tool "isabelle mkroot -I" initializes a Mercurial

168 repository for the generated session files.

170 * Linux and Windows/Cygwin is for x86_64 only. Old 32bit platform

171 support has been discontinued.

173 * Mac OS X 10.10 Yosemite is now the baseline version; Mavericks is no

174 longer supported.

176 * Java runtime is for x86_64 only. Corresponding Isabelle settings have

177 been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,

178 instead of former 32/64 variants. INCOMPATIBILITY.

180 * Command-line tool "isabelle build" supports new options:

181 - option -B NAME: include session NAME and all descendants

182 - option -S: only observe changes of sources, not heap images

183 - option -f: forces a fresh build

185 * Command-line tool "isabelle build" takes "condition" options with the

186 corresponding environment values into account, when determining the

187 up-to-date status of a session.

189 * Command-line tool "isabelle imports -I" also reports actual session

190 imports. This helps to minimize the session dependency graph.

192 * Update to current Poly/ML 5.7.1 with slightly improved performance and

193 PIDE markup for identifier bindings.

195 * ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific

196 options for improved error reporting. Potential INCOMPATIBILITY with

197 unusual LaTeX installations, may have to adapt these settings.

201 New in Isabelle2017 (October 2017)

202 ----------------------------------

204 *** General ***

206 * Experimental support for Visual Studio Code (VSCode) as alternative

207 Isabelle/PIDE front-end, see also

208 https://marketplace.visualstudio.com/items?itemName=makarius.Isabelle2017

210 VSCode is a new type of application that continues the concepts of

211 "programmer's editor" and "integrated development environment" towards

212 fully semantic editing and debugging -- in a relatively light-weight

213 manner. Thus it fits nicely on top of the Isabelle/PIDE infrastructure.

214 Technically, VSCode is based on the Electron application framework

215 (Node.js + Chromium browser + V8), which is implemented in JavaScript

216 and TypeScript, while Isabelle/VSCode mainly consists of Isabelle/Scala

217 modules around a Language Server implementation.

219 * Theory names are qualified by the session name that they belong to.

220 This affects imports, but not the theory name space prefix (which is

221 just the theory base name as before).

223 In order to import theories from other sessions, the ROOT file format

224 provides a new 'sessions' keyword. In contrast, a theory that is

225 imported in the old-fashioned manner via an explicit file-system path

226 belongs to the current session, and might cause theory name conflicts

227 later on. Theories that are imported from other sessions are excluded

228 from the current session document. The command-line tool "isabelle

229 imports" helps to update theory imports.

231 * The main theory entry points for some non-HOL sessions have changed,

232 to avoid confusion with the global name "Main" of the session HOL. This

233 leads to the follow renamings:

235 CTT/Main.thy ~> CTT/CTT.thy

236 ZF/Main.thy ~> ZF/ZF.thy

237 ZF/Main_ZF.thy ~> ZF/ZF.thy

238 ZF/Main_ZFC.thy ~> ZF/ZFC.thy

239 ZF/ZF.thy ~> ZF/ZF_Base.thy

241 INCOMPATIBILITY.

243 * Commands 'alias' and 'type_alias' introduce aliases for constants and

244 type constructors, respectively. This allows adhoc changes to name-space

245 accesses within global or local theory contexts, e.g. within a 'bundle'.

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

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

250 * Computations generated by the code generator can be embedded directly

251 into ML, alongside with @{code} antiquotations, using the following

252 antiquotations:

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

255 ((term -> term) -> 'ml option -> 'a) -> Proof.context -> term -> 'a

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

257 (Proof.context -> 'ml -> conv) -> Proof.context -> conv

258 @{computation_check terms: ... datatypes: ...} : Proof.context -> conv

260 See src/HOL/ex/Computations.thy,

261 src/HOL/Decision_Procs/Commutative_Ring.thy and

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

263 tutorial on code generation.

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

268 * Session-qualified theory imports allow the Prover IDE to process

269 arbitrary theory hierarchies independently of the underlying logic

270 session image (e.g. option "isabelle jedit -l"), but the directory

271 structure needs to be known in advance (e.g. option "isabelle jedit -d"

272 or a line in the file $ISABELLE_HOME_USER/ROOTS).

274 * The PIDE document model maintains file content independently of the

275 status of jEdit editor buffers. Reloading jEdit buffers no longer causes

276 changes of formal document content. Theory dependencies are always

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

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

279 effectively always enabled.

281 * The Theories dockable provides a "Purge" button, in order to restrict

282 the document model to theories that are required for open editor

283 buffers.

285 * The Theories dockable indicates the overall status of checking of each

286 entry. When all forked tasks of a theory are finished, the border is

287 painted with thick lines; remaining errors in this situation are

288 represented by a different border color.

290 * Automatic indentation is more careful to avoid redundant spaces in

291 intermediate situations. Keywords are indented after input (via typed

292 characters or completion); see also option "jedit_indent_input".

294 * Action "isabelle.preview" opens an HTML preview of the current theory

295 document in the default web browser.

297 * Command-line invocation "isabelle jedit -R -l LOGIC" opens the ROOT

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

299 used for formal checking.

301 * The main Isabelle/jEdit plugin may be restarted manually (using the

302 jEdit Plugin Manager), as long as the "Isabelle Base" plugin remains

303 enabled at all times.

305 * Update to current jedit-5.4.0.

308 *** Pure ***

310 * Deleting the last code equations for a particular function using

311 [code del] results in function with no equations (runtime abort) rather

312 than an unimplemented function (generation time abort). Use explicit

313 [[code drop:]] to enforce the latter. Minor INCOMPATIBILITY.

315 * Proper concept of code declarations in code.ML:

316 - Regular code declarations act only on the global theory level, being

317 ignored with warnings if syntactically malformed.

318 - Explicitly global code declarations yield errors if syntactically

319 malformed.

320 - Default code declarations are silently ignored if syntactically

321 malformed.

322 Minor INCOMPATIBILITY.

324 * Clarified and standardized internal data bookkeeping of code

325 declarations: history of serials allows to track potentially

326 non-monotonous declarations appropriately. Minor INCOMPATIBILITY.

329 *** HOL ***

331 * The Nunchaku model finder is now part of "Main".

333 * SMT module:

334 - A new option, 'smt_nat_as_int', has been added to translate 'nat' to

335 'int' and benefit from the SMT solver's theory reasoning. It is

336 disabled by default.

337 - The legacy module "src/HOL/Library/Old_SMT.thy" has been removed.

338 - Several small issues have been rectified in the 'smt' command.

340 * (Co)datatype package: The 'size_gen_o_map' lemma is no longer

341 generated for datatypes with type class annotations. As a result, the

342 tactic that derives it no longer fails on nested datatypes. Slight

343 INCOMPATIBILITY.

345 * Command and antiquotation "value" with modified default strategy:

346 terms without free variables are always evaluated using plain evaluation

347 only, with no fallback on normalization by evaluation. Minor

348 INCOMPATIBILITY.

350 * Theories "GCD" and "Binomial" are already included in "Main" (instead

351 of "Complex_Main").

353 * Constant "surj" is a full input/output abbreviation (again).

354 Minor INCOMPATIBILITY.

356 * Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively.

357 INCOMPATIBILITY.

359 * Renamed ii to imaginary_unit in order to free up ii as a variable

360 name. The syntax \<i> remains available. INCOMPATIBILITY.

362 * Dropped abbreviations transP, antisymP, single_valuedP; use constants

363 transp, antisymp, single_valuedp instead. INCOMPATIBILITY.

365 * Constant "subseq" in Topological_Spaces has been removed -- it is

366 subsumed by "strict_mono". Some basic lemmas specific to "subseq" have

367 been renamed accordingly, e.g. "subseq_o" -> "strict_mono_o" etc.

369 * Theory List: "sublist" renamed to "nths" in analogy with "nth", and

370 "sublisteq" renamed to "subseq". Minor INCOMPATIBILITY.

372 * Theory List: new generic function "sorted_wrt".

374 * Named theorems mod_simps covers various congruence rules concerning

375 mod, replacing former zmod_simps. INCOMPATIBILITY.

377 * Swapped orientation of congruence rules mod_add_left_eq,

378 mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,

379 mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,

380 mod_diff_eq. INCOMPATIBILITY.

382 * Generalized some facts:

383 measure_induct_rule

384 measure_induct

385 zminus_zmod ~> mod_minus_eq

386 zdiff_zmod_left ~> mod_diff_left_eq

387 zdiff_zmod_right ~> mod_diff_right_eq

388 zmod_eq_dvd_iff ~> mod_eq_dvd_iff

389 INCOMPATIBILITY.

391 * Algebraic type class hierarchy of euclidean (semi)rings in HOL:

392 euclidean_(semi)ring, euclidean_(semi)ring_cancel,

393 unique_euclidean_(semi)ring; instantiation requires provision of a

394 euclidean size.

396 * Theory "HOL-Number_Theory.Euclidean_Algorithm" has been reworked:

397 - Euclidean induction is available as rule eucl_induct.

398 - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,

399 Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow

400 easy instantiation of euclidean (semi)rings as GCD (semi)rings.

401 - Coefficients obtained by extended euclidean algorithm are

402 available as "bezout_coefficients".

403 INCOMPATIBILITY.

405 * Theory "Number_Theory.Totient" introduces basic notions about Euler's

406 totient function previously hidden as solitary example in theory

407 Residues. Definition changed so that "totient 1 = 1" in agreement with

408 the literature. Minor INCOMPATIBILITY.

410 * New styles in theory "HOL-Library.LaTeXsugar":

411 - "dummy_pats" for printing equations with "_" on the lhs;

412 - "eta_expand" for printing eta-expanded terms.

414 * Theory "HOL-Library.Permutations": theorem bij_swap_ompose_bij has

415 been renamed to bij_swap_compose_bij. INCOMPATIBILITY.

417 * New theory "HOL-Library.Going_To_Filter" providing the "f going_to F"

418 filter for describing points x such that f(x) is in the filter F.

420 * Theory "HOL-Library.Formal_Power_Series": constants X/E/L/F have been

421 renamed to fps_X/fps_exp/fps_ln/fps_hypergeo to avoid polluting the name

422 space. INCOMPATIBILITY.

424 * Theory "HOL-Library.FinFun" has been moved to AFP (again).

425 INCOMPATIBILITY.

427 * Theory "HOL-Library.FuncSet": some old and rarely used ASCII

428 replacement syntax has been removed. INCOMPATIBILITY, standard syntax

429 with symbols should be used instead. The subsequent commands help to

430 reproduce the old forms, e.g. to simplify porting old theories:

432 syntax (ASCII)

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

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

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

437 * Theory "HOL-Library.Multiset": the simprocs on subsets operators of

438 multisets have been renamed:

440 msetless_cancel_numerals ~> msetsubset_cancel

441 msetle_cancel_numerals ~> msetsubset_eq_cancel

443 INCOMPATIBILITY.

445 * Theory "HOL-Library.Pattern_Aliases" provides input and output syntax

446 for pattern aliases as known from Haskell, Scala and ML.

448 * Theory "HOL-Library.Uprod" formalizes the type of unordered pairs.

450 * Session HOL-Analysis: more material involving arcs, paths, covering

451 spaces, innessential maps, retracts, infinite products, simplicial

452 complexes. Baire Category theorem. Major results include the Jordan

453 Curve Theorem and the Great Picard Theorem.

455 * Session HOL-Algebra has been extended by additional lattice theory:

456 the Knaster-Tarski fixed point theorem and Galois Connections.

458 * Sessions HOL-Computational_Algebra and HOL-Number_Theory: new notions

459 of squarefreeness, n-th powers, and prime powers.

461 * Session "HOL-Computional_Algebra" covers many previously scattered

462 theories, notably Euclidean_Algorithm, Factorial_Ring,

463 Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,

464 Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor

465 INCOMPATIBILITY.

468 *** System ***

470 * Isabelle/Scala: the SQL module supports access to relational

471 databases, either as plain file (SQLite) or full-scale server

472 (PostgreSQL via local port or remote ssh connection).

474 * Results of "isabelle build" are recorded as SQLite database (i.e.

475 "Application File Format" in the sense of

476 https://www.sqlite.org/appfileformat.html). This allows systematic

477 access via operations from module Sessions.Store in Isabelle/Scala.

479 * System option "parallel_proofs" is 1 by default (instead of more

480 aggressive 2). This requires less heap space and avoids burning parallel

481 CPU cycles, while full subproof parallelization is enabled for repeated

482 builds (according to parallel_subproofs_threshold).

484 * System option "record_proofs" allows to change the global

485 Proofterm.proofs variable for a session. Regular values are are 0, 1, 2;

486 a negative value means the current state in the ML heap image remains

487 unchanged.

489 * Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been

490 renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.

492 * Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,

493 ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the

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

495 is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,

496 ISABELLE_PLATFORM64.

498 * Command-line tool "isabelle build_docker" builds a Docker image from

499 the Isabelle application bundle for Linux. See also

500 https://hub.docker.com/r/makarius/isabelle

502 * Command-line tool "isabelle vscode_server" provides a Language Server

503 Protocol implementation, e.g. for the Visual Studio Code editor. It

504 serves as example for alternative PIDE front-ends.

506 * Command-line tool "isabelle imports" helps to maintain theory imports

507 wrt. session structure. Examples for the main Isabelle distribution:

509 isabelle imports -I -a

510 isabelle imports -U -a

511 isabelle imports -U -i -a

512 isabelle imports -M -a -d '~~/src/Benchmarks'

516 New in Isabelle2016-1 (December 2016)

517 -------------------------------------

519 *** General ***

521 * Splitter in proof methods "simp", "auto" and friends:

522 - The syntax "split add" has been discontinued, use plain "split",

523 INCOMPATIBILITY.

524 - For situations with many conditional or case expressions, there is

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

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

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

528 result the subgoal may be split into several subgoals.

530 * Command 'bundle' provides a local theory target to define a bundle

531 from the body of specification commands (such as 'declare',

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

534 bundle foo

535 begin

536 declare a [simp]

537 declare b [intro]

538 end

540 * Command 'unbundle' is like 'include', but works within a local theory

541 context. Unlike "context includes ... begin", the effect of 'unbundle'

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

544 * Simplified outer syntax: uniform category "name" includes long

545 identifiers. Former "xname" / "nameref" / "name reference" has been

546 discontinued.

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

549 delimited uniformly via cartouches. This works better than old-fashioned

550 quotes when sub-languages are nested.

552 * Mixfix annotations support general block properties, with syntax

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

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

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

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

558 * Proof method "blast" is more robust wrt. corner cases of Pure

559 statements without object-logic judgment.

561 * Commands 'prf' and 'full_prf' are somewhat more informative (again):

562 proof terms are reconstructed and cleaned from administrative thm nodes.

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

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

566 examples.

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

569 instances) are generated into companion object of corresponding type

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

572 * Solve direct: option "solve_direct_strict_warnings" gives explicit

573 warnings for lemma statements with trivial proofs.

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

578 * More aggressive flushing of machine-generated input, according to

579 system option editor_generated_input_delay (in addition to existing

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

581 reactivity and CPU usage.

583 * Syntactic indentation according to Isabelle outer syntax. Action

584 "indent-lines" (shortcut C+i) indents the current line according to

585 command keywords and some command substructure. Action

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

587 according to command keywords only; see also option

588 "jedit_indent_newline".

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

591 number of subgoals. This requires information of ongoing document

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

593 quickly; see also option "jedit_script_indent" and

594 "jedit_script_indent_limit".

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

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

598 structure of theory specifications is treated as well.

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

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

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

604 e.g. 'context', 'notepad'.

606 * Sidekick parser "isabelle-context" shows nesting of context blocks

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

609 * Highlighting of entity def/ref positions wrt. cursor.

611 * Action "isabelle.select-entity" (shortcut CS+ENTER) selects all

612 occurrences of the formal entity at the caret position. This facilitates

613 systematic renaming.

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

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

617 theorem statement.

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

620 situations where old ASCII notation may be updated.

622 * Dockable window "Symbols" also provides access to 'abbrevs' from the

623 outer syntax of the current theory buffer. This provides clickable

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

625 inaccessible via keyboard completion).

627 * IDE support for the Isabelle/Pure bootstrap process, with the

628 following independent stages:

630 src/Pure/ROOT0.ML

631 src/Pure/ROOT.ML

632 src/Pure/Pure.thy

633 src/Pure/ML_Bootstrap.thy

635 The ML ROOT files act like quasi-theories in the context of theory

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

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

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

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

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

641 dependencies of the above files are only observed for batch build.

643 * Isabelle/ML and Standard ML files are presented in Sidekick with the

644 tree structure of section headings: this special comment format is

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

647 * Additional abbreviations for syntactic completion may be specified

648 within the theory header as 'abbrevs'. The theory syntax for 'keywords'

649 has been simplified accordingly: optional abbrevs need to go into the

650 new 'abbrevs' section.

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

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

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

656 * Action "isabelle.keymap-merge" asks the user to resolve pending

657 Isabelle keymap changes that are in conflict with the current jEdit

658 keymap; non-conflicting changes are always applied implicitly. This

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

660 increases chances that users see new keyboard shortcuts when re-using

661 old keymaps.

663 * ML and document antiquotations for file-systems paths are more uniform

664 and diverse:

666 @{path NAME} -- no file-system check

667 @{file NAME} -- check for plain file

668 @{dir NAME} -- check for directory

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

671 have to be changed.

674 *** Document preparation ***

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

678 * New document and ML antiquotation @{locale} for locales, similar to

679 existing antiquotation @{class}.

681 * Mixfix annotations support delimiters like \<^control>\<open>cartouche\<close> --

682 this allows special forms of document output.

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

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

686 derivatives.

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

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

691 Isabelle2015).

694 *** Isar ***

696 * Many specification elements support structured statements with 'if' /

697 'for' eigen-context, e.g. 'axiomatization', 'abbreviation',

698 'definition', 'inductive', 'function'.

700 * Toplevel theorem statements support eigen-context notation with 'if' /

701 'for' (in postfix), which corresponds to 'assumes' / 'fixes' in the

702 traditional long statement form (in prefix). Local premises are called

703 "that" or "assms", respectively. Empty premises are *not* bound in the

704 context: INCOMPATIBILITY.

706 * Command 'define' introduces a local (non-polymorphic) definition, with

707 optional abstraction over local parameters. The syntax resembles

708 'definition' and 'obtain'. It fits better into the Isar language than

709 old 'def', which is now a legacy feature.

711 * Command 'obtain' supports structured statements with 'if' / 'for'

712 context.

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

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

717 * The defining position of a literal fact \<open>prop\<close> is maintained more

718 carefully, and made accessible as hyperlink in the Prover IDE.

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

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

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

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

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

726 INCOMPATIBILITY.

728 * Proof methods may refer to the main facts via the dynamic fact

729 "method_facts". This is particularly useful for Eisbach method

730 definitions.

732 * Proof method "use" allows to modify the main facts of a given method

733 expression, e.g.

735 (use facts in simp)

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

738 * The old proof method "default" has been removed (legacy since

739 Isabelle2016). INCOMPATIBILITY, use "standard" instead.

742 *** Pure ***

744 * Pure provides basic versions of proof methods "simp" and "simp_all"

745 that only know about meta-equality (==). Potential INCOMPATIBILITY in

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

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

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

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

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

752 regardless of the actual parameters that are provided. Rare

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

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

756 * Type-inference improves sorts of newly introduced type variables for

757 the object-logic, using its base sort (i.e. HOL.type for Isabelle/HOL).

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

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

760 INCOMPATIBILITY, need to provide explicit type constraints for Pure

761 types where this is really intended.

764 *** HOL ***

766 * New proof method "argo" using the built-in Argo solver based on SMT

767 technology. The method can be used to prove goals of quantifier-free

768 propositional logic, goals based on a combination of quantifier-free

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

770 quantifier-free propositional logic with linear real arithmetic

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

773 * The new "nunchaku" command integrates the Nunchaku model finder. The

774 tool is experimental. See ~~/src/HOL/Nunchaku/Nunchaku.thy for details.

776 * Metis: The problem encoding has changed very slightly. This might

777 break existing proofs. INCOMPATIBILITY.

779 * Sledgehammer:

780 - The MaSh relevance filter is now faster than before.

781 - Produce syntactically correct Vampire 4.0 problem files.

783 * (Co)datatype package:

784 - New commands for defining corecursive functions and reasoning about

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

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

787 method. See 'isabelle doc corec'.

788 - The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a first-class

789 citizen in bounded natural functors.

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

791 to the map function.

792 - 'bnf' automatically discharges reflexive proof obligations.

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

794 terms of map and set

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

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

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

798 INCOMPATIBILITY: manual 'bnf' declarations may need adjustment.

799 - Renamed lemmas:

800 rel_prod_apply ~> rel_prod_inject

801 pred_prod_apply ~> pred_prod_inject

802 INCOMPATIBILITY.

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

804 - The theorems about "rel" and "set" may have a slightly different (but

805 equivalent) form.

806 INCOMPATIBILITY.

808 * The 'coinductive' command produces a proper coinduction rule for

809 mutual coinductive predicates. This new rule replaces the old rule,

810 which exposed details of the internal fixpoint construction and was

811 hard to use. INCOMPATIBILITY.

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

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

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

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

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

820 eliminated altogether.

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

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

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

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

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

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

828 INCOMPATIBILITY in rare situations.

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

831 INCOMPATIBILITY.

833 * Renamed constants and corresponding theorems:

835 setsum ~> sum

836 setprod ~> prod

837 listsum ~> sum_list

838 listprod ~> prod_list

840 INCOMPATIBILITY.

842 * Sligthly more standardized theorem names:

843 sgn_times ~> sgn_mult

844 sgn_mult' ~> Real_Vector_Spaces.sgn_mult

845 divide_zero_left ~> div_0

846 zero_mod_left ~> mod_0

847 divide_zero ~> div_by_0

848 divide_1 ~> div_by_1

849 nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left

850 div_mult_self1_is_id ~> nonzero_mult_div_cancel_left

851 nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right

852 div_mult_self2_is_id ~> nonzero_mult_div_cancel_right

853 is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left

854 is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right

855 mod_div_equality ~> div_mult_mod_eq

856 mod_div_equality2 ~> mult_div_mod_eq

857 mod_div_equality3 ~> mod_div_mult_eq

858 mod_div_equality4 ~> mod_mult_div_eq

859 minus_div_eq_mod ~> minus_div_mult_eq_mod

860 minus_div_eq_mod2 ~> minus_mult_div_eq_mod

861 minus_mod_eq_div ~> minus_mod_eq_div_mult

862 minus_mod_eq_div2 ~> minus_mod_eq_mult_div

863 div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]

864 mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]

865 zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]

866 zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]

867 Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

868 mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

869 zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

870 div_1 ~> div_by_Suc_0

871 mod_1 ~> mod_by_Suc_0

872 INCOMPATIBILITY.

874 * New type class "idom_abs_sgn" specifies algebraic properties

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

876 disappeared. Slight INCOMPATIBILITY.

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

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

881 corresponding to {0..255}.

883 - Logical representation:

884 * 0 is instantiated to the ASCII zero character.

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

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

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

888 are non-canonical.

889 - Printing and parsing:

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

891 (as before).

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

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

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

895 is parsable for every numeral expression n.

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

897 printed as their logical representation.

898 - Explicit conversions from and to the natural numbers are

899 provided as char_of_nat, nat_of_char (as before).

900 - The auxiliary nibble type has been discontinued.

902 INCOMPATIBILITY.

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

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

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

907 infix "mod" syntax. INCOMPATIBILITY.

909 * Statements and proofs of Knaster-Tarski fixpoint combinators lfp/gfp

910 have been clarified. The fixpoint properties are lfp_fixpoint, its

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

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

913 easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.

915 * Constant "surj" is a mere input abbreviation, to avoid hiding an

916 equation in term output. Minor INCOMPATIBILITY.

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

919 which renders those abstract effectively.

921 * Command 'export_code' checks given constants for abstraction

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

923 interface for the generated code.

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

926 spelt out explicitly.

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

929 explicitly provided auxiliary definitions for required type class

930 dictionaries rather than half-working magic. INCOMPATIBILITY, see the

931 tutorial on code generation for details.

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

934 products.

936 * Locale bijection establishes convenient default simp rules such as

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

939 * Abstract locales semigroup, abel_semigroup, semilattice,

940 semilattice_neutr, ordering, ordering_top, semilattice_order,

941 semilattice_neutr_order, comm_monoid_set, semilattice_set,

942 semilattice_neutr_set, semilattice_order_set,

943 semilattice_order_neutr_set monoid_list, comm_monoid_list,

944 comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified

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

946 INCOMPATIBILITY.

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

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

950 lifting_syntax begin ... end". Minor INCOMPATIBILITY.

952 * Some old / obsolete theorems have been renamed / removed, potential

953 INCOMPATIBILITY.

955 nat_less_cases -- removed, use linorder_cases instead

956 inv_image_comp -- removed, use image_inv_f_f instead

957 image_surj_f_inv_f ~> image_f_inv_f

959 * Some theorems about groups and orders have been generalised from

960 groups to semi-groups that are also monoids:

961 le_add_same_cancel1

962 le_add_same_cancel2

963 less_add_same_cancel1

964 less_add_same_cancel2

965 add_le_same_cancel1

966 add_le_same_cancel2

967 add_less_same_cancel1

968 add_less_same_cancel2

970 * Some simplifications theorems about rings have been removed, since

971 superseeded by a more general version:

972 less_add_cancel_left_greater_zero ~> less_add_same_cancel1

973 less_add_cancel_right_greater_zero ~> less_add_same_cancel2

974 less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1

975 less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2

976 less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1

977 less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2

978 less_add_cancel_left_less_zero ~> add_less_same_cancel1

979 less_add_cancel_right_less_zero ~> add_less_same_cancel2

980 INCOMPATIBILITY.

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

983 resemble the f.split naming convention, INCOMPATIBILITY.

985 * Added class topological_monoid.

987 * The following theorems have been renamed:

989 setsum_left_distrib ~> sum_distrib_right

990 setsum_right_distrib ~> sum_distrib_left

992 INCOMPATIBILITY.

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

995 INCOMPATIBILITY.

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

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

999 A)".

1001 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.

1003 * The type class ordered_comm_monoid_add is now called

1004 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add

1005 is introduced as the combination of ordered_ab_semigroup_add +

1006 comm_monoid_add. INCOMPATIBILITY.

1008 * Introduced the type classes canonically_ordered_comm_monoid_add and

1009 dioid.

1011 * Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When

1012 instantiating linordered_semiring_strict and ordered_ab_group_add, an

1013 explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might

1014 be required. INCOMPATIBILITY.

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

1017 of a more general type also:

1018 lcm_left_commute_nat ~> lcm.left_commute

1019 lcm_left_commute_int ~> lcm.left_commute

1020 gcd_left_commute_nat ~> gcd.left_commute

1021 gcd_left_commute_int ~> gcd.left_commute

1022 gcd_greatest_iff_nat ~> gcd_greatest_iff

1023 gcd_greatest_iff_int ~> gcd_greatest_iff

1024 coprime_dvd_mult_nat ~> coprime_dvd_mult

1025 coprime_dvd_mult_int ~> coprime_dvd_mult

1026 zpower_numeral_even ~> power_numeral_even

1027 gcd_mult_cancel_nat ~> gcd_mult_cancel

1028 gcd_mult_cancel_int ~> gcd_mult_cancel

1029 div_gcd_coprime_nat ~> div_gcd_coprime

1030 div_gcd_coprime_int ~> div_gcd_coprime

1031 zpower_numeral_odd ~> power_numeral_odd

1032 zero_less_int_conv ~> of_nat_0_less_iff

1033 gcd_greatest_nat ~> gcd_greatest

1034 gcd_greatest_int ~> gcd_greatest

1035 coprime_mult_nat ~> coprime_mult

1036 coprime_mult_int ~> coprime_mult

1037 lcm_commute_nat ~> lcm.commute

1038 lcm_commute_int ~> lcm.commute

1039 int_less_0_conv ~> of_nat_less_0_iff

1040 gcd_commute_nat ~> gcd.commute

1041 gcd_commute_int ~> gcd.commute

1042 Gcd_insert_nat ~> Gcd_insert

1043 Gcd_insert_int ~> Gcd_insert

1044 of_int_int_eq ~> of_int_of_nat_eq

1045 lcm_least_nat ~> lcm_least

1046 lcm_least_int ~> lcm_least

1047 lcm_assoc_nat ~> lcm.assoc

1048 lcm_assoc_int ~> lcm.assoc

1049 int_le_0_conv ~> of_nat_le_0_iff

1050 int_eq_0_conv ~> of_nat_eq_0_iff

1051 Gcd_empty_nat ~> Gcd_empty

1052 Gcd_empty_int ~> Gcd_empty

1053 gcd_assoc_nat ~> gcd.assoc

1054 gcd_assoc_int ~> gcd.assoc

1055 zero_zle_int ~> of_nat_0_le_iff

1056 lcm_dvd2_nat ~> dvd_lcm2

1057 lcm_dvd2_int ~> dvd_lcm2

1058 lcm_dvd1_nat ~> dvd_lcm1

1059 lcm_dvd1_int ~> dvd_lcm1

1060 gcd_zero_nat ~> gcd_eq_0_iff

1061 gcd_zero_int ~> gcd_eq_0_iff

1062 gcd_dvd2_nat ~> gcd_dvd2

1063 gcd_dvd2_int ~> gcd_dvd2

1064 gcd_dvd1_nat ~> gcd_dvd1

1065 gcd_dvd1_int ~> gcd_dvd1

1066 int_numeral ~> of_nat_numeral

1067 lcm_ac_nat ~> ac_simps

1068 lcm_ac_int ~> ac_simps

1069 gcd_ac_nat ~> ac_simps

1070 gcd_ac_int ~> ac_simps

1071 abs_int_eq ~> abs_of_nat

1072 zless_int ~> of_nat_less_iff

1073 zdiff_int ~> of_nat_diff

1074 zadd_int ~> of_nat_add

1075 int_mult ~> of_nat_mult

1076 int_Suc ~> of_nat_Suc

1077 inj_int ~> inj_of_nat

1078 int_1 ~> of_nat_1

1079 int_0 ~> of_nat_0

1080 Lcm_empty_nat ~> Lcm_empty

1081 Lcm_empty_int ~> Lcm_empty

1082 Lcm_insert_nat ~> Lcm_insert

1083 Lcm_insert_int ~> Lcm_insert

1084 comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd

1085 comp_fun_idem_gcd_int ~> comp_fun_idem_gcd

1086 comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm

1087 comp_fun_idem_lcm_int ~> comp_fun_idem_lcm

1088 Lcm_eq_0 ~> Lcm_eq_0_I

1089 Lcm0_iff ~> Lcm_0_iff

1090 Lcm_dvd_int ~> Lcm_least

1091 divides_mult_nat ~> divides_mult

1092 divides_mult_int ~> divides_mult

1093 lcm_0_nat ~> lcm_0_right

1094 lcm_0_int ~> lcm_0_right

1095 lcm_0_left_nat ~> lcm_0_left

1096 lcm_0_left_int ~> lcm_0_left

1097 dvd_gcd_D1_nat ~> dvd_gcdD1

1098 dvd_gcd_D1_int ~> dvd_gcdD1

1099 dvd_gcd_D2_nat ~> dvd_gcdD2

1100 dvd_gcd_D2_int ~> dvd_gcdD2

1101 coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff

1102 coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff

1103 realpow_minus_mult ~> power_minus_mult

1104 realpow_Suc_le_self ~> power_Suc_le_self

1105 dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest

1106 INCOMPATIBILITY.

1108 * Renamed HOL/Quotient_Examples/FSet.thy to

1109 HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.

1111 * Session HOL-Library: theory FinFun bundles "finfun_syntax" and

1112 "no_finfun_syntax" allow to control optional syntax in local contexts;

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

1114 "unbundle finfun_syntax" to imitate import of

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

1117 * Session HOL-Library: theory Multiset_Permutations (executably) defines

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

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

1120 once.

1122 * Session HOL-Library: multiset membership is now expressed using

1123 set_mset rather than count.

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

1126 by default.

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

1129 equations count_eq_zero_iff and not_in_iff.

1131 - Rules count_inI and in_countE obtain facts of the form

1132 "count M a = n" from membership.

1134 - Rules count_in_diffI and in_diff_countE obtain facts of the form

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

1137 INCOMPATIBILITY.

1139 * Session HOL-Library: theory LaTeXsugar uses new-style "dummy_pats" for

1140 displaying equations in functional programming style --- variables

1141 present on the left-hand but not on the righ-hand side are replaced by

1142 underscores.

1144 * Session HOL-Library: theory Combinator_PER provides combinator to

1145 build partial equivalence relations from a predicate and an equivalence

1146 relation.

1148 * Session HOL-Library: theory Perm provides basic facts about almost

1149 everywhere fix bijections.

1151 * Session HOL-Library: theory Normalized_Fraction allows viewing an

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

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

1154 denominator is normalized wrt. unit factors).

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

1158 * Session HOL-Multivariate_Analysis has been renamed to HOL-Analysis.

1160 * Session HOL-Analysis: measure theory has been moved here from

1161 HOL-Probability. When importing HOL-Analysis some theorems need

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

1164 * Session HOL-Analysis: more complex analysis including Cauchy's

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

1166 principle, Residue theorem, Schwarz Lemma.

1168 * Session HOL-Analysis: Theory of polyhedra: faces, extreme points,

1169 polytopes, and the Krein–Milman Minkowski theorem.

1171 * Session HOL-Analysis: Numerous results ported from the HOL Light

1172 libraries: homeomorphisms, continuous function extensions, invariance of

1173 domain.

1175 * Session HOL-Probability: the type of emeasure and nn_integral was

1176 changed from ereal to ennreal, INCOMPATIBILITY.

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

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

1181 * Session HOL-Probability: Code generation and QuickCheck for

1182 Probability Mass Functions.

1184 * Session HOL-Probability: theory Random_Permutations contains some

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

1186 folding over a list in random order.

1188 * Session HOL-Probability: theory SPMF formalises discrete

1189 subprobability distributions.

1191 * Session HOL-Library: the names of multiset theorems have been

1192 normalised to distinguish which ordering the theorems are about

1194 mset_less_eqI ~> mset_subset_eqI

1195 mset_less_insertD ~> mset_subset_insertD

1196 mset_less_eq_count ~> mset_subset_eq_count

1197 mset_less_diff_self ~> mset_subset_diff_self

1198 mset_le_exists_conv ~> mset_subset_eq_exists_conv

1199 mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel

1200 mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel

1201 mset_le_mono_add ~> mset_subset_eq_mono_add

1202 mset_le_add_left ~> mset_subset_eq_add_left

1203 mset_le_add_right ~> mset_subset_eq_add_right

1204 mset_le_single ~> mset_subset_eq_single

1205 mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute

1206 diff_le_self ~> diff_subset_eq_self

1207 mset_leD ~> mset_subset_eqD

1208 mset_lessD ~> mset_subsetD

1209 mset_le_insertD ~> mset_subset_eq_insertD

1210 mset_less_of_empty ~> mset_subset_of_empty

1211 mset_less_size ~> mset_subset_size

1212 wf_less_mset_rel ~> wf_subset_mset_rel

1213 count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq

1214 mset_remdups_le ~> mset_remdups_subset_eq

1215 ms_lesseq_impl ~> subset_eq_mset_impl

1217 Some functions have been renamed:

1218 ms_lesseq_impl -> subset_eq_mset_impl

1220 * HOL-Library: multisets are now ordered with the multiset ordering

1221 #\<subseteq># ~> \<le>

1222 #\<subset># ~> <

1223 le_multiset ~> less_eq_multiset

1224 less_multiset ~> le_multiset

1225 INCOMPATIBILITY.

1227 * Session HOL-Library: the prefix multiset_order has been discontinued:

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

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

1230 interpretations "multiset_linorder" and "multiset_wellorder" have been

1231 replaced by instantiations. INCOMPATIBILITY.

1233 * Session HOL-Library: some theorems about the multiset ordering have

1234 been renamed:

1236 le_multiset_def ~> less_eq_multiset_def

1237 less_multiset_def ~> le_multiset_def

1238 less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset

1239 mult_less_not_refl ~> mset_le_not_refl

1240 mult_less_trans ~> mset_le_trans

1241 mult_less_not_sym ~> mset_le_not_sym

1242 mult_less_asym ~> mset_le_asym

1243 mult_less_irrefl ~> mset_le_irrefl

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

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

1247 le_multiset_total ~> less_eq_multiset_total

1248 less_multiset_right_total ~> subset_eq_imp_le_multiset

1249 le_multiset_empty_left ~> less_eq_multiset_empty_left

1250 le_multiset_empty_right ~> less_eq_multiset_empty_right

1251 less_multiset_empty_right ~> le_multiset_empty_left

1252 less_multiset_empty_left ~> le_multiset_empty_right

1253 union_less_diff_plus ~> union_le_diff_plus

1254 ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset

1255 less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty

1256 le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty

1257 INCOMPATIBILITY.

1259 * Session HOL-Library: the lemma mset_map has now the attribute [simp].

1260 INCOMPATIBILITY.

1262 * Session HOL-Library: some theorems about multisets have been removed.

1263 INCOMPATIBILITY, use the following replacements:

1265 le_multiset_plus_plus_left_iff ~> add_less_cancel_right

1266 less_multiset_plus_plus_left_iff ~> add_less_cancel_right

1267 le_multiset_plus_plus_right_iff ~> add_less_cancel_left

1268 less_multiset_plus_plus_right_iff ~> add_less_cancel_left

1269 add_eq_self_empty_iff ~> add_cancel_left_right

1270 mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right

1271 mset_less_add_bothsides ~> subset_mset.add_less_cancel_right

1272 mset_le_add_bothsides ~> subset_mset.add_less_cancel_right

1273 empty_inter ~> subset_mset.inf_bot_left

1274 inter_empty ~> subset_mset.inf_bot_right

1275 empty_sup ~> subset_mset.sup_bot_left

1276 sup_empty ~> subset_mset.sup_bot_right

1277 bdd_below_multiset ~> subset_mset.bdd_above_bot

1278 subset_eq_empty ~> subset_mset.le_zero_eq

1279 le_empty ~> subset_mset.le_zero_eq

1280 mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

1281 mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

1283 * Session HOL-Library: some typeclass constraints about multisets have

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

1285 additional typeclasses order_bot, no_top,

1286 ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,

1287 linordered_cancel_ab_semigroup_add, and

1288 ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.

1290 * Session HOL-Library: there are some new simplification rules about

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

1292 INCOMPATIBILITY.

1294 * Session HOL-Library: the subset ordering on multisets has now the

1295 interpretations ordered_ab_semigroup_monoid_add_imp_le and

1296 bounded_lattice_bot. INCOMPATIBILITY.

1298 * Session HOL-Library, theory Multiset: single has been removed in favor

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

1300 removed or changed:

1302 single_not_empty ~> add_mset_not_empty or empty_not_add_mset

1303 fold_mset_insert ~> fold_mset_add_mset

1304 image_mset_insert ~> image_mset_add_mset

1305 union_single_eq_diff

1306 multi_self_add_other_not_self

1307 diff_single_eq_union

1308 INCOMPATIBILITY.

1310 * Session HOL-Library, theory Multiset: some theorems have been changed

1311 to use add_mset instead of single:

1313 mset_add

1314 multi_self_add_other_not_self

1315 diff_single_eq_union

1316 union_single_eq_diff

1317 union_single_eq_member

1318 add_eq_conv_diff

1319 insert_noteq_member

1320 add_eq_conv_ex

1321 multi_member_split

1322 multiset_add_sub_el_shuffle

1323 mset_subset_eq_insertD

1324 mset_subset_insertD

1325 insert_subset_eq_iff

1326 insert_union_subset_iff

1327 multi_psub_of_add_self

1328 inter_add_left1

1329 inter_add_left2

1330 inter_add_right1

1331 inter_add_right2

1332 sup_union_left1

1333 sup_union_left2

1334 sup_union_right1

1335 sup_union_right2

1336 size_eq_Suc_imp_eq_union

1337 multi_nonempty_split

1338 mset_insort

1339 mset_update

1340 mult1I

1341 less_add

1342 mset_zip_take_Cons_drop_twice

1343 rel_mset_Zero

1344 msed_map_invL

1345 msed_map_invR

1346 msed_rel_invL

1347 msed_rel_invR

1348 le_multiset_right_total

1349 multiset_induct

1350 multiset_induct2_size

1351 multiset_induct2

1352 INCOMPATIBILITY.

1354 * Session HOL-Library, theory Multiset: the definitions of some

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

1356 element:

1358 image_mset

1359 mset

1360 replicate_mset

1361 mult1

1362 pred_mset

1363 rel_mset'

1364 mset_insort

1366 INCOMPATIBILITY.

1368 * Session HOL-Library, theory Multiset: due to the above changes, the

1369 attributes of some multiset theorems have been changed:

1371 insert_DiffM [] ~> [simp]

1372 insert_DiffM2 [simp] ~> []

1373 diff_add_mset_swap [simp]

1374 fold_mset_add_mset [simp]

1375 diff_diff_add [simp] (for multisets only)

1376 diff_cancel [simp] ~> []

1377 count_single [simp] ~> []

1378 set_mset_single [simp] ~> []

1379 size_multiset_single [simp] ~> []

1380 size_single [simp] ~> []

1381 image_mset_single [simp] ~> []

1382 mset_subset_eq_mono_add_right_cancel [simp] ~> []

1383 mset_subset_eq_mono_add_left_cancel [simp] ~> []

1384 fold_mset_single [simp] ~> []

1385 subset_eq_empty [simp] ~> []

1386 empty_sup [simp] ~> []

1387 sup_empty [simp] ~> []

1388 inter_empty [simp] ~> []

1389 empty_inter [simp] ~> []

1390 INCOMPATIBILITY.

1392 * Session HOL-Library, theory Multiset: the order of the variables in

1393 the second cases of multiset_induct, multiset_induct2_size,

1394 multiset_induct2 has been changed (e.g. Add A a ~> Add a A).

1395 INCOMPATIBILITY.

1397 * Session HOL-Library, theory Multiset: there is now a simplification

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

1399 natural numbers. INCOMPATIBILITY.

1401 * Session HOL-Library, theory Multiset: renamed sums and products of

1402 multisets:

1404 msetsum ~> sum_mset

1405 msetprod ~> prod_mset

1407 * Session HOL-Library, theory Multiset: the notation for intersection

1408 and union of multisets have been changed:

1410 #\<inter> ~> \<inter>#

1411 #\<union> ~> \<union>#

1413 INCOMPATIBILITY.

1415 * Session HOL-Library, theory Multiset: the lemma

1416 one_step_implies_mult_aux on multisets has been removed, use

1417 one_step_implies_mult instead. INCOMPATIBILITY.

1419 * Session HOL-Library: theory Complete_Partial_Order2 provides reasoning

1420 support for monotonicity and continuity in chain-complete partial orders

1421 and about admissibility conditions for fixpoint inductions.

1423 * Session HOL-Library: theory Library/Polynomial contains also

1424 derivation of polynomials (formerly in Library/Poly_Deriv) but not

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

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

1427 future different type class instantiation for polynomials over factorial

1428 rings. INCOMPATIBILITY.

1430 * Session HOL-Library: theory Sublist provides function "prefixes" with

1431 the following renaming

1433 prefixeq -> prefix

1434 prefix -> strict_prefix

1435 suffixeq -> suffix

1436 suffix -> strict_suffix

1438 Added theory of longest common prefixes.

1440 * Session HOL-Number_Theory: algebraic foundation for primes:

1441 Generalisation of predicate "prime" and introduction of predicates

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

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

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

1445 "prime_nat_iff". INCOMPATIBILITY.

1447 * Session Old_Number_Theory has been removed, after porting remaining

1448 theories.

1450 * Session HOL-Types_To_Sets provides an experimental extension of

1451 Higher-Order Logic to allow translation of types to sets.

1454 *** ML ***

1456 * Integer.gcd and Integer.lcm use efficient operations from the Poly/ML

1457 library (notably for big integers). Subtle change of semantics:

1458 Integer.gcd and Integer.lcm both normalize the sign, results are never

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

1460 INCOMPATIBILITY.

1462 * Structure Rat for rational numbers is now an integral part of

1463 Isabelle/ML, with special notation @int/nat or @int for numerals (an

1464 abbreviation for antiquotation @{Pure.rat argument}) and ML pretty

1465 printing. Standard operations on type Rat.rat are provided via ad-hoc

1466 overloading of + - * / < <= > >= ~ abs. INCOMPATIBILITY, need to

1467 use + instead of +/ etc. Moreover, exception Rat.DIVZERO has been

1468 superseded by General.Div.

1470 * ML antiquotation @{path} is superseded by @{file}, which ensures that

1471 the argument is a plain file. Minor INCOMPATIBILITY.

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

1474 with approximative output quality.

1476 * Low-level ML system structures (like PolyML and RunCall) are no longer

1477 exposed to Isabelle/ML user-space. Potential INCOMPATIBILITY.

1479 * The ML function "ML" provides easy access to run-time compilation.

1480 This is particularly useful for conditional compilation, without

1481 requiring separate files.

1483 * Option ML_exception_debugger controls detailed exception trace via the

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

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

1486 debugger information requires consirable time and space: main

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

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

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

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

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

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

1494 balanced blocks of Local_Theory.open_target versus

1495 Local_Theory.close_target instead. Rare INCOMPATIBILITY.

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

1498 replaced by structure Timeout, with slightly different signature.

1499 INCOMPATIBILITY.

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

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

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

1504 File.full_path). Potential INCOMPATIBILITY.

1506 * Binding.empty_atts supersedes Thm.empty_binding and

1507 Attrib.empty_binding. Minor INCOMPATIBILITY.

1510 *** System ***

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

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

1515 much less disk space.

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

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

1519 particular:

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

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

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

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

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

1527 prover front-ends should use ML_Process or Isabelle_Process in

1528 Isabelle/Scala. INCOMPATIBILITY.

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

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

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

1533 return code 1.

1535 * The command-line tool "isabelle build" supports option -N for cyclic

1536 shuffling of NUMA CPU nodes. This may help performance tuning on Linux

1537 servers with separate CPU/memory modules.

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

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

1541 unless there is already a default provided via ML_OPTIONS settings.

1543 * System option "checkpoint" helps to fine-tune the global heap space

1544 management of isabelle build. This is relevant for big sessions that may

1545 exhaust the small 32-bit address space of the ML process (which is used

1546 by default).

1548 * System option "profiling" specifies the mode for global ML profiling

1549 in "isabelle build". Possible values are "time", "allocations". The

1550 command-line tool "isabelle profiling_report" helps to digest the

1551 resulting log files.

1553 * System option "ML_process_policy" specifies an optional command prefix

1554 for the underlying ML process, e.g. to control CPU affinity on

1555 multiprocessor systems. The "isabelle jedit" tool allows to override the

1556 implicit default via option -p.

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

1559 bootstrapping Isabelle/Pure interactively.

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

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

1563 Isabelle/ML or Isabelle/Scala.

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

1566 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,

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

1568 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been

1569 discontinued. Potential INCOMPATIBILITY.

1571 * The Isabelle system environment always ensures that the main

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

1573 "isabelle_scala_script".

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

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

1577 Isabelle_Tool.Body.

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

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

1581 produce robust shell scripts under program control, without worrying

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

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

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

1585 been discontinued.

1587 * The isabelle_java executable allows to run a Java process within the

1588 name space of Java and Scala components that are bundled with Isabelle,

1589 but without the Isabelle settings environment.

1591 * Isabelle/Scala: the SSH module supports ssh and sftp connections, for

1592 remote command-execution and file-system access. This resembles

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

1594 that Path specifications need to be resolved remotely via

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

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

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

1599 regular hg command-line interface. The repositroy clone and working

1600 directory may reside on a local or remote file-system (via ssh

1601 connection).

1605 New in Isabelle2016 (February 2016)

1606 -----------------------------------

1608 *** General ***

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

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

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

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

1614 examples that do require HOL.

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

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

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

1620 without any special print mode. Important ASCII replacement syntax

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

1622 has been removed (see below).

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

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

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

1628 context has been discontinued. Rare INCOMPATIBILITY, use explicit

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

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

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

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

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

1635 meaning.

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

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

1639 to update old sources.

1641 * Toplevel theorem statements have been simplified as follows:

1643 theorems ~> lemmas

1644 schematic_lemma ~> schematic_goal

1645 schematic_theorem ~> schematic_goal

1646 schematic_corollary ~> schematic_goal

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

1649 accordingly.

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

1652 'theorem'.

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

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

1656 deferred definitions require a surrounding 'overloading' block.

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

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

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

1663 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

1664 'SML_file_no_debug' control compilation of sources with or without

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

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

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

1668 any effect on the running ML program.

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

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

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

1673 update.

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

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

1677 enable option "editor_output_state".

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

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

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

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

1683 visibility.

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

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

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

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

1689 panel.

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

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

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

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

1696 implicit: a popup will show up unconditionally.

1698 * Additional abbreviations for syntactic completion may be specified in

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

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

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

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

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

1705 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.

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

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

1709 the editor.

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

1712 instead of former C+e LEFT.

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

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

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

1717 instead.

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

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

1721 single-instance applications seen on common GUI desktops.

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

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

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

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

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

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

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

1734 *** Document preparation ***

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

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

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

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

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

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

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

1745 follows:

1747 \<^item> itemize

1748 \<^enum> enumerate

1749 \<^descr> description

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

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

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

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

1755 standard Isabelle fonts provide glyphs to render important control

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

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

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

1760 standard LaTeX macros of the same names.

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

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

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

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

1766 cartouche tokens seen in theory sources.

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

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

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

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

1772 or terminal spaces are ignored.

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

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

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

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

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

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

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

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

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

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

1788 documentation, with a hyperlink in the Prover IDE.

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

1791 entities of the Isar language.

1793 * HTML presentation uses the standard IsabelleText font and Unicode

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

1795 print mode "HTML" loses its special meaning.

1798 *** Isar ***

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

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

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

1803 example:

1805 have result: "C x y"

1806 if "A x" and "B y"

1807 for x :: 'a and y :: 'a

1808 <proof>

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

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

1812 corresponds to a raw proof block like this:

1814 {

1815 fix x :: 'a and y :: 'a

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

1817 have "C x y" <proof>

1818 }

1819 note result = this

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

1822 instead of 'assume' above.

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

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

1827 assume result: "C x y"

1828 if "A x" and "B y"

1829 for x :: 'a and y :: 'a

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

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

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

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

1836 example:

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

1840 is equivalent to:

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

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

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

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

1847 follows:

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

1851 or:

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

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

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

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

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

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

1862 of the local context elements yet.

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

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

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

1868 then have something

1869 proof cases

1870 case a

1871 then show ?thesis <proof>

1872 next

1873 case b

1874 then show ?thesis <proof>

1875 next

1876 case c

1877 then show ?thesis <proof>

1878 qed

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

1882 case a: (c xs)

1883 case a [attributes]: (c xs)

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

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

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

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

1889 and always put attributes in front.

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

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

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

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

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

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

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

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

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

1902 supply [simp] = a

1903 proof

1904 show A by simp

1905 next

1906 show A by simp

1907 qed

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

1910 proof body as well, abstracted over relevant parameters.

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

1913 parameter scope for of each clause.

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

1916 statements: result is abstracted over unknowns.

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

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

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

1921 manual.

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

1924 ('apply' scripts).

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

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

1928 example:

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

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

1932 proof goal_cases

1933 case (1 x)

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

1935 next

1936 case (2 y z)

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

1938 qed

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

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

1942 proof goal_cases

1943 case prems: 1

1944 then show ?case using prems sorry

1945 next

1946 case prems: 2

1947 then show ?case using prems sorry

1948 qed

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

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

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

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

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

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

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

1959 occasionally useful for demonstration and testing purposes.

1962 *** Pure ***

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

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

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

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

1969 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

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

1972 * More gentle suppression of syntax along locale morphisms while

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

1974 would be suppressed for morphisms except term identity. Now

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

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

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

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

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

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

1982 begin

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

1984 end

1986 locale morphism =

1987 left: struct composition + right: struct composition'

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

1989 begin

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

1991 end

1993 * Command 'global_interpretation' issues interpretations into global

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

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

1997 'defines'.

1999 * Command 'permanent_interpretation' has been discontinued. Use

2000 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

2002 * Command 'print_definitions' prints dependencies of definitional

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

2005 * Configuration option rule_insts_schematic has been discontinued

2006 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

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

2009 INCOMPATIBILITY in situations where the previous misbehaviour has been

2010 exploited.

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

2013 operations behave more similar to abbreviations. Potential

2014 INCOMPATIBILITY in exotic situations.

2017 *** HOL ***

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

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

2021 global collection of overloaded constant / type definitions into

2022 account. Type definitions with open dependencies on overloaded

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

2024 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

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

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

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

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

2030 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

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

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

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

2035 simplify porting old theories:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

2064 INCOMPATIBILITY, use plain "::" instead.

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

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

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

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

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

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

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

2074 definition and its monotonicity result. Rare INCOMPATIBILITY.

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

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

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

2079 also subject to "inductive_internals". Rare INCOMPATIBILITY.

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

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

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

2084 INCOMPATIBILITY.

2086 * Combinator to represent case distinction on products is named

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

2088 theorem aliasses have been retained.

2090 Consolidated facts:

2091 PairE ~> prod.exhaust

2092 Pair_eq ~> prod.inject

2093 pair_collapse ~> prod.collapse

2094 Pair_fst_snd_eq ~> prod_eq_iff

2095 split_twice ~> prod.case_distrib

2096 split_weak_cong ~> prod.case_cong_weak

2097 split_split ~> prod.split

2098 split_split_asm ~> prod.split_asm

2099 splitI ~> case_prodI

2100 splitD ~> case_prodD

2101 splitI2 ~> case_prodI2

2102 splitI2' ~> case_prodI2'

2103 splitE ~> case_prodE

2104 splitE' ~> case_prodE'

2105 split_pair ~> case_prod_Pair

2106 split_eta ~> case_prod_eta

2107 split_comp ~> case_prod_comp

2108 mem_splitI ~> mem_case_prodI

2109 mem_splitI2 ~> mem_case_prodI2

2110 mem_splitE ~> mem_case_prodE

2111 The_split ~> The_case_prod

2112 cond_split_eta ~> cond_case_prod_eta

2113 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

2114 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

2115 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

2116 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

2117 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

2118 Domain_Collect_split ~> Domain_Collect_case_prod

2119 Image_Collect_split ~> Image_Collect_case_prod

2120 Range_Collect_split ~> Range_Collect_case_prod

2121 Eps_split ~> Eps_case_prod

2122 Eps_split_eq ~> Eps_case_prod_eq

2123 split_rsp ~> case_prod_rsp

2124 curry_split ~> curry_case_prod

2125 split_curry ~> case_prod_curry

2127 Changes in structure HOLogic:

2128 split_const ~> case_prod_const

2129 mk_split ~> mk_case_prod

2130 mk_psplits ~> mk_ptupleabs

2131 strip_psplits ~> strip_ptupleabs

2133 INCOMPATIBILITY.

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

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

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

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

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

2141 Consolidated facts (among others):

2142 real_of_nat_le_iff -> of_nat_le_iff

2143 real_of_nat_numeral of_nat_numeral

2144 real_of_int_zero of_int_0

2145 real_of_nat_zero of_nat_0

2146 real_of_one of_int_1

2147 real_of_int_add of_int_add

2148 real_of_nat_add of_nat_add

2149 real_of_int_diff of_int_diff

2150 real_of_nat_diff of_nat_diff

2151 floor_subtract floor_diff_of_int

2152 real_of_int_inject of_int_eq_iff

2153 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

2154 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

2155 real_of_nat_ge_zero of_nat_0_le_iff

2156 real_of_int_ceiling_ge le_of_int_ceiling

2157 ceiling_less_eq ceiling_less_iff

2158 ceiling_le_eq ceiling_le_iff

2159 less_floor_eq less_floor_iff

2160 floor_less_eq floor_less_iff

2161 floor_divide_eq_div floor_divide_of_int_eq

2162 real_of_int_zero_cancel of_nat_eq_0_iff

2163 ceiling_real_of_int ceiling_of_int

2165 INCOMPATIBILITY.

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

2168 been removed. INCOMPATIBILITY.

2170 * Quickcheck setup for finite sets.

2172 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

2174 * Sledgehammer:

2175 - The MaSh relevance filter has been sped up.

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

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

2178 - Auto Sledgehammer now minimizes and preplays the results.

2179 - Handle Vampire 4.0 proof output without raising exception.

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

2181 Isabelle/jEdit instead. INCOMPATIBILITY.

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

2184 * Nitpick:

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

2186 - Fixed soundness bug in "destroy_constrs" optimization.

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

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

2189 - Eliminated obsolete "blocking" option.

2191 * (Co)datatype package:

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

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

2194 - Always generate "case_transfer" theorem.

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

2196 "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.

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

2198 being defined.

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

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

2202 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

2203 'transfer_prover_start' and 'transfer_prover_end'.

2205 * New diagnostic command print_record for displaying record definitions.

2207 * Division on integers is bootstrapped directly from division on

2208 naturals and uses generic numeral algorithm for computations. Slight

2209 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

2210 simprocs binary_int_div and binary_int_mod

2212 * Tightened specification of class semiring_no_zero_divisors. Minor

2213 INCOMPATIBILITY.

2215 * Class algebraic_semidom introduces common algebraic notions of

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

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

2218 fields with notions that are trivial there.

2220 * Class normalization_semidom specifies canonical representants for

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

2222 This formalizes associated elements as well.

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

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

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

2227 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

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

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

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

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

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

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

2235 during instantiation.

2237 * New cancellation simprocs for boolean algebras to cancel complementary

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

2239 "top". INCOMPATIBILITY.

2241 * Class uniform_space introduces uniform spaces btw topological spaces

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

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

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

2246 open_real_def \<leadsto> open_dist

2247 open_complex_def \<leadsto> open_dist

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

2251 * Library/Multiset:

2252 - Renamed multiset inclusion operators:

2253 < ~> <#

2254 > ~> >#

2255 <= ~> <=#

2256 >= ~> >=#

2257 \<le> ~> \<le>#

2258 \<ge> ~> \<ge>#

2259 INCOMPATIBILITY.

2260 - Added multiset inclusion operator syntax:

2261 \<subset>#

2262 \<subseteq>#

2263 \<supset>#

2264 \<supseteq>#

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

2266 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

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

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

2269 are now available through the "subset_mset" interpretation

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

2271 INCOMPATIBILITY.

2272 - Renamed conversions:

2273 multiset_of ~> mset

2274 multiset_of_set ~> mset_set

2275 set_of ~> set_mset

2276 INCOMPATIBILITY

2277 - Renamed lemmas:

2278 mset_le_def ~> subseteq_mset_def

2279 mset_less_def ~> subset_mset_def

2280 less_eq_multiset.rep_eq ~> subseteq_mset_def

2281 INCOMPATIBILITY

2282 - Removed lemmas generated by lift_definition:

2283 less_eq_multiset.abs_eq, less_eq_multiset.rsp,

2284 less_eq_multiset.transfer, less_eq_multiset_def

2285 INCOMPATIBILITY

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

2289 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

2290 Bourbaki-Witt fixpoint theorem for increasing functions in

2291 chain-complete partial orders.

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

2294 Minor INCOMPATIBILITY, use 'function' instead.

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

2297 periodic functions.

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

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

2301 GCD.

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

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

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

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

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

2310 (exponentiation on real numbers) again.

2312 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

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

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

2315 Theorem of Algebra. Ported from HOL Light.

2317 * HOL-Multivariate_Analysis: topological concepts such as connected

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

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

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

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

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

2324 properties.

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

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

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

2330 structures.

2333 *** ML ***

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

2336 system are available:

2338 profile_time (*CPU time*)

2339 profile_time_thread (*CPU time on this thread*)

2340 profile_allocations (*overall heap allocations*)

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

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

2345 Isar proof method.

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

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

2349 breaks.

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

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

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

2355 * Simproc programming interfaces have been simplified:

2356 Simplifier.make_simproc and Simplifier.define_simproc supersede various

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

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

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

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

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

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

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

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

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

2370 Old cterm_instantiate is superseded by infer_instantiate.

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

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

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

2375 instead (with proper context).

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

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

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

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

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

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

2384 the proof context discipline.

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

2387 context_tactic, which allows to change the proof context dynamically

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

2389 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

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

2393 *** System ***

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

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

2398 conflations:

2400 hence ~> then have

2401 thus ~> then show

2403 This syntax is more orthogonal and improves readability and

2404 maintainability of proofs.

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

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

2408 performance.

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

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

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

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

2416 space.

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

2419 platforms as follows.

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

2422 associated with the main app bundle

2424 - isabelle jedit: settings

2425 JEDIT_JAVA_SYSTEM_OPTIONS

2426 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

2428 - isabelle build: settings

2429 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

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

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

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

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

2436 required after change.

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

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

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

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

2446 New in Isabelle2015 (May 2015)

2447 ------------------------------

2449 *** General ***

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

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

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

2455 context

2456 begin

2458 private definition ...

2459 private lemma ...

2461 qualified definition ...

2462 qualified lemma ...

2464 lemma ...

2465 theorem ...

2467 end

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

2470 naming policy.

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

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

2474 INCOMPATIBILITY, use 'sorry' instead.

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

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

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

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

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

2482 schematically expanded before search. Search results match the naive

2483 expectation more closely, particularly wrt. abbreviations.

2484 INCOMPATIBILITY.

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

2487 theory context.

2489 * Outer syntax commands are managed authentically within the theory

2490 context, without implicit global state. Potential for accidental

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

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

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

2495 update_semicolons" to remove obsolete semicolons from old theory

2496 sources.

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

2499 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

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

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

2503 method provides basic fact/term matching in addition to

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

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

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

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

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

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

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

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

2516 option jedit_structure_limit determines maximum number of lines to scan

2517 in the buffer.

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

2520 marker, SideKick parser.

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

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

2524 the editor (hyperlinks, completion etc.).

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

2527 Options / Text Area).

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

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

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

2533 restrict the visualized hierarchy.

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

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

2539 *** Document preparation ***

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

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

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

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

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

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

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

2548 update_header"). Minor INCOMPATIBILITY.

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

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

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

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

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

2556 style.

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

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

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

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

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

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

2565 tags. Potential INCOMPATIBILITY in exotic situations.

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

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

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

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

2571 dynamically in GUI front-ends. Implementations of document

2572 antiquotations need to observe the margin explicitly according to

2573 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

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

2576 mandatory for document preparation. The legacy mode with implicit

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

2578 INCOMPATIBILITY.

2581 *** Pure ***

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

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

2585 these variables become schematic in the instantiated theorem; this

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

2587 Configuration option rule_insts_schematic (default false) controls use

2588 of schematic variables outside the context. Minor INCOMPATIBILITY,

2589 declare rule_insts_schematic = true temporarily and update to use local

2590 variable declarations or dummy patterns instead.

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

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

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

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

2597 incremented to avoid material in the proof context. Rare

2598 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

2599 different index.

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

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

2603 of numeral signs, particularly in expressions involving infix syntax

2604 like "(- 1) ^ n".

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

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

2608 token category instead.

2611 *** HOL ***

2613 * New (co)datatype package:

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

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

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

2617 'isabelle doc datatypes' for information on porting.

2618 INCOMPATIBILITY.

2619 - Renamed theorems:

2620 disc_corec ~> corec_disc

2621 disc_corec_iff ~> corec_disc_iff

2622 disc_exclude ~> distinct_disc

2623 disc_exhaust ~> exhaust_disc

2624 disc_map_iff ~> map_disc_iff

2625 sel_corec ~> corec_sel

2626 sel_exhaust ~> exhaust_sel

2627 sel_map ~> map_sel

2628 sel_set ~> set_sel

2629 sel_split ~> split_sel

2630 sel_split_asm ~> split_sel_asm

2631 strong_coinduct ~> coinduct_strong

2632 weak_case_cong ~> case_cong_weak

2633 INCOMPATIBILITY.

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

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

2636 INCOMPATIBILITY.

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

2638 consequences of other set rules "by auto".

2639 INCOMPATIBILITY.

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

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

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

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

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

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

2646 INCOMPATIBILITY.

2647 - Renamed theories:

2648 BNF_Comp ~> BNF_Composition

2649 BNF_FP_Base ~> BNF_Fixpoint_Base

2650 BNF_GFP ~> BNF_Greatest_Fixpoint

2651 BNF_LFP ~> BNF_Least_Fixpoint

2652 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

2653 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

2654 INCOMPATIBILITY.

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

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

2657 Lifting_Product and Lifting_Option from Main became obsolete and

2658 were removed. Changed definitions of the relators rel_prod and

2659 rel_sum (using inductive).

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

2661 of rel_prod_def and rel_sum_def.

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

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

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

2665 constructors, case combinators, discriminators, selectors and

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

2667 rules.

2669 * Old datatype package:

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

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

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

2673 'isabelle doc datatypes' for information on porting.

2674 INCOMPATIBILITY.

2675 - Renamed theorems:

2676 weak_case_cong ~> case_cong_weak

2677 INCOMPATIBILITY.

2678 - Renamed theory:

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

2680 INCOMPATIBILITY.

2682 * Nitpick:

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

2684 operations.

2686 * Sledgehammer:

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

2688 default.

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

2690 source. The "z3_non_commercial" option is discontinued.

2691 - Minimization is now always enabled by default.

2692 Removed sub-command:

2693 min

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

2695 dramatically improved.

2696 - Improved support for CVC4 and veriT.

2698 * Old and new SMT modules:

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

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

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

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

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

2704 point to it.

2705 INCOMPATIBILITY.

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

2707 INCOMPATIBILITY.

2708 - New option 'smt_reconstruction_step_timeout' to limit the

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

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

2711 method, especially runtime statistics of Z3 proof reconstruction.

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

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

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

2716 lifting, and avoids tedious workarounds.

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

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

2720 Minor INCOMPATIBILITY.

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

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

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

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

2727 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

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

2730 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

2732 * Class linordered_semidom really requires no zero divisors.

2733 INCOMPATIBILITY.

2735 * Classes division_ring, field and linordered_field always demand

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

2737 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

2739 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

2740 additive inverse operation. INCOMPATIBILITY.

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

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

2744 INCOMPATIBILITY: type constraints may be necessary.

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

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

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

2749 needed.

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

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

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

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

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

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

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

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

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

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

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

2764 "nat_floor"/"nat_ceiling".

2766 * Qualified some duplicated fact names required for boostrapping the

2767 type class hierarchy:

2768 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

2769 field_inverse_zero ~> inverse_zero

2770 field_divide_inverse ~> divide_inverse

2771 field_inverse ~> left_inverse

2772 Minor INCOMPATIBILITY.

2774 * Eliminated fact duplicates:

2775 mult_less_imp_less_right ~> mult_right_less_imp_less

2776 mult_less_imp_less_left ~> mult_left_less_imp_less

2777 Minor INCOMPATIBILITY.

2779 * Fact consolidation: even_less_0_iff is subsumed by

2780 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

2782 * Generalized and consolidated some theorems concerning divsibility:

2783 dvd_reduce ~> dvd_add_triv_right_iff

2784 dvd_plus_eq_right ~> dvd_add_right_iff

2785 dvd_plus_eq_left ~> dvd_add_left_iff

2786 Minor INCOMPATIBILITY.

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

2789 and part of theory Main.

2790 even_def ~> even_iff_mod_2_eq_zero

2791 INCOMPATIBILITY.

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

2794 INCOMPATIBILITY.

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

2797 Fact rename:

2798 listsum_def ~> listsum.eq_foldr

2799 INCOMPATIBILITY.

2801 * Product over lists via constant "listprod".

2803 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

2804 Cons_nth_drop_Suc.

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

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

2808 HOL/Codegenerator_Test/Code_Test* for examples.

2810 * Library/Multiset:

2811 - Introduced "replicate_mset" operation.

2812 - Introduced alternative characterizations of the multiset ordering in

2813 "Library/Multiset_Order".

2814 - Renamed multiset ordering:

2815 <# ~> #<#

2816 <=# ~> #<=#

2817 \<subset># ~> #\<subset>#

2818 \<subseteq># ~> #\<subseteq>#

2819 INCOMPATIBILITY.

2820 - Introduced abbreviations for ill-named multiset operations:

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

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

2823 INCOMPATIBILITY.

2824 - Renamed

2825 in_multiset_of ~> in_multiset_in_set

2826 Multiset.fold ~> fold_mset

2827 Multiset.filter ~> filter_mset

2828 INCOMPATIBILITY.

2829 - Removed mcard, is equal to size.

2830 - Added attributes:

2831 image_mset.id [simp]

2832 image_mset_id [simp]

2833 elem_multiset_of_set [simp, intro]

2834 comp_fun_commute_plus_mset [simp]

2835 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

2836 in_mset_fold_plus_iff [iff]

2837 set_of_Union_mset [simp]

2838 in_Union_mset_iff [iff]

2839 INCOMPATIBILITY.

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

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

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

2844 argument. Minor INCOMPATIBILITY.

2846 * HOL-Decision_Procs: New counterexample generator quickcheck

2847 [approximation] for inequalities of transcendental functions. Uses

2848 hardware floating point arithmetic to randomly discover potential

2849 counterexamples. Counterexamples are certified with the "approximation"

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

2851 examples.

2853 * HOL-Probability: Reworked measurability prover

2854 - applies destructor rules repeatedly

2855 - removed application splitting (replaced by destructor rule)

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

2857 projection

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

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

2863 *** ML ***

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

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

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

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

2869 contemporary applications use the strict Name_Space.check (and

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

2871 INCOMPATIBILITY in rare applications of Name_Space.intern.

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

2874 ERROR instead of internal Toplevel.UNDEF.

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

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

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

2880 INCOMPATIBILITY.

2882 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

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

2884 Multithreading.synchronized and its high-level derivative

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

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

2887 nested.

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

2890 change of semantics with minimal potential for INCOMPATIBILITY.

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

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

2894 available as Thm.global_ctyp_of and Thm.global_cterm_of.

2895 INCOMPATIBILITY.

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

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

2899 Thm.term_of etc.

2901 * Proper context for various elementary tactics: assume_tac,

2902 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

2903 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

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

2906 PARALLEL_GOALS.

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

2909 which also allows to specify a fork priority.

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

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

2913 markup). Minor INCOMPATIBILITY.

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

2916 Input.source (with formal position information).

2919 *** System ***

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

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

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

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

2927 be externally triggered using an appropriate ROOT file plus a

2928 corresponding theory. Parametrization is possible using environment

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

2930 INCOMPATIBILITY.

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

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

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

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

2937 menu Global Options / Appearance.

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

2940 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

2944 New in Isabelle2014 (August 2014)

2945 ---------------------------------

2947 *** General ***

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

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

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

2952 environment is restricted to the Standard ML implementation of

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

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

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

2956 some examples.

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

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

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

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

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

2963 restore the previous behavior. INCOMPATIBILITY, especially where

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

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

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

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

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

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

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

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

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

2974 exception. Potential INCOMPATIBILITY for non-conformant tactical

2975 proof tools.

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

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

2979 supports input via ` (backquote).

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

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

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

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

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

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

2988 Minor INCOMPATIBILITY.

2990 * Discontinued legacy_isub_isup, which was a temporary workaround for

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

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

2993 INCOMPATIBILITY.

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

2996 which results in an active hyperlink within the text.

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

2999 not check existence within the file-system.

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

3002 isar-ref, jedit, system.

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

3007 * Improved Document panel: simplified interaction where every single

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

3009 buffer.

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

3012 to PIDE hyperlinks.

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

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

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

3018 auxiliary ML files.

3020 * Improved syntactic and semantic completion mechanism, with simple

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

3022 file-name completion, spell-checker completion.

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

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

3026 keystrokes with slow / remote graphics displays.

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

3029 item, depending on Isabelle options.

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

3032 selections, rectangular selections, rectangular selection as "tall

3033 caret".

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

3036 completion popup and context-menu.

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

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

3040 operations for the context. Minor incompatibility in keyboard

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

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

3044 to highlight text via regular expression.

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

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

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

3049 "isabelle jedit -m MODE".

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

3052 networking operations instead of jEdit virtual file-systems.

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

3055 imports) are automatically removed from the document model.

3057 * Improved monitor panel.

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

3060 more robust treatment of threads and interrupts.

3062 * Improved management of dockable windows: clarified keyboard focus

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

3064 "Detach" a copy where this makes sense.

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

3067 simplification process, enabled by the "simp_trace_new" attribute

3068 within the context.

3071 *** Pure ***

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

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

3075 that is not immediately visible. INCOMPATIBILITY, use regular

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

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

3078 finished trivially if the underlying class definition is made vacuous

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

3080 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

3081 Axclass.arity_axiomatization.

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

3084 qualified. Rare INCOMPATIBILITY, but with potentially serious

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

3086 renaming needs to be applied:

3088 == ~> Pure.eq

3089 ==> ~> Pure.imp

3090 all ~> Pure.all

3091 TYPE ~> Pure.type

3092 dummy_pattern ~> Pure.dummy_pattern

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

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

3096 old constants:

3098 setup {*

3099 fn thy => thy

3100 |> Sign.root_path

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

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

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

3104 |> Sign.restore_naming thy

3105 *}

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

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

3109 the auxiliary aliases are deleted.

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

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

3113 instantiated theorem.

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

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

3117 where instantiations with schematic variables are intended (for

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

3119 following temporary definition may help to port old applications:

3121 attribute_setup standard =

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

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

3125 attributed fact expressions (concerning background theory, declared

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

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

3128 primitive Thm.assume_hyps.

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

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

3132 differently, e.g. via cartouches).

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

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

3137 * Code generator preprocessor: explicit control of simp tracing on a

3138 per-constant basis. See attribute "code_preproc".

3141 *** HOL ***

3143 * Code generator: enforce case of identifiers only for strict target

3144 language requirements. INCOMPATIBILITY.

3146 * Code generator: explicit proof contexts in many ML interfaces.

3147 INCOMPATIBILITY.

3149 * Code generator: minimize exported identifiers by default. Minor

3150 INCOMPATIBILITY.

3152 * Code generation for SML and OCaml: dropped arcane "no_signatures"

3153 option. Minor INCOMPATIBILITY.

3155 * "declare [[code abort: ...]]" replaces "code_abort ...".

3156 INCOMPATIBILITY.

3158 * "declare [[code drop: ...]]" drops all code equations associated

3159 with the given constants.

3161 * Code generations are provided for make, fields, extend and truncate

3162 operations on records.

3164 * Command and antiquotation "value" are now hardcoded against nbe and

3165 ML. Minor INCOMPATIBILITY.

3167 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.

3169 * The symbol "\<newline>" may be used within char or string literals

3170 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.

3172 * Qualified String.implode and String.explode. INCOMPATIBILITY.

3174 * Simplifier: Enhanced solver of preconditions of rewrite rules can

3175 now deal with conjunctions. For help with converting proofs, the old

3176 behaviour of the simplifier can be restored like this: declare/using

3177 [[simp_legacy_precond]]. This configuration option will disappear

3178 again in the future. INCOMPATIBILITY.

3180 * Simproc "finite_Collect" is no longer enabled by default, due to

3181 spurious crashes and other surprises. Potential INCOMPATIBILITY.

3183 * Moved new (co)datatype package and its dependencies from session

3184 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',

3185 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now

3186 part of theory "Main".

3188 Theory renamings:

3189 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)

3190 Library/Wfrec.thy ~> Wfrec.thy

3191 Library/Zorn.thy ~> Zorn.thy

3192 Cardinals/Order_Relation.thy ~> Order_Relation.thy

3193 Library/Order_Union.thy ~> Cardinals/Order_Union.thy

3194 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

3195 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

3196 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

3197 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

3198 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

3199 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

3200 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

3201 BNF/BNF_Comp.thy ~> BNF_Comp.thy

3202 BNF/BNF_Def.thy ~> BNF_Def.thy

3203 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

3204 BNF/BNF_GFP.thy ~> BNF_GFP.thy

3205 BNF/BNF_LFP.thy ~> BNF_LFP.thy

3206 BNF/BNF_Util.thy ~> BNF_Util.thy

3207 BNF/Coinduction.thy ~> Coinduction.thy

3208 BNF/More_BNFs.thy ~> Library/More_BNFs.thy

3209 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy

3210 BNF/Examples/* ~> BNF_Examples/*

3212 New theories:

3213 Wellorder_Extension.thy (split from Zorn.thy)

3214 Library/Cardinal_Notations.thy

3215 Library/BNF_Axomatization.thy

3216 BNF_Examples/Misc_Primcorec.thy

3217 BNF_Examples/Stream_Processor.thy

3219 Discontinued theories:

3220 BNF/BNF.thy

3221 BNF/Equiv_Relations_More.thy

3223 INCOMPATIBILITY.

3225 * New (co)datatype package:

3226 - Command 'primcorec' is fully implemented.

3227 - Command 'datatype_new' generates size functions ("size_xxx" and

3228 "size") as required by 'fun'.

3229 - BNFs are integrated with the Lifting tool and new-style

3230 (co)datatypes with Transfer.

3231 - Renamed commands:

3232 datatype_new_compat ~> datatype_compat

3233 primrec_new ~> primrec

3234 wrap_free_constructors ~> free_constructors

3235 INCOMPATIBILITY.

3236 - The generated constants "xxx_case" and "xxx_rec" have been renamed

3237 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").

3238 INCOMPATIBILITY.

3239 - The constant "xxx_(un)fold" and related theorems are no longer

3240 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually

3241 using "prim(co)rec".

3242 INCOMPATIBILITY.

3243 - No discriminators are generated for nullary constructors by

3244 default, eliminating the need for the odd "=:" syntax.

3245 INCOMPATIBILITY.

3246 - No discriminators or selectors are generated by default by

3247 "datatype_new", unless custom names are specified or the new

3248 "discs_sels" option is passed.

3249 INCOMPATIBILITY.

3251 * Old datatype package:

3252 - The generated theorems "xxx.cases" and "xxx.recs" have been

3253 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->

3254 "sum.case"). INCOMPATIBILITY.

3255 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have

3256 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,

3257 "prod_case" ~> "case_prod"). INCOMPATIBILITY.

3259 * The types "'a list" and "'a option", their set and map functions,

3260 their relators, and their selectors are now produced using the new

3261 BNF-based datatype package.

3263 Renamed constants:

3264 Option.set ~> set_option

3265 Option.map ~> map_option

3266 option_rel ~> rel_option

3268 Renamed theorems:

3269 set_def ~> set_rec[abs_def]

3270 map_def ~> map_rec[abs_def]

3271 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")

3272 option.recs ~> option.rec

3273 list_all2_def ~> list_all2_iff

3274 set.simps ~> set_simps (or the slightly different "list.set")

3275 map.simps ~> list.map

3276 hd.simps ~> list.sel(1)

3277 tl.simps ~> list.sel(2-3)

3278 the.simps ~> option.sel

3280 INCOMPATIBILITY.

3282 * The following map functions and relators have been renamed:

3283 sum_map ~> map_sum

3284 map_pair ~> map_prod

3285 prod_rel ~> rel_prod

3286 sum_rel ~> rel_sum

3287 fun_rel ~> rel_fun

3288 set_rel ~> rel_set

3289 filter_rel ~> rel_filter

3290 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")

3291 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")

3292 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")

3294 INCOMPATIBILITY.

3296 * Lifting and Transfer:

3297 - a type variable as a raw type is supported

3298 - stronger reflexivity prover

3299 - rep_eq is always generated by lift_definition

3300 - setup for Lifting/Transfer is now automated for BNFs

3301 + holds for BNFs that do not contain a dead variable

3302 + relator_eq, relator_mono, relator_distr, relator_domain,

3303 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,

3304 right_unique, right_total, left_unique, left_total are proved

3305 automatically

3306 + definition of a predicator is generated automatically

3307 + simplification rules for a predicator definition are proved

3308 automatically for datatypes

3309 - consolidation of the setup of Lifting/Transfer

3310 + property that a relator preservers reflexivity is not needed any

3311 more

3312 Minor INCOMPATIBILITY.

3313 + left_total and left_unique rules are now transfer rules

3314 (reflexivity_rule attribute not needed anymore)

3315 INCOMPATIBILITY.

3316 + Domainp does not have to be a separate assumption in

3317 relator_domain theorems (=> more natural statement)

3318 INCOMPATIBILITY.

3319 - registration of code equations is more robust

3320 Potential INCOMPATIBILITY.

3321 - respectfulness proof obligation is preprocessed to a more readable

3322 form

3323 Potential INCOMPATIBILITY.

3324 - eq_onp is always unfolded in respectfulness proof obligation

3325 Potential INCOMPATIBILITY.

3326 - unregister lifting setup for Code_Numeral.integer and

3327 Code_Numeral.natural

3328 Potential INCOMPATIBILITY.

3329 - Lifting.invariant -> eq_onp

3330 INCOMPATIBILITY.

3332 * New internal SAT solver "cdclite" that produces models and proof

3333 traces. This solver replaces the internal SAT solvers "enumerate" and

3334 "dpll". Applications that explicitly used one of these two SAT

3335 solvers should use "cdclite" instead. In addition, "cdclite" is now

3336 the default SAT solver for the "sat" and "satx" proof methods and

3337 corresponding tactics; the old default can be restored using "declare

3338 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.

3340 * SMT module: A new version of the SMT module, temporarily called

3341 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,

3342 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also

3343 supported as oracles. Yices is no longer supported, because no version

3344 of the solver can handle both SMT-LIB 2 and quantifiers.

3346 * Activation of Z3 now works via "z3_non_commercial" system option

3347 (without requiring restart), instead of former settings variable

3348 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu

3349 Plugin Options / Isabelle / General.

3351 * Sledgehammer:

3352 - Z3 can now produce Isar proofs.

3353 - MaSh overhaul:

3354 . New SML-based learning algorithms eliminate the dependency on

3355 Python and increase performance and reliability.

3356 . MaSh and MeSh are now used by default together with the

3357 traditional MePo (Meng-Paulson) relevance filter. To disable

3358 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin

3359 Options / Isabelle / General to "none".

3360 - New option:

3361 smt_proofs

3362 - Renamed options:

3363 isar_compress ~> compress

3364 isar_try0 ~> try0

3366 INCOMPATIBILITY.

3368 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.

3370 * Nitpick:

3371 - Fixed soundness bug whereby mutually recursive datatypes could

3372 take infinite values.

3373 - Fixed soundness bug with low-level number functions such as

3374 "Abs_Integ" and "Rep_Integ".

3375 - Removed "std" option.

3376 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to

3377 "hide_types".

3379 * Metis: Removed legacy proof method 'metisFT'. Use 'metis

3380 (full_types)' instead. INCOMPATIBILITY.

3382 * Try0: Added 'algebra' and 'meson' to the set of proof methods.

3384 * Adjustion of INF and SUP operations:

3385 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.

3386 - Consolidated theorem names containing INFI and SUPR: have INF and

3387 SUP instead uniformly.

3388 - More aggressive normalization of expressions involving INF and Inf

3389 or SUP and Sup.

3390 - INF_image and SUP_image do not unfold composition.

3391 - Dropped facts INF_comp, SUP_comp.

3392 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

3393 simplifier implication in premises. Generalize and replace former

3394 INT_cong, SUP_cong

3396 INCOMPATIBILITY.

3398 * SUP and INF generalized to conditionally_complete_lattice.

3400 * Swapped orientation of facts image_comp and vimage_comp:

3402 image_compose ~> image_comp [symmetric]

3403 image_comp ~> image_comp [symmetric]

3404 vimage_compose ~> vimage_comp [symmetric]

3405 vimage_comp ~> vimage_comp [symmetric]

3407 INCOMPATIBILITY.

3409 * Theory reorganization: split of Big_Operators.thy into

3410 Groups_Big.thy and Lattices_Big.thy.

3412 * Consolidated some facts about big group operators:

3414 setsum_0' ~> setsum.neutral

3415 setsum_0 ~> setsum.neutral_const

3416 setsum_addf ~> setsum.distrib

3417 setsum_cartesian_product ~> setsum.cartesian_product

3418 setsum_cases ~> setsum.If_cases

3419 setsum_commute ~> setsum.commute

3420 setsum_cong ~> setsum.cong

3421 setsum_delta ~> setsum.delta

3422 setsum_delta' ~> setsum.delta'

3423 setsum_diff1' ~> setsum.remove

3424 setsum_empty ~> setsum.empty

3425 setsum_infinite ~> setsum.infinite

3426 setsum_insert ~> setsum.insert

3427 setsum_inter_restrict'' ~> setsum.inter_filter

3428 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

3429 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

3430 setsum_mono_zero_left ~> setsum.mono_neutral_left

3431 setsum_mono_zero_right ~> setsum.mono_neutral_right

3432 setsum_reindex ~> setsum.reindex

3433 setsum_reindex_cong ~> setsum.reindex_cong

3434 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

3435 setsum_restrict_set ~> setsum.inter_restrict

3436 setsum_Plus ~> setsum.Plus

3437 setsum_setsum_restrict ~> setsum.commute_restrict

3438 setsum_Sigma ~> setsum.Sigma

3439 setsum_subset_diff ~> setsum.subset_diff

3440 setsum_Un_disjoint ~> setsum.union_disjoint

3441 setsum_UN_disjoint ~> setsum.UNION_disjoint

3442 setsum_Un_Int ~> setsum.union_inter

3443 setsum_Union_disjoint ~> setsum.Union_disjoint

3444 setsum_UNION_zero ~> setsum.Union_comp

3445 setsum_Un_zero ~> setsum.union_inter_neutral

3446 strong_setprod_cong ~> setprod.strong_cong

3447 strong_setsum_cong ~> setsum.strong_cong

3448 setprod_1' ~> setprod.neutral

3449 setprod_1 ~> setprod.neutral_const

3450 setprod_cartesian_product ~> setprod.cartesian_product

3451 setprod_cong ~> setprod.cong

3452 setprod_delta ~> setprod.delta

3453 setprod_delta' ~> setprod.delta'

3454 setprod_empty ~> setprod.empty

3455 setprod_infinite ~> setprod.infinite

3456 setprod_insert ~> setprod.insert

3457 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

3458 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

3459 setprod_mono_one_left ~> setprod.mono_neutral_left

3460 setprod_mono_one_right ~> setprod.mono_neutral_right

3461 setprod_reindex ~> setprod.reindex

3462 setprod_reindex_cong ~> setprod.reindex_cong

3463 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

3464 setprod_Sigma ~> setprod.Sigma

3465 setprod_subset_diff ~> setprod.subset_diff

3466 setprod_timesf ~> setprod.distrib

3467 setprod_Un2 ~> setprod.union_diff2

3468 setprod_Un_disjoint ~> setprod.union_disjoint

3469 setprod_UN_disjoint ~> setprod.UNION_disjoint

3470 setprod_Un_Int ~> setprod.union_inter

3471 setprod_Union_disjoint ~> setprod.Union_disjoint

3472 setprod_Un_one ~> setprod.union_inter_neutral

3474 Dropped setsum_cong2 (simple variant of setsum.cong).

3475 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)

3476 Dropped setsum_reindex_id, setprod_reindex_id

3477 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).

3479 INCOMPATIBILITY.

3481 * Abolished slightly odd global lattice interpretation for min/max.

3483 Fact consolidations:

3484 min_max.inf_assoc ~> min.assoc

3485 min_max.inf_commute ~> min.commute

3486 min_max.inf_left_commute ~> min.left_commute

3487 min_max.inf_idem ~> min.idem

3488 min_max.inf_left_idem ~> min.left_idem

3489 min_max.inf_right_idem ~> min.right_idem

3490 min_max.sup_assoc ~> max.assoc

3491 min_max.sup_commute ~> max.commute

3492 min_max.sup_left_commute ~> max.left_commute

3493 min_max.sup_idem ~> max.idem

3494 min_max.sup_left_idem ~> max.left_idem

3495 min_max.sup_inf_distrib1 ~> max_min_distrib2

3496 min_max.sup_inf_distrib2 ~> max_min_distrib1

3497 min_max.inf_sup_distrib1 ~> min_max_distrib2

3498 min_max.inf_sup_distrib2 ~> min_max_distrib1

3499 min_max.distrib ~> min_max_distribs

3500 min_max.inf_absorb1 ~> min.absorb1

3501 min_max.inf_absorb2 ~> min.absorb2

3502 min_max.sup_absorb1 ~> max.absorb1

3503 min_max.sup_absorb2 ~> max.absorb2

3504 min_max.le_iff_inf ~> min.absorb_iff1

3505 min_max.le_iff_sup ~> max.absorb_iff2

3506 min_max.inf_le1 ~> min.cobounded1

3507 min_max.inf_le2 ~> min.cobounded2

3508 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

3509 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

3510 min_max.le_infI1 ~> min.coboundedI1

3511 min_max.le_infI2 ~> min.coboundedI2

3512 min_max.le_supI1 ~> max.coboundedI1

3513 min_max.le_supI2 ~> max.coboundedI2

3514 min_max.less_infI1 ~> min.strict_coboundedI1

3515 min_max.less_infI2 ~> min.strict_coboundedI2

3516 min_max.less_supI1 ~> max.strict_coboundedI1

3517 min_max.less_supI2 ~> max.strict_coboundedI2

3518 min_max.inf_mono ~> min.mono

3519 min_max.sup_mono ~> max.mono

3520 min_max.le_infI, min_max.inf_greatest ~> min.boundedI

3521 min_max.le_supI, min_max.sup_least ~> max.boundedI

3522 min_max.le_inf_iff ~> min.bounded_iff

3523 min_max.le_sup_iff ~> max.bounded_iff

3525 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,

3526 min.left_commute, min.left_idem, max.commute, max.assoc,

3527 max.left_commute, max.left_idem directly.

3529 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,

3530 min.cobounded2, max.cobounded1m max.cobounded2 directly.

3532 For min_ac or max_ac, prefer more general collection ac_simps.

3534 INCOMPATIBILITY.

3536 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>

3537 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

3539 * Qualified constant names Wellfounded.acc, Wellfounded.accp.

3540 INCOMPATIBILITY.

3542 * Fact generalization and consolidation:

3543 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

3545 INCOMPATIBILITY.

3547 * Purely algebraic definition of even. Fact generalization and

3548 consolidation:

3549 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

3550 even_zero_(nat|int) ~> even_zero

3552 INCOMPATIBILITY.

3554 * Abolished neg_numeral.

3555 - Canonical representation for minus one is "- 1".

3556 - Canonical representation for other negative numbers is "- (numeral _)".

3557 - When devising rule sets for number calculation, consider the

3558 following canonical cases: 0, 1, numeral _, - 1, - numeral _.

3559 - HOLogic.dest_number also recognizes numerals in non-canonical forms

3560 like "numeral One", "- numeral One", "- 0" and even "- ... - _".

3561 - Syntax for negative numerals is mere input syntax.

3563 INCOMPATIBILITY.

3565 * Reduced name variants for rules on associativity and commutativity:

3567 add_assoc ~> add.assoc

3568 add_commute ~> add.commute

3569 add_left_commute ~> add.left_commute

3570 mult_assoc ~> mult.assoc

3571 mult_commute ~> mult.commute

3572 mult_left_commute ~> mult.left_commute

3573 nat_add_assoc ~> add.assoc

3574 nat_add_commute ~> add.commute

3575 nat_add_left_commute ~> add.left_commute

3576 nat_mult_assoc ~> mult.assoc

3577 nat_mult_commute ~> mult.commute

3578 eq_assoc ~> iff_assoc

3579 eq_left_commute ~> iff_left_commute

3581 INCOMPATIBILITY.

3583 * Fact collections add_ac and mult_ac are considered old-fashioned.

3584 Prefer ac_simps instead, or specify rules

3585 (add|mult).(assoc|commute|left_commute) individually.

3587 * Elimination of fact duplicates:

3588 equals_zero_I ~> minus_unique

3589 diff_eq_0_iff_eq ~> right_minus_eq

3590 nat_infinite ~> infinite_UNIV_nat

3591 int_infinite ~> infinite_UNIV_int

3593 INCOMPATIBILITY.

3595 * Fact name consolidation:

3596 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

3597 minus_le_self_iff ~> neg_less_eq_nonneg

3598 le_minus_self_iff ~> less_eq_neg_nonpos

3599 neg_less_nonneg ~> neg_less_pos

3600 less_minus_self_iff ~> less_neg_neg [simp]

3602 INCOMPATIBILITY.

3604 * More simplification rules on unary and binary minus:

3605 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

3606 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

3607 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

3608 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

3609 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

3610 been taken away from fact collections algebra_simps and field_simps.

3611 INCOMPATIBILITY.

3613 To restore proofs, the following patterns are helpful:

3615 a) Arbitrary failing proof not involving "diff_def":

3616 Consider simplification with algebra_simps or field_simps.

3618 b) Lifting rules from addition to subtraction:

3619 Try with "using <rule for addition> of [... "- _" ...]" by simp".

3621 c) Simplification with "diff_def": just drop "diff_def".

3622 Consider simplification with algebra_simps or field_simps;

3623 or the brute way with

3624 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

3626 * Introduce bdd_above and bdd_below in theory

3627 Conditionally_Complete_Lattices, use them instead of explicitly

3628 stating boundedness of sets.

3630 * ccpo.admissible quantifies only over non-empty chains to allow more

3631 syntax-directed proof rules; the case of the empty chain shows up as

3632 additional case in fixpoint induction proofs. INCOMPATIBILITY.

3634 * Removed and renamed theorems in Series:

3635 summable_le ~> suminf_le

3636 suminf_le ~> suminf_le_const

3637 series_pos_le ~> setsum_le_suminf

3638 series_pos_less ~> setsum_less_suminf

3639 suminf_ge_zero ~> suminf_nonneg

3640 suminf_gt_zero ~> suminf_pos

3641 suminf_gt_zero_iff ~> suminf_pos_iff

3642 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

3643 suminf_0_le ~> suminf_nonneg [rotate]

3644 pos_summable ~> summableI_nonneg_bounded

3645 ratio_test ~> summable_ratio_test

3647 removed series_zero, replaced by sums_finite

3649 removed auxiliary lemmas:

3651 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

3652 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

3653 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

3654 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

3655 summable_convergent_sumr_iff, sumr_diff_mult_const

3657 INCOMPATIBILITY.

3659 * Replace (F)DERIV syntax by has_derivative:

3660 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"

3662 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

3664 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

3666 - removed constant isDiff

3668 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

3669 input syntax.

3671 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

3673 - Renamed FDERIV_... lemmas to has_derivative_...

3675 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

3677 - removed DERIV_intros, has_derivative_eq_intros

3679 - introduced derivative_intros and deriative_eq_intros which

3680 includes now rules for DERIV, has_derivative and

3681 has_vector_derivative.

3683 - Other renamings:

3684 differentiable_def ~> real_differentiable_def

3685 differentiableE ~> real_differentiableE

3686 fderiv_def ~> has_derivative_at

3687 field_fderiv_def ~> field_has_derivative_at

3688 isDiff_der ~> differentiable_def

3689 deriv_fderiv ~> has_field_derivative_def

3690 deriv_def ~> DERIV_def

3692 INCOMPATIBILITY.

3694 * Include more theorems in continuous_intros. Remove the

3695 continuous_on_intros, isCont_intros collections, these facts are now

3696 in continuous_intros.

3698 * Theorems about complex numbers are now stated only using Re and Im,

3699 the Complex constructor is not used anymore. It is possible to use

3700 primcorec to defined the behaviour of a complex-valued function.

3702 Removed theorems about the Complex constructor from the simpset, they

3703 are available as the lemma collection legacy_Complex_simps. This

3704 especially removes

3706 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

3708 Instead the reverse direction is supported with

3709 Complex_eq: "Complex a b = a + \<i> * b"

3711 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

3713 Renamings:

3714 Re/Im ~> complex.sel

3715 complex_Re/Im_zero ~> zero_complex.sel

3716 complex_Re/Im_add ~> plus_complex.sel

3717 complex_Re/Im_minus ~> uminus_complex.sel

3718 complex_Re/Im_diff ~> minus_complex.sel

3719 complex_Re/Im_one ~> one_complex.sel

3720 complex_Re/Im_mult ~> times_complex.sel

3721 complex_Re/Im_inverse ~> inverse_complex.sel

3722 complex_Re/Im_scaleR ~> scaleR_complex.sel

3723 complex_Re/Im_i ~> ii.sel

3724 complex_Re/Im_cnj ~> cnj.sel

3725 Re/Im_cis ~> cis.sel

3727 complex_divide_def ~> divide_complex_def

3728 complex_norm_def ~> norm_complex_def

3729 cmod_def ~> norm_complex_de

3731 Removed theorems:

3732 complex_zero_def

3733 complex_add_def

3734 complex_minus_def

3735 complex_diff_def

3736 complex_one_def

3737 complex_mult_def

3738 complex_inverse_def

3739 complex_scaleR_def

3741 INCOMPATIBILITY.

3743 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

3744 Conditionally_Complete_Lattices. INCOMPATIBILITY.

3746 * HOL-Library: new theory src/HOL/Library/Tree.thy.

3748 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

3749 is subsumed by session Kleene_Algebra in AFP.

3751 * HOL-Library / theory RBT: various constants and facts are hidden;

3752 lifting setup is unregistered. INCOMPATIBILITY.

3754 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

3756 * HOL-Word: bit representations prefer type bool over type bit.

3757 INCOMPATIBILITY.

3759 * HOL-Word:

3760 - Abandoned fact collection "word_arith_alts", which is a duplicate

3761 of "word_arith_wis".

3762 - Dropped first (duplicated) element in fact collections

3763 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

3764 "uint_word_arith_bintrs".

3766 * HOL-Number_Theory:

3767 - consolidated the proofs of the binomial theorem

3768 - the function fib is again of type nat => nat and not overloaded

3769 - no more references to Old_Number_Theory in the HOL libraries

3770 (except the AFP)

3772 INCOMPATIBILITY.

3774 * HOL-Multivariate_Analysis:

3775 - Type class ordered_real_vector for ordered vector spaces.

3776 - New theory Complex_Basic_Analysis defining complex derivatives,

3777 holomorphic functions, etc., ported from HOL Light's canal.ml.

3778 - Changed order of ordered_euclidean_space to be compatible with

3779 pointwise ordering on products. Therefore instance of

3780 conditionally_complete_lattice and ordered_real_vector.

3781 INCOMPATIBILITY: use box instead of greaterThanLessThan or

3782 explicit set-comprehensions with eucl_less for other (half-)open

3783 intervals.

3784 - removed dependencies on type class ordered_euclidean_space with

3785 introduction of "cbox" on euclidean_space

3786 - renamed theorems:

3787 interval ~> box

3788 mem_interval ~> mem_box

3789 interval_eq_empty ~> box_eq_empty

3790 interval_ne_empty ~> box_ne_empty

3791 interval_sing(1) ~> cbox_sing

3792 interval_sing(2) ~> box_sing

3793 subset_interval_imp ~> subset_box_imp

3794 subset_interval ~> subset_box

3795 open_interval ~> open_box

3796 closed_interval ~> closed_cbox

3797 interior_closed_interval ~> interior_cbox

3798 bounded_closed_interval ~> bounded_cbox

3799 compact_interval ~> compact_cbox

3800 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

3801 bounded_subset_closed_interval ~> bounded_subset_cbox

3802 mem_interval_componentwiseI ~> mem_box_componentwiseI

3803 convex_box ~> convex_prod

3804 rel_interior_real_interval ~> rel_interior_real_box

3805 convex_interval ~> convex_box

3806 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

3807 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

3808 content_closed_interval' ~> content_cbox'

3809 elementary_subset_interval ~> elementary_subset_box

3810 diameter_closed_interval ~> diameter_cbox

3811 frontier_closed_interval ~> frontier_cbox

3812 frontier_open_interval ~> frontier_box

3813 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

3814 closure_open_interval ~> closure_box

3815 open_closed_interval_convex ~> open_cbox_convex

3816 open_interval_midpoint ~> box_midpoint

3817 content_image_affinity_interval ~> content_image_affinity_cbox

3818 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

3819 bounded_interval ~> bounded_closed_interval + bounded_boxes

3821 - respective theorems for intervals over the reals:

3822 content_closed_interval + content_cbox

3823 has_integral + has_integral_real

3824 fine_division_exists + fine_division_exists_real

3825 has_integral_null + has_integral_null_real

3826 tagged_division_union_interval + tagged_division_union_interval_real

3827 has_integral_const + has_integral_const_real

3828 integral_const + integral_const_real

3829 has_integral_bound + has_integral_bound_real

3830 integrable_continuous + integrable_continuous_real

3831 integrable_subinterval + integrable_subinterval_real

3832 has_integral_reflect_lemma + has_integral_reflect_lemma_real

3833 integrable_reflect + integrable_reflect_real

3834 integral_reflect + integral_reflect_real

3835 image_affinity_interval + image_affinity_cbox

3836 image_smult_interval + image_smult_cbox

3837 integrable_const + integrable_const_ivl

3838 integrable_on_subinterval + integrable_on_subcbox

3840 - renamed theorems:

3841 derivative_linear ~> has_derivative_bounded_linear

3842 derivative_is_linear ~> has_derivative_linear

3843 bounded_linear_imp_linear ~> bounded_linear.linear

3845 * HOL-Probability:

3846 - Renamed positive_integral to nn_integral:

3848 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

3849 positive_integral_positive ~> nn_integral_nonneg

3851 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

3853 - replaced the Lebesgue integral on real numbers by the more general

3854 Bochner integral for functions into a real-normed vector space.

3856 integral_zero ~> integral_zero / integrable_zero

3857 integral_minus ~> integral_minus / integrable_minus

3858 integral_add ~> integral_add / integrable_add

3859 integral_diff ~> integral_diff / integrable_diff

3860 integral_setsum ~> integral_setsum / integrable_setsum

3861 integral_multc ~> integral_mult_left / integrable_mult_left

3862 integral_cmult ~> integral_mult_right / integrable_mult_right

3863 integral_triangle_inequality~> integral_norm_bound

3864 integrable_nonneg ~> integrableI_nonneg

3865 integral_positive ~> integral_nonneg_AE

3866 integrable_abs_iff ~> integrable_abs_cancel

3867 positive_integral_lim_INF ~> nn_integral_liminf

3868 lebesgue_real_affine ~> lborel_real_affine

3869 borel_integral_has_integral ~> has_integral_lebesgue_integral

3870 integral_indicator ~>

3871 integral_real_indicator / integrable_real_indicator

3872 positive_integral_fst ~> nn_integral_fst'

3873 positive_integral_fst_measurable ~> nn_integral_fst

3874 positive_integral_snd_measurable ~> nn_integral_snd

3876 integrable_fst_measurable ~>

3877 integral_fst / integrable_fst / AE_integrable_fst

3879 integrable_snd_measurable ~>

3880 integral_snd / integrable_snd / AE_integrable_snd

3882 integral_monotone_convergence ~>

3883 integral_monotone_convergence / integrable_monotone_convergence

3885 integral_monotone_convergence_at_top ~>

3886 integral_monotone_convergence_at_top /

3887 integrable_monotone_convergence_at_top

3889 has_integral_iff_positive_integral_lebesgue ~>

3890 has_integral_iff_has_bochner_integral_lebesgue_nonneg

3892 lebesgue_integral_has_integral ~>

3893 has_integral_integrable_lebesgue_nonneg

3895 positive_integral_lebesgue_has_integral ~>

3896 integral_has_integral_lebesgue_nonneg /

3897 integrable_has_integral_lebesgue_nonneg

3899 lebesgue_integral_real_affine ~>

3900 nn_integral_real_affine

3902 has_integral_iff_positive_integral_lborel ~>

3903 integral_has_integral_nonneg / integrable_has_integral_nonneg

3905 The following theorems where removed:

3907 lebesgue_integral_nonneg

3908 lebesgue_integral_uminus

3909 lebesgue_integral_cmult

3910 lebesgue_integral_multc

3911 lebesgue_integral_cmult_nonneg

3912 integral_cmul_indicator

3913 integral_real

3915 - Formalized properties about exponentially, Erlang, and normal

3916 distributed random variables.

3918 * HOL-Decision_Procs: Separate command 'approximate' for approximative

3919 computation in src/HOL/Decision_Procs/Approximation. Minor

3920 INCOMPATIBILITY.

3923 *** Scala ***

3925 * The signature and semantics of Document.Snapshot.cumulate_markup /

3926 select_markup have been clarified. Markup is now traversed in the

3927 order of reports given by the prover: later markup is usually more

3928 specific and may override results accumulated so far. The elements

3929 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

3931 * Substantial reworking of internal PIDE protocol communication

3932 channels. INCOMPATIBILITY.

3935 *** ML ***

3937 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

3938 compared (according to Thm.thm_ord), but assumed to be covered by the

3939 current background theory. Thus equivalent data produced in different

3940 branches of the theory graph usually coincides (e.g. relevant for

3941 theory merge). Note that the softer Thm.eq_thm_prop is often more

3942 appropriate than Thm.eq_thm.

3944 * Proper context for basic Simplifier operations: rewrite_rule,

3945 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

3946 pass runtime Proof.context (and ensure that the simplified entity

3947 actually belongs to it).

3949 * Proper context discipline for read_instantiate and instantiate_tac:

3950 variables that are meant to become schematic need to be given as

3951 fixed, and are generalized by the explicit context of local variables.

3952 This corresponds to Isar attributes "where" and "of" with 'for'

3953 declaration. INCOMPATIBILITY, also due to potential change of indices

3954 of schematic variables.

3956 * Moved ML_Compiler.exn_trace and other operations on exceptions to

3957 structure Runtime. Minor INCOMPATIBILITY.

3959 * Discontinued old Toplevel.debug in favour of system option

3960 "ML_exception_trace", which may be also declared within the context

3961 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

3963 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

3964 INCOMPATIBILITY.

3966 * Configuration option "ML_print_depth" controls the pretty-printing

3967 depth of the ML compiler within the context. The old print_depth in

3968 ML is still available as default_print_depth, but rarely used. Minor

3969 INCOMPATIBILITY.

3971 * Toplevel function "use" refers to raw ML bootstrap environment,

3972 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

3973 Note that 'ML_file' is the canonical command to load ML files into the

3974 formal context.

3976 * Simplified programming interface to define ML antiquotations, see

3977 structure ML_Antiquotation. Minor INCOMPATIBILITY.

3979 * ML antiquotation @{here} refers to its source position, which is

3980 occasionally useful for experimentation and diagnostic purposes.

3982 * ML antiquotation @{path} produces a Path.T value, similarly to

3983 Path.explode, but with compile-time check against the file-system and

3984 some PIDE markup. Note that unlike theory source, ML does not have a

3985 well-defined master directory, so an absolute symbolic path

3986 specification is usually required, e.g. "~~/src/HOL".

3988 * ML antiquotation @{print} inlines a function to print an arbitrary

3989 ML value, which is occasionally useful for diagnostic or demonstration

3990 purposes.

3993 *** System ***

3995 * Proof General with its traditional helper scripts is now an optional

3996 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

3997 component repository http://isabelle.in.tum.de/components/. Note that

3998 the "system" manual provides general explanations about add-on

3999 components, especially those that are not bundled with the release.

4001 * The raw Isabelle process executable has been renamed from

4002 "isabelle-process" to "isabelle_process", which conforms to common

4003 shell naming conventions, and allows to define a shell function within

4004 the Isabelle environment to avoid dynamic path lookup. Rare

4005 incompatibility for old tools that do not use the ISABELLE_PROCESS

4006 settings variable.

4008 * Former "isabelle tty" has been superseded by "isabelle console",

4009 with implicit build like "isabelle jedit", and without the mostly

4010 obsolete Isar TTY loop.

4012 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

4013 and PDF_VIEWER now refer to the actual programs, not shell

4014 command-lines. Discontinued option -c: invocation may be asynchronous

4015 via desktop environment, without any special precautions. Potential

4016 INCOMPATIBILITY with ambitious private settings.

4018 * Removed obsolete "isabelle unsymbolize". Note that the usual format

4019 for email communication is the Unicode rendering of Isabelle symbols,

4020 as produced by Isabelle/jEdit, for example.

4022 * Removed obsolete tool "wwwfind". Similar functionality may be

4023 integrated into Isabelle/jEdit eventually.

4025 * Improved 'display_drafts' concerning desktop integration and

4026 repeated invocation in PIDE front-end: re-use single file

4027 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

4029 * Session ROOT specifications require explicit 'document_files' for

4030 robust dependencies on LaTeX sources. Only these explicitly given

4031 files are copied to the document output directory, before document

4032 processing is started.

4034 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

4035 of TeX Live from Cygwin.

4039 New in Isabelle2013-2 (December 2013)

4040 -------------------------------------

4042 *** Prover IDE -- Isabelle/Scala/jEdit ***

4044 * More robust editing of running commands with internal forks,

4045 e.g. non-terminating 'by' steps.

4047 * More relaxed Sledgehammer panel: avoid repeated application of query

4048 after edits surrounding the command location.

4050 * More status information about commands that are interrupted

4051 accidentally (via physical event or Poly/ML runtime system signal,

4052 e.g. out-of-memory).

4055 *** System ***

4057 * More robust termination of external processes managed by

4058 Isabelle/ML: support cancellation of tasks within the range of

4059 milliseconds, as required for PIDE document editing with automatically

4060 tried tools (e.g. Sledgehammer).

4062 * Reactivated Isabelle/Scala kill command for external processes on

4063 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

4064 workaround for some Debian/Ubuntu Linux versions from 2013.

4068 New in Isabelle2013-1 (November 2013)

4069 -------------------------------------

4071 *** General ***

4073 * Discontinued obsolete 'uses' within theory header. Note that

4074 commands like 'ML_file' work without separate declaration of file

4075 dependencies. Minor INCOMPATIBILITY.

4077 * Discontinued redundant 'use' command, which was superseded by

4078 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

4080 * Simplified subscripts within identifiers, using plain \<^sub>

4081 instead of the second copy \<^isub> and \<^isup>. Superscripts are

4082 only for literal tokens within notation; explicit mixfix annotations

4083 for consts or fixed variables may be used as fall-back for unusual

4084 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

4085 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

4086 standardize symbols as a starting point for further manual cleanup.

4087 The ML reference variable "legacy_isub_isup" may be set as temporary

4088 workaround, to make the prover accept a subset of the old identifier

4089 syntax.

4091 * Document antiquotations: term style "isub" has been renamed to

4092 "sub". Minor INCOMPATIBILITY.

4094 * Uniform management of "quick_and_dirty" as system option (see also

4095 "isabelle options"), configuration option within the context (see also

4096 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

4097 INCOMPATIBILITY, need to use more official Isabelle means to access

4098 quick_and_dirty, instead of historical poking into mutable reference.

4100 * Renamed command 'print_configs' to 'print_options'. Minor

4101 INCOMPATIBILITY.

4103 * Proper diagnostic command 'print_state'. Old 'pr' (with its

4104 implicit change of some global references) is retained for now as

4105 control command, e.g. for ProofGeneral 3.7.x.

4107 * Discontinued 'print_drafts' command with its old-fashioned PS output

4108 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

4109 'display_drafts' instead and print via the regular document viewer.

4111 * Updated and extended "isar-ref" and "implementation" manual,

4112 eliminated old "ref" manual.

4115 *** Prover IDE -- Isabelle/Scala/jEdit ***

4117 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

4118 Documentation panel.

4120 * Dockable window "Documentation" provides access to Isabelle

4121 documentation.

4123 * Dockable window "Find" provides query operations for formal entities

4124 (GUI front-end to 'find_theorems' command).

4126 * Dockable window "Sledgehammer" manages asynchronous / parallel

4127 sledgehammer runs over existing document sources, independently of

4128 normal editing and checking process.

4130 * Dockable window "Timing" provides an overview of relevant command

4131 timing information, depending on option jedit_timing_threshold. The

4132 same timing information is shown in the extended tooltip of the

4133 command keyword, when hovering the mouse over it while the CONTROL or

4134 COMMAND modifier is pressed.

4136 * Improved dockable window "Theories": Continuous checking of proof

4137 document (visible and required parts) may be controlled explicitly,

4138 using check box or shortcut "C+e ENTER". Individual theory nodes may

4139 be marked explicitly as required and checked in full, using check box

4140 or shortcut "C+e SPACE".

4142 * Improved completion mechanism, which is now managed by the

4143 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

4144 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

4146 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

4147 isabelle.complete for explicit completion in Isabelle sources.

4148 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

4149 to resolve conflict.

4151 * Improved support of various "minor modes" for Isabelle NEWS,

4152 options, session ROOT etc., with completion and SideKick tree view.

4154 * Strictly monotonic document update, without premature cancellation of

4155 running transactions that are still needed: avoid reset/restart of

4156 such command executions while editing.

4158 * Support for asynchronous print functions, as overlay to existing

4159 document content.

4161 * Support for automatic tools in HOL, which try to prove or disprove

4162 toplevel theorem statements.

4164 * Action isabelle.reset-font-size resets main text area font size

4165 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

4166 also "Plugin Options / Isabelle / General"). It can be bound to some

4167 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

4169 * File specifications in jEdit (e.g. file browser) may refer to

4170 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

4171 obsolete $ISABELLE_HOME_WINDOWS variable.

4173 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

4174 / Global Options / Appearance".

4176 * Improved support of native Mac OS X functionality via "MacOSX"

4177 plugin, which is now enabled by default.

4180 *** Pure ***

4182 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

4183 In particular, 'interpretation' allows for non-persistent

4184 interpretation within "context ... begin ... end" blocks offering a

4185 light-weight alternative to 'sublocale'. See "isar-ref" manual for

4186 details.

4188 * Improved locales diagnostic command 'print_dependencies'.

4190 * Discontinued obsolete 'axioms' command, which has been marked as

4191 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

4192 instead, while observing its uniform scope for polymorphism.

4194 * Discontinued empty name bindings in 'axiomatization'.

4195 INCOMPATIBILITY.

4197 * System option "proofs" has been discontinued. Instead the global

4198 state of Proofterm.proofs is persistently compiled into logic images

4199 as required, notably HOL-Proofs. Users no longer need to change

4200 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

4202 * Syntax translation functions (print_translation etc.) always depend

4203 on Proof.context. Discontinued former "(advanced)" option -- this is

4204 now the default. Minor INCOMPATIBILITY.

4206 * Former global reference trace_unify_fail is now available as

4207 configuration option "unify_trace_failure" (global context only).

4209 * SELECT_GOAL now retains the syntactic context of the overall goal

4210 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

4211 situations.

4214 *** HOL ***

4216 * Stronger precedence of syntax for big intersection and union on

4217 sets, in accordance with corresponding lattice operations.

4218 INCOMPATIBILITY.

4220 * Notation "{p:A. P}" now allows tuple patterns as well.

4222 * Nested case expressions are now translated in a separate check phase

4223 rather than during parsing. The data for case combinators is separated

4224 from the datatype package. The declaration attribute

4225 "case_translation" can be used to register new case combinators:

4227 declare [[case_translation case_combinator constructor1 ... constructorN]]

4229 * Code generator:

4230 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

4231 'code_instance'.

4232 - 'code_identifier' declares name hints for arbitrary identifiers in

4233 generated code, subsuming 'code_modulename'.

4235 See the isar-ref manual for syntax diagrams, and the HOL theories for

4236 examples.

4238 * Attibute 'code': 'code' now declares concrete and abstract code

4239 equations uniformly. Use explicit 'code equation' and 'code abstract'

4240 to distinguish both when desired.

4242 * Discontinued theories Code_Integer and Efficient_Nat by a more

4243 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

4244 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

4245 generation for details. INCOMPATIBILITY.

4247 * Numeric types are mapped by default to target language numerals:

4248 natural (replaces former code_numeral) and integer (replaces former

4249 code_int). Conversions are available as integer_of_natural /

4250 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

4251 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

4252 ML). INCOMPATIBILITY.

4254 * Function package: For mutually recursive functions f and g, separate

4255 cases rules f.cases and g.cases are generated instead of unusable

4256 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

4257 in the case that the unusable rule was used nevertheless.

4259 * Function package: For each function f, new rules f.elims are

4260 generated, which eliminate equalities of the form "f x = t".

4262 * New command 'fun_cases' derives ad-hoc elimination rules for

4263 function equations as simplified instances of f.elims, analogous to

4264 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

4266 * Lifting:

4267 - parametrized correspondence relations are now supported:

4268 + parametricity theorems for the raw term can be specified in

4269 the command lift_definition, which allow us to generate stronger

4270 transfer rules

4271 + setup_lifting generates stronger transfer rules if parametric

4272 correspondence relation can be generated

4273 + various new properties of the relator must be specified to support

4274 parametricity

4275 + parametricity theorem for the Quotient relation can be specified

4276 - setup_lifting generates domain rules for the Transfer package

4277 - stronger reflexivity prover of respectfulness theorems for type

4278 copies

4279 - ===> and --> are now local. The symbols can be introduced

4280 by interpreting the locale lifting_syntax (typically in an

4281 anonymous context)

4282 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

4283 Main. Potential INCOMPATIBILITY

4284 - new commands for restoring and deleting Lifting/Transfer context:

4285 lifting_forget, lifting_update

4286 - the command print_quotmaps was renamed to print_quot_maps.

4287 INCOMPATIBILITY

4289 * Transfer:

4290 - better support for domains in Transfer: replace Domainp T

4291 by the actual invariant in a transferred goal

4292 - transfer rules can have as assumptions other transfer rules

4293 - Experimental support for transferring from the raw level to the

4294 abstract level: Transfer.transferred attribute

4295 - Attribute version of the transfer method: untransferred attribute

4297 * Reification and reflection:

4298 - Reification is now directly available in HOL-Main in structure

4299 "Reification".

4300 - Reflection now handles multiple lists with variables also.

4301 - The whole reflection stack has been decomposed into conversions.

4302 INCOMPATIBILITY.

4304 * Revised devices for recursive definitions over finite sets:

4305 - Only one fundamental fold combinator on finite set remains:

4306 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

4307 This is now identity on infinite sets.

4308 - Locales ("mini packages") for fundamental definitions with

4309 Finite_Set.fold: folding, folding_idem.

4310 - Locales comm_monoid_set, semilattice_order_set and

4311 semilattice_neutr_order_set for big operators on sets.

4312 See theory Big_Operators for canonical examples.

4313 Note that foundational constants comm_monoid_set.F and

4314 semilattice_set.F correspond to former combinators fold_image

4315 and fold1 respectively. These are now gone. You may use

4316 those foundational constants as substitutes, but it is

4317 preferable to interpret the above locales accordingly.

4318 - Dropped class ab_semigroup_idem_mult (special case of lattice,

4319 no longer needed in connection with Finite_Set.fold etc.)

4320 - Fact renames:

4321 card.union_inter ~> card_Un_Int [symmetric]

4322 card.union_disjoint ~> card_Un_disjoint

4323 INCOMPATIBILITY.

4325 * Locale hierarchy for abstract orderings and (semi)lattices.

4327 * Complete_Partial_Order.admissible is defined outside the type class

4328 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

4329 class predicate assumption or sort constraint when possible.

4330 INCOMPATIBILITY.

4332 * Introduce type class "conditionally_complete_lattice": Like a

4333 complete lattice but does not assume the existence of the top and

4334 bottom elements. Allows to generalize some lemmas about reals and

4335 extended reals. Removed SupInf and replaced it by the instantiation

4336 of conditionally_complete_lattice for real. Renamed lemmas about

4337 conditionally-complete lattice from Sup_... to cSup_... and from

4338 Inf_... to cInf_... to avoid hidding of similar complete lattice

4339 lemmas.

4341 * Introduce type class linear_continuum as combination of

4342 conditionally-complete lattices and inner dense linorders which have

4343 more than one element. INCOMPATIBILITY.

4345 * Introduced type classes order_top and order_bot. The old classes top

4346 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

4347 Rename bot -> order_bot, top -> order_top

4349 * Introduce type classes "no_top" and "no_bot" for orderings without

4350 top and bottom elements.

4352 * Split dense_linorder into inner_dense_order and no_top, no_bot.

4354 * Complex_Main: Unify and move various concepts from

4355 HOL-Multivariate_Analysis to HOL-Complex_Main.

4357 - Introduce type class (lin)order_topology and

4358 linear_continuum_topology. Allows to generalize theorems about

4359 limits and order. Instances are reals and extended reals.

4361 - continuous and continuos_on from Multivariate_Analysis:

4362 "continuous" is the continuity of a function at a filter. "isCont"

4363 is now an abbrevitation: "isCont x f == continuous (at _) f".

4365 Generalized continuity lemmas from isCont to continuous on an

4366 arbitrary filter.

4368 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

4369 compactness of closed intervals on reals. Continuous functions

4370 attain infimum and supremum on compact sets. The inverse of a

4371 continuous function is continuous, when the function is continuous

4372 on a compact set.

4374 - connected from Multivariate_Analysis. Use it to prove the

4375 intermediate value theorem. Show connectedness of intervals on

4376 linear_continuum_topology).

4378 - first_countable_topology from Multivariate_Analysis. Is used to

4379 show equivalence of properties on the neighbourhood filter of x and

4380 on all sequences converging to x.

4382 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

4383 theorems from Library/FDERIV.thy to Deriv.thy and base the

4384 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

4385 which are restricted to sets, i.e. to represent derivatives from

4386 left or right.

4388 - Removed the within-filter. It is replaced by the principal filter:

4390 F within X = inf F (principal X)

4392 - Introduce "at x within U" as a single constant, "at x" is now an

4393 abbreviation for "at x within UNIV"

4395 - Introduce named theorem collections tendsto_intros,

4396 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

4397 in tendsto_intros (or FDERIV_intros) are also available as

4398 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

4399 is replaced by a congruence rule. This allows to apply them as

4400 intro rules and then proving equivalence by the simplifier.

4402 - Restructured theories in HOL-Complex_Main:

4404 + Moved RealDef and RComplete into Real

4406 + Introduced Topological_Spaces and moved theorems about

4407 topological spaces, filters, limits and continuity to it

4409 + Renamed RealVector to Real_Vector_Spaces

4411 + Split Lim, SEQ, Series into Topological_Spaces,

4412 Real_Vector_Spaces, and Limits

4414 + Moved Ln and Log to Transcendental

4416 + Moved theorems about continuity from Deriv to Topological_Spaces

4418 - Remove various auxiliary lemmas.

4420 INCOMPATIBILITY.

4422 * Nitpick:

4423 - Added option "spy".

4424 - Reduce incidence of "too high arity" errors.

4426 * Sledgehammer:

4427 - Renamed option:

4428 isar_shrink ~> isar_compress

4429 INCOMPATIBILITY.

4430 - Added options "isar_try0", "spy".

4431 - Better support for "isar_proofs".

4432 - MaSh has been fined-tuned and now runs as a local server.

4434 * Improved support for ad hoc overloading of constants (see also

4435 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

4437 * Library/Polynomial.thy:

4438 - Use lifting for primitive definitions.

4439 - Explicit conversions from and to lists of coefficients, used for

4440 generated code.

4441 - Replaced recursion operator poly_rec by fold_coeffs.

4442 - Prefer pre-existing gcd operation for gcd.

4443 - Fact renames:

4444 poly_eq_iff ~> poly_eq_poly_eq_iff

4445 poly_ext ~> poly_eqI

4446 expand_poly_eq ~> poly_eq_iff

4447 IMCOMPATIBILITY.

4449 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

4450 case_of_simps to convert function definitions between a list of

4451 equations with patterns on the lhs and a single equation with case

4452 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

4454 * New Library/FSet.thy: type of finite sets defined as a subtype of

4455 sets defined by Lifting/Transfer.

4457 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

4459 * Consolidation of library theories on product orders:

4461 Product_Lattice ~> Product_Order -- pointwise order on products

4462 Product_ord ~> Product_Lexorder -- lexicographic order on products

4464 INCOMPATIBILITY.

4466 * Imperative-HOL: The MREC combinator is considered legacy and no

4467 longer included by default. INCOMPATIBILITY, use partial_function

4468 instead, or import theory Legacy_Mrec as a fallback.

4470 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

4471 ~~/src/HOL/Algebra/poly. Existing theories should be based on

4472 ~~/src/HOL/Library/Polynomial instead. The latter provides

4473 integration with HOL's type classes for rings. INCOMPATIBILITY.

4475 * HOL-BNF:

4476 - Various improvements to BNF-based (co)datatype package, including

4477 new commands "primrec_new", "primcorec", and

4478 "datatype_new_compat", as well as documentation. See

4479 "datatypes.pdf" for details.

4480 - New "coinduction" method to avoid some boilerplate (compared to

4481 coinduct).

4482 - Renamed keywords:

4483 data ~> datatype_new

4484 codata ~> codatatype

4485 bnf_def ~> bnf

4486 - Renamed many generated theorems, including

4487 discs ~> disc

4488 map_comp' ~> map_comp

4489 map_id' ~> map_id

4490 sels ~> sel

4491 set_map' ~> set_map

4492 sets ~> set

4493 IMCOMPATIBILITY.

4496 *** ML ***

4498 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

4499 "check_property" allows to check specifications of the form "ALL x y

4500 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

4501 Examples.thy in particular.

4503 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

4504 tracing output in the command transaction context instead of physical

4505 stdout. See also Toplevel.debug, Toplevel.debugging and

4506 ML_Compiler.exn_trace.

4508 * ML type "theory" is now immutable, without any special treatment of

4509 drafts or linear updates (which could lead to "stale theory" errors in

4510 the past). Discontinued obsolete operations like Theory.copy,

4511 Theory.checkpoint, and the auxiliary type theory_ref. Minor

4512 INCOMPATIBILITY.

4514 * More uniform naming of goal functions for skipped proofs:

4516 Skip_Proof.prove ~> Goal.prove_sorry

4517 Skip_Proof.prove_global ~> Goal.prove_sorry_global

4519 Minor INCOMPATIBILITY.

4521 * Simplifier tactics and tools use proper Proof.context instead of

4522 historic type simpset. Old-style declarations like addsimps,

4523 addsimprocs etc. operate directly on Proof.context. Raw type simpset

4524 retains its use as snapshot of the main Simplifier context, using

4525 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

4526 old tools by making them depend on (ctxt : Proof.context) instead of

4527 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

4529 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

4530 operate on Proof.context instead of claset, for uniformity with addIs,

4531 addEs, addDs etc. Note that claset_of and put_claset allow to manage

4532 clasets separately from the context.

4534 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

4535 INCOMPATIBILITY, use @{context} instead.

4537 * Antiquotation @{theory_context A} is similar to @{theory A}, but

4538 presents the result as initial Proof.context.

4541 *** System ***

4543 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

4544 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

4546 * Discontinued obsolete isabelle-process options -f and -u (former

4547 administrative aliases of option -e). Minor INCOMPATIBILITY.

4549 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

4550 settings variable.

4552 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

4553 document formats: dvi.gz, ps, ps.gz -- the default document format is

4554 always pdf.

4556 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

4557 specify global resources of the JVM process run by isabelle build.

4559 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

4560 to run Isabelle/Scala source files as standalone programs.

4562 * Improved "isabelle keywords" tool (for old-style ProofGeneral

4563 keyword tables): use Isabelle/Scala operations, which inspect outer

4564 syntax without requiring to build sessions first.

4566 * Sessions may be organized via 'chapter' specifications in the ROOT

4567 file, which determines a two-level hierarchy of browser info. The old

4568 tree-like organization via implicit sub-session relation (with its

4569 tendency towards erratic fluctuation of URLs) has been discontinued.

4570 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

4571 for HTML presentation of theories.

4575 New in Isabelle2013 (February 2013)

4576 -----------------------------------

4578 *** General ***

4580 * Theorem status about oracles and unfinished/failed future proofs is

4581 no longer printed by default, since it is incompatible with

4582 incremental / parallel checking of the persistent document model. ML

4583 function Thm.peek_status may be used to inspect a snapshot of the

4584 ongoing evaluation process. Note that in batch mode --- notably

4585 isabelle build --- the system ensures that future proofs of all

4586 accessible theorems in the theory context are finished (as before).

4588 * Configuration option show_markup controls direct inlining of markup

4589 into the printed representation of formal entities --- notably type

4590 and sort constraints. This enables Prover IDE users to retrieve that

4591 information via tooltips in the output window, for example.

4593 * Command 'ML_file' evaluates ML text from a file directly within the

4594 theory, without any predeclaration via 'uses' in the theory header.

4596 * Old command 'use' command and corresponding keyword 'uses' in the

4597 theory header are legacy features and will be discontinued soon.

4598 Tools that load their additional source files may imitate the

4599 'ML_file' implementation, such that the system can take care of

4600 dependencies properly.

4602 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

4603 is called fastforce / fast_force_tac already since Isabelle2011-1.

4605 * Updated and extended "isar-ref" and "implementation" manual, reduced

4606 remaining material in old "ref" manual.

4608 * Improved support for auxiliary contexts that indicate block structure

4609 for specifications. Nesting of "context fixes ... context assumes ..."

4610 and "class ... context ...".

4612 * Attribute "consumes" allows a negative value as well, which is

4613 interpreted relatively to the total number of premises of the rule in

4614 the target context. This form of declaration is stable when exported

4615 from a nested 'context' with additional assumptions. It is the

4616 preferred form for definitional packages, notably cases/rules produced

4617 in HOL/inductive and HOL/function.

4619 * More informative error messages for Isar proof commands involving

4620 lazy enumerations (method applications etc.).

4622 * Refined 'help' command to retrieve outer syntax commands according

4623 to name patterns (with clickable results).

4626 *** Prover IDE -- Isabelle/Scala/jEdit ***

4628 * Parallel terminal proofs ('by') are enabled by default, likewise

4629 proofs that are built into packages like 'datatype', 'function'. This

4630 allows to "run ahead" checking the theory specifications on the

4631 surface, while the prover is still crunching on internal

4632 justifications. Unfinished / cancelled proofs are restarted as

4633 required to complete full proof checking eventually.

4635 * Improved output panel with tooltips, hyperlinks etc. based on the

4636 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

4637 tooltips leads to some window that supports the same recursively,

4638 which can lead to stacks of tooltips as the semantic document content

4639 is explored. ESCAPE closes the whole stack, individual windows may be

4640 closed separately, or detached to become independent jEdit dockables.

4642 * Improved support for commands that produce graph output: the text

4643 message contains a clickable area to open a new instance of the graph

4644 browser on demand.

4646 * More robust incremental parsing of outer syntax (partial comments,

4647 malformed symbols). Changing the balance of open/close quotes and

4648 comment delimiters works more conveniently with unfinished situations

4649 that frequently occur in user interaction.

4651 * More efficient painting and improved reactivity when editing large

4652 files. More scalable management of formal document content.

4654 * Smarter handling of tracing messages: prover process pauses after

4655 certain number of messages per command transaction, with some user

4656 dialog to stop or continue. This avoids swamping the front-end with

4657 potentially infinite message streams.

4659 * More plugin options and preferences, based on Isabelle/Scala. The

4660 jEdit plugin option panel provides access to some Isabelle/Scala

4661 options, including tuning parameters for editor reactivity and color

4662 schemes.

4664 * Dockable window "Symbols" provides some editing support for Isabelle

4665 symbols.

4667 * Dockable window "Monitor" shows ML runtime statistics. Note that

4668 continuous display of the chart slows down the system.

4670 * Improved editing support for control styles: subscript, superscript,

4671 bold, reset of style -- operating on single symbols or text

4672 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

4674 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

4675 adjust the main text area font size, and its derivatives for output,

4676 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

4677 need to be adapted to local keyboard layouts.

4679 * More reactive completion popup by default: use \t (TAB) instead of

4680 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

4681 also "Plugin Options / SideKick / General / Code Completion Options".

4683 * Implicit check and build dialog of the specified logic session

4684 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

4685 demand, without bundling big platform-dependent heap images in the

4686 Isabelle distribution.

4688 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

4689 from Oracle provide better multi-platform experience. This version is

4690 now bundled exclusively with Isabelle.

4693 *** Pure ***

4695 * Code generation for Haskell: restrict unqualified imports from

4696 Haskell Prelude to a small set of fundamental operations.

4698 * Command 'export_code': relative file names are interpreted

4699 relatively to master directory of current theory rather than the

4700 rather arbitrary current working directory. INCOMPATIBILITY.

4702 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

4703 use regular rule composition via "OF" / "THEN", or explicit proof

4704 structure instead. Note that Isabelle/ML provides a variety of

4705 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

4706 with some care where this is really required.

4708 * Command 'typ' supports an additional variant with explicit sort

4709 constraint, to infer and check the most general type conforming to a

4710 given sort. Example (in HOL):

4712 typ "_ * _ * bool * unit" :: finite

4714 * Command 'locale_deps' visualizes all locales and their relations as

4715 a Hasse diagram.

4718 *** HOL ***

4720 * Sledgehammer:

4722 - Added MaSh relevance filter based on machine-learning; see the

4723 Sledgehammer manual for details.

4724 - Polished Isar proofs generated with "isar_proofs" option.

4725 - Rationalized type encodings ("type_enc" option).

4726 - Renamed "kill_provers" subcommand to "kill_all".

4727 - Renamed options:

4728 isar_proof ~> isar_proofs

4729 isar_shrink_factor ~> isar_shrink

4730 max_relevant ~> max_facts

4731 relevance_thresholds ~> fact_thresholds

4733 * Quickcheck: added an optimisation for equality premises. It is

4734 switched on by default, and can be switched off by setting the

4735 configuration quickcheck_optimise_equality to false.

4737 * Quotient: only one quotient can be defined by quotient_type

4738 INCOMPATIBILITY.

4740 * Lifting:

4741 - generation of an abstraction function equation in lift_definition

4742 - quot_del attribute

4743 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

4745 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

4746 expressions.

4748 * Preprocessing of the code generator rewrites set comprehensions into

4749 pointfree expressions.

4751 * The SMT solver Z3 has now by default a restricted set of directly

4752 supported features. For the full set of features (div/mod, nonlinear

4753 arithmetic, datatypes/records) with potential proof reconstruction

4754 failures, enable the configuration option "z3_with_extensions". Minor

4755 INCOMPATIBILITY.

4757 * Simplified 'typedef' specifications: historical options for implicit

4758 set definition and alternative name have been discontinued. The

4759 former behavior of "typedef (open) t = A" is now the default, but

4760 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

4761 accordingly.

4763 * Removed constant "chars"; prefer "Enum.enum" on type "char"

4764 directly. INCOMPATIBILITY.

4766 * Moved operation product, sublists and n_lists from theory Enum to

4767 List. INCOMPATIBILITY.

4769 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

4771 * Class "comm_monoid_diff" formalises properties of bounded

4772 subtraction, with natural numbers and multisets as typical instances.

4774 * Added combinator "Option.these" with type "'a option set => 'a set".

4776 * Theory "Transitive_Closure": renamed lemmas

4778 reflcl_tranclp -> reflclp_tranclp

4779 rtranclp_reflcl -> rtranclp_reflclp

4781 INCOMPATIBILITY.

4783 * Theory "Rings": renamed lemmas (in class semiring)

4785 left_distrib ~> distrib_right

4786 right_distrib ~> distrib_left

4788 INCOMPATIBILITY.

4790 * Generalized the definition of limits:

4792 - Introduced the predicate filterlim (LIM x F. f x :> G) which

4793 expresses that when the input values x converge to F then the

4794 output f x converges to G.

4796 - Added filters for convergence to positive (at_top) and negative

4797 infinity (at_bot).

4799 - Moved infinity in the norm (at_infinity) from

4800 Multivariate_Analysis to Complex_Main.

4802 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

4803 at_top".

4805 INCOMPATIBILITY.

4807 * Theory "Library/Option_ord" provides instantiation of option type to

4808 lattice type classes.

4810 * Theory "Library/Multiset": renamed

4812 constant fold_mset ~> Multiset.fold

4813 fact fold_mset_commute ~> fold_mset_comm

4815 INCOMPATIBILITY.

4817 * Renamed theory Library/List_Prefix to Library/Sublist, with related

4818 changes as follows.

4820 - Renamed constants (and related lemmas)

4822 prefix ~> prefixeq

4823 strict_prefix ~> prefix

4825 - Replaced constant "postfix" by "suffixeq" with swapped argument

4826 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

4827 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

4828 Renamed lemmas accordingly.

4830 - Added constant "list_hembeq" for homeomorphic embedding on

4831 lists. Added abbreviation "sublisteq" for special case

4832 "list_hembeq (op =)".

4834 - Theory Library/Sublist no longer provides "order" and "bot" type

4835 class instances for the prefix order (merely corresponding locale

4836 interpretations). The type class instances are now in theory

4837 Library/Prefix_Order.

4839 - The sublist relation of theory Library/Sublist_Order is now based

4840 on "Sublist.sublisteq". Renamed lemmas accordingly:

4842 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

4843 le_list_append_mono ~> Sublist.list_hembeq_append_mono

4844 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

4845 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

4846 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

4847 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

4848 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

4849 le_list_drop_many ~> Sublist.sublisteq_drop_many

4850 le_list_filter_left ~> Sublist.sublisteq_filter_left

4851 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

4852 le_list_rev_take_iff ~> Sublist.sublisteq_append

4853 le_list_same_length ~> Sublist.sublisteq_same_length

4854 le_list_take_many_iff ~> Sublist.sublisteq_append'

4855 less_eq_list.drop ~> less_eq_list_drop

4856 less_eq_list.induct ~> less_eq_list_induct

4857 not_le_list_length ~> Sublist.not_sublisteq_length

4859 INCOMPATIBILITY.

4861 * New theory Library/Countable_Set.

4863 * Theory Library/Debug and Library/Parallel provide debugging and

4864 parallel execution for code generated towards Isabelle/ML.

4866 * Theory Library/FuncSet: Extended support for Pi and extensional and

4867 introduce the extensional dependent function space "PiE". Replaced

4868 extensional_funcset by an abbreviation, and renamed lemmas from

4869 extensional_funcset to PiE as follows:

4871 extensional_empty ~> PiE_empty

4872 extensional_funcset_empty_domain ~> PiE_empty_domain

4873 extensional_funcset_empty_range ~> PiE_empty_range

4874 extensional_funcset_arb ~> PiE_arb

4875 extensional_funcset_mem ~> PiE_mem

4876 extensional_funcset_extend_domainI ~> PiE_fun_upd

4877 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

4878 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

4879 card_extensional_funcset ~> card_PiE

4880 finite_extensional_funcset ~> finite_PiE

4882 INCOMPATIBILITY.

4884 * Theory Library/FinFun: theory of almost everywhere constant

4885 functions (supersedes the AFP entry "Code Generation for Functions as

4886 Data").

4888 * Theory Library/Phantom: generic phantom type to make a type

4889 parameter appear in a constant's type. This alternative to adding

4890 TYPE('a) as another parameter avoids unnecessary closures in generated

4891 code.

4893 * Theory Library/RBT_Impl: efficient construction of red-black trees

4894 from sorted associative lists. Merging two trees with rbt_union may

4895 return a structurally different tree than before. Potential

4896 INCOMPATIBILITY.

4898 * Theory Library/IArray: immutable arrays with code generation.

4900 * Theory Library/Finite_Lattice: theory of finite lattices.

4902 * HOL/Multivariate_Analysis: replaced

4904 "basis :: 'a::euclidean_space => nat => real"

4905 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

4907 on euclidean spaces by using the inner product "_ \<bullet> _" with

4908 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

4909 "SUM i : Basis. f i * r i".

4911 With this change the following constants are also changed or removed:

4913 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

4914 a $$ i ~> inner a i (where i : Basis)

4915 cart_base i removed

4916 \<pi>, \<pi>' removed

4918 Theorems about these constants where removed.

4920 Renamed lemmas:

4922 component_le_norm ~> Basis_le_norm

4923 euclidean_eq ~> euclidean_eq_iff

4924 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

4925 euclidean_simps ~> inner_simps

4926 independent_basis ~> independent_Basis

4927 span_basis ~> span_Basis

4928 in_span_basis ~> in_span_Basis

4929 norm_bound_component_le ~> norm_boound_Basis_le

4930 norm_bound_component_lt ~> norm_boound_Basis_lt

4931 component_le_infnorm ~> Basis_le_infnorm

4933 INCOMPATIBILITY.

4935 * HOL/Probability:

4937 - Added simproc "measurable" to automatically prove measurability.

4939 - Added induction rules for sigma sets with disjoint union

4940 (sigma_sets_induct_disjoint) and for Borel-measurable functions

4941 (borel_measurable_induct).

4943 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

4944 projective family).

4946 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

4947 AFP entry "Ordinals_and_Cardinals").

4949 * HOL/BNF: New (co)datatype package based on bounded natural functors

4950 with support for mixed, nested recursion and interesting non-free

4951 datatypes.

4953 * HOL/Finite_Set and Relation: added new set and relation operations

4954 expressed by Finite_Set.fold.

4956 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

4957 trees for the code generator.

4959 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

4960 Lifting/Transfer.

4961 possible INCOMPATIBILITY.

4963 * HOL/Set: renamed Set.project -> Set.filter

4964 INCOMPATIBILITY.

4967 *** Document preparation ***

4969 * Dropped legacy antiquotations "term_style" and "thm_style", since

4970 styles may be given as arguments to "term" and "thm" already.

4971 Discontinued legacy styles "prem1" .. "prem19".

4973 * Default LaTeX rendering for \<euro> is now based on eurosym package,

4974 instead of slightly exotic babel/greek.

4976 * Document variant NAME may use different LaTeX entry point

4977 document/root_NAME.tex if that file exists, instead of the common

4978 document/root.tex.

4980 * Simplified custom document/build script, instead of old-style

4981 document/IsaMakefile. Minor INCOMPATIBILITY.

4984 *** ML ***

4986 * The default limit for maximum number of worker threads is now 8,

4987 instead of 4, in correspondence to capabilities of contemporary

4988 hardware and Poly/ML runtime system.

4990 * Type Seq.results and related operations support embedded error

4991 messages within lazy enumerations, and thus allow to provide

4992 informative errors in the absence of any usable results.

4994 * Renamed Position.str_of to Position.here to emphasize that this is a

4995 formal device to inline positions into message text, but not

4996 necessarily printing visible text.

4999 *** System ***

5001 * Advanced support for Isabelle sessions and build management, see

5002 "system" manual for the chapter of that name, especially the "isabelle

5003 build" tool and its examples. The "isabelle mkroot" tool prepares

5004 session root directories for use with "isabelle build", similar to

5005 former "isabelle mkdir" for "isabelle usedir". Note that this affects

5006 document preparation as well. INCOMPATIBILITY, isabelle usedir /

5007 mkdir / make are rendered obsolete.

5009 * Discontinued obsolete Isabelle/build script, it is superseded by the

5010 regular isabelle build tool. For example:

5012 isabelle build -s -b HOL

5014 * Discontinued obsolete "isabelle makeall".

5016 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

5017 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

5018 provides some traditional targets that invoke "isabelle build". Note

5019 that this is inefficient! Applications of Isabelle/HOL involving

5020 "isabelle make" should be upgraded to use "isabelle build" directly.

5022 * The "isabelle options" tool prints Isabelle system options, as

5023 required for "isabelle build", for example.

5025 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

5026 Minor INCOMPATIBILITY in command-line options.

5028 * The "isabelle install" tool has now a simpler command-line. Minor

5029 INCOMPATIBILITY.

5031 * The "isabelle components" tool helps to resolve add-on components

5032 that are not bundled, or referenced from a bare-bones repository

5033 version of Isabelle.

5035 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

5036 platform family: "linux", "macos", "windows".

5038 * The ML system is configured as regular component, and no longer

5039 picked up from some surrounding directory. Potential INCOMPATIBILITY

5040 for home-made settings.

5042 * Improved ML runtime statistics (heap, threads, future tasks etc.).

5044 * Discontinued support for Poly/ML 5.2.1, which was the last version

5045 without exception positions and advanced ML compiler/toplevel

5046 configuration.

5048 * Discontinued special treatment of Proof General -- no longer guess

5049 PROOFGENERAL_HOME based on accidental file-system layout. Minor

5050 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

5051 settings manually, or use a Proof General version that has been

5052 bundled as Isabelle component.

5056 New in Isabelle2012 (May 2012)

5057 ------------------------------

5059 *** General ***

5061 * Prover IDE (PIDE) improvements:

5063 - more robust Sledgehammer integration (as before the sledgehammer

5064 command-line needs to be typed into the source buffer)

5065 - markup for bound variables

5066 - markup for types of term variables (displayed as tooltips)

5067 - support for user-defined Isar commands within the running session

5068 - improved support for Unicode outside original 16bit range

5069 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

5071 * Forward declaration of outer syntax keywords within the theory

5072 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

5073 commands to be used in the same theory where defined.

5075 * Auxiliary contexts indicate block structure for specifications with

5076 additional parameters and assumptions. Such unnamed contexts may be

5077 nested within other targets, like 'theory', 'locale', 'class',

5078 'instantiation' etc. Results from the local context are generalized

5079 accordingly and applied to the enclosing target context. Example:

5081 context

5082 fixes x y z :: 'a

5083 assumes xy: "x = y" and yz: "y = z"

5084 begin

5086 lemma my_trans: "x = z" using xy yz by simp

5088 end

5090 thm my_trans

5092 The most basic application is to factor-out context elements of

5093 several fixes/assumes/shows theorem statements, e.g. see

5094 ~~/src/HOL/Isar_Examples/Group_Context.thy

5096 Any other local theory specification element works within the "context

5097 ... begin ... end" block as well.

5099 * Bundled declarations associate attributed fact expressions with a

5100 given name in the context. These may be later included in other

5101 contexts. This allows to manage context extensions casually, without

5102 the logical dependencies of locales and locale interpretation. See

5103 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

5105 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

5106 declaration, and results are standardized before being stored. Thus

5107 old-style "standard" after instantiation or composition of facts

5108 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

5109 indices of schematic variables.

5111 * Rule attributes in local theory declarations (e.g. locale or class)

5112 are now statically evaluated: the resulting theorem is stored instead

5113 of the original expression. INCOMPATIBILITY in rare situations, where

5114 the historic accident of dynamic re-evaluation in interpretations

5115 etc. was exploited.

5117 * New tutorial "Programming and Proving in Isabelle/HOL"

5118 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

5119 Structured Isar Proofs" ("isar-overview"), which has been removed. It

5120 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

5121 Logic" as the recommended beginners tutorial, but does not cover all

5122 of the material of that old tutorial.

5124 * Updated and extended reference manuals: "isar-ref",

5125 "implementation", "system"; reduced remaining material in old "ref"

5126 manual.

5129 *** Pure ***

5131 * Command 'definition' no longer exports the foundational "raw_def"

5132 into the user context. Minor INCOMPATIBILITY, may use the regular

5133 "def" result with attribute "abs_def" to imitate the old version.

5135 * Attribute "abs_def" turns an equation of the form "f x y == t" into

5136 "f == %x y. t", which ensures that "simp" or "unfold" steps always

5137 expand it. This also works for object-logic equality. (Formerly

5138 undocumented feature.)

5140 * Sort constraints are now propagated in simultaneous statements, just

5141 like type constraints. INCOMPATIBILITY in rare situations, where

5142 distinct sorts used to be assigned accidentally. For example:

5144 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

5146 lemma "P (x::'a)" and "Q (y::'a::bar)"

5147 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

5149 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

5150 tolerant against multiple unifiers, as long as the final result is

5151 unique. (As before, rules are composed in canonical right-to-left

5152 order to accommodate newly introduced premises.)

5154 * Renamed some inner syntax categories:

5156 num ~> num_token

5157 xnum ~> xnum_token

5158 xstr ~> str_token

5160 Minor INCOMPATIBILITY. Note that in practice "num_const" or

5161 "num_position" etc. are mainly used instead (which also include

5162 position information via constraints).

5164 * Simplified configuration options for syntax ambiguity: see

5165 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

5166 manual. Minor INCOMPATIBILITY.

5168 * Discontinued configuration option "syntax_positions": atomic terms

5169 in parse trees are always annotated by position constraints.

5171 * Old code generator for SML and its commands 'code_module',

5172 'code_library', 'consts_code', 'types_code' have been discontinued.

5173 Use commands of the generic code generator instead. INCOMPATIBILITY.

5175 * Redundant attribute "code_inline" has been discontinued. Use

5176 "code_unfold" instead. INCOMPATIBILITY.

5178 * Dropped attribute "code_unfold_post" in favor of the its dual

5179 "code_abbrev", which yields a common pattern in definitions like

5181 definition [code_abbrev]: "f = t"

5183 INCOMPATIBILITY.

5185 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

5186 instead. INCOMPATIBILITY.

5188 * Discontinued old "prems" fact, which used to refer to the accidental

5189 collection of foundational premises in the context (already marked as

5190 legacy since Isabelle2011).

5193 *** HOL ***

5195 * Type 'a set is now a proper type constructor (just as before

5196 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

5197 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

5198 sets separate, it is often sufficient to rephrase some set S that has

5199 been accidentally used as predicates by "%x. x : S", and some

5200 predicate P that has been accidentally used as set by "{x. P x}".

5201 Corresponding proofs in a first step should be pruned from any

5202 tinkering with former theorems mem_def and Collect_def as far as

5203 possible.

5205 For developments which deliberately mix predicates and sets, a

5206 planning step is necessary to determine what should become a predicate

5207 and what a set. It can be helpful to carry out that step in

5208 Isabelle2011-1 before jumping right into the current release.

5210 * Code generation by default implements sets as container type rather

5211 than predicates. INCOMPATIBILITY.

5213 * New type synonym 'a rel = ('a * 'a) set

5215 * The representation of numerals has changed. Datatype "num"

5216 represents strictly positive binary numerals, along with functions

5217 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent

5218 positive and negated numeric literals, respectively. See also

5219 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

5220 user theories may require adaptations as follows:

5222 - Theorems with number_ring or number_semiring constraints: These

5223 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

5225 - Theories defining numeric types: Remove number, number_semiring,

5226 and number_ring instances. Defer all theorems about numerals until

5227 after classes one and semigroup_add have been instantiated.

5229 - Numeral-only simp rules: Replace each rule having a "number_of v"

5230 pattern with two copies, one for numeral and one for neg_numeral.

5232 - Theorems about subclasses of semiring_1 or ring_1: These classes

5233 automatically support numerals now, so more simp rules and

5234 simprocs may now apply within the proof.

5236 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

5237 Redefine using other integer operations.

5239 * Transfer: New package intended to generalize the existing

5240 "descending" method and related theorem attributes from the Quotient

5241 package. (Not all functionality is implemented yet, but future

5242 development will focus on Transfer as an eventual replacement for the

5243 corresponding parts of the Quotient package.)

5245 - transfer_rule attribute: Maintains a collection of transfer rules,

5246 which relate constants at two different types. Transfer rules may

5247 relate different type instances of the same polymorphic constant,

5248 or they may relate an operation on a raw type to a corresponding

5249 operation on an abstract type (quotient or subtype). For example:

5251 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map

5252 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int

5254 - transfer method: Replaces a subgoal on abstract types with an

5255 equivalent subgoal on the corresponding raw types. Constants are

5256 replaced with corresponding ones according to the transfer rules.

5257 Goals are generalized over all free variables by default; this is

5258 necessary for variables whose types change, but can be overridden

5259 for specific variables with e.g. "transfer fixing: x y z". The

5260 variant transfer' method allows replacing a subgoal with one that

5261 is logically stronger (rather than equivalent).

5263 - relator_eq attribute: Collects identity laws for relators of

5264 various type constructors, e.g. "list_all2 (op =) = (op =)". The

5265 transfer method uses these lemmas to infer transfer rules for

5266 non-polymorphic constants on the fly.

5268 - transfer_prover method: Assists with proving a transfer rule for a

5269 new constant, provided the constant is defined in terms of other

5270 constants that already have transfer rules. It should be applied

5271 after unfolding the constant definitions.

5273 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

5274 from type nat to type int.

5276 * Lifting: New package intended to generalize the quotient_definition

5277 facility of the Quotient package; designed to work with Transfer.

5279 - lift_definition command: Defines operations on an abstract type in

5280 terms of a corresponding operation on a representation

5281 type. Example syntax:

5283 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"

5284 is List.insert

5286 Users must discharge a respectfulness proof obligation when each

5287 constant is defined. (For a type copy, i.e. a typedef with UNIV,

5288 the proof is discharged automatically.) The obligation is

5289 presented in a user-friendly, readable form; a respectfulness

5290 theorem in the standard format and a transfer rule are generated

5291 by the package.

5293 - Integration with code_abstype: For typedefs (e.g. subtypes

5294 corresponding to a datatype invariant, such as dlist),

5295 lift_definition generates a code certificate theorem and sets up

5296 code generation for each constant.

5298 - setup_lifting command: Sets up the Lifting package to work with a

5299 user-defined type. The user must provide either a quotient theorem

5300 or a type_definition theorem. The package configures transfer

5301 rules for equality and quantifiers on the type, and sets up the

5302 lift_definition command to work with the type.

5304 - Usage examples: See Quotient_Examples/Lift_DList.thy,

5305 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

5306 Word/Word.thy and Library/Float.thy.

5308 * Quotient package:

5310 - The 'quotient_type' command now supports a 'morphisms' option with

5311 rep and abs functions, similar to typedef.

5313 - 'quotient_type' sets up new types to work with the Lifting and

5314 Transfer packages, as with 'setup_lifting'.

5316 - The 'quotient_definition' command now requires the user to prove a

5317 respectfulness property at the point where the constant is

5318 defined, similar to lift_definition; INCOMPATIBILITY.

5320 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

5321 accordingly, INCOMPATIBILITY.

5323 * New diagnostic command 'find_unused_assms' to find potentially

5324 superfluous assumptions in theorems using Quickcheck.

5326 * Quickcheck:

5328 - Quickcheck returns variable assignments as counterexamples, which

5329 allows to reveal the underspecification of functions under test.

5330 For example, refuting "hd xs = x", it presents the variable

5331 assignment xs = [] and x = a1 as a counterexample, assuming that

5332 any property is false whenever "hd []" occurs in it.

5334 These counterexample are marked as potentially spurious, as

5335 Quickcheck also returns "xs = []" as a counterexample to the

5336 obvious theorem "hd xs = hd xs".

5338 After finding a potentially spurious counterexample, Quickcheck

5339 continues searching for genuine ones.

5341 By default, Quickcheck shows potentially spurious and genuine

5342 counterexamples. The option "genuine_only" sets quickcheck to only

5343 show genuine counterexamples.

5345 - The command 'quickcheck_generator' creates random and exhaustive

5346 value generators for a given type and operations.

5348 It generates values by using the operations as if they were

5349 constructors of that type.

5351 - Support for multisets.

5353 - Added "use_subtype" options.

5355 - Added "quickcheck_locale" configuration to specify how to process

5356 conjectures in a locale context.

5358 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

5359 and affecting 'rat' and 'real'.

5361 * Sledgehammer:

5362 - Integrated more tightly with SPASS, as described in the ITP 2012

5363 paper "More SPASS with Isabelle".

5364 - Made it try "smt" as a fallback if "metis" fails or times out.

5365 - Added support for the following provers: Alt-Ergo (via Why3 and

5366 TFF1), iProver, iProver-Eq.

5367 - Sped up the minimizer.

5368 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

5369 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

5370 - Renamed "sound" option to "strict".

5372 * Metis: Added possibility to specify lambda translations scheme as a

5373 parenthesized argument (e.g., "by (metis (lifting) ...)").

5375 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

5377 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

5379 * New "case_product" attribute to generate a case rule doing multiple

5380 case distinctions at the same time. E.g.

5382 list.exhaust [case_product nat.exhaust]

5384 produces a rule which can be used to perform case distinction on both

5385 a list and a nat.

5387 * New "eventually_elim" method as a generalized variant of the

5388 eventually_elim* rules. Supports structured proofs.

5390 * Typedef with implicit set definition is considered legacy. Use

5391 "typedef (open)" form instead, which will eventually become the

5392 default.

5394 * Record: code generation can be switched off manually with

5396 declare [[record_coden = false]] -- "default true"

5398 * Datatype: type parameters allow explicit sort constraints.

5400 * Concrete syntax for case expressions includes constraints for source

5401 positions, and thus produces Prover IDE markup for its bindings.

5402 INCOMPATIBILITY for old-style syntax translations that augment the

5403 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of

5404 one_case.

5406 * Clarified attribute "mono_set": pure declaration without modifying

5407 the result of the fact expression.

5409 * More default pred/set conversions on a couple of relation operations

5410 and predicates. Added powers of predicate relations. Consolidation

5411 of some relation theorems:

5413 converse_def ~> converse_unfold

5414 rel_comp_def ~> relcomp_unfold

5415 symp_def ~> (modified, use symp_def and sym_def instead)

5416 transp_def ~> transp_trans

5417 Domain_def ~> Domain_unfold

5418 Range_def ~> Domain_converse [symmetric]

5420 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

5422 See theory "Relation" for examples for making use of pred/set

5423 conversions by means of attributes "to_set" and "to_pred".

5425 INCOMPATIBILITY.

5427 * Renamed facts about the power operation on relations, i.e., relpow

5428 to match the constant's name:

5430 rel_pow_1 ~> relpow_1

5431 rel_pow_0_I ~> relpow_0_I

5432 rel_pow_Suc_I ~> relpow_Suc_I

5433 rel_pow_Suc_I2 ~> relpow_Suc_I2

5434 rel_pow_0_E ~> relpow_0_E

5435 rel_pow_Suc_E ~> relpow_Suc_E

5436 rel_pow_E ~> relpow_E

5437 rel_pow_Suc_D2 ~> relpow_Suc_D2

5438 rel_pow_Suc_E2 ~> relpow_Suc_E2

5439 rel_pow_Suc_D2' ~> relpow_Suc_D2'

5440 rel_pow_E2 ~> relpow_E2

5441 rel_pow_add ~> relpow_add

5442 rel_pow_commute ~> relpow

5443 rel_pow_empty ~> relpow_empty:

5444 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

5445 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

5446 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

5447 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

5448 rel_pow_fun_conv ~> relpow_fun_conv

5449 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

5450 rel_pow_finite_bounded ~> relpow_finite_bounded

5451 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

5452 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

5453 single_valued_rel_pow ~> single_valued_relpow

5455 INCOMPATIBILITY.

5457 * Theory Relation: Consolidated constant name for relation composition

5458 and corresponding theorem names:

5460 - Renamed constant rel_comp to relcomp.

5462 - Dropped abbreviation pred_comp. Use relcompp instead.

5464 - Renamed theorems:

5466 rel_compI ~> relcompI

5467 rel_compEpair ~> relcompEpair

5468 rel_compE ~> relcompE

5469 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

5470 rel_comp_empty1 ~> relcomp_empty1

5471 rel_comp_mono ~> relcomp_mono

5472 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

5473 rel_comp_distrib ~> relcomp_distrib

5474 rel_comp_distrib2 ~> relcomp_distrib2

5475 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

5476 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

5477 single_valued_rel_comp ~> single_valued_relcomp

5478 rel_comp_def ~> relcomp_unfold

5479 converse_rel_comp ~> converse_relcomp

5480 pred_compI ~> relcomppI

5481 pred_compE ~> relcomppE

5482 pred_comp_bot1 ~> relcompp_bot1

5483 pred_comp_bot2 ~> relcompp_bot2

5484 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

5485 pred_comp_mono ~> relcompp_mono

5486 pred_comp_distrib ~> relcompp_distrib

5487 pred_comp_distrib2 ~> relcompp_distrib2

5488 converse_pred_comp ~> converse_relcompp

5490 finite_rel_comp ~> finite_relcomp

5492 set_rel_comp ~> set_relcomp

5494 INCOMPATIBILITY.

5496 * Theory Divides: Discontinued redundant theorems about div and mod.

5497 INCOMPATIBILITY, use the corresponding generic theorems instead.

5499 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

5500 zdiv_self ~> div_self

5501 zmod_self ~> mod_self

5502 zdiv_zero ~> div_0

5503 zmod_zero ~> mod_0

5504 zdiv_zmod_equality ~> div_mod_equality2

5505 zdiv_zmod_equality2 ~> div_mod_equality

5506 zmod_zdiv_trivial ~> mod_div_trivial

5507 zdiv_zminus_zminus ~> div_minus_minus

5508 zmod_zminus_zminus ~> mod_minus_minus

5509 zdiv_zminus2 ~> div_minus_right

5510 zmod_zminus2 ~> mod_minus_right

5511 zdiv_minus1_right ~> div_minus1_right

5512 zmod_minus1_right ~> mod_minus1_right

5513 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

5514 zmod_zmult1_eq ~> mod_mult_right_eq

5515 zpower_zmod ~> power_mod

5516 zdvd_zmod ~> dvd_mod

5517 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

5518 mod_mult_distrib ~> mult_mod_left

5519 mod_mult_distrib2 ~> mult_mod_right

5521 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

5522 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

5524 * Finite_Set.fold now qualified. INCOMPATIBILITY.

5526 * Consolidated theorem names concerning fold combinators:

5528 inf_INFI_fold_inf ~> inf_INF_fold_inf

5529 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

5530 INFI_fold_inf ~> INF_fold_inf

5531 SUPR_fold_sup ~> SUP_fold_sup

5532 union_set ~> union_set_fold

5533 minus_set ~> minus_set_fold

5534 INFI_set_fold ~> INF_set_fold

5535 SUPR_set_fold ~> SUP_set_fold

5536 INF_code ~> INF_set_foldr

5537 SUP_code ~> SUP_set_foldr

5538 foldr.simps ~> foldr.simps (in point-free formulation)

5539 foldr_fold_rev ~> foldr_conv_fold

5540 foldl_fold ~> foldl_conv_fold

5541 foldr_foldr ~> foldr_conv_foldl

5542 foldl_foldr ~> foldl_conv_foldr

5543 fold_set_remdups ~> fold_set_fold_remdups

5544 fold_set ~> fold_set_fold

5545 fold1_set ~> fold1_set_fold

5547 INCOMPATIBILITY.

5549 * Dropped rarely useful theorems concerning fold combinators:

5550 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

5551 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

5552 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

5553 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

5554 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

5555 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

5556 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"

5557 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be

5558 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by

5559 unfolding "foldr_conv_fold" and "foldl_conv_fold".

5561 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

5562 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

5563 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

5564 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

5565 lemmas over fold rather than foldr, or make use of lemmas

5566 fold_conv_foldr and fold_rev.

5568 * Congruence rules Option.map_cong and Option.bind_cong for recursion

5569 through option types.

5571 * "Transitive_Closure.ntrancl": bounded transitive closure on

5572 relations.

5574 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

5576 * Theory Int: Discontinued many legacy theorems specific to type int.

5577 INCOMPATIBILITY, use the corresponding generic theorems instead.

5579 zminus_zminus ~> minus_minus

5580 zminus_0 ~> minus_zero

5581 zminus_zadd_distrib ~> minus_add_distrib

5582 zadd_commute ~> add_commute

5583 zadd_assoc ~> add_assoc

5584 zadd_left_commute ~> add_left_commute

5585 zadd_ac ~> add_ac

5586 zmult_ac ~> mult_ac

5587 zadd_0 ~> add_0_left

5588 zadd_0_right ~> add_0_right

5589 zadd_zminus_inverse2 ~> left_minus

5590 zmult_zminus ~> mult_minus_left

5591 zmult_commute ~> mult_commute

5592 zmult_assoc ~> mult_assoc

5593 zadd_zmult_distrib ~> left_distrib

5594 zadd_zmult_distrib2 ~> right_distrib

5595 zdiff_zmult_distrib ~> left_diff_distrib

5596 zdiff_zmult_distrib2 ~> right_diff_distrib

5597 zmult_1 ~> mult_1_left

5598 zmult_1_right ~> mult_1_right

5599 zle_refl ~> order_refl

5600 zle_trans ~> order_trans

5601 zle_antisym ~> order_antisym

5602 zle_linear ~> linorder_linear

5603 zless_linear ~> linorder_less_linear

5604 zadd_left_mono ~> add_left_mono

5605 zadd_strict_right_mono ~> add_strict_right_mono

5606 zadd_zless_mono ~> add_less_le_mono

5607 int_0_less_1 ~> zero_less_one

5608 int_0_neq_1 ~> zero_neq_one

5609 zless_le ~> less_le

5610 zpower_zadd_distrib ~> power_add

5611 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

5612 zero_le_zpower_abs ~> zero_le_power_abs

5614 * Theory Deriv: Renamed

5616 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

5618 * Theory Library/Multiset: Improved code generation of multisets.

5620 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

5621 are expressed via type classes again. The special syntax

5622 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

5623 setsum_set, which is now subsumed by Big_Operators.setsum.

5624 INCOMPATIBILITY.

5626 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

5627 use theory HOL/Library/Nat_Bijection instead.

5629 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

5630 trees is now inside a type class context. Names of affected

5631 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for

5632 theories working directly with raw red-black trees, adapt the names as

5633 follows:

5635 Operations:

5636 bulkload -> rbt_bulkload

5637 del_from_left -> rbt_del_from_left

5638 del_from_right -> rbt_del_from_right

5639 del -> rbt_del

5640 delete -> rbt_delete

5641 ins -> rbt_ins

5642 insert -> rbt_insert

5643 insertw -> rbt_insert_with

5644 insert_with_key -> rbt_insert_with_key

5645 map_entry -> rbt_map_entry

5646 lookup -> rbt_lookup

5647 sorted -> rbt_sorted

5648 tree_greater -> rbt_greater

5649 tree_less -> rbt_less

5650 tree_less_symbol -> rbt_less_symbol

5651 union -> rbt_union

5652 union_with -> rbt_union_with

5653 union_with_key -> rbt_union_with_key

5655 Lemmas:

5656 balance_left_sorted -> balance_left_rbt_sorted

5657 balance_left_tree_greater -> balance_left_rbt_greater

5658 balance_left_tree_less -> balance_left_rbt_less

5659 balance_right_sorted -> balance_right_rbt_sorted

5660 balance_right_tree_greater -> balance_right_rbt_greater

5661 balance_right_tree_less -> balance_right_rbt_less

5662 balance_sorted -> balance_rbt_sorted

5663 balance_tree_greater -> balance_rbt_greater

5664 balance_tree_less -> balance_rbt_less

5665 bulkload_is_rbt -> rbt_bulkload_is_rbt

5666 combine_sorted -> combine_rbt_sorted

5667 combine_tree_greater -> combine_rbt_greater

5668 combine_tree_less -> combine_rbt_less

5669 delete_in_tree -> rbt_delete_in_tree

5670 delete_is_rbt -> rbt_delete_is_rbt

5671 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

5672 del_from_left_tree_less -> rbt_del_from_left_rbt_less

5673 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

5674 del_from_right_tree_less -> rbt_del_from_right_rbt_less

5675 del_in_tree -> rbt_del_in_tree

5676 del_inv1_inv2 -> rbt_del_inv1_inv2

5677 del_sorted -> rbt_del_rbt_sorted

5678 del_tree_greater -> rbt_del_rbt_greater

5679 del_tree_less -> rbt_del_rbt_less

5680 dom_lookup_Branch -> dom_rbt_lookup_Branch

5681 entries_lookup -> entries_rbt_lookup

5682 finite_dom_lookup -> finite_dom_rbt_lookup

5683 insert_sorted -> rbt_insert_rbt_sorted

5684 insertw_is_rbt -> rbt_insertw_is_rbt

5685 insertwk_is_rbt -> rbt_insertwk_is_rbt

5686 insertwk_sorted -> rbt_insertwk_rbt_sorted

5687 insertw_sorted -> rbt_insertw_rbt_sorted

5688 ins_sorted -> ins_rbt_sorted

5689 ins_tree_greater -> ins_rbt_greater

5690 ins_tree_less -> ins_rbt_less

5691 is_rbt_sorted -> is_rbt_rbt_sorted

5692 lookup_balance -> rbt_lookup_balance

5693 lookup_bulkload -> rbt_lookup_rbt_bulkload

5694 lookup_delete -> rbt_lookup_rbt_delete

5695 lookup_Empty -> rbt_lookup_Empty

5696 lookup_from_in_tree -> rbt_lookup_from_in_tree

5697 lookup_in_tree -> rbt_lookup_in_tree

5698 lookup_ins -> rbt_lookup_ins

5699 lookup_insert -> rbt_lookup_rbt_insert

5700 lookup_insertw -> rbt_lookup_rbt_insertw

5701 lookup_insertwk -> rbt_lookup_rbt_insertwk

5702 lookup_keys -> rbt_lookup_keys

5703 lookup_map -> rbt_lookup_map

5704 lookup_map_entry -> rbt_lookup_rbt_map_entry

5705 lookup_tree_greater -> rbt_lookup_rbt_greater

5706 lookup_tree_less -> rbt_lookup_rbt_less

5707 lookup_union -> rbt_lookup_rbt_union

5708 map_entry_color_of -> rbt_map_entry_color_of

5709 map_entry_inv1 -> rbt_map_entry_inv1

5710 map_entry_inv2 -> rbt_map_entry_inv2

5711 map_entry_is_rbt -> rbt_map_entry_is_rbt

5712 map_entry_sorted -> rbt_map_entry_rbt_sorted

5713 map_entry_tree_greater -> rbt_map_entry_rbt_greater

5714 map_entry_tree_less -> rbt_map_entry_rbt_less

5715 map_tree_greater -> map_rbt_greater

5716 map_tree_less -> map_rbt_less

5717 map_sorted -> map_rbt_sorted

5718 paint_sorted -> paint_rbt_sorted

5719 paint_lookup -> paint_rbt_lookup

5720 paint_tree_greater -> paint_rbt_greater

5721 paint_tree_less -> paint_rbt_less

5722 sorted_entries -> rbt_sorted_entries

5723 tree_greater_eq_trans -> rbt_greater_eq_trans

5724 tree_greater_nit -> rbt_greater_nit

5725 tree_greater_prop -> rbt_greater_prop

5726 tree_greater_simps -> rbt_greater_simps

5727 tree_greater_trans -> rbt_greater_trans

5728 tree_less_eq_trans -> rbt_less_eq_trans

5729 tree_less_nit -> rbt_less_nit

5730 tree_less_prop -> rbt_less_prop

5731 tree_less_simps -> rbt_less_simps

5732 tree_less_trans -> rbt_less_trans

5733 tree_ord_props -> rbt_ord_props

5734 union_Branch -> rbt_union_Branch

5735 union_is_rbt -> rbt_union_is_rbt

5736 unionw_is_rbt -> rbt_unionw_is_rbt

5737 unionwk_is_rbt -> rbt_unionwk_is_rbt

5738 unionwk_sorted -> rbt_unionwk_rbt_sorted

5740 * Theory HOL/Library/Float: Floating point numbers are now defined as

5741 a subset of the real numbers. All operations are defined using the

5742 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

5744 Changed Operations:

5745 float_abs -> abs

5746 float_nprt -> nprt

5747 float_pprt -> pprt

5748 pow2 -> use powr

5749 round_down -> float_round_down

5750 round_up -> float_round_up

5751 scale -> exponent

5753 Removed Operations:

5754 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

5756 Renamed Lemmas:

5757 abs_float_def -> Float.compute_float_abs

5758 bitlen_ge0 -> bitlen_nonneg

5759 bitlen.simps -> Float.compute_bitlen

5760 float_components -> Float_mantissa_exponent

5761 float_divl.simps -> Float.compute_float_divl

5762 float_divr.simps -> Float.compute_float_divr

5763 float_eq_odd -> mult_powr_eq_mult_powr_iff

5764 float_power -> real_of_float_power

5765 lapprox_posrat_def -> Float.compute_lapprox_posrat

5766 lapprox_rat.simps -> Float.compute_lapprox_rat

5767 le_float_def' -> Float.compute_float_le

5768 le_float_def -> less_eq_float.rep_eq

5769 less_float_def' -> Float.compute_float_less

5770 less_float_def -> less_float.rep_eq

5771 normfloat_def -> Float.compute_normfloat

5772 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

5773 normfloat -> normfloat_def

5774 normfloat_unique -> use normfloat_def

5775 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

5776 one_float_def -> Float.compute_float_one

5777 plus_float_def -> Float.compute_float_plus

5778 rapprox_posrat_def -> Float.compute_rapprox_posrat

5779 rapprox_rat.simps -> Float.compute_rapprox_rat

5780 real_of_float_0 -> zero_float.rep_eq

5781 real_of_float_1 -> one_float.rep_eq

5782 real_of_float_abs -> abs_float.rep_eq

5783 real_of_float_add -> plus_float.rep_eq

5784 real_of_float_minus -> uminus_float.rep_eq

5785 real_of_float_mult -> times_float.rep_eq

5786 real_of_float_simp -> Float.rep_eq

5787 real_of_float_sub -> minus_float.rep_eq

5788 round_down.simps -> Float.compute_float_round_down

5789 round_up.simps -> Float.compute_float_round_up

5790 times_float_def -> Float.compute_float_times

5791 uminus_float_def -> Float.compute_float_uminus

5792 zero_float_def -> Float.compute_float_zero

5794 Lemmas not necessary anymore, use the transfer method:

5795 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

5796 float_divr, float_le_simp, float_less1_mantissa_bound,

5797 float_less_simp, float_less_zero, float_le_zero,

5798 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

5799 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

5800 lapprox_rat_bottom, normalized_float, rapprox_posrat,

5801 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

5802 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

5803 round_up, zero_le_float, zero_less_float

5805 * New theory HOL/Library/DAList provides an abstract type for

5806 association lists with distinct keys.

5808 * Session HOL/IMP: Added new theory of abstract interpretation of

5809 annotated commands.

5811 * Session HOL-Import: Re-implementation from scratch is faster,

5812 simpler, and more scalable. Requires a proof bundle, which is

5813 available as an external component. Discontinued old (and mostly

5814 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

5816 * Session HOL-Word: Discontinued many redundant theorems specific to

5817 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

5818 instead.

5820 word_sub_alt ~> word_sub_wi

5821 word_add_alt ~> word_add_def

5822 word_mult_alt ~> word_mult_def

5823 word_minus_alt ~> word_minus_def

5824 word_0_alt ~> word_0_wi

5825 word_1_alt ~> word_1_wi

5826 word_add_0 ~> add_0_left

5827 word_add_0_right ~> add_0_right

5828 word_mult_1 ~> mult_1_left

5829 word_mult_1_right ~> mult_1_right

5830 word_add_commute ~> add_commute

5831 word_add_assoc ~> add_assoc

5832 word_add_left_commute ~> add_left_commute

5833 word_mult_commute ~> mult_commute

5834 word_mult_assoc ~> mult_assoc

5835 word_mult_left_commute ~> mult_left_commute

5836 word_left_distrib ~> left_distrib

5837 word_right_distrib ~> right_distrib

5838 word_left_minus ~> left_minus

5839 word_diff_0_right ~> diff_0_right

5840 word_diff_self ~> diff_self

5841 word_sub_def ~> diff_minus

5842 word_diff_minus ~> diff_minus

5843 word_add_ac ~> add_ac

5844 word_mult_ac ~> mult_ac

5845 word_plus_ac0 ~> add_0_left add_0_right add_ac

5846 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

5847 word_order_trans ~> order_trans

5848 word_order_refl ~> order_refl

5849 word_order_antisym ~> order_antisym

5850 word_order_linear ~> linorder_linear

5851 lenw1_zero_neq_one ~> zero_neq_one

5852 word_number_of_eq ~> number_of_eq

5853 word_of_int_add_hom ~> wi_hom_add

5854 word_of_int_sub_hom ~> wi_hom_sub

5855 word_of_int_mult_hom ~> wi_hom_mult

5856 word_of_int_minus_hom ~> wi_hom_neg

5857 word_of_int_succ_hom ~> wi_hom_succ

5858 word_of_int_pred_hom ~> wi_hom_pred

5859 word_of_int_0_hom ~> word_0_wi

5860 word_of_int_1_hom ~> word_1_wi

5862 * Session HOL-Word: New proof method "word_bitwise" for splitting

5863 machine word equalities and inequalities into logical circuits,

5864 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

5865 multiplication, shifting by constants, bitwise operators and numeric

5866 constants. Requires fixed-length word types, not 'a word. Solves

5867 many standard word identities outright and converts more into first

5868 order problems amenable to blast or similar. See also examples in

5869 HOL/Word/Examples/WordExamples.thy.

5871 * Session HOL-Probability: Introduced the type "'a measure" to

5872 represent measures, this replaces the records 'a algebra and 'a

5873 measure_space. The locales based on subset_class now have two

5874 locale-parameters the space \<Omega> and the set of measurable sets M.

5875 The product of probability spaces uses now the same constant as the

5876 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

5877 measure". Most constants are defined now outside of locales and gain

5878 an additional parameter, like null_sets, almost_eventually or \<mu>'.

5879 Measure space constructions for distributions and densities now got

5880 their own constants distr and density. Instead of using locales to

5881 describe measure spaces with a finite space, the measure count_space

5882 and point_measure is introduced. INCOMPATIBILITY.

5884 Renamed constants:

5885 measure -> emeasure

5886 finite_measure.\<mu>' -> measure

5887 product_algebra_generator -> prod_algebra

5888 product_prob_space.emb -> prod_emb

5889 product_prob_space.infprod_algebra -> PiM

5891 Removed locales:

5892 completeable_measure_space

5893 finite_measure_space

5894 finite_prob_space

5895 finite_product_finite_prob_space

5896 finite_product_sigma_algebra

5897 finite_sigma_algebra

5898 measure_space

5899 pair_finite_prob_space

5900 pair_finite_sigma_algebra

5901 pair_finite_space

5902 pair_sigma_algebra

5903 product_sigma_algebra

5905 Removed constants:

5906 conditional_space

5907 distribution -> use distr measure, or distributed predicate

5908 image_space

5909 joint_distribution -> use distr measure, or distributed predicate

5910 pair_measure_generator

5911 product_prob_space.infprod_algebra -> use PiM

5912 subvimage

5914 Replacement theorems:

5915 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

5916 finite_measure.empty_measure -> measure_empty

5917 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

5918 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

5919 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

5920 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

5921 finite_measure.finite_measure -> finite_measure.emeasure_finite

5922 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

5923 finite_measure.positive_measure' -> measure_nonneg

5924 finite_measure.real_measure -> finite_measure.emeasure_real

5925 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

5926 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

5927 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

5928 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

5929 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

5930 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

5931 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

5932 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

5933 information_space.entropy_commute -> information_space.entropy_commute_simple

5934 information_space.entropy_eq -> information_space.entropy_simple_distributed

5935 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

5936 information_space.entropy_positive -> information_space.entropy_nonneg_simple

5937 information_space.entropy_uniform_max -> information_space.entropy_uniform

5938 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

5939 information_space.KL_eq_0 -> information_space.KL_same_eq_0

5940 information_space.KL_ge_0 -> information_space.KL_nonneg

5941 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

5942 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

5943 Int_stable_cuboids -> Int_stable_atLeastAtMost

5944 Int_stable_product_algebra_generator -> positive_integral

5945 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

5946 measure_space.additive -> emeasure_additive

5947 measure_space.AE_iff_null_set -> AE_iff_null

5948 measure_space.almost_everywhere_def -> eventually_ae_filter

5949 measure_space.almost_everywhere_vimage -> AE_distrD

5950 measure_space.continuity_from_above -> INF_emeasure_decseq

5951 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

5952 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

5953 measure_space.continuity_from_below -> SUP_emeasure_incseq

5954 measure_space_density -> emeasure_density

5955 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

5956 measure_space.integrable_vimage -> integrable_distr

5957 measure_space.integral_translated_density -> integral_density

5958 measure_space.integral_vimage -> integral_distr

5959 measure_space.measure_additive -> plus_emeasure

5960 measure_space.measure_compl -> emeasure_compl

5961 measure_space.measure_countable_increasing -> emeasure_countable_increasing

5962 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

5963 measure_space.measure_decseq -> decseq_emeasure

5964 measure_space.measure_Diff -> emeasure_Diff

5965 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

5966 measure_space.measure_eq_0 -> emeasure_eq_0

5967 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

5968 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

5969 measure_space.measure_incseq -> incseq_emeasure

5970 measure_space.measure_insert -> emeasure_insert

5971 measure_space.measure_mono -> emeasure_mono

5972 measure_space.measure_not_negative -> emeasure_not_MInf

5973 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

5974 measure_space.measure_setsum -> setsum_emeasure

5975 measure_space.measure_setsum_split -> setsum_emeasure_cover

5976 measure_space.measure_space_vimage -> emeasure_distr

5977 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

5978 measure_space.measure_subadditive -> subadditive

5979 measure_space.measure_top -> emeasure_space

5980 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

5981 measure_space.measure_Un_null_set -> emeasure_Un_null_set

5982 measure_space.positive_integral_translated_density -> positive_integral_density

5983 measure_space.positive_integral_vimage -> positive_integral_distr

5984 measure_space.real_continuity_from_above -> Lim_measure_decseq

5985 measure_space.real_continuity_from_below -> Lim_measure_incseq

5986 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

5987 measure_space.real_measure_Diff -> measure_Diff

5988 measure_space.real_measure_finite_Union -> measure_finite_Union

5989 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

5990 measure_space.real_measure_subadditive -> measure_subadditive

5991 measure_space.real_measure_Union -> measure_Union

5992 measure_space.real_measure_UNION -> measure_UNION

5993 measure_space.simple_function_vimage -> simple_function_comp

5994 measure_space.simple_integral_vimage -> simple_integral_distr

5995 measure_space.simple_integral_vimage -> simple_integral_distr

5996 measure_unique_Int_stable -> measure_eqI_generator_eq

5997 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

5998 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

5999 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

6000 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

6001 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

6002 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

6003 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

6004 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

6005 pair_sigma_algebra.sets_swap -> sets_pair_swap

6006 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

6007 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

6008 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

6009 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

6010 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

6011 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

6012 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

6013 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

6014 prob_space.measure_space_1 -> prob_space.emeasure_space_1

6015 prob_space.prob_space_vimage -> prob_space_distr

6016 prob_space.random_variable_restrict -> measurable_restrict

6017 prob_space_unique_Int_stable -> measure_eqI_prob_space

6018 product_algebraE -> prod_algebraE_all

6019 product_algebra_generator_der -> prod_algebra_eq_finite

6020 product_algebra_generator_into_space -> prod_algebra_sets_into_space

6021 product_algebraI -> sets_PiM_I_finite

6022 product_measure_exists -> product_sigma_finite.sigma_finite

6023 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

6024 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

6025 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

6026 product_prob_space.measurable_component -> measurable_component_singleton

6027 product_prob_space.measurable_emb -> measurable_prod_emb

6028 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

6029 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

6030 product_prob_space.measure_emb -> emeasure_prod_emb

6031 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

6032 product_sigma_algebra.product_algebra_into_space -> space_closed

6033 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

6034 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

6035 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

6036 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

6037 sets_product_algebra -> sets_PiM

6038 sigma_algebra.measurable_sigma -> measurable_measure_of

6039 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

6040 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

6041 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

6042 space_product_algebra -> space_PiM

6044 * Session HOL-TPTP: support to parse and import TPTP problems (all

6045 languages) into Isabelle/HOL.

6048 *** FOL ***

6050 * New "case_product" attribute (see HOL).

6053 *** ZF ***

6055 * Greater support for structured proofs involving induction or case

6056 analysis.

6058 * Much greater use of mathematical symbols.

6060 * Removal of many ML theorem bindings. INCOMPATIBILITY.

6063 *** ML ***

6065 * Antiquotation @{keyword "name"} produces a parser for outer syntax

6066 from a minor keyword introduced via theory header declaration.

6068 * Antiquotation @{command_spec "name"} produces the

6069 Outer_Syntax.command_spec from a major keyword introduced via theory

6070 header declaration; it can be passed to Outer_Syntax.command etc.

6072 * Local_Theory.define no longer hard-wires default theorem name

6073 "foo_def", but retains the binding as given. If that is Binding.empty

6074 / Attrib.empty_binding, the result is not registered as user-level

6075 fact. The Local_Theory.define_internal variant allows to specify a

6076 non-empty name (used for the foundation in the background theory),

6077 while omitting the fact binding in the user-context. Potential

6078 INCOMPATIBILITY for derived definitional packages: need to specify

6079 naming policy for primitive definitions more explicitly.

6081 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

6082 conformance with similar operations in structure Term and Logic.

6084 * Antiquotation @{attributes [...]} embeds attribute source

6085 representation into the ML text, which is particularly useful with

6086 declarations like Local_Theory.note.

6088 * Structure Proof_Context follows standard naming scheme. Old

6089 ProofContext has been discontinued. INCOMPATIBILITY.

6091 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

6092 change of semantics: update is applied to auxiliary local theory

6093 context as well.

6095 * Modernized some old-style infix operations:

6097 addeqcongs ~> Simplifier.add_eqcong

6098 deleqcongs ~> Simplifier.del_eqcong

6099 addcongs ~> Simplifier.add_cong

6100 delcongs ~> Simplifier.del_cong

6101 setmksimps ~> Simplifier.set_mksimps

6102 setmkcong ~> Simplifier.set_mkcong

6103 setmksym ~> Simplifier.set_mksym

6104 setmkeqTrue ~> Simplifier.set_mkeqTrue

6105 settermless ~> Simplifier.set_termless

6106 setsubgoaler ~> Simplifier.set_subgoaler

6107 addsplits ~> Splitter.add_split

6108 delsplits ~> Splitter.del_split

6111 *** System ***

6113 * USER_HOME settings variable points to cross-platform user home

6114 directory, which coincides with HOME on POSIX systems only. Likewise,

6115 the Isabelle path specification "~" now expands to $USER_HOME, instead

6116 of former $HOME. A different default for USER_HOME may be set

6117 explicitly in shell environment, before Isabelle settings are

6118 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

6119 the generic user home was intended.

6121 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

6122 notation, which is useful for the jEdit file browser, for example.

6124 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

6125 (not just JRE).

6129 New in Isabelle2011-1 (October 2011)

6130 ------------------------------------

6132 *** General ***

6134 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

6135 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

6137 - Management of multiple theory files directly from the editor

6138 buffer store -- bypassing the file-system (no requirement to save

6139 files for checking).

6141 - Markup of formal entities within the text buffer, with semantic

6142 highlighting, tooltips and hyperlinks to jump to defining source

6143 positions.

6145 - Improved text rendering, with sub/superscripts in the source

6146 buffer (including support for copy/paste wrt. output panel, HTML

6147 theory output and other non-Isabelle text boxes).

6149 - Refined scheduling of proof checking and printing of results,

6150 based on interactive editor view. (Note: jEdit folding and

6151 narrowing allows to restrict buffer perspectives explicitly.)

6153 - Reduced CPU performance requirements, usable on machines with few

6154 cores.

6156 - Reduced memory requirements due to pruning of unused document

6157 versions (garbage collection).

6159 See also ~~/src/Tools/jEdit/README.html for further information,

6160 including some remaining limitations.

6162 * Theory loader: source files are exclusively located via the master

6163 directory of each theory node (where the .thy file itself resides).

6164 The global load path (such as src/HOL/Library) has been discontinued.

6165 Note that the path element ~~ may be used to reference theories in the

6166 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".

6167 INCOMPATIBILITY.

6169 * Theory loader: source files are identified by content via SHA1

6170 digests. Discontinued former path/modtime identification and optional

6171 ISABELLE_FILE_IDENT plugin scripts.

6173 * Parallelization of nested Isar proofs is subject to

6174 Goal.parallel_proofs_threshold (default 100). See also isabelle

6175 usedir option -Q.

6177 * Name space: former unsynchronized references are now proper

6178 configuration options, with more conventional names:

6180 long_names ~> names_long

6181 short_names ~> names_short

6182 unique_names ~> names_unique

6184 Minor INCOMPATIBILITY, need to declare options in context like this:

6186 declare [[names_unique = false]]

6188 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note

6189 that the result needs to be unique, which means fact specifications

6190 may have to be refined after enriching a proof context.

6192 * Attribute "case_names" has been refined: the assumptions in each case

6193 can be named now by following the case name with [name1 name2 ...].

6195 * Isabelle/Isar reference manual has been updated and extended:

6196 - "Synopsis" provides a catalog of main Isar language concepts.

6197 - Formal references in syntax diagrams, via @{rail} antiquotation.

6198 - Updated material from classic "ref" manual, notably about

6199 "Classical Reasoner".

6202 *** HOL ***

6204 * Class bot and top require underlying partial order rather than

6205 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.

6207 * Class complete_lattice: generalized a couple of lemmas from sets;

6208 generalized theorems INF_cong and SUP_cong. New type classes for

6209 complete boolean algebras and complete linear orders. Lemmas

6210 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in

6211 class complete_linorder.

6213 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,

6214 Sup_fun_def, Inf_apply, Sup_apply.

6216 Removed redundant lemmas (the right hand side gives hints how to

6217 replace them for (metis ...), or (simp only: ...) proofs):

6219 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]

6220 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]

6221 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right

6222 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right

6223 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right

6224 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right

6225 Inter_def ~> INF_def, image_def

6226 Union_def ~> SUP_def, image_def

6227 INT_eq ~> INF_def, and image_def

6228 UN_eq ~> SUP_def, and image_def

6229 INF_subset ~> INF_superset_mono [OF _ order_refl]

6231 More consistent and comprehensive names:

6233 INTER_eq_Inter_image ~> INF_def

6234 UNION_eq_Union_image ~> SUP_def

6235 INFI_def ~> INF_def

6236 SUPR_def ~> SUP_def

6237 INF_leI ~> INF_lower

6238 INF_leI2 ~> INF_lower2

6239 le_INFI ~> INF_greatest

6240 le_SUPI ~> SUP_upper

6241 le_SUPI2 ~> SUP_upper2

6242 SUP_leI ~> SUP_least

6243 INFI_bool_eq ~> INF_bool_eq

6244 SUPR_bool_eq ~> SUP_bool_eq

6245 INFI_apply ~> INF_apply

6246 SUPR_apply ~> SUP_apply

6247 INTER_def ~> INTER_eq

6248 UNION_def ~> UNION_eq

6250 INCOMPATIBILITY.

6252 * Renamed theory Complete_Lattice to Complete_Lattices.

6253 INCOMPATIBILITY.

6255 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,

6256 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,

6257 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,

6258 Sup_insert are now declared as [simp]. INCOMPATIBILITY.

6260 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,

6261 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,

6262 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor