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