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