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