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