NEWS
author wenzelm
Wed Jul 01 10:53:14 2015 +0200 (2015-07-01)
changeset 60622 57b5293bceac
parent 60618 4c79543cc376
child 60631 441fdbfbb2d3
permissions -rw-r--r--
tuned;
     1 Isabelle NEWS -- history of user-relevant changes
     2 =================================================
     3 
     4 (Note: Isabelle/jEdit shows a tree-view of this file in Sidekick.)
     5 
     6 
     7 New in this Isabelle version
     8 ----------------------------
     9 
    10 *** Prover IDE -- Isabelle/Scala/jEdit ***
    11 
    12 * Improved scheduling for urgent print tasks (e.g. command state output,
    13 interactive queries) wrt. long-running background tasks.
    14 
    15 
    16 *** Isar ***
    17 
    18 * Command 'obtain' binds term abbreviations (via 'is' patterns) in the
    19 proof body as well, abstracted over relevant parameters.
    20 
    21 * Improved type-inference for theorem statement 'obtains': separate
    22 parameter scope for of each clause.
    23 
    24 * Term abbreviations via 'is' patterns also work for schematic
    25 statements: result is abstracted over unknowns.
    26 
    27 * Local goals ('have', 'show', 'hence', 'thus') allow structured
    28 statements like fixes/assumes/shows in theorem specifications, but the
    29 notation is postfix with keywords 'if' (or 'when') and 'for'. For
    30 example:
    31 
    32   have result: "C x y"
    33     if "A x" and "B y"
    34     for x :: 'a and y :: 'a
    35     <proof>
    36 
    37 The local assumptions are bound to the name "that". The result is
    38 exported from context of the statement as usual. The above roughly
    39 corresponds to a raw proof block like this:
    40 
    41   {
    42     fix x :: 'a and y :: 'a
    43     assume that: "A x" "B y"
    44     have "C x y" <proof>
    45   }
    46   note result = this
    47 
    48 The keyword 'when' may be used instead of 'if', to indicate 'presume'
    49 instead of 'assume' above.
    50 
    51 * The meaning of 'show' with Pure rule statements has changed: premises
    52 are treated in the sense of 'assume', instead of 'presume'. This means,
    53 a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as follows:
    54 
    55   show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
    56 
    57 or:
    58 
    59   show "C x" if "A x" "B x" for x
    60 
    61 Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:
    62 
    63   show "C x" when "A x" "B x" for x
    64 
    65 * New command 'supply' supports fact definitions during goal refinement
    66 ('apply' scripts).
    67 
    68 * New command 'consider' states rules for generalized elimination and
    69 case splitting. This is like a toplevel statement "theorem obtains" used
    70 within a proof body; or like a multi-branch 'obtain' without activation
    71 of the local context elements yet.
    72 
    73 * Proof method "cases" allows to specify the rule as first entry of
    74 chained facts.  This is particularly useful with 'consider':
    75 
    76   consider (a) A | (b) B | (c) C <proof>
    77   then have something
    78   proof cases
    79     case a
    80     then show ?thesis <proof>
    81   next
    82     case b
    83     then show ?thesis <proof>
    84   next
    85     case c
    86     then show ?thesis <proof>
    87   qed
    88 
    89 * Command 'case' allows fact name and attribute specification like this:
    90 
    91   case a: (c xs)
    92   case a [attributes]: (c xs)
    93 
    94 Facts that are introduced by invoking the case context are uniformly
    95 qualified by "a"; the same name is used for the cumulative fact. The old
    96 form "case (c xs) [attributes]" is no longer supported. Rare
    97 INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,
    98 and always put attributes in front.
    99 
   100 * The standard proof method of commands 'proof' and '..' is now called
   101 "standard" to make semantically clear what it is; the old name "default"
   102 is still available as legacy for some time. Documentation now explains
   103 '..' more accurately as "by standard" instead of "by rule".
   104 
   105 * Proof method "goals" turns the current subgoals into cases within the
   106 context; the conclusion is bound to variable ?case in each case.
   107 For example:
   108 
   109 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
   110   and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
   111 proof goals
   112   case (1 x)
   113   then show ?case using \<open>A x\<close> \<open>B x\<close> sorry
   114 next
   115   case (2 y z)
   116   then show ?case using \<open>U y\<close> \<open>V z\<close> sorry
   117 qed
   118 
   119 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
   120   and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
   121 proof goals
   122   case prems: 1
   123   then show ?case using prems sorry
   124 next
   125   case prems: 2
   126   then show ?case using prems sorry
   127 qed
   128 
   129 * The undocumented feature of implicit cases goal1, goal2, goal3, etc.
   130 is marked as legacy, and will be removed eventually. The proof method
   131 "goals" achieves a similar effect within regular Isar; often it can be
   132 done more adequately by other means (e.g. 'consider').
   133 
   134 * Nesting of Isar goal structure has been clarified: the context after
   135 the initial backwards refinement is retained for the whole proof, within
   136 all its context sections (as indicated via 'next'). This is e.g.
   137 relevant for 'using', 'including', 'supply':
   138 
   139   have "A \<and> A" if a: A for A
   140     supply [simp] = a
   141   proof
   142     show A by simp
   143   next
   144     show A by simp
   145   qed
   146 
   147 * Method "sleep" succeeds after a real-time delay (in seconds). This is
   148 occasionally useful for demonstration and testing purposes.
   149 
   150 
   151 *** Pure ***
   152 
   153 * The vacuous fact "TERM x" may be established "by fact" or as `TERM x`
   154 as well, not just "by this" or "." as before.
   155 
   156 * Configuration option rule_insts_schematic has been discontinued
   157 (intermediate legacy feature in Isabelle2015).  INCOMPATIBILITY.
   158 
   159 * Abbreviations in type classes now carry proper sort constraint.
   160 Rare INCOMPATIBILITY in situations where the previous misbehaviour
   161 has been exploited previously.
   162 
   163 * Refinement of user-space type system in type classes: pseudo-local
   164 operations behave more similar to abbreviations.  Potential
   165 INCOMPATIBILITY in exotic situations.
   166 
   167 
   168 *** HOL ***
   169 
   170 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.
   171 
   172 * Sledgehammer:
   173   - Proof reconstruction has been improved, to minimize the incidence of
   174     cases where Sledgehammer gives a proof that does not work.
   175   - Auto Sledgehammer now minimizes and preplays the results.
   176   - The URL for remote provers on SystemOnTPTP has been updated.
   177 
   178 * Nitpick:
   179   - Removed "check_potential" and "check_genuine" options.
   180 
   181 * Tightened specification of class semiring_no_zero_divisors.  Slight
   182 INCOMPATIBILITY.
   183 
   184 * Class algebraic_semidom introduced common algebraic notions of
   185 integral (semi)domains like units and associated elements.  Although
   186 logically subsumed by fields, is is not a super class of these
   187 in order not to burden fields with notions that are trivial there.
   188 INCOMPATIBILITY.
   189 
   190 * Former constants Fields.divide (_ / _) and Divides.div (_ div _)
   191 are logically unified to Rings.divide in syntactic type class
   192 Rings.divide, with infix syntax (_ div _).  Infix syntax (_ / _)
   193 for field division is added later as abbreviation in class Fields.inverse.
   194 INCOMPATIBILITY,  instantiations must refer to Rings.divide rather
   195 than the former separate constants, hence infix syntax (_ / _) is usually
   196 not available during instantiation.
   197 
   198 * Library/Multiset:
   199   - Renamed multiset inclusion operators:
   200       < ~> <#
   201       \<subset> ~> \<subset>#
   202       <= ~> <=#
   203       \<le> ~> \<le>#
   204       \<subseteq> ~> \<subseteq>#
   205     INCOMPATIBILITY.
   206   - "'a multiset" is no longer an instance of the "order",
   207     "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",
   208     "semilattice_inf", and "semilattice_sup" type classes. The theorems
   209     previously provided by these type classes (directly or indirectly)
   210     are now available through the "subset_mset" interpretation
   211     (e.g. add_mono ~> subset_mset.add_mono).
   212     INCOMPATIBILITY.
   213   - Renamed conversions:
   214       multiset_of ~> mset
   215       multiset_of_set ~> mset_set
   216       set_of ~> set_mset
   217     INCOMPATIBILITY
   218   - Renamed lemmas:
   219       mset_le_def ~> subseteq_mset_def
   220       mset_less_def ~> subset_mset_def
   221       less_eq_multiset.rep_eq ~> subseteq_mset_def
   222     INCOMPATIBILITY
   223   - Removed lemmas generated by lift_definition:
   224     less_eq_multiset.abs_eq, less_eq_multiset.rsp less_eq_multiset.transfer
   225     less_eq_multiset_def
   226     INCOMPATIBILITY
   227 
   228 * Theory Library/Old_Recdef: discontinued obsolete 'defer_recdef'
   229 command. Minor INCOMPATIBILITY, use 'function' instead.
   230 
   231 
   232 
   233 New in Isabelle2015 (May 2015)
   234 ------------------------------
   235 
   236 *** General ***
   237 
   238 * Local theory specification commands may have a 'private' or
   239 'qualified' modifier to restrict name space accesses to the local scope,
   240 as provided by some "context begin ... end" block. For example:
   241 
   242   context
   243   begin
   244 
   245   private definition ...
   246   private lemma ...
   247 
   248   qualified definition ...
   249   qualified lemma ...
   250 
   251   lemma ...
   252   theorem ...
   253 
   254   end
   255 
   256 * Command 'experiment' opens an anonymous locale context with private
   257 naming policy.
   258 
   259 * Command 'notepad' requires proper nesting of begin/end and its proof
   260 structure in the body: 'oops' is no longer supported here. Minor
   261 INCOMPATIBILITY, use 'sorry' instead.
   262 
   263 * Command 'named_theorems' declares a dynamic fact within the context,
   264 together with an attribute to maintain the content incrementally. This
   265 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change
   266 of semantics due to external visual order vs. internal reverse order.
   267 
   268 * 'find_theorems': search patterns which are abstractions are
   269 schematically expanded before search. Search results match the naive
   270 expectation more closely, particularly wrt. abbreviations.
   271 INCOMPATIBILITY.
   272 
   273 * Commands 'method_setup' and 'attribute_setup' now work within a local
   274 theory context.
   275 
   276 * Outer syntax commands are managed authentically within the theory
   277 context, without implicit global state. Potential for accidental
   278 INCOMPATIBILITY, make sure that required theories are really imported.
   279 
   280 * Historical command-line terminator ";" is no longer accepted (and
   281 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle
   282 update_semicolons" to remove obsolete semicolons from old theory
   283 sources.
   284 
   285 * Structural composition of proof methods (meth1; meth2) in Isar
   286 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.
   287 
   288 * The Eisbach proof method language allows to define new proof methods
   289 by combining existing ones with their usual syntax. The "match" proof
   290 method provides basic fact/term matching in addition to
   291 premise/conclusion matching through Subgoal.focus, and binds fact names
   292 from matches as well as term patterns within matches. The Isabelle
   293 documentation provides an entry "eisbach" for the Eisbach User Manual.
   294 Sources and various examples are in ~~/src/HOL/Eisbach/.
   295 
   296 
   297 *** Prover IDE -- Isabelle/Scala/jEdit ***
   298 
   299 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,
   300 the "sidekick" mode may be used for document structure.
   301 
   302 * Extended bracket matching based on Isar language structure. System
   303 option jedit_structure_limit determines maximum number of lines to scan
   304 in the buffer.
   305 
   306 * Support for BibTeX files: context menu, context-sensitive token
   307 marker, SideKick parser.
   308 
   309 * Document antiquotation @{cite} provides formal markup, which is
   310 interpreted semi-formally based on .bib files that happen to be open in
   311 the editor (hyperlinks, completion etc.).
   312 
   313 * Less waste of vertical space via negative line spacing (see Global
   314 Options / Text Area).
   315 
   316 * Improved graphview panel with optional output of PNG or PDF, for
   317 display of 'thy_deps', 'class_deps' etc.
   318 
   319 * The commands 'thy_deps' and 'class_deps' allow optional bounds to
   320 restrict the visualized hierarchy.
   321 
   322 * Improved scheduling for asynchronous print commands (e.g. provers
   323 managed by the Sledgehammer panel) wrt. ongoing document processing.
   324 
   325 
   326 *** Document preparation ***
   327 
   328 * Document markup commands 'chapter', 'section', 'subsection',
   329 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any
   330 context, even before the initial 'theory' command. Obsolete proof
   331 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been
   332 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'
   333 instead. The old 'header' command is still retained for some time, but
   334 should be replaced by 'chapter', 'section' etc. (using "isabelle
   335 update_header"). Minor INCOMPATIBILITY.
   336 
   337 * Official support for "tt" style variants, via \isatt{...} or
   338 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or
   339 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.
   340 as argument to other macros (such as footnotes).
   341 
   342 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"
   343 style.
   344 
   345 * Discontinued obsolete option "document_graph": session_graph.pdf is
   346 produced unconditionally for HTML browser_info and PDF-LaTeX document.
   347 
   348 * Diagnostic commands and document markup commands within a proof do not
   349 affect the command tag for output. Thus commands like 'thm' are subject
   350 to proof document structure, and no longer "stick out" accidentally.
   351 Commands 'text' and 'txt' merely differ in the LaTeX style, not their
   352 tags. Potential INCOMPATIBILITY in exotic situations.
   353 
   354 * System option "pretty_margin" is superseded by "thy_output_margin",
   355 which is also accessible via document antiquotation option "margin".
   356 Only the margin for document output may be changed, but not the global
   357 pretty printing: that is 76 for plain console output, and adapted
   358 dynamically in GUI front-ends. Implementations of document
   359 antiquotations need to observe the margin explicitly according to
   360 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.
   361 
   362 * Specification of 'document_files' in the session ROOT file is
   363 mandatory for document preparation. The legacy mode with implicit
   364 copying of the document/ directory is no longer supported. Minor
   365 INCOMPATIBILITY.
   366 
   367 
   368 *** Pure ***
   369 
   370 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"
   371 etc.) allow an optional context of local variables ('for' declaration):
   372 these variables become schematic in the instantiated theorem; this
   373 behaviour is analogous to 'for' in attributes "where" and "of".
   374 Configuration option rule_insts_schematic (default false) controls use
   375 of schematic variables outside the context. Minor INCOMPATIBILITY,
   376 declare rule_insts_schematic = true temporarily and update to use local
   377 variable declarations or dummy patterns instead.
   378 
   379 * Explicit instantiation via attributes "where", "of", and proof methods
   380 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns
   381 ("_") that stand for anonymous local variables.
   382 
   383 * Generated schematic variables in standard format of exported facts are
   384 incremented to avoid material in the proof context. Rare
   385 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to
   386 different index.
   387 
   388 * Lexical separation of signed and unsigned numerals: categories "num"
   389 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence
   390 of numeral signs, particularly in expressions involving infix syntax
   391 like "(- 1) ^ n".
   392 
   393 * Old inner token category "xnum" has been discontinued.  Potential
   394 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"
   395 token category instead.
   396 
   397 
   398 *** HOL ***
   399 
   400 * New (co)datatype package:
   401   - The 'datatype_new' command has been renamed 'datatype'. The old
   402     command of that name is now called 'old_datatype' and is provided
   403     by "~~/src/HOL/Library/Old_Datatype.thy". See
   404     'isabelle doc datatypes' for information on porting.
   405     INCOMPATIBILITY.
   406   - Renamed theorems:
   407       disc_corec ~> corec_disc
   408       disc_corec_iff ~> corec_disc_iff
   409       disc_exclude ~> distinct_disc
   410       disc_exhaust ~> exhaust_disc
   411       disc_map_iff ~> map_disc_iff
   412       sel_corec ~> corec_sel
   413       sel_exhaust ~> exhaust_sel
   414       sel_map ~> map_sel
   415       sel_set ~> set_sel
   416       sel_split ~> split_sel
   417       sel_split_asm ~> split_sel_asm
   418       strong_coinduct ~> coinduct_strong
   419       weak_case_cong ~> case_cong_weak
   420     INCOMPATIBILITY.
   421   - The "no_code" option to "free_constructors", "datatype_new", and
   422     "codatatype" has been renamed "plugins del: code".
   423     INCOMPATIBILITY.
   424   - The rules "set_empty" have been removed. They are easy
   425     consequences of other set rules "by auto".
   426     INCOMPATIBILITY.
   427   - The rule "set_cases" is now registered with the "[cases set]"
   428     attribute. This can influence the behavior of the "cases" proof
   429     method when more than one case rule is applicable (e.g., an
   430     assumption is of the form "w : set ws" and the method "cases w"
   431     is invoked). The solution is to specify the case rule explicitly
   432     (e.g. "cases w rule: widget.exhaust").
   433     INCOMPATIBILITY.
   434   - Renamed theories:
   435       BNF_Comp ~> BNF_Composition
   436       BNF_FP_Base ~> BNF_Fixpoint_Base
   437       BNF_GFP ~> BNF_Greatest_Fixpoint
   438       BNF_LFP ~> BNF_Least_Fixpoint
   439       BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions
   440       Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions
   441     INCOMPATIBILITY.
   442   - Lifting and Transfer setup for basic HOL types sum and prod (also
   443     option) is now performed by the BNF package. Theories Lifting_Sum,
   444     Lifting_Product and Lifting_Option from Main became obsolete and
   445     were removed. Changed definitions of the relators rel_prod and
   446     rel_sum (using inductive).
   447     INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead
   448     of rel_prod_def and rel_sum_def.
   449     Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names
   450     changed (e.g. map_prod_transfer ~> prod.map_transfer).
   451   - Parametricity theorems for map functions, relators, set functions,
   452     constructors, case combinators, discriminators, selectors and
   453     (co)recursors are automatically proved and registered as transfer
   454     rules.
   455 
   456 * Old datatype package:
   457   - The old 'datatype' command has been renamed 'old_datatype', and
   458     'rep_datatype' has been renamed 'old_rep_datatype'. They are
   459     provided by "~~/src/HOL/Library/Old_Datatype.thy". See
   460     'isabelle doc datatypes' for information on porting.
   461     INCOMPATIBILITY.
   462   - Renamed theorems:
   463       weak_case_cong ~> case_cong_weak
   464     INCOMPATIBILITY.
   465   - Renamed theory:
   466       ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy
   467     INCOMPATIBILITY.
   468 
   469 * Nitpick:
   470   - Fixed soundness bug related to the strict and non-strict subset
   471     operations.
   472 
   473 * Sledgehammer:
   474   - CVC4 is now included with Isabelle instead of CVC3 and run by
   475     default.
   476   - Z3 is now always enabled by default, now that it is fully open
   477     source. The "z3_non_commercial" option is discontinued.
   478   - Minimization is now always enabled by default.
   479     Removed sub-command:
   480       min
   481   - Proof reconstruction, both one-liners and Isar, has been
   482     dramatically improved.
   483   - Improved support for CVC4 and veriT.
   484 
   485 * Old and new SMT modules:
   486   - The old 'smt' method has been renamed 'old_smt' and moved to
   487     'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,
   488     until applications have been ported to use the new 'smt' method. For
   489     the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must
   490     be installed, and the environment variable "OLD_Z3_SOLVER" must
   491     point to it.
   492     INCOMPATIBILITY.
   493   - The 'smt2' method has been renamed 'smt'.
   494     INCOMPATIBILITY.
   495   - New option 'smt_reconstruction_step_timeout' to limit the
   496     reconstruction time of Z3 proof steps in the new 'smt' method.
   497   - New option 'smt_statistics' to display statistics of the new 'smt'
   498     method, especially runtime statistics of Z3 proof reconstruction.
   499 
   500 * Lifting: command 'lift_definition' allows to execute lifted constants
   501 that have as a return type a datatype containing a subtype. This
   502 overcomes long-time limitations in the area of code generation and
   503 lifting, and avoids tedious workarounds.
   504 
   505 * Command and antiquotation "value" provide different evaluation slots
   506 (again), where the previous strategy (NBE after ML) serves as default.
   507 Minor INCOMPATIBILITY.
   508 
   509 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.
   510 
   511 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid
   512 non-termination in case of distributing a division. With this change
   513 field_simps is in some cases slightly less powerful, if it fails try to
   514 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.
   515 
   516 * Separate class no_zero_divisors has been given up in favour of fully
   517 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.
   518 
   519 * Class linordered_semidom really requires no zero divisors.
   520 INCOMPATIBILITY.
   521 
   522 * Classes division_ring, field and linordered_field always demand
   523 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,
   524 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.
   525 
   526 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit
   527 additive inverse operation. INCOMPATIBILITY.
   528 
   529 * Complex powers and square roots. The functions "ln" and "powr" are now
   530 overloaded for types real and complex, and 0 powr y = 0 by definition.
   531 INCOMPATIBILITY: type constraints may be necessary.
   532 
   533 * The functions "sin" and "cos" are now defined for any type of sort
   534 "{real_normed_algebra_1,banach}" type, so in particular on "real" and
   535 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be
   536 needed.
   537 
   538 * New library of properties of the complex transcendental functions sin,
   539 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.
   540 
   541 * The factorial function, "fact", now has type "nat => 'a" (of a sort
   542 that admits numeric types including nat, int, real and complex.
   543 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type
   544 constraint, and the combination "real (fact k)" is likely to be
   545 unsatisfactory. If a type conversion is still necessary, then use
   546 "of_nat (fact k)" or "real_of_nat (fact k)".
   547 
   548 * Removed functions "natfloor" and "natceiling", use "nat o floor" and
   549 "nat o ceiling" instead. A few of the lemmas have been retained and
   550 adapted: in their names "natfloor"/"natceiling" has been replaced by
   551 "nat_floor"/"nat_ceiling".
   552 
   553 * Qualified some duplicated fact names required for boostrapping the
   554 type class hierarchy:
   555   ab_add_uminus_conv_diff ~> diff_conv_add_uminus
   556   field_inverse_zero ~> inverse_zero
   557   field_divide_inverse ~> divide_inverse
   558   field_inverse ~> left_inverse
   559 Minor INCOMPATIBILITY.
   560 
   561 * Eliminated fact duplicates:
   562   mult_less_imp_less_right ~> mult_right_less_imp_less
   563   mult_less_imp_less_left ~> mult_left_less_imp_less
   564 Minor INCOMPATIBILITY.
   565 
   566 * Fact consolidation: even_less_0_iff is subsumed by
   567 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).
   568 
   569 * Generalized and consolidated some theorems concerning divsibility:
   570   dvd_reduce ~> dvd_add_triv_right_iff
   571   dvd_plus_eq_right ~> dvd_add_right_iff
   572   dvd_plus_eq_left ~> dvd_add_left_iff
   573 Minor INCOMPATIBILITY.
   574 
   575 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"
   576 and part of theory Main.
   577   even_def ~> even_iff_mod_2_eq_zero
   578 INCOMPATIBILITY.
   579 
   580 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor
   581 INCOMPATIBILITY.
   582 
   583 * Bootstrap of listsum as special case of abstract product over lists.
   584 Fact rename:
   585     listsum_def ~> listsum.eq_foldr
   586 INCOMPATIBILITY.
   587 
   588 * Product over lists via constant "listprod".
   589 
   590 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to
   591 Cons_nth_drop_Suc.
   592 
   593 * New infrastructure for compiling, running, evaluating and testing
   594 generated code in target languages in HOL/Library/Code_Test. See
   595 HOL/Codegenerator_Test/Code_Test* for examples.
   596 
   597 * Library/Multiset:
   598   - Introduced "replicate_mset" operation.
   599   - Introduced alternative characterizations of the multiset ordering in
   600     "Library/Multiset_Order".
   601   - Renamed multiset ordering:
   602       <# ~> #<#
   603       <=# ~> #<=#
   604       \<subset># ~> #\<subset>#
   605       \<subseteq># ~> #\<subseteq>#
   606     INCOMPATIBILITY.
   607   - Introduced abbreviations for ill-named multiset operations:
   608       <#, \<subset># abbreviate < (strict subset)
   609       <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)
   610     INCOMPATIBILITY.
   611   - Renamed
   612       in_multiset_of ~> in_multiset_in_set
   613       Multiset.fold ~> fold_mset
   614       Multiset.filter ~> filter_mset
   615     INCOMPATIBILITY.
   616   - Removed mcard, is equal to size.
   617   - Added attributes:
   618       image_mset.id [simp]
   619       image_mset_id [simp]
   620       elem_multiset_of_set [simp, intro]
   621       comp_fun_commute_plus_mset [simp]
   622       comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]
   623       in_mset_fold_plus_iff [iff]
   624       set_of_Union_mset [simp]
   625       in_Union_mset_iff [iff]
   626     INCOMPATIBILITY.
   627 
   628 * Library/Sum_of_Squares: simplified and improved "sos" method. Always
   629 use local CSDP executable, which is much faster than the NEOS server.
   630 The "sos_cert" functionality is invoked as "sos" with additional
   631 argument. Minor INCOMPATIBILITY.
   632 
   633 * HOL-Decision_Procs: New counterexample generator quickcheck
   634 [approximation] for inequalities of transcendental functions. Uses
   635 hardware floating point arithmetic to randomly discover potential
   636 counterexamples. Counterexamples are certified with the "approximation"
   637 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for
   638 examples.
   639 
   640 * HOL-Probability: Reworked measurability prover
   641   - applies destructor rules repeatedly
   642   - removed application splitting (replaced by destructor rule)
   643   - added congruence rules to rewrite measure spaces under the sets
   644     projection
   645 
   646 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for
   647 single-step rewriting with subterm selection based on patterns.
   648 
   649 
   650 *** ML ***
   651 
   652 * Subtle change of name space policy: undeclared entries are now
   653 considered inaccessible, instead of accessible via the fully-qualified
   654 internal name. This mainly affects Name_Space.intern (and derivatives),
   655 which may produce an unexpected Long_Name.hidden prefix. Note that
   656 contemporary applications use the strict Name_Space.check (and
   657 derivatives) instead, which is not affected by the change. Potential
   658 INCOMPATIBILITY in rare applications of Name_Space.intern.
   659 
   660 * Subtle change of error semantics of Toplevel.proof_of: regular user
   661 ERROR instead of internal Toplevel.UNDEF.
   662 
   663 * Basic combinators map, fold, fold_map, split_list, apply are available
   664 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.
   665 
   666 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.
   667 INCOMPATIBILITY.
   668 
   669 * Former combinators NAMED_CRITICAL and CRITICAL for central critical
   670 sections have been discontinued, in favour of the more elementary
   671 Multithreading.synchronized and its high-level derivative
   672 Synchronized.var (which is usually sufficient in applications). Subtle
   673 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be
   674 nested.
   675 
   676 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle
   677 change of semantics with minimal potential for INCOMPATIBILITY.
   678 
   679 * The main operations to certify logical entities are Thm.ctyp_of and
   680 Thm.cterm_of with a local context; old-style global theory variants are
   681 available as Thm.global_ctyp_of and Thm.global_cterm_of.
   682 INCOMPATIBILITY.
   683 
   684 * Elementary operations in module Thm are no longer pervasive.
   685 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,
   686 Thm.term_of etc.
   687 
   688 * Proper context for various elementary tactics: assume_tac,
   689 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,
   690 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.
   691 
   692 * Tactical PARALLEL_ALLGOALS is the most common way to refer to
   693 PARALLEL_GOALS.
   694 
   695 * Goal.prove_multi is superseded by the fully general Goal.prove_common,
   696 which also allows to specify a fork priority.
   697 
   698 * Antiquotation @{command_spec "COMMAND"} is superseded by
   699 @{command_keyword COMMAND} (usually without quotes and with PIDE
   700 markup). Minor INCOMPATIBILITY.
   701 
   702 * Cartouches within ML sources are turned into values of type
   703 Input.source (with formal position information).
   704 
   705 
   706 *** System ***
   707 
   708 * The Isabelle tool "update_cartouches" changes theory files to use
   709 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.
   710 
   711 * The Isabelle tool "build" provides new options -X, -k, -x.
   712 
   713 * Discontinued old-fashioned "codegen" tool. Code generation can always
   714 be externally triggered using an appropriate ROOT file plus a
   715 corresponding theory. Parametrization is possible using environment
   716 variables, or ML snippets in the most extreme cases. Minor
   717 INCOMPATIBILITY.
   718 
   719 * JVM system property "isabelle.threads" determines size of Scala thread
   720 pool, like Isabelle system option "threads" for ML.
   721 
   722 * JVM system property "isabelle.laf" determines the default Swing
   723 look-and-feel, via internal class name or symbolic name as in the jEdit
   724 menu Global Options / Appearance.
   725 
   726 * Support for Proof General and Isar TTY loop has been discontinued.
   727 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.
   728 
   729 
   730 
   731 New in Isabelle2014 (August 2014)
   732 ---------------------------------
   733 
   734 *** General ***
   735 
   736 * Support for official Standard ML within the Isabelle context.
   737 Command 'SML_file' reads and evaluates the given Standard ML file.
   738 Toplevel bindings are stored within the theory context; the initial
   739 environment is restricted to the Standard ML implementation of
   740 Poly/ML, without the add-ons of Isabelle/ML.  Commands 'SML_import'
   741 and 'SML_export' allow to exchange toplevel bindings between the two
   742 separate environments.  See also ~~/src/Tools/SML/Examples.thy for
   743 some examples.
   744 
   745 * Standard tactics and proof methods such as "clarsimp", "auto" and
   746 "safe" now preserve equality hypotheses "x = expr" where x is a free
   747 variable.  Locale assumptions and chained facts containing "x"
   748 continue to be useful.  The new method "hypsubst_thin" and the
   749 configuration option "hypsubst_thin" (within the attribute name space)
   750 restore the previous behavior.  INCOMPATIBILITY, especially where
   751 induction is done after these methods or when the names of free and
   752 bound variables clash.  As first approximation, old proofs may be
   753 repaired by "using [[hypsubst_thin = true]]" in the critical spot.
   754 
   755 * More static checking of proof methods, which allows the system to
   756 form a closure over the concrete syntax.  Method arguments should be
   757 processed in the original proof context as far as possible, before
   758 operating on the goal state.  In any case, the standard discipline for
   759 subgoal-addressing needs to be observed: no subgoals or a subgoal
   760 number that is out of range produces an empty result sequence, not an
   761 exception.  Potential INCOMPATIBILITY for non-conformant tactical
   762 proof tools.
   763 
   764 * Lexical syntax (inner and outer) supports text cartouches with
   765 arbitrary nesting, and without escapes of quotes etc.  The Prover IDE
   766 supports input via ` (backquote).
   767 
   768 * The outer syntax categories "text" (for formal comments and document
   769 markup commands) and "altstring" (for literal fact references) allow
   770 cartouches as well, in addition to the traditional mix of quotations.
   771 
   772 * Syntax of document antiquotation @{rail} now uses \<newline> instead
   773 of "\\", to avoid the optical illusion of escaped backslash within
   774 string token.  General renovation of its syntax using text cartouches.
   775 Minor INCOMPATIBILITY.
   776 
   777 * Discontinued legacy_isub_isup, which was a temporary workaround for
   778 Isabelle/ML in Isabelle2013-1.  The prover process no longer accepts
   779 old identifier syntax with \<^isub> or \<^isup>.  Potential
   780 INCOMPATIBILITY.
   781 
   782 * Document antiquotation @{url} produces markup for the given URL,
   783 which results in an active hyperlink within the text.
   784 
   785 * Document antiquotation @{file_unchecked} is like @{file}, but does
   786 not check existence within the file-system.
   787 
   788 * Updated and extended manuals: codegen, datatypes, implementation,
   789 isar-ref, jedit, system.
   790 
   791 
   792 *** Prover IDE -- Isabelle/Scala/jEdit ***
   793 
   794 * Improved Document panel: simplified interaction where every single
   795 mouse click (re)opens document via desktop environment or as jEdit
   796 buffer.
   797 
   798 * Support for Navigator plugin (with toolbar buttons), with connection
   799 to PIDE hyperlinks.
   800 
   801 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
   802 Open text buffers take precedence over copies within the file-system.
   803 
   804 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
   805 auxiliary ML files.
   806 
   807 * Improved syntactic and semantic completion mechanism, with simple
   808 templates, completion language context, name-space completion,
   809 file-name completion, spell-checker completion.
   810 
   811 * Refined GUI popup for completion: more robust key/mouse event
   812 handling and propagation to enclosing text area -- avoid loosing
   813 keystrokes with slow / remote graphics displays.
   814 
   815 * Completion popup supports both ENTER and TAB (default) to select an
   816 item, depending on Isabelle options.
   817 
   818 * Refined insertion of completion items wrt. jEdit text: multiple
   819 selections, rectangular selections, rectangular selection as "tall
   820 caret".
   821 
   822 * Integrated spell-checker for document text, comments etc. with
   823 completion popup and context-menu.
   824 
   825 * More general "Query" panel supersedes "Find" panel, with GUI access
   826 to commands 'find_theorems' and 'find_consts', as well as print
   827 operations for the context.  Minor incompatibility in keyboard
   828 shortcuts etc.: replace action isabelle-find by isabelle-query.
   829 
   830 * Search field for all output panels ("Output", "Query", "Info" etc.)
   831 to highlight text via regular expression.
   832 
   833 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
   834 General") allows to specify additional print modes for the prover
   835 process, without requiring old-fashioned command-line invocation of
   836 "isabelle jedit -m MODE".
   837 
   838 * More support for remote files (e.g. http) using standard Java
   839 networking operations instead of jEdit virtual file-systems.
   840 
   841 * Empty editors buffers that are no longer required (e.g.\ via theory
   842 imports) are automatically removed from the document model.
   843 
   844 * Improved monitor panel.
   845 
   846 * Improved Console/Scala plugin: more uniform scala.Console output,
   847 more robust treatment of threads and interrupts.
   848 
   849 * Improved management of dockable windows: clarified keyboard focus
   850 and window placement wrt. main editor view; optional menu item to
   851 "Detach" a copy where this makes sense.
   852 
   853 * New Simplifier Trace panel provides an interactive view of the
   854 simplification process, enabled by the "simp_trace_new" attribute
   855 within the context.
   856 
   857 
   858 *** Pure ***
   859 
   860 * Low-level type-class commands 'classes', 'classrel', 'arities' have
   861 been discontinued to avoid the danger of non-trivial axiomatization
   862 that is not immediately visible.  INCOMPATIBILITY, use regular
   863 'instance' command with proof.  The required OFCLASS(...) theorem
   864 might be postulated via 'axiomatization' beforehand, or the proof
   865 finished trivially if the underlying class definition is made vacuous
   866 (without any assumptions).  See also Isabelle/ML operations
   867 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
   868 Axclass.arity_axiomatization.
   869 
   870 * Basic constants of Pure use more conventional names and are always
   871 qualified.  Rare INCOMPATIBILITY, but with potentially serious
   872 consequences, notably for tools in Isabelle/ML.  The following
   873 renaming needs to be applied:
   874 
   875   ==             ~>  Pure.eq
   876   ==>            ~>  Pure.imp
   877   all            ~>  Pure.all
   878   TYPE           ~>  Pure.type
   879   dummy_pattern  ~>  Pure.dummy_pattern
   880 
   881 Systematic porting works by using the following theory setup on a
   882 *previous* Isabelle version to introduce the new name accesses for the
   883 old constants:
   884 
   885 setup {*
   886   fn thy => thy
   887     |> Sign.root_path
   888     |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
   889     |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
   890     |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
   891     |> Sign.restore_naming thy
   892 *}
   893 
   894 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
   895 Later the application is moved to the current Isabelle version, and
   896 the auxiliary aliases are deleted.
   897 
   898 * Attributes "where" and "of" allow an optional context of local
   899 variables ('for' declaration): these variables become schematic in the
   900 instantiated theorem.
   901 
   902 * Obsolete attribute "standard" has been discontinued (legacy since
   903 Isabelle2012).  Potential INCOMPATIBILITY, use explicit 'for' context
   904 where instantiations with schematic variables are intended (for
   905 declaration commands like 'lemmas' or attributes like "of").  The
   906 following temporary definition may help to port old applications:
   907 
   908   attribute_setup standard =
   909     "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
   910 
   911 * More thorough check of proof context for goal statements and
   912 attributed fact expressions (concerning background theory, declared
   913 hyps).  Potential INCOMPATIBILITY, tools need to observe standard
   914 context discipline.  See also Assumption.add_assumes and the more
   915 primitive Thm.assume_hyps.
   916 
   917 * Inner syntax token language allows regular quoted strings "..."
   918 (only makes sense in practice, if outer syntax is delimited
   919 differently, e.g. via cartouches).
   920 
   921 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
   922 but the latter is retained some time as Proof General legacy.
   923 
   924 * Code generator preprocessor: explicit control of simp tracing on a
   925 per-constant basis.  See attribute "code_preproc".
   926 
   927 
   928 *** HOL ***
   929 
   930 * Code generator: enforce case of identifiers only for strict target
   931 language requirements.  INCOMPATIBILITY.
   932 
   933 * Code generator: explicit proof contexts in many ML interfaces.
   934 INCOMPATIBILITY.
   935 
   936 * Code generator: minimize exported identifiers by default.  Minor
   937 INCOMPATIBILITY.
   938 
   939 * Code generation for SML and OCaml: dropped arcane "no_signatures"
   940 option.  Minor INCOMPATIBILITY.
   941 
   942 * "declare [[code abort: ...]]" replaces "code_abort ...".
   943 INCOMPATIBILITY.
   944 
   945 * "declare [[code drop: ...]]" drops all code equations associated
   946 with the given constants.
   947 
   948 * Code generations are provided for make, fields, extend and truncate
   949 operations on records.
   950 
   951 * Command and antiquotation "value" are now hardcoded against nbe and
   952 ML.  Minor INCOMPATIBILITY.
   953 
   954 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
   955 
   956 * The symbol "\<newline>" may be used within char or string literals
   957 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
   958 
   959 * Qualified String.implode and String.explode.  INCOMPATIBILITY.
   960 
   961 * Simplifier: Enhanced solver of preconditions of rewrite rules can
   962 now deal with conjunctions.  For help with converting proofs, the old
   963 behaviour of the simplifier can be restored like this: declare/using
   964 [[simp_legacy_precond]].  This configuration option will disappear
   965 again in the future.  INCOMPATIBILITY.
   966 
   967 * Simproc "finite_Collect" is no longer enabled by default, due to
   968 spurious crashes and other surprises.  Potential INCOMPATIBILITY.
   969 
   970 * Moved new (co)datatype package and its dependencies from session
   971   "HOL-BNF" to "HOL".  The commands 'bnf', 'wrap_free_constructors',
   972   'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
   973   part of theory "Main".
   974 
   975   Theory renamings:
   976     FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
   977     Library/Wfrec.thy ~> Wfrec.thy
   978     Library/Zorn.thy ~> Zorn.thy
   979     Cardinals/Order_Relation.thy ~> Order_Relation.thy
   980     Library/Order_Union.thy ~> Cardinals/Order_Union.thy
   981     Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
   982     Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
   983     Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
   984     Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
   985     Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
   986     BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
   987     BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
   988     BNF/BNF_Comp.thy ~> BNF_Comp.thy
   989     BNF/BNF_Def.thy ~> BNF_Def.thy
   990     BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
   991     BNF/BNF_GFP.thy ~> BNF_GFP.thy
   992     BNF/BNF_LFP.thy ~> BNF_LFP.thy
   993     BNF/BNF_Util.thy ~> BNF_Util.thy
   994     BNF/Coinduction.thy ~> Coinduction.thy
   995     BNF/More_BNFs.thy ~> Library/More_BNFs.thy
   996     BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
   997     BNF/Examples/* ~> BNF_Examples/*
   998 
   999   New theories:
  1000     Wellorder_Extension.thy (split from Zorn.thy)
  1001     Library/Cardinal_Notations.thy
  1002     Library/BNF_Axomatization.thy
  1003     BNF_Examples/Misc_Primcorec.thy
  1004     BNF_Examples/Stream_Processor.thy
  1005 
  1006   Discontinued theories:
  1007     BNF/BNF.thy
  1008     BNF/Equiv_Relations_More.thy
  1009 
  1010 INCOMPATIBILITY.
  1011 
  1012 * New (co)datatype package:
  1013   - Command 'primcorec' is fully implemented.
  1014   - Command 'datatype_new' generates size functions ("size_xxx" and
  1015     "size") as required by 'fun'.
  1016   - BNFs are integrated with the Lifting tool and new-style
  1017     (co)datatypes with Transfer.
  1018   - Renamed commands:
  1019       datatype_new_compat ~> datatype_compat
  1020       primrec_new ~> primrec
  1021       wrap_free_constructors ~> free_constructors
  1022     INCOMPATIBILITY.
  1023   - The generated constants "xxx_case" and "xxx_rec" have been renamed
  1024     "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
  1025     INCOMPATIBILITY.
  1026   - The constant "xxx_(un)fold" and related theorems are no longer
  1027     generated.  Use "xxx_(co)rec" or define "xxx_(un)fold" manually
  1028     using "prim(co)rec".
  1029     INCOMPATIBILITY.
  1030   - No discriminators are generated for nullary constructors by
  1031     default, eliminating the need for the odd "=:" syntax.
  1032     INCOMPATIBILITY.
  1033   - No discriminators or selectors are generated by default by
  1034     "datatype_new", unless custom names are specified or the new
  1035     "discs_sels" option is passed.
  1036     INCOMPATIBILITY.
  1037 
  1038 * Old datatype package:
  1039   - The generated theorems "xxx.cases" and "xxx.recs" have been
  1040     renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
  1041     "sum.case").  INCOMPATIBILITY.
  1042   - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
  1043     been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
  1044     "prod_case" ~> "case_prod").  INCOMPATIBILITY.
  1045 
  1046 * The types "'a list" and "'a option", their set and map functions,
  1047   their relators, and their selectors are now produced using the new
  1048   BNF-based datatype package.
  1049 
  1050   Renamed constants:
  1051     Option.set ~> set_option
  1052     Option.map ~> map_option
  1053     option_rel ~> rel_option
  1054 
  1055   Renamed theorems:
  1056     set_def ~> set_rec[abs_def]
  1057     map_def ~> map_rec[abs_def]
  1058     Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
  1059     option.recs ~> option.rec
  1060     list_all2_def ~> list_all2_iff
  1061     set.simps ~> set_simps (or the slightly different "list.set")
  1062     map.simps ~> list.map
  1063     hd.simps ~> list.sel(1)
  1064     tl.simps ~> list.sel(2-3)
  1065     the.simps ~> option.sel
  1066 
  1067 INCOMPATIBILITY.
  1068 
  1069 * The following map functions and relators have been renamed:
  1070     sum_map ~> map_sum
  1071     map_pair ~> map_prod
  1072     prod_rel ~> rel_prod
  1073     sum_rel ~> rel_sum
  1074     fun_rel ~> rel_fun
  1075     set_rel ~> rel_set
  1076     filter_rel ~> rel_filter
  1077     fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
  1078     cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
  1079     vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
  1080 
  1081 INCOMPATIBILITY.
  1082 
  1083 * Lifting and Transfer:
  1084   - a type variable as a raw type is supported
  1085   - stronger reflexivity prover
  1086   - rep_eq is always generated by lift_definition
  1087   - setup for Lifting/Transfer is now automated for BNFs
  1088     + holds for BNFs that do not contain a dead variable
  1089     + relator_eq, relator_mono, relator_distr, relator_domain,
  1090       relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,
  1091       right_unique, right_total, left_unique, left_total are proved
  1092       automatically
  1093     + definition of a predicator is generated automatically
  1094     + simplification rules for a predicator definition are proved
  1095       automatically for datatypes
  1096   - consolidation of the setup of Lifting/Transfer
  1097     + property that a relator preservers reflexivity is not needed any
  1098       more
  1099       Minor INCOMPATIBILITY.
  1100     + left_total and left_unique rules are now transfer rules
  1101       (reflexivity_rule attribute not needed anymore)
  1102       INCOMPATIBILITY.
  1103     + Domainp does not have to be a separate assumption in
  1104       relator_domain theorems (=> more natural statement)
  1105       INCOMPATIBILITY.
  1106   - registration of code equations is more robust
  1107     Potential INCOMPATIBILITY.
  1108   - respectfulness proof obligation is preprocessed to a more readable
  1109     form
  1110     Potential INCOMPATIBILITY.
  1111   - eq_onp is always unfolded in respectfulness proof obligation
  1112     Potential INCOMPATIBILITY.
  1113   - unregister lifting setup for Code_Numeral.integer and
  1114     Code_Numeral.natural
  1115     Potential INCOMPATIBILITY.
  1116   - Lifting.invariant -> eq_onp
  1117     INCOMPATIBILITY.
  1118 
  1119 * New internal SAT solver "cdclite" that produces models and proof
  1120 traces.  This solver replaces the internal SAT solvers "enumerate" and
  1121 "dpll".  Applications that explicitly used one of these two SAT
  1122 solvers should use "cdclite" instead. In addition, "cdclite" is now
  1123 the default SAT solver for the "sat" and "satx" proof methods and
  1124 corresponding tactics; the old default can be restored using "declare
  1125 [[sat_solver = zchaff_with_proofs]]".  Minor INCOMPATIBILITY.
  1126 
  1127 * SMT module: A new version of the SMT module, temporarily called
  1128 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
  1129 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
  1130 supported as oracles. Yices is no longer supported, because no version
  1131 of the solver can handle both SMT-LIB 2 and quantifiers.
  1132 
  1133 * Activation of Z3 now works via "z3_non_commercial" system option
  1134 (without requiring restart), instead of former settings variable
  1135 "Z3_NON_COMMERCIAL".  The option can be edited in Isabelle/jEdit menu
  1136 Plugin Options / Isabelle / General.
  1137 
  1138 * Sledgehammer:
  1139   - Z3 can now produce Isar proofs.
  1140   - MaSh overhaul:
  1141     . New SML-based learning algorithms eliminate the dependency on
  1142       Python and increase performance and reliability.
  1143     . MaSh and MeSh are now used by default together with the
  1144       traditional MePo (Meng-Paulson) relevance filter. To disable
  1145       MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
  1146       Options / Isabelle / General to "none".
  1147   - New option:
  1148       smt_proofs
  1149   - Renamed options:
  1150       isar_compress ~> compress
  1151       isar_try0 ~> try0
  1152 
  1153 INCOMPATIBILITY.
  1154 
  1155 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
  1156 
  1157 * Nitpick:
  1158   - Fixed soundness bug whereby mutually recursive datatypes could
  1159     take infinite values.
  1160   - Fixed soundness bug with low-level number functions such as
  1161     "Abs_Integ" and "Rep_Integ".
  1162   - Removed "std" option.
  1163   - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
  1164     "hide_types".
  1165 
  1166 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
  1167 (full_types)' instead. INCOMPATIBILITY.
  1168 
  1169 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
  1170 
  1171 * Adjustion of INF and SUP operations:
  1172   - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
  1173   - Consolidated theorem names containing INFI and SUPR: have INF and
  1174     SUP instead uniformly.
  1175   - More aggressive normalization of expressions involving INF and Inf
  1176     or SUP and Sup.
  1177   - INF_image and SUP_image do not unfold composition.
  1178   - Dropped facts INF_comp, SUP_comp.
  1179   - Default congruence rules strong_INF_cong and strong_SUP_cong, with
  1180     simplifier implication in premises.  Generalize and replace former
  1181     INT_cong, SUP_cong
  1182 
  1183 INCOMPATIBILITY.
  1184 
  1185 * SUP and INF generalized to conditionally_complete_lattice.
  1186 
  1187 * Swapped orientation of facts image_comp and vimage_comp:
  1188 
  1189   image_compose ~> image_comp [symmetric]
  1190   image_comp ~> image_comp [symmetric]
  1191   vimage_compose ~> vimage_comp [symmetric]
  1192   vimage_comp ~> vimage_comp [symmetric]
  1193 
  1194 INCOMPATIBILITY.
  1195 
  1196 * Theory reorganization: split of Big_Operators.thy into
  1197 Groups_Big.thy and Lattices_Big.thy.
  1198 
  1199 * Consolidated some facts about big group operators:
  1200 
  1201     setsum_0' ~> setsum.neutral
  1202     setsum_0 ~> setsum.neutral_const
  1203     setsum_addf ~> setsum.distrib
  1204     setsum_cartesian_product ~> setsum.cartesian_product
  1205     setsum_cases ~> setsum.If_cases
  1206     setsum_commute ~> setsum.commute
  1207     setsum_cong ~> setsum.cong
  1208     setsum_delta ~> setsum.delta
  1209     setsum_delta' ~> setsum.delta'
  1210     setsum_diff1' ~> setsum.remove
  1211     setsum_empty ~> setsum.empty
  1212     setsum_infinite ~> setsum.infinite
  1213     setsum_insert ~> setsum.insert
  1214     setsum_inter_restrict'' ~> setsum.inter_filter
  1215     setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
  1216     setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
  1217     setsum_mono_zero_left ~> setsum.mono_neutral_left
  1218     setsum_mono_zero_right ~> setsum.mono_neutral_right
  1219     setsum_reindex ~> setsum.reindex
  1220     setsum_reindex_cong ~> setsum.reindex_cong
  1221     setsum_reindex_nonzero ~> setsum.reindex_nontrivial
  1222     setsum_restrict_set ~> setsum.inter_restrict
  1223     setsum_Plus ~> setsum.Plus
  1224     setsum_setsum_restrict ~> setsum.commute_restrict
  1225     setsum_Sigma ~> setsum.Sigma
  1226     setsum_subset_diff ~> setsum.subset_diff
  1227     setsum_Un_disjoint ~> setsum.union_disjoint
  1228     setsum_UN_disjoint ~> setsum.UNION_disjoint
  1229     setsum_Un_Int ~> setsum.union_inter
  1230     setsum_Union_disjoint ~> setsum.Union_disjoint
  1231     setsum_UNION_zero ~> setsum.Union_comp
  1232     setsum_Un_zero ~> setsum.union_inter_neutral
  1233     strong_setprod_cong ~> setprod.strong_cong
  1234     strong_setsum_cong ~> setsum.strong_cong
  1235     setprod_1' ~> setprod.neutral
  1236     setprod_1 ~> setprod.neutral_const
  1237     setprod_cartesian_product ~> setprod.cartesian_product
  1238     setprod_cong ~> setprod.cong
  1239     setprod_delta ~> setprod.delta
  1240     setprod_delta' ~> setprod.delta'
  1241     setprod_empty ~> setprod.empty
  1242     setprod_infinite ~> setprod.infinite
  1243     setprod_insert ~> setprod.insert
  1244     setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
  1245     setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
  1246     setprod_mono_one_left ~> setprod.mono_neutral_left
  1247     setprod_mono_one_right ~> setprod.mono_neutral_right
  1248     setprod_reindex ~> setprod.reindex
  1249     setprod_reindex_cong ~> setprod.reindex_cong
  1250     setprod_reindex_nonzero ~> setprod.reindex_nontrivial
  1251     setprod_Sigma ~> setprod.Sigma
  1252     setprod_subset_diff ~> setprod.subset_diff
  1253     setprod_timesf ~> setprod.distrib
  1254     setprod_Un2 ~> setprod.union_diff2
  1255     setprod_Un_disjoint ~> setprod.union_disjoint
  1256     setprod_UN_disjoint ~> setprod.UNION_disjoint
  1257     setprod_Un_Int ~> setprod.union_inter
  1258     setprod_Union_disjoint ~> setprod.Union_disjoint
  1259     setprod_Un_one ~> setprod.union_inter_neutral
  1260 
  1261   Dropped setsum_cong2 (simple variant of setsum.cong).
  1262   Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
  1263   Dropped setsum_reindex_id, setprod_reindex_id
  1264     (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
  1265 
  1266 INCOMPATIBILITY.
  1267 
  1268 * Abolished slightly odd global lattice interpretation for min/max.
  1269 
  1270   Fact consolidations:
  1271     min_max.inf_assoc ~> min.assoc
  1272     min_max.inf_commute ~> min.commute
  1273     min_max.inf_left_commute ~> min.left_commute
  1274     min_max.inf_idem ~> min.idem
  1275     min_max.inf_left_idem ~> min.left_idem
  1276     min_max.inf_right_idem ~> min.right_idem
  1277     min_max.sup_assoc ~> max.assoc
  1278     min_max.sup_commute ~> max.commute
  1279     min_max.sup_left_commute ~> max.left_commute
  1280     min_max.sup_idem ~> max.idem
  1281     min_max.sup_left_idem ~> max.left_idem
  1282     min_max.sup_inf_distrib1 ~> max_min_distrib2
  1283     min_max.sup_inf_distrib2 ~> max_min_distrib1
  1284     min_max.inf_sup_distrib1 ~> min_max_distrib2
  1285     min_max.inf_sup_distrib2 ~> min_max_distrib1
  1286     min_max.distrib ~> min_max_distribs
  1287     min_max.inf_absorb1 ~> min.absorb1
  1288     min_max.inf_absorb2 ~> min.absorb2
  1289     min_max.sup_absorb1 ~> max.absorb1
  1290     min_max.sup_absorb2 ~> max.absorb2
  1291     min_max.le_iff_inf ~> min.absorb_iff1
  1292     min_max.le_iff_sup ~> max.absorb_iff2
  1293     min_max.inf_le1 ~> min.cobounded1
  1294     min_max.inf_le2 ~> min.cobounded2
  1295     le_maxI1, min_max.sup_ge1 ~> max.cobounded1
  1296     le_maxI2, min_max.sup_ge2 ~> max.cobounded2
  1297     min_max.le_infI1 ~> min.coboundedI1
  1298     min_max.le_infI2 ~> min.coboundedI2
  1299     min_max.le_supI1 ~> max.coboundedI1
  1300     min_max.le_supI2 ~> max.coboundedI2
  1301     min_max.less_infI1 ~> min.strict_coboundedI1
  1302     min_max.less_infI2 ~> min.strict_coboundedI2
  1303     min_max.less_supI1 ~> max.strict_coboundedI1
  1304     min_max.less_supI2 ~> max.strict_coboundedI2
  1305     min_max.inf_mono ~> min.mono
  1306     min_max.sup_mono ~> max.mono
  1307     min_max.le_infI, min_max.inf_greatest ~> min.boundedI
  1308     min_max.le_supI, min_max.sup_least ~> max.boundedI
  1309     min_max.le_inf_iff ~> min.bounded_iff
  1310     min_max.le_sup_iff ~> max.bounded_iff
  1311 
  1312 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
  1313 min.left_commute, min.left_idem, max.commute, max.assoc,
  1314 max.left_commute, max.left_idem directly.
  1315 
  1316 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
  1317 min.cobounded2, max.cobounded1m max.cobounded2 directly.
  1318 
  1319 For min_ac or max_ac, prefer more general collection ac_simps.
  1320 
  1321 INCOMPATIBILITY.
  1322 
  1323 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
  1324 Inf_fin_le_Sup_fin.  INCOMPATIBILITY.
  1325 
  1326 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
  1327 INCOMPATIBILITY.
  1328 
  1329 * Fact generalization and consolidation:
  1330     neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
  1331 
  1332 INCOMPATIBILITY.
  1333 
  1334 * Purely algebraic definition of even.  Fact generalization and
  1335   consolidation:
  1336     nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
  1337     even_zero_(nat|int) ~> even_zero
  1338 
  1339 INCOMPATIBILITY.
  1340 
  1341 * Abolished neg_numeral.
  1342   - Canonical representation for minus one is "- 1".
  1343   - Canonical representation for other negative numbers is "- (numeral _)".
  1344   - When devising rule sets for number calculation, consider the
  1345     following canonical cases: 0, 1, numeral _, - 1, - numeral _.
  1346   - HOLogic.dest_number also recognizes numerals in non-canonical forms
  1347     like "numeral One", "- numeral One", "- 0" and even "- ... - _".
  1348   - Syntax for negative numerals is mere input syntax.
  1349 
  1350 INCOMPATIBILITY.
  1351 
  1352 * Reduced name variants for rules on associativity and commutativity:
  1353 
  1354     add_assoc ~> add.assoc
  1355     add_commute ~> add.commute
  1356     add_left_commute ~> add.left_commute
  1357     mult_assoc ~> mult.assoc
  1358     mult_commute ~> mult.commute
  1359     mult_left_commute ~> mult.left_commute
  1360     nat_add_assoc ~> add.assoc
  1361     nat_add_commute ~> add.commute
  1362     nat_add_left_commute ~> add.left_commute
  1363     nat_mult_assoc ~> mult.assoc
  1364     nat_mult_commute ~> mult.commute
  1365     eq_assoc ~> iff_assoc
  1366     eq_left_commute ~> iff_left_commute
  1367 
  1368 INCOMPATIBILITY.
  1369 
  1370 * Fact collections add_ac and mult_ac are considered old-fashioned.
  1371 Prefer ac_simps instead, or specify rules
  1372 (add|mult).(assoc|commute|left_commute) individually.
  1373 
  1374 * Elimination of fact duplicates:
  1375     equals_zero_I ~> minus_unique
  1376     diff_eq_0_iff_eq ~> right_minus_eq
  1377     nat_infinite ~> infinite_UNIV_nat
  1378     int_infinite ~> infinite_UNIV_int
  1379 
  1380 INCOMPATIBILITY.
  1381 
  1382 * Fact name consolidation:
  1383     diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
  1384     minus_le_self_iff ~> neg_less_eq_nonneg
  1385     le_minus_self_iff ~> less_eq_neg_nonpos
  1386     neg_less_nonneg ~> neg_less_pos
  1387     less_minus_self_iff ~> less_neg_neg [simp]
  1388 
  1389 INCOMPATIBILITY.
  1390 
  1391 * More simplification rules on unary and binary minus:
  1392 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
  1393 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
  1394 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
  1395 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
  1396 minus_add_cancel, uminus_add_conv_diff.  These correspondingly have
  1397 been taken away from fact collections algebra_simps and field_simps.
  1398 INCOMPATIBILITY.
  1399 
  1400 To restore proofs, the following patterns are helpful:
  1401 
  1402 a) Arbitrary failing proof not involving "diff_def":
  1403 Consider simplification with algebra_simps or field_simps.
  1404 
  1405 b) Lifting rules from addition to subtraction:
  1406 Try with "using <rule for addition> of [... "- _" ...]" by simp".
  1407 
  1408 c) Simplification with "diff_def": just drop "diff_def".
  1409 Consider simplification with algebra_simps or field_simps;
  1410 or the brute way with
  1411 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
  1412 
  1413 * Introduce bdd_above and bdd_below in theory
  1414 Conditionally_Complete_Lattices, use them instead of explicitly
  1415 stating boundedness of sets.
  1416 
  1417 * ccpo.admissible quantifies only over non-empty chains to allow more
  1418 syntax-directed proof rules; the case of the empty chain shows up as
  1419 additional case in fixpoint induction proofs.  INCOMPATIBILITY.
  1420 
  1421 * Removed and renamed theorems in Series:
  1422   summable_le         ~>  suminf_le
  1423   suminf_le           ~>  suminf_le_const
  1424   series_pos_le       ~>  setsum_le_suminf
  1425   series_pos_less     ~>  setsum_less_suminf
  1426   suminf_ge_zero      ~>  suminf_nonneg
  1427   suminf_gt_zero      ~>  suminf_pos
  1428   suminf_gt_zero_iff  ~>  suminf_pos_iff
  1429   summable_sumr_LIMSEQ_suminf  ~>  summable_LIMSEQ
  1430   suminf_0_le         ~>  suminf_nonneg [rotate]
  1431   pos_summable        ~>  summableI_nonneg_bounded
  1432   ratio_test          ~>  summable_ratio_test
  1433 
  1434   removed series_zero, replaced by sums_finite
  1435 
  1436   removed auxiliary lemmas:
  1437 
  1438     sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
  1439     half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
  1440     real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
  1441     sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
  1442     summable_convergent_sumr_iff, sumr_diff_mult_const
  1443 
  1444 INCOMPATIBILITY.
  1445 
  1446 * Replace (F)DERIV syntax by has_derivative:
  1447   - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
  1448 
  1449   - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
  1450 
  1451   - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
  1452 
  1453   - removed constant isDiff
  1454 
  1455   - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
  1456     input syntax.
  1457 
  1458   - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
  1459 
  1460   - Renamed FDERIV_... lemmas to has_derivative_...
  1461 
  1462   - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
  1463 
  1464   - removed DERIV_intros, has_derivative_eq_intros
  1465 
  1466   - introduced derivative_intros and deriative_eq_intros which
  1467     includes now rules for DERIV, has_derivative and
  1468     has_vector_derivative.
  1469 
  1470   - Other renamings:
  1471     differentiable_def        ~>  real_differentiable_def
  1472     differentiableE           ~>  real_differentiableE
  1473     fderiv_def                ~>  has_derivative_at
  1474     field_fderiv_def          ~>  field_has_derivative_at
  1475     isDiff_der                ~>  differentiable_def
  1476     deriv_fderiv              ~>  has_field_derivative_def
  1477     deriv_def                 ~>  DERIV_def
  1478 
  1479 INCOMPATIBILITY.
  1480 
  1481 * Include more theorems in continuous_intros. Remove the
  1482 continuous_on_intros, isCont_intros collections, these facts are now
  1483 in continuous_intros.
  1484 
  1485 * Theorems about complex numbers are now stated only using Re and Im,
  1486 the Complex constructor is not used anymore. It is possible to use
  1487 primcorec to defined the behaviour of a complex-valued function.
  1488 
  1489 Removed theorems about the Complex constructor from the simpset, they
  1490 are available as the lemma collection legacy_Complex_simps. This
  1491 especially removes
  1492 
  1493     i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
  1494 
  1495 Instead the reverse direction is supported with
  1496     Complex_eq: "Complex a b = a + \<i> * b"
  1497 
  1498 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
  1499 
  1500   Renamings:
  1501     Re/Im                  ~>  complex.sel
  1502     complex_Re/Im_zero     ~>  zero_complex.sel
  1503     complex_Re/Im_add      ~>  plus_complex.sel
  1504     complex_Re/Im_minus    ~>  uminus_complex.sel
  1505     complex_Re/Im_diff     ~>  minus_complex.sel
  1506     complex_Re/Im_one      ~>  one_complex.sel
  1507     complex_Re/Im_mult     ~>  times_complex.sel
  1508     complex_Re/Im_inverse  ~>  inverse_complex.sel
  1509     complex_Re/Im_scaleR   ~>  scaleR_complex.sel
  1510     complex_Re/Im_i        ~>  ii.sel
  1511     complex_Re/Im_cnj      ~>  cnj.sel
  1512     Re/Im_cis              ~>  cis.sel
  1513 
  1514     complex_divide_def   ~>  divide_complex_def
  1515     complex_norm_def     ~>  norm_complex_def
  1516     cmod_def             ~>  norm_complex_de
  1517 
  1518   Removed theorems:
  1519     complex_zero_def
  1520     complex_add_def
  1521     complex_minus_def
  1522     complex_diff_def
  1523     complex_one_def
  1524     complex_mult_def
  1525     complex_inverse_def
  1526     complex_scaleR_def
  1527 
  1528 INCOMPATIBILITY.
  1529 
  1530 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
  1531 Conditionally_Complete_Lattices.  INCOMPATIBILITY.
  1532 
  1533 * HOL-Library: new theory src/HOL/Library/Tree.thy.
  1534 
  1535 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
  1536 is subsumed by session Kleene_Algebra in AFP.
  1537 
  1538 * HOL-Library / theory RBT: various constants and facts are hidden;
  1539 lifting setup is unregistered.  INCOMPATIBILITY.
  1540 
  1541 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
  1542 
  1543 * HOL-Word: bit representations prefer type bool over type bit.
  1544 INCOMPATIBILITY.
  1545 
  1546 * HOL-Word:
  1547   - Abandoned fact collection "word_arith_alts", which is a duplicate
  1548     of "word_arith_wis".
  1549   - Dropped first (duplicated) element in fact collections
  1550     "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
  1551     "uint_word_arith_bintrs".
  1552 
  1553 * HOL-Number_Theory:
  1554   - consolidated the proofs of the binomial theorem
  1555   - the function fib is again of type nat => nat and not overloaded
  1556   - no more references to Old_Number_Theory in the HOL libraries
  1557     (except the AFP)
  1558 
  1559 INCOMPATIBILITY.
  1560 
  1561 * HOL-Multivariate_Analysis:
  1562   - Type class ordered_real_vector for ordered vector spaces.
  1563   - New theory Complex_Basic_Analysis defining complex derivatives,
  1564     holomorphic functions, etc., ported from HOL Light's canal.ml.
  1565   - Changed order of ordered_euclidean_space to be compatible with
  1566     pointwise ordering on products. Therefore instance of
  1567     conditionally_complete_lattice and ordered_real_vector.
  1568     INCOMPATIBILITY: use box instead of greaterThanLessThan or
  1569     explicit set-comprehensions with eucl_less for other (half-)open
  1570     intervals.
  1571   - removed dependencies on type class ordered_euclidean_space with
  1572     introduction of "cbox" on euclidean_space
  1573     - renamed theorems:
  1574         interval ~> box
  1575         mem_interval ~> mem_box
  1576         interval_eq_empty ~> box_eq_empty
  1577         interval_ne_empty ~> box_ne_empty
  1578         interval_sing(1) ~> cbox_sing
  1579         interval_sing(2) ~> box_sing
  1580         subset_interval_imp ~> subset_box_imp
  1581         subset_interval ~> subset_box
  1582         open_interval ~> open_box
  1583         closed_interval ~> closed_cbox
  1584         interior_closed_interval ~> interior_cbox
  1585         bounded_closed_interval ~> bounded_cbox
  1586         compact_interval ~> compact_cbox
  1587         bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
  1588         bounded_subset_closed_interval ~> bounded_subset_cbox
  1589         mem_interval_componentwiseI ~> mem_box_componentwiseI
  1590         convex_box ~> convex_prod
  1591         rel_interior_real_interval ~> rel_interior_real_box
  1592         convex_interval ~> convex_box
  1593         convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
  1594         frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
  1595         content_closed_interval' ~> content_cbox'
  1596         elementary_subset_interval ~> elementary_subset_box
  1597         diameter_closed_interval ~> diameter_cbox
  1598         frontier_closed_interval ~> frontier_cbox
  1599         frontier_open_interval ~> frontier_box
  1600         bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
  1601         closure_open_interval ~> closure_box
  1602         open_closed_interval_convex ~> open_cbox_convex
  1603         open_interval_midpoint ~> box_midpoint
  1604         content_image_affinity_interval ~> content_image_affinity_cbox
  1605         is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
  1606         bounded_interval ~> bounded_closed_interval + bounded_boxes
  1607 
  1608     - respective theorems for intervals over the reals:
  1609         content_closed_interval + content_cbox
  1610         has_integral + has_integral_real
  1611         fine_division_exists + fine_division_exists_real
  1612         has_integral_null + has_integral_null_real
  1613         tagged_division_union_interval + tagged_division_union_interval_real
  1614         has_integral_const + has_integral_const_real
  1615         integral_const + integral_const_real
  1616         has_integral_bound + has_integral_bound_real
  1617         integrable_continuous + integrable_continuous_real
  1618         integrable_subinterval + integrable_subinterval_real
  1619         has_integral_reflect_lemma + has_integral_reflect_lemma_real
  1620         integrable_reflect + integrable_reflect_real
  1621         integral_reflect + integral_reflect_real
  1622         image_affinity_interval + image_affinity_cbox
  1623         image_smult_interval + image_smult_cbox
  1624         integrable_const + integrable_const_ivl
  1625         integrable_on_subinterval + integrable_on_subcbox
  1626 
  1627   - renamed theorems:
  1628     derivative_linear         ~>  has_derivative_bounded_linear
  1629     derivative_is_linear      ~>  has_derivative_linear
  1630     bounded_linear_imp_linear ~>  bounded_linear.linear
  1631 
  1632 * HOL-Probability:
  1633   - Renamed positive_integral to nn_integral:
  1634 
  1635     . Renamed all lemmas "*positive_integral*" to *nn_integral*"
  1636       positive_integral_positive ~> nn_integral_nonneg
  1637 
  1638     . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
  1639 
  1640   - replaced the Lebesgue integral on real numbers by the more general
  1641     Bochner integral for functions into a real-normed vector space.
  1642 
  1643     integral_zero               ~>  integral_zero / integrable_zero
  1644     integral_minus              ~>  integral_minus / integrable_minus
  1645     integral_add                ~>  integral_add / integrable_add
  1646     integral_diff               ~>  integral_diff / integrable_diff
  1647     integral_setsum             ~>  integral_setsum / integrable_setsum
  1648     integral_multc              ~>  integral_mult_left / integrable_mult_left
  1649     integral_cmult              ~>  integral_mult_right / integrable_mult_right
  1650     integral_triangle_inequality~>  integral_norm_bound
  1651     integrable_nonneg           ~>  integrableI_nonneg
  1652     integral_positive           ~>  integral_nonneg_AE
  1653     integrable_abs_iff          ~>  integrable_abs_cancel
  1654     positive_integral_lim_INF   ~>  nn_integral_liminf
  1655     lebesgue_real_affine        ~>  lborel_real_affine
  1656     borel_integral_has_integral ~>  has_integral_lebesgue_integral
  1657     integral_indicator          ~>
  1658          integral_real_indicator / integrable_real_indicator
  1659     positive_integral_fst       ~>  nn_integral_fst'
  1660     positive_integral_fst_measurable ~> nn_integral_fst
  1661     positive_integral_snd_measurable ~> nn_integral_snd
  1662 
  1663     integrable_fst_measurable   ~>
  1664          integral_fst / integrable_fst / AE_integrable_fst
  1665 
  1666     integrable_snd_measurable   ~>
  1667          integral_snd / integrable_snd / AE_integrable_snd
  1668 
  1669     integral_monotone_convergence  ~>
  1670          integral_monotone_convergence / integrable_monotone_convergence
  1671 
  1672     integral_monotone_convergence_at_top  ~>
  1673          integral_monotone_convergence_at_top /
  1674          integrable_monotone_convergence_at_top
  1675 
  1676     has_integral_iff_positive_integral_lebesgue  ~>
  1677          has_integral_iff_has_bochner_integral_lebesgue_nonneg
  1678 
  1679     lebesgue_integral_has_integral  ~>
  1680          has_integral_integrable_lebesgue_nonneg
  1681 
  1682     positive_integral_lebesgue_has_integral  ~>
  1683          integral_has_integral_lebesgue_nonneg /
  1684          integrable_has_integral_lebesgue_nonneg
  1685 
  1686     lebesgue_integral_real_affine  ~>
  1687          nn_integral_real_affine
  1688 
  1689     has_integral_iff_positive_integral_lborel  ~>
  1690          integral_has_integral_nonneg / integrable_has_integral_nonneg
  1691 
  1692     The following theorems where removed:
  1693 
  1694     lebesgue_integral_nonneg
  1695     lebesgue_integral_uminus
  1696     lebesgue_integral_cmult
  1697     lebesgue_integral_multc
  1698     lebesgue_integral_cmult_nonneg
  1699     integral_cmul_indicator
  1700     integral_real
  1701 
  1702   - Formalized properties about exponentially, Erlang, and normal
  1703     distributed random variables.
  1704 
  1705 * HOL-Decision_Procs: Separate command 'approximate' for approximative
  1706 computation in src/HOL/Decision_Procs/Approximation.  Minor
  1707 INCOMPATIBILITY.
  1708 
  1709 
  1710 *** Scala ***
  1711 
  1712 * The signature and semantics of Document.Snapshot.cumulate_markup /
  1713 select_markup have been clarified.  Markup is now traversed in the
  1714 order of reports given by the prover: later markup is usually more
  1715 specific and may override results accumulated so far.  The elements
  1716 guard is mandatory and checked precisely.  Subtle INCOMPATIBILITY.
  1717 
  1718 * Substantial reworking of internal PIDE protocol communication
  1719 channels.  INCOMPATIBILITY.
  1720 
  1721 
  1722 *** ML ***
  1723 
  1724 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
  1725 compared (according to Thm.thm_ord), but assumed to be covered by the
  1726 current background theory.  Thus equivalent data produced in different
  1727 branches of the theory graph usually coincides (e.g. relevant for
  1728 theory merge).  Note that the softer Thm.eq_thm_prop is often more
  1729 appropriate than Thm.eq_thm.
  1730 
  1731 * Proper context for basic Simplifier operations: rewrite_rule,
  1732 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
  1733 pass runtime Proof.context (and ensure that the simplified entity
  1734 actually belongs to it).
  1735 
  1736 * Proper context discipline for read_instantiate and instantiate_tac:
  1737 variables that are meant to become schematic need to be given as
  1738 fixed, and are generalized by the explicit context of local variables.
  1739 This corresponds to Isar attributes "where" and "of" with 'for'
  1740 declaration.  INCOMPATIBILITY, also due to potential change of indices
  1741 of schematic variables.
  1742 
  1743 * Moved ML_Compiler.exn_trace and other operations on exceptions to
  1744 structure Runtime.  Minor INCOMPATIBILITY.
  1745 
  1746 * Discontinued old Toplevel.debug in favour of system option
  1747 "ML_exception_trace", which may be also declared within the context
  1748 via "declare [[ML_exception_trace = true]]".  Minor INCOMPATIBILITY.
  1749 
  1750 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
  1751 INCOMPATIBILITY.
  1752 
  1753 * Configuration option "ML_print_depth" controls the pretty-printing
  1754 depth of the ML compiler within the context.  The old print_depth in
  1755 ML is still available as default_print_depth, but rarely used.  Minor
  1756 INCOMPATIBILITY.
  1757 
  1758 * Toplevel function "use" refers to raw ML bootstrap environment,
  1759 without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
  1760 Note that 'ML_file' is the canonical command to load ML files into the
  1761 formal context.
  1762 
  1763 * Simplified programming interface to define ML antiquotations, see
  1764 structure ML_Antiquotation.  Minor INCOMPATIBILITY.
  1765 
  1766 * ML antiquotation @{here} refers to its source position, which is
  1767 occasionally useful for experimentation and diagnostic purposes.
  1768 
  1769 * ML antiquotation @{path} produces a Path.T value, similarly to
  1770 Path.explode, but with compile-time check against the file-system and
  1771 some PIDE markup.  Note that unlike theory source, ML does not have a
  1772 well-defined master directory, so an absolute symbolic path
  1773 specification is usually required, e.g. "~~/src/HOL".
  1774 
  1775 * ML antiquotation @{print} inlines a function to print an arbitrary
  1776 ML value, which is occasionally useful for diagnostic or demonstration
  1777 purposes.
  1778 
  1779 
  1780 *** System ***
  1781 
  1782 * Proof General with its traditional helper scripts is now an optional
  1783 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
  1784 component repository http://isabelle.in.tum.de/components/.  Note that
  1785 the "system" manual provides general explanations about add-on
  1786 components, especially those that are not bundled with the release.
  1787 
  1788 * The raw Isabelle process executable has been renamed from
  1789 "isabelle-process" to "isabelle_process", which conforms to common
  1790 shell naming conventions, and allows to define a shell function within
  1791 the Isabelle environment to avoid dynamic path lookup.  Rare
  1792 incompatibility for old tools that do not use the ISABELLE_PROCESS
  1793 settings variable.
  1794 
  1795 * Former "isabelle tty" has been superseded by "isabelle console",
  1796 with implicit build like "isabelle jedit", and without the mostly
  1797 obsolete Isar TTY loop.
  1798 
  1799 * Simplified "isabelle display" tool.  Settings variables DVI_VIEWER
  1800 and PDF_VIEWER now refer to the actual programs, not shell
  1801 command-lines.  Discontinued option -c: invocation may be asynchronous
  1802 via desktop environment, without any special precautions.  Potential
  1803 INCOMPATIBILITY with ambitious private settings.
  1804 
  1805 * Removed obsolete "isabelle unsymbolize".  Note that the usual format
  1806 for email communication is the Unicode rendering of Isabelle symbols,
  1807 as produced by Isabelle/jEdit, for example.
  1808 
  1809 * Removed obsolete tool "wwwfind". Similar functionality may be
  1810 integrated into Isabelle/jEdit eventually.
  1811 
  1812 * Improved 'display_drafts' concerning desktop integration and
  1813 repeated invocation in PIDE front-end: re-use single file
  1814 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
  1815 
  1816 * Session ROOT specifications require explicit 'document_files' for
  1817 robust dependencies on LaTeX sources.  Only these explicitly given
  1818 files are copied to the document output directory, before document
  1819 processing is started.
  1820 
  1821 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
  1822 of TeX Live from Cygwin.
  1823 
  1824 
  1825 
  1826 New in Isabelle2013-2 (December 2013)
  1827 -------------------------------------
  1828 
  1829 *** Prover IDE -- Isabelle/Scala/jEdit ***
  1830 
  1831 * More robust editing of running commands with internal forks,
  1832 e.g. non-terminating 'by' steps.
  1833 
  1834 * More relaxed Sledgehammer panel: avoid repeated application of query
  1835 after edits surrounding the command location.
  1836 
  1837 * More status information about commands that are interrupted
  1838 accidentally (via physical event or Poly/ML runtime system signal,
  1839 e.g. out-of-memory).
  1840 
  1841 
  1842 *** System ***
  1843 
  1844 * More robust termination of external processes managed by
  1845 Isabelle/ML: support cancellation of tasks within the range of
  1846 milliseconds, as required for PIDE document editing with automatically
  1847 tried tools (e.g. Sledgehammer).
  1848 
  1849 * Reactivated Isabelle/Scala kill command for external processes on
  1850 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
  1851 workaround for some Debian/Ubuntu Linux versions from 2013.
  1852 
  1853 
  1854 
  1855 New in Isabelle2013-1 (November 2013)
  1856 -------------------------------------
  1857 
  1858 *** General ***
  1859 
  1860 * Discontinued obsolete 'uses' within theory header.  Note that
  1861 commands like 'ML_file' work without separate declaration of file
  1862 dependencies.  Minor INCOMPATIBILITY.
  1863 
  1864 * Discontinued redundant 'use' command, which was superseded by
  1865 'ML_file' in Isabelle2013.  Minor INCOMPATIBILITY.
  1866 
  1867 * Simplified subscripts within identifiers, using plain \<^sub>
  1868 instead of the second copy \<^isub> and \<^isup>.  Superscripts are
  1869 only for literal tokens within notation; explicit mixfix annotations
  1870 for consts or fixed variables may be used as fall-back for unusual
  1871 names.  Obsolete \<twosuperior> has been expanded to \<^sup>2 in
  1872 Isabelle/HOL.  INCOMPATIBILITY, use "isabelle update_sub_sup" to
  1873 standardize symbols as a starting point for further manual cleanup.
  1874 The ML reference variable "legacy_isub_isup" may be set as temporary
  1875 workaround, to make the prover accept a subset of the old identifier
  1876 syntax.
  1877 
  1878 * Document antiquotations: term style "isub" has been renamed to
  1879 "sub".  Minor INCOMPATIBILITY.
  1880 
  1881 * Uniform management of "quick_and_dirty" as system option (see also
  1882 "isabelle options"), configuration option within the context (see also
  1883 Config.get in Isabelle/ML), and attribute in Isabelle/Isar.  Minor
  1884 INCOMPATIBILITY, need to use more official Isabelle means to access
  1885 quick_and_dirty, instead of historical poking into mutable reference.
  1886 
  1887 * Renamed command 'print_configs' to 'print_options'.  Minor
  1888 INCOMPATIBILITY.
  1889 
  1890 * Proper diagnostic command 'print_state'.  Old 'pr' (with its
  1891 implicit change of some global references) is retained for now as
  1892 control command, e.g. for ProofGeneral 3.7.x.
  1893 
  1894 * Discontinued 'print_drafts' command with its old-fashioned PS output
  1895 and Unix command-line print spooling.  Minor INCOMPATIBILITY: use
  1896 'display_drafts' instead and print via the regular document viewer.
  1897 
  1898 * Updated and extended "isar-ref" and "implementation" manual,
  1899 eliminated old "ref" manual.
  1900 
  1901 
  1902 *** Prover IDE -- Isabelle/Scala/jEdit ***
  1903 
  1904 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
  1905 Documentation panel.
  1906 
  1907 * Dockable window "Documentation" provides access to Isabelle
  1908 documentation.
  1909 
  1910 * Dockable window "Find" provides query operations for formal entities
  1911 (GUI front-end to 'find_theorems' command).
  1912 
  1913 * Dockable window "Sledgehammer" manages asynchronous / parallel
  1914 sledgehammer runs over existing document sources, independently of
  1915 normal editing and checking process.
  1916 
  1917 * Dockable window "Timing" provides an overview of relevant command
  1918 timing information, depending on option jedit_timing_threshold.  The
  1919 same timing information is shown in the extended tooltip of the
  1920 command keyword, when hovering the mouse over it while the CONTROL or
  1921 COMMAND modifier is pressed.
  1922 
  1923 * Improved dockable window "Theories": Continuous checking of proof
  1924 document (visible and required parts) may be controlled explicitly,
  1925 using check box or shortcut "C+e ENTER".  Individual theory nodes may
  1926 be marked explicitly as required and checked in full, using check box
  1927 or shortcut "C+e SPACE".
  1928 
  1929 * Improved completion mechanism, which is now managed by the
  1930 Isabelle/jEdit plugin instead of SideKick.  Refined table of Isabelle
  1931 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
  1932 
  1933 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
  1934 isabelle.complete for explicit completion in Isabelle sources.
  1935 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
  1936 to resolve conflict.
  1937 
  1938 * Improved support of various "minor modes" for Isabelle NEWS,
  1939 options, session ROOT etc., with completion and SideKick tree view.
  1940 
  1941 * Strictly monotonic document update, without premature cancellation of
  1942 running transactions that are still needed: avoid reset/restart of
  1943 such command executions while editing.
  1944 
  1945 * Support for asynchronous print functions, as overlay to existing
  1946 document content.
  1947 
  1948 * Support for automatic tools in HOL, which try to prove or disprove
  1949 toplevel theorem statements.
  1950 
  1951 * Action isabelle.reset-font-size resets main text area font size
  1952 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
  1953 also "Plugin Options / Isabelle / General").  It can be bound to some
  1954 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
  1955 
  1956 * File specifications in jEdit (e.g. file browser) may refer to
  1957 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms.  Discontinued
  1958 obsolete $ISABELLE_HOME_WINDOWS variable.
  1959 
  1960 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
  1961 / Global Options / Appearance".
  1962 
  1963 * Improved support of native Mac OS X functionality via "MacOSX"
  1964 plugin, which is now enabled by default.
  1965 
  1966 
  1967 *** Pure ***
  1968 
  1969 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
  1970 In particular, 'interpretation' allows for non-persistent
  1971 interpretation within "context ... begin ... end" blocks offering a
  1972 light-weight alternative to 'sublocale'.  See "isar-ref" manual for
  1973 details.
  1974 
  1975 * Improved locales diagnostic command 'print_dependencies'.
  1976 
  1977 * Discontinued obsolete 'axioms' command, which has been marked as
  1978 legacy since Isabelle2009-2.  INCOMPATIBILITY, use 'axiomatization'
  1979 instead, while observing its uniform scope for polymorphism.
  1980 
  1981 * Discontinued empty name bindings in 'axiomatization'.
  1982 INCOMPATIBILITY.
  1983 
  1984 * System option "proofs" has been discontinued.  Instead the global
  1985 state of Proofterm.proofs is persistently compiled into logic images
  1986 as required, notably HOL-Proofs.  Users no longer need to change
  1987 Proofterm.proofs dynamically.  Minor INCOMPATIBILITY.
  1988 
  1989 * Syntax translation functions (print_translation etc.) always depend
  1990 on Proof.context.  Discontinued former "(advanced)" option -- this is
  1991 now the default.  Minor INCOMPATIBILITY.
  1992 
  1993 * Former global reference trace_unify_fail is now available as
  1994 configuration option "unify_trace_failure" (global context only).
  1995 
  1996 * SELECT_GOAL now retains the syntactic context of the overall goal
  1997 state (schematic variables etc.).  Potential INCOMPATIBILITY in rare
  1998 situations.
  1999 
  2000 
  2001 *** HOL ***
  2002 
  2003 * Stronger precedence of syntax for big intersection and union on
  2004 sets, in accordance with corresponding lattice operations.
  2005 INCOMPATIBILITY.
  2006 
  2007 * Notation "{p:A. P}" now allows tuple patterns as well.
  2008 
  2009 * Nested case expressions are now translated in a separate check phase
  2010 rather than during parsing. The data for case combinators is separated
  2011 from the datatype package. The declaration attribute
  2012 "case_translation" can be used to register new case combinators:
  2013 
  2014   declare [[case_translation case_combinator constructor1 ... constructorN]]
  2015 
  2016 * Code generator:
  2017   - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
  2018     'code_instance'.
  2019   - 'code_identifier' declares name hints for arbitrary identifiers in
  2020     generated code, subsuming 'code_modulename'.
  2021 
  2022 See the isar-ref manual for syntax diagrams, and the HOL theories for
  2023 examples.
  2024 
  2025 * Attibute 'code': 'code' now declares concrete and abstract code
  2026 equations uniformly.  Use explicit 'code equation' and 'code abstract'
  2027 to distinguish both when desired.
  2028 
  2029 * Discontinued theories Code_Integer and Efficient_Nat by a more
  2030 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
  2031 Code_Target_Nat and Code_Target_Numeral.  See the tutorial on code
  2032 generation for details.  INCOMPATIBILITY.
  2033 
  2034 * Numeric types are mapped by default to target language numerals:
  2035 natural (replaces former code_numeral) and integer (replaces former
  2036 code_int).  Conversions are available as integer_of_natural /
  2037 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
  2038 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
  2039 ML).  INCOMPATIBILITY.
  2040 
  2041 * Function package: For mutually recursive functions f and g, separate
  2042 cases rules f.cases and g.cases are generated instead of unusable
  2043 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
  2044 in the case that the unusable rule was used nevertheless.
  2045 
  2046 * Function package: For each function f, new rules f.elims are
  2047 generated, which eliminate equalities of the form "f x = t".
  2048 
  2049 * New command 'fun_cases' derives ad-hoc elimination rules for
  2050 function equations as simplified instances of f.elims, analogous to
  2051 inductive_cases.  See ~~/src/HOL/ex/Fundefs.thy for some examples.
  2052 
  2053 * Lifting:
  2054   - parametrized correspondence relations are now supported:
  2055     + parametricity theorems for the raw term can be specified in
  2056       the command lift_definition, which allow us to generate stronger
  2057       transfer rules
  2058     + setup_lifting generates stronger transfer rules if parametric
  2059       correspondence relation can be generated
  2060     + various new properties of the relator must be specified to support
  2061       parametricity
  2062     + parametricity theorem for the Quotient relation can be specified
  2063   - setup_lifting generates domain rules for the Transfer package
  2064   - stronger reflexivity prover of respectfulness theorems for type
  2065     copies
  2066   - ===> and --> are now local. The symbols can be introduced
  2067     by interpreting the locale lifting_syntax (typically in an
  2068     anonymous context)
  2069   - Lifting/Transfer relevant parts of Library/Quotient_* are now in
  2070     Main. Potential INCOMPATIBILITY
  2071   - new commands for restoring and deleting Lifting/Transfer context:
  2072     lifting_forget, lifting_update
  2073   - the command print_quotmaps was renamed to print_quot_maps.
  2074     INCOMPATIBILITY
  2075 
  2076 * Transfer:
  2077   - better support for domains in Transfer: replace Domainp T
  2078     by the actual invariant in a transferred goal
  2079   - transfer rules can have as assumptions other transfer rules
  2080   - Experimental support for transferring from the raw level to the
  2081     abstract level: Transfer.transferred attribute
  2082   - Attribute version of the transfer method: untransferred attribute
  2083 
  2084 * Reification and reflection:
  2085   - Reification is now directly available in HOL-Main in structure
  2086     "Reification".
  2087   - Reflection now handles multiple lists with variables also.
  2088   - The whole reflection stack has been decomposed into conversions.
  2089 INCOMPATIBILITY.
  2090 
  2091 * Revised devices for recursive definitions over finite sets:
  2092   - Only one fundamental fold combinator on finite set remains:
  2093     Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
  2094     This is now identity on infinite sets.
  2095   - Locales ("mini packages") for fundamental definitions with
  2096     Finite_Set.fold: folding, folding_idem.
  2097   - Locales comm_monoid_set, semilattice_order_set and
  2098     semilattice_neutr_order_set for big operators on sets.
  2099     See theory Big_Operators for canonical examples.
  2100     Note that foundational constants comm_monoid_set.F and
  2101     semilattice_set.F correspond to former combinators fold_image
  2102     and fold1 respectively.  These are now gone.  You may use
  2103     those foundational constants as substitutes, but it is
  2104     preferable to interpret the above locales accordingly.
  2105   - Dropped class ab_semigroup_idem_mult (special case of lattice,
  2106     no longer needed in connection with Finite_Set.fold etc.)
  2107   - Fact renames:
  2108       card.union_inter ~> card_Un_Int [symmetric]
  2109       card.union_disjoint ~> card_Un_disjoint
  2110 INCOMPATIBILITY.
  2111 
  2112 * Locale hierarchy for abstract orderings and (semi)lattices.
  2113 
  2114 * Complete_Partial_Order.admissible is defined outside the type class
  2115 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
  2116 class predicate assumption or sort constraint when possible.
  2117 INCOMPATIBILITY.
  2118 
  2119 * Introduce type class "conditionally_complete_lattice": Like a
  2120 complete lattice but does not assume the existence of the top and
  2121 bottom elements.  Allows to generalize some lemmas about reals and
  2122 extended reals.  Removed SupInf and replaced it by the instantiation
  2123 of conditionally_complete_lattice for real. Renamed lemmas about
  2124 conditionally-complete lattice from Sup_... to cSup_... and from
  2125 Inf_...  to cInf_... to avoid hidding of similar complete lattice
  2126 lemmas.
  2127 
  2128 * Introduce type class linear_continuum as combination of
  2129 conditionally-complete lattices and inner dense linorders which have
  2130 more than one element.  INCOMPATIBILITY.
  2131 
  2132 * Introduced type classes order_top and order_bot. The old classes top
  2133 and bot only contain the syntax without assumptions.  INCOMPATIBILITY:
  2134 Rename bot -> order_bot, top -> order_top
  2135 
  2136 * Introduce type classes "no_top" and "no_bot" for orderings without
  2137 top and bottom elements.
  2138 
  2139 * Split dense_linorder into inner_dense_order and no_top, no_bot.
  2140 
  2141 * Complex_Main: Unify and move various concepts from
  2142 HOL-Multivariate_Analysis to HOL-Complex_Main.
  2143 
  2144  - Introduce type class (lin)order_topology and
  2145    linear_continuum_topology.  Allows to generalize theorems about
  2146    limits and order.  Instances are reals and extended reals.
  2147 
  2148  - continuous and continuos_on from Multivariate_Analysis:
  2149    "continuous" is the continuity of a function at a filter.  "isCont"
  2150    is now an abbrevitation: "isCont x f == continuous (at _) f".
  2151 
  2152    Generalized continuity lemmas from isCont to continuous on an
  2153    arbitrary filter.
  2154 
  2155  - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
  2156    compactness of closed intervals on reals. Continuous functions
  2157    attain infimum and supremum on compact sets. The inverse of a
  2158    continuous function is continuous, when the function is continuous
  2159    on a compact set.
  2160 
  2161  - connected from Multivariate_Analysis. Use it to prove the
  2162    intermediate value theorem. Show connectedness of intervals on
  2163    linear_continuum_topology).
  2164 
  2165  - first_countable_topology from Multivariate_Analysis. Is used to
  2166    show equivalence of properties on the neighbourhood filter of x and
  2167    on all sequences converging to x.
  2168 
  2169  - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
  2170    theorems from Library/FDERIV.thy to Deriv.thy and base the
  2171    definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
  2172    which are restricted to sets, i.e. to represent derivatives from
  2173    left or right.
  2174 
  2175  - Removed the within-filter. It is replaced by the principal filter:
  2176 
  2177      F within X = inf F (principal X)
  2178 
  2179  - Introduce "at x within U" as a single constant, "at x" is now an
  2180    abbreviation for "at x within UNIV"
  2181 
  2182  - Introduce named theorem collections tendsto_intros,
  2183    continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
  2184    in tendsto_intros (or FDERIV_intros) are also available as
  2185    tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
  2186    is replaced by a congruence rule. This allows to apply them as
  2187    intro rules and then proving equivalence by the simplifier.
  2188 
  2189  - Restructured theories in HOL-Complex_Main:
  2190 
  2191    + Moved RealDef and RComplete into Real
  2192 
  2193    + Introduced Topological_Spaces and moved theorems about
  2194      topological spaces, filters, limits and continuity to it
  2195 
  2196    + Renamed RealVector to Real_Vector_Spaces
  2197 
  2198    + Split Lim, SEQ, Series into Topological_Spaces,
  2199      Real_Vector_Spaces, and Limits
  2200 
  2201    + Moved Ln and Log to Transcendental
  2202 
  2203    + Moved theorems about continuity from Deriv to Topological_Spaces
  2204 
  2205  - Remove various auxiliary lemmas.
  2206 
  2207 INCOMPATIBILITY.
  2208 
  2209 * Nitpick:
  2210   - Added option "spy".
  2211   - Reduce incidence of "too high arity" errors.
  2212 
  2213 * Sledgehammer:
  2214   - Renamed option:
  2215       isar_shrink ~> isar_compress
  2216     INCOMPATIBILITY.
  2217   - Added options "isar_try0", "spy".
  2218   - Better support for "isar_proofs".
  2219   - MaSh has been fined-tuned and now runs as a local server.
  2220 
  2221 * Improved support for ad hoc overloading of constants (see also
  2222 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
  2223 
  2224 * Library/Polynomial.thy:
  2225   - Use lifting for primitive definitions.
  2226   - Explicit conversions from and to lists of coefficients, used for
  2227     generated code.
  2228   - Replaced recursion operator poly_rec by fold_coeffs.
  2229   - Prefer pre-existing gcd operation for gcd.
  2230   - Fact renames:
  2231     poly_eq_iff ~> poly_eq_poly_eq_iff
  2232     poly_ext ~> poly_eqI
  2233     expand_poly_eq ~> poly_eq_iff
  2234 IMCOMPATIBILITY.
  2235 
  2236 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
  2237 case_of_simps to convert function definitions between a list of
  2238 equations with patterns on the lhs and a single equation with case
  2239 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
  2240 
  2241 * New Library/FSet.thy: type of finite sets defined as a subtype of
  2242 sets defined by Lifting/Transfer.
  2243 
  2244 * Discontinued theory src/HOL/Library/Eval_Witness.  INCOMPATIBILITY.
  2245 
  2246 * Consolidation of library theories on product orders:
  2247 
  2248     Product_Lattice ~> Product_Order -- pointwise order on products
  2249     Product_ord ~> Product_Lexorder -- lexicographic order on products
  2250 
  2251 INCOMPATIBILITY.
  2252 
  2253 * Imperative-HOL: The MREC combinator is considered legacy and no
  2254 longer included by default. INCOMPATIBILITY, use partial_function
  2255 instead, or import theory Legacy_Mrec as a fallback.
  2256 
  2257 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
  2258 ~~/src/HOL/Algebra/poly.  Existing theories should be based on
  2259 ~~/src/HOL/Library/Polynomial instead.  The latter provides
  2260 integration with HOL's type classes for rings.  INCOMPATIBILITY.
  2261 
  2262 * HOL-BNF:
  2263   - Various improvements to BNF-based (co)datatype package, including
  2264     new commands "primrec_new", "primcorec", and
  2265     "datatype_new_compat", as well as documentation. See
  2266     "datatypes.pdf" for details.
  2267   - New "coinduction" method to avoid some boilerplate (compared to
  2268     coinduct).
  2269   - Renamed keywords:
  2270     data ~> datatype_new
  2271     codata ~> codatatype
  2272     bnf_def ~> bnf
  2273   - Renamed many generated theorems, including
  2274     discs ~> disc
  2275     map_comp' ~> map_comp
  2276     map_id' ~> map_id
  2277     sels ~> sel
  2278     set_map' ~> set_map
  2279     sets ~> set
  2280 IMCOMPATIBILITY.
  2281 
  2282 
  2283 *** ML ***
  2284 
  2285 * Spec_Check is a Quickcheck tool for Isabelle/ML.  The ML function
  2286 "check_property" allows to check specifications of the form "ALL x y
  2287 z. prop x y z".  See also ~~/src/Tools/Spec_Check/ with its
  2288 Examples.thy in particular.
  2289 
  2290 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
  2291 tracing output in the command transaction context instead of physical
  2292 stdout.  See also Toplevel.debug, Toplevel.debugging and
  2293 ML_Compiler.exn_trace.
  2294 
  2295 * ML type "theory" is now immutable, without any special treatment of
  2296 drafts or linear updates (which could lead to "stale theory" errors in
  2297 the past).  Discontinued obsolete operations like Theory.copy,
  2298 Theory.checkpoint, and the auxiliary type theory_ref.  Minor
  2299 INCOMPATIBILITY.
  2300 
  2301 * More uniform naming of goal functions for skipped proofs:
  2302 
  2303     Skip_Proof.prove  ~>  Goal.prove_sorry
  2304     Skip_Proof.prove_global  ~>  Goal.prove_sorry_global
  2305 
  2306 Minor INCOMPATIBILITY.
  2307 
  2308 * Simplifier tactics and tools use proper Proof.context instead of
  2309 historic type simpset.  Old-style declarations like addsimps,
  2310 addsimprocs etc. operate directly on Proof.context.  Raw type simpset
  2311 retains its use as snapshot of the main Simplifier context, using
  2312 simpset_of and put_simpset on Proof.context.  INCOMPATIBILITY -- port
  2313 old tools by making them depend on (ctxt : Proof.context) instead of
  2314 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
  2315 
  2316 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
  2317 operate on Proof.context instead of claset, for uniformity with addIs,
  2318 addEs, addDs etc. Note that claset_of and put_claset allow to manage
  2319 clasets separately from the context.
  2320 
  2321 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
  2322 INCOMPATIBILITY, use @{context} instead.
  2323 
  2324 * Antiquotation @{theory_context A} is similar to @{theory A}, but
  2325 presents the result as initial Proof.context.
  2326 
  2327 
  2328 *** System ***
  2329 
  2330 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
  2331 "isabelle build" in Isabelle2013.  INCOMPATIBILITY.
  2332 
  2333 * Discontinued obsolete isabelle-process options -f and -u (former
  2334 administrative aliases of option -e).  Minor INCOMPATIBILITY.
  2335 
  2336 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
  2337 settings variable.
  2338 
  2339 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
  2340 document formats: dvi.gz, ps, ps.gz -- the default document format is
  2341 always pdf.
  2342 
  2343 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
  2344 specify global resources of the JVM process run by isabelle build.
  2345 
  2346 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
  2347 to run Isabelle/Scala source files as standalone programs.
  2348 
  2349 * Improved "isabelle keywords" tool (for old-style ProofGeneral
  2350 keyword tables): use Isabelle/Scala operations, which inspect outer
  2351 syntax without requiring to build sessions first.
  2352 
  2353 * Sessions may be organized via 'chapter' specifications in the ROOT
  2354 file, which determines a two-level hierarchy of browser info.  The old
  2355 tree-like organization via implicit sub-session relation (with its
  2356 tendency towards erratic fluctuation of URLs) has been discontinued.
  2357 The default chapter is called "Unsorted".  Potential INCOMPATIBILITY
  2358 for HTML presentation of theories.
  2359 
  2360 
  2361 
  2362 New in Isabelle2013 (February 2013)
  2363 -----------------------------------
  2364 
  2365 *** General ***
  2366 
  2367 * Theorem status about oracles and unfinished/failed future proofs is
  2368 no longer printed by default, since it is incompatible with
  2369 incremental / parallel checking of the persistent document model.  ML
  2370 function Thm.peek_status may be used to inspect a snapshot of the
  2371 ongoing evaluation process.  Note that in batch mode --- notably
  2372 isabelle build --- the system ensures that future proofs of all
  2373 accessible theorems in the theory context are finished (as before).
  2374 
  2375 * Configuration option show_markup controls direct inlining of markup
  2376 into the printed representation of formal entities --- notably type
  2377 and sort constraints.  This enables Prover IDE users to retrieve that
  2378 information via tooltips in the output window, for example.
  2379 
  2380 * Command 'ML_file' evaluates ML text from a file directly within the
  2381 theory, without any predeclaration via 'uses' in the theory header.
  2382 
  2383 * Old command 'use' command and corresponding keyword 'uses' in the
  2384 theory header are legacy features and will be discontinued soon.
  2385 Tools that load their additional source files may imitate the
  2386 'ML_file' implementation, such that the system can take care of
  2387 dependencies properly.
  2388 
  2389 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
  2390 is called fastforce / fast_force_tac already since Isabelle2011-1.
  2391 
  2392 * Updated and extended "isar-ref" and "implementation" manual, reduced
  2393 remaining material in old "ref" manual.
  2394 
  2395 * Improved support for auxiliary contexts that indicate block structure
  2396 for specifications.  Nesting of "context fixes ... context assumes ..."
  2397 and "class ... context ...".
  2398 
  2399 * Attribute "consumes" allows a negative value as well, which is
  2400 interpreted relatively to the total number of premises of the rule in
  2401 the target context.  This form of declaration is stable when exported
  2402 from a nested 'context' with additional assumptions.  It is the
  2403 preferred form for definitional packages, notably cases/rules produced
  2404 in HOL/inductive and HOL/function.
  2405 
  2406 * More informative error messages for Isar proof commands involving
  2407 lazy enumerations (method applications etc.).
  2408 
  2409 * Refined 'help' command to retrieve outer syntax commands according
  2410 to name patterns (with clickable results).
  2411 
  2412 
  2413 *** Prover IDE -- Isabelle/Scala/jEdit ***
  2414 
  2415 * Parallel terminal proofs ('by') are enabled by default, likewise
  2416 proofs that are built into packages like 'datatype', 'function'.  This
  2417 allows to "run ahead" checking the theory specifications on the
  2418 surface, while the prover is still crunching on internal
  2419 justifications.  Unfinished / cancelled proofs are restarted as
  2420 required to complete full proof checking eventually.
  2421 
  2422 * Improved output panel with tooltips, hyperlinks etc. based on the
  2423 same Rich_Text_Area as regular Isabelle/jEdit buffers.  Activation of
  2424 tooltips leads to some window that supports the same recursively,
  2425 which can lead to stacks of tooltips as the semantic document content
  2426 is explored.  ESCAPE closes the whole stack, individual windows may be
  2427 closed separately, or detached to become independent jEdit dockables.
  2428 
  2429 * Improved support for commands that produce graph output: the text
  2430 message contains a clickable area to open a new instance of the graph
  2431 browser on demand.
  2432 
  2433 * More robust incremental parsing of outer syntax (partial comments,
  2434 malformed symbols).  Changing the balance of open/close quotes and
  2435 comment delimiters works more conveniently with unfinished situations
  2436 that frequently occur in user interaction.
  2437 
  2438 * More efficient painting and improved reactivity when editing large
  2439 files.  More scalable management of formal document content.
  2440 
  2441 * Smarter handling of tracing messages: prover process pauses after
  2442 certain number of messages per command transaction, with some user
  2443 dialog to stop or continue.  This avoids swamping the front-end with
  2444 potentially infinite message streams.
  2445 
  2446 * More plugin options and preferences, based on Isabelle/Scala.  The
  2447 jEdit plugin option panel provides access to some Isabelle/Scala
  2448 options, including tuning parameters for editor reactivity and color
  2449 schemes.
  2450 
  2451 * Dockable window "Symbols" provides some editing support for Isabelle
  2452 symbols.
  2453 
  2454 * Dockable window "Monitor" shows ML runtime statistics.  Note that
  2455 continuous display of the chart slows down the system.
  2456 
  2457 * Improved editing support for control styles: subscript, superscript,
  2458 bold, reset of style -- operating on single symbols or text
  2459 selections.  Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
  2460 
  2461 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
  2462 adjust the main text area font size, and its derivatives for output,
  2463 tooltips etc.  Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
  2464 need to be adapted to local keyboard layouts.
  2465 
  2466 * More reactive completion popup by default: use \t (TAB) instead of
  2467 \n (NEWLINE) to minimize intrusion into regular flow of editing.  See
  2468 also "Plugin Options / SideKick / General / Code Completion Options".
  2469 
  2470 * Implicit check and build dialog of the specified logic session
  2471 image.  For example, HOL, HOLCF, HOL-Nominal can be produced on
  2472 demand, without bundling big platform-dependent heap images in the
  2473 Isabelle distribution.
  2474 
  2475 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
  2476 from Oracle provide better multi-platform experience.  This version is
  2477 now bundled exclusively with Isabelle.
  2478 
  2479 
  2480 *** Pure ***
  2481 
  2482 * Code generation for Haskell: restrict unqualified imports from
  2483 Haskell Prelude to a small set of fundamental operations.
  2484 
  2485 * Command 'export_code': relative file names are interpreted
  2486 relatively to master directory of current theory rather than the
  2487 rather arbitrary current working directory.  INCOMPATIBILITY.
  2488 
  2489 * Discontinued obsolete attribute "COMP".  Potential INCOMPATIBILITY,
  2490 use regular rule composition via "OF" / "THEN", or explicit proof
  2491 structure instead.  Note that Isabelle/ML provides a variety of
  2492 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
  2493 with some care where this is really required.
  2494 
  2495 * Command 'typ' supports an additional variant with explicit sort
  2496 constraint, to infer and check the most general type conforming to a
  2497 given sort.  Example (in HOL):
  2498 
  2499   typ "_ * _ * bool * unit" :: finite
  2500 
  2501 * Command 'locale_deps' visualizes all locales and their relations as
  2502 a Hasse diagram.
  2503 
  2504 
  2505 *** HOL ***
  2506 
  2507 * Sledgehammer:
  2508 
  2509   - Added MaSh relevance filter based on machine-learning; see the
  2510     Sledgehammer manual for details.
  2511   - Polished Isar proofs generated with "isar_proofs" option.
  2512   - Rationalized type encodings ("type_enc" option).
  2513   - Renamed "kill_provers" subcommand to "kill_all".
  2514   - Renamed options:
  2515       isar_proof ~> isar_proofs
  2516       isar_shrink_factor ~> isar_shrink
  2517       max_relevant ~> max_facts
  2518       relevance_thresholds ~> fact_thresholds
  2519 
  2520 * Quickcheck: added an optimisation for equality premises.  It is
  2521 switched on by default, and can be switched off by setting the
  2522 configuration quickcheck_optimise_equality to false.
  2523 
  2524 * Quotient: only one quotient can be defined by quotient_type
  2525 INCOMPATIBILITY.
  2526 
  2527 * Lifting:
  2528   - generation of an abstraction function equation in lift_definition
  2529   - quot_del attribute
  2530   - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
  2531 
  2532 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
  2533 expressions.
  2534 
  2535 * Preprocessing of the code generator rewrites set comprehensions into
  2536 pointfree expressions.
  2537 
  2538 * The SMT solver Z3 has now by default a restricted set of directly
  2539 supported features. For the full set of features (div/mod, nonlinear
  2540 arithmetic, datatypes/records) with potential proof reconstruction
  2541 failures, enable the configuration option "z3_with_extensions".  Minor
  2542 INCOMPATIBILITY.
  2543 
  2544 * Simplified 'typedef' specifications: historical options for implicit
  2545 set definition and alternative name have been discontinued.  The
  2546 former behavior of "typedef (open) t = A" is now the default, but
  2547 written just "typedef t = A".  INCOMPATIBILITY, need to adapt theories
  2548 accordingly.
  2549 
  2550 * Removed constant "chars"; prefer "Enum.enum" on type "char"
  2551 directly.  INCOMPATIBILITY.
  2552 
  2553 * Moved operation product, sublists and n_lists from theory Enum to
  2554 List.  INCOMPATIBILITY.
  2555 
  2556 * Theorem UN_o generalized to SUP_comp.  INCOMPATIBILITY.
  2557 
  2558 * Class "comm_monoid_diff" formalises properties of bounded
  2559 subtraction, with natural numbers and multisets as typical instances.
  2560 
  2561 * Added combinator "Option.these" with type "'a option set => 'a set".
  2562 
  2563 * Theory "Transitive_Closure": renamed lemmas
  2564 
  2565   reflcl_tranclp -> reflclp_tranclp
  2566   rtranclp_reflcl -> rtranclp_reflclp
  2567 
  2568 INCOMPATIBILITY.
  2569 
  2570 * Theory "Rings": renamed lemmas (in class semiring)
  2571 
  2572   left_distrib ~> distrib_right
  2573   right_distrib ~> distrib_left
  2574 
  2575 INCOMPATIBILITY.
  2576 
  2577 * Generalized the definition of limits:
  2578 
  2579   - Introduced the predicate filterlim (LIM x F. f x :> G) which
  2580     expresses that when the input values x converge to F then the
  2581     output f x converges to G.
  2582 
  2583   - Added filters for convergence to positive (at_top) and negative
  2584     infinity (at_bot).
  2585 
  2586   - Moved infinity in the norm (at_infinity) from
  2587     Multivariate_Analysis to Complex_Main.
  2588 
  2589   - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
  2590     at_top".
  2591 
  2592 INCOMPATIBILITY.
  2593 
  2594 * Theory "Library/Option_ord" provides instantiation of option type to
  2595 lattice type classes.
  2596 
  2597 * Theory "Library/Multiset": renamed
  2598 
  2599     constant fold_mset ~> Multiset.fold
  2600     fact fold_mset_commute ~> fold_mset_comm
  2601 
  2602 INCOMPATIBILITY.
  2603 
  2604 * Renamed theory Library/List_Prefix to Library/Sublist, with related
  2605 changes as follows.
  2606 
  2607   - Renamed constants (and related lemmas)
  2608 
  2609       prefix ~> prefixeq
  2610       strict_prefix ~> prefix
  2611 
  2612   - Replaced constant "postfix" by "suffixeq" with swapped argument
  2613     order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
  2614     old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
  2615     Renamed lemmas accordingly.
  2616 
  2617   - Added constant "list_hembeq" for homeomorphic embedding on
  2618     lists. Added abbreviation "sublisteq" for special case
  2619     "list_hembeq (op =)".
  2620 
  2621   - Theory Library/Sublist no longer provides "order" and "bot" type
  2622     class instances for the prefix order (merely corresponding locale
  2623     interpretations). The type class instances are now in theory
  2624     Library/Prefix_Order.
  2625 
  2626   - The sublist relation of theory Library/Sublist_Order is now based
  2627     on "Sublist.sublisteq".  Renamed lemmas accordingly:
  2628 
  2629       le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
  2630       le_list_append_mono ~> Sublist.list_hembeq_append_mono
  2631       le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
  2632       le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
  2633       le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
  2634       le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
  2635       le_list_drop_Cons ~> Sublist.sublisteq_Cons'
  2636       le_list_drop_many ~> Sublist.sublisteq_drop_many
  2637       le_list_filter_left ~> Sublist.sublisteq_filter_left
  2638       le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
  2639       le_list_rev_take_iff ~> Sublist.sublisteq_append
  2640       le_list_same_length ~> Sublist.sublisteq_same_length
  2641       le_list_take_many_iff ~> Sublist.sublisteq_append'
  2642       less_eq_list.drop ~> less_eq_list_drop
  2643       less_eq_list.induct ~> less_eq_list_induct
  2644       not_le_list_length ~> Sublist.not_sublisteq_length
  2645 
  2646 INCOMPATIBILITY.
  2647 
  2648 * New theory Library/Countable_Set.
  2649 
  2650 * Theory Library/Debug and Library/Parallel provide debugging and
  2651 parallel execution for code generated towards Isabelle/ML.
  2652 
  2653 * Theory Library/FuncSet: Extended support for Pi and extensional and
  2654 introduce the extensional dependent function space "PiE". Replaced
  2655 extensional_funcset by an abbreviation, and renamed lemmas from
  2656 extensional_funcset to PiE as follows:
  2657 
  2658   extensional_empty  ~>  PiE_empty
  2659   extensional_funcset_empty_domain  ~>  PiE_empty_domain
  2660   extensional_funcset_empty_range  ~>  PiE_empty_range
  2661   extensional_funcset_arb  ~>  PiE_arb
  2662   extensional_funcset_mem  ~>  PiE_mem
  2663   extensional_funcset_extend_domainI  ~>  PiE_fun_upd
  2664   extensional_funcset_restrict_domain  ~>  fun_upd_in_PiE
  2665   extensional_funcset_extend_domain_eq  ~>  PiE_insert_eq
  2666   card_extensional_funcset  ~>  card_PiE
  2667   finite_extensional_funcset  ~>  finite_PiE
  2668 
  2669 INCOMPATIBILITY.
  2670 
  2671 * Theory Library/FinFun: theory of almost everywhere constant
  2672 functions (supersedes the AFP entry "Code Generation for Functions as
  2673 Data").
  2674 
  2675 * Theory Library/Phantom: generic phantom type to make a type
  2676 parameter appear in a constant's type.  This alternative to adding
  2677 TYPE('a) as another parameter avoids unnecessary closures in generated
  2678 code.
  2679 
  2680 * Theory Library/RBT_Impl: efficient construction of red-black trees
  2681 from sorted associative lists. Merging two trees with rbt_union may
  2682 return a structurally different tree than before.  Potential
  2683 INCOMPATIBILITY.
  2684 
  2685 * Theory Library/IArray: immutable arrays with code generation.
  2686 
  2687 * Theory Library/Finite_Lattice: theory of finite lattices.
  2688 
  2689 * HOL/Multivariate_Analysis: replaced
  2690 
  2691   "basis :: 'a::euclidean_space => nat => real"
  2692   "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
  2693 
  2694 on euclidean spaces by using the inner product "_ \<bullet> _" with
  2695 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
  2696 "SUM i : Basis. f i * r i".
  2697 
  2698   With this change the following constants are also changed or removed:
  2699 
  2700     DIM('a) :: nat  ~>  card (Basis :: 'a set)   (is an abbreviation)
  2701     a $$ i  ~>  inner a i  (where i : Basis)
  2702     cart_base i  removed
  2703     \<pi>, \<pi>'  removed
  2704 
  2705   Theorems about these constants where removed.
  2706 
  2707   Renamed lemmas:
  2708 
  2709     component_le_norm  ~>  Basis_le_norm
  2710     euclidean_eq  ~>  euclidean_eq_iff
  2711     differential_zero_maxmin_component  ~>  differential_zero_maxmin_cart
  2712     euclidean_simps  ~>  inner_simps
  2713     independent_basis  ~>  independent_Basis
  2714     span_basis  ~>  span_Basis
  2715     in_span_basis  ~>  in_span_Basis
  2716     norm_bound_component_le  ~>  norm_boound_Basis_le
  2717     norm_bound_component_lt  ~>  norm_boound_Basis_lt
  2718     component_le_infnorm  ~>  Basis_le_infnorm
  2719 
  2720 INCOMPATIBILITY.
  2721 
  2722 * HOL/Probability:
  2723 
  2724   - Added simproc "measurable" to automatically prove measurability.
  2725 
  2726   - Added induction rules for sigma sets with disjoint union
  2727     (sigma_sets_induct_disjoint) and for Borel-measurable functions
  2728     (borel_measurable_induct).
  2729 
  2730   - Added the Daniell-Kolmogorov theorem (the existence the limit of a
  2731     projective family).
  2732 
  2733 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
  2734 AFP entry "Ordinals_and_Cardinals").
  2735 
  2736 * HOL/BNF: New (co)datatype package based on bounded natural functors
  2737 with support for mixed, nested recursion and interesting non-free
  2738 datatypes.
  2739 
  2740 * HOL/Finite_Set and Relation: added new set and relation operations
  2741 expressed by Finite_Set.fold.
  2742 
  2743 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
  2744 trees for the code generator.
  2745 
  2746 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
  2747 Lifting/Transfer.
  2748 possible INCOMPATIBILITY.
  2749 
  2750 * HOL/Set: renamed Set.project -> Set.filter
  2751 INCOMPATIBILITY.
  2752 
  2753 
  2754 *** Document preparation ***
  2755 
  2756 * Dropped legacy antiquotations "term_style" and "thm_style", since
  2757 styles may be given as arguments to "term" and "thm" already.
  2758 Discontinued legacy styles "prem1" .. "prem19".
  2759 
  2760 * Default LaTeX rendering for \<euro> is now based on eurosym package,
  2761 instead of slightly exotic babel/greek.
  2762 
  2763 * Document variant NAME may use different LaTeX entry point
  2764 document/root_NAME.tex if that file exists, instead of the common
  2765 document/root.tex.
  2766 
  2767 * Simplified custom document/build script, instead of old-style
  2768 document/IsaMakefile.  Minor INCOMPATIBILITY.
  2769 
  2770 
  2771 *** ML ***
  2772 
  2773 * The default limit for maximum number of worker threads is now 8,
  2774 instead of 4, in correspondence to capabilities of contemporary
  2775 hardware and Poly/ML runtime system.
  2776 
  2777 * Type Seq.results and related operations support embedded error
  2778 messages within lazy enumerations, and thus allow to provide
  2779 informative errors in the absence of any usable results.
  2780 
  2781 * Renamed Position.str_of to Position.here to emphasize that this is a
  2782 formal device to inline positions into message text, but not
  2783 necessarily printing visible text.
  2784 
  2785 
  2786 *** System ***
  2787 
  2788 * Advanced support for Isabelle sessions and build management, see
  2789 "system" manual for the chapter of that name, especially the "isabelle
  2790 build" tool and its examples.  The "isabelle mkroot" tool prepares
  2791 session root directories for use with "isabelle build", similar to
  2792 former "isabelle mkdir" for "isabelle usedir".  Note that this affects
  2793 document preparation as well.  INCOMPATIBILITY, isabelle usedir /
  2794 mkdir / make are rendered obsolete.
  2795 
  2796 * Discontinued obsolete Isabelle/build script, it is superseded by the
  2797 regular isabelle build tool.  For example:
  2798 
  2799   isabelle build -s -b HOL
  2800 
  2801 * Discontinued obsolete "isabelle makeall".
  2802 
  2803 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
  2804 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
  2805 provides some traditional targets that invoke "isabelle build".  Note
  2806 that this is inefficient!  Applications of Isabelle/HOL involving
  2807 "isabelle make" should be upgraded to use "isabelle build" directly.
  2808 
  2809 * The "isabelle options" tool prints Isabelle system options, as
  2810 required for "isabelle build", for example.
  2811 
  2812 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
  2813 Minor INCOMPATIBILITY in command-line options.
  2814 
  2815 * The "isabelle install" tool has now a simpler command-line.  Minor
  2816 INCOMPATIBILITY.
  2817 
  2818 * The "isabelle components" tool helps to resolve add-on components
  2819 that are not bundled, or referenced from a bare-bones repository
  2820 version of Isabelle.
  2821 
  2822 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
  2823 platform family: "linux", "macos", "windows".
  2824 
  2825 * The ML system is configured as regular component, and no longer
  2826 picked up from some surrounding directory.  Potential INCOMPATIBILITY
  2827 for home-made settings.
  2828 
  2829 * Improved ML runtime statistics (heap, threads, future tasks etc.).
  2830 
  2831 * Discontinued support for Poly/ML 5.2.1, which was the last version
  2832 without exception positions and advanced ML compiler/toplevel
  2833 configuration.
  2834 
  2835 * Discontinued special treatment of Proof General -- no longer guess
  2836 PROOFGENERAL_HOME based on accidental file-system layout.  Minor
  2837 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
  2838 settings manually, or use a Proof General version that has been
  2839 bundled as Isabelle component.
  2840 
  2841 
  2842 
  2843 New in Isabelle2012 (May 2012)
  2844 ------------------------------
  2845 
  2846 *** General ***
  2847 
  2848 * Prover IDE (PIDE) improvements:
  2849 
  2850   - more robust Sledgehammer integration (as before the sledgehammer
  2851     command-line needs to be typed into the source buffer)
  2852   - markup for bound variables
  2853   - markup for types of term variables (displayed as tooltips)
  2854   - support for user-defined Isar commands within the running session
  2855   - improved support for Unicode outside original 16bit range
  2856     e.g. glyph for \<A> (thanks to jEdit 4.5.1)
  2857 
  2858 * Forward declaration of outer syntax keywords within the theory
  2859 header -- minor INCOMPATIBILITY for user-defined commands.  Allow new
  2860 commands to be used in the same theory where defined.
  2861 
  2862 * Auxiliary contexts indicate block structure for specifications with
  2863 additional parameters and assumptions.  Such unnamed contexts may be
  2864 nested within other targets, like 'theory', 'locale', 'class',
  2865 'instantiation' etc.  Results from the local context are generalized
  2866 accordingly and applied to the enclosing target context.  Example:
  2867 
  2868   context
  2869     fixes x y z :: 'a
  2870     assumes xy: "x = y" and yz: "y = z"
  2871   begin
  2872 
  2873   lemma my_trans: "x = z" using xy yz by simp
  2874 
  2875   end
  2876 
  2877   thm my_trans
  2878 
  2879 The most basic application is to factor-out context elements of
  2880 several fixes/assumes/shows theorem statements, e.g. see
  2881 ~~/src/HOL/Isar_Examples/Group_Context.thy
  2882 
  2883 Any other local theory specification element works within the "context
  2884 ... begin ... end" block as well.
  2885 
  2886 * Bundled declarations associate attributed fact expressions with a
  2887 given name in the context.  These may be later included in other
  2888 contexts.  This allows to manage context extensions casually, without
  2889 the logical dependencies of locales and locale interpretation.  See
  2890 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
  2891 
  2892 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
  2893 declaration, and results are standardized before being stored.  Thus
  2894 old-style "standard" after instantiation or composition of facts
  2895 becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
  2896 indices of schematic variables.
  2897 
  2898 * Rule attributes in local theory declarations (e.g. locale or class)
  2899 are now statically evaluated: the resulting theorem is stored instead
  2900 of the original expression.  INCOMPATIBILITY in rare situations, where
  2901 the historic accident of dynamic re-evaluation in interpretations
  2902 etc. was exploited.
  2903 
  2904 * New tutorial "Programming and Proving in Isabelle/HOL"
  2905 ("prog-prove").  It completely supersedes "A Tutorial Introduction to
  2906 Structured Isar Proofs" ("isar-overview"), which has been removed.  It
  2907 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
  2908 Logic" as the recommended beginners tutorial, but does not cover all
  2909 of the material of that old tutorial.
  2910 
  2911 * Updated and extended reference manuals: "isar-ref",
  2912 "implementation", "system"; reduced remaining material in old "ref"
  2913 manual.
  2914 
  2915 
  2916 *** Pure ***
  2917 
  2918 * Command 'definition' no longer exports the foundational "raw_def"
  2919 into the user context.  Minor INCOMPATIBILITY, may use the regular
  2920 "def" result with attribute "abs_def" to imitate the old version.
  2921 
  2922 * Attribute "abs_def" turns an equation of the form "f x y == t" into
  2923 "f == %x y. t", which ensures that "simp" or "unfold" steps always
  2924 expand it.  This also works for object-logic equality.  (Formerly
  2925 undocumented feature.)
  2926 
  2927 * Sort constraints are now propagated in simultaneous statements, just
  2928 like type constraints.  INCOMPATIBILITY in rare situations, where
  2929 distinct sorts used to be assigned accidentally.  For example:
  2930 
  2931   lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
  2932 
  2933   lemma "P (x::'a)" and "Q (y::'a::bar)"
  2934     -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
  2935 
  2936 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
  2937 tolerant against multiple unifiers, as long as the final result is
  2938 unique.  (As before, rules are composed in canonical right-to-left
  2939 order to accommodate newly introduced premises.)
  2940 
  2941 * Renamed some inner syntax categories:
  2942 
  2943     num ~> num_token
  2944     xnum ~> xnum_token
  2945     xstr ~> str_token
  2946 
  2947 Minor INCOMPATIBILITY.  Note that in practice "num_const" or
  2948 "num_position" etc. are mainly used instead (which also include
  2949 position information via constraints).
  2950 
  2951 * Simplified configuration options for syntax ambiguity: see
  2952 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
  2953 manual.  Minor INCOMPATIBILITY.
  2954 
  2955 * Discontinued configuration option "syntax_positions": atomic terms
  2956 in parse trees are always annotated by position constraints.
  2957 
  2958 * Old code generator for SML and its commands 'code_module',
  2959 'code_library', 'consts_code', 'types_code' have been discontinued.
  2960 Use commands of the generic code generator instead.  INCOMPATIBILITY.
  2961 
  2962 * Redundant attribute "code_inline" has been discontinued. Use
  2963 "code_unfold" instead.  INCOMPATIBILITY.
  2964 
  2965 * Dropped attribute "code_unfold_post" in favor of the its dual
  2966 "code_abbrev", which yields a common pattern in definitions like
  2967 
  2968   definition [code_abbrev]: "f = t"
  2969 
  2970 INCOMPATIBILITY.
  2971 
  2972 * Obsolete 'types' command has been discontinued.  Use 'type_synonym'
  2973 instead.  INCOMPATIBILITY.
  2974 
  2975 * Discontinued old "prems" fact, which used to refer to the accidental
  2976 collection of foundational premises in the context (already marked as
  2977 legacy since Isabelle2011).
  2978 
  2979 
  2980 *** HOL ***
  2981 
  2982 * Type 'a set is now a proper type constructor (just as before
  2983 Isabelle2008).  Definitions mem_def and Collect_def have disappeared.
  2984 Non-trivial INCOMPATIBILITY.  For developments keeping predicates and
  2985 sets separate, it is often sufficient to rephrase some set S that has
  2986 been accidentally used as predicates by "%x. x : S", and some
  2987 predicate P that has been accidentally used as set by "{x. P x}".
  2988 Corresponding proofs in a first step should be pruned from any
  2989 tinkering with former theorems mem_def and Collect_def as far as
  2990 possible.
  2991 
  2992 For developments which deliberately mix predicates and sets, a
  2993 planning step is necessary to determine what should become a predicate
  2994 and what a set.  It can be helpful to carry out that step in
  2995 Isabelle2011-1 before jumping right into the current release.
  2996 
  2997 * Code generation by default implements sets as container type rather
  2998 than predicates.  INCOMPATIBILITY.
  2999 
  3000 * New type synonym 'a rel = ('a * 'a) set
  3001 
  3002 * The representation of numerals has changed.  Datatype "num"
  3003 represents strictly positive binary numerals, along with functions
  3004 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
  3005 positive and negated numeric literals, respectively.  See also
  3006 definitions in ~~/src/HOL/Num.thy.  Potential INCOMPATIBILITY, some
  3007 user theories may require adaptations as follows:
  3008 
  3009   - Theorems with number_ring or number_semiring constraints: These
  3010     classes are gone; use comm_ring_1 or comm_semiring_1 instead.
  3011 
  3012   - Theories defining numeric types: Remove number, number_semiring,
  3013     and number_ring instances. Defer all theorems about numerals until
  3014     after classes one and semigroup_add have been instantiated.
  3015 
  3016   - Numeral-only simp rules: Replace each rule having a "number_of v"
  3017     pattern with two copies, one for numeral and one for neg_numeral.
  3018 
  3019   - Theorems about subclasses of semiring_1 or ring_1: These classes
  3020     automatically support numerals now, so more simp rules and
  3021     simprocs may now apply within the proof.
  3022 
  3023   - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
  3024     Redefine using other integer operations.
  3025 
  3026 * Transfer: New package intended to generalize the existing
  3027 "descending" method and related theorem attributes from the Quotient
  3028 package.  (Not all functionality is implemented yet, but future
  3029 development will focus on Transfer as an eventual replacement for the
  3030 corresponding parts of the Quotient package.)
  3031 
  3032   - transfer_rule attribute: Maintains a collection of transfer rules,
  3033     which relate constants at two different types. Transfer rules may
  3034     relate different type instances of the same polymorphic constant,
  3035     or they may relate an operation on a raw type to a corresponding
  3036     operation on an abstract type (quotient or subtype). For example:
  3037 
  3038     ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
  3039     (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
  3040 
  3041   - transfer method: Replaces a subgoal on abstract types with an
  3042     equivalent subgoal on the corresponding raw types. Constants are
  3043     replaced with corresponding ones according to the transfer rules.
  3044     Goals are generalized over all free variables by default; this is
  3045     necessary for variables whose types change, but can be overridden
  3046     for specific variables with e.g. "transfer fixing: x y z".  The
  3047     variant transfer' method allows replacing a subgoal with one that
  3048     is logically stronger (rather than equivalent).
  3049 
  3050   - relator_eq attribute: Collects identity laws for relators of
  3051     various type constructors, e.g. "list_all2 (op =) = (op =)".  The
  3052     transfer method uses these lemmas to infer transfer rules for
  3053     non-polymorphic constants on the fly.
  3054 
  3055   - transfer_prover method: Assists with proving a transfer rule for a
  3056     new constant, provided the constant is defined in terms of other
  3057     constants that already have transfer rules. It should be applied
  3058     after unfolding the constant definitions.
  3059 
  3060   - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
  3061     from type nat to type int.
  3062 
  3063 * Lifting: New package intended to generalize the quotient_definition
  3064 facility of the Quotient package; designed to work with Transfer.
  3065 
  3066   - lift_definition command: Defines operations on an abstract type in
  3067     terms of a corresponding operation on a representation
  3068     type.  Example syntax:
  3069 
  3070     lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
  3071       is List.insert
  3072 
  3073     Users must discharge a respectfulness proof obligation when each
  3074     constant is defined. (For a type copy, i.e. a typedef with UNIV,
  3075     the proof is discharged automatically.) The obligation is
  3076     presented in a user-friendly, readable form; a respectfulness
  3077     theorem in the standard format and a transfer rule are generated
  3078     by the package.
  3079 
  3080   - Integration with code_abstype: For typedefs (e.g. subtypes
  3081     corresponding to a datatype invariant, such as dlist),
  3082     lift_definition generates a code certificate theorem and sets up
  3083     code generation for each constant.
  3084 
  3085   - setup_lifting command: Sets up the Lifting package to work with a
  3086     user-defined type. The user must provide either a quotient theorem
  3087     or a type_definition theorem.  The package configures transfer
  3088     rules for equality and quantifiers on the type, and sets up the
  3089     lift_definition command to work with the type.
  3090 
  3091   - Usage examples: See Quotient_Examples/Lift_DList.thy,
  3092     Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
  3093     Word/Word.thy and Library/Float.thy.
  3094 
  3095 * Quotient package:
  3096 
  3097   - The 'quotient_type' command now supports a 'morphisms' option with
  3098     rep and abs functions, similar to typedef.
  3099 
  3100   - 'quotient_type' sets up new types to work with the Lifting and
  3101     Transfer packages, as with 'setup_lifting'.
  3102 
  3103   - The 'quotient_definition' command now requires the user to prove a
  3104     respectfulness property at the point where the constant is
  3105     defined, similar to lift_definition; INCOMPATIBILITY.
  3106 
  3107   - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
  3108     accordingly, INCOMPATIBILITY.
  3109 
  3110 * New diagnostic command 'find_unused_assms' to find potentially
  3111 superfluous assumptions in theorems using Quickcheck.
  3112 
  3113 * Quickcheck:
  3114 
  3115   - Quickcheck returns variable assignments as counterexamples, which
  3116     allows to reveal the underspecification of functions under test.
  3117     For example, refuting "hd xs = x", it presents the variable
  3118     assignment xs = [] and x = a1 as a counterexample, assuming that
  3119     any property is false whenever "hd []" occurs in it.
  3120 
  3121     These counterexample are marked as potentially spurious, as
  3122     Quickcheck also returns "xs = []" as a counterexample to the
  3123     obvious theorem "hd xs = hd xs".
  3124 
  3125     After finding a potentially spurious counterexample, Quickcheck
  3126     continues searching for genuine ones.
  3127 
  3128     By default, Quickcheck shows potentially spurious and genuine
  3129     counterexamples. The option "genuine_only" sets quickcheck to only
  3130     show genuine counterexamples.
  3131 
  3132   - The command 'quickcheck_generator' creates random and exhaustive
  3133     value generators for a given type and operations.
  3134 
  3135     It generates values by using the operations as if they were
  3136     constructors of that type.
  3137 
  3138   - Support for multisets.
  3139 
  3140   - Added "use_subtype" options.
  3141 
  3142   - Added "quickcheck_locale" configuration to specify how to process
  3143     conjectures in a locale context.
  3144 
  3145 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
  3146 and affecting 'rat' and 'real'.
  3147 
  3148 * Sledgehammer:
  3149   - Integrated more tightly with SPASS, as described in the ITP 2012
  3150     paper "More SPASS with Isabelle".
  3151   - Made it try "smt" as a fallback if "metis" fails or times out.
  3152   - Added support for the following provers: Alt-Ergo (via Why3 and
  3153     TFF1), iProver, iProver-Eq.
  3154   - Sped up the minimizer.
  3155   - Added "lam_trans", "uncurry_aliases", and "minimize" options.
  3156   - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
  3157   - Renamed "sound" option to "strict".
  3158 
  3159 * Metis: Added possibility to specify lambda translations scheme as a
  3160 parenthesized argument (e.g., "by (metis (lifting) ...)").
  3161 
  3162 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
  3163 
  3164 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
  3165 
  3166 * New "case_product" attribute to generate a case rule doing multiple
  3167 case distinctions at the same time.  E.g.
  3168 
  3169   list.exhaust [case_product nat.exhaust]
  3170 
  3171 produces a rule which can be used to perform case distinction on both
  3172 a list and a nat.
  3173 
  3174 * New "eventually_elim" method as a generalized variant of the
  3175 eventually_elim* rules.  Supports structured proofs.
  3176 
  3177 * Typedef with implicit set definition is considered legacy.  Use
  3178 "typedef (open)" form instead, which will eventually become the
  3179 default.
  3180 
  3181 * Record: code generation can be switched off manually with
  3182 
  3183   declare [[record_coden = false]]  -- "default true"
  3184 
  3185 * Datatype: type parameters allow explicit sort constraints.
  3186 
  3187 * Concrete syntax for case expressions includes constraints for source
  3188 positions, and thus produces Prover IDE markup for its bindings.
  3189 INCOMPATIBILITY for old-style syntax translations that augment the
  3190 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
  3191 one_case.
  3192 
  3193 * Clarified attribute "mono_set": pure declaration without modifying
  3194 the result of the fact expression.
  3195 
  3196 * More default pred/set conversions on a couple of relation operations
  3197 and predicates.  Added powers of predicate relations.  Consolidation
  3198 of some relation theorems:
  3199 
  3200   converse_def ~> converse_unfold
  3201   rel_comp_def ~> relcomp_unfold
  3202   symp_def ~> (modified, use symp_def and sym_def instead)
  3203   transp_def ~> transp_trans
  3204   Domain_def ~> Domain_unfold
  3205   Range_def ~> Domain_converse [symmetric]
  3206 
  3207 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
  3208 
  3209 See theory "Relation" for examples for making use of pred/set
  3210 conversions by means of attributes "to_set" and "to_pred".
  3211 
  3212 INCOMPATIBILITY.
  3213 
  3214 * Renamed facts about the power operation on relations, i.e., relpow
  3215 to match the constant's name:
  3216 
  3217   rel_pow_1 ~> relpow_1
  3218   rel_pow_0_I ~> relpow_0_I
  3219   rel_pow_Suc_I ~> relpow_Suc_I
  3220   rel_pow_Suc_I2 ~> relpow_Suc_I2
  3221   rel_pow_0_E ~> relpow_0_E
  3222   rel_pow_Suc_E ~> relpow_Suc_E
  3223   rel_pow_E ~> relpow_E
  3224   rel_pow_Suc_D2 ~> relpow_Suc_D2
  3225   rel_pow_Suc_E2 ~> relpow_Suc_E2
  3226   rel_pow_Suc_D2' ~> relpow_Suc_D2'
  3227   rel_pow_E2 ~> relpow_E2
  3228   rel_pow_add ~> relpow_add
  3229   rel_pow_commute ~> relpow
  3230   rel_pow_empty ~> relpow_empty:
  3231   rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
  3232   rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
  3233   rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
  3234   rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
  3235   rel_pow_fun_conv ~> relpow_fun_conv
  3236   rel_pow_finite_bounded1 ~> relpow_finite_bounded1
  3237   rel_pow_finite_bounded ~> relpow_finite_bounded
  3238   rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
  3239   trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
  3240   single_valued_rel_pow ~> single_valued_relpow
  3241 
  3242 INCOMPATIBILITY.
  3243 
  3244 * Theory Relation: Consolidated constant name for relation composition
  3245 and corresponding theorem names:
  3246 
  3247   - Renamed constant rel_comp to relcomp.
  3248 
  3249   - Dropped abbreviation pred_comp. Use relcompp instead.
  3250 
  3251   - Renamed theorems:
  3252 
  3253     rel_compI ~> relcompI
  3254     rel_compEpair ~> relcompEpair
  3255     rel_compE ~> relcompE
  3256     pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
  3257     rel_comp_empty1 ~> relcomp_empty1
  3258     rel_comp_mono ~> relcomp_mono
  3259     rel_comp_subset_Sigma ~> relcomp_subset_Sigma
  3260     rel_comp_distrib ~> relcomp_distrib
  3261     rel_comp_distrib2 ~> relcomp_distrib2
  3262     rel_comp_UNION_distrib ~> relcomp_UNION_distrib
  3263     rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
  3264     single_valued_rel_comp ~> single_valued_relcomp
  3265     rel_comp_def ~> relcomp_unfold
  3266     converse_rel_comp ~> converse_relcomp
  3267     pred_compI ~> relcomppI
  3268     pred_compE ~> relcomppE
  3269     pred_comp_bot1 ~> relcompp_bot1
  3270     pred_comp_bot2 ~> relcompp_bot2
  3271     transp_pred_comp_less_eq ~> transp_relcompp_less_eq
  3272     pred_comp_mono ~> relcompp_mono
  3273     pred_comp_distrib ~> relcompp_distrib
  3274     pred_comp_distrib2 ~> relcompp_distrib2
  3275     converse_pred_comp ~> converse_relcompp
  3276 
  3277     finite_rel_comp ~> finite_relcomp
  3278 
  3279     set_rel_comp ~> set_relcomp
  3280 
  3281 INCOMPATIBILITY.
  3282 
  3283 * Theory Divides: Discontinued redundant theorems about div and mod.
  3284 INCOMPATIBILITY, use the corresponding generic theorems instead.
  3285 
  3286   DIVISION_BY_ZERO ~> div_by_0, mod_by_0
  3287   zdiv_self ~> div_self
  3288   zmod_self ~> mod_self
  3289   zdiv_zero ~> div_0
  3290   zmod_zero ~> mod_0
  3291   zdiv_zmod_equality ~> div_mod_equality2
  3292   zdiv_zmod_equality2 ~> div_mod_equality
  3293   zmod_zdiv_trivial ~> mod_div_trivial
  3294   zdiv_zminus_zminus ~> div_minus_minus
  3295   zmod_zminus_zminus ~> mod_minus_minus
  3296   zdiv_zminus2 ~> div_minus_right
  3297   zmod_zminus2 ~> mod_minus_right
  3298   zdiv_minus1_right ~> div_minus1_right
  3299   zmod_minus1_right ~> mod_minus1_right
  3300   zdvd_mult_div_cancel ~> dvd_mult_div_cancel
  3301   zmod_zmult1_eq ~> mod_mult_right_eq
  3302   zpower_zmod ~> power_mod
  3303   zdvd_zmod ~> dvd_mod
  3304   zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
  3305   mod_mult_distrib ~> mult_mod_left
  3306   mod_mult_distrib2 ~> mult_mod_right
  3307 
  3308 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
  3309 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
  3310 
  3311 * Finite_Set.fold now qualified.  INCOMPATIBILITY.
  3312 
  3313 * Consolidated theorem names concerning fold combinators:
  3314 
  3315   inf_INFI_fold_inf ~> inf_INF_fold_inf
  3316   sup_SUPR_fold_sup ~> sup_SUP_fold_sup
  3317   INFI_fold_inf ~> INF_fold_inf
  3318   SUPR_fold_sup ~> SUP_fold_sup
  3319   union_set ~> union_set_fold
  3320   minus_set ~> minus_set_fold
  3321   INFI_set_fold ~> INF_set_fold
  3322   SUPR_set_fold ~> SUP_set_fold
  3323   INF_code ~> INF_set_foldr
  3324   SUP_code ~> SUP_set_foldr
  3325   foldr.simps ~> foldr.simps (in point-free formulation)
  3326   foldr_fold_rev ~> foldr_conv_fold
  3327   foldl_fold ~> foldl_conv_fold
  3328   foldr_foldr ~> foldr_conv_foldl
  3329   foldl_foldr ~> foldl_conv_foldr
  3330   fold_set_remdups ~> fold_set_fold_remdups
  3331   fold_set ~> fold_set_fold
  3332   fold1_set ~> fold1_set_fold
  3333 
  3334 INCOMPATIBILITY.
  3335 
  3336 * Dropped rarely useful theorems concerning fold combinators:
  3337 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
  3338 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
  3339 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
  3340 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
  3341 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
  3342 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
  3343 INCOMPATIBILITY.  For the common phrases "%xs. List.foldr plus xs 0"
  3344 and "List.foldl plus 0", prefer "List.listsum".  Otherwise it can be
  3345 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
  3346 unfolding "foldr_conv_fold" and "foldl_conv_fold".
  3347 
  3348 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
  3349 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
  3350 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
  3351 INF_set_foldr, SUP_set_foldr.  INCOMPATIBILITY.  Prefer corresponding
  3352 lemmas over fold rather than foldr, or make use of lemmas
  3353 fold_conv_foldr and fold_rev.
  3354 
  3355 * Congruence rules Option.map_cong and Option.bind_cong for recursion
  3356 through option types.
  3357 
  3358 * "Transitive_Closure.ntrancl": bounded transitive closure on
  3359 relations.
  3360 
  3361 * Constant "Set.not_member" now qualified.  INCOMPATIBILITY.
  3362 
  3363 * Theory Int: Discontinued many legacy theorems specific to type int.
  3364 INCOMPATIBILITY, use the corresponding generic theorems instead.
  3365 
  3366   zminus_zminus ~> minus_minus
  3367   zminus_0 ~> minus_zero
  3368   zminus_zadd_distrib ~> minus_add_distrib
  3369   zadd_commute ~> add_commute
  3370   zadd_assoc ~> add_assoc
  3371   zadd_left_commute ~> add_left_commute
  3372   zadd_ac ~> add_ac
  3373   zmult_ac ~> mult_ac
  3374   zadd_0 ~> add_0_left
  3375   zadd_0_right ~> add_0_right
  3376   zadd_zminus_inverse2 ~> left_minus
  3377   zmult_zminus ~> mult_minus_left
  3378   zmult_commute ~> mult_commute
  3379   zmult_assoc ~> mult_assoc
  3380   zadd_zmult_distrib ~> left_distrib
  3381   zadd_zmult_distrib2 ~> right_distrib
  3382   zdiff_zmult_distrib ~> left_diff_distrib
  3383   zdiff_zmult_distrib2 ~> right_diff_distrib
  3384   zmult_1 ~> mult_1_left
  3385   zmult_1_right ~> mult_1_right
  3386   zle_refl ~> order_refl
  3387   zle_trans ~> order_trans
  3388   zle_antisym ~> order_antisym
  3389   zle_linear ~> linorder_linear
  3390   zless_linear ~> linorder_less_linear
  3391   zadd_left_mono ~> add_left_mono
  3392   zadd_strict_right_mono ~> add_strict_right_mono
  3393   zadd_zless_mono ~> add_less_le_mono
  3394   int_0_less_1 ~> zero_less_one
  3395   int_0_neq_1 ~> zero_neq_one
  3396   zless_le ~> less_le
  3397   zpower_zadd_distrib ~> power_add
  3398   zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
  3399   zero_le_zpower_abs ~> zero_le_power_abs
  3400 
  3401 * Theory Deriv: Renamed
  3402 
  3403   DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
  3404 
  3405 * Theory Library/Multiset: Improved code generation of multisets.
  3406 
  3407 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
  3408 are expressed via type classes again. The special syntax
  3409 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
  3410 setsum_set, which is now subsumed by Big_Operators.setsum.
  3411 INCOMPATIBILITY.
  3412 
  3413 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
  3414 use theory HOL/Library/Nat_Bijection instead.
  3415 
  3416 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
  3417 trees is now inside a type class context.  Names of affected
  3418 operations and lemmas have been prefixed by rbt_.  INCOMPATIBILITY for
  3419 theories working directly with raw red-black trees, adapt the names as
  3420 follows:
  3421 
  3422   Operations:
  3423   bulkload -> rbt_bulkload
  3424   del_from_left -> rbt_del_from_left
  3425   del_from_right -> rbt_del_from_right
  3426   del -> rbt_del
  3427   delete -> rbt_delete
  3428   ins -> rbt_ins
  3429   insert -> rbt_insert
  3430   insertw -> rbt_insert_with
  3431   insert_with_key -> rbt_insert_with_key
  3432   map_entry -> rbt_map_entry
  3433   lookup -> rbt_lookup
  3434   sorted -> rbt_sorted
  3435   tree_greater -> rbt_greater
  3436   tree_less -> rbt_less
  3437   tree_less_symbol -> rbt_less_symbol
  3438   union -> rbt_union
  3439   union_with -> rbt_union_with
  3440   union_with_key -> rbt_union_with_key
  3441 
  3442   Lemmas:
  3443   balance_left_sorted -> balance_left_rbt_sorted
  3444   balance_left_tree_greater -> balance_left_rbt_greater
  3445   balance_left_tree_less -> balance_left_rbt_less
  3446   balance_right_sorted -> balance_right_rbt_sorted
  3447   balance_right_tree_greater -> balance_right_rbt_greater
  3448   balance_right_tree_less -> balance_right_rbt_less
  3449   balance_sorted -> balance_rbt_sorted
  3450   balance_tree_greater -> balance_rbt_greater
  3451   balance_tree_less -> balance_rbt_less
  3452   bulkload_is_rbt -> rbt_bulkload_is_rbt
  3453   combine_sorted -> combine_rbt_sorted
  3454   combine_tree_greater -> combine_rbt_greater
  3455   combine_tree_less -> combine_rbt_less
  3456   delete_in_tree -> rbt_delete_in_tree
  3457   delete_is_rbt -> rbt_delete_is_rbt
  3458   del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
  3459   del_from_left_tree_less -> rbt_del_from_left_rbt_less
  3460   del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
  3461   del_from_right_tree_less -> rbt_del_from_right_rbt_less
  3462   del_in_tree -> rbt_del_in_tree
  3463   del_inv1_inv2 -> rbt_del_inv1_inv2
  3464   del_sorted -> rbt_del_rbt_sorted
  3465   del_tree_greater -> rbt_del_rbt_greater
  3466   del_tree_less -> rbt_del_rbt_less
  3467   dom_lookup_Branch -> dom_rbt_lookup_Branch
  3468   entries_lookup -> entries_rbt_lookup
  3469   finite_dom_lookup -> finite_dom_rbt_lookup
  3470   insert_sorted -> rbt_insert_rbt_sorted
  3471   insertw_is_rbt -> rbt_insertw_is_rbt
  3472   insertwk_is_rbt -> rbt_insertwk_is_rbt
  3473   insertwk_sorted -> rbt_insertwk_rbt_sorted
  3474   insertw_sorted -> rbt_insertw_rbt_sorted
  3475   ins_sorted -> ins_rbt_sorted
  3476   ins_tree_greater -> ins_rbt_greater
  3477   ins_tree_less -> ins_rbt_less
  3478   is_rbt_sorted -> is_rbt_rbt_sorted
  3479   lookup_balance -> rbt_lookup_balance
  3480   lookup_bulkload -> rbt_lookup_rbt_bulkload
  3481   lookup_delete -> rbt_lookup_rbt_delete
  3482   lookup_Empty -> rbt_lookup_Empty
  3483   lookup_from_in_tree -> rbt_lookup_from_in_tree
  3484   lookup_in_tree -> rbt_lookup_in_tree
  3485   lookup_ins -> rbt_lookup_ins
  3486   lookup_insert -> rbt_lookup_rbt_insert
  3487   lookup_insertw -> rbt_lookup_rbt_insertw
  3488   lookup_insertwk -> rbt_lookup_rbt_insertwk
  3489   lookup_keys -> rbt_lookup_keys
  3490   lookup_map -> rbt_lookup_map
  3491   lookup_map_entry -> rbt_lookup_rbt_map_entry
  3492   lookup_tree_greater -> rbt_lookup_rbt_greater
  3493   lookup_tree_less -> rbt_lookup_rbt_less
  3494   lookup_union -> rbt_lookup_rbt_union
  3495   map_entry_color_of -> rbt_map_entry_color_of
  3496   map_entry_inv1 -> rbt_map_entry_inv1
  3497   map_entry_inv2 -> rbt_map_entry_inv2
  3498   map_entry_is_rbt -> rbt_map_entry_is_rbt
  3499   map_entry_sorted -> rbt_map_entry_rbt_sorted
  3500   map_entry_tree_greater -> rbt_map_entry_rbt_greater
  3501   map_entry_tree_less -> rbt_map_entry_rbt_less
  3502   map_tree_greater -> map_rbt_greater
  3503   map_tree_less -> map_rbt_less
  3504   map_sorted -> map_rbt_sorted
  3505   paint_sorted -> paint_rbt_sorted
  3506   paint_lookup -> paint_rbt_lookup
  3507   paint_tree_greater -> paint_rbt_greater
  3508   paint_tree_less -> paint_rbt_less
  3509   sorted_entries -> rbt_sorted_entries
  3510   tree_greater_eq_trans -> rbt_greater_eq_trans
  3511   tree_greater_nit -> rbt_greater_nit
  3512   tree_greater_prop -> rbt_greater_prop
  3513   tree_greater_simps -> rbt_greater_simps
  3514   tree_greater_trans -> rbt_greater_trans
  3515   tree_less_eq_trans -> rbt_less_eq_trans
  3516   tree_less_nit -> rbt_less_nit
  3517   tree_less_prop -> rbt_less_prop
  3518   tree_less_simps -> rbt_less_simps
  3519   tree_less_trans -> rbt_less_trans
  3520   tree_ord_props -> rbt_ord_props
  3521   union_Branch -> rbt_union_Branch
  3522   union_is_rbt -> rbt_union_is_rbt
  3523   unionw_is_rbt -> rbt_unionw_is_rbt
  3524   unionwk_is_rbt -> rbt_unionwk_is_rbt
  3525   unionwk_sorted -> rbt_unionwk_rbt_sorted
  3526 
  3527 * Theory HOL/Library/Float: Floating point numbers are now defined as
  3528 a subset of the real numbers.  All operations are defined using the
  3529 lifing-framework and proofs use the transfer method.  INCOMPATIBILITY.
  3530 
  3531   Changed Operations:
  3532   float_abs -> abs
  3533   float_nprt -> nprt
  3534   float_pprt -> pprt
  3535   pow2 -> use powr
  3536   round_down -> float_round_down
  3537   round_up -> float_round_up
  3538   scale -> exponent
  3539 
  3540   Removed Operations:
  3541   ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
  3542 
  3543   Renamed Lemmas:
  3544   abs_float_def -> Float.compute_float_abs
  3545   bitlen_ge0 -> bitlen_nonneg
  3546   bitlen.simps -> Float.compute_bitlen
  3547   float_components -> Float_mantissa_exponent
  3548   float_divl.simps -> Float.compute_float_divl
  3549   float_divr.simps -> Float.compute_float_divr
  3550   float_eq_odd -> mult_powr_eq_mult_powr_iff
  3551   float_power -> real_of_float_power
  3552   lapprox_posrat_def -> Float.compute_lapprox_posrat
  3553   lapprox_rat.simps -> Float.compute_lapprox_rat
  3554   le_float_def' -> Float.compute_float_le
  3555   le_float_def -> less_eq_float.rep_eq
  3556   less_float_def' -> Float.compute_float_less
  3557   less_float_def -> less_float.rep_eq
  3558   normfloat_def -> Float.compute_normfloat
  3559   normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
  3560   normfloat -> normfloat_def
  3561   normfloat_unique -> use normfloat_def
  3562   number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
  3563   one_float_def -> Float.compute_float_one
  3564   plus_float_def -> Float.compute_float_plus
  3565   rapprox_posrat_def -> Float.compute_rapprox_posrat
  3566   rapprox_rat.simps -> Float.compute_rapprox_rat
  3567   real_of_float_0 -> zero_float.rep_eq
  3568   real_of_float_1 -> one_float.rep_eq
  3569   real_of_float_abs -> abs_float.rep_eq
  3570   real_of_float_add -> plus_float.rep_eq
  3571   real_of_float_minus -> uminus_float.rep_eq
  3572   real_of_float_mult -> times_float.rep_eq
  3573   real_of_float_simp -> Float.rep_eq
  3574   real_of_float_sub -> minus_float.rep_eq
  3575   round_down.simps -> Float.compute_float_round_down
  3576   round_up.simps -> Float.compute_float_round_up
  3577   times_float_def -> Float.compute_float_times
  3578   uminus_float_def -> Float.compute_float_uminus
  3579   zero_float_def -> Float.compute_float_zero
  3580 
  3581   Lemmas not necessary anymore, use the transfer method:
  3582   bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
  3583   float_divr, float_le_simp, float_less1_mantissa_bound,
  3584   float_less_simp, float_less_zero, float_le_zero,
  3585   float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
  3586   floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
  3587   lapprox_rat_bottom, normalized_float, rapprox_posrat,
  3588   rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
  3589   real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
  3590   round_up, zero_le_float, zero_less_float
  3591 
  3592 * New theory HOL/Library/DAList provides an abstract type for
  3593 association lists with distinct keys.
  3594 
  3595 * Session HOL/IMP: Added new theory of abstract interpretation of
  3596 annotated commands.
  3597 
  3598 * Session HOL-Import: Re-implementation from scratch is faster,
  3599 simpler, and more scalable.  Requires a proof bundle, which is
  3600 available as an external component.  Discontinued old (and mostly
  3601 dead) Importer for HOL4 and HOL Light.  INCOMPATIBILITY.
  3602 
  3603 * Session HOL-Word: Discontinued many redundant theorems specific to
  3604 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
  3605 instead.
  3606 
  3607   word_sub_alt ~> word_sub_wi
  3608   word_add_alt ~> word_add_def
  3609   word_mult_alt ~> word_mult_def
  3610   word_minus_alt ~> word_minus_def
  3611   word_0_alt ~> word_0_wi
  3612   word_1_alt ~> word_1_wi
  3613   word_add_0 ~> add_0_left
  3614   word_add_0_right ~> add_0_right
  3615   word_mult_1 ~> mult_1_left
  3616   word_mult_1_right ~> mult_1_right
  3617   word_add_commute ~> add_commute
  3618   word_add_assoc ~> add_assoc
  3619   word_add_left_commute ~> add_left_commute
  3620   word_mult_commute ~> mult_commute
  3621   word_mult_assoc ~> mult_assoc
  3622   word_mult_left_commute ~> mult_left_commute
  3623   word_left_distrib ~> left_distrib
  3624   word_right_distrib ~> right_distrib
  3625   word_left_minus ~> left_minus
  3626   word_diff_0_right ~> diff_0_right
  3627   word_diff_self ~> diff_self
  3628   word_sub_def ~> diff_minus
  3629   word_diff_minus ~> diff_minus
  3630   word_add_ac ~> add_ac
  3631   word_mult_ac ~> mult_ac
  3632   word_plus_ac0 ~> add_0_left add_0_right add_ac
  3633   word_times_ac1 ~> mult_1_left mult_1_right mult_ac
  3634   word_order_trans ~> order_trans
  3635   word_order_refl ~> order_refl
  3636   word_order_antisym ~> order_antisym
  3637   word_order_linear ~> linorder_linear
  3638   lenw1_zero_neq_one ~> zero_neq_one
  3639   word_number_of_eq ~> number_of_eq
  3640   word_of_int_add_hom ~> wi_hom_add
  3641   word_of_int_sub_hom ~> wi_hom_sub
  3642   word_of_int_mult_hom ~> wi_hom_mult
  3643   word_of_int_minus_hom ~> wi_hom_neg
  3644   word_of_int_succ_hom ~> wi_hom_succ
  3645   word_of_int_pred_hom ~> wi_hom_pred
  3646   word_of_int_0_hom ~> word_0_wi
  3647   word_of_int_1_hom ~> word_1_wi
  3648 
  3649 * Session HOL-Word: New proof method "word_bitwise" for splitting
  3650 machine word equalities and inequalities into logical circuits,
  3651 defined in HOL/Word/WordBitwise.thy.  Supports addition, subtraction,
  3652 multiplication, shifting by constants, bitwise operators and numeric
  3653 constants.  Requires fixed-length word types, not 'a word.  Solves
  3654 many standard word identities outright and converts more into first
  3655 order problems amenable to blast or similar.  See also examples in
  3656 HOL/Word/Examples/WordExamples.thy.
  3657 
  3658 * Session HOL-Probability: Introduced the type "'a measure" to
  3659 represent measures, this replaces the records 'a algebra and 'a
  3660 measure_space.  The locales based on subset_class now have two
  3661 locale-parameters the space \<Omega> and the set of measurable sets M.
  3662 The product of probability spaces uses now the same constant as the
  3663 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
  3664 measure".  Most constants are defined now outside of locales and gain
  3665 an additional parameter, like null_sets, almost_eventually or \<mu>'.
  3666 Measure space constructions for distributions and densities now got
  3667 their own constants distr and density.  Instead of using locales to
  3668 describe measure spaces with a finite space, the measure count_space
  3669 and point_measure is introduced.  INCOMPATIBILITY.
  3670 
  3671   Renamed constants:
  3672   measure -> emeasure
  3673   finite_measure.\<mu>' -> measure
  3674   product_algebra_generator -> prod_algebra
  3675   product_prob_space.emb -> prod_emb
  3676   product_prob_space.infprod_algebra -> PiM
  3677 
  3678   Removed locales:
  3679   completeable_measure_space
  3680   finite_measure_space
  3681   finite_prob_space
  3682   finite_product_finite_prob_space
  3683   finite_product_sigma_algebra
  3684   finite_sigma_algebra
  3685   measure_space
  3686   pair_finite_prob_space
  3687   pair_finite_sigma_algebra
  3688   pair_finite_space
  3689   pair_sigma_algebra
  3690   product_sigma_algebra
  3691 
  3692   Removed constants:
  3693   conditional_space
  3694   distribution -> use distr measure, or distributed predicate
  3695   image_space
  3696   joint_distribution -> use distr measure, or distributed predicate
  3697   pair_measure_generator
  3698   product_prob_space.infprod_algebra -> use PiM
  3699   subvimage
  3700 
  3701   Replacement theorems:
  3702   finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
  3703   finite_measure.empty_measure -> measure_empty
  3704   finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
  3705   finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
  3706   finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
  3707   finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
  3708   finite_measure.finite_measure -> finite_measure.emeasure_finite
  3709   finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
  3710   finite_measure.positive_measure' -> measure_nonneg
  3711   finite_measure.real_measure -> finite_measure.emeasure_real
  3712   finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
  3713   finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
  3714   finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
  3715   information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
  3716   information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
  3717   information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
  3718   information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
  3719   information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
  3720   information_space.entropy_commute -> information_space.entropy_commute_simple
  3721   information_space.entropy_eq -> information_space.entropy_simple_distributed
  3722   information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
  3723   information_space.entropy_positive -> information_space.entropy_nonneg_simple
  3724   information_space.entropy_uniform_max -> information_space.entropy_uniform
  3725   information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
  3726   information_space.KL_eq_0 -> information_space.KL_same_eq_0
  3727   information_space.KL_ge_0 -> information_space.KL_nonneg
  3728   information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
  3729   information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
  3730   Int_stable_cuboids -> Int_stable_atLeastAtMost
  3731   Int_stable_product_algebra_generator -> positive_integral
  3732   measure_preserving -> equality "distr M N f = N" "f : measurable M N"
  3733   measure_space.additive -> emeasure_additive
  3734   measure_space.AE_iff_null_set -> AE_iff_null
  3735   measure_space.almost_everywhere_def -> eventually_ae_filter
  3736   measure_space.almost_everywhere_vimage -> AE_distrD
  3737   measure_space.continuity_from_above -> INF_emeasure_decseq
  3738   measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
  3739   measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
  3740   measure_space.continuity_from_below -> SUP_emeasure_incseq
  3741   measure_space_density -> emeasure_density
  3742   measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
  3743   measure_space.integrable_vimage -> integrable_distr
  3744   measure_space.integral_translated_density -> integral_density
  3745   measure_space.integral_vimage -> integral_distr
  3746   measure_space.measure_additive -> plus_emeasure
  3747   measure_space.measure_compl -> emeasure_compl
  3748   measure_space.measure_countable_increasing -> emeasure_countable_increasing
  3749   measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
  3750   measure_space.measure_decseq -> decseq_emeasure
  3751   measure_space.measure_Diff -> emeasure_Diff
  3752   measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
  3753   measure_space.measure_eq_0 -> emeasure_eq_0
  3754   measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
  3755   measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
  3756   measure_space.measure_incseq -> incseq_emeasure
  3757   measure_space.measure_insert -> emeasure_insert
  3758   measure_space.measure_mono -> emeasure_mono
  3759   measure_space.measure_not_negative -> emeasure_not_MInf
  3760   measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
  3761   measure_space.measure_setsum -> setsum_emeasure
  3762   measure_space.measure_setsum_split -> setsum_emeasure_cover
  3763   measure_space.measure_space_vimage -> emeasure_distr
  3764   measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
  3765   measure_space.measure_subadditive -> subadditive
  3766   measure_space.measure_top -> emeasure_space
  3767   measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
  3768   measure_space.measure_Un_null_set -> emeasure_Un_null_set
  3769   measure_space.positive_integral_translated_density -> positive_integral_density
  3770   measure_space.positive_integral_vimage -> positive_integral_distr
  3771   measure_space.real_continuity_from_above -> Lim_measure_decseq
  3772   measure_space.real_continuity_from_below -> Lim_measure_incseq
  3773   measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
  3774   measure_space.real_measure_Diff -> measure_Diff
  3775   measure_space.real_measure_finite_Union -> measure_finite_Union
  3776   measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
  3777   measure_space.real_measure_subadditive -> measure_subadditive
  3778   measure_space.real_measure_Union -> measure_Union
  3779   measure_space.real_measure_UNION -> measure_UNION
  3780   measure_space.simple_function_vimage -> simple_function_comp
  3781   measure_space.simple_integral_vimage -> simple_integral_distr
  3782   measure_space.simple_integral_vimage -> simple_integral_distr
  3783   measure_unique_Int_stable -> measure_eqI_generator_eq
  3784   measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
  3785   pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
  3786   pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
  3787   pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
  3788   pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
  3789   pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
  3790   pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
  3791   pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
  3792   pair_sigma_algebra.sets_swap -> sets_pair_swap
  3793   pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
  3794   pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
  3795   pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
  3796   pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
  3797   pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
  3798   pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
  3799   prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
  3800   prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
  3801   prob_space.measure_space_1 -> prob_space.emeasure_space_1
  3802   prob_space.prob_space_vimage -> prob_space_distr
  3803   prob_space.random_variable_restrict -> measurable_restrict
  3804   prob_space_unique_Int_stable -> measure_eqI_prob_space
  3805   product_algebraE -> prod_algebraE_all
  3806   product_algebra_generator_der -> prod_algebra_eq_finite
  3807   product_algebra_generator_into_space -> prod_algebra_sets_into_space
  3808   product_algebraI -> sets_PiM_I_finite
  3809   product_measure_exists -> product_sigma_finite.sigma_finite
  3810   product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
  3811   product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
  3812   product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
  3813   product_prob_space.measurable_component -> measurable_component_singleton
  3814   product_prob_space.measurable_emb -> measurable_prod_emb
  3815   product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
  3816   product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
  3817   product_prob_space.measure_emb -> emeasure_prod_emb
  3818   product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
  3819   product_sigma_algebra.product_algebra_into_space -> space_closed
  3820   product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
  3821   product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
  3822   product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
  3823   sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
  3824   sets_product_algebra -> sets_PiM
  3825   sigma_algebra.measurable_sigma -> measurable_measure_of
  3826   sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
  3827   sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
  3828   sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
  3829   space_product_algebra -> space_PiM
  3830 
  3831 * Session HOL-TPTP: support to parse and import TPTP problems (all
  3832 languages) into Isabelle/HOL.
  3833 
  3834 
  3835 *** FOL ***
  3836 
  3837 * New "case_product" attribute (see HOL).
  3838 
  3839 
  3840 *** ZF ***
  3841 
  3842 * Greater support for structured proofs involving induction or case
  3843 analysis.
  3844 
  3845 * Much greater use of mathematical symbols.
  3846 
  3847 * Removal of many ML theorem bindings.  INCOMPATIBILITY.
  3848 
  3849 
  3850 *** ML ***
  3851 
  3852 * Antiquotation @{keyword "name"} produces a parser for outer syntax
  3853 from a minor keyword introduced via theory header declaration.
  3854 
  3855 * Antiquotation @{command_spec "name"} produces the
  3856 Outer_Syntax.command_spec from a major keyword introduced via theory
  3857 header declaration; it can be passed to Outer_Syntax.command etc.
  3858 
  3859 * Local_Theory.define no longer hard-wires default theorem name
  3860 "foo_def", but retains the binding as given.  If that is Binding.empty
  3861 / Attrib.empty_binding, the result is not registered as user-level
  3862 fact.  The Local_Theory.define_internal variant allows to specify a
  3863 non-empty name (used for the foundation in the background theory),
  3864 while omitting the fact binding in the user-context.  Potential
  3865 INCOMPATIBILITY for derived definitional packages: need to specify
  3866 naming policy for primitive definitions more explicitly.
  3867 
  3868 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
  3869 conformance with similar operations in structure Term and Logic.
  3870 
  3871 * Antiquotation @{attributes [...]} embeds attribute source
  3872 representation into the ML text, which is particularly useful with
  3873 declarations like Local_Theory.note.
  3874 
  3875 * Structure Proof_Context follows standard naming scheme.  Old
  3876 ProofContext has been discontinued.  INCOMPATIBILITY.
  3877 
  3878 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
  3879 change of semantics: update is applied to auxiliary local theory
  3880 context as well.
  3881 
  3882 * Modernized some old-style infix operations:
  3883 
  3884   addeqcongs    ~> Simplifier.add_eqcong
  3885   deleqcongs    ~> Simplifier.del_eqcong
  3886   addcongs      ~> Simplifier.add_cong
  3887   delcongs      ~> Simplifier.del_cong
  3888   setmksimps    ~> Simplifier.set_mksimps
  3889   setmkcong     ~> Simplifier.set_mkcong
  3890   setmksym      ~> Simplifier.set_mksym
  3891   setmkeqTrue   ~> Simplifier.set_mkeqTrue
  3892   settermless   ~> Simplifier.set_termless
  3893   setsubgoaler  ~> Simplifier.set_subgoaler
  3894   addsplits     ~> Splitter.add_split
  3895   delsplits     ~> Splitter.del_split
  3896 
  3897 
  3898 *** System ***
  3899 
  3900 * USER_HOME settings variable points to cross-platform user home
  3901 directory, which coincides with HOME on POSIX systems only.  Likewise,
  3902 the Isabelle path specification "~" now expands to $USER_HOME, instead
  3903 of former $HOME.  A different default for USER_HOME may be set
  3904 explicitly in shell environment, before Isabelle settings are
  3905 evaluated.  Minor INCOMPATIBILITY: need to adapt Isabelle path where
  3906 the generic user home was intended.
  3907 
  3908 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
  3909 notation, which is useful for the jEdit file browser, for example.
  3910 
  3911 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
  3912 (not just JRE).
  3913 
  3914 
  3915 
  3916 New in Isabelle2011-1 (October 2011)
  3917 ------------------------------------
  3918 
  3919 *** General ***
  3920 
  3921 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
  3922 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
  3923 
  3924   - Management of multiple theory files directly from the editor
  3925     buffer store -- bypassing the file-system (no requirement to save
  3926     files for checking).
  3927 
  3928   - Markup of formal entities within the text buffer, with semantic
  3929     highlighting, tooltips and hyperlinks to jump to defining source
  3930     positions.
  3931 
  3932   - Improved text rendering, with sub/superscripts in the source
  3933     buffer (including support for copy/paste wrt. output panel, HTML
  3934     theory output and other non-Isabelle text boxes).
  3935 
  3936   - Refined scheduling of proof checking and printing of results,
  3937     based on interactive editor view.  (Note: jEdit folding and
  3938     narrowing allows to restrict buffer perspectives explicitly.)
  3939 
  3940   - Reduced CPU performance requirements, usable on machines with few
  3941     cores.
  3942 
  3943   - Reduced memory requirements due to pruning of unused document
  3944     versions (garbage collection).
  3945 
  3946 See also ~~/src/Tools/jEdit/README.html for further information,
  3947 including some remaining limitations.
  3948 
  3949 * Theory loader: source files are exclusively located via the master
  3950 directory of each theory node (where the .thy file itself resides).
  3951 The global load path (such as src/HOL/Library) has been discontinued.
  3952 Note that the path element ~~ may be used to reference theories in the
  3953 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
  3954 INCOMPATIBILITY.
  3955 
  3956 * Theory loader: source files are identified by content via SHA1
  3957 digests.  Discontinued former path/modtime identification and optional
  3958 ISABELLE_FILE_IDENT plugin scripts.
  3959 
  3960 * Parallelization of nested Isar proofs is subject to
  3961 Goal.parallel_proofs_threshold (default 100).  See also isabelle
  3962 usedir option -Q.
  3963 
  3964 * Name space: former unsynchronized references are now proper
  3965 configuration options, with more conventional names:
  3966 
  3967   long_names   ~> names_long
  3968   short_names  ~> names_short
  3969   unique_names ~> names_unique
  3970 
  3971 Minor INCOMPATIBILITY, need to declare options in context like this:
  3972 
  3973   declare [[names_unique = false]]
  3974 
  3975 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`.  Note
  3976 that the result needs to be unique, which means fact specifications
  3977 may have to be refined after enriching a proof context.
  3978 
  3979 * Attribute "case_names" has been refined: the assumptions in each case
  3980 can be named now by following the case name with [name1 name2 ...].
  3981 
  3982 * Isabelle/Isar reference manual has been updated and extended:
  3983   - "Synopsis" provides a catalog of main Isar language concepts.
  3984   - Formal references in syntax diagrams, via @{rail} antiquotation.
  3985   - Updated material from classic "ref" manual, notably about
  3986     "Classical Reasoner".
  3987 
  3988 
  3989 *** HOL ***
  3990 
  3991 * Class bot and top require underlying partial order rather than
  3992 preorder: uniqueness of bot and top is guaranteed.  INCOMPATIBILITY.
  3993 
  3994 * Class complete_lattice: generalized a couple of lemmas from sets;
  3995 generalized theorems INF_cong and SUP_cong.  New type classes for
  3996 complete boolean algebras and complete linear orders.  Lemmas
  3997 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
  3998 class complete_linorder.
  3999 
  4000 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
  4001 Sup_fun_def, Inf_apply, Sup_apply.
  4002 
  4003 Removed redundant lemmas (the right hand side gives hints how to
  4004 replace them for (metis ...), or (simp only: ...) proofs):
  4005 
  4006   Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
  4007   Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
  4008   Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
  4009   Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
  4010   Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
  4011   Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
  4012   Inter_def ~> INF_def, image_def
  4013   Union_def ~> SUP_def, image_def
  4014   INT_eq ~> INF_def, and image_def
  4015   UN_eq ~> SUP_def, and image_def
  4016   INF_subset ~> INF_superset_mono [OF _ order_refl]
  4017 
  4018 More consistent and comprehensive names:
  4019 
  4020   INTER_eq_Inter_image ~> INF_def
  4021   UNION_eq_Union_image ~> SUP_def
  4022   INFI_def ~> INF_def
  4023   SUPR_def ~> SUP_def
  4024   INF_leI ~> INF_lower
  4025   INF_leI2 ~> INF_lower2
  4026   le_INFI ~> INF_greatest
  4027   le_SUPI ~> SUP_upper
  4028   le_SUPI2 ~> SUP_upper2
  4029   SUP_leI ~> SUP_least
  4030   INFI_bool_eq ~> INF_bool_eq
  4031   SUPR_bool_eq ~> SUP_bool_eq
  4032   INFI_apply ~> INF_apply
  4033   SUPR_apply ~> SUP_apply
  4034   INTER_def ~> INTER_eq
  4035   UNION_def ~> UNION_eq
  4036 
  4037 INCOMPATIBILITY.
  4038 
  4039 * Renamed theory Complete_Lattice to Complete_Lattices.
  4040 INCOMPATIBILITY.
  4041 
  4042 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
  4043 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
  4044 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
  4045 Sup_insert are now declared as [simp].  INCOMPATIBILITY.
  4046 
  4047 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
  4048 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
  4049 sup_inf_absob, sup_left_idem are now declared as [simp].  Minor
  4050 INCOMPATIBILITY.
  4051 
  4052 * Added syntactic classes "inf" and "sup" for the respective
  4053 constants.  INCOMPATIBILITY: Changes in the argument order of the
  4054 (mostly internal) locale predicates for some derived classes.
  4055 
  4056 * Theorem collections ball_simps and bex_simps do not contain theorems
  4057 referring to UNION any longer; these have been moved to collection
  4058 UN_ball_bex_simps.  INCOMPATIBILITY.
  4059 
  4060 * Theory Archimedean_Field: floor now is defined as parameter of a
  4061 separate type class floor_ceiling.
  4062 
  4063 * Theory Finite_Set: more coherent development of fold_set locales:
  4064 
  4065     locale fun_left_comm ~> locale comp_fun_commute
  4066     locale fun_left_comm_idem ~> locale comp_fun_idem
  4067 
  4068 Both use point-free characterization; interpretation proofs may need
  4069 adjustment.  INCOMPATIBILITY.
  4070 
  4071 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
  4072 accordance with standard mathematical terminology. INCOMPATIBILITY.
  4073 
  4074 * Theory Complex_Main: The locale interpretations for the
  4075 bounded_linear and bounded_bilinear locales have been removed, in
  4076 order to reduce the number of duplicate lemmas. Users must use the
  4077 original names for distributivity theorems, potential INCOMPATIBILITY.
  4078 
  4079   divide.add ~> add_divide_distrib
  4080   divide.diff ~> diff_divide_distrib
  4081   divide.setsum ~> setsum_divide_distrib
  4082   mult.add_right ~> right_distrib
  4083   mult.diff_right ~> right_diff_distrib
  4084   mult_right.setsum ~> setsum_right_distrib
  4085   mult_left.diff ~> left_diff_distrib
  4086 
  4087 * Theory Complex_Main: Several redundant theorems have been removed or
  4088 replaced by more general versions. INCOMPATIBILITY.
  4089 
  4090   real_diff_def ~> minus_real_def
  4091   real_divide_def ~> divide_real_def
  4092   real_less_def ~> less_le
  4093   real_abs_def ~> abs_real_def
  4094   real_sgn_def ~> sgn_real_def
  4095   real_mult_commute ~> mult_commute
  4096   real_mult_assoc ~> mult_assoc
  4097   real_mult_1 ~> mult_1_left
  4098   real_add_mult_distrib ~> left_distrib
  4099   real_zero_not_eq_one ~> zero_neq_one
  4100   real_mult_inverse_left ~> left_inverse
  4101   INVERSE_ZERO ~> inverse_zero
  4102   real_le_refl ~> order_refl
  4103   real_le_antisym ~> order_antisym
  4104   real_le_trans ~> order_trans
  4105   real_le_linear ~> linear
  4106   real_le_eq_diff ~> le_iff_diff_le_0
  4107   real_add_left_mono ~> add_left_mono
  4108   real_mult_order ~> mult_pos_pos
  4109   real_mult_less_mono2 ~> mult_strict_left_mono
  4110   real_of_int_real_of_nat ~> real_of_int_of_nat_eq
  4111   real_0_le_divide_iff ~> zero_le_divide_iff
  4112   realpow_two_disj ~> power2_eq_iff
  4113   real_squared_diff_one_factored ~> square_diff_one_factored
  4114   realpow_two_diff ~> square_diff_square_factored
  4115   reals_complete2 ~> complete_real
  4116   real_sum_squared_expand ~> power2_sum
  4117   exp_ln_eq ~> ln_unique
  4118   expi_add ~> exp_add
  4119   expi_zero ~> exp_zero
  4120   lemma_DERIV_subst ~> DERIV_cong
  4121   LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
  4122   LIMSEQ_const ~> tendsto_const
  4123   LIMSEQ_norm ~> tendsto_norm
  4124   LIMSEQ_add ~> tendsto_add
  4125   LIMSEQ_minus ~> tendsto_minus
  4126   LIMSEQ_minus_cancel ~> tendsto_minus_cancel
  4127   LIMSEQ_diff ~> tendsto_diff
  4128   bounded_linear.LIMSEQ ~> bounded_linear.tendsto
  4129   bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
  4130   LIMSEQ_mult ~> tendsto_mult
  4131   LIMSEQ_inverse ~> tendsto_inverse
  4132   LIMSEQ_divide ~> tendsto_divide
  4133   LIMSEQ_pow ~> tendsto_power
  4134   LIMSEQ_setsum ~> tendsto_setsum
  4135   LIMSEQ_setprod ~> tendsto_setprod
  4136   LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
  4137   LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
  4138   LIMSEQ_imp_rabs ~> tendsto_rabs
  4139   LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
  4140   LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
  4141   LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
  4142   LIMSEQ_Complex ~> tendsto_Complex
  4143   LIM_ident ~> tendsto_ident_at
  4144   LIM_const ~> tendsto_const
  4145   LIM_add ~> tendsto_add
  4146   LIM_add_zero ~> tendsto_add_zero
  4147   LIM_minus ~> tendsto_minus
  4148   LIM_diff ~> tendsto_diff
  4149   LIM_norm ~> tendsto_norm
  4150   LIM_norm_zero ~> tendsto_norm_zero
  4151   LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
  4152   LIM_norm_zero_iff ~> tendsto_norm_zero_iff
  4153   LIM_rabs ~> tendsto_rabs
  4154   LIM_rabs_zero ~> tendsto_rabs_zero
  4155   LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
  4156   LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
  4157   LIM_compose ~> tendsto_compose
  4158   LIM_mult ~> tendsto_mult
  4159   LIM_scaleR ~> tendsto_scaleR
  4160   LIM_of_real ~> tendsto_of_real
  4161   LIM_power ~> tendsto_power
  4162   LIM_inverse ~> tendsto_inverse
  4163   LIM_sgn ~> tendsto_sgn
  4164   isCont_LIM_compose ~> isCont_tendsto_compose
  4165   bounded_linear.LIM ~> bounded_linear.tendsto
  4166   bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
  4167   bounded_bilinear.LIM ~> bounded_bilinear.tendsto
  4168   bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
  4169   bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
  4170   bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
  4171   LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
  4172 
  4173 * Theory Complex_Main: The definition of infinite series was
  4174 generalized.  Now it is defined on the type class {topological_space,
  4175 comm_monoid_add}.  Hence it is useable also for extended real numbers.
  4176 
  4177 * Theory Complex_Main: The complex exponential function "expi" is now
  4178 a type-constrained abbreviation for "exp :: complex => complex"; thus
  4179 several polymorphic lemmas about "exp" are now applicable to "expi".
  4180 
  4181 * Code generation:
  4182 
  4183   - Theory Library/Code_Char_ord provides native ordering of
  4184     characters in the target language.
  4185 
  4186   - Commands code_module and code_library are legacy, use export_code
  4187     instead.
  4188 
  4189   - Method "evaluation" is legacy, use method "eval" instead.
  4190 
  4191   - Legacy evaluator "SML" is deactivated by default.  May be
  4192     reactivated by the following theory command:
  4193 
  4194       setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
  4195 
  4196 * Declare ext [intro] by default.  Rare INCOMPATIBILITY.
  4197 
  4198 * New proof method "induction" that gives induction hypotheses the
  4199 name "IH", thus distinguishing them from further hypotheses that come
  4200 from rule induction.  The latter are still called "hyps".  Method
  4201 "induction" is a thin wrapper around "induct" and follows the same
  4202 syntax.
  4203 
  4204 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
  4205 still available as a legacy feature for some time.
  4206 
  4207 * Nitpick:
  4208   - Added "need" and "total_consts" options.
  4209   - Reintroduced "show_skolems" option by popular demand.
  4210   - Renamed attribute: nitpick_def ~> nitpick_unfold.
  4211     INCOMPATIBILITY.
  4212 
  4213 * Sledgehammer:
  4214   - Use quasi-sound (and efficient) translations by default.
  4215   - Added support for the following provers: E-ToFoF, LEO-II,
  4216     Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
  4217   - Automatically preplay and minimize proofs before showing them if
  4218     this can be done within reasonable time.
  4219   - sledgehammer available_provers ~> sledgehammer supported_provers.
  4220     INCOMPATIBILITY.
  4221   - Added "preplay_timeout", "slicing", "type_enc", "sound",
  4222     "max_mono_iters", and "max_new_mono_instances" options.
  4223   - Removed "explicit_apply" and "full_types" options as well as "Full
  4224     Types" Proof General menu item. INCOMPATIBILITY.
  4225 
  4226 * Metis:
  4227   - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
  4228   - Obsoleted "metisFT" -- use "metis (full_types)" instead.
  4229     INCOMPATIBILITY.
  4230 
  4231 * Command 'try':
  4232   - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
  4233     "elim:" options. INCOMPATIBILITY.
  4234   - Introduced 'try' that not only runs 'try_methods' but also
  4235     'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
  4236 
  4237 * Quickcheck:
  4238   - Added "eval" option to evaluate terms for the found counterexample
  4239     (currently only supported by the default (exhaustive) tester).
  4240   - Added post-processing of terms to obtain readable counterexamples
  4241     (currently only supported by the default (exhaustive) tester).
  4242   - New counterexample generator quickcheck[narrowing] enables
  4243     narrowing-based testing.  Requires the Glasgow Haskell compiler
  4244     with its installation location defined in the Isabelle settings
  4245     environment as ISABELLE_GHC.
  4246   - Removed quickcheck tester "SML" based on the SML code generator
  4247     (formly in HOL/Library).
  4248 
  4249 * Function package: discontinued option "tailrec".  INCOMPATIBILITY,
  4250 use 'partial_function' instead.
  4251 
  4252 * Theory Library/Extended_Reals replaces now the positive extended
  4253 reals found in probability theory. This file is extended by
  4254 Multivariate_Analysis/Extended_Real_Limits.
  4255 
  4256 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
  4257 from where it must be imported explicitly if it is really required.
  4258 INCOMPATIBILITY.
  4259 
  4260 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
  4261 been moved here.  INCOMPATIBILITY.
  4262 
  4263 * Theory Library/Saturated provides type of numbers with saturated
  4264 arithmetic.
  4265 
  4266 * Theory Library/Product_Lattice defines a pointwise ordering for the
  4267 product type 'a * 'b, and provides instance proofs for various order
  4268 and lattice type classes.
  4269 
  4270 * Theory Library/Countable now provides the "countable_datatype" proof
  4271 method for proving "countable" class instances for datatypes.
  4272 
  4273 * Theory Library/Cset_Monad allows do notation for computable sets
  4274 (cset) via the generic monad ad-hoc overloading facility.
  4275 
  4276 * Library: Theories of common data structures are split into theories
  4277 for implementation, an invariant-ensuring type, and connection to an
  4278 abstract type. INCOMPATIBILITY.
  4279 
  4280   - RBT is split into RBT and RBT_Mapping.
  4281   - AssocList is split and renamed into AList and AList_Mapping.
  4282   - DList is split into DList_Impl, DList, and DList_Cset.
  4283   - Cset is split into Cset and List_Cset.
  4284 
  4285 * Theory Library/Nat_Infinity has been renamed to
  4286 Library/Extended_Nat, with name changes of the following types and
  4287 constants:
  4288 
  4289   type inat   ~> type enat
  4290   Fin         ~> enat
  4291   Infty       ~> infinity (overloaded)
  4292   iSuc        ~> eSuc
  4293   the_Fin     ~> the_enat
  4294 
  4295 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
  4296 been renamed accordingly. INCOMPATIBILITY.
  4297 
  4298 * Session Multivariate_Analysis: The euclidean_space type class now
  4299 fixes a constant "Basis :: 'a set" consisting of the standard
  4300 orthonormal basis for the type. Users now have the option of
  4301 quantifying over this set instead of using the "basis" function, e.g.
  4302 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
  4303 
  4304 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
  4305 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
  4306 "Cart_nth" and "Cart_lambda" have been respectively renamed to
  4307 "vec_nth" and "vec_lambda"; theorems mentioning those names have
  4308 changed to match. Definition theorems for overloaded constants now use
  4309 the standard "foo_vec_def" naming scheme. A few other theorems have
  4310 been renamed as follows (INCOMPATIBILITY):
  4311 
  4312   Cart_eq          ~> vec_eq_iff
  4313   dist_nth_le_cart ~> dist_vec_nth_le
  4314   tendsto_vector   ~> vec_tendstoI
  4315   Cauchy_vector    ~> vec_CauchyI
  4316 
  4317 * Session Multivariate_Analysis: Several duplicate theorems have been
  4318 removed, and other theorems have been renamed or replaced with more
  4319 general versions. INCOMPATIBILITY.
  4320 
  4321   finite_choice ~> finite_set_choice
  4322   eventually_conjI ~> eventually_conj
  4323   eventually_and ~> eventually_conj_iff
  4324   eventually_false ~> eventually_False
  4325   setsum_norm ~> norm_setsum
  4326   Lim_sequentially ~> LIMSEQ_def
  4327   Lim_ident_at ~> LIM_ident
  4328   Lim_const ~> tendsto_const
  4329   Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
  4330   Lim_neg ~> tendsto_minus
  4331   Lim_add ~> tendsto_add
  4332   Lim_sub ~> tendsto_diff
  4333   Lim_mul ~> tendsto_scaleR
  4334   Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
  4335   Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
  4336   Lim_linear ~> bounded_linear.tendsto
  4337   Lim_component ~> tendsto_euclidean_component
  4338   Lim_component_cart ~> tendsto_vec_nth
  4339   Lim_inner ~> tendsto_inner [OF tendsto_const]
  4340   dot_lsum ~> inner_setsum_left
  4341   dot_rsum ~> inner_setsum_right
  4342   continuous_cmul ~> continuous_scaleR [OF continuous_const]
  4343   continuous_neg ~> continuous_minus
  4344   continuous_sub ~> continuous_diff
  4345   continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
  4346   continuous_mul ~> continuous_scaleR
  4347   continuous_inv ~> continuous_inverse
  4348   continuous_at_within_inv ~> continuous_at_within_inverse
  4349   continuous_at_inv ~> continuous_at_inverse
  4350   continuous_at_norm ~> continuous_norm [OF continuous_at_id]
  4351   continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
  4352   continuous_at_component ~> continuous_component [OF continuous_at_id]
  4353   continuous_on_neg ~> continuous_on_minus
  4354   continuous_on_sub ~> continuous_on_diff
  4355   continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
  4356   continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
  4357   continuous_on_mul ~> continuous_on_scaleR
  4358   continuous_on_mul_real ~> continuous_on_mult
  4359   continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
  4360   continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
  4361   continuous_on_inverse ~> continuous_on_inv
  4362   uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
  4363   uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
  4364   subset_interior ~> interior_mono
  4365   subset_closure ~> closure_mono
  4366   closure_univ ~> closure_UNIV
  4367   real_arch_lt ~> reals_Archimedean2
  4368   real_arch ~> reals_Archimedean3
  4369   real_abs_norm ~> abs_norm_cancel
  4370   real_abs_sub_norm ~> norm_triangle_ineq3
  4371   norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
  4372 
  4373 * Session HOL-Probability:
  4374   - Caratheodory's extension lemma is now proved for ring_of_sets.
  4375   - Infinite products of probability measures are now available.
  4376   - Sigma closure is independent, if the generator is independent
  4377   - Use extended reals instead of positive extended
  4378     reals. INCOMPATIBILITY.
  4379 
  4380 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
  4381 
  4382   expand_fun_below ~> fun_below_iff
  4383   below_fun_ext ~> fun_belowI
  4384   expand_cfun_eq ~> cfun_eq_iff
  4385   ext_cfun ~> cfun_eqI
  4386   expand_cfun_below ~> cfun_below_iff
  4387   below_cfun_ext ~> cfun_belowI
  4388   monofun_fun_fun ~> fun_belowD
  4389   monofun_fun_arg ~> monofunE
  4390   monofun_lub_fun ~> adm_monofun [THEN admD]
  4391   cont_lub_fun ~> adm_cont [THEN admD]
  4392   cont2cont_Rep_CFun ~> cont2cont_APP
  4393   cont_Rep_CFun_app ~> cont_APP_app
  4394   cont_Rep_CFun_app_app ~> cont_APP_app_app
  4395   cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
  4396   cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
  4397   contlub_cfun ~> lub_APP [symmetric]
  4398   contlub_LAM ~> lub_LAM [symmetric]
  4399   thelubI ~> lub_eqI
  4400   UU_I ~> bottomI
  4401   lift_distinct1 ~> lift.distinct(1)
  4402   lift_distinct2 ~> lift.distinct(2)
  4403   Def_not_UU ~> lift.distinct(2)
  4404   Def_inject ~> lift.inject
  4405   below_UU_iff ~> below_bottom_iff
  4406   eq_UU_iff ~> eq_bottom_iff
  4407 
  4408 
  4409 *** Document preparation ***
  4410 
  4411 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
  4412 isar-ref manual, both for description and actual application of the
  4413 same.
  4414 
  4415 * Antiquotation @{value} evaluates the given term and presents its
  4416 result.
  4417 
  4418 * Antiquotations: term style "isub" provides ad-hoc conversion of
  4419 variables x1, y23 into subscripted form x\<^isub>1,
  4420 y\<^isub>2\<^isub>3.
  4421 
  4422 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
  4423 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
  4424 
  4425 * Localized \isabellestyle switch can be used within blocks or groups
  4426 like this:
  4427 
  4428   \isabellestyle{it}  %preferred default
  4429   {\isabellestylett @{text "typewriter stuff"}}
  4430 
  4431 * Discontinued special treatment of hard tabulators.  Implicit
  4432 tab-width is now defined as 1.  Potential INCOMPATIBILITY for visual
  4433 layouts.
  4434 
  4435 
  4436 *** ML ***
  4437 
  4438 * The inner syntax of sort/type/term/prop supports inlined YXML
  4439 representations within quoted string tokens.  By encoding logical
  4440 entities via Term_XML (in ML or Scala) concrete syntax can be
  4441 bypassed, which is particularly useful for producing bits of text
  4442 under external program control.
  4443 
  4444 * Antiquotations for ML and document preparation are managed as theory
  4445 data, which requires explicit setup.
  4446 
  4447 * Isabelle_Process.is_active allows tools to check if the official
  4448 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
  4449 (better known as Proof General).
  4450 
  4451 * Structure Proof_Context follows standard naming scheme.  Old
  4452 ProofContext is still available for some time as legacy alias.
  4453 
  4454 * Structure Timing provides various operations for timing; supersedes
  4455 former start_timing/end_timing etc.
  4456 
  4457 * Path.print is the official way to show file-system paths to users
  4458 (including quotes etc.).
  4459 
  4460 * Inner syntax: identifiers in parse trees of generic categories
  4461 "logic", "aprop", "idt" etc. carry position information (disguised as
  4462 type constraints).  Occasional INCOMPATIBILITY with non-compliant
  4463 translations that choke on unexpected type constraints.  Positions can
  4464 be stripped in ML translations via Syntax.strip_positions /
  4465 Syntax.strip_positions_ast, or via the syntax constant
  4466 "_strip_positions" within parse trees.  As last resort, positions can
  4467 be disabled via the configuration option Syntax.positions, which is
  4468 called "syntax_positions" in Isar attribute syntax.
  4469 
  4470 * Discontinued special status of various ML structures that contribute
  4471 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
  4472 pervasive content, no inclusion in structure Syntax.  INCOMPATIBILITY,
  4473 refer directly to Ast.Constant, Lexicon.is_identifier,
  4474 Syntax_Trans.mk_binder_tr etc.
  4475 
  4476 * Typed print translation: discontinued show_sorts argument, which is
  4477 already available via context of "advanced" translation.
  4478 
  4479 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
  4480 goal states; body tactic needs to address all subgoals uniformly.
  4481 
  4482 * Slightly more special eq_list/eq_set, with shortcut involving
  4483 pointer equality (assumes that eq relation is reflexive).
  4484 
  4485 * Classical tactics use proper Proof.context instead of historic types
  4486 claset/clasimpset.  Old-style declarations like addIs, addEs, addDs
  4487 operate directly on Proof.context.  Raw type claset retains its use as
  4488 snapshot of the classical context, which can be recovered via
  4489 (put_claset HOL_cs) etc.  Type clasimpset has been discontinued.
  4490 INCOMPATIBILITY, classical tactics and derived proof methods require
  4491 proper Proof.context.
  4492 
  4493 
  4494 *** System ***
  4495 
  4496 * Discontinued support for Poly/ML 5.2, which was the last version
  4497 without proper multithreading and TimeLimit implementation.
  4498 
  4499 * Discontinued old lib/scripts/polyml-platform, which has been
  4500 obsolete since Isabelle2009-2.
  4501 
  4502 * Various optional external tools are referenced more robustly and
  4503 uniformly by explicit Isabelle settings as follows:
  4504 
  4505   ISABELLE_CSDP   (formerly CSDP_EXE)
  4506   ISABELLE_GHC    (formerly EXEC_GHC or GHC_PATH)
  4507   ISABELLE_OCAML  (formerly EXEC_OCAML)
  4508   ISABELLE_SWIPL  (formerly EXEC_SWIPL)
  4509   ISABELLE_YAP    (formerly EXEC_YAP)
  4510 
  4511 Note that automated detection from the file-system or search path has
  4512 been discontinued.  INCOMPATIBILITY.
  4513 
  4514 * Scala layer provides JVM method invocation service for static
  4515 methods of type (String)String, see Invoke_Scala.method in ML.  For
  4516 example:
  4517 
  4518   Invoke_Scala.method "java.lang.System.getProperty" "java.home"
  4519 
  4520 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
  4521 this allows to pass structured values between ML and Scala.
  4522 
  4523 * The IsabelleText fonts includes some further glyphs to support the
  4524 Prover IDE.  Potential INCOMPATIBILITY: users who happen to have
  4525 installed a local copy (which is normally *not* required) need to
  4526 delete or update it from ~~/lib/fonts/.
  4527 
  4528 
  4529 
  4530 New in Isabelle2011 (January 2011)
  4531 ----------------------------------
  4532 
  4533 *** General ***
  4534 
  4535 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
  4536 src/Tools/jEdit).  This also serves as IDE for Isabelle/ML, with
  4537 useful tooltips and hyperlinks produced from its static analysis.  The
  4538 bundled component provides an executable Isabelle tool that can be run
  4539 like this:
  4540 
  4541   Isabelle2011/bin/isabelle jedit
  4542 
  4543 * Significantly improved Isabelle/Isar implementation manual.
  4544 
  4545 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
  4546 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
  4547 while the default heap location within that directory lacks that extra
  4548 suffix.  This isolates multiple Isabelle installations from each
  4549 other, avoiding problems with old settings in new versions.
  4550 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
  4551 
  4552 * Source files are always encoded as UTF-8, instead of old-fashioned
  4553 ISO-Latin-1.  INCOMPATIBILITY.  Isabelle LaTeX documents might require
  4554 the following package declarations:
  4555 
  4556   \usepackage[utf8]{inputenc}
  4557   \usepackage{textcomp}
  4558 
  4559 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
  4560 a Unicode character is treated as a single symbol, not a sequence of
  4561 non-ASCII bytes as before.  Since Isabelle/ML string literals may
  4562 contain symbols without further backslash escapes, Unicode can now be
  4563 used here as well.  Recall that Symbol.explode in ML provides a
  4564 consistent view on symbols, while raw explode (or String.explode)
  4565 merely give a byte-oriented representation.
  4566 
  4567 * Theory loader: source files are primarily located via the master
  4568 directory of each theory node (where the .thy file itself resides).
  4569 The global load path is still partially available as legacy feature.
  4570 Minor INCOMPATIBILITY due to subtle change in file lookup: use
  4571 explicit paths, relatively to the theory.
  4572 
  4573 * Special treatment of ML file names has been discontinued.
  4574 Historically, optional extensions .ML or .sml were added on demand --
  4575 at the cost of clarity of file dependencies.  Recall that Isabelle/ML
  4576 files exclusively use the .ML extension.  Minor INCOMPATIBILITY.
  4577 
  4578 * Various options that affect pretty printing etc. are now properly
  4579 handled within the context via configuration options, instead of
  4580 unsynchronized references or print modes.  There are both ML Config.T
  4581 entities and Isar declaration attributes to access these.
  4582 
  4583   ML (Config.T)                 Isar (attribute)
  4584 
  4585   eta_contract                  eta_contract
  4586   show_brackets                 show_brackets
  4587   show_sorts                    show_sorts
  4588   show_types                    show_types
  4589   show_question_marks           show_question_marks
  4590   show_consts                   show_consts
  4591   show_abbrevs                  show_abbrevs
  4592 
  4593   Syntax.ast_trace              syntax_ast_trace
  4594   Syntax.ast_stat               syntax_ast_stat
  4595   Syntax.ambiguity_level        syntax_ambiguity_level
  4596 
  4597   Goal_Display.goals_limit      goals_limit
  4598   Goal_Display.show_main_goal   show_main_goal
  4599 
  4600   Method.rule_trace             rule_trace
  4601 
  4602   Thy_Output.display            thy_output_display
  4603   Thy_Output.quotes             thy_output_quotes
  4604   Thy_Output.indent             thy_output_indent
  4605   Thy_Output.source             thy_output_source
  4606   Thy_Output.break              thy_output_break
  4607 
  4608 Note that corresponding "..._default" references in ML may only be
  4609 changed globally at the ROOT session setup, but *not* within a theory.
  4610 The option "show_abbrevs" supersedes the former print mode
  4611 "no_abbrevs" with inverted meaning.
  4612 
  4613 * More systematic naming of some configuration options.
  4614 INCOMPATIBILITY.
  4615 
  4616   trace_simp  ~>  simp_trace
  4617   debug_simp  ~>  simp_debug
  4618 
  4619 * Support for real valued configuration options, using simplistic
  4620 floating-point notation that coincides with the inner syntax for
  4621 float_token.
  4622 
  4623 * Support for real valued preferences (with approximative PGIP type):
  4624 front-ends need to accept "pgint" values in float notation.
  4625 INCOMPATIBILITY.
  4626 
  4627 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
  4628 DejaVu Sans.
  4629 
  4630 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
  4631 
  4632 
  4633 *** Pure ***
  4634 
  4635 * Command 'type_synonym' (with single argument) replaces somewhat
  4636 outdated 'types', which is still available as legacy feature for some
  4637 time.
  4638 
  4639 * Command 'nonterminal' (with 'and' separated list of arguments)
  4640 replaces somewhat outdated 'nonterminals'.  INCOMPATIBILITY.
  4641 
  4642 * Command 'notepad' replaces former 'example_proof' for
  4643 experimentation in Isar without any result.  INCOMPATIBILITY.
  4644 
  4645 * Locale interpretation commands 'interpret' and 'sublocale' accept
  4646 lists of equations to map definitions in a locale to appropriate
  4647 entities in the context of the interpretation.  The 'interpretation'
  4648 command already provided this functionality.
  4649 
  4650 * Diagnostic command 'print_dependencies' prints the locale instances
  4651 that would be activated if the specified expression was interpreted in
  4652 the current context.  Variant "print_dependencies!" assumes a context
  4653 without interpretations.
  4654 
  4655 * Diagnostic command 'print_interps' prints interpretations in proofs
  4656 in addition to interpretations in theories.
  4657 
  4658 * Discontinued obsolete 'global' and 'local' commands to manipulate
  4659 the theory name space.  Rare INCOMPATIBILITY.  The ML functions
  4660 Sign.root_path and Sign.local_path may be applied directly where this
  4661 feature is still required for historical reasons.
  4662 
  4663 * Discontinued obsolete 'constdefs' command.  INCOMPATIBILITY, use
  4664 'definition' instead.
  4665 
  4666 * The "prems" fact, which refers to the accidental collection of
  4667 foundational premises in the context, is now explicitly marked as
  4668 legacy feature and will be discontinued soon.  Consider using "assms"
  4669 of the head statement or reference facts by explicit names.
  4670 
  4671 * Document antiquotations @{class} and @{type} print classes and type
  4672 constructors.
  4673 
  4674 * Document antiquotation @{file} checks file/directory entries within
  4675 the local file system.
  4676 
  4677 
  4678 *** HOL ***
  4679 
  4680 * Coercive subtyping: functions can be declared as coercions and type
  4681 inference will add them as necessary upon input of a term.  Theory
  4682 Complex_Main declares real :: nat => real and real :: int => real as
  4683 coercions. A coercion function f is declared like this:
  4684 
  4685   declare [[coercion f]]
  4686 
  4687 To lift coercions through type constructors (e.g. from nat => real to
  4688 nat list => real list), map functions can be declared, e.g.
  4689 
  4690   declare [[coercion_map map]]
  4691 
  4692 Currently coercion inference is activated only in theories including
  4693 real numbers, i.e. descendants of Complex_Main.  This is controlled by
  4694 the configuration option "coercion_enabled", e.g. it can be enabled in
  4695 other theories like this:
  4696 
  4697   declare [[coercion_enabled]]
  4698 
  4699 * Command 'partial_function' provides basic support for recursive
  4700 function definitions over complete partial orders.  Concrete instances
  4701 are provided for i) the option type, ii) tail recursion on arbitrary
  4702 types, and iii) the heap monad of Imperative_HOL.  See
  4703 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
  4704 for examples.
  4705 
  4706 * Function package: f.psimps rules are no longer implicitly declared
  4707 as [simp].  INCOMPATIBILITY.
  4708 
  4709 * Datatype package: theorems generated for executable equality (class
  4710 "eq") carry proper names and are treated as default code equations.
  4711 
  4712 * Inductive package: now offers command 'inductive_simps' to
  4713 automatically derive instantiated and simplified equations for
  4714 inductive predicates, similar to 'inductive_cases'.
  4715 
  4716 * Command 'enriched_type' allows to register properties of the
  4717 functorial structure of types.
  4718 
  4719 * Improved infrastructure for term evaluation using code generator
  4720 techniques, in particular static evaluation conversions.
  4721 
  4722 * Code generator: Scala (2.8 or higher) has been added to the target
  4723 languages.
  4724 
  4725 * Code generator: globbing constant expressions "*" and "Theory.*"
  4726 have been replaced by the more idiomatic "_" and "Theory._".
  4727 INCOMPATIBILITY.
  4728 
  4729 * Code generator: export_code without explicit file declaration prints
  4730 to standard output.  INCOMPATIBILITY.
  4731 
  4732 * Code generator: do not print function definitions for case
  4733 combinators any longer.
  4734 
  4735 * Code generator: simplification with rules determined with
  4736 src/Tools/Code/code_simp.ML and method "code_simp".
  4737 
  4738 * Code generator for records: more idiomatic representation of record
  4739 types.  Warning: records are not covered by ancient SML code
  4740 generation any longer.  INCOMPATIBILITY.  In cases of need, a suitable
  4741 rep_datatype declaration helps to succeed then:
  4742 
  4743   record 'a foo = ...
  4744   ...
  4745   rep_datatype foo_ext ...
  4746 
  4747 * Records: logical foundation type for records does not carry a
  4748 '_type' suffix any longer (obsolete due to authentic syntax).
  4749 INCOMPATIBILITY.
  4750 
  4751 * Quickcheck now by default uses exhaustive testing instead of random
  4752 testing.  Random testing can be invoked by "quickcheck [random]",
  4753 exhaustive testing by "quickcheck [exhaustive]".
  4754 
  4755 * Quickcheck instantiates polymorphic types with small finite
  4756 datatypes by default. This enables a simple execution mechanism to
  4757 handle quantifiers and function equality over the finite datatypes.
  4758 
  4759 * Quickcheck random generator has been renamed from "code" to
  4760 "random".  INCOMPATIBILITY.
  4761 
  4762 * Quickcheck now has a configurable time limit which is set to 30
  4763 seconds by default. This can be changed by adding [timeout = n] to the
  4764 quickcheck command. The time limit for Auto Quickcheck is still set
  4765 independently.
  4766 
  4767 * Quickcheck in locales considers interpretations of that locale for
  4768 counter example search.
  4769 
  4770 * Sledgehammer:
  4771   - Added "smt" and "remote_smt" provers based on the "smt" proof
  4772     method. See the Sledgehammer manual for details ("isabelle doc
  4773     sledgehammer").
  4774   - Renamed commands:
  4775     sledgehammer atp_info ~> sledgehammer running_provers
  4776     sledgehammer atp_kill ~> sledgehammer kill_provers
  4777     sledgehammer available_atps ~> sledgehammer available_provers
  4778     INCOMPATIBILITY.
  4779   - Renamed options:
  4780     sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
  4781     sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
  4782     sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
  4783     (and "ms" and "min" are no longer supported)
  4784     INCOMPATIBILITY.
  4785 
  4786 * Nitpick:
  4787   - Renamed options:
  4788     nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
  4789     nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
  4790     INCOMPATIBILITY.
  4791   - Added support for partial quotient types.
  4792   - Added local versions of the "Nitpick.register_xxx" functions.
  4793   - Added "whack" option.
  4794   - Allow registration of quotient types as codatatypes.
  4795   - Improved "merge_type_vars" option to merge more types.
  4796   - Removed unsound "fast_descrs" option.
  4797   - Added custom symmetry breaking for datatypes, making it possible to reach
  4798     higher cardinalities.
  4799   - Prevent the expansion of too large definitions.
  4800 
  4801 * Proof methods "metis" and "meson" now have configuration options
  4802 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
  4803 to diagnose these tools. E.g.
  4804 
  4805     using [[metis_trace = true]]
  4806 
  4807 * Auto Solve: Renamed "Auto Solve Direct".  The tool is now available
  4808 manually as command 'solve_direct'.
  4809 
  4810 * The default SMT solver Z3 must be enabled explicitly (due to
  4811 licensing issues) by setting the environment variable
  4812 Z3_NON_COMMERCIAL in etc/settings of the component, for example.  For
  4813 commercial applications, the SMT solver CVC3 is provided as fall-back;
  4814 changing the SMT solver is done via the configuration option
  4815 "smt_solver".
  4816 
  4817 * Remote SMT solvers need to be referred to by the "remote_" prefix,
  4818 i.e. "remote_cvc3" and "remote_z3".
  4819 
  4820 * Added basic SMT support for datatypes, records, and typedefs using
  4821 the oracle mode (no proofs).  Direct support of pairs has been dropped
  4822 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
  4823 support for a similar behavior).  Minor INCOMPATIBILITY.
  4824 
  4825 * Changed SMT configuration options:
  4826   - Renamed:
  4827     z3_proofs ~> smt_oracle (with inverted meaning)
  4828     z3_trace_assms ~> smt_trace_used_facts
  4829     INCOMPATIBILITY.
  4830   - Added:
  4831     smt_verbose
  4832     smt_random_seed
  4833     smt_datatypes
  4834     smt_infer_triggers
  4835     smt_monomorph_limit
  4836     cvc3_options
  4837     remote_cvc3_options
  4838     remote_z3_options
  4839     yices_options
  4840 
  4841 * Boogie output files (.b2i files) need to be declared in the theory
  4842 header.
  4843 
  4844 * Simplification procedure "list_to_set_comprehension" rewrites list
  4845 comprehensions applied to List.set to set comprehensions.  Occasional
  4846 INCOMPATIBILITY, may be deactivated like this:
  4847 
  4848   declare [[simproc del: list_to_set_comprehension]]
  4849 
  4850 * Removed old version of primrec package.  INCOMPATIBILITY.
  4851 
  4852 * Removed simplifier congruence rule of "prod_case", as has for long
  4853 been the case with "split".  INCOMPATIBILITY.
  4854 
  4855 * String.literal is a type, but not a datatype.  INCOMPATIBILITY.
  4856 
  4857 * Removed [split_format ... and ... and ...] version of
  4858 [split_format].  Potential INCOMPATIBILITY.
  4859 
  4860 * Predicate "sorted" now defined inductively, with nice induction
  4861 rules.  INCOMPATIBILITY: former sorted.simps now named sorted_simps.
  4862 
  4863 * Constant "contents" renamed to "the_elem", to free the generic name
  4864 contents for other uses.  INCOMPATIBILITY.
  4865 
  4866 * Renamed class eq and constant eq (for code generation) to class
  4867 equal and constant equal, plus renaming of related facts and various
  4868 tuning.  INCOMPATIBILITY.
  4869 
  4870 * Dropped type classes mult_mono and mult_mono1.  INCOMPATIBILITY.
  4871 
  4872 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
  4873 INCOMPATIBILITY.
  4874 
  4875 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
  4876 avoid confusion with finite sets.  INCOMPATIBILITY.
  4877 
  4878 * Abandoned locales equiv, congruent and congruent2 for equivalence
  4879 relations.  INCOMPATIBILITY: use equivI rather than equiv_intro (same
  4880 for congruent(2)).
  4881 
  4882 * Some previously unqualified names have been qualified:
  4883 
  4884   types
  4885     bool ~> HOL.bool
  4886     nat ~> Nat.nat
  4887 
  4888   constants
  4889     Trueprop ~> HOL.Trueprop
  4890     True ~> HOL.True
  4891     False ~> HOL.False
  4892     op & ~> HOL.conj
  4893     op | ~> HOL.disj
  4894     op --> ~> HOL.implies
  4895     op = ~> HOL.eq
  4896     Not ~> HOL.Not
  4897     The ~> HOL.The
  4898     All ~> HOL.All
  4899     Ex ~> HOL.Ex
  4900     Ex1 ~> HOL.Ex1
  4901     Let ~> HOL.Let
  4902     If ~> HOL.If
  4903     Ball ~> Set.Ball
  4904     Bex ~> Set.Bex
  4905     Suc ~> Nat.Suc
  4906     Pair ~> Product_Type.Pair
  4907     fst ~> Product_Type.fst
  4908     snd ~> Product_Type.snd
  4909     curry ~> Product_Type.curry
  4910     op : ~> Set.member
  4911     Collect ~> Set.Collect
  4912 
  4913 INCOMPATIBILITY.
  4914 
  4915 * More canonical naming convention for some fundamental definitions:
  4916 
  4917     bot_bool_eq ~> bot_bool_def
  4918     top_bool_eq ~> top_bool_def
  4919     inf_bool_eq ~> inf_bool_def
  4920     sup_bool_eq ~> sup_bool_def
  4921     bot_fun_eq  ~> bot_fun_def
  4922     top_fun_eq  ~> top_fun_def
  4923     inf_fun_eq  ~> inf_fun_def
  4924     sup_fun_eq  ~> sup_fun_def
  4925 
  4926 INCOMPATIBILITY.
  4927 
  4928 * More stylized fact names:
  4929 
  4930   expand_fun_eq ~> fun_eq_iff
  4931   expand_set_eq ~> set_eq_iff
  4932   set_ext       ~> set_eqI
  4933   nat_number    ~> eval_nat_numeral
  4934 
  4935 INCOMPATIBILITY.
  4936 
  4937 * Refactoring of code-generation specific operations in theory List:
  4938 
  4939   constants
  4940     null ~> List.null
  4941 
  4942   facts
  4943     mem_iff ~> member_def
  4944     null_empty ~> null_def
  4945 
  4946 INCOMPATIBILITY.  Note that these were not supposed to be used
  4947 regularly unless for striking reasons; their main purpose was code
  4948 generation.
  4949 
  4950 Various operations from the Haskell prelude are used for generating
  4951 Haskell code.
  4952 
  4953 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV".  Term
  4954 "surj f" is now an abbreviation of "range f = UNIV".  The theorems
  4955 bij_def and surj_def are unchanged.  INCOMPATIBILITY.
  4956 
  4957 * Abolished some non-alphabetic type names: "prod" and "sum" replace
  4958 "*" and "+" respectively.  INCOMPATIBILITY.
  4959 
  4960 * Name "Plus" of disjoint sum operator "<+>" is now hidden.  Write
  4961 "Sum_Type.Plus" instead.
  4962 
  4963 * Constant "split" has been merged with constant "prod_case"; names of
  4964 ML functions, facts etc. involving split have been retained so far,
  4965 though.  INCOMPATIBILITY.
  4966 
  4967 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
  4968 instead.  INCOMPATIBILITY.
  4969 
  4970 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
  4971 INCOMPATIBILITY.
  4972 
  4973 * Former theory Library/Enum is now part of the HOL-Main image.
  4974 INCOMPATIBILITY: all constants of the Enum theory now have to be
  4975 referred to by its qualified name.
  4976 
  4977   enum    ~>  Enum.enum
  4978   nlists  ~>  Enum.nlists
  4979   product ~>  Enum.product
  4980 
  4981 * Theory Library/Monad_Syntax provides do-syntax for monad types.
  4982 Syntax in Library/State_Monad has been changed to avoid ambiguities.
  4983 INCOMPATIBILITY.
  4984 
  4985 * Theory Library/SetsAndFunctions has been split into
  4986 Library/Function_Algebras and Library/Set_Algebras; canonical names
  4987 for instance definitions for functions; various improvements.
  4988 INCOMPATIBILITY.
  4989 
  4990 * Theory Library/Multiset provides stable quicksort implementation of
  4991 sort_key.
  4992 
  4993 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
  4994 INCOMPATIBILITY.
  4995 
  4996 * Session Multivariate_Analysis: introduced a type class for euclidean
  4997 space.  Most theorems are now stated in terms of euclidean spaces
  4998 instead of finite cartesian products.
  4999 
  5000   types
  5001     real ^ 'n ~>  'a::real_vector
  5002               ~>  'a::euclidean_space
  5003               ~>  'a::ordered_euclidean_space
  5004         (depends on your needs)
  5005 
  5006   constants
  5007      _ $ _        ~> _ $$ _
  5008      \<chi> x. _  ~> \<chi>\<chi> x. _
  5009      CARD('n)     ~> DIM('a)
  5010 
  5011 Also note that the indices are now natural numbers and not from some
  5012 finite type. Finite cartesian products of euclidean spaces, products
  5013 of euclidean spaces the real and complex numbers are instantiated to
  5014 be euclidean_spaces.  INCOMPATIBILITY.
  5015 
  5016 * Session Probability: introduced pextreal as positive extended real
  5017 numbers.  Use pextreal as value for measures.  Introduce the
  5018 Radon-Nikodym derivative, product spaces and Fubini's theorem for
  5019 arbitrary sigma finite measures.  Introduces Lebesgue measure based on
  5020 the integral in Multivariate Analysis.  INCOMPATIBILITY.
  5021 
  5022 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
  5023 INCOMPATIBILITY.
  5024 
  5025 * Session SPARK (with image HOL-SPARK) provides commands to load and
  5026 prove verification conditions generated by the SPARK Ada program
  5027 verifier.  See also src/HOL/SPARK and src/HOL/SPARK/Examples.
  5028 
  5029 
  5030 *** HOL-Algebra ***
  5031 
  5032 * Theorems for additive ring operations (locale abelian_monoid and
  5033 descendants) are generated by interpretation from their multiplicative
  5034 counterparts.  Names (in particular theorem names) have the mandatory
  5035 qualifier 'add'.  Previous theorem names are redeclared for
  5036 compatibility.
  5037 
  5038 * Structure "int_ring" is now an abbreviation (previously a
  5039 definition).  This fits more natural with advanced interpretations.
  5040 
  5041 
  5042 *** HOLCF ***
  5043 
  5044 * The domain package now runs in definitional mode by default: The
  5045 former command 'new_domain' is now called 'domain'.  To use the domain
  5046 package in its original axiomatic mode, use 'domain (unsafe)'.
  5047 INCOMPATIBILITY.
  5048 
  5049 * The new class "domain" is now the default sort.  Class "predomain"
  5050 is an unpointed version of "domain". Theories can be updated by
  5051 replacing sort annotations as shown below.  INCOMPATIBILITY.
  5052 
  5053   'a::type ~> 'a::countable
  5054   'a::cpo  ~> 'a::predomain
  5055   'a::pcpo ~> 'a::domain
  5056 
  5057 * The old type class "rep" has been superseded by class "domain".
  5058 Accordingly, users of the definitional package must remove any
  5059 "default_sort rep" declarations.  INCOMPATIBILITY.
  5060 
  5061 * The domain package (definitional mode) now supports unpointed
  5062 predomain argument types, as long as they are marked 'lazy'. (Strict
  5063 arguments must be in class "domain".) For example, the following
  5064 domain definition now works:
  5065 
  5066   domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
  5067 
  5068 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
  5069 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
  5070 'a option, and 'a list.  Additionally, it configures fixrec and the
  5071 domain package to work with these types.  For example:
  5072 
  5073   fixrec isInl :: "('a + 'b) u -> tr"
  5074     where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
  5075 
  5076   domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
  5077 
  5078 * The "(permissive)" option of fixrec has been replaced with a
  5079 per-equation "(unchecked)" option. See
  5080 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
  5081 
  5082 * The "bifinite" class no longer fixes a constant "approx"; the class
  5083 now just asserts that such a function exists.  INCOMPATIBILITY.
  5084 
  5085 * Former type "alg_defl" has been renamed to "defl".  HOLCF no longer
  5086 defines an embedding of type 'a defl into udom by default; instances
  5087 of "bifinite" and "domain" classes are available in
  5088 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
  5089 
  5090 * The syntax "REP('a)" has been replaced with "DEFL('a)".
  5091 
  5092 * The predicate "directed" has been removed.  INCOMPATIBILITY.
  5093 
  5094 * The type class "finite_po" has been removed.  INCOMPATIBILITY.
  5095 
  5096 * The function "cprod_map" has been renamed to "prod_map".
  5097 INCOMPATIBILITY.
  5098 
  5099 * The monadic bind operator on each powerdomain has new binder syntax
  5100 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
  5101 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
  5102 
  5103 * The infix syntax for binary union on each powerdomain has changed
  5104 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
  5105 syntax.  INCOMPATIBILITY.
  5106 
  5107 * The constant "UU" has been renamed to "bottom".  The syntax "UU" is
  5108 still supported as an input translation.
  5109 
  5110 * Renamed some theorems (the original names are also still available).
  5111 
  5112   expand_fun_below   ~> fun_below_iff
  5113   below_fun_ext      ~> fun_belowI
  5114   expand_cfun_eq     ~> cfun_eq_iff
  5115   ext_cfun           ~> cfun_eqI
  5116   expand_cfun_below  ~> cfun_below_iff
  5117   below_cfun_ext     ~> cfun_belowI
  5118   cont2cont_Rep_CFun ~> cont2cont_APP
  5119 
  5120 * The Abs and Rep functions for various types have changed names.
  5121 Related theorem names have also changed to match. INCOMPATIBILITY.
  5122 
  5123   Rep_CFun  ~> Rep_cfun
  5124   Abs_CFun  ~> Abs_cfun
  5125   Rep_Sprod ~> Rep_sprod
  5126   Abs_Sprod ~> Abs_sprod
  5127   Rep_Ssum  ~> Rep_ssum
  5128   Abs_Ssum  ~> Abs_ssum
  5129 
  5130 * Lemmas with names of the form *_defined_iff or *_strict_iff have
  5131 been renamed to *_bottom_iff.  INCOMPATIBILITY.
  5132 
  5133 * Various changes to bisimulation/coinduction with domain package:
  5134 
  5135   - Definitions of "bisim" constants no longer mention definedness.
  5136   - With mutual recursion, "bisim" predicate is now curried.
  5137   - With mutual recursion, each type gets a separate coind theorem.
  5138   - Variable names in bisim_def and coinduct rules have changed.
  5139 
  5140 INCOMPATIBILITY.
  5141 
  5142 * Case combinators generated by the domain package for type "foo" are
  5143 now named "foo_case" instead of "foo_when".  INCOMPATIBILITY.
  5144 
  5145 * Several theorems have been renamed to more accurately reflect the
  5146 names of constants and types involved.  INCOMPATIBILITY.
  5147 
  5148   thelub_const    ~> lub_const
  5149   lub_const       ~> is_lub_const
  5150   thelubI         ~> lub_eqI
  5151   is_lub_lub      ~> is_lubD2
  5152   lubI            ~> is_lub_lub
  5153   unique_lub      ~> is_lub_unique
  5154   is_ub_lub       ~> is_lub_rangeD1
  5155   lub_bin_chain   ~> is_lub_bin_chain
  5156   lub_fun         ~> is_lub_fun
  5157   thelub_fun      ~> lub_fun
  5158   thelub_cfun     ~> lub_cfun
  5159   thelub_Pair     ~> lub_Pair
  5160   lub_cprod       ~> is_lub_prod
  5161   thelub_cprod    ~> lub_prod
  5162   minimal_cprod   ~> minimal_prod
  5163   inst_cprod_pcpo ~> inst_prod_pcpo
  5164   UU_I            ~> bottomI
  5165   compact_UU      ~> compact_bottom
  5166   deflation_UU    ~> deflation_bottom
  5167   finite_deflation_UU ~> finite_deflation_bottom
  5168 
  5169 * Many legacy theorem names have been discontinued.  INCOMPATIBILITY.
  5170 
  5171   sq_ord_less_eq_trans ~> below_eq_trans
  5172   sq_ord_eq_less_trans ~> eq_below_trans
  5173   refl_less            ~> below_refl
  5174   trans_less           ~> below_trans
  5175   antisym_less         ~> below_antisym
  5176   antisym_less_inverse ~> po_eq_conv [THEN iffD1]
  5177   box_less             ~> box_below
  5178   rev_trans_less       ~> rev_below_trans
  5179   not_less2not_eq      ~> not_below2not_eq
  5180   less_UU_iff          ~> below_UU_iff
  5181   flat_less_iff        ~> flat_below_iff
  5182   adm_less             ~> adm_below
  5183   adm_not_less         ~> adm_not_below
  5184   adm_compact_not_less ~> adm_compact_not_below
  5185   less_fun_def         ~> below_fun_def
  5186   expand_fun_less      ~> fun_below_iff
  5187   less_fun_ext         ~> fun_belowI
  5188   less_discr_def       ~> below_discr_def
  5189   discr_less_eq        ~> discr_below_eq
  5190   less_unit_def        ~> below_unit_def
  5191   less_cprod_def       ~> below_prod_def
  5192   prod_lessI           ~> prod_belowI
  5193   Pair_less_iff        ~> Pair_below_iff
  5194   fst_less_iff         ~> fst_below_iff
  5195   snd_less_iff         ~> snd_below_iff
  5196   expand_cfun_less     ~> cfun_below_iff
  5197   less_cfun_ext        ~> cfun_belowI
  5198   injection_less       ~> injection_below
  5199   less_up_def          ~> below_up_def
  5200   not_Iup_less         ~> not_Iup_below
  5201   Iup_less             ~> Iup_below
  5202   up_less              ~> up_below
  5203   Def_inject_less_eq   ~> Def_below_Def
  5204   Def_less_is_eq       ~> Def_below_iff
  5205   spair_less_iff       ~> spair_below_iff
  5206   less_sprod           ~> below_sprod
  5207   spair_less           ~> spair_below
  5208   sfst_less_iff        ~> sfst_below_iff
  5209   ssnd_less_iff        ~> ssnd_below_iff
  5210   fix_least_less       ~> fix_least_below
  5211   dist_less_one        ~> dist_below_one
  5212   less_ONE             ~> below_ONE
  5213   ONE_less_iff         ~> ONE_below_iff
  5214   less_sinlD           ~> below_sinlD
  5215   less_sinrD           ~> below_sinrD
  5216 
  5217 
  5218 *** FOL and ZF ***
  5219 
  5220 * All constant names are now qualified internally and use proper
  5221 identifiers, e.g. "IFOL.eq" instead of "op =".  INCOMPATIBILITY.
  5222 
  5223 
  5224 *** ML ***
  5225 
  5226 * Antiquotation @{assert} inlines a function bool -> unit that raises
  5227 Fail if the argument is false.  Due to inlining the source position of
  5228 failed assertions is included in the error output.
  5229 
  5230 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
  5231 text is in practice always evaluated with a stable theory checkpoint.
  5232 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
  5233 
  5234 * Antiquotation @{theory A} refers to theory A from the ancestry of
  5235 the current context, not any accidental theory loader state as before.
  5236 Potential INCOMPATIBILITY, subtle change in semantics.
  5237 
  5238 * Syntax.pretty_priority (default 0) configures the required priority
  5239 of pretty-printed output and thus affects insertion of parentheses.
  5240 
  5241 * Syntax.default_root (default "any") configures the inner syntax
  5242 category (nonterminal symbol) for parsing of terms.
  5243 
  5244 * Former exception Library.UnequalLengths now coincides with
  5245 ListPair.UnequalLengths.
  5246 
  5247 * Renamed structure MetaSimplifier to Raw_Simplifier.  Note that the
  5248 main functionality is provided by structure Simplifier.
  5249 
  5250 * Renamed raw "explode" function to "raw_explode" to emphasize its
  5251 meaning.  Note that internally to Isabelle, Symbol.explode is used in
  5252 almost all situations.
  5253 
  5254 * Discontinued obsolete function sys_error and exception SYS_ERROR.
  5255 See implementation manual for further details on exceptions in
  5256 Isabelle/ML.
  5257 
  5258 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
  5259 meaning.
  5260 
  5261 * Renamed structure PureThy to Pure_Thy and moved most of its
  5262 operations to structure Global_Theory, to emphasize that this is
  5263 rarely-used global-only stuff.
  5264 
  5265 * Discontinued Output.debug.  Minor INCOMPATIBILITY, use plain writeln
  5266 instead (or tracing for high-volume output).
  5267 
  5268 * Configuration option show_question_marks only affects regular pretty
  5269 printing of types and terms, not raw Term.string_of_vname.
  5270 
  5271 * ML_Context.thm and ML_Context.thms are no longer pervasive.  Rare
  5272 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
  5273 @{thms} for most purposes.
  5274 
  5275 * ML structure Unsynchronized is never opened, not even in Isar
  5276 interaction mode as before.  Old Unsynchronized.set etc. have been
  5277 discontinued -- use plain := instead.  This should be *rare* anyway,
  5278 since modern tools always work via official context data, notably
  5279 configuration options.
  5280 
  5281 * Parallel and asynchronous execution requires special care concerning
  5282 interrupts.  Structure Exn provides some convenience functions that
  5283 avoid working directly with raw Interrupt.  User code must not absorb
  5284 interrupts -- intermediate handling (for cleanup etc.) needs to be
  5285 followed by re-raising of the original exception.  Another common
  5286 source of mistakes are "handle _" patterns, which make the meaning of
  5287 the program subject to physical effects of the environment.
  5288 
  5289 
  5290 
  5291 New in Isabelle2009-2 (June 2010)
  5292 ---------------------------------
  5293 
  5294 *** General ***
  5295 
  5296 * Authentic syntax for *all* logical entities (type classes, type
  5297 constructors, term constants): provides simple and robust
  5298 correspondence between formal entities and concrete syntax.  Within
  5299 the parse tree / AST representations, "constants" are decorated by
  5300 their category (class, type, const) and spelled out explicitly with
  5301 their full internal name.
  5302 
  5303 Substantial INCOMPATIBILITY concerning low-level syntax declarations
  5304 and translations (translation rules and translation functions in ML).
  5305 Some hints on upgrading:
  5306 
  5307   - Many existing uses of 'syntax' and 'translations' can be replaced
  5308     by more modern 'type_notation', 'notation' and 'abbreviation',
  5309     which are independent of this issue.
  5310 
  5311   - 'translations' require markup within the AST; the term syntax
  5312     provides the following special forms:
  5313 
  5314       CONST c   -- produces syntax version of constant c from context
  5315       XCONST c  -- literally c, checked as constant from context
  5316       c         -- literally c, if declared by 'syntax'
  5317 
  5318     Plain identifiers are treated as AST variables -- occasionally the
  5319     system indicates accidental variables via the error "rhs contains
  5320     extra variables".
  5321 
  5322     Type classes and type constructors are marked according to their
  5323     concrete syntax.  Some old translations rules need to be written
  5324     for the "type" category, using type constructor application
  5325     instead of pseudo-term application of the default category
  5326     "logic".
  5327 
  5328   - 'parse_translation' etc. in ML may use the following
  5329     antiquotations:
  5330 
  5331       @{class_syntax c}   -- type class c within parse tree / AST
  5332       @{term_syntax c}    -- type constructor c within parse tree / AST
  5333       @{const_syntax c}   -- ML version of "CONST c" above
  5334       @{syntax_const c}   -- literally c (checked wrt. 'syntax' declarations)
  5335 
  5336   - Literal types within 'typed_print_translations', i.e. those *not*
  5337     represented as pseudo-terms are represented verbatim.  Use @{class
  5338     c} or @{type_name c} here instead of the above syntax
  5339     antiquotations.
  5340 
  5341 Note that old non-authentic syntax was based on unqualified base
  5342 names, so all of the above "constant" names would coincide.  Recall
  5343 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
  5344 diagnose syntax problems.
  5345 
  5346 * Type constructors admit general mixfix syntax, not just infix.
  5347 
  5348 * Concrete syntax may be attached to local entities without a proof
  5349 body, too.  This works via regular mixfix annotations for 'fix',
  5350 'def', 'obtain' etc. or via the explicit 'write' command, which is
  5351 similar to the 'notation' command in theory specifications.
  5352 
  5353 * Discontinued unnamed infix syntax (legacy feature for many years) --
  5354 need to specify constant name and syntax separately.  Internal ML
  5355 datatype constructors have been renamed from InfixName to Infix etc.
  5356 Minor INCOMPATIBILITY.
  5357 
  5358 * Schematic theorem statements need to be explicitly markup as such,
  5359 via commands 'schematic_lemma', 'schematic_theorem',
  5360 'schematic_corollary'.  Thus the relevance of the proof is made
  5361 syntactically clear, which impacts performance in a parallel or
  5362 asynchronous interactive environment.  Minor INCOMPATIBILITY.
  5363 
  5364 * Use of cumulative prems via "!" in some proof methods has been
  5365 discontinued (old legacy feature).
  5366 
  5367 * References 'trace_simp' and 'debug_simp' have been replaced by
  5368 configuration options stored in the context. Enabling tracing (the
  5369 case of debugging is similar) in proofs works via
  5370 
  5371   using [[trace_simp = true]]
  5372 
  5373 Tracing is then active for all invocations of the simplifier in
  5374 subsequent goal refinement steps. Tracing may also still be enabled or
  5375 disabled via the ProofGeneral settings menu.
  5376 
  5377 * Separate commands 'hide_class', 'hide_type', 'hide_const',
  5378 'hide_fact' replace the former 'hide' KIND command.  Minor
  5379 INCOMPATIBILITY.
  5380 
  5381 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
  5382 more efficient than combinations with -q1 or -q2.
  5383 
  5384 
  5385 *** Pure ***
  5386 
  5387 * Proofterms record type-class reasoning explicitly, using the
  5388 "unconstrain" operation internally.  This eliminates all sort
  5389 constraints from a theorem and proof, introducing explicit
  5390 OFCLASS-premises.  On the proof term level, this operation is
  5391 automatically applied at theorem boundaries, such that closed proofs
  5392 are always free of sort constraints.  INCOMPATIBILITY for tools that
  5393 inspect proof terms.
  5394 
  5395 * Local theory specifications may depend on extra type variables that
  5396 are not present in the result type -- arguments TYPE('a) :: 'a itself
  5397 are added internally.  For example:
  5398 
  5399   definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
  5400 
  5401 * Predicates of locales introduced by classes carry a mandatory
  5402 "class" prefix.  INCOMPATIBILITY.
  5403 
  5404 * Vacuous class specifications observe default sort.  INCOMPATIBILITY.
  5405 
  5406 * Old 'axclass' command has been discontinued.  INCOMPATIBILITY, use
  5407 'class' instead.
  5408 
  5409 * Command 'code_reflect' allows to incorporate generated ML code into
  5410 runtime environment; replaces immature code_datatype antiquotation.
  5411 INCOMPATIBILITY.
  5412 
  5413 * Code generator: simple concept for abstract datatypes obeying
  5414 invariants.
  5415 
  5416 * Code generator: details of internal data cache have no impact on the
  5417 user space functionality any longer.
  5418 
  5419 * Methods "unfold_locales" and "intro_locales" ignore non-locale
  5420 subgoals.  This is more appropriate for interpretations with 'where'.
  5421 INCOMPATIBILITY.
  5422 
  5423 * Command 'example_proof' opens an empty proof body.  This allows to
  5424 experiment with Isar, without producing any persistent result.
  5425 
  5426 * Commands 'type_notation' and 'no_type_notation' declare type syntax
  5427 within a local theory context, with explicit checking of the
  5428 constructors involved (in contrast to the raw 'syntax' versions).
  5429 
  5430 * Commands 'types' and 'typedecl' now work within a local theory
  5431 context -- without introducing dependencies on parameters or
  5432 assumptions, which is not possible in Isabelle/Pure.
  5433 
  5434 * Command 'defaultsort' has been renamed to 'default_sort', it works
  5435 within a local theory context.  Minor INCOMPATIBILITY.
  5436 
  5437 
  5438 *** HOL ***
  5439 
  5440 * Command 'typedef' now works within a local theory context -- without
  5441 introducing dependencies on parameters or assumptions, which is not
  5442 possible in Isabelle/Pure/HOL.  Note that the logical environment may
  5443 contain multiple interpretations of local typedefs (with different
  5444 non-emptiness proofs), even in a global theory context.
  5445 
  5446 * New package for quotient types.  Commands 'quotient_type' and
  5447 'quotient_definition' may be used for defining types and constants by
  5448 quotient constructions.  An example is the type of integers created by
  5449 quotienting pairs of natural numbers:
  5450 
  5451   fun
  5452     intrel :: "(nat * nat) => (nat * nat) => bool"
  5453   where
  5454     "intrel (x, y) (u, v) = (x + v = u + y)"
  5455 
  5456   quotient_type int = "nat * nat" / intrel
  5457     by (auto simp add: equivp_def expand_fun_eq)
  5458 
  5459   quotient_definition
  5460     "0::int" is "(0::nat, 0::nat)"
  5461 
  5462 The method "lifting" can be used to lift of theorems from the
  5463 underlying "raw" type to the quotient type.  The example
  5464 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
  5465 construction and provides a reasoning infrastructure for finite sets.
  5466 
  5467 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
  5468 clash with new theory Quotient in Main HOL.
  5469 
  5470 * Moved the SMT binding into the main HOL session, eliminating
  5471 separate HOL-SMT session.
  5472 
  5473 * List membership infix mem operation is only an input abbreviation.
  5474 INCOMPATIBILITY.
  5475 
  5476 * Theory Library/Word.thy has been removed.  Use library Word/Word.thy
  5477 for future developements; former Library/Word.thy is still present in
  5478 the AFP entry RSAPPS.
  5479 
  5480 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
  5481 longer shadowed.  INCOMPATIBILITY.
  5482 
  5483 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
  5484 INCOMPATIBILITY.
  5485 
  5486 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
  5487 INCOMPATIBILITY.
  5488 
  5489 * Dropped normalizing_semiring etc; use the facts in semiring classes
  5490 instead.  INCOMPATIBILITY.
  5491 
  5492 * Dropped several real-specific versions of lemmas about floor and
  5493 ceiling; use the generic lemmas from theory "Archimedean_Field"
  5494 instead.  INCOMPATIBILITY.
  5495 
  5496   floor_number_of_eq         ~> floor_number_of
  5497   le_floor_eq_number_of      ~> number_of_le_floor
  5498   le_floor_eq_zero           ~> zero_le_floor
  5499   le_floor_eq_one            ~> one_le_floor
  5500   floor_less_eq_number_of    ~> floor_less_number_of
  5501   floor_less_eq_zero         ~> floor_less_zero
  5502   floor_less_eq_one          ~> floor_less_one
  5503   less_floor_eq_number_of    ~> number_of_less_floor
  5504   less_floor_eq_zero         ~> zero_less_floor
  5505   less_floor_eq_one          ~> one_less_floor
  5506   floor_le_eq_number_of      ~> floor_le_number_of
  5507   floor_le_eq_zero           ~> floor_le_zero
  5508   floor_le_eq_one            ~> floor_le_one
  5509   floor_subtract_number_of   ~> floor_diff_number_of
  5510   floor_subtract_one         ~> floor_diff_one
  5511   ceiling_number_of_eq       ~> ceiling_number_of
  5512   ceiling_le_eq_number_of    ~> ceiling_le_number_of
  5513   ceiling_le_zero_eq         ~> ceiling_le_zero
  5514   ceiling_le_eq_one          ~> ceiling_le_one
  5515   less_ceiling_eq_number_of  ~> number_of_less_ceiling
  5516   less_ceiling_eq_zero       ~> zero_less_ceiling
  5517   less_ceiling_eq_one        ~> one_less_ceiling
  5518   ceiling_less_eq_number_of  ~> ceiling_less_number_of
  5519   ceiling_less_eq_zero       ~> ceiling_less_zero
  5520   ceiling_less_eq_one        ~> ceiling_less_one
  5521   le_ceiling_eq_number_of    ~> number_of_le_ceiling
  5522   le_ceiling_eq_zero         ~> zero_le_ceiling
  5523   le_ceiling_eq_one          ~> one_le_ceiling
  5524   ceiling_subtract_number_of ~> ceiling_diff_number_of
  5525   ceiling_subtract_one       ~> ceiling_diff_one
  5526 
  5527 * Theory "Finite_Set": various folding_XXX locales facilitate the
  5528 application of the various fold combinators on finite sets.
  5529 
  5530 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
  5531 provides abstract red-black tree type which is backed by "RBT_Impl" as
  5532 implementation.  INCOMPATIBILITY.
  5533 
  5534 * Theory Library/Coinductive_List has been removed -- superseded by
  5535 AFP/thys/Coinductive.
  5536 
  5537 * Theory PReal, including the type "preal" and related operations, has
  5538 been removed.  INCOMPATIBILITY.
  5539 
  5540 * Real: new development using Cauchy Sequences.
  5541 
  5542 * Split off theory "Big_Operators" containing setsum, setprod,
  5543 Inf_fin, Sup_fin, Min, Max from theory Finite_Set.  INCOMPATIBILITY.
  5544 
  5545 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
  5546 "Int" etc.  INCOMPATIBILITY.
  5547 
  5548 * Constant Rat.normalize needs to be qualified.  INCOMPATIBILITY.
  5549 
  5550 * New set of rules "ac_simps" provides combined assoc / commute
  5551 rewrites for all interpretations of the appropriate generic locales.
  5552 
  5553 * Renamed theory "OrderedGroup" to "Groups" and split theory
  5554 "Ring_and_Field" into theories "Rings" and "Fields"; for more
  5555 appropriate and more consistent names suitable for name prefixes
  5556 within the HOL theories.  INCOMPATIBILITY.
  5557 
  5558 * Some generic constants have been put to appropriate theories:
  5559   - less_eq, less: Orderings
  5560   - zero, one, plus, minus, uminus, times, abs, sgn: Groups
  5561   - inverse, divide: Rings
  5562 INCOMPATIBILITY.
  5563 
  5564 * More consistent naming of type classes involving orderings (and
  5565 lattices):
  5566 
  5567     lower_semilattice                   ~> semilattice_inf
  5568     upper_semilattice                   ~> semilattice_sup
  5569 
  5570     dense_linear_order                  ~> dense_linorder
  5571 
  5572     pordered_ab_group_add               ~> ordered_ab_group_add
  5573     pordered_ab_group_add_abs           ~> ordered_ab_group_add_abs
  5574     pordered_ab_semigroup_add           ~> ordered_ab_semigroup_add
  5575     pordered_ab_semigroup_add_imp_le    ~> ordered_ab_semigroup_add_imp_le
  5576     pordered_cancel_ab_semigroup_add    ~> ordered_cancel_ab_semigroup_add
  5577     pordered_cancel_comm_semiring       ~> ordered_cancel_comm_semiring
  5578     pordered_cancel_semiring            ~> ordered_cancel_semiring
  5579     pordered_comm_monoid_add            ~> ordered_comm_monoid_add
  5580     pordered_comm_ring                  ~> ordered_comm_ring
  5581     pordered_comm_semiring              ~> ordered_comm_semiring
  5582     pordered_ring                       ~> ordered_ring
  5583     pordered_ring_abs                   ~> ordered_ring_abs
  5584     pordered_semiring                   ~> ordered_semiring
  5585 
  5586     ordered_ab_group_add                ~> linordered_ab_group_add
  5587     ordered_ab_semigroup_add            ~> linordered_ab_semigroup_add
  5588     ordered_cancel_ab_semigroup_add     ~> linordered_cancel_ab_semigroup_add
  5589     ordered_comm_semiring_strict        ~> linordered_comm_semiring_strict
  5590     ordered_field                       ~> linordered_field
  5591     ordered_field_no_lb                 ~> linordered_field_no_lb
  5592     ordered_field_no_ub                 ~> linordered_field_no_ub
  5593     ordered_field_dense_linear_order    ~> dense_linordered_field
  5594     ordered_idom                        ~> linordered_idom
  5595     ordered_ring                        ~> linordered_ring
  5596     ordered_ring_le_cancel_factor       ~> linordered_ring_le_cancel_factor
  5597     ordered_ring_less_cancel_factor     ~> linordered_ring_less_cancel_factor
  5598     ordered_ring_strict                 ~> linordered_ring_strict
  5599     ordered_semidom                     ~> linordered_semidom
  5600     ordered_semiring                    ~> linordered_semiring
  5601     ordered_semiring_1                  ~> linordered_semiring_1
  5602     ordered_semiring_1_strict           ~> linordered_semiring_1_strict
  5603     ordered_semiring_strict             ~> linordered_semiring_strict
  5604 
  5605   The following slightly odd type classes have been moved to a
  5606   separate theory Library/Lattice_Algebras:
  5607 
  5608     lordered_ab_group_add               ~> lattice_ab_group_add
  5609     lordered_ab_group_add_abs           ~> lattice_ab_group_add_abs
  5610     lordered_ab_group_add_meet          ~> semilattice_inf_ab_group_add
  5611     lordered_ab_group_add_join          ~> semilattice_sup_ab_group_add
  5612     lordered_ring                       ~> lattice_ring
  5613 
  5614 INCOMPATIBILITY.
  5615 
  5616 * Refined field classes:
  5617   - classes division_ring_inverse_zero, field_inverse_zero,
  5618     linordered_field_inverse_zero include rule inverse 0 = 0 --
  5619     subsumes former division_by_zero class;
  5620   - numerous lemmas have been ported from field to division_ring.
  5621 INCOMPATIBILITY.
  5622 
  5623 * Refined algebra theorem collections:
  5624   - dropped theorem group group_simps, use algebra_simps instead;
  5625   - dropped theorem group ring_simps, use field_simps instead;
  5626   - proper theorem collection field_simps subsumes former theorem
  5627     groups field_eq_simps and field_simps;
  5628   - dropped lemma eq_minus_self_iff which is a duplicate for
  5629     equal_neg_zero.
  5630 INCOMPATIBILITY.
  5631 
  5632 * Theory Finite_Set and List: some lemmas have been generalized from
  5633 sets to lattices:
  5634 
  5635   fun_left_comm_idem_inter      ~> fun_left_comm_idem_inf
  5636   fun_left_comm_idem_union      ~> fun_left_comm_idem_sup
  5637   inter_Inter_fold_inter        ~> inf_Inf_fold_inf
  5638   union_Union_fold_union        ~> sup_Sup_fold_sup
  5639   Inter_fold_inter              ~> Inf_fold_inf
  5640   Union_fold_union              ~> Sup_fold_sup
  5641   inter_INTER_fold_inter        ~> inf_INFI_fold_inf
  5642   union_UNION_fold_union        ~> sup_SUPR_fold_sup
  5643   INTER_fold_inter              ~> INFI_fold_inf
  5644   UNION_fold_union              ~> SUPR_fold_sup
  5645 
  5646 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
  5647 replaced by the more convenient lemmas Inf_empty and Sup_empty.
  5648 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
  5649 by Inf_insert and Sup_insert.  Lemmas Inf_UNIV and Sup_UNIV replace
  5650 former Inf_Univ and Sup_Univ.  Lemmas inf_top_right and sup_bot_right
  5651 subsume inf_top and sup_bot respectively.  INCOMPATIBILITY.
  5652 
  5653 * Reorganized theory Multiset: swapped notation of pointwise and
  5654 multiset order:
  5655 
  5656   - pointwise ordering is instance of class order with standard syntax
  5657     <= and <;
  5658   - multiset ordering has syntax <=# and <#; partial order properties
  5659     are provided by means of interpretation with prefix
  5660     multiset_order;
  5661   - less duplication, less historical organization of sections,
  5662     conversion from associations lists to multisets, rudimentary code
  5663     generation;
  5664   - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
  5665     if needed.
  5666 
  5667 Renamed:
  5668 
  5669   multiset_eq_conv_count_eq  ~>  multiset_ext_iff
  5670   multi_count_ext  ~>  multiset_ext
  5671   diff_union_inverse2  ~>  diff_union_cancelR
  5672 
  5673 INCOMPATIBILITY.
  5674 
  5675 * Theory Permutation: replaced local "remove" by List.remove1.
  5676 
  5677 * Code generation: ML and OCaml code is decorated with signatures.
  5678 
  5679 * Theory List: added transpose.
  5680 
  5681 * Library/Nat_Bijection.thy is a collection of bijective functions
  5682 between nat and other types, which supersedes the older libraries
  5683 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy.  INCOMPATIBILITY.
  5684 
  5685   Constants:
  5686   Nat_Int_Bij.nat2_to_nat         ~> prod_encode
  5687   Nat_Int_Bij.nat_to_nat2         ~> prod_decode
  5688   Nat_Int_Bij.int_to_nat_bij      ~> int_encode
  5689   Nat_Int_Bij.nat_to_int_bij      ~> int_decode
  5690   Countable.pair_encode           ~> prod_encode
  5691   NatIso.prod2nat                 ~> prod_encode
  5692   NatIso.nat2prod                 ~> prod_decode
  5693   NatIso.sum2nat                  ~> sum_encode
  5694   NatIso.nat2sum                  ~> sum_decode
  5695   NatIso.list2nat                 ~> list_encode
  5696   NatIso.nat2list                 ~> list_decode
  5697   NatIso.set2nat                  ~> set_encode
  5698   NatIso.nat2set                  ~> set_decode
  5699 
  5700   Lemmas:
  5701   Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_decode
  5702   Nat_Int_Bij.nat2_to_nat_inj     ~> inj_prod_encode
  5703   Nat_Int_Bij.nat2_to_nat_surj    ~> surj_prod_encode
  5704   Nat_Int_Bij.nat_to_nat2_inj     ~> inj_prod_decode
  5705   Nat_Int_Bij.nat_to_nat2_surj    ~> surj_prod_decode
  5706   Nat_Int_Bij.i2n_n2i_id          ~> int_encode_inverse
  5707   Nat_Int_Bij.n2i_i2n_id          ~> int_decode_inverse
  5708   Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
  5709   Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
  5710   Nat_Int_Bij.inj_nat_to_int_bij  ~> inj_int_encode
  5711   Nat_Int_Bij.inj_int_to_nat_bij  ~> inj_int_decode
  5712   Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_encode
  5713   Nat_Int_Bij.bij_int_to_nat_bij  ~> bij_int_decode
  5714 
  5715 * Sledgehammer:
  5716   - Renamed ATP commands:
  5717     atp_info     ~> sledgehammer running_atps
  5718     atp_kill     ~> sledgehammer kill_atps
  5719     atp_messages ~> sledgehammer messages
  5720     atp_minimize ~> sledgehammer minimize
  5721     print_atps   ~> sledgehammer available_atps
  5722     INCOMPATIBILITY.
  5723   - Added user's manual ("isabelle doc sledgehammer").
  5724   - Added option syntax and "sledgehammer_params" to customize
  5725     Sledgehammer's behavior.  See the manual for details.
  5726   - Modified the Isar proof reconstruction code so that it produces
  5727     direct proofs rather than proofs by contradiction.  (This feature
  5728     is still experimental.)
  5729   - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
  5730     full-typed mode.
  5731   - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
  5732 
  5733 * Nitpick:
  5734   - Added and implemented "binary_ints" and "bits" options.
  5735   - Added "std" option and implemented support for nonstandard models.
  5736   - Added and implemented "finitize" option to improve the precision
  5737     of infinite datatypes based on a monotonicity analysis.
  5738   - Added support for quotient types.
  5739   - Added support for "specification" and "ax_specification"
  5740     constructs.
  5741   - Added support for local definitions (for "function" and
  5742     "termination" proofs).
  5743   - Added support for term postprocessors.
  5744   - Optimized "Multiset.multiset" and "FinFun.finfun".
  5745   - Improved efficiency of "destroy_constrs" optimization.
  5746   - Fixed soundness bugs related to "destroy_constrs" optimization and
  5747     record getters.
  5748   - Fixed soundness bug related to higher-order constructors.
  5749   - Fixed soundness bug when "full_descrs" is enabled.
  5750   - Improved precision of set constructs.
  5751   - Added "atoms" option.
  5752   - Added cache to speed up repeated Kodkod invocations on the same
  5753     problems.
  5754   - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
  5755     "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
  5756     "SAT4J_Light".  INCOMPATIBILITY.
  5757   - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
  5758     "sharing_depth", and "show_skolems" options.  INCOMPATIBILITY.
  5759   - Removed "nitpick_intro" attribute.  INCOMPATIBILITY.
  5760 
  5761 * Method "induct" now takes instantiations of the form t, where t is not
  5762   a variable, as a shorthand for "x == t", where x is a fresh variable.
  5763   If this is not intended, t has to be enclosed in parentheses.
  5764   By default, the equalities generated by definitional instantiations
  5765   are pre-simplified, which may cause parameters of inductive cases
  5766   to disappear, or may even delete some of the inductive cases.
  5767   Use "induct (no_simp)" instead of "induct" to restore the old
  5768   behaviour. The (no_simp) option is also understood by the "cases"
  5769   and "nominal_induct" methods, which now perform pre-simplification, too.
  5770   INCOMPATIBILITY.
  5771 
  5772 
  5773 *** HOLCF ***
  5774 
  5775 * Variable names in lemmas generated by the domain package have
  5776 changed; the naming scheme is now consistent with the HOL datatype
  5777 package.  Some proof scripts may be affected, INCOMPATIBILITY.
  5778 
  5779 * The domain package no longer defines the function "foo_copy" for
  5780 recursive domain "foo".  The reach lemma is now stated directly in
  5781 terms of "foo_take".  Lemmas and proofs that mention "foo_copy" must
  5782 be reformulated in terms of "foo_take", INCOMPATIBILITY.
  5783 
  5784 * Most definedness lemmas generated by the domain package (previously
  5785 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
  5786 like "foo$x = UU <-> x = UU", which works better as a simp rule.
  5787 Proofs that used definedness lemmas as intro rules may break,
  5788 potential INCOMPATIBILITY.
  5789 
  5790 * Induction and casedist rules generated by the domain package now
  5791 declare proper case_names (one called "bottom", and one named for each
  5792 constructor).  INCOMPATIBILITY.
  5793 
  5794 * For mutually-recursive domains, separate "reach" and "take_lemma"
  5795 rules are generated for each domain, INCOMPATIBILITY.
  5796 
  5797   foo_bar.reach       ~> foo.reach  bar.reach
  5798   foo_bar.take_lemmas ~> foo.take_lemma  bar.take_lemma
  5799 
  5800 * Some lemmas generated by the domain package have been renamed for
  5801 consistency with the datatype package, INCOMPATIBILITY.
  5802 
  5803   foo.ind        ~> foo.induct
  5804   foo.finite_ind ~> foo.finite_induct
  5805   foo.coind      ~> foo.coinduct
  5806   foo.casedist   ~> foo.exhaust
  5807   foo.exhaust    ~> foo.nchotomy
  5808 
  5809 * For consistency with other definition packages, the fixrec package
  5810 now generates qualified theorem names, INCOMPATIBILITY.
  5811 
  5812   foo_simps  ~> foo.simps
  5813   foo_unfold ~> foo.unfold
  5814   foo_induct ~> foo.induct
  5815 
  5816 * The "fixrec_simp" attribute has been removed.  The "fixrec_simp"
  5817 method and internal fixrec proofs now use the default simpset instead.
  5818 INCOMPATIBILITY.
  5819 
  5820 * The "contlub" predicate has been removed.  Proof scripts should use
  5821 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
  5822 
  5823 * The "admw" predicate has been removed, INCOMPATIBILITY.
  5824 
  5825 * The constants cpair, cfst, and csnd have been removed in favor of
  5826 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
  5827 
  5828 
  5829 *** ML ***
  5830 
  5831 * Antiquotations for basic formal entities:
  5832 
  5833     @{class NAME}         -- type class
  5834     @{class_syntax NAME}  -- syntax representation of the above
  5835 
  5836     @{type_name NAME}     -- logical type
  5837     @{type_abbrev NAME}   -- type abbreviation
  5838     @{nonterminal NAME}   -- type of concrete syntactic category
  5839     @{type_syntax NAME}   -- syntax representation of any of the above
  5840 
  5841     @{const_name NAME}    -- logical constant (INCOMPATIBILITY)
  5842     @{const_abbrev NAME}  -- abbreviated constant
  5843     @{const_syntax NAME}  -- syntax representation of any of the above
  5844 
  5845 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
  5846 syntax constant (cf. 'syntax' command).
  5847 
  5848 * Antiquotation @{make_string} inlines a function to print arbitrary
  5849 values similar to the ML toplevel.  The result is compiler dependent
  5850 and may fall back on "?" in certain situations.
  5851 
  5852 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
  5853 antiquotations @{Isar.state} and @{Isar.goal}.  This replaces impure
  5854 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
  5855 not work with the asynchronous Isar document model.
  5856 
  5857 * Configuration options now admit dynamic default values, depending on
  5858 the context or even global references.
  5859 
  5860 * SHA1.digest digests strings according to SHA-1 (see RFC 3174).  It
  5861 uses an efficient external library if available (for Poly/ML).
  5862 
  5863 * Renamed some important ML structures, while keeping the old names
  5864 for some time as aliases within the structure Legacy:
  5865 
  5866   OuterKeyword  ~>  Keyword
  5867   OuterLex      ~>  Token
  5868   OuterParse    ~>  Parse
  5869   OuterSyntax   ~>  Outer_Syntax
  5870   PrintMode     ~>  Print_Mode
  5871   SpecParse     ~>  Parse_Spec
  5872   ThyInfo       ~>  Thy_Info
  5873   ThyLoad       ~>  Thy_Load
  5874   ThyOutput     ~>  Thy_Output
  5875   TypeInfer     ~>  Type_Infer
  5876 
  5877 Note that "open Legacy" simplifies porting of sources, but forgetting
  5878 to remove it again will complicate porting again in the future.
  5879 
  5880 * Most operations that refer to a global context are named
  5881 accordingly, e.g. Simplifier.global_context or
  5882 ProofContext.init_global.  There are some situations where a global
  5883 context actually works, but under normal circumstances one needs to
  5884 pass the proper local context through the code!
  5885 
  5886 * Discontinued old TheoryDataFun with its copy/init operation -- data
  5887 needs to be pure.  Functor Theory_Data_PP retains the traditional
  5888 Pretty.pp argument to merge, which is absent in the standard
  5889 Theory_Data version.
  5890 
  5891 * Sorts.certify_sort and derived "cert" operations for types and terms
  5892 no longer minimize sorts.  Thus certification at the boundary of the
  5893 inference kernel becomes invariant under addition of class relations,
  5894 which is an important monotonicity principle.  Sorts are now minimized
  5895 in the syntax layer only, at the boundary between the end-user and the
  5896 system.  Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
  5897 explicitly in rare situations.
  5898 
  5899 * Renamed old-style Drule.standard to Drule.export_without_context, to
  5900 emphasize that this is in no way a standard operation.
  5901 INCOMPATIBILITY.
  5902 
  5903 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
  5904 usual for resolution.  Rare INCOMPATIBILITY.
  5905 
  5906 * Renamed varify/unvarify operations to varify_global/unvarify_global
  5907 to emphasize that these only work in a global situation (which is
  5908 quite rare).
  5909 
  5910 * Curried take and drop in library.ML; negative length is interpreted
  5911 as infinity (as in chop).  Subtle INCOMPATIBILITY.
  5912 
  5913 * Proof terms: type substitutions on proof constants now use canonical
  5914 order of type variables.  INCOMPATIBILITY for tools working with proof
  5915 terms.
  5916 
  5917 * Raw axioms/defs may no longer carry sort constraints, and raw defs
  5918 may no longer carry premises.  User-level specifications are
  5919 transformed accordingly by Thm.add_axiom/add_def.
  5920 
  5921 
  5922 *** System ***
  5923 
  5924 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
  5925 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions.  Note that
  5926 proof terms are enabled unconditionally in the new HOL-Proofs image.
  5927 
  5928 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
  5929 feature since Isabelle2009).  Use ISABELLE_PROCESS and ISABELLE_TOOL,
  5930 respectively.
  5931 
  5932 * Old lib/scripts/polyml-platform is superseded by the
  5933 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
  5934 variant, even on a 64 bit machine.  The following example setting
  5935 prefers 64 bit if available:
  5936 
  5937   ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
  5938 
  5939 * The preliminary Isabelle/jEdit application demonstrates the emerging
  5940 Isabelle/Scala layer for advanced prover interaction and integration.
  5941 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
  5942 component.
  5943 
  5944 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
  5945 and Bluesky TeX fonts.  It provides the usual Isabelle symbols,
  5946 similar to the default assignment of the document preparation system
  5947 (cf. isabellesym.sty).  The Isabelle/Scala class Isabelle_System
  5948 provides some operations for direct access to the font without asking
  5949 the user for manual installation.
  5950 
  5951 
  5952 
  5953 New in Isabelle2009-1 (December 2009)
  5954 -------------------------------------
  5955 
  5956 *** General ***
  5957 
  5958 * Discontinued old form of "escaped symbols" such as \\<forall>.  Only
  5959 one backslash should be used, even in ML sources.
  5960 
  5961 
  5962 *** Pure ***
  5963 
  5964 * Locale interpretation propagates mixins along the locale hierarchy.
  5965 The currently only available mixins are the equations used to map
  5966 local definitions to terms of the target domain of an interpretation.
  5967 
  5968 * Reactivated diagnostic command 'print_interps'.  Use "print_interps
  5969 loc" to print all interpretations of locale "loc" in the theory.
  5970 Interpretations in proofs are not shown.
  5971 
  5972 * Thoroughly revised locales tutorial.  New section on conditional
  5973 interpretation.
  5974 
  5975 * On instantiation of classes, remaining undefined class parameters
  5976 are formally declared.  INCOMPATIBILITY.
  5977 
  5978 
  5979 *** Document preparation ***
  5980 
  5981 * New generalized style concept for printing terms: @{foo (style) ...}
  5982 instead of @{foo_style style ...}  (old form is still retained for
  5983 backward compatibility).  Styles can be also applied for
  5984 antiquotations prop, term_type and typeof.
  5985 
  5986 
  5987 *** HOL ***
  5988 
  5989 * New proof method "smt" for a combination of first-order logic with
  5990 equality, linear and nonlinear (natural/integer/real) arithmetic, and
  5991 fixed-size bitvectors; there is also basic support for higher-order
  5992 features (esp. lambda abstractions).  It is an incomplete decision
  5993 procedure based on external SMT solvers using the oracle mechanism;
  5994 for the SMT solver Z3, this method is proof-producing.  Certificates
  5995 are provided to avoid calling the external solvers solely for
  5996 re-checking proofs.  Due to a remote SMT service there is no need for
  5997 installing SMT solvers locally.  See src/HOL/SMT.
  5998 
  5999 * New commands to load and prove verification conditions generated by
  6000 the Boogie program verifier or derived systems (e.g. the Verifying C
  6001 Compiler (VCC) or Spec#).  See src/HOL/Boogie.
  6002 
  6003 * New counterexample generator tool 'nitpick' based on the Kodkod
  6004 relational model finder.  See src/HOL/Tools/Nitpick and
  6005 src/HOL/Nitpick_Examples.
  6006 
  6007 * New commands 'code_pred' and 'values' to invoke the predicate
  6008 compiler and to enumerate values of inductive predicates.
  6009 
  6010 * A tabled implementation of the reflexive transitive closure.
  6011 
  6012 * New implementation of quickcheck uses generic code generator;
  6013 default generators are provided for all suitable HOL types, records
  6014 and datatypes.  Old quickcheck can be re-activated importing theory
  6015 Library/SML_Quickcheck.
  6016 
  6017 * New testing tool Mirabelle for automated proof tools.  Applies
  6018 several tools and tactics like sledgehammer, metis, or quickcheck, to
  6019 every proof step in a theory.  To be used in batch mode via the
  6020 "mirabelle" utility.
  6021 
  6022 * New proof method "sos" (sum of squares) for nonlinear real
  6023 arithmetic (originally due to John Harison). It requires theory
  6024 Library/Sum_Of_Squares.  It is not a complete decision procedure but
  6025 works well in practice on quantifier-free real arithmetic with +, -,
  6026 *, ^, =, <= and <, i.e. boolean combinations of equalities and
  6027 inequalities between polynomials.  It makes use of external
  6028 semidefinite programming solvers.  Method "sos" generates a
  6029 certificate that can be pasted into the proof thus avoiding the need
  6030 to call an external tool every time the proof is checked.  See
  6031 src/HOL/Library/Sum_Of_Squares.
  6032 
  6033 * New method "linarith" invokes existing linear arithmetic decision
  6034 procedure only.
  6035 
  6036 * New command 'atp_minimal' reduces result produced by Sledgehammer.
  6037 
  6038 * New Sledgehammer option "Full Types" in Proof General settings menu.
  6039 Causes full type information to be output to the ATPs.  This slows
  6040 ATPs down considerably but eliminates a source of unsound "proofs"
  6041 that fail later.
  6042 
  6043 * New method "metisFT": A version of metis that uses full type
  6044 information in order to avoid failures of proof reconstruction.
  6045 
  6046 * New evaluator "approximate" approximates an real valued term using
  6047 the same method as the approximation method.
  6048 
  6049 * Method "approximate" now supports arithmetic expressions as
  6050 boundaries of intervals and implements interval splitting and Taylor
  6051 series expansion.
  6052 
  6053 * ML antiquotation @{code_datatype} inserts definition of a datatype
  6054 generated by the code generator; e.g. see src/HOL/Predicate.thy.
  6055 
  6056 * New theory SupInf of the supremum and infimum operators for sets of
  6057 reals.
  6058 
  6059 * New theory Probability, which contains a development of measure
  6060 theory, eventually leading to Lebesgue integration and probability.
  6061 
  6062 * Extended Multivariate Analysis to include derivation and Brouwer's
  6063 fixpoint theorem.
  6064 
  6065 * Reorganization of number theory, INCOMPATIBILITY:
  6066   - new number theory development for nat and int, in theories Divides
  6067     and GCD as well as in new session Number_Theory
  6068   - some constants and facts now suffixed with _nat and _int
  6069     accordingly
  6070   - former session NumberTheory now named Old_Number_Theory, including
  6071     theories Legacy_GCD and Primes (prefer Number_Theory if possible)
  6072   - moved theory Pocklington from src/HOL/Library to
  6073     src/HOL/Old_Number_Theory
  6074 
  6075 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
  6076 lcm of finite and infinite sets. It is shown that they form a complete
  6077 lattice.
  6078 
  6079 * Class semiring_div requires superclass no_zero_divisors and proof of
  6080 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
  6081 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
  6082 generalized to class semiring_div, subsuming former theorems
  6083 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
  6084 zdiv_zmult_zmult2.  div_mult_mult1 is now [simp] by default.
  6085 INCOMPATIBILITY.
  6086 
  6087 * Refinements to lattice classes and sets:
  6088   - less default intro/elim rules in locale variant, more default
  6089     intro/elim rules in class variant: more uniformity
  6090   - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
  6091     le_inf_iff
  6092   - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
  6093     sup_aci)
  6094   - renamed ACI to inf_sup_aci
  6095   - new class "boolean_algebra"
  6096   - class "complete_lattice" moved to separate theory
  6097     "Complete_Lattice"; corresponding constants (and abbreviations)
  6098     renamed and with authentic syntax:
  6099     Set.Inf ~>    Complete_Lattice.Inf
  6100     Set.Sup ~>    Complete_Lattice.Sup
  6101     Set.INFI ~>   Complete_Lattice.INFI
  6102     Set.SUPR ~>   Complete_Lattice.SUPR
  6103     Set.Inter ~>  Complete_Lattice.Inter
  6104     Set.Union ~>  Complete_Lattice.Union
  6105     Set.INTER ~>  Complete_Lattice.INTER
  6106     Set.UNION ~>  Complete_Lattice.UNION
  6107   - authentic syntax for
  6108     Set.Pow
  6109     Set.image
  6110   - mere abbreviations:
  6111     Set.empty               (for bot)
  6112     Set.UNIV                (for top)
  6113     Set.inter               (for inf, formerly Set.Int)
  6114     Set.union               (for sup, formerly Set.Un)
  6115     Complete_Lattice.Inter  (for Inf)
  6116     Complete_Lattice.Union  (for Sup)
  6117     Complete_Lattice.INTER  (for INFI)
  6118     Complete_Lattice.UNION  (for SUPR)
  6119   - object-logic definitions as far as appropriate
  6120 
  6121 INCOMPATIBILITY.  Care is required when theorems Int_subset_iff or
  6122 Un_subset_iff are explicitly deleted as default simp rules; then also
  6123 their lattice counterparts le_inf_iff and le_sup_iff have to be
  6124 deleted to achieve the desired effect.
  6125 
  6126 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
  6127 rules by default any longer; the same applies to min_max.inf_absorb1
  6128 etc.  INCOMPATIBILITY.
  6129 
  6130 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
  6131 pred_set_conv by default.  INCOMPATIBILITY.
  6132 
  6133 * Power operations on relations and functions are now one dedicated
  6134 constant "compow" with infix syntax "^^".  Power operation on
  6135 multiplicative monoids retains syntax "^" and is now defined generic
  6136 in class power.  INCOMPATIBILITY.
  6137 
  6138 * Relation composition "R O S" now has a more standard argument order:
  6139 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}".  INCOMPATIBILITY,
  6140 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
  6141 break, since the O_assoc rule was not rewritten like this.  Fix using
  6142 O_assoc[symmetric].  The same applies to the curried version "R OO S".
  6143 
  6144 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
  6145 abbreviation for "inv_into UNIV".  Lemmas are renamed accordingly.
  6146 INCOMPATIBILITY.
  6147 
  6148 * Most rules produced by inductive and datatype package have mandatory
  6149 prefixes.  INCOMPATIBILITY.
  6150 
  6151 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
  6152 the attribute of the same name.  Each of the theorems in the list
  6153 DERIV_intros assumes composition with an additional function and
  6154 matches a variable to the derivative, which has to be solved by the
  6155 Simplifier.  Hence (auto intro!: DERIV_intros) computes the derivative
  6156 of most elementary terms.  Former Maclauren.DERIV_tac and
  6157 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
  6158 INCOMPATIBILITY.
  6159 
  6160 * Code generator attributes follow the usual underscore convention:
  6161     code_unfold     replaces    code unfold
  6162     code_post       replaces    code post
  6163     etc.
  6164   INCOMPATIBILITY.
  6165 
  6166 * Renamed methods:
  6167     sizechange -> size_change
  6168     induct_scheme -> induction_schema
  6169   INCOMPATIBILITY.
  6170 
  6171 * Discontinued abbreviation "arbitrary" of constant "undefined".
  6172 INCOMPATIBILITY, use "undefined" directly.
  6173 
  6174 * Renamed theorems:
  6175     Suc_eq_add_numeral_1 -> Suc_eq_plus1
  6176     Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
  6177     Suc_plus1 -> Suc_eq_plus1
  6178     *anti_sym -> *antisym*
  6179     vector_less_eq_def -> vector_le_def
  6180   INCOMPATIBILITY.
  6181 
  6182 * Added theorem List.map_map as [simp].  Removed List.map_compose.
  6183 INCOMPATIBILITY.
  6184 
  6185 * Removed predicate "M hassize n" (<--> card M = n & finite M).
  6186 INCOMPATIBILITY.
  6187 
  6188 
  6189 *** HOLCF ***
  6190 
  6191 * Theory Representable defines a class "rep" of domains that are
  6192 representable (via an ep-pair) in the universal domain type "udom".
  6193 Instances are provided for all type constructors defined in HOLCF.
  6194 
  6195 * The 'new_domain' command is a purely definitional version of the
  6196 domain package, for representable domains.  Syntax is identical to the
  6197 old domain package.  The 'new_domain' package also supports indirect
  6198 recursion using previously-defined type constructors.  See
  6199 src/HOLCF/ex/New_Domain.thy for examples.
  6200 
  6201 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
  6202 on the left-hand side of an equation, and then performs
  6203 simplification.  Rewriting is done using rules declared with the
  6204 "fixrec_simp" attribute.  The "fixrec_simp" method is intended as a
  6205 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
  6206 
  6207 * The pattern-match compiler in 'fixrec' can now handle constructors
  6208 with HOL function types.  Pattern-match combinators for the Pair
  6209 constructor are pre-configured.
  6210 
  6211 * The 'fixrec' package now produces better fixed-point induction rules
  6212 for mutually-recursive definitions:  Induction rules have conclusions
  6213 of the form "P foo bar" instead of "P <foo, bar>".
  6214 
  6215 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
  6216 been renamed to "below".  The name "below" now replaces "less" in many
  6217 theorem names.  (Legacy theorem names using "less" are still supported
  6218 as well.)
  6219 
  6220 * The 'fixrec' package now supports "bottom patterns".  Bottom
  6221 patterns can be used to generate strictness rules, or to make
  6222 functions more strict (much like the bang-patterns supported by the
  6223 Glasgow Haskell Compiler).  See src/HOLCF/ex/Fixrec_ex.thy for
  6224 examples.
  6225 
  6226 
  6227 *** ML ***
  6228 
  6229 * Support for Poly/ML 5.3.0, with improved reporting of compiler
  6230 errors and run-time exceptions, including detailed source positions.
  6231 
  6232 * Structure Name_Space (formerly NameSpace) now manages uniquely
  6233 identified entries, with some additional information such as source
  6234 position, logical grouping etc.
  6235 
  6236 * Theory and context data is now introduced by the simplified and
  6237 modernized functors Theory_Data, Proof_Data, Generic_Data.  Data needs
  6238 to be pure, but the old TheoryDataFun for mutable data (with explicit
  6239 copy operation) is still available for some time.
  6240 
  6241 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
  6242 provides a high-level programming interface to synchronized state
  6243 variables with atomic update.  This works via pure function
  6244 application within a critical section -- its runtime should be as
  6245 short as possible; beware of deadlocks if critical code is nested,
  6246 either directly or indirectly via other synchronized variables!
  6247 
  6248 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
  6249 wraps raw ML references, explicitly indicating their non-thread-safe
  6250 behaviour.  The Isar toplevel keeps this structure open, to
  6251 accommodate Proof General as well as quick and dirty interactive
  6252 experiments with references.
  6253 
  6254 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
  6255 parallel tactical reasoning.
  6256 
  6257 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
  6258 are similar to SUBPROOF, but are slightly more flexible: only the
  6259 specified parts of the subgoal are imported into the context, and the
  6260 body tactic may introduce new subgoals and schematic variables.
  6261 
  6262 * Old tactical METAHYPS, which does not observe the proof context, has
  6263 been renamed to Old_Goals.METAHYPS and awaits deletion.  Use SUBPROOF
  6264 or Subgoal.FOCUS etc.
  6265 
  6266 * Renamed functor TableFun to Table, and GraphFun to Graph.  (Since
  6267 functors have their own ML name space there is no point to mark them
  6268 separately.)  Minor INCOMPATIBILITY.
  6269 
  6270 * Renamed NamedThmsFun to Named_Thms.  INCOMPATIBILITY.
  6271 
  6272 * Renamed several structures FooBar to Foo_Bar.  Occasional,
  6273 INCOMPATIBILITY.
  6274 
  6275 * Operations of structure Skip_Proof no longer require quick_and_dirty
  6276 mode, which avoids critical setmp.
  6277