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