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