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