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