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