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