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