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