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