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