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