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