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