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