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