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