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