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