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