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