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