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