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