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