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