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