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