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