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