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