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