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