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