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