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