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