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