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