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