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