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