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