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