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