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