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