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