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