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