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