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