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

NEWS

author | wenzelm |

Tue Jan 16 15:42:21 2018 +0100 (2018-01-16 ago) | |

changeset 67448 | dbb1f02e667d |

parent 67446 | 1f4d167b6ac9 |

child 67507 | 5db077cfe1b2 |

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

more documentation;

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 * Marginal comments need to be written exclusively in the new-style form

13 "\<comment> \<open>text\<close>", old ASCII variants like "-- {* ... *}" are no longer

14 supported. INCOMPATIBILITY, use the command-line tool "isabelle

15 update_comments" to update existing theory files.

17 * The "op <infix-op>" syntax for infix operators has been replaced by

18 "(<infix-op>)". If <infix-op> begins or ends with a "*", there needs to

19 be a space between the "*" and the corresponding parenthesis.

20 INCOMPATIBILITY.

21 There is an Isabelle tool "update_op" that converts theory and ML files

22 to the new syntax. Because it is based on regular expression matching,

23 the result may need a bit of manual postprocessing. Invoking "isabelle

24 update_op" converts all files in the current directory (recursively).

25 In case you want to exclude conversion of ML files (because the tool

26 frequently also converts ML's "op" syntax), use option "-m".

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

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

30 object-logic equality or equivalence.

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

33 to refer to unqualified theories from the parent session.

34 INCOMPATIBILITY for old developments that have not been updated to

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

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

38 INCOMPATIBILITY.

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

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

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

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

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

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

47 without specific Prover IDE management.

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

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

51 context.

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

54 accessible ROOT file is processed only once. This facilitates

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

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

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

60 * The command 'display_drafts' has been discontinued. INCOMPATIBILITY,

61 use action "isabelle.draft" (or "print") in Isabelle/jEdit instead.

63 * Isabelle symbol "\<hyphen>" is rendered as explicit Unicode hyphen U+2010, to

64 avoid unclear meaning of the old "soft hyphen" U+00AD. Rare

65 INCOMPATIBILITY, e.g. copy-paste of historic Isabelle HTML output.

68 *** Isabelle/jEdit Prover IDE ***

70 * System options "spell_checker_include" and "spell_checker_exclude"

71 supersede former "spell_checker_elements" to determine regions of text

72 that are subject to spell-checking. Minor INCOMPATIBILITY.

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

75 follow links to theories and document files etc.

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

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

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

81 for session selection:

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

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

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

85 - option -F focuses on the specified logic session

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

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

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

90 Examples:

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

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

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

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

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

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

98 arguments into this format.

100 * Completion provides templates for named symbols with arguments,

101 e.g. "\<comment> \<open>ARGUMENT\<close>" or "\<^emph>\<open>ARGUMENT\<close>".

103 * Bibtex database files (.bib) are semantically checked.

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

106 notably bibtex database files and ML files.

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

109 plain-text document draft.

111 * When loading text files, the Isabelle symbols encoding UTF-8-Isabelle

112 is only used if there is no conflict with existing Unicode sequences in

113 the file. Otherwise, the fallback encoding is plain UTF-8 and Isabelle

114 symbols remain in literal \<symbol> form. This avoids accidental loss of

115 Unicode content when saving the file.

118 *** Isabelle/VSCode Prover IDE ***

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

121 Isabelle/jEdit.

124 *** Document preparation ***

126 * Formal comments work uniformly in outer syntax, inner syntax (term

127 language), Isabelle/ML and some other embedded languages of Isabelle.

128 See also "Document comments" in the isar-ref manual. The following forms

129 are supported:

131 - marginal text comment: \<comment> \<open>\<dots>\<close>

132 - canceled source: \<^cancel>\<open>\<dots>\<close>

133 - raw LaTeX: \<^latex>\<open>\<dots>\<close>

135 * Embedded languages such as inner syntax and ML may contain formal

136 comments of the form "\<comment> \<open>text\<close>". As in marginal comments of outer

137 syntax, antiquotations are interpreted wrt. the presentation context of

138 the enclosing command.

140 * Outside of the inner theory body, the default presentation context is

141 theory Pure. Thus elementary antiquotations may be used in markup

142 commands (e.g. 'chapter', 'section', 'text') and formal comments.

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

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

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

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

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

150 of option "document_tags" to these commands.

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

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

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

155 \isactrlconstUNDERSCOREname.

157 * Document antiquotation @{cite} now checks the given Bibtex entries

158 against the Bibtex database files -- only in batch-mode session builds.

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

161 session name verbatim.

163 * Document preparation with skip_proofs option now preserves the content

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

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

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

168 latex and bibtex process. Minor INCOMPATIBILITY.

171 *** HOL ***

173 * A new command parametric_constant for proving parametricity of

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

175 the command will infer conditions on relations (e.g., bi_unique,

176 bi_total, or type class conditions such as "respects 0") sufficient for

177 parametricity. See ~~/src/HOL/ex/Conditional_Parametricity_Examples for

178 some examples.

180 * SMT module:

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

182 with a solver other than Z3. INCOMPATIBILITY.

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

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

185 option has been added to control this. INCOMPATIBILITY.

187 * Datatypes:

188 - The legacy command 'old_datatype', provided by

189 '~~/src/HOL/Library/Old_Datatype.thy', has been removed. INCOMPATIBILITY.

191 * Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide

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

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

194 INCOMPATIBILITY.

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

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

198 INCOMPATIBILITY.

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

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

202 interpretation of abstract locales. INCOMPATIBILITY.

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

205 INCOMPATIBILITY.

207 * HOL-Algebra: renamed (^) to [^]

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

210 theorem.

212 * Class linordered_semiring_1 covers zero_less_one also, ruling out

213 pathologic instances. Minor INCOMPATIBILITY.

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

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

218 abbreviation. INCOMPATIBILITY.

220 * Code generation: Code generation takes an explicit option

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

224 *** System ***

226 * The command-line tool "isabelle update_comments" normalizes formal

227 comments in outer syntax as follows: \<comment> \<open>text\<close> (whith a single space to

228 approximate the appearance in document output). This is more specific

229 than former "isabelle update_cartouches -c": the latter tool option has

230 been discontinued.

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

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

234 anymore.

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

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

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

240 repository for the generated session files.

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

243 support has been discontinued.

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

246 longer supported.

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

249 been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,

250 instead of former 32/64 variants. INCOMPATIBILITY.

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

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

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

255 - option -f: forces a fresh build

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

258 corresponding environment values into account, when determining the

259 up-to-date status of a session.

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

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

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

265 PIDE markup for identifier bindings.

267 * ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific

268 options for improved error reporting. Potential INCOMPATIBILITY with

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

273 New in Isabelle2017 (October 2017)

274 ----------------------------------

276 *** General ***

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

279 Isabelle/PIDE front-end, see also

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

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

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

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

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

286 Technically, VSCode is based on the Electron application framework

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

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

289 modules around a Language Server implementation.

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

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

293 just the theory base name as before).

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

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

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

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

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

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

301 imports" helps to update theory imports.

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

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

305 leads to the follow renamings:

307 CTT/Main.thy ~> CTT/CTT.thy

308 ZF/Main.thy ~> ZF/ZF.thy

309 ZF/Main_ZF.thy ~> ZF/ZF.thy

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

311 ZF/ZF.thy ~> ZF/ZF_Base.thy

313 INCOMPATIBILITY.

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

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

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

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

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

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

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

324 antiquotations:

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

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

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

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

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

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

333 src/HOL/Decision_Procs/Commutative_Ring.thy and

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

335 tutorial on code generation.

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

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

341 arbitrary theory hierarchies independently of the underlying logic

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

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

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

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

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

348 changes of formal document content. Theory dependencies are always

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

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

351 effectively always enabled.

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

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

355 buffers.

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

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

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

360 represented by a different border color.

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

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

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

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

367 document in the default web browser.

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

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

371 used for formal checking.

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

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

375 enabled at all times.

377 * Update to current jedit-5.4.0.

380 *** Pure ***

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

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

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

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

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

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

389 ignored with warnings if syntactically malformed.

390 - Explicitly global code declarations yield errors if syntactically

391 malformed.

392 - Default code declarations are silently ignored if syntactically

393 malformed.

394 Minor INCOMPATIBILITY.

396 * Clarified and standardized internal data bookkeeping of code

397 declarations: history of serials allows to track potentially

398 non-monotonous declarations appropriately. Minor INCOMPATIBILITY.

401 *** HOL ***

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

405 * SMT module:

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

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

408 disabled by default.

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

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

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

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

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

415 INCOMPATIBILITY.

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

418 terms without free variables are always evaluated using plain evaluation

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

420 INCOMPATIBILITY.

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

423 of "Complex_Main").

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

426 Minor INCOMPATIBILITY.

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

429 INCOMPATIBILITY.

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

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

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

435 transp, antisymp, single_valuedp instead. INCOMPATIBILITY.

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

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

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

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

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

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

446 * Named theorems mod_simps covers various congruence rules concerning

447 mod, replacing former zmod_simps. INCOMPATIBILITY.

449 * Swapped orientation of congruence rules mod_add_left_eq,

450 mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,

451 mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,

452 mod_diff_eq. INCOMPATIBILITY.

454 * Generalized some facts:

455 measure_induct_rule

456 measure_induct

457 zminus_zmod ~> mod_minus_eq

458 zdiff_zmod_left ~> mod_diff_left_eq

459 zdiff_zmod_right ~> mod_diff_right_eq

460 zmod_eq_dvd_iff ~> mod_eq_dvd_iff

461 INCOMPATIBILITY.

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

464 euclidean_(semi)ring, euclidean_(semi)ring_cancel,

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

466 euclidean size.

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

469 - Euclidean induction is available as rule eucl_induct.

470 - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,

471 Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow

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

473 - Coefficients obtained by extended euclidean algorithm are

474 available as "bezout_coefficients".

475 INCOMPATIBILITY.

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

478 totient function previously hidden as solitary example in theory

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

480 the literature. Minor INCOMPATIBILITY.

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

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

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

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

487 been renamed to bij_swap_compose_bij. INCOMPATIBILITY.

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

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

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

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

494 space. INCOMPATIBILITY.

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

497 INCOMPATIBILITY.

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

500 replacement syntax has been removed. INCOMPATIBILITY, standard syntax

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

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

504 syntax (ASCII)

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

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

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

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

510 multisets have been renamed:

512 msetless_cancel_numerals ~> msetsubset_cancel

513 msetle_cancel_numerals ~> msetsubset_eq_cancel

515 INCOMPATIBILITY.

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

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

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

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

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

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

525 Curve Theorem and the Great Picard Theorem.

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

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

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

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

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

534 theories, notably Euclidean_Algorithm, Factorial_Ring,

535 Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,

536 Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor

537 INCOMPATIBILITY.

540 *** System ***

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

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

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

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

547 "Application File Format" in the sense of

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

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

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

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

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

554 builds (according to parallel_subproofs_threshold).

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

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

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

559 unchanged.

561 * Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been

562 renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.

564 * Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,

565 ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the

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

567 is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,

568 ISABELLE_PLATFORM64.

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

571 the Isabelle application bundle for Linux. See also

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

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

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

576 serves as example for alternative PIDE front-ends.

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

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

581 isabelle imports -I -a

582 isabelle imports -U -a

583 isabelle imports -U -i -a

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

588 New in Isabelle2016-1 (December 2016)

589 -------------------------------------

591 *** General ***

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

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

595 INCOMPATIBILITY.

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

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

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

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

600 result the subgoal may be split into several subgoals.

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

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

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

606 bundle foo

607 begin

608 declare a [simp]

609 declare b [intro]

610 end

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

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

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

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

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

618 discontinued.

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

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

622 quotes when sub-languages are nested.

624 * Mixfix annotations support general block properties, with syntax

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

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

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

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

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

631 statements without object-logic judgment.

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

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

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

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

638 examples.

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

641 instances) are generated into companion object of corresponding type

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

644 * Solve direct: option "solve_direct_strict_warnings" gives explicit

645 warnings for lemma statements with trivial proofs.

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

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

651 system option editor_generated_input_delay (in addition to existing

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

653 reactivity and CPU usage.

655 * Syntactic indentation according to Isabelle outer syntax. Action

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

657 command keywords and some command substructure. Action

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

659 according to command keywords only; see also option

660 "jedit_indent_newline".

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

663 number of subgoals. This requires information of ongoing document

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

665 quickly; see also option "jedit_script_indent" and

666 "jedit_script_indent_limit".

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

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

670 structure of theory specifications is treated as well.

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

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

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

676 e.g. 'context', 'notepad'.

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

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

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

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

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

685 systematic renaming.

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

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

689 theorem statement.

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

692 situations where old ASCII notation may be updated.

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

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

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

697 inaccessible via keyboard completion).

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

700 following independent stages:

702 src/Pure/ROOT0.ML

703 src/Pure/ROOT.ML

704 src/Pure/Pure.thy

705 src/Pure/ML_Bootstrap.thy

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

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

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

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

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

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

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

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

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

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

719 * Additional abbreviations for syntactic completion may be specified

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

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

722 new 'abbrevs' section.

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

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

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

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

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

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

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

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

733 old keymaps.

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

736 and diverse:

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

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

740 @{dir NAME} -- check for directory

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

743 have to be changed.

746 *** Document preparation ***

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

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

751 existing antiquotation @{class}.

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

754 this allows special forms of document output.

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

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

758 derivatives.

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

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

763 Isabelle2015).

766 *** Isar ***

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

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

770 'definition', 'inductive', 'function'.

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

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

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

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

776 context: INCOMPATIBILITY.

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

779 optional abstraction over local parameters. The syntax resembles

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

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

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

784 context.

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

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

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

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

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

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

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

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

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

798 INCOMPATIBILITY.

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

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

802 definitions.

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

805 expression, e.g.

807 (use facts in simp)

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

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

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

814 *** Pure ***

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

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

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

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

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

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

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

824 regardless of the actual parameters that are provided. Rare

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

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

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

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

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

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

832 INCOMPATIBILITY, need to provide explicit type constraints for Pure

833 types where this is really intended.

836 *** HOL ***

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

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

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

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

842 quantifier-free propositional logic with linear real arithmetic

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

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

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

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

849 break existing proofs. INCOMPATIBILITY.

851 * Sledgehammer:

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

853 - Produce syntactically correct Vampire 4.0 problem files.

855 * (Co)datatype package:

856 - New commands for defining corecursive functions and reasoning about

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

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

859 method. See 'isabelle doc corec'.

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

861 citizen in bounded natural functors.

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

863 to the map function.

864 - 'bnf' automatically discharges reflexive proof obligations.

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

866 terms of map and set

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

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

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

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

871 - Renamed lemmas:

872 rel_prod_apply ~> rel_prod_inject

873 pred_prod_apply ~> pred_prod_inject

874 INCOMPATIBILITY.

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

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

877 equivalent) form.

878 INCOMPATIBILITY.

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

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

882 which exposed details of the internal fixpoint construction and was

883 hard to use. INCOMPATIBILITY.

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

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

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

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

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

892 eliminated altogether.

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

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

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

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

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

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

900 INCOMPATIBILITY in rare situations.

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

903 INCOMPATIBILITY.

905 * Renamed constants and corresponding theorems:

907 setsum ~> sum

908 setprod ~> prod

909 listsum ~> sum_list

910 listprod ~> prod_list

912 INCOMPATIBILITY.

914 * Sligthly more standardized theorem names:

915 sgn_times ~> sgn_mult

916 sgn_mult' ~> Real_Vector_Spaces.sgn_mult

917 divide_zero_left ~> div_0

918 zero_mod_left ~> mod_0

919 divide_zero ~> div_by_0

920 divide_1 ~> div_by_1

921 nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left

922 div_mult_self1_is_id ~> nonzero_mult_div_cancel_left

923 nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right

924 div_mult_self2_is_id ~> nonzero_mult_div_cancel_right

925 is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left

926 is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right

927 mod_div_equality ~> div_mult_mod_eq

928 mod_div_equality2 ~> mult_div_mod_eq

929 mod_div_equality3 ~> mod_div_mult_eq

930 mod_div_equality4 ~> mod_mult_div_eq

931 minus_div_eq_mod ~> minus_div_mult_eq_mod

932 minus_div_eq_mod2 ~> minus_mult_div_eq_mod

933 minus_mod_eq_div ~> minus_mod_eq_div_mult

934 minus_mod_eq_div2 ~> minus_mod_eq_mult_div

935 div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]

936 mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]

937 zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]

938 zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]

939 Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

940 mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

941 zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

942 div_1 ~> div_by_Suc_0

943 mod_1 ~> mod_by_Suc_0

944 INCOMPATIBILITY.

946 * New type class "idom_abs_sgn" specifies algebraic properties

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

948 disappeared. Slight INCOMPATIBILITY.

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

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

953 corresponding to {0..255}.

955 - Logical representation:

956 * 0 is instantiated to the ASCII zero character.

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

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

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

960 are non-canonical.

961 - Printing and parsing:

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

963 (as before).

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

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

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

967 is parsable for every numeral expression n.

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

969 printed as their logical representation.

970 - Explicit conversions from and to the natural numbers are

971 provided as char_of_nat, nat_of_char (as before).

972 - The auxiliary nibble type has been discontinued.

974 INCOMPATIBILITY.

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

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

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

979 infix "mod" syntax. INCOMPATIBILITY.

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

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

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

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

985 easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.

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

988 equation in term output. Minor INCOMPATIBILITY.

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

991 which renders those abstract effectively.

993 * Command 'export_code' checks given constants for abstraction

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

995 interface for the generated code.

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

998 spelt out explicitly.

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

1001 explicitly provided auxiliary definitions for required type class

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

1003 tutorial on code generation for details.

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

1006 products.

1008 * Locale bijection establishes convenient default simp rules such as

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

1011 * Abstract locales semigroup, abel_semigroup, semilattice,

1012 semilattice_neutr, ordering, ordering_top, semilattice_order,

1013 semilattice_neutr_order, comm_monoid_set, semilattice_set,

1014 semilattice_neutr_set, semilattice_order_set,

1015 semilattice_order_neutr_set monoid_list, comm_monoid_list,

1016 comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified

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

1018 INCOMPATIBILITY.

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

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

1022 lifting_syntax begin ... end". Minor INCOMPATIBILITY.

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

1025 INCOMPATIBILITY.

1027 nat_less_cases -- removed, use linorder_cases instead

1028 inv_image_comp -- removed, use image_inv_f_f instead

1029 image_surj_f_inv_f ~> image_f_inv_f

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

1032 groups to semi-groups that are also monoids:

1033 le_add_same_cancel1

1034 le_add_same_cancel2

1035 less_add_same_cancel1

1036 less_add_same_cancel2

1037 add_le_same_cancel1

1038 add_le_same_cancel2

1039 add_less_same_cancel1

1040 add_less_same_cancel2

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

1043 superseeded by a more general version:

1044 less_add_cancel_left_greater_zero ~> less_add_same_cancel1

1045 less_add_cancel_right_greater_zero ~> less_add_same_cancel2

1046 less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1

1047 less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2

1048 less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1

1049 less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2

1050 less_add_cancel_left_less_zero ~> add_less_same_cancel1

1051 less_add_cancel_right_less_zero ~> add_less_same_cancel2

1052 INCOMPATIBILITY.

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

1055 resemble the f.split naming convention, INCOMPATIBILITY.

1057 * Added class topological_monoid.

1059 * The following theorems have been renamed:

1061 setsum_left_distrib ~> sum_distrib_right

1062 setsum_right_distrib ~> sum_distrib_left

1064 INCOMPATIBILITY.

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

1067 INCOMPATIBILITY.

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

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

1071 A)".

1073 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.

1075 * The type class ordered_comm_monoid_add is now called

1076 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add

1077 is introduced as the combination of ordered_ab_semigroup_add +

1078 comm_monoid_add. INCOMPATIBILITY.

1080 * Introduced the type classes canonically_ordered_comm_monoid_add and

1081 dioid.

1083 * Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When

1084 instantiating linordered_semiring_strict and ordered_ab_group_add, an

1085 explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might

1086 be required. INCOMPATIBILITY.

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

1089 of a more general type also:

1090 lcm_left_commute_nat ~> lcm.left_commute

1091 lcm_left_commute_int ~> lcm.left_commute

1092 gcd_left_commute_nat ~> gcd.left_commute

1093 gcd_left_commute_int ~> gcd.left_commute

1094 gcd_greatest_iff_nat ~> gcd_greatest_iff

1095 gcd_greatest_iff_int ~> gcd_greatest_iff

1096 coprime_dvd_mult_nat ~> coprime_dvd_mult

1097 coprime_dvd_mult_int ~> coprime_dvd_mult

1098 zpower_numeral_even ~> power_numeral_even

1099 gcd_mult_cancel_nat ~> gcd_mult_cancel

1100 gcd_mult_cancel_int ~> gcd_mult_cancel

1101 div_gcd_coprime_nat ~> div_gcd_coprime

1102 div_gcd_coprime_int ~> div_gcd_coprime

1103 zpower_numeral_odd ~> power_numeral_odd

1104 zero_less_int_conv ~> of_nat_0_less_iff

1105 gcd_greatest_nat ~> gcd_greatest

1106 gcd_greatest_int ~> gcd_greatest

1107 coprime_mult_nat ~> coprime_mult

1108 coprime_mult_int ~> coprime_mult

1109 lcm_commute_nat ~> lcm.commute

1110 lcm_commute_int ~> lcm.commute

1111 int_less_0_conv ~> of_nat_less_0_iff

1112 gcd_commute_nat ~> gcd.commute

1113 gcd_commute_int ~> gcd.commute

1114 Gcd_insert_nat ~> Gcd_insert

1115 Gcd_insert_int ~> Gcd_insert

1116 of_int_int_eq ~> of_int_of_nat_eq

1117 lcm_least_nat ~> lcm_least

1118 lcm_least_int ~> lcm_least

1119 lcm_assoc_nat ~> lcm.assoc

1120 lcm_assoc_int ~> lcm.assoc

1121 int_le_0_conv ~> of_nat_le_0_iff

1122 int_eq_0_conv ~> of_nat_eq_0_iff

1123 Gcd_empty_nat ~> Gcd_empty

1124 Gcd_empty_int ~> Gcd_empty

1125 gcd_assoc_nat ~> gcd.assoc

1126 gcd_assoc_int ~> gcd.assoc

1127 zero_zle_int ~> of_nat_0_le_iff

1128 lcm_dvd2_nat ~> dvd_lcm2

1129 lcm_dvd2_int ~> dvd_lcm2

1130 lcm_dvd1_nat ~> dvd_lcm1

1131 lcm_dvd1_int ~> dvd_lcm1

1132 gcd_zero_nat ~> gcd_eq_0_iff

1133 gcd_zero_int ~> gcd_eq_0_iff

1134 gcd_dvd2_nat ~> gcd_dvd2

1135 gcd_dvd2_int ~> gcd_dvd2

1136 gcd_dvd1_nat ~> gcd_dvd1

1137 gcd_dvd1_int ~> gcd_dvd1

1138 int_numeral ~> of_nat_numeral

1139 lcm_ac_nat ~> ac_simps

1140 lcm_ac_int ~> ac_simps

1141 gcd_ac_nat ~> ac_simps

1142 gcd_ac_int ~> ac_simps

1143 abs_int_eq ~> abs_of_nat

1144 zless_int ~> of_nat_less_iff

1145 zdiff_int ~> of_nat_diff

1146 zadd_int ~> of_nat_add

1147 int_mult ~> of_nat_mult

1148 int_Suc ~> of_nat_Suc

1149 inj_int ~> inj_of_nat

1150 int_1 ~> of_nat_1

1151 int_0 ~> of_nat_0

1152 Lcm_empty_nat ~> Lcm_empty

1153 Lcm_empty_int ~> Lcm_empty

1154 Lcm_insert_nat ~> Lcm_insert

1155 Lcm_insert_int ~> Lcm_insert

1156 comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd

1157 comp_fun_idem_gcd_int ~> comp_fun_idem_gcd

1158 comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm

1159 comp_fun_idem_lcm_int ~> comp_fun_idem_lcm

1160 Lcm_eq_0 ~> Lcm_eq_0_I

1161 Lcm0_iff ~> Lcm_0_iff

1162 Lcm_dvd_int ~> Lcm_least

1163 divides_mult_nat ~> divides_mult

1164 divides_mult_int ~> divides_mult

1165 lcm_0_nat ~> lcm_0_right

1166 lcm_0_int ~> lcm_0_right

1167 lcm_0_left_nat ~> lcm_0_left

1168 lcm_0_left_int ~> lcm_0_left

1169 dvd_gcd_D1_nat ~> dvd_gcdD1

1170 dvd_gcd_D1_int ~> dvd_gcdD1

1171 dvd_gcd_D2_nat ~> dvd_gcdD2

1172 dvd_gcd_D2_int ~> dvd_gcdD2

1173 coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff

1174 coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff

1175 realpow_minus_mult ~> power_minus_mult

1176 realpow_Suc_le_self ~> power_Suc_le_self

1177 dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest

1178 INCOMPATIBILITY.

1180 * Renamed HOL/Quotient_Examples/FSet.thy to

1181 HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.

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

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

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

1186 "unbundle finfun_syntax" to imitate import of

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

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

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

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

1192 once.

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

1195 set_mset rather than count.

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

1198 by default.

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

1201 equations count_eq_zero_iff and not_in_iff.

1203 - Rules count_inI and in_countE obtain facts of the form

1204 "count M a = n" from membership.

1206 - Rules count_in_diffI and in_diff_countE obtain facts of the form

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

1209 INCOMPATIBILITY.

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

1212 displaying equations in functional programming style --- variables

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

1214 underscores.

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

1217 build partial equivalence relations from a predicate and an equivalence

1218 relation.

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

1221 everywhere fix bijections.

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

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

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

1226 denominator is normalized wrt. unit factors).

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

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

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

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

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

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

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

1238 principle, Residue theorem, Schwarz Lemma.

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

1241 polytopes, and the Krein–Milman Minkowski theorem.

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

1244 libraries: homeomorphisms, continuous function extensions, invariance of

1245 domain.

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

1248 changed from ereal to ennreal, INCOMPATIBILITY.

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

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

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

1254 Probability Mass Functions.

1256 * Session HOL-Probability: theory Random_Permutations contains some

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

1258 folding over a list in random order.

1260 * Session HOL-Probability: theory SPMF formalises discrete

1261 subprobability distributions.

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

1264 normalised to distinguish which ordering the theorems are about

1266 mset_less_eqI ~> mset_subset_eqI

1267 mset_less_insertD ~> mset_subset_insertD

1268 mset_less_eq_count ~> mset_subset_eq_count

1269 mset_less_diff_self ~> mset_subset_diff_self

1270 mset_le_exists_conv ~> mset_subset_eq_exists_conv

1271 mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel

1272 mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel

1273 mset_le_mono_add ~> mset_subset_eq_mono_add

1274 mset_le_add_left ~> mset_subset_eq_add_left

1275 mset_le_add_right ~> mset_subset_eq_add_right

1276 mset_le_single ~> mset_subset_eq_single

1277 mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute

1278 diff_le_self ~> diff_subset_eq_self

1279 mset_leD ~> mset_subset_eqD

1280 mset_lessD ~> mset_subsetD

1281 mset_le_insertD ~> mset_subset_eq_insertD

1282 mset_less_of_empty ~> mset_subset_of_empty

1283 mset_less_size ~> mset_subset_size

1284 wf_less_mset_rel ~> wf_subset_mset_rel

1285 count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq

1286 mset_remdups_le ~> mset_remdups_subset_eq

1287 ms_lesseq_impl ~> subset_eq_mset_impl

1289 Some functions have been renamed:

1290 ms_lesseq_impl -> subset_eq_mset_impl

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

1293 #\<subseteq># ~> \<le>

1294 #\<subset># ~> <

1295 le_multiset ~> less_eq_multiset

1296 less_multiset ~> le_multiset

1297 INCOMPATIBILITY.

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

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

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

1302 interpretations "multiset_linorder" and "multiset_wellorder" have been

1303 replaced by instantiations. INCOMPATIBILITY.

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

1306 been renamed:

1308 le_multiset_def ~> less_eq_multiset_def

1309 less_multiset_def ~> le_multiset_def

1310 less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset

1311 mult_less_not_refl ~> mset_le_not_refl

1312 mult_less_trans ~> mset_le_trans

1313 mult_less_not_sym ~> mset_le_not_sym

1314 mult_less_asym ~> mset_le_asym

1315 mult_less_irrefl ~> mset_le_irrefl

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

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

1319 le_multiset_total ~> less_eq_multiset_total

1320 less_multiset_right_total ~> subset_eq_imp_le_multiset

1321 le_multiset_empty_left ~> less_eq_multiset_empty_left

1322 le_multiset_empty_right ~> less_eq_multiset_empty_right

1323 less_multiset_empty_right ~> le_multiset_empty_left

1324 less_multiset_empty_left ~> le_multiset_empty_right

1325 union_less_diff_plus ~> union_le_diff_plus

1326 ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset

1327 less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty

1328 le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty

1329 INCOMPATIBILITY.

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

1332 INCOMPATIBILITY.

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

1335 INCOMPATIBILITY, use the following replacements:

1337 le_multiset_plus_plus_left_iff ~> add_less_cancel_right

1338 less_multiset_plus_plus_left_iff ~> add_less_cancel_right

1339 le_multiset_plus_plus_right_iff ~> add_less_cancel_left

1340 less_multiset_plus_plus_right_iff ~> add_less_cancel_left

1341 add_eq_self_empty_iff ~> add_cancel_left_right

1342 mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right

1343 mset_less_add_bothsides ~> subset_mset.add_less_cancel_right

1344 mset_le_add_bothsides ~> subset_mset.add_less_cancel_right

1345 empty_inter ~> subset_mset.inf_bot_left

1346 inter_empty ~> subset_mset.inf_bot_right

1347 empty_sup ~> subset_mset.sup_bot_left

1348 sup_empty ~> subset_mset.sup_bot_right

1349 bdd_below_multiset ~> subset_mset.bdd_above_bot

1350 subset_eq_empty ~> subset_mset.le_zero_eq

1351 le_empty ~> subset_mset.le_zero_eq

1352 mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

1353 mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

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

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

1357 additional typeclasses order_bot, no_top,

1358 ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,

1359 linordered_cancel_ab_semigroup_add, and

1360 ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.

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

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

1364 INCOMPATIBILITY.

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

1367 interpretations ordered_ab_semigroup_monoid_add_imp_le and

1368 bounded_lattice_bot. INCOMPATIBILITY.

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

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

1372 removed or changed:

1374 single_not_empty ~> add_mset_not_empty or empty_not_add_mset

1375 fold_mset_insert ~> fold_mset_add_mset

1376 image_mset_insert ~> image_mset_add_mset

1377 union_single_eq_diff

1378 multi_self_add_other_not_self

1379 diff_single_eq_union

1380 INCOMPATIBILITY.

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

1383 to use add_mset instead of single:

1385 mset_add

1386 multi_self_add_other_not_self

1387 diff_single_eq_union

1388 union_single_eq_diff

1389 union_single_eq_member

1390 add_eq_conv_diff

1391 insert_noteq_member

1392 add_eq_conv_ex

1393 multi_member_split

1394 multiset_add_sub_el_shuffle

1395 mset_subset_eq_insertD

1396 mset_subset_insertD

1397 insert_subset_eq_iff

1398 insert_union_subset_iff

1399 multi_psub_of_add_self

1400 inter_add_left1

1401 inter_add_left2

1402 inter_add_right1

1403 inter_add_right2

1404 sup_union_left1

1405 sup_union_left2

1406 sup_union_right1

1407 sup_union_right2

1408 size_eq_Suc_imp_eq_union

1409 multi_nonempty_split

1410 mset_insort

1411 mset_update

1412 mult1I

1413 less_add

1414 mset_zip_take_Cons_drop_twice

1415 rel_mset_Zero

1416 msed_map_invL

1417 msed_map_invR

1418 msed_rel_invL

1419 msed_rel_invR

1420 le_multiset_right_total

1421 multiset_induct

1422 multiset_induct2_size

1423 multiset_induct2

1424 INCOMPATIBILITY.

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

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

1428 element:

1430 image_mset

1431 mset

1432 replicate_mset

1433 mult1

1434 pred_mset

1435 rel_mset'

1436 mset_insort

1438 INCOMPATIBILITY.

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

1441 attributes of some multiset theorems have been changed:

1443 insert_DiffM [] ~> [simp]

1444 insert_DiffM2 [simp] ~> []

1445 diff_add_mset_swap [simp]

1446 fold_mset_add_mset [simp]

1447 diff_diff_add [simp] (for multisets only)

1448 diff_cancel [simp] ~> []

1449 count_single [simp] ~> []

1450 set_mset_single [simp] ~> []

1451 size_multiset_single [simp] ~> []

1452 size_single [simp] ~> []

1453 image_mset_single [simp] ~> []

1454 mset_subset_eq_mono_add_right_cancel [simp] ~> []

1455 mset_subset_eq_mono_add_left_cancel [simp] ~> []

1456 fold_mset_single [simp] ~> []

1457 subset_eq_empty [simp] ~> []

1458 empty_sup [simp] ~> []

1459 sup_empty [simp] ~> []

1460 inter_empty [simp] ~> []

1461 empty_inter [simp] ~> []

1462 INCOMPATIBILITY.

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

1465 the second cases of multiset_induct, multiset_induct2_size,

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

1467 INCOMPATIBILITY.

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

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

1471 natural numbers. INCOMPATIBILITY.

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

1474 multisets:

1476 msetsum ~> sum_mset

1477 msetprod ~> prod_mset

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

1480 and union of multisets have been changed:

1482 #\<inter> ~> \<inter>#

1483 #\<union> ~> \<union>#

1485 INCOMPATIBILITY.

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

1488 one_step_implies_mult_aux on multisets has been removed, use

1489 one_step_implies_mult instead. INCOMPATIBILITY.

1491 * Session HOL-Library: theory Complete_Partial_Order2 provides reasoning

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

1493 and about admissibility conditions for fixpoint inductions.

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

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

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

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

1499 future different type class instantiation for polynomials over factorial

1500 rings. INCOMPATIBILITY.

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

1503 the following renaming

1505 prefixeq -> prefix

1506 prefix -> strict_prefix

1507 suffixeq -> suffix

1508 suffix -> strict_suffix

1510 Added theory of longest common prefixes.

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

1513 Generalisation of predicate "prime" and introduction of predicates

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

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

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

1517 "prime_nat_iff". INCOMPATIBILITY.

1519 * Session Old_Number_Theory has been removed, after porting remaining

1520 theories.

1522 * Session HOL-Types_To_Sets provides an experimental extension of

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

1526 *** ML ***

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

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

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

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

1532 INCOMPATIBILITY.

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

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

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

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

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

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

1540 superseded by General.Div.

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

1543 the argument is a plain file. Minor INCOMPATIBILITY.

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

1546 with approximative output quality.

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

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

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

1552 This is particularly useful for conditional compilation, without

1553 requiring separate files.

1555 * Option ML_exception_debugger controls detailed exception trace via the

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

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

1558 debugger information requires consirable time and space: main

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

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

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

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

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

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

1566 balanced blocks of Local_Theory.open_target versus

1567 Local_Theory.close_target instead. Rare INCOMPATIBILITY.

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

1570 replaced by structure Timeout, with slightly different signature.

1571 INCOMPATIBILITY.

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

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

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

1576 File.full_path). Potential INCOMPATIBILITY.

1578 * Binding.empty_atts supersedes Thm.empty_binding and

1579 Attrib.empty_binding. Minor INCOMPATIBILITY.

1582 *** System ***

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

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

1587 much less disk space.

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

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

1591 particular:

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

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

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

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

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

1599 prover front-ends should use ML_Process or Isabelle_Process in

1600 Isabelle/Scala. INCOMPATIBILITY.

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

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

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

1605 return code 1.

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

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

1609 servers with separate CPU/memory modules.

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

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

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

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

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

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

1618 by default).

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

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

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

1623 resulting log files.

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

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

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

1628 implicit default via option -p.

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

1631 bootstrapping Isabelle/Pure interactively.

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

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

1635 Isabelle/ML or Isabelle/Scala.

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

1638 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,

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

1640 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been

1641 discontinued. Potential INCOMPATIBILITY.

1643 * The Isabelle system environment always ensures that the main

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

1645 "isabelle_scala_script".

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

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

1649 Isabelle_Tool.Body.

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

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

1653 produce robust shell scripts under program control, without worrying

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

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

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

1657 been discontinued.

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

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

1661 but without the Isabelle settings environment.

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

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

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

1666 that Path specifications need to be resolved remotely via

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

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

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

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

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

1673 connection).

1677 New in Isabelle2016 (February 2016)

1678 -----------------------------------

1680 *** General ***

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

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

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

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

1686 examples that do require HOL.

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

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

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

1692 without any special print mode. Important ASCII replacement syntax

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

1694 has been removed (see below).

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

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

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

1700 context has been discontinued. Rare INCOMPATIBILITY, use explicit

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

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

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

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

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

1707 meaning.

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

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

1711 to update old sources.

1713 * Toplevel theorem statements have been simplified as follows:

1715 theorems ~> lemmas

1716 schematic_lemma ~> schematic_goal

1717 schematic_theorem ~> schematic_goal

1718 schematic_corollary ~> schematic_goal

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

1721 accordingly.

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

1724 'theorem'.

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

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

1728 deferred definitions require a surrounding 'overloading' block.

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

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

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

1735 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

1736 'SML_file_no_debug' control compilation of sources with or without

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

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

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

1740 any effect on the running ML program.

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

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

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

1745 update.

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

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

1749 enable option "editor_output_state".

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

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

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

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

1755 visibility.

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

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

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

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

1761 panel.

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

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

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

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

1768 implicit: a popup will show up unconditionally.

1770 * Additional abbreviations for syntactic completion may be specified in

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

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

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

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

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

1777 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.

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

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

1781 the editor.

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

1784 instead of former C+e LEFT.

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

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

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

1789 instead.

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

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

1793 single-instance applications seen on common GUI desktops.

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

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

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

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

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

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

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

1806 *** Document preparation ***

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

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

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

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

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

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

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

1817 follows:

1819 \<^item> itemize

1820 \<^enum> enumerate

1821 \<^descr> description

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

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

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

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

1827 standard Isabelle fonts provide glyphs to render important control

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

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

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

1832 standard LaTeX macros of the same names.

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

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

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

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

1838 cartouche tokens seen in theory sources.

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

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

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

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

1844 or terminal spaces are ignored.

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

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

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

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

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

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

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

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

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

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

1860 documentation, with a hyperlink in the Prover IDE.

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

1863 entities of the Isar language.

1865 * HTML presentation uses the standard IsabelleText font and Unicode

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

1867 print mode "HTML" loses its special meaning.

1870 *** Isar ***

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

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

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

1875 example:

1877 have result: "C x y"

1878 if "A x" and "B y"

1879 for x :: 'a and y :: 'a

1880 <proof>

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

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

1884 corresponds to a raw proof block like this:

1886 {

1887 fix x :: 'a and y :: 'a

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

1889 have "C x y" <proof>

1890 }

1891 note result = this

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

1894 instead of 'assume' above.

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

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

1899 assume result: "C x y"

1900 if "A x" and "B y"

1901 for x :: 'a and y :: 'a

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

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

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

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

1908 example:

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

1912 is equivalent to:

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

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

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

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

1919 follows:

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

1923 or:

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

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

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

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

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

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

1934 of the local context elements yet.

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

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

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

1940 then have something

1941 proof cases

1942 case a

1943 then show ?thesis <proof>

1944 next

1945 case b

1946 then show ?thesis <proof>

1947 next

1948 case c

1949 then show ?thesis <proof>

1950 qed

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

1954 case a: (c xs)

1955 case a [attributes]: (c xs)

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

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

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

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

1961 and always put attributes in front.

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

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

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

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

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

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

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

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

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

1974 supply [simp] = a

1975 proof

1976 show A by simp

1977 next

1978 show A by simp

1979 qed

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

1982 proof body as well, abstracted over relevant parameters.

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

1985 parameter scope for of each clause.

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

1988 statements: result is abstracted over unknowns.

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

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

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

1993 manual.

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

1996 ('apply' scripts).

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

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

2000 example:

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

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

2004 proof goal_cases

2005 case (1 x)

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

2007 next

2008 case (2 y z)

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

2010 qed

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

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

2014 proof goal_cases

2015 case prems: 1

2016 then show ?case using prems sorry

2017 next

2018 case prems: 2

2019 then show ?case using prems sorry

2020 qed

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

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

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

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

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

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

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

2031 occasionally useful for demonstration and testing purposes.

2034 *** Pure ***

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

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

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

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

2041 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

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

2044 * More gentle suppression of syntax along locale morphisms while

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

2046 would be suppressed for morphisms except term identity. Now

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

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

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

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

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

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

2054 begin

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

2056 end

2058 locale morphism =

2059 left: struct composition + right: struct composition'

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

2061 begin

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

2063 end

2065 * Command 'global_interpretation' issues interpretations into global

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

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

2069 'defines'.

2071 * Command 'permanent_interpretation' has been discontinued. Use

2072 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

2074 * Command 'print_definitions' prints dependencies of definitional

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

2077 * Configuration option rule_insts_schematic has been discontinued

2078 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

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

2081 INCOMPATIBILITY in situations where the previous misbehaviour has been

2082 exploited.

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

2085 operations behave more similar to abbreviations. Potential

2086 INCOMPATIBILITY in exotic situations.

2089 *** HOL ***

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

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

2093 global collection of overloaded constant / type definitions into

2094 account. Type definitions with open dependencies on overloaded

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

2096 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

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

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

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

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

2102 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

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

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

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

2107 simplify porting old theories:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

2136 INCOMPATIBILITY, use plain "::" instead.

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

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

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

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

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

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

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

2146 definition and its monotonicity result. Rare INCOMPATIBILITY.

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

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

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

2151 also subject to "inductive_internals". Rare INCOMPATIBILITY.

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

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

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

2156 INCOMPATIBILITY.

2158 * Combinator to represent case distinction on products is named

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

2160 theorem aliasses have been retained.

2162 Consolidated facts:

2163 PairE ~> prod.exhaust

2164 Pair_eq ~> prod.inject

2165 pair_collapse ~> prod.collapse

2166 Pair_fst_snd_eq ~> prod_eq_iff

2167 split_twice ~> prod.case_distrib

2168 split_weak_cong ~> prod.case_cong_weak

2169 split_split ~> prod.split

2170 split_split_asm ~> prod.split_asm

2171 splitI ~> case_prodI

2172 splitD ~> case_prodD

2173 splitI2 ~> case_prodI2

2174 splitI2' ~> case_prodI2'

2175 splitE ~> case_prodE

2176 splitE' ~> case_prodE'

2177 split_pair ~> case_prod_Pair

2178 split_eta ~> case_prod_eta

2179 split_comp ~> case_prod_comp

2180 mem_splitI ~> mem_case_prodI

2181 mem_splitI2 ~> mem_case_prodI2

2182 mem_splitE ~> mem_case_prodE

2183 The_split ~> The_case_prod

2184 cond_split_eta ~> cond_case_prod_eta

2185 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

2186 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

2187 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

2188 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

2189 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

2190 Domain_Collect_split ~> Domain_Collect_case_prod

2191 Image_Collect_split ~> Image_Collect_case_prod

2192 Range_Collect_split ~> Range_Collect_case_prod

2193 Eps_split ~> Eps_case_prod

2194 Eps_split_eq ~> Eps_case_prod_eq

2195 split_rsp ~> case_prod_rsp

2196 curry_split ~> curry_case_prod

2197 split_curry ~> case_prod_curry

2199 Changes in structure HOLogic:

2200 split_const ~> case_prod_const

2201 mk_split ~> mk_case_prod

2202 mk_psplits ~> mk_ptupleabs

2203 strip_psplits ~> strip_ptupleabs

2205 INCOMPATIBILITY.

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

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

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

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

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

2213 Consolidated facts (among others):

2214 real_of_nat_le_iff -> of_nat_le_iff

2215 real_of_nat_numeral of_nat_numeral

2216 real_of_int_zero of_int_0

2217 real_of_nat_zero of_nat_0

2218 real_of_one of_int_1

2219 real_of_int_add of_int_add

2220 real_of_nat_add of_nat_add

2221 real_of_int_diff of_int_diff

2222 real_of_nat_diff of_nat_diff

2223 floor_subtract floor_diff_of_int

2224 real_of_int_inject of_int_eq_iff

2225 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

2226 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

2227 real_of_nat_ge_zero of_nat_0_le_iff

2228 real_of_int_ceiling_ge le_of_int_ceiling

2229 ceiling_less_eq ceiling_less_iff

2230 ceiling_le_eq ceiling_le_iff

2231 less_floor_eq less_floor_iff

2232 floor_less_eq floor_less_iff

2233 floor_divide_eq_div floor_divide_of_int_eq

2234 real_of_int_zero_cancel of_nat_eq_0_iff

2235 ceiling_real_of_int ceiling_of_int

2237 INCOMPATIBILITY.

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

2240 been removed. INCOMPATIBILITY.

2242 * Quickcheck setup for finite sets.

2244 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

2246 * Sledgehammer:

2247 - The MaSh relevance filter has been sped up.

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

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

2250 - Auto Sledgehammer now minimizes and preplays the results.

2251 - Handle Vampire 4.0 proof output without raising exception.

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

2253 Isabelle/jEdit instead. INCOMPATIBILITY.

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

2256 * Nitpick:

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

2258 - Fixed soundness bug in "destroy_constrs" optimization.

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

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

2261 - Eliminated obsolete "blocking" option.

2263 * (Co)datatype package:

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

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

2266 - Always generate "case_transfer" theorem.

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

2268 "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.

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

2270 being defined.

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

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

2274 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

2275 'transfer_prover_start' and 'transfer_prover_end'.

2277 * New diagnostic command print_record for displaying record definitions.

2279 * Division on integers is bootstrapped directly from division on

2280 naturals and uses generic numeral algorithm for computations. Slight

2281 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

2282 simprocs binary_int_div and binary_int_mod

2284 * Tightened specification of class semiring_no_zero_divisors. Minor

2285 INCOMPATIBILITY.

2287 * Class algebraic_semidom introduces common algebraic notions of

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

2289 by fields, is is not a super class of these in order not to burden

2290 fields with notions that are trivial there.

2292 * Class normalization_semidom specifies canonical representants for

2293 equivalence classes of associated elements in an integral (semi)domain.

2294 This formalizes associated elements as well.

2296 * Abstract specification of gcd/lcm operations in classes semiring_gcd,

2297 semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute

2298 and gcd_int.commute are subsumed by gcd.commute, as well as

2299 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

2301 * Former constants Fields.divide (_ / _) and Divides.div (_ div _) are

2302 logically unified to Rings.divide in syntactic type class Rings.divide,

2303 with infix syntax (_ div _). Infix syntax (_ / _) for field division is

2304 added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,

2305 instantiations must refer to Rings.divide rather than the former

2306 separate constants, hence infix syntax (_ / _) is usually not available

2307 during instantiation.

2309 * New cancellation simprocs for boolean algebras to cancel complementary

2310 terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to

2311 "top". INCOMPATIBILITY.

2313 * Class uniform_space introduces uniform spaces btw topological spaces

2314 and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be

2315 introduced in the form of an uniformity. Some constants are more general

2316 now, it may be necessary to add type class constraints.

2318 open_real_def \<leadsto> open_dist

2319 open_complex_def \<leadsto> open_dist

2321 * Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.

2323 * Library/Multiset:

2324 - Renamed multiset inclusion operators:

2325 < ~> <#

2326 > ~> >#

2327 <= ~> <=#

2328 >= ~> >=#

2329 \<le> ~> \<le>#

2330 \<ge> ~> \<ge>#

2331 INCOMPATIBILITY.

2332 - Added multiset inclusion operator syntax:

2333 \<subset>#

2334 \<subseteq>#

2335 \<supset>#

2336 \<supseteq>#

2337 - "'a multiset" is no longer an instance of the "order",

2338 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

2339 "semilattice_inf", and "semilattice_sup" type classes. The theorems

2340 previously provided by these type classes (directly or indirectly)

2341 are now available through the "subset_mset" interpretation

2342 (e.g. add_mono ~> subset_mset.add_mono).

2343 INCOMPATIBILITY.

2344 - Renamed conversions:

2345 multiset_of ~> mset

2346 multiset_of_set ~> mset_set

2347 set_of ~> set_mset

2348 INCOMPATIBILITY

2349 - Renamed lemmas:

2350 mset_le_def ~> subseteq_mset_def

2351 mset_less_def ~> subset_mset_def

2352 less_eq_multiset.rep_eq ~> subseteq_mset_def

2353 INCOMPATIBILITY

2354 - Removed lemmas generated by lift_definition:

2355 less_eq_multiset.abs_eq, less_eq_multiset.rsp,

2356 less_eq_multiset.transfer, less_eq_multiset_def

2357 INCOMPATIBILITY

2359 * Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.

2361 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

2362 Bourbaki-Witt fixpoint theorem for increasing functions in

2363 chain-complete partial orders.

2365 * Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.

2366 Minor INCOMPATIBILITY, use 'function' instead.

2368 * Library/Periodic_Fun: a locale that provides convenient lemmas for

2369 periodic functions.

2371 * Library/Formal_Power_Series: proper definition of division (with

2372 remainder) for formal power series; instances for Euclidean Ring and

2373 GCD.

2375 * HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.

2377 * HOL-Statespace: command 'statespace' uses mandatory qualifier for

2378 import of parent, as for general 'locale' expressions. INCOMPATIBILITY,

2379 remove '!' and add '?' as required.

2381 * HOL-Decision_Procs: The "approximation" method works with "powr"

2382 (exponentiation on real numbers) again.

2384 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

2385 integrals (= complex path integrals), Cauchy's integral theorem, winding

2386 numbers and Cauchy's integral formula, Liouville theorem, Fundamental

2387 Theorem of Algebra. Ported from HOL Light.

2389 * HOL-Multivariate_Analysis: topological concepts such as connected

2390 components, homotopic paths and the inside or outside of a set.

2392 * HOL-Multivariate_Analysis: radius of convergence of power series and

2393 various summability tests; Harmonic numbers and the Euler–Mascheroni

2394 constant; the Generalised Binomial Theorem; the complex and real

2395 Gamma/log-Gamma/Digamma/ Polygamma functions and their most important

2396 properties.

2398 * HOL-Probability: The central limit theorem based on Levy's uniqueness

2399 and continuity theorems, weak convergence, and characterisitc functions.

2401 * HOL-Data_Structures: new and growing session of standard data

2402 structures.

2405 *** ML ***

2407 * The following combinators for low-level profiling of the ML runtime

2408 system are available:

2410 profile_time (*CPU time*)

2411 profile_time_thread (*CPU time on this thread*)

2412 profile_allocations (*overall heap allocations*)

2414 * Antiquotation @{undefined} or \<^undefined> inlines (raise Match).

2416 * Antiquotation @{method NAME} inlines the (checked) name of the given

2417 Isar proof method.

2419 * Pretty printing of Poly/ML compiler output in Isabelle has been

2420 improved: proper treatment of break offsets and blocks with consistent

2421 breaks.

2423 * The auxiliary module Pure/display.ML has been eliminated. Its

2424 elementary thm print operations are now in Pure/more_thm.ML and thus

2425 called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.

2427 * Simproc programming interfaces have been simplified:

2428 Simplifier.make_simproc and Simplifier.define_simproc supersede various

2429 forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that

2430 term patterns for the left-hand sides are specified with implicitly

2431 fixed variables, like top-level theorem statements. INCOMPATIBILITY.

2433 * Instantiation rules have been re-organized as follows:

2435 Thm.instantiate (*low-level instantiation with named arguments*)

2436 Thm.instantiate' (*version with positional arguments*)

2438 Drule.infer_instantiate (*instantiation with type inference*)

2439 Drule.infer_instantiate' (*version with positional arguments*)

2441 The LHS only requires variable specifications, instead of full terms.

2442 Old cterm_instantiate is superseded by infer_instantiate.

2443 INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.

2445 * Old tactic shorthands atac, rtac, etac, dtac, ftac have been

2446 discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.

2447 instead (with proper context).

2449 * Thm.instantiate (and derivatives) no longer require the LHS of the

2450 instantiation to be certified: plain variables are given directly.

2452 * Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous

2453 quasi-bound variables (like the Simplifier), instead of accidentally

2454 named local fixes. This has the potential to improve stability of proof

2455 tools, but can also cause INCOMPATIBILITY for tools that don't observe

2456 the proof context discipline.

2458 * Isar proof methods are based on a slightly more general type

2459 context_tactic, which allows to change the proof context dynamically

2460 (e.g. to update cases) and indicate explicit Seq.Error results. Former

2461 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

2462 provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.

2465 *** System ***

2467 * Command-line tool "isabelle console" enables print mode "ASCII".

2469 * Command-line tool "isabelle update_then" expands old Isar command

2470 conflations:

2472 hence ~> then have

2473 thus ~> then show

2475 This syntax is more orthogonal and improves readability and

2476 maintainability of proofs.

2478 * Global session timeout is multiplied by timeout_scale factor. This

2479 allows to adjust large-scale tests (e.g. AFP) to overall hardware

2480 performance.

2482 * Property values in etc/symbols may contain spaces, if written with the

2483 replacement character "␣" (Unicode point 0x2324). For example:

2485 \<star> code: 0x0022c6 group: operator font: Deja␣Vu␣Sans␣Mono

2487 * Java runtime environment for x86_64-windows allows to use larger heap

2488 space.

2490 * Java runtime options are determined separately for 32bit vs. 64bit

2491 platforms as follows.

2493 - Isabelle desktop application: platform-specific files that are

2494 associated with the main app bundle

2496 - isabelle jedit: settings

2497 JEDIT_JAVA_SYSTEM_OPTIONS

2498 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

2500 - isabelle build: settings

2501 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

2503 * Bash shell function "jvmpath" has been renamed to "platform_path": it

2504 is relevant both for Poly/ML and JVM processes.

2506 * Poly/ML default platform architecture may be changed from 32bit to

2507 64bit via system option ML_system_64. A system restart (and rebuild) is

2508 required after change.

2510 * Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which

2511 both allow larger heap space than former x86-cygwin.

2513 * Heap images are 10-15% smaller due to less wasteful persistent theory

2514 content (using ML type theory_id instead of theory);

2518 New in Isabelle2015 (May 2015)

2519 ------------------------------

2521 *** General ***

2523 * Local theory specification commands may have a 'private' or

2524 'qualified' modifier to restrict name space accesses to the local scope,

2525 as provided by some "context begin ... end" block. For example:

2527 context

2528 begin

2530 private definition ...

2531 private lemma ...

2533 qualified definition ...

2534 qualified lemma ...

2536 lemma ...

2537 theorem ...

2539 end

2541 * Command 'experiment' opens an anonymous locale context with private

2542 naming policy.

2544 * Command 'notepad' requires proper nesting of begin/end and its proof

2545 structure in the body: 'oops' is no longer supported here. Minor

2546 INCOMPATIBILITY, use 'sorry' instead.

2548 * Command 'named_theorems' declares a dynamic fact within the context,

2549 together with an attribute to maintain the content incrementally. This

2550 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change

2551 of semantics due to external visual order vs. internal reverse order.

2553 * 'find_theorems': search patterns which are abstractions are

2554 schematically expanded before search. Search results match the naive

2555 expectation more closely, particularly wrt. abbreviations.

2556 INCOMPATIBILITY.

2558 * Commands 'method_setup' and 'attribute_setup' now work within a local

2559 theory context.

2561 * Outer syntax commands are managed authentically within the theory

2562 context, without implicit global state. Potential for accidental

2563 INCOMPATIBILITY, make sure that required theories are really imported.

2565 * Historical command-line terminator ";" is no longer accepted (and

2566 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle

2567 update_semicolons" to remove obsolete semicolons from old theory

2568 sources.

2570 * Structural composition of proof methods (meth1; meth2) in Isar

2571 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

2573 * The Eisbach proof method language allows to define new proof methods

2574 by combining existing ones with their usual syntax. The "match" proof

2575 method provides basic fact/term matching in addition to

2576 premise/conclusion matching through Subgoal.focus, and binds fact names

2577 from matches as well as term patterns within matches. The Isabelle

2578 documentation provides an entry "eisbach" for the Eisbach User Manual.

2579 Sources and various examples are in ~~/src/HOL/Eisbach/.

2582 *** Prover IDE -- Isabelle/Scala/jEdit ***

2584 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,

2585 the "sidekick" mode may be used for document structure.

2587 * Extended bracket matching based on Isar language structure. System

2588 option jedit_structure_limit determines maximum number of lines to scan

2589 in the buffer.

2591 * Support for BibTeX files: context menu, context-sensitive token

2592 marker, SideKick parser.

2594 * Document antiquotation @{cite} provides formal markup, which is

2595 interpreted semi-formally based on .bib files that happen to be open in

2596 the editor (hyperlinks, completion etc.).

2598 * Less waste of vertical space via negative line spacing (see Global

2599 Options / Text Area).

2601 * Improved graphview panel with optional output of PNG or PDF, for

2602 display of 'thy_deps', 'class_deps' etc.

2604 * The commands 'thy_deps' and 'class_deps' allow optional bounds to

2605 restrict the visualized hierarchy.

2607 * Improved scheduling for asynchronous print commands (e.g. provers

2608 managed by the Sledgehammer panel) wrt. ongoing document processing.

2611 *** Document preparation ***

2613 * Document markup commands 'chapter', 'section', 'subsection',

2614 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any

2615 context, even before the initial 'theory' command. Obsolete proof

2616 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been

2617 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'

2618 instead. The old 'header' command is still retained for some time, but

2619 should be replaced by 'chapter', 'section' etc. (using "isabelle

2620 update_header"). Minor INCOMPATIBILITY.

2622 * Official support for "tt" style variants, via \isatt{...} or

2623 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or

2624 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.

2625 as argument to other macros (such as footnotes).

2627 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"

2628 style.

2630 * Discontinued obsolete option "document_graph": session_graph.pdf is

2631 produced unconditionally for HTML browser_info and PDF-LaTeX document.

2633 * Diagnostic commands and document markup commands within a proof do not

2634 affect the command tag for output. Thus commands like 'thm' are subject

2635 to proof document structure, and no longer "stick out" accidentally.

2636 Commands 'text' and 'txt' merely differ in the LaTeX style, not their

2637 tags. Potential INCOMPATIBILITY in exotic situations.

2639 * System option "pretty_margin" is superseded by "thy_output_margin",

2640 which is also accessible via document antiquotation option "margin".

2641 Only the margin for document output may be changed, but not the global

2642 pretty printing: that is 76 for plain console output, and adapted

2643 dynamically in GUI front-ends. Implementations of document

2644 antiquotations need to observe the margin explicitly according to

2645 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

2647 * Specification of 'document_files' in the session ROOT file is

2648 mandatory for document preparation. The legacy mode with implicit

2649 copying of the document/ directory is no longer supported. Minor

2650 INCOMPATIBILITY.

2653 *** Pure ***

2655 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"

2656 etc.) allow an optional context of local variables ('for' declaration):

2657 these variables become schematic in the instantiated theorem; this

2658 behaviour is analogous to 'for' in attributes "where" and "of".

2659 Configuration option rule_insts_schematic (default false) controls use

2660 of schematic variables outside the context. Minor INCOMPATIBILITY,

2661 declare rule_insts_schematic = true temporarily and update to use local

2662 variable declarations or dummy patterns instead.

2664 * Explicit instantiation via attributes "where", "of", and proof methods

2665 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns

2666 ("_") that stand for anonymous local variables.

2668 * Generated schematic variables in standard format of exported facts are

2669 incremented to avoid material in the proof context. Rare

2670 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

2671 different index.

2673 * Lexical separation of signed and unsigned numerals: categories "num"

2674 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence

2675 of numeral signs, particularly in expressions involving infix syntax

2676 like "(- 1) ^ n".

2678 * Old inner token category "xnum" has been discontinued. Potential

2679 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"

2680 token category instead.

2683 *** HOL ***

2685 * New (co)datatype package:

2686 - The 'datatype_new' command has been renamed 'datatype'. The old

2687 command of that name is now called 'old_datatype' and is provided

2688 by "~~/src/HOL/Library/Old_Datatype.thy". See

2689 'isabelle doc datatypes' for information on porting.

2690 INCOMPATIBILITY.

2691 - Renamed theorems:

2692 disc_corec ~> corec_disc

2693 disc_corec_iff ~> corec_disc_iff

2694 disc_exclude ~> distinct_disc

2695 disc_exhaust ~> exhaust_disc

2696 disc_map_iff ~> map_disc_iff

2697 sel_corec ~> corec_sel

2698 sel_exhaust ~> exhaust_sel

2699 sel_map ~> map_sel

2700 sel_set ~> set_sel

2701 sel_split ~> split_sel

2702 sel_split_asm ~> split_sel_asm

2703 strong_coinduct ~> coinduct_strong

2704 weak_case_cong ~> case_cong_weak

2705 INCOMPATIBILITY.

2706 - The "no_code" option to "free_constructors", "datatype_new", and

2707 "codatatype" has been renamed "plugins del: code".

2708 INCOMPATIBILITY.

2709 - The rules "set_empty" have been removed. They are easy

2710 consequences of other set rules "by auto".

2711 INCOMPATIBILITY.

2712 - The rule "set_cases" is now registered with the "[cases set]"

2713 attribute. This can influence the behavior of the "cases" proof

2714 method when more than one case rule is applicable (e.g., an

2715 assumption is of the form "w : set ws" and the method "cases w"

2716 is invoked). The solution is to specify the case rule explicitly

2717 (e.g. "cases w rule: widget.exhaust").

2718 INCOMPATIBILITY.

2719 - Renamed theories:

2720 BNF_Comp ~> BNF_Composition

2721 BNF_FP_Base ~> BNF_Fixpoint_Base

2722 BNF_GFP ~> BNF_Greatest_Fixpoint

2723 BNF_LFP ~> BNF_Least_Fixpoint

2724 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

2725 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

2726 INCOMPATIBILITY.

2727 - Lifting and Transfer setup for basic HOL types sum and prod (also

2728 option) is now performed by the BNF package. Theories Lifting_Sum,

2729 Lifting_Product and Lifting_Option from Main became obsolete and

2730 were removed. Changed definitions of the relators rel_prod and

2731 rel_sum (using inductive).

2732 INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead

2733 of rel_prod_def and rel_sum_def.

2734 Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names

2735 changed (e.g. map_prod_transfer ~> prod.map_transfer).

2736 - Parametricity theorems for map functions, relators, set functions,

2737 constructors, case combinators, discriminators, selectors and

2738 (co)recursors are automatically proved and registered as transfer

2739 rules.

2741 * Old datatype package:

2742 - The old 'datatype' command has been renamed 'old_datatype', and

2743 'rep_datatype' has been renamed 'old_rep_datatype'. They are

2744 provided by "~~/src/HOL/Library/Old_Datatype.thy". See

2745 'isabelle doc datatypes' for information on porting.

2746 INCOMPATIBILITY.

2747 - Renamed theorems:

2748 weak_case_cong ~> case_cong_weak

2749 INCOMPATIBILITY.

2750 - Renamed theory:

2751 ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy

2752 INCOMPATIBILITY.

2754 * Nitpick:

2755 - Fixed soundness bug related to the strict and non-strict subset

2756 operations.

2758 * Sledgehammer:

2759 - CVC4 is now included with Isabelle instead of CVC3 and run by

2760 default.

2761 - Z3 is now always enabled by default, now that it is fully open

2762 source. The "z3_non_commercial" option is discontinued.

2763 - Minimization is now always enabled by default.

2764 Removed sub-command:

2765 min

2766 - Proof reconstruction, both one-liners and Isar, has been

2767 dramatically improved.

2768 - Improved support for CVC4 and veriT.

2770 * Old and new SMT modules:

2771 - The old 'smt' method has been renamed 'old_smt' and moved to

2772 'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,

2773 until applications have been ported to use the new 'smt' method. For

2774 the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must

2775 be installed, and the environment variable "OLD_Z3_SOLVER" must

2776 point to it.

2777 INCOMPATIBILITY.

2778 - The 'smt2' method has been renamed 'smt'.

2779 INCOMPATIBILITY.

2780 - New option 'smt_reconstruction_step_timeout' to limit the

2781 reconstruction time of Z3 proof steps in the new 'smt' method.

2782 - New option 'smt_statistics' to display statistics of the new 'smt'

2783 method, especially runtime statistics of Z3 proof reconstruction.

2785 * Lifting: command 'lift_definition' allows to execute lifted constants

2786 that have as a return type a datatype containing a subtype. This

2787 overcomes long-time limitations in the area of code generation and

2788 lifting, and avoids tedious workarounds.

2790 * Command and antiquotation "value" provide different evaluation slots

2791 (again), where the previous strategy (NBE after ML) serves as default.

2792 Minor INCOMPATIBILITY.

2794 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.

2796 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid

2797 non-termination in case of distributing a division. With this change

2798 field_simps is in some cases slightly less powerful, if it fails try to

2799 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

2801 * Separate class no_zero_divisors has been given up in favour of fully

2802 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

2804 * Class linordered_semidom really requires no zero divisors.

2805 INCOMPATIBILITY.

2807 * Classes division_ring, field and linordered_field always demand

2808 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,

2809 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

2811 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

2812 additive inverse operation. INCOMPATIBILITY.

2814 * Complex powers and square roots. The functions "ln" and "powr" are now

2815 overloaded for types real and complex, and 0 powr y = 0 by definition.

2816 INCOMPATIBILITY: type constraints may be necessary.

2818 * The functions "sin" and "cos" are now defined for any type of sort

2819 "{real_normed_algebra_1,banach}" type, so in particular on "real" and

2820 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be

2821 needed.

2823 * New library of properties of the complex transcendental functions sin,

2824 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.

2826 * The factorial function, "fact", now has type "nat => 'a" (of a sort

2827 that admits numeric types including nat, int, real and complex.

2828 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type

2829 constraint, and the combination "real (fact k)" is likely to be

2830 unsatisfactory. If a type conversion is still necessary, then use

2831 "of_nat (fact k)" or "real_of_nat (fact k)".

2833 * Removed functions "natfloor" and "natceiling", use "nat o floor" and

2834 "nat o ceiling" instead. A few of the lemmas have been retained and

2835 adapted: in their names "natfloor"/"natceiling" has been replaced by

2836 "nat_floor"/"nat_ceiling".

2838 * Qualified some duplicated fact names required for boostrapping the

2839 type class hierarchy:

2840 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

2841 field_inverse_zero ~> inverse_zero

2842 field_divide_inverse ~> divide_inverse

2843 field_inverse ~> left_inverse

2844 Minor INCOMPATIBILITY.

2846 * Eliminated fact duplicates:

2847 mult_less_imp_less_right ~> mult_right_less_imp_less

2848 mult_less_imp_less_left ~> mult_left_less_imp_less

2849 Minor INCOMPATIBILITY.

2851 * Fact consolidation: even_less_0_iff is subsumed by

2852 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

2854 * Generalized and consolidated some theorems concerning divsibility:

2855 dvd_reduce ~> dvd_add_triv_right_iff

2856 dvd_plus_eq_right ~> dvd_add_right_iff

2857 dvd_plus_eq_left ~> dvd_add_left_iff

2858 Minor INCOMPATIBILITY.

2860 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"

2861 and part of theory Main.

2862 even_def ~> even_iff_mod_2_eq_zero

2863 INCOMPATIBILITY.

2865 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor

2866 INCOMPATIBILITY.

2868 * Bootstrap of listsum as special case of abstract product over lists.

2869 Fact rename:

2870 listsum_def ~> listsum.eq_foldr

2871 INCOMPATIBILITY.

2873 * Product over lists via constant "listprod".

2875 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

2876 Cons_nth_drop_Suc.

2878 * New infrastructure for compiling, running, evaluating and testing

2879 generated code in target languages in HOL/Library/Code_Test. See

2880 HOL/Codegenerator_Test/Code_Test* for examples.

2882 * Library/Multiset:

2883 - Introduced "replicate_mset" operation.

2884 - Introduced alternative characterizations of the multiset ordering in

2885 "Library/Multiset_Order".

2886 - Renamed multiset ordering:

2887 <# ~> #<#

2888 <=# ~> #<=#

2889 \<subset># ~> #\<subset>#

2890 \<subseteq># ~> #\<subseteq>#

2891 INCOMPATIBILITY.

2892 - Introduced abbreviations for ill-named multiset operations:

2893 <#, \<subset># abbreviate < (strict subset)

2894 <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)

2895 INCOMPATIBILITY.

2896 - Renamed

2897 in_multiset_of ~> in_multiset_in_set

2898 Multiset.fold ~> fold_mset

2899 Multiset.filter ~> filter_mset

2900 INCOMPATIBILITY.

2901 - Removed mcard, is equal to size.

2902 - Added attributes:

2903 image_mset.id [simp]

2904 image_mset_id [simp]

2905 elem_multiset_of_set [simp, intro]

2906 comp_fun_commute_plus_mset [simp]

2907 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

2908 in_mset_fold_plus_iff [iff]

2909 set_of_Union_mset [simp]

2910 in_Union_mset_iff [iff]

2911 INCOMPATIBILITY.

2913 * Library/Sum_of_Squares: simplified and improved "sos" method. Always

2914 use local CSDP executable, which is much faster than the NEOS server.

2915 The "sos_cert" functionality is invoked as "sos" with additional

2916 argument. Minor INCOMPATIBILITY.

2918 * HOL-Decision_Procs: New counterexample generator quickcheck

2919 [approximation] for inequalities of transcendental functions. Uses

2920 hardware floating point arithmetic to randomly discover potential

2921 counterexamples. Counterexamples are certified with the "approximation"

2922 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for

2923 examples.

2925 * HOL-Probability: Reworked measurability prover

2926 - applies destructor rules repeatedly

2927 - removed application splitting (replaced by destructor rule)

2928 - added congruence rules to rewrite measure spaces under the sets

2929 projection

2931 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for

2932 single-step rewriting with subterm selection based on patterns.

2935 *** ML ***

2937 * Subtle change of name space policy: undeclared entries are now

2938 considered inaccessible, instead of accessible via the fully-qualified

2939 internal name. This mainly affects Name_Space.intern (and derivatives),

2940 which may produce an unexpected Long_Name.hidden prefix. Note that

2941 contemporary applications use the strict Name_Space.check (and

2942 derivatives) instead, which is not affected by the change. Potential

2943 INCOMPATIBILITY in rare applications of Name_Space.intern.

2945 * Subtle change of error semantics of Toplevel.proof_of: regular user

2946 ERROR instead of internal Toplevel.UNDEF.

2948 * Basic combinators map, fold, fold_map, split_list, apply are available

2949 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.

2951 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.

2952 INCOMPATIBILITY.

2954 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

2955 sections have been discontinued, in favour of the more elementary

2956 Multithreading.synchronized and its high-level derivative

2957 Synchronized.var (which is usually sufficient in applications). Subtle

2958 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be

2959 nested.

2961 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle

2962 change of semantics with minimal potential for INCOMPATIBILITY.

2964 * The main operations to certify logical entities are Thm.ctyp_of and

2965 Thm.cterm_of with a local context; old-style global theory variants are

2966 available as Thm.global_ctyp_of and Thm.global_cterm_of.

2967 INCOMPATIBILITY.

2969 * Elementary operations in module Thm are no longer pervasive.

2970 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,

2971 Thm.term_of etc.

2973 * Proper context for various elementary tactics: assume_tac,

2974 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

2975 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

2977 * Tactical PARALLEL_ALLGOALS is the most common way to refer to

2978 PARALLEL_GOALS.

2980 * Goal.prove_multi is superseded by the fully general Goal.prove_common,

2981 which also allows to specify a fork priority.

2983 * Antiquotation @{command_spec "COMMAND"} is superseded by

2984 @{command_keyword COMMAND} (usually without quotes and with PIDE

2985 markup). Minor INCOMPATIBILITY.

2987 * Cartouches within ML sources are turned into values of type

2988 Input.source (with formal position information).

2991 *** System ***

2993 * The Isabelle tool "update_cartouches" changes theory files to use

2994 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.

2996 * The Isabelle tool "build" provides new options -X, -k, -x.

2998 * Discontinued old-fashioned "codegen" tool. Code generation can always

2999 be externally triggered using an appropriate ROOT file plus a

3000 corresponding theory. Parametrization is possible using environment

3001 variables, or ML snippets in the most extreme cases. Minor

3002 INCOMPATIBILITY.

3004 * JVM system property "isabelle.threads" determines size of Scala thread

3005 pool, like Isabelle system option "threads" for ML.

3007 * JVM system property "isabelle.laf" determines the default Swing

3008 look-and-feel, via internal class name or symbolic name as in the jEdit

3009 menu Global Options / Appearance.

3011 * Support for Proof General and Isar TTY loop has been discontinued.

3012 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

3016 New in Isabelle2014 (August 2014)

3017 ---------------------------------

3019 *** General ***

3021 * Support for official Standard ML within the Isabelle context.

3022 Command 'SML_file' reads and evaluates the given Standard ML file.

3023 Toplevel bindings are stored within the theory context; the initial

3024 environment is restricted to the Standard ML implementation of

3025 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'

3026 and 'SML_export' allow to exchange toplevel bindings between the two

3027 separate environments. See also ~~/src/Tools/SML/Examples.thy for

3028 some examples.

3030 * Standard tactics and proof methods such as "clarsimp", "auto" and

3031 "safe" now preserve equality hypotheses "x = expr" where x is a free

3032 variable. Locale assumptions and chained facts containing "x"

3033 continue to be useful. The new method "hypsubst_thin" and the

3034 configuration option "hypsubst_thin" (within the attribute name space)

3035 restore the previous behavior. INCOMPATIBILITY, especially where

3036 induction is done after these methods or when the names of free and

3037 bound variables clash. As first approximation, old proofs may be

3038 repaired by "using [[hypsubst_thin = true]]" in the critical spot.

3040 * More static checking of proof methods, which allows the system to

3041 form a closure over the concrete syntax. Method arguments should be

3042 processed in the original proof context as far as possible, before

3043 operating on the goal state. In any case, the standard discipline for

3044 subgoal-addressing needs to be observed: no subgoals or a subgoal

3045 number that is out of range produces an empty result sequence, not an

3046 exception. Potential INCOMPATIBILITY for non-conformant tactical

3047 proof tools.

3049 * Lexical syntax (inner and outer) supports text cartouches with

3050 arbitrary nesting, and without escapes of quotes etc. The Prover IDE

3051 supports input via ` (backquote).

3053 * The outer syntax categories "text" (for formal comments and document

3054 markup commands) and "altstring" (for literal fact references) allow

3055 cartouches as well, in addition to the traditional mix of quotations.

3057 * Syntax of document antiquotation @{rail} now uses \<newline> instead

3058 of "\\", to avoid the optical illusion of escaped backslash within

3059 string token. General renovation of its syntax using text cartouches.

3060 Minor INCOMPATIBILITY.

3062 * Discontinued legacy_isub_isup, which was a temporary workaround for

3063 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts

3064 old identifier syntax with \<^isub> or \<^isup>. Potential

3065 INCOMPATIBILITY.

3067 * Document antiquotation @{url} produces markup for the given URL,

3068 which results in an active hyperlink within the text.

3070 * Document antiquotation @{file_unchecked} is like @{file}, but does

3071 not check existence within the file-system.

3073 * Updated and extended manuals: codegen, datatypes, implementation,

3074 isar-ref, jedit, system.

3077 *** Prover IDE -- Isabelle/Scala/jEdit ***

3079 * Improved Document panel: simplified interaction where every single

3080 mouse click (re)opens document via desktop environment or as jEdit

3081 buffer.

3083 * Support for Navigator plugin (with toolbar buttons), with connection

3084 to PIDE hyperlinks.

3086 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.

3087 Open text buffers take precedence over copies within the file-system.

3089 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for

3090 auxiliary ML files.

3092 * Improved syntactic and semantic completion mechanism, with simple

3093 templates, completion language context, name-space completion,

3094 file-name completion, spell-checker completion.

3096 * Refined GUI popup for completion: more robust key/mouse event

3097 handling and propagation to enclosing text area -- avoid loosing

3098 keystrokes with slow / remote graphics displays.

3100 * Completion popup supports both ENTER and TAB (default) to select an

3101 item, depending on Isabelle options.

3103 * Refined insertion of completion items wrt. jEdit text: multiple

3104 selections, rectangular selections, rectangular selection as "tall

3105 caret".

3107 * Integrated spell-checker for document text, comments etc. with

3108 completion popup and context-menu.

3110 * More general "Query" panel supersedes "Find" panel, with GUI access

3111 to commands 'find_theorems' and 'find_consts', as well as print

3112 operations for the context. Minor incompatibility in keyboard

3113 shortcuts etc.: replace action isabelle-find by isabelle-query.

3115 * Search field for all output panels ("Output", "Query", "Info" etc.)

3116 to highlight text via regular expression.

3118 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /

3119 General") allows to specify additional print modes for the prover

3120 process, without requiring old-fashioned command-line invocation of

3121 "isabelle jedit -m MODE".

3123 * More support for remote files (e.g. http) using standard Java

3124 networking operations instead of jEdit virtual file-systems.

3126 * Empty editors buffers that are no longer required (e.g.\ via theory

3127 imports) are automatically removed from the document model.

3129 * Improved monitor panel.

3131 * Improved Console/Scala plugin: more uniform scala.Console output,

3132 more robust treatment of threads and interrupts.

3134 * Improved management of dockable windows: clarified keyboard focus

3135 and window placement wrt. main editor view; optional menu item to

3136 "Detach" a copy where this makes sense.

3138 * New Simplifier Trace panel provides an interactive view of the

3139 simplification process, enabled by the "simp_trace_new" attribute

3140 within the context.

3143 *** Pure ***

3145 * Low-level type-class commands 'classes', 'classrel', 'arities' have

3146 been discontinued to avoid the danger of non-trivial axiomatization

3147 that is not immediately visible. INCOMPATIBILITY, use regular

3148 'instance' command with proof. The required OFCLASS(...) theorem

3149 might be postulated via 'axiomatization' beforehand, or the proof

3150 finished trivially if the underlying class definition is made vacuous

3151 (without any assumptions). See also Isabelle/ML operations

3152 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

3153 Axclass.arity_axiomatization.

3155 * Basic constants of Pure use more conventional names and are always

3156 qualified. Rare INCOMPATIBILITY, but with potentially serious

3157 consequences, notably for tools in Isabelle/ML. The following

3158 renaming needs to be applied:

3160 == ~> Pure.eq

3161 ==> ~> Pure.imp

3162 all ~> Pure.all

3163 TYPE ~> Pure.type

3164 dummy_pattern ~> Pure.dummy_pattern

3166 Systematic porting works by using the following theory setup on a

3167 *previous* Isabelle version to introduce the new name accesses for the

3168 old constants:

3170 setup {*

3171 fn thy => thy

3172 |> Sign.root_path

3173 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="

3174 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"

3175 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"

3176 |> Sign.restore_naming thy

3177 *}

3179 Thus ML antiquotations like @{const_name Pure.eq} may be used already.

3180 Later the application is moved to the current Isabelle version, and

3181 the auxiliary aliases are deleted.

3183 * Attributes "where" and "of" allow an optional context of local

3184 variables ('for' declaration): these variables become schematic in the

3185 instantiated theorem.

3187 * Obsolete attribute "standard" has been discontinued (legacy since

3188 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context

3189 where instantiations with schematic variables are intended (for

3190 declaration commands like 'lemmas' or attributes like "of"). The

3191 following temporary definition may help to port old applications:

3193 attribute_setup standard =

3194 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"

3196 * More thorough check of proof context for goal statements and

3197 attributed fact expressions (concerning background theory, declared

3198 hyps). Potential INCOMPATIBILITY, tools need to observe standard

3199 context discipline. See also Assumption.add_assumes and the more

3200 primitive Thm.assume_hyps.

3202 * Inner syntax token language allows regular quoted strings "..."

3203 (only makes sense in practice, if outer syntax is delimited

3204 differently, e.g. via cartouches).

3206 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,

3207 but the latter is retained some time as Proof General legacy.

3209 * Code generator preprocessor: explicit control of simp tracing on a

3210 per-constant basis. See attribute "code_preproc".

3213 *** HOL ***

3215 * Code generator: enforce case of identifiers only for strict target

3216 language requirements. INCOMPATIBILITY.

3218 * Code generator: explicit proof contexts in many ML interfaces.

3219 INCOMPATIBILITY.

3221 * Code generator: minimize exported identifiers by default. Minor

3222 INCOMPATIBILITY.

3224 * Code generation for SML and OCaml: dropped arcane "no_signatures"

3225 option. Minor INCOMPATIBILITY.

3227 * "declare [[code abort: ...]]" replaces "code_abort ...".

3228 INCOMPATIBILITY.

3230 * "declare [[code drop: ...]]" drops all code equations associated

3231 with the given constants.

3233 * Code generations are provided for make, fields, extend and truncate

3234 operations on records.

3236 * Command and antiquotation "value" are now hardcoded against nbe and

3237 ML. Minor INCOMPATIBILITY.

3239 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.

3241 * The symbol "\<newline>" may be used within char or string literals

3242 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.

3244 * Qualified String.implode and String.explode. INCOMPATIBILITY.

3246 * Simplifier: Enhanced solver of preconditions of rewrite rules can

3247 now deal with conjunctions. For help with converting proofs, the old

3248 behaviour of the simplifier can be restored like this: declare/using

3249 [[simp_legacy_precond]]. This configuration option will disappear

3250 again in the future. INCOMPATIBILITY.

3252 * Simproc "finite_Collect" is no longer enabled by default, due to

3253 spurious crashes and other surprises. Potential INCOMPATIBILITY.

3255 * Moved new (co)datatype package and its dependencies from session

3256 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',

3257 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now

3258 part of theory "Main".

3260 Theory renamings:

3261 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)

3262 Library/Wfrec.thy ~> Wfrec.thy

3263 Library/Zorn.thy ~> Zorn.thy

3264 Cardinals/Order_Relation.thy ~> Order_Relation.thy

3265 Library/Order_Union.thy ~> Cardinals/Order_Union.thy

3266 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

3267 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

3268 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

3269 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

3270 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

3271 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

3272 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

3273 BNF/BNF_Comp.thy ~> BNF_Comp.thy

3274 BNF/BNF_Def.thy ~> BNF_Def.thy

3275 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

3276 BNF/BNF_GFP.thy ~> BNF_GFP.thy

3277 BNF/BNF_LFP.thy ~> BNF_LFP.thy

3278 BNF/BNF_Util.thy ~> BNF_Util.thy

3279 BNF/Coinduction.thy ~> Coinduction.thy

3280 BNF/More_BNFs.thy ~> Library/More_BNFs.thy

3281 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy

3282 BNF/Examples/* ~> BNF_Examples/*

3284 New theories:

3285 Wellorder_Extension.thy (split from Zorn.thy)

3286 Library/Cardinal_Notations.thy

3287 Library/BNF_Axomatization.thy

3288 BNF_Examples/Misc_Primcorec.thy

3289 BNF_Examples/Stream_Processor.thy

3291 Discontinued theories:

3292 BNF/BNF.thy

3293 BNF/Equiv_Relations_More.thy

3295 INCOMPATIBILITY.

3297 * New (co)datatype package:

3298 - Command 'primcorec' is fully implemented.

3299 - Command 'datatype_new' generates size functions ("size_xxx" and

3300 "size") as required by 'fun'.

3301 - BNFs are integrated with the Lifting tool and new-style

3302 (co)datatypes with Transfer.

3303 - Renamed commands:

3304 datatype_new_compat ~> datatype_compat

3305 primrec_new ~> primrec

3306 wrap_free_constructors ~> free_constructors

3307 INCOMPATIBILITY.

3308 - The generated constants "xxx_case" and "xxx_rec" have been renamed

3309 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").

3310 INCOMPATIBILITY.

3311 - The constant "xxx_(un)fold" and related theorems are no longer

3312 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually

3313 using "prim(co)rec".

3314 INCOMPATIBILITY.

3315 - No discriminators are generated for nullary constructors by

3316 default, eliminating the need for the odd "=:" syntax.

3317 INCOMPATIBILITY.

3318 - No discriminators or selectors are generated by default by

3319 "datatype_new", unless custom names are specified or the new

3320 "discs_sels" option is passed.

3321 INCOMPATIBILITY.

3323 * Old datatype package:

3324 - The generated theorems "xxx.cases" and "xxx.recs" have been

3325 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->

3326 "sum.case"). INCOMPATIBILITY.

3327 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have

3328 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,

3329 "prod_case" ~> "case_prod"). INCOMPATIBILITY.

3331 * The types "'a list" and "'a option", their set and map functions,

3332 their relators, and their selectors are now produced using the new

3333 BNF-based datatype package.

3335 Renamed constants:

3336 Option.set ~> set_option

3337 Option.map ~> map_option

3338 option_rel ~> rel_option

3340 Renamed theorems:

3341 set_def ~> set_rec[abs_def]

3342 map_def ~> map_rec[abs_def]

3343 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")

3344 option.recs ~> option.rec

3345 list_all2_def ~> list_all2_iff

3346 set.simps ~> set_simps (or the slightly different "list.set")

3347 map.simps ~> list.map

3348 hd.simps ~> list.sel(1)

3349 tl.simps ~> list.sel(2-3)

3350 the.simps ~> option.sel

3352 INCOMPATIBILITY.

3354 * The following map functions and relators have been renamed:

3355 sum_map ~> map_sum

3356 map_pair ~> map_prod

3357 prod_rel ~> rel_prod

3358 sum_rel ~> rel_sum

3359 fun_rel ~> rel_fun

3360 set_rel ~> rel_set

3361 filter_rel ~> rel_filter

3362 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")

3363 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")

3364 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")

3366 INCOMPATIBILITY.

3368 * Lifting and Transfer:

3369 - a type variable as a raw type is supported

3370 - stronger reflexivity prover

3371 - rep_eq is always generated by lift_definition

3372 - setup for Lifting/Transfer is now automated for BNFs

3373 + holds for BNFs that do not contain a dead variable

3374 + relator_eq, relator_mono, relator_distr, relator_domain,

3375 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,

3376 right_unique, right_total, left_unique, left_total are proved

3377 automatically

3378 + definition of a predicator is generated automatically

3379 + simplification rules for a predicator definition are proved

3380 automatically for datatypes

3381 - consolidation of the setup of Lifting/Transfer

3382 + property that a relator preservers reflexivity is not needed any

3383 more

3384 Minor INCOMPATIBILITY.

3385 + left_total and left_unique rules are now transfer rules

3386 (reflexivity_rule attribute not needed anymore)

3387 INCOMPATIBILITY.

3388 + Domainp does not have to be a separate assumption in

3389 relator_domain theorems (=> more natural statement)

3390 INCOMPATIBILITY.

3391 - registration of code equations is more robust

3392 Potential INCOMPATIBILITY.

3393 - respectfulness proof obligation is preprocessed to a more readable

3394 form

3395 Potential INCOMPATIBILITY.

3396 - eq_onp is always unfolded in respectfulness proof obligation

3397 Potential INCOMPATIBILITY.

3398 - unregister lifting setup for Code_Numeral.integer and

3399 Code_Numeral.natural

3400 Potential INCOMPATIBILITY.

3401 - Lifting.invariant -> eq_onp

3402 INCOMPATIBILITY.

3404 * New internal SAT solver "cdclite" that produces models and proof

3405 traces. This solver replaces the internal SAT solvers "enumerate" and

3406 "dpll". Applications that explicitly used one of these two SAT

3407 solvers should use "cdclite" instead. In addition, "cdclite" is now

3408 the default SAT solver for the "sat" and "satx" proof methods and

3409 corresponding tactics; the old default can be restored using "declare

3410 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.

3412 * SMT module: A new version of the SMT module, temporarily called

3413 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,

3414 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also

3415 supported as oracles. Yices is no longer supported, because no version

3416 of the solver can handle both SMT-LIB 2 and quantifiers.

3418 * Activation of Z3 now works via "z3_non_commercial" system option

3419 (without requiring restart), instead of former settings variable

3420 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu

3421 Plugin Options / Isabelle / General.

3423 * Sledgehammer:

3424 - Z3 can now produce Isar proofs.

3425 - MaSh overhaul:

3426 . New SML-based learning algorithms eliminate the dependency on

3427 Python and increase performance and reliability.

3428 . MaSh and MeSh are now used by default together with the

3429 traditional MePo (Meng-Paulson) relevance filter. To disable

3430 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin

3431 Options / Isabelle / General to "none".

3432 - New option:

3433 smt_proofs

3434 - Renamed options:

3435 isar_compress ~> compress

3436 isar_try0 ~> try0

3438 INCOMPATIBILITY.

3440 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.

3442 * Nitpick:

3443 - Fixed soundness bug whereby mutually recursive datatypes could

3444 take infinite values.

3445 - Fixed soundness bug with low-level number functions such as

3446 "Abs_Integ" and "Rep_Integ".

3447 - Removed "std" option.

3448 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to

3449 "hide_types".

3451 * Metis: Removed legacy proof method 'metisFT'. Use 'metis

3452 (full_types)' instead. INCOMPATIBILITY.

3454 * Try0: Added 'algebra' and 'meson' to the set of proof methods.

3456 * Adjustion of INF and SUP operations:

3457 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.

3458 - Consolidated theorem names containing INFI and SUPR: have INF and

3459 SUP instead uniformly.

3460 - More aggressive normalization of expressions involving INF and Inf

3461 or SUP and Sup.

3462 - INF_image and SUP_image do not unfold composition.

3463 - Dropped facts INF_comp, SUP_comp.

3464 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

3465 simplifier implication in premises. Generalize and replace former

3466 INT_cong, SUP_cong

3468 INCOMPATIBILITY.

3470 * SUP and INF generalized to conditionally_complete_lattice.

3472 * Swapped orientation of facts image_comp and vimage_comp:

3474 image_compose ~> image_comp [symmetric]

3475 image_comp ~> image_comp [symmetric]

3476 vimage_compose ~> vimage_comp [symmetric]

3477 vimage_comp ~> vimage_comp [symmetric]

3479 INCOMPATIBILITY.

3481 * Theory reorganization: split of Big_Operators.thy into

3482 Groups_Big.thy and Lattices_Big.thy.

3484 * Consolidated some facts about big group operators:

3486 setsum_0' ~> setsum.neutral

3487 setsum_0 ~> setsum.neutral_const

3488 setsum_addf ~> setsum.distrib

3489 setsum_cartesian_product ~> setsum.cartesian_product

3490 setsum_cases ~> setsum.If_cases

3491 setsum_commute ~> setsum.commute

3492 setsum_cong ~> setsum.cong

3493 setsum_delta ~> setsum.delta

3494 setsum_delta' ~> setsum.delta'

3495 setsum_diff1' ~> setsum.remove

3496 setsum_empty ~> setsum.empty

3497 setsum_infinite ~> setsum.infinite

3498 setsum_insert ~> setsum.insert

3499 setsum_inter_restrict'' ~> setsum.inter_filter

3500 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

3501 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

3502 setsum_mono_zero_left ~> setsum.mono_neutral_left

3503 setsum_mono_zero_right ~> setsum.mono_neutral_right

3504 setsum_reindex ~> setsum.reindex

3505 setsum_reindex_cong ~> setsum.reindex_cong

3506 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

3507 setsum_restrict_set ~> setsum.inter_restrict

3508 setsum_Plus ~> setsum.Plus

3509 setsum_setsum_restrict ~> setsum.commute_restrict

3510 setsum_Sigma ~> setsum.Sigma

3511 setsum_subset_diff ~> setsum.subset_diff

3512 setsum_Un_disjoint ~> setsum.union_disjoint

3513 setsum_UN_disjoint ~> setsum.UNION_disjoint

3514 setsum_Un_Int ~> setsum.union_inter

3515 setsum_Union_disjoint ~> setsum.Union_disjoint

3516 setsum_UNION_zero ~> setsum.Union_comp

3517 setsum_Un_zero ~> setsum.union_inter_neutral

3518 strong_setprod_cong ~> setprod.strong_cong

3519 strong_setsum_cong ~> setsum.strong_cong

3520 setprod_1' ~> setprod.neutral

3521 setprod_1 ~> setprod.neutral_const

3522 setprod_cartesian_product ~> setprod.cartesian_product

3523 setprod_cong ~> setprod.cong

3524 setprod_delta ~> setprod.delta

3525 setprod_delta' ~> setprod.delta'

3526 setprod_empty ~> setprod.empty

3527 setprod_infinite ~> setprod.infinite

3528 setprod_insert ~> setprod.insert

3529 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

3530 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

3531 setprod_mono_one_left ~> setprod.mono_neutral_left

3532 setprod_mono_one_right ~> setprod.mono_neutral_right

3533 setprod_reindex ~> setprod.reindex

3534 setprod_reindex_cong ~> setprod.reindex_cong

3535 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

3536 setprod_Sigma ~> setprod.Sigma

3537 setprod_subset_diff ~> setprod.subset_diff

3538 setprod_timesf ~> setprod.distrib

3539 setprod_Un2 ~> setprod.union_diff2

3540 setprod_Un_disjoint ~> setprod.union_disjoint

3541 setprod_UN_disjoint ~> setprod.UNION_disjoint

3542 setprod_Un_Int ~> setprod.union_inter

3543 setprod_Union_disjoint ~> setprod.Union_disjoint

3544 setprod_Un_one ~> setprod.union_inter_neutral

3546 Dropped setsum_cong2 (simple variant of setsum.cong).

3547 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)

3548 Dropped setsum_reindex_id, setprod_reindex_id

3549 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).

3551 INCOMPATIBILITY.

3553 * Abolished slightly odd global lattice interpretation for min/max.

3555 Fact consolidations:

3556 min_max.inf_assoc ~> min.assoc

3557 min_max.inf_commute ~> min.commute

3558 min_max.inf_left_commute ~> min.left_commute

3559 min_max.inf_idem ~> min.idem

3560 min_max.inf_left_idem ~> min.left_idem

3561 min_max.inf_right_idem ~> min.right_idem

3562 min_max.sup_assoc ~> max.assoc

3563 min_max.sup_commute ~> max.commute

3564 min_max.sup_left_commute ~> max.left_commute

3565 min_max.sup_idem ~> max.idem

3566 min_max.sup_left_idem ~> max.left_idem

3567 min_max.sup_inf_distrib1 ~> max_min_distrib2

3568 min_max.sup_inf_distrib2 ~> max_min_distrib1

3569 min_max.inf_sup_distrib1 ~> min_max_distrib2

3570 min_max.inf_sup_distrib2 ~> min_max_distrib1

3571 min_max.distrib ~> min_max_distribs

3572 min_max.inf_absorb1 ~> min.absorb1

3573 min_max.inf_absorb2 ~> min.absorb2

3574 min_max.sup_absorb1 ~> max.absorb1

3575 min_max.sup_absorb2 ~> max.absorb2

3576 min_max.le_iff_inf ~> min.absorb_iff1

3577 min_max.le_iff_sup ~> max.absorb_iff2

3578 min_max.inf_le1 ~> min.cobounded1

3579 min_max.inf_le2 ~> min.cobounded2

3580 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

3581 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

3582 min_max.le_infI1 ~> min.coboundedI1

3583 min_max.le_infI2 ~> min.coboundedI2

3584 min_max.le_supI1 ~> max.coboundedI1

3585 min_max.le_supI2 ~> max.coboundedI2

3586 min_max.less_infI1 ~> min.strict_coboundedI1

3587 min_max.less_infI2 ~> min.strict_coboundedI2

3588 min_max.less_supI1 ~> max.strict_coboundedI1

3589 min_max.less_supI2 ~> max.strict_coboundedI2

3590 min_max.inf_mono ~> min.mono

3591 min_max.sup_mono ~> max.mono

3592 min_max.le_infI, min_max.inf_greatest ~> min.boundedI

3593 min_max.le_supI, min_max.sup_least ~> max.boundedI

3594 min_max.le_inf_iff ~> min.bounded_iff

3595 min_max.le_sup_iff ~> max.bounded_iff

3597 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,

3598 min.left_commute, min.left_idem, max.commute, max.assoc,

3599 max.left_commute, max.left_idem directly.

3601 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,

3602 min.cobounded2, max.cobounded1m max.cobounded2 directly.

3604 For min_ac or max_ac, prefer more general collection ac_simps.

3606 INCOMPATIBILITY.

3608 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>

3609 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

3611 * Qualified constant names Wellfounded.acc, Wellfounded.accp.

3612 INCOMPATIBILITY.

3614 * Fact generalization and consolidation:

3615 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

3617 INCOMPATIBILITY.

3619 * Purely algebraic definition of even. Fact generalization and

3620 consolidation:

3621 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

3622 even_zero_(nat|int) ~> even_zero

3624 INCOMPATIBILITY.

3626 * Abolished neg_numeral.

3627 - Canonical representation for minus one is "- 1".

3628 - Canonical representation for other negative numbers is "- (numeral _)".

3629 - When devising rule sets for number calculation, consider the

3630 following canonical cases: 0, 1, numeral _, - 1, - numeral _.

3631 - HOLogic.dest_number also recognizes numerals in non-canonical forms

3632 like "numeral One", "- numeral One", "- 0" and even "- ... - _".

3633 - Syntax for negative numerals is mere input syntax.

3635 INCOMPATIBILITY.

3637 * Reduced name variants for rules on associativity and commutativity:

3639 add_assoc ~> add.assoc

3640 add_commute ~> add.commute

3641 add_left_commute ~> add.left_commute

3642 mult_assoc ~> mult.assoc

3643 mult_commute ~> mult.commute

3644 mult_left_commute ~> mult.left_commute

3645 nat_add_assoc ~> add.assoc

3646 nat_add_commute ~> add.commute

3647 nat_add_left_commute ~> add.left_commute

3648 nat_mult_assoc ~> mult.assoc

3649 nat_mult_commute ~> mult.commute

3650 eq_assoc ~> iff_assoc

3651 eq_left_commute ~> iff_left_commute

3653 INCOMPATIBILITY.

3655 * Fact collections add_ac and mult_ac are considered old-fashioned.

3656 Prefer ac_simps instead, or specify rules

3657 (add|mult).(assoc|commute|left_commute) individually.

3659 * Elimination of fact duplicates:

3660 equals_zero_I ~> minus_unique

3661 diff_eq_0_iff_eq ~> right_minus_eq

3662 nat_infinite ~> infinite_UNIV_nat

3663 int_infinite ~> infinite_UNIV_int

3665 INCOMPATIBILITY.

3667 * Fact name consolidation:

3668 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

3669 minus_le_self_iff ~> neg_less_eq_nonneg

3670 le_minus_self_iff ~> less_eq_neg_nonpos

3671 neg_less_nonneg ~> neg_less_pos

3672 less_minus_self_iff ~> less_neg_neg [simp]

3674 INCOMPATIBILITY.

3676 * More simplification rules on unary and binary minus:

3677 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

3678 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

3679 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

3680 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

3681 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

3682 been taken away from fact collections algebra_simps and field_simps.

3683 INCOMPATIBILITY.

3685 To restore proofs, the following patterns are helpful:

3687 a) Arbitrary failing proof not involving "diff_def":

3688 Consider simplification with algebra_simps or field_simps.

3690 b) Lifting rules from addition to subtraction:

3691 Try with "using <rule for addition> of [... "- _" ...]" by simp".

3693 c) Simplification with "diff_def": just drop "diff_def".

3694 Consider simplification with algebra_simps or field_simps;

3695 or the brute way with

3696 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

3698 * Introduce bdd_above and bdd_below in theory

3699 Conditionally_Complete_Lattices, use them instead of explicitly

3700 stating boundedness of sets.

3702 * ccpo.admissible quantifies only over non-empty chains to allow more

3703 syntax-directed proof rules; the case of the empty chain shows up as

3704 additional case in fixpoint induction proofs. INCOMPATIBILITY.

3706 * Removed and renamed theorems in Series:

3707 summable_le ~> suminf_le

3708 suminf_le ~> suminf_le_const

3709 series_pos_le ~> setsum_le_suminf

3710 series_pos_less ~> setsum_less_suminf

3711 suminf_ge_zero ~> suminf_nonneg

3712 suminf_gt_zero ~> suminf_pos

3713 suminf_gt_zero_iff ~> suminf_pos_iff

3714 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

3715 suminf_0_le ~> suminf_nonneg [rotate]

3716 pos_summable ~> summableI_nonneg_bounded

3717 ratio_test ~> summable_ratio_test

3719 removed series_zero, replaced by sums_finite

3721 removed auxiliary lemmas:

3723 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

3724 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

3725 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

3726 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

3727 summable_convergent_sumr_iff, sumr_diff_mult_const

3729 INCOMPATIBILITY.

3731 * Replace (F)DERIV syntax by has_derivative:

3732 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"

3734 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

3736 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

3738 - removed constant isDiff

3740 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

3741 input syntax.

3743 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

3745 - Renamed FDERIV_... lemmas to has_derivative_...

3747 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

3749 - removed DERIV_intros, has_derivative_eq_intros

3751 - introduced derivative_intros and deriative_eq_intros which

3752 includes now rules for DERIV, has_derivative and

3753 has_vector_derivative.

3755 - Other renamings:

3756 differentiable_def ~> real_differentiable_def

3757 differentiableE ~> real_differentiableE

3758 fderiv_def ~> has_derivative_at

3759 field_fderiv_def ~> field_has_derivative_at

3760 isDiff_der ~> differentiable_def

3761 deriv_fderiv ~> has_field_derivative_def

3762 deriv_def ~> DERIV_def

3764 INCOMPATIBILITY.

3766 * Include more theorems in continuous_intros. Remove the

3767 continuous_on_intros, isCont_intros collections, these facts are now

3768 in continuous_intros.

3770 * Theorems about complex numbers are now stated only using Re and Im,

3771 the Complex constructor is not used anymore. It is possible to use

3772 primcorec to defined the behaviour of a complex-valued function.

3774 Removed theorems about the Complex constructor from the simpset, they

3775 are available as the lemma collection legacy_Complex_simps. This

3776 especially removes

3778 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

3780 Instead the reverse direction is supported with

3781 Complex_eq: "Complex a b = a + \<i> * b"

3783 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

3785 Renamings:

3786 Re/Im ~> complex.sel

3787 complex_Re/Im_zero ~> zero_complex.sel

3788 complex_Re/Im_add ~> plus_complex.sel

3789 complex_Re/Im_minus ~> uminus_complex.sel

3790 complex_Re/Im_diff ~> minus_complex.sel

3791 complex_Re/Im_one ~> one_complex.sel

3792 complex_Re/Im_mult ~> times_complex.sel

3793 complex_Re/Im_inverse ~> inverse_complex.sel

3794 complex_Re/Im_scaleR ~> scaleR_complex.sel

3795 complex_Re/Im_i ~> ii.sel

3796 complex_Re/Im_cnj ~> cnj.sel

3797 Re/Im_cis ~> cis.sel

3799 complex_divide_def ~> divide_complex_def

3800 complex_norm_def ~> norm_complex_def

3801 cmod_def ~> norm_complex_de

3803 Removed theorems:

3804 complex_zero_def

3805 complex_add_def

3806 complex_minus_def

3807 complex_diff_def

3808 complex_one_def

3809 complex_mult_def

3810 complex_inverse_def

3811 complex_scaleR_def

3813 INCOMPATIBILITY.

3815 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

3816 Conditionally_Complete_Lattices. INCOMPATIBILITY.

3818 * HOL-Library: new theory src/HOL/Library/Tree.thy.

3820 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

3821 is subsumed by session Kleene_Algebra in AFP.

3823 * HOL-Library / theory RBT: various constants and facts are hidden;

3824 lifting setup is unregistered. INCOMPATIBILITY.

3826 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

3828 * HOL-Word: bit representations prefer type bool over type bit.

3829 INCOMPATIBILITY.

3831 * HOL-Word:

3832 - Abandoned fact collection "word_arith_alts", which is a duplicate

3833 of "word_arith_wis".

3834 - Dropped first (duplicated) element in fact collections

3835 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

3836 "uint_word_arith_bintrs".

3838 * HOL-Number_Theory:

3839 - consolidated the proofs of the binomial theorem

3840 - the function fib is again of type nat => nat and not overloaded

3841 - no more references to Old_Number_Theory in the HOL libraries

3842 (except the AFP)

3844 INCOMPATIBILITY.

3846 * HOL-Multivariate_Analysis:

3847 - Type class ordered_real_vector for ordered vector spaces.

3848 - New theory Complex_Basic_Analysis defining complex derivatives,

3849 holomorphic functions, etc., ported from HOL Light's canal.ml.

3850 - Changed order of ordered_euclidean_space to be compatible with

3851 pointwise ordering on products. Therefore instance of

3852 conditionally_complete_lattice and ordered_real_vector.

3853 INCOMPATIBILITY: use box instead of greaterThanLessThan or

3854 explicit set-comprehensions with eucl_less for other (half-)open

3855 intervals.

3856 - removed dependencies on type class ordered_euclidean_space with

3857 introduction of "cbox" on euclidean_space

3858 - renamed theorems:

3859 interval ~> box

3860 mem_interval ~> mem_box

3861 interval_eq_empty ~> box_eq_empty

3862 interval_ne_empty ~> box_ne_empty

3863 interval_sing(1) ~> cbox_sing

3864 interval_sing(2) ~> box_sing

3865 subset_interval_imp ~> subset_box_imp

3866 subset_interval ~> subset_box

3867 open_interval ~> open_box

3868 closed_interval ~> closed_cbox

3869 interior_closed_interval ~> interior_cbox

3870 bounded_closed_interval ~> bounded_cbox

3871 compact_interval ~> compact_cbox

3872 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

3873 bounded_subset_closed_interval ~> bounded_subset_cbox

3874 mem_interval_componentwiseI ~> mem_box_componentwiseI

3875 convex_box ~> convex_prod

3876 rel_interior_real_interval ~> rel_interior_real_box

3877 convex_interval ~> convex_box

3878 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

3879 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

3880 content_closed_interval' ~> content_cbox'

3881 elementary_subset_interval ~> elementary_subset_box

3882 diameter_closed_interval ~> diameter_cbox

3883 frontier_closed_interval ~> frontier_cbox

3884 frontier_open_interval ~> frontier_box

3885 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

3886 closure_open_interval ~> closure_box

3887 open_closed_interval_convex ~> open_cbox_convex

3888 open_interval_midpoint ~> box_midpoint

3889 content_image_affinity_interval ~> content_image_affinity_cbox

3890 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

3891 bounded_interval ~> bounded_closed_interval + bounded_boxes

3893 - respective theorems for intervals over the reals:

3894 content_closed_interval + content_cbox

3895 has_integral + has_integral_real

3896 fine_division_exists + fine_division_exists_real

3897 has_integral_null + has_integral_null_real

3898 tagged_division_union_interval + tagged_division_union_interval_real

3899 has_integral_const + has_integral_const_real

3900 integral_const + integral_const_real

3901 has_integral_bound + has_integral_bound_real

3902 integrable_continuous + integrable_continuous_real

3903 integrable_subinterval + integrable_subinterval_real

3904 has_integral_reflect_lemma + has_integral_reflect_lemma_real

3905 integrable_reflect + integrable_reflect_real

3906 integral_reflect + integral_reflect_real

3907 image_affinity_interval + image_affinity_cbox

3908 image_smult_interval + image_smult_cbox

3909 integrable_const + integrable_const_ivl

3910 integrable_on_subinterval + integrable_on_subcbox

3912 - renamed theorems:

3913 derivative_linear ~> has_derivative_bounded_linear

3914 derivative_is_linear ~> has_derivative_linear

3915 bounded_linear_imp_linear ~> bounded_linear.linear

3917 * HOL-Probability:

3918 - Renamed positive_integral to nn_integral:

3920 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

3921 positive_integral_positive ~> nn_integral_nonneg

3923 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

3925 - replaced the Lebesgue integral on real numbers by the more general

3926 Bochner integral for functions into a real-normed vector space.

3928 integral_zero ~> integral_zero / integrable_zero

3929 integral_minus ~> integral_minus / integrable_minus

3930 integral_add ~> integral_add / integrable_add

3931 integral_diff ~> integral_diff / integrable_diff

3932 integral_setsum ~> integral_setsum / integrable_setsum

3933 integral_multc ~> integral_mult_left / integrable_mult_left

3934 integral_cmult ~> integral_mult_right / integrable_mult_right

3935 integral_triangle_inequality~> integral_norm_bound

3936 integrable_nonneg ~> integrableI_nonneg

3937 integral_positive ~> integral_nonneg_AE

3938 integrable_abs_iff ~> integrable_abs_cancel

3939 positive_integral_lim_INF ~> nn_integral_liminf

3940 lebesgue_real_affine ~> lborel_real_affine

3941 borel_integral_has_integral ~> has_integral_lebesgue_integral

3942 integral_indicator ~>

3943 integral_real_indicator / integrable_real_indicator

3944 positive_integral_fst ~> nn_integral_fst'

3945 positive_integral_fst_measurable ~> nn_integral_fst

3946 positive_integral_snd_measurable ~> nn_integral_snd

3948 integrable_fst_measurable ~>

3949 integral_fst / integrable_fst / AE_integrable_fst

3951 integrable_snd_measurable ~>

3952 integral_snd / integrable_snd / AE_integrable_snd

3954 integral_monotone_convergence ~>

3955 integral_monotone_convergence / integrable_monotone_convergence

3957 integral_monotone_convergence_at_top ~>

3958 integral_monotone_convergence_at_top /

3959 integrable_monotone_convergence_at_top

3961 has_integral_iff_positive_integral_lebesgue ~>

3962 has_integral_iff_has_bochner_integral_lebesgue_nonneg

3964 lebesgue_integral_has_integral ~>

3965 has_integral_integrable_lebesgue_nonneg

3967 positive_integral_lebesgue_has_integral ~>

3968 integral_has_integral_lebesgue_nonneg /

3969 integrable_has_integral_lebesgue_nonneg

3971 lebesgue_integral_real_affine ~>

3972 nn_integral_real_affine

3974 has_integral_iff_positive_integral_lborel ~>

3975 integral_has_integral_nonneg / integrable_has_integral_nonneg

3977 The following theorems where removed:

3979 lebesgue_integral_nonneg

3980 lebesgue_integral_uminus

3981 lebesgue_integral_cmult

3982 lebesgue_integral_multc

3983 lebesgue_integral_cmult_nonneg

3984 integral_cmul_indicator

3985 integral_real

3987 - Formalized properties about exponentially, Erlang, and normal

3988 distributed random variables.

3990 * HOL-Decision_Procs: Separate command 'approximate' for approximative

3991 computation in src/HOL/Decision_Procs/Approximation. Minor

3992 INCOMPATIBILITY.

3995 *** Scala ***

3997 * The signature and semantics of Document.Snapshot.cumulate_markup /

3998 select_markup have been clarified. Markup is now traversed in the

3999 order of reports given by the prover: later markup is usually more

4000 specific and may override results accumulated so far. The elements

4001 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

4003 * Substantial reworking of internal PIDE protocol communication

4004 channels. INCOMPATIBILITY.

4007 *** ML ***

4009 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

4010 compared (according to Thm.thm_ord), but assumed to be covered by the

4011 current background theory. Thus equivalent data produced in different

4012 branches of the theory graph usually coincides (e.g. relevant for

4013 theory merge). Note that the softer Thm.eq_thm_prop is often more

4014 appropriate than Thm.eq_thm.

4016 * Proper context for basic Simplifier operations: rewrite_rule,

4017 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

4018 pass runtime Proof.context (and ensure that the simplified entity

4019 actually belongs to it).

4021 * Proper context discipline for read_instantiate and instantiate_tac:

4022 variables that are meant to become schematic need to be given as

4023 fixed, and are generalized by the explicit context of local variables.

4024 This corresponds to Isar attributes "where" and "of" with 'for'

4025 declaration. INCOMPATIBILITY, also due to potential change of indices

4026 of schematic variables.

4028 * Moved ML_Compiler.exn_trace and other operations on exceptions to

4029 structure Runtime. Minor INCOMPATIBILITY.

4031 * Discontinued old Toplevel.debug in favour of system option

4032 "ML_exception_trace", which may be also declared within the context

4033 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

4035 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

4036 INCOMPATIBILITY.

4038 * Configuration option "ML_print_depth" controls the pretty-printing

4039 depth of the ML compiler within the context. The old print_depth in

4040 ML is still available as default_print_depth, but rarely used. Minor

4041 INCOMPATIBILITY.

4043 * Toplevel function "use" refers to raw ML bootstrap environment,

4044 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

4045 Note that 'ML_file' is the canonical command to load ML files into the

4046 formal context.

4048 * Simplified programming interface to define ML antiquotations, see

4049 structure ML_Antiquotation. Minor INCOMPATIBILITY.

4051 * ML antiquotation @{here} refers to its source position, which is

4052 occasionally useful for experimentation and diagnostic purposes.

4054 * ML antiquotation @{path} produces a Path.T value, similarly to

4055 Path.explode, but with compile-time check against the file-system and

4056 some PIDE markup. Note that unlike theory source, ML does not have a

4057 well-defined master directory, so an absolute symbolic path

4058 specification is usually required, e.g. "~~/src/HOL".

4060 * ML antiquotation @{print} inlines a function to print an arbitrary

4061 ML value, which is occasionally useful for diagnostic or demonstration

4062 purposes.

4065 *** System ***

4067 * Proof General with its traditional helper scripts is now an optional

4068 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

4069 component repository http://isabelle.in.tum.de/components/. Note that

4070 the "system" manual provides general explanations about add-on

4071 components, especially those that are not bundled with the release.

4073 * The raw Isabelle process executable has been renamed from

4074 "isabelle-process" to "isabelle_process", which conforms to common

4075 shell naming conventions, and allows to define a shell function within

4076 the Isabelle environment to avoid dynamic path lookup. Rare

4077 incompatibility for old tools that do not use the ISABELLE_PROCESS

4078 settings variable.

4080 * Former "isabelle tty" has been superseded by "isabelle console",

4081 with implicit build like "isabelle jedit", and without the mostly

4082 obsolete Isar TTY loop.

4084 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

4085 and PDF_VIEWER now refer to the actual programs, not shell

4086 command-lines. Discontinued option -c: invocation may be asynchronous

4087 via desktop environment, without any special precautions. Potential

4088 INCOMPATIBILITY with ambitious private settings.

4090 * Removed obsolete "isabelle unsymbolize". Note that the usual format

4091 for email communication is the Unicode rendering of Isabelle symbols,

4092 as produced by Isabelle/jEdit, for example.

4094 * Removed obsolete tool "wwwfind". Similar functionality may be

4095 integrated into Isabelle/jEdit eventually.

4097 * Improved 'display_drafts' concerning desktop integration and

4098 repeated invocation in PIDE front-end: re-use single file

4099 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

4101 * Session ROOT specifications require explicit 'document_files' for

4102 robust dependencies on LaTeX sources. Only these explicitly given

4103 files are copied to the document output directory, before document

4104 processing is started.

4106 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

4107 of TeX Live from Cygwin.

4111 New in Isabelle2013-2 (December 2013)

4112 -------------------------------------

4114 *** Prover IDE -- Isabelle/Scala/jEdit ***

4116 * More robust editing of running commands with internal forks,

4117 e.g. non-terminating 'by' steps.

4119 * More relaxed Sledgehammer panel: avoid repeated application of query

4120 after edits surrounding the command location.

4122 * More status information about commands that are interrupted

4123 accidentally (via physical event or Poly/ML runtime system signal,

4124 e.g. out-of-memory).

4127 *** System ***

4129 * More robust termination of external processes managed by

4130 Isabelle/ML: support cancellation of tasks within the range of

4131 milliseconds, as required for PIDE document editing with automatically

4132 tried tools (e.g. Sledgehammer).

4134 * Reactivated Isabelle/Scala kill command for external processes on

4135 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

4136 workaround for some Debian/Ubuntu Linux versions from 2013.

4140 New in Isabelle2013-1 (November 2013)

4141 -------------------------------------

4143 *** General ***

4145 * Discontinued obsolete 'uses' within theory header. Note that

4146 commands like 'ML_file' work without separate declaration of file

4147 dependencies. Minor INCOMPATIBILITY.

4149 * Discontinued redundant 'use' command, which was superseded by

4150 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

4152 * Simplified subscripts within identifiers, using plain \<^sub>

4153 instead of the second copy \<^isub> and \<^isup>. Superscripts are

4154 only for literal tokens within notation; explicit mixfix annotations

4155 for consts or fixed variables may be used as fall-back for unusual

4156 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

4157 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

4158 standardize symbols as a starting point for further manual cleanup.

4159 The ML reference variable "legacy_isub_isup" may be set as temporary

4160 workaround, to make the prover accept a subset of the old identifier

4161 syntax.

4163 * Document antiquotations: term style "isub" has been renamed to

4164 "sub". Minor INCOMPATIBILITY.

4166 * Uniform management of "quick_and_dirty" as system option (see also

4167 "isabelle options"), configuration option within the context (see also

4168 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

4169 INCOMPATIBILITY, need to use more official Isabelle means to access

4170 quick_and_dirty, instead of historical poking into mutable reference.

4172 * Renamed command 'print_configs' to 'print_options'. Minor

4173 INCOMPATIBILITY.

4175 * Proper diagnostic command 'print_state'. Old 'pr' (with its

4176 implicit change of some global references) is retained for now as

4177 control command, e.g. for ProofGeneral 3.7.x.

4179 * Discontinued 'print_drafts' command with its old-fashioned PS output

4180 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

4181 'display_drafts' instead and print via the regular document viewer.

4183 * Updated and extended "isar-ref" and "implementation" manual,

4184 eliminated old "ref" manual.

4187 *** Prover IDE -- Isabelle/Scala/jEdit ***

4189 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

4190 Documentation panel.

4192 * Dockable window "Documentation" provides access to Isabelle

4193 documentation.

4195 * Dockable window "Find" provides query operations for formal entities

4196 (GUI front-end to 'find_theorems' command).

4198 * Dockable window "Sledgehammer" manages asynchronous / parallel

4199 sledgehammer runs over existing document sources, independently of

4200 normal editing and checking process.

4202 * Dockable window "Timing" provides an overview of relevant command

4203 timing information, depending on option jedit_timing_threshold. The

4204 same timing information is shown in the extended tooltip of the

4205 command keyword, when hovering the mouse over it while the CONTROL or

4206 COMMAND modifier is pressed.

4208 * Improved dockable window "Theories": Continuous checking of proof

4209 document (visible and required parts) may be controlled explicitly,

4210 using check box or shortcut "C+e ENTER". Individual theory nodes may

4211 be marked explicitly as required and checked in full, using check box

4212 or shortcut "C+e SPACE".

4214 * Improved completion mechanism, which is now managed by the

4215 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

4216 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

4218 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

4219 isabelle.complete for explicit completion in Isabelle sources.

4220 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

4221 to resolve conflict.

4223 * Improved support of various "minor modes" for Isabelle NEWS,

4224 options, session ROOT etc., with completion and SideKick tree view.

4226 * Strictly monotonic document update, without premature cancellation of

4227 running transactions that are still needed: avoid reset/restart of

4228 such command executions while editing.

4230 * Support for asynchronous print functions, as overlay to existing

4231 document content.

4233 * Support for automatic tools in HOL, which try to prove or disprove

4234 toplevel theorem statements.

4236 * Action isabelle.reset-font-size resets main text area font size

4237 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

4238 also "Plugin Options / Isabelle / General"). It can be bound to some

4239 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

4241 * File specifications in jEdit (e.g. file browser) may refer to

4242 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

4243 obsolete $ISABELLE_HOME_WINDOWS variable.

4245 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

4246 / Global Options / Appearance".

4248 * Improved support of native Mac OS X functionality via "MacOSX"

4249 plugin, which is now enabled by default.

4252 *** Pure ***

4254 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

4255 In particular, 'interpretation' allows for non-persistent

4256 interpretation within "context ... begin ... end" blocks offering a

4257 light-weight alternative to 'sublocale'. See "isar-ref" manual for

4258 details.

4260 * Improved locales diagnostic command 'print_dependencies'.

4262 * Discontinued obsolete 'axioms' command, which has been marked as

4263 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

4264 instead, while observing its uniform scope for polymorphism.

4266 * Discontinued empty name bindings in 'axiomatization'.

4267 INCOMPATIBILITY.

4269 * System option "proofs" has been discontinued. Instead the global

4270 state of Proofterm.proofs is persistently compiled into logic images

4271 as required, notably HOL-Proofs. Users no longer need to change

4272 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

4274 * Syntax translation functions (print_translation etc.) always depend

4275 on Proof.context. Discontinued former "(advanced)" option -- this is

4276 now the default. Minor INCOMPATIBILITY.

4278 * Former global reference trace_unify_fail is now available as

4279 configuration option "unify_trace_failure" (global context only).

4281 * SELECT_GOAL now retains the syntactic context of the overall goal

4282 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

4283 situations.

4286 *** HOL ***

4288 * Stronger precedence of syntax for big intersection and union on

4289 sets, in accordance with corresponding lattice operations.

4290 INCOMPATIBILITY.

4292 * Notation "{p:A. P}" now allows tuple patterns as well.

4294 * Nested case expressions are now translated in a separate check phase

4295 rather than during parsing. The data for case combinators is separated

4296 from the datatype package. The declaration attribute

4297 "case_translation" can be used to register new case combinators:

4299 declare [[case_translation case_combinator constructor1 ... constructorN]]

4301 * Code generator:

4302 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

4303 'code_instance'.

4304 - 'code_identifier' declares name hints for arbitrary identifiers in

4305 generated code, subsuming 'code_modulename'.

4307 See the isar-ref manual for syntax diagrams, and the HOL theories for

4308 examples.

4310 * Attibute 'code': 'code' now declares concrete and abstract code

4311 equations uniformly. Use explicit 'code equation' and 'code abstract'

4312 to distinguish both when desired.

4314 * Discontinued theories Code_Integer and Efficient_Nat by a more

4315 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

4316 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

4317 generation for details. INCOMPATIBILITY.

4319 * Numeric types are mapped by default to target language numerals:

4320 natural (replaces former code_numeral) and integer (replaces former

4321 code_int). Conversions are available as integer_of_natural /

4322 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

4323 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

4324 ML). INCOMPATIBILITY.

4326 * Function package: For mutually recursive functions f and g, separate

4327 cases rules f.cases and g.cases are generated instead of unusable

4328 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

4329 in the case that the unusable rule was used nevertheless.

4331 * Function package: For each function f, new rules f.elims are

4332 generated, which eliminate equalities of the form "f x = t".

4334 * New command 'fun_cases' derives ad-hoc elimination rules for

4335 function equations as simplified instances of f.elims, analogous to

4336 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

4338 * Lifting:

4339 - parametrized correspondence relations are now supported:

4340 + parametricity theorems for the raw term can be specified in

4341 the command lift_definition, which allow us to generate stronger

4342 transfer rules

4343 + setup_lifting generates stronger transfer rules if parametric

4344 correspondence relation can be generated

4345 + various new properties of the relator must be specified to support

4346 parametricity

4347 + parametricity theorem for the Quotient relation can be specified

4348 - setup_lifting generates domain rules for the Transfer package

4349 - stronger reflexivity prover of respectfulness theorems for type

4350 copies

4351 - ===> and --> are now local. The symbols can be introduced

4352 by interpreting the locale lifting_syntax (typically in an

4353 anonymous context)

4354 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

4355 Main. Potential INCOMPATIBILITY

4356 - new commands for restoring and deleting Lifting/Transfer context:

4357 lifting_forget, lifting_update

4358 - the command print_quotmaps was renamed to print_quot_maps.

4359 INCOMPATIBILITY

4361 * Transfer:

4362 - better support for domains in Transfer: replace Domainp T

4363 by the actual invariant in a transferred goal

4364 - transfer rules can have as assumptions other transfer rules

4365 - Experimental support for transferring from the raw level to the

4366 abstract level: Transfer.transferred attribute

4367 - Attribute version of the transfer method: untransferred attribute

4369 * Reification and reflection:

4370 - Reification is now directly available in HOL-Main in structure

4371 "Reification".

4372 - Reflection now handles multiple lists with variables also.

4373 - The whole reflection stack has been decomposed into conversions.

4374 INCOMPATIBILITY.

4376 * Revised devices for recursive definitions over finite sets:

4377 - Only one fundamental fold combinator on finite set remains:

4378 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

4379 This is now identity on infinite sets.

4380 - Locales ("mini packages") for fundamental definitions with

4381 Finite_Set.fold: folding, folding_idem.

4382 - Locales comm_monoid_set, semilattice_order_set and

4383 semilattice_neutr_order_set for big operators on sets.

4384 See theory Big_Operators for canonical examples.

4385 Note that foundational constants comm_monoid_set.F and

4386 semilattice_set.F correspond to former combinators fold_image

4387 and fold1 respectively. These are now gone. You may use

4388 those foundational constants as substitutes, but it is

4389 preferable to interpret the above locales accordingly.

4390 - Dropped class ab_semigroup_idem_mult (special case of lattice,

4391 no longer needed in connection with Finite_Set.fold etc.)

4392 - Fact renames:

4393 card.union_inter ~> card_Un_Int [symmetric]

4394 card.union_disjoint ~> card_Un_disjoint

4395 INCOMPATIBILITY.

4397 * Locale hierarchy for abstract orderings and (semi)lattices.

4399 * Complete_Partial_Order.admissible is defined outside the type class

4400 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

4401 class predicate assumption or sort constraint when possible.

4402 INCOMPATIBILITY.

4404 * Introduce type class "conditionally_complete_lattice": Like a

4405 complete lattice but does not assume the existence of the top and

4406 bottom elements. Allows to generalize some lemmas about reals and

4407 extended reals. Removed SupInf and replaced it by the instantiation

4408 of conditionally_complete_lattice for real. Renamed lemmas about

4409 conditionally-complete lattice from Sup_... to cSup_... and from

4410 Inf_... to cInf_... to avoid hidding of similar complete lattice

4411 lemmas.

4413 * Introduce type class linear_continuum as combination of

4414 conditionally-complete lattices and inner dense linorders which have

4415 more than one element. INCOMPATIBILITY.

4417 * Introduced type classes order_top and order_bot. The old classes top

4418 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

4419 Rename bot -> order_bot, top -> order_top

4421 * Introduce type classes "no_top" and "no_bot" for orderings without

4422 top and bottom elements.

4424 * Split dense_linorder into inner_dense_order and no_top, no_bot.

4426 * Complex_Main: Unify and move various concepts from

4427 HOL-Multivariate_Analysis to HOL-Complex_Main.

4429 - Introduce type class (lin)order_topology and

4430 linear_continuum_topology. Allows to generalize theorems about

4431 limits and order. Instances are reals and extended reals.

4433 - continuous and continuos_on from Multivariate_Analysis:

4434 "continuous" is the continuity of a function at a filter. "isCont"

4435 is now an abbrevitation: "isCont x f == continuous (at _) f".

4437 Generalized continuity lemmas from isCont to continuous on an

4438 arbitrary filter.

4440 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

4441 compactness of closed intervals on reals. Continuous functions

4442 attain infimum and supremum on compact sets. The inverse of a

4443 continuous function is continuous, when the function is continuous

4444 on a compact set.

4446 - connected from Multivariate_Analysis. Use it to prove the

4447 intermediate value theorem. Show connectedness of intervals on

4448 linear_continuum_topology).

4450 - first_countable_topology from Multivariate_Analysis. Is used to

4451 show equivalence of properties on the neighbourhood filter of x and

4452 on all sequences converging to x.

4454 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

4455 theorems from Library/FDERIV.thy to Deriv.thy and base the

4456 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

4457 which are restricted to sets, i.e. to represent derivatives from

4458 left or right.

4460 - Removed the within-filter. It is replaced by the principal filter:

4462 F within X = inf F (principal X)

4464 - Introduce "at x within U" as a single constant, "at x" is now an

4465 abbreviation for "at x within UNIV"

4467 - Introduce named theorem collections tendsto_intros,

4468 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

4469 in tendsto_intros (or FDERIV_intros) are also available as

4470 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

4471 is replaced by a congruence rule. This allows to apply them as

4472 intro rules and then proving equivalence by the simplifier.

4474 - Restructured theories in HOL-Complex_Main:

4476 + Moved RealDef and RComplete into Real

4478 + Introduced Topological_Spaces and moved theorems about

4479 topological spaces, filters, limits and continuity to it

4481 + Renamed RealVector to Real_Vector_Spaces

4483 + Split Lim, SEQ, Series into Topological_Spaces,

4484 Real_Vector_Spaces, and Limits

4486 + Moved Ln and Log to Transcendental

4488 + Moved theorems about continuity from Deriv to Topological_Spaces

4490 - Remove various auxiliary lemmas.

4492 INCOMPATIBILITY.

4494 * Nitpick:

4495 - Added option "spy".

4496 - Reduce incidence of "too high arity" errors.

4498 * Sledgehammer:

4499 - Renamed option:

4500 isar_shrink ~> isar_compress

4501 INCOMPATIBILITY.

4502 - Added options "isar_try0", "spy".

4503 - Better support for "isar_proofs".

4504 - MaSh has been fined-tuned and now runs as a local server.

4506 * Improved support for ad hoc overloading of constants (see also

4507 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

4509 * Library/Polynomial.thy:

4510 - Use lifting for primitive definitions.

4511 - Explicit conversions from and to lists of coefficients, used for

4512 generated code.

4513 - Replaced recursion operator poly_rec by fold_coeffs.

4514 - Prefer pre-existing gcd operation for gcd.

4515 - Fact renames:

4516 poly_eq_iff ~> poly_eq_poly_eq_iff

4517 poly_ext ~> poly_eqI

4518 expand_poly_eq ~> poly_eq_iff

4519 IMCOMPATIBILITY.

4521 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

4522 case_of_simps to convert function definitions between a list of

4523 equations with patterns on the lhs and a single equation with case

4524 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

4526 * New Library/FSet.thy: type of finite sets defined as a subtype of

4527 sets defined by Lifting/Transfer.

4529 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

4531 * Consolidation of library theories on product orders:

4533 Product_Lattice ~> Product_Order -- pointwise order on products

4534 Product_ord ~> Product_Lexorder -- lexicographic order on products

4536 INCOMPATIBILITY.

4538 * Imperative-HOL: The MREC combinator is considered legacy and no

4539 longer included by default. INCOMPATIBILITY, use partial_function

4540 instead, or import theory Legacy_Mrec as a fallback.

4542 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

4543 ~~/src/HOL/Algebra/poly. Existing theories should be based on

4544 ~~/src/HOL/Library/Polynomial instead. The latter provides

4545 integration with HOL's type classes for rings. INCOMPATIBILITY.

4547 * HOL-BNF:

4548 - Various improvements to BNF-based (co)datatype package, including

4549 new commands "primrec_new", "primcorec", and

4550 "datatype_new_compat", as well as documentation. See

4551 "datatypes.pdf" for details.

4552 - New "coinduction" method to avoid some boilerplate (compared to

4553 coinduct).

4554 - Renamed keywords:

4555 data ~> datatype_new

4556 codata ~> codatatype

4557 bnf_def ~> bnf

4558 - Renamed many generated theorems, including

4559 discs ~> disc

4560 map_comp' ~> map_comp

4561 map_id' ~> map_id

4562 sels ~> sel

4563 set_map' ~> set_map

4564 sets ~> set

4565 IMCOMPATIBILITY.

4568 *** ML ***

4570 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

4571 "check_property" allows to check specifications of the form "ALL x y

4572 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

4573 Examples.thy in particular.

4575 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

4576 tracing output in the command transaction context instead of physical

4577 stdout. See also Toplevel.debug, Toplevel.debugging and

4578 ML_Compiler.exn_trace.

4580 * ML type "theory" is now immutable, without any special treatment of

4581 drafts or linear updates (which could lead to "stale theory" errors in

4582 the past). Discontinued obsolete operations like Theory.copy,

4583 Theory.checkpoint, and the auxiliary type theory_ref. Minor

4584 INCOMPATIBILITY.

4586 * More uniform naming of goal functions for skipped proofs:

4588 Skip_Proof.prove ~> Goal.prove_sorry

4589 Skip_Proof.prove_global ~> Goal.prove_sorry_global

4591 Minor INCOMPATIBILITY.

4593 * Simplifier tactics and tools use proper Proof.context instead of

4594 historic type simpset. Old-style declarations like addsimps,

4595 addsimprocs etc. operate directly on Proof.context. Raw type simpset

4596 retains its use as snapshot of the main Simplifier context, using

4597 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

4598 old tools by making them depend on (ctxt : Proof.context) instead of

4599 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

4601 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

4602 operate on Proof.context instead of claset, for uniformity with addIs,

4603 addEs, addDs etc. Note that claset_of and put_claset allow to manage

4604 clasets separately from the context.

4606 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

4607 INCOMPATIBILITY, use @{context} instead.

4609 * Antiquotation @{theory_context A} is similar to @{theory A}, but

4610 presents the result as initial Proof.context.

4613 *** System ***

4615 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

4616 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

4618 * Discontinued obsolete isabelle-process options -f and -u (former

4619 administrative aliases of option -e). Minor INCOMPATIBILITY.

4621 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

4622 settings variable.

4624 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

4625 document formats: dvi.gz, ps, ps.gz -- the default document format is

4626 always pdf.

4628 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

4629 specify global resources of the JVM process run by isabelle build.

4631 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

4632 to run Isabelle/Scala source files as standalone programs.

4634 * Improved "isabelle keywords" tool (for old-style ProofGeneral

4635 keyword tables): use Isabelle/Scala operations, which inspect outer

4636 syntax without requiring to build sessions first.

4638 * Sessions may be organized via 'chapter' specifications in the ROOT

4639 file, which determines a two-level hierarchy of browser info. The old

4640 tree-like organization via implicit sub-session relation (with its

4641 tendency towards erratic fluctuation of URLs) has been discontinued.

4642 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

4643 for HTML presentation of theories.

4647 New in Isabelle2013 (February 2013)

4648 -----------------------------------

4650 *** General ***

4652 * Theorem status about oracles and unfinished/failed future proofs is

4653 no longer printed by default, since it is incompatible with

4654 incremental / parallel checking of the persistent document model. ML

4655 function Thm.peek_status may be used to inspect a snapshot of the

4656 ongoing evaluation process. Note that in batch mode --- notably

4657 isabelle build --- the system ensures that future proofs of all

4658 accessible theorems in the theory context are finished (as before).

4660 * Configuration option show_markup controls direct inlining of markup

4661 into the printed representation of formal entities --- notably type

4662 and sort constraints. This enables Prover IDE users to retrieve that

4663 information via tooltips in the output window, for example.

4665 * Command 'ML_file' evaluates ML text from a file directly within the

4666 theory, without any predeclaration via 'uses' in the theory header.

4668 * Old command 'use' command and corresponding keyword 'uses' in the

4669 theory header are legacy features and will be discontinued soon.

4670 Tools that load their additional source files may imitate the

4671 'ML_file' implementation, such that the system can take care of

4672 dependencies properly.

4674 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

4675 is called fastforce / fast_force_tac already since Isabelle2011-1.

4677 * Updated and extended "isar-ref" and "implementation" manual, reduced

4678 remaining material in old "ref" manual.

4680 * Improved support for auxiliary contexts that indicate block structure

4681 for specifications. Nesting of "context fixes ... context assumes ..."

4682 and "class ... context ...".

4684 * Attribute "consumes" allows a negative value as well, which is

4685 interpreted relatively to the total number of premises of the rule in

4686 the target context. This form of declaration is stable when exported

4687 from a nested 'context' with additional assumptions. It is the

4688 preferred form for definitional packages, notably cases/rules produced

4689 in HOL/inductive and HOL/function.

4691 * More informative error messages for Isar proof commands involving

4692 lazy enumerations (method applications etc.).

4694 * Refined 'help' command to retrieve outer syntax commands according

4695 to name patterns (with clickable results).

4698 *** Prover IDE -- Isabelle/Scala/jEdit ***

4700 * Parallel terminal proofs ('by') are enabled by default, likewise

4701 proofs that are built into packages like 'datatype', 'function'. This

4702 allows to "run ahead" checking the theory specifications on the

4703 surface, while the prover is still crunching on internal

4704 justifications. Unfinished / cancelled proofs are restarted as

4705 required to complete full proof checking eventually.

4707 * Improved output panel with tooltips, hyperlinks etc. based on the

4708 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

4709 tooltips leads to some window that supports the same recursively,

4710 which can lead to stacks of tooltips as the semantic document content

4711 is explored. ESCAPE closes the whole stack, individual windows may be

4712 closed separately, or detached to become independent jEdit dockables.

4714 * Improved support for commands that produce graph output: the text

4715 message contains a clickable area to open a new instance of the graph

4716 browser on demand.

4718 * More robust incremental parsing of outer syntax (partial comments,

4719 malformed symbols). Changing the balance of open/close quotes and

4720 comment delimiters works more conveniently with unfinished situations

4721 that frequently occur in user interaction.

4723 * More efficient painting and improved reactivity when editing large

4724 files. More scalable management of formal document content.

4726 * Smarter handling of tracing messages: prover process pauses after

4727 certain number of messages per command transaction, with some user

4728 dialog to stop or continue. This avoids swamping the front-end with

4729 potentially infinite message streams.

4731 * More plugin options and preferences, based on Isabelle/Scala. The

4732 jEdit plugin option panel provides access to some Isabelle/Scala

4733 options, including tuning parameters for editor reactivity and color

4734 schemes.

4736 * Dockable window "Symbols" provides some editing support for Isabelle

4737 symbols.

4739 * Dockable window "Monitor" shows ML runtime statistics. Note that

4740 continuous display of the chart slows down the system.

4742 * Improved editing support for control styles: subscript, superscript,

4743 bold, reset of style -- operating on single symbols or text

4744 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

4746 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

4747 adjust the main text area font size, and its derivatives for output,

4748 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

4749 need to be adapted to local keyboard layouts.

4751 * More reactive completion popup by default: use \t (TAB) instead of

4752 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

4753 also "Plugin Options / SideKick / General / Code Completion Options".

4755 * Implicit check and build dialog of the specified logic session

4756 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

4757 demand, without bundling big platform-dependent heap images in the

4758 Isabelle distribution.

4760 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

4761 from Oracle provide better multi-platform experience. This version is

4762 now bundled exclusively with Isabelle.

4765 *** Pure ***

4767 * Code generation for Haskell: restrict unqualified imports from

4768 Haskell Prelude to a small set of fundamental operations.

4770 * Command 'export_code': relative file names are interpreted

4771 relatively to master directory of current theory rather than the

4772 rather arbitrary current working directory. INCOMPATIBILITY.

4774 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

4775 use regular rule composition via "OF" / "THEN", or explicit proof

4776 structure instead. Note that Isabelle/ML provides a variety of

4777 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

4778 with some care where this is really required.

4780 * Command 'typ' supports an additional variant with explicit sort

4781 constraint, to infer and check the most general type conforming to a

4782 given sort. Example (in HOL):

4784 typ "_ * _ * bool * unit" :: finite

4786 * Command 'locale_deps' visualizes all locales and their relations as

4787 a Hasse diagram.

4790 *** HOL ***

4792 * Sledgehammer:

4794 - Added MaSh relevance filter based on machine-learning; see the

4795 Sledgehammer manual for details.

4796 - Polished Isar proofs generated with "isar_proofs" option.

4797 - Rationalized type encodings ("type_enc" option).

4798 - Renamed "kill_provers" subcommand to "kill_all".

4799 - Renamed options:

4800 isar_proof ~> isar_proofs

4801 isar_shrink_factor ~> isar_shrink

4802 max_relevant ~> max_facts

4803 relevance_thresholds ~> fact_thresholds

4805 * Quickcheck: added an optimisation for equality premises. It is

4806 switched on by default, and can be switched off by setting the

4807 configuration quickcheck_optimise_equality to false.

4809 * Quotient: only one quotient can be defined by quotient_type

4810 INCOMPATIBILITY.

4812 * Lifting:

4813 - generation of an abstraction function equation in lift_definition

4814 - quot_del attribute

4815 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

4817 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

4818 expressions.

4820 * Preprocessing of the code generator rewrites set comprehensions into

4821 pointfree expressions.

4823 * The SMT solver Z3 has now by default a restricted set of directly

4824 supported features. For the full set of features (div/mod, nonlinear

4825 arithmetic, datatypes/records) with potential proof reconstruction

4826 failures, enable the configuration option "z3_with_extensions". Minor

4827 INCOMPATIBILITY.

4829 * Simplified 'typedef' specifications: historical options for implicit

4830 set definition and alternative name have been discontinued. The

4831 former behavior of "typedef (open) t = A" is now the default, but

4832 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

4833 accordingly.

4835 * Removed constant "chars"; prefer "Enum.enum" on type "char"

4836 directly. INCOMPATIBILITY.

4838 * Moved operation product, sublists and n_lists from theory Enum to

4839 List. INCOMPATIBILITY.

4841 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

4843 * Class "comm_monoid_diff" formalises properties of bounded

4844 subtraction, with natural numbers and multisets as typical instances.

4846 * Added combinator "Option.these" with type "'a option set => 'a set".

4848 * Theory "Transitive_Closure": renamed lemmas

4850 reflcl_tranclp -> reflclp_tranclp

4851 rtranclp_reflcl -> rtranclp_reflclp

4853 INCOMPATIBILITY.

4855 * Theory "Rings": renamed lemmas (in class semiring)

4857 left_distrib ~> distrib_right

4858 right_distrib ~> distrib_left

4860 INCOMPATIBILITY.

4862 * Generalized the definition of limits:

4864 - Introduced the predicate filterlim (LIM x F. f x :> G) which

4865 expresses that when the input values x converge to F then the

4866 output f x converges to G.

4868 - Added filters for convergence to positive (at_top) and negative

4869 infinity (at_bot).

4871 - Moved infinity in the norm (at_infinity) from

4872 Multivariate_Analysis to Complex_Main.

4874 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

4875 at_top".

4877 INCOMPATIBILITY.

4879 * Theory "Library/Option_ord" provides instantiation of option type to

4880 lattice type classes.

4882 * Theory "Library/Multiset": renamed

4884 constant fold_mset ~> Multiset.fold

4885 fact fold_mset_commute ~> fold_mset_comm

4887 INCOMPATIBILITY.

4889 * Renamed theory Library/List_Prefix to Library/Sublist, with related

4890 changes as follows.

4892 - Renamed constants (and related lemmas)

4894 prefix ~> prefixeq

4895 strict_prefix ~> prefix

4897 - Replaced constant "postfix" by "suffixeq" with swapped argument

4898 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

4899 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

4900 Renamed lemmas accordingly.

4902 - Added constant "list_hembeq" for homeomorphic embedding on

4903 lists. Added abbreviation "sublisteq" for special case

4904 "list_hembeq (op =)".

4906 - Theory Library/Sublist no longer provides "order" and "bot" type

4907 class instances for the prefix order (merely corresponding locale

4908 interpretations). The type class instances are now in theory

4909 Library/Prefix_Order.

4911 - The sublist relation of theory Library/Sublist_Order is now based

4912 on "Sublist.sublisteq". Renamed lemmas accordingly:

4914 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

4915 le_list_append_mono ~> Sublist.list_hembeq_append_mono

4916 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

4917 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

4918 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

4919 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

4920 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

4921 le_list_drop_many ~> Sublist.sublisteq_drop_many

4922 le_list_filter_left ~> Sublist.sublisteq_filter_left

4923 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

4924 le_list_rev_take_iff ~> Sublist.sublisteq_append

4925 le_list_same_length ~> Sublist.sublisteq_same_length

4926 le_list_take_many_iff ~> Sublist.sublisteq_append'

4927 less_eq_list.drop ~> less_eq_list_drop

4928 less_eq_list.induct ~> less_eq_list_induct

4929 not_le_list_length ~> Sublist.not_sublisteq_length

4931 INCOMPATIBILITY.

4933 * New theory Library/Countable_Set.

4935 * Theory Library/Debug and Library/Parallel provide debugging and

4936 parallel execution for code generated towards Isabelle/ML.

4938 * Theory Library/FuncSet: Extended support for Pi and extensional and

4939 introduce the extensional dependent function space "PiE". Replaced

4940 extensional_funcset by an abbreviation, and renamed lemmas from

4941 extensional_funcset to PiE as follows:

4943 extensional_empty ~> PiE_empty

4944 extensional_funcset_empty_domain ~> PiE_empty_domain

4945 extensional_funcset_empty_range ~> PiE_empty_range

4946 extensional_funcset_arb ~> PiE_arb

4947 extensional_funcset_mem ~> PiE_mem

4948 extensional_funcset_extend_domainI ~> PiE_fun_upd

4949 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

4950 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

4951 card_extensional_funcset ~> card_PiE

4952 finite_extensional_funcset ~> finite_PiE

4954 INCOMPATIBILITY.

4956 * Theory Library/FinFun: theory of almost everywhere constant

4957 functions (supersedes the AFP entry "Code Generation for Functions as

4958 Data").

4960 * Theory Library/Phantom: generic phantom type to make a type

4961 parameter appear in a constant's type. This alternative to adding

4962 TYPE('a) as another parameter avoids unnecessary closures in generated

4963 code.

4965 * Theory Library/RBT_Impl: efficient construction of red-black trees

4966 from sorted associative lists. Merging two trees with rbt_union may

4967 return a structurally different tree than before. Potential

4968 INCOMPATIBILITY.

4970 * Theory Library/IArray: immutable arrays with code generation.

4972 * Theory Library/Finite_Lattice: theory of finite lattices.

4974 * HOL/Multivariate_Analysis: replaced

4976 "basis :: 'a::euclidean_space => nat => real"

4977 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

4979 on euclidean spaces by using the inner product "_ \<bullet> _" with

4980 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

4981 "SUM i : Basis. f i * r i".

4983 With this change the following constants are also changed or removed:

4985 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

4986 a $$ i ~> inner a i (where i : Basis)

4987 cart_base i removed

4988 \<pi>, \<pi>' removed

4990 Theorems about these constants where removed.

4992 Renamed lemmas:

4994 component_le_norm ~> Basis_le_norm

4995 euclidean_eq ~> euclidean_eq_iff

4996 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

4997 euclidean_simps ~> inner_simps

4998 independent_basis ~> independent_Basis

4999 span_basis ~> span_Basis

5000 in_span_basis ~> in_span_Basis

5001 norm_bound_component_le ~> norm_boound_Basis_le

5002 norm_bound_component_lt ~> norm_boound_Basis_lt

5003 component_le_infnorm ~> Basis_le_infnorm

5005 INCOMPATIBILITY.

5007 * HOL/Probability:

5009 - Added simproc "measurable" to automatically prove measurability.

5011 - Added induction rules for sigma sets with disjoint union

5012 (sigma_sets_induct_disjoint) and for Borel-measurable functions

5013 (borel_measurable_induct).

5015 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

5016 projective family).

5018 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

5019 AFP entry "Ordinals_and_Cardinals").

5021 * HOL/BNF: New (co)datatype package based on bounded natural functors

5022 with support for mixed, nested recursion and interesting non-free

5023 datatypes.

5025 * HOL/Finite_Set and Relation: added new set and relation operations

5026 expressed by Finite_Set.fold.

5028 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

5029 trees for the code generator.

5031 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

5032 Lifting/Transfer.

5033 possible INCOMPATIBILITY.

5035 * HOL/Set: renamed Set.project -> Set.filter

5036 INCOMPATIBILITY.

5039 *** Document preparation ***

5041 * Dropped legacy antiquotations "term_style" and "thm_style", since

5042 styles may be given as arguments to "term" and "thm" already.

5043 Discontinued legacy styles "prem1" .. "prem19".

5045 * Default LaTeX rendering for \<euro> is now based on eurosym package,

5046 instead of slightly exotic babel/greek.

5048 * Document variant NAME may use different LaTeX entry point

5049 document/root_NAME.tex if that file exists, instead of the common

5050 document/root.tex.

5052 * Simplified custom document/build script, instead of old-style

5053 document/IsaMakefile. Minor INCOMPATIBILITY.

5056 *** ML ***

5058 * The default limit for maximum number of worker threads is now 8,

5059 instead of 4, in correspondence to capabilities of contemporary

5060 hardware and Poly/ML runtime system.

5062 * Type Seq.results and related operations support embedded error

5063 messages within lazy enumerations, and thus allow to provide

5064 informative errors in the absence of any usable results.

5066 * Renamed Position.str_of to Position.here to emphasize that this is a

5067 formal device to inline positions into message text, but not

5068 necessarily printing visible text.

5071 *** System ***

5073 * Advanced support for Isabelle sessions and build management, see

5074 "system" manual for the chapter of that name, especially the "isabelle

5075 build" tool and its examples. The "isabelle mkroot" tool prepares

5076 session root directories for use with "isabelle build", similar to

5077 former "isabelle mkdir" for "isabelle usedir". Note that this affects

5078 document preparation as well. INCOMPATIBILITY, isabelle usedir /

5079 mkdir / make are rendered obsolete.

5081 * Discontinued obsolete Isabelle/build script, it is superseded by the

5082 regular isabelle build tool. For example:

5084 isabelle build -s -b HOL

5086 * Discontinued obsolete "isabelle makeall".

5088 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

5089 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

5090 provides some traditional targets that invoke "isabelle build". Note

5091 that this is inefficient! Applications of Isabelle/HOL involving

5092 "isabelle make" should be upgraded to use "isabelle build" directly.

5094 * The "isabelle options" tool prints Isabelle system options, as

5095 required for "isabelle build", for example.

5097 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

5098 Minor INCOMPATIBILITY in command-line options.

5100 * The "isabelle install" tool has now a simpler command-line. Minor

5101 INCOMPATIBILITY.

5103 * The "isabelle components" tool helps to resolve add-on components

5104 that are not bundled, or referenced from a bare-bones repository

5105 version of Isabelle.

5107 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

5108 platform family: "linux", "macos", "windows".

5110 * The ML system is configured as regular component, and no longer

5111 picked up from some surrounding directory. Potential INCOMPATIBILITY

5112 for home-made settings.

5114 * Improved ML runtime statistics (heap, threads, future tasks etc.).

5116 * Discontinued support for Poly/ML 5.2.1, which was the last version

5117 without exception positions and advanced ML compiler/toplevel

5118 configuration.

5120 * Discontinued special treatment of Proof General -- no longer guess

5121 PROOFGENERAL_HOME based on accidental file-system layout. Minor

5122 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

5123 settings manually, or use a Proof General version that has been

5124 bundled as Isabelle component.

5128 New in Isabelle2012 (May 2012)

5129 ------------------------------

5131 *** General ***

5133 * Prover IDE (PIDE) improvements:

5135 - more robust Sledgehammer integration (as before the sledgehammer

5136 command-line needs to be typed into the source buffer)

5137 - markup for bound variables

5138 - markup for types of term variables (displayed as tooltips)

5139 - support for user-defined Isar commands within the running session

5140 - improved support for Unicode outside original 16bit range

5141 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

5143 * Forward declaration of outer syntax keywords within the theory

5144 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

5145 commands to be used in the same theory where defined.

5147 * Auxiliary contexts indicate block structure for specifications with

5148 additional parameters and assumptions. Such unnamed contexts may be

5149 nested within other targets, like 'theory', 'locale', 'class',

5150 'instantiation' etc. Results from the local context are generalized

5151 accordingly and applied to the enclosing target context. Example:

5153 context

5154 fixes x y z :: 'a

5155 assumes xy: "x = y" and yz: "y = z"

5156 begin

5158 lemma my_trans: "x = z" using xy yz by simp

5160 end

5162 thm my_trans

5164 The most basic application is to factor-out context elements of

5165 several fixes/assumes/shows theorem statements, e.g. see

5166 ~~/src/HOL/Isar_Examples/Group_Context.thy

5168 Any other local theory specification element works within the "context

5169 ... begin ... end" block as well.

5171 * Bundled declarations associate attributed fact expressions with a

5172 given name in the context. These may be later included in other

5173 contexts. This allows to manage context extensions casually, without

5174 the logical dependencies of locales and locale interpretation. See

5175 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

5177 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

5178 declaration, and results are standardized before being stored. Thus

5179 old-style "standard" after instantiation or composition of facts

5180 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

5181 indices of schematic variables.

5183 * Rule attributes in local theory declarations (e.g. locale or class)

5184 are now statically evaluated: the resulting theorem is stored instead

5185 of the original expression. INCOMPATIBILITY in rare situations, where

5186 the historic accident of dynamic re-evaluation in interpretations

5187 etc. was exploited.

5189 * New tutorial "Programming and Proving in Isabelle/HOL"

5190 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

5191 Structured Isar Proofs" ("isar-overview"), which has been removed. It

5192 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

5193 Logic" as the recommended beginners tutorial, but does not cover all

5194 of the material of that old tutorial.

5196 * Updated and extended reference manuals: "isar-ref",

5197 "implementation", "system"; reduced remaining material in old "ref"

5198 manual.

5201 *** Pure ***

5203 * Command 'definition' no longer exports the foundational "raw_def"

5204 into the user context. Minor INCOMPATIBILITY, may use the regular

5205 "def" result with attribute "abs_def" to imitate the old version.

5207 * Attribute "abs_def" turns an equation of the form "f x y == t" into

5208 "f == %x y. t", which ensures that "simp" or "unfold" steps always

5209 expand it. This also works for object-logic equality. (Formerly

5210 undocumented feature.)

5212 * Sort constraints are now propagated in simultaneous statements, just

5213 like type constraints. INCOMPATIBILITY in rare situations, where

5214 distinct sorts used to be assigned accidentally. For example:

5216 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

5218 lemma "P (x::'a)" and "Q (y::'a::bar)"

5219 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

5221 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

5222 tolerant against multiple unifiers, as long as the final result is

5223 unique. (As before, rules are composed in canonical right-to-left

5224 order to accommodate newly introduced premises.)

5226 * Renamed some inner syntax categories:

5228 num ~> num_token

5229 xnum ~> xnum_token

5230 xstr ~> str_token

5232 Minor INCOMPATIBILITY. Note that in practice "num_const" or

5233 "num_position" etc. are mainly used instead (which also include

5234 position information via constraints).

5236 * Simplified configuration options for syntax ambiguity: see

5237 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

5238 manual. Minor INCOMPATIBILITY.

5240 * Discontinued configuration option "syntax_positions": atomic terms

5241 in parse trees are always annotated by position constraints.

5243 * Old code generator for SML and its commands 'code_module',

5244 'code_library', 'consts_code', 'types_code' have been discontinued.

5245 Use commands of the generic code generator instead. INCOMPATIBILITY.

5247 * Redundant attribute "code_inline" has been discontinued. Use

5248 "code_unfold" instead. INCOMPATIBILITY.

5250 * Dropped attribute "code_unfold_post" in favor of the its dual

5251 "code_abbrev", which yields a common pattern in definitions like

5253 definition [code_abbrev]: "f = t"

5255 INCOMPATIBILITY.

5257 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

5258 instead. INCOMPATIBILITY.

5260 * Discontinued old "prems" fact, which used to refer to the accidental

5261 collection of foundational premises in the context (already marked as

5262 legacy since Isabelle2011).

5265 *** HOL ***

5267 * Type 'a set is now a proper type constructor (just as before

5268 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

5269 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

5270 sets separate, it is often sufficient to rephrase some set S that has

5271 been accidentally used as predicates by "%x. x : S", and some

5272 predicate P that has been accidentally used as set by "{x. P x}".

5273 Corresponding proofs in a first step should be pruned from any

5274 tinkering with former theorems mem_def and Collect_def as far as

5275 possible.

5277 For developments which deliberately mix predicates and sets, a

5278 planning step is necessary to determine what should become a predicate

5279 and what a set. It can be helpful to carry out that step in

5280 Isabelle2011-1 before jumping right into the current release.

5282 * Code generation by default implements sets as container type rather

5283 than predicates. INCOMPATIBILITY.

5285 * New type synonym 'a rel = ('a * 'a) set

5287 * The representation of numerals has changed. Datatype "num"

5288 represents strictly positive binary numerals, along with functions

5289 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent

5290 positive and negated numeric literals, respectively. See also

5291 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

5292 user theories may require adaptations as follows:

5294 - Theorems with number_ring or number_semiring constraints: These

5295 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

5297 - Theories defining numeric types: Remove number, number_semiring,

5298 and number_ring instances. Defer all theorems about numerals until

5299 after classes one and semigroup_add have been instantiated.

5301 - Numeral-only simp rules: Replace each rule having a "number_of v"

5302 pattern with two copies, one for numeral and one for neg_numeral.

5304 - Theorems about subclasses of semiring_1 or ring_1: These classes

5305 automatically support numerals now, so more simp rules and

5306 simprocs may now apply within the proof.

5308 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

5309 Redefine using other integer operations.

5311 * Transfer: New package intended to generalize the existing

5312 "descending" method and related theorem attributes from the Quotient

5313 package. (Not all functionality is implemented yet, but future

5314 development will focus on Transfer as an eventual replacement for the

5315 corresponding parts of the Quotient package.)

5317 - transfer_rule attribute: Maintains a collection of transfer rules,

5318 which relate constants at two different types. Transfer rules may

5319 relate different type instances of the same polymorphic constant,

5320 or they may relate an operation on a raw type to a corresponding

5321 operation on an abstract type (quotient or subtype). For example:

5323 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map

5324 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int

5326 - transfer method: Replaces a subgoal on abstract types with an

5327 equivalent subgoal on the corresponding raw types. Constants are

5328 replaced with corresponding ones according to the transfer rules.

5329 Goals are generalized over all free variables by default; this is

5330 necessary for variables whose types change, but can be overridden

5331 for specific variables with e.g. "transfer fixing: x y z". The

5332 variant transfer' method allows replacing a subgoal with one that

5333 is logically stronger (rather than equivalent).

5335 - relator_eq attribute: Collects identity laws for relators of

5336 various type constructors, e.g. "list_all2 (op =) = (op =)". The

5337 transfer method uses these lemmas to infer transfer rules for

5338 non-polymorphic constants on the fly.

5340 - transfer_prover method: Assists with proving a transfer rule for a

5341 new constant, provided the constant is defined in terms of other

5342 constants that already have transfer rules. It should be applied

5343 after unfolding the constant definitions.

5345 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

5346 from type nat to type int.

5348 * Lifting: New package intended to generalize the quotient_definition

5349 facility of the Quotient package; designed to work with Transfer.

5351 - lift_definition command: Defines operations on an abstract type in

5352 terms of a corresponding operation on a representation

5353 type. Example syntax:

5355 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"

5356 is List.insert

5358 Users must discharge a respectfulness proof obligation when each

5359 constant is defined. (For a type copy, i.e. a typedef with UNIV,

5360 the proof is discharged automatically.) The obligation is

5361 presented in a user-friendly, readable form; a respectfulness

5362 theorem in the standard format and a transfer rule are generated

5363 by the package.

5365 - Integration with code_abstype: For typedefs (e.g. subtypes

5366 corresponding to a datatype invariant, such as dlist),

5367 lift_definition generates a code certificate theorem and sets up

5368 code generation for each constant.

5370 - setup_lifting command: Sets up the Lifting package to work with a

5371 user-defined type. The user must provide either a quotient theorem

5372 or a type_definition theorem. The package configures transfer

5373 rules for equality and quantifiers on the type, and sets up the

5374 lift_definition command to work with the type.

5376 - Usage examples: See Quotient_Examples/Lift_DList.thy,

5377 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

5378 Word/Word.thy and Library/Float.thy.

5380 * Quotient package:

5382 - The 'quotient_type' command now supports a 'morphisms' option with

5383 rep and abs functions, similar to typedef.

5385 - 'quotient_type' sets up new types to work with the Lifting and

5386 Transfer packages, as with 'setup_lifting'.

5388 - The 'quotient_definition' command now requires the user to prove a

5389 respectfulness property at the point where the constant is

5390 defined, similar to lift_definition; INCOMPATIBILITY.

5392 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

5393 accordingly, INCOMPATIBILITY.

5395 * New diagnostic command 'find_unused_assms' to find potentially

5396 superfluous assumptions in theorems using Quickcheck.

5398 * Quickcheck:

5400 - Quickcheck returns variable assignments as counterexamples, which

5401 allows to reveal the underspecification of functions under test.

5402 For example, refuting "hd xs = x", it presents the variable

5403 assignment xs = [] and x = a1 as a counterexample, assuming that

5404 any property is false whenever "hd []" occurs in it.

5406 These counterexample are marked as potentially spurious, as

5407 Quickcheck also returns "xs = []" as a counterexample to the

5408 obvious theorem "hd xs = hd xs".

5410 After finding a potentially spurious counterexample, Quickcheck

5411 continues searching for genuine ones.

5413 By default, Quickcheck shows potentially spurious and genuine

5414 counterexamples. The option "genuine_only" sets quickcheck to only

5415 show genuine counterexamples.

5417 - The command 'quickcheck_generator' creates random and exhaustive

5418 value generators for a given type and operations.

5420 It generates values by using the operations as if they were

5421 constructors of that type.

5423 - Support for multisets.

5425 - Added "use_subtype" options.

5427 - Added "quickcheck_locale" configuration to specify how to process

5428 conjectures in a locale context.

5430 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

5431 and affecting 'rat' and 'real'.

5433 * Sledgehammer:

5434 - Integrated more tightly with SPASS, as described in the ITP 2012

5435 paper "More SPASS with Isabelle".

5436 - Made it try "smt" as a fallback if "metis" fails or times out.

5437 - Added support for the following provers: Alt-Ergo (via Why3 and

5438 TFF1), iProver, iProver-Eq.

5439 - Sped up the minimizer.

5440 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

5441 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

5442 - Renamed "sound" option to "strict".

5444 * Metis: Added possibility to specify lambda translations scheme as a

5445 parenthesized argument (e.g., "by (metis (lifting) ...)").

5447 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

5449 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

5451 * New "case_product" attribute to generate a case rule doing multiple

5452 case distinctions at the same time. E.g.

5454 list.exhaust [case_product nat.exhaust]

5456 produces a rule which can be used to perform case distinction on both

5457 a list and a nat.

5459 * New "eventually_elim" method as a generalized variant of the

5460 eventually_elim* rules. Supports structured proofs.

5462 * Typedef with implicit set definition is considered legacy. Use

5463 "typedef (open)" form instead, which will eventually become the

5464 default.

5466 * Record: code generation can be switched off manually with

5468 declare [[record_coden = false]] -- "default true"

5470 * Datatype: type parameters allow explicit sort constraints.

5472 * Concrete syntax for case expressions includes constraints for source

5473 positions, and thus produces Prover IDE markup for its bindings.

5474 INCOMPATIBILITY for old-style syntax translations that augment the

5475 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of

5476 one_case.

5478 * Clarified attribute "mono_set": pure declaration without modifying

5479 the result of the fact expression.

5481 * More default pred/set conversions on a couple of relation operations

5482 and predicates. Added powers of predicate relations. Consolidation

5483 of some relation theorems:

5485 converse_def ~> converse_unfold

5486 rel_comp_def ~> relcomp_unfold

5487 symp_def ~> (modified, use symp_def and sym_def instead)

5488 transp_def ~> transp_trans

5489 Domain_def ~> Domain_unfold

5490 Range_def ~> Domain_converse [symmetric]

5492 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

5494 See theory "Relation" for examples for making use of pred/set

5495 conversions by means of attributes "to_set" and "to_pred".

5497 INCOMPATIBILITY.

5499 * Renamed facts about the power operation on relations, i.e., relpow

5500 to match the constant's name:

5502 rel_pow_1 ~> relpow_1

5503 rel_pow_0_I ~> relpow_0_I

5504 rel_pow_Suc_I ~> relpow_Suc_I

5505 rel_pow_Suc_I2 ~> relpow_Suc_I2

5506 rel_pow_0_E ~> relpow_0_E

5507 rel_pow_Suc_E ~> relpow_Suc_E

5508 rel_pow_E ~> relpow_E

5509 rel_pow_Suc_D2 ~> relpow_Suc_D2

5510 rel_pow_Suc_E2 ~> relpow_Suc_E2

5511 rel_pow_Suc_D2' ~> relpow_Suc_D2'

5512 rel_pow_E2 ~> relpow_E2

5513 rel_pow_add ~> relpow_add

5514 rel_pow_commute ~> relpow

5515 rel_pow_empty ~> relpow_empty:

5516 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

5517 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

5518 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

5519 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

5520 rel_pow_fun_conv ~> relpow_fun_conv

5521 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

5522 rel_pow_finite_bounded ~> relpow_finite_bounded

5523 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

5524 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

5525 single_valued_rel_pow ~> single_valued_relpow

5527 INCOMPATIBILITY.

5529 * Theory Relation: Consolidated constant name for relation composition

5530 and corresponding theorem names:

5532 - Renamed constant rel_comp to relcomp.

5534 - Dropped abbreviation pred_comp. Use relcompp instead.

5536 - Renamed theorems:

5538 rel_compI ~> relcompI

5539 rel_compEpair ~> relcompEpair

5540 rel_compE ~> relcompE

5541 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

5542 rel_comp_empty1 ~> relcomp_empty1

5543 rel_comp_mono ~> relcomp_mono

5544 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

5545 rel_comp_distrib ~> relcomp_distrib

5546 rel_comp_distrib2 ~> relcomp_distrib2

5547 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

5548 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

5549 single_valued_rel_comp ~> single_valued_relcomp

5550 rel_comp_def ~> relcomp_unfold

5551 converse_rel_comp ~> converse_relcomp

5552 pred_compI ~> relcomppI

5553 pred_compE ~> relcomppE

5554 pred_comp_bot1 ~> relcompp_bot1

5555 pred_comp_bot2 ~> relcompp_bot2

5556 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

5557 pred_comp_mono ~> relcompp_mono

5558 pred_comp_distrib ~> relcompp_distrib

5559 pred_comp_distrib2 ~> relcompp_distrib2

5560 converse_pred_comp ~> converse_relcompp

5562 finite_rel_comp ~> finite_relcomp

5564 set_rel_comp ~> set_relcomp

5566 INCOMPATIBILITY.

5568 * Theory Divides: Discontinued redundant theorems about div and mod.

5569 INCOMPATIBILITY, use the corresponding generic theorems instead.

5571 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

5572 zdiv_self ~> div_self

5573 zmod_self ~> mod_self

5574 zdiv_zero ~> div_0

5575 zmod_zero ~> mod_0

5576 zdiv_zmod_equality ~> div_mod_equality2

5577 zdiv_zmod_equality2 ~> div_mod_equality

5578 zmod_zdiv_trivial ~> mod_div_trivial

5579 zdiv_zminus_zminus ~> div_minus_minus

5580 zmod_zminus_zminus ~> mod_minus_minus

5581 zdiv_zminus2 ~> div_minus_right

5582 zmod_zminus2 ~> mod_minus_right

5583 zdiv_minus1_right ~> div_minus1_right

5584 zmod_minus1_right ~> mod_minus1_right

5585 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

5586 zmod_zmult1_eq ~> mod_mult_right_eq

5587 zpower_zmod ~> power_mod

5588 zdvd_zmod ~> dvd_mod

5589 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

5590 mod_mult_distrib ~> mult_mod_left

5591 mod_mult_distrib2 ~> mult_mod_right

5593 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

5594 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

5596 * Finite_Set.fold now qualified. INCOMPATIBILITY.

5598 * Consolidated theorem names concerning fold combinators:

5600 inf_INFI_fold_inf ~> inf_INF_fold_inf

5601 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

5602 INFI_fold_inf ~> INF_fold_inf

5603 SUPR_fold_sup ~> SUP_fold_sup

5604 union_set ~> union_set_fold

5605 minus_set ~> minus_set_fold

5606 INFI_set_fold ~> INF_set_fold

5607 SUPR_set_fold ~> SUP_set_fold

5608 INF_code ~> INF_set_foldr

5609 SUP_code ~> SUP_set_foldr

5610 foldr.simps ~> foldr.simps (in point-free formulation)

5611 foldr_fold_rev ~> foldr_conv_fold

5612 foldl_fold ~> foldl_conv_fold

5613 foldr_foldr ~> foldr_conv_foldl

5614 foldl_foldr ~> foldl_conv_foldr

5615 fold_set_remdups ~> fold_set_fold_remdups

5616 fold_set ~> fold_set_fold

5617 fold1_set ~> fold1_set_fold

5619 INCOMPATIBILITY.

5621 * Dropped rarely useful theorems concerning fold combinators:

5622 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

5623 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

5624 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

5625 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

5626 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

5627 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

5628 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"

5629 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be

5630 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by

5631 unfolding "foldr_conv_fold" and "foldl_conv_fold".

5633 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

5634 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

5635 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

5636 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

5637 lemmas over fold rather than foldr, or make use of lemmas

5638 fold_conv_foldr and fold_rev.

5640 * Congruence rules Option.map_cong and Option.bind_cong for recursion

5641 through option types.

5643 * "Transitive_Closure.ntrancl": bounded transitive closure on

5644 relations.

5646 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

5648 * Theory Int: Discontinued many legacy theorems specific to type int.

5649 INCOMPATIBILITY, use the corresponding generic theorems instead.

5651 zminus_zminus ~> minus_minus

5652 zminus_0 ~> minus_zero

5653 zminus_zadd_distrib ~> minus_add_distrib

5654 zadd_commute ~> add_commute

5655 zadd_assoc ~> add_assoc

5656 zadd_left_commute ~> add_left_commute

5657 zadd_ac ~> add_ac

5658 zmult_ac ~> mult_ac

5659 zadd_0 ~> add_0_left

5660 zadd_0_right ~> add_0_right

5661 zadd_zminus_inverse2 ~> left_minus

5662 zmult_zminus ~> mult_minus_left

5663 zmult_commute ~> mult_commute

5664 zmult_assoc ~> mult_assoc

5665 zadd_zmult_distrib ~> left_distrib

5666 zadd_zmult_distrib2 ~> right_distrib

5667 zdiff_zmult_distrib ~> left_diff_distrib

5668 zdiff_zmult_distrib2 ~> right_diff_distrib

5669 zmult_1 ~> mult_1_left

5670 zmult_1_right ~> mult_1_right

5671 zle_refl ~> order_refl

5672 zle_trans ~> order_trans

5673 zle_antisym ~> order_antisym

5674 zle_linear ~> linorder_linear

5675 zless_linear ~> linorder_less_linear

5676 zadd_left_mono ~> add_left_mono

5677 zadd_strict_right_mono ~> add_strict_right_mono

5678 zadd_zless_mono ~> add_less_le_mono

5679 int_0_less_1 ~> zero_less_one

5680 int_0_neq_1 ~> zero_neq_one

5681 zless_le ~> less_le

5682 zpower_zadd_distrib ~> power_add

5683 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

5684 zero_le_zpower_abs ~> zero_le_power_abs

5686 * Theory Deriv: Renamed

5688 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

5690 * Theory Library/Multiset: Improved code generation of multisets.

5692 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

5693 are expressed via type classes again. The special syntax

5694 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

5695 setsum_set, which is now subsumed by Big_Operators.setsum.

5696 INCOMPATIBILITY.

5698 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

5699 use theory HOL/Library/Nat_Bijection instead.

5701 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

5702 trees is now inside a type class context. Names of affected

5703 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for

5704 theories working directly with raw red-black trees, adapt the names as

5705 follows:

5707 Operations:

5708 bulkload -> rbt_bulkload

5709 del_from_left -> rbt_del_from_left

5710 del_from_right -> rbt_del_from_right

5711 del -> rbt_del

5712 delete -> rbt_delete

5713 ins -> rbt_ins

5714 insert -> rbt_insert

5715 insertw -> rbt_insert_with

5716 insert_with_key -> rbt_insert_with_key

5717 map_entry -> rbt_map_entry

5718 lookup -> rbt_lookup

5719 sorted -> rbt_sorted

5720 tree_greater -> rbt_greater

5721 tree_less -> rbt_less

5722 tree_less_symbol -> rbt_less_symbol

5723 union -> rbt_union

5724 union_with -> rbt_union_with

5725 union_with_key -> rbt_union_with_key

5727 Lemmas:

5728 balance_left_sorted -> balance_left_rbt_sorted

5729 balance_left_tree_greater -> balance_left_rbt_greater

5730 balance_left_tree_less -> balance_left_rbt_less

5731 balance_right_sorted -> balance_right_rbt_sorted

5732 balance_right_tree_greater -> balance_right_rbt_greater

5733 balance_right_tree_less -> balance_right_rbt_less

5734 balance_sorted -> balance_rbt_sorted

5735 balance_tree_greater -> balance_rbt_greater

5736 balance_tree_less -> balance_rbt_less

5737 bulkload_is_rbt -> rbt_bulkload_is_rbt

5738 combine_sorted -> combine_rbt_sorted

5739 combine_tree_greater -> combine_rbt_greater

5740 combine_tree_less -> combine_rbt_less

5741 delete_in_tree -> rbt_delete_in_tree

5742 delete_is_rbt -> rbt_delete_is_rbt

5743 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

5744 del_from_left_tree_less -> rbt_del_from_left_rbt_less

5745 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

5746 del_from_right_tree_less -> rbt_del_from_right_rbt_less

5747 del_in_tree -> rbt_del_in_tree

5748 del_inv1_inv2 -> rbt_del_inv1_inv2

5749 del_sorted -> rbt_del_rbt_sorted

5750 del_tree_greater -> rbt_del_rbt_greater

5751 del_tree_less -> rbt_del_rbt_less

5752 dom_lookup_Branch -> dom_rbt_lookup_Branch

5753 entries_lookup -> entries_rbt_lookup

5754 finite_dom_lookup -> finite_dom_rbt_lookup

5755 insert_sorted -> rbt_insert_rbt_sorted

5756 insertw_is_rbt -> rbt_insertw_is_rbt

5757 insertwk_is_rbt -> rbt_insertwk_is_rbt

5758 insertwk_sorted -> rbt_insertwk_rbt_sorted

5759 insertw_sorted -> rbt_insertw_rbt_sorted

5760 ins_sorted -> ins_rbt_sorted

5761 ins_tree_greater -> ins_rbt_greater

5762 ins_tree_less -> ins_rbt_less

5763 is_rbt_sorted -> is_rbt_rbt_sorted

5764 lookup_balance -> rbt_lookup_balance

5765 lookup_bulkload -> rbt_lookup_rbt_bulkload

5766 lookup_delete -> rbt_lookup_rbt_delete

5767 lookup_Empty -> rbt_lookup_Empty

5768 lookup_from_in_tree -> rbt_lookup_from_in_tree

5769 lookup_in_tree -> rbt_lookup_in_tree

5770 lookup_ins -> rbt_lookup_ins

5771 lookup_insert -> rbt_lookup_rbt_insert

5772 lookup_insertw -> rbt_lookup_rbt_insertw

5773 lookup_insertwk -> rbt_lookup_rbt_insertwk

5774 lookup_keys -> rbt_lookup_keys

5775 lookup_map -> rbt_lookup_map

5776 lookup_map_entry -> rbt_lookup_rbt_map_entry

5777 lookup_tree_greater -> rbt_lookup_rbt_greater

5778 lookup_tree_less -> rbt_lookup_rbt_less

5779 lookup_union -> rbt_lookup_rbt_union

5780 map_entry_color_of -> rbt_map_entry_color_of

5781 map_entry_inv1 -> rbt_map_entry_inv1

5782 map_entry_inv2 -> rbt_map_entry_inv2

5783 map_entry_is_rbt -> rbt_map_entry_is_rbt

5784 map_entry_sorted -> rbt_map_entry_rbt_sorted

5785 map_entry_tree_greater -> rbt_map_entry_rbt_greater

5786 map_entry_tree_less -> rbt_map_entry_rbt_less

5787 map_tree_greater -> map_rbt_greater

5788 map_tree_less -> map_rbt_less

5789 map_sorted -> map_rbt_sorted

5790 paint_sorted -> paint_rbt_sorted

5791 paint_lookup -> paint_rbt_lookup

5792 paint_tree_greater -> paint_rbt_greater

5793 paint_tree_less -> paint_rbt_less

5794 sorted_entries -> rbt_sorted_entries

5795 tree_greater_eq_trans -> rbt_greater_eq_trans

5796 tree_greater_nit -> rbt_greater_nit

5797 tree_greater_prop -> rbt_greater_prop

5798 tree_greater_simps -> rbt_greater_simps

5799 tree_greater_trans -> rbt_greater_trans

5800 tree_less_eq_trans -> rbt_less_eq_trans

5801 tree_less_nit -> rbt_less_nit

5802 tree_less_prop -> rbt_less_prop

5803 tree_less_simps -> rbt_less_simps

5804 tree_less_trans -> rbt_less_trans

5805 tree_ord_props -> rbt_ord_props

5806 union_Branch -> rbt_union_Branch

5807 union_is_rbt -> rbt_union_is_rbt

5808 unionw_is_rbt -> rbt_unionw_is_rbt

5809 unionwk_is_rbt -> rbt_unionwk_is_rbt

5810 unionwk_sorted -> rbt_unionwk_rbt_sorted

5812 * Theory HOL/Library/Float: Floating point numbers are now defined as

5813 a subset of the real numbers. All operations are defined using the

5814 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

5816 Changed Operations:

5817 float_abs -> abs

5818 float_nprt -> nprt

5819 float_pprt -> pprt

5820 pow2 -> use powr

5821 round_down -> float_round_down

5822 round_up -> float_round_up

5823 scale -> exponent

5825 Removed Operations:

5826 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

5828 Renamed Lemmas:

5829 abs_float_def -> Float.compute_float_abs

5830 bitlen_ge0 -> bitlen_nonneg

5831 bitlen.simps -> Float.compute_bitlen

5832 float_components -> Float_mantissa_exponent

5833 float_divl.simps -> Float.compute_float_divl

5834 float_divr.simps -> Float.compute_float_divr

5835 float_eq_odd -> mult_powr_eq_mult_powr_iff

5836 float_power -> real_of_float_power

5837 lapprox_posrat_def -> Float.compute_lapprox_posrat

5838 lapprox_rat.simps -> Float.compute_lapprox_rat

5839 le_float_def' -> Float.compute_float_le

5840 le_float_def -> less_eq_float.rep_eq

5841 less_float_def' -> Float.compute_float_less

5842 less_float_def -> less_float.rep_eq

5843 normfloat_def -> Float.compute_normfloat

5844 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

5845 normfloat -> normfloat_def

5846 normfloat_unique -> use normfloat_def

5847 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

5848 one_float_def -> Float.compute_float_one

5849 plus_float_def -> Float.compute_float_plus

5850 rapprox_posrat_def -> Float.compute_rapprox_posrat

5851 rapprox_rat.simps -> Float.compute_rapprox_rat

5852 real_of_float_0 -> zero_float.rep_eq

5853 real_of_float_1 -> one_float.rep_eq

5854 real_of_float_abs -> abs_float.rep_eq

5855 real_of_float_add -> plus_float.rep_eq

5856 real_of_float_minus -> uminus_float.rep_eq

5857 real_of_float_mult -> times_float.rep_eq

5858 real_of_float_simp -> Float.rep_eq

5859 real_of_float_sub -> minus_float.rep_eq

5860 round_down.simps -> Float.compute_float_round_down

5861 round_up.simps -> Float.compute_float_round_up

5862 times_float_def -> Float.compute_float_times

5863 uminus_float_def -> Float.compute_float_uminus

5864 zero_float_def -> Float.compute_float_zero

5866 Lemmas not necessary anymore, use the transfer method:

5867 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

5868 float_divr, float_le_simp, float_less1_mantissa_bound,

5869 float_less_simp, float_less_zero, float_le_zero,

5870 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

5871 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

5872 lapprox_rat_bottom, normalized_float, rapprox_posrat,

5873 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

5874 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

5875 round_up, zero_le_float, zero_less_float

5877 * New theory HOL/Library/DAList provides an abstract type for

5878 association lists with distinct keys.

5880 * Session HOL/IMP: Added new theory of abstract interpretation of

5881 annotated commands.

5883 * Session HOL-Import: Re-implementation from scratch is faster,

5884 simpler, and more scalable. Requires a proof bundle, which is

5885 available as an external component. Discontinued old (and mostly

5886 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

5888 * Session HOL-Word: Discontinued many redundant theorems specific to

5889 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

5890 instead.

5892 word_sub_alt ~> word_sub_wi

5893 word_add_alt ~> word_add_def

5894 word_mult_alt ~> word_mult_def

5895 word_minus_alt ~> word_minus_def

5896 word_0_alt ~> word_0_wi

5897 word_1_alt ~> word_1_wi

5898 word_add_0 ~> add_0_left

5899 word_add_0_right ~> add_0_right

5900 word_mult_1 ~> mult_1_left

5901 word_mult_1_right ~> mult_1_right

5902 word_add_commute ~> add_commute

5903 word_add_assoc ~> add_assoc

5904 word_add_left_commute ~> add_left_commute

5905 word_mult_commute ~> mult_commute

5906 word_mult_assoc ~> mult_assoc

5907 word_mult_left_commute ~> mult_left_commute

5908 word_left_distrib ~> left_distrib

5909 word_right_distrib ~> right_distrib

5910 word_left_minus ~> left_minus

5911 word_diff_0_right ~> diff_0_right

5912 word_diff_self ~> diff_self

5913 word_sub_def ~> diff_minus

5914 word_diff_minus ~> diff_minus

5915 word_add_ac ~> add_ac

5916 word_mult_ac ~> mult_ac

5917 word_plus_ac0 ~> add_0_left add_0_right add_ac

5918 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

5919 word_order_trans ~> order_trans

5920 word_order_refl ~> order_refl

5921 word_order_antisym ~> order_antisym

5922 word_order_linear ~> linorder_linear

5923 lenw1_zero_neq_one ~> zero_neq_one

5924 word_number_of_eq ~> number_of_eq

5925 word_of_int_add_hom ~> wi_hom_add

5926 word_of_int_sub_hom ~> wi_hom_sub

5927 word_of_int_mult_hom ~> wi_hom_mult

5928 word_of_int_minus_hom ~> wi_hom_neg

5929 word_of_int_succ_hom ~> wi_hom_succ

5930 word_of_int_pred_hom ~> wi_hom_pred

5931 word_of_int_0_hom ~> word_0_wi

5932 word_of_int_1_hom ~> word_1_wi

5934 * Session HOL-Word: New proof method "word_bitwise" for splitting

5935 machine word equalities and inequalities into logical circuits,

5936 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

5937 multiplication, shifting by constants, bitwise operators and numeric

5938 constants. Requires fixed-length word types, not 'a word. Solves

5939 many standard word identities outright and converts more into first

5940 order problems amenable to blast or similar. See also examples in

5941 HOL/Word/Examples/WordExamples.thy.

5943 * Session HOL-Probability: Introduced the type "'a measure" to

5944 represent measures, this replaces the records 'a algebra and 'a

5945 measure_space. The locales based on subset_class now have two

5946 locale-parameters the space \<Omega> and the set of measurable sets M.

5947 The product of probability spaces uses now the same constant as the

5948 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

5949 measure". Most constants are defined now outside of locales and gain

5950 an additional parameter, like null_sets, almost_eventually or \<mu>'.

5951 Measure space constructions for distributions and densities now got

5952 their own constants distr and density. Instead of using locales to

5953 describe measure spaces with a finite space, the measure count_space

5954 and point_measure is introduced. INCOMPATIBILITY.

5956 Renamed constants:

5957 measure -> emeasure

5958 finite_measure.\<mu>' -> measure

5959 product_algebra_generator -> prod_algebra

5960 product_prob_space.emb -> prod_emb

5961 product_prob_space.infprod_algebra -> PiM

5963 Removed locales:

5964 completeable_measure_space

5965 finite_measure_space

5966 finite_prob_space

5967 finite_product_finite_prob_space

5968 finite_product_sigma_algebra

5969 finite_sigma_algebra

5970 measure_space

5971 pair_finite_prob_space

5972 pair_finite_sigma_algebra

5973 pair_finite_space

5974 pair_sigma_algebra

5975 product_sigma_algebra

5977 Removed constants:

5978 conditional_space

5979 distribution -> use distr measure, or distributed predicate

5980 image_space

5981 joint_distribution -> use distr measure, or distributed predicate

5982 pair_measure_generator

5983 product_prob_space.infprod_algebra -> use PiM

5984 subvimage

5986 Replacement theorems:

5987 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

5988 finite_measure.empty_measure -> measure_empty

5989 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

5990 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

5991 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

5992 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

5993 finite_measure.finite_measure -> finite_measure.emeasure_finite

5994 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

5995 finite_measure.positive_measure' -> measure_nonneg

5996 finite_measure.real_measure -> finite_measure.emeasure_real

5997 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

5998 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

5999 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

6000 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

6001 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

6002 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

6003 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

6004 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

6005 information_space.entropy_commute -> information_space.entropy_commute_simple

6006 information_space.entropy_eq -> information_space.entropy_simple_distributed

6007 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

6008 information_space.entropy_positive -> information_space.entropy_nonneg_simple

6009 information_space.entropy_uniform_max -> information_space.entropy_uniform

6010 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

6011 information_space.KL_eq_0 -> information_space.KL_same_eq_0

6012 information_space.KL_ge_0 -> information_space.KL_nonneg

6013 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

6014 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

6015 Int_stable_cuboids -> Int_stable_atLeastAtMost

6016 Int_stable_product_algebra_generator -> positive_integral

6017 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

6018 measure_space.additive -> emeasure_additive

6019 measure_space.AE_iff_null_set -> AE_iff_null

6020 measure_space.almost_everywhere_def -> eventually_ae_filter

6021 measure_space.almost_everywhere_vimage -> AE_distrD

6022 measure_space.continuity_from_above -> INF_emeasure_decseq

6023 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

6024 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

6025 measure_space.continuity_from_below -> SUP_emeasure_incseq

6026 measure_space_density -> emeasure_density

6027 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

6028 measure_space.integrable_vimage -> integrable_distr

6029 measure_space.integral_translated_density -> integral_density

6030 measure_space.integral_vimage -> integral_distr

6031 measure_space.measure_additive -> plus_emeasure

6032 measure_space.measure_compl -> emeasure_compl

6033 measure_space.measure_countable_increasing -> emeasure_countable_increasing

6034 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

6035 measure_space.measure_decseq -> decseq_emeasure

6036 measure_space.measure_Diff -> emeasure_Diff

6037 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

6038 measure_space.measure_eq_0 -> emeasure_eq_0

6039 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

6040 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

6041 measure_space.measure_incseq -> incseq_emeasure

6042 measure_space.measure_insert -> emeasure_insert

6043 measure_space.measure_mono -> emeasure_mono

6044 measure_space.measure_not_negative -> emeasure_not_MInf

6045 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

6046 measure_space.measure_setsum -> setsum_emeasure

6047 measure_space.measure_setsum_split -> setsum_emeasure_cover

6048 measure_space.measure_space_vimage -> emeasure_distr

6049 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

6050 measure_space.measure_subadditive -> subadditive

6051 measure_space.measure_top -> emeasure_space

6052 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

6053 measure_space.measure_Un_null_set -> emeasure_Un_null_set

6054 measure_space.positive_integral_translated_density -> positive_integral_density

6055 measure_space.positive_integral_vimage -> positive_integral_distr

6056 measure_space.real_continuity_from_above -> Lim_measure_decseq

6057 measure_space.real_continuity_from_below -> Lim_measure_incseq

6058 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

6059 measure_space.real_measure_Diff -> measure_Diff

6060 measure_space.real_measure_finite_Union -> measure_finite_Union

6061 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

6062 measure_space.real_measure_subadditive -> measure_subadditive

6063 measure_space.real_measure_Union -> measure_Union

6064 measure_space.real_measure_UNION -> measure_UNION

6065 measure_space.simple_function_vimage -> simple_function_comp

6066 measure_space.simple_integral_vimage -> simple_integral_distr

6067 measure_space.simple_integral_vimage -> simple_integral_distr

6068 measure_unique_Int_stable -> measure_eqI_generator_eq

6069 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

6070 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

6071 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

6072 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

6073 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

6074 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

6075 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

6076 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

6077 pair_sigma_algebra.sets_swap -> sets_pair_swap

6078 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

6079 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

6080 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

6081 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

6082 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

6083 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

6084 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

6085 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

6086 prob_space.measure_space_1 -> prob_space.emeasure_space_1

6087 prob_space.prob_space_vimage -> prob_space_distr

6088 prob_space.random_variable_restrict -> measurable_restrict

6089 prob_space_unique_Int_stable -> measure_eqI_prob_space

6090 product_algebraE -> prod_algebraE_all

6091 product_algebra_generator_der -> prod_algebra_eq_finite

6092 product_algebra_generator_into_space -> prod_algebra_sets_into_space

6093 product_algebraI -> sets_PiM_I_finite

6094 product_measure_exists -> product_sigma_finite.sigma_finite

6095 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

6096 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

6097 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

6098 product_prob_space.measurable_component -> measurable_component_singleton

6099 product_prob_space.measurable_emb -> measurable_prod_emb

6100 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

6101 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

6102 product_prob_space.measure_emb -> emeasure_prod_emb

6103 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

6104 product_sigma_algebra.product_algebra_into_space -> space_closed

6105 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

6106 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

6107 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

6108 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

6109 sets_product_algebra -> sets_PiM

6110 sigma_algebra.measurable_sigma -> measurable_measure_of

6111 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

6112 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

6113 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

6114 space_product_algebra -> space_PiM

6116 * Session HOL-TPTP: support to parse and import TPTP problems (all

6117 languages) into Isabelle/HOL.

6120 *** FOL ***

6122 * New "case_product" attribute (see HOL).

6125 *** ZF ***

6127 * Greater support for structured proofs involving induction or case

6128 analysis.

6130 * Much greater use of mathematical symbols.

6132 * Removal of many ML theorem bindings. INCOMPATIBILITY.

6135 *** ML ***

6137 * Antiquotation @{keyword "name"} produces a parser for outer syntax

6138 from a minor keyword introduced via theory header declaration.

6140 * Antiquotation @{command_spec "name"} produces the

6141 Outer_Syntax.command_spec from a major keyword introduced via theory

6142 header declaration; it can be passed to Outer_Syntax.command etc.

6144 * Local_Theory.define no longer hard-wires default theorem name

6145 "foo_def", but retains the binding as given. If that is Binding.empty

6146 / Attrib.empty_binding, the result is not registered as user-level

6147 fact. The Local_Theory.define_internal variant allows to specify a

6148 non-empty name (used for the foundation in the background theory),

6149 while omitting the fact binding in the user-context. Potential

6150 INCOMPATIBILITY for derived definitional packages: need to specify

6151 naming policy for primitive definitions more explicitly.

6153 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

6154 conformance with similar operations in structure Term and Logic.

6156 * Antiquotation @{attributes [...]} embeds attribute source

6157 representation into the ML text, which is particularly useful with

6158 declarations like Local_Theory.note.

6160 * Structure Proof_Context follows standard naming scheme. Old

6161 ProofContext has been discontinued. INCOMPATIBILITY.

6163 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

6164 change of semantics: update is applied to auxiliary local theory

6165 context as well.

6167 * Modernized some old-style infix operations:

6169 addeqcongs ~> Simplifier.add_eqcong

6170 deleqcongs ~> Simplifier.del_eqcong

6171 addcongs ~> Simplifier.add_cong

6172 delcongs ~> Simplifier.del_cong

6173 setmksimps ~> Simplifier.set_mksimps

6174 setmkcong ~> Simplifier.set_mkcong

6175 setmksym ~> Simplifier.set_mksym

6176 setmkeqTrue ~> Simplifier.set_mkeqTrue

6177 settermless ~> Simplifier.set_termless

6178 setsubgoaler ~> Simplifier.set_subgoaler

6179 addsplits ~> Splitter.add_split

6180 delsplits ~> Splitter.del_split

6183 *** System ***

6185 * USER_HOME settings variable points to cross-platform user home

6186 directory, which coincides with HOME on POSIX systems only. Likewise,

6187 the Isabelle path specification "~" now expands to $USER_HOME, instead

6188 of former $HOME. A different default for USER_HOME may be set

6189 explicitly in shell environment, before Isabelle settings are

6190 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

6191 the generic user home was intended.

6193 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

6194 notation, which is useful for the jEdit file browser, for example.

6196 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

6197 (not just JRE).

6201 New in Isabelle2011-1 (October 2011)

6202 ------------------------------------

6204 *** General ***

6206 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

6207 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

6209 - Management of multiple theory files directly from the editor

6210 buffer store -- bypassing the file-system (no requirement to save

6211 files for checking).

6213 - Markup of formal entities within the text buffer, with semantic

6214 highlighting, tooltips and hyperlinks to jump to defining source

6215 positions.

6217 - Improved text rendering, with sub/superscripts in the source

6218 buffer (including support for copy/paste wrt. output panel, HTML

6219 theory output and other non-Isabelle text boxes).

6221 - Refined scheduling of proof checking and printing of results,

6222 based on interactive editor view. (Note: jEdit folding and

6223 narrowing allows to restrict buffer perspectives explicitly.)

6225 - Reduced CPU performance requirements, usable on machines with few

6226 cores.

6228 - Reduced memory requirements due to pruning of unused document

6229 versions (garbage collection).

6231 See also ~~/src/Tools/jEdit/README.html for further information,

6232 including some remaining limitations.

6234 * Theory loader: source files are exclusively located via the master

6235 directory of each theory node (where the .thy file itself resides).

6236 The global load path (such as src/HOL/Library) has been discontinued.

6237 Note that the path element ~~ may be used to reference theories in the

6238 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".

6239 INCOMPATIBILITY.

6241 * Theory loader: source files are identified by content via SHA1

6242 digests. Discontinued former path/modtime identification and optional

6243 ISABELLE_FILE_IDENT plugin scripts.

6245 * Parallelization of nested Isar proofs is subject to

6246 Goal.parallel_proofs_threshold (default 100). See also isabelle

6247 usedir option -Q.

6249 * Name space: former unsynchronized references are now proper

6250 configuration options, with more conventional names:

6252 long_names ~> names_long

6253 short_names ~> names_short

6254 unique_names ~> names_unique

6256 Minor INCOMPATIBILITY, n