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