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