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