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