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