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