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