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