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