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

NEWS

author | wenzelm |

Tue Apr 02 14:46:01 2019 +0200 (5 months ago) | |

changeset 70032 | 0674c24afc5e |

parent 70031 | 2dfba895e26d |

child 70057 | 0403b5127da1 |

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

updated for release;

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 Isabelle2019 (June 2019)

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

10 *** General ***

12 * The font collection "Isabelle DejaVu" is systematically derived from

13 the existing "DejaVu" fonts, with variants "Sans Mono", "Sans", "Serif"

14 and styles "Normal", "Bold", "Italic/Oblique", "Bold-Italic/Oblique".

15 The DejaVu base fonts are retricted to well-defined Unicode ranges and

16 augmented by special Isabelle symbols, taken from the former

17 "IsabelleText" font (which is no longer provided separately). The line

18 metrics and overall rendering quality is closer to original DejaVu.

19 INCOMPATIBILITY with display configuration expecting the old

20 "IsabelleText" font: use e.g. "Isabelle DejaVu Sans Mono" instead.

22 * The Isabelle fonts render "\<inverse>" properly as superscript "-1".

24 * Old-style inner comments (* ... *) within the term language are no

25 longer supported (legacy feature in Isabelle2018).

27 * Old-style {* verbatim *} tokens are explicitly marked as legacy

28 feature and will be removed soon. Use \<open>cartouche\<close> syntax instead, e.g.

29 via "isabelle update_cartouches -t" (available since Isabelle2015).

31 * Infix operators that begin or end with a "*" can now be paranthesized

32 without additional spaces, eg "(*)" instead of "( * )". Minor

33 INCOMPATIBILITY.

35 * Mixfix annotations may use cartouches instead of old-style double

36 quotes, e.g. (infixl \<open>+\<close> 60). The command-line tool "isabelle update -u

37 mixfix_cartouches" allows to update existing theory sources

38 automatically.

40 * ML setup commands (e.g. 'setup', 'method_setup', 'parse_translation')

41 need to provide a closed expression -- without trailing semicolon. Minor

42 INCOMPATIBILITY.

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

47 * Fonts for the text area, gutter, GUI elements etc. use the "Isabelle

48 DejaVu" collection by default, which provides uniform rendering quality

49 with the usual Isabelle symbols. Line spacing no longer needs to be

50 adjusted: properties for the old IsabelleText font had "Global Options /

51 Text Area / Extra vertical line spacing (in pixels): -2", now it

52 defaults to 0.

54 * The jEdit File Browser is more prominent in the default GUI layout of

55 Isabelle/jEdit: various virtual file-systems provide access to Isabelle

56 resources, notably via "favorites:" (or "Edit Favorites").

58 * Action "isabelle-export-browser" points the File Browser to the theory

59 exports of the current buffer, based on the "isabelle-export:" virtual

60 file-system. The directory view needs to be reloaded manually to follow

61 ongoing document processing.

63 * Action "isabelle-session-browser" points the File Browser to session

64 information, based on the "isabelle-session:" virtual file-system. Its

65 entries are structured according to chapter / session names, the open

66 operation is redirected to the session ROOT file.

68 * Support for user-defined file-formats via class isabelle.File_Format

69 in Isabelle/Scala (e.g. see isabelle.Bibtex.File_Format), configured via

70 the shell function "isabelle_file_format" in etc/settings (e.g. of an

71 Isabelle component).

73 * System option "jedit_text_overview" allows to disable the text

74 overview column.

76 * Command-line options "-s" and "-u" of "isabelle jedit" override the

77 default for system option "system_heaps" that determines the heap

78 storage directory for "isabelle build". Option "-n" is now clearly

79 separated from option "-s".

81 * OpenJDK 11 has quite different font rendering, with better glyph

82 shapes and improved sub-pixel anti-aliasing. In some situations results

83 might be *worse* than Oracle Java 8, though.

86 *** Document preparation ***

88 * Document markers are formal comments of the form \<^marker>\<open>marker_body\<close> that

89 are stripped from document output: the effect is to modify the semantic

90 presentation context or to emit markup to the PIDE document. Some

91 predefined markers are taken from the Dublin Core Metadata Initiative,

92 e.g. \<^marker>\<open>contributor arg\<close> or \<^marker>\<open>license arg\<close> and produce PIDE markup that

93 can retrieved from the document database.

95 * Old-style command tags %name are re-interpreted as markers \<^marker>\<open>tag name\<close>

96 and produce LaTeX environments as before. Potential INCOMPATIBILITY:

97 multiple markers are composed in canonical order, resulting in a

98 reversed list of tags in the presentation context.

101 *** Isar ***

103 * Implicit cases goal1, goal2, goal3, etc. have been discontinued

104 (legacy feature since Isabelle2016).

106 * More robust treatment of structural errors: begin/end blocks take

107 precedence over goal/proof. This is particularly relevant for the

108 headless PIDE session and server.

110 * Command keywords of kind thy_decl / thy_goal may be more specifically

111 fit into the traditional document model of "definition-statement-proof"

112 via thy_defn / thy_stmt / thy_goal_defn / thy_goal_stmt.

115 *** HOL ***

117 * Command 'export_code' produces output as logical files within the

118 theory context, as well as formal session exports that can be

119 materialized via command-line tools "isabelle export" or "isabelle build

120 -e" (with 'export_files' in the session ROOT). Isabelle/jEdit also

121 provides a virtual file-system "isabelle-export:" that can be explored

122 in the regular file-browser. A 'file_prefix' argument allows to specify

123 an explicit name prefix for the target file (SML, OCaml, Scala) or

124 directory (Haskell); the default is "export" with a consecutive number

125 within each theory.

127 * Command 'export_code': the 'file' argument is now legacy and will be

128 removed soon: writing to the physical file-system is not well-defined in

129 a reactive/parallel application like Isabelle. The empty 'file' argument

130 has been discontinued already: it is superseded by the file-browser in

131 Isabelle/jEdit on "isabelle-export:". Minor INCOMPATIBILITY.

133 * Command 'code_reflect' no longer supports the 'file' argument: it has

134 been superseded by 'file_prefix' for stateless file management as in

135 'export_code'. Minor INCOMPATIBILITY.

137 * Code generation for OCaml: proper strings are used for literals.

138 Minor INCOMPATIBILITY.

140 * Code generation for OCaml: Zarith supersedes Nums as library for

141 proper integer arithmetic. The library is located via standard

142 invocations of "ocamlfind" (via ISABELLE_OCAMLFIND settings variable).

143 The environment provided by "isabelle ocaml_setup" already contains this

144 tool and the required packages. Minor INCOMPATIBILITY.

146 * Code generation for Haskell: code includes for Haskell must contain

147 proper module frame, nothing is added magically any longer.

148 INCOMPATIBILITY.

150 * Code generation: slightly more conventional syntax for 'code_stmts'

151 antiquotation. Minor INCOMPATIBILITY.

153 * Theory List: the precedence of the list_update operator has changed:

154 "f a [n := x]" now needs to be written "(f a)[n := x]".

156 * The functions \<Union>, \<Inter>, \<Squnion>, \<Sqinter> (not the corresponding binding operators)

157 now have the same precedence as any other prefix function symbol. Minor

158 INCOMPATIBILITY.

160 * Simplified syntax setup for big operators under image. In rare

161 situations, type conversions are not inserted implicitly any longer

162 and need to be given explicitly. Auxiliary abbreviations INFIMUM,

163 SUPREMUM, UNION, INTER should now rarely occur in output and are just

164 retained as migration auxiliary. INCOMPATIBILITY.

166 * The simplifier uses image_cong_simp as a congruence rule. The historic

167 and not really well-formed congruence rules INF_cong*, SUP_cong*, are

168 not used by default any longer. INCOMPATIBILITY; consider using declare

169 image_cong_simp [cong del] in extreme situations.

171 * INF_image and SUP_image are no default simp rules any longer.

172 INCOMPATIBILITY, prefer image_comp as simp rule if needed.

174 * Strong congruence rules (with =simp=> in the premises) for constant f

175 are now uniformly called f_cong_simp, in accordance with congruence

176 rules produced for mappers by the datatype package. INCOMPATIBILITY.

178 * Retired lemma card_Union_image; use the simpler card_UN_disjoint

179 instead. INCOMPATIBILITY.

181 * Facts sum_mset.commute and prod_mset.commute have been renamed to

182 sum_mset.swap and prod_mset.swap, similarly to sum.swap and prod.swap.

183 INCOMPATIBILITY.

185 * ML structure Inductive: slightly more conventional naming schema.

186 Minor INCOMPATIBILITY.

188 * ML: Various _global variants of specification tools have been removed.

189 Minor INCOMPATIBILITY, prefer combinators

190 Named_Target.theory_map[_result] to lift specifications to the global

191 theory level.

193 * Theory HOL-Library.Simps_Case_Conv: 'case_of_simps' now supports

194 overlapping and non-exhaustive patterns and handles arbitrarily nested

195 patterns. It uses on the same algorithm as HOL-Library.Code_Lazy, which

196 assumes sequential left-to-right pattern matching. The generated

197 equation no longer tuples the arguments on the right-hand side.

198 INCOMPATIBILITY.

200 * Theory HOL-Library.Multiset: the <Union># operator now has the same

201 precedence as any other prefix function symbol.

203 * Session HOL-Library and HOL-Number_Theory: Exponentiation by squaring,

204 used for computing powers in class "monoid_mult" and modular

205 exponentiation.

207 * Session HOL-Computational_Algebra: Formal Laurent series and overhaul

208 of Formal power series.

210 * Session HOL-Number_Theory: More material on residue rings in

211 Carmichael's function, primitive roots, more properties for "ord".

213 * Session HOL-Analysis: More material and better organization.

215 * Session HOL-SPARK: .prv files are no longer written to the

216 file-system, but exported to the session database. Results may be

217 retrieved via "isabelle build -e HOL-SPARK-Examples" on the

218 command-line.

220 * Sledgehammer:

221 - The URL for SystemOnTPTP, which is used by remote provers, has been

222 updated.

223 - The machine-learning-based filter MaSh has been optimized to take

224 less time (in most cases).

226 * SMT: reconstruction is now possible using the SMT solver veriT.

229 *** ML ***

231 * Command 'generate_file' allows to produce sources for other languages,

232 with antiquotations in the Isabelle context (only the control-cartouche

233 form). The default "cartouche" antiquotation evaluates an ML expression

234 of type string and inlines the result as a string literal of the target

235 language. For example, this works for Haskell as follows:

237 generate_file "Pure.hs" = \<open>

238 module Isabelle.Pure where

239 allConst, impConst, eqConst :: String

240 allConst = \<open>\<^const_name>\<open>Pure.all\<close>\<close>

241 impConst = \<open>\<^const_name>\<open>Pure.imp\<close>\<close>

242 eqConst = \<open>\<^const_name>\<open>Pure.eq\<close>\<close>

243 \<close>

245 The ML function Generate_File.generate writes all generated files from a

246 given theory to the file-system, e.g. a temporary directory where some

247 external compiler is applied.

249 * ML evaluation (notably via commands 'ML' and 'ML_file') is subject to

250 option ML_environment to select a named environment, such as "Isabelle"

251 for Isabelle/ML, or "SML" for official Standard ML. It is also possible

252 to move toplevel bindings between environments, using a notation with

253 ">" as separator. For example:

255 declare [[ML_environment = "Isabelle>SML"]]

256 ML \<open>val println = writeln\<close>

258 declare [[ML_environment = "SML"]]

259 ML \<open>println "test"\<close>

261 declare [[ML_environment = "Isabelle"]]

262 ML \<open>println\<close> \<comment> \<open>not present\<close>

264 The Isabelle/ML function ML_Env.setup defines new ML environments. This

265 is useful to incorporate big SML projects in an isolated name space, and

266 potentially with variations on ML syntax (existing ML_Env.SML_operations

267 observes the official standard).

269 * ML antiquotation @{master_dir} refers to the master directory of the

270 underlying theory, i.e. the directory of the theory file.

272 * ML antiquotation @{verbatim} inlines its argument as string literal,

273 preserving newlines literally. The short form \<^verbatim>\<open>abc\<close> is particularly

274 useful.

276 * Local_Theory.reset is no longer available in user space. Regular

277 definitional packages should use balanced blocks of

278 Local_Theory.open_target versus Local_Theory.close_target instead, or

279 the Local_Theory.subtarget(_result) combinator. Rare INCOMPATIBILITY.

281 * Original PolyML.pointerEq is retained as a convenience for tools that

282 don't use Isabelle/ML (where this is called "pointer_eq").

285 *** System ***

287 * Update to OpenJDK 11: the current long-term support version of Java.

289 * Update to Poly/ML 5.8 allows to use the native x86_64 platform without

290 the full overhead of 64-bit values everywhere. This special x86_64_32

291 mode provides up to 16GB ML heap, while program code and stacks are

292 allocated elsewhere. Thus approx. 5 times more memory is available for

293 applications compared to old x86 mode (which is no longer used by

294 Isabelle). The switch to the x86_64 CPU architecture also avoids

295 compatibility problems with Linux and macOS, where 32-bit applications

296 are gradually phased out.

298 * System option "checkpoint" has been discontinued: obsolete thanks to

299 improved memory management in Poly/ML.

301 * System option "system_heaps" determines where to store the session

302 image of "isabelle build" (and other tools using that internally).

303 Former option "-s" is superseded by option "-o system_heaps".

304 INCOMPATIBILITY in command-line syntax.

306 * Session directory $ISABELLE_HOME/src/Tools/Haskell provides some

307 source modules for Isabelle tools implemented in Haskell, notably for

308 Isabelle/PIDE.

310 * The command-line tool "isabelle build -e" retrieves theory exports

311 from the session build database, using 'export_files' in session ROOT

312 entries.

314 * The command-line tool "isabelle update" uses Isabelle/PIDE in

315 batch-mode to update theory sources based on semantic markup produced in

316 Isabelle/ML. Actual updates depend on system options that may be enabled

317 via "-u OPT" (for "update_OPT"), see also $ISABELLE_HOME/etc/options

318 section "Theory update". Theory sessions are specified as in "isabelle

319 dump".

321 * The command-line tool "isabelle update -u control_cartouches" changes

322 antiquotations into control-symbol format (where possible): @{NAME}

323 becomes \<^NAME> and @{NAME ARG} becomes \<^NAME>\<open>ARG\<close>.

325 * Support for Isabelle command-line tools defined in Isabelle/Scala.

326 Instances of class Isabelle_Scala_Tools may be configured via the shell

327 function "isabelle_scala_tools" in etc/settings (e.g. of an Isabelle

328 component).

330 * Isabelle Server command "use_theories" supports "nodes_status_delay"

331 for continuous output of node status information. The time interval is

332 specified in seconds; a negative value means it is disabled (default).

334 * Isabelle Server command "use_theories" terminates more robustly in the

335 presence of structurally broken sources: full consolidation of theories

336 is no longer required.

338 * OCaml tools and libraries are now accesed via ISABELLE_OCAMLFIND,

339 which needs to point to a suitable version of "ocamlfind" (e.g. via

340 OPAM, see below). INCOMPATIBILITY: settings variables ISABELLE_OCAML and

341 ISABELLE_OCAMLC are no longer supported.

343 * Support for managed installations of Glasgow Haskell Compiler and

344 OCaml via the following command-line tools:

346 isabelle ghc_setup

347 isabelle ghc_stack

349 isabelle ocaml_setup

350 isabelle ocaml_opam

352 The global installation state is determined by the following settings

353 (and corresponding directory contents):

355 ISABELLE_STACK_ROOT

356 ISABELLE_STACK_RESOLVER

357 ISABELLE_GHC_VERSION

359 ISABELLE_OPAM_ROOT

360 ISABELLE_OCAML_VERSION

362 After setup, the following Isabelle settings are automatically

363 redirected (overriding existing user settings):

365 ISABELLE_GHC

367 ISABELLE_OCAMLFIND

369 The old meaning of these settings as locally installed executables may

370 be recovered by purging the directories ISABELLE_STACK_ROOT /

371 ISABELLE_OPAM_ROOT, or by resetting these variables in

372 $ISABELLE_HOME_USER/etc/settings.

376 New in Isabelle2018 (August 2018)

377 ---------------------------------

379 *** General ***

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

382 to refer to unqualified theories from the parent session.

383 INCOMPATIBILITY for old developments that have not been updated to

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

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

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

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

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

391 * Global facts need to be closed: no free variables and no hypotheses.

392 Rare INCOMPATIBILITY.

394 * Facts stemming from locale interpretation are subject to lazy

395 evaluation for improved performance. Rare INCOMPATIBILITY: errors

396 stemming from interpretation morphisms might be deferred and thus

397 difficult to locate; enable system option "strict_facts" temporarily to

398 avoid this.

400 * Marginal comments need to be written exclusively in the new-style form

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

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

403 update_comments" to update existing theory files.

405 * Old-style inner comments (* ... *) within the term language are legacy

406 and will be discontinued soon: use formal comments "\<comment> \<open>...\<close>" or "\<^cancel>\<open>...\<close>"

407 instead.

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

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

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

412 INCOMPATIBILITY, use the command-line tool "isabelle update_op" to

413 convert theory and ML files to the new syntax. Because it is based on

414 regular expression matching, the result may need a bit of manual

415 postprocessing. Invoking "isabelle update_op" converts all files in the

416 current directory (recursively). In case you want to exclude conversion

417 of ML files (because the tool frequently also converts ML's "op"

418 syntax), use option "-m".

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

421 INCOMPATIBILITY.

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

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

425 without specific Prover IDE management.

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

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

429 context.

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

432 accessible ROOT file is processed only once. This facilitates

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

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

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

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

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

441 * In HTML output, the Isabelle symbol "\<hyphen>" is rendered as explicit

442 Unicode hyphen U+2010, to avoid unclear meaning of the old "soft hyphen"

443 U+00AD. Rare INCOMPATIBILITY, e.g. copy-paste of historic Isabelle HTML

444 output.

447 *** Isabelle/jEdit Prover IDE ***

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

450 for session management:

452 - option -R builds an auxiliary logic image with all theories from

453 other sessions that are not already present in its parent

455 - option -S is like -R, with a focus on the selected session and its

456 descendants (this reduces startup time for big projects like AFP)

458 - option -A specifies an alternative ancestor session for options -R

459 and -S

461 - option -i includes additional sessions into the name-space of

462 theories

464 Examples:

465 isabelle jedit -R HOL-Number_Theory

466 isabelle jedit -R HOL-Number_Theory -A HOL

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

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

469 isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis -i CryptHOL

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

472 follow links to theories and document files etc.

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

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

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

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

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

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

481 arguments into this format.

483 * Completion provides templates for named symbols with arguments,

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

486 * Slightly more parallel checking, notably for high priority print

487 functions (e.g. State output).

489 * The view title is set dynamically, according to the Isabelle

490 distribution and the logic session name. The user can override this via

491 set-view-title (stored persistently in $JEDIT_SETTINGS/perspective.xml).

493 * System options "spell_checker_include" and "spell_checker_exclude"

494 supersede former "spell_checker_elements" to determine regions of text

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

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

498 notably bibtex database files and ML files.

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

501 plain-text document draft. Both are available via the menu "Plugins /

502 Isabelle".

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

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

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

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

508 Unicode content when saving the file.

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

512 * Update to jedit-5.5.0, the latest release.

515 *** Isabelle/VSCode Prover IDE ***

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

518 Isabelle/jEdit.

520 * Command-line tool "isabelle vscode_server" accepts the same options

521 -A, -R, -S, -i for session selection as "isabelle jedit". This is

522 relevant for isabelle.args configuration settings in VSCode. The former

523 option -A (explore all known session files) has been discontinued: it is

524 enabled by default, unless option -S is used to focus on a particular

525 spot in the session structure. INCOMPATIBILITY.

528 *** Document preparation ***

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

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

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

533 are supported:

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

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

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

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

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

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

543 * System option "document_tags" specifies alternative command tags. This

544 is occasionally useful to control the global visibility of commands via

545 session options (e.g. in ROOT).

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

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

549 of option "document_tags" to these commands.

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

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

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

554 \isactrlconstUNDERSCOREname.

556 * Document preparation with skip_proofs option now preserves the content

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

559 * Document antiquotation @{theory name} requires the long

560 session-qualified theory name: this is what users reading the text

561 normally need to import.

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

564 session name verbatim.

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

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

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

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

571 latex and bibtex process. Minor INCOMPATIBILITY.

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

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

575 anymore.

578 *** Isar ***

580 * Command 'interpret' no longer exposes resulting theorems as literal

581 facts, notably for the \<open>prop\<close> notation or the "fact" proof method. This

582 improves modularity of proofs and scalability of locale interpretation.

583 Rare INCOMPATIBILITY, need to refer to explicitly named facts instead

584 (e.g. use 'find_theorems' or 'try' to figure this out).

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

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

588 object-logic equality or equivalence.

591 *** Pure ***

593 * The inner syntax category "sort" now includes notation "_" for the

594 dummy sort: it is effectively ignored in type-inference.

596 * Rewrites clauses (keyword 'rewrites') were moved into the locale

597 expression syntax, where they are part of locale instances. In

598 interpretation commands rewrites clauses now need to occur before 'for'

599 and 'defines'. Rare INCOMPATIBILITY; definitions immediately subject to

600 rewriting may need to be pulled up into the surrounding theory.

602 * For 'rewrites' clauses, if activating a locale instance fails, fall

603 back to reading the clause first. This helps avoid qualification of

604 locale instances where the qualifier's sole purpose is avoiding

605 duplicate constant declarations.

607 * Proof method "simp" now supports a new modifier "flip:" followed by a

608 list of theorems. Each of these theorems is removed from the simpset

609 (without warning if it is not there) and the symmetric version of the

610 theorem (i.e. lhs and rhs exchanged) is added to the simpset. For "auto"

611 and friends the modifier is "simp flip:".

614 *** HOL ***

616 * Sledgehammer: bundled version of "vampire" (for non-commercial users)

617 helps to avoid fragility of "remote_vampire" service.

619 * Clarified relationship of characters, strings and code generation:

621 - Type "char" is now a proper datatype of 8-bit values.

623 - Conversions "nat_of_char" and "char_of_nat" are gone; use more

624 general conversions "of_char" and "char_of" with suitable type

625 constraints instead.

627 - The zero character is just written "CHR 0x00", not "0" any longer.

629 - Type "String.literal" (for code generation) is now isomorphic to

630 lists of 7-bit (ASCII) values; concrete values can be written as

631 "STR ''...''" for sequences of printable characters and "STR 0x..."

632 for one single ASCII code point given as hexadecimal numeral.

634 - Type "String.literal" supports concatenation "... + ..." for all

635 standard target languages.

637 - Theory HOL-Library.Code_Char is gone; study the explanations

638 concerning "String.literal" in the tutorial on code generation to

639 get an idea how target-language string literals can be converted to

640 HOL string values and vice versa.

642 - Session Imperative-HOL: operation "raise" directly takes a value of

643 type "String.literal" as argument, not type "string".

645 INCOMPATIBILITY.

647 * Code generation: Code generation takes an explicit option

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

650 * Abstract bit operations as part of Main: push_bit, take_bit, drop_bit.

652 * New, more general, axiomatization of complete_distrib_lattice. The

653 former axioms:

655 "sup x (Inf X) = Inf (sup x ` X)" and "inf x (Sup X) = Sup (inf x ` X)"

657 are replaced by:

659 "Inf (Sup ` A) <= Sup (Inf ` {f ` A | f . (! Y \<in> A . f Y \<in> Y)})"

661 The instantiations of sets and functions as complete_distrib_lattice are

662 moved to Hilbert_Choice.thy because their proofs need the Hilbert choice

663 operator. The dual of this property is also proved in theory

664 HOL.Hilbert_Choice.

666 * New syntax for the minimum/maximum of a function over a finite set:

667 MIN x\<in>A. B and even MIN x. B (only useful for finite types), also MAX.

669 * Clarifed theorem names:

671 Min.antimono ~> Min.subset_imp

672 Max.antimono ~> Max.subset_imp

674 Minor INCOMPATIBILITY.

676 * SMT module:

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

679 with a solver other than Z3. INCOMPATIBILITY.

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

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

683 option has been added to control this. INCOMPATIBILITY.

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

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

687 interpretation of abstract locales. INCOMPATIBILITY.

689 * Predicate coprime is now a real definition, not a mere abbreviation.

690 INCOMPATIBILITY.

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

693 INCOMPATIBILITY.

695 * The relator rel_filter on filters has been strengthened to its

696 canonical categorical definition with better properties.

697 INCOMPATIBILITY.

699 * Generalized linear algebra involving linear, span, dependent, dim

700 from type class real_vector to locales module and vector_space.

701 Renamed:

703 span_inc ~> span_superset

704 span_superset ~> span_base

705 span_eq ~> span_eq_iff

707 INCOMPATIBILITY.

709 * Class linordered_semiring_1 covers zero_less_one also, ruling out

710 pathologic instances. Minor INCOMPATIBILITY.

712 * Theory HOL.List: functions "sorted_wrt" and "sorted" now compare every

713 element in a list to all following elements, not just the next one.

715 * Theory HOL.List syntax:

717 - filter-syntax "[x <- xs. P]" is no longer output syntax, but only

718 input syntax

720 - list comprehension syntax now supports tuple patterns in "pat <- xs"

722 * Theory Map: "empty" must now be qualified as "Map.empty".

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

726 * Fact mod_mult_self4 (on nat) renamed to Suc_mod_mult_self3, to avoid

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

728 INCOMPATIBILITY.

730 * Eliminated some theorem aliasses:

731 even_times_iff ~> even_mult_iff

732 mod_2_not_eq_zero_eq_one_nat ~> not_mod_2_eq_0_eq_1

733 even_of_nat ~> even_int_iff

735 INCOMPATIBILITY.

737 * Eliminated some theorem duplicate variations:

739 - dvd_eq_mod_eq_0_numeral can be replaced by dvd_eq_mod_eq_0

740 - mod_Suc_eq_Suc_mod can be replaced by mod_Suc

741 - mod_Suc_eq_Suc_mod [symmetrict] can be replaced by mod_simps

742 - mod_eq_0_iff can be replaced by mod_eq_0_iff_dvd and dvd_def

743 - the witness of mod_eqD can be given directly as "_ div _"

745 INCOMPATIBILITY.

747 * Classical setup: Assumption "m mod d = 0" (for m d :: nat) is no

748 longer aggresively destroyed to "\<exists>q. m = d * q". INCOMPATIBILITY, adding

749 "elim!: dvd" to classical proof methods in most situations restores

750 broken proofs.

752 * Theory HOL-Library.Conditional_Parametricity provides command

753 'parametric_constant' for proving parametricity of non-recursive

754 definitions. For constants that are not fully parametric the command

755 will infer conditions on relations (e.g., bi_unique, bi_total, or type

756 class conditions such as "respects 0") sufficient for parametricity. See

757 theory HOL-ex.Conditional_Parametricity_Examples for some examples.

759 * Theory HOL-Library.Code_Lazy provides a new preprocessor for the code

760 generator to generate code for algebraic types with lazy evaluation

761 semantics even in call-by-value target languages. See the theories

762 HOL-ex.Code_Lazy_Demo and HOL-Codegenerator_Test.Code_Lazy_Test for some

763 examples.

765 * Theory HOL-Library.Landau_Symbols has been moved here from AFP.

767 * Theory HOL-Library.Old_Datatype no longer provides the legacy command

768 'old_datatype'. INCOMPATIBILITY.

770 * Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide

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

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

773 INCOMPATIBILITY.

775 * Session HOL-Algebra: renamed (^) to [^] to avoid conflict with new

776 infix/prefix notation.

778 * Session HOL-Algebra: revamped with much new material. The set of

779 isomorphisms between two groups is now denoted iso rather than iso_set.

780 INCOMPATIBILITY.

782 * Session HOL-Analysis: the Arg function now respects the same interval

783 as Ln, namely (-pi,pi]; the old Arg function has been renamed Arg2pi.

784 INCOMPATIBILITY.

786 * Session HOL-Analysis: the functions zorder, zer_poly, porder and

787 pol_poly have been redefined. All related lemmas have been reworked.

788 INCOMPATIBILITY.

790 * Session HOL-Analysis: infinite products, Moebius functions, the

791 Riemann mapping theorem, the Vitali covering theorem,

792 change-of-variables results for integration and measures.

794 * Session HOL-Real_Asymp: proof method "real_asymp" proves asymptotics

795 or real-valued functions (limits, "Big-O", etc.) automatically.

796 See also ~~/src/HOL/Real_Asymp/Manual for some documentation.

798 * Session HOL-Types_To_Sets: more tool support (unoverload_type combines

799 internalize_sorts and unoverload) and larger experimental application

800 (type based linear algebra transferred to linear algebra on subspaces).

803 *** ML ***

805 * Operation Export.export emits theory exports (arbitrary blobs), which

806 are stored persistently in the session build database.

808 * Command 'ML_export' exports ML toplevel bindings to the global

809 bootstrap environment of the ML process. This allows ML evaluation

810 without a formal theory context, e.g. in command-line tools like

811 "isabelle process".

814 *** System ***

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

817 longer supported.

819 * Linux and Windows/Cygwin is for x86_64 only, old 32bit platform

820 support has been discontinued.

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

823 been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,

824 instead of former 32/64 variants. INCOMPATIBILITY.

826 * Old settings ISABELLE_PLATFORM and ISABELLE_WINDOWS_PLATFORM should be

827 phased out due to unclear preference of 32bit vs. 64bit architecture.

828 Explicit GNU bash expressions are now preferred, for example (with

829 quotes):

831 #Posix executables (Unix or Cygwin), with preference for 64bit

832 "${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}"

834 #native Windows or Unix executables, with preference for 64bit

835 "${ISABELLE_WINDOWS_PLATFORM64:-${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}}"

837 #native Windows (32bit) or Unix executables (preference for 64bit)

838 "${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}"

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

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

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

843 - option -f: forces a fresh build

845 * Command-line tool "isabelle build" options -c -x -B refer to

846 descendants wrt. the session parent or import graph. Subtle

847 INCOMPATIBILITY: options -c -x used to refer to the session parent graph

848 only.

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

851 corresponding environment values into account, when determining the

852 up-to-date status of a session.

854 * The command-line tool "dump" dumps information from the cumulative

855 PIDE session database: many sessions may be loaded into a given logic

856 image, results from all loaded theories are written to the output

857 directory.

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

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

862 * The command-line tool "export" and 'export_files' in session ROOT

863 entries retrieve theory exports from the session build database.

865 * The command-line tools "isabelle server" and "isabelle client" provide

866 access to the Isabelle Server: it supports responsive session management

867 and concurrent use of theories, based on Isabelle/PIDE infrastructure.

868 See also the "system" manual.

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

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

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

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

874 been discontinued.

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

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

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

880 repository for the generated session files.

882 * Settings ISABELLE_HEAPS + ISABELLE_BROWSER_INFO (or

883 ISABELLE_HEAPS_SYSTEM + ISABELLE_BROWSER_INFO_SYSTEM in "system build

884 mode") determine the directory locations of the main build artefacts --

885 instead of hard-wired directories in ISABELLE_HOME_USER (or

886 ISABELLE_HOME).

888 * Settings ISABELLE_PATH and ISABELLE_OUTPUT have been discontinued:

889 heap images and session databases are always stored in

890 $ISABELLE_HEAPS/$ML_IDENTIFIER (command-line default) or

891 $ISABELLE_HEAPS_SYSTEM/$ML_IDENTIFIER (main Isabelle application or

892 "isabelle jedit -s" or "isabelle build -s").

894 * ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific

895 options for improved error reporting. Potential INCOMPATIBILITY with

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

898 * Update to Poly/ML 5.7.1 with slightly improved performance and PIDE

899 markup for identifier bindings. It now uses The GNU Multiple Precision

900 Arithmetic Library (libgmp) on all platforms, notably Mac OS X with

901 32/64 bit.

905 New in Isabelle2017 (October 2017)

906 ----------------------------------

908 *** General ***

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

911 Isabelle/PIDE front-end, see also

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

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

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

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

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

918 Technically, VSCode is based on the Electron application framework

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

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

921 modules around a Language Server implementation.

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

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

925 just the theory base name as before).

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

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

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

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

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

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

933 imports" helps to update theory imports.

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

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

937 leads to the follow renamings:

939 CTT/Main.thy ~> CTT/CTT.thy

940 ZF/Main.thy ~> ZF/ZF.thy

941 ZF/Main_ZF.thy ~> ZF/ZF.thy

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

943 ZF/ZF.thy ~> ZF/ZF_Base.thy

945 INCOMPATIBILITY.

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

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

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

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

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

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

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

956 antiquotations:

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

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

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

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

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

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

965 src/HOL/Decision_Procs/Commutative_Ring.thy and

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

967 tutorial on code generation.

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

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

973 arbitrary theory hierarchies independently of the underlying logic

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

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

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

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

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

980 changes of formal document content. Theory dependencies are always

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

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

983 effectively always enabled.

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

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

987 buffers.

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

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

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

992 represented by a different border color.

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

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

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

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

999 document in the default web browser.

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

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

1003 used for formal checking.

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

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

1007 enabled at all times.

1009 * Update to current jedit-5.4.0.

1012 *** Pure ***

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

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

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

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

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

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

1021 ignored with warnings if syntactically malformed.

1022 - Explicitly global code declarations yield errors if syntactically

1023 malformed.

1024 - Default code declarations are silently ignored if syntactically

1025 malformed.

1026 Minor INCOMPATIBILITY.

1028 * Clarified and standardized internal data bookkeeping of code

1029 declarations: history of serials allows to track potentially

1030 non-monotonous declarations appropriately. Minor INCOMPATIBILITY.

1033 *** HOL ***

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

1037 * SMT module:

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

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

1040 disabled by default.

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

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

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

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

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

1047 INCOMPATIBILITY.

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

1050 terms without free variables are always evaluated using plain evaluation

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

1052 INCOMPATIBILITY.

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

1055 of "Complex_Main").

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

1058 Minor INCOMPATIBILITY.

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

1061 INCOMPATIBILITY.

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

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

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

1067 transp, antisymp, single_valuedp instead. INCOMPATIBILITY.

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

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

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

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

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

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

1078 * Named theorems mod_simps covers various congruence rules concerning

1079 mod, replacing former zmod_simps. INCOMPATIBILITY.

1081 * Swapped orientation of congruence rules mod_add_left_eq,

1082 mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,

1083 mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,

1084 mod_diff_eq. INCOMPATIBILITY.

1086 * Generalized some facts:

1087 measure_induct_rule

1088 measure_induct

1089 zminus_zmod ~> mod_minus_eq

1090 zdiff_zmod_left ~> mod_diff_left_eq

1091 zdiff_zmod_right ~> mod_diff_right_eq

1092 zmod_eq_dvd_iff ~> mod_eq_dvd_iff

1093 INCOMPATIBILITY.

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

1096 euclidean_(semi)ring, euclidean_(semi)ring_cancel,

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

1098 euclidean size.

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

1101 - Euclidean induction is available as rule eucl_induct.

1102 - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,

1103 Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow

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

1105 - Coefficients obtained by extended euclidean algorithm are

1106 available as "bezout_coefficients".

1107 INCOMPATIBILITY.

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

1110 totient function previously hidden as solitary example in theory

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

1112 the literature. Minor INCOMPATIBILITY.

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

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

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

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

1119 been renamed to bij_swap_compose_bij. INCOMPATIBILITY.

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

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

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

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

1126 space. INCOMPATIBILITY.

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

1129 INCOMPATIBILITY.

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

1132 replacement syntax has been removed. INCOMPATIBILITY, standard syntax

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

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

1136 syntax (ASCII)

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

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

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

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

1142 multisets have been renamed:

1144 msetless_cancel_numerals ~> msetsubset_cancel

1145 msetle_cancel_numerals ~> msetsubset_eq_cancel

1147 INCOMPATIBILITY.

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

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

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

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

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

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

1157 Curve Theorem and the Great Picard Theorem.

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

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

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

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

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

1166 theories, notably Euclidean_Algorithm, Factorial_Ring,

1167 Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,

1168 Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor

1169 INCOMPATIBILITY.

1172 *** System ***

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

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

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

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

1179 "Application File Format" in the sense of

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

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

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

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

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

1186 builds (according to parallel_subproofs_threshold).

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

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

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

1191 unchanged.

1193 * Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been

1194 renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.

1196 * Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,

1197 ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the

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

1199 is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,

1200 ISABELLE_PLATFORM64.

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

1203 the Isabelle application bundle for Linux. See also

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

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

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

1208 serves as example for alternative PIDE front-ends.

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

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

1213 isabelle imports -I -a

1214 isabelle imports -U -a

1215 isabelle imports -U -i -a

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

1220 New in Isabelle2016-1 (December 2016)

1221 -------------------------------------

1223 *** General ***

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

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

1227 INCOMPATIBILITY.

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

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

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

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

1232 result the subgoal may be split into several subgoals.

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

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

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

1238 bundle foo

1239 begin

1240 declare a [simp]

1241 declare b [intro]

1242 end

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

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

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

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

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

1250 discontinued.

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

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

1254 quotes when sub-languages are nested.

1256 * Mixfix annotations support general block properties, with syntax

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

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

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

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

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

1263 statements without object-logic judgment.

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

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

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

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

1270 examples.

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

1273 instances) are generated into companion object of corresponding type

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

1276 * Solve direct: option "solve_direct_strict_warnings" gives explicit

1277 warnings for lemma statements with trivial proofs.

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

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

1283 system option editor_generated_input_delay (in addition to existing

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

1285 reactivity and CPU usage.

1287 * Syntactic indentation according to Isabelle outer syntax. Action

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

1289 command keywords and some command substructure. Action

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

1291 according to command keywords only; see also option

1292 "jedit_indent_newline".

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

1295 number of subgoals. This requires information of ongoing document

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

1297 quickly; see also option "jedit_script_indent" and

1298 "jedit_script_indent_limit".

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

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

1302 structure of theory specifications is treated as well.

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

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

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

1308 e.g. 'context', 'notepad'.

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

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

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

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

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

1317 systematic renaming.

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

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

1321 theorem statement.

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

1324 situations where old ASCII notation may be updated.

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

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

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

1329 inaccessible via keyboard completion).

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

1332 following independent stages:

1334 src/Pure/ROOT0.ML

1335 src/Pure/ROOT.ML

1336 src/Pure/Pure.thy

1337 src/Pure/ML_Bootstrap.thy

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

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

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

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

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

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

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

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

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

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

1351 * Additional abbreviations for syntactic completion may be specified

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

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

1354 new 'abbrevs' section.

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

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

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

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

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

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

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

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

1365 old keymaps.

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

1368 and diverse:

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

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

1372 @{dir NAME} -- check for directory

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

1375 have to be changed.

1378 *** Document preparation ***

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

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

1383 existing antiquotation @{class}.

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

1386 this allows special forms of document output.

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

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

1390 derivatives.

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

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

1395 Isabelle2015).

1398 *** Isar ***

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

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

1402 'definition', 'inductive', 'function'.

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

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

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

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

1408 context: INCOMPATIBILITY.

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

1411 optional abstraction over local parameters. The syntax resembles

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

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

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

1416 context.

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

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

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

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

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

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

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

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

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

1430 INCOMPATIBILITY.

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

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

1434 definitions.

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

1437 expression, e.g.

1439 (use facts in simp)

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

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

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

1446 *** Pure ***

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

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

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

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

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

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

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

1456 regardless of the actual parameters that are provided. Rare

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

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

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

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

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

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

1464 INCOMPATIBILITY, need to provide explicit type constraints for Pure

1465 types where this is really intended.

1468 *** HOL ***

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

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

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

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

1474 quantifier-free propositional logic with linear real arithmetic

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

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

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

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

1481 break existing proofs. INCOMPATIBILITY.

1483 * Sledgehammer:

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

1485 - Produce syntactically correct Vampire 4.0 problem files.

1487 * (Co)datatype package:

1488 - New commands for defining corecursive functions and reasoning about

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

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

1491 method. See 'isabelle doc corec'.

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

1493 citizen in bounded natural functors.

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

1495 to the map function.

1496 - 'bnf' automatically discharges reflexive proof obligations.

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

1498 terms of map and set

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

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

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

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

1503 - Renamed lemmas:

1504 rel_prod_apply ~> rel_prod_inject

1505 pred_prod_apply ~> pred_prod_inject

1506 INCOMPATIBILITY.

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

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

1509 equivalent) form.

1510 INCOMPATIBILITY.

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

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

1514 which exposed details of the internal fixpoint construction and was

1515 hard to use. INCOMPATIBILITY.

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

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

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

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

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

1524 eliminated altogether.

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

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

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

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

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

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

1532 INCOMPATIBILITY in rare situations.

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

1535 INCOMPATIBILITY.

1537 * Renamed constants and corresponding theorems:

1539 setsum ~> sum

1540 setprod ~> prod

1541 listsum ~> sum_list

1542 listprod ~> prod_list

1544 INCOMPATIBILITY.

1546 * Sligthly more standardized theorem names:

1547 sgn_times ~> sgn_mult

1548 sgn_mult' ~> Real_Vector_Spaces.sgn_mult

1549 divide_zero_left ~> div_0

1550 zero_mod_left ~> mod_0

1551 divide_zero ~> div_by_0

1552 divide_1 ~> div_by_1

1553 nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left

1554 div_mult_self1_is_id ~> nonzero_mult_div_cancel_left

1555 nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right

1556 div_mult_self2_is_id ~> nonzero_mult_div_cancel_right

1557 is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left

1558 is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right

1559 mod_div_equality ~> div_mult_mod_eq

1560 mod_div_equality2 ~> mult_div_mod_eq

1561 mod_div_equality3 ~> mod_div_mult_eq

1562 mod_div_equality4 ~> mod_mult_div_eq

1563 minus_div_eq_mod ~> minus_div_mult_eq_mod

1564 minus_div_eq_mod2 ~> minus_mult_div_eq_mod

1565 minus_mod_eq_div ~> minus_mod_eq_div_mult

1566 minus_mod_eq_div2 ~> minus_mod_eq_mult_div

1567 div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]

1568 mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]

1569 zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]

1570 zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]

1571 Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

1572 mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

1573 zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

1574 div_1 ~> div_by_Suc_0

1575 mod_1 ~> mod_by_Suc_0

1576 INCOMPATIBILITY.

1578 * New type class "idom_abs_sgn" specifies algebraic properties

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

1580 disappeared. Slight INCOMPATIBILITY.

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

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

1585 corresponding to {0..255}.

1587 - Logical representation:

1588 * 0 is instantiated to the ASCII zero character.

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

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

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

1592 are non-canonical.

1593 - Printing and parsing:

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

1595 (as before).

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

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

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

1599 is parsable for every numeral expression n.

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

1601 printed as their logical representation.

1602 - Explicit conversions from and to the natural numbers are

1603 provided as char_of_nat, nat_of_char (as before).

1604 - The auxiliary nibble type has been discontinued.

1606 INCOMPATIBILITY.

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

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

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

1611 infix "mod" syntax. INCOMPATIBILITY.

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

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

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

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

1617 easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.

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

1620 equation in term output. Minor INCOMPATIBILITY.

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

1623 which renders those abstract effectively.

1625 * Command 'export_code' checks given constants for abstraction

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

1627 interface for the generated code.

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

1630 spelt out explicitly.

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

1633 explicitly provided auxiliary definitions for required type class

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

1635 tutorial on code generation for details.

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

1638 products.

1640 * Locale bijection establishes convenient default simp rules such as

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

1643 * Abstract locales semigroup, abel_semigroup, semilattice,

1644 semilattice_neutr, ordering, ordering_top, semilattice_order,

1645 semilattice_neutr_order, comm_monoid_set, semilattice_set,

1646 semilattice_neutr_set, semilattice_order_set,

1647 semilattice_order_neutr_set monoid_list, comm_monoid_list,

1648 comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified

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

1650 INCOMPATIBILITY.

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

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

1654 lifting_syntax begin ... end". Minor INCOMPATIBILITY.

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

1657 INCOMPATIBILITY.

1659 nat_less_cases -- removed, use linorder_cases instead

1660 inv_image_comp -- removed, use image_inv_f_f instead

1661 image_surj_f_inv_f ~> image_f_inv_f

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

1664 groups to semi-groups that are also monoids:

1665 le_add_same_cancel1

1666 le_add_same_cancel2

1667 less_add_same_cancel1

1668 less_add_same_cancel2

1669 add_le_same_cancel1

1670 add_le_same_cancel2

1671 add_less_same_cancel1

1672 add_less_same_cancel2

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

1675 superseeded by a more general version:

1676 less_add_cancel_left_greater_zero ~> less_add_same_cancel1

1677 less_add_cancel_right_greater_zero ~> less_add_same_cancel2

1678 less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1

1679 less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2

1680 less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1

1681 less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2

1682 less_add_cancel_left_less_zero ~> add_less_same_cancel1

1683 less_add_cancel_right_less_zero ~> add_less_same_cancel2

1684 INCOMPATIBILITY.

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

1687 resemble the f.split naming convention, INCOMPATIBILITY.

1689 * Added class topological_monoid.

1691 * The following theorems have been renamed:

1693 setsum_left_distrib ~> sum_distrib_right

1694 setsum_right_distrib ~> sum_distrib_left

1696 INCOMPATIBILITY.

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

1699 INCOMPATIBILITY.

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

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

1703 A)".

1705 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.

1707 * The type class ordered_comm_monoid_add is now called

1708 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add

1709 is introduced as the combination of ordered_ab_semigroup_add +

1710 comm_monoid_add. INCOMPATIBILITY.

1712 * Introduced the type classes canonically_ordered_comm_monoid_add and

1713 dioid.

1715 * Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When

1716 instantiating linordered_semiring_strict and ordered_ab_group_add, an

1717 explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might

1718 be required. INCOMPATIBILITY.

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

1721 of a more general type also:

1722 lcm_left_commute_nat ~> lcm.left_commute

1723 lcm_left_commute_int ~> lcm.left_commute

1724 gcd_left_commute_nat ~> gcd.left_commute

1725 gcd_left_commute_int ~> gcd.left_commute

1726 gcd_greatest_iff_nat ~> gcd_greatest_iff

1727 gcd_greatest_iff_int ~> gcd_greatest_iff

1728 coprime_dvd_mult_nat ~> coprime_dvd_mult

1729 coprime_dvd_mult_int ~> coprime_dvd_mult

1730 zpower_numeral_even ~> power_numeral_even

1731 gcd_mult_cancel_nat ~> gcd_mult_cancel

1732 gcd_mult_cancel_int ~> gcd_mult_cancel

1733 div_gcd_coprime_nat ~> div_gcd_coprime

1734 div_gcd_coprime_int ~> div_gcd_coprime

1735 zpower_numeral_odd ~> power_numeral_odd

1736 zero_less_int_conv ~> of_nat_0_less_iff

1737 gcd_greatest_nat ~> gcd_greatest

1738 gcd_greatest_int ~> gcd_greatest

1739 coprime_mult_nat ~> coprime_mult

1740 coprime_mult_int ~> coprime_mult

1741 lcm_commute_nat ~> lcm.commute

1742 lcm_commute_int ~> lcm.commute

1743 int_less_0_conv ~> of_nat_less_0_iff

1744 gcd_commute_nat ~> gcd.commute

1745 gcd_commute_int ~> gcd.commute

1746 Gcd_insert_nat ~> Gcd_insert

1747 Gcd_insert_int ~> Gcd_insert

1748 of_int_int_eq ~> of_int_of_nat_eq

1749 lcm_least_nat ~> lcm_least

1750 lcm_least_int ~> lcm_least

1751 lcm_assoc_nat ~> lcm.assoc

1752 lcm_assoc_int ~> lcm.assoc

1753 int_le_0_conv ~> of_nat_le_0_iff

1754 int_eq_0_conv ~> of_nat_eq_0_iff

1755 Gcd_empty_nat ~> Gcd_empty

1756 Gcd_empty_int ~> Gcd_empty

1757 gcd_assoc_nat ~> gcd.assoc

1758 gcd_assoc_int ~> gcd.assoc

1759 zero_zle_int ~> of_nat_0_le_iff

1760 lcm_dvd2_nat ~> dvd_lcm2

1761 lcm_dvd2_int ~> dvd_lcm2

1762 lcm_dvd1_nat ~> dvd_lcm1

1763 lcm_dvd1_int ~> dvd_lcm1

1764 gcd_zero_nat ~> gcd_eq_0_iff

1765 gcd_zero_int ~> gcd_eq_0_iff

1766 gcd_dvd2_nat ~> gcd_dvd2

1767 gcd_dvd2_int ~> gcd_dvd2

1768 gcd_dvd1_nat ~> gcd_dvd1

1769 gcd_dvd1_int ~> gcd_dvd1

1770 int_numeral ~> of_nat_numeral

1771 lcm_ac_nat ~> ac_simps

1772 lcm_ac_int ~> ac_simps

1773 gcd_ac_nat ~> ac_simps

1774 gcd_ac_int ~> ac_simps

1775 abs_int_eq ~> abs_of_nat

1776 zless_int ~> of_nat_less_iff

1777 zdiff_int ~> of_nat_diff

1778 zadd_int ~> of_nat_add

1779 int_mult ~> of_nat_mult

1780 int_Suc ~> of_nat_Suc

1781 inj_int ~> inj_of_nat

1782 int_1 ~> of_nat_1

1783 int_0 ~> of_nat_0

1784 Lcm_empty_nat ~> Lcm_empty

1785 Lcm_empty_int ~> Lcm_empty

1786 Lcm_insert_nat ~> Lcm_insert

1787 Lcm_insert_int ~> Lcm_insert

1788 comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd

1789 comp_fun_idem_gcd_int ~> comp_fun_idem_gcd

1790 comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm

1791 comp_fun_idem_lcm_int ~> comp_fun_idem_lcm

1792 Lcm_eq_0 ~> Lcm_eq_0_I

1793 Lcm0_iff ~> Lcm_0_iff

1794 Lcm_dvd_int ~> Lcm_least

1795 divides_mult_nat ~> divides_mult

1796 divides_mult_int ~> divides_mult

1797 lcm_0_nat ~> lcm_0_right

1798 lcm_0_int ~> lcm_0_right

1799 lcm_0_left_nat ~> lcm_0_left

1800 lcm_0_left_int ~> lcm_0_left

1801 dvd_gcd_D1_nat ~> dvd_gcdD1

1802 dvd_gcd_D1_int ~> dvd_gcdD1

1803 dvd_gcd_D2_nat ~> dvd_gcdD2

1804 dvd_gcd_D2_int ~> dvd_gcdD2

1805 coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff

1806 coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff

1807 realpow_minus_mult ~> power_minus_mult

1808 realpow_Suc_le_self ~> power_Suc_le_self

1809 dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest

1810 INCOMPATIBILITY.

1812 * Renamed HOL/Quotient_Examples/FSet.thy to

1813 HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.

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

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

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

1818 "unbundle finfun_syntax" to imitate import of

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

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

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

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

1824 once.

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

1827 set_mset rather than count.

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

1830 by default.

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

1833 equations count_eq_zero_iff and not_in_iff.

1835 - Rules count_inI and in_countE obtain facts of the form

1836 "count M a = n" from membership.

1838 - Rules count_in_diffI and in_diff_countE obtain facts of the form

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

1841 INCOMPATIBILITY.

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

1844 displaying equations in functional programming style --- variables

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

1846 underscores.

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

1849 build partial equivalence relations from a predicate and an equivalence

1850 relation.

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

1853 everywhere fix bijections.

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

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

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

1858 denominator is normalized wrt. unit factors).

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

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

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

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

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

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

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

1870 principle, Residue theorem, Schwarz Lemma.

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

1873 polytopes, and the Krein–Milman Minkowski theorem.

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

1876 libraries: homeomorphisms, continuous function extensions, invariance of

1877 domain.

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

1880 changed from ereal to ennreal, INCOMPATIBILITY.

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

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

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

1886 Probability Mass Functions.

1888 * Session HOL-Probability: theory Random_Permutations contains some

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

1890 folding over a list in random order.

1892 * Session HOL-Probability: theory SPMF formalises discrete

1893 subprobability distributions.

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

1896 normalised to distinguish which ordering the theorems are about

1898 mset_less_eqI ~> mset_subset_eqI

1899 mset_less_insertD ~> mset_subset_insertD

1900 mset_less_eq_count ~> mset_subset_eq_count

1901 mset_less_diff_self ~> mset_subset_diff_self

1902 mset_le_exists_conv ~> mset_subset_eq_exists_conv

1903 mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel

1904 mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel

1905 mset_le_mono_add ~> mset_subset_eq_mono_add

1906 mset_le_add_left ~> mset_subset_eq_add_left

1907 mset_le_add_right ~> mset_subset_eq_add_right

1908 mset_le_single ~> mset_subset_eq_single

1909 mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute

1910 diff_le_self ~> diff_subset_eq_self

1911 mset_leD ~> mset_subset_eqD

1912 mset_lessD ~> mset_subsetD

1913 mset_le_insertD ~> mset_subset_eq_insertD

1914 mset_less_of_empty ~> mset_subset_of_empty

1915 mset_less_size ~> mset_subset_size

1916 wf_less_mset_rel ~> wf_subset_mset_rel

1917 count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq

1918 mset_remdups_le ~> mset_remdups_subset_eq

1919 ms_lesseq_impl ~> subset_eq_mset_impl

1921 Some functions have been renamed:

1922 ms_lesseq_impl -> subset_eq_mset_impl

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

1925 #\<subseteq># ~> \<le>

1926 #\<subset># ~> <

1927 le_multiset ~> less_eq_multiset

1928 less_multiset ~> le_multiset

1929 INCOMPATIBILITY.

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

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

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

1934 interpretations "multiset_linorder" and "multiset_wellorder" have been

1935 replaced by instantiations. INCOMPATIBILITY.

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

1938 been renamed:

1940 le_multiset_def ~> less_eq_multiset_def

1941 less_multiset_def ~> le_multiset_def

1942 less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset

1943 mult_less_not_refl ~> mset_le_not_refl

1944 mult_less_trans ~> mset_le_trans

1945 mult_less_not_sym ~> mset_le_not_sym

1946 mult_less_asym ~> mset_le_asym

1947 mult_less_irrefl ~> mset_le_irrefl

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

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

1951 le_multiset_total ~> less_eq_multiset_total

1952 less_multiset_right_total ~> subset_eq_imp_le_multiset

1953 le_multiset_empty_left ~> less_eq_multiset_empty_left

1954 le_multiset_empty_right ~> less_eq_multiset_empty_right

1955 less_multiset_empty_right ~> le_multiset_empty_left

1956 less_multiset_empty_left ~> le_multiset_empty_right

1957 union_less_diff_plus ~> union_le_diff_plus

1958 ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset

1959 less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty

1960 le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty

1961 INCOMPATIBILITY.

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

1964 INCOMPATIBILITY.

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

1967 INCOMPATIBILITY, use the following replacements:

1969 le_multiset_plus_plus_left_iff ~> add_less_cancel_right

1970 less_multiset_plus_plus_left_iff ~> add_less_cancel_right

1971 le_multiset_plus_plus_right_iff ~> add_less_cancel_left

1972 less_multiset_plus_plus_right_iff ~> add_less_cancel_left

1973 add_eq_self_empty_iff ~> add_cancel_left_right

1974 mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right

1975 mset_less_add_bothsides ~> subset_mset.add_less_cancel_right

1976 mset_le_add_bothsides ~> subset_mset.add_less_cancel_right

1977 empty_inter ~> subset_mset.inf_bot_left

1978 inter_empty ~> subset_mset.inf_bot_right

1979 empty_sup ~> subset_mset.sup_bot_left

1980 sup_empty ~> subset_mset.sup_bot_right

1981 bdd_below_multiset ~> subset_mset.bdd_above_bot

1982 subset_eq_empty ~> subset_mset.le_zero_eq

1983 le_empty ~> subset_mset.le_zero_eq

1984 mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

1985 mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

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

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

1989 additional typeclasses order_bot, no_top,

1990 ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,

1991 linordered_cancel_ab_semigroup_add, and

1992 ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.

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

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

1996 INCOMPATIBILITY.

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

1999 interpretations ordered_ab_semigroup_monoid_add_imp_le and

2000 bounded_lattice_bot. INCOMPATIBILITY.

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

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

2004 removed or changed:

2006 single_not_empty ~> add_mset_not_empty or empty_not_add_mset

2007 fold_mset_insert ~> fold_mset_add_mset

2008 image_mset_insert ~> image_mset_add_mset

2009 union_single_eq_diff

2010 multi_self_add_other_not_self

2011 diff_single_eq_union

2012 INCOMPATIBILITY.

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

2015 to use add_mset instead of single:

2017 mset_add

2018 multi_self_add_other_not_self

2019 diff_single_eq_union

2020 union_single_eq_diff

2021 union_single_eq_member

2022 add_eq_conv_diff

2023 insert_noteq_member

2024 add_eq_conv_ex

2025 multi_member_split

2026 multiset_add_sub_el_shuffle

2027 mset_subset_eq_insertD

2028 mset_subset_insertD

2029 insert_subset_eq_iff

2030 insert_union_subset_iff

2031 multi_psub_of_add_self

2032 inter_add_left1

2033 inter_add_left2

2034 inter_add_right1

2035 inter_add_right2

2036 sup_union_left1

2037 sup_union_left2

2038 sup_union_right1

2039 sup_union_right2

2040 size_eq_Suc_imp_eq_union

2041 multi_nonempty_split

2042 mset_insort

2043 mset_update

2044 mult1I

2045 less_add

2046 mset_zip_take_Cons_drop_twice

2047 rel_mset_Zero

2048 msed_map_invL

2049 msed_map_invR

2050 msed_rel_invL

2051 msed_rel_invR

2052 le_multiset_right_total

2053 multiset_induct

2054 multiset_induct2_size

2055 multiset_induct2

2056 INCOMPATIBILITY.

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

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

2060 element:

2062 image_mset

2063 mset

2064 replicate_mset

2065 mult1

2066 pred_mset

2067 rel_mset'

2068 mset_insort

2070 INCOMPATIBILITY.

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

2073 attributes of some multiset theorems have been changed:

2075 insert_DiffM [] ~> [simp]

2076 insert_DiffM2 [simp] ~> []

2077 diff_add_mset_swap [simp]

2078 fold_mset_add_mset [simp]

2079 diff_diff_add [simp] (for multisets only)

2080 diff_cancel [simp] ~> []

2081 count_single [simp] ~> []

2082 set_mset_single [simp] ~> []

2083 size_multiset_single [simp] ~> []

2084 size_single [simp] ~> []

2085 image_mset_single [simp] ~> []

2086 mset_subset_eq_mono_add_right_cancel [simp] ~> []

2087 mset_subset_eq_mono_add_left_cancel [simp] ~> []

2088 fold_mset_single [simp] ~> []

2089 subset_eq_empty [simp] ~> []

2090 empty_sup [simp] ~> []

2091 sup_empty [simp] ~> []

2092 inter_empty [simp] ~> []

2093 empty_inter [simp] ~> []

2094 INCOMPATIBILITY.

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

2097 the second cases of multiset_induct, multiset_induct2_size,

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

2099 INCOMPATIBILITY.

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

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

2103 natural numbers. INCOMPATIBILITY.

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

2106 multisets:

2108 msetsum ~> sum_mset

2109 msetprod ~> prod_mset

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

2112 and union of multisets have been changed:

2114 #\<inter> ~> \<inter>#

2115 #\<union> ~> \<union>#

2117 INCOMPATIBILITY.

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

2120 one_step_implies_mult_aux on multisets has been removed, use

2121 one_step_implies_mult instead. INCOMPATIBILITY.

2123 * Session HOL-Library: theory Complete_Partial_Order2 provides reasoning

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

2125 and about admissibility conditions for fixpoint inductions.

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

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

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

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

2131 future different type class instantiation for polynomials over factorial

2132 rings. INCOMPATIBILITY.

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

2135 the following renaming

2137 prefixeq -> prefix

2138 prefix -> strict_prefix

2139 suffixeq -> suffix

2140 suffix -> strict_suffix

2142 Added theory of longest common prefixes.

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

2145 Generalisation of predicate "prime" and introduction of predicates

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

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

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

2149 "prime_nat_iff". INCOMPATIBILITY.

2151 * Session Old_Number_Theory has been removed, after porting remaining

2152 theories.

2154 * Session HOL-Types_To_Sets provides an experimental extension of

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

2158 *** ML ***

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

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

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

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

2164 INCOMPATIBILITY.

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

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

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

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

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

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

2172 superseded by General.Div.

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

2175 the argument is a plain file. Minor INCOMPATIBILITY.

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

2178 with approximative output quality.

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

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

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

2184 This is particularly useful for conditional compilation, without

2185 requiring separate files.

2187 * Option ML_exception_debugger controls detailed exception trace via the

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

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

2190 debugger information requires consirable time and space: main

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

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

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

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

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

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

2198 balanced blocks of Local_Theory.open_target versus

2199 Local_Theory.close_target instead. Rare INCOMPATIBILITY.

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

2202 replaced by structure Timeout, with slightly different signature.

2203 INCOMPATIBILITY.

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

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

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

2208 File.full_path). Potential INCOMPATIBILITY.

2210 * Binding.empty_atts supersedes Thm.empty_binding and

2211 Attrib.empty_binding. Minor INCOMPATIBILITY.

2214 *** System ***

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

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

2219 much less disk space.

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

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

2223 particular:

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

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

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

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

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

2231 prover front-ends should use ML_Process or Isabelle_Process in

2232 Isabelle/Scala. INCOMPATIBILITY.

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

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

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

2237 return code 1.

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

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

2241 servers with separate CPU/memory modules.

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

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

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

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

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

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

2250 by default).

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

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

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

2255 resulting log files.

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

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

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

2260 implicit default via option -p.

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

2263 bootstrapping Isabelle/Pure interactively.

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

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

2267 Isabelle/ML or Isabelle/Scala.

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

2270 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,

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

2272 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been

2273 discontinued. Potential INCOMPATIBILITY.

2275 * The Isabelle system environment always ensures that the main

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

2277 "isabelle_scala_script".

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

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

2281 Isabelle_Tool.Body.

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

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

2285 produce robust shell scripts under program control, without worrying

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

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

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

2289 been discontinued.

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

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

2293 but without the Isabelle settings environment.

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

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

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

2298 that Path specifications need to be resolved remotely via

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

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

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

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

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

2305 connection).

2309 New in Isabelle2016 (February 2016)

2310 -----------------------------------

2312 *** General ***

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

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

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

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

2318 examples that do require HOL.

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

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

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

2324 without any special print mode. Important ASCII replacement syntax

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

2326 has been removed (see below).

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

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

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

2332 context has been discontinued. Rare INCOMPATIBILITY, use explicit

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

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

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

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

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

2339 meaning.

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

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

2343 to update old sources.

2345 * Toplevel theorem statements have been simplified as follows:

2347 theorems ~> lemmas

2348 schematic_lemma ~> schematic_goal

2349 schematic_theorem ~> schematic_goal

2350 schematic_corollary ~> schematic_goal

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

2353 accordingly.

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

2356 'theorem'.

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

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

2360 deferred definitions require a surrounding 'overloading' block.

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

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

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

2367 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

2368 'SML_file_no_debug' control compilation of sources with or without

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

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

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

2372 any effect on the running ML program.

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

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

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

2377 update.

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

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

2381 enable option "editor_output_state".

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

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

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

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

2387 visibility.

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

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

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

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

2393 panel.

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

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

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

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

2400 implicit: a popup will show up unconditionally.

2402 * Additional abbreviations for syntactic completion may be specified in

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

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

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

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

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

2409 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.

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

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

2413 the editor.

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

2416 instead of former C+e LEFT.

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

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

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

2421 instead.

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

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

2425 single-instance applications seen on common GUI desktops.

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

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

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

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

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

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

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

2438 *** Document preparation ***

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

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

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

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

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

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

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

2449 follows:

2451 \<^item> itemize

2452 \<^enum> enumerate

2453 \<^descr> description

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

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

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

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

2459 standard Isabelle fonts provide glyphs to render important control

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

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

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

2464 standard LaTeX macros of the same names.

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

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

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

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

2470 cartouche tokens seen in theory sources.

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

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

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

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

2476 or terminal spaces are ignored.

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

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

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

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

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

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

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

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

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

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

2492 documentation, with a hyperlink in the Prover IDE.

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

2495 entities of the Isar language.

2497 * HTML presentation uses the standard IsabelleText font and Unicode

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

2499 print mode "HTML" loses its special meaning.

2502 *** Isar ***

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

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

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

2507 example:

2509 have result: "C x y"

2510 if "A x" and "B y"

2511 for x :: 'a and y :: 'a

2512 <proof>

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

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

2516 corresponds to a raw proof block like this:

2518 {

2519 fix x :: 'a and y :: 'a

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

2521 have "C x y" <proof>

2522 }

2523 note result = this

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

2526 instead of 'assume' above.

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

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

2531 assume result: "C x y"

2532 if "A x" and "B y"

2533 for x :: 'a and y :: 'a

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

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

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

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

2540 example:

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

2544 is equivalent to:

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

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

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

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

2551 follows:

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

2555 or:

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

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

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

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

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

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

2566 of the local context elements yet.

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

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

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

2572 then have something

2573 proof cases

2574 case a

2575 then show ?thesis <proof>

2576 next

2577 case b

2578 then show ?thesis <proof>

2579 next

2580 case c

2581 then show ?thesis <proof>

2582 qed

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

2586 case a: (c xs)

2587 case a [attributes]: (c xs)

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

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

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

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

2593 and always put attributes in front.

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

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

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

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

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

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

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

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

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

2606 supply [simp] = a

2607 proof

2608 show A by simp

2609 next

2610 show A by simp

2611 qed

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

2614 proof body as well, abstracted over relevant parameters.

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

2617 parameter scope for of each clause.

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

2620 statements: result is abstracted over unknowns.

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

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

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

2625 manual.

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

2628 ('apply' scripts).

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

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

2632 example:

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

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

2636 proof goal_cases

2637 case (1 x)

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

2639 next

2640 case (2 y z)

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

2642 qed

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

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

2646 proof goal_cases

2647 case prems: 1

2648 then show ?case using prems sorry

2649 next

2650 case prems: 2

2651 then show ?case using prems sorry

2652 qed

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

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

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

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

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

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

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

2663 occasionally useful for demonstration and testing purposes.

2666 *** Pure ***

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

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

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

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

2673 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

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

2676 * More gentle suppression of syntax along locale morphisms while

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

2678 would be suppressed for morphisms except term identity. Now

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

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

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

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

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

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

2686 begin

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

2688 end

2690 locale morphism =

2691 left: struct composition + right: struct composition'

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

2693 begin

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

2695 end

2697 * Command 'global_interpretation' issues interpretations into global

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

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

2701 'defines'.

2703 * Command 'permanent_interpretation' has been discontinued. Use

2704 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

2706 * Command 'print_definitions' prints dependencies of definitional

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

2709 * Configuration option rule_insts_schematic has been discontinued

2710 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

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

2713 INCOMPATIBILITY in situations where the previous misbehaviour has been

2714 exploited.

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

2717 operations behave more similar to abbreviations. Potential

2718 INCOMPATIBILITY in exotic situations.

2721 *** HOL ***

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

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

2725 global collection of overloaded constant / type definitions into

2726 account. Type definitions with open dependencies on overloaded

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

2728 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

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

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

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

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

2734 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

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

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

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

2739 simplify porting old theories:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

2768 INCOMPATIBILITY, use plain "::" instead.

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

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

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

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

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

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

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

2778 definition and its monotonicity result. Rare INCOMPATIBILITY.

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

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

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

2783 also subject to "inductive_internals". Rare INCOMPATIBILITY.

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

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

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

2788 INCOMPATIBILITY.

2790 * Combinator to represent case distinction on products is named

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

2792 theorem aliasses have been retained.

2794 Consolidated facts:

2795 PairE ~> prod.exhaust

2796 Pair_eq ~> prod.inject

2797 pair_collapse ~> prod.collapse

2798 Pair_fst_snd_eq ~> prod_eq_iff

2799 split_twice ~> prod.case_distrib

2800 split_weak_cong ~> prod.case_cong_weak

2801 split_split ~> prod.split

2802 split_split_asm ~> prod.split_asm

2803 splitI ~> case_prodI

2804 splitD ~> case_prodD

2805 splitI2 ~> case_prodI2

2806 splitI2' ~> case_prodI2'

2807 splitE ~> case_prodE

2808 splitE' ~> case_prodE'

2809 split_pair ~> case_prod_Pair

2810 split_eta ~> case_prod_eta

2811 split_comp ~> case_prod_comp

2812 mem_splitI ~> mem_case_prodI

2813 mem_splitI2 ~> mem_case_prodI2

2814 mem_splitE ~> mem_case_prodE

2815 The_split ~> The_case_prod

2816 cond_split_eta ~> cond_case_prod_eta

2817 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

2818 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

2819 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

2820 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

2821 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

2822 Domain_Collect_split ~> Domain_Collect_case_prod

2823 Image_Collect_split ~> Image_Collect_case_prod

2824 Range_Collect_split ~> Range_Collect_case_prod

2825 Eps_split ~> Eps_case_prod

2826 Eps_split_eq ~> Eps_case_prod_eq

2827 split_rsp ~> case_prod_rsp

2828 curry_split ~> curry_case_prod

2829 split_curry ~> case_prod_curry

2831 Changes in structure HOLogic:

2832 split_const ~> case_prod_const

2833 mk_split ~> mk_case_prod

2834 mk_psplits ~> mk_ptupleabs

2835 strip_psplits ~> strip_ptupleabs

2837 INCOMPATIBILITY.

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

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

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

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

2843 have been replaced by 'real_of_ereal' and 'real_of_float'.

2845 Consolidated facts (among others):

2846 real_of_nat_le_iff -> of_nat_le_iff

2847 real_of_nat_numeral of_nat_numeral

2848 real_of_int_zero of_int_0

2849 real_of_nat_zero of_nat_0

2850 real_of_one of_int_1

2851 real_of_int_add of_int_add

2852 real_of_nat_add of_nat_add

2853 real_of_int_diff of_int_diff

2854 real_of_nat_diff of_nat_diff

2855 floor_subtract floor_diff_of_int

2856 real_of_int_inject of_int_eq_iff

2857 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

2858 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

2859 real_of_nat_ge_zero of_nat_0_le_iff

2860 real_of_int_ceiling_ge le_of_int_ceiling

2861 ceiling_less_eq ceiling_less_iff

2862 ceiling_le_eq ceiling_le_iff

2863 less_floor_eq less_floor_iff

2864 floor_less_eq floor_less_iff

2865 floor_divide_eq_div floor_divide_of_int_eq

2866 real_of_int_zero_cancel of_nat_eq_0_iff

2867 ceiling_real_of_int ceiling_of_int

2869 INCOMPATIBILITY.

2871 * Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has

2872 been removed. INCOMPATIBILITY.

2874 * Quickcheck setup for finite sets.

2876 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

2878 * Sledgehammer:

2879 - The MaSh relevance filter has been sped up.

2880 - Proof reconstruction has been improved, to minimize the incidence of

2881 cases where Sledgehammer gives a proof that does not work.

2882 - Auto Sledgehammer now minimizes and preplays the results.

2883 - Handle Vampire 4.0 proof output without raising exception.

2884 - Eliminated "MASH" environment variable. Use the "MaSh" option in

2885 Isabelle/jEdit instead. INCOMPATIBILITY.

2886 - Eliminated obsolete "blocking" option and related subcommands.

2888 * Nitpick:

2889 - Fixed soundness bug in translation of "finite" predicate.

2890 - Fixed soundness bug in "destroy_constrs" optimization.

2891 - Fixed soundness bug in translation of "rat" type.

2892 - Removed "check_potential" and "check_genuine" options.

2893 - Eliminated obsolete "blocking" option.

2895 * (Co)datatype package:

2896 - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF

2897 structure on the raw type to an abstract type defined using typedef.

2898 - Always generate "case_transfer" theorem.

2899 - For mutual types, generate slightly stronger "rel_induct",

2900 "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.

2901 - Allow discriminators and selectors with the same name as the type

2902 being defined.

2903 - Avoid various internal name clashes (e.g., 'datatype f = f').

2905 * Transfer: new methods for interactive debugging of 'transfer' and

2906 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

2907 'transfer_prover_start' and 'transfer_prover_end'.

2909 * New diagnostic command print_record for displaying record definitions.

2911 * Division on integers is bootstrapped directly from division on

2912 naturals and uses generic numeral algorithm for computations. Slight

2913 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

2914 simprocs binary_int_div and binary_int_mod

2916 * Tightened specification of class semiring_no_zero_divisors. Minor

2917 INCOMPATIBILITY.

2919 * Class algebraic_semidom introduces common algebraic notions of

2920 integral (semi)domains, particularly units. Although logically subsumed

2921 by fields, is is not a super class of these in order not to burden

2922 fields with notions that are trivial there.

2924 * Class normalization_semidom specifies canonical representants for

2925 equivalence classes of associated elements in an integral (semi)domain.

2926 This formalizes associated elements as well.

2928 * Abstract specification of gcd/lcm operations in classes semiring_gcd,

2929 semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute

2930 and gcd_int.commute are subsumed by gcd.commute, as well as

2931 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

2933 * Former constants Fields.divide (_ / _) and Divides.div (_ div _) are

2934 logically unified to Rings.divide in syntactic type class Rings.divide,

2935 with infix syntax (_ div _). Infix syntax (_ / _) for field division is

2936 added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,

2937 instantiations must refer to Rings.divide rather than the former

2938 separate constants, hence infix syntax (_ / _) is usually not available

2939 during instantiation.

2941 * New cancellation simprocs for boolean algebras to cancel complementary

2942 terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to

2943 "top". INCOMPATIBILITY.

2945 * Class uniform_space introduces uniform spaces btw topological spaces

2946 and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be

2947 introduced in the form of an uniformity. Some constants are more general

2948 now, it may be necessary to add type class constraints.

2950 open_real_def \<leadsto> open_dist

2951 open_complex_def \<leadsto> open_dist

2953 * Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.

2955 * Library/Multiset:

2956 - Renamed multiset inclusion operators:

2957 < ~> <#

2958 > ~> >#

2959 <= ~> <=#

2960 >= ~> >=#

2961 \<le> ~> \<le>#

2962 \<ge> ~> \<ge>#

2963 INCOMPATIBILITY.

2964 - Added multiset inclusion operator syntax:

2965 \<subset>#

2966 \<subseteq>#

2967 \<supset>#

2968 \<supseteq>#

2969 - "'a multiset" is no longer an instance of the "order",

2970 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

2971 "semilattice_inf", and "semilattice_sup" type classes. The theorems

2972 previously provided by these type classes (directly or indirectly)

2973 are now available through the "subset_mset" interpretation

2974 (e.g. add_mono ~> subset_mset.add_mono).

2975 INCOMPATIBILITY.

2976 - Renamed conversions:

2977 multiset_of ~> mset

2978 multiset_of_set ~> mset_set

2979 set_of ~> set_mset

2980 INCOMPATIBILITY

2981 - Renamed lemmas:

2982 mset_le_def ~> subseteq_mset_def

2983 mset_less_def ~> subset_mset_def

2984 less_eq_multiset.rep_eq ~> subseteq_mset_def

2985 INCOMPATIBILITY

2986 - Removed lemmas generated by lift_definition:

2987 less_eq_multiset.abs_eq, less_eq_multiset.rsp,

2988 less_eq_multiset.transfer, less_eq_multiset_def

2989 INCOMPATIBILITY

2991 * Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.

2993 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

2994 Bourbaki-Witt fixpoint theorem for increasing functions in

2995 chain-complete partial orders.

2997 * Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.

2998 Minor INCOMPATIBILITY, use 'function' instead.

3000 * Library/Periodic_Fun: a locale that provides convenient lemmas for

3001 periodic functions.

3003 * Library/Formal_Power_Series: proper definition of division (with

3004 remainder) for formal power series; instances for Euclidean Ring and

3005 GCD.

3007 * HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.

3009 * HOL-Statespace: command 'statespace' uses mandatory qualifier for

3010 import of parent, as for general 'locale' expressions. INCOMPATIBILITY,

3011 remove '!' and add '?' as required.

3013 * HOL-Decision_Procs: The "approximation" method works with "powr"

3014 (exponentiation on real numbers) again.

3016 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

3017 integrals (= complex path integrals), Cauchy's integral theorem, winding

3018 numbers and Cauchy's integral formula, Liouville theorem, Fundamental

3019 Theorem of Algebra. Ported from HOL Light.

3021 * HOL-Multivariate_Analysis: topological concepts such as connected

3022 components, homotopic paths and the inside or outside of a set.

3024 * HOL-Multivariate_Analysis: radius of convergence of power series and

3025 various summability tests; Harmonic numbers and the Euler–Mascheroni

3026 constant; the Generalised Binomial Theorem; the complex and real

3027 Gamma/log-Gamma/Digamma/ Polygamma functions and their most important

3028 properties.

3030 * HOL-Probability: The central limit theorem based on Levy's uniqueness

3031 and continuity theorems, weak convergence, and characterisitc functions.

3033 * HOL-Data_Structures: new and growing session of standard data

3034 structures.

3037 *** ML ***

3039 * The following combinators for low-level profiling of the ML runtime

3040 system are available:

3042 profile_time (*CPU time*)

3043 profile_time_thread (*CPU time on this thread*)

3044 profile_allocations (*overall heap allocations*)

3046 * Antiquotation @{undefined} or \<^undefined> inlines (raise Match).

3048 * Antiquotation @{method NAME} inlines the (checked) name of the given

3049 Isar proof method.

3051 * Pretty printing of Poly/ML compiler output in Isabelle has been

3052 improved: proper treatment of break offsets and blocks with consistent

3053 breaks.

3055 * The auxiliary module Pure/display.ML has been eliminated. Its

3056 elementary thm print operations are now in Pure/more_thm.ML and thus

3057 called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.

3059 * Simproc programming interfaces have been simplified:

3060 Simplifier.make_simproc and Simplifier.define_simproc supersede various

3061 forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that

3062 term patterns for the left-hand sides are specified with implicitly

3063 fixed variables, like top-level theorem statements. INCOMPATIBILITY.

3065 * Instantiation rules have been re-organized as follows:

3067 Thm.instantiate (*low-level instantiation with named arguments*)

3068 Thm.instantiate' (*version with positional arguments*)

3070 Drule.infer_instantiate (*instantiation with type inference*)

3071 Drule.infer_instantiate' (*version with positional arguments*)

3073 The LHS only requires variable specifications, instead of full terms.

3074 Old cterm_instantiate is superseded by infer_instantiate.

3075 INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.

3077 * Old tactic shorthands atac, rtac, etac, dtac, ftac have been

3078 discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.

3079 instead (with proper context).

3081 * Thm.instantiate (and derivatives) no longer require the LHS of the

3082 instantiation to be certified: plain variables are given directly.

3084 * Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous

3085 quasi-bound variables (like the Simplifier), instead of accidentally

3086 named local fixes. This has the potential to improve stability of proof

3087 tools, but can also cause INCOMPATIBILITY for tools that don't observe

3088 the proof context discipline.

3090 * Isar proof methods are based on a slightly more general type

3091 context_tactic, which allows to change the proof context dynamically

3092 (e.g. to update cases) and indicate explicit Seq.Error results. Former

3093 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

3094 provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.

3097 *** System ***

3099 * Command-line tool "isabelle console" enables print mode "ASCII".

3101 * Command-line tool "isabelle update_then" expands old Isar command

3102 conflations:

3104 hence ~> then have

3105 thus ~> then show

3107 This syntax is more orthogonal and improves readability and

3108 maintainability of proofs.

3110 * Global session timeout is multiplied by timeout_scale factor. This

3111 allows to adjust large-scale tests (e.g. AFP) to overall hardware

3112 performance.

3114 * Property values in etc/symbols may contain spaces, if written with the

3115 replacement character "␣" (Unicode point 0x2324). For example:

3117 \<star> code: 0x0022c6 group: operator font: Deja␣Vu␣Sans␣Mono

3119 * Java runtime environment for x86_64-windows allows to use larger heap

3120 space.

3122 * Java runtime options are determined separately for 32bit vs. 64bit

3123 platforms as follows.

3125 - Isabelle desktop application: platform-specific files that are

3126 associated with the main app bundle

3128 - isabelle jedit: settings

3129 JEDIT_JAVA_SYSTEM_OPTIONS

3130 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

3132 - isabelle build: settings

3133 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

3135 * Bash shell function "jvmpath" has been renamed to "platform_path": it

3136 is relevant both for Poly/ML and JVM processes.

3138 * Poly/ML default platform architecture may be changed from 32bit to

3139 64bit via system option ML_system_64. A system restart (and rebuild) is

3140 required after change.

3142 * Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which

3143 both allow larger heap space than former x86-cygwin.

3145 * Heap images are 10-15% smaller due to less wasteful persistent theory

3146 content (using ML type theory_id instead of theory);

3150 New in Isabelle2015 (May 2015)

3151 ------------------------------

3153 *** General ***

3155 * Local theory specification commands may have a 'private' or

3156 'qualified' modifier to restrict name space accesses to the local scope,

3157 as provided by some "context begin ... end" block. For example:

3159 context

3160 begin

3162 private definition ...

3163 private lemma ...

3165 qualified definition ...

3166 qualified lemma ...

3168 lemma ...

3169 theorem ...

3171 end

3173 * Command 'experiment' opens an anonymous locale context with private

3174 naming policy.

3176 * Command 'notepad' requires proper nesting of begin/end and its proof

3177 structure in the body: 'oops' is no longer supported here. Minor

3178 INCOMPATIBILITY, use 'sorry' instead.

3180 * Command 'named_theorems' declares a dynamic fact within the context,

3181 together with an attribute to maintain the content incrementally. This

3182 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change

3183 of semantics due to external visual order vs. internal reverse order.

3185 * 'find_theorems': search patterns which are abstractions are

3186 schematically expanded before search. Search results match the naive

3187 expectation more closely, particularly wrt. abbreviations.

3188 INCOMPATIBILITY.

3190 * Commands 'method_setup' and 'attribute_setup' now work within a local

3191 theory context.

3193 * Outer syntax commands are managed authentically within the theory

3194 context, without implicit global state. Potential for accidental

3195 INCOMPATIBILITY, make sure that required theories are really imported.

3197 * Historical command-line terminator ";" is no longer accepted (and

3198 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle

3199 update_semicolons" to remove obsolete semicolons from old theory

3200 sources.

3202 * Structural composition of proof methods (meth1; meth2) in Isar

3203 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

3205 * The Eisbach proof method language allows to define new proof methods

3206 by combining existing ones with their usual syntax. The "match" proof

3207 method provides basic fact/term matching in addition to

3208 premise/conclusion matching through Subgoal.focus, and binds fact names

3209 from matches as well as term patterns within matches. The Isabelle

3210 documentation provides an entry "eisbach" for the Eisbach User Manual.

3211 Sources and various examples are in ~~/src/HOL/Eisbach/.

3214 *** Prover IDE -- Isabelle/Scala/jEdit ***

3216 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,

3217 the "sidekick" mode may be used for document structure.

3219 * Extended bracket matching based on Isar language structure. System

3220 option jedit_structure_limit determines maximum number of lines to scan

3221 in the buffer.

3223 * Support for BibTeX files: context menu, context-sensitive token

3224 marker, SideKick parser.

3226 * Document antiquotation @{cite} provides formal markup, which is

3227 interpreted semi-formally based on .bib files that happen to be open in

3228 the editor (hyperlinks, completion etc.).

3230 * Less waste of vertical space via negative line spacing (see Global

3231 Options / Text Area).

3233 * Improved graphview panel with optional output of PNG or PDF, for

3234 display of 'thy_deps', 'class_deps' etc.

3236 * The commands 'thy_deps' and 'class_deps' allow optional bounds to

3237 restrict the visualized hierarchy.

3239 * Improved scheduling for asynchronous print commands (e.g. provers

3240 managed by the Sledgehammer panel) wrt. ongoing document processing.

3243 *** Document preparation ***

3245 * Document markup commands 'chapter', 'section', 'subsection',

3246 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any

3247 context, even before the initial 'theory' command. Obsolete proof

3248 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been

3249 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'

3250 instead. The old 'header' command is still retained for some time, but

3251 should be replaced by 'chapter', 'section' etc. (using "isabelle

3252 update_header"). Minor INCOMPATIBILITY.

3254 * Official support for "tt" style variants, via \isatt{...} or

3255 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or

3256 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.

3257 as argument to other macros (such as footnotes).

3259 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"

3260 style.

3262 * Discontinued obsolete option "document_graph": session_graph.pdf is

3263 produced unconditionally for HTML browser_info and PDF-LaTeX document.

3265 * Diagnostic commands and document markup commands within a proof do not

3266 affect the command tag for output. Thus commands like 'thm' are subject

3267 to proof document structure, and no longer "stick out" accidentally.

3268 Commands 'text' and 'txt' merely differ in the LaTeX style, not their

3269 tags. Potential INCOMPATIBILITY in exotic situations.

3271 * System option "pretty_margin" is superseded by "thy_output_margin",

3272 which is also accessible via document antiquotation option "margin".

3273 Only the margin for document output may be changed, but not the global

3274 pretty printing: that is 76 for plain console output, and adapted

3275 dynamically in GUI front-ends. Implementations of document

3276 antiquotations need to observe the margin explicitly according to

3277 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

3279 * Specification of 'document_files' in the session ROOT file is

3280 mandatory for document preparation. The legacy mode with implicit

3281 copying of the document/ directory is no longer supported. Minor

3282 INCOMPATIBILITY.

3285 *** Pure ***

3287 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"

3288 etc.) allow an optional context of local variables ('for' declaration):

3289 these variables become schematic in the instantiated theorem; this

3290 behaviour is analogous to 'for' in attributes "where" and "of".

3291 Configuration option rule_insts_schematic (default false) controls use

3292 of schematic variables outside the context. Minor INCOMPATIBILITY,

3293 declare rule_insts_schematic = true temporarily and update to use local

3294 variable declarations or dummy patterns instead.

3296 * Explicit instantiation via attributes "where", "of", and proof methods

3297 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns

3298 ("_") that stand for anonymous local variables.

3300 * Generated schematic variables in standard format of exported facts are

3301 incremented to avoid material in the proof context. Rare

3302 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

3303 different index.

3305 * Lexical separation of signed and unsigned numerals: categories "num"

3306 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence

3307 of numeral signs, particularly in expressions involving infix syntax

3308 like "(- 1) ^ n".

3310 * Old inner token category "xnum" has been discontinued. Potential

3311 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"

3312 token category instead.

3315 *** HOL ***

3317 * New (co)datatype package:

3318 - The 'datatype_new' command has been renamed 'datatype'. The old

3319 command of that name is now called 'old_datatype' and is provided

3320 by "~~/src/HOL/Library/Old_Datatype.thy". See

3321 'isabelle doc datatypes' for information on porting.

3322 INCOMPATIBILITY.

3323 - Renamed theorems:

3324 disc_corec ~> corec_disc

3325 disc_corec_iff ~> corec_disc_iff

3326 disc_exclude ~> distinct_disc

3327 disc_exhaust ~> exhaust_disc

3328 disc_map_iff ~> map_disc_iff

3329 sel_corec ~> corec_sel

3330 sel_exhaust ~> exhaust_sel

3331 sel_map ~> map_sel

3332 sel_set ~> set_sel

3333 sel_split ~> split_sel

3334 sel_split_asm ~> split_sel_asm

3335 strong_coinduct ~> coinduct_strong

3336 weak_case_cong ~> case_cong_weak

3337 INCOMPATIBILITY.

3338 - The "no_code" option to "free_constructors", "datatype_new", and

3339 "codatatype" has been renamed "plugins del: code".

3340 INCOMPATIBILITY.

3341 - The rules "set_empty" have been removed. They are easy

3342 consequences of other set rules "by auto".

3343 INCOMPATIBILITY.

3344 - The rule "set_cases" is now registered with the "[cases set]"

3345 attribute. This can influence the behavior of the "cases" proof

3346 method when more than one case rule is applicable (e.g., an

3347 assumption is of the form "w : set ws" and the method "cases w"

3348 is invoked). The solution is to specify the case rule explicitly

3349 (e.g. "cases w rule: widget.exhaust").

3350 INCOMPATIBILITY.

3351 - Renamed theories:

3352 BNF_Comp ~> BNF_Composition

3353 BNF_FP_Base ~> BNF_Fixpoint_Base

3354 BNF_GFP ~> BNF_Greatest_Fixpoint

3355 BNF_LFP ~> BNF_Least_Fixpoint

3356 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

3357 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

3358 INCOMPATIBILITY.

3359 - Lifting and Transfer setup for basic HOL types sum and prod (also

3360 option) is now performed by the BNF package. Theories Lifting_Sum,

3361 Lifting_Product and Lifting_Option from Main became obsolete and

3362 were removed. Changed definitions of the relators rel_prod and

3363 rel_sum (using inductive).

3364 INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead

3365 of rel_prod_def and rel_sum_def.

3366 Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names

3367 changed (e.g. map_prod_transfer ~> prod.map_transfer).

3368 - Parametricity theorems for map functions, relators, set functions,

3369 constructors, case combinators, discriminators, selectors and

3370 (co)recursors are automatically proved and registered as transfer

3371 rules.

3373 * Old datatype package:

3374 - The old 'datatype' command has been renamed 'old_datatype', and

3375 'rep_datatype' has been renamed 'old_rep_datatype'. They are

3376 provided by "~~/src/HOL/Library/Old_Datatype.thy". See

3377 'isabelle doc datatypes' for information on porting.

3378 INCOMPATIBILITY.

3379 - Renamed theorems:

3380 weak_case_cong ~> case_cong_weak

3381 INCOMPATIBILITY.

3382 - Renamed theory:

3383 ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy

3384 INCOMPATIBILITY.

3386 * Nitpick:

3387 - Fixed soundness bug related to the strict and non-strict subset

3388 operations.

3390 * Sledgehammer:

3391 - CVC4 is now included with Isabelle instead of CVC3 and run by

3392 default.

3393 - Z3 is now always enabled by default, now that it is fully open

3394 source. The "z3_non_commercial" option is discontinued.

3395 - Minimization is now always enabled by default.

3396 Removed sub-command:

3397 min

3398 - Proof reconstruction, both one-liners and Isar, has been

3399 dramatically improved.

3400 - Improved support for CVC4 and veriT.

3402 * Old and new SMT modules:

3403 - The old 'smt' method has been renamed 'old_smt' and moved to

3404 'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,

3405 until applications have been ported to use the new 'smt' method. For

3406 the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must

3407 be installed, and the environment variable "OLD_Z3_SOLVER" must

3408 point to it.

3409 INCOMPATIBILITY.

3410 - The 'smt2' method has been renamed 'smt'.

3411 INCOMPATIBILITY.

3412 - New option 'smt_reconstruction_step_timeout' to limit the

3413 reconstruction time of Z3 proof steps in the new 'smt' method.

3414 - New option 'smt_statistics' to display statistics of the new 'smt'

3415 method, especially runtime statistics of Z3 proof reconstruction.

3417 * Lifting: command 'lift_definition' allows to execute lifted constants

3418 that have as a return type a datatype containing a subtype. This

3419 overcomes long-time limitations in the area of code generation and

3420 lifting, and avoids tedious workarounds.

3422 * Command and antiquotation "value" provide different evaluation slots

3423 (again), where the previous strategy (NBE after ML) serves as default.

3424 Minor INCOMPATIBILITY.

3426 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.

3428 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid

3429 non-termination in case of distributing a division. With this change

3430 field_simps is in some cases slightly less powerful, if it fails try to

3431 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

3433 * Separate class no_zero_divisors has been given up in favour of fully

3434 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

3436 * Class linordered_semidom really requires no zero divisors.

3437 INCOMPATIBILITY.

3439 * Classes division_ring, field and linordered_field always demand

3440 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,

3441 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

3443 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

3444 additive inverse operation. INCOMPATIBILITY.

3446 * Complex powers and square roots. The functions "ln" and "powr" are now

3447 overloaded for types real and complex, and 0 powr y = 0 by definition.

3448 INCOMPATIBILITY: type constraints may be necessary.

3450 * The functions "sin" and "cos" are now defined for any type of sort

3451 "{real_normed_algebra_1,banach}" type, so in particular on "real" and

3452 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be

3453 needed.

3455 * New library of properties of the complex transcendental functions sin,

3456 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.

3458 * The factorial function, "fact", now has type "nat => 'a" (of a sort

3459 that admits numeric types including nat, int, real and complex.

3460 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type

3461 constraint, and the combination "real (fact k)" is likely to be

3462 unsatisfactory. If a type conversion is still necessary, then use

3463 "of_nat (fact k)" or "real_of_nat (fact k)".

3465 * Removed functions "natfloor" and "natceiling", use "nat o floor" and

3466 "nat o ceiling" instead. A few of the lemmas have been retained and

3467 adapted: in their names "natfloor"/"natceiling" has been replaced by

3468 "nat_floor"/"nat_ceiling".

3470 * Qualified some duplicated fact names required for boostrapping the

3471 type class hierarchy:

3472 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

3473 field_inverse_zero ~> inverse_zero

3474 field_divide_inverse ~> divide_inverse

3475 field_inverse ~> left_inverse

3476 Minor INCOMPATIBILITY.

3478 * Eliminated fact duplicates:

3479 mult_less_imp_less_right ~> mult_right_less_imp_less

3480 mult_less_imp_less_left ~> mult_left_less_imp_less

3481 Minor INCOMPATIBILITY.

3483 * Fact consolidation: even_less_0_iff is subsumed by

3484 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

3486 * Generalized and consolidated some theorems concerning divsibility:

3487 dvd_reduce ~> dvd_add_triv_right_iff

3488 dvd_plus_eq_right ~> dvd_add_right_iff

3489 dvd_plus_eq_left ~> dvd_add_left_iff

3490 Minor INCOMPATIBILITY.

3492 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"

3493 and part of theory Main.

3494 even_def ~> even_iff_mod_2_eq_zero

3495 INCOMPATIBILITY.

3497 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor

3498 INCOMPATIBILITY.

3500 * Bootstrap of listsum as special case of abstract product over lists.

3501 Fact rename:

3502 listsum_def ~> listsum.eq_foldr

3503 INCOMPATIBILITY.

3505 * Product over lists via constant "listprod".

3507 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

3508 Cons_nth_drop_Suc.

3510 * New infrastructure for compiling, running, evaluating and testing

3511 generated code in target languages in HOL/Library/Code_Test. See

3512 HOL/Codegenerator_Test/Code_Test* for examples.

3514 * Library/Multiset:

3515 - Introduced "replicate_mset" operation.

3516 - Introduced alternative characterizations of the multiset ordering in

3517 "Library/Multiset_Order".

3518 - Renamed multiset ordering:

3519 <# ~> #<#

3520 <=# ~> #<=#

3521 \<subset># ~> #\<subset>#

3522 \<subseteq># ~> #\<subseteq>#

3523 INCOMPATIBILITY.

3524 - Introduced abbreviations for ill-named multiset operations:

3525 <#, \<subset># abbreviate < (strict subset)

3526 <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)

3527 INCOMPATIBILITY.

3528 - Renamed

3529 in_multiset_of ~> in_multiset_in_set

3530 Multiset.fold ~> fold_mset

3531 Multiset.filter ~> filter_mset

3532 INCOMPATIBILITY.

3533 - Removed mcard, is equal to size.

3534 - Added attributes:

3535 image_mset.id [simp]

3536 image_mset_id [simp]

3537 elem_multiset_of_set [simp, intro]

3538 comp_fun_commute_plus_mset [simp]

3539 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

3540 in_mset_fold_plus_iff [iff]

3541 set_of_Union_mset [simp]

3542 in_Union_mset_iff [iff]

3543 INCOMPATIBILITY.

3545 * Library/Sum_of_Squares: simplified and improved "sos" method. Always

3546 use local CSDP executable, which is much faster than the NEOS server.

3547 The "sos_cert" functionality is invoked as "sos" with additional

3548 argument. Minor INCOMPATIBILITY.

3550 * HOL-Decision_Procs: New counterexample generator quickcheck

3551 [approximation] for inequalities of transcendental functions. Uses

3552 hardware floating point arithmetic to randomly discover potential

3553 counterexamples. Counterexamples are certified with the "approximation"

3554 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for

3555 examples.

3557 * HOL-Probability: Reworked measurability prover

3558 - applies destructor rules repeatedly

3559 - removed application splitting (replaced by destructor rule)

3560 - added congruence rules to rewrite measure spaces under the sets

3561 projection

3563 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for

3564 single-step rewriting with subterm selection based on patterns.

3567 *** ML ***

3569 * Subtle change of name space policy: undeclared entries are now

3570 considered inaccessible, instead of accessible via the fully-qualified

3571 internal name. This mainly affects Name_Space.intern (and derivatives),

3572 which may produce an unexpected Long_Name.hidden prefix. Note that

3573 contemporary applications use the strict Name_Space.check (and

3574 derivatives) instead, which is not affected by the change. Potential

3575 INCOMPATIBILITY in rare applications of Name_Space.intern.

3577 * Subtle change of error semantics of Toplevel.proof_of: regular user

3578 ERROR instead of internal Toplevel.UNDEF.

3580 * Basic combinators map, fold, fold_map, split_list, apply are available

3581 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.

3583 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.

3584 INCOMPATIBILITY.

3586 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

3587 sections have been discontinued, in favour of the more elementary

3588 Multithreading.synchronized and its high-level derivative

3589 Synchronized.var (which is usually sufficient in applications). Subtle

3590 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be

3591 nested.

3593 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle

3594 change of semantics with minimal potential for INCOMPATIBILITY.

3596 * The main operations to certify logical entities are Thm.ctyp_of and

3597 Thm.cterm_of with a local context; old-style global theory variants are

3598 available as Thm.global_ctyp_of and Thm.global_cterm_of.

3599 INCOMPATIBILITY.

3601 * Elementary operations in module Thm are no longer pervasive.

3602 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,

3603 Thm.term_of etc.

3605 * Proper context for various elementary tactics: assume_tac,

3606 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

3607 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

3609 * Tactical PARALLEL_ALLGOALS is the most common way to refer to

3610 PARALLEL_GOALS.

3612 * Goal.prove_multi is superseded by the fully general Goal.prove_common,

3613 which also allows to specify a fork priority.

3615 * Antiquotation @{command_spec "COMMAND"} is superseded by

3616 @{command_keyword COMMAND} (usually without quotes and with PIDE

3617 markup). Minor INCOMPATIBILITY.

3619 * Cartouches within ML sources are turned into values of type

3620 Input.source (with formal position information).

3623 *** System ***

3625 * The Isabelle tool "update_cartouches" changes theory files to use

3626 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.

3628 * The Isabelle tool "build" provides new options -X, -k, -x.

3630 * Discontinued old-fashioned "codegen" tool. Code generation can always

3631 be externally triggered using an appropriate ROOT file plus a

3632 corresponding theory. Parametrization is possible using environment

3633 variables, or ML snippets in the most extreme cases. Minor

3634 INCOMPATIBILITY.

3636 * JVM system property "isabelle.threads" determines size of Scala thread

3637 pool, like Isabelle system option "threads" for ML.

3639 * JVM system property "isabelle.laf" determines the default Swing

3640 look-and-feel, via internal class name or symbolic name as in the jEdit

3641 menu Global Options / Appearance.

3643 * Support for Proof General and Isar TTY loop has been discontinued.

3644 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

3648 New in Isabelle2014 (August 2014)

3649 ---------------------------------

3651 *** General ***

3653 * Support for official Standard ML within the Isabelle context.

3654 Command 'SML_file' reads and evaluates the given Standard ML file.

3655 Toplevel bindings are stored within the theory context; the initial

3656 environment is restricted to the Standard ML implementation of

3657 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'

3658 and 'SML_export' allow to exchange toplevel bindings between the two

3659 separate environments. See also ~~/src/Tools/SML/Examples.thy for

3660 some examples.

3662 * Standard tactics and proof methods such as "clarsimp", "auto" and

3663 "safe" now preserve equality hypotheses "x = expr" where x is a free

3664 variable. Locale assumptions and chained facts containing "x"

3665 continue to be useful. The new method "hypsubst_thin" and the

3666 configuration option "hypsubst_thin" (within the attribute name space)

3667 restore the previous behavior. INCOMPATIBILITY, especially where

3668 induction is done after these methods or when the names of free and

3669 bound variables clash. As first approximation, old proofs may be

3670 repaired by "using [[hypsubst_thin = true]]" in the critical spot.

3672 * More static checking of proof methods, which allows the system to

3673 form a closure over the concrete syntax. Method arguments should be

3674 processed in the original proof context as far as possible, before

3675 operating on the goal state. In any case, the standard discipline for

3676 subgoal-addressing needs to be observed: no subgoals or a subgoal

3677 number that is out of range produces an empty result sequence, not an

3678 exception. Potential INCOMPATIBILITY for non-conformant tactical

3679 proof tools.

3681 * Lexical syntax (inner and outer) supports text cartouches with

3682 arbitrary nesting, and without escapes of quotes etc. The Prover IDE

3683 supports input via ` (backquote).

3685 * The outer syntax categories "text" (for formal comments and document

3686 markup commands) and "altstring" (for literal fact references) allow

3687 cartouches as well, in addition to the traditional mix of quotations.

3689 * Syntax of document antiquotation @{rail} now uses \<newline> instead

3690 of "\\", to avoid the optical illusion of escaped backslash within

3691 string token. General renovation of its syntax using text cartouches.

3692 Minor INCOMPATIBILITY.

3694 * Discontinued legacy_isub_isup, which was a temporary workaround for

3695 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts

3696 old identifier syntax with \<^isub> or \<^isup>. Potential

3697 INCOMPATIBILITY.

3699 * Document antiquotation @{url} produces markup for the given URL,

3700 which results in an active hyperlink within the text.

3702 * Document antiquotation @{file_unchecked} is like @{file}, but does

3703 not check existence within the file-system.

3705 * Updated and extended manuals: codegen, datatypes, implementation,

3706 isar-ref, jedit, system.

3709 *** Prover IDE -- Isabelle/Scala/jEdit ***

3711 * Improved Document panel: simplified interaction where every single

3712 mouse click (re)opens document via desktop environment or as jEdit

3713 buffer.

3715 * Support for Navigator plugin (with toolbar buttons), with connection

3716 to PIDE hyperlinks.

3718 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.

3719 Open text buffers take precedence over copies within the file-system.

3721 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for

3722 auxiliary ML files.

3724 * Improved syntactic and semantic completion mechanism, with simple

3725 templates, completion language context, name-space completion,

3726 file-name completion, spell-checker completion.

3728 * Refined GUI popup for completion: more robust key/mouse event

3729 handling and propagation to enclosing text area -- avoid loosing

3730 keystrokes with slow / remote graphics displays.

3732 * Completion popup supports both ENTER and TAB (default) to select an

3733 item, depending on Isabelle options.

3735 * Refined insertion of completion items wrt. jEdit text: multiple

3736 selections, rectangular selections, rectangular selection as "tall

3737 caret".

3739 * Integrated spell-checker for document text, comments etc. with

3740 completion popup and context-menu.

3742 * More general "Query" panel supersedes "Find" panel, with GUI access

3743 to commands 'find_theorems' and 'find_consts', as well as print

3744 operations for the context. Minor incompatibility in keyboard

3745 shortcuts etc.: replace action isabelle-find by isabelle-query.

3747 * Search field for all output panels ("Output", "Query", "Info" etc.)

3748 to highlight text via regular expression.

3750 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /

3751 General") allows to specify additional print modes for the prover

3752 process, without requiring old-fashioned command-line invocation of

3753 "isabelle jedit -m MODE".

3755 * More support for remote files (e.g. http) using standard Java

3756 networking operations instead of jEdit virtual file-systems.

3758 * Empty editors buffers that are no longer required (e.g.\ via theory

3759 imports) are automatically removed from the document model.

3761 * Improved monitor panel.

3763 * Improved Console/Scala plugin: more uniform scala.Console output,

3764 more robust treatment of threads and interrupts.

3766 * Improved management of dockable windows: clarified keyboard focus

3767 and window placement wrt. main editor view; optional menu item to

3768 "Detach" a copy where this makes sense.

3770 * New Simplifier Trace panel provides an interactive view of the

3771 simplification process, enabled by the "simp_trace_new" attribute

3772 within the context.

3775 *** Pure ***

3777 * Low-level type-class commands 'classes', 'classrel', 'arities' have

3778 been discontinued to avoid the danger of non-trivial axiomatization

3779 that is not immediately visible. INCOMPATIBILITY, use regular

3780 'instance' command with proof. The required OFCLASS(...) theorem

3781 might be postulated via 'axiomatization' beforehand, or the proof

3782 finished trivially if the underlying class definition is made vacuous

3783 (without any assumptions). See also Isabelle/ML operations

3784 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

3785 Axclass.arity_axiomatization.

3787 * Basic constants of Pure use more conventional names and are always

3788 qualified. Rare INCOMPATIBILITY, but with potentially serious

3789 consequences, notably for tools in Isabelle/ML. The following

3790 renaming needs to be applied:

3792 == ~> Pure.eq

3793 ==> ~> Pure.imp

3794 all ~> Pure.all

3795 TYPE ~> Pure.type

3796 dummy_pattern ~> Pure.dummy_pattern

3798 Systematic porting works by using the following theory setup on a

3799 *previous* Isabelle version to introduce the new name accesses for the

3800 old constants:

3802 setup {*

3803 fn thy => thy

3804 |> Sign.root_path

3805 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="

3806 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"

3807 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"

3808 |> Sign.restore_naming thy

3809 *}

3811 Thus ML antiquotations like @{const_name Pure.eq} may be used already.

3812 Later the application is moved to the current Isabelle version, and

3813 the auxiliary aliases are deleted.

3815 * Attributes "where" and "of" allow an optional context of local

3816 variables ('for' declaration): these variables become schematic in the

3817 instantiated theorem.

3819 * Obsolete attribute "standard" has been discontinued (legacy since

3820 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context

3821 where instantiations with schematic variables are intended (for

3822 declaration commands like 'lemmas' or attributes like "of"). The

3823 following temporary definition may help to port old applications:

3825 attribute_setup standard =

3826 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"

3828 * More thorough check of proof context for goal statements and

3829 attributed fact expressions (concerning background theory, declared

3830 hyps). Potential INCOMPATIBILITY, tools need to observe standard

3831 context discipline. See also Assumption.add_assumes and the more

3832 primitive Thm.assume_hyps.

3834 * Inner syntax token language allows regular quoted strings "..."

3835 (only makes sense in practice, if outer syntax is delimited

3836 differently, e.g. via cartouches).

3838 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,

3839 but the latter is retained some time as Proof General legacy.

3841 * Code generator preprocessor: explicit control of simp tracing on a

3842 per-constant basis. See attribute "code_preproc".

3845 *** HOL ***

3847 * Code generator: enforce case of identifiers only for strict target

3848 language requirements. INCOMPATIBILITY.

3850 * Code generator: explicit proof contexts in many ML interfaces.

3851 INCOMPATIBILITY.

3853 * Code generator: minimize exported identifiers by default. Minor

3854 INCOMPATIBILITY.

3856 * Code generation for SML and OCaml: dropped arcane "no_signatures"

3857 option. Minor INCOMPATIBILITY.

3859 * "declare [[code abort: ...]]" replaces "code_abort ...".

3860 INCOMPATIBILITY.

3862 * "declare [[code drop: ...]]" drops all code equations associated

3863 with the given constants.

3865 * Code generations are provided for make, fields, extend and truncate

3866 operations on records.

3868 * Command and antiquotation "value" are now hardcoded against nbe and

3869 ML. Minor INCOMPATIBILITY.

3871 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.

3873 * The symbol "\<newline>" may be used within char or string literals

3874 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.

3876 * Qualified String.implode and String.explode. INCOMPATIBILITY.

3878 * Simplifier: Enhanced solver of preconditions of rewrite rules can

3879 now deal with conjunctions. For help with converting proofs, the old

3880 behaviour of the simplifier can be restored like this: declare/using

3881 [[simp_legacy_precond]]. This configuration option will disappear

3882 again in the future. INCOMPATIBILITY.

3884 * Simproc "finite_Collect" is no longer enabled by default, due to

3885 spurious crashes and other surprises. Potential INCOMPATIBILITY.

3887 * Moved new (co)datatype package and its dependencies from session

3888 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',

3889 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now

3890 part of theory "Main".

3892 Theory renamings:

3893 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)

3894 Library/Wfrec.thy ~> Wfrec.thy

3895 Library/Zorn.thy ~> Zorn.thy

3896 Cardinals/Order_Relation.thy ~> Order_Relation.thy

3897 Library/Order_Union.thy ~> Cardinals/Order_Union.thy

3898 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

3899 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

3900 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

3901 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

3902 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

3903 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

3904 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

3905 BNF/BNF_Comp.thy ~> BNF_Comp.thy

3906 BNF/BNF_Def.thy ~> BNF_Def.thy

3907 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

3908 BNF/BNF_GFP.thy ~> BNF_GFP.thy

3909 BNF/BNF_LFP.thy ~> BNF_LFP.thy

3910 BNF/BNF_Util.thy ~> BNF_Util.thy

3911 BNF/Coinduction.thy ~> Coinduction.thy

3912 BNF/More_BNFs.thy ~> Library/More_BNFs.thy

3913 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy

3914 BNF/Examples/* ~> BNF_Examples/*

3916 New theories:

3917 Wellorder_Extension.thy (split from Zorn.thy)

3918 Library/Cardinal_Notations.thy

3919 Library/BNF_Axomatization.thy

3920 BNF_Examples/Misc_Primcorec.thy

3921 BNF_Examples/Stream_Processor.thy

3923 Discontinued theories:

3924 BNF/BNF.thy

3925 BNF/Equiv_Relations_More.thy

3927 INCOMPATIBILITY.

3929 * New (co)datatype package:

3930 - Command 'primcorec' is fully implemented.

3931 - Command 'datatype_new' generates size functions ("size_xxx" and

3932 "size") as required by 'fun'.

3933 - BNFs are integrated with the Lifting tool and new-style

3934 (co)datatypes with Transfer.

3935 - Renamed commands:

3936 datatype_new_compat ~> datatype_compat

3937 primrec_new ~> primrec

3938 wrap_free_constructors ~> free_constructors

3939 INCOMPATIBILITY.

3940 - The generated constants "xxx_case" and "xxx_rec" have been renamed

3941 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").

3942 INCOMPATIBILITY.

3943 - The constant "xxx_(un)fold" and related theorems are no longer

3944 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually

3945 using "prim(co)rec".

3946 INCOMPATIBILITY.

3947 - No discriminators are generated for nullary constructors by

3948 default, eliminating the need for the odd "=:" syntax.

3949 INCOMPATIBILITY.

3950 - No discriminators or selectors are generated by default by

3951 "datatype_new", unless custom names are specified or the new

3952 "discs_sels" option is passed.

3953 INCOMPATIBILITY.

3955 * Old datatype package:

3956 - The generated theorems "xxx.cases" and "xxx.recs" have been

3957 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->

3958 "sum.case"). INCOMPATIBILITY.

3959 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have

3960 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,

3961 "prod_case" ~> "case_prod"). INCOMPATIBILITY.

3963 * The types "'a list" and "'a option", their set and map functions,

3964 their relators, and their selectors are now produced using the new

3965 BNF-based datatype package.

3967 Renamed constants:

3968 Option.set ~> set_option

3969 Option.map ~> map_option

3970 option_rel ~> rel_option

3972 Renamed theorems:

3973 set_def ~> set_rec[abs_def]

3974 map_def ~> map_rec[abs_def]

3975 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")

3976 option.recs ~> option.rec

3977 list_all2_def ~> list_all2_iff

3978 set.simps ~> set_simps (or the slightly different "list.set")

3979 map.simps ~> list.map

3980 hd.simps ~> list.sel(1)

3981 tl.simps ~> list.sel(2-3)

3982 the.simps ~> option.sel

3984 INCOMPATIBILITY.

3986 * The following map functions and relators have been renamed:

3987 sum_map ~> map_sum

3988 map_pair ~> map_prod

3989 prod_rel ~> rel_prod

3990 sum_rel ~> rel_sum

3991 fun_rel ~> rel_fun

3992 set_rel ~> rel_set

3993 filter_rel ~> rel_filter

3994 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")

3995 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")

3996 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")

3998 INCOMPATIBILITY.

4000 * Lifting and Transfer:

4001 - a type variable as a raw type is supported

4002 - stronger reflexivity prover

4003 - rep_eq is always generated by lift_definition

4004 - setup for Lifting/Transfer is now automated for BNFs

4005 + holds for BNFs that do not contain a dead variable

4006 + relator_eq, relator_mono, relator_distr, relator_domain,

4007 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,

4008 right_unique, right_total, left_unique, left_total are proved

4009 automatically

4010 + definition of a predicator is generated automatically

4011 + simplification rules for a predicator definition are proved

4012 automatically for datatypes

4013 - consolidation of the setup of Lifting/Transfer

4014 + property that a relator preservers reflexivity is not needed any

4015 more

4016 Minor INCOMPATIBILITY.

4017 + left_total and left_unique rules are now transfer rules

4018 (reflexivity_rule attribute not needed anymore)

4019 INCOMPATIBILITY.

4020 + Domainp does not have to be a separate assumption in

4021 relator_domain theorems (=> more natural statement)

4022 INCOMPATIBILITY.

4023 - registration of code equations is more robust

4024 Potential INCOMPATIBILITY.

4025 - respectfulness proof obligation is preprocessed to a more readable

4026 form

4027 Potential INCOMPATIBILITY.

4028 - eq_onp is always unfolded in respectfulness proof obligation

4029 Potential INCOMPATIBILITY.

4030 - unregister lifting setup for Code_Numeral.integer and

4031 Code_Numeral.natural

4032 Potential INCOMPATIBILITY.

4033 - Lifting.invariant -> eq_onp

4034 INCOMPATIBILITY.

4036 * New internal SAT solver "cdclite" that produces models and proof

4037 traces. This solver replaces the internal SAT solvers "enumerate" and

4038 "dpll". Applications that explicitly used one of these two SAT

4039 solvers should use "cdclite" instead. In addition, "cdclite" is now

4040 the default SAT solver for the "sat" and "satx" proof methods and

4041 corresponding tactics; the old default can be restored using "declare

4042 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.

4044 * SMT module: A new version of the SMT module, temporarily called

4045 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,

4046 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also

4047 supported as oracles. Yices is no longer supported, because no version

4048 of the solver can handle both SMT-LIB 2 and quantifiers.

4050 * Activation of Z3 now works via "z3_non_commercial" system option

4051 (without requiring restart), instead of former settings variable

4052 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu

4053 Plugin Options / Isabelle / General.

4055 * Sledgehammer:

4056 - Z3 can now produce Isar proofs.

4057 - MaSh overhaul:

4058 . New SML-based learning algorithms eliminate the dependency on

4059 Python and increase performance and reliability.

4060 . MaSh and MeSh are now used by default together with the

4061 traditional MePo (Meng-Paulson) relevance filter. To disable

4062 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin

4063 Options / Isabelle / General to "none".

4064 - New option:

4065 smt_proofs

4066 - Renamed options:

4067 isar_compress ~> compress

4068 isar_try0 ~> try0

4070 INCOMPATIBILITY.

4072 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.

4074 * Nitpick:

4075 - Fixed soundness bug whereby mutually recursive datatypes could

4076 take infinite values.

4077 - Fixed soundness bug with low-level number functions such as

4078 "Abs_Integ" and "Rep_Integ".

4079 - Removed "std" option.

4080 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to

4081 "hide_types".

4083 * Metis: Removed legacy proof method 'metisFT'. Use 'metis

4084 (full_types)' instead. INCOMPATIBILITY.

4086 * Try0: Added 'algebra' and 'meson' to the set of proof methods.

4088 * Adjustion of INF and SUP operations:

4089 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.

4090 - Consolidated theorem names containing INFI and SUPR: have INF and

4091 SUP instead uniformly.

4092 - More aggressive normalization of expressions involving INF and Inf

4093 or SUP and Sup.

4094 - INF_image and SUP_image do not unfold composition.

4095 - Dropped facts INF_comp, SUP_comp.

4096 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

4097 simplifier implication in premises. Generalize and replace former

4098 INT_cong, SUP_cong

4100 INCOMPATIBILITY.

4102 * SUP and INF generalized to conditionally_complete_lattice.

4104 * Swapped orientation of facts image_comp and vimage_comp:

4106 image_compose ~> image_comp [symmetric]

4107 image_comp ~> image_comp [symmetric]

4108 vimage_compose ~> vimage_comp [symmetric]

4109 vimage_comp ~> vimage_comp [symmetric]

4111 INCOMPATIBILITY.

4113 * Theory reorganization: split of Big_Operators.thy into

4114 Groups_Big.thy and Lattices_Big.thy.

4116 * Consolidated some facts about big group operators:

4118 setsum_0' ~> setsum.neutral

4119 setsum_0 ~> setsum.neutral_const

4120 setsum_addf ~> setsum.distrib

4121 setsum_cartesian_product ~> setsum.cartesian_product

4122 setsum_cases ~> setsum.If_cases

4123 setsum_commute ~> setsum.commute

4124 setsum_cong ~> setsum.cong

4125 setsum_delta ~> setsum.delta

4126 setsum_delta' ~> setsum.delta'

4127 setsum_diff1' ~> setsum.remove

4128 setsum_empty ~> setsum.empty

4129 setsum_infinite ~> setsum.infinite

4130 setsum_insert ~> setsum.insert

4131 setsum_inter_restrict'' ~> setsum.inter_filter

4132 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

4133 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

4134 setsum_mono_zero_left ~> setsum.mono_neutral_left

4135 setsum_mono_zero_right ~> setsum.mono_neutral_right

4136 setsum_reindex ~> setsum.reindex

4137 setsum_reindex_cong ~> setsum.reindex_cong

4138 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

4139 setsum_restrict_set ~> setsum.inter_restrict

4140 setsum_Plus ~> setsum.Plus

4141 setsum_setsum_restrict ~> setsum.commute_restrict

4142 setsum_Sigma ~> setsum.Sigma

4143 setsum_subset_diff ~> setsum.subset_diff

4144 setsum_Un_disjoint ~> setsum.union_disjoint

4145 setsum_UN_disjoint ~> setsum.UNION_disjoint

4146 setsum_Un_Int ~> setsum.union_inter

4147 setsum_Union_disjoint ~> setsum.Union_disjoint

4148 setsum_UNION_zero ~> setsum.Union_comp

4149 setsum_Un_zero ~> setsum.union_inter_neutral

4150 strong_setprod_cong ~> setprod.strong_cong

4151 strong_setsum_cong ~> setsum.strong_cong

4152 setprod_1' ~> setprod.neutral

4153 setprod_1 ~> setprod.neutral_const

4154 setprod_cartesian_product ~> setprod.cartesian_product

4155 setprod_cong ~> setprod.cong

4156 setprod_delta ~> setprod.delta

4157 setprod_delta' ~> setprod.delta'

4158 setprod_empty ~> setprod.empty

4159 setprod_infinite ~> setprod.infinite

4160 setprod_insert ~> setprod.insert

4161 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

4162 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

4163 setprod_mono_one_left ~> setprod.mono_neutral_left

4164 setprod_mono_one_right ~> setprod.mono_neutral_right

4165 setprod_reindex ~> setprod.reindex

4166 setprod_reindex_cong ~> setprod.reindex_cong

4167 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

4168 setprod_Sigma ~> setprod.Sigma

4169 setprod_subset_diff ~> setprod.subset_diff

4170 setprod_timesf ~> setprod.distrib

4171 setprod_Un2 ~> setprod.union_diff2

4172 setprod_Un_disjoint ~> setprod.union_disjoint

4173 setprod_UN_disjoint ~> setprod.UNION_disjoint

4174 setprod_Un_Int ~> setprod.union_inter

4175 setprod_Union_disjoint ~> setprod.Union_disjoint

4176 setprod_Un_one ~> setprod.union_inter_neutral

4178 Dropped setsum_cong2 (simple variant of setsum.cong).

4179 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)

4180 Dropped setsum_reindex_id, setprod_reindex_id

4181 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).

4183 INCOMPATIBILITY.

4185 * Abolished slightly odd global lattice interpretation for min/max.

4187 Fact consolidations:

4188 min_max.inf_assoc ~> min.assoc

4189 min_max.inf_commute ~> min.commute

4190 min_max.inf_left_commute ~> min.left_commute

4191 min_max.inf_idem ~> min.idem

4192 min_max.inf_left_idem ~> min.left_idem

4193 min_max.inf_right_idem ~> min.right_idem

4194 min_max.sup_assoc ~> max.assoc

4195 min_max.sup_commute ~> max.commute

4196 min_max.sup_left_commute ~> max.left_commute

4197 min_max.sup_idem ~> max.idem

4198 min_max.sup_left_idem ~> max.left_idem

4199 min_max.sup_inf_distrib1 ~> max_min_distrib2

4200 min_max.sup_inf_distrib2 ~> max_min_distrib1

4201 min_max.inf_sup_distrib1 ~> min_max_distrib2

4202 min_max.inf_sup_distrib2 ~> min_max_distrib1

4203 min_max.distrib ~> min_max_distribs

4204 min_max.inf_absorb1 ~> min.absorb1

4205 min_max.inf_absorb2 ~> min.absorb2

4206 min_max.sup_absorb1 ~> max.absorb1

4207 min_max.sup_absorb2 ~> max.absorb2

4208 min_max.le_iff_inf ~> min.absorb_iff1

4209 min_max.le_iff_sup ~> max.absorb_iff2

4210 min_max.inf_le1 ~> min.cobounded1

4211 min_max.inf_le2 ~> min.cobounded2

4212 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

4213 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

4214 min_max.le_infI1 ~> min.coboundedI1

4215 min_max.le_infI2 ~> min.coboundedI2

4216 min_max.le_supI1 ~> max.coboundedI1

4217 min_max.le_supI2 ~> max.coboundedI2

4218 min_max.less_infI1 ~> min.strict_coboundedI1

4219 min_max.less_infI2 ~> min.strict_coboundedI2

4220 min_max.less_supI1 ~> max.strict_coboundedI1

4221 min_max.less_supI2 ~> max.strict_coboundedI2

4222 min_max.inf_mono ~> min.mono

4223 min_max.sup_mono ~> max.mono

4224 min_max.le_infI, min_max.inf_greatest ~> min.boundedI

4225 min_max.le_supI, min_max.sup_least ~> max.boundedI

4226 min_max.le_inf_iff ~> min.bounded_iff

4227 min_max.le_sup_iff ~> max.bounded_iff

4229 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,

4230 min.left_commute, min.left_idem, max.commute, max.assoc,

4231 max.left_commute, max.left_idem directly.

4233 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,

4234 min.cobounded2, max.cobounded1m max.cobounded2 directly.

4236 For min_ac or max_ac, prefer more general collection ac_simps.

4238 INCOMPATIBILITY.

4240 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>

4241 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

4243 * Qualified constant names Wellfounded.acc, Wellfounded.accp.

4244 INCOMPATIBILITY.

4246 * Fact generalization and consolidation:

4247 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

4249 INCOMPATIBILITY.

4251 * Purely algebraic definition of even. Fact generalization and

4252 consolidation:

4253 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

4254 even_zero_(nat|int) ~> even_zero

4256 INCOMPATIBILITY.

4258 * Abolished neg_numeral.

4259 - Canonical representation for minus one is "- 1".

4260 - Canonical representation for other negative numbers is "- (numeral _)".

4261 - When devising rule sets for number calculation, consider the

4262 following canonical cases: 0, 1, numeral _, - 1, - numeral _.

4263 - HOLogic.dest_number also recognizes numerals in non-canonical forms

4264 like "numeral One", "- numeral One", "- 0" and even "- ... - _".

4265 - Syntax for negative numerals is mere input syntax.

4267 INCOMPATIBILITY.

4269 * Reduced name variants for rules on associativity and commutativity:

4271 add_assoc ~> add.assoc

4272 add_commute ~> add.commute

4273 add_left_commute ~> add.left_commute

4274 mult_assoc ~> mult.assoc

4275 mult_commute ~> mult.commute

4276 mult_left_commute ~> mult.left_commute

4277 nat_add_assoc ~> add.assoc

4278 nat_add_commute ~> add.commute

4279 nat_add_left_commute ~> add.left_commute

4280 nat_mult_assoc ~> mult.assoc

4281 nat_mult_commute ~> mult.commute

4282 eq_assoc ~> iff_assoc

4283 eq_left_commute ~> iff_left_commute

4285 INCOMPATIBILITY.

4287 * Fact collections add_ac and mult_ac are considered old-fashioned.

4288 Prefer ac_simps instead, or specify rules

4289 (add|mult).(assoc|commute|left_commute) individually.

4291 * Elimination of fact duplicates:

4292 equals_zero_I ~> minus_unique

4293 diff_eq_0_iff_eq ~> right_minus_eq

4294 nat_infinite ~> infinite_UNIV_nat

4295 int_infinite ~> infinite_UNIV_int

4297 INCOMPATIBILITY.

4299 * Fact name consolidation:

4300 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

4301 minus_le_self_iff ~> neg_less_eq_nonneg

4302 le_minus_self_iff ~> less_eq_neg_nonpos

4303 neg_less_nonneg ~> neg_less_pos

4304 less_minus_self_iff ~> less_neg_neg [simp]

4306 INCOMPATIBILITY.

4308 * More simplification rules on unary and binary minus:

4309 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

4310 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

4311 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

4312 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

4313 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

4314 been taken away from fact collections algebra_simps and field_simps.

4315 INCOMPATIBILITY.

4317 To restore proofs, the following patterns are helpful:

4319 a) Arbitrary failing proof not involving "diff_def":

4320 Consider simplification with algebra_simps or field_simps.

4322 b) Lifting rules from addition to subtraction:

4323 Try with "using <rule for addition> of [... "- _" ...]" by simp".

4325 c) Simplification with "diff_def": just drop "diff_def".

4326 Consider simplification with algebra_simps or field_simps;

4327 or the brute way with

4328 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

4330 * Introduce bdd_above and bdd_below in theory

4331 Conditionally_Complete_Lattices, use them instead of explicitly

4332 stating boundedness of sets.

4334 * ccpo.admissible quantifies only over non-empty chains to allow more

4335 syntax-directed proof rules; the case of the empty chain shows up as

4336 additional case in fixpoint induction proofs. INCOMPATIBILITY.

4338 * Removed and renamed theorems in Series:

4339 summable_le ~> suminf_le

4340 suminf_le ~> suminf_le_const

4341 series_pos_le ~> setsum_le_suminf

4342 series_pos_less ~> setsum_less_suminf

4343 suminf_ge_zero ~> suminf_nonneg

4344 suminf_gt_zero ~> suminf_pos

4345 suminf_gt_zero_iff ~> suminf_pos_iff

4346 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

4347 suminf_0_le ~> suminf_nonneg [rotate]

4348 pos_summable ~> summableI_nonneg_bounded

4349 ratio_test ~> summable_ratio_test

4351 removed series_zero, replaced by sums_finite

4353 removed auxiliary lemmas:

4355 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

4356 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

4357 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

4358 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

4359 summable_convergent_sumr_iff, sumr_diff_mult_const

4361 INCOMPATIBILITY.

4363 * Replace (F)DERIV syntax by has_derivative:

4364 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"

4366 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

4368 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

4370 - removed constant isDiff

4372 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

4373 input syntax.

4375 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

4377 - Renamed FDERIV_... lemmas to has_derivative_...

4379 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

4381 - removed DERIV_intros, has_derivative_eq_intros

4383 - introduced derivative_intros and deriative_eq_intros which

4384 includes now rules for DERIV, has_derivative and

4385 has_vector_derivative.

4387 - Other renamings:

4388 differentiable_def ~> real_differentiable_def

4389 differentiableE ~> real_differentiableE

4390 fderiv_def ~> has_derivative_at

4391 field_fderiv_def ~> field_has_derivative_at

4392 isDiff_der ~> differentiable_def

4393 deriv_fderiv ~> has_field_derivative_def

4394 deriv_def ~> DERIV_def

4396 INCOMPATIBILITY.

4398 * Include more theorems in continuous_intros. Remove the

4399 continuous_on_intros, isCont_intros collections, these facts are now

4400 in continuous_intros.

4402 * Theorems about complex numbers are now stated only using Re and Im,

4403 the Complex constructor is not used anymore. It is possible to use

4404 primcorec to defined the behaviour of a complex-valued function.

4406 Removed theorems about the Complex constructor from the simpset, they

4407 are available as the lemma collection legacy_Complex_simps. This

4408 especially removes

4410 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

4412 Instead the reverse direction is supported with

4413 Complex_eq: "Complex a b = a + \<i> * b"

4415 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

4417 Renamings:

4418 Re/Im ~> complex.sel

4419 complex_Re/Im_zero ~> zero_complex.sel

4420 complex_Re/Im_add ~> plus_complex.sel

4421 complex_Re/Im_minus ~> uminus_complex.sel

4422 complex_Re/Im_diff ~> minus_complex.sel

4423 complex_Re/Im_one ~> one_complex.sel

4424 complex_Re/Im_mult ~> times_complex.sel

4425 complex_Re/Im_inverse ~> inverse_complex.sel

4426 complex_Re/Im_scaleR ~> scaleR_complex.sel

4427 complex_Re/Im_i ~> ii.sel

4428 complex_Re/Im_cnj ~> cnj.sel

4429 Re/Im_cis ~> cis.sel

4431 complex_divide_def ~> divide_complex_def

4432 complex_norm_def ~> norm_complex_def

4433 cmod_def ~> norm_complex_de

4435 Removed theorems:

4436 complex_zero_def

4437 complex_add_def

4438 complex_minus_def

4439 complex_diff_def

4440 complex_one_def

4441 complex_mult_def

4442 complex_inverse_def

4443 complex_scaleR_def

4445 INCOMPATIBILITY.

4447 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

4448 Conditionally_Complete_Lattices. INCOMPATIBILITY.

4450 * HOL-Library: new theory src/HOL/Library/Tree.thy.

4452 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

4453 is subsumed by session Kleene_Algebra in AFP.

4455 * HOL-Library / theory RBT: various constants and facts are hidden;

4456 lifting setup is unregistered. INCOMPATIBILITY.

4458 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

4460 * HOL-Word: bit representations prefer type bool over type bit.

4461 INCOMPATIBILITY.

4463 * HOL-Word:

4464 - Abandoned fact collection "word_arith_alts", which is a duplicate

4465 of "word_arith_wis".

4466 - Dropped first (duplicated) element in fact collections

4467 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

4468 "uint_word_arith_bintrs".

4470 * HOL-Number_Theory:

4471 - consolidated the proofs of the binomial theorem

4472 - the function fib is again of type nat => nat and not overloaded

4473 - no more references to Old_Number_Theory in the HOL libraries

4474 (except the AFP)

4476 INCOMPATIBILITY.

4478 * HOL-Multivariate_Analysis:

4479 - Type class ordered_real_vector for ordered vector spaces.

4480 - New theory Complex_Basic_Analysis defining complex derivatives,

4481 holomorphic functions, etc., ported from HOL Light's canal.ml.

4482 - Changed order of ordered_euclidean_space to be compatible with

4483 pointwise ordering on products. Therefore instance of

4484 conditionally_complete_lattice and ordered_real_vector.

4485 INCOMPATIBILITY: use box instead of greaterThanLessThan or

4486 explicit set-comprehensions with eucl_less for other (half-)open

4487 intervals.

4488 - removed dependencies on type class ordered_euclidean_space with

4489 introduction of "cbox" on euclidean_space

4490 - renamed theorems:

4491 interval ~> box

4492 mem_interval ~> mem_box

4493 interval_eq_empty ~> box_eq_empty

4494 interval_ne_empty ~> box_ne_empty

4495 interval_sing(1) ~> cbox_sing

4496 interval_sing(2) ~> box_sing

4497 subset_interval_imp ~> subset_box_imp

4498 subset_interval ~> subset_box

4499 open_interval ~> open_box

4500 closed_interval ~> closed_cbox

4501 interior_closed_interval ~> interior_cbox

4502 bounded_closed_interval ~> bounded_cbox

4503 compact_interval ~> compact_cbox

4504 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

4505 bounded_subset_closed_interval ~> bounded_subset_cbox

4506 mem_interval_componentwiseI ~> mem_box_componentwiseI

4507 convex_box ~> convex_prod

4508 rel_interior_real_interval ~> rel_interior_real_box

4509 convex_interval ~> convex_box

4510 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

4511 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

4512 content_closed_interval' ~> content_cbox'

4513 elementary_subset_interval ~> elementary_subset_box

4514 diameter_closed_interval ~> diameter_cbox

4515 frontier_closed_interval ~> frontier_cbox

4516 frontier_open_interval ~> frontier_box

4517 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

4518 closure_open_interval ~> closure_box

4519 open_closed_interval_convex ~> open_cbox_convex

4520 open_interval_midpoint ~> box_midpoint

4521 content_image_affinity_interval ~> content_image_affinity_cbox

4522 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

4523 bounded_interval ~> bounded_closed_interval + bounded_boxes

4525 - respective theorems for intervals over the reals:

4526 content_closed_interval + content_cbox

4527 has_integral + has_integral_real

4528 fine_division_exists + fine_division_exists_real

4529 has_integral_null + has_integral_null_real

4530 tagged_division_union_interval + tagged_division_union_interval_real

4531 has_integral_const + has_integral_const_real

4532 integral_const + integral_const_real

4533 has_integral_bound + has_integral_bound_real

4534 integrable_continuous + integrable_continuous_real

4535 integrable_subinterval + integrable_subinterval_real

4536 has_integral_reflect_lemma + has_integral_reflect_lemma_real

4537 integrable_reflect + integrable_reflect_real

4538 integral_reflect + integral_reflect_real

4539 image_affinity_interval + image_affinity_cbox

4540 image_smult_interval + image_smult_cbox

4541 integrable_const + integrable_const_ivl

4542 integrable_on_subinterval + integrable_on_subcbox

4544 - renamed theorems:

4545 derivative_linear ~> has_derivative_bounded_linear

4546 derivative_is_linear ~> has_derivative_linear

4547 bounded_linear_imp_linear ~> bounded_linear.linear

4549 * HOL-Probability:

4550 - Renamed positive_integral to nn_integral:

4552 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

4553 positive_integral_positive ~> nn_integral_nonneg

4555 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

4557 - replaced the Lebesgue integral on real numbers by the more general

4558 Bochner integral for functions into a real-normed vector space.

4560 integral_zero ~> integral_zero / integrable_zero

4561 integral_minus ~> integral_minus / integrable_minus

4562 integral_add ~> integral_add / integrable_add

4563 integral_diff ~> integral_diff / integrable_diff

4564 integral_setsum ~> integral_setsum / integrable_setsum

4565 integral_multc ~> integral_mult_left / integrable_mult_left

4566 integral_cmult ~> integral_mult_right / integrable_mult_right

4567 integral_triangle_inequality~> integral_norm_bound

4568 integrable_nonneg ~> integrableI_nonneg

4569 integral_positive ~> integral_nonneg_AE

4570 integrable_abs_iff ~> integrable_abs_cancel

4571 positive_integral_lim_INF ~> nn_integral_liminf

4572 lebesgue_real_affine ~> lborel_real_affine

4573 borel_integral_has_integral ~> has_integral_lebesgue_integral

4574 integral_indicator ~>

4575 integral_real_indicator / integrable_real_indicator

4576 positive_integral_fst ~> nn_integral_fst'

4577 positive_integral_fst_measurable ~> nn_integral_fst

4578 positive_integral_snd_measurable ~> nn_integral_snd

4580 integrable_fst_measurable ~>

4581 integral_fst / integrable_fst / AE_integrable_fst

4583 integrable_snd_measurable ~>

4584 integral_snd / integrable_snd / AE_integrable_snd

4586 integral_monotone_convergence ~>

4587 integral_monotone_convergence / integrable_monotone_convergence

4589 integral_monotone_convergence_at_top ~>

4590 integral_monotone_convergence_at_top /

4591 integrable_monotone_convergence_at_top

4593 has_integral_iff_positive_integral_lebesgue ~>

4594 has_integral_iff_has_bochner_integral_lebesgue_nonneg

4596 lebesgue_integral_has_integral ~>

4597 has_integral_integrable_lebesgue_nonneg

4599 positive_integral_lebesgue_has_integral ~>

4600 integral_has_integral_lebesgue_nonneg /

4601 integrable_has_integral_lebesgue_nonneg

4603 lebesgue_integral_real_affine ~>

4604 nn_integral_real_affine

4606 has_integral_iff_positive_integral_lborel ~>

4607 integral_has_integral_nonneg / integrable_has_integral_nonneg

4609 The following theorems where removed:

4611 lebesgue_integral_nonneg

4612 lebesgue_integral_uminus

4613 lebesgue_integral_cmult

4614 lebesgue_integral_multc

4615 lebesgue_integral_cmult_nonneg

4616 integral_cmul_indicator

4617 integral_real

4619 - Formalized properties about exponentially, Erlang, and normal

4620 distributed random variables.

4622 * HOL-Decision_Procs: Separate command 'approximate' for approximative

4623 computation in src/HOL/Decision_Procs/Approximation. Minor

4624 INCOMPATIBILITY.

4627 *** Scala ***

4629 * The signature and semantics of Document.Snapshot.cumulate_markup /

4630 select_markup have been clarified. Markup is now traversed in the

4631 order of reports given by the prover: later markup is usually more

4632 specific and may override results accumulated so far. The elements

4633 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

4635 * Substantial reworking of internal PIDE protocol communication

4636 channels. INCOMPATIBILITY.

4639 *** ML ***

4641 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

4642 compared (according to Thm.thm_ord), but assumed to be covered by the

4643 current background theory. Thus equivalent data produced in different

4644 branches of the theory graph usually coincides (e.g. relevant for

4645 theory merge). Note that the softer Thm.eq_thm_prop is often more

4646 appropriate than Thm.eq_thm.

4648 * Proper context for basic Simplifier operations: rewrite_rule,

4649 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

4650 pass runtime Proof.context (and ensure that the simplified entity

4651 actually belongs to it).

4653 * Proper context discipline for read_instantiate and instantiate_tac:

4654 variables that are meant to become schematic need to be given as

4655 fixed, and are generalized by the explicit context of local variables.

4656 This corresponds to Isar attributes "where" and "of" with 'for'

4657 declaration. INCOMPATIBILITY, also due to potential change of indices

4658 of schematic variables.

4660 * Moved ML_Compiler.exn_trace and other operations on exceptions to

4661 structure Runtime. Minor INCOMPATIBILITY.

4663 * Discontinued old Toplevel.debug in favour of system option

4664 "ML_exception_trace", which may be also declared within the context

4665 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

4667 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

4668 INCOMPATIBILITY.

4670 * Configuration option "ML_print_depth" controls the pretty-printing

4671 depth of the ML compiler within the context. The old print_depth in

4672 ML is still available as default_print_depth, but rarely used. Minor

4673 INCOMPATIBILITY.

4675 * Toplevel function "use" refers to raw ML bootstrap environment,

4676 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

4677 Note that 'ML_file' is the canonical command to load ML files into the

4678 formal context.

4680 * Simplified programming interface to define ML antiquotations, see

4681 structure ML_Antiquotation. Minor INCOMPATIBILITY.

4683 * ML antiquotation @{here} refers to its source position, which is

4684 occasionally useful for experimentation and diagnostic purposes.

4686 * ML antiquotation @{path} produces a Path.T value, similarly to

4687 Path.explode, but with compile-time check against the file-system and

4688 some PIDE markup. Note that unlike theory source, ML does not have a

4689 well-defined master directory, so an absolute symbolic path

4690 specification is usually required, e.g. "~~/src/HOL".

4692 * ML antiquotation @{print} inlines a function to print an arbitrary

4693 ML value, which is occasionally useful for diagnostic or demonstration

4694 purposes.

4697 *** System ***

4699 * Proof General with its traditional helper scripts is now an optional

4700 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

4701 component repository http://isabelle.in.tum.de/components/. Note that

4702 the "system" manual provides general explanations about add-on

4703 components, especially those that are not bundled with the release.

4705 * The raw Isabelle process executable has been renamed from

4706 "isabelle-process" to "isabelle_process", which conforms to common

4707 shell naming conventions, and allows to define a shell function within

4708 the Isabelle environment to avoid dynamic path lookup. Rare

4709 incompatibility for old tools that do not use the ISABELLE_PROCESS

4710 settings variable.

4712 * Former "isabelle tty" has been superseded by "isabelle console",

4713 with implicit build like "isabelle jedit", and without the mostly

4714 obsolete Isar TTY loop.

4716 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

4717 and PDF_VIEWER now refer to the actual programs, not shell

4718 command-lines. Discontinued option -c: invocation may be asynchronous

4719 via desktop environment, without any special precautions. Potential

4720 INCOMPATIBILITY with ambitious private settings.

4722 * Removed obsolete "isabelle unsymbolize". Note that the usual format

4723 for email communication is the Unicode rendering of Isabelle symbols,

4724 as produced by Isabelle/jEdit, for example.

4726 * Removed obsolete tool "wwwfind". Similar functionality may be

4727 integrated into Isabelle/jEdit eventually.

4729 * Improved 'display_drafts' concerning desktop integration and

4730 repeated invocation in PIDE front-end: re-use single file

4731 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

4733 * Session ROOT specifications require explicit 'document_files' for

4734 robust dependencies on LaTeX sources. Only these explicitly given

4735 files are copied to the document output directory, before document

4736 processing is started.

4738 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

4739 of TeX Live from Cygwin.

4743 New in Isabelle2013-2 (December 2013)

4744 -------------------------------------

4746 *** Prover IDE -- Isabelle/Scala/jEdit ***

4748 * More robust editing of running commands with internal forks,

4749 e.g. non-terminating 'by' steps.

4751 * More relaxed Sledgehammer panel: avoid repeated application of query

4752 after edits surrounding the command location.

4754 * More status information about commands that are interrupted

4755 accidentally (via physical event or Poly/ML runtime system signal,

4756 e.g. out-of-memory).

4759 *** System ***

4761 * More robust termination of external processes managed by

4762 Isabelle/ML: support cancellation of tasks within the range of

4763 milliseconds, as required for PIDE document editing with automatically

4764 tried tools (e.g. Sledgehammer).

4766 * Reactivated Isabelle/Scala kill command for external processes on

4767 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

4768 workaround for some Debian/Ubuntu Linux versions from 2013.

4772 New in Isabelle2013-1 (November 2013)

4773 -------------------------------------

4775 *** General ***

4777 * Discontinued obsolete 'uses' within theory header. Note that

4778 commands like 'ML_file' work without separate declaration of file

4779 dependencies. Minor INCOMPATIBILITY.

4781 * Discontinued redundant 'use' command, which was superseded by

4782 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

4784 * Simplified subscripts within identifiers, using plain \<^sub>

4785 instead of the second copy \<^isub> and \<^isup>. Superscripts are

4786 only for literal tokens within notation; explicit mixfix annotations

4787 for consts or fixed variables may be used as fall-back for unusual

4788 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

4789 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

4790 standardize symbols as a starting point for further manual cleanup.

4791 The ML reference variable "legacy_isub_isup" may be set as temporary

4792 workaround, to make the prover accept a subset of the old identifier

4793 syntax.

4795 * Document antiquotations: term style "isub" has been renamed to

4796 "sub". Minor INCOMPATIBILITY.

4798 * Uniform management of "quick_and_dirty" as system option (see also

4799 "isabelle options"), configuration option within the context (see also

4800 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

4801 INCOMPATIBILITY, need to use more official Isabelle means to access

4802 quick_and_dirty, instead of historical poking into mutable reference.

4804 * Renamed command 'print_configs' to 'print_options'. Minor

4805 INCOMPATIBILITY.

4807 * Proper diagnostic command 'print_state'. Old 'pr' (with its

4808 implicit change of some global references) is retained for now as

4809 control command, e.g. for ProofGeneral 3.7.x.

4811 * Discontinued 'print_drafts' command with its old-fashioned PS output

4812 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

4813 'display_drafts' instead and print via the regular document viewer.

4815 * Updated and extended "isar-ref" and "implementation" manual,

4816 eliminated old "ref" manual.

4819 *** Prover IDE -- Isabelle/Scala/jEdit ***

4821 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

4822 Documentation panel.

4824 * Dockable window "Documentation" provides access to Isabelle

4825 documentation.

4827 * Dockable window "Find" provides query operations for formal entities

4828 (GUI front-end to 'find_theorems' command).

4830 * Dockable window "Sledgehammer" manages asynchronous / parallel

4831 sledgehammer runs over existing document sources, independently of

4832 normal editing and checking process.

4834 * Dockable window "Timing" provides an overview of relevant command

4835 timing information, depending on option jedit_timing_threshold. The

4836 same timing information is shown in the extended tooltip of the

4837 command keyword, when hovering the mouse over it while the CONTROL or

4838 COMMAND modifier is pressed.

4840 * Improved dockable window "Theories": Continuous checking of proof

4841 document (visible and required parts) may be controlled explicitly,

4842 using check box or shortcut "C+e ENTER". Individual theory nodes may

4843 be marked explicitly as required and checked in full, using check box

4844 or shortcut "C+e SPACE".

4846 * Improved completion mechanism, which is now managed by the

4847 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

4848 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

4850 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

4851 isabelle.complete for explicit completion in Isabelle sources.

4852 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

4853 to resolve conflict.

4855 * Improved support of various "minor modes" for Isabelle NEWS,

4856 options, session ROOT etc., with completion and SideKick tree view.

4858 * Strictly monotonic document update, without premature cancellation of

4859 running transactions that are still needed: avoid reset/restart of

4860 such command executions while editing.

4862 * Support for asynchronous print functions, as overlay to existing

4863 document content.

4865 * Support for automatic tools in HOL, which try to prove or disprove

4866 toplevel theorem statements.

4868 * Action isabelle.reset-font-size resets main text area font size

4869 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

4870 also "Plugin Options / Isabelle / General"). It can be bound to some

4871 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

4873 * File specifications in jEdit (e.g. file browser) may refer to

4874 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

4875 obsolete $ISABELLE_HOME_WINDOWS variable.

4877 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

4878 / Global Options / Appearance".

4880 * Improved support of native Mac OS X functionality via "MacOSX"

4881 plugin, which is now enabled by default.

4884 *** Pure ***

4886 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

4887 In particular, 'interpretation' allows for non-persistent

4888 interpretation within "context ... begin ... end" blocks offering a

4889 light-weight alternative to 'sublocale'. See "isar-ref" manual for

4890 details.

4892 * Improved locales diagnostic command 'print_dependencies'.

4894 * Discontinued obsolete 'axioms' command, which has been marked as

4895 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

4896 instead, while observing its uniform scope for polymorphism.

4898 * Discontinued empty name bindings in 'axiomatization'.

4899 INCOMPATIBILITY.

4901 * System option "proofs" has been discontinued. Instead the global

4902 state of Proofterm.proofs is persistently compiled into logic images

4903 as required, notably HOL-Proofs. Users no longer need to change

4904 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

4906 * Syntax translation functions (print_translation etc.) always depend

4907 on Proof.context. Discontinued former "(advanced)" option -- this is

4908 now the default. Minor INCOMPATIBILITY.

4910 * Former global reference trace_unify_fail is now available as

4911 configuration option "unify_trace_failure" (global context only).

4913 * SELECT_GOAL now retains the syntactic context of the overall goal

4914 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

4915 situations.

4918 *** HOL ***

4920 * Stronger precedence of syntax for big intersection and union on

4921 sets, in accordance with corresponding lattice operations.

4922 INCOMPATIBILITY.

4924 * Notation "{p:A. P}" now allows tuple patterns as well.

4926 * Nested case expressions are now translated in a separate check phase

4927 rather than during parsing. The data for case combinators is separated

4928 from the datatype package. The declaration attribute

4929 "case_translation" can be used to register new case combinators:

4931 declare [[case_translation case_combinator constructor1 ... constructorN]]

4933 * Code generator:

4934 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

4935 'code_instance'.

4936 - 'code_identifier' declares name hints for arbitrary identifiers in

4937 generated code, subsuming 'code_modulename'.

4939 See the isar-ref manual for syntax diagrams, and the HOL theories for

4940 examples.

4942 * Attibute 'code': 'code' now declares concrete and abstract code

4943 equations uniformly. Use explicit 'code equation' and 'code abstract'

4944 to distinguish both when desired.

4946 * Discontinued theories Code_Integer and Efficient_Nat by a more

4947 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

4948 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

4949 generation for details. INCOMPATIBILITY.

4951 * Numeric types are mapped by default to target language numerals:

4952 natural (replaces former code_numeral) and integer (replaces former

4953 code_int). Conversions are available as integer_of_natural /

4954 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

4955 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

4956 ML). INCOMPATIBILITY.

4958 * Function package: For mutually recursive functions f and g, separate

4959 cases rules f.cases and g.cases are generated instead of unusable

4960 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

4961 in the case that the unusable rule was used nevertheless.

4963 * Function package: For each function f, new rules f.elims are

4964 generated, which eliminate equalities of the form "f x = t".

4966 * New command 'fun_cases' derives ad-hoc elimination rules for

4967 function equations as simplified instances of f.elims, analogous to

4968 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

4970 * Lifting:

4971 - parametrized correspondence relations are now supported:

4972 + parametricity theorems for the raw term can be specified in

4973 the command lift_definition, which allow us to generate stronger

4974 transfer rules

4975 + setup_lifting generates stronger transfer rules if parametric

4976 correspondence relation can be generated

4977 + various new properties of the relator must be specified to support

4978 parametricity

4979 + parametricity theorem for the Quotient relation can be specified

4980 - setup_lifting generates domain rules for the Transfer package

4981 - stronger reflexivity prover of respectfulness theorems for type

4982 copies

4983 - ===> and --> are now local. The symbols can be introduced

4984 by interpreting the locale lifting_syntax (typically in an

4985 anonymous context)

4986 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

4987 Main. Potential INCOMPATIBILITY

4988 - new commands for restoring and deleting Lifting/Transfer context:

4989 lifting_forget, lifting_update

4990 - the command print_quotmaps was renamed to print_quot_maps.

4991 INCOMPATIBILITY

4993 * Transfer:

4994 - better support for domains in Transfer: replace Domainp T

4995 by the actual invariant in a transferred goal

4996 - transfer rules can have as assumptions other transfer rules

4997 - Experimental support for transferring from the raw level to the

4998 abstract level: Transfer.transferred attribute

4999 - Attribute version of the transfer method: untransferred attribute

5001 * Reification and reflection:

5002 - Reification is now directly available in HOL-Main in structure

5003 "Reification".

5004 - Reflection now handles multiple lists with variables also.

5005 - The whole reflection stack has been decomposed into conversions.

5006 INCOMPATIBILITY.

5008 * Revised devices for recursive definitions over finite sets:

5009 - Only one fundamental fold combinator on finite set remains:

5010 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

5011 This is now identity on infinite sets.

5012 - Locales ("mini packages") for fundamental definitions with

5013 Finite_Set.fold: folding, folding_idem.

5014 - Locales comm_monoid_set, semilattice_order_set and

5015 semilattice_neutr_order_set for big operators on sets.

5016 See theory Big_Operators for canonical examples.

5017 Note that foundational constants comm_monoid_set.F and

5018 semilattice_set.F correspond to former combinators fold_image

5019 and fold1 respectively. These are now gone. You may use

5020 those foundational constants as substitutes, but it is

5021 preferable to interpret the above locales accordingly.

5022 - Dropped class ab_semigroup_idem_mult (special case of lattice,

5023 no longer needed in connection with Finite_Set.fold etc.)

5024 - Fact renames:

5025 card.union_inter ~> card_Un_Int [symmetric]

5026 card.union_disjoint ~> card_Un_disjoint

5027 INCOMPATIBILITY.

5029 * Locale hierarchy for abstract orderings and (semi)lattices.

5031 * Complete_Partial_Order.admissible is defined outside the type class

5032 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

5033 class predicate assumption or sort constraint when possible.

5034 INCOMPATIBILITY.

5036 * Introduce type class "conditionally_complete_lattice": Like a

5037 complete lattice but does not assume the existence of the top and

5038 bottom elements. Allows to generalize some lemmas about reals and

5039 extended reals. Removed SupInf and replaced it by the instantiation

5040 of conditionally_complete_lattice for real. Renamed lemmas about

5041 conditionally-complete lattice from Sup_... to cSup_... and from

5042 Inf_... to cInf_... to avoid hidding of similar complete lattice

5043 lemmas.

5045 * Introduce type class linear_continuum as combination of

5046 conditionally-complete lattices and inner dense linorders which have

5047 more than one element. INCOMPATIBILITY.

5049 * Introduced type classes order_top and order_bot. The old classes top

5050 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

5051 Rename bot -> order_bot, top -> order_top

5053 * Introduce type classes "no_top" and "no_bot" for orderings without

5054 top and bottom elements.

5056 * Split dense_linorder into inner_dense_order and no_top, no_bot.

5058 * Complex_Main: Unify and move various concepts from

5059 HOL-Multivariate_Analysis to HOL-Complex_Main.

5061 - Introduce type class (lin)order_topology and

5062 linear_continuum_topology. Allows to generalize theorems about

5063 limits and order. Instances are reals and extended reals.

5065 - continuous and continuos_on from Multivariate_Analysis:

5066 "continuous" is the continuity of a function at a filter. "isCont"

5067 is now an abbrevitation: "isCont x f == continuous (at _) f".

5069 Generalized continuity lemmas from isCont to continuous on an

5070 arbitrary filter.

5072 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

5073 compactness of closed intervals on reals. Continuous functions

5074 attain infimum and supremum on compact sets. The inverse of a

5075 continuous function is continuous, when the function is continuous

5076 on a compact set.

5078 - connected from Multivariate_Analysis. Use it to prove the

5079 intermediate value theorem. Show connectedness of intervals on

5080 linear_continuum_topology).

5082 - first_countable_topology from Multivariate_Analysis. Is used to

5083 show equivalence of properties on the neighbourhood filter of x and

5084 on all sequences converging to x.

5086 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

5087 theorems from Library/FDERIV.thy to Deriv.thy and base the

5088 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

5089 which are restricted to sets, i.e. to represent derivatives from

5090 left or right.

5092 - Removed the within-filter. It is replaced by the principal filter:

5094 F within X = inf F (principal X)

5096 - Introduce "at x within U" as a single constant, "at x" is now an

5097 abbreviation for "at x within UNIV"

5099 - Introduce named theorem collections tendsto_intros,

5100 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

5101 in tendsto_intros (or FDERIV_intros) are also available as

5102 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

5103 is replaced by a congruence rule. This allows to apply them as

5104 intro rules and then proving equivalence by the simplifier.

5106 - Restructured theories in HOL-Complex_Main:

5108 + Moved RealDef and RComplete into Real

5110 + Introduced Topological_Spaces and moved theorems about

5111 topological spaces, filters, limits and continuity to it

5113 + Renamed RealVector to Real_Vector_Spaces

5115 + Split Lim, SEQ, Series into Topological_Spaces,

5116 Real_Vector_Spaces, and Limits

5118 + Moved Ln and Log to Transcendental

5120 + Moved theorems about continuity from Deriv to Topological_Spaces

5122 - Remove various auxiliary lemmas.

5124 INCOMPATIBILITY.

5126 * Nitpick:

5127 - Added option "spy".

5128 - Reduce incidence of "too high arity" errors.

5130 * Sledgehammer:

5131 - Renamed option:

5132 isar_shrink ~> isar_compress

5133 INCOMPATIBILITY.

5134 - Added options "isar_try0", "spy".

5135 - Better support for "isar_proofs".

5136 - MaSh has been fined-tuned and now runs as a local server.

5138 * Improved support for ad hoc overloading of constants (see also

5139 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

5141 * Library/Polynomial.thy:

5142 - Use lifting for primitive definitions.

5143 - Explicit conversions from and to lists of coefficients, used for

5144 generated code.

5145 - Replaced recursion operator poly_rec by fold_coeffs.

5146 - Prefer pre-existing gcd operation for gcd.

5147 - Fact renames:

5148 poly_eq_iff ~> poly_eq_poly_eq_iff

5149 poly_ext ~> poly_eqI

5150 expand_poly_eq ~> poly_eq_iff

5151 IMCOMPATIBILITY.

5153 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

5154 case_of_simps to convert function definitions between a list of

5155 equations with patterns on the lhs and a single equation with case

5156 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

5158 * New Library/FSet.thy: type of finite sets defined as a subtype of

5159 sets defined by Lifting/Transfer.

5161 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

5163 * Consolidation of library theories on product orders:

5165 Product_Lattice ~> Product_Order -- pointwise order on products

5166 Product_ord ~> Product_Lexorder -- lexicographic order on products

5168 INCOMPATIBILITY.

5170 * Imperative-HOL: The MREC combinator is considered legacy and no

5171 longer included by default. INCOMPATIBILITY, use partial_function

5172 instead, or import theory Legacy_Mrec as a fallback.

5174 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

5175 ~~/src/HOL/Algebra/poly. Existing theories should be based on

5176 ~~/src/HOL/Library/Polynomial instead. The latter provides

5177 integration with HOL's type classes for rings. INCOMPATIBILITY.

5179 * HOL-BNF:

5180 - Various improvements to BNF-based (co)datatype package, including

5181 new commands "primrec_new", "primcorec", and

5182 "datatype_new_compat", as well as documentation. See

5183 "datatypes.pdf" for details.

5184 - New "coinduction" method to avoid some boilerplate (compared to

5185 coinduct).

5186 - Renamed keywords:

5187 data ~> datatype_new

5188 codata ~> codatatype

5189 bnf_def ~> bnf

5190 - Renamed many generated theorems, including

5191 discs ~> disc

5192 map_comp' ~> map_comp

5193 map_id' ~> map_id

5194 sels ~> sel

5195 set_map' ~> set_map

5196 sets ~> set

5197 IMCOMPATIBILITY.

5200 *** ML ***

5202 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

5203 "check_property" allows to check specifications of the form "ALL x y

5204 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

5205 Examples.thy in particular.

5207 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

5208 tracing output in the command transaction context instead of physical

5209 stdout. See also Toplevel.debug, Toplevel.debugging and

5210 ML_Compiler.exn_trace.

5212 * ML type "theory" is now immutable, without any special treatment of

5213 drafts or linear updates (which could lead to "stale theory" errors in

5214 the past). Discontinued obsolete operations like Theory.copy,

5215 Theory.checkpoint, and the auxiliary type theory_ref. Minor

5216 INCOMPATIBILITY.

5218 * More uniform naming of goal functions for skipped proofs:

5220 Skip_Proof.prove ~> Goal.prove_sorry

5221 Skip_Proof.prove_global ~> Goal.prove_sorry_global

5223 Minor INCOMPATIBILITY.

5225 * Simplifier tactics and tools use proper Proof.context instead of

5226 historic type simpset. Old-style declarations like addsimps,

5227 addsimprocs etc. operate directly on Proof.context. Raw type simpset

5228 retains its use as snapshot of the main Simplifier context, using

5229 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

5230 old tools by making them depend on (ctxt : Proof.context) instead of

5231 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

5233 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

5234 operate on Proof.context instead of claset, for uniformity with addIs,

5235 addEs, addDs etc. Note that claset_of and put_claset allow to manage

5236 clasets separately from the context.

5238 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

5239 INCOMPATIBILITY, use @{context} instead.

5241 * Antiquotation @{theory_context A} is similar to @{theory A}, but

5242 presents the result as initial Proof.context.

5245 *** System ***

5247 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

5248 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

5250 * Discontinued obsolete isabelle-process options -f and -u (former

5251 administrative aliases of option -e). Minor INCOMPATIBILITY.

5253 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

5254 settings variable.

5256 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

5257 document formats: dvi.gz, ps, ps.gz -- the default document format is

5258 always pdf.

5260 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

5261 specify global resources of the JVM process run by isabelle build.

5263 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

5264 to run Isabelle/Scala source files as standalone programs.

5266 * Improved "isabelle keywords" tool (for old-style ProofGeneral

5267 keyword tables): use Isabelle/Scala operations, which inspect outer

5268 syntax without requiring to build sessions first.

5270 * Sessions may be organized via 'chapter' specifications in the ROOT

5271 file, which determines a two-level hierarchy of browser info. The old

5272 tree-like organization via implicit sub-session relation (with its

5273 tendency towards erratic fluctuation of URLs) has been discontinued.

5274 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

5275 for HTML presentation of theories.

5279 New in Isabelle2013 (February 2013)

5280 -----------------------------------

5282 *** General ***

5284 * Theorem status about oracles and unfinished/failed future proofs is

5285 no longer printed by default, since it is incompatible with

5286 incremental / parallel checking of the persistent document model. ML

5287 function Thm.peek_status may be used to inspect a snapshot of the

5288 ongoing evaluation process. Note that in batch mode --- notably

5289 isabelle build --- the system ensures that future proofs of all

5290 accessible theorems in the theory context are finished (as before).

5292 * Configuration option show_markup controls direct inlining of markup

5293 into the printed representation of formal entities --- notably type

5294 and sort constraints. This enables Prover IDE users to retrieve that

5295 information via tooltips in the output window, for example.

5297 * Command 'ML_file' evaluates ML text from a file directly within the

5298 theory, without any predeclaration via 'uses' in the theory header.

5300 * Old command 'use' command and corresponding keyword 'uses' in the

5301 theory header are legacy features and will be discontinued soon.

5302 Tools that load their additional source files may imitate the

5303 'ML_file' implementation, such that the system can take care of

5304 dependencies properly.

5306 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

5307 is called fastforce / fast_force_tac already since Isabelle2011-1.

5309 * Updated and extended "isar-ref" and "implementation" manual, reduced

5310 remaining material in old "ref" manual.

5312 * Improved support for auxiliary contexts that indicate block structure

5313 for specifications. Nesting of "context fixes ... context assumes ..."

5314 and "class ... context ...".

5316 * Attribute "consumes" allows a negative value as well, which is

5317 interpreted relatively to the total number of premises of the rule in

5318 the target context. This form of declaration is stable when exported

5319 from a nested 'context' with additional assumptions. It is the

5320 preferred form for definitional packages, notably cases/rules produced

5321 in HOL/inductive and HOL/function.

5323 * More informative error messages for Isar proof commands involving

5324 lazy enumerations (method applications etc.).

5326 * Refined 'help' command to retrieve outer syntax commands according

5327 to name patterns (with clickable results).

5330 *** Prover IDE -- Isabelle/Scala/jEdit ***

5332 * Parallel terminal proofs ('by') are enabled by default, likewise

5333 proofs that are built into packages like 'datatype', 'function'. This

5334 allows to "run ahead" checking the theory specifications on the

5335 surface, while the prover is still crunching on internal

5336 justifications. Unfinished / cancelled proofs are restarted as

5337 required to complete full proof checking eventually.

5339 * Improved output panel with tooltips, hyperlinks etc. based on the

5340 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

5341 tooltips leads to some window that supports the same recursively,

5342 which can lead to stacks of tooltips as the semantic document content

5343 is explored. ESCAPE closes the whole stack, individual windows may be

5344 closed separately, or detached to become independent jEdit dockables.

5346 * Improved support for commands that produce graph output: the text

5347 message contains a clickable area to open a new instance of the graph

5348 browser on demand.

5350 * More robust incremental parsing of outer syntax (partial comments,

5351 malformed symbols). Changing the balance of open/close quotes and

5352 comment delimiters works more conveniently with unfinished situations

5353 that frequently occur in user interaction.

5355 * More efficient painting and improved reactivity when editing large

5356 files. More scalable management of formal document content.

5358 * Smarter handling of tracing messages: prover process pauses after

5359 certain number of messages per command transaction, with some user

5360 dialog to stop or continue. This avoids swamping the front-end with

5361 potentially infinite message streams.

5363 * More plugin options and preferences, based on Isabelle/Scala. The

5364 jEdit plugin option panel provides access to some Isabelle/Scala

5365 options, including tuning parameters for editor reactivity and color

5366 schemes.

5368 * Dockable window "Symbols" provides some editing support for Isabelle

5369 symbols.

5371 * Dockable window "Monitor" shows ML runtime statistics. Note that

5372 continuous display of the chart slows down the system.

5374 * Improved editing support for control styles: subscript, superscript,

5375 bold, reset of style -- operating on single symbols or text

5376 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

5378 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

5379 adjust the main text area font size, and its derivatives for output,

5380 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

5381 need to be adapted to local keyboard layouts.

5383 * More reactive completion popup by default: use \t (TAB) instead of

5384 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

5385 also "Plugin Options / SideKick / General / Code Completion Options".

5387 * Implicit check and build dialog of the specified logic session

5388 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

5389 demand, without bundling big platform-dependent heap images in the

5390 Isabelle distribution.

5392 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

5393 from Oracle provide better multi-platform experience. This version is

5394 now bundled exclusively with Isabelle.

5397 *** Pure ***

5399 * Code generation for Haskell: restrict unqualified imports from

5400 Haskell Prelude to a small set of fundamental operations.

5402 * Command 'export_code': relative file names are interpreted

5403 relatively to master directory of current theory rather than the

5404 rather arbitrary current working directory. INCOMPATIBILITY.

5406 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

5407 use regular rule composition via "OF" / "THEN", or explicit proof

5408 structure instead. Note that Isabelle/ML provides a variety of

5409 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

5410 with some care where this is really required.

5412 * Command 'typ' supports an additional variant with explicit sort

5413 constraint, to infer and check the most general type conforming to a

5414 given sort. Example (in HOL):

5416 typ "_ * _ * bool * unit" :: finite

5418 * Command 'locale_deps' visualizes all locales and their relations as

5419 a Hasse diagram.

5422 *** HOL ***

5424 * Sledgehammer:

5426 - Added MaSh relevance filter based on machine-learning; see the

5427 Sledgehammer manual for details.

5428 - Polished Isar proofs generated with "isar_proofs" option.

5429 - Rationalized type encodings ("type_enc" option).

5430 - Renamed "kill_provers" subcommand to "kill_all".

5431 - Renamed options:

5432 isar_proof ~> isar_proofs

5433 isar_shrink_factor ~> isar_shrink

5434 max_relevant ~> max_facts

5435 relevance_thresholds ~> fact_thresholds

5437 * Quickcheck: added an optimisation for equality premises. It is

5438 switched on by default, and can be switched off by setting the

5439 configuration quickcheck_optimise_equality to false.

5441 * Quotient: only one quotient can be defined by quotient_type

5442 INCOMPATIBILITY.

5444 * Lifting:

5445 - generation of an abstraction function equation in lift_definition

5446 - quot_del attribute

5447 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

5449 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

5450 expressions.

5452 * Preprocessing of the code generator rewrites set comprehensions into

5453 pointfree expressions.

5455 * The SMT solver Z3 has now by default a restricted set of directly

5456 supported features. For the full set of features (div/mod, nonlinear

5457 arithmetic, datatypes/records) with potential proof reconstruction

5458 failures, enable the configuration option "z3_with_extensions". Minor

5459 INCOMPATIBILITY.

5461 * Simplified 'typedef' specifications: historical options for implicit

5462 set definition and alternative name have been discontinued. The

5463 former behavior of "typedef (open) t = A" is now the default, but

5464 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

5465 accordingly.

5467 * Removed constant "chars"; prefer "Enum.enum" on type "char"

5468 directly. INCOMPATIBILITY.

5470 * Moved operation product, sublists and n_lists from theory Enum to

5471 List. INCOMPATIBILITY.

5473 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

5475 * Class "comm_monoid_diff" formalises properties of bounded

5476 subtraction, with natural numbers and multisets as typical instances.

5478 * Added combinator "Option.these" with type "'a option set => 'a set".

5480 * Theory "Transitive_Closure": renamed lemmas

5482 reflcl_tranclp -> reflclp_tranclp

5483 rtranclp_reflcl -> rtranclp_reflclp

5485 INCOMPATIBILITY.

5487 * Theory "Rings": renamed lemmas (in class semiring)

5489 left_distrib ~> distrib_right

5490 right_distrib ~> distrib_left

5492 INCOMPATIBILITY.

5494 * Generalized the definition of limits:

5496 - Introduced the predicate filterlim (LIM x F. f x :> G) which

5497 expresses that when the input values x converge to F then the

5498 output f x converges to G.

5500 - Added filters for convergence to positive (at_top) and negative

5501 infinity (at_bot).

5503 - Moved infinity in the norm (at_infinity) from

5504 Multivariate_Analysis to Complex_Main.

5506 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

5507 at_top".

5509 INCOMPATIBILITY.

5511 * Theory "Library/Option_ord" provides instantiation of option type to

5512 lattice type classes.

5514 * Theory "Library/Multiset": renamed

5516 constant fold_mset ~> Multiset.fold

5517 fact fold_mset_commute ~> fold_mset_comm

5519 INCOMPATIBILITY.

5521 * Renamed theory Library/List_Prefix to Library/Sublist, with related

5522 changes as follows.

5524 - Renamed constants (and related lemmas)

5526 prefix ~> prefixeq

5527 strict_prefix ~> prefix

5529 - Replaced constant "postfix" by "suffixeq" with swapped argument

5530 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

5531 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

5532 Renamed lemmas accordingly.

5534 - Added constant "list_hembeq" for homeomorphic embedding on

5535 lists. Added abbreviation "sublisteq" for special case

5536 "list_hembeq (op =)".

5538 - Theory Library/Sublist no longer provides "order" and "bot" type

5539 class instances for the prefix order (merely corresponding locale

5540 interpretations). The type class instances are now in theory

5541 Library/Prefix_Order.

5543 - The sublist relation of theory Library/Sublist_Order is now based

5544 on "Sublist.sublisteq". Renamed lemmas accordingly:

5546 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

5547 le_list_append_mono ~> Sublist.list_hembeq_append_mono

5548 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

5549 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

5550 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

5551 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

5552 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

5553 le_list_drop_many ~> Sublist.sublisteq_drop_many

5554 le_list_filter_left ~> Sublist.sublisteq_filter_left

5555 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

5556 le_list_rev_take_iff ~> Sublist.sublisteq_append

5557 le_list_same_length ~> Sublist.sublisteq_same_length

5558 le_list_take_many_iff ~> Sublist.sublisteq_append'

5559 less_eq_list.drop ~> less_eq_list_drop

5560 less_eq_list.induct ~> less_eq_list_induct

5561 not_le_list_length ~> Sublist.not_sublisteq_length

5563 INCOMPATIBILITY.

5565 * New theory Library/Countable_Set.

5567 * Theory Library/Debug and Library/Parallel provide debugging and

5568 parallel execution for code generated towards Isabelle/ML.

5570 * Theory Library/FuncSet: Extended support for Pi and extensional and

5571 introduce the extensional dependent function space "PiE". Replaced

5572 extensional_funcset by an abbreviation, and renamed lemmas from

5573 extensional_funcset to PiE as follows:

5575 extensional_empty ~> PiE_empty

5576 extensional_funcset_empty_domain ~> PiE_empty_domain

5577 extensional_funcset_empty_range ~> PiE_empty_range

5578 extensional_funcset_arb ~> PiE_arb

5579 extensional_funcset_mem ~> PiE_mem

5580 extensional_funcset_extend_domainI ~> PiE_fun_upd

5581 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

5582 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

5583 card_extensional_funcset ~> card_PiE

5584 finite_extensional_funcset ~> finite_PiE

5586 INCOMPATIBILITY.

5588 * Theory Library/FinFun: theory of almost everywhere constant

5589 functions (supersedes the AFP entry "Code Generation for Functions as

5590 Data").

5592 * Theory Library/Phantom: generic phantom type to make a type

5593 parameter appear in a constant's type. This alternative to adding

5594 TYPE('a) as another parameter avoids unnecessary closures in generated

5595 code.

5597 * Theory Library/RBT_Impl: efficient construction of red-black trees

5598 from sorted associative lists. Merging two trees with rbt_union may

5599 return a structurally different tree than before. Potential

5600 INCOMPATIBILITY.

5602 * Theory Library/IArray: immutable arrays with code generation.

5604 * Theory Library/Finite_Lattice: theory of finite lattices.

5606 * HOL/Multivariate_Analysis: replaced

5608 "basis :: 'a::euclidean_space => nat => real"

5609 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

5611 on euclidean spaces by using the inner product "_ \<bullet> _" with

5612 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

5613 "SUM i : Basis. f i * r i".

5615 With this change the following constants are also changed or removed:

5617 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

5618 a $$ i ~> inner a i (where i : Basis)

5619 cart_base i removed

5620 \<pi>, \<pi>' removed

5622 Theorems about these constants where removed.

5624 Renamed lemmas:

5626 component_le_norm ~> Basis_le_norm

5627 euclidean_eq ~> euclidean_eq_iff

5628 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

5629 euclidean_simps ~> inner_simps

5630 independent_basis ~> independent_Basis

5631 span_basis ~> span_Basis

5632 in_span_basis ~> in_span_Basis

5633 norm_bound_component_le ~> norm_boound_Basis_le

5634 norm_bound_component_lt ~> norm_boound_Basis_lt

5635 component_le_infnorm ~> Basis_le_infnorm

5637 INCOMPATIBILITY.

5639 * HOL/Probability:

5641 - Added simproc "measurable" to automatically prove measurability.

5643 - Added induction rules for sigma sets with disjoint union

5644 (sigma_sets_induct_disjoint) and for Borel-measurable functions

5645 (borel_measurable_induct).

5647 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

5648 projective family).

5650 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

5651 AFP entry "Ordinals_and_Cardinals").

5653 * HOL/BNF: New (co)datatype package based on bounded natural functors

5654 with support for mixed, nested recursion and interesting non-free

5655 datatypes.

5657 * HOL/Finite_Set and Relation: added new set and relation operations

5658 expressed by Finite_Set.fold.

5660 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

5661 trees for the code generator.

5663 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

5664 Lifting/Transfer.

5665 possible INCOMPATIBILITY.

5667 * HOL/Set: renamed Set.project -> Set.filter

5668 INCOMPATIBILITY.

5671 *** Document preparation ***

5673 * Dropped legacy antiquotations "term_style" and "thm_style", since

5674 styles may be given as arguments to "term" and "thm" already.

5675 Discontinued legacy styles "prem1" .. "prem19".

5677 * Default LaTeX rendering for \<euro> is now based on eurosym package,

5678 instead of slightly exotic babel/greek.

5680 * Document variant NAME may use different LaTeX entry point

5681 document/root_NAME.tex if that file exists, instead of the common

5682 document/root.tex.

5684 * Simplified custom document/build script, instead of old-style

5685 document/IsaMakefile. Minor INCOMPATIBILITY.

5688 *** ML ***

5690 * The default limit for maximum number of worker threads is now 8,

5691 instead of 4, in correspondence to capabilities of contemporary

5692 hardware and Poly/ML runtime system.

5694 * Type Seq.results and related operations support embedded error

5695 messages within lazy enumerations, and thus allow to provide

5696 informative errors in the absence of any usable results.

5698 * Renamed Position.str_of to Position.here to emphasize that this is a

5699 formal device to inline positions into message text, but not

5700 necessarily printing visible text.

5703 *** System ***

5705 * Advanced support for Isabelle sessions and build management, see

5706 "system" manual for the chapter of that name, especially the "isabelle

5707 build" tool and its examples. The "isabelle mkroot" tool prepares

5708 session root directories for use with "isabelle build", similar to

5709 former "isabelle mkdir" for "isabelle usedir". Note that this affects

5710 document preparation as well. INCOMPATIBILITY, isabelle usedir /

5711 mkdir / make are rendered obsolete.

5713 * Discontinued obsolete Isabelle/build script, it is superseded by the

5714 regular isabelle build tool. For example:

5716 isabelle build -s -b HOL

5718 * Discontinued obsolete "isabelle makeall".

5720 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

5721 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

5722 provides some traditional targets that invoke "isabelle build". Note

5723 that this is inefficient! Applications of Isabelle/HOL involving

5724 "isabelle make" should be upgraded to use "isabelle build" directly.

5726 * The "isabelle options" tool prints Isabelle system options, as

5727 required for "isabelle build", for example.

5729 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

5730 Minor INCOMPATIBILITY in command-line options.

5732 * The "isabelle install" tool has now a simpler command-line. Minor

5733 INCOMPATIBILITY.

5735 * The "isabelle components" tool helps to resolve add-on components

5736 that are not bundled, or referenced from a bare-bones repository

5737 version of Isabelle.

5739 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

5740 platform family: "linux", "macos", "windows".

5742 * The ML system is configured as regular component, and no longer

5743 picked up from some surrounding directory. Potential INCOMPATIBILITY

5744 for home-made settings.

5746 * Improved ML runtime statistics (heap, threads, future tasks etc.).

5748 * Discontinued support for Poly/ML 5.2.1, which was the last version

5749 without exception positions and advanced ML compiler/toplevel

5750 configuration.

5752 * Discontinued special treatment of Proof General -- no longer guess

5753 PROOFGENERAL_HOME based on accidental file-system layout. Minor

5754 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

5755 settings manually, or use a Proof General version that has been

5756 bundled as Isabelle component.

5760 New in Isabelle2012 (May 2012)

5761 ------------------------------

5763 *** General ***

5765 * Prover IDE (PIDE) improvements:

5767 - more robust Sledgehammer integration (as before the sledgehammer

5768 command-line needs to be typed into the source buffer)

5769 - markup for bound variables

5770 - markup for types of term variables (displayed as tooltips)

5771 - support for user-defined Isar commands within the running session

5772 - improved support for Unicode outside original 16bit range

5773 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

5775 * Forward declaration of outer syntax keywords within the theory

5776 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

5777 commands to be used in the same theory where defined.

5779 * Auxiliary contexts indicate block structure for specifications with

5780 additional parameters and assumptions. Such unnamed contexts may be

5781 nested within other targets, like 'theory', 'locale', 'class',

5782 'instantiation' etc. Results from the local context are generalized

5783 accordingly and applied to the enclosing target context. Example:

5785 context

5786 fixes x y z :: 'a

5787 assumes xy: "x = y" and yz: "y = z"

5788 begin

5790 lemma my_trans: "x = z" using xy yz by simp

5792 end

5794 thm my_trans

5796 The most basic application is to factor-out context elements of

5797 several fixes/assumes/shows theorem statements, e.g. see

5798 ~~/src/HOL/Isar_Examples/Group_Context.thy

5800 Any other local theory specification element works within the "context

5801 ... begin ... end" block as well.

5803 * Bundled declarations associate attributed fact expressions with a

5804 given name in the context. These may be later included in other

5805 contexts. This allows to manage context extensions casually, without

5806 the logical dependencies of locales and locale interpretation. See

5807 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

5809 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

5810 declaration, and results are standardized before being stored. Thus

5811 old-style "standard" after instantiation or composition of facts

5812 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

5813 indices of schematic variables.

5815 * Rule attributes in local theory declarations (e.g. locale or class)

5816 are now statically evaluated: the resulting theorem is stored instead

5817 of the original expression. INCOMPATIBILITY in rare situations, where

5818 the historic accident of dynamic re-evaluation in interpretations

5819 etc. was exploited.

5821 * New tutorial "Programming and Proving in Isabelle/HOL"

5822 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

5823 Structured Isar Proofs" ("isar-overview"), which has been removed. It

5824 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

5825 Logic" as the recommended beginners tutorial, but does not cover all

5826 of the material of that old tutorial.

5828 * Updated and extended reference manuals: "isar-ref",

5829 "implementation", "system"; reduced remaining material in old "ref"

5830 manual.

5833 *** Pure ***

5835 * Command 'definition' no longer exports the foundational "raw_def"

5836 into the user context. Minor INCOMPATIBILITY, may use the regular

5837 "def" result with attribute "abs_def" to imitate the old version.

5839 * Attribute "abs_def" turns an equation of the form "f x y == t" into

5840 "f == %x y. t", which ensures that "simp" or "unfold" steps always

5841 expand it. This also works for object-logic equality. (Formerly

5842 undocumented feature.)

5844 * Sort constraints are now propagated in simultaneous statements, just

5845 like type constraints. INCOMPATIBILITY in rare situations, where

5846 distinct sorts used to be assigned accidentally. For example:

5848 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

5850 lemma "P (x::'a)" and "Q (y::'a::bar)"

5851 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

5853 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

5854 tolerant against multiple unifiers, as long as the final result is

5855 unique. (As before, rules are composed in canonical right-to-left

5856 order to accommodate newly introduced premises.)

5858 * Renamed some inner syntax categories:

5860 num ~> num_token

5861 xnum ~> xnum_token

5862 xstr ~> str_token

5864 Minor INCOMPATIBILITY. Note that in practice "num_const" or

5865 "num_position" etc. are mainly used instead (which also include

5866 position information via constraints).

5868 * Simplified configuration options for syntax ambiguity: see

5869 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

5870 manual. Minor INCOMPATIBILITY.

5872 * Discontinued configuration option "syntax_positions": atomic terms

5873 in parse trees are always annotated by position constraints.

5875 * Old code generator for SML and its commands 'code_module',

5876 'code_library', 'consts_code', 'types_code' have been discontinued.

5877 Use commands of the generic code generator instead. INCOMPATIBILITY.

5879 * Redundant attribute "code_inline" has been discontinued. Use

5880 "code_unfold" instead. INCOMPATIBILITY.

5882 * Dropped attribute "code_unfold_post" in favor of the its dual

5883 "code_abbrev", which yields a common pattern in definitions like

5885 definition [code_abbrev]: "f = t"

5887 INCOMPATIBILITY.

5889 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

5890 instead. INCOMPATIBILITY.

5892 * Discontinued old "prems" fact, which used to refer to the accidental

5893 collection of foundational premises in the context (already marked as

5894 legacy since Isabelle2011).

5897 *** HOL ***

5899 * Type 'a set is now a proper type constructor (just as before

5900 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

5901 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

5902 sets separate, it is often sufficient to rephrase some set S that has

5903 been accidentally used as predicates by "%x. x : S", and some

5904 predicate P that has been accidentally used as set by "{x. P x}".

5905 Corresponding proofs in a first step should be pruned from any

5906 tinkering with former theorems mem_def and Collect_def as far as

5907 possible.

5909 For developments which deliberately mix predicates and sets, a

5910 planning step is necessary to determine what should become a predicate

5911 and what a set. It can be helpful to carry out that step in

5912 Isabelle2011-1 before jumping right into the current release.

5914 * Code generation by default implements sets as container type rather

5915 than predicates. INCOMPATIBILITY.

5917 * New type synonym 'a rel = ('a * 'a) set

5919 * The representation of numerals has changed. Datatype "num"

5920 represents strictly positive binary numerals, along with functions

5921 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent

5922 positive and negated numeric literals, respectively. See also

5923 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

5924 user theories may require adaptations as follows:

5926 - Theorems with number_ring or number_semiring constraints: These

5927 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

5929 - Theories defining numeric types: Remove number, number_semiring,

5930 and number_ring instances. Defer all theorems about numerals until

5931 after classes one and semigroup_add have been instantiated.

5933 - Numeral-only simp rules: Replace each rule having a "number_of v"

5934 pattern with two copies, one for numeral and one for neg_numeral.

5936 - Theorems about subclasses of semiring_1 or ring_1: These classes

5937 automatically support numerals now, so more simp rules and

5938 simprocs may now apply within the proof.

5940 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

5941 Redefine using other integer operations.

5943 * Transfer: New package intended to generalize the existing

5944 "descending" method and related theorem attributes from the Quotient

5945 package. (Not all functionality is implemented yet, but future

5946 development will focus on Transfer as an eventual replacement for the

5947 corresponding parts of the Quotient package.)

5949 - transfer_rule attribute: Maintains a collection of transfer rules,

5950 which relate constants at two different types. Transfer rules may

5951 relate different type instances of the same polymorphic constant,

5952 or they may relate an operation on a raw type to a corresponding

5953 operation on an abstract type (quotient or subtype). For example:

5955 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map

5956 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int

5958 - transfer method: Replaces a subgoal on abstract types with an

5959 equivalent subgoal on the corresponding raw types. Constants are

5960 replaced with corresponding ones according to the transfer rules.

5961 Goals are generalized over all free variables by default; this is

5962 necessary for variables whose types change, but can be overridden

5963 for specific variables with e.g. "transfer fixing: x y z". The

5964 variant transfer' method allows replacing a subgoal with one that

5965 is logically stronger (rather than equivalent).

5967 - relator_eq attribute: Collects identity laws for relators of

5968 various type constructors, e.g. "list_all2 (op =) = (op =)". The

5969 transfer method uses these lemmas to infer transfer rules for

5970 non-polymorphic constants on the fly.

5972 - transfer_prover method: Assists with proving a transfer rule for a

5973 new constant, provided the constant is defined in terms of other

5974 constants that already have transfer rules. It should be applied

5975 after unfolding the constant definitions.

5977 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

5978 from type nat to type int.

5980 * Lifting: New package intended to generalize the quotient_definition

5981 facility of the Quotient package; designed to work with Transfer.

5983 - lift_definition command: Defines operations on an abstract type in

5984 terms of a corresponding operation on a representation

5985 type. Example syntax:

5987 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"

5988 is List.insert

5990 Users must discharge a respectfulness proof obligation when each

5991 constant is defined. (For a type copy, i.e. a typedef with UNIV,

5992 the proof is discharged automatically.) The obligation is

5993 presented in a user-friendly, readable form; a respectfulness

5994 theorem in the standard format and a transfer rule are generated

5995 by the package.

5997 - Integration with code_abstype: For typedefs (e.g. subtypes

5998 corresponding to a datatype invariant, such as dlist),

5999 lift_definition generates a code certificate theorem and sets up

6000 code generation for each constant.

6002 - setup_lifting command: Sets up the Lifting package to work with a

6003 user-defined type. The user must provide either a quotient theorem

6004 or a type_definition theorem. The package configures transfer

6005 rules for equality and quantifiers on the type, and sets up the

6006 lift_definition command to work with the type.

6008 - Usage examples: See Quotient_Examples/Lift_DList.thy,

6009 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

6010 Word/Word.thy and Library/Float.thy.

6012 * Quotient package:

6014 - The 'quotient_type' command now supports a 'morphisms' option with

6015 rep and abs functions, similar to typedef.

6017 - 'quotient_type' sets up new types to work with the Lifting and

6018 Transfer packages, as with 'setup_lifting'.

6020 - The 'quotient_definition' command now requires the user to prove a

6021 respectfulness property at the point where the constant is

6022 defined, similar to lift_definition; INCOMPATIBILITY.

6024 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

6025 accordingly, INCOMPATIBILITY.

6027 * New diagnostic command 'find_unused_assms' to find potentially

6028 superfluous assumptions in theorems using Quickcheck.

6030 * Quickcheck:

6032 - Quickcheck returns variable assignments as counterexamples, which

6033 allows to reveal the underspecification of functions under test.

6034 For example, refuting "hd xs = x", it presents the variable

6035 assignment xs = [] and x = a1 as a counterexample, assuming that

6036 any property is false whenever "hd []" occurs in it.

6038 These counterexample are marked as potentially spurious, as

6039 Quickcheck also returns "xs = []" as a counterexample to the

6040 obvious theorem "hd xs = hd xs".

6042 After finding a potentially spurious counterexample, Quickcheck

6043 continues searching for genuine ones.

6045 By default, Quickcheck shows potentially spurious and genuine

6046 counterexamples. The option "genuine_only" sets quickcheck to only

6047 show genuine counterexamples.

6049 - The command 'quickcheck_generator' creates random and exhaustive

6050 value generators for a given type and operations.

6052 It generates values by using the operations as if they were

6053 constructors of that type.

6055 - Support for multisets.

6057 - Added "use_subtype" options.

6059 - Added "quickcheck_locale" configuration to specify how to process

6060 conjectures in a locale context.

6062 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

6063 and affecting 'rat' and 'real'.

6065 * Sledgehammer:

6066 - Integrated more tightly with SPASS, as described in the ITP 2012

6067 paper "More SPASS with Isabelle".

6068 - Made it try "smt" as a fallback if "metis" fails or times out.

6069 - Added support for the following provers: Alt-Ergo (via Why3 and

6070 TFF1), iProver, iProver-Eq.

6071 - Sped up the minimizer.

6072 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

6073 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

6074 - Renamed "sound" option to "strict".

6076 * Metis: Added possibility to specify lambda translations scheme as a

6077 parenthesized argument (e.g., "by (metis (lifting) ...)").

6079 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

6081 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

6083 * New "case_product" attribute to generate a case rule doing multiple

6084 case distinctions at the same time. E.g.

6086 list.exhaust [case_product nat.exhaust]

6088 produces a rule which can be used to perform case distinction on both

6089 a list and a nat.

6091 * New "eventually_elim" method as a generalized variant of the

6092 eventually_elim* rules. Supports structured proofs.

6094 * Typedef with implicit set definition is considered legacy. Use

6095 "typedef (open)" form instead, which will eventually become the

6096 default.

6098 * Record: code generation can be switched off manually with

6100 declare [[record_coden = false]] -- "default true"

6102 * Datatype: type parameters allow explicit sort constraints.

6104 * Concrete syntax for case expressions includes constraints for source

6105 positions, and thus produces Prover IDE markup for its bindings.

6106 INCOMPATIBILITY for old-style syntax translations that augment the

6107 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of

6108 one_case.

6110 * Clarified attribute "mono_set": pure declaration without modifying

6111 the result of the fact expression.

6113 * More default pred/set conversions on a couple of relation operations

6114 and predicates. Added powers of predicate relations. Consolidation

6115 of some relation theorems:

6117 converse_def ~> converse_unfold

6118 rel_comp_def ~> relcomp_unfold

6119 symp_def ~> (modified, use symp_def and sym_def instead)

6120 transp_def ~> transp_trans

6121 Domain_def ~> Domain_unfold

6122 Range_def ~> Domain_converse [symmetric]

6124 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

6126 See theory "Relation" for examples for making use of pred/set

6127 conversions by means of attributes "to_set" and "to_pred".

6129 INCOMPATIBILITY.

6131 * Renamed facts about the power operation on relations, i.e., relpow

6132 to match the constant's name:

6134 rel_pow_1 ~> relpow_1

6135 rel_pow_0_I ~> relpow_0_I

6136 rel_pow_Suc_I ~> relpow_Suc_I

6137 rel_pow_Suc_I2 ~> relpow_Suc_I2

6138 rel_pow_0_E ~> relpow_0_E

6139 rel_pow_Suc_E ~> relpow_Suc_E

6140 rel_pow_E ~> relpow_E

6141 rel_pow_Suc_D2 ~> relpow_Suc_D2

6142 rel_pow_Suc_E2 ~> relpow_Suc_E2

6143 rel_pow_Suc_D2' ~> relpow_Suc_D2'

6144 rel_pow_E2 ~> relpow_E2

6145 rel_pow_add ~> relpow_add

6146 rel_pow_commute ~> relpow

6147 rel_pow_empty ~> relpow_empty:

6148 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

6149 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

6150 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

6151 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

6152 rel_pow_fun_conv ~> relpow_fun_conv

6153 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

6154 rel_pow_finite_bounded ~> relpow_finite_bounded

6155 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

6156 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

6157 single_valued_rel_pow ~> single_valued_relpow

6159 INCOMPATIBILITY.

6161 * Theory Relation: Consolidated constant name for relation composition

6162 and corresponding theorem names:

6164 - Renamed constant rel_comp to relcomp.

6166 - Dropped abbreviation pred_comp. Use relcompp instead.

6168 - Renamed theorems:

6170 rel_compI ~> relcompI

6171 rel_compEpair ~> relcompEpair

6172 rel_compE ~> relcompE

6173 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

6174 rel_comp_empty1 ~> relcomp_empty1

6175 rel_comp_mono ~> relcomp_mono

6176 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

6177 rel_comp_distrib ~> relcomp_distrib

6178 rel_comp_distrib2 ~> relcomp_distrib2

6179 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

6180 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

6181 single_valued_rel_comp ~> single_valued_relcomp

6182 rel_comp_def ~> relcomp_unfold

6183 converse_rel_comp ~> converse_relcomp

6184 pred_compI ~> relcomppI

6185 pred_compE ~> relcomppE

6186 pred_comp_bot1 ~> relcompp_bot1

6187 pred_comp_bot2 ~> relcompp_bot2

6188 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

6189 pred_comp_mono ~> relcompp_mono

6190 pred_comp_distrib ~> relcompp_distrib

6191 pred_comp_distrib2 ~> relcompp_distrib2

6192 converse_pred_comp ~> converse_relcompp

6194 finite_rel_comp ~> finite_relcomp

6196 set_rel_comp ~> set_relcomp

6198 INCOMPATIBILITY.

6200 * Theory Divides: Discontinued redundant theorems about div and mod.

6201 INCOMPATIBILITY, use the corresponding generic theorems instead.

6203 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

6204 zdiv_self ~> div_self

6205 zmod_self ~> mod_self

6206 zdiv_zero ~> div_0

6207 zmod_zero ~> mod_0

6208 zdiv_zmod_equality ~> div_mod_equality2

6209 zdiv_zmod_equality2 ~> div_mod_equality

6210 zmod_zdiv_trivial ~> mod_div_trivial

6211 zdiv_zminus_zminus ~> div_minus_minus

6212 zmod_zminus_zminus ~> mod_minus_minus

6213 zdiv_zminus2 ~> div_minus_right

6214 zmod_zminus2 ~> mod_minus_right

6215 zdiv_minus1_right ~> div_minus1_right

6216 zmod_minus1_right ~> mod_minus1_right

6217 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

6218 zmod_zmult1_eq ~> mod_mult_right_eq

6219 zpower_zmod ~> power_mod

6220 zdvd_zmod ~> dvd_mod

6221 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

6222 mod_mult_distrib ~> mult_mod_left

6223 mod_mult_distrib2 ~> mult_mod_right

6225 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

6226 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

6228 * Finite_Set.fold now qualified. INCOMPATIBILITY.

6230 * Consolidated theorem names concerning fold combinators:

6232 inf_INFI_fold_inf ~> inf_INF_fold_inf

6233 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

6234 INFI_fold_inf ~> INF_fold_inf

6235 SUPR_fold_sup ~> SUP_fold_sup

6236 union_set ~> union_set_fold

6237 minus_set ~> minus_set_fold

6238 INFI_set_fold ~> INF_set_fold

6239 SUPR_set_fold ~> SUP_set_fold

6240 INF_code ~> INF_set_foldr

6241 SUP_code ~> SUP_set_foldr

6242 foldr.simps ~> foldr.simps (in point-free formulation)

6243 foldr_fold_rev ~> foldr_conv_fold

6244 foldl_fold ~> foldl_conv_fold

6245 foldr_foldr ~> foldr_conv_foldl

6246 foldl_foldr ~> foldl_conv_foldr

6247 fold_set_remdups ~> fold_set_fold_remdups

6248 fold_set ~> fold_set_fold

6249 fold1_set ~> fold1_set_fold

6251 INCOMPATIBILITY.

6253 * Dropped rarely useful theorems concerning fold combinators:

6254 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

6255 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

6256 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

6257 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

6258 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

6259 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

6260 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"

6261 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be

6262 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by

6263 unfolding "foldr_conv_fold" and "foldl_conv_fold".