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