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