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