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