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