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