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