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