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