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