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