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