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