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