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