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