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