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