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

NEWS

author | wenzelm |

Mon May 04 22:11:35 2015 +0200 (2015-05-04) | |

changeset 60261 | e0c3e11e9bea |

parent 60258 | 7364d4316a56 |

child 60265 | 21193e45df14 |

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

tuned;

1 Isabelle NEWS -- history of user-relevant changes

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

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

7 New in Isabelle2015 (May 2015)

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

10 *** General ***

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

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

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

16 context

17 begin

19 private definition ...

20 private lemma ...

22 qualified definition ...

23 qualified lemma ...

25 lemma ...

26 theorem ...

28 end

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

31 naming policy.

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

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

35 INCOMPATIBILITY, use 'sorry' instead.

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

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

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

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

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

43 schematically expanded before search. Search results match the naive

44 expectation more closely, particularly wrt. abbreviations.

45 INCOMPATIBILITY.

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

48 theory context.

50 * Outer syntax commands are managed authentically within the theory

51 context, without implicit global state. Potential for accidental

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

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

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

56 update_semicolons" to remove obsolete semicolons from old theory

57 sources.

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

60 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

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

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

64 method provides basic fact/term matching in addition to

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

66 from matches as well as term patterns within matches. See also

67 ~~/src/HOL/Eisbach/Eisbach.thy and the included examples.

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

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

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

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

76 option jedit_structure_limit determines maximum number of lines to scan

77 in the buffer.

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

80 marker, SideKick parser.

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

83 interpreted semi-formally based on .bib files that happen to be opened

84 in the editor (hyperlinks, completion etc.).

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

87 Options / Text Area).

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

90 display of 'thy_deps', 'locale_deps', 'class_deps' etc.

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

93 restrict the visualized hierarchy.

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

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

99 *** Document preparation ***

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

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

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

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

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

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

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

108 update_header"). Minor INCOMPATIBILITY.

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

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

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

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

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

116 style.

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

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

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

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

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

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

125 tags. Potential INCOMPATIBILITY in exotic situations.

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

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

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

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

131 dynamically in GUI front-ends. Implementations of document

132 antiquotations need to observe the margin explicitly according to

133 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

136 *** Pure ***

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

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

140 these variables become schematic in the instantiated theorem; this

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

142 Configuration option rule_insts_schematic (default false) controls use

143 of schematic variables outside the context. Minor INCOMPATIBILITY,

144 declare rule_insts_schematic = true temporarily and update to use local

145 variable declarations or dummy patterns instead.

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

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

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

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

152 incremented to avoid material in the proof context. Rare

153 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

154 different index.

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

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

158 of numeral signs, particularly in expressions involving infix syntax

159 like "(- 1) ^ n".

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

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

163 token category instead.

166 *** HOL ***

168 * New (co)datatype package:

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

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

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

172 'isabelle doc datatypes' for information on porting.

173 INCOMPATIBILITY.

174 - Renamed theorems:

175 disc_corec ~> corec_disc

176 disc_corec_iff ~> corec_disc_iff

177 disc_exclude ~> distinct_disc

178 disc_exhaust ~> exhaust_disc

179 disc_map_iff ~> map_disc_iff

180 sel_corec ~> corec_sel

181 sel_exhaust ~> exhaust_sel

182 sel_map ~> map_sel

183 sel_set ~> set_sel

184 sel_split ~> split_sel

185 sel_split_asm ~> split_sel_asm

186 strong_coinduct ~> coinduct_strong

187 weak_case_cong ~> case_cong_weak

188 INCOMPATIBILITY.

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

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

191 INCOMPATIBILITY.

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

193 consequences of other set rules "by auto".

194 INCOMPATIBILITY.

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

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

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

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

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

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

201 INCOMPATIBILITY.

202 - Renamed theories:

203 BNF_Comp ~> BNF_Composition

204 BNF_FP_Base ~> BNF_Fixpoint_Base

205 BNF_GFP ~> BNF_Greatest_Fixpoint

206 BNF_LFP ~> BNF_Least_Fixpoint

207 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

208 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

209 INCOMPATIBILITY.

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

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

212 Lifting_Product and Lifting_Option from Main became obsolete and

213 were removed. Changed definitions of the relators rel_prod and

214 rel_sum (using inductive).

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

216 of rel_prod_def and rel_sum_def.

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

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

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

220 constructors, case combinators, discriminators, selectors and

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

222 rules.

224 * Old datatype package:

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

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

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

228 'isabelle doc datatypes' for information on porting.

229 INCOMPATIBILITY.

230 - Renamed theorems:

231 weak_case_cong ~> case_cong_weak

232 INCOMPATIBILITY.

233 - Renamed theory:

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

235 INCOMPATIBILITY.

237 * Nitpick:

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

239 operations.

241 * Sledgehammer:

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

243 default.

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

245 source. The "z3_non_commercial" option is discontinued.

246 - Minimization is now always enabled by default.

247 Removed sub-command:

248 min

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

250 dramatically improved.

251 - Improved support for CVC4 and veriT.

253 * Old and new SMT modules:

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

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

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

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

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

259 point to it.

260 INCOMPATIBILITY.

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

262 INCOMPATIBILITY.

263 - New option 'smt_reconstruction_step_timeout' to limit the

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

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

266 method, especially runtime statistics of Z3 proof reconstruction.

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

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

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

271 lifting, and avoids tedious workarounds.

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

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

275 Minor INCOMPATIBILITY.

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

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

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

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

282 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

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

285 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

287 * Class linordered_semidom really requires no zero divisors.

288 INCOMPATIBILITY.

290 * Classes division_ring, field and linordered_field always demand

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

292 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

294 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

295 additive inverse operation. INCOMPATIBILITY.

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

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

299 INCOMPATIBILITY: type constraints may be necessary.

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

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

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

304 needed.

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

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

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

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

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

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

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

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

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

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

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

319 "nat_floor"/"nat_ceiling".

321 * Qualified some duplicated fact names required for boostrapping the

322 type class hierarchy:

323 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

324 field_inverse_zero ~> inverse_zero

325 field_divide_inverse ~> divide_inverse

326 field_inverse ~> left_inverse

327 Minor INCOMPATIBILITY.

329 * Eliminated fact duplicates:

330 mult_less_imp_less_right ~> mult_right_less_imp_less

331 mult_less_imp_less_left ~> mult_left_less_imp_less

332 Minor INCOMPATIBILITY.

334 * Fact consolidation: even_less_0_iff is subsumed by

335 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

337 * Generalized and consolidated some theorems concerning divsibility:

338 dvd_reduce ~> dvd_add_triv_right_iff

339 dvd_plus_eq_right ~> dvd_add_right_iff

340 dvd_plus_eq_left ~> dvd_add_left_iff

341 Minor INCOMPATIBILITY.

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

344 and part of theory Main.

345 even_def ~> even_iff_mod_2_eq_zero

346 INCOMPATIBILITY.

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

349 INCOMPATIBILITY.

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

352 Fact rename:

353 listsum_def ~> listsum.eq_foldr

354 INCOMPATIBILITY.

356 * Product over lists via constant "listprod".

358 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

359 Cons_nth_drop_Suc.

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

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

363 HOL/Codegenerator_Test/Code_Test* for examples.

365 * Library/Multiset:

366 - Introduced "replicate_mset" operation.

367 - Introduced alternative characterizations of the multiset ordering in

368 "Library/Multiset_Order".

369 - Renamed multiset ordering:

370 <# ~> #<#

371 <=# ~> #<=#

372 \<subset># ~> #\<subset>#

373 \<subseteq># ~> #\<subseteq>#

374 INCOMPATIBILITY.

375 - Introduced abbreviations for ill-named multiset operations:

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

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

378 INCOMPATIBILITY.

379 - Renamed

380 in_multiset_of ~> in_multiset_in_set

381 Multiset.fold ~> fold_mset

382 Multiset.filter ~> filter_mset

383 INCOMPATIBILITY.

384 - Removed mcard, is equal to size.

385 - Added attributes:

386 image_mset.id [simp]

387 image_mset_id [simp]

388 elem_multiset_of_set [simp, intro]

389 comp_fun_commute_plus_mset [simp]

390 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

391 in_mset_fold_plus_iff [iff]

392 set_of_Union_mset [simp]

393 in_Union_mset_iff [iff]

394 INCOMPATIBILITY.

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

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

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

399 argument. Minor INCOMPATIBILITY.

401 * HOL-Decision_Procs: New counterexample generator quickcheck

402 [approximation] for inequalities of transcendental functions. Uses

403 hardware floating point arithmetic to randomly discover potential

404 counterexamples. Counterexamples are certified with the "approximation"

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

406 examples.

408 * HOL-Probability: Reworked measurability prover

409 - applies destructor rules repeatedly

410 - removed application splitting (replaced by destructor rule)

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

412 projection

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

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

418 *** ML ***

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

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

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

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

424 contemporary applications use the strict Name_Space.check (and

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

426 INCOMPATIBILITY in rare applications of Name_Space.intern.

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

429 ERROR instead of internal Toplevel.UNDEF.

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

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

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

435 INCOMPATIBILITY.

437 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

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

439 Multithreading.synchronized and its high-level derivative

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

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

442 nested.

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

445 change of semantics with minimal potential for INCOMPATIBILITY.

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

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

449 available as Thm.global_ctyp_of and Thm.global_cterm_of.

450 INCOMPATIBILITY.

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

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

454 Thm.term_of etc.

456 * Proper context for various elementary tactics: assume_tac,

457 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

458 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

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

461 PARALLEL_GOALS.

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

464 which also allows to specify a fork priority.

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

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

468 markup). Minor INCOMPATIBILITY.

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

471 Input.source (with formal position information).

474 *** System ***

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

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

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

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

482 be externally triggered using an appropriate ROOT file plus a

483 corresponding theory. Parametrization is possible using environment

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

485 INCOMPATIBILITY.

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

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

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

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

492 menu Global Options / Appearance.

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

495 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

499 New in Isabelle2014 (August 2014)

500 ---------------------------------

502 *** General ***

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

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

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

507 environment is restricted to the Standard ML implementation of

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

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

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

511 some examples.

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

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

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

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

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

518 restore the previous behavior. INCOMPATIBILITY, especially where

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

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

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

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

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

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

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

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

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

529 exception. Potential INCOMPATIBILITY for non-conformant tactical

530 proof tools.

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

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

534 supports input via ` (backquote).

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

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

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

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

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

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

543 Minor INCOMPATIBILITY.

545 * Discontinued legacy_isub_isup, which was a temporary workaround for

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

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

548 INCOMPATIBILITY.

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

551 which results in an active hyperlink within the text.

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

554 not check existence within the file-system.

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

557 isar-ref, jedit, system.

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

562 * Improved Document panel: simplified interaction where every single

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

564 buffer.

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

567 to PIDE hyperlinks.

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

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

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

573 auxiliary ML files.

575 * Improved syntactic and semantic completion mechanism, with simple

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

577 file-name completion, spell-checker completion.

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

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

581 keystrokes with slow / remote graphics displays.

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

584 item, depending on Isabelle options.

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

587 selections, rectangular selections, rectangular selection as "tall

588 caret".

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

591 completion popup and context-menu.

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

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

595 operations for the context. Minor incompatibility in keyboard

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

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

599 to highlight text via regular expression.

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

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

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

604 "isabelle jedit -m MODE".

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

607 networking operations instead of jEdit virtual file-systems.

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

610 imports) are automatically removed from the document model.

612 * Improved monitor panel.

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

615 more robust treatment of threads and interrupts.

617 * Improved management of dockable windows: clarified keyboard focus

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

619 "Detach" a copy where this makes sense.

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

622 simplification process, enabled by the "simp_trace_new" attribute

623 within the context.

626 *** Pure ***

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

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

630 that is not immediately visible. INCOMPATIBILITY, use regular

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

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

633 finished trivially if the underlying class definition is made vacuous

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

635 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

636 Axclass.arity_axiomatization.

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

639 qualified. Rare INCOMPATIBILITY, but with potentially serious

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

641 renaming needs to be applied:

643 == ~> Pure.eq

644 ==> ~> Pure.imp

645 all ~> Pure.all

646 TYPE ~> Pure.type

647 dummy_pattern ~> Pure.dummy_pattern

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

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

651 old constants:

653 setup {*

654 fn thy => thy

655 |> Sign.root_path

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

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

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

659 |> Sign.restore_naming thy

660 *}

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

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

664 the auxiliary aliases are deleted.

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

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

668 instantiated theorem.

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

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

672 where instantiations with schematic variables are intended (for

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

674 following temporary definition may help to port old applications:

676 attribute_setup standard =

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

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

680 attributed fact expressions (concerning background theory, declared

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

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

683 primitive Thm.assume_hyps.

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

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

687 differently, e.g. via cartouches).

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

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

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

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

696 *** HOL ***

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

699 language requirements. INCOMPATIBILITY.

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

702 INCOMPATIBILITY.

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

705 INCOMPATIBILITY.

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

708 option. Minor INCOMPATIBILITY.

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

711 INCOMPATIBILITY.

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

714 with the given constants.

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

717 operations on records.

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

720 ML. Minor INCOMPATIBILITY.

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

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

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

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

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

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

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

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

733 again in the future. INCOMPATIBILITY.

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

736 spurious crashes and other surprises. Potential INCOMPATIBILITY.

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

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

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

741 part of theory "Main".

743 Theory renamings:

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

745 Library/Wfrec.thy ~> Wfrec.thy

746 Library/Zorn.thy ~> Zorn.thy

747 Cardinals/Order_Relation.thy ~> Order_Relation.thy

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

749 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

750 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

751 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

752 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

753 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

754 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

755 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

756 BNF/BNF_Comp.thy ~> BNF_Comp.thy

757 BNF/BNF_Def.thy ~> BNF_Def.thy

758 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

759 BNF/BNF_GFP.thy ~> BNF_GFP.thy

760 BNF/BNF_LFP.thy ~> BNF_LFP.thy

761 BNF/BNF_Util.thy ~> BNF_Util.thy

762 BNF/Coinduction.thy ~> Coinduction.thy

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

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

765 BNF/Examples/* ~> BNF_Examples/*

767 New theories:

768 Wellorder_Extension.thy (split from Zorn.thy)

769 Library/Cardinal_Notations.thy

770 Library/BNF_Axomatization.thy

771 BNF_Examples/Misc_Primcorec.thy

772 BNF_Examples/Stream_Processor.thy

774 Discontinued theories:

775 BNF/BNF.thy

776 BNF/Equiv_Relations_More.thy

778 INCOMPATIBILITY.

780 * New (co)datatype package:

781 - Command 'primcorec' is fully implemented.

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

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

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

785 (co)datatypes with Transfer.

786 - Renamed commands:

787 datatype_new_compat ~> datatype_compat

788 primrec_new ~> primrec

789 wrap_free_constructors ~> free_constructors

790 INCOMPATIBILITY.

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

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

793 INCOMPATIBILITY.

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

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

796 using "prim(co)rec".

797 INCOMPATIBILITY.

798 - No discriminators are generated for nullary constructors by

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

800 INCOMPATIBILITY.

801 - No discriminators or selectors are generated by default by

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

803 "discs_sels" option is passed.

804 INCOMPATIBILITY.

806 * Old datatype package:

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

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

809 "sum.case"). INCOMPATIBILITY.

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

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

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

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

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

816 BNF-based datatype package.

818 Renamed constants:

819 Option.set ~> set_option

820 Option.map ~> map_option

821 option_rel ~> rel_option

823 Renamed theorems:

824 set_def ~> set_rec[abs_def]

825 map_def ~> map_rec[abs_def]

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

827 option.recs ~> option.rec

828 list_all2_def ~> list_all2_iff

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

830 map.simps ~> list.map

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

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

833 the.simps ~> option.sel

835 INCOMPATIBILITY.

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

838 sum_map ~> map_sum

839 map_pair ~> map_prod

840 prod_rel ~> rel_prod

841 sum_rel ~> rel_sum

842 fun_rel ~> rel_fun

843 set_rel ~> rel_set

844 filter_rel ~> rel_filter

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

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

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

849 INCOMPATIBILITY.

851 * Lifting and Transfer:

852 - a type variable as a raw type is supported

853 - stronger reflexivity prover

854 - rep_eq is always generated by lift_definition

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

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

857 + relator_eq, relator_mono, relator_distr, relator_domain,

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

859 right_unique, right_total, left_unique, left_total are proved

860 automatically

861 + definition of a predicator is generated automatically

862 + simplification rules for a predicator definition are proved

863 automatically for datatypes

864 - consolidation of the setup of Lifting/Transfer

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

866 more

867 Minor INCOMPATIBILITY.

868 + left_total and left_unique rules are now transfer rules

869 (reflexivity_rule attribute not needed anymore)

870 INCOMPATIBILITY.

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

872 relator_domain theorems (=> more natural statement)

873 INCOMPATIBILITY.

874 - registration of code equations is more robust

875 Potential INCOMPATIBILITY.

876 - respectfulness proof obligation is preprocessed to a more readable

877 form

878 Potential INCOMPATIBILITY.

879 - eq_onp is always unfolded in respectfulness proof obligation

880 Potential INCOMPATIBILITY.

881 - unregister lifting setup for Code_Numeral.integer and

882 Code_Numeral.natural

883 Potential INCOMPATIBILITY.

884 - Lifting.invariant -> eq_onp

885 INCOMPATIBILITY.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

904 Plugin Options / Isabelle / General.

906 * Sledgehammer:

907 - Z3 can now produce Isar proofs.

908 - MaSh overhaul:

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

910 Python and increase performance and reliability.

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

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

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

914 Options / Isabelle / General to "none".

915 - New option:

916 smt_proofs

917 - Renamed options:

918 isar_compress ~> compress

919 isar_try0 ~> try0

921 INCOMPATIBILITY.

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

925 * Nitpick:

926 - Fixed soundness bug whereby mutually recursive datatypes could

927 take infinite values.

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

929 "Abs_Integ" and "Rep_Integ".

930 - Removed "std" option.

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

932 "hide_types".

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

935 (full_types)' instead. INCOMPATIBILITY.

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

939 * Adjustion of INF and SUP operations:

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

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

942 SUP instead uniformly.

943 - More aggressive normalization of expressions involving INF and Inf

944 or SUP and Sup.

945 - INF_image and SUP_image do not unfold composition.

946 - Dropped facts INF_comp, SUP_comp.

947 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

948 simplifier implication in premises. Generalize and replace former

949 INT_cong, SUP_cong

951 INCOMPATIBILITY.

953 * SUP and INF generalized to conditionally_complete_lattice.

955 * Swapped orientation of facts image_comp and vimage_comp:

957 image_compose ~> image_comp [symmetric]

958 image_comp ~> image_comp [symmetric]

959 vimage_compose ~> vimage_comp [symmetric]

960 vimage_comp ~> vimage_comp [symmetric]

962 INCOMPATIBILITY.

964 * Theory reorganization: split of Big_Operators.thy into

965 Groups_Big.thy and Lattices_Big.thy.

967 * Consolidated some facts about big group operators:

969 setsum_0' ~> setsum.neutral

970 setsum_0 ~> setsum.neutral_const

971 setsum_addf ~> setsum.distrib

972 setsum_cartesian_product ~> setsum.cartesian_product

973 setsum_cases ~> setsum.If_cases

974 setsum_commute ~> setsum.commute

975 setsum_cong ~> setsum.cong

976 setsum_delta ~> setsum.delta

977 setsum_delta' ~> setsum.delta'

978 setsum_diff1' ~> setsum.remove

979 setsum_empty ~> setsum.empty

980 setsum_infinite ~> setsum.infinite

981 setsum_insert ~> setsum.insert

982 setsum_inter_restrict'' ~> setsum.inter_filter

983 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

984 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

985 setsum_mono_zero_left ~> setsum.mono_neutral_left

986 setsum_mono_zero_right ~> setsum.mono_neutral_right

987 setsum_reindex ~> setsum.reindex

988 setsum_reindex_cong ~> setsum.reindex_cong

989 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

990 setsum_restrict_set ~> setsum.inter_restrict

991 setsum_Plus ~> setsum.Plus

992 setsum_setsum_restrict ~> setsum.commute_restrict

993 setsum_Sigma ~> setsum.Sigma

994 setsum_subset_diff ~> setsum.subset_diff

995 setsum_Un_disjoint ~> setsum.union_disjoint

996 setsum_UN_disjoint ~> setsum.UNION_disjoint

997 setsum_Un_Int ~> setsum.union_inter

998 setsum_Union_disjoint ~> setsum.Union_disjoint

999 setsum_UNION_zero ~> setsum.Union_comp

1000 setsum_Un_zero ~> setsum.union_inter_neutral

1001 strong_setprod_cong ~> setprod.strong_cong

1002 strong_setsum_cong ~> setsum.strong_cong

1003 setprod_1' ~> setprod.neutral

1004 setprod_1 ~> setprod.neutral_const

1005 setprod_cartesian_product ~> setprod.cartesian_product

1006 setprod_cong ~> setprod.cong

1007 setprod_delta ~> setprod.delta

1008 setprod_delta' ~> setprod.delta'

1009 setprod_empty ~> setprod.empty

1010 setprod_infinite ~> setprod.infinite

1011 setprod_insert ~> setprod.insert

1012 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

1013 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

1014 setprod_mono_one_left ~> setprod.mono_neutral_left

1015 setprod_mono_one_right ~> setprod.mono_neutral_right

1016 setprod_reindex ~> setprod.reindex

1017 setprod_reindex_cong ~> setprod.reindex_cong

1018 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

1019 setprod_Sigma ~> setprod.Sigma

1020 setprod_subset_diff ~> setprod.subset_diff

1021 setprod_timesf ~> setprod.distrib

1022 setprod_Un2 ~> setprod.union_diff2

1023 setprod_Un_disjoint ~> setprod.union_disjoint

1024 setprod_UN_disjoint ~> setprod.UNION_disjoint

1025 setprod_Un_Int ~> setprod.union_inter

1026 setprod_Union_disjoint ~> setprod.Union_disjoint

1027 setprod_Un_one ~> setprod.union_inter_neutral

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

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

1031 Dropped setsum_reindex_id, setprod_reindex_id

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

1034 INCOMPATIBILITY.

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

1038 Fact consolidations:

1039 min_max.inf_assoc ~> min.assoc

1040 min_max.inf_commute ~> min.commute

1041 min_max.inf_left_commute ~> min.left_commute

1042 min_max.inf_idem ~> min.idem

1043 min_max.inf_left_idem ~> min.left_idem

1044 min_max.inf_right_idem ~> min.right_idem

1045 min_max.sup_assoc ~> max.assoc

1046 min_max.sup_commute ~> max.commute

1047 min_max.sup_left_commute ~> max.left_commute

1048 min_max.sup_idem ~> max.idem

1049 min_max.sup_left_idem ~> max.left_idem

1050 min_max.sup_inf_distrib1 ~> max_min_distrib2

1051 min_max.sup_inf_distrib2 ~> max_min_distrib1

1052 min_max.inf_sup_distrib1 ~> min_max_distrib2

1053 min_max.inf_sup_distrib2 ~> min_max_distrib1

1054 min_max.distrib ~> min_max_distribs

1055 min_max.inf_absorb1 ~> min.absorb1

1056 min_max.inf_absorb2 ~> min.absorb2

1057 min_max.sup_absorb1 ~> max.absorb1

1058 min_max.sup_absorb2 ~> max.absorb2

1059 min_max.le_iff_inf ~> min.absorb_iff1

1060 min_max.le_iff_sup ~> max.absorb_iff2

1061 min_max.inf_le1 ~> min.cobounded1

1062 min_max.inf_le2 ~> min.cobounded2

1063 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

1064 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

1065 min_max.le_infI1 ~> min.coboundedI1

1066 min_max.le_infI2 ~> min.coboundedI2

1067 min_max.le_supI1 ~> max.coboundedI1

1068 min_max.le_supI2 ~> max.coboundedI2

1069 min_max.less_infI1 ~> min.strict_coboundedI1

1070 min_max.less_infI2 ~> min.strict_coboundedI2

1071 min_max.less_supI1 ~> max.strict_coboundedI1

1072 min_max.less_supI2 ~> max.strict_coboundedI2

1073 min_max.inf_mono ~> min.mono

1074 min_max.sup_mono ~> max.mono

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

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

1077 min_max.le_inf_iff ~> min.bounded_iff

1078 min_max.le_sup_iff ~> max.bounded_iff

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

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

1082 max.left_commute, max.left_idem directly.

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

1085 min.cobounded2, max.cobounded1m max.cobounded2 directly.

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

1089 INCOMPATIBILITY.

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

1092 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

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

1095 INCOMPATIBILITY.

1097 * Fact generalization and consolidation:

1098 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

1100 INCOMPATIBILITY.

1102 * Purely algebraic definition of even. Fact generalization and

1103 consolidation:

1104 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

1105 even_zero_(nat|int) ~> even_zero

1107 INCOMPATIBILITY.

1109 * Abolished neg_numeral.

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

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

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

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

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

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

1116 - Syntax for negative numerals is mere input syntax.

1118 INCOMPATIBILITY.

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

1122 add_assoc ~> add.assoc

1123 add_commute ~> add.commute

1124 add_left_commute ~> add.left_commute

1125 mult_assoc ~> mult.assoc

1126 mult_commute ~> mult.commute

1127 mult_left_commute ~> mult.left_commute

1128 nat_add_assoc ~> add.assoc

1129 nat_add_commute ~> add.commute

1130 nat_add_left_commute ~> add.left_commute

1131 nat_mult_assoc ~> mult.assoc

1132 nat_mult_commute ~> mult.commute

1133 eq_assoc ~> iff_assoc

1134 eq_left_commute ~> iff_left_commute

1136 INCOMPATIBILITY.

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

1139 Prefer ac_simps instead, or specify rules

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

1142 * Elimination of fact duplicates:

1143 equals_zero_I ~> minus_unique

1144 diff_eq_0_iff_eq ~> right_minus_eq

1145 nat_infinite ~> infinite_UNIV_nat

1146 int_infinite ~> infinite_UNIV_int

1148 INCOMPATIBILITY.

1150 * Fact name consolidation:

1151 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

1152 minus_le_self_iff ~> neg_less_eq_nonneg

1153 le_minus_self_iff ~> less_eq_neg_nonpos

1154 neg_less_nonneg ~> neg_less_pos

1155 less_minus_self_iff ~> less_neg_neg [simp]

1157 INCOMPATIBILITY.

1159 * More simplification rules on unary and binary minus:

1160 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

1161 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

1162 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

1163 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

1164 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

1165 been taken away from fact collections algebra_simps and field_simps.

1166 INCOMPATIBILITY.

1168 To restore proofs, the following patterns are helpful:

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

1171 Consider simplification with algebra_simps or field_simps.

1173 b) Lifting rules from addition to subtraction:

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

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

1177 Consider simplification with algebra_simps or field_simps;

1178 or the brute way with

1179 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

1181 * Introduce bdd_above and bdd_below in theory

1182 Conditionally_Complete_Lattices, use them instead of explicitly

1183 stating boundedness of sets.

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

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

1187 additional case in fixpoint induction proofs. INCOMPATIBILITY.

1189 * Removed and renamed theorems in Series:

1190 summable_le ~> suminf_le

1191 suminf_le ~> suminf_le_const

1192 series_pos_le ~> setsum_le_suminf

1193 series_pos_less ~> setsum_less_suminf

1194 suminf_ge_zero ~> suminf_nonneg

1195 suminf_gt_zero ~> suminf_pos

1196 suminf_gt_zero_iff ~> suminf_pos_iff

1197 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

1198 suminf_0_le ~> suminf_nonneg [rotate]

1199 pos_summable ~> summableI_nonneg_bounded

1200 ratio_test ~> summable_ratio_test

1202 removed series_zero, replaced by sums_finite

1204 removed auxiliary lemmas:

1206 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

1207 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

1208 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

1209 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

1210 summable_convergent_sumr_iff, sumr_diff_mult_const

1212 INCOMPATIBILITY.

1214 * Replace (F)DERIV syntax by has_derivative:

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

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

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

1221 - removed constant isDiff

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

1224 input syntax.

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

1228 - Renamed FDERIV_... lemmas to has_derivative_...

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

1232 - removed DERIV_intros, has_derivative_eq_intros

1234 - introduced derivative_intros and deriative_eq_intros which

1235 includes now rules for DERIV, has_derivative and

1236 has_vector_derivative.

1238 - Other renamings:

1239 differentiable_def ~> real_differentiable_def

1240 differentiableE ~> real_differentiableE

1241 fderiv_def ~> has_derivative_at

1242 field_fderiv_def ~> field_has_derivative_at

1243 isDiff_der ~> differentiable_def

1244 deriv_fderiv ~> has_field_derivative_def

1245 deriv_def ~> DERIV_def

1247 INCOMPATIBILITY.

1249 * Include more theorems in continuous_intros. Remove the

1250 continuous_on_intros, isCont_intros collections, these facts are now

1251 in continuous_intros.

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

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

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

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

1258 are available as the lemma collection legacy_Complex_simps. This

1259 especially removes

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

1263 Instead the reverse direction is supported with

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

1266 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

1268 Renamings:

1269 Re/Im ~> complex.sel

1270 complex_Re/Im_zero ~> zero_complex.sel

1271 complex_Re/Im_add ~> plus_complex.sel

1272 complex_Re/Im_minus ~> uminus_complex.sel

1273 complex_Re/Im_diff ~> minus_complex.sel

1274 complex_Re/Im_one ~> one_complex.sel

1275 complex_Re/Im_mult ~> times_complex.sel

1276 complex_Re/Im_inverse ~> inverse_complex.sel

1277 complex_Re/Im_scaleR ~> scaleR_complex.sel

1278 complex_Re/Im_i ~> ii.sel

1279 complex_Re/Im_cnj ~> cnj.sel

1280 Re/Im_cis ~> cis.sel

1282 complex_divide_def ~> divide_complex_def

1283 complex_norm_def ~> norm_complex_def

1284 cmod_def ~> norm_complex_de

1286 Removed theorems:

1287 complex_zero_def

1288 complex_add_def

1289 complex_minus_def

1290 complex_diff_def

1291 complex_one_def

1292 complex_mult_def

1293 complex_inverse_def

1294 complex_scaleR_def

1296 INCOMPATIBILITY.

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

1299 Conditionally_Complete_Lattices. INCOMPATIBILITY.

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

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

1304 is subsumed by session Kleene_Algebra in AFP.

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

1307 lifting setup is unregistered. INCOMPATIBILITY.

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

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

1312 INCOMPATIBILITY.

1314 * HOL-Word:

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

1316 of "word_arith_wis".

1317 - Dropped first (duplicated) element in fact collections

1318 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

1319 "uint_word_arith_bintrs".

1321 * HOL-Number_Theory:

1322 - consolidated the proofs of the binomial theorem

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

1324 - no more references to Old_Number_Theory in the HOL libraries

1325 (except the AFP)

1327 INCOMPATIBILITY.

1329 * HOL-Multivariate_Analysis:

1330 - Type class ordered_real_vector for ordered vector spaces.

1331 - New theory Complex_Basic_Analysis defining complex derivatives,

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

1333 - Changed order of ordered_euclidean_space to be compatible with

1334 pointwise ordering on products. Therefore instance of

1335 conditionally_complete_lattice and ordered_real_vector.

1336 INCOMPATIBILITY: use box instead of greaterThanLessThan or

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

1338 intervals.

1339 - removed dependencies on type class ordered_euclidean_space with

1340 introduction of "cbox" on euclidean_space

1341 - renamed theorems:

1342 interval ~> box

1343 mem_interval ~> mem_box

1344 interval_eq_empty ~> box_eq_empty

1345 interval_ne_empty ~> box_ne_empty

1346 interval_sing(1) ~> cbox_sing

1347 interval_sing(2) ~> box_sing

1348 subset_interval_imp ~> subset_box_imp

1349 subset_interval ~> subset_box

1350 open_interval ~> open_box

1351 closed_interval ~> closed_cbox

1352 interior_closed_interval ~> interior_cbox

1353 bounded_closed_interval ~> bounded_cbox

1354 compact_interval ~> compact_cbox

1355 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

1356 bounded_subset_closed_interval ~> bounded_subset_cbox

1357 mem_interval_componentwiseI ~> mem_box_componentwiseI

1358 convex_box ~> convex_prod

1359 rel_interior_real_interval ~> rel_interior_real_box

1360 convex_interval ~> convex_box

1361 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

1362 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

1363 content_closed_interval' ~> content_cbox'

1364 elementary_subset_interval ~> elementary_subset_box

1365 diameter_closed_interval ~> diameter_cbox

1366 frontier_closed_interval ~> frontier_cbox

1367 frontier_open_interval ~> frontier_box

1368 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

1369 closure_open_interval ~> closure_box

1370 open_closed_interval_convex ~> open_cbox_convex

1371 open_interval_midpoint ~> box_midpoint

1372 content_image_affinity_interval ~> content_image_affinity_cbox

1373 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

1374 bounded_interval ~> bounded_closed_interval + bounded_boxes

1376 - respective theorems for intervals over the reals:

1377 content_closed_interval + content_cbox

1378 has_integral + has_integral_real

1379 fine_division_exists + fine_division_exists_real

1380 has_integral_null + has_integral_null_real

1381 tagged_division_union_interval + tagged_division_union_interval_real

1382 has_integral_const + has_integral_const_real

1383 integral_const + integral_const_real

1384 has_integral_bound + has_integral_bound_real

1385 integrable_continuous + integrable_continuous_real

1386 integrable_subinterval + integrable_subinterval_real

1387 has_integral_reflect_lemma + has_integral_reflect_lemma_real

1388 integrable_reflect + integrable_reflect_real

1389 integral_reflect + integral_reflect_real

1390 image_affinity_interval + image_affinity_cbox

1391 image_smult_interval + image_smult_cbox

1392 integrable_const + integrable_const_ivl

1393 integrable_on_subinterval + integrable_on_subcbox

1395 - renamed theorems:

1396 derivative_linear ~> has_derivative_bounded_linear

1397 derivative_is_linear ~> has_derivative_linear

1398 bounded_linear_imp_linear ~> bounded_linear.linear

1400 * HOL-Probability:

1401 - Renamed positive_integral to nn_integral:

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

1404 positive_integral_positive ~> nn_integral_nonneg

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

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

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

1411 integral_zero ~> integral_zero / integrable_zero

1412 integral_minus ~> integral_minus / integrable_minus

1413 integral_add ~> integral_add / integrable_add

1414 integral_diff ~> integral_diff / integrable_diff

1415 integral_setsum ~> integral_setsum / integrable_setsum

1416 integral_multc ~> integral_mult_left / integrable_mult_left

1417 integral_cmult ~> integral_mult_right / integrable_mult_right

1418 integral_triangle_inequality~> integral_norm_bound

1419 integrable_nonneg ~> integrableI_nonneg

1420 integral_positive ~> integral_nonneg_AE

1421 integrable_abs_iff ~> integrable_abs_cancel

1422 positive_integral_lim_INF ~> nn_integral_liminf

1423 lebesgue_real_affine ~> lborel_real_affine

1424 borel_integral_has_integral ~> has_integral_lebesgue_integral

1425 integral_indicator ~>

1426 integral_real_indicator / integrable_real_indicator

1427 positive_integral_fst ~> nn_integral_fst'

1428 positive_integral_fst_measurable ~> nn_integral_fst

1429 positive_integral_snd_measurable ~> nn_integral_snd

1431 integrable_fst_measurable ~>

1432 integral_fst / integrable_fst / AE_integrable_fst

1434 integrable_snd_measurable ~>

1435 integral_snd / integrable_snd / AE_integrable_snd

1437 integral_monotone_convergence ~>

1438 integral_monotone_convergence / integrable_monotone_convergence

1440 integral_monotone_convergence_at_top ~>

1441 integral_monotone_convergence_at_top /

1442 integrable_monotone_convergence_at_top

1444 has_integral_iff_positive_integral_lebesgue ~>

1445 has_integral_iff_has_bochner_integral_lebesgue_nonneg

1447 lebesgue_integral_has_integral ~>

1448 has_integral_integrable_lebesgue_nonneg

1450 positive_integral_lebesgue_has_integral ~>

1451 integral_has_integral_lebesgue_nonneg /

1452 integrable_has_integral_lebesgue_nonneg

1454 lebesgue_integral_real_affine ~>

1455 nn_integral_real_affine

1457 has_integral_iff_positive_integral_lborel ~>

1458 integral_has_integral_nonneg / integrable_has_integral_nonneg

1460 The following theorems where removed:

1462 lebesgue_integral_nonneg

1463 lebesgue_integral_uminus

1464 lebesgue_integral_cmult

1465 lebesgue_integral_multc

1466 lebesgue_integral_cmult_nonneg

1467 integral_cmul_indicator

1468 integral_real

1470 - Formalized properties about exponentially, Erlang, and normal

1471 distributed random variables.

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

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

1475 INCOMPATIBILITY.

1478 *** Scala ***

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

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

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

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

1484 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

1486 * Substantial reworking of internal PIDE protocol communication

1487 channels. INCOMPATIBILITY.

1490 *** ML ***

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

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

1494 current background theory. Thus equivalent data produced in different

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

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

1497 appropriate than Thm.eq_thm.

1499 * Proper context for basic Simplifier operations: rewrite_rule,

1500 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

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

1502 actually belongs to it).

1504 * Proper context discipline for read_instantiate and instantiate_tac:

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

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

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

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

1509 of schematic variables.

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

1512 structure Runtime. Minor INCOMPATIBILITY.

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

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

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

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

1519 INCOMPATIBILITY.

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

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

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

1524 INCOMPATIBILITY.

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

1527 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

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

1529 formal context.

1531 * Simplified programming interface to define ML antiquotations, see

1532 structure ML_Antiquotation. Minor INCOMPATIBILITY.

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

1535 occasionally useful for experimentation and diagnostic purposes.

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

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

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

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

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

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

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

1545 purposes.

1548 *** System ***

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

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

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

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

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

1556 * The raw Isabelle process executable has been renamed from

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

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

1559 the Isabelle environment to avoid dynamic path lookup. Rare

1560 incompatibility for old tools that do not use the ISABELLE_PROCESS

1561 settings variable.

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

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

1565 obsolete Isar TTY loop.

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

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

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

1570 via desktop environment, without any special precautions. Potential

1571 INCOMPATIBILITY with ambitious private settings.

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

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

1575 as produced by Isabelle/jEdit, for example.

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

1578 integrated into Isabelle/jEdit eventually.

1580 * Improved 'display_drafts' concerning desktop integration and

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

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

1584 * Session ROOT specifications require explicit 'document_files' for

1585 robust dependencies on LaTeX sources. Only these explicitly given

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

1587 processing is started.

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

1590 of TeX Live from Cygwin.

1594 New in Isabelle2013-2 (December 2013)

1595 -------------------------------------

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

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

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

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

1603 after edits surrounding the command location.

1605 * More status information about commands that are interrupted

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

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

1610 *** System ***

1612 * More robust termination of external processes managed by

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

1614 milliseconds, as required for PIDE document editing with automatically

1615 tried tools (e.g. Sledgehammer).

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

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

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

1623 New in Isabelle2013-1 (November 2013)

1624 -------------------------------------

1626 *** General ***

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

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

1630 dependencies. Minor INCOMPATIBILITY.

1632 * Discontinued redundant 'use' command, which was superseded by

1633 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

1635 * Simplified subscripts within identifiers, using plain \<^sub>

1636 instead of the second copy \<^isub> and \<^isup>. Superscripts are

1637 only for literal tokens within notation; explicit mixfix annotations

1638 for consts or fixed variables may be used as fall-back for unusual

1639 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

1640 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

1641 standardize symbols as a starting point for further manual cleanup.

1642 The ML reference variable "legacy_isub_isup" may be set as temporary

1643 workaround, to make the prover accept a subset of the old identifier

1644 syntax.

1646 * Document antiquotations: term style "isub" has been renamed to

1647 "sub". Minor INCOMPATIBILITY.

1649 * Uniform management of "quick_and_dirty" as system option (see also

1650 "isabelle options"), configuration option within the context (see also

1651 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

1652 INCOMPATIBILITY, need to use more official Isabelle means to access

1653 quick_and_dirty, instead of historical poking into mutable reference.

1655 * Renamed command 'print_configs' to 'print_options'. Minor

1656 INCOMPATIBILITY.

1658 * Proper diagnostic command 'print_state'. Old 'pr' (with its

1659 implicit change of some global references) is retained for now as

1660 control command, e.g. for ProofGeneral 3.7.x.

1662 * Discontinued 'print_drafts' command with its old-fashioned PS output

1663 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

1664 'display_drafts' instead and print via the regular document viewer.

1666 * Updated and extended "isar-ref" and "implementation" manual,

1667 eliminated old "ref" manual.

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

1672 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

1673 Documentation panel.

1675 * Dockable window "Documentation" provides access to Isabelle

1676 documentation.

1678 * Dockable window "Find" provides query operations for formal entities

1679 (GUI front-end to 'find_theorems' command).

1681 * Dockable window "Sledgehammer" manages asynchronous / parallel

1682 sledgehammer runs over existing document sources, independently of

1683 normal editing and checking process.

1685 * Dockable window "Timing" provides an overview of relevant command

1686 timing information, depending on option jedit_timing_threshold. The

1687 same timing information is shown in the extended tooltip of the

1688 command keyword, when hovering the mouse over it while the CONTROL or

1689 COMMAND modifier is pressed.

1691 * Improved dockable window "Theories": Continuous checking of proof

1692 document (visible and required parts) may be controlled explicitly,

1693 using check box or shortcut "C+e ENTER". Individual theory nodes may

1694 be marked explicitly as required and checked in full, using check box

1695 or shortcut "C+e SPACE".

1697 * Improved completion mechanism, which is now managed by the

1698 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

1699 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

1701 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

1702 isabelle.complete for explicit completion in Isabelle sources.

1703 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

1704 to resolve conflict.

1706 * Improved support of various "minor modes" for Isabelle NEWS,

1707 options, session ROOT etc., with completion and SideKick tree view.

1709 * Strictly monotonic document update, without premature cancellation of

1710 running transactions that are still needed: avoid reset/restart of

1711 such command executions while editing.

1713 * Support for asynchronous print functions, as overlay to existing

1714 document content.

1716 * Support for automatic tools in HOL, which try to prove or disprove

1717 toplevel theorem statements.

1719 * Action isabelle.reset-font-size resets main text area font size

1720 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

1721 also "Plugin Options / Isabelle / General"). It can be bound to some

1722 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

1724 * File specifications in jEdit (e.g. file browser) may refer to

1725 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

1726 obsolete $ISABELLE_HOME_WINDOWS variable.

1728 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

1729 / Global Options / Appearance".

1731 * Improved support of native Mac OS X functionality via "MacOSX"

1732 plugin, which is now enabled by default.

1735 *** Pure ***

1737 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

1738 In particular, 'interpretation' allows for non-persistent

1739 interpretation within "context ... begin ... end" blocks offering a

1740 light-weight alternative to 'sublocale'. See "isar-ref" manual for

1741 details.

1743 * Improved locales diagnostic command 'print_dependencies'.

1745 * Discontinued obsolete 'axioms' command, which has been marked as

1746 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

1747 instead, while observing its uniform scope for polymorphism.

1749 * Discontinued empty name bindings in 'axiomatization'.

1750 INCOMPATIBILITY.

1752 * System option "proofs" has been discontinued. Instead the global

1753 state of Proofterm.proofs is persistently compiled into logic images

1754 as required, notably HOL-Proofs. Users no longer need to change

1755 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

1757 * Syntax translation functions (print_translation etc.) always depend

1758 on Proof.context. Discontinued former "(advanced)" option -- this is

1759 now the default. Minor INCOMPATIBILITY.

1761 * Former global reference trace_unify_fail is now available as

1762 configuration option "unify_trace_failure" (global context only).

1764 * SELECT_GOAL now retains the syntactic context of the overall goal

1765 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

1766 situations.

1769 *** HOL ***

1771 * Stronger precedence of syntax for big intersection and union on

1772 sets, in accordance with corresponding lattice operations.

1773 INCOMPATIBILITY.

1775 * Notation "{p:A. P}" now allows tuple patterns as well.

1777 * Nested case expressions are now translated in a separate check phase

1778 rather than during parsing. The data for case combinators is separated

1779 from the datatype package. The declaration attribute

1780 "case_translation" can be used to register new case combinators:

1782 declare [[case_translation case_combinator constructor1 ... constructorN]]

1784 * Code generator:

1785 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

1786 'code_instance'.

1787 - 'code_identifier' declares name hints for arbitrary identifiers in

1788 generated code, subsuming 'code_modulename'.

1790 See the isar-ref manual for syntax diagrams, and the HOL theories for

1791 examples.

1793 * Attibute 'code': 'code' now declares concrete and abstract code

1794 equations uniformly. Use explicit 'code equation' and 'code abstract'

1795 to distinguish both when desired.

1797 * Discontinued theories Code_Integer and Efficient_Nat by a more

1798 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

1799 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

1800 generation for details. INCOMPATIBILITY.

1802 * Numeric types are mapped by default to target language numerals:

1803 natural (replaces former code_numeral) and integer (replaces former

1804 code_int). Conversions are available as integer_of_natural /

1805 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

1806 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

1807 ML). INCOMPATIBILITY.

1809 * Function package: For mutually recursive functions f and g, separate

1810 cases rules f.cases and g.cases are generated instead of unusable

1811 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

1812 in the case that the unusable rule was used nevertheless.

1814 * Function package: For each function f, new rules f.elims are

1815 generated, which eliminate equalities of the form "f x = t".

1817 * New command 'fun_cases' derives ad-hoc elimination rules for

1818 function equations as simplified instances of f.elims, analogous to

1819 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

1821 * Lifting:

1822 - parametrized correspondence relations are now supported:

1823 + parametricity theorems for the raw term can be specified in

1824 the command lift_definition, which allow us to generate stronger

1825 transfer rules

1826 + setup_lifting generates stronger transfer rules if parametric

1827 correspondence relation can be generated

1828 + various new properties of the relator must be specified to support

1829 parametricity

1830 + parametricity theorem for the Quotient relation can be specified

1831 - setup_lifting generates domain rules for the Transfer package

1832 - stronger reflexivity prover of respectfulness theorems for type

1833 copies

1834 - ===> and --> are now local. The symbols can be introduced

1835 by interpreting the locale lifting_syntax (typically in an

1836 anonymous context)

1837 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

1838 Main. Potential INCOMPATIBILITY

1839 - new commands for restoring and deleting Lifting/Transfer context:

1840 lifting_forget, lifting_update

1841 - the command print_quotmaps was renamed to print_quot_maps.

1842 INCOMPATIBILITY

1844 * Transfer:

1845 - better support for domains in Transfer: replace Domainp T

1846 by the actual invariant in a transferred goal

1847 - transfer rules can have as assumptions other transfer rules

1848 - Experimental support for transferring from the raw level to the

1849 abstract level: Transfer.transferred attribute

1850 - Attribute version of the transfer method: untransferred attribute

1852 * Reification and reflection:

1853 - Reification is now directly available in HOL-Main in structure

1854 "Reification".

1855 - Reflection now handles multiple lists with variables also.

1856 - The whole reflection stack has been decomposed into conversions.

1857 INCOMPATIBILITY.

1859 * Revised devices for recursive definitions over finite sets:

1860 - Only one fundamental fold combinator on finite set remains:

1861 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

1862 This is now identity on infinite sets.

1863 - Locales ("mini packages") for fundamental definitions with

1864 Finite_Set.fold: folding, folding_idem.

1865 - Locales comm_monoid_set, semilattice_order_set and

1866 semilattice_neutr_order_set for big operators on sets.

1867 See theory Big_Operators for canonical examples.

1868 Note that foundational constants comm_monoid_set.F and

1869 semilattice_set.F correspond to former combinators fold_image

1870 and fold1 respectively. These are now gone. You may use

1871 those foundational constants as substitutes, but it is

1872 preferable to interpret the above locales accordingly.

1873 - Dropped class ab_semigroup_idem_mult (special case of lattice,

1874 no longer needed in connection with Finite_Set.fold etc.)

1875 - Fact renames:

1876 card.union_inter ~> card_Un_Int [symmetric]

1877 card.union_disjoint ~> card_Un_disjoint

1878 INCOMPATIBILITY.

1880 * Locale hierarchy for abstract orderings and (semi)lattices.

1882 * Complete_Partial_Order.admissible is defined outside the type class

1883 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

1884 class predicate assumption or sort constraint when possible.

1885 INCOMPATIBILITY.

1887 * Introduce type class "conditionally_complete_lattice": Like a

1888 complete lattice but does not assume the existence of the top and

1889 bottom elements. Allows to generalize some lemmas about reals and

1890 extended reals. Removed SupInf and replaced it by the instantiation

1891 of conditionally_complete_lattice for real. Renamed lemmas about

1892 conditionally-complete lattice from Sup_... to cSup_... and from

1893 Inf_... to cInf_... to avoid hidding of similar complete lattice

1894 lemmas.

1896 * Introduce type class linear_continuum as combination of

1897 conditionally-complete lattices and inner dense linorders which have

1898 more than one element. INCOMPATIBILITY.

1900 * Introduced type classes order_top and order_bot. The old classes top

1901 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

1902 Rename bot -> order_bot, top -> order_top

1904 * Introduce type classes "no_top" and "no_bot" for orderings without

1905 top and bottom elements.

1907 * Split dense_linorder into inner_dense_order and no_top, no_bot.

1909 * Complex_Main: Unify and move various concepts from

1910 HOL-Multivariate_Analysis to HOL-Complex_Main.

1912 - Introduce type class (lin)order_topology and

1913 linear_continuum_topology. Allows to generalize theorems about

1914 limits and order. Instances are reals and extended reals.

1916 - continuous and continuos_on from Multivariate_Analysis:

1917 "continuous" is the continuity of a function at a filter. "isCont"

1918 is now an abbrevitation: "isCont x f == continuous (at _) f".

1920 Generalized continuity lemmas from isCont to continuous on an

1921 arbitrary filter.

1923 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

1924 compactness of closed intervals on reals. Continuous functions

1925 attain infimum and supremum on compact sets. The inverse of a

1926 continuous function is continuous, when the function is continuous

1927 on a compact set.

1929 - connected from Multivariate_Analysis. Use it to prove the

1930 intermediate value theorem. Show connectedness of intervals on

1931 linear_continuum_topology).

1933 - first_countable_topology from Multivariate_Analysis. Is used to

1934 show equivalence of properties on the neighbourhood filter of x and

1935 on all sequences converging to x.

1937 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

1938 theorems from Library/FDERIV.thy to Deriv.thy and base the

1939 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

1940 which are restricted to sets, i.e. to represent derivatives from

1941 left or right.

1943 - Removed the within-filter. It is replaced by the principal filter:

1945 F within X = inf F (principal X)

1947 - Introduce "at x within U" as a single constant, "at x" is now an

1948 abbreviation for "at x within UNIV"

1950 - Introduce named theorem collections tendsto_intros,

1951 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

1952 in tendsto_intros (or FDERIV_intros) are also available as

1953 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

1954 is replaced by a congruence rule. This allows to apply them as

1955 intro rules and then proving equivalence by the simplifier.

1957 - Restructured theories in HOL-Complex_Main:

1959 + Moved RealDef and RComplete into Real

1961 + Introduced Topological_Spaces and moved theorems about

1962 topological spaces, filters, limits and continuity to it

1964 + Renamed RealVector to Real_Vector_Spaces

1966 + Split Lim, SEQ, Series into Topological_Spaces,

1967 Real_Vector_Spaces, and Limits

1969 + Moved Ln and Log to Transcendental

1971 + Moved theorems about continuity from Deriv to Topological_Spaces

1973 - Remove various auxiliary lemmas.

1975 INCOMPATIBILITY.

1977 * Nitpick:

1978 - Added option "spy".

1979 - Reduce incidence of "too high arity" errors.

1981 * Sledgehammer:

1982 - Renamed option:

1983 isar_shrink ~> isar_compress

1984 INCOMPATIBILITY.

1985 - Added options "isar_try0", "spy".

1986 - Better support for "isar_proofs".

1987 - MaSh has been fined-tuned and now runs as a local server.

1989 * Improved support for ad hoc overloading of constants (see also

1990 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

1992 * Library/Polynomial.thy:

1993 - Use lifting for primitive definitions.

1994 - Explicit conversions from and to lists of coefficients, used for

1995 generated code.

1996 - Replaced recursion operator poly_rec by fold_coeffs.

1997 - Prefer pre-existing gcd operation for gcd.

1998 - Fact renames:

1999 poly_eq_iff ~> poly_eq_poly_eq_iff

2000 poly_ext ~> poly_eqI

2001 expand_poly_eq ~> poly_eq_iff

2002 IMCOMPATIBILITY.

2004 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

2005 case_of_simps to convert function definitions between a list of

2006 equations with patterns on the lhs and a single equation with case

2007 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

2009 * New Library/FSet.thy: type of finite sets defined as a subtype of

2010 sets defined by Lifting/Transfer.

2012 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

2014 * Consolidation of library theories on product orders:

2016 Product_Lattice ~> Product_Order -- pointwise order on products

2017 Product_ord ~> Product_Lexorder -- lexicographic order on products

2019 INCOMPATIBILITY.

2021 * Imperative-HOL: The MREC combinator is considered legacy and no

2022 longer included by default. INCOMPATIBILITY, use partial_function

2023 instead, or import theory Legacy_Mrec as a fallback.

2025 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

2026 ~~/src/HOL/Algebra/poly. Existing theories should be based on

2027 ~~/src/HOL/Library/Polynomial instead. The latter provides

2028 integration with HOL's type classes for rings. INCOMPATIBILITY.

2030 * HOL-BNF:

2031 - Various improvements to BNF-based (co)datatype package, including

2032 new commands "primrec_new", "primcorec", and

2033 "datatype_new_compat", as well as documentation. See

2034 "datatypes.pdf" for details.

2035 - New "coinduction" method to avoid some boilerplate (compared to

2036 coinduct).

2037 - Renamed keywords:

2038 data ~> datatype_new

2039 codata ~> codatatype

2040 bnf_def ~> bnf

2041 - Renamed many generated theorems, including

2042 discs ~> disc

2043 map_comp' ~> map_comp

2044 map_id' ~> map_id

2045 sels ~> sel

2046 set_map' ~> set_map

2047 sets ~> set

2048 IMCOMPATIBILITY.

2051 *** ML ***

2053 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

2054 "check_property" allows to check specifications of the form "ALL x y

2055 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

2056 Examples.thy in particular.

2058 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

2059 tracing output in the command transaction context instead of physical

2060 stdout. See also Toplevel.debug, Toplevel.debugging and

2061 ML_Compiler.exn_trace.

2063 * ML type "theory" is now immutable, without any special treatment of

2064 drafts or linear updates (which could lead to "stale theory" errors in

2065 the past). Discontinued obsolete operations like Theory.copy,

2066 Theory.checkpoint, and the auxiliary type theory_ref. Minor

2067 INCOMPATIBILITY.

2069 * More uniform naming of goal functions for skipped proofs:

2071 Skip_Proof.prove ~> Goal.prove_sorry

2072 Skip_Proof.prove_global ~> Goal.prove_sorry_global

2074 Minor INCOMPATIBILITY.

2076 * Simplifier tactics and tools use proper Proof.context instead of

2077 historic type simpset. Old-style declarations like addsimps,

2078 addsimprocs etc. operate directly on Proof.context. Raw type simpset

2079 retains its use as snapshot of the main Simplifier context, using

2080 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

2081 old tools by making them depend on (ctxt : Proof.context) instead of

2082 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

2084 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

2085 operate on Proof.context instead of claset, for uniformity with addIs,

2086 addEs, addDs etc. Note that claset_of and put_claset allow to manage

2087 clasets separately from the context.

2089 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

2090 INCOMPATIBILITY, use @{context} instead.

2092 * Antiquotation @{theory_context A} is similar to @{theory A}, but

2093 presents the result as initial Proof.context.

2096 *** System ***

2098 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

2099 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

2101 * Discontinued obsolete isabelle-process options -f and -u (former

2102 administrative aliases of option -e). Minor INCOMPATIBILITY.

2104 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

2105 settings variable.

2107 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

2108 document formats: dvi.gz, ps, ps.gz -- the default document format is

2109 always pdf.

2111 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

2112 specify global resources of the JVM process run by isabelle build.

2114 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

2115 to run Isabelle/Scala source files as standalone programs.

2117 * Improved "isabelle keywords" tool (for old-style ProofGeneral

2118 keyword tables): use Isabelle/Scala operations, which inspect outer

2119 syntax without requiring to build sessions first.

2121 * Sessions may be organized via 'chapter' specifications in the ROOT

2122 file, which determines a two-level hierarchy of browser info. The old

2123 tree-like organization via implicit sub-session relation (with its

2124 tendency towards erratic fluctuation of URLs) has been discontinued.

2125 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

2126 for HTML presentation of theories.

2130 New in Isabelle2013 (February 2013)

2131 -----------------------------------

2133 *** General ***

2135 * Theorem status about oracles and unfinished/failed future proofs is

2136 no longer printed by default, since it is incompatible with

2137 incremental / parallel checking of the persistent document model. ML

2138 function Thm.peek_status may be used to inspect a snapshot of the

2139 ongoing evaluation process. Note that in batch mode --- notably

2140 isabelle build --- the system ensures that future proofs of all

2141 accessible theorems in the theory context are finished (as before).

2143 * Configuration option show_markup controls direct inlining of markup

2144 into the printed representation of formal entities --- notably type

2145 and sort constraints. This enables Prover IDE users to retrieve that

2146 information via tooltips in the output window, for example.

2148 * Command 'ML_file' evaluates ML text from a file directly within the

2149 theory, without any predeclaration via 'uses' in the theory header.

2151 * Old command 'use' command and corresponding keyword 'uses' in the

2152 theory header are legacy features and will be discontinued soon.

2153 Tools that load their additional source files may imitate the

2154 'ML_file' implementation, such that the system can take care of

2155 dependencies properly.

2157 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

2158 is called fastforce / fast_force_tac already since Isabelle2011-1.

2160 * Updated and extended "isar-ref" and "implementation" manual, reduced

2161 remaining material in old "ref" manual.

2163 * Improved support for auxiliary contexts that indicate block structure

2164 for specifications. Nesting of "context fixes ... context assumes ..."

2165 and "class ... context ...".

2167 * Attribute "consumes" allows a negative value as well, which is

2168 interpreted relatively to the total number of premises of the rule in

2169 the target context. This form of declaration is stable when exported

2170 from a nested 'context' with additional assumptions. It is the

2171 preferred form for definitional packages, notably cases/rules produced

2172 in HOL/inductive and HOL/function.

2174 * More informative error messages for Isar proof commands involving

2175 lazy enumerations (method applications etc.).

2177 * Refined 'help' command to retrieve outer syntax commands according

2178 to name patterns (with clickable results).

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

2183 * Parallel terminal proofs ('by') are enabled by default, likewise

2184 proofs that are built into packages like 'datatype', 'function'. This

2185 allows to "run ahead" checking the theory specifications on the

2186 surface, while the prover is still crunching on internal

2187 justifications. Unfinished / cancelled proofs are restarted as

2188 required to complete full proof checking eventually.

2190 * Improved output panel with tooltips, hyperlinks etc. based on the

2191 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

2192 tooltips leads to some window that supports the same recursively,

2193 which can lead to stacks of tooltips as the semantic document content

2194 is explored. ESCAPE closes the whole stack, individual windows may be

2195 closed separately, or detached to become independent jEdit dockables.

2197 * Improved support for commands that produce graph output: the text

2198 message contains a clickable area to open a new instance of the graph

2199 browser on demand.

2201 * More robust incremental parsing of outer syntax (partial comments,

2202 malformed symbols). Changing the balance of open/close quotes and

2203 comment delimiters works more conveniently with unfinished situations

2204 that frequently occur in user interaction.

2206 * More efficient painting and improved reactivity when editing large

2207 files. More scalable management of formal document content.

2209 * Smarter handling of tracing messages: prover process pauses after

2210 certain number of messages per command transaction, with some user

2211 dialog to stop or continue. This avoids swamping the front-end with

2212 potentially infinite message streams.

2214 * More plugin options and preferences, based on Isabelle/Scala. The

2215 jEdit plugin option panel provides access to some Isabelle/Scala

2216 options, including tuning parameters for editor reactivity and color

2217 schemes.

2219 * Dockable window "Symbols" provides some editing support for Isabelle

2220 symbols.

2222 * Dockable window "Monitor" shows ML runtime statistics. Note that

2223 continuous display of the chart slows down the system.

2225 * Improved editing support for control styles: subscript, superscript,

2226 bold, reset of style -- operating on single symbols or text

2227 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

2229 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

2230 adjust the main text area font size, and its derivatives for output,

2231 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

2232 need to be adapted to local keyboard layouts.

2234 * More reactive completion popup by default: use \t (TAB) instead of

2235 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

2236 also "Plugin Options / SideKick / General / Code Completion Options".

2238 * Implicit check and build dialog of the specified logic session

2239 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

2240 demand, without bundling big platform-dependent heap images in the

2241 Isabelle distribution.

2243 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

2244 from Oracle provide better multi-platform experience. This version is

2245 now bundled exclusively with Isabelle.

2248 *** Pure ***

2250 * Code generation for Haskell: restrict unqualified imports from

2251 Haskell Prelude to a small set of fundamental operations.

2253 * Command 'export_code': relative file names are interpreted

2254 relatively to master directory of current theory rather than the

2255 rather arbitrary current working directory. INCOMPATIBILITY.

2257 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

2258 use regular rule composition via "OF" / "THEN", or explicit proof

2259 structure instead. Note that Isabelle/ML provides a variety of

2260 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

2261 with some care where this is really required.

2263 * Command 'typ' supports an additional variant with explicit sort

2264 constraint, to infer and check the most general type conforming to a

2265 given sort. Example (in HOL):

2267 typ "_ * _ * bool * unit" :: finite

2269 * Command 'locale_deps' visualizes all locales and their relations as

2270 a Hasse diagram.

2273 *** HOL ***

2275 * Sledgehammer:

2277 - Added MaSh relevance filter based on machine-learning; see the

2278 Sledgehammer manual for details.

2279 - Polished Isar proofs generated with "isar_proofs" option.

2280 - Rationalized type encodings ("type_enc" option).

2281 - Renamed "kill_provers" subcommand to "kill_all".

2282 - Renamed options:

2283 isar_proof ~> isar_proofs

2284 isar_shrink_factor ~> isar_shrink

2285 max_relevant ~> max_facts

2286 relevance_thresholds ~> fact_thresholds

2288 * Quickcheck: added an optimisation for equality premises. It is

2289 switched on by default, and can be switched off by setting the

2290 configuration quickcheck_optimise_equality to false.

2292 * Quotient: only one quotient can be defined by quotient_type

2293 INCOMPATIBILITY.

2295 * Lifting:

2296 - generation of an abstraction function equation in lift_definition

2297 - quot_del attribute

2298 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

2300 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

2301 expressions.

2303 * Preprocessing of the code generator rewrites set comprehensions into

2304 pointfree expressions.

2306 * The SMT solver Z3 has now by default a restricted set of directly

2307 supported features. For the full set of features (div/mod, nonlinear

2308 arithmetic, datatypes/records) with potential proof reconstruction

2309 failures, enable the configuration option "z3_with_extensions". Minor

2310 INCOMPATIBILITY.

2312 * Simplified 'typedef' specifications: historical options for implicit

2313 set definition and alternative name have been discontinued. The

2314 former behavior of "typedef (open) t = A" is now the default, but

2315 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

2316 accordingly.

2318 * Removed constant "chars"; prefer "Enum.enum" on type "char"

2319 directly. INCOMPATIBILITY.

2321 * Moved operation product, sublists and n_lists from theory Enum to

2322 List. INCOMPATIBILITY.

2324 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

2326 * Class "comm_monoid_diff" formalises properties of bounded

2327 subtraction, with natural numbers and multisets as typical instances.

2329 * Added combinator "Option.these" with type "'a option set => 'a set".

2331 * Theory "Transitive_Closure": renamed lemmas

2333 reflcl_tranclp -> reflclp_tranclp

2334 rtranclp_reflcl -> rtranclp_reflclp

2336 INCOMPATIBILITY.

2338 * Theory "Rings": renamed lemmas (in class semiring)

2340 left_distrib ~> distrib_right

2341 right_distrib ~> distrib_left

2343 INCOMPATIBILITY.

2345 * Generalized the definition of limits:

2347 - Introduced the predicate filterlim (LIM x F. f x :> G) which

2348 expresses that when the input values x converge to F then the

2349 output f x converges to G.

2351 - Added filters for convergence to positive (at_top) and negative

2352 infinity (at_bot).

2354 - Moved infinity in the norm (at_infinity) from

2355 Multivariate_Analysis to Complex_Main.

2357 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

2358 at_top".

2360 INCOMPATIBILITY.

2362 * Theory "Library/Option_ord" provides instantiation of option type to

2363 lattice type classes.

2365 * Theory "Library/Multiset": renamed

2367 constant fold_mset ~> Multiset.fold

2368 fact fold_mset_commute ~> fold_mset_comm

2370 INCOMPATIBILITY.

2372 * Renamed theory Library/List_Prefix to Library/Sublist, with related

2373 changes as follows.

2375 - Renamed constants (and related lemmas)

2377 prefix ~> prefixeq

2378 strict_prefix ~> prefix

2380 - Replaced constant "postfix" by "suffixeq" with swapped argument

2381 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

2382 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

2383 Renamed lemmas accordingly.

2385 - Added constant "list_hembeq" for homeomorphic embedding on

2386 lists. Added abbreviation "sublisteq" for special case

2387 "list_hembeq (op =)".

2389 - Theory Library/Sublist no longer provides "order" and "bot" type

2390 class instances for the prefix order (merely corresponding locale

2391 interpretations). The type class instances are now in theory

2392 Library/Prefix_Order.

2394 - The sublist relation of theory Library/Sublist_Order is now based

2395 on "Sublist.sublisteq". Renamed lemmas accordingly:

2397 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

2398 le_list_append_mono ~> Sublist.list_hembeq_append_mono

2399 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

2400 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

2401 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

2402 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

2403 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

2404 le_list_drop_many ~> Sublist.sublisteq_drop_many

2405 le_list_filter_left ~> Sublist.sublisteq_filter_left

2406 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

2407 le_list_rev_take_iff ~> Sublist.sublisteq_append

2408 le_list_same_length ~> Sublist.sublisteq_same_length

2409 le_list_take_many_iff ~> Sublist.sublisteq_append'

2410 less_eq_list.drop ~> less_eq_list_drop

2411 less_eq_list.induct ~> less_eq_list_induct

2412 not_le_list_length ~> Sublist.not_sublisteq_length

2414 INCOMPATIBILITY.

2416 * New theory Library/Countable_Set.

2418 * Theory Library/Debug and Library/Parallel provide debugging and

2419 parallel execution for code generated towards Isabelle/ML.

2421 * Theory Library/FuncSet: Extended support for Pi and extensional and

2422 introduce the extensional dependent function space "PiE". Replaced

2423 extensional_funcset by an abbreviation, and renamed lemmas from

2424 extensional_funcset to PiE as follows:

2426 extensional_empty ~> PiE_empty

2427 extensional_funcset_empty_domain ~> PiE_empty_domain

2428 extensional_funcset_empty_range ~> PiE_empty_range

2429 extensional_funcset_arb ~> PiE_arb

2430 extensional_funcset_mem ~> PiE_mem

2431 extensional_funcset_extend_domainI ~> PiE_fun_upd

2432 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

2433 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

2434 card_extensional_funcset ~> card_PiE

2435 finite_extensional_funcset ~> finite_PiE

2437 INCOMPATIBILITY.

2439 * Theory Library/FinFun: theory of almost everywhere constant

2440 functions (supersedes the AFP entry "Code Generation for Functions as

2441 Data").

2443 * Theory Library/Phantom: generic phantom type to make a type

2444 parameter appear in a constant's type. This alternative to adding

2445 TYPE('a) as another parameter avoids unnecessary closures in generated

2446 code.

2448 * Theory Library/RBT_Impl: efficient construction of red-black trees

2449 from sorted associative lists. Merging two trees with rbt_union may

2450 return a structurally different tree than before. Potential

2451 INCOMPATIBILITY.

2453 * Theory Library/IArray: immutable arrays with code generation.

2455 * Theory Library/Finite_Lattice: theory of finite lattices.

2457 * HOL/Multivariate_Analysis: replaced

2459 "basis :: 'a::euclidean_space => nat => real"

2460 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

2462 on euclidean spaces by using the inner product "_ \<bullet> _" with

2463 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

2464 "SUM i : Basis. f i * r i".

2466 With this change the following constants are also changed or removed:

2468 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

2469 a $$ i ~> inner a i (where i : Basis)

2470 cart_base i removed

2471 \<pi>, \<pi>' removed

2473 Theorems about these constants where removed.

2475 Renamed lemmas:

2477 component_le_norm ~> Basis_le_norm

2478 euclidean_eq ~> euclidean_eq_iff

2479 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

2480 euclidean_simps ~> inner_simps

2481 independent_basis ~> independent_Basis

2482 span_basis ~> span_Basis

2483 in_span_basis ~> in_span_Basis

2484 norm_bound_component_le ~> norm_boound_Basis_le

2485 norm_bound_component_lt ~> norm_boound_Basis_lt

2486 component_le_infnorm ~> Basis_le_infnorm

2488 INCOMPATIBILITY.

2490 * HOL/Probability:

2492 - Added simproc "measurable" to automatically prove measurability.

2494 - Added induction rules for sigma sets with disjoint union

2495 (sigma_sets_induct_disjoint) and for Borel-measurable functions

2496 (borel_measurable_induct).

2498 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

2499 projective family).

2501 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

2502 AFP entry "Ordinals_and_Cardinals").

2504 * HOL/BNF: New (co)datatype package based on bounded natural functors

2505 with support for mixed, nested recursion and interesting non-free

2506 datatypes.

2508 * HOL/Finite_Set and Relation: added new set and relation operations

2509 expressed by Finite_Set.fold.

2511 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

2512 trees for the code generator.

2514 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

2515 Lifting/Transfer.

2516 possible INCOMPATIBILITY.

2518 * HOL/Set: renamed Set.project -> Set.filter

2519 INCOMPATIBILITY.

2522 *** Document preparation ***

2524 * Dropped legacy antiquotations "term_style" and "thm_style", since

2525 styles may be given as arguments to "term" and "thm" already.

2526 Discontinued legacy styles "prem1" .. "prem19".

2528 * Default LaTeX rendering for \<euro> is now based on eurosym package,

2529 instead of slightly exotic babel/greek.

2531 * Document variant NAME may use different LaTeX entry point

2532 document/root_NAME.tex if that file exists, instead of the common

2533 document/root.tex.

2535 * Simplified custom document/build script, instead of old-style

2536 document/IsaMakefile. Minor INCOMPATIBILITY.

2539 *** ML ***

2541 * The default limit for maximum number of worker threads is now 8,

2542 instead of 4, in correspondence to capabilities of contemporary

2543 hardware and Poly/ML runtime system.

2545 * Type Seq.results and related operations support embedded error

2546 messages within lazy enumerations, and thus allow to provide

2547 informative errors in the absence of any usable results.

2549 * Renamed Position.str_of to Position.here to emphasize that this is a

2550 formal device to inline positions into message text, but not

2551 necessarily printing visible text.

2554 *** System ***

2556 * Advanced support for Isabelle sessions and build management, see

2557 "system" manual for the chapter of that name, especially the "isabelle

2558 build" tool and its examples. The "isabelle mkroot" tool prepares

2559 session root directories for use with "isabelle build", similar to

2560 former "isabelle mkdir" for "isabelle usedir". Note that this affects

2561 document preparation as well. INCOMPATIBILITY, isabelle usedir /

2562 mkdir / make are rendered obsolete.

2564 * Discontinued obsolete Isabelle/build script, it is superseded by the

2565 regular isabelle build tool. For example:

2567 isabelle build -s -b HOL

2569 * Discontinued obsolete "isabelle makeall".

2571 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

2572 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

2573 provides some traditional targets that invoke "isabelle build". Note

2574 that this is inefficient! Applications of Isabelle/HOL involving

2575 "isabelle make" should be upgraded to use "isabelle build" directly.

2577 * The "isabelle options" tool prints Isabelle system options, as

2578 required for "isabelle build", for example.

2580 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

2581 Minor INCOMPATIBILITY in command-line options.

2583 * The "isabelle install" tool has now a simpler command-line. Minor

2584 INCOMPATIBILITY.

2586 * The "isabelle components" tool helps to resolve add-on components

2587 that are not bundled, or referenced from a bare-bones repository

2588 version of Isabelle.

2590 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

2591 platform family: "linux", "macos", "windows".

2593 * The ML system is configured as regular component, and no longer

2594 picked up from some surrounding directory. Potential INCOMPATIBILITY

2595 for home-made settings.

2597 * Improved ML runtime statistics (heap, threads, future tasks etc.).

2599 * Discontinued support for Poly/ML 5.2.1, which was the last version

2600 without exception positions and advanced ML compiler/toplevel

2601 configuration.

2603 * Discontinued special treatment of Proof General -- no longer guess

2604 PROOFGENERAL_HOME based on accidental file-system layout. Minor

2605 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

2606 settings manually, or use a Proof General version that has been

2607 bundled as Isabelle component.

2611 New in Isabelle2012 (May 2012)

2612 ------------------------------

2614 *** General ***

2616 * Prover IDE (PIDE) improvements:

2618 - more robust Sledgehammer integration (as before the sledgehammer

2619 command-line needs to be typed into the source buffer)

2620 - markup for bound variables

2621 - markup for types of term variables (displayed as tooltips)

2622 - support for user-defined Isar commands within the running session

2623 - improved support for Unicode outside original 16bit range

2624 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

2626 * Forward declaration of outer syntax keywords within the theory

2627 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

2628 commands to be used in the same theory where defined.

2630 * Auxiliary contexts indicate block structure for specifications with

2631 additional parameters and assumptions. Such unnamed contexts may be

2632 nested within other targets, like 'theory', 'locale', 'class',

2633 'instantiation' etc. Results from the local context are generalized

2634 accordingly and applied to the enclosing target context. Example:

2636 context

2637 fixes x y z :: 'a

2638 assumes xy: "x = y" and yz: "y = z"

2639 begin

2641 lemma my_trans: "x = z" using xy yz by simp

2643 end

2645 thm my_trans

2647 The most basic application is to factor-out context elements of

2648 several fixes/assumes/shows theorem statements, e.g. see

2649 ~~/src/HOL/Isar_Examples/Group_Context.thy

2651 Any other local theory specification element works within the "context

2652 ... begin ... end" block as well.

2654 * Bundled declarations associate attributed fact expressions with a

2655 given name in the context. These may be later included in other

2656 contexts. This allows to manage context extensions casually, without

2657 the logical dependencies of locales and locale interpretation. See

2658 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

2660 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

2661 declaration, and results are standardized before being stored. Thus

2662 old-style "standard" after instantiation or composition of facts

2663 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

2664 indices of schematic variables.

2666 * Rule attributes in local theory declarations (e.g. locale or class)

2667 are now statically evaluated: the resulting theorem is stored instead

2668 of the original expression. INCOMPATIBILITY in rare situations, where

2669 the historic accident of dynamic re-evaluation in interpretations

2670 etc. was exploited.

2672 * New tutorial "Programming and Proving in Isabelle/HOL"

2673 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

2674 Structured Isar Proofs" ("isar-overview"), which has been removed. It

2675 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

2676 Logic" as the recommended beginners tutorial, but does not cover all

2677 of the material of that old tutorial.

2679 * Updated and extended reference manuals: "isar-ref",

2680 "implementation", "system"; reduced remaining material in old "ref"

2681 manual.

2684 *** Pure ***

2686 * Command 'definition' no longer exports the foundational "raw_def"

2687 into the user context. Minor INCOMPATIBILITY, may use the regular

2688 "def" result with attribute "abs_def" to imitate the old version.

2690 * Attribute "abs_def" turns an equation of the form "f x y == t" into

2691 "f == %x y. t", which ensures that "simp" or "unfold" steps always

2692 expand it. This also works for object-logic equality. (Formerly

2693 undocumented feature.)

2695 * Sort constraints are now propagated in simultaneous statements, just

2696 like type constraints. INCOMPATIBILITY in rare situations, where

2697 distinct sorts used to be assigned accidentally. For example:

2699 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

2701 lemma "P (x::'a)" and "Q (y::'a::bar)"

2702 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

2704 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

2705 tolerant against multiple unifiers, as long as the final result is

2706 unique. (As before, rules are composed in canonical right-to-left

2707 order to accommodate newly introduced premises.)

2709 * Renamed some inner syntax categories:

2711 num ~> num_token

2712 xnum ~> xnum_token

2713 xstr ~> str_token

2715 Minor INCOMPATIBILITY. Note that in practice "num_const" or

2716 "num_position" etc. are mainly used instead (which also include

2717 position information via constraints).

2719 * Simplified configuration options for syntax ambiguity: see

2720 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

2721 manual. Minor INCOMPATIBILITY.

2723 * Discontinued configuration option "syntax_positions": atomic terms

2724 in parse trees are always annotated by position constraints.

2726 * Old code generator for SML and its commands 'code_module',

2727 'code_library', 'consts_code', 'types_code' have been discontinued.

2728 Use commands of the generic code generator instead. INCOMPATIBILITY.

2730 * Redundant attribute "code_inline" has been discontinued. Use

2731 "code_unfold" instead. INCOMPATIBILITY.

2733 * Dropped attribute "code_unfold_post" in favor of the its dual

2734 "code_abbrev", which yields a common pattern in definitions like

2736 definition [code_abbrev]: "f = t"

2738 INCOMPATIBILITY.

2740 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

2741 instead. INCOMPATIBILITY.

2743 * Discontinued old "prems" fact, which used to refer to the accidental

2744 collection of foundational premises in the context (already marked as

2745 legacy since Isabelle2011).

2748 *** HOL ***

2750 * Type 'a set is now a proper type constructor (just as before

2751 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

2752 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

2753 sets separate, it is often sufficient to rephrase some set S that has

2754 been accidentally used as predicates by "%x. x : S", and some

2755 predicate P that has been accidentally used as set by "{x. P x}".

2756 Corresponding proofs in a first step should be pruned from any

2757 tinkering with former theorems mem_def and Collect_def as far as

2758 possible.

2760 For developments which deliberately mix predicates and sets, a

2761 planning step is necessary to determine what should become a predicate

2762 and what a set. It can be helpful to carry out that step in

2763 Isabelle2011-1 before jumping right into the current release.

2765 * Code generation by default implements sets as container type rather

2766 than predicates. INCOMPATIBILITY.

2768 * New type synonym 'a rel = ('a * 'a) set

2770 * The representation of numerals has changed. Datatype "num"

2771 represents strictly positive binary numerals, along with functions

2772 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent

2773 positive and negated numeric literals, respectively. See also

2774 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

2775 user theories may require adaptations as follows:

2777 - Theorems with number_ring or number_semiring constraints: These

2778 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

2780 - Theories defining numeric types: Remove number, number_semiring,

2781 and number_ring instances. Defer all theorems about numerals until

2782 after classes one and semigroup_add have been instantiated.

2784 - Numeral-only simp rules: Replace each rule having a "number_of v"

2785 pattern with two copies, one for numeral and one for neg_numeral.

2787 - Theorems about subclasses of semiring_1 or ring_1: These classes

2788 automatically support numerals now, so more simp rules and

2789 simprocs may now apply within the proof.

2791 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

2792 Redefine using other integer operations.

2794 * Transfer: New package intended to generalize the existing

2795 "descending" method and related theorem attributes from the Quotient

2796 package. (Not all functionality is implemented yet, but future

2797 development will focus on Transfer as an eventual replacement for the

2798 corresponding parts of the Quotient package.)

2800 - transfer_rule attribute: Maintains a collection of transfer rules,

2801 which relate constants at two different types. Transfer rules may

2802 relate different type instances of the same polymorphic constant,

2803 or they may relate an operation on a raw type to a corresponding

2804 operation on an abstract type (quotient or subtype). For example:

2806 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map

2807 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int

2809 - transfer method: Replaces a subgoal on abstract types with an

2810 equivalent subgoal on the corresponding raw types. Constants are

2811 replaced with corresponding ones according to the transfer rules.

2812 Goals are generalized over all free variables by default; this is

2813 necessary for variables whose types change, but can be overridden

2814 for specific variables with e.g. "transfer fixing: x y z". The

2815 variant transfer' method allows replacing a subgoal with one that

2816 is logically stronger (rather than equivalent).

2818 - relator_eq attribute: Collects identity laws for relators of

2819 various type constructors, e.g. "list_all2 (op =) = (op =)". The

2820 transfer method uses these lemmas to infer transfer rules for

2821 non-polymorphic constants on the fly.

2823 - transfer_prover method: Assists with proving a transfer rule for a

2824 new constant, provided the constant is defined in terms of other

2825 constants that already have transfer rules. It should be applied

2826 after unfolding the constant definitions.

2828 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

2829 from type nat to type int.

2831 * Lifting: New package intended to generalize the quotient_definition

2832 facility of the Quotient package; designed to work with Transfer.

2834 - lift_definition command: Defines operations on an abstract type in

2835 terms of a corresponding operation on a representation

2836 type. Example syntax:

2838 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"

2839 is List.insert

2841 Users must discharge a respectfulness proof obligation when each

2842 constant is defined. (For a type copy, i.e. a typedef with UNIV,

2843 the proof is discharged automatically.) The obligation is

2844 presented in a user-friendly, readable form; a respectfulness

2845 theorem in the standard format and a transfer rule are generated

2846 by the package.

2848 - Integration with code_abstype: For typedefs (e.g. subtypes

2849 corresponding to a datatype invariant, such as dlist),

2850 lift_definition generates a code certificate theorem and sets up

2851 code generation for each constant.

2853 - setup_lifting command: Sets up the Lifting package to work with a

2854 user-defined type. The user must provide either a quotient theorem

2855 or a type_definition theorem. The package configures transfer

2856 rules for equality and quantifiers on the type, and sets up the

2857 lift_definition command to work with the type.

2859 - Usage examples: See Quotient_Examples/Lift_DList.thy,

2860 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

2861 Word/Word.thy and Library/Float.thy.

2863 * Quotient package:

2865 - The 'quotient_type' command now supports a 'morphisms' option with

2866 rep and abs functions, similar to typedef.

2868 - 'quotient_type' sets up new types to work with the Lifting and

2869 Transfer packages, as with 'setup_lifting'.

2871 - The 'quotient_definition' command now requires the user to prove a

2872 respectfulness property at the point where the constant is

2873 defined, similar to lift_definition; INCOMPATIBILITY.

2875 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

2876 accordingly, INCOMPATIBILITY.

2878 * New diagnostic command 'find_unused_assms' to find potentially

2879 superfluous assumptions in theorems using Quickcheck.

2881 * Quickcheck:

2883 - Quickcheck returns variable assignments as counterexamples, which

2884 allows to reveal the underspecification of functions under test.

2885 For example, refuting "hd xs = x", it presents the variable

2886 assignment xs = [] and x = a1 as a counterexample, assuming that

2887 any property is false whenever "hd []" occurs in it.

2889 These counterexample are marked as potentially spurious, as

2890 Quickcheck also returns "xs = []" as a counterexample to the

2891 obvious theorem "hd xs = hd xs".

2893 After finding a potentially spurious counterexample, Quickcheck

2894 continues searching for genuine ones.

2896 By default, Quickcheck shows potentially spurious and genuine

2897 counterexamples. The option "genuine_only" sets quickcheck to only

2898 show genuine counterexamples.

2900 - The command 'quickcheck_generator' creates random and exhaustive

2901 value generators for a given type and operations.

2903 It generates values by using the operations as if they were

2904 constructors of that type.

2906 - Support for multisets.

2908 - Added "use_subtype" options.

2910 - Added "quickcheck_locale" configuration to specify how to process

2911 conjectures in a locale context.

2913 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

2914 and affecting 'rat' and 'real'.

2916 * Sledgehammer:

2917 - Integrated more tightly with SPASS, as described in the ITP 2012

2918 paper "More SPASS with Isabelle".

2919 - Made it try "smt" as a fallback if "metis" fails or times out.

2920 - Added support for the following provers: Alt-Ergo (via Why3 and

2921 TFF1), iProver, iProver-Eq.

2922 - Sped up the minimizer.

2923 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

2924 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

2925 - Renamed "sound" option to "strict".

2927 * Metis: Added possibility to specify lambda translations scheme as a

2928 parenthesized argument (e.g., "by (metis (lifting) ...)").

2930 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

2932 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

2934 * New "case_product" attribute to generate a case rule doing multiple

2935 case distinctions at the same time. E.g.

2937 list.exhaust [case_product nat.exhaust]

2939 produces a rule which can be used to perform case distinction on both

2940 a list and a nat.

2942 * New "eventually_elim" method as a generalized variant of the

2943 eventually_elim* rules. Supports structured proofs.

2945 * Typedef with implicit set definition is considered legacy. Use

2946 "typedef (open)" form instead, which will eventually become the

2947 default.

2949 * Record: code generation can be switched off manually with

2951 declare [[record_coden = false]] -- "default true"

2953 * Datatype: type parameters allow explicit sort constraints.

2955 * Concrete syntax for case expressions includes constraints for source

2956 positions, and thus produces Prover IDE markup for its bindings.

2957 INCOMPATIBILITY for old-style syntax translations that augment the

2958 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of

2959 one_case.

2961 * Clarified attribute "mono_set": pure declaration without modifying

2962 the result of the fact expression.

2964 * More default pred/set conversions on a couple of relation operations

2965 and predicates. Added powers of predicate relations. Consolidation

2966 of some relation theorems:

2968 converse_def ~> converse_unfold

2969 rel_comp_def ~> relcomp_unfold

2970 symp_def ~> (modified, use symp_def and sym_def instead)

2971 transp_def ~> transp_trans

2972 Domain_def ~> Domain_unfold

2973 Range_def ~> Domain_converse [symmetric]

2975 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

2977 See theory "Relation" for examples for making use of pred/set

2978 conversions by means of attributes "to_set" and "to_pred".

2980 INCOMPATIBILITY.

2982 * Renamed facts about the power operation on relations, i.e., relpow

2983 to match the constant's name:

2985 rel_pow_1 ~> relpow_1

2986 rel_pow_0_I ~> relpow_0_I

2987 rel_pow_Suc_I ~> relpow_Suc_I

2988 rel_pow_Suc_I2 ~> relpow_Suc_I2

2989 rel_pow_0_E ~> relpow_0_E

2990 rel_pow_Suc_E ~> relpow_Suc_E

2991 rel_pow_E ~> relpow_E

2992 rel_pow_Suc_D2 ~> relpow_Suc_D2

2993 rel_pow_Suc_E2 ~> relpow_Suc_E2

2994 rel_pow_Suc_D2' ~> relpow_Suc_D2'

2995 rel_pow_E2 ~> relpow_E2

2996 rel_pow_add ~> relpow_add

2997 rel_pow_commute ~> relpow

2998 rel_pow_empty ~> relpow_empty:

2999 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

3000 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

3001 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

3002 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

3003 rel_pow_fun_conv ~> relpow_fun_conv

3004 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

3005 rel_pow_finite_bounded ~> relpow_finite_bounded

3006 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

3007 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

3008 single_valued_rel_pow ~> single_valued_relpow

3010 INCOMPATIBILITY.

3012 * Theory Relation: Consolidated constant name for relation composition

3013 and corresponding theorem names:

3015 - Renamed constant rel_comp to relcomp.

3017 - Dropped abbreviation pred_comp. Use relcompp instead.

3019 - Renamed theorems:

3021 rel_compI ~> relcompI

3022 rel_compEpair ~> relcompEpair

3023 rel_compE ~> relcompE

3024 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

3025 rel_comp_empty1 ~> relcomp_empty1

3026 rel_comp_mono ~> relcomp_mono

3027 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

3028 rel_comp_distrib ~> relcomp_distrib

3029 rel_comp_distrib2 ~> relcomp_distrib2

3030 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

3031 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

3032 single_valued_rel_comp ~> single_valued_relcomp

3033 rel_comp_def ~> relcomp_unfold

3034 converse_rel_comp ~> converse_relcomp

3035 pred_compI ~> relcomppI

3036 pred_compE ~> relcomppE

3037 pred_comp_bot1 ~> relcompp_bot1

3038 pred_comp_bot2 ~> relcompp_bot2

3039 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

3040 pred_comp_mono ~> relcompp_mono

3041 pred_comp_distrib ~> relcompp_distrib

3042 pred_comp_distrib2 ~> relcompp_distrib2

3043 converse_pred_comp ~> converse_relcompp

3045 finite_rel_comp ~> finite_relcomp

3047 set_rel_comp ~> set_relcomp

3049 INCOMPATIBILITY.

3051 * Theory Divides: Discontinued redundant theorems about div and mod.

3052 INCOMPATIBILITY, use the corresponding generic theorems instead.

3054 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

3055 zdiv_self ~> div_self

3056 zmod_self ~> mod_self

3057 zdiv_zero ~> div_0

3058 zmod_zero ~> mod_0

3059 zdiv_zmod_equality ~> div_mod_equality2

3060 zdiv_zmod_equality2 ~> div_mod_equality

3061 zmod_zdiv_trivial ~> mod_div_trivial

3062 zdiv_zminus_zminus ~> div_minus_minus

3063 zmod_zminus_zminus ~> mod_minus_minus

3064 zdiv_zminus2 ~> div_minus_right

3065 zmod_zminus2 ~> mod_minus_right

3066 zdiv_minus1_right ~> div_minus1_right

3067 zmod_minus1_right ~> mod_minus1_right

3068 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

3069 zmod_zmult1_eq ~> mod_mult_right_eq

3070 zpower_zmod ~> power_mod

3071 zdvd_zmod ~> dvd_mod

3072 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

3073 mod_mult_distrib ~> mult_mod_left

3074 mod_mult_distrib2 ~> mult_mod_right

3076 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

3077 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

3079 * Finite_Set.fold now qualified. INCOMPATIBILITY.

3081 * Consolidated theorem names concerning fold combinators:

3083 inf_INFI_fold_inf ~> inf_INF_fold_inf

3084 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

3085 INFI_fold_inf ~> INF_fold_inf

3086 SUPR_fold_sup ~> SUP_fold_sup

3087 union_set ~> union_set_fold

3088 minus_set ~> minus_set_fold

3089 INFI_set_fold ~> INF_set_fold

3090 SUPR_set_fold ~> SUP_set_fold

3091 INF_code ~> INF_set_foldr

3092 SUP_code ~> SUP_set_foldr

3093 foldr.simps ~> foldr.simps (in point-free formulation)

3094 foldr_fold_rev ~> foldr_conv_fold

3095 foldl_fold ~> foldl_conv_fold

3096 foldr_foldr ~> foldr_conv_foldl

3097 foldl_foldr ~> foldl_conv_foldr

3098 fold_set_remdups ~> fold_set_fold_remdups

3099 fold_set ~> fold_set_fold

3100 fold1_set ~> fold1_set_fold

3102 INCOMPATIBILITY.

3104 * Dropped rarely useful theorems concerning fold combinators:

3105 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

3106 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

3107 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

3108 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

3109 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

3110 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

3111 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"

3112 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be

3113 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by

3114 unfolding "foldr_conv_fold" and "foldl_conv_fold".

3116 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

3117 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

3118 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

3119 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

3120 lemmas over fold rather than foldr, or make use of lemmas

3121 fold_conv_foldr and fold_rev.

3123 * Congruence rules Option.map_cong and Option.bind_cong for recursion

3124 through option types.

3126 * "Transitive_Closure.ntrancl": bounded transitive closure on

3127 relations.

3129 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

3131 * Theory Int: Discontinued many legacy theorems specific to type int.

3132 INCOMPATIBILITY, use the corresponding generic theorems instead.

3134 zminus_zminus ~> minus_minus

3135 zminus_0 ~> minus_zero

3136 zminus_zadd_distrib ~> minus_add_distrib

3137 zadd_commute ~> add_commute

3138 zadd_assoc ~> add_assoc

3139 zadd_left_commute ~> add_left_commute

3140 zadd_ac ~> add_ac

3141 zmult_ac ~> mult_ac

3142 zadd_0 ~> add_0_left

3143 zadd_0_right ~> add_0_right

3144 zadd_zminus_inverse2 ~> left_minus

3145 zmult_zminus ~> mult_minus_left

3146 zmult_commute ~> mult_commute

3147 zmult_assoc ~> mult_assoc

3148 zadd_zmult_distrib ~> left_distrib

3149 zadd_zmult_distrib2 ~> right_distrib

3150 zdiff_zmult_distrib ~> left_diff_distrib

3151 zdiff_zmult_distrib2 ~> right_diff_distrib

3152 zmult_1 ~> mult_1_left

3153 zmult_1_right ~> mult_1_right

3154 zle_refl ~> order_refl

3155 zle_trans ~> order_trans

3156 zle_antisym ~> order_antisym

3157 zle_linear ~> linorder_linear

3158 zless_linear ~> linorder_less_linear

3159 zadd_left_mono ~> add_left_mono

3160 zadd_strict_right_mono ~> add_strict_right_mono

3161 zadd_zless_mono ~> add_less_le_mono

3162 int_0_less_1 ~> zero_less_one

3163 int_0_neq_1 ~> zero_neq_one

3164 zless_le ~> less_le

3165 zpower_zadd_distrib ~> power_add

3166 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

3167 zero_le_zpower_abs ~> zero_le_power_abs

3169 * Theory Deriv: Renamed

3171 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

3173 * Theory Library/Multiset: Improved code generation of multisets.

3175 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

3176 are expressed via type classes again. The special syntax

3177 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

3178 setsum_set, which is now subsumed by Big_Operators.setsum.

3179 INCOMPATIBILITY.

3181 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

3182 use theory HOL/Library/Nat_Bijection instead.

3184 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

3185 trees is now inside a type class context. Names of affected

3186 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for

3187 theories working directly with raw red-black trees, adapt the names as

3188 follows:

3190 Operations:

3191 bulkload -> rbt_bulkload

3192 del_from_left -> rbt_del_from_left

3193 del_from_right -> rbt_del_from_right

3194 del -> rbt_del

3195 delete -> rbt_delete

3196 ins -> rbt_ins

3197 insert -> rbt_insert

3198 insertw -> rbt_insert_with

3199 insert_with_key -> rbt_insert_with_key

3200 map_entry -> rbt_map_entry

3201 lookup -> rbt_lookup

3202 sorted -> rbt_sorted

3203 tree_greater -> rbt_greater

3204 tree_less -> rbt_less

3205 tree_less_symbol -> rbt_less_symbol

3206 union -> rbt_union

3207 union_with -> rbt_union_with

3208 union_with_key -> rbt_union_with_key

3210 Lemmas:

3211 balance_left_sorted -> balance_left_rbt_sorted

3212 balance_left_tree_greater -> balance_left_rbt_greater

3213 balance_left_tree_less -> balance_left_rbt_less

3214 balance_right_sorted -> balance_right_rbt_sorted

3215 balance_right_tree_greater -> balance_right_rbt_greater

3216 balance_right_tree_less -> balance_right_rbt_less

3217 balance_sorted -> balance_rbt_sorted

3218 balance_tree_greater -> balance_rbt_greater

3219 balance_tree_less -> balance_rbt_less

3220 bulkload_is_rbt -> rbt_bulkload_is_rbt

3221 combine_sorted -> combine_rbt_sorted

3222 combine_tree_greater -> combine_rbt_greater

3223 combine_tree_less -> combine_rbt_less

3224 delete_in_tree -> rbt_delete_in_tree

3225 delete_is_rbt -> rbt_delete_is_rbt

3226 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

3227 del_from_left_tree_less -> rbt_del_from_left_rbt_less

3228 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

3229 del_from_right_tree_less -> rbt_del_from_right_rbt_less

3230 del_in_tree -> rbt_del_in_tree

3231 del_inv1_inv2 -> rbt_del_inv1_inv2

3232 del_sorted -> rbt_del_rbt_sorted

3233 del_tree_greater -> rbt_del_rbt_greater

3234 del_tree_less -> rbt_del_rbt_less

3235 dom_lookup_Branch -> dom_rbt_lookup_Branch

3236 entries_lookup -> entries_rbt_lookup

3237 finite_dom_lookup -> finite_dom_rbt_lookup

3238 insert_sorted -> rbt_insert_rbt_sorted

3239 insertw_is_rbt -> rbt_insertw_is_rbt

3240 insertwk_is_rbt -> rbt_insertwk_is_rbt

3241 insertwk_sorted -> rbt_insertwk_rbt_sorted

3242 insertw_sorted -> rbt_insertw_rbt_sorted

3243 ins_sorted -> ins_rbt_sorted

3244 ins_tree_greater -> ins_rbt_greater

3245 ins_tree_less -> ins_rbt_less

3246 is_rbt_sorted -> is_rbt_rbt_sorted

3247 lookup_balance -> rbt_lookup_balance

3248 lookup_bulkload -> rbt_lookup_rbt_bulkload

3249 lookup_delete -> rbt_lookup_rbt_delete

3250 lookup_Empty -> rbt_lookup_Empty

3251 lookup_from_in_tree -> rbt_lookup_from_in_tree

3252 lookup_in_tree -> rbt_lookup_in_tree

3253 lookup_ins -> rbt_lookup_ins

3254 lookup_insert -> rbt_lookup_rbt_insert

3255 lookup_insertw -> rbt_lookup_rbt_insertw

3256 lookup_insertwk -> rbt_lookup_rbt_insertwk

3257 lookup_keys -> rbt_lookup_keys

3258 lookup_map -> rbt_lookup_map

3259 lookup_map_entry -> rbt_lookup_rbt_map_entry

3260 lookup_tree_greater -> rbt_lookup_rbt_greater

3261 lookup_tree_less -> rbt_lookup_rbt_less

3262 lookup_union -> rbt_lookup_rbt_union

3263 map_entry_color_of -> rbt_map_entry_color_of

3264 map_entry_inv1 -> rbt_map_entry_inv1

3265 map_entry_inv2 -> rbt_map_entry_inv2

3266 map_entry_is_rbt -> rbt_map_entry_is_rbt

3267 map_entry_sorted -> rbt_map_entry_rbt_sorted

3268 map_entry_tree_greater -> rbt_map_entry_rbt_greater

3269 map_entry_tree_less -> rbt_map_entry_rbt_less

3270 map_tree_greater -> map_rbt_greater

3271 map_tree_less -> map_rbt_less

3272 map_sorted -> map_rbt_sorted

3273 paint_sorted -> paint_rbt_sorted

3274 paint_lookup -> paint_rbt_lookup

3275 paint_tree_greater -> paint_rbt_greater

3276 paint_tree_less -> paint_rbt_less

3277 sorted_entries -> rbt_sorted_entries

3278 tree_greater_eq_trans -> rbt_greater_eq_trans

3279 tree_greater_nit -> rbt_greater_nit

3280 tree_greater_prop -> rbt_greater_prop

3281 tree_greater_simps -> rbt_greater_simps

3282 tree_greater_trans -> rbt_greater_trans

3283 tree_less_eq_trans -> rbt_less_eq_trans

3284 tree_less_nit -> rbt_less_nit

3285 tree_less_prop -> rbt_less_prop

3286 tree_less_simps -> rbt_less_simps

3287 tree_less_trans -> rbt_less_trans

3288 tree_ord_props -> rbt_ord_props

3289 union_Branch -> rbt_union_Branch

3290 union_is_rbt -> rbt_union_is_rbt

3291 unionw_is_rbt -> rbt_unionw_is_rbt

3292 unionwk_is_rbt -> rbt_unionwk_is_rbt

3293 unionwk_sorted -> rbt_unionwk_rbt_sorted

3295 * Theory HOL/Library/Float: Floating point numbers are now defined as

3296 a subset of the real numbers. All operations are defined using the

3297 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

3299 Changed Operations:

3300 float_abs -> abs

3301 float_nprt -> nprt

3302 float_pprt -> pprt

3303 pow2 -> use powr

3304 round_down -> float_round_down

3305 round_up -> float_round_up

3306 scale -> exponent

3308 Removed Operations:

3309 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

3311 Renamed Lemmas:

3312 abs_float_def -> Float.compute_float_abs

3313 bitlen_ge0 -> bitlen_nonneg

3314 bitlen.simps -> Float.compute_bitlen

3315 float_components -> Float_mantissa_exponent

3316 float_divl.simps -> Float.compute_float_divl

3317 float_divr.simps -> Float.compute_float_divr

3318 float_eq_odd -> mult_powr_eq_mult_powr_iff

3319 float_power -> real_of_float_power

3320 lapprox_posrat_def -> Float.compute_lapprox_posrat

3321 lapprox_rat.simps -> Float.compute_lapprox_rat

3322 le_float_def' -> Float.compute_float_le

3323 le_float_def -> less_eq_float.rep_eq

3324 less_float_def' -> Float.compute_float_less

3325 less_float_def -> less_float.rep_eq

3326 normfloat_def -> Float.compute_normfloat

3327 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

3328 normfloat -> normfloat_def

3329 normfloat_unique -> use normfloat_def

3330 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

3331 one_float_def -> Float.compute_float_one

3332 plus_float_def -> Float.compute_float_plus

3333 rapprox_posrat_def -> Float.compute_rapprox_posrat

3334 rapprox_rat.simps -> Float.compute_rapprox_rat

3335 real_of_float_0 -> zero_float.rep_eq

3336 real_of_float_1 -> one_float.rep_eq

3337 real_of_float_abs -> abs_float.rep_eq

3338 real_of_float_add -> plus_float.rep_eq

3339 real_of_float_minus -> uminus_float.rep_eq

3340 real_of_float_mult -> times_float.rep_eq

3341 real_of_float_simp -> Float.rep_eq

3342 real_of_float_sub -> minus_float.rep_eq

3343 round_down.simps -> Float.compute_float_round_down

3344 round_up.simps -> Float.compute_float_round_up

3345 times_float_def -> Float.compute_float_times

3346 uminus_float_def -> Float.compute_float_uminus

3347 zero_float_def -> Float.compute_float_zero

3349 Lemmas not necessary anymore, use the transfer method:

3350 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

3351 float_divr, float_le_simp, float_less1_mantissa_bound,

3352 float_less_simp, float_less_zero, float_le_zero,

3353 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

3354 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

3355 lapprox_rat_bottom, normalized_float, rapprox_posrat,

3356 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

3357 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

3358 round_up, zero_le_float, zero_less_float

3360 * New theory HOL/Library/DAList provides an abstract type for

3361 association lists with distinct keys.

3363 * Session HOL/IMP: Added new theory of abstract interpretation of

3364 annotated commands.

3366 * Session HOL-Import: Re-implementation from scratch is faster,

3367 simpler, and more scalable. Requires a proof bundle, which is

3368 available as an external component. Discontinued old (and mostly

3369 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

3371 * Session HOL-Word: Discontinued many redundant theorems specific to

3372 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

3373 instead.

3375 word_sub_alt ~> word_sub_wi

3376 word_add_alt ~> word_add_def

3377 word_mult_alt ~> word_mult_def

3378 word_minus_alt ~> word_minus_def

3379 word_0_alt ~> word_0_wi

3380 word_1_alt ~> word_1_wi

3381 word_add_0 ~> add_0_left

3382 word_add_0_right ~> add_0_right

3383 word_mult_1 ~> mult_1_left

3384 word_mult_1_right ~> mult_1_right

3385 word_add_commute ~> add_commute

3386 word_add_assoc ~> add_assoc

3387 word_add_left_commute ~> add_left_commute

3388 word_mult_commute ~> mult_commute

3389 word_mult_assoc ~> mult_assoc

3390 word_mult_left_commute ~> mult_left_commute

3391 word_left_distrib ~> left_distrib

3392 word_right_distrib ~> right_distrib

3393 word_left_minus ~> left_minus

3394 word_diff_0_right ~> diff_0_right

3395 word_diff_self ~> diff_self

3396 word_sub_def ~> diff_minus

3397 word_diff_minus ~> diff_minus

3398 word_add_ac ~> add_ac

3399 word_mult_ac ~> mult_ac

3400 word_plus_ac0 ~> add_0_left add_0_right add_ac

3401 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

3402 word_order_trans ~> order_trans

3403 word_order_refl ~> order_refl

3404 word_order_antisym ~> order_antisym

3405 word_order_linear ~> linorder_linear

3406 lenw1_zero_neq_one ~> zero_neq_one

3407 word_number_of_eq ~> number_of_eq

3408 word_of_int_add_hom ~> wi_hom_add

3409 word_of_int_sub_hom ~> wi_hom_sub

3410 word_of_int_mult_hom ~> wi_hom_mult

3411 word_of_int_minus_hom ~> wi_hom_neg

3412 word_of_int_succ_hom ~> wi_hom_succ

3413 word_of_int_pred_hom ~> wi_hom_pred

3414 word_of_int_0_hom ~> word_0_wi

3415 word_of_int_1_hom ~> word_1_wi

3417 * Session HOL-Word: New proof method "word_bitwise" for splitting

3418 machine word equalities and inequalities into logical circuits,

3419 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

3420 multiplication, shifting by constants, bitwise operators and numeric

3421 constants. Requires fixed-length word types, not 'a word. Solves

3422 many standard word identities outright and converts more into first

3423 order problems amenable to blast or similar. See also examples in

3424 HOL/Word/Examples/WordExamples.thy.

3426 * Session HOL-Probability: Introduced the type "'a measure" to

3427 represent measures, this replaces the records 'a algebra and 'a

3428 measure_space. The locales based on subset_class now have two

3429 locale-parameters the space \<Omega> and the set of measurable sets M.

3430 The product of probability spaces uses now the same constant as the

3431 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

3432 measure". Most constants are defined now outside of locales and gain

3433 an additional parameter, like null_sets, almost_eventually or \<mu>'.

3434 Measure space constructions for distributions and densities now got

3435 their own constants distr and density. Instead of using locales to

3436 describe measure spaces with a finite space, the measure count_space

3437 and point_measure is introduced. INCOMPATIBILITY.

3439 Renamed constants:

3440 measure -> emeasure

3441 finite_measure.\<mu>' -> measure

3442 product_algebra_generator -> prod_algebra

3443 product_prob_space.emb -> prod_emb

3444 product_prob_space.infprod_algebra -> PiM

3446 Removed locales:

3447 completeable_measure_space

3448 finite_measure_space

3449 finite_prob_space

3450 finite_product_finite_prob_space

3451 finite_product_sigma_algebra

3452 finite_sigma_algebra

3453 measure_space

3454 pair_finite_prob_space

3455 pair_finite_sigma_algebra

3456 pair_finite_space

3457 pair_sigma_algebra

3458 product_sigma_algebra

3460 Removed constants:

3461 conditional_space

3462 distribution -> use distr measure, or distributed predicate

3463 image_space

3464 joint_distribution -> use distr measure, or distributed predicate

3465 pair_measure_generator

3466 product_prob_space.infprod_algebra -> use PiM

3467 subvimage

3469 Replacement theorems:

3470 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

3471 finite_measure.empty_measure -> measure_empty

3472 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

3473 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

3474 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

3475 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

3476 finite_measure.finite_measure -> finite_measure.emeasure_finite

3477 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

3478 finite_measure.positive_measure' -> measure_nonneg

3479 finite_measure.real_measure -> finite_measure.emeasure_real

3480 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

3481 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

3482 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

3483 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

3484 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

3485 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

3486 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

3487 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

3488 information_space.entropy_commute -> information_space.entropy_commute_simple

3489 information_space.entropy_eq -> information_space.entropy_simple_distributed

3490 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

3491 information_space.entropy_positive -> information_space.entropy_nonneg_simple

3492 information_space.entropy_uniform_max -> information_space.entropy_uniform

3493 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

3494 information_space.KL_eq_0 -> information_space.KL_same_eq_0

3495 information_space.KL_ge_0 -> information_space.KL_nonneg

3496 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

3497 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

3498 Int_stable_cuboids -> Int_stable_atLeastAtMost

3499 Int_stable_product_algebra_generator -> positive_integral

3500 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

3501 measure_space.additive -> emeasure_additive

3502 measure_space.AE_iff_null_set -> AE_iff_null

3503 measure_space.almost_everywhere_def -> eventually_ae_filter

3504 measure_space.almost_everywhere_vimage -> AE_distrD

3505 measure_space.continuity_from_above -> INF_emeasure_decseq

3506 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

3507 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

3508 measure_space.continuity_from_below -> SUP_emeasure_incseq

3509 measure_space_density -> emeasure_density

3510 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

3511 measure_space.integrable_vimage -> integrable_distr

3512 measure_space.integral_translated_density -> integral_density

3513 measure_space.integral_vimage -> integral_distr

3514 measure_space.measure_additive -> plus_emeasure

3515 measure_space.measure_compl -> emeasure_compl

3516 measure_space.measure_countable_increasing -> emeasure_countable_increasing

3517 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

3518 measure_space.measure_decseq -> decseq_emeasure

3519 measure_space.measure_Diff -> emeasure_Diff

3520 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

3521 measure_space.measure_eq_0 -> emeasure_eq_0

3522 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

3523 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

3524 measure_space.measure_incseq -> incseq_emeasure

3525 measure_space.measure_insert -> emeasure_insert

3526 measure_space.measure_mono -> emeasure_mono

3527 measure_space.measure_not_negative -> emeasure_not_MInf

3528 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

3529 measure_space.measure_setsum -> setsum_emeasure

3530 measure_space.measure_setsum_split -> setsum_emeasure_cover

3531 measure_space.measure_space_vimage -> emeasure_distr

3532 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

3533 measure_space.measure_subadditive -> subadditive

3534 measure_space.measure_top -> emeasure_space

3535 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

3536 measure_space.measure_Un_null_set -> emeasure_Un_null_set

3537 measure_space.positive_integral_translated_density -> positive_integral_density

3538 measure_space.positive_integral_vimage -> positive_integral_distr

3539 measure_space.real_continuity_from_above -> Lim_measure_decseq

3540 measure_space.real_continuity_from_below -> Lim_measure_incseq

3541 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

3542 measure_space.real_measure_Diff -> measure_Diff

3543 measure_space.real_measure_finite_Union -> measure_finite_Union

3544 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

3545 measure_space.real_measure_subadditive -> measure_subadditive

3546 measure_space.real_measure_Union -> measure_Union

3547 measure_space.real_measure_UNION -> measure_UNION

3548 measure_space.simple_function_vimage -> simple_function_comp

3549 measure_space.simple_integral_vimage -> simple_integral_distr

3550 measure_space.simple_integral_vimage -> simple_integral_distr

3551 measure_unique_Int_stable -> measure_eqI_generator_eq

3552 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

3553 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

3554 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

3555 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

3556 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

3557 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

3558 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

3559 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

3560 pair_sigma_algebra.sets_swap -> sets_pair_swap

3561 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

3562 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

3563 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

3564 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

3565 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

3566 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

3567 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

3568 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

3569 prob_space.measure_space_1 -> prob_space.emeasure_space_1

3570 prob_space.prob_space_vimage -> prob_space_distr

3571 prob_space.random_variable_restrict -> measurable_restrict

3572 prob_space_unique_Int_stable -> measure_eqI_prob_space

3573 product_algebraE -> prod_algebraE_all

3574 product_algebra_generator_der -> prod_algebra_eq_finite

3575 product_algebra_generator_into_space -> prod_algebra_sets_into_space

3576 product_algebraI -> sets_PiM_I_finite

3577 product_measure_exists -> product_sigma_finite.sigma_finite

3578 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

3579 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

3580 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

3581 product_prob_space.measurable_component -> measurable_component_singleton

3582 product_prob_space.measurable_emb -> measurable_prod_emb

3583 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

3584 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

3585 product_prob_space.measure_emb -> emeasure_prod_emb

3586 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

3587 product_sigma_algebra.product_algebra_into_space -> space_closed

3588 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

3589 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

3590 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

3591 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

3592 sets_product_algebra -> sets_PiM

3593 sigma_algebra.measurable_sigma -> measurable_measure_of

3594 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

3595 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

3596 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

3597 space_product_algebra -> space_PiM

3599 * Session HOL-TPTP: support to parse and import TPTP problems (all

3600 languages) into Isabelle/HOL.

3603 *** FOL ***

3605 * New "case_product" attribute (see HOL).

3608 *** ZF ***

3610 * Greater support for structured proofs involving induction or case

3611 analysis.

3613 * Much greater use of mathematical symbols.

3615 * Removal of many ML theorem bindings. INCOMPATIBILITY.

3618 *** ML ***

3620 * Antiquotation @{keyword "name"} produces a parser for outer syntax

3621 from a minor keyword introduced via theory header declaration.

3623 * Antiquotation @{command_spec "name"} produces the

3624 Outer_Syntax.command_spec from a major keyword introduced via theory

3625 header declaration; it can be passed to Outer_Syntax.command etc.

3627 * Local_Theory.define no longer hard-wires default theorem name

3628 "foo_def", but retains the binding as given. If that is Binding.empty

3629 / Attrib.empty_binding, the result is not registered as user-level

3630 fact. The Local_Theory.define_internal variant allows to specify a

3631 non-empty name (used for the foundation in the background theory),

3632 while omitting the fact binding in the user-context. Potential

3633 INCOMPATIBILITY for derived definitional packages: need to specify

3634 naming policy for primitive definitions more explicitly.

3636 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

3637 conformance with similar operations in structure Term and Logic.

3639 * Antiquotation @{attributes [...]} embeds attribute source

3640 representation into the ML text, which is particularly useful with

3641 declarations like Local_Theory.note.

3643 * Structure Proof_Context follows standard naming scheme. Old

3644 ProofContext has been discontinued. INCOMPATIBILITY.

3646 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

3647 change of semantics: update is applied to auxiliary local theory

3648 context as well.

3650 * Modernized some old-style infix operations:

3652 addeqcongs ~> Simplifier.add_eqcong

3653 deleqcongs ~> Simplifier.del_eqcong

3654 addcongs ~> Simplifier.add_cong

3655 delcongs ~> Simplifier.del_cong

3656 setmksimps ~> Simplifier.set_mksimps

3657 setmkcong ~> Simplifier.set_mkcong

3658 setmksym ~> Simplifier.set_mksym

3659 setmkeqTrue ~> Simplifier.set_mkeqTrue

3660 settermless ~> Simplifier.set_termless

3661 setsubgoaler ~> Simplifier.set_subgoaler

3662 addsplits ~> Splitter.add_split

3663 delsplits ~> Splitter.del_split

3666 *** System ***

3668 * USER_HOME settings variable points to cross-platform user home

3669 directory, which coincides with HOME on POSIX systems only. Likewise,

3670 the Isabelle path specification "~" now expands to $USER_HOME, instead

3671 of former $HOME. A different default for USER_HOME may be set

3672 explicitly in shell environment, before Isabelle settings are

3673 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

3674 the generic user home was intended.

3676 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

3677 notation, which is useful for the jEdit file browser, for example.

3679 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

3680 (not just JRE).

3684 New in Isabelle2011-1 (October 2011)

3685 ------------------------------------

3687 *** General ***

3689 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

3690 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

3692 - Management of multiple theory files directly from the editor

3693 buffer store -- bypassing the file-system (no requirement to save

3694 files for checking).

3696 - Markup of formal entities within the text buffer, with semantic

3697 highlighting, tooltips and hyperlinks to jump to defining source

3698 positions.

3700 - Improved text rendering, with sub/superscripts in the source

3701 buffer (including support for copy/paste wrt. output panel, HTML

3702 theory output and other non-Isabelle text boxes).

3704 - Refined scheduling of proof checking and printing of results,

3705 based on interactive editor view. (Note: jEdit folding and

3706 narrowing allows to restrict buffer perspectives explicitly.)

3708 - Reduced CPU performance requirements, usable on machines with few

3709 cores.

3711 - Reduced memory requirements due to pruning of unused document

3712 versions (garbage collection).

3714 See also ~~/src/Tools/jEdit/README.html for further information,

3715 including some remaining limitations.

3717 * Theory loader: source files are exclusively located via the master

3718 directory of each theory node (where the .thy file itself resides).

3719 The global load path (such as src/HOL/Library) has been discontinued.

3720 Note that the path element ~~ may be used to reference theories in the

3721 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".

3722 INCOMPATIBILITY.

3724 * Theory loader: source files are identified by content via SHA1

3725 digests. Discontinued former path/modtime identification and optional

3726 ISABELLE_FILE_IDENT plugin scripts.

3728 * Parallelization of nested Isar proofs is subject to

3729 Goal.parallel_proofs_threshold (default 100). See also isabelle

3730 usedir option -Q.

3732 * Name space: former unsynchronized references are now proper

3733 configuration options, with more conventional names:

3735 long_names ~> names_long

3736 short_names ~> names_short

3737 unique_names ~> names_unique

3739 Minor INCOMPATIBILITY, need to declare options in context like this:

3741 declare [[names_unique = false]]

3743 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note

3744 that the result needs to be unique, which means fact specifications

3745 may have to be refined after enriching a proof context.

3747 * Attribute "case_names" has been refined: the assumptions in each case

3748 can be named now by following the case name with [name1 name2 ...].

3750 * Isabelle/Isar reference manual has been updated and extended:

3751 - "Synopsis" provides a catalog of main Isar language concepts.

3752 - Formal references in syntax diagrams, via @{rail} antiquotation.

3753 - Updated material from classic "ref" manual, notably about

3754 "Classical Reasoner".

3757 *** HOL ***

3759 * Class bot and top require underlying partial order rather than

3760 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.

3762 * Class complete_lattice: generalized a couple of lemmas from sets;

3763 generalized theorems INF_cong and SUP_cong. New type classes for

3764 complete boolean algebras and complete linear orders. Lemmas

3765 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in

3766 class complete_linorder.

3768 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,

3769 Sup_fun_def, Inf_apply, Sup_apply.

3771 Removed redundant lemmas (the right hand side gives hints how to

3772 replace them for (metis ...), or (simp only: ...) proofs):

3774 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]

3775 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]

3776 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right

3777 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right

3778 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right

3779 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right

3780 Inter_def ~> INF_def, image_def

3781 Union_def ~> SUP_def, image_def

3782 INT_eq ~> INF_def, and image_def

3783 UN_eq ~> SUP_def, and image_def

3784 INF_subset ~> INF_superset_mono [OF _ order_refl]

3786 More consistent and comprehensive names:

3788 INTER_eq_Inter_image ~> INF_def

3789 UNION_eq_Union_image ~> SUP_def

3790 INFI_def ~> INF_def

3791 SUPR_def ~> SUP_def

3792 INF_leI ~> INF_lower

3793 INF_leI2 ~> INF_lower2

3794 le_INFI ~> INF_greatest

3795 le_SUPI ~> SUP_upper

3796 le_SUPI2 ~> SUP_upper2

3797 SUP_leI ~> SUP_least

3798 INFI_bool_eq ~> INF_bool_eq

3799 SUPR_bool_eq ~> SUP_bool_eq

3800 INFI_apply ~> INF_apply

3801 SUPR_apply ~> SUP_apply

3802 INTER_def ~> INTER_eq

3803 UNION_def ~> UNION_eq

3805 INCOMPATIBILITY.

3807 * Renamed theory Complete_Lattice to Complete_Lattices.

3808 INCOMPATIBILITY.

3810 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,

3811 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,

3812 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,

3813 Sup_insert are now declared as [simp]. INCOMPATIBILITY.

3815 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,

3816 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,

3817 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor

3818 INCOMPATIBILITY.

3820 * Added syntactic classes "inf" and "sup" for the respective

3821 constants. INCOMPATIBILITY: Changes in the argument order of the

3822 (mostly internal) locale predicates for some derived classes.

3824 * Theorem collections ball_simps and bex_simps do not contain theorems

3825 referring to UNION any longer; these have been moved to collection

3826 UN_ball_bex_simps. INCOMPATIBILITY.

3828 * Theory Archimedean_Field: floor now is defined as parameter of a

3829 separate type class floor_ceiling.

3831 * Theory Finite_Set: more coherent development of fold_set locales:

3833 locale fun_left_comm ~> locale comp_fun_commute

3834 locale fun_left_comm_idem ~> locale comp_fun_idem

3836 Both use point-free characterization; interpretation proofs may need

3837 adjustment. INCOMPATIBILITY.

3839 * Theory Limits: Type "'a net" has been renamed to "'a filter", in

3840 accordance with standard mathematical terminology. INCOMPATIBILITY.

3842 * Theory Complex_Main: The locale interpretations for the

3843 bounded_linear and bounded_bilinear locales have been removed, in

3844 order to reduce the number of duplicate lemmas. Users must use the

3845 original names for distributivity theorems, potential INCOMPATIBILITY.

3847 divide.add ~> add_divide_distrib

3848 divide.diff ~> diff_divide_distrib

3849 divide.setsum ~> setsum_divide_distrib

3850 mult.add_right ~> right_distrib

3851 mult.diff_right ~> right_diff_distrib

3852 mult_right.setsum ~> setsum_right_distrib

3853 mult_left.diff ~> left_diff_distrib

3855 * Theory Complex_Main: Several redundant theorems have been removed or

3856 replaced by more general versions. INCOMPATIBILITY.

3858 real_diff_def ~> minus_real_def

3859 real_divide_def ~> divide_real_def

3860 real_less_def ~> less_le

3861 real_abs_def ~> abs_real_def

3862 real_sgn_def ~> sgn_real_def

3863 real_mult_commute ~> mult_commute

3864 real_mult_assoc ~> mult_assoc

3865 real_mult_1 ~> mult_1_left

3866 real_add_mult_distrib ~> left_distrib

3867 real_zero_not_eq_one ~> zero_neq_one

3868 real_mult_inverse_left ~> left_inverse

3869 INVERSE_ZERO ~> inverse_zero

3870 real_le_refl ~> order_refl

3871 real_le_antisym ~> order_antisym

3872 real_le_trans ~> order_trans

3873 real_le_linear ~> linear

3874 real_le_eq_diff ~> le_iff_diff_le_0

3875 real_add_left_mono ~> add_left_mono

3876 real_mult_order ~> mult_pos_pos

3877 real_mult_less_mono2 ~> mult_strict_left_mono

3878 real_of_int_real_of_nat ~> real_of_int_of_nat_eq

3879 real_0_le_divide_iff ~> zero_le_divide_iff

3880 realpow_two_disj ~> power2_eq_iff

3881 real_squared_diff_one_factored ~> square_diff_one_factored

3882 realpow_two_diff ~> square_diff_square_factored

3883 reals_complete2 ~> complete_real

3884 real_sum_squared_expand ~> power2_sum

3885 exp_ln_eq ~> ln_unique

3886 expi_add ~> exp_add

3887 expi_zero ~> exp_zero

3888 lemma_DERIV_subst ~> DERIV_cong

3889 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff

3890 LIMSEQ_const ~> tendsto_const

3891 LIMSEQ_norm ~> tendsto_norm

3892 LIMSEQ_add ~> tendsto_add

3893 LIMSEQ_minus ~> tendsto_minus

3894 LIMSEQ_minus_cancel ~> tendsto_minus_cancel

3895 LIMSEQ_diff ~> tendsto_diff

3896 bounded_linear.LIMSEQ ~> bounded_linear.tendsto

3897 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto

3898 LIMSEQ_mult ~> tendsto_mult

3899 LIMSEQ_inverse ~> tendsto_inverse

3900 LIMSEQ_divide ~> tendsto_divide

3901 LIMSEQ_pow ~> tendsto_power

3902 LIMSEQ_setsum ~> tendsto_setsum

3903 LIMSEQ_setprod ~> tendsto_setprod

3904 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff

3905 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff

3906 LIMSEQ_imp_rabs ~> tendsto_rabs

3907 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]

3908 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]

3909 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]

3910 LIMSEQ_Complex ~> tendsto_Complex

3911 LIM_ident ~> tendsto_ident_at

3912 LIM_const ~> tendsto_const

3913 LIM_add ~> tendsto_add

3914 LIM_add_zero ~> tendsto_add_zero

3915 LIM_minus ~> tendsto_minus

3916 LIM_diff ~> tendsto_diff

3917 LIM_norm ~> tendsto_norm

3918 LIM_norm_zero ~> tendsto_norm_zero

3919 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel

3920 LIM_norm_zero_iff ~> tendsto_norm_zero_iff

3921 LIM_rabs ~> tendsto_rabs

3922 LIM_rabs_zero ~> tendsto_rabs_zero

3923 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel

3924 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff

3925 LIM_compose ~> tendsto_compose

3926 LIM_mult ~> tendsto_mult

3927 LIM_scaleR ~> tendsto_scaleR

3928 LIM_of_real ~> tendsto_of_real

3929 LIM_power ~> tendsto_power

3930 LIM_inverse ~> tendsto_inverse

3931 LIM_sgn ~> tendsto_sgn

3932 isCont_LIM_compose ~> isCont_tendsto_compose

3933 bounded_linear.LIM ~> bounded_linear.tendsto

3934 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero

3935 bounded_bilinear.LIM ~> bounded_bilinear.tendsto

3936 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero

3937 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero

3938 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero

3939 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]

3941 * Theory Complex_Main: The definition of infinite series was

3942 generalized. Now it is defined on the type class {topological_space,

3943 comm_monoid_add}. Hence it is useable also for extended real numbers.

3945 * Theory Complex_Main: The complex exponential function "expi" is now

3946 a type-constrained abbreviation for "exp :: complex => complex"; thus

3947 several polymorphic lemmas about "exp" are now applicable to "expi".

3949 * Code generation:

3951 - Theory Library/Code_Char_ord provides native ordering of

3952 characters in the target language.

3954 - Commands code_module and code_library are legacy, use export_code

3955 instead.

3957 - Method "evaluation" is legacy, use method "eval" instead.

3959 - Legacy evaluator "SML" is deactivated by default. May be

3960 reactivated by the following theory command:

3962 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}

3964 * Declare ext [intro] by default. Rare INCOMPATIBILITY.

3966 * New proof method "induction" that gives induction hypotheses the

3967 name "IH", thus distinguishing them from further hypotheses that come

3968 from rule induction. The latter are still called "hyps". Method

3969 "induction" is a thin wrapper around "induct" and follows the same

3970 syntax.

3972 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is

3973 still available as a legacy feature for some time.

3975 * Nitpick:

3976 - Added "need" and "total_consts" options.

3977 - Reintroduced "show_skolems" option by popular demand.

3978 - Renamed attribute: nitpick_def ~> nitpick_unfold.

3979 INCOMPATIBILITY.

3981 * Sledgehammer:

3982 - Use quasi-sound (and efficient) translations by default.

3983 - Added support for the following provers: E-ToFoF, LEO-II,

3984 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.

3985 - Automatically preplay and minimize proofs before showing them if

3986 this can be done within reasonable time.

3987 - sledgehammer available_provers ~> sledgehammer supported_provers.

3988 INCOMPATIBILITY.

3989 - Added "preplay_timeout", "slicing", "type_enc", "sound",

3990 "max_mono_iters", and "max_new_mono_instances" options.

3991 - Removed "explicit_apply" and "full_types" options as well as "Full

3992 Types" Proof General menu item. INCOMPATIBILITY.

3994 * Metis:

3995 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.

3996 - Obsoleted "metisFT" -- use "metis (full_types)" instead.

3997 INCOMPATIBILITY.

3999 * Command 'try':

4000 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and

4001 "elim:" options. INCOMPATIBILITY.

4002 - Introduced 'try' that not only runs 'try_methods' but also

4003 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.

4005 * Quickcheck:

4006 - Added "eval" option to evaluate terms for the found counterexample

4007 (currently only supported by the default (exhaustive) tester).

4008 - Added post-processing of terms to obtain readable counterexamples

4009 (currently only supported by the default (exhaustive) tester).

4010 - New counterexample generator quickcheck[narrowing] enables

4011 narrowing-based testing. Requires the Glasgow Haskell compiler

4012 with its installation location defined in the Isabelle settings

4013 environment as ISABELLE_GHC.

4014 - Removed quickcheck tester "SML" based on the SML code generator

4015 (formly in HOL/Library).

4017 * Function package: discontinued option "tailrec". INCOMPATIBILITY,

4018 use 'partial_function' instead.

4020 * Theory Library/Extended_Reals replaces now the positive extended

4021 reals found in probability theory. This file is extended by

4022 Multivariate_Analysis/Extended_Real_Limits.

4024 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,

4025 from where it must be imported explicitly if it is really required.

4026 INCOMPATIBILITY.

4028 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has

4029 been moved here. INCOMPATIBILITY.

4031 * Theory Library/Saturated provides type of numbers with saturated

4032 arithmetic.

4034 * Theory Library/Product_Lattice defines a pointwise ordering for the

4035 product type 'a * 'b, and provides instance proofs for various order

4036 and lattice type classes.

4038 * Theory Library/Countable now provides the "countable_datatype" proof

4039 method for proving "countable" class instances for datatypes.

4041 * Theory Library/Cset_Monad allows do notation for computable sets

4042 (cset) via the generic monad ad-hoc overloading facility.

4044 * Library: Theories of common data structures are split into theories

4045 for implementation, an invariant-ensuring type, and connection to an

4046 abstract type. INCOMPATIBILITY.

4048 - RBT is split into RBT and RBT_Mapping.

4049 - AssocList is split and renamed into AList and AList_Mapping.

4050 - DList is split into DList_Impl, DList, and DList_Cset.

4051 - Cset is split into Cset and List_Cset.

4053 * Theory Library/Nat_Infinity has been renamed to

4054 Library/Extended_Nat, with name changes of the following types and

4055 constants:

4057 type inat ~> type enat

4058 Fin ~> enat

4059 Infty ~> infinity (overloaded)

4060 iSuc ~> eSuc

4061 the_Fin ~> the_enat

4063 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has

4064 been renamed accordingly. INCOMPATIBILITY.

4066 * Session Multivariate_Analysis: The euclidean_space type class now

4067 fixes a constant "Basis :: 'a set" consisting of the standard

4068 orthonormal basis for the type. Users now have the option of

4069 quantifying over this set instead of using the "basis" function, e.g.

4070 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".

4072 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed

4073 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants

4074 "Cart_nth" and "Cart_lambda" have been respectively renamed to

4075 "vec_nth" and "vec_lambda"; theorems mentioning those names have

4076 changed to match. Definition theorems for overloaded constants now use

4077 the standard "foo_vec_def" naming scheme. A few other theorems have

4078 been renamed as follows (INCOMPATIBILITY):

4080 Cart_eq ~> vec_eq_iff

4081 dist_nth_le_cart ~> dist_vec_nth_le

4082 tendsto_vector ~> vec_tendstoI

4083 Cauchy_vector ~> vec_CauchyI

4085 * Session Multivariate_Analysis: Several duplicate theorems have been

4086 removed, and other theorems have been renamed or replaced with more

4087 general versions. INCOMPATIBILITY.

4089 finite_choice ~> finite_set_choice

4090 eventually_conjI ~> eventually_conj

4091 eventually_and ~> eventually_conj_iff

4092 eventually_false ~> eventually_False

4093 setsum_norm ~> norm_setsum

4094 Lim_sequentially ~> LIMSEQ_def

4095 Lim_ident_at ~> LIM_ident

4096 Lim_const ~> tendsto_const

4097 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]

4098 Lim_neg ~> tendsto_minus

4099 Lim_add ~> tendsto_add

4100 Lim_sub ~> tendsto_diff

4101 Lim_mul ~> tendsto_scaleR

4102 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]

4103 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]

4104 Lim_linear ~> bounded_linear.tendsto

4105 Lim_component ~> tendsto_euclidean_component

4106 Lim_component_cart ~> tendsto_vec_nth

4107 Lim_inner ~> tendsto_inner [OF tendsto_const]

4108 dot_lsum ~> inner_setsum_left

4109 dot_rsum ~> inner_setsum_right

4110 continuous_cmul ~> continuous_scaleR [OF continuous_const]

4111 continuous_neg ~> continuous_minus

4112 continuous_sub ~> continuous_diff

4113 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]

4114 continuous_mul ~> continuous_scaleR

4115 continuous_inv ~> continuous_inverse

4116 continuous_at_within_inv ~> continuous_at_within_inverse

4117 continuous_at_inv ~> continuous_at_inverse

4118 continuous_at_norm ~> continuous_norm [OF continuous_at_id]

4119 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]

4120 continuous_at_component ~> continuous_component [OF continuous_at_id]

4121 continuous_on_neg ~> continuous_on_minus

4122 continuous_on_sub ~> continuous_on_diff

4123 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]

4124 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]

4125 continuous_on_mul ~> continuous_on_scaleR

4126 continuous_on_mul_real ~> continuous_on_mult

4127 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]

4128 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]

4129 continuous_on_inverse ~> continuous_on_inv

4130 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus

4131 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff

4132 subset_interior ~> interior_mono

4133 subset_closure ~> closure_mono

4134 closure_univ ~> closure_UNIV

4135 real_arch_lt ~> reals_Archimedean2

4136 real_arch ~> reals_Archimedean3

4137 real_abs_norm ~> abs_norm_cancel

4138 real_abs_sub_norm ~> norm_triangle_ineq3

4139 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2

4141 * Session HOL-Probability:

4142 - Caratheodory's extension lemma is now proved for ring_of_sets.

4143 - Infinite products of probability measures are now available.

4144 - Sigma closure is independent, if the generator is independent

4145 - Use extended reals instead of positive extended

4146 reals. INCOMPATIBILITY.

4148 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.

4150 expand_fun_below ~> fun_below_iff

4151 below_fun_ext ~> fun_belowI

4152 expand_cfun_eq ~> cfun_eq_iff

4153 ext_cfun ~> cfun_eqI

4154 expand_cfun_below ~> cfun_below_iff

4155 below_cfun_ext ~> cfun_belowI

4156 monofun_fun_fun ~> fun_belowD

4157 monofun_fun_arg ~> monofunE

4158 monofun_lub_fun ~> adm_monofun [THEN admD]

4159 cont_lub_fun ~> adm_cont [THEN admD]

4160 cont2cont_Rep_CFun ~> cont2cont_APP

4161 cont_Rep_CFun_app ~> cont_APP_app

4162 cont_Rep_CFun_app_app ~> cont_APP_app_app

4163 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]

4164 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]

4165 contlub_cfun ~> lub_APP [symmetric]

4166 contlub_LAM ~> lub_LAM [symmetric]

4167 thelubI ~> lub_eqI

4168 UU_I ~> bottomI

4169 lift_distinct1 ~> lift.distinct(1)

4170 lift_distinct2 ~> lift.distinct(2)

4171 Def_not_UU ~> lift.distinct(2)

4172 Def_inject ~> lift.inject

4173 below_UU_iff ~> below_bottom_iff

4174 eq_UU_iff ~> eq_bottom_iff

4177 *** Document preparation ***

4179 * Antiquotation @{rail} layouts railroad syntax diagrams, see also

4180 isar-ref manual, both for description and actual application of the

4181 same.

4183 * Antiquotation @{value} evaluates the given term and presents its

4184 result.

4186 * Antiquotations: term style "isub" provides ad-hoc conversion of

4187 variables x1, y23 into subscripted form x\<^isub>1,

4188 y\<^isub>2\<^isub>3.

4190 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>

4191 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).

4193 * Localized \isabellestyle switch can be used within blocks or groups

4194 like this:

4196 \isabellestyle{it} %preferred default

4197 {\isabellestylett @{text "typewriter stuff"}}

4199 * Discontinued special treatment of hard tabulators. Implicit

4200 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual

4201 layouts.

4204 *** ML ***

4206 * The inner syntax of sort/type/term/prop supports inlined YXML

4207 representations within quoted string tokens. By encoding logical

4208 entities via Term_XML (in ML or Scala) concrete syntax can be

4209 bypassed, which is particularly useful for producing bits of text

4210 under external program control.

4212 * Antiquotations for ML and document preparation are managed as theory

4213 data, which requires explicit setup.

4215 * Isabelle_Process.is_active allows tools to check if the official

4216 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop

4217 (better known as Proof General).

4219 * Structure Proof_Context follows standard naming scheme. Old

4220 ProofContext is still available for some time as legacy alias.

4222 * Structure Timing provides various operations for timing; supersedes

4223 former start_timing/end_timing etc.

4225 * Path.print is the official way to show file-system paths to users

4226 (including quotes etc.).

4228 * Inner syntax: identifiers in parse trees of generic categories

4229 "logic", "aprop", "idt" etc. carry position information (disguised as

4230 type constraints). Occasional INCOMPATIBILITY with non-compliant

4231 translations that choke on unexpected type constraints. Positions can

4232 be stripped in ML translations via Syntax.strip_positions /

4233 Syntax.strip_positions_ast, or via the syntax constant

4234 "_strip_positions" within parse trees. As last resort, positions can

4235 be disabled via the configuration option Syntax.positions, which is

4236 called "syntax_positions" in Isar attribute syntax.

4238 * Discontinued special status of various ML structures that contribute

4239 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less

4240 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,

4241 refer directly to Ast.Constant, Lexicon.is_identifier,

4242 Syntax_Trans.mk_binder_tr etc.

4244 * Typed print translation: discontinued show_sorts argument, which is

4245 already available via context of "advanced" translation.

4247 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic

4248 goal states; body tactic needs to address all subgoals uniformly.

4250 * Slightly more special eq_list/eq_set, with shortcut involving

4251 pointer equality (assumes that eq relation is reflexive).

4253 * Classical tactics use proper Proof.context instead of historic types

4254 claset/clasimpset. Old-style declarations like addIs, addEs, addDs

4255 operate directly on Proof.context. Raw type claset retains its use as

4256 snapshot of the classical context, which can be recovered via

4257 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.

4258 INCOMPATIBILITY, classical tactics and derived proof methods require

4259 proper Proof.context.

4262 *** System ***

4264 * Discontinued support for Poly/ML 5.2, which was the last version

4265 without proper multithreading and TimeLimit implementation.

4267 * Discontinued old lib/scripts/polyml-platform, which has been

4268 obsolete since Isabelle2009-2.

4270 * Various optional external tools are referenced more robustly and

4271 uniformly by explicit Isabelle settings as follows:

4273 ISABELLE_CSDP (formerly CSDP_EXE)

4274 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)

4275 ISABELLE_OCAML (formerly EXEC_OCAML)

4276 ISABELLE_SWIPL (formerly EXEC_SWIPL)

4277 ISABELLE_YAP (formerly EXEC_YAP)

4279 Note that automated detection from the file-system or search path has

4280 been discontinued. INCOMPATIBILITY.

4282 * Scala layer provides JVM method invocation service for static

4283 methods of type (String)String, see Invoke_Scala.method in ML. For

4284 example:

4286 Invoke_Scala.method "java.lang.System.getProperty" "java.home"

4288 Together with YXML.string_of_body/parse_body and XML.Encode/Decode

4289 this allows to pass structured values between ML and Scala.

4291 * The IsabelleText fonts includes some further glyphs to support the

4292 Prover IDE. Potential INCOMPATIBILITY: users who happen to have

4293 installed a local copy (which is normally *not* required) need to

4294 delete or update it from ~~/lib/fonts/.

4298 New in Isabelle2011 (January 2011)

4299 ----------------------------------

4301 *** General ***

4303 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see

4304 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with

4305 useful tooltips and hyperlinks produced from its static analysis. The

4306 bundled component provides an executable Isabelle tool that can be run

4307 like this:

4309 Isabelle2011/bin/isabelle jedit

4311 * Significantly improved Isabelle/Isar implementation manual.

4313 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER

4314 (and thus refers to something like $HOME/.isabelle/Isabelle2011),

4315 while the default heap location within that directory lacks that extra

4316 suffix. This isolates multiple Isabelle installations from each

4317 other, avoiding problems with old settings in new versions.

4318 INCOMPATIBILITY, need to copy/upgrade old user settings manually.

4320 * Source files are always encoded as UTF-8, instead of old-fashioned

4321 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require

4322 the following package declarations:

4324 \usepackage[utf8]{inputenc}

4325 \usepackage{textcomp}

4327 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that

4328 a Unicode character is treated as a single symbol, not a sequence of

4329 non-ASCII bytes as before. Since Isabelle/ML string literals may

4330 contain symbols without further backslash escapes, Unicode can now be

4331 used here as well. Recall that Symbol.explode in ML provides a

4332 consistent view on symbols, while raw explode (or String.explode)

4333 merely give a byte-oriented representation.

4335 * Theory loader: source files are primarily located via the master

4336 directory of each theory node (where the .thy file itself resides).

4337 The global load path is still partially available as legacy feature.

4338 Minor INCOMPATIBILITY due to subtle change in file lookup: use

4339 explicit paths, relatively to the theory.

4341 * Special treatment of ML file names has been discontinued.

4342 Historically, optional extensions .ML or .sml were added on demand --

4343 at the cost of clarity of file dependencies. Recall that Isabelle/ML

4344 files exclusively use the .ML extension. Minor INCOMPATIBILITY.

4346 * Various options that affect pretty printing etc. are now properly

4347 handled within the context via configuration options, instead of

4348 unsynchronized references or print modes. There are both ML Config.T

4349 entities and Isar declaration attributes to access these.

4351 ML (Config.T) Isar (attribute)

4353 eta_contract eta_contract

4354 show_brackets show_brackets

4355 show_sorts show_sorts

4356 show_types show_types

4357 show_question_marks show_question_marks

4358 show_consts show_consts

4359 show_abbrevs show_abbrevs

4361 Syntax.ast_trace syntax_ast_trace

4362 Syntax.ast_stat syntax_ast_stat

4363 Syntax.ambiguity_level syntax_ambiguity_level

4365 Goal_Display.goals_limit goals_limit

4366 Goal_Display.show_main_goal show_main_goal

4368 Method.rule_trace rule_trace

4370 Thy_Output.display thy_output_display

4371 Thy_Output.quotes thy_output_quotes

4372 Thy_Output.indent thy_output_indent

4373 Thy_Output.source thy_output_source

4374 Thy_Output.break thy_output_break

4376 Note that corresponding "..._default" references in ML may only be

4377 changed globally at the ROOT session setup, but *not* within a theory.

4378 The option "show_abbrevs" supersedes the former print mode

4379 "no_abbrevs" with inverted meaning.

4381 * More systematic naming of some configuration options.

4382 INCOMPATIBILITY.

4384 trace_simp ~> simp_trace

4385 debug_simp ~> simp_debug

4387 * Support for real valued configuration options, using simplistic

4388 floating-point notation that coincides with the inner syntax for

4389 float_token.

4391 * Support for real valued preferences (with approximative PGIP type):

4392 front-ends need to accept "pgint" values in float notation.

4393 INCOMPATIBILITY.

4395 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from

4396 DejaVu Sans.

4398 * Discontinued support for Poly/ML 5.0 and 5.1 versions.

4401 *** Pure ***

4403 * Command 'type_synonym' (with single argument) replaces somewhat

4404 outdated 'types', which is still available as legacy feature for some

4405 time.

4407 * Command 'nonterminal' (with 'and' separated list of arguments)

4408 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.

4410 * Command 'notepad' replaces former 'example_proof' for

4411 experimentation in Isar without any result. INCOMPATIBILITY.

4413 * Locale interpretation commands 'interpret' and 'sublocale' accept

4414 lists of equations to map definitions in a locale to appropriate

4415 entities in the context of the interpretation. The 'interpretation'

4416 command already provided this functionality.

4418 * Diagnostic command 'print_dependencies' prints the locale instances

4419 that would be activated if the specified expression was interpreted in

4420 the current context. Variant "print_dependencies!" assumes a context

4421 without interpretations.

4423 * Diagnostic command 'print_interps' prints interpretations in proofs

4424 in addition to interpretations in theories.

4426 * Discontinued obsolete 'global' and 'local' commands to manipulate

4427 the theory name space. Rare INCOMPATIBILITY. The ML functions

4428 Sign.root_path and Sign.local_path may be applied directly where this

4429 feature is still required for historical reasons.

4431 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use

4432 'definition' instead.

4434 * The "prems" fact, which refers to the accidental collection of

4435 foundational premises in the context, is now explicitly marked as

4436 legacy feature and will be discontinued soon. Consider using "assms"

4437 of the head statement or reference facts by explicit names.

4439 * Document antiquotations @{class} and @{type} print classes and type

4440 constructors.

4442 * Document antiquotation @{file} checks file/directory entries within

4443 the local file system.

4446 *** HOL ***

4448 * Coercive subtyping: functions can be declared as coercions and type

4449 inference will add them as necessary upon input of a term. Theory

4450 Complex_Main declares real :: nat => real and real :: int => real as

4451 coercions. A coercion function f is declared like this:

4453 declare [[coercion f]]

4455 To lift coercions through type constructors (e.g. from nat => real to

4456 nat list => real list), map functions can be declared, e.g.

4458 declare [[coercion_map map]]

4460 Currently coercion inference is activated only in theories including

4461 real numbers, i.e. descendants of Complex_Main. This is controlled by

4462 the configuration option "coercion_enabled", e.g. it can be enabled in

4463 other theories like this:

4465 declare [[coercion_enabled]]

4467 * Command 'partial_function' provides basic support for recursive

4468 function definitions over complete partial orders. Concrete instances

4469 are provided for i) the option type, ii) tail recursion on arbitrary

4470 types, and iii) the heap monad of Imperative_HOL. See

4471 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy

4472 for examples.

4474 * Function package: f.psimps rules are no longer implicitly declared

4475 as [simp]. INCOMPATIBILITY.

4477 * Datatype package: theorems generated for executable equality (class

4478 "eq") carry proper names and are treated as default code equations.

4480 * Inductive package: now offers command 'inductive_simps' to

4481 automatically derive instantiated and simplified equations for

4482 inductive predicates, similar to 'inductive_cases'.

4484 * Command 'enriched_type' allows to register properties of the

4485 functorial structure of types.

4487 * Improved infrastructure for term evaluation using code generator

4488 techniques, in particular static evaluation conversions.

4490 * Code generator: Scala (2.8 or higher) has been added to the target

4491 languages.

4493 * Code generator: globbing constant expressions "*" and "Theory.*"

4494 have been replaced by the more idiomatic "_" and "Theory._".

4495 INCOMPATIBILITY.

4497 * Code generator: export_code without explicit file declaration prints

4498 to standard output. INCOMPATIBILITY.

4500 * Code generator: do not print function definitions for case

4501 combinators any longer.

4503 * Code generator: simplification with rules determined with

4504 src/Tools/Code/code_simp.ML and method "code_simp".

4506 * Code generator for records: more idiomatic representation of record

4507 types. Warning: records are not covered by ancient SML code

4508 generation any longer. INCOMPATIBILITY. In cases of need, a suitable

4509 rep_datatype declaration helps to succeed then:

4511 record 'a foo = ...

4512 ...

4513 rep_datatype foo_ext ...

4515 * Records: logical foundation type for records does not carry a

4516 '_type' suffix any longer (obsolete due to authentic syntax).

4517 INCOMPATIBILITY.

4519 * Quickcheck now by default uses exhaustive testing instead of random

4520 testing. Random testing can be invoked by "quickcheck [random]",

4521 exhaustive testing by "quickcheck [exhaustive]".

4523 * Quickcheck instantiates polymorphic types with small finite

4524 datatypes by default. This enables a simple execution mechanism to

4525 handle quantifiers and function equality over the finite datatypes.

4527 * Quickcheck random generator has been renamed from "code" to

4528 "random". INCOMPATIBILITY.

4530 * Quickcheck now has a configurable time limit which is set to 30

4531 seconds by default. This can be changed by adding [timeout = n] to the

4532 quickcheck command. The time limit for Auto Quickcheck is still set

4533 independently.

4535 * Quickcheck in locales considers interpretations of that locale for

4536 counter example search.

4538 * Sledgehammer:

4539 - Added "smt" and "remote_smt" provers based on the "smt" proof

4540 method. See the Sledgehammer manual for details ("isabelle doc

4541 sledgehammer").

4542 - Renamed commands:

4543 sledgehammer atp_info ~> sledgehammer running_provers

4544 sledgehammer atp_kill ~> sledgehammer kill_provers

4545 sledgehammer available_atps ~> sledgehammer available_provers

4546 INCOMPATIBILITY.

4547 - Renamed options:

4548 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]

4549 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]

4550 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]

4551 (and "ms" and "min" are no longer supported)

4552 INCOMPATIBILITY.

4554 * Nitpick:

4555 - Renamed options:

4556 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]

4557 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]

4558 INCOMPATIBILITY.

4559 - Added support for partial quotient types.

4560 - Added local versions of the "Nitpick.register_xxx" functions.

4561 - Added "whack" option.

4562 - Allow registration of quotient types as codatatypes.

4563 - Improved "merge_type_vars" option to merge more types.

4564 - Removed unsound "fast_descrs" option.

4565 - Added custom symmetry breaking for datatypes, making it possible to reach

4566 higher cardinalities.

4567 - Prevent the expansion of too large definitions.

4569 * Proof methods "metis" and "meson" now have configuration options

4570 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled

4571 to diagnose these tools. E.g.

4573 using [[metis_trace = true]]

4575 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available

4576 manually as command 'solve_direct'.

4578 * The default SMT solver Z3 must be enabled explicitly (due to

4579 licensing issues) by setting the environment variable

4580 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For

4581 commercial applications, the SMT solver CVC3 is provided as fall-back;

4582 changing the SMT solver is done via the configuration option

4583 "smt_solver".

4585 * Remote SMT solvers need to be referred to by the "remote_" prefix,

4586 i.e. "remote_cvc3" and "remote_z3".

4588 * Added basic SMT support for datatypes, records, and typedefs using

4589 the oracle mode (no proofs). Direct support of pairs has been dropped

4590 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT

4591 support for a similar behavior). Minor INCOMPATIBILITY.

4593 * Changed SMT configuration options:

4594 - Renamed:

4595 z3_proofs ~> smt_oracle (with inverted meaning)

4596 z3_trace_assms ~> smt_trace_used_facts

4597 INCOMPATIBILITY.

4598 - Added:

4599 smt_verbose

4600 smt_random_seed

4601 smt_datatypes

4602 smt_infer_triggers

4603 smt_monomorph_limit

4604 cvc3_options

4605 remote_cvc3_options

4606 remote_z3_options

4607 yices_options

4609 * Boogie output files (.b2i files) need to be declared in the theory

4610 header.

4612 * Simplification procedure "list_to_set_comprehension" rewrites list

4613 comprehensions applied to List.set to set comprehensions. Occasional

4614 INCOMPATIBILITY, may be deactivated like this:

4616 declare [[simproc del: list_to_set_comprehension]]

4618 * Removed old version of primrec package. INCOMPATIBILITY.

4620 * Removed simplifier congruence rule of "prod_case", as has for long

4621 been the case with "split". INCOMPATIBILITY.

4623 * String.literal is a type, but not a datatype. INCOMPATIBILITY.

4625 * Removed [split_format ... and ... and ...] version of

4626 [split_format]. Potential INCOMPATIBILITY.

4628 * Predicate "sorted" now defined inductively, with nice induction

4629 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.

4631 * Constant "contents" renamed to "the_elem", to free the generic name

4632 contents for other uses. INCOMPATIBILITY.

4634 * Renamed class eq and constant eq (for code generation) to class

4635 equal and constant equal, plus renaming of related facts and various

4636 tuning. INCOMPATIBILITY.

4638 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.

4640 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".

4641 INCOMPATIBILITY.

4643 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to

4644 avoid confusion with finite sets. INCOMPATIBILITY.

4646 * Abandoned locales equiv, congruent and congruent2 for equivalence

4647 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same

4648 for congruent(2)).

4650 * Some previously unqualified names have been qualified:

4652 types

4653 bool ~> HOL.bool

4654 nat ~> Nat.nat

4656 constants

4657 Trueprop ~> HOL.Trueprop

4658 True ~> HOL.True

4659 False ~> HOL.False

4660 op & ~> HOL.conj

4661 op | ~> HOL.disj

4662 op --> ~> HOL.implies

4663 op = ~> HOL.eq

4664 Not ~> HOL.Not

4665 The ~> HOL.The

4666 All ~> HOL.All

4667 Ex ~> HOL.Ex

4668 Ex1 ~> HOL.Ex1

4669 Let ~> HOL.Let

4670 If ~> HOL.If

4671 Ball ~> Set.Ball

4672 Bex ~> Set.Bex

4673 Suc ~> Nat.Suc

4674 Pair ~> Product_Type.Pair

4675 fst ~> Product_Type.fst

4676 snd ~> Product_Type.snd

4677 curry ~> Product_Type.curry

4678 op : ~> Set.member

4679 Collect ~> Set.Collect

4681 INCOMPATIBILITY.

4683 * More canonical naming convention for some fundamental definitions:

4685 bot_bool_eq ~> bot_bool_def

4686 top_bool_eq ~> top_bool_def

4687 inf_bool_eq ~> inf_bool_def

4688 sup_bool_eq ~> sup_bool_def

4689 bot_fun_eq ~> bot_fun_def

4690 top_fun_eq ~> top_fun_def

4691 inf_fun_eq ~> inf_fun_def

4692 sup_fun_eq ~> sup_fun_def

4694 INCOMPATIBILITY.

4696 * More stylized fact names:

4698 expand_fun_eq ~> fun_eq_iff

4699 expand_set_eq ~> set_eq_iff

4700 set_ext ~> set_eqI

4701 nat_number ~> eval_nat_numeral

4703 INCOMPATIBILITY.

4705 * Refactoring of code-generation specific operations in theory List:

4707 constants

4708 null ~> List.null

4710 facts

4711 mem_iff ~> member_def

4712 null_empty ~> null_def

4714 INCOMPATIBILITY. Note that these were not supposed to be used

4715 regularly unless for striking reasons; their main purpose was code

4716 generation.

4718 Various operations from the Haskell prelude are used for generating

4719 Haskell code.

4721 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term

4722 "surj f" is now an abbreviation of "range f = UNIV". The theorems

4723 bij_def and surj_def are unchanged. INCOMPATIBILITY.

4725 * Abolished some non-alphabetic type names: "prod" and "sum" replace

4726 "*" and "+" respectively. INCOMPATIBILITY.

4728 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write

4729 "Sum_Type.Plus" instead.

4731 * Constant "split" has been merged with constant "prod_case"; names of

4732 ML functions, facts etc. involving split have been retained so far,

4733 though. INCOMPATIBILITY.

4735 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"

4736 instead. INCOMPATIBILITY.

4738 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".

4739 INCOMPATIBILITY.

4741 * Former theory Library/Enum is now part of the HOL-Main image.

4742 INCOMPATIBILITY: all constants of the Enum theory now have to be

4743 referred to by its qualified name.

4745 enum ~> Enum.enum

4746 nlists ~> Enum.nlists

4747 product ~> Enum.product

4749 * Theory Library/Monad_Syntax provides do-syntax for monad types.

4750 Syntax in Library/State_Monad has been changed to avoid ambiguities.

4751 INCOMPATIBILITY.

4753 * Theory Library/SetsAndFunctions has been split into

4754 Library/Function_Algebras and Library/Set_Algebras; canonical names

4755 for instance definitions for functions; various improvements.

4756 INCOMPATIBILITY.

4758 * Theory Library/Multiset provides stable quicksort implementation of

4759 sort_key.

4761 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.

4762 INCOMPATIBILITY.

4764 * Session Multivariate_Analysis: introduced a type class for euclidean

4765 space. Most theorems are now stated in terms of euclidean spaces

4766 instead of finite cartesian products.

4768 types

4769 real ^ 'n ~> 'a::real_vector

4770 ~> 'a::euclidean_space

4771 ~> 'a::ordered_euclidean_space

4772 (depends on your needs)

4774 constants

4775 _ $ _ ~> _ $$ _

4776 \<chi> x. _ ~> \<chi>\<chi> x. _

4777 CARD('n) ~> DIM('a)

4779 Also note that the indices are now natural numbers and not from some

4780 finite type. Finite cartesian products of euclidean spaces, products

4781 of euclidean spaces the real and complex numbers are instantiated to

4782 be euclidean_spaces. INCOMPATIBILITY.

4784 * Session Probability: introduced pextreal as positive extended real

4785 numbers. Use pextreal as value for measures. Introduce the

4786 Radon-Nikodym derivative, product spaces and Fubini's theorem for

4787 arbitrary sigma finite measures. Introduces Lebesgue measure based on

4788 the integral in Multivariate Analysis. INCOMPATIBILITY.

4790 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.

4791 INCOMPATIBILITY.

4793 * Session SPARK (with image HOL-SPARK) provides commands to load and

4794 prove verification conditions generated by the SPARK Ada program

4795 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.

4798 *** HOL-Algebra ***

4800 * Theorems for additive ring operations (locale abelian_monoid and

4801 descendants) are generated by interpretation from their multiplicative

4802 counterparts. Names (in particular theorem names) have the mandatory

4803 qualifier 'add'. Previous theorem names are redeclared for

4804 compatibility.

4806 * Structure "int_ring" is now an abbreviation (previously a

4807 definition). This fits more natural with advanced interpretations.

4810 *** HOLCF ***

4812 * The domain package now runs in definitional mode by default: The

4813 former command 'new_domain' is now called 'domain'. To use the domain

4814 package in its original axiomatic mode, use 'domain (unsafe)'.

4815 INCOMPATIBILITY.

4817 * The new class "domain" is now the default sort. Class "predomain"

4818 is an unpointed version of "domain". Theories can be updated by

4819 replacing sort annotations as shown below. INCOMPATIBILITY.

4821 'a::type ~> 'a::countable

4822 'a::cpo ~> 'a::predomain

4823 'a::pcpo ~> 'a::domain

4825 * The old type class "rep" has been superseded by class "domain".

4826 Accordingly, users of the definitional package must remove any

4827 "default_sort rep" declarations. INCOMPATIBILITY.

4829 * The domain package (definitional mode) now supports unpointed

4830 predomain argument types, as long as they are marked 'lazy'. (Strict

4831 arguments must be in class "domain".) For example, the following

4832 domain definition now works:

4834 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")

4836 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class

4837 instances for types from main HOL: bool, nat, int, char, 'a + 'b,

4838 'a option, and 'a list. Additionally, it configures fixrec and the

4839 domain package to work with these types. For example:

4841 fixrec isInl :: "('a + 'b) u -> tr"

4842 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"

4844 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")

4846 * The "(permissive)" option of fixrec has been replaced with a

4847 per-equation "(unchecked)" option. See

4848 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.

4850 * The "bifinite" class no longer fixes a constant "approx"; the class

4851 now just asserts that such a function exists. INCOMPATIBILITY.

4853 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer

4854 defines an embedding of type 'a defl into udom by default; instances

4855 of "bifinite" and "domain" classes are available in

4856 src/HOL/HOLCF/Library/Defl_Bifinite.thy.

4858 * The syntax "REP('a)" has been replaced with "DEFL('a)".

4860 * The predicate "directed" has been removed. INCOMPATIBILITY.

4862 * The type class "finite_po" has been removed. INCOMPATIBILITY.

4864 * The function "cprod_map" has been renamed to "prod_map".

4865 INCOMPATIBILITY.

4867 * The monadic bind operator on each powerdomain has new binder syntax

4868 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents

4869 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".

4871 * The infix syntax for binary union on each powerdomain has changed

4872 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set

4873 syntax. INCOMPATIBILITY.

4875 * The constant "UU" has been renamed to "bottom". The syntax "UU" is

4876 still supported as an input translation.

4878 * Renamed some theorems (the original names are also still available).

4880 expand_fun_below ~> fun_below_iff

4881 below_fun_ext ~> fun_belowI

4882 expand_cfun_eq ~> cfun_eq_iff

4883 ext_cfun ~> cfun_eqI

4884 expand_cfun_below ~> cfun_below_iff

4885 below_cfun_ext ~> cfun_belowI

4886 cont2cont_Rep_CFun ~> cont2cont_APP

4888 * The Abs and Rep functions for various types have changed names.

4889 Related theorem names have also changed to match. INCOMPATIBILITY.

4891 Rep_CFun ~> Rep_cfun

4892 Abs_CFun ~> Abs_cfun

4893 Rep_Sprod ~> Rep_sprod

4894 Abs_Sprod ~> Abs_sprod

4895 Rep_Ssum ~> Rep_ssum

4896 Abs_Ssum ~> Abs_ssum

4898 * Lemmas with names of the form *_defined_iff or *_strict_iff have

4899 been renamed to *_bottom_iff. INCOMPATIBILITY.

4901 * Various changes to bisimulation/coinduction with domain package:

4903 - Definitions of "bisim" constants no longer mention definedness.

4904 - With mutual recursion, "bisim" predicate is now curried.

4905 - With mutual recursion, each type gets a separate coind theorem.

4906 - Variable names in bisim_def and coinduct rules have changed.

4908 INCOMPATIBILITY.

4910 * Case combinators generated by the domain package for type "foo" are

4911 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.

4913 * Several theorems have been renamed to more accurately reflect the

4914 names of constants and types involved. INCOMPATIBILITY.

4916 thelub_const ~> lub_const

4917 lub_const ~> is_lub_const

4918 thelubI ~> lub_eqI

4919 is_lub_lub ~> is_lubD2

4920 lubI ~> is_lub_lub

4921 unique_lub ~> is_lub_unique

4922 is_ub_lub ~> is_lub_rangeD1

4923 lub_bin_chain ~> is_lub_bin_chain

4924 lub_fun ~> is_lub_fun

4925 thelub_fun ~> lub_fun

4926 thelub_cfun ~> lub_cfun

4927 thelub_Pair ~> lub_Pair

4928 lub_cprod ~> is_lub_prod

4929 thelub_cprod ~> lub_prod

4930 minimal_cprod ~> minimal_prod

4931 inst_cprod_pcpo ~> inst_prod_pcpo

4932 UU_I ~> bottomI

4933 compact_UU ~> compact_bottom

4934 deflation_UU ~> deflation_bottom

4935 finite_deflation_UU ~> finite_deflation_bottom

4937 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.

4939 sq_ord_less_eq_trans ~> below_eq_trans

4940 sq_ord_eq_less_trans ~> eq_below_trans

4941 refl_less ~> below_refl

4942 trans_less ~> below_trans

4943 antisym_less ~> below_antisym

4944 antisym_less_inverse ~> po_eq_conv [THEN iffD1]

4945 box_less ~> box_below

4946 rev_trans_less ~> rev_below_trans

4947 not_less2not_eq ~> not_below2not_eq

4948 less_UU_iff ~> below_UU_iff

4949 flat_less_iff ~> flat_below_iff

4950 adm_less ~> adm_below

4951 adm_not_less ~> adm_not_below

4952 adm_compact_not_less ~> adm_compact_not_below

4953 less_fun_def ~> below_fun_def

4954 expand_fun_less ~> fun_below_iff

4955 less_fun_ext ~> fun_belowI

4956 less_discr_def ~> below_discr_def

4957 discr_less_eq ~> discr_below_eq

4958 less_unit_def ~> below_unit_def

4959 less_cprod_def ~> below_prod_def

4960 prod_lessI ~> prod_belowI

4961 Pair_less_iff ~> Pair_below_iff

4962 fst_less_iff ~> fst_below_iff

4963 snd_less_iff ~> snd_below_iff

4964 expand_cfun_less ~> cfun_below_iff

4965 less_cfun_ext ~> cfun_belowI

4966 injection_less ~> injection_below

4967 less_up_def ~> below_up_def

4968 not_Iup_less ~> not_Iup_below

4969 Iup_less ~> Iup_below

4970 up_less ~> up_below

4971 Def_inject_less_eq ~> Def_below_Def

4972 Def_less_is_eq ~> Def_below_iff

4973 spair_less_iff ~> spair_below_iff

4974 less_sprod ~> below_sprod

4975 spair_less ~> spair_below

4976 sfst_less_iff ~> sfst_below_iff

4977 ssnd_less_iff ~> ssnd_below_iff

4978 fix_least_less ~> fix_least_below

4979 dist_less_one ~> dist_below_one

4980 less_ONE ~> below_ONE

4981 ONE_less_iff ~> ONE_below_iff

4982 less_sinlD ~> below_sinlD

4983 less_sinrD ~> below_sinrD

4986 *** FOL and ZF ***

4988 * All constant names are now qualified internally and use proper

4989 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.

4992 *** ML ***

4994 * Antiquotation @{assert} inlines a function bool -> unit that raises

4995 Fail if the argument is false. Due to inlining the source position of

4996 failed assertions is included in the error output.

4998 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML

4999 text is in practice always evaluated with a stable theory checkpoint.

5000 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.

5002 * Antiquotation @{theory A} refers to theory A from the ancestry of

5003 the current context, not any accidental theory loader state as before.

5004 Potential INCOMPATIBILITY, subtle change in semantics.

5006 * Syntax.pretty_priority (default 0) configures the required priority

5007 of pretty-printed output and thus affects insertion of parentheses.

5009 * Syntax.default_root (default "any") configures the inner syntax

5010 category (nonterminal symbol) for parsing of terms.

5012 * Former exception Library.UnequalLengths now coincides with

5013 ListPair.UnequalLengths.

5015 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the

5016 main functionality is provided by structure Simplifier.

5018 * Renamed raw "explode" function to "raw_explode" to emphasize its

5019 meaning. Note that internally to Isabelle, Symbol.explode is used in

5020 almost all situations.

5022 * Discontinued obsolete function sys_error and exception SYS_ERROR.

5023 See implementation manual for further details on exceptions in

5024 Isabelle/ML.

5026 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its

5027 meaning.

5029 * Renamed structure PureThy to Pure_Thy and moved most of its

5030 operations to structure Global_Theory, to emphasize that this is

5031 rarely-used global-only stuff.

5033 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln

5034 instead (or tracing for high-volume output).

5036 * Configuration option show_question_marks only affects regular pretty

5037 printing of types and terms, not raw Term.string_of_vname.

5039 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare

5040 INCOMPATIBILITY, superseded by static antiquotations @{thm} and

5041 @{thms} for most purposes.

5043 * ML structure Unsynchronized is never opened, not even in Isar

5044 interaction mode as before. Old Unsynchronized.set etc. have been

5045 discontinued -- use plain := instead. This should be *rare* anyway,

5046 since modern tools always work via official context data, notably

5047 configuration options.

5049 * Parallel and asynchronous execution requires special care concerning

5050 interrupts. Structure Exn provides some convenience functions that

5051 avoid working directly with raw Interrupt. User code must not absorb

5052 interrupts -- intermediate handling (for cleanup etc.) needs to be

5053 followed by re-raising of the original exception. Another common

5054 source of mistakes are "handle _" patterns, which make the meaning of

5055 the program subject to physical effects of the environment.

5059 New in Isabelle2009-2 (June 2010)

5060 ---------------------------------

5062 *** General ***

5064 * Authentic syntax for *all* logical entities (type classes, type

5065 constructors, term constants): provides simple and robust

5066 correspondence between formal entities and concrete syntax. Within

5067 the parse tree / AST representations, "constants" are decorated by

5068 their category (class, type, const) and spelled out explicitly with

5069 their full internal name.

5071 Substantial INCOMPATIBILITY concerning low-level syntax declarations

5072 and translations (translation rules and translation functions in ML).

5073 Some hints on upgrading:

5075 - Many existing uses of 'syntax' and 'translations' can be replaced

5076 by more modern 'type_notation', 'notation' and 'abbreviation',

5077 which are independent of this issue.

5079 - 'translations' require markup within the AST; the term syntax

5080 provides the following special forms:

5082 CONST c -- produces syntax version of constant c from context

5083 XCONST c -- literally c, checked as constant from context

5084 c -- literally c, if declared by 'syntax'

5086 Plain identifiers are treated as AST variables -- occasionally the

5087 system indicates accidental variables via the error "rhs contains

5088 extra variables".

5090 Type classes and type constructors are marked according to their

5091 concrete syntax. Some old translations rules need to be written

5092 for the "type" category, using type constructor application

5093 instead of pseudo-term application of the default category

5094 "logic".

5096 - 'parse_translation' etc. in ML may use the following

5097 antiquotations:

5099 @{class_syntax c} -- type class c within parse tree / AST

5100 @{term_syntax c} -- type constructor c within parse tree / AST

5101 @{const_syntax c} -- ML version of "CONST c" above

5102 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)

5104 - Literal types within 'typed_print_translations', i.e. those *not*

5105 represented as pseudo-terms are represented verbatim. Use @{class

5106 c} or @{type_name c} here instead of the above syntax

5107 antiquotations.

5109 Note that old non-authentic syntax was based on unqualified base

5110 names, so all of the above "constant" names would coincide. Recall

5111 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to

5112 diagnose syntax problems.

5114 * Type constructors admit general mixfix syntax, not just infix.

5116 * Concrete syntax may be attached to local entities without a proof

5117 body, too. This works via regular mixfix annotations for 'fix',

5118 'def', 'obtain' etc. or via the explicit 'write' command, which is

5119 similar to the 'notation' command in theory specifications.

5121 * Discontinued unnamed infix syntax (legacy feature for many years) --

5122 need to specify constant name and syntax separately. Internal ML

5123 datatype constructors have been renamed from InfixName to Infix etc.

5124 Minor INCOMPATIBILITY.

5126 * Schematic theorem statements need to be explicitly markup as such,

5127 via commands 'schematic_lemma', 'schematic_theorem',

5128 'schematic_corollary'. Thus the relevance of the proof is made

5129 syntactically clear, which impacts performance in a parallel or

5130 asynchronous interactive environment. Minor INCOMPATIBILITY.

5132 * Use of cumulative prems via "!" in some proof methods has been

5133 discontinued (old legacy feature).

5135 * References 'trace_simp' and 'debug_simp' have been replaced by

5136 configuration options stored in the context. Enabling tracing (the

5137 case of debugging is similar) in proofs works via

5139 using [[trace_simp = true]]

5141 Tracing is then active for all invocations of the simplifier in

5142 subsequent goal refinement steps. Tracing may also still be enabled or

5143 disabled via the ProofGeneral settings menu.

5145 * Separate commands 'hide_class', 'hide_type', 'hide_const',

5146 'hide_fact' replace the former 'hide' KIND command. Minor

5147 INCOMPATIBILITY.

5149 * Improved parallelism of proof term normalization: usedir -p2 -q0 is

5150 more efficient than combinations with -q1 or -q2.

5153 *** Pure ***

5155 * Proofterms record type-class reasoning explicitly, using the

5156 "unconstrain" operation internally. This eliminates all sort

5157 constraints from a theorem and proof, introducing explicit

5158 OFCLASS-premises. On the proof term level, this operation is

5159 automatically applied at theorem boundaries, such that closed proofs

5160 are always free of sort constraints. INCOMPATIBILITY for tools that

5161 inspect proof terms.

5163 * Local theory specifications may depend on extra type variables that

5164 are not present in the result type -- arguments TYPE('a) :: 'a itself

5165 are added internally. For example:

5167 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"

5169 * Predicates of locales introduced by classes carry a mandatory

5170 "class" prefix. INCOMPATIBILITY.

5172 * Vacuous class specifications observe default sort. INCOMPATIBILITY.

5174 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use

5175 'class' instead.

5177 * Command 'code_reflect' allows to incorporate generated ML code into

5178 runtime environment; replaces immature code_datatype antiquotation.

5179 INCOMPATIBILITY.

5181 * Code generator: simple concept for abstract datatypes obeying

5182 invariants.

5184 * Code generator: details of internal data cache have no impact on the

5185 user space functionality any longer.

5187 * Methods "unfold_locales" and "intro_locales" ignore non-locale

5188 subgoals. This is more appropriate for interpretations with 'where'.

5189 INCOMPATIBILITY.

5191 * Command 'example_proof' opens an empty proof body. This allows to

5192 experiment with Isar, without producing any persistent result.

5194 * Commands 'type_notation' and 'no_type_notation' declare type syntax

5195 within a local theory context, with explicit checking of the

5196 constructors involved (in contrast to the raw 'syntax' versions).

5198 * Commands 'types' and 'typedecl' now work within a local theory

5199 context -- without introducing dependencies on parameters or

5200 assumptions, which is not possible in Isabelle/Pure.

5202 * Command 'defaultsort' has been renamed to 'default_sort', it works

5203 within a local theory context. Minor INCOMPATIBILITY.

5206 *** HOL ***

5208 * Command 'typedef' now works within a local theory context -- without

5209 introducing dependencies on parameters or assumptions, which is not

5210 possible in Isabelle/Pure/HOL. Note that the logical environment may

5211 contain multiple interpretations of local typedefs (with different

5212 non-emptiness proofs), even in a global theory context.

5214 * New package for quotient types. Commands 'quotient_type' and

5215 'quotient_definition' may be used for defining types and constants by

5216 quotient constructions. An example is the type of integers created by

5217 quotienting pairs of natural numbers:

5219 fun

5220 intrel :: "(nat * nat) => (nat * nat) => bool"

5221 where

5222 "intrel (x, y) (u, v) = (x + v = u + y)"

5224 quotient_type int = "nat * nat" / intrel

5225 by (auto simp add: equivp_def expand_fun_eq)

5227 quotient_definition

5228 "0::int" is "(0::nat, 0::nat)"

5230 The method "lifting" can be used to lift of theorems from the

5231 underlying "raw" type to the quotient type. The example

5232 src/HOL/Quotient_Examples/FSet.thy includes such a quotient

5233 construction and provides a reasoning infrastructure for finite sets.

5235 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid

5236 clash with new theory Quotient in Main HOL.

5238 * Moved the SMT binding into the main HOL session, eliminating

5239 separate HOL-SMT session.

5241 * List membership infix mem operation is only an input abbreviation.

5242 INCOMPATIBILITY.

5244 * Theory Library/Word.thy has been removed. Use library Word/Word.thy

5245 for future developements; former Library/Word.thy is still present in

5246 the AFP entry RSAPPS.

5248 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no

5249 longer shadowed. INCOMPATIBILITY.

5251 * Dropped theorem duplicate comp_arith; use semiring_norm instead.

5252 INCOMPATIBILITY.

5254 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.

5255 INCOMPATIBILITY.

5257 * Dropped normalizing_semiring etc; use the facts in semiring classes

5258 instead. INCOMPATIBILITY.

5260 * Dropped several real-specific versions of lemmas about floor and

5261 ceiling; use the generic lemmas from theory "Archimedean_Field"

5262 instead. INCOMPATIBILITY.

5264 floor_number_of_eq ~> floor_number_of

5265 le_floor_eq_number_of ~> number_of_le_floor

5266 le_floor_eq_zero ~> zero_le_floor

5267 le_floor_eq_one ~> one_le_floor

5268 floor_less_eq_number_of ~> floor_less_number_of

5269 floor_less_eq_zero ~> floor_less_zero

5270 floor_less_eq_one ~> floor_less_one

5271 less_floor_eq_number_of ~> number_of_less_floor

5272 less_floor_eq_zero ~> zero_less_floor

5273 less_floor_eq_one ~> one_less_floor

5274 floor_le_eq_number_of ~> floor_le_number_of

5275 floor_le_eq_zero ~> floor_le_zero

5276 floor_le_eq_one ~> floor_le_one

5277 floor_subtract_number_of ~> floor_diff_number_of

5278 floor_subtract_one ~> floor_diff_one

5279 ceiling_number_of_eq ~> ceiling_number_of

5280 ceiling_le_eq_number_of ~> ceiling_le_number_of

5281 ceiling_le_zero_eq ~> ceiling_le_zero

5282 ceiling_le_eq_one ~> ceiling_le_one

5283 less_ceiling_eq_number_of ~> number_of_less_ceiling

5284 less_ceiling_eq_zero ~> zero_less_ceiling

5285 less_ceiling_eq_one ~> one_less_ceiling

5286 ceiling_less_eq_number_of ~> ceiling_less_number_of

5287 ceiling_less_eq_zero ~> ceiling_less_zero

5288 ceiling_less_eq_one ~> ceiling_less_one

5289 le_ceiling_eq_number_of ~> number_of_le_ceiling

5290 le_ceiling_eq_zero ~> zero_le_ceiling

5291 le_ceiling_eq_one ~> one_le_ceiling

5292 ceiling_subtract_number_of ~> ceiling_diff_number_of

5293 ceiling_subtract_one ~> ceiling_diff_one

5295 * Theory "Finite_Set": various folding_XXX locales facilitate the

5296 application of the various fold combinators on finite sets.

5298 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"

5299 provides abstract red-black tree type which is backed by "RBT_Impl" as

5300 implementation. INCOMPATIBILITY.

5302 * Theory Library/Coinductive_List has been removed -- superseded by

5303 AFP/thys/Coinductive.

5305 * Theory PReal, including the type "preal" and related operations, has

5306 been removed. INCOMPATIBILITY.

5308 * Real: new development using Cauchy Sequences.

5310 * Split off theory "Big_Operators" containing setsum, setprod,

5311 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.

5313 * Theory "Rational" renamed to "Rat", for consistency with "Nat",

5314 "Int" etc. INCOMPATIBILITY.

5316 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.

5318 * New set of rules "ac_simps" provides combined assoc / commute

5319 rewrites for all interpretations of the appropriate generic locales.

5321 * Renamed theory "OrderedGroup" to "Groups" and split theory

5322 "Ring_and_Field" into theories "Rings" and "Fields"; for more

5323 appropriate and more consistent names suitable for name prefixes

5324 within the HOL theories. INCOMPATIBILITY.

5326 * Some generic constants have been put to appropriate theories:

5327 - less_eq, less: Orderings

5328 - zero, one, plus, minus, uminus, times, abs, sgn: Groups

5329 - inverse, divide: Rings

5330 INCOMPATIBILITY.

5332 * More consistent naming of type classes involving orderings (and

5333 lattices):

5335 lower_semilattice ~> semilattice_inf

5336 upper_semilattice ~> semilattice_sup

5338 dense_linear_order ~> dense_linorder

5340 pordered_ab_group_add ~> ordered_ab_group_add

5341 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs

5342 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add

5343 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le

5344 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add

5345 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring

5346 pordered_cancel_semiring ~> ordered_cancel_semiring

5347 pordered_comm_monoid_add ~> ordered_comm_monoid_add

5348 pordered_comm_ring ~> ordered_comm_ring

5349 pordered_comm_semiring ~> ordered_comm_semiring

5350 pordered_ring ~> ordered_ring

5351 pordered_ring_abs ~> ordered_ring_abs

5352 pordered_semiring ~> ordered_semiring

5354 ordered_ab_group_add ~> linordered_ab_group_add

5355 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add

5356 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add

5357 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict

5358 ordered_field ~> linordered_field

5359 ordered_field_no_lb ~> linordered_field_no_lb

5360 ordered_field_no_ub ~> linordered_field_no_ub

5361 ordered_field_dense_linear_order ~> dense_linordered_field

5362 ordered_idom ~> linordered_idom

5363 ordered_ring ~> linordered_ring

5364 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor

5365 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor

5366 ordered_ring_strict ~> linordered_ring_strict

5367 ordered_semidom ~> linordered_semidom

5368 ordered_semiring ~> linordered_semiring

5369 ordered_semiring_1 ~> linordered_semiring_1

5370 ordered_semiring_1_strict ~> linordered_semiring_1_strict

5371 ordered_semiring_strict ~> linordered_semiring_strict

5373 The following slightly odd type classes have been moved to a

5374 separate theory Library/Lattice_Algebras:

5376 lordered_ab_group_add ~> lattice_ab_group_add

5377 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs

5378 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add

5379 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add

5380 lordered_ring ~> lattice_ring

5382 INCOMPATIBILITY.

5384 * Refined field classes:

5385 - classes division_ring_inverse_zero, field_inverse_zero,

5386 linordered_field_inverse_zero include rule inverse 0 = 0 --

5387 subsumes former division_by_zero class;

5388 - numerous lemmas have been ported from field to division_ring.

5389 INCOMPATIBILITY.

5391 * Refined algebra theorem collections:

5392 - dropped theorem group group_simps, use algebra_simps instead;

5393 - dropped theorem group ring_simps, use field_simps instead;

5394 - proper theorem collection field_simps subsumes former theorem

5395 groups field_eq_simps and field_simps;

5396 - dropped lemma eq_minus_self_iff which is a duplicate for

5397 equal_neg_zero.

5398 INCOMPATIBILITY.

5400 * Theory Finite_Set and List: some lemmas have been generalized from

5401 sets to lattices:

5403 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf

5404 fun_left_comm_idem_union ~> fun_left_comm_idem_sup

5405 inter_Inter_fold_inter ~> inf_Inf_fold_inf

5406 union_Union_fold_union ~> sup_Sup_fold_sup

5407 Inter_fold_inter ~> Inf_fold_inf

5408 Union_fold_union ~> Sup_fold_sup

5409 inter_INTER_fold_inter ~> inf_INFI_fold_inf

5410 union_UNION_fold_union ~> sup_SUPR_fold_sup

5411 INTER_fold_inter ~> INFI_fold_inf

5412 UNION_fold_union ~> SUPR_fold_sup

5414 * Theory "Complete_Lattice": lemmas top_def and bot_def have been

5415 replaced by the more convenient lemmas Inf_empty and Sup_empty.

5416 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed

5417 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace

5418 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right

5419 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.

5421 * Reorganized theory Multiset: swapped notation of pointwise and

5422 multiset order:

5424 - pointwise ordering is instance of class order with standard syntax

5425 <= and <;

5426 - multiset ordering has syntax <=# and <#; partial order properties

5427 are provided by means of interpretation with prefix

5428 multiset_order;

5429 - less duplication, less historical organization of sections,

5430 conversion from associations lists to multisets, rudimentary code

5431 generation;

5432 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,

5433 if needed.

5435 Renamed:

5437 multiset_eq_conv_count_eq ~> multiset_ext_iff

5438 multi_count_ext ~> multiset_ext

5439 diff_union_inverse2 ~> diff_union_cancelR

5441 INCOMPATIBILITY.

5443 * Theory Permutation: replaced local "remove" by List.remove1.

5445 * Code generation: ML and OCaml code is decorated with signatures.

5447 * Theory List: added transpose.

5449 * Library/Nat_Bijection.thy is a collection of bijective functions

5450 between nat and other types, which supersedes the older libraries

5451 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.

5453 Constants:

5454 Nat_Int_Bij.nat2_to_nat ~> prod_encode

5455 Nat_Int_Bij.nat_to_nat2 ~> prod_decode

5456 Nat_Int_Bij.int_to_nat_bij ~> int_encode

5457 Nat_Int_Bij.nat_to_int_bij ~> int_decode

5458 Countable.pair_encode ~> prod_encode

5459 NatIso.prod2nat ~> prod_encode

5460 NatIso.nat2prod ~> prod_decode

5461 NatIso.sum2nat ~> sum_encode

5462 NatIso.nat2sum ~> sum_decode

5463 NatIso.list2nat ~> list_encode

5464 NatIso.nat2list ~> list_decode

5465 NatIso.set2nat ~> set_encode

5466 NatIso.nat2set ~> set_decode

5468 Lemmas:

5469 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode

5470 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode

5471 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode

5472 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode

5473 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode

5474 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse

5475 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse

5476 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode

5477 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode

5478 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode

5479 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode

5480 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode

5481 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode

5483 * Sledgehammer:

5484 - Renamed ATP commands:

5485 atp_info ~> sledgehammer running_atps

5486 atp_kill ~> sledgehammer kill_atps

5487 atp_messages ~> sledgehammer messages

5488 atp_minimize ~> sledgehammer minimize

5489 print_atps ~> sledgehammer available_atps

5490 INCOMPATIBILITY.

5491 - Added user's manual ("isabelle doc sledgehammer").

5492 - Added option syntax and "sledgehammer_params" to customize

5493 Sledgehammer's behavior. See the manual for details.

5494 - Modified the Isar proof reconstruction code so that it produces

5495 direct proofs rather than proofs by contradiction. (This feature

5496 is still experimental.)

5497 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in

5498 full-typed mode.

5499 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.

5501 * Nitpick:

5502 - Added and implemented "binary_ints" and "bits" options.

5503 - Added "std" option and implemented support for nonstandard models.

5504 - Added and implemented "finitize" option to improve the precision

5505 of infinite datatypes based on a monotonicity analysis.

5506 - Added support for quotient types.

5507 - Added support for "specification" and "ax_specification"

5508 constructs.

5509 - Added support for local definitions (for "function" and

5510 "termination" proofs).

5511 - Added support for term postprocessors.

5512 - Optimized "Multiset.multiset" and "FinFun.finfun".

5513 - Improved efficiency of "destroy_constrs" optimization.

5514 - Fixed soundness bugs related to "destroy_constrs" optimization and

5515 record getters.

5516 - Fixed soundness bug related to higher-order constructors.

5517 - Fixed soundness bug when "full_descrs" is enabled.

5518 - Improved precision of set constructs.

5519 - Added "atoms" option.

5520 - Added cache to speed up repeated Kodkod invocations on the same

5521 problems.

5522 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and

5523 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and

5524 "SAT4J_Light". INCOMPATIBILITY.

5525 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",

5526 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.

5527 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.

5529 * Method "induct" now takes instantiations of the form t, where t is not

5530 a variable, as a shorthand for "x == t", where x is a fresh variable.

5531 If this is not intended, t has to be enclosed in parentheses.

5532 By default, the equalities generated by definitional instantiations

5533 are pre-simplified, which may cause parameters of inductive cases

5534 to disappear, or may even delete some of the inductive cases.

5535 Use "induct (no_simp)" instead of "induct" to restore the old

5536 behaviour. The (no_simp) option is also understood by the "cases"

5537 and "nominal_induct" methods, which now perform pre-simplification, too.

5538 INCOMPATIBILITY.

5541 *** HOLCF ***

5543 * Variable names in lemmas generated by the domain package have

5544 changed; the naming scheme is now consistent with the HOL datatype

5545 package. Some proof scripts may be affected, INCOMPATIBILITY.

5547 * The domain package no longer defines the function "foo_copy" for

5548 recursive domain "foo". The reach lemma is now stated directly in

5549 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must

5550 be reformulated in terms of "foo_take", INCOMPATIBILITY.

5552 * Most definedness lemmas generated by the domain package (previously

5553 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form

5554 like "foo$x = UU <-> x = UU", which works better as a simp rule.

5555 Proofs that used definedness lemmas as intro rules may break,

5556 potential INCOMPATIBILITY.

5558 * Induction and casedist rules generated by the domain package now

5559 declare proper case_names (one called "bottom", and one named for each

5560 constructor). INCOMPATIBILITY.

5562 * For mutually-recursive domains, separate "reach" and "take_lemma"

5563 rules are generated for each domain, INCOMPATIBILITY.

5565 foo_bar.reach ~> foo.reach bar.reach

5566 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma

5568 * Some lemmas generated by the domain package have been renamed for

5569 consistency with the datatype package, INCOMPATIBILITY.

5571 foo.ind ~> foo.induct

5572 foo.finite_ind ~> foo.finite_induct

5573 foo.coind ~> foo.coinduct

5574 foo.casedist ~> foo.exhaust

5575 foo.exhaust ~> foo.nchotomy

5577 * For consistency with other definition packages, the fixrec package

5578 now generates qualified theorem names, INCOMPATIBILITY.

5580 foo_simps ~> foo.simps

5581 foo_unfold ~> foo.unfold

5582 foo_induct ~> foo.induct

5584 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"

5585 method and internal fixrec proofs now use the default simpset instead.

5586 INCOMPATIBILITY.

5588 * The "contlub" predicate has been removed. Proof scripts should use

5589 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.

5591 * The "admw" predicate has been removed, INCOMPATIBILITY.

5593 * The constants cpair, cfst, and csnd have been removed in favor of

5594 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.

5597 *** ML ***

5599 * Antiquotations for basic formal entities:

5601 @{class NAME} -- type class

5602 @{class_syntax NAME} -- syntax representation of the above

5604 @{type_name NAME} -- logical type

5605 @{type_abbrev NAME} -- type abbreviation

5606 @{nonterminal NAME} -- type of concrete syntactic category

5607 @{type_syntax NAME} -- syntax representation of any of the above

5609 @{const_name NAME} -- logical constant (INCOMPATIBILITY)

5610 @{const_abbrev NAME} -- abbreviated constant

5611 @{const_syntax NAME} -- syntax representation of any of the above

5613 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw

5614 syntax constant (cf. 'syntax' command).

5616 * Antiquotation @{make_string} inlines a function to print arbitrary

5617 values similar to the ML toplevel. The result is compiler dependent

5618 and may fall back on "?" in certain situations.

5620 * Diagnostic commands 'ML_val' and 'ML_command' may refer to

5621 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure

5622 Isar.state() and Isar.goal(), which belong to the old TTY loop and do

5623 not work with the asynchronous Isar document model.

5625 * Configuration options now admit dynamic default values, depending on

5626 the context or even global references.

5628 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It

5629 uses an efficient external library if available (for Poly/ML).

5631 * Renamed some important ML structures, while keeping the old names

5632 for some time as aliases within the structure Legacy:

5634 OuterKeyword ~> Keyword

5635 OuterLex ~> Token

5636 OuterParse ~> Parse

5637 OuterSyntax ~> Outer_Syntax

5638 PrintMode ~> Print_Mode

5639 SpecParse ~> Parse_Spec

5640 ThyInfo ~> Thy_Info

5641 ThyLoad ~> Thy_Load

5642 ThyOutput ~> Thy_Output

5643 TypeInfer ~> Type_Infer

5645 Note that "open Legacy" simplifies porting of sources, but forgetting

5646 to remove it again will complicate porting again in the future.

5648 * Most operations that refer to a global context are named

5649 accordingly, e.g. Simplifier.global_context or

5650 ProofContext.init_global. There are some situations where a global

5651 context actually works, but under normal circumstances one needs to

5652 pass the proper local context through the code!

5654 * Discontinued old TheoryDataFun with its copy/init operation -- data

5655 needs to be pure. Functor Theory_Data_PP retains the traditional

5656 Pretty.pp argument to merge, which is absent in the standard

5657 Theory_Data version.

5659 * Sorts.certify_sort and derived "cert" operations for types and terms

5660 no longer minimize sorts. Thus certification at the boundary of the

5661 inference kernel becomes invariant under addition of class relations,

5662 which is an important monotonicity principle. Sorts are now minimized

5663 in the syntax layer only, at the boundary between the end-user and the

5664 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort

5665 explicitly in rare situations.

5667 * Renamed old-style Drule.standard to Drule.export_without_context, to

5668 emphasize that this is in no way a standard operation.

5669 INCOMPATIBILITY.

5671 * Subgoal.FOCUS (and variants): resulting goal state is normalized as

5672 usual for resolution. Rare INCOMPATIBILITY.

5674 * Renamed varify/unvarify operations to varify_global/unvarify_global

5675 to emphasize that these only work in a global situation (which is

5676 quite rare).

5678 * Curried take and drop in library.ML; negative length is interpreted

5679 as infinity (as in chop). Subtle INCOMPATIBILITY.

5681 * Proof terms: type substitutions on proof constants now use canonical

5682 order of type variables. INCOMPATIBILITY for tools working with proof

5683 terms.

5685 * Raw axioms/defs may no longer carry sort constraints, and raw defs

5686 may no longer carry premises. User-level specifications are

5687 transformed accordingly by Thm.add_axiom/add_def.

5690 *** System ***

5692 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;

5693 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that

5694 proof terms are enabled unconditionally in the new HOL-Proofs image.

5696 * Discontinued old ISABELLE and ISATOOL environment settings (legacy

5697 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,

5698 respectively.

5700 * Old lib/scripts/polyml-platform is superseded by the

5701 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit

5702 variant, even on a 64 bit machine. The following example setting

5703 prefers 64 bit if available:

5705 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"

5707 * The preliminary Isabelle/jEdit application demonstrates the emerging

5708 Isabelle/Scala layer for advanced prover interaction and integration.

5709 See src/Tools/jEdit or "isabelle jedit" provided by the properly built

5710 component.

5712 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono

5713 and Bluesky TeX fonts. It provides the usual Isabelle symbols,

5714 similar to the default assignment of the document preparation system

5715 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System

5716 provides some operations for direct access to the font without asking

5717 the user for manual installation.

5721 New in Isabelle2009-1 (December 2009)

5722 -------------------------------------

5724 *** General ***

5726 * Discontinued old form of "escaped symbols" such as \\<forall>. Only

5727 one backslash should be used, even in ML sources.

5730 *** Pure ***

5732 * Locale interpretation propagates mixins along the locale hierarchy.

5733 The currently only available mixins are the equations used to map

5734 local definitions to terms of the target domain of an interpretation.

5736 * Reactivated diagnostic command 'print_interps'. Use "print_interps

5737 loc" to print all interpretations of locale "loc" in the theory.

5738 Interpretations in proofs are not shown.

5740 * Thoroughly revised locales tutorial. New section on conditional

5741 interpretation.

5743 * On instantiation of classes, remaining undefined class parameters

5744 are formally declared. INCOMPATIBILITY.

5747 *** Document preparation ***

5749 * New generalized style concept for printing terms: @{foo (style) ...}

5750 instead of @{foo_style style ...} (old form is still retained for

5751 backward compatibility). Styles can be also applied for

5752 antiquotations prop, term_type and typeof.

5755 *** HOL ***

5757 * New proof method "smt" for a combination of first-order logic with

5758 equality, linear and nonlinear (natural/integer/real) arithmetic, and

5759 fixed-size bitvectors; there is also basic support for higher-order

5760 features (esp. lambda abstractions). It is an incomplete decision

5761 procedure based on external SMT solvers using the oracle mechanism;

5762 for the SMT solver Z3, this method is proof-producing. Certificates

5763 are provided to avoid calling the external solvers solely for

5764 re-checking proofs. Due to a remote SMT service there is no need for

5765 installing SMT solvers locally. See src/HOL/SMT.

5767 * New commands to load and prove verification conditions generated by

5768 the Boogie program verifier or derived systems (e.g. the Verifying C

5769 Compiler (VCC) or Spec#). See src/HOL/Boogie.

5771 * New counterexample generator tool 'nitpick' based on the Kodkod

5772 relational model finder. See src/HOL/Tools/Nitpick and

5773 src/HOL/Nitpick_Examples.

5775 * New commands 'code_pred' and 'values' to invoke the predicate

5776 compiler and to enumerate values of inductive predicates.

5778 * A tabled implementation of the reflexive transitive closure.

5780 * New implementation of quickcheck uses generic code generator;

5781 default generators are provided for all suitable HOL types, records

5782 and datatypes. Old quickcheck can be re-activated importing theory

5783 Library/SML_Quickcheck.

5785 * New testing tool Mirabelle for automated proof tools. Applies

5786 several tools and tactics like sledgehammer, metis, or quickcheck, to

5787 every proof step in a theory. To be used in batch mode via the

5788 "mirabelle" utility.

5790 * New proof method "sos" (sum of squares) for nonlinear real

5791 arithmetic (originally due to John Harison). It requires theory

5792 Library/Sum_Of_Squares. It is not a complete decision procedure but

5793 works well in practice on quantifier-free real arithmetic with +, -,

5794 *, ^, =, <= and <, i.e. boolean combinations of equalities and

5795 inequalities between polynomials. It makes use of external

5796 semidefinite programming solvers. Method "sos" generates a

5797 certificate that can be pasted into the proof thus avoiding the need

5798 to call an external tool every time the proof is checked. See

5799 src/HOL/Library/Sum_Of_Squares.

5801 * New method "linarith" invokes existing linear arithmetic decision

5802 procedure only.

5804 * New command 'atp_minimal' reduces result produced by Sledgehammer.

5806 * New Sledgehammer option "Full Types" in Proof General settings menu.

5807 Causes full type information to be output to the ATPs. This slows

5808 ATPs down considerably but eliminates a source of unsound "proofs"

5809 that fail later.

5811 * New method "metisFT": A version of metis that uses full type

5812 information in order to avoid failures of proof reconstruction.

5814 * New evaluator "approximate" approximates an real valued term using

5815 the same method as the approximation method.

5817 * Method "approximate" now supports arithmetic expressions as

5818 boundaries of intervals and implements interval splitting and Taylor

5819 series expansion.

5821 * ML antiquotation @{code_datatype} inserts definition of a datatype

5822 generated by the code generator; e.g. see src/HOL/Predicate.thy.

5824 * New theory SupInf of the supremum and infimum operators for sets of

5825 reals.

5827 * New theory Probability, which contains a development of measure

5828 theory, eventually leading to Lebesgue integration and probability.

5830 * Extended Multivariate Analysis to include derivation and Brouwer's

5831 fixpoint theorem.

5833 * Reorganization of number theory, INCOMPATIBILITY:

5834 - new number theory development for nat and int, in theories Divides

5835 and GCD as well as in new session Number_Theory

5836 - some constants and facts now suffixed with _nat and _int

5837 accordingly

5838 - former session NumberTheory now named Old_Number_Theory, including

5839 theories Legacy_GCD and Primes (prefer Number_Theory if possible)

5840 - moved theory Pocklington from src/HOL/Library to

5841 src/HOL/Old_Number_Theory

5843 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and

5844 lcm of finite and infinite sets. It is shown that they form a complete

5845 lattice.

5847 * Class semiring_div requires superclass no_zero_divisors and proof of

5848 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,

5849 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been

5850 generalized to class semiring_div, subsuming former theorems

5851 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and

5852 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.

5853 INCOMPATIBILITY.

5855 * Refinements to lattice classes and sets:

5856 - less default intro/elim rules in locale variant, more default

5857 intro/elim rules in class variant: more uniformity

5858 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with

5859 le_inf_iff

5860 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and

5861 sup_aci)

5862 - renamed ACI to inf_sup_aci

5863 - new class "boolean_algebra"

5864 - class "complete_lattice" moved to separate theory

5865 "Complete_Lattice"; corresponding constants (and abbreviations)

5866 renamed and with authentic syntax:

5867 Set.Inf ~> Complete_Lattice.Inf

5868 Set.Sup ~> Complete_Lattice.Sup

5869 Set.INFI ~> Complete_Lattice.INFI

5870 Set.SUPR ~> Complete_Lattice.SUPR

5871 Set.Inter ~> Complete_Lattice.Inter

5872 Set.Union ~> Complete_Lattice.Union

5873 Set.INTER ~> Complete_Lattice.INTER

5874 Set.UNION ~> Complete_Lattice.UNION

5875 - authentic syntax for

5876 Set.Pow

5877 Set.image

5878 - mere abbreviations:

5879 Set.empty (for bot)

5880 Set.UNIV (for top)

5881 Set.inter (for inf, formerly Set.Int)

5882 Set.union (for sup, formerly Set.Un)

5883 Complete_Lattice.Inter (for Inf)

5884 Complete_Lattice.Union (for Sup)

5885 Complete_Lattice.INTER (for INFI)

5886 Complete_Lattice.UNION (for SUPR)

5887 - object-logic definitions as far as appropriate

5889 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or

5890 Un_subset_iff are explicitly deleted as default simp rules; then also

5891 their lattice counterparts le_inf_iff and le_sup_iff have to be

5892 deleted to achieve the desired effect.

5894 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp

5895 rules by default any longer; the same applies to min_max.inf_absorb1

5896 etc. INCOMPATIBILITY.

5898 * Rules sup_Int_eq and sup_Un_eq are no longer declared as

5899 pred_set_conv by default. INCOMPATIBILITY.

5901 * Power operations on relations and functions are now one dedicated

5902 constant "compow" with infix syntax "^^". Power operation on

5903 multiplicative monoids retains syntax "^" and is now defined generic

5904 in class power. INCOMPATIBILITY.

5906 * Relation composition "R O S" now has a more standard argument order:

5907 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,

5908 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally

5909 break, since the O_assoc rule was not rewritten like this. Fix using

5910 O_assoc[symmetric]. The same applies to the curried version "R OO S".

5912 * Function "Inv" is renamed to "inv_into" and function "inv" is now an

5913 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.

5914 INCOMPATIBILITY.

5916 * Most rules produced by inductive and datatype package have mandatory

5917 prefixes. INCOMPATIBILITY.

5919 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by

5920 the attribute of the same name. Each of the theorems in the list

5921 DERIV_intros assumes composition with an additional function and

5922 matches a variable to the derivative, which has to be solved by the

5923 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative

5924 of most elementary terms. Former Maclauren.DERIV_tac and

5925 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).

5926 INCOMPATIBILITY.

5928 * Code generator attributes follow the usual underscore convention:

5929 code_unfold replaces code unfold

5930 code_post replaces code post

5931 etc.

5932 INCOMPATIBILITY.

5934 * Renamed methods:

5935 sizechange -> size_change

5936 induct_scheme -> induction_schema

5937 INCOMPATIBILITY.

5939 * Discontinued abbreviation "arbitrary" of constant "undefined".

5940 INCOMPATIBILITY, use "undefined" directly.

5942 * Renamed theorems:

5943 Suc_eq_add_numeral_1 -> Suc_eq_plus1

5944 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left

5945 Suc_plus1 -> Suc_eq_plus1

5946 *anti_sym -> *antisym*

5947 vector_less_eq_def -> vector_le_def

5948 INCOMPATIBILITY.

5950 * Added theorem List.map_map as [simp]. Removed List.map_compose.

5951 INCOMPATIBILITY.

5953 * Removed predicate "M hassize n" (<--> card M = n & finite M).

5954 INCOMPATIBILITY.

5957 *** HOLCF ***

5959 * Theory Representable defines a class "rep" of domains that are

5960 representable (via an ep-pair) in the universal domain type "udom".

5961 Instances are provided for all type constructors defined in HOLCF.

5963 * The 'new_domain' command is a purely definitional version of the

5964 domain package, for representable domains. Syntax is identical to the

5965 old domain package. The 'new_domain' package also supports indirect

5966 recursion using previously-defined type constructors. See

5967 src/HOLCF/ex/New_Domain.thy for examples.

5969 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant

5970 on the left-hand side of an equation, and then performs

5971 simplification. Rewriting is done using rules declared with the

5972 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a

5973 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.

5975 * The pattern-match compiler in 'fixrec' can now handle constructors

5976 with HOL function types. Pattern-match combinators for the Pair

5977 constructor are pre-configured.

5979 * The 'fixrec' package now produces better fixed-point induction rules

5980 for mutually-recursive definitions: Induction rules have conclusions

5981 of the form "P foo bar" instead of "P <foo, bar>".

5983 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has

5984 been renamed to "below". The name "below" now replaces "less" in many

5985 theorem names. (Legacy theorem names using "less" are still supported

5986 as well.)

5988 * The 'fixrec' package now supports "bottom patterns". Bottom

5989 patterns can be used to generate strictness rules, or to make

5990 functions more strict (much like the bang-patterns supported by the

5991 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for

5992 examples.

5995 *** ML ***

5997 * Support for Poly/ML 5.3.0, with improved reporting of compiler

5998 errors and run-time exceptions, including detailed source positions.

6000 * Structure Name_Space (formerly NameSpace) now manages uniquely

6001 identified entries, with some additional information such as source

6002 position, logical grouping etc.

6004 * Theory and context data is now introduced by the simplified and

6005 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs

6006 to be pure, but the old TheoryDataFun for mutable data (with explicit

6007 copy operation) is still available for some time.

6009 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)

6010 provides a high-level programming interface to synchronized state

6011 variables with atomic update. This works via pure function

6012 application within a critical section -- its runtime should be as

6013 short as possible; beware of deadlocks if critical code is nested,

6014 either directly or indirectly via other synchronized variables!

6016 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)

6017 wraps raw ML references, explicitly indicating their non-thread-safe

6018 behaviour. The Isar toplevel keeps this structure open, to

6019 accommodate Proof General as well as quick and dirty interactive

6020 experiments with references.

6022 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for

6023 parallel tactical reasoning.

6025 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS

6026 are similar to SUBPROOF, but are slightly more flexible: only the

6027 specified parts of the subgoal are imported into the context, and the

6028 body tactic may introduce new subgoals and schematic variables.

6030 * Old tactical METAHYPS, which does not observe the proof context, has

6031 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF

6032 or Subgoal.FOCUS etc.

6034 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since

6035 functors have their own ML name space there is no point to mark them

6036 separately.) Minor INCOMPATIBILITY.

6038 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.

6040 * Renamed several structures FooBar to Foo_Bar. Occasional,

6041 INCOMPATIBILITY.

6043 * Operations of structure Skip_Proof no longer require quick_and_dirty

6044 mode, which avoids critical setmp.

6046 * Eliminated old Attrib.add_attributes, Method.add_methods and related

6047 combinators for "args". INCOMPATIBILITY, need to use simplified

6048 Attrib/Method.setup introduced in Isabelle2009.

6050 * Proper context for simpset_of, claset_of, clasimpset_of. May fall

6051 back on global_simpset_of, global_claset_of, global_clasimpset_of as

6052 last resort. INCOMPATIBILITY.

6054 * Display.pretty_thm now requires a proper context (cf. former

6055 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global

6056 or even Display.pretty_thm_without_context as last resort.

6057 INCOMPATIBILITY.

6059 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use

6060 Syntax.pretty_typ/term directly, preferably with proper context

6061 instead of global theory.

6064 *** System ***

6066 * Further fine tuning of parallel proof checking, scales up to 8 cores

6067 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and

6068 usedir option -q.

6070 * Support for additional "Isabelle components" via etc/components, see

6071 also the system manual.

6073 * The isabelle makeall tool now operates on all components with

6074 IsaMakefile, not just hardwired "logics".

6076 * Removed "compress" option from isabelle-process and isabelle usedir;

6077 this is always enabled.

6079 * Discontinued support for Poly/ML 4.x versions.

6081 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'

6082 on a given logic image. This requires the lighttpd webserver and is

6083 currently supported on Linux only.

6087 New in Isabelle2009 (April 2009)

6088 --------------------------------

6090 *** General ***

6092 * Simplified main Isabelle executables, with less surprises on

6093 case-insensitive file-systems (such as Mac OS).

6095 - The main Isabelle tool wrapper is now called "isabelle" instead of

6096 "isatool."

6098 - The former "isabelle" alias for "isabelle-process" has been

6099 removed (should rarely occur to regular users).

6101 - The former "isabelle-interface" and its alias "Isabelle" have been

6102 removed (interfaces are now regular Isabelle tools).

6104 Within scripts and make files, the Isabelle environment variables

6105 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,

6106 respectively. (The latter are still available as legacy feature.)

6108 The old isabelle-interface wrapper could react in confusing ways if

6109 the interface was uninstalled or changed otherwise. Individual

6110 interface tool configuration is now more explicit, see also the

6111 Isabelle system manual. In particular, Proof General is now available

6112 via "isabelle emacs".

6114 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to

6115 purge installed copies of Isabelle executables and re-run "isabelle

6116 install -p ...", or use symlinks.

6118 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the

6119 old ~/isabelle, which was slightly non-standard and apt to cause

6120 surprises on case-insensitive file-systems (such as Mac OS).

6122 INCOMPATIBILITY, need to move existing ~/isabelle/etc,

6123 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special

6124 care is required when using older releases of Isabelle. Note that

6125 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any

6126 Isabelle distribution, in order to use the new ~/.isabelle uniformly.

6128 * Proofs of fully specified statements are run in parallel on

6129 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on

6130 a regular 4-core machine, if the initial heap space is made reasonably

6131 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)

6133 * The main reference manuals ("isar-ref", "implementation", and

6134 "system") have been updated and extended. Formally checked references

6135 as hyperlinks are now available uniformly.

6138 *** Pure ***

6140 * Complete re-implementation of locales. INCOMPATIBILITY in several

6141 respects. The most important changes are listed below. See the

6142 Tutorial on Locales ("locales" manual) for details.

6144 - In locale expressions, instantiation replaces renaming. Parameters

6145 must be declared in a for clause. To aid compatibility with previous

6146 parameter inheritance, in locale declarations, parameters that are not

6147 'touched' (instantiation position "_" or omitted) are implicitly added

6148 with their syntax at the beginning of the for clause.

6150 - Syntax from abbreviations and definitions in locales is available in

6151 locale expressions and context elements. The latter is particularly

6152 useful in locale declarations.

6154 - More flexible mechanisms to qualify names generated by locale

6155 expressions. Qualifiers (prefixes) may be specified in locale

6156 expressions, and can be marked as mandatory (syntax: "name!:") or

6157 optional (syntax "name?:"). The default depends for plain "name:"

6158 depends on the situation where a locale expression is used: in

6159 commands 'locale' and 'sublocale' prefixes are optional, in

6160 'interpretation' and 'interpret' prefixes are mandatory. The old

6161 implicit qualifiers derived from the parameter names of a locale are

6162 no longer generated.

6164 - Command "sublocale l < e" replaces "interpretation l < e". The

6165 instantiation clause in "interpretation" and "interpret" (square

6166 brackets) is no longer available. Use locale expressions.

6168 - When converting proof scripts, mandatory qualifiers in

6169 'interpretation' and 'interpret' should be retained by default, even

6170 if this is an INCOMPATIBILITY compared to former behavior. In the

6171 worst case, use the "name?:" form for non-mandatory ones. Qualifiers

6172 in locale expressions range over a single locale instance only.

6174 - Dropped locale element "includes". This is a major INCOMPATIBILITY.

6175 In existing theorem specifications replace the includes element by the

6176 respective context elements of the included locale, omitting those

6177 that are already present in the theorem specification. Multiple

6178 assume elements of a locale should be replaced by a single one

6179 involving the locale predicate. In the proof body, declarations (most

6180 notably theorems) may be regained by interpreting the respective

6181 locales in the proof context as required (command "interpret").

6183 If using "includes" in replacement of a target solely because the

6184 parameter types in the theorem are not as general as in the target,

6185 consider declaring a new locale with additional type constraints on

6186 the parameters (context element "constrains").

6188 - Discontinued "locale (open)". INCOMPATIBILITY.

6190 - Locale interpretation commands no longer attempt to simplify goal.

6191 INCOMPATIBILITY: in rare situations the generated goal differs. Use

6192 methods intro_locales and unfold_locales to clarify.

6194 - Locale interpretation commands no longer accept interpretation

6195 attributes. INCOMPATIBILITY.

6197 * Class declaration: so-called "base sort" must not be given in import

6198 list any longer, but is inferred from the specification. Particularly

6199 in HOL, write

6201 class foo = ...

6203 instead of

6205 class foo = type + ...

6207 * Class target: global versions of theorems stemming do not carry a

6208 parameter prefix any longer. INCOMPATIBILITY.

6210 * Class 'instance' command no longer accepts attached definitions.

6211 INCOMPATIBILITY, use proper 'instantiation' target instead.

6213 * Recovered hiding of consts, which was accidentally broken in

6214 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really

6215 makes c inaccessible; consider using ``hide (open) const c'' instead.

6217 * Slightly more coherent Pure syntax, with updated documentation in

6218 isar-ref manual. Removed locales meta_term_syntax and

6219 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,

6220 INCOMPATIBILITY in rare situations. Note that &&& should not be used

6221 directly in regular applications.

6223 * There is a new syntactic category "float_const" for signed decimal

6224 fractions (e.g. 123.45 or -123.45).

6226 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML

6227 interface with 'setup' command instead.

6229 * Command 'local_setup' is similar to 'setup', but operates on a local

6230 theory context.

6232 * The 'axiomatization' command now only works within a global theory

6233 context. INCOMPATIBILITY.

6235 * Goal-directed proof now enforces strict proof irrelevance wrt. sort

6236 hypotheses. Sorts required in the course of reasoning need to be

6237 covered by the constraints in the initial statement, completed by the

6238 type instance information of the background theory. Non-trivial sort

6239 hypotheses, which rarely occur in practice, may be specified via

6240 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:

6242 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...

6244 The result contains an implicit sort hypotheses as before --

6245 SORT_CONSTRAINT premises are eliminated as part of the canonical rule

6246 normalization.

6248 * Generalized Isar history, with support for linear undo, direct state

6249 addressing etc.

6251 * Changed defaults for unify configuration options:

6253 unify_trace_bound = 50 (formerly 25)

6254 unify_search_bound = 60 (formerly 30)

6256 * Different bookkeeping for code equations (INCOMPATIBILITY):

6258 a) On theory merge, the last set of code equations for a particular

6259 constant is taken (in accordance with the policy applied by other

6260 parts of the code generator framework).

6262 b) Code equations stemming from explicit declarations (e.g. code

6263 attribute) gain priority over default code equations stemming

6264 from definition, primrec, fun etc.

6266 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.

6268 * Unified theorem tables for both code generators. Thus [code

6269 func] has disappeared and only [code] remains. INCOMPATIBILITY.