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