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

NEWS

author | wenzelm |

Sat Dec 16 15:15:51 2017 +0100 (18 months ago) | |

changeset 67214 | 87038a574d09 |

parent 67207 | ad538f6c5d2f |

child 67215 | 03d0c958d65a |

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

tuned;

1 Isabelle NEWS -- history of user-relevant changes

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

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

7 New in this Isabelle version

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

10 *** General ***

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

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

14 object-logic equality or equivalence.

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

17 to refer to unqualified theories from the parent session.

18 INCOMPATIBILITY for old developments that have not been updated to

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

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

22 INCOMPATIBILITY.

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

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

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

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

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

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

31 without specific Prover IDE management.

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

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

35 context.

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

38 accessible ROOT file is processed only once. This facilitates

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

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

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

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

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

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

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

51 for session selection:

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

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

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

55 - option -F focuses on the specified logic session

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

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

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

60 Examples:

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

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

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

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

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

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

68 arguments into this format.

71 *** Document preparation ***

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

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

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

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

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

79 of option "document_tags" to these commands.

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

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

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

84 \isactrlconstUNDERSCOREname.

86 * Document preparation with skip_proofs option now preserves the content

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

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

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

91 latex and bibtex process. Minor INCOMPATIBILITY.

94 *** HOL ***

96 * SMT module:

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

98 with a solver other than Z3. INCOMPATIBILITY.

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

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

101 option has been added to control this. INCOMPATIBILITY.

103 * Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide

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

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

106 INCOMPATIBILITY.

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

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

110 INCOMPATIBILITY.

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

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

114 interpretation of abstract locales. INCOMPATIBILITY.

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

117 INCOMPATIBILITY.

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

120 theorem.

122 * Class linordered_semiring_1 covers zero_less_one also, ruling out

123 pathologic instances. Minor INCOMPATIBILITY.

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

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

128 abbreviation. INCOMPATIBILITY.

130 * Code generation: Code generation takes an explicit option

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

134 *** System ***

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

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

138 anymore.

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

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

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

144 repository for the generated session files.

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

147 support has been discontinued.

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

150 longer supported.

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

153 been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,

154 instead of former 32/64 variants. INCOMPATIBILITY.

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

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

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

159 - option -f: forces a fresh build

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

162 corresponding environment values into account, when determining the

163 up-to-date status of a session.

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

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

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

169 PIDE markup for identifier bindings.

171 * ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific

172 options for improved error reporting. Potential INCOMPATIBILITY with

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

177 New in Isabelle2017 (October 2017)

178 ----------------------------------

180 *** General ***

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

183 Isabelle/PIDE front-end, see also

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

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

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

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

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

190 Technically, VSCode is based on the Electron application framework

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

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

193 modules around a Language Server implementation.

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

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

197 just the theory base name as before).

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

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

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

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

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

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

205 imports" helps to update theory imports.

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

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

209 leads to the follow renamings:

211 CTT/Main.thy ~> CTT/CTT.thy

212 ZF/Main.thy ~> ZF/ZF.thy

213 ZF/Main_ZF.thy ~> ZF/ZF.thy

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

215 ZF/ZF.thy ~> ZF/ZF_Base.thy

217 INCOMPATIBILITY.

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

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

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

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

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

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

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

228 antiquotations:

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

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

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

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

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

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

237 src/HOL/Decision_Procs/Commutative_Ring.thy and

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

239 tutorial on code generation.

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

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

245 arbitrary theory hierarchies independently of the underlying logic

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

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

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

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

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

252 changes of formal document content. Theory dependencies are always

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

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

255 effectively always enabled.

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

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

259 buffers.

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

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

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

264 represented by a different border color.

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

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

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

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

271 document in the default web browser.

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

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

275 used for formal checking.

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

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

279 enabled at all times.

281 * Update to current jedit-5.4.0.

284 *** Pure ***

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

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

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

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

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

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

293 ignored with warnings if syntactically malformed.

294 - Explicitly global code declarations yield errors if syntactically

295 malformed.

296 - Default code declarations are silently ignored if syntactically

297 malformed.

298 Minor INCOMPATIBILITY.

300 * Clarified and standardized internal data bookkeeping of code

301 declarations: history of serials allows to track potentially

302 non-monotonous declarations appropriately. Minor INCOMPATIBILITY.

305 *** HOL ***

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

309 * SMT module:

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

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

312 disabled by default.

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

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

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

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

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

319 INCOMPATIBILITY.

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

322 terms without free variables are always evaluated using plain evaluation

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

324 INCOMPATIBILITY.

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

327 of "Complex_Main").

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

330 Minor INCOMPATIBILITY.

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

333 INCOMPATIBILITY.

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

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

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

339 transp, antisymp, single_valuedp instead. INCOMPATIBILITY.

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

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

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

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

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

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

350 * Named theorems mod_simps covers various congruence rules concerning

351 mod, replacing former zmod_simps. INCOMPATIBILITY.

353 * Swapped orientation of congruence rules mod_add_left_eq,

354 mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,

355 mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,

356 mod_diff_eq. INCOMPATIBILITY.

358 * Generalized some facts:

359 measure_induct_rule

360 measure_induct

361 zminus_zmod ~> mod_minus_eq

362 zdiff_zmod_left ~> mod_diff_left_eq

363 zdiff_zmod_right ~> mod_diff_right_eq

364 zmod_eq_dvd_iff ~> mod_eq_dvd_iff

365 INCOMPATIBILITY.

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

368 euclidean_(semi)ring, euclidean_(semi)ring_cancel,

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

370 euclidean size.

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

373 - Euclidean induction is available as rule eucl_induct.

374 - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,

375 Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow

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

377 - Coefficients obtained by extended euclidean algorithm are

378 available as "bezout_coefficients".

379 INCOMPATIBILITY.

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

382 totient function previously hidden as solitary example in theory

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

384 the literature. Minor INCOMPATIBILITY.

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

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

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

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

391 been renamed to bij_swap_compose_bij. INCOMPATIBILITY.

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

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

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

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

398 space. INCOMPATIBILITY.

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

401 INCOMPATIBILITY.

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

404 replacement syntax has been removed. INCOMPATIBILITY, standard syntax

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

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

408 syntax (ASCII)

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

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

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

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

414 multisets have been renamed:

416 msetless_cancel_numerals ~> msetsubset_cancel

417 msetle_cancel_numerals ~> msetsubset_eq_cancel

419 INCOMPATIBILITY.

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

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

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

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

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

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

429 Curve Theorem and the Great Picard Theorem.

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

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

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

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

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

438 theories, notably Euclidean_Algorithm, Factorial_Ring,

439 Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,

440 Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor

441 INCOMPATIBILITY.

444 *** System ***

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

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

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

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

451 "Application File Format" in the sense of

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

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

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

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

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

458 builds (according to parallel_subproofs_threshold).

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

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

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

463 unchanged.

465 * Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been

466 renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.

468 * Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,

469 ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the

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

471 is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,

472 ISABELLE_PLATFORM64.

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

475 the Isabelle application bundle for Linux. See also

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

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

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

480 serves as example for alternative PIDE front-ends.

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

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

485 isabelle imports -I -a

486 isabelle imports -U -a

487 isabelle imports -U -i -a

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

492 New in Isabelle2016-1 (December 2016)

493 -------------------------------------

495 *** General ***

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

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

499 INCOMPATIBILITY.

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

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

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

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

504 result the subgoal may be split into several subgoals.

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

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

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

510 bundle foo

511 begin

512 declare a [simp]

513 declare b [intro]

514 end

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

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

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

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

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

522 discontinued.

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

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

526 quotes when sub-languages are nested.

528 * Mixfix annotations support general block properties, with syntax

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

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

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

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

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

535 statements without object-logic judgment.

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

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

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

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

542 examples.

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

545 instances) are generated into companion object of corresponding type

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

548 * Solve direct: option "solve_direct_strict_warnings" gives explicit

549 warnings for lemma statements with trivial proofs.

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

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

555 system option editor_generated_input_delay (in addition to existing

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

557 reactivity and CPU usage.

559 * Syntactic indentation according to Isabelle outer syntax. Action

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

561 command keywords and some command substructure. Action

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

563 according to command keywords only; see also option

564 "jedit_indent_newline".

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

567 number of subgoals. This requires information of ongoing document

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

569 quickly; see also option "jedit_script_indent" and

570 "jedit_script_indent_limit".

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

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

574 structure of theory specifications is treated as well.

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

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

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

580 e.g. 'context', 'notepad'.

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

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

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

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

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

589 systematic renaming.

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

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

593 theorem statement.

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

596 situations where old ASCII notation may be updated.

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

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

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

601 inaccessible via keyboard completion).

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

604 following independent stages:

606 src/Pure/ROOT0.ML

607 src/Pure/ROOT.ML

608 src/Pure/Pure.thy

609 src/Pure/ML_Bootstrap.thy

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

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

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

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

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

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

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

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

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

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

623 * Additional abbreviations for syntactic completion may be specified

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

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

626 new 'abbrevs' section.

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

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

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

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

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

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

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

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

637 old keymaps.

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

640 and diverse:

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

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

644 @{dir NAME} -- check for directory

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

647 have to be changed.

650 *** Document preparation ***

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

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

655 existing antiquotation @{class}.

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

658 this allows special forms of document output.

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

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

662 derivatives.

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

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

667 Isabelle2015).

670 *** Isar ***

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

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

674 'definition', 'inductive', 'function'.

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

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

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

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

680 context: INCOMPATIBILITY.

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

683 optional abstraction over local parameters. The syntax resembles

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

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

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

688 context.

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

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

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

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

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

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

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

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

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

702 INCOMPATIBILITY.

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

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

706 definitions.

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

709 expression, e.g.

711 (use facts in simp)

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

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

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

718 *** Pure ***

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

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

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

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

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

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

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

728 regardless of the actual parameters that are provided. Rare

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

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

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

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

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

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

736 INCOMPATIBILITY, need to provide explicit type constraints for Pure

737 types where this is really intended.

740 *** HOL ***

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

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

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

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

746 quantifier-free propositional logic with linear real arithmetic

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

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

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

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

753 break existing proofs. INCOMPATIBILITY.

755 * Sledgehammer:

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

757 - Produce syntactically correct Vampire 4.0 problem files.

759 * (Co)datatype package:

760 - New commands for defining corecursive functions and reasoning about

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

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

763 method. See 'isabelle doc corec'.

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

765 citizen in bounded natural functors.

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

767 to the map function.

768 - 'bnf' automatically discharges reflexive proof obligations.

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

770 terms of map and set

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

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

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

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

775 - Renamed lemmas:

776 rel_prod_apply ~> rel_prod_inject

777 pred_prod_apply ~> pred_prod_inject

778 INCOMPATIBILITY.

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

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

781 equivalent) form.

782 INCOMPATIBILITY.

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

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

786 which exposed details of the internal fixpoint construction and was

787 hard to use. INCOMPATIBILITY.

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

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

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

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

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

796 eliminated altogether.

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

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

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

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

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

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

804 INCOMPATIBILITY in rare situations.

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

807 INCOMPATIBILITY.

809 * Renamed constants and corresponding theorems:

811 setsum ~> sum

812 setprod ~> prod

813 listsum ~> sum_list

814 listprod ~> prod_list

816 INCOMPATIBILITY.

818 * Sligthly more standardized theorem names:

819 sgn_times ~> sgn_mult

820 sgn_mult' ~> Real_Vector_Spaces.sgn_mult

821 divide_zero_left ~> div_0

822 zero_mod_left ~> mod_0

823 divide_zero ~> div_by_0

824 divide_1 ~> div_by_1

825 nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left

826 div_mult_self1_is_id ~> nonzero_mult_div_cancel_left

827 nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right

828 div_mult_self2_is_id ~> nonzero_mult_div_cancel_right

829 is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left

830 is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right

831 mod_div_equality ~> div_mult_mod_eq

832 mod_div_equality2 ~> mult_div_mod_eq

833 mod_div_equality3 ~> mod_div_mult_eq

834 mod_div_equality4 ~> mod_mult_div_eq

835 minus_div_eq_mod ~> minus_div_mult_eq_mod

836 minus_div_eq_mod2 ~> minus_mult_div_eq_mod

837 minus_mod_eq_div ~> minus_mod_eq_div_mult

838 minus_mod_eq_div2 ~> minus_mod_eq_mult_div

839 div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]

840 mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]

841 zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]

842 zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]

843 Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

844 mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

845 zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

846 div_1 ~> div_by_Suc_0

847 mod_1 ~> mod_by_Suc_0

848 INCOMPATIBILITY.

850 * New type class "idom_abs_sgn" specifies algebraic properties

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

852 disappeared. Slight INCOMPATIBILITY.

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

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

857 corresponding to {0..255}.

859 - Logical representation:

860 * 0 is instantiated to the ASCII zero character.

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

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

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

864 are non-canonical.

865 - Printing and parsing:

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

867 (as before).

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

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

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

871 is parsable for every numeral expression n.

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

873 printed as their logical representation.

874 - Explicit conversions from and to the natural numbers are

875 provided as char_of_nat, nat_of_char (as before).

876 - The auxiliary nibble type has been discontinued.

878 INCOMPATIBILITY.

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

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

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

883 infix "mod" syntax. INCOMPATIBILITY.

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

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

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

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

889 easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.

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

892 equation in term output. Minor INCOMPATIBILITY.

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

895 which renders those abstract effectively.

897 * Command 'export_code' checks given constants for abstraction

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

899 interface for the generated code.

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

902 spelt out explicitly.

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

905 explicitly provided auxiliary definitions for required type class

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

907 tutorial on code generation for details.

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

910 products.

912 * Locale bijection establishes convenient default simp rules such as

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

915 * Abstract locales semigroup, abel_semigroup, semilattice,

916 semilattice_neutr, ordering, ordering_top, semilattice_order,

917 semilattice_neutr_order, comm_monoid_set, semilattice_set,

918 semilattice_neutr_set, semilattice_order_set,

919 semilattice_order_neutr_set monoid_list, comm_monoid_list,

920 comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified

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

922 INCOMPATIBILITY.

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

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

926 lifting_syntax begin ... end". Minor INCOMPATIBILITY.

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

929 INCOMPATIBILITY.

931 nat_less_cases -- removed, use linorder_cases instead

932 inv_image_comp -- removed, use image_inv_f_f instead

933 image_surj_f_inv_f ~> image_f_inv_f

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

936 groups to semi-groups that are also monoids:

937 le_add_same_cancel1

938 le_add_same_cancel2

939 less_add_same_cancel1

940 less_add_same_cancel2

941 add_le_same_cancel1

942 add_le_same_cancel2

943 add_less_same_cancel1

944 add_less_same_cancel2

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

947 superseeded by a more general version:

948 less_add_cancel_left_greater_zero ~> less_add_same_cancel1

949 less_add_cancel_right_greater_zero ~> less_add_same_cancel2

950 less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1

951 less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2

952 less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1

953 less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2

954 less_add_cancel_left_less_zero ~> add_less_same_cancel1

955 less_add_cancel_right_less_zero ~> add_less_same_cancel2

956 INCOMPATIBILITY.

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

959 resemble the f.split naming convention, INCOMPATIBILITY.

961 * Added class topological_monoid.

963 * The following theorems have been renamed:

965 setsum_left_distrib ~> sum_distrib_right

966 setsum_right_distrib ~> sum_distrib_left

968 INCOMPATIBILITY.

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

971 INCOMPATIBILITY.

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

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

975 A)".

977 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.

979 * The type class ordered_comm_monoid_add is now called

980 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add

981 is introduced as the combination of ordered_ab_semigroup_add +

982 comm_monoid_add. INCOMPATIBILITY.

984 * Introduced the type classes canonically_ordered_comm_monoid_add and

985 dioid.

987 * Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When

988 instantiating linordered_semiring_strict and ordered_ab_group_add, an

989 explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might

990 be required. INCOMPATIBILITY.

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

993 of a more general type also:

994 lcm_left_commute_nat ~> lcm.left_commute

995 lcm_left_commute_int ~> lcm.left_commute

996 gcd_left_commute_nat ~> gcd.left_commute

997 gcd_left_commute_int ~> gcd.left_commute

998 gcd_greatest_iff_nat ~> gcd_greatest_iff

999 gcd_greatest_iff_int ~> gcd_greatest_iff

1000 coprime_dvd_mult_nat ~> coprime_dvd_mult

1001 coprime_dvd_mult_int ~> coprime_dvd_mult

1002 zpower_numeral_even ~> power_numeral_even

1003 gcd_mult_cancel_nat ~> gcd_mult_cancel

1004 gcd_mult_cancel_int ~> gcd_mult_cancel

1005 div_gcd_coprime_nat ~> div_gcd_coprime

1006 div_gcd_coprime_int ~> div_gcd_coprime

1007 zpower_numeral_odd ~> power_numeral_odd

1008 zero_less_int_conv ~> of_nat_0_less_iff

1009 gcd_greatest_nat ~> gcd_greatest

1010 gcd_greatest_int ~> gcd_greatest

1011 coprime_mult_nat ~> coprime_mult

1012 coprime_mult_int ~> coprime_mult

1013 lcm_commute_nat ~> lcm.commute

1014 lcm_commute_int ~> lcm.commute

1015 int_less_0_conv ~> of_nat_less_0_iff

1016 gcd_commute_nat ~> gcd.commute

1017 gcd_commute_int ~> gcd.commute

1018 Gcd_insert_nat ~> Gcd_insert

1019 Gcd_insert_int ~> Gcd_insert

1020 of_int_int_eq ~> of_int_of_nat_eq

1021 lcm_least_nat ~> lcm_least

1022 lcm_least_int ~> lcm_least

1023 lcm_assoc_nat ~> lcm.assoc

1024 lcm_assoc_int ~> lcm.assoc

1025 int_le_0_conv ~> of_nat_le_0_iff

1026 int_eq_0_conv ~> of_nat_eq_0_iff

1027 Gcd_empty_nat ~> Gcd_empty

1028 Gcd_empty_int ~> Gcd_empty

1029 gcd_assoc_nat ~> gcd.assoc

1030 gcd_assoc_int ~> gcd.assoc

1031 zero_zle_int ~> of_nat_0_le_iff

1032 lcm_dvd2_nat ~> dvd_lcm2

1033 lcm_dvd2_int ~> dvd_lcm2

1034 lcm_dvd1_nat ~> dvd_lcm1

1035 lcm_dvd1_int ~> dvd_lcm1

1036 gcd_zero_nat ~> gcd_eq_0_iff

1037 gcd_zero_int ~> gcd_eq_0_iff

1038 gcd_dvd2_nat ~> gcd_dvd2

1039 gcd_dvd2_int ~> gcd_dvd2

1040 gcd_dvd1_nat ~> gcd_dvd1

1041 gcd_dvd1_int ~> gcd_dvd1

1042 int_numeral ~> of_nat_numeral

1043 lcm_ac_nat ~> ac_simps

1044 lcm_ac_int ~> ac_simps

1045 gcd_ac_nat ~> ac_simps

1046 gcd_ac_int ~> ac_simps

1047 abs_int_eq ~> abs_of_nat

1048 zless_int ~> of_nat_less_iff

1049 zdiff_int ~> of_nat_diff

1050 zadd_int ~> of_nat_add

1051 int_mult ~> of_nat_mult

1052 int_Suc ~> of_nat_Suc

1053 inj_int ~> inj_of_nat

1054 int_1 ~> of_nat_1

1055 int_0 ~> of_nat_0

1056 Lcm_empty_nat ~> Lcm_empty

1057 Lcm_empty_int ~> Lcm_empty

1058 Lcm_insert_nat ~> Lcm_insert

1059 Lcm_insert_int ~> Lcm_insert

1060 comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd

1061 comp_fun_idem_gcd_int ~> comp_fun_idem_gcd

1062 comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm

1063 comp_fun_idem_lcm_int ~> comp_fun_idem_lcm

1064 Lcm_eq_0 ~> Lcm_eq_0_I

1065 Lcm0_iff ~> Lcm_0_iff

1066 Lcm_dvd_int ~> Lcm_least

1067 divides_mult_nat ~> divides_mult

1068 divides_mult_int ~> divides_mult

1069 lcm_0_nat ~> lcm_0_right

1070 lcm_0_int ~> lcm_0_right

1071 lcm_0_left_nat ~> lcm_0_left

1072 lcm_0_left_int ~> lcm_0_left

1073 dvd_gcd_D1_nat ~> dvd_gcdD1

1074 dvd_gcd_D1_int ~> dvd_gcdD1

1075 dvd_gcd_D2_nat ~> dvd_gcdD2

1076 dvd_gcd_D2_int ~> dvd_gcdD2

1077 coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff

1078 coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff

1079 realpow_minus_mult ~> power_minus_mult

1080 realpow_Suc_le_self ~> power_Suc_le_self

1081 dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest

1082 INCOMPATIBILITY.

1084 * Renamed HOL/Quotient_Examples/FSet.thy to

1085 HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.

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

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

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

1090 "unbundle finfun_syntax" to imitate import of

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

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

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

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

1096 once.

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

1099 set_mset rather than count.

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

1102 by default.

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

1105 equations count_eq_zero_iff and not_in_iff.

1107 - Rules count_inI and in_countE obtain facts of the form

1108 "count M a = n" from membership.

1110 - Rules count_in_diffI and in_diff_countE obtain facts of the form

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

1113 INCOMPATIBILITY.

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

1116 displaying equations in functional programming style --- variables

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

1118 underscores.

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

1121 build partial equivalence relations from a predicate and an equivalence

1122 relation.

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

1125 everywhere fix bijections.

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

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

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

1130 denominator is normalized wrt. unit factors).

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

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

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

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

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

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

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

1142 principle, Residue theorem, Schwarz Lemma.

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

1145 polytopes, and the Krein–Milman Minkowski theorem.

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

1148 libraries: homeomorphisms, continuous function extensions, invariance of

1149 domain.

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

1152 changed from ereal to ennreal, INCOMPATIBILITY.

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

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

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

1158 Probability Mass Functions.

1160 * Session HOL-Probability: theory Random_Permutations contains some

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

1162 folding over a list in random order.

1164 * Session HOL-Probability: theory SPMF formalises discrete

1165 subprobability distributions.

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

1168 normalised to distinguish which ordering the theorems are about

1170 mset_less_eqI ~> mset_subset_eqI

1171 mset_less_insertD ~> mset_subset_insertD

1172 mset_less_eq_count ~> mset_subset_eq_count

1173 mset_less_diff_self ~> mset_subset_diff_self

1174 mset_le_exists_conv ~> mset_subset_eq_exists_conv

1175 mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel

1176 mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel

1177 mset_le_mono_add ~> mset_subset_eq_mono_add

1178 mset_le_add_left ~> mset_subset_eq_add_left

1179 mset_le_add_right ~> mset_subset_eq_add_right

1180 mset_le_single ~> mset_subset_eq_single

1181 mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute

1182 diff_le_self ~> diff_subset_eq_self

1183 mset_leD ~> mset_subset_eqD

1184 mset_lessD ~> mset_subsetD

1185 mset_le_insertD ~> mset_subset_eq_insertD

1186 mset_less_of_empty ~> mset_subset_of_empty

1187 mset_less_size ~> mset_subset_size

1188 wf_less_mset_rel ~> wf_subset_mset_rel

1189 count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq

1190 mset_remdups_le ~> mset_remdups_subset_eq

1191 ms_lesseq_impl ~> subset_eq_mset_impl

1193 Some functions have been renamed:

1194 ms_lesseq_impl -> subset_eq_mset_impl

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

1197 #\<subseteq># ~> \<le>

1198 #\<subset># ~> <

1199 le_multiset ~> less_eq_multiset

1200 less_multiset ~> le_multiset

1201 INCOMPATIBILITY.

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

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

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

1206 interpretations "multiset_linorder" and "multiset_wellorder" have been

1207 replaced by instantiations. INCOMPATIBILITY.

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

1210 been renamed:

1212 le_multiset_def ~> less_eq_multiset_def

1213 less_multiset_def ~> le_multiset_def

1214 less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset

1215 mult_less_not_refl ~> mset_le_not_refl

1216 mult_less_trans ~> mset_le_trans

1217 mult_less_not_sym ~> mset_le_not_sym

1218 mult_less_asym ~> mset_le_asym

1219 mult_less_irrefl ~> mset_le_irrefl

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

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

1223 le_multiset_total ~> less_eq_multiset_total

1224 less_multiset_right_total ~> subset_eq_imp_le_multiset

1225 le_multiset_empty_left ~> less_eq_multiset_empty_left

1226 le_multiset_empty_right ~> less_eq_multiset_empty_right

1227 less_multiset_empty_right ~> le_multiset_empty_left

1228 less_multiset_empty_left ~> le_multiset_empty_right

1229 union_less_diff_plus ~> union_le_diff_plus

1230 ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset

1231 less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty

1232 le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty

1233 INCOMPATIBILITY.

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

1236 INCOMPATIBILITY.

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

1239 INCOMPATIBILITY, use the following replacements:

1241 le_multiset_plus_plus_left_iff ~> add_less_cancel_right

1242 less_multiset_plus_plus_left_iff ~> add_less_cancel_right

1243 le_multiset_plus_plus_right_iff ~> add_less_cancel_left

1244 less_multiset_plus_plus_right_iff ~> add_less_cancel_left

1245 add_eq_self_empty_iff ~> add_cancel_left_right

1246 mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right

1247 mset_less_add_bothsides ~> subset_mset.add_less_cancel_right

1248 mset_le_add_bothsides ~> subset_mset.add_less_cancel_right

1249 empty_inter ~> subset_mset.inf_bot_left

1250 inter_empty ~> subset_mset.inf_bot_right

1251 empty_sup ~> subset_mset.sup_bot_left

1252 sup_empty ~> subset_mset.sup_bot_right

1253 bdd_below_multiset ~> subset_mset.bdd_above_bot

1254 subset_eq_empty ~> subset_mset.le_zero_eq

1255 le_empty ~> subset_mset.le_zero_eq

1256 mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

1257 mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

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

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

1261 additional typeclasses order_bot, no_top,

1262 ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,

1263 linordered_cancel_ab_semigroup_add, and

1264 ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.

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

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

1268 INCOMPATIBILITY.

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

1271 interpretations ordered_ab_semigroup_monoid_add_imp_le and

1272 bounded_lattice_bot. INCOMPATIBILITY.

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

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

1276 removed or changed:

1278 single_not_empty ~> add_mset_not_empty or empty_not_add_mset

1279 fold_mset_insert ~> fold_mset_add_mset

1280 image_mset_insert ~> image_mset_add_mset

1281 union_single_eq_diff

1282 multi_self_add_other_not_self

1283 diff_single_eq_union

1284 INCOMPATIBILITY.

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

1287 to use add_mset instead of single:

1289 mset_add

1290 multi_self_add_other_not_self

1291 diff_single_eq_union

1292 union_single_eq_diff

1293 union_single_eq_member

1294 add_eq_conv_diff

1295 insert_noteq_member

1296 add_eq_conv_ex

1297 multi_member_split

1298 multiset_add_sub_el_shuffle

1299 mset_subset_eq_insertD

1300 mset_subset_insertD

1301 insert_subset_eq_iff

1302 insert_union_subset_iff

1303 multi_psub_of_add_self

1304 inter_add_left1

1305 inter_add_left2

1306 inter_add_right1

1307 inter_add_right2

1308 sup_union_left1

1309 sup_union_left2

1310 sup_union_right1

1311 sup_union_right2

1312 size_eq_Suc_imp_eq_union

1313 multi_nonempty_split

1314 mset_insort

1315 mset_update

1316 mult1I

1317 less_add

1318 mset_zip_take_Cons_drop_twice

1319 rel_mset_Zero

1320 msed_map_invL

1321 msed_map_invR

1322 msed_rel_invL

1323 msed_rel_invR

1324 le_multiset_right_total

1325 multiset_induct

1326 multiset_induct2_size

1327 multiset_induct2

1328 INCOMPATIBILITY.

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

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

1332 element:

1334 image_mset

1335 mset

1336 replicate_mset

1337 mult1

1338 pred_mset

1339 rel_mset'

1340 mset_insort

1342 INCOMPATIBILITY.

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

1345 attributes of some multiset theorems have been changed:

1347 insert_DiffM [] ~> [simp]

1348 insert_DiffM2 [simp] ~> []

1349 diff_add_mset_swap [simp]

1350 fold_mset_add_mset [simp]

1351 diff_diff_add [simp] (for multisets only)

1352 diff_cancel [simp] ~> []

1353 count_single [simp] ~> []

1354 set_mset_single [simp] ~> []

1355 size_multiset_single [simp] ~> []

1356 size_single [simp] ~> []

1357 image_mset_single [simp] ~> []

1358 mset_subset_eq_mono_add_right_cancel [simp] ~> []

1359 mset_subset_eq_mono_add_left_cancel [simp] ~> []

1360 fold_mset_single [simp] ~> []

1361 subset_eq_empty [simp] ~> []

1362 empty_sup [simp] ~> []

1363 sup_empty [simp] ~> []

1364 inter_empty [simp] ~> []

1365 empty_inter [simp] ~> []

1366 INCOMPATIBILITY.

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

1369 the second cases of multiset_induct, multiset_induct2_size,

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

1371 INCOMPATIBILITY.

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

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

1375 natural numbers. INCOMPATIBILITY.

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

1378 multisets:

1380 msetsum ~> sum_mset

1381 msetprod ~> prod_mset

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

1384 and union of multisets have been changed:

1386 #\<inter> ~> \<inter>#

1387 #\<union> ~> \<union>#

1389 INCOMPATIBILITY.

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

1392 one_step_implies_mult_aux on multisets has been removed, use

1393 one_step_implies_mult instead. INCOMPATIBILITY.

1395 * Session HOL-Library: theory Complete_Partial_Order2 provides reasoning

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

1397 and about admissibility conditions for fixpoint inductions.

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

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

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

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

1403 future different type class instantiation for polynomials over factorial

1404 rings. INCOMPATIBILITY.

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

1407 the following renaming

1409 prefixeq -> prefix

1410 prefix -> strict_prefix

1411 suffixeq -> suffix

1412 suffix -> strict_suffix

1414 Added theory of longest common prefixes.

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

1417 Generalisation of predicate "prime" and introduction of predicates

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

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

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

1421 "prime_nat_iff". INCOMPATIBILITY.

1423 * Session Old_Number_Theory has been removed, after porting remaining

1424 theories.

1426 * Session HOL-Types_To_Sets provides an experimental extension of

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

1430 *** ML ***

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

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

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

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

1436 INCOMPATIBILITY.

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

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

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

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

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

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

1444 superseded by General.Div.

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

1447 the argument is a plain file. Minor INCOMPATIBILITY.

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

1450 with approximative output quality.

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

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

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

1456 This is particularly useful for conditional compilation, without

1457 requiring separate files.

1459 * Option ML_exception_debugger controls detailed exception trace via the

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

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

1462 debugger information requires consirable time and space: main

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

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

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

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

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

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

1470 balanced blocks of Local_Theory.open_target versus

1471 Local_Theory.close_target instead. Rare INCOMPATIBILITY.

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

1474 replaced by structure Timeout, with slightly different signature.

1475 INCOMPATIBILITY.

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

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

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

1480 File.full_path). Potential INCOMPATIBILITY.

1482 * Binding.empty_atts supersedes Thm.empty_binding and

1483 Attrib.empty_binding. Minor INCOMPATIBILITY.

1486 *** System ***

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

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

1491 much less disk space.

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

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

1495 particular:

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

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

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

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

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

1503 prover front-ends should use ML_Process or Isabelle_Process in

1504 Isabelle/Scala. INCOMPATIBILITY.

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

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

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

1509 return code 1.

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

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

1513 servers with separate CPU/memory modules.

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

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

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

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

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

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

1522 by default).

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

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

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

1527 resulting log files.

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

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

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

1532 implicit default via option -p.

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

1535 bootstrapping Isabelle/Pure interactively.

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

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

1539 Isabelle/ML or Isabelle/Scala.

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

1542 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,

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

1544 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been

1545 discontinued. Potential INCOMPATIBILITY.

1547 * The Isabelle system environment always ensures that the main

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

1549 "isabelle_scala_script".

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

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

1553 Isabelle_Tool.Body.

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

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

1557 produce robust shell scripts under program control, without worrying

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

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

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

1561 been discontinued.

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

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

1565 but without the Isabelle settings environment.

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

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

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

1570 that Path specifications need to be resolved remotely via

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

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

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

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

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

1577 connection).

1581 New in Isabelle2016 (February 2016)

1582 -----------------------------------

1584 *** General ***

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

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

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

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

1590 examples that do require HOL.

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

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

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

1596 without any special print mode. Important ASCII replacement syntax

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

1598 has been removed (see below).

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

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

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

1604 context has been discontinued. Rare INCOMPATIBILITY, use explicit

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

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

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

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

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

1611 meaning.

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

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

1615 to update old sources.

1617 * Toplevel theorem statements have been simplified as follows:

1619 theorems ~> lemmas

1620 schematic_lemma ~> schematic_goal

1621 schematic_theorem ~> schematic_goal

1622 schematic_corollary ~> schematic_goal

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

1625 accordingly.

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

1628 'theorem'.

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

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

1632 deferred definitions require a surrounding 'overloading' block.

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

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

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

1639 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

1640 'SML_file_no_debug' control compilation of sources with or without

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

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

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

1644 any effect on the running ML program.

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

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

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

1649 update.

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

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

1653 enable option "editor_output_state".

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

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

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

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

1659 visibility.

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

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

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

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

1665 panel.

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

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

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

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

1672 implicit: a popup will show up unconditionally.

1674 * Additional abbreviations for syntactic completion may be specified in

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

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

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

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

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

1681 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.

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

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

1685 the editor.

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

1688 instead of former C+e LEFT.

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

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

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

1693 instead.

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

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

1697 single-instance applications seen on common GUI desktops.

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

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

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

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

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

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

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

1710 *** Document preparation ***

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

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

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

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

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

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

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

1721 follows:

1723 \<^item> itemize

1724 \<^enum> enumerate

1725 \<^descr> description

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

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

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

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

1731 standard Isabelle fonts provide glyphs to render important control

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

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

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

1736 standard LaTeX macros of the same names.

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

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

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

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

1742 cartouche tokens seen in theory sources.

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

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

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

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

1748 or terminal spaces are ignored.

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

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

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

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

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

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

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

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

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

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

1764 documentation, with a hyperlink in the Prover IDE.

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

1767 entities of the Isar language.

1769 * HTML presentation uses the standard IsabelleText font and Unicode

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

1771 print mode "HTML" loses its special meaning.

1774 *** Isar ***

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

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

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

1779 example:

1781 have result: "C x y"

1782 if "A x" and "B y"

1783 for x :: 'a and y :: 'a

1784 <proof>

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

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

1788 corresponds to a raw proof block like this:

1790 {

1791 fix x :: 'a and y :: 'a

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

1793 have "C x y" <proof>

1794 }

1795 note result = this

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

1798 instead of 'assume' above.

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

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

1803 assume result: "C x y"

1804 if "A x" and "B y"

1805 for x :: 'a and y :: 'a

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

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

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

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

1812 example:

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

1816 is equivalent to:

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

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

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

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

1823 follows:

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

1827 or:

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

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

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

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

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

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

1838 of the local context elements yet.

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

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

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

1844 then have something

1845 proof cases

1846 case a

1847 then show ?thesis <proof>

1848 next

1849 case b

1850 then show ?thesis <proof>

1851 next

1852 case c

1853 then show ?thesis <proof>

1854 qed

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

1858 case a: (c xs)

1859 case a [attributes]: (c xs)

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

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

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

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

1865 and always put attributes in front.

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

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

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

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

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

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

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

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

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

1878 supply [simp] = a

1879 proof

1880 show A by simp

1881 next

1882 show A by simp

1883 qed

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

1886 proof body as well, abstracted over relevant parameters.

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

1889 parameter scope for of each clause.

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

1892 statements: result is abstracted over unknowns.

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

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

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

1897 manual.

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

1900 ('apply' scripts).

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

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

1904 example:

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

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

1908 proof goal_cases

1909 case (1 x)

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

1911 next

1912 case (2 y z)

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

1914 qed

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

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

1918 proof goal_cases

1919 case prems: 1

1920 then show ?case using prems sorry

1921 next

1922 case prems: 2

1923 then show ?case using prems sorry

1924 qed

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

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

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

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

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

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

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

1935 occasionally useful for demonstration and testing purposes.

1938 *** Pure ***

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

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

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

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

1945 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

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

1948 * More gentle suppression of syntax along locale morphisms while

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

1950 would be suppressed for morphisms except term identity. Now

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

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

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

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

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

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

1958 begin

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

1960 end

1962 locale morphism =

1963 left: struct composition + right: struct composition'

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

1965 begin

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

1967 end

1969 * Command 'global_interpretation' issues interpretations into global

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

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

1973 'defines'.

1975 * Command 'permanent_interpretation' has been discontinued. Use

1976 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

1978 * Command 'print_definitions' prints dependencies of definitional

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

1981 * Configuration option rule_insts_schematic has been discontinued

1982 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

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

1985 INCOMPATIBILITY in situations where the previous misbehaviour has been

1986 exploited.

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

1989 operations behave more similar to abbreviations. Potential

1990 INCOMPATIBILITY in exotic situations.

1993 *** HOL ***

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

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

1997 global collection of overloaded constant / type definitions into

1998 account. Type definitions with open dependencies on overloaded

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

2000 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

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

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

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

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

2006 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

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

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

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

2011 simplify porting old theories:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

2040 INCOMPATIBILITY, use plain "::" instead.

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

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

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

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

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

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

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

2050 definition and its monotonicity result. Rare INCOMPATIBILITY.

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

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

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

2055 also subject to "inductive_internals". Rare INCOMPATIBILITY.

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

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

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

2060 INCOMPATIBILITY.

2062 * Combinator to represent case distinction on products is named

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

2064 theorem aliasses have been retained.

2066 Consolidated facts:

2067 PairE ~> prod.exhaust

2068 Pair_eq ~> prod.inject

2069 pair_collapse ~> prod.collapse

2070 Pair_fst_snd_eq ~> prod_eq_iff

2071 split_twice ~> prod.case_distrib

2072 split_weak_cong ~> prod.case_cong_weak

2073 split_split ~> prod.split

2074 split_split_asm ~> prod.split_asm

2075 splitI ~> case_prodI

2076 splitD ~> case_prodD

2077 splitI2 ~> case_prodI2

2078 splitI2' ~> case_prodI2'

2079 splitE ~> case_prodE

2080 splitE' ~> case_prodE'

2081 split_pair ~> case_prod_Pair

2082 split_eta ~> case_prod_eta

2083 split_comp ~> case_prod_comp

2084 mem_splitI ~> mem_case_prodI

2085 mem_splitI2 ~> mem_case_prodI2

2086 mem_splitE ~> mem_case_prodE

2087 The_split ~> The_case_prod

2088 cond_split_eta ~> cond_case_prod_eta

2089 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

2090 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

2091 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

2092 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

2093 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

2094 Domain_Collect_split ~> Domain_Collect_case_prod

2095 Image_Collect_split ~> Image_Collect_case_prod

2096 Range_Collect_split ~> Range_Collect_case_prod

2097 Eps_split ~> Eps_case_prod

2098 Eps_split_eq ~> Eps_case_prod_eq

2099 split_rsp ~> case_prod_rsp

2100 curry_split ~> curry_case_prod

2101 split_curry ~> case_prod_curry

2103 Changes in structure HOLogic:

2104 split_const ~> case_prod_const

2105 mk_split ~> mk_case_prod

2106 mk_psplits ~> mk_ptupleabs

2107 strip_psplits ~> strip_ptupleabs

2109 INCOMPATIBILITY.

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

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

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

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

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

2117 Consolidated facts (among others):

2118 real_of_nat_le_iff -> of_nat_le_iff

2119 real_of_nat_numeral of_nat_numeral

2120 real_of_int_zero of_int_0

2121 real_of_nat_zero of_nat_0

2122 real_of_one of_int_1

2123 real_of_int_add of_int_add

2124 real_of_nat_add of_nat_add

2125 real_of_int_diff of_int_diff

2126 real_of_nat_diff of_nat_diff

2127 floor_subtract floor_diff_of_int

2128 real_of_int_inject of_int_eq_iff

2129 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

2130 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

2131 real_of_nat_ge_zero of_nat_0_le_iff

2132 real_of_int_ceiling_ge le_of_int_ceiling

2133 ceiling_less_eq ceiling_less_iff

2134 ceiling_le_eq ceiling_le_iff

2135 less_floor_eq less_floor_iff

2136 floor_less_eq floor_less_iff

2137 floor_divide_eq_div floor_divide_of_int_eq

2138 real_of_int_zero_cancel of_nat_eq_0_iff

2139 ceiling_real_of_int ceiling_of_int

2141 INCOMPATIBILITY.

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

2144 been removed. INCOMPATIBILITY.

2146 * Quickcheck setup for finite sets.

2148 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

2150 * Sledgehammer:

2151 - The MaSh relevance filter has been sped up.

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

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

2154 - Auto Sledgehammer now minimizes and preplays the results.

2155 - Handle Vampire 4.0 proof output without raising exception.

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

2157 Isabelle/jEdit instead. INCOMPATIBILITY.

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

2160 * Nitpick:

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

2162 - Fixed soundness bug in "destroy_constrs" optimization.

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

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

2165 - Eliminated obsolete "blocking" option.

2167 * (Co)datatype package:

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

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

2170 - Always generate "case_transfer" theorem.

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

2172 "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.

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

2174 being defined.

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

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

2178 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

2179 'transfer_prover_start' and 'transfer_prover_end'.

2181 * New diagnostic command print_record for displaying record definitions.

2183 * Division on integers is bootstrapped directly from division on

2184 naturals and uses generic numeral algorithm for computations. Slight

2185 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

2186 simprocs binary_int_div and binary_int_mod

2188 * Tightened specification of class semiring_no_zero_divisors. Minor

2189 INCOMPATIBILITY.

2191 * Class algebraic_semidom introduces common algebraic notions of

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

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

2194 fields with notions that are trivial there.

2196 * Class normalization_semidom specifies canonical representants for

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

2198 This formalizes associated elements as well.

2200 * Abstract specification of gcd/lcm operations in classes semiring_gcd,

2201 semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute

2202 and gcd_int.commute are subsumed by gcd.commute, as well as

2203 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

2205 * Former constants Fields.divide (_ / _) and Divides.div (_ div _) are

2206 logically unified to Rings.divide in syntactic type class Rings.divide,

2207 with infix syntax (_ div _). Infix syntax (_ / _) for field division is

2208 added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,

2209 instantiations must refer to Rings.divide rather than the former

2210 separate constants, hence infix syntax (_ / _) is usually not available

2211 during instantiation.

2213 * New cancellation simprocs for boolean algebras to cancel complementary

2214 terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to

2215 "top". INCOMPATIBILITY.

2217 * Class uniform_space introduces uniform spaces btw topological spaces

2218 and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be

2219 introduced in the form of an uniformity. Some constants are more general

2220 now, it may be necessary to add type class constraints.

2222 open_real_def \<leadsto> open_dist

2223 open_complex_def \<leadsto> open_dist

2225 * Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.

2227 * Library/Multiset:

2228 - Renamed multiset inclusion operators:

2229 < ~> <#

2230 > ~> >#

2231 <= ~> <=#

2232 >= ~> >=#

2233 \<le> ~> \<le>#

2234 \<ge> ~> \<ge>#

2235 INCOMPATIBILITY.

2236 - Added multiset inclusion operator syntax:

2237 \<subset>#

2238 \<subseteq>#

2239 \<supset>#

2240 \<supseteq>#

2241 - "'a multiset" is no longer an instance of the "order",

2242 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

2243 "semilattice_inf", and "semilattice_sup" type classes. The theorems

2244 previously provided by these type classes (directly or indirectly)

2245 are now available through the "subset_mset" interpretation

2246 (e.g. add_mono ~> subset_mset.add_mono).

2247 INCOMPATIBILITY.

2248 - Renamed conversions:

2249 multiset_of ~> mset

2250 multiset_of_set ~> mset_set

2251 set_of ~> set_mset

2252 INCOMPATIBILITY

2253 - Renamed lemmas:

2254 mset_le_def ~> subseteq_mset_def

2255 mset_less_def ~> subset_mset_def

2256 less_eq_multiset.rep_eq ~> subseteq_mset_def

2257 INCOMPATIBILITY

2258 - Removed lemmas generated by lift_definition:

2259 less_eq_multiset.abs_eq, less_eq_multiset.rsp,

2260 less_eq_multiset.transfer, less_eq_multiset_def

2261 INCOMPATIBILITY

2263 * Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.

2265 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

2266 Bourbaki-Witt fixpoint theorem for increasing functions in

2267 chain-complete partial orders.

2269 * Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.

2270 Minor INCOMPATIBILITY, use 'function' instead.

2272 * Library/Periodic_Fun: a locale that provides convenient lemmas for

2273 periodic functions.

2275 * Library/Formal_Power_Series: proper definition of division (with

2276 remainder) for formal power series; instances for Euclidean Ring and

2277 GCD.

2279 * HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.

2281 * HOL-Statespace: command 'statespace' uses mandatory qualifier for

2282 import of parent, as for general 'locale' expressions. INCOMPATIBILITY,

2283 remove '!' and add '?' as required.

2285 * HOL-Decision_Procs: The "approximation" method works with "powr"

2286 (exponentiation on real numbers) again.

2288 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

2289 integrals (= complex path integrals), Cauchy's integral theorem, winding

2290 numbers and Cauchy's integral formula, Liouville theorem, Fundamental

2291 Theorem of Algebra. Ported from HOL Light.

2293 * HOL-Multivariate_Analysis: topological concepts such as connected

2294 components, homotopic paths and the inside or outside of a set.

2296 * HOL-Multivariate_Analysis: radius of convergence of power series and

2297 various summability tests; Harmonic numbers and the Euler–Mascheroni

2298 constant; the Generalised Binomial Theorem; the complex and real

2299 Gamma/log-Gamma/Digamma/ Polygamma functions and their most important

2300 properties.

2302 * HOL-Probability: The central limit theorem based on Levy's uniqueness

2303 and continuity theorems, weak convergence, and characterisitc functions.

2305 * HOL-Data_Structures: new and growing session of standard data

2306 structures.

2309 *** ML ***

2311 * The following combinators for low-level profiling of the ML runtime

2312 system are available:

2314 profile_time (*CPU time*)

2315 profile_time_thread (*CPU time on this thread*)

2316 profile_allocations (*overall heap allocations*)

2318 * Antiquotation @{undefined} or \<^undefined> inlines (raise Match).

2320 * Antiquotation @{method NAME} inlines the (checked) name of the given

2321 Isar proof method.

2323 * Pretty printing of Poly/ML compiler output in Isabelle has been

2324 improved: proper treatment of break offsets and blocks with consistent

2325 breaks.

2327 * The auxiliary module Pure/display.ML has been eliminated. Its

2328 elementary thm print operations are now in Pure/more_thm.ML and thus

2329 called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.

2331 * Simproc programming interfaces have been simplified:

2332 Simplifier.make_simproc and Simplifier.define_simproc supersede various

2333 forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that

2334 term patterns for the left-hand sides are specified with implicitly

2335 fixed variables, like top-level theorem statements. INCOMPATIBILITY.

2337 * Instantiation rules have been re-organized as follows:

2339 Thm.instantiate (*low-level instantiation with named arguments*)

2340 Thm.instantiate' (*version with positional arguments*)

2342 Drule.infer_instantiate (*instantiation with type inference*)

2343 Drule.infer_instantiate' (*version with positional arguments*)

2345 The LHS only requires variable specifications, instead of full terms.

2346 Old cterm_instantiate is superseded by infer_instantiate.

2347 INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.

2349 * Old tactic shorthands atac, rtac, etac, dtac, ftac have been

2350 discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.

2351 instead (with proper context).

2353 * Thm.instantiate (and derivatives) no longer require the LHS of the

2354 instantiation to be certified: plain variables are given directly.

2356 * Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous

2357 quasi-bound variables (like the Simplifier), instead of accidentally

2358 named local fixes. This has the potential to improve stability of proof

2359 tools, but can also cause INCOMPATIBILITY for tools that don't observe

2360 the proof context discipline.

2362 * Isar proof methods are based on a slightly more general type

2363 context_tactic, which allows to change the proof context dynamically

2364 (e.g. to update cases) and indicate explicit Seq.Error results. Former

2365 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

2366 provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.

2369 *** System ***

2371 * Command-line tool "isabelle console" enables print mode "ASCII".

2373 * Command-line tool "isabelle update_then" expands old Isar command

2374 conflations:

2376 hence ~> then have

2377 thus ~> then show

2379 This syntax is more orthogonal and improves readability and

2380 maintainability of proofs.

2382 * Global session timeout is multiplied by timeout_scale factor. This

2383 allows to adjust large-scale tests (e.g. AFP) to overall hardware

2384 performance.

2386 * Property values in etc/symbols may contain spaces, if written with the

2387 replacement character "␣" (Unicode point 0x2324). For example:

2389 \<star> code: 0x0022c6 group: operator font: Deja␣Vu␣Sans␣Mono

2391 * Java runtime environment for x86_64-windows allows to use larger heap

2392 space.

2394 * Java runtime options are determined separately for 32bit vs. 64bit

2395 platforms as follows.

2397 - Isabelle desktop application: platform-specific files that are

2398 associated with the main app bundle

2400 - isabelle jedit: settings

2401 JEDIT_JAVA_SYSTEM_OPTIONS

2402 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

2404 - isabelle build: settings

2405 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

2407 * Bash shell function "jvmpath" has been renamed to "platform_path": it

2408 is relevant both for Poly/ML and JVM processes.

2410 * Poly/ML default platform architecture may be changed from 32bit to

2411 64bit via system option ML_system_64. A system restart (and rebuild) is

2412 required after change.

2414 * Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which

2415 both allow larger heap space than former x86-cygwin.

2417 * Heap images are 10-15% smaller due to less wasteful persistent theory

2418 content (using ML type theory_id instead of theory);

2422 New in Isabelle2015 (May 2015)

2423 ------------------------------

2425 *** General ***

2427 * Local theory specification commands may have a 'private' or

2428 'qualified' modifier to restrict name space accesses to the local scope,

2429 as provided by some "context begin ... end" block. For example:

2431 context

2432 begin

2434 private definition ...

2435 private lemma ...

2437 qualified definition ...

2438 qualified lemma ...

2440 lemma ...

2441 theorem ...

2443 end

2445 * Command 'experiment' opens an anonymous locale context with private

2446 naming policy.

2448 * Command 'notepad' requires proper nesting of begin/end and its proof

2449 structure in the body: 'oops' is no longer supported here. Minor

2450 INCOMPATIBILITY, use 'sorry' instead.

2452 * Command 'named_theorems' declares a dynamic fact within the context,

2453 together with an attribute to maintain the content incrementally. This

2454 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change

2455 of semantics due to external visual order vs. internal reverse order.

2457 * 'find_theorems': search patterns which are abstractions are

2458 schematically expanded before search. Search results match the naive

2459 expectation more closely, particularly wrt. abbreviations.

2460 INCOMPATIBILITY.

2462 * Commands 'method_setup' and 'attribute_setup' now work within a local

2463 theory context.

2465 * Outer syntax commands are managed authentically within the theory

2466 context, without implicit global state. Potential for accidental

2467 INCOMPATIBILITY, make sure that required theories are really imported.

2469 * Historical command-line terminator ";" is no longer accepted (and

2470 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle

2471 update_semicolons" to remove obsolete semicolons from old theory

2472 sources.

2474 * Structural composition of proof methods (meth1; meth2) in Isar

2475 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

2477 * The Eisbach proof method language allows to define new proof methods

2478 by combining existing ones with their usual syntax. The "match" proof

2479 method provides basic fact/term matching in addition to

2480 premise/conclusion matching through Subgoal.focus, and binds fact names

2481 from matches as well as term patterns within matches. The Isabelle

2482 documentation provides an entry "eisbach" for the Eisbach User Manual.

2483 Sources and various examples are in ~~/src/HOL/Eisbach/.

2486 *** Prover IDE -- Isabelle/Scala/jEdit ***

2488 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,

2489 the "sidekick" mode may be used for document structure.

2491 * Extended bracket matching based on Isar language structure. System

2492 option jedit_structure_limit determines maximum number of lines to scan

2493 in the buffer.

2495 * Support for BibTeX files: context menu, context-sensitive token

2496 marker, SideKick parser.

2498 * Document antiquotation @{cite} provides formal markup, which is

2499 interpreted semi-formally based on .bib files that happen to be open in

2500 the editor (hyperlinks, completion etc.).

2502 * Less waste of vertical space via negative line spacing (see Global

2503 Options / Text Area).

2505 * Improved graphview panel with optional output of PNG or PDF, for

2506 display of 'thy_deps', 'class_deps' etc.

2508 * The commands 'thy_deps' and 'class_deps' allow optional bounds to

2509 restrict the visualized hierarchy.

2511 * Improved scheduling for asynchronous print commands (e.g. provers

2512 managed by the Sledgehammer panel) wrt. ongoing document processing.

2515 *** Document preparation ***

2517 * Document markup commands 'chapter', 'section', 'subsection',

2518 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any

2519 context, even before the initial 'theory' command. Obsolete proof

2520 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been

2521 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'

2522 instead. The old 'header' command is still retained for some time, but

2523 should be replaced by 'chapter', 'section' etc. (using "isabelle

2524 update_header"). Minor INCOMPATIBILITY.

2526 * Official support for "tt" style variants, via \isatt{...} or

2527 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or

2528 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.

2529 as argument to other macros (such as footnotes).

2531 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"

2532 style.

2534 * Discontinued obsolete option "document_graph": session_graph.pdf is

2535 produced unconditionally for HTML browser_info and PDF-LaTeX document.

2537 * Diagnostic commands and document markup commands within a proof do not

2538 affect the command tag for output. Thus commands like 'thm' are subject

2539 to proof document structure, and no longer "stick out" accidentally.

2540 Commands 'text' and 'txt' merely differ in the LaTeX style, not their

2541 tags. Potential INCOMPATIBILITY in exotic situations.

2543 * System option "pretty_margin" is superseded by "thy_output_margin",

2544 which is also accessible via document antiquotation option "margin".

2545 Only the margin for document output may be changed, but not the global

2546 pretty printing: that is 76 for plain console output, and adapted

2547 dynamically in GUI front-ends. Implementations of document

2548 antiquotations need to observe the margin explicitly according to

2549 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

2551 * Specification of 'document_files' in the session ROOT file is

2552 mandatory for document preparation. The legacy mode with implicit

2553 copying of the document/ directory is no longer supported. Minor

2554 INCOMPATIBILITY.

2557 *** Pure ***

2559 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"

2560 etc.) allow an optional context of local variables ('for' declaration):

2561 these variables become schematic in the instantiated theorem; this

2562 behaviour is analogous to 'for' in attributes "where" and "of".

2563 Configuration option rule_insts_schematic (default false) controls use

2564 of schematic variables outside the context. Minor INCOMPATIBILITY,

2565 declare rule_insts_schematic = true temporarily and update to use local

2566 variable declarations or dummy patterns instead.

2568 * Explicit instantiation via attributes "where", "of", and proof methods

2569 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns

2570 ("_") that stand for anonymous local variables.

2572 * Generated schematic variables in standard format of exported facts are

2573 incremented to avoid material in the proof context. Rare

2574 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

2575 different index.

2577 * Lexical separation of signed and unsigned numerals: categories "num"

2578 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence

2579 of numeral signs, particularly in expressions involving infix syntax

2580 like "(- 1) ^ n".

2582 * Old inner token category "xnum" has been discontinued. Potential

2583 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"

2584 token category instead.

2587 *** HOL ***

2589 * New (co)datatype package:

2590 - The 'datatype_new' command has been renamed 'datatype'. The old

2591 command of that name is now called 'old_datatype' and is provided

2592 by "~~/src/HOL/Library/Old_Datatype.thy". See

2593 'isabelle doc datatypes' for information on porting.

2594 INCOMPATIBILITY.

2595 - Renamed theorems:

2596 disc_corec ~> corec_disc

2597 disc_corec_iff ~> corec_disc_iff

2598 disc_exclude ~> distinct_disc

2599 disc_exhaust ~> exhaust_disc

2600 disc_map_iff ~> map_disc_iff

2601 sel_corec ~> corec_sel

2602 sel_exhaust ~> exhaust_sel

2603 sel_map ~> map_sel

2604 sel_set ~> set_sel

2605 sel_split ~> split_sel

2606 sel_split_asm ~> split_sel_asm

2607 strong_coinduct ~> coinduct_strong

2608 weak_case_cong ~> case_cong_weak

2609 INCOMPATIBILITY.

2610 - The "no_code" option to "free_constructors", "datatype_new", and

2611 "codatatype" has been renamed "plugins del: code".

2612 INCOMPATIBILITY.

2613 - The rules "set_empty" have been removed. They are easy

2614 consequences of other set rules "by auto".

2615 INCOMPATIBILITY.

2616 - The rule "set_cases" is now registered with the "[cases set]"

2617 attribute. This can influence the behavior of the "cases" proof

2618 method when more than one case rule is applicable (e.g., an

2619 assumption is of the form "w : set ws" and the method "cases w"

2620 is invoked). The solution is to specify the case rule explicitly

2621 (e.g. "cases w rule: widget.exhaust").

2622 INCOMPATIBILITY.

2623 - Renamed theories:

2624 BNF_Comp ~> BNF_Composition

2625 BNF_FP_Base ~> BNF_Fixpoint_Base

2626 BNF_GFP ~> BNF_Greatest_Fixpoint

2627 BNF_LFP ~> BNF_Least_Fixpoint

2628 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

2629 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

2630 INCOMPATIBILITY.

2631 - Lifting and Transfer setup for basic HOL types sum and prod (also

2632 option) is now performed by the BNF package. Theories Lifting_Sum,

2633 Lifting_Product and Lifting_Option from Main became obsolete and

2634 were removed. Changed definitions of the relators rel_prod and

2635 rel_sum (using inductive).

2636 INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead

2637 of rel_prod_def and rel_sum_def.

2638 Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names

2639 changed (e.g. map_prod_transfer ~> prod.map_transfer).

2640 - Parametricity theorems for map functions, relators, set functions,

2641 constructors, case combinators, discriminators, selectors and

2642 (co)recursors are automatically proved and registered as transfer

2643 rules.

2645 * Old datatype package:

2646 - The old 'datatype' command has been renamed 'old_datatype', and

2647 'rep_datatype' has been renamed 'old_rep_datatype'. They are

2648 provided by "~~/src/HOL/Library/Old_Datatype.thy". See

2649 'isabelle doc datatypes' for information on porting.

2650 INCOMPATIBILITY.

2651 - Renamed theorems:

2652 weak_case_cong ~> case_cong_weak

2653 INCOMPATIBILITY.

2654 - Renamed theory:

2655 ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy

2656 INCOMPATIBILITY.

2658 * Nitpick:

2659 - Fixed soundness bug related to the strict and non-strict subset

2660 operations.

2662 * Sledgehammer:

2663 - CVC4 is now included with Isabelle instead of CVC3 and run by

2664 default.

2665 - Z3 is now always enabled by default, now that it is fully open

2666 source. The "z3_non_commercial" option is discontinued.

2667 - Minimization is now always enabled by default.

2668 Removed sub-command:

2669 min

2670 - Proof reconstruction, both one-liners and Isar, has been

2671 dramatically improved.

2672 - Improved support for CVC4 and veriT.

2674 * Old and new SMT modules:

2675 - The old 'smt' method has been renamed 'old_smt' and moved to

2676 'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,

2677 until applications have been ported to use the new 'smt' method. For

2678 the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must

2679 be installed, and the environment variable "OLD_Z3_SOLVER" must

2680 point to it.

2681 INCOMPATIBILITY.

2682 - The 'smt2' method has been renamed 'smt'.

2683 INCOMPATIBILITY.

2684 - New option 'smt_reconstruction_step_timeout' to limit the

2685 reconstruction time of Z3 proof steps in the new 'smt' method.

2686 - New option 'smt_statistics' to display statistics of the new 'smt'

2687 method, especially runtime statistics of Z3 proof reconstruction.

2689 * Lifting: command 'lift_definition' allows to execute lifted constants

2690 that have as a return type a datatype containing a subtype. This

2691 overcomes long-time limitations in the area of code generation and

2692 lifting, and avoids tedious workarounds.

2694 * Command and antiquotation "value" provide different evaluation slots

2695 (again), where the previous strategy (NBE after ML) serves as default.

2696 Minor INCOMPATIBILITY.

2698 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.

2700 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid

2701 non-termination in case of distributing a division. With this change

2702 field_simps is in some cases slightly less powerful, if it fails try to

2703 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

2705 * Separate class no_zero_divisors has been given up in favour of fully

2706 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

2708 * Class linordered_semidom really requires no zero divisors.

2709 INCOMPATIBILITY.

2711 * Classes division_ring, field and linordered_field always demand

2712 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,

2713 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

2715 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

2716 additive inverse operation. INCOMPATIBILITY.

2718 * Complex powers and square roots. The functions "ln" and "powr" are now

2719 overloaded for types real and complex, and 0 powr y = 0 by definition.

2720 INCOMPATIBILITY: type constraints may be necessary.

2722 * The functions "sin" and "cos" are now defined for any type of sort

2723 "{real_normed_algebra_1,banach}" type, so in particular on "real" and

2724 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be

2725 needed.

2727 * New library of properties of the complex transcendental functions sin,

2728 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.

2730 * The factorial function, "fact", now has type "nat => 'a" (of a sort

2731 that admits numeric types including nat, int, real and complex.

2732 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type

2733 constraint, and the combination "real (fact k)" is likely to be

2734 unsatisfactory. If a type conversion is still necessary, then use

2735 "of_nat (fact k)" or "real_of_nat (fact k)".

2737 * Removed functions "natfloor" and "natceiling", use "nat o floor" and

2738 "nat o ceiling" instead. A few of the lemmas have been retained and

2739 adapted: in their names "natfloor"/"natceiling" has been replaced by

2740 "nat_floor"/"nat_ceiling".

2742 * Qualified some duplicated fact names required for boostrapping the

2743 type class hierarchy:

2744 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

2745 field_inverse_zero ~> inverse_zero

2746 field_divide_inverse ~> divide_inverse

2747 field_inverse ~> left_inverse

2748 Minor INCOMPATIBILITY.

2750 * Eliminated fact duplicates:

2751 mult_less_imp_less_right ~> mult_right_less_imp_less

2752 mult_less_imp_less_left ~> mult_left_less_imp_less

2753 Minor INCOMPATIBILITY.

2755 * Fact consolidation: even_less_0_iff is subsumed by

2756 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

2758 * Generalized and consolidated some theorems concerning divsibility:

2759 dvd_reduce ~> dvd_add_triv_right_iff

2760 dvd_plus_eq_right ~> dvd_add_right_iff

2761 dvd_plus_eq_left ~> dvd_add_left_iff

2762 Minor INCOMPATIBILITY.

2764 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"

2765 and part of theory Main.

2766 even_def ~> even_iff_mod_2_eq_zero

2767 INCOMPATIBILITY.

2769 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor

2770 INCOMPATIBILITY.

2772 * Bootstrap of listsum as special case of abstract product over lists.

2773 Fact rename:

2774 listsum_def ~> listsum.eq_foldr

2775 INCOMPATIBILITY.

2777 * Product over lists via constant "listprod".

2779 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

2780 Cons_nth_drop_Suc.

2782 * New infrastructure for compiling, running, evaluating and testing

2783 generated code in target languages in HOL/Library/Code_Test. See

2784 HOL/Codegenerator_Test/Code_Test* for examples.

2786 * Library/Multiset:

2787 - Introduced "replicate_mset" operation.

2788 - Introduced alternative characterizations of the multiset ordering in

2789 "Library/Multiset_Order".

2790 - Renamed multiset ordering:

2791 <# ~> #<#

2792 <=# ~> #<=#

2793 \<subset># ~> #\<subset>#

2794 \<subseteq># ~> #\<subseteq>#

2795 INCOMPATIBILITY.

2796 - Introduced abbreviations for ill-named multiset operations:

2797 <#, \<subset># abbreviate < (strict subset)

2798 <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)

2799 INCOMPATIBILITY.

2800 - Renamed

2801 in_multiset_of ~> in_multiset_in_set

2802 Multiset.fold ~> fold_mset

2803 Multiset.filter ~> filter_mset

2804 INCOMPATIBILITY.

2805 - Removed mcard, is equal to size.

2806 - Added attributes:

2807 image_mset.id [simp]

2808 image_mset_id [simp]

2809 elem_multiset_of_set [simp, intro]

2810 comp_fun_commute_plus_mset [simp]

2811 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

2812 in_mset_fold_plus_iff [iff]

2813 set_of_Union_mset [simp]

2814 in_Union_mset_iff [iff]

2815 INCOMPATIBILITY.

2817 * Library/Sum_of_Squares: simplified and improved "sos" method. Always

2818 use local CSDP executable, which is much faster than the NEOS server.

2819 The "sos_cert" functionality is invoked as "sos" with additional

2820 argument. Minor INCOMPATIBILITY.

2822 * HOL-Decision_Procs: New counterexample generator quickcheck

2823 [approximation] for inequalities of transcendental functions. Uses

2824 hardware floating point arithmetic to randomly discover potential

2825 counterexamples. Counterexamples are certified with the "approximation"

2826 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for

2827 examples.

2829 * HOL-Probability: Reworked measurability prover

2830 - applies destructor rules repeatedly

2831 - removed application splitting (replaced by destructor rule)

2832 - added congruence rules to rewrite measure spaces under the sets

2833 projection

2835 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for

2836 single-step rewriting with subterm selection based on patterns.

2839 *** ML ***

2841 * Subtle change of name space policy: undeclared entries are now

2842 considered inaccessible, instead of accessible via the fully-qualified

2843 internal name. This mainly affects Name_Space.intern (and derivatives),

2844 which may produce an unexpected Long_Name.hidden prefix. Note that

2845 contemporary applications use the strict Name_Space.check (and

2846 derivatives) instead, which is not affected by the change. Potential

2847 INCOMPATIBILITY in rare applications of Name_Space.intern.

2849 * Subtle change of error semantics of Toplevel.proof_of: regular user

2850 ERROR instead of internal Toplevel.UNDEF.

2852 * Basic combinators map, fold, fold_map, split_list, apply are available

2853 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.

2855 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.

2856 INCOMPATIBILITY.

2858 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

2859 sections have been discontinued, in favour of the more elementary

2860 Multithreading.synchronized and its high-level derivative

2861 Synchronized.var (which is usually sufficient in applications). Subtle

2862 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be

2863 nested.

2865 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle

2866 change of semantics with minimal potential for INCOMPATIBILITY.

2868 * The main operations to certify logical entities are Thm.ctyp_of and

2869 Thm.cterm_of with a local context; old-style global theory variants are

2870 available as Thm.global_ctyp_of and Thm.global_cterm_of.

2871 INCOMPATIBILITY.

2873 * Elementary operations in module Thm are no longer pervasive.

2874 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,

2875 Thm.term_of etc.

2877 * Proper context for various elementary tactics: assume_tac,

2878 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

2879 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

2881 * Tactical PARALLEL_ALLGOALS is the most common way to refer to

2882 PARALLEL_GOALS.

2884 * Goal.prove_multi is superseded by the fully general Goal.prove_common,

2885 which also allows to specify a fork priority.

2887 * Antiquotation @{command_spec "COMMAND"} is superseded by

2888 @{command_keyword COMMAND} (usually without quotes and with PIDE

2889 markup). Minor INCOMPATIBILITY.

2891 * Cartouches within ML sources are turned into values of type

2892 Input.source (with formal position information).

2895 *** System ***

2897 * The Isabelle tool "update_cartouches" changes theory files to use

2898 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.

2900 * The Isabelle tool "build" provides new options -X, -k, -x.

2902 * Discontinued old-fashioned "codegen" tool. Code generation can always

2903 be externally triggered using an appropriate ROOT file plus a

2904 corresponding theory. Parametrization is possible using environment

2905 variables, or ML snippets in the most extreme cases. Minor

2906 INCOMPATIBILITY.

2908 * JVM system property "isabelle.threads" determines size of Scala thread

2909 pool, like Isabelle system option "threads" for ML.

2911 * JVM system property "isabelle.laf" determines the default Swing

2912 look-and-feel, via internal class name or symbolic name as in the jEdit

2913 menu Global Options / Appearance.

2915 * Support for Proof General and Isar TTY loop has been discontinued.

2916 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

2920 New in Isabelle2014 (August 2014)

2921 ---------------------------------

2923 *** General ***

2925 * Support for official Standard ML within the Isabelle context.

2926 Command 'SML_file' reads and evaluates the given Standard ML file.

2927 Toplevel bindings are stored within the theory context; the initial

2928 environment is restricted to the Standard ML implementation of

2929 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'

2930 and 'SML_export' allow to exchange toplevel bindings between the two

2931 separate environments. See also ~~/src/Tools/SML/Examples.thy for

2932 some examples.

2934 * Standard tactics and proof methods such as "clarsimp", "auto" and

2935 "safe" now preserve equality hypotheses "x = expr" where x is a free

2936 variable. Locale assumptions and chained facts containing "x"

2937 continue to be useful. The new method "hypsubst_thin" and the

2938 configuration option "hypsubst_thin" (within the attribute name space)

2939 restore the previous behavior. INCOMPATIBILITY, especially where

2940 induction is done after these methods or when the names of free and

2941 bound variables clash. As first approximation, old proofs may be

2942 repaired by "using [[hypsubst_thin = true]]" in the critical spot.

2944 * More static checking of proof methods, which allows the system to

2945 form a closure over the concrete syntax. Method arguments should be

2946 processed in the original proof context as far as possible, before

2947 operating on the goal state. In any case, the standard discipline for

2948 subgoal-addressing needs to be observed: no subgoals or a subgoal

2949 number that is out of range produces an empty result sequence, not an

2950 exception. Potential INCOMPATIBILITY for non-conformant tactical

2951 proof tools.

2953 * Lexical syntax (inner and outer) supports text cartouches with

2954 arbitrary nesting, and without escapes of quotes etc. The Prover IDE

2955 supports input via ` (backquote).

2957 * The outer syntax categories "text" (for formal comments and document

2958 markup commands) and "altstring" (for literal fact references) allow

2959 cartouches as well, in addition to the traditional mix of quotations.

2961 * Syntax of document antiquotation @{rail} now uses \<newline> instead

2962 of "\\", to avoid the optical illusion of escaped backslash within

2963 string token. General renovation of its syntax using text cartouches.

2964 Minor INCOMPATIBILITY.

2966 * Discontinued legacy_isub_isup, which was a temporary workaround for

2967 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts

2968 old identifier syntax with \<^isub> or \<^isup>. Potential

2969 INCOMPATIBILITY.

2971 * Document antiquotation @{url} produces markup for the given URL,

2972 which results in an active hyperlink within the text.

2974 * Document antiquotation @{file_unchecked} is like @{file}, but does

2975 not check existence within the file-system.

2977 * Updated and extended manuals: codegen, datatypes, implementation,

2978 isar-ref, jedit, system.

2981 *** Prover IDE -- Isabelle/Scala/jEdit ***

2983 * Improved Document panel: simplified interaction where every single

2984 mouse click (re)opens document via desktop environment or as jEdit

2985 buffer.

2987 * Support for Navigator plugin (with toolbar buttons), with connection

2988 to PIDE hyperlinks.

2990 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.

2991 Open text buffers take precedence over copies within the file-system.

2993 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for

2994 auxiliary ML files.

2996 * Improved syntactic and semantic completion mechanism, with simple

2997 templates, completion language context, name-space completion,

2998 file-name completion, spell-checker completion.

3000 * Refined GUI popup for completion: more robust key/mouse event

3001 handling and propagation to enclosing text area -- avoid loosing

3002 keystrokes with slow / remote graphics displays.

3004 * Completion popup supports both ENTER and TAB (default) to select an

3005 item, depending on Isabelle options.

3007 * Refined insertion of completion items wrt. jEdit text: multiple

3008 selections, rectangular selections, rectangular selection as "tall

3009 caret".

3011 * Integrated spell-checker for document text, comments etc. with

3012 completion popup and context-menu.

3014 * More general "Query" panel supersedes "Find" panel, with GUI access

3015 to commands 'find_theorems' and 'find_consts', as well as print

3016 operations for the context. Minor incompatibility in keyboard

3017 shortcuts etc.: replace action isabelle-find by isabelle-query.

3019 * Search field for all output panels ("Output", "Query", "Info" etc.)

3020 to highlight text via regular expression.

3022 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /

3023 General") allows to specify additional print modes for the prover

3024 process, without requiring old-fashioned command-line invocation of

3025 "isabelle jedit -m MODE".

3027 * More support for remote files (e.g. http) using standard Java

3028 networking operations instead of jEdit virtual file-systems.

3030 * Empty editors buffers that are no longer required (e.g.\ via theory

3031 imports) are automatically removed from the document model.

3033 * Improved monitor panel.

3035 * Improved Console/Scala plugin: more uniform scala.Console output,

3036 more robust treatment of threads and interrupts.

3038 * Improved management of dockable windows: clarified keyboard focus

3039 and window placement wrt. main editor view; optional menu item to

3040 "Detach" a copy where this makes sense.

3042 * New Simplifier Trace panel provides an interactive view of the

3043 simplification process, enabled by the "simp_trace_new" attribute

3044 within the context.

3047 *** Pure ***

3049 * Low-level type-class commands 'classes', 'classrel', 'arities' have

3050 been discontinued to avoid the danger of non-trivial axiomatization

3051 that is not immediately visible. INCOMPATIBILITY, use regular

3052 'instance' command with proof. The required OFCLASS(...) theorem

3053 might be postulated via 'axiomatization' beforehand, or the proof

3054 finished trivially if the underlying class definition is made vacuous

3055 (without any assumptions). See also Isabelle/ML operations

3056 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

3057 Axclass.arity_axiomatization.

3059 * Basic constants of Pure use more conventional names and are always

3060 qualified. Rare INCOMPATIBILITY, but with potentially serious

3061 consequences, notably for tools in Isabelle/ML. The following

3062 renaming needs to be applied:

3064 == ~> Pure.eq

3065 ==> ~> Pure.imp

3066 all ~> Pure.all

3067 TYPE ~> Pure.type

3068 dummy_pattern ~> Pure.dummy_pattern

3070 Systematic porting works by using the following theory setup on a

3071 *previous* Isabelle version to introduce the new name accesses for the

3072 old constants:

3074 setup {*

3075 fn thy => thy

3076 |> Sign.root_path

3077 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="

3078 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"

3079 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"

3080 |> Sign.restore_naming thy

3081 *}

3083 Thus ML antiquotations like @{const_name Pure.eq} may be used already.

3084 Later the application is moved to the current Isabelle version, and

3085 the auxiliary aliases are deleted.

3087 * Attributes "where" and "of" allow an optional context of local

3088 variables ('for' declaration): these variables become schematic in the

3089 instantiated theorem.

3091 * Obsolete attribute "standard" has been discontinued (legacy since

3092 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context

3093 where instantiations with schematic variables are intended (for

3094 declaration commands like 'lemmas' or attributes like "of"). The

3095 following temporary definition may help to port old applications:

3097 attribute_setup standard =

3098 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"

3100 * More thorough check of proof context for goal statements and

3101 attributed fact expressions (concerning background theory, declared

3102 hyps). Potential INCOMPATIBILITY, tools need to observe standard

3103 context discipline. See also Assumption.add_assumes and the more

3104 primitive Thm.assume_hyps.

3106 * Inner syntax token language allows regular quoted strings "..."

3107 (only makes sense in practice, if outer syntax is delimited

3108 differently, e.g. via cartouches).

3110 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,

3111 but the latter is retained some time as Proof General legacy.

3113 * Code generator preprocessor: explicit control of simp tracing on a

3114 per-constant basis. See attribute "code_preproc".

3117 *** HOL ***

3119 * Code generator: enforce case of identifiers only for strict target

3120 language requirements. INCOMPATIBILITY.

3122 * Code generator: explicit proof contexts in many ML interfaces.

3123 INCOMPATIBILITY.

3125 * Code generator: minimize exported identifiers by default. Minor

3126 INCOMPATIBILITY.

3128 * Code generation for SML and OCaml: dropped arcane "no_signatures"

3129 option. Minor INCOMPATIBILITY.

3131 * "declare [[code abort: ...]]" replaces "code_abort ...".

3132 INCOMPATIBILITY.

3134 * "declare [[code drop: ...]]" drops all code equations associated

3135 with the given constants.

3137 * Code generations are provided for make, fields, extend and truncate

3138 operations on records.

3140 * Command and antiquotation "value" are now hardcoded against nbe and

3141 ML. Minor INCOMPATIBILITY.

3143 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.

3145 * The symbol "\<newline>" may be used within char or string literals

3146 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.

3148 * Qualified String.implode and String.explode. INCOMPATIBILITY.

3150 * Simplifier: Enhanced solver of preconditions of rewrite rules can

3151 now deal with conjunctions. For help with converting proofs, the old

3152 behaviour of the simplifier can be restored like this: declare/using

3153 [[simp_legacy_precond]]. This configuration option will disappear

3154 again in the future. INCOMPATIBILITY.

3156 * Simproc "finite_Collect" is no longer enabled by default, due to

3157 spurious crashes and other surprises. Potential INCOMPATIBILITY.

3159 * Moved new (co)datatype package and its dependencies from session

3160 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',

3161 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now

3162 part of theory "Main".

3164 Theory renamings:

3165 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)

3166 Library/Wfrec.thy ~> Wfrec.thy

3167 Library/Zorn.thy ~> Zorn.thy

3168 Cardinals/Order_Relation.thy ~> Order_Relation.thy

3169 Library/Order_Union.thy ~> Cardinals/Order_Union.thy

3170 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

3171 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

3172 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

3173 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

3174 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

3175 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

3176 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

3177 BNF/BNF_Comp.thy ~> BNF_Comp.thy

3178 BNF/BNF_Def.thy ~> BNF_Def.thy

3179 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

3180 BNF/BNF_GFP.thy ~> BNF_GFP.thy

3181 BNF/BNF_LFP.thy ~> BNF_LFP.thy

3182 BNF/BNF_Util.thy ~> BNF_Util.thy

3183 BNF/Coinduction.thy ~> Coinduction.thy

3184 BNF/More_BNFs.thy ~> Library/More_BNFs.thy

3185 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy

3186 BNF/Examples/* ~> BNF_Examples/*

3188 New theories:

3189 Wellorder_Extension.thy (split from Zorn.thy)

3190 Library/Cardinal_Notations.thy

3191 Library/BNF_Axomatization.thy

3192 BNF_Examples/Misc_Primcorec.thy

3193 BNF_Examples/Stream_Processor.thy

3195 Discontinued theories:

3196 BNF/BNF.thy

3197 BNF/Equiv_Relations_More.thy

3199 INCOMPATIBILITY.

3201 * New (co)datatype package:

3202 - Command 'primcorec' is fully implemented.

3203 - Command 'datatype_new' generates size functions ("size_xxx" and

3204 "size") as required by 'fun'.

3205 - BNFs are integrated with the Lifting tool and new-style

3206 (co)datatypes with Transfer.

3207 - Renamed commands:

3208 datatype_new_compat ~> datatype_compat

3209 primrec_new ~> primrec

3210 wrap_free_constructors ~> free_constructors

3211 INCOMPATIBILITY.

3212 - The generated constants "xxx_case" and "xxx_rec" have been renamed

3213 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").

3214 INCOMPATIBILITY.

3215 - The constant "xxx_(un)fold" and related theorems are no longer

3216 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually

3217 using "prim(co)rec".

3218 INCOMPATIBILITY.

3219 - No discriminators are generated for nullary constructors by

3220 default, eliminating the need for the odd "=:" syntax.

3221 INCOMPATIBILITY.

3222 - No discriminators or selectors are generated by default by

3223 "datatype_new", unless custom names are specified or the new

3224 "discs_sels" option is passed.

3225 INCOMPATIBILITY.

3227 * Old datatype package:

3228 - The generated theorems "xxx.cases" and "xxx.recs" have been

3229 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->

3230 "sum.case"). INCOMPATIBILITY.

3231 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have

3232 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,

3233 "prod_case" ~> "case_prod"). INCOMPATIBILITY.

3235 * The types "'a list" and "'a option", their set and map functions,

3236 their relators, and their selectors are now produced using the new

3237 BNF-based datatype package.

3239 Renamed constants:

3240 Option.set ~> set_option

3241 Option.map ~> map_option

3242 option_rel ~> rel_option

3244 Renamed theorems:

3245 set_def ~> set_rec[abs_def]

3246 map_def ~> map_rec[abs_def]

3247 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")

3248 option.recs ~> option.rec

3249 list_all2_def ~> list_all2_iff

3250 set.simps ~> set_simps (or the slightly different "list.set")

3251 map.simps ~> list.map

3252 hd.simps ~> list.sel(1)

3253 tl.simps ~> list.sel(2-3)

3254 the.simps ~> option.sel

3256 INCOMPATIBILITY.

3258 * The following map functions and relators have been renamed:

3259 sum_map ~> map_sum

3260 map_pair ~> map_prod

3261 prod_rel ~> rel_prod

3262 sum_rel ~> rel_sum

3263 fun_rel ~> rel_fun

3264 set_rel ~> rel_set

3265 filter_rel ~> rel_filter

3266 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")

3267 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")

3268 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")

3270 INCOMPATIBILITY.

3272 * Lifting and Transfer:

3273 - a type variable as a raw type is supported

3274 - stronger reflexivity prover

3275 - rep_eq is always generated by lift_definition

3276 - setup for Lifting/Transfer is now automated for BNFs

3277 + holds for BNFs that do not contain a dead variable

3278 + relator_eq, relator_mono, relator_distr, relator_domain,

3279 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,

3280 right_unique, right_total, left_unique, left_total are proved

3281 automatically

3282 + definition of a predicator is generated automatically

3283 + simplification rules for a predicator definition are proved

3284 automatically for datatypes

3285 - consolidation of the setup of Lifting/Transfer

3286 + property that a relator preservers reflexivity is not needed any

3287 more

3288 Minor INCOMPATIBILITY.

3289 + left_total and left_unique rules are now transfer rules

3290 (reflexivity_rule attribute not needed anymore)

3291 INCOMPATIBILITY.

3292 + Domainp does not have to be a separate assumption in

3293 relator_domain theorems (=> more natural statement)

3294 INCOMPATIBILITY.

3295 - registration of code equations is more robust

3296 Potential INCOMPATIBILITY.

3297 - respectfulness proof obligation is preprocessed to a more readable

3298 form

3299 Potential INCOMPATIBILITY.

3300 - eq_onp is always unfolded in respectfulness proof obligation

3301 Potential INCOMPATIBILITY.

3302 - unregister lifting setup for Code_Numeral.integer and

3303 Code_Numeral.natural

3304 Potential INCOMPATIBILITY.

3305 - Lifting.invariant -> eq_onp

3306 INCOMPATIBILITY.

3308 * New internal SAT solver "cdclite" that produces models and proof

3309 traces. This solver replaces the internal SAT solvers "enumerate" and

3310 "dpll". Applications that explicitly used one of these two SAT

3311 solvers should use "cdclite" instead. In addition, "cdclite" is now

3312 the default SAT solver for the "sat" and "satx" proof methods and

3313 corresponding tactics; the old default can be restored using "declare

3314 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.

3316 * SMT module: A new version of the SMT module, temporarily called

3317 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,

3318 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also

3319 supported as oracles. Yices is no longer supported, because no version

3320 of the solver can handle both SMT-LIB 2 and quantifiers.

3322 * Activation of Z3 now works via "z3_non_commercial" system option

3323 (without requiring restart), instead of former settings variable

3324 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu

3325 Plugin Options / Isabelle / General.

3327 * Sledgehammer:

3328 - Z3 can now produce Isar proofs.

3329 - MaSh overhaul:

3330 . New SML-based learning algorithms eliminate the dependency on

3331 Python and increase performance and reliability.

3332 . MaSh and MeSh are now used by default together with the

3333 traditional MePo (Meng-Paulson) relevance filter. To disable

3334 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin

3335 Options / Isabelle / General to "none".

3336 - New option:

3337 smt_proofs

3338 - Renamed options:

3339 isar_compress ~> compress

3340 isar_try0 ~> try0

3342 INCOMPATIBILITY.

3344 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.

3346 * Nitpick:

3347 - Fixed soundness bug whereby mutually recursive datatypes could

3348 take infinite values.

3349 - Fixed soundness bug with low-level number functions such as

3350 "Abs_Integ" and "Rep_Integ".

3351 - Removed "std" option.

3352 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to

3353 "hide_types".

3355 * Metis: Removed legacy proof method 'metisFT'. Use 'metis

3356 (full_types)' instead. INCOMPATIBILITY.

3358 * Try0: Added 'algebra' and 'meson' to the set of proof methods.

3360 * Adjustion of INF and SUP operations:

3361 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.

3362 - Consolidated theorem names containing INFI and SUPR: have INF and

3363 SUP instead uniformly.

3364 - More aggressive normalization of expressions involving INF and Inf

3365 or SUP and Sup.

3366 - INF_image and SUP_image do not unfold composition.

3367 - Dropped facts INF_comp, SUP_comp.

3368 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

3369 simplifier implication in premises. Generalize and replace former

3370 INT_cong, SUP_cong

3372 INCOMPATIBILITY.

3374 * SUP and INF generalized to conditionally_complete_lattice.

3376 * Swapped orientation of facts image_comp and vimage_comp:

3378 image_compose ~> image_comp [symmetric]

3379 image_comp ~> image_comp [symmetric]

3380 vimage_compose ~> vimage_comp [symmetric]

3381 vimage_comp ~> vimage_comp [symmetric]

3383 INCOMPATIBILITY.

3385 * Theory reorganization: split of Big_Operators.thy into

3386 Groups_Big.thy and Lattices_Big.thy.

3388 * Consolidated some facts about big group operators:

3390 setsum_0' ~> setsum.neutral

3391 setsum_0 ~> setsum.neutral_const

3392 setsum_addf ~> setsum.distrib

3393 setsum_cartesian_product ~> setsum.cartesian_product

3394 setsum_cases ~> setsum.If_cases

3395 setsum_commute ~> setsum.commute

3396 setsum_cong ~> setsum.cong

3397 setsum_delta ~> setsum.delta

3398 setsum_delta' ~> setsum.delta'

3399 setsum_diff1' ~> setsum.remove

3400 setsum_empty ~> setsum.empty

3401 setsum_infinite ~> setsum.infinite

3402 setsum_insert ~> setsum.insert

3403 setsum_inter_restrict'' ~> setsum.inter_filter

3404 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

3405 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

3406 setsum_mono_zero_left ~> setsum.mono_neutral_left

3407 setsum_mono_zero_right ~> setsum.mono_neutral_right

3408 setsum_reindex ~> setsum.reindex

3409 setsum_reindex_cong ~> setsum.reindex_cong

3410 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

3411 setsum_restrict_set ~> setsum.inter_restrict

3412 setsum_Plus ~> setsum.Plus

3413 setsum_setsum_restrict ~> setsum.commute_restrict

3414 setsum_Sigma ~> setsum.Sigma

3415 setsum_subset_diff ~> setsum.subset_diff

3416 setsum_Un_disjoint ~> setsum.union_disjoint

3417 setsum_UN_disjoint ~> setsum.UNION_disjoint

3418 setsum_Un_Int ~> setsum.union_inter

3419 setsum_Union_disjoint ~> setsum.Union_disjoint

3420 setsum_UNION_zero ~> setsum.Union_comp

3421 setsum_Un_zero ~> setsum.union_inter_neutral

3422 strong_setprod_cong ~> setprod.strong_cong

3423 strong_setsum_cong ~> setsum.strong_cong

3424 setprod_1' ~> setprod.neutral

3425 setprod_1 ~> setprod.neutral_const

3426 setprod_cartesian_product ~> setprod.cartesian_product

3427 setprod_cong ~> setprod.cong

3428 setprod_delta ~> setprod.delta

3429 setprod_delta' ~> setprod.delta'

3430 setprod_empty ~> setprod.empty

3431 setprod_infinite ~> setprod.infinite

3432 setprod_insert ~> setprod.insert

3433 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

3434 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

3435 setprod_mono_one_left ~> setprod.mono_neutral_left

3436 setprod_mono_one_right ~> setprod.mono_neutral_right

3437 setprod_reindex ~> setprod.reindex

3438 setprod_reindex_cong ~> setprod.reindex_cong

3439 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

3440 setprod_Sigma ~> setprod.Sigma

3441 setprod_subset_diff ~> setprod.subset_diff

3442 setprod_timesf ~> setprod.distrib

3443 setprod_Un2 ~> setprod.union_diff2

3444 setprod_Un_disjoint ~> setprod.union_disjoint

3445 setprod_UN_disjoint ~> setprod.UNION_disjoint

3446 setprod_Un_Int ~> setprod.union_inter

3447 setprod_Union_disjoint ~> setprod.Union_disjoint

3448 setprod_Un_one ~> setprod.union_inter_neutral

3450 Dropped setsum_cong2 (simple variant of setsum.cong).

3451 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)

3452 Dropped setsum_reindex_id, setprod_reindex_id

3453 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).

3455 INCOMPATIBILITY.

3457 * Abolished slightly odd global lattice interpretation for min/max.

3459 Fact consolidations:

3460 min_max.inf_assoc ~> min.assoc

3461 min_max.inf_commute ~> min.commute

3462 min_max.inf_left_commute ~> min.left_commute

3463 min_max.inf_idem ~> min.idem

3464 min_max.inf_left_idem ~> min.left_idem

3465 min_max.inf_right_idem ~> min.right_idem

3466 min_max.sup_assoc ~> max.assoc

3467 min_max.sup_commute ~> max.commute

3468 min_max.sup_left_commute ~> max.left_commute

3469 min_max.sup_idem ~> max.idem

3470 min_max.sup_left_idem ~> max.left_idem

3471 min_max.sup_inf_distrib1 ~> max_min_distrib2

3472 min_max.sup_inf_distrib2 ~> max_min_distrib1

3473 min_max.inf_sup_distrib1 ~> min_max_distrib2

3474 min_max.inf_sup_distrib2 ~> min_max_distrib1

3475 min_max.distrib ~> min_max_distribs

3476 min_max.inf_absorb1 ~> min.absorb1

3477 min_max.inf_absorb2 ~> min.absorb2

3478 min_max.sup_absorb1 ~> max.absorb1

3479 min_max.sup_absorb2 ~> max.absorb2

3480 min_max.le_iff_inf ~> min.absorb_iff1

3481 min_max.le_iff_sup ~> max.absorb_iff2

3482 min_max.inf_le1 ~> min.cobounded1

3483 min_max.inf_le2 ~> min.cobounded2

3484 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

3485 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

3486 min_max.le_infI1 ~> min.coboundedI1

3487 min_max.le_infI2 ~> min.coboundedI2

3488 min_max.le_supI1 ~> max.coboundedI1

3489 min_max.le_supI2 ~> max.coboundedI2

3490 min_max.less_infI1 ~> min.strict_coboundedI1

3491 min_max.less_infI2 ~> min.strict_coboundedI2

3492 min_max.less_supI1 ~> max.strict_coboundedI1

3493 min_max.less_supI2 ~> max.strict_coboundedI2

3494 min_max.inf_mono ~> min.mono

3495 min_max.sup_mono ~> max.mono

3496 min_max.le_infI, min_max.inf_greatest ~> min.boundedI

3497 min_max.le_supI, min_max.sup_least ~> max.boundedI

3498 min_max.le_inf_iff ~> min.bounded_iff

3499 min_max.le_sup_iff ~> max.bounded_iff

3501 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,

3502 min.left_commute, min.left_idem, max.commute, max.assoc,

3503 max.left_commute, max.left_idem directly.

3505 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,

3506 min.cobounded2, max.cobounded1m max.cobounded2 directly.

3508 For min_ac or max_ac, prefer more general collection ac_simps.

3510 INCOMPATIBILITY.

3512 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>

3513 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

3515 * Qualified constant names Wellfounded.acc, Wellfounded.accp.

3516 INCOMPATIBILITY.

3518 * Fact generalization and consolidation:

3519 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

3521 INCOMPATIBILITY.

3523 * Purely algebraic definition of even. Fact generalization and

3524 consolidation:

3525 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

3526 even_zero_(nat|int) ~> even_zero

3528 INCOMPATIBILITY.

3530 * Abolished neg_numeral.

3531 - Canonical representation for minus one is "- 1".

3532 - Canonical representation for other negative numbers is "- (numeral _)".

3533 - When devising rule sets for number calculation, consider the

3534 following canonical cases: 0, 1, numeral _, - 1, - numeral _.

3535 - HOLogic.dest_number also recognizes numerals in non-canonical forms

3536 like "numeral One", "- numeral One", "- 0" and even "- ... - _".

3537 - Syntax for negative numerals is mere input syntax.

3539 INCOMPATIBILITY.

3541 * Reduced name variants for rules on associativity and commutativity:

3543 add_assoc ~> add.assoc

3544 add_commute ~> add.commute

3545 add_left_commute ~> add.left_commute

3546 mult_assoc ~> mult.assoc

3547 mult_commute ~> mult.commute

3548 mult_left_commute ~> mult.left_commute

3549 nat_add_assoc ~> add.assoc

3550 nat_add_commute ~> add.commute

3551 nat_add_left_commute ~> add.left_commute

3552 nat_mult_assoc ~> mult.assoc

3553 nat_mult_commute ~> mult.commute

3554 eq_assoc ~> iff_assoc

3555 eq_left_commute ~> iff_left_commute

3557 INCOMPATIBILITY.

3559 * Fact collections add_ac and mult_ac are considered old-fashioned.

3560 Prefer ac_simps instead, or specify rules

3561 (add|mult).(assoc|commute|left_commute) individually.

3563 * Elimination of fact duplicates:

3564 equals_zero_I ~> minus_unique

3565 diff_eq_0_iff_eq ~> right_minus_eq

3566 nat_infinite ~> infinite_UNIV_nat

3567 int_infinite ~> infinite_UNIV_int

3569 INCOMPATIBILITY.

3571 * Fact name consolidation:

3572 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

3573 minus_le_self_iff ~> neg_less_eq_nonneg

3574 le_minus_self_iff ~> less_eq_neg_nonpos

3575 neg_less_nonneg ~> neg_less_pos

3576 less_minus_self_iff ~> less_neg_neg [simp]

3578 INCOMPATIBILITY.

3580 * More simplification rules on unary and binary minus:

3581 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

3582 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

3583 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

3584 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

3585 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

3586 been taken away from fact collections algebra_simps and field_simps.

3587 INCOMPATIBILITY.

3589 To restore proofs, the following patterns are helpful:

3591 a) Arbitrary failing proof not involving "diff_def":

3592 Consider simplification with algebra_simps or field_simps.

3594 b) Lifting rules from addition to subtraction:

3595 Try with "using <rule for addition> of [... "- _" ...]" by simp".

3597 c) Simplification with "diff_def": just drop "diff_def".

3598 Consider simplification with algebra_simps or field_simps;

3599 or the brute way with

3600 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

3602 * Introduce bdd_above and bdd_below in theory

3603 Conditionally_Complete_Lattices, use them instead of explicitly

3604 stating boundedness of sets.

3606 * ccpo.admissible quantifies only over non-empty chains to allow more

3607 syntax-directed proof rules; the case of the empty chain shows up as

3608 additional case in fixpoint induction proofs. INCOMPATIBILITY.

3610 * Removed and renamed theorems in Series:

3611 summable_le ~> suminf_le

3612 suminf_le ~> suminf_le_const

3613 series_pos_le ~> setsum_le_suminf

3614 series_pos_less ~> setsum_less_suminf

3615 suminf_ge_zero ~> suminf_nonneg

3616 suminf_gt_zero ~> suminf_pos

3617 suminf_gt_zero_iff ~> suminf_pos_iff

3618 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

3619 suminf_0_le ~> suminf_nonneg [rotate]

3620 pos_summable ~> summableI_nonneg_bounded

3621 ratio_test ~> summable_ratio_test

3623 removed series_zero, replaced by sums_finite

3625 removed auxiliary lemmas:

3627 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

3628 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

3629 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

3630 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

3631 summable_convergent_sumr_iff, sumr_diff_mult_const

3633 INCOMPATIBILITY.

3635 * Replace (F)DERIV syntax by has_derivative:

3636 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"

3638 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

3640 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

3642 - removed constant isDiff

3644 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

3645 input syntax.

3647 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

3649 - Renamed FDERIV_... lemmas to has_derivative_...

3651 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

3653 - removed DERIV_intros, has_derivative_eq_intros

3655 - introduced derivative_intros and deriative_eq_intros which

3656 includes now rules for DERIV, has_derivative and

3657 has_vector_derivative.

3659 - Other renamings:

3660 differentiable_def ~> real_differentiable_def

3661 differentiableE ~> real_differentiableE

3662 fderiv_def ~> has_derivative_at

3663 field_fderiv_def ~> field_has_derivative_at

3664 isDiff_der ~> differentiable_def

3665 deriv_fderiv ~> has_field_derivative_def

3666 deriv_def ~> DERIV_def

3668 INCOMPATIBILITY.

3670 * Include more theorems in continuous_intros. Remove the

3671 continuous_on_intros, isCont_intros collections, these facts are now

3672 in continuous_intros.

3674 * Theorems about complex numbers are now stated only using Re and Im,

3675 the Complex constructor is not used anymore. It is possible to use

3676 primcorec to defined the behaviour of a complex-valued function.

3678 Removed theorems about the Complex constructor from the simpset, they

3679 are available as the lemma collection legacy_Complex_simps. This

3680 especially removes

3682 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

3684 Instead the reverse direction is supported with

3685 Complex_eq: "Complex a b = a + \<i> * b"

3687 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

3689 Renamings:

3690 Re/Im ~> complex.sel

3691 complex_Re/Im_zero ~> zero_complex.sel

3692 complex_Re/Im_add ~> plus_complex.sel

3693 complex_Re/Im_minus ~> uminus_complex.sel

3694 complex_Re/Im_diff ~> minus_complex.sel

3695 complex_Re/Im_one ~> one_complex.sel

3696 complex_Re/Im_mult ~> times_complex.sel

3697 complex_Re/Im_inverse ~> inverse_complex.sel

3698 complex_Re/Im_scaleR ~> scaleR_complex.sel

3699 complex_Re/Im_i ~> ii.sel

3700 complex_Re/Im_cnj ~> cnj.sel

3701 Re/Im_cis ~> cis.sel

3703 complex_divide_def ~> divide_complex_def

3704 complex_norm_def ~> norm_complex_def

3705 cmod_def ~> norm_complex_de

3707 Removed theorems:

3708 complex_zero_def

3709 complex_add_def

3710 complex_minus_def

3711 complex_diff_def

3712 complex_one_def

3713 complex_mult_def

3714 complex_inverse_def

3715 complex_scaleR_def

3717 INCOMPATIBILITY.

3719 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

3720 Conditionally_Complete_Lattices. INCOMPATIBILITY.

3722 * HOL-Library: new theory src/HOL/Library/Tree.thy.

3724 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

3725 is subsumed by session Kleene_Algebra in AFP.

3727 * HOL-Library / theory RBT: various constants and facts are hidden;

3728 lifting setup is unregistered. INCOMPATIBILITY.

3730 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

3732 * HOL-Word: bit representations prefer type bool over type bit.

3733 INCOMPATIBILITY.

3735 * HOL-Word:

3736 - Abandoned fact collection "word_arith_alts", which is a duplicate

3737 of "word_arith_wis".

3738 - Dropped first (duplicated) element in fact collections

3739 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

3740 "uint_word_arith_bintrs".

3742 * HOL-Number_Theory:

3743 - consolidated the proofs of the binomial theorem

3744 - the function fib is again of type nat => nat and not overloaded

3745 - no more references to Old_Number_Theory in the HOL libraries

3746 (except the AFP)

3748 INCOMPATIBILITY.

3750 * HOL-Multivariate_Analysis:

3751 - Type class ordered_real_vector for ordered vector spaces.

3752 - New theory Complex_Basic_Analysis defining complex derivatives,

3753 holomorphic functions, etc., ported from HOL Light's canal.ml.

3754 - Changed order of ordered_euclidean_space to be compatible with

3755 pointwise ordering on products. Therefore instance of

3756 conditionally_complete_lattice and ordered_real_vector.

3757 INCOMPATIBILITY: use box instead of greaterThanLessThan or

3758 explicit set-comprehensions with eucl_less for other (half-)open

3759 intervals.

3760 - removed dependencies on type class ordered_euclidean_space with

3761 introduction of "cbox" on euclidean_space

3762 - renamed theorems:

3763 interval ~> box

3764 mem_interval ~> mem_box

3765 interval_eq_empty ~> box_eq_empty

3766 interval_ne_empty ~> box_ne_empty

3767 interval_sing(1) ~> cbox_sing

3768 interval_sing(2) ~> box_sing

3769 subset_interval_imp ~> subset_box_imp

3770 subset_interval ~> subset_box

3771 open_interval ~> open_box

3772 closed_interval ~> closed_cbox

3773 interior_closed_interval ~> interior_cbox

3774 bounded_closed_interval ~> bounded_cbox

3775 compact_interval ~> compact_cbox

3776 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

3777 bounded_subset_closed_interval ~> bounded_subset_cbox

3778 mem_interval_componentwiseI ~> mem_box_componentwiseI

3779 convex_box ~> convex_prod

3780 rel_interior_real_interval ~> rel_interior_real_box

3781 convex_interval ~> convex_box

3782 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

3783 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

3784 content_closed_interval' ~> content_cbox'

3785 elementary_subset_interval ~> elementary_subset_box

3786 diameter_closed_interval ~> diameter_cbox

3787 frontier_closed_interval ~> frontier_cbox

3788 frontier_open_interval ~> frontier_box

3789 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

3790 closure_open_interval ~> closure_box

3791 open_closed_interval_convex ~> open_cbox_convex

3792 open_interval_midpoint ~> box_midpoint

3793 content_image_affinity_interval ~> content_image_affinity_cbox

3794 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

3795 bounded_interval ~> bounded_closed_interval + bounded_boxes

3797 - respective theorems for intervals over the reals:

3798 content_closed_interval + content_cbox

3799 has_integral + has_integral_real

3800 fine_division_exists + fine_division_exists_real

3801 has_integral_null + has_integral_null_real

3802 tagged_division_union_interval + tagged_division_union_interval_real

3803 has_integral_const + has_integral_const_real

3804 integral_const + integral_const_real

3805 has_integral_bound + has_integral_bound_real

3806 integrable_continuous + integrable_continuous_real

3807 integrable_subinterval + integrable_subinterval_real

3808 has_integral_reflect_lemma + has_integral_reflect_lemma_real

3809 integrable_reflect + integrable_reflect_real

3810 integral_reflect + integral_reflect_real

3811 image_affinity_interval + image_affinity_cbox

3812 image_smult_interval + image_smult_cbox

3813 integrable_const + integrable_const_ivl

3814 integrable_on_subinterval + integrable_on_subcbox

3816 - renamed theorems:

3817 derivative_linear ~> has_derivative_bounded_linear

3818 derivative_is_linear ~> has_derivative_linear

3819 bounded_linear_imp_linear ~> bounded_linear.linear

3821 * HOL-Probability:

3822 - Renamed positive_integral to nn_integral:

3824 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

3825 positive_integral_positive ~> nn_integral_nonneg

3827 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

3829 - replaced the Lebesgue integral on real numbers by the more general

3830 Bochner integral for functions into a real-normed vector space.

3832 integral_zero ~> integral_zero / integrable_zero

3833 integral_minus ~> integral_minus / integrable_minus

3834 integral_add ~> integral_add / integrable_add

3835 integral_diff ~> integral_diff / integrable_diff

3836 integral_setsum ~> integral_setsum / integrable_setsum

3837 integral_multc ~> integral_mult_left / integrable_mult_left

3838 integral_cmult ~> integral_mult_right / integrable_mult_right

3839 integral_triangle_inequality~> integral_norm_bound

3840 integrable_nonneg ~> integrableI_nonneg

3841 integral_positive ~> integral_nonneg_AE

3842 integrable_abs_iff ~> integrable_abs_cancel

3843 positive_integral_lim_INF ~> nn_integral_liminf

3844 lebesgue_real_affine ~> lborel_real_affine

3845 borel_integral_has_integral ~> has_integral_lebesgue_integral

3846 integral_indicator ~>

3847 integral_real_indicator / integrable_real_indicator

3848 positive_integral_fst ~> nn_integral_fst'

3849 positive_integral_fst_measurable ~> nn_integral_fst

3850 positive_integral_snd_measurable ~> nn_integral_snd

3852 integrable_fst_measurable ~>

3853 integral_fst / integrable_fst / AE_integrable_fst

3855 integrable_snd_measurable ~>

3856 integral_snd / integrable_snd / AE_integrable_snd

3858 integral_monotone_convergence ~>

3859 integral_monotone_convergence / integrable_monotone_convergence

3861 integral_monotone_convergence_at_top ~>

3862 integral_monotone_convergence_at_top /

3863 integrable_monotone_convergence_at_top

3865 has_integral_iff_positive_integral_lebesgue ~>

3866 has_integral_iff_has_bochner_integral_lebesgue_nonneg

3868 lebesgue_integral_has_integral ~>

3869 has_integral_integrable_lebesgue_nonneg

3871 positive_integral_lebesgue_has_integral ~>

3872 integral_has_integral_lebesgue_nonneg /

3873 integrable_has_integral_lebesgue_nonneg

3875 lebesgue_integral_real_affine ~>

3876 nn_integral_real_affine

3878 has_integral_iff_positive_integral_lborel ~>

3879 integral_has_integral_nonneg / integrable_has_integral_nonneg

3881 The following theorems where removed:

3883 lebesgue_integral_nonneg

3884 lebesgue_integral_uminus

3885 lebesgue_integral_cmult

3886 lebesgue_integral_multc

3887 lebesgue_integral_cmult_nonneg

3888 integral_cmul_indicator

3889 integral_real

3891 - Formalized properties about exponentially, Erlang, and normal

3892 distributed random variables.

3894 * HOL-Decision_Procs: Separate command 'approximate' for approximative

3895 computation in src/HOL/Decision_Procs/Approximation. Minor

3896 INCOMPATIBILITY.

3899 *** Scala ***

3901 * The signature and semantics of Document.Snapshot.cumulate_markup /

3902 select_markup have been clarified. Markup is now traversed in the

3903 order of reports given by the prover: later markup is usually more

3904 specific and may override results accumulated so far. The elements

3905 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

3907 * Substantial reworking of internal PIDE protocol communication

3908 channels. INCOMPATIBILITY.

3911 *** ML ***

3913 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

3914 compared (according to Thm.thm_ord), but assumed to be covered by the

3915 current background theory. Thus equivalent data produced in different

3916 branches of the theory graph usually coincides (e.g. relevant for

3917 theory merge). Note that the softer Thm.eq_thm_prop is often more

3918 appropriate than Thm.eq_thm.

3920 * Proper context for basic Simplifier operations: rewrite_rule,

3921 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

3922 pass runtime Proof.context (and ensure that the simplified entity

3923 actually belongs to it).

3925 * Proper context discipline for read_instantiate and instantiate_tac:

3926 variables that are meant to become schematic need to be given as

3927 fixed, and are generalized by the explicit context of local variables.

3928 This corresponds to Isar attributes "where" and "of" with 'for'

3929 declaration. INCOMPATIBILITY, also due to potential change of indices

3930 of schematic variables.

3932 * Moved ML_Compiler.exn_trace and other operations on exceptions to

3933 structure Runtime. Minor INCOMPATIBILITY.

3935 * Discontinued old Toplevel.debug in favour of system option

3936 "ML_exception_trace", which may be also declared within the context

3937 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

3939 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

3940 INCOMPATIBILITY.

3942 * Configuration option "ML_print_depth" controls the pretty-printing

3943 depth of the ML compiler within the context. The old print_depth in

3944 ML is still available as default_print_depth, but rarely used. Minor

3945 INCOMPATIBILITY.

3947 * Toplevel function "use" refers to raw ML bootstrap environment,

3948 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

3949 Note that 'ML_file' is the canonical command to load ML files into the

3950 formal context.

3952 * Simplified programming interface to define ML antiquotations, see

3953 structure ML_Antiquotation. Minor INCOMPATIBILITY.

3955 * ML antiquotation @{here} refers to its source position, which is

3956 occasionally useful for experimentation and diagnostic purposes.

3958 * ML antiquotation @{path} produces a Path.T value, similarly to

3959 Path.explode, but with compile-time check against the file-system and

3960 some PIDE markup. Note that unlike theory source, ML does not have a

3961 well-defined master directory, so an absolute symbolic path

3962 specification is usually required, e.g. "~~/src/HOL".

3964 * ML antiquotation @{print} inlines a function to print an arbitrary

3965 ML value, which is occasionally useful for diagnostic or demonstration

3966 purposes.

3969 *** System ***

3971 * Proof General with its traditional helper scripts is now an optional

3972 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

3973 component repository http://isabelle.in.tum.de/components/. Note that

3974 the "system" manual provides general explanations about add-on

3975 components, especially those that are not bundled with the release.

3977 * The raw Isabelle process executable has been renamed from

3978 "isabelle-process" to "isabelle_process", which conforms to common

3979 shell naming conventions, and allows to define a shell function within

3980 the Isabelle environment to avoid dynamic path lookup. Rare

3981 incompatibility for old tools that do not use the ISABELLE_PROCESS

3982 settings variable.

3984 * Former "isabelle tty" has been superseded by "isabelle console",

3985 with implicit build like "isabelle jedit", and without the mostly

3986 obsolete Isar TTY loop.

3988 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

3989 and PDF_VIEWER now refer to the actual programs, not shell

3990 command-lines. Discontinued option -c: invocation may be asynchronous

3991 via desktop environment, without any special precautions. Potential

3992 INCOMPATIBILITY with ambitious private settings.

3994 * Removed obsolete "isabelle unsymbolize". Note that the usual format

3995 for email communication is the Unicode rendering of Isabelle symbols,

3996 as produced by Isabelle/jEdit, for example.

3998 * Removed obsolete tool "wwwfind". Similar functionality may be

3999 integrated into Isabelle/jEdit eventually.

4001 * Improved 'display_drafts' concerning desktop integration and

4002 repeated invocation in PIDE front-end: re-use single file

4003 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

4005 * Session ROOT specifications require explicit 'document_files' for

4006 robust dependencies on LaTeX sources. Only these explicitly given

4007 files are copied to the document output directory, before document

4008 processing is started.

4010 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

4011 of TeX Live from Cygwin.

4015 New in Isabelle2013-2 (December 2013)

4016 -------------------------------------

4018 *** Prover IDE -- Isabelle/Scala/jEdit ***

4020 * More robust editing of running commands with internal forks,

4021 e.g. non-terminating 'by' steps.

4023 * More relaxed Sledgehammer panel: avoid repeated application of query

4024 after edits surrounding the command location.

4026 * More status information about commands that are interrupted

4027 accidentally (via physical event or Poly/ML runtime system signal,

4028 e.g. out-of-memory).

4031 *** System ***

4033 * More robust termination of external processes managed by

4034 Isabelle/ML: support cancellation of tasks within the range of

4035 milliseconds, as required for PIDE document editing with automatically

4036 tried tools (e.g. Sledgehammer).

4038 * Reactivated Isabelle/Scala kill command for external processes on

4039 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

4040 workaround for some Debian/Ubuntu Linux versions from 2013.

4044 New in Isabelle2013-1 (November 2013)

4045 -------------------------------------

4047 *** General ***

4049 * Discontinued obsolete 'uses' within theory header. Note that

4050 commands like 'ML_file' work without separate declaration of file

4051 dependencies. Minor INCOMPATIBILITY.

4053 * Discontinued redundant 'use' command, which was superseded by

4054 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

4056 * Simplified subscripts within identifiers, using plain \<^sub>

4057 instead of the second copy \<^isub> and \<^isup>. Superscripts are

4058 only for literal tokens within notation; explicit mixfix annotations

4059 for consts or fixed variables may be used as fall-back for unusual

4060 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

4061 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

4062 standardize symbols as a starting point for further manual cleanup.

4063 The ML reference variable "legacy_isub_isup" may be set as temporary

4064 workaround, to make the prover accept a subset of the old identifier

4065 syntax.

4067 * Document antiquotations: term style "isub" has been renamed to

4068 "sub". Minor INCOMPATIBILITY.

4070 * Uniform management of "quick_and_dirty" as system option (see also

4071 "isabelle options"), configuration option within the context (see also

4072 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

4073 INCOMPATIBILITY, need to use more official Isabelle means to access

4074 quick_and_dirty, instead of historical poking into mutable reference.

4076 * Renamed command 'print_configs' to 'print_options'. Minor

4077 INCOMPATIBILITY.

4079 * Proper diagnostic command 'print_state'. Old 'pr' (with its

4080 implicit change of some global references) is retained for now as

4081 control command, e.g. for ProofGeneral 3.7.x.

4083 * Discontinued 'print_drafts' command with its old-fashioned PS output

4084 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

4085 'display_drafts' instead and print via the regular document viewer.

4087 * Updated and extended "isar-ref" and "implementation" manual,

4088 eliminated old "ref" manual.

4091 *** Prover IDE -- Isabelle/Scala/jEdit ***

4093 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

4094 Documentation panel.

4096 * Dockable window "Documentation" provides access to Isabelle

4097 documentation.

4099 * Dockable window "Find" provides query operations for formal entities

4100 (GUI front-end to 'find_theorems' command).

4102 * Dockable window "Sledgehammer" manages asynchronous / parallel

4103 sledgehammer runs over existing document sources, independently of

4104 normal editing and checking process.

4106 * Dockable window "Timing" provides an overview of relevant command

4107 timing information, depending on option jedit_timing_threshold. The

4108 same timing information is shown in the extended tooltip of the

4109 command keyword, when hovering the mouse over it while the CONTROL or

4110 COMMAND modifier is pressed.

4112 * Improved dockable window "Theories": Continuous checking of proof

4113 document (visible and required parts) may be controlled explicitly,

4114 using check box or shortcut "C+e ENTER". Individual theory nodes may

4115 be marked explicitly as required and checked in full, using check box

4116 or shortcut "C+e SPACE".

4118 * Improved completion mechanism, which is now managed by the

4119 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

4120 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

4122 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

4123 isabelle.complete for explicit completion in Isabelle sources.

4124 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

4125 to resolve conflict.

4127 * Improved support of various "minor modes" for Isabelle NEWS,

4128 options, session ROOT etc., with completion and SideKick tree view.

4130 * Strictly monotonic document update, without premature cancellation of

4131 running transactions that are still needed: avoid reset/restart of

4132 such command executions while editing.

4134 * Support for asynchronous print functions, as overlay to existing

4135 document content.

4137 * Support for automatic tools in HOL, which try to prove or disprove

4138 toplevel theorem statements.

4140 * Action isabelle.reset-font-size resets main text area font size

4141 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

4142 also "Plugin Options / Isabelle / General"). It can be bound to some

4143 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

4145 * File specifications in jEdit (e.g. file browser) may refer to

4146 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

4147 obsolete $ISABELLE_HOME_WINDOWS variable.

4149 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

4150 / Global Options / Appearance".

4152 * Improved support of native Mac OS X functionality via "MacOSX"

4153 plugin, which is now enabled by default.

4156 *** Pure ***

4158 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

4159 In particular, 'interpretation' allows for non-persistent

4160 interpretation within "context ... begin ... end" blocks offering a

4161 light-weight alternative to 'sublocale'. See "isar-ref" manual for

4162 details.

4164 * Improved locales diagnostic command 'print_dependencies'.

4166 * Discontinued obsolete 'axioms' command, which has been marked as

4167 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

4168 instead, while observing its uniform scope for polymorphism.

4170 * Discontinued empty name bindings in 'axiomatization'.

4171 INCOMPATIBILITY.

4173 * System option "proofs" has been discontinued. Instead the global

4174 state of Proofterm.proofs is persistently compiled into logic images

4175 as required, notably HOL-Proofs. Users no longer need to change

4176 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

4178 * Syntax translation functions (print_translation etc.) always depend

4179 on Proof.context. Discontinued former "(advanced)" option -- this is

4180 now the default. Minor INCOMPATIBILITY.

4182 * Former global reference trace_unify_fail is now available as

4183 configuration option "unify_trace_failure" (global context only).

4185 * SELECT_GOAL now retains the syntactic context of the overall goal

4186 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

4187 situations.

4190 *** HOL ***

4192 * Stronger precedence of syntax for big intersection and union on

4193 sets, in accordance with corresponding lattice operations.

4194 INCOMPATIBILITY.

4196 * Notation "{p:A. P}" now allows tuple patterns as well.

4198 * Nested case expressions are now translated in a separate check phase

4199 rather than during parsing. The data for case combinators is separated

4200 from the datatype package. The declaration attribute

4201 "case_translation" can be used to register new case combinators:

4203 declare [[case_translation case_combinator constructor1 ... constructorN]]

4205 * Code generator:

4206 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

4207 'code_instance'.

4208 - 'code_identifier' declares name hints for arbitrary identifiers in

4209 generated code, subsuming 'code_modulename'.

4211 See the isar-ref manual for syntax diagrams, and the HOL theories for

4212 examples.

4214 * Attibute 'code': 'code' now declares concrete and abstract code

4215 equations uniformly. Use explicit 'code equation' and 'code abstract'

4216 to distinguish both when desired.

4218 * Discontinued theories Code_Integer and Efficient_Nat by a more

4219 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

4220 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

4221 generation for details. INCOMPATIBILITY.

4223 * Numeric types are mapped by default to target language numerals:

4224 natural (replaces former code_numeral) and integer (replaces former

4225 code_int). Conversions are available as integer_of_natural /

4226 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

4227 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

4228 ML). INCOMPATIBILITY.

4230 * Function package: For mutually recursive functions f and g, separate

4231 cases rules f.cases and g.cases are generated instead of unusable

4232 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

4233 in the case that the unusable rule was used nevertheless.

4235 * Function package: For each function f, new rules f.elims are

4236 generated, which eliminate equalities of the form "f x = t".

4238 * New command 'fun_cases' derives ad-hoc elimination rules for

4239 function equations as simplified instances of f.elims, analogous to

4240 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

4242 * Lifting:

4243 - parametrized correspondence relations are now supported:

4244 + parametricity theorems for the raw term can be specified in

4245 the command lift_definition, which allow us to generate stronger

4246 transfer rules

4247 + setup_lifting generates stronger transfer rules if parametric

4248 correspondence relation can be generated

4249 + various new properties of the relator must be specified to support

4250 parametricity

4251 + parametricity theorem for the Quotient relation can be specified

4252 - setup_lifting generates domain rules for the Transfer package

4253 - stronger reflexivity prover of respectfulness theorems for type

4254 copies

4255 - ===> and --> are now local. The symbols can be introduced

4256 by interpreting the locale lifting_syntax (typically in an

4257 anonymous context)

4258 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

4259 Main. Potential INCOMPATIBILITY

4260 - new commands for restoring and deleting Lifting/Transfer context:

4261 lifting_forget, lifting_update

4262 - the command print_quotmaps was renamed to print_quot_maps.

4263 INCOMPATIBILITY

4265 * Transfer:

4266 - better support for domains in Transfer: replace Domainp T

4267 by the actual invariant in a transferred goal

4268 - transfer rules can have as assumptions other transfer rules

4269 - Experimental support for transferring from the raw level to the

4270 abstract level: Transfer.transferred attribute

4271 - Attribute version of the transfer method: untransferred attribute

4273 * Reification and reflection:

4274 - Reification is now directly available in HOL-Main in structure

4275 "Reification".

4276 - Reflection now handles multiple lists with variables also.

4277 - The whole reflection stack has been decomposed into conversions.

4278 INCOMPATIBILITY.

4280 * Revised devices for recursive definitions over finite sets:

4281 - Only one fundamental fold combinator on finite set remains:

4282 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

4283 This is now identity on infinite sets.

4284 - Locales ("mini packages") for fundamental definitions with

4285 Finite_Set.fold: folding, folding_idem.

4286 - Locales comm_monoid_set, semilattice_order_set and

4287 semilattice_neutr_order_set for big operators on sets.

4288 See theory Big_Operators for canonical examples.

4289 Note that foundational constants comm_monoid_set.F and

4290 semilattice_set.F correspond to former combinators fold_image

4291 and fold1 respectively. These are now gone. You may use

4292 those foundational constants as substitutes, but it is

4293 preferable to interpret the above locales accordingly.

4294 - Dropped class ab_semigroup_idem_mult (special case of lattice,

4295 no longer needed in connection with Finite_Set.fold etc.)

4296 - Fact renames:

4297 card.union_inter ~> card_Un_Int [symmetric]

4298 card.union_disjoint ~> card_Un_disjoint

4299 INCOMPATIBILITY.

4301 * Locale hierarchy for abstract orderings and (semi)lattices.

4303 * Complete_Partial_Order.admissible is defined outside the type class

4304 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

4305 class predicate assumption or sort constraint when possible.

4306 INCOMPATIBILITY.

4308 * Introduce type class "conditionally_complete_lattice": Like a

4309 complete lattice but does not assume the existence of the top and

4310 bottom elements. Allows to generalize some lemmas about reals and

4311 extended reals. Removed SupInf and replaced it by the instantiation

4312 of conditionally_complete_lattice for real. Renamed lemmas about

4313 conditionally-complete lattice from Sup_... to cSup_... and from

4314 Inf_... to cInf_... to avoid hidding of similar complete lattice

4315 lemmas.

4317 * Introduce type class linear_continuum as combination of

4318 conditionally-complete lattices and inner dense linorders which have

4319 more than one element. INCOMPATIBILITY.

4321 * Introduced type classes order_top and order_bot. The old classes top

4322 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

4323 Rename bot -> order_bot, top -> order_top

4325 * Introduce type classes "no_top" and "no_bot" for orderings without

4326 top and bottom elements.

4328 * Split dense_linorder into inner_dense_order and no_top, no_bot.

4330 * Complex_Main: Unify and move various concepts from

4331 HOL-Multivariate_Analysis to HOL-Complex_Main.

4333 - Introduce type class (lin)order_topology and

4334 linear_continuum_topology. Allows to generalize theorems about

4335 limits and order. Instances are reals and extended reals.

4337 - continuous and continuos_on from Multivariate_Analysis:

4338 "continuous" is the continuity of a function at a filter. "isCont"

4339 is now an abbrevitation: "isCont x f == continuous (at _) f".

4341 Generalized continuity lemmas from isCont to continuous on an

4342 arbitrary filter.

4344 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

4345 compactness of closed intervals on reals. Continuous functions

4346 attain infimum and supremum on compact sets. The inverse of a

4347 continuous function is continuous, when the function is continuous

4348 on a compact set.

4350 - connected from Multivariate_Analysis. Use it to prove the

4351 intermediate value theorem. Show connectedness of intervals on

4352 linear_continuum_topology).

4354 - first_countable_topology from Multivariate_Analysis. Is used to

4355 show equivalence of properties on the neighbourhood filter of x and

4356 on all sequences converging to x.

4358 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

4359 theorems from Library/FDERIV.thy to Deriv.thy and base the

4360 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

4361 which are restricted to sets, i.e. to represent derivatives from

4362 left or right.

4364 - Removed the within-filter. It is replaced by the principal filter:

4366 F within X = inf F (principal X)

4368 - Introduce "at x within U" as a single constant, "at x" is now an

4369 abbreviation for "at x within UNIV"

4371 - Introduce named theorem collections tendsto_intros,

4372 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

4373 in tendsto_intros (or FDERIV_intros) are also available as

4374 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

4375 is replaced by a congruence rule. This allows to apply them as

4376 intro rules and then proving equivalence by the simplifier.

4378 - Restructured theories in HOL-Complex_Main:

4380 + Moved RealDef and RComplete into Real

4382 + Introduced Topological_Spaces and moved theorems about

4383 topological spaces, filters, limits and continuity to it

4385 + Renamed RealVector to Real_Vector_Spaces

4387 + Split Lim, SEQ, Series into Topological_Spaces,

4388 Real_Vector_Spaces, and Limits

4390 + Moved Ln and Log to Transcendental

4392 + Moved theorems about continuity from Deriv to Topological_Spaces

4394 - Remove various auxiliary lemmas.

4396 INCOMPATIBILITY.

4398 * Nitpick:

4399 - Added option "spy".

4400 - Reduce incidence of "too high arity" errors.

4402 * Sledgehammer:

4403 - Renamed option:

4404 isar_shrink ~> isar_compress

4405 INCOMPATIBILITY.

4406 - Added options "isar_try0", "spy".

4407 - Better support for "isar_proofs".

4408 - MaSh has been fined-tuned and now runs as a local server.

4410 * Improved support for ad hoc overloading of constants (see also

4411 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

4413 * Library/Polynomial.thy:

4414 - Use lifting for primitive definitions.

4415 - Explicit conversions from and to lists of coefficients, used for

4416 generated code.

4417 - Replaced recursion operator poly_rec by fold_coeffs.

4418 - Prefer pre-existing gcd operation for gcd.

4419 - Fact renames:

4420 poly_eq_iff ~> poly_eq_poly_eq_iff

4421 poly_ext ~> poly_eqI

4422 expand_poly_eq ~> poly_eq_iff

4423 IMCOMPATIBILITY.

4425 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

4426 case_of_simps to convert function definitions between a list of

4427 equations with patterns on the lhs and a single equation with case

4428 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

4430 * New Library/FSet.thy: type of finite sets defined as a subtype of

4431 sets defined by Lifting/Transfer.

4433 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

4435 * Consolidation of library theories on product orders:

4437 Product_Lattice ~> Product_Order -- pointwise order on products

4438 Product_ord ~> Product_Lexorder -- lexicographic order on products

4440 INCOMPATIBILITY.

4442 * Imperative-HOL: The MREC combinator is considered legacy and no

4443 longer included by default. INCOMPATIBILITY, use partial_function

4444 instead, or import theory Legacy_Mrec as a fallback.

4446 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

4447 ~~/src/HOL/Algebra/poly. Existing theories should be based on

4448 ~~/src/HOL/Library/Polynomial instead. The latter provides

4449 integration with HOL's type classes for rings. INCOMPATIBILITY.

4451 * HOL-BNF:

4452 - Various improvements to BNF-based (co)datatype package, including

4453 new commands "primrec_new", "primcorec", and

4454 "datatype_new_compat", as well as documentation. See

4455 "datatypes.pdf" for details.

4456 - New "coinduction" method to avoid some boilerplate (compared to

4457 coinduct).

4458 - Renamed keywords:

4459 data ~> datatype_new

4460 codata ~> codatatype

4461 bnf_def ~> bnf

4462 - Renamed many generated theorems, including

4463 discs ~> disc

4464 map_comp' ~> map_comp

4465 map_id' ~> map_id

4466 sels ~> sel

4467 set_map' ~> set_map

4468 sets ~> set

4469 IMCOMPATIBILITY.

4472 *** ML ***

4474 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

4475 "check_property" allows to check specifications of the form "ALL x y

4476 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

4477 Examples.thy in particular.

4479 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

4480 tracing output in the command transaction context instead of physical

4481 stdout. See also Toplevel.debug, Toplevel.debugging and

4482 ML_Compiler.exn_trace.

4484 * ML type "theory" is now immutable, without any special treatment of

4485 drafts or linear updates (which could lead to "stale theory" errors in

4486 the past). Discontinued obsolete operations like Theory.copy,

4487 Theory.checkpoint, and the auxiliary type theory_ref. Minor

4488 INCOMPATIBILITY.

4490 * More uniform naming of goal functions for skipped proofs:

4492 Skip_Proof.prove ~> Goal.prove_sorry

4493 Skip_Proof.prove_global ~> Goal.prove_sorry_global

4495 Minor INCOMPATIBILITY.

4497 * Simplifier tactics and tools use proper Proof.context instead of

4498 historic type simpset. Old-style declarations like addsimps,

4499 addsimprocs etc. operate directly on Proof.context. Raw type simpset

4500 retains its use as snapshot of the main Simplifier context, using

4501 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

4502 old tools by making them depend on (ctxt : Proof.context) instead of

4503 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

4505 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

4506 operate on Proof.context instead of claset, for uniformity with addIs,

4507 addEs, addDs etc. Note that claset_of and put_claset allow to manage

4508 clasets separately from the context.

4510 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

4511 INCOMPATIBILITY, use @{context} instead.

4513 * Antiquotation @{theory_context A} is similar to @{theory A}, but

4514 presents the result as initial Proof.context.

4517 *** System ***

4519 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

4520 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

4522 * Discontinued obsolete isabelle-process options -f and -u (former

4523 administrative aliases of option -e). Minor INCOMPATIBILITY.

4525 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

4526 settings variable.

4528 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

4529 document formats: dvi.gz, ps, ps.gz -- the default document format is

4530 always pdf.

4532 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

4533 specify global resources of the JVM process run by isabelle build.

4535 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

4536 to run Isabelle/Scala source files as standalone programs.

4538 * Improved "isabelle keywords" tool (for old-style ProofGeneral

4539 keyword tables): use Isabelle/Scala operations, which inspect outer

4540 syntax without requiring to build sessions first.

4542 * Sessions may be organized via 'chapter' specifications in the ROOT

4543 file, which determines a two-level hierarchy of browser info. The old

4544 tree-like organization via implicit sub-session relation (with its

4545 tendency towards erratic fluctuation of URLs) has been discontinued.

4546 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

4547 for HTML presentation of theories.

4551 New in Isabelle2013 (February 2013)

4552 -----------------------------------

4554 *** General ***

4556 * Theorem status about oracles and unfinished/failed future proofs is

4557 no longer printed by default, since it is incompatible with

4558 incremental / parallel checking of the persistent document model. ML

4559 function Thm.peek_status may be used to inspect a snapshot of the

4560 ongoing evaluation process. Note that in batch mode --- notably

4561 isabelle build --- the system ensures that future proofs of all

4562 accessible theorems in the theory context are finished (as before).

4564 * Configuration option show_markup controls direct inlining of markup

4565 into the printed representation of formal entities --- notably type

4566 and sort constraints. This enables Prover IDE users to retrieve that

4567 information via tooltips in the output window, for example.

4569 * Command 'ML_file' evaluates ML text from a file directly within the

4570 theory, without any predeclaration via 'uses' in the theory header.

4572 * Old command 'use' command and corresponding keyword 'uses' in the

4573 theory header are legacy features and will be discontinued soon.

4574 Tools that load their additional source files may imitate the

4575 'ML_file' implementation, such that the system can take care of

4576 dependencies properly.

4578 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

4579 is called fastforce / fast_force_tac already since Isabelle2011-1.

4581 * Updated and extended "isar-ref" and "implementation" manual, reduced

4582 remaining material in old "ref" manual.

4584 * Improved support for auxiliary contexts that indicate block structure

4585 for specifications. Nesting of "context fixes ... context assumes ..."

4586 and "class ... context ...".

4588 * Attribute "consumes" allows a negative value as well, which is

4589 interpreted relatively to the total number of premises of the rule in

4590 the target context. This form of declaration is stable when exported

4591 from a nested 'context' with additional assumptions. It is the

4592 preferred form for definitional packages, notably cases/rules produced

4593 in HOL/inductive and HOL/function.

4595 * More informative error messages for Isar proof commands involving

4596 lazy enumerations (method applications etc.).

4598 * Refined 'help' command to retrieve outer syntax commands according

4599 to name patterns (with clickable results).

4602 *** Prover IDE -- Isabelle/Scala/jEdit ***

4604 * Parallel terminal proofs ('by') are enabled by default, likewise

4605 proofs that are built into packages like 'datatype', 'function'. This

4606 allows to "run ahead" checking the theory specifications on the

4607 surface, while the prover is still crunching on internal

4608 justifications. Unfinished / cancelled proofs are restarted as

4609 required to complete full proof checking eventually.

4611 * Improved output panel with tooltips, hyperlinks etc. based on the

4612 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

4613 tooltips leads to some window that supports the same recursively,

4614 which can lead to stacks of tooltips as the semantic document content

4615 is explored. ESCAPE closes the whole stack, individual windows may be

4616 closed separately, or detached to become independent jEdit dockables.

4618 * Improved support for commands that produce graph output: the text

4619 message contains a clickable area to open a new instance of the graph

4620 browser on demand.

4622 * More robust incremental parsing of outer syntax (partial comments,

4623 malformed symbols). Changing the balance of open/close quotes and

4624 comment delimiters works more conveniently with unfinished situations

4625 that frequently occur in user interaction.

4627 * More efficient painting and improved reactivity when editing large

4628 files. More scalable management of formal document content.

4630 * Smarter handling of tracing messages: prover process pauses after

4631 certain number of messages per command transaction, with some user

4632 dialog to stop or continue. This avoids swamping the front-end with

4633 potentially infinite message streams.

4635 * More plugin options and preferences, based on Isabelle/Scala. The

4636 jEdit plugin option panel provides access to some Isabelle/Scala

4637 options, including tuning parameters for editor reactivity and color

4638 schemes.

4640 * Dockable window "Symbols" provides some editing support for Isabelle

4641 symbols.

4643 * Dockable window "Monitor" shows ML runtime statistics. Note that

4644 continuous display of the chart slows down the system.

4646 * Improved editing support for control styles: subscript, superscript,

4647 bold, reset of style -- operating on single symbols or text

4648 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

4650 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

4651 adjust the main text area font size, and its derivatives for output,

4652 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

4653 need to be adapted to local keyboard layouts.

4655 * More reactive completion popup by default: use \t (TAB) instead of

4656 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

4657 also "Plugin Options / SideKick / General / Code Completion Options".

4659 * Implicit check and build dialog of the specified logic session

4660 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

4661 demand, without bundling big platform-dependent heap images in the

4662 Isabelle distribution.

4664 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

4665 from Oracle provide better multi-platform experience. This version is

4666 now bundled exclusively with Isabelle.

4669 *** Pure ***

4671 * Code generation for Haskell: restrict unqualified imports from

4672 Haskell Prelude to a small set of fundamental operations.

4674 * Command 'export_code': relative file names are interpreted

4675 relatively to master directory of current theory rather than the

4676 rather arbitrary current working directory. INCOMPATIBILITY.

4678 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

4679 use regular rule composition via "OF" / "THEN", or explicit proof

4680 structure instead. Note that Isabelle/ML provides a variety of

4681 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

4682 with some care where this is really required.

4684 * Command 'typ' supports an additional variant with explicit sort

4685 constraint, to infer and check the most general type conforming to a

4686 given sort. Example (in HOL):

4688 typ "_ * _ * bool * unit" :: finite

4690 * Command 'locale_deps' visualizes all locales and their relations as

4691 a Hasse diagram.

4694 *** HOL ***

4696 * Sledgehammer:

4698 - Added MaSh relevance filter based on machine-learning; see the

4699 Sledgehammer manual for details.

4700 - Polished Isar proofs generated with "isar_proofs" option.

4701 - Rationalized type encodings ("type_enc" option).

4702 - Renamed "kill_provers" subcommand to "kill_all".

4703 - Renamed options:

4704 isar_proof ~> isar_proofs

4705 isar_shrink_factor ~> isar_shrink

4706 max_relevant ~> max_facts

4707 relevance_thresholds ~> fact_thresholds

4709 * Quickcheck: added an optimisation for equality premises. It is

4710 switched on by default, and can be switched off by setting the

4711 configuration quickcheck_optimise_equality to false.

4713 * Quotient: only one quotient can be defined by quotient_type

4714 INCOMPATIBILITY.

4716 * Lifting:

4717 - generation of an abstraction function equation in lift_definition

4718 - quot_del attribute

4719 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

4721 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

4722 expressions.

4724 * Preprocessing of the code generator rewrites set comprehensions into

4725 pointfree expressions.

4727 * The SMT solver Z3 has now by default a restricted set of directly

4728 supported features. For the full set of features (div/mod, nonlinear

4729 arithmetic, datatypes/records) with potential proof reconstruction

4730 failures, enable the configuration option "z3_with_extensions". Minor

4731 INCOMPATIBILITY.

4733 * Simplified 'typedef' specifications: historical options for implicit

4734 set definition and alternative name have been discontinued. The

4735 former behavior of "typedef (open) t = A" is now the default, but

4736 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

4737 accordingly.

4739 * Removed constant "chars"; prefer "Enum.enum" on type "char"

4740 directly. INCOMPATIBILITY.

4742 * Moved operation product, sublists and n_lists from theory Enum to

4743 List. INCOMPATIBILITY.

4745 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

4747 * Class "comm_monoid_diff" formalises properties of bounded

4748 subtraction, with natural numbers and multisets as typical instances.

4750 * Added combinator "Option.these" with type "'a option set => 'a set".

4752 * Theory "Transitive_Closure": renamed lemmas

4754 reflcl_tranclp -> reflclp_tranclp

4755 rtranclp_reflcl -> rtranclp_reflclp

4757 INCOMPATIBILITY.

4759 * Theory "Rings": renamed lemmas (in class semiring)

4761 left_distrib ~> distrib_right

4762 right_distrib ~> distrib_left

4764 INCOMPATIBILITY.

4766 * Generalized the definition of limits:

4768 - Introduced the predicate filterlim (LIM x F. f x :> G) which

4769 expresses that when the input values x converge to F then the

4770 output f x converges to G.

4772 - Added filters for convergence to positive (at_top) and negative

4773 infinity (at_bot).

4775 - Moved infinity in the norm (at_infinity) from

4776 Multivariate_Analysis to Complex_Main.

4778 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

4779 at_top".

4781 INCOMPATIBILITY.

4783 * Theory "Library/Option_ord" provides instantiation of option type to

4784 lattice type classes.

4786 * Theory "Library/Multiset": renamed

4788 constant fold_mset ~> Multiset.fold

4789 fact fold_mset_commute ~> fold_mset_comm

4791 INCOMPATIBILITY.

4793 * Renamed theory Library/List_Prefix to Library/Sublist, with related

4794 changes as follows.

4796 - Renamed constants (and related lemmas)

4798 prefix ~> prefixeq

4799 strict_prefix ~> prefix

4801 - Replaced constant "postfix" by "suffixeq" with swapped argument

4802 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

4803 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

4804 Renamed lemmas accordingly.

4806 - Added constant "list_hembeq" for homeomorphic embedding on

4807 lists. Added abbreviation "sublisteq" for special case

4808 "list_hembeq (op =)".

4810 - Theory Library/Sublist no longer provides "order" and "bot" type

4811 class instances for the prefix order (merely corresponding locale

4812 interpretations). The type class instances are now in theory

4813 Library/Prefix_Order.

4815 - The sublist relation of theory Library/Sublist_Order is now based

4816 on "Sublist.sublisteq". Renamed lemmas accordingly:

4818 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

4819 le_list_append_mono ~> Sublist.list_hembeq_append_mono

4820 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

4821 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

4822 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

4823 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

4824 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

4825 le_list_drop_many ~> Sublist.sublisteq_drop_many

4826 le_list_filter_left ~> Sublist.sublisteq_filter_left

4827 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

4828 le_list_rev_take_iff ~> Sublist.sublisteq_append

4829 le_list_same_length ~> Sublist.sublisteq_same_length

4830 le_list_take_many_iff ~> Sublist.sublisteq_append'

4831 less_eq_list.drop ~> less_eq_list_drop

4832 less_eq_list.induct ~> less_eq_list_induct

4833 not_le_list_length ~> Sublist.not_sublisteq_length

4835 INCOMPATIBILITY.

4837 * New theory Library/Countable_Set.

4839 * Theory Library/Debug and Library/Parallel provide debugging and

4840 parallel execution for code generated towards Isabelle/ML.

4842 * Theory Library/FuncSet: Extended support for Pi and extensional and

4843 introduce the extensional dependent function space "PiE". Replaced

4844 extensional_funcset by an abbreviation, and renamed lemmas from

4845 extensional_funcset to PiE as follows:

4847 extensional_empty ~> PiE_empty

4848 extensional_funcset_empty_domain ~> PiE_empty_domain

4849 extensional_funcset_empty_range ~> PiE_empty_range

4850 extensional_funcset_arb ~> PiE_arb

4851 extensional_funcset_mem ~> PiE_mem

4852 extensional_funcset_extend_domainI ~> PiE_fun_upd

4853 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

4854 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

4855 card_extensional_funcset ~> card_PiE

4856 finite_extensional_funcset ~> finite_PiE

4858 INCOMPATIBILITY.

4860 * Theory Library/FinFun: theory of almost everywhere constant

4861 functions (supersedes the AFP entry "Code Generation for Functions as

4862 Data").

4864 * Theory Library/Phantom: generic phantom type to make a type

4865 parameter appear in a constant's type. This alternative to adding

4866 TYPE('a) as another parameter avoids unnecessary closures in generated

4867 code.

4869 * Theory Library/RBT_Impl: efficient construction of red-black trees

4870 from sorted associative lists. Merging two trees with rbt_union may

4871 return a structurally different tree than before. Potential

4872 INCOMPATIBILITY.

4874 * Theory Library/IArray: immutable arrays with code generation.

4876 * Theory Library/Finite_Lattice: theory of finite lattices.

4878 * HOL/Multivariate_Analysis: replaced

4880 "basis :: 'a::euclidean_space => nat => real"

4881 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

4883 on euclidean spaces by using the inner product "_ \<bullet> _" with

4884 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

4885 "SUM i : Basis. f i * r i".

4887 With this change the following constants are also changed or removed:

4889 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

4890 a $$ i ~> inner a i (where i : Basis)

4891 cart_base i removed

4892 \<pi>, \<pi>' removed

4894 Theorems about these constants where removed.

4896 Renamed lemmas:

4898 component_le_norm ~> Basis_le_norm

4899 euclidean_eq ~> euclidean_eq_iff

4900 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

4901 euclidean_simps ~> inner_simps

4902 independent_basis ~> independent_Basis

4903 span_basis ~> span_Basis

4904 in_span_basis ~> in_span_Basis

4905 norm_bound_component_le ~> norm_boound_Basis_le

4906 norm_bound_component_lt ~> norm_boound_Basis_lt

4907 component_le_infnorm ~> Basis_le_infnorm

4909 INCOMPATIBILITY.

4911 * HOL/Probability:

4913 - Added simproc "measurable" to automatically prove measurability.

4915 - Added induction rules for sigma sets with disjoint union

4916 (sigma_sets_induct_disjoint) and for Borel-measurable functions

4917 (borel_measurable_induct).

4919 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

4920 projective family).

4922 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

4923 AFP entry "Ordinals_and_Cardinals").

4925 * HOL/BNF: New (co)datatype package based on bounded natural functors

4926 with support for mixed, nested recursion and interesting non-free

4927 datatypes.

4929 * HOL/Finite_Set and Relation: added new set and relation operations

4930 expressed by Finite_Set.fold.

4932 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

4933 trees for the code generator.

4935 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

4936 Lifting/Transfer.

4937 possible INCOMPATIBILITY.

4939 * HOL/Set: renamed Set.project -> Set.filter

4940 INCOMPATIBILITY.

4943 *** Document preparation ***

4945 * Dropped legacy antiquotations "term_style" and "thm_style", since

4946 styles may be given as arguments to "term" and "thm" already.

4947 Discontinued legacy styles "prem1" .. "prem19".

4949 * Default LaTeX rendering for \<euro> is now based on eurosym package,

4950 instead of slightly exotic babel/greek.

4952 * Document variant NAME may use different LaTeX entry point

4953 document/root_NAME.tex if that file exists, instead of the common

4954 document/root.tex.

4956 * Simplified custom document/build script, instead of old-style

4957 document/IsaMakefile. Minor INCOMPATIBILITY.

4960 *** ML ***

4962 * The default limit for maximum number of worker threads is now 8,

4963 instead of 4, in correspondence to capabilities of contemporary

4964 hardware and Poly/ML runtime system.

4966 * Type Seq.results and related operations support embedded error

4967 messages within lazy enumerations, and thus allow to provide

4968 informative errors in the absence of any usable results.

4970 * Renamed Position.str_of to Position.here to emphasize that this is a

4971 formal device to inline positions into message text, but not

4972 necessarily printing visible text.

4975 *** System ***

4977 * Advanced support for Isabelle sessions and build management, see

4978 "system" manual for the chapter of that name, especially the "isabelle

4979 build" tool and its examples. The "isabelle mkroot" tool prepares

4980 session root directories for use with "isabelle build", similar to

4981 former "isabelle mkdir" for "isabelle usedir". Note that this affects

4982 document preparation as well. INCOMPATIBILITY, isabelle usedir /

4983 mkdir / make are rendered obsolete.

4985 * Discontinued obsolete Isabelle/build script, it is superseded by the

4986 regular isabelle build tool. For example:

4988 isabelle build -s -b HOL

4990 * Discontinued obsolete "isabelle makeall".

4992 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

4993 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

4994 provides some traditional targets that invoke "isabelle build". Note

4995 that this is inefficient! Applications of Isabelle/HOL involving

4996 "isabelle make" should be upgraded to use "isabelle build" directly.

4998 * The "isabelle options" tool prints Isabelle system options, as

4999 required for "isabelle build", for example.

5001 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

5002 Minor INCOMPATIBILITY in command-line options.

5004 * The "isabelle install" tool has now a simpler command-line. Minor

5005 INCOMPATIBILITY.

5007 * The "isabelle components" tool helps to resolve add-on components

5008 that are not bundled, or referenced from a bare-bones repository

5009 version of Isabelle.

5011 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

5012 platform family: "linux", "macos", "windows".

5014 * The ML system is configured as regular component, and no longer

5015 picked up from some surrounding directory. Potential INCOMPATIBILITY

5016 for home-made settings.

5018 * Improved ML runtime statistics (heap, threads, future tasks etc.).

5020 * Discontinued support for Poly/ML 5.2.1, which was the last version

5021 without exception positions and advanced ML compiler/toplevel

5022 configuration.

5024 * Discontinued special treatment of Proof General -- no longer guess

5025 PROOFGENERAL_HOME based on accidental file-system layout. Minor

5026 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

5027 settings manually, or use a Proof General version that has been

5028 bundled as Isabelle component.

5032 New in Isabelle2012 (May 2012)

5033 ------------------------------

5035 *** General ***

5037 * Prover IDE (PIDE) improvements:

5039 - more robust Sledgehammer integration (as before the sledgehammer

5040 command-line needs to be typed into the source buffer)

5041 - markup for bound variables

5042 - markup for types of term variables (displayed as tooltips)

5043 - support for user-defined Isar commands within the running session

5044 - improved support for Unicode outside original 16bit range

5045 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

5047 * Forward declaration of outer syntax keywords within the theory

5048 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

5049 commands to be used in the same theory where defined.

5051 * Auxiliary contexts indicate block structure for specifications with

5052 additional parameters and assumptions. Such unnamed contexts may be

5053 nested within other targets, like 'theory', 'locale', 'class',

5054 'instantiation' etc. Results from the local context are generalized

5055 accordingly and applied to the enclosing target context. Example:

5057 context

5058 fixes x y z :: 'a

5059 assumes xy: "x = y" and yz: "y = z"

5060 begin

5062 lemma my_trans: "x = z" using xy yz by simp

5064 end

5066 thm my_trans

5068 The most basic application is to factor-out context elements of

5069 several fixes/assumes/shows theorem statements, e.g. see

5070 ~~/src/HOL/Isar_Examples/Group_Context.thy

5072 Any other local theory specification element works within the "context

5073 ... begin ... end" block as well.

5075 * Bundled declarations associate attributed fact expressions with a

5076 given name in the context. These may be later included in other

5077 contexts. This allows to manage context extensions casually, without

5078 the logical dependencies of locales and locale interpretation. See

5079 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

5081 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

5082 declaration, and results are standardized before being stored. Thus

5083 old-style "standard" after instantiation or composition of facts

5084 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

5085 indices of schematic variables.

5087 * Rule attributes in local theory declarations (e.g. locale or class)

5088 are now statically evaluated: the resulting theorem is stored instead

5089 of the original expression. INCOMPATIBILITY in rare situations, where

5090 the historic accident of dynamic re-evaluation in interpretations

5091 etc. was exploited.

5093 * New tutorial "Programming and Proving in Isabelle/HOL"

5094 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

5095 Structured Isar Proofs" ("isar-overview"), which has been removed. It

5096 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

5097 Logic" as the recommended beginners tutorial, but does not cover all

5098 of the material of that old tutorial.

5100 * Updated and extended reference manuals: "isar-ref",

5101 "implementation", "system"; reduced remaining material in old "ref"

5102 manual.

5105 *** Pure ***

5107 * Command 'definition' no longer exports the foundational "raw_def"

5108 into the user context. Minor INCOMPATIBILITY, may use the regular

5109 "def" result with attribute "abs_def" to imitate the old version.

5111 * Attribute "abs_def" turns an equation of the form "f x y == t" into

5112 "f == %x y. t", which ensures that "simp" or "unfold" steps always

5113 expand it. This also works for object-logic equality. (Formerly

5114 undocumented feature.)

5116 * Sort constraints are now propagated in simultaneous statements, just

5117 like type constraints. INCOMPATIBILITY in rare situations, where

5118 distinct sorts used to be assigned accidentally. For example:

5120 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

5122 lemma "P (x::'a)" and "Q (y::'a::bar)"

5123 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

5125 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

5126 tolerant against multiple unifiers, as long as the final result is

5127 unique. (As before, rules are composed in canonical right-to-left

5128 order to accommodate newly introduced premises.)

5130 * Renamed some inner syntax categories:

5132 num ~> num_token

5133 xnum ~> xnum_token

5134 xstr ~> str_token

5136 Minor INCOMPATIBILITY. Note that in practice "num_const" or

5137 "num_position" etc. are mainly used instead (which also include

5138 position information via constraints).

5140 * Simplified configuration options for syntax ambiguity: see

5141 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

5142 manual. Minor INCOMPATIBILITY.

5144 * Discontinued configuration option "syntax_positions": atomic terms

5145 in parse trees are always annotated by position constraints.

5147 * Old code generator for SML and its commands 'code_module',

5148 'code_library', 'consts_code', 'types_code' have been discontinued.

5149 Use commands of the generic code generator instead. INCOMPATIBILITY.

5151 * Redundant attribute "code_inline" has been discontinued. Use

5152 "code_unfold" instead. INCOMPATIBILITY.

5154 * Dropped attribute "code_unfold_post" in favor of the its dual

5155 "code_abbrev", which yields a common pattern in definitions like

5157 definition [code_abbrev]: "f = t"

5159 INCOMPATIBILITY.

5161 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

5162 instead. INCOMPATIBILITY.

5164 * Discontinued old "prems" fact, which used to refer to the accidental

5165 collection of foundational premises in the context (already marked as

5166 legacy since Isabelle2011).

5169 *** HOL ***

5171 * Type 'a set is now a proper type constructor (just as before

5172 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

5173 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

5174 sets separate, it is often sufficient to rephrase some set S that has

5175 been accidentally used as predicates by "%x. x : S", and some

5176 predicate P that has been accidentally used as set by "{x. P x}".

5177 Corresponding proofs in a first step should be pruned from any

5178 tinkering with former theorems mem_def and Collect_def as far as

5179 possible.

5181 For developments which deliberately mix predicates and sets, a

5182 planning step is necessary to determine what should become a predicate

5183 and what a set. It can be helpful to carry out that step in

5184 Isabelle2011-1 before jumping right into the current release.

5186 * Code generation by default implements sets as container type rather

5187 than predicates. INCOMPATIBILITY.

5189 * New type synonym 'a rel = ('a * 'a) set

5191 * The representation of numerals has changed. Datatype "num"

5192 represents strictly positive binary numerals, along with functions

5193 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent

5194 positive and negated numeric literals, respectively. See also

5195 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

5196 user theories may require adaptations as follows:

5198 - Theorems with number_ring or number_semiring constraints: These

5199 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

5201 - Theories defining numeric types: Remove number, number_semiring,

5202 and number_ring instances. Defer all theorems about numerals until

5203 after classes one and semigroup_add have been instantiated.

5205 - Numeral-only simp rules: Replace each rule having a "number_of v"

5206 pattern with two copies, one for numeral and one for neg_numeral.

5208 - Theorems about subclasses of semiring_1 or ring_1: These classes

5209 automatically support numerals now, so more simp rules and

5210 simprocs may now apply within the proof.

5212 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

5213 Redefine using other integer operations.

5215 * Transfer: New package intended to generalize the existing

5216 "descending" method and related theorem attributes from the Quotient

5217 package. (Not all functionality is implemented yet, but future

5218 development will focus on Transfer as an eventual replacement for the

5219 corresponding parts of the Quotient package.)

5221 - transfer_rule attribute: Maintains a collection of transfer rules,

5222 which relate constants at two different types. Transfer rules may

5223 relate different type instances of the same polymorphic constant,

5224 or they may relate an operation on a raw type to a corresponding

5225 operation on an abstract type (quotient or subtype). For example:

5227 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map

5228 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int

5230 - transfer method: Replaces a subgoal on abstract types with an

5231 equivalent subgoal on the corresponding raw types. Constants are

5232 replaced with corresponding ones according to the transfer rules.

5233 Goals are generalized over all free variables by default; this is

5234 necessary for variables whose types change, but can be overridden

5235 for specific variables with e.g. "transfer fixing: x y z". The

5236 variant transfer' method allows replacing a subgoal with one that

5237 is logically stronger (rather than equivalent).

5239 - relator_eq attribute: Collects identity laws for relators of

5240 various type constructors, e.g. "list_all2 (op =) = (op =)". The

5241 transfer method uses these lemmas to infer transfer rules for

5242 non-polymorphic constants on the fly.

5244 - transfer_prover method: Assists with proving a transfer rule for a

5245 new constant, provided the constant is defined in terms of other

5246 constants that already have transfer rules. It should be applied

5247 after unfolding the constant definitions.

5249 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

5250 from type nat to type int.

5252 * Lifting: New package intended to generalize the quotient_definition

5253 facility of the Quotient package; designed to work with Transfer.

5255 - lift_definition command: Defines operations on an abstract type in

5256 terms of a corresponding operation on a representation

5257 type. Example syntax:

5259 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"

5260 is List.insert

5262 Users must discharge a respectfulness proof obligation when each

5263 constant is defined. (For a type copy, i.e. a typedef with UNIV,

5264 the proof is discharged automatically.) The obligation is

5265 presented in a user-friendly, readable form; a respectfulness

5266 theorem in the standard format and a transfer rule are generated

5267 by the package.

5269 - Integration with code_abstype: For typedefs (e.g. subtypes

5270 corresponding to a datatype invariant, such as dlist),

5271 lift_definition generates a code certificate theorem and sets up

5272 code generation for each constant.

5274 - setup_lifting command: Sets up the Lifting package to work with a

5275 user-defined type. The user must provide either a quotient theorem

5276 or a type_definition theorem. The package configures transfer

5277 rules for equality and quantifiers on the type, and sets up the

5278 lift_definition command to work with the type.

5280 - Usage examples: See Quotient_Examples/Lift_DList.thy,

5281 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

5282 Word/Word.thy and Library/Float.thy.

5284 * Quotient package:

5286 - The 'quotient_type' command now supports a 'morphisms' option with

5287 rep and abs functions, similar to typedef.

5289 - 'quotient_type' sets up new types to work with the Lifting and

5290 Transfer packages, as with 'setup_lifting'.

5292 - The 'quotient_definition' command now requires the user to prove a

5293 respectfulness property at the point where the constant is

5294 defined, similar to lift_definition; INCOMPATIBILITY.

5296 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

5297 accordingly, INCOMPATIBILITY.

5299 * New diagnostic command 'find_unused_assms' to find potentially

5300 superfluous assumptions in theorems using Quickcheck.

5302 * Quickcheck:

5304 - Quickcheck returns variable assignments as counterexamples, which

5305 allows to reveal the underspecification of functions under test.

5306 For example, refuting "hd xs = x", it presents the variable

5307 assignment xs = [] and x = a1 as a counterexample, assuming that

5308 any property is false whenever "hd []" occurs in it.

5310 These counterexample are marked as potentially spurious, as

5311 Quickcheck also returns "xs = []" as a counterexample to the

5312 obvious theorem "hd xs = hd xs".

5314 After finding a potentially spurious counterexample, Quickcheck

5315 continues searching for genuine ones.

5317 By default, Quickcheck shows potentially spurious and genuine

5318 counterexamples. The option "genuine_only" sets quickcheck to only

5319 show genuine counterexamples.

5321 - The command 'quickcheck_generator' creates random and exhaustive

5322 value generators for a given type and operations.

5324 It generates values by using the operations as if they were

5325 constructors of that type.

5327 - Support for multisets.

5329 - Added "use_subtype" options.

5331 - Added "quickcheck_locale" configuration to specify how to process

5332 conjectures in a locale context.

5334 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

5335 and affecting 'rat' and 'real'.

5337 * Sledgehammer:

5338 - Integrated more tightly with SPASS, as described in the ITP 2012

5339 paper "More SPASS with Isabelle".

5340 - Made it try "smt" as a fallback if "metis" fails or times out.

5341 - Added support for the following provers: Alt-Ergo (via Why3 and

5342 TFF1), iProver, iProver-Eq.

5343 - Sped up the minimizer.

5344 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

5345 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

5346 - Renamed "sound" option to "strict".

5348 * Metis: Added possibility to specify lambda translations scheme as a

5349 parenthesized argument (e.g., "by (metis (lifting) ...)").

5351 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

5353 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

5355 * New "case_product" attribute to generate a case rule doing multiple

5356 case distinctions at the same time. E.g.

5358 list.exhaust [case_product nat.exhaust]

5360 produces a rule which can be used to perform case distinction on both

5361 a list and a nat.

5363 * New "eventually_elim" method as a generalized variant of the

5364 eventually_elim* rules. Supports structured proofs.

5366 * Typedef with implicit set definition is considered legacy. Use

5367 "typedef (open)" form instead, which will eventually become the

5368 default.

5370 * Record: code generation can be switched off manually with

5372 declare [[record_coden = false]] -- "default true"

5374 * Datatype: type parameters allow explicit sort constraints.

5376 * Concrete syntax for case expressions includes constraints for source

5377 positions, and thus produces Prover IDE markup for its bindings.

5378 INCOMPATIBILITY for old-style syntax translations that augment the

5379 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of

5380 one_case.

5382 * Clarified attribute "mono_set": pure declaration without modifying

5383 the result of the fact expression.

5385 * More default pred/set conversions on a couple of relation operations

5386 and predicates. Added powers of predicate relations. Consolidation

5387 of some relation theorems:

5389 converse_def ~> converse_unfold

5390 rel_comp_def ~> relcomp_unfold

5391 symp_def ~> (modified, use symp_def and sym_def instead)

5392 transp_def ~> transp_trans

5393 Domain_def ~> Domain_unfold

5394 Range_def ~> Domain_converse [symmetric]

5396 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

5398 See theory "Relation" for examples for making use of pred/set

5399 conversions by means of attributes "to_set" and "to_pred".

5401 INCOMPATIBILITY.

5403 * Renamed facts about the power operation on relations, i.e., relpow

5404 to match the constant's name:

5406 rel_pow_1 ~> relpow_1

5407 rel_pow_0_I ~> relpow_0_I

5408 rel_pow_Suc_I ~> relpow_Suc_I

5409 rel_pow_Suc_I2 ~> relpow_Suc_I2

5410 rel_pow_0_E ~> relpow_0_E

5411 rel_pow_Suc_E ~> relpow_Suc_E

5412 rel_pow_E ~> relpow_E

5413 rel_pow_Suc_D2 ~> relpow_Suc_D2

5414 rel_pow_Suc_E2 ~> relpow_Suc_E2

5415 rel_pow_Suc_D2' ~> relpow_Suc_D2'

5416 rel_pow_E2 ~> relpow_E2

5417 rel_pow_add ~> relpow_add

5418 rel_pow_commute ~> relpow

5419 rel_pow_empty ~> relpow_empty:

5420 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

5421 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

5422 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

5423 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

5424 rel_pow_fun_conv ~> relpow_fun_conv

5425 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

5426 rel_pow_finite_bounded ~> relpow_finite_bounded

5427 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

5428 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

5429 single_valued_rel_pow ~> single_valued_relpow

5431 INCOMPATIBILITY.

5433 * Theory Relation: Consolidated constant name for relation composition

5434 and corresponding theorem names:

5436 - Renamed constant rel_comp to relcomp.

5438 - Dropped abbreviation pred_comp. Use relcompp instead.

5440 - Renamed theorems:

5442 rel_compI ~> relcompI

5443 rel_compEpair ~> relcompEpair

5444 rel_compE ~> relcompE

5445 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

5446 rel_comp_empty1 ~> relcomp_empty1

5447 rel_comp_mono ~> relcomp_mono

5448 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

5449 rel_comp_distrib ~> relcomp_distrib

5450 rel_comp_distrib2 ~> relcomp_distrib2

5451 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

5452 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

5453 single_valued_rel_comp ~> single_valued_relcomp

5454 rel_comp_def ~> relcomp_unfold

5455 converse_rel_comp ~> converse_relcomp

5456 pred_compI ~> relcomppI

5457 pred_compE ~> relcomppE

5458 pred_comp_bot1 ~> relcompp_bot1

5459 pred_comp_bot2 ~> relcompp_bot2

5460 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

5461 pred_comp_mono ~> relcompp_mono

5462 pred_comp_distrib ~> relcompp_distrib

5463 pred_comp_distrib2 ~> relcompp_distrib2

5464 converse_pred_comp ~> converse_relcompp

5466 finite_rel_comp ~> finite_relcomp

5468 set_rel_comp ~> set_relcomp

5470 INCOMPATIBILITY.

5472 * Theory Divides: Discontinued redundant theorems about div and mod.

5473 INCOMPATIBILITY, use the corresponding generic theorems instead.

5475 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

5476 zdiv_self ~> div_self

5477 zmod_self ~> mod_self

5478 zdiv_zero ~> div_0

5479 zmod_zero ~> mod_0

5480 zdiv_zmod_equality ~> div_mod_equality2

5481 zdiv_zmod_equality2 ~> div_mod_equality

5482 zmod_zdiv_trivial ~> mod_div_trivial

5483 zdiv_zminus_zminus ~> div_minus_minus

5484 zmod_zminus_zminus ~> mod_minus_minus

5485 zdiv_zminus2 ~> div_minus_right

5486 zmod_zminus2 ~> mod_minus_right

5487 zdiv_minus1_right ~> div_minus1_right

5488 zmod_minus1_right ~> mod_minus1_right

5489 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

5490 zmod_zmult1_eq ~> mod_mult_right_eq

5491 zpower_zmod ~> power_mod

5492 zdvd_zmod ~> dvd_mod

5493 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

5494 mod_mult_distrib ~> mult_mod_left

5495 mod_mult_distrib2 ~> mult_mod_right

5497 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

5498 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

5500 * Finite_Set.fold now qualified. INCOMPATIBILITY.

5502 * Consolidated theorem names concerning fold combinators:

5504 inf_INFI_fold_inf ~> inf_INF_fold_inf

5505 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

5506 INFI_fold_inf ~> INF_fold_inf

5507 SUPR_fold_sup ~> SUP_fold_sup

5508 union_set ~> union_set_fold

5509 minus_set ~> minus_set_fold

5510 INFI_set_fold ~> INF_set_fold

5511 SUPR_set_fold ~> SUP_set_fold

5512 INF_code ~> INF_set_foldr

5513 SUP_code ~> SUP_set_foldr

5514 foldr.simps ~> foldr.simps (in point-free formulation)

5515 foldr_fold_rev ~> foldr_conv_fold

5516 foldl_fold ~> foldl_conv_fold

5517 foldr_foldr ~> foldr_conv_foldl

5518 foldl_foldr ~> foldl_conv_foldr

5519 fold_set_remdups ~> fold_set_fold_remdups

5520 fold_set ~> fold_set_fold

5521 fold1_set ~> fold1_set_fold

5523 INCOMPATIBILITY.

5525 * Dropped rarely useful theorems concerning fold combinators:

5526 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

5527 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

5528 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

5529 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

5530 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

5531 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

5532 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"

5533 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be

5534 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by

5535 unfolding "foldr_conv_fold" and "foldl_conv_fold".

5537 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

5538 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

5539 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

5540 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

5541 lemmas over fold rather than foldr, or make use of lemmas

5542 fold_conv_foldr and fold_rev.

5544 * Congruence rules Option.map_cong and Option.bind_cong for recursion

5545 through option types.

5547 * "Transitive_Closure.ntrancl": bounded transitive closure on

5548 relations.

5550 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

5552 * Theory Int: Discontinued many legacy theorems specific to type int.

5553 INCOMPATIBILITY, use the corresponding generic theorems instead.

5555 zminus_zminus ~> minus_minus

5556 zminus_0 ~> minus_zero

5557 zminus_zadd_distrib ~> minus_add_distrib

5558 zadd_commute ~> add_commute

5559 zadd_assoc ~> add_assoc

5560 zadd_left_commute ~> add_left_commute

5561 zadd_ac ~> add_ac

5562 zmult_ac ~> mult_ac

5563 zadd_0 ~> add_0_left

5564 zadd_0_right ~> add_0_right

5565 zadd_zminus_inverse2 ~> left_minus

5566 zmult_zminus ~> mult_minus_left

5567 zmult_commute ~> mult_commute

5568 zmult_assoc ~> mult_assoc

5569 zadd_zmult_distrib ~> left_distrib

5570 zadd_zmult_distrib2 ~> right_distrib

5571 zdiff_zmult_distrib ~> left_diff_distrib

5572 zdiff_zmult_distrib2 ~> right_diff_distrib

5573 zmult_1 ~> mult_1_left

5574 zmult_1_right ~> mult_1_right

5575 zle_refl ~> order_refl

5576 zle_trans ~> order_trans

5577 zle_antisym ~> order_antisym

5578 zle_linear ~> linorder_linear

5579 zless_linear ~> linorder_less_linear

5580 zadd_left_mono ~> add_left_mono

5581 zadd_strict_right_mono ~> add_strict_right_mono

5582 zadd_zless_mono ~> add_less_le_mono

5583 int_0_less_1 ~> zero_less_one

5584 int_0_neq_1 ~> zero_neq_one

5585 zless_le ~> less_le

5586 zpower_zadd_distrib ~> power_add

5587 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

5588 zero_le_zpower_abs ~> zero_le_power_abs

5590 * Theory Deriv: Renamed

5592 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

5594 * Theory Library/Multiset: Improved code generation of multisets.

5596 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

5597 are expressed via type classes again. The special syntax

5598 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

5599 setsum_set, which is now subsumed by Big_Operators.setsum.

5600 INCOMPATIBILITY.

5602 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

5603 use theory HOL/Library/Nat_Bijection instead.

5605 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

5606 trees is now inside a type class context. Names of affected

5607 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for

5608 theories working directly with raw red-black trees, adapt the names as

5609 follows:

5611 Operations:

5612 bulkload -> rbt_bulkload

5613 del_from_left -> rbt_del_from_left

5614 del_from_right -> rbt_del_from_right

5615 del -> rbt_del

5616 delete -> rbt_delete

5617 ins -> rbt_ins

5618 insert -> rbt_insert

5619 insertw -> rbt_insert_with

5620 insert_with_key -> rbt_insert_with_key

5621 map_entry -> rbt_map_entry

5622 lookup -> rbt_lookup

5623 sorted -> rbt_sorted

5624 tree_greater -> rbt_greater

5625 tree_less -> rbt_less

5626 tree_less_symbol -> rbt_less_symbol

5627 union -> rbt_union

5628 union_with -> rbt_union_with

5629 union_with_key -> rbt_union_with_key

5631 Lemmas:

5632 balance_left_sorted -> balance_left_rbt_sorted

5633 balance_left_tree_greater -> balance_left_rbt_greater

5634 balance_left_tree_less -> balance_left_rbt_less

5635 balance_right_sorted -> balance_right_rbt_sorted

5636 balance_right_tree_greater -> balance_right_rbt_greater

5637 balance_right_tree_less -> balance_right_rbt_less

5638 balance_sorted -> balance_rbt_sorted

5639 balance_tree_greater -> balance_rbt_greater

5640 balance_tree_less -> balance_rbt_less

5641 bulkload_is_rbt -> rbt_bulkload_is_rbt

5642 combine_sorted -> combine_rbt_sorted

5643 combine_tree_greater -> combine_rbt_greater

5644 combine_tree_less -> combine_rbt_less

5645 delete_in_tree -> rbt_delete_in_tree

5646 delete_is_rbt -> rbt_delete_is_rbt

5647 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

5648 del_from_left_tree_less -> rbt_del_from_left_rbt_less

5649 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

5650 del_from_right_tree_less -> rbt_del_from_right_rbt_less

5651 del_in_tree -> rbt_del_in_tree

5652 del_inv1_inv2 -> rbt_del_inv1_inv2

5653 del_sorted -> rbt_del_rbt_sorted

5654 del_tree_greater -> rbt_del_rbt_greater

5655 del_tree_less -> rbt_del_rbt_less

5656 dom_lookup_Branch -> dom_rbt_lookup_Branch

5657 entries_lookup -> entries_rbt_lookup

5658 finite_dom_lookup -> finite_dom_rbt_lookup

5659 insert_sorted -> rbt_insert_rbt_sorted

5660 insertw_is_rbt -> rbt_insertw_is_rbt

5661 insertwk_is_rbt -> rbt_insertwk_is_rbt

5662 insertwk_sorted -> rbt_insertwk_rbt_sorted

5663 insertw_sorted -> rbt_insertw_rbt_sorted

5664 ins_sorted -> ins_rbt_sorted

5665 ins_tree_greater -> ins_rbt_greater

5666 ins_tree_less -> ins_rbt_less

5667 is_rbt_sorted -> is_rbt_rbt_sorted

5668 lookup_balance -> rbt_lookup_balance

5669 lookup_bulkload -> rbt_lookup_rbt_bulkload

5670 lookup_delete -> rbt_lookup_rbt_delete

5671 lookup_Empty -> rbt_lookup_Empty

5672 lookup_from_in_tree -> rbt_lookup_from_in_tree

5673 lookup_in_tree -> rbt_lookup_in_tree

5674 lookup_ins -> rbt_lookup_ins

5675 lookup_insert -> rbt_lookup_rbt_insert

5676 lookup_insertw -> rbt_lookup_rbt_insertw

5677 lookup_insertwk -> rbt_lookup_rbt_insertwk

5678 lookup_keys -> rbt_lookup_keys

5679 lookup_map -> rbt_lookup_map

5680 lookup_map_entry -> rbt_lookup_rbt_map_entry

5681 lookup_tree_greater -> rbt_lookup_rbt_greater

5682 lookup_tree_less -> rbt_lookup_rbt_less

5683 lookup_union -> rbt_lookup_rbt_union

5684 map_entry_color_of -> rbt_map_entry_color_of

5685 map_entry_inv1 -> rbt_map_entry_inv1

5686 map_entry_inv2 -> rbt_map_entry_inv2

5687 map_entry_is_rbt -> rbt_map_entry_is_rbt

5688 map_entry_sorted -> rbt_map_entry_rbt_sorted

5689 map_entry_tree_greater -> rbt_map_entry_rbt_greater

5690 map_entry_tree_less -> rbt_map_entry_rbt_less

5691 map_tree_greater -> map_rbt_greater

5692 map_tree_less -> map_rbt_less

5693 map_sorted -> map_rbt_sorted

5694 paint_sorted -> paint_rbt_sorted

5695 paint_lookup -> paint_rbt_lookup

5696 paint_tree_greater -> paint_rbt_greater

5697 paint_tree_less -> paint_rbt_less

5698 sorted_entries -> rbt_sorted_entries

5699 tree_greater_eq_trans -> rbt_greater_eq_trans

5700 tree_greater_nit -> rbt_greater_nit

5701 tree_greater_prop -> rbt_greater_prop

5702 tree_greater_simps -> rbt_greater_simps

5703 tree_greater_trans -> rbt_greater_trans

5704 tree_less_eq_trans -> rbt_less_eq_trans

5705 tree_less_nit -> rbt_less_nit

5706 tree_less_prop -> rbt_less_prop

5707 tree_less_simps -> rbt_less_simps

5708 tree_less_trans -> rbt_less_trans

5709 tree_ord_props -> rbt_ord_props

5710 union_Branch -> rbt_union_Branch

5711 union_is_rbt -> rbt_union_is_rbt

5712 unionw_is_rbt -> rbt_unionw_is_rbt

5713 unionwk_is_rbt -> rbt_unionwk_is_rbt

5714 unionwk_sorted -> rbt_unionwk_rbt_sorted

5716 * Theory HOL/Library/Float: Floating point numbers are now defined as

5717 a subset of the real numbers. All operations are defined using the

5718 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

5720 Changed Operations:

5721 float_abs -> abs

5722 float_nprt -> nprt

5723 float_pprt -> pprt

5724 pow2 -> use powr

5725 round_down -> float_round_down

5726 round_up -> float_round_up

5727 scale -> exponent

5729 Removed Operations:

5730 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

5732 Renamed Lemmas:

5733 abs_float_def -> Float.compute_float_abs

5734 bitlen_ge0 -> bitlen_nonneg

5735 bitlen.simps -> Float.compute_bitlen

5736 float_components -> Float_mantissa_exponent

5737 float_divl.simps -> Float.compute_float_divl

5738 float_divr.simps -> Float.compute_float_divr

5739 float_eq_odd -> mult_powr_eq_mult_powr_iff

5740 float_power -> real_of_float_power

5741 lapprox_posrat_def -> Float.compute_lapprox_posrat

5742 lapprox_rat.simps -> Float.compute_lapprox_rat

5743 le_float_def' -> Float.compute_float_le

5744 le_float_def -> less_eq_float.rep_eq

5745 less_float_def' -> Float.compute_float_less

5746 less_float_def -> less_float.rep_eq

5747 normfloat_def -> Float.compute_normfloat

5748 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

5749 normfloat -> normfloat_def

5750 normfloat_unique -> use normfloat_def

5751 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

5752 one_float_def -> Float.compute_float_one

5753 plus_float_def -> Float.compute_float_plus

5754 rapprox_posrat_def -> Float.compute_rapprox_posrat

5755 rapprox_rat.simps -> Float.compute_rapprox_rat

5756 real_of_float_0 -> zero_float.rep_eq

5757 real_of_float_1 -> one_float.rep_eq

5758 real_of_float_abs -> abs_float.rep_eq

5759 real_of_float_add -> plus_float.rep_eq

5760 real_of_float_minus -> uminus_float.rep_eq

5761 real_of_float_mult -> times_float.rep_eq

5762 real_of_float_simp -> Float.rep_eq

5763 real_of_float_sub -> minus_float.rep_eq

5764 round_down.simps -> Float.compute_float_round_down

5765 round_up.simps -> Float.compute_float_round_up

5766 times_float_def -> Float.compute_float_times

5767 uminus_float_def -> Float.compute_float_uminus

5768 zero_float_def -> Float.compute_float_zero

5770 Lemmas not necessary anymore, use the transfer method:

5771 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

5772 float_divr, float_le_simp, float_less1_mantissa_bound,

5773 float_less_simp, float_less_zero, float_le_zero,

5774 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

5775 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

5776 lapprox_rat_bottom, normalized_float, rapprox_posrat,

5777 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

5778 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

5779 round_up, zero_le_float, zero_less_float

5781 * New theory HOL/Library/DAList provides an abstract type for

5782 association lists with distinct keys.

5784 * Session HOL/IMP: Added new theory of abstract interpretation of

5785 annotated commands.

5787 * Session HOL-Import: Re-implementation from scratch is faster,

5788 simpler, and more scalable. Requires a proof bundle, which is

5789 available as an external component. Discontinued old (and mostly

5790 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

5792 * Session HOL-Word: Discontinued many redundant theorems specific to

5793 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

5794 instead.

5796 word_sub_alt ~> word_sub_wi

5797 word_add_alt ~> word_add_def

5798 word_mult_alt ~> word_mult_def

5799 word_minus_alt ~> word_minus_def

5800 word_0_alt ~> word_0_wi

5801 word_1_alt ~> word_1_wi

5802 word_add_0 ~> add_0_left

5803 word_add_0_right ~> add_0_right

5804 word_mult_1 ~> mult_1_left

5805 word_mult_1_right ~> mult_1_right

5806 word_add_commute ~> add_commute

5807 word_add_assoc ~> add_assoc

5808 word_add_left_commute ~> add_left_commute

5809 word_mult_commute ~> mult_commute

5810 word_mult_assoc ~> mult_assoc

5811 word_mult_left_commute ~> mult_left_commute

5812 word_left_distrib ~> left_distrib

5813 word_right_distrib ~> right_distrib

5814 word_left_minus ~> left_minus

5815 word_diff_0_right ~> diff_0_right

5816 word_diff_self ~> diff_self

5817 word_sub_def ~> diff_minus

5818 word_diff_minus ~> diff_minus

5819 word_add_ac ~> add_ac

5820 word_mult_ac ~> mult_ac

5821 word_plus_ac0 ~> add_0_left add_0_right add_ac

5822 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

5823 word_order_trans ~> order_trans

5824 word_order_refl ~> order_refl

5825 word_order_antisym ~> order_antisym

5826 word_order_linear ~> linorder_linear

5827 lenw1_zero_neq_one ~> zero_neq_one

5828 word_number_of_eq ~> number_of_eq

5829 word_of_int_add_hom ~> wi_hom_add

5830 word_of_int_sub_hom ~> wi_hom_sub

5831 word_of_int_mult_hom ~> wi_hom_mult

5832 word_of_int_minus_hom ~> wi_hom_neg

5833 word_of_int_succ_hom ~> wi_hom_succ

5834 word_of_int_pred_hom ~> wi_hom_pred

5835 word_of_int_0_hom ~> word_0_wi

5836 word_of_int_1_hom ~> word_1_wi

5838 * Session HOL-Word: New proof method "word_bitwise" for splitting

5839 machine word equalities and inequalities into logical circuits,

5840 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

5841 multiplication, shifting by constants, bitwise operators and numeric

5842 constants. Requires fixed-length word types, not 'a word. Solves

5843 many standard word identities outright and converts more into first

5844 order problems amenable to blast or similar. See also examples in

5845 HOL/Word/Examples/WordExamples.thy.

5847 * Session HOL-Probability: Introduced the type "'a measure" to

5848 represent measures, this replaces the records 'a algebra and 'a

5849 measure_space. The locales based on subset_class now have two

5850 locale-parameters the space \<Omega> and the set of measurable sets M.

5851 The product of probability spaces uses now the same constant as the

5852 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

5853 measure". Most constants are defined now outside of locales and gain

5854 an additional parameter, like null_sets, almost_eventually or \<mu>'.

5855 Measure space constructions for distributions and densities now got

5856 their own constants distr and density. Instead of using locales to

5857 describe measure spaces with a finite space, the measure count_space

5858 and point_measure is introduced. INCOMPATIBILITY.

5860 Renamed constants:

5861 measure -> emeasure

5862 finite_measure.\<mu>' -> measure

5863 product_algebra_generator -> prod_algebra

5864 product_prob_space.emb -> prod_emb

5865 product_prob_space.infprod_algebra -> PiM

5867 Removed locales:

5868 completeable_measure_space

5869 finite_measure_space

5870 finite_prob_space

5871 finite_product_finite_prob_space

5872 finite_product_sigma_algebra

5873 finite_sigma_algebra

5874 measure_space

5875 pair_finite_prob_space

5876 pair_finite_sigma_algebra

5877 pair_finite_space

5878 pair_sigma_algebra

5879 product_sigma_algebra

5881 Removed constants:

5882 conditional_space

5883 distribution -> use distr measure, or distributed predicate

5884 image_space

5885 joint_distribution -> use distr measure, or distributed predicate

5886 pair_measure_generator

5887 product_prob_space.infprod_algebra -> use PiM

5888 subvimage

5890 Replacement theorems:

5891 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

5892 finite_measure.empty_measure -> measure_empty

5893 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

5894 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

5895 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

5896 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

5897 finite_measure.finite_measure -> finite_measure.emeasure_finite

5898 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

5899 finite_measure.positive_measure' -> measure_nonneg

5900 finite_measure.real_measure -> finite_measure.emeasure_real

5901 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

5902 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

5903 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

5904 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

5905 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

5906 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

5907 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

5908 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

5909 information_space.entropy_commute -> information_space.entropy_commute_simple

5910 information_space.entropy_eq -> information_space.entropy_simple_distributed

5911 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

5912 information_space.entropy_positive -> information_space.entropy_nonneg_simple

5913 information_space.entropy_uniform_max -> information_space.entropy_uniform

5914 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

5915 information_space.KL_eq_0 -> information_space.KL_same_eq_0

5916 information_space.KL_ge_0 -> information_space.KL_nonneg

5917 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

5918 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

5919 Int_stable_cuboids -> Int_stable_atLeastAtMost

5920 Int_stable_product_algebra_generator -> positive_integral

5921 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

5922 measure_space.additive -> emeasure_additive

5923 measure_space.AE_iff_null_set -> AE_iff_null

5924 measure_space.almost_everywhere_def -> eventually_ae_filter

5925 measure_space.almost_everywhere_vimage -> AE_distrD

5926 measure_space.continuity_from_above -> INF_emeasure_decseq

5927 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

5928 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

5929 measure_space.continuity_from_below -> SUP_emeasure_incseq

5930 measure_space_density -> emeasure_density

5931 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

5932 measure_space.integrable_vimage -> integrable_distr

5933 measure_space.integral_translated_density -> integral_density

5934 measure_space.integral_vimage -> integral_distr

5935 measure_space.measure_additive -> plus_emeasure

5936 measure_space.measure_compl -> emeasure_compl

5937 measure_space.measure_countable_increasing -> emeasure_countable_increasing

5938 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

5939 measure_space.measure_decseq -> decseq_emeasure

5940 measure_space.measure_Diff -> emeasure_Diff

5941 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

5942 measure_space.measure_eq_0 -> emeasure_eq_0

5943 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

5944 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

5945 measure_space.measure_incseq -> incseq_emeasure

5946 measure_space.measure_insert -> emeasure_insert

5947 measure_space.measure_mono -> emeasure_mono

5948 measure_space.measure_not_negative -> emeasure_not_MInf

5949 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

5950 measure_space.measure_setsum -> setsum_emeasure

5951 measure_space.measure_setsum_split -> setsum_emeasure_cover

5952 measure_space.measure_space_vimage -> emeasure_distr

5953 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

5954 measure_space.measure_subadditive -> subadditive

5955 measure_space.measure_top -> emeasure_space

5956 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

5957 measure_space.measure_Un_null_set -> emeasure_Un_null_set

5958 measure_space.positive_integral_translated_density -> positive_integral_density

5959 measure_space.positive_integral_vimage -> positive_integral_distr

5960 measure_space.real_continuity_from_above -> Lim_measure_decseq

5961 measure_space.real_continuity_from_below -> Lim_measure_incseq

5962 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

5963 measure_space.real_measure_Diff -> measure_Diff

5964 measure_space.real_measure_finite_Union -> measure_finite_Union

5965 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

5966 measure_space.real_measure_subadditive -> measure_subadditive

5967 measure_space.real_measure_Union -> measure_Union

5968 measure_space.real_measure_UNION -> measure_UNION

5969 measure_space.simple_function_vimage -> simple_function_comp

5970 measure_space.simple_integral_vimage -> simple_integral_distr

5971 measure_space.simple_integral_vimage -> simple_integral_distr

5972 measure_unique_Int_stable -> measure_eqI_generator_eq

5973 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

5974 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

5975 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

5976 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

5977 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

5978 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

5979 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

5980 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

5981 pair_sigma_algebra.sets_swap -> sets_pair_swap

5982 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

5983 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

5984 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

5985 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

5986 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

5987 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

5988 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

5989 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

5990 prob_space.measure_space_1 -> prob_space.emeasure_space_1

5991 prob_space.prob_space_vimage -> prob_space_distr

5992 prob_space.random_variable_restrict -> measurable_restrict

5993 prob_space_unique_Int_stable -> measure_eqI_prob_space

5994 product_algebraE -> prod_algebraE_all

5995 product_algebra_generator_der -> prod_algebra_eq_finite

5996 product_algebra_generator_into_space -> prod_algebra_sets_into_space

5997 product_algebraI -> sets_PiM_I_finite

5998 product_measure_exists -> product_sigma_finite.sigma_finite

5999 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

6000 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

6001 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

6002 product_prob_space.measurable_component -> measurable_component_singleton

6003 product_prob_space.measurable_emb -> measurable_prod_emb

6004 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

6005 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

6006 product_prob_space.measure_emb -> emeasure_prod_emb

6007 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

6008 product_sigma_algebra.product_algebra_into_space -> space_closed

6009 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

6010 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

6011 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

6012 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

6013 sets_product_algebra -> sets_PiM

6014 sigma_algebra.measurable_sigma -> measurable_measure_of

6015 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

6016 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

6017 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

6018 space_product_algebra -> space_PiM

6020 * Session HOL-TPTP: support to parse and import TPTP problems (all

6021 languages) into Isabelle/HOL.

6024 *** FOL ***

6026 * New "case_product" attribute (see HOL).

6029 *** ZF ***

6031 * Greater support for structured proofs involving induction or case

6032 analysis.

6034 * Much greater use of mathematical symbols.

6036 * Removal of many ML theorem bindings. INCOMPATIBILITY.

6039 *** ML ***

6041 * Antiquotation @{keyword "name"} produces a parser for outer syntax

6042 from a minor keyword introduced via theory header declaration.

6044 * Antiquotation @{command_spec "name"} produces the

6045 Outer_Syntax.command_spec from a major keyword introduced via theory

6046 header declaration; it can be passed to Outer_Syntax.command etc.

6048 * Local_Theory.define no longer hard-wires default theorem name

6049 "foo_def", but retains the binding as given. If that is Binding.empty

6050 / Attrib.empty_binding, the result is not registered as user-level

6051 fact. The Local_Theory.define_internal variant allows to specify a

6052 non-empty name (used for the foundation in the background theory),

6053 while omitting the fact binding in the user-context. Potential

6054 INCOMPATIBILITY for derived definitional packages: need to specify

6055 naming policy for primitive definitions more explicitly.

6057 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

6058 conformance with similar operations in structure Term and Logic.

6060 * Antiquotation @{attributes [...]} embeds attribute source

6061 representation into the ML text, which is particularly useful with

6062 declarations like Local_Theory.note.

6064 * Structure Proof_Context follows standard naming scheme. Old

6065 ProofContext has been discontinued. INCOMPATIBILITY.

6067 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

6068 change of semantics: update is applied to auxiliary local theory

6069 context as well.

6071 * Modernized some old-style infix operations:

6073 addeqcongs ~> Simplifier.add_eqcong

6074 deleqcongs ~> Simplifier.del_eqcong

6075 addcongs ~> Simplifier.add_cong

6076 delcongs ~> Simplifier.del_cong

6077 setmksimps ~> Simplifier.set_mksimps

6078 setmkcong ~> Simplifier.set_mkcong

6079 setmksym ~> Simplifier.set_mksym

6080 setmkeqTrue ~> Simplifier.set_mkeqTrue

6081 settermless ~> Simplifier.set_termless

6082 setsubgoaler ~> Simplifier.set_subgoaler

6083 addsplits ~> Splitter.add_split

6084 delsplits ~> Splitter.del_split

6087 *** System ***

6089 * USER_HOME settings variable points to cross-platform user home

6090 directory, which coincides with HOME on POSIX systems only. Likewise,

6091 the Isabelle path specification "~" now expands to $USER_HOME, instead

6092 of former $HOME. A different default for USER_HOME may be set

6093 explicitly in shell environment, before Isabelle settings are

6094 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

6095 the generic user home was intended.

6097 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

6098 notation, which is useful for the jEdit file browser, for example.

6100 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

6101 (not just JRE).

6105 New in Isabelle2011-1 (October 2011)

6106 ------------------------------------

6108 *** General ***

6110 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

6111 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

6113 - Management of multiple theory files directly from the editor

6114 buffer store -- bypassing the file-system (no requirement to save

6115 files for checking).

6117 - Markup of formal entities within the text buffer, with semantic

6118 highlighting, tooltips and hyperlinks to jump to defining source

6119 positions.

6121 - Improved text rendering, with sub/superscripts in the source

6122 buffer (including support for copy/paste wrt. output panel, HTML

6123 theory output and other non-Isabelle text boxes).

6125 - Refined scheduling of proof checking and printing of results,

6126 based on interactive editor view. (Note: jEdit folding and

6127 narrowing allows to restrict buffer perspectives explicitly.)

6129 - Reduced CPU performance requirements, usable on machines with few

6130 cores.

6132 - Reduced memory requirements due to pruning of unused document

6133 versions (garbage collection).

6135 See also ~~/src/Tools/jEdit/README.html for further information,

6136 including some remaining limitations.

6138 * Theory loader: source files are exclusively located via the master

6139 directory of each theory node (where the .thy file itself resides).

6140 The global load path (such as src/HOL/Library) has been discontinued.

6141 Note that the path element ~~ may be used to reference theories in the

6142 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".

6143 INCOMPATIBILITY.

6145 * Theory loader: source files are identified by content via SHA1

6146 digests. Discontinued former path/modtime identification and optional

6147 ISABELLE_FILE_IDENT plugin scripts.

6149 * Parallelization of nested Isar proofs is subject to

6150 Goal.parallel_proofs_threshold (default 100). See also isabelle

6151 usedir option -Q.

6153 * Name space: former unsynchronized references are now proper

6154 configuration options, with more conventional names:

6156 long_names ~> names_long

6157 short_names ~> names_short

6158 unique_names ~> names_unique

6160 Minor INCOMPATIBILITY, need to declare options in context like this:

6162 declare [[names_unique = false]]

6164 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note

6165 that the result needs to be unique, which means fact specifications

6166 may have to be refined after enriching a proof context.

6168 * Attribute "case_names" has been refined: the assumptions in each case

6169 can be named now by following the case name with [name1 name2 ...].

6171 * Isabelle/Isar reference manual has been updated and extended:

6172 - "Synopsis" provides a catalog of main Isar language concepts.

6173 - Formal references in syntax diagrams, via @{rail} antiquotation.

6174 - Updated material from classic "ref" manual, notably about

6175 "Classical Reasoner".

6178 *** HOL ***

6180 * Class bot and top require underlying partial order rather than

6181 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.

6183 * Class complete_lattice: generalized a couple of lemmas from sets;

6184 generalized theorems INF_cong and SUP_cong. New type classes for

6185 complete boolean algebras and complete linear orders. Lemmas

6186 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in

6187 class complete_linorder.

6189 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,

6190 Sup_fun_def, Inf_apply, Sup_apply.

6192 Removed redundant lemmas (the right hand side gives hints how to

6193 replace them for (metis ...), or (simp only: ...) proofs):

6195 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]

6196 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]

6197 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right

6198 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right

6199 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right

6200 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right

6201 Inter_def ~> INF_def, image_def

6202 Union_def ~> SUP_def, image_def

6203 INT_eq ~> INF_def, and image_def

6204 UN_eq ~> SUP_def, and image_def

6205 INF_subset ~> INF_superset_mono [OF _ order_refl]

6207 More consistent and comprehensive names:

6209 INTER_eq_Inter_image ~> INF_def

6210 UNION_eq_Union_image ~> SUP_def

6211 INFI_def ~> INF_def

6212 SUPR_def ~> SUP_def

6213 INF_leI ~> INF_lower

6214 INF_leI2 ~> INF_lower2

6215 le_INFI ~> INF_greatest

6216 le_SUPI ~> SUP_upper

6217 le_SUPI2 ~> SUP_upper2

6218 SUP_leI ~> SUP_least

6219 INFI_bool_eq ~> INF_bool_eq

6220 SUPR_bool_eq ~> SUP_bool_eq

6221 INFI_apply ~> INF_apply

6222 SUPR_apply ~> SUP_apply

6223 INTER_def ~> INTER_eq

6224 UNION_def ~> UNION_eq

6226 INCOMPATIBILITY.

6228 * Renamed theory Complete_Lattice to Complete_Lattices.

6229 INCOMPATIBILITY.

6231 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,

6232 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,

6233 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,

6234 Sup_insert are now declared as [simp]. INCOMPATIBILITY.

6236 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,

6237 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,

6238 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor

6239 INCOMPATIBILITY.

6241 * Added syntactic classes "inf" and "sup" for the respective

6242 constants. INCOMPATIBILITY: Changes in the argument order of the

6243 (mostly internal) locale predicates for some derived classes.

6245 * Theorem collections ball_simps and bex_simps do not contain theorems

6246 referring to UNION any longer; these have been moved to collection

6247 UN_ball_bex_simps. INCOMPATIBILITY.

6249 * Theory Archimedean_Field: floor now is defined as parameter of a

6250 separate type class floor_ceiling.

6252 * Theory Finite_Set: more coherent development of fold_set locales:

6254 locale fun_left_comm ~> locale comp_fun_commute

6255 locale fun_left_comm_idem ~> locale comp_fun_idem

6257 Both use point-free characterization; interpretation proofs may need

6258 adjustment. INCOMPATIBILITY.

6260 * Theory Limits: Type "'a net" has been renamed to "'a filter", in

6261 accordance with standard mathematical terminology. INCOMPATIBILITY.