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