NEWS
author immler
Thu May 03 15:07:14 2018 +0200 (13 months ago)
changeset 68073 fad29d2a17a5
parent 68072 493b818e8e10
parent 68067 b91c4acc1aaf
child 68080 17f79ae49401
permissions -rw-r--r--
merged; resolved conflicts manually (esp. lemmas that have been moved from Linear_Algebra and Cartesian_Euclidean_Space)
wenzelm@57491
     1
Isabelle NEWS -- history of user-relevant changes
wenzelm@57491
     2
=================================================
wenzelm@2553
     3
wenzelm@62114
     4
(Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.)
wenzelm@60006
     5
wenzelm@64603
     6
wenzelm@66651
     7
New in this Isabelle version
wenzelm@66651
     8
----------------------------
wenzelm@66651
     9
wenzelm@66712
    10
*** General ***
wenzelm@66712
    11
wenzelm@67446
    12
* Marginal comments need to be written exclusively in the new-style form
wenzelm@67446
    13
"\<comment> \<open>text\<close>", old ASCII variants like "-- {* ... *}" are no longer
wenzelm@67446
    14
supported. INCOMPATIBILITY, use the command-line tool "isabelle
wenzelm@67446
    15
update_comments" to update existing theory files.
wenzelm@67446
    16
wenzelm@67507
    17
* Old-style inner comments (* ... *) within the term language are legacy
wenzelm@67507
    18
and will be discontinued soon: use formal comments "\<comment> \<open>...\<close>" or "\<^cancel>\<open>...\<close>"
wenzelm@67507
    19
instead.
wenzelm@67507
    20
nipkow@67402
    21
* The "op <infix-op>" syntax for infix operators has been replaced by
nipkow@67400
    22
"(<infix-op>)". If <infix-op> begins or ends with a "*", there needs to
nipkow@67400
    23
be a space between the "*" and the corresponding parenthesis.
nipkow@67400
    24
INCOMPATIBILITY.
nipkow@67398
    25
There is an Isabelle tool "update_op" that converts theory and ML files
nipkow@67398
    26
to the new syntax. Because it is based on regular expression matching,
nipkow@67398
    27
the result may need a bit of manual postprocessing. Invoking "isabelle
nipkow@67398
    28
update_op" converts all files in the current directory (recursively).
nipkow@67398
    29
In case you want to exclude conversion of ML files (because the tool
nipkow@67398
    30
frequently also converts ML's "op" syntax), use option "-m".
nipkow@67398
    31
wenzelm@67119
    32
* The old 'def' command has been discontinued (legacy since
wenzelm@67119
    33
Isbelle2016-1). INCOMPATIBILITY, use 'define' instead -- usually with
wenzelm@67119
    34
object-logic equality or equivalence.
wenzelm@67119
    35
wenzelm@66712
    36
* Session-qualified theory names are mandatory: it is no longer possible
wenzelm@66712
    37
to refer to unqualified theories from the parent session.
wenzelm@66712
    38
INCOMPATIBILITY for old developments that have not been updated to
wenzelm@66712
    39
Isabelle2017 yet (using the "isabelle imports" tool).
wenzelm@66712
    40
wenzelm@67013
    41
* Theory header 'abbrevs' specifications need to be separated by 'and'.
wenzelm@67013
    42
INCOMPATIBILITY.
wenzelm@67013
    43
wenzelm@66993
    44
* Only the most fundamental theory names are global, usually the entry
wenzelm@66993
    45
points to major logic sessions: Pure, Main, Complex_Main, HOLCF, IFOL,
wenzelm@66993
    46
FOL, ZF, ZFC etc. INCOMPATIBILITY, need to use qualified names for
wenzelm@66993
    47
formerly global "HOL-Probability.Probability" and "HOL-SPARK.SPARK".
wenzelm@66993
    48
wenzelm@66757
    49
* Command 'external_file' declares the formal dependency on the given
wenzelm@66757
    50
file name, such that the Isabelle build process knows about it, but
wenzelm@66757
    51
without specific Prover IDE management.
wenzelm@66757
    52
wenzelm@66759
    53
* Session ROOT entries no longer allow specification of 'files'. Rare
wenzelm@66759
    54
INCOMPATIBILITY, use command 'external_file' within a proper theory
wenzelm@66759
    55
context.
wenzelm@66759
    56
wenzelm@66764
    57
* Session root directories may be specified multiple times: each
wenzelm@66764
    58
accessible ROOT file is processed only once. This facilitates
wenzelm@66764
    59
specification of $ISABELLE_HOME_USER/ROOTS or command-line options like
wenzelm@66764
    60
-d or -D for "isabelle build" and "isabelle jedit". Example:
wenzelm@66764
    61
wenzelm@66764
    62
  isabelle build -D '~~/src/ZF'
wenzelm@66764
    63
wenzelm@67263
    64
* The command 'display_drafts' has been discontinued. INCOMPATIBILITY,
wenzelm@67263
    65
use action "isabelle.draft" (or "print") in Isabelle/jEdit instead.
wenzelm@67263
    66
wenzelm@67305
    67
* Isabelle symbol "\<hyphen>" is rendered as explicit Unicode hyphen U+2010, to
wenzelm@67305
    68
avoid unclear meaning of the old "soft hyphen" U+00AD. Rare
wenzelm@67305
    69
INCOMPATIBILITY, e.g. copy-paste of historic Isabelle HTML output.
wenzelm@67305
    70
wenzelm@66712
    71
wenzelm@67261
    72
*** Isabelle/jEdit Prover IDE ***
wenzelm@66768
    73
wenzelm@67395
    74
* System options "spell_checker_include" and "spell_checker_exclude"
wenzelm@67395
    75
supersede former "spell_checker_elements" to determine regions of text
wenzelm@67395
    76
that are subject to spell-checking. Minor INCOMPATIBILITY.
wenzelm@67395
    77
wenzelm@67221
    78
* PIDE markup for session ROOT files: allows to complete session names,
wenzelm@67221
    79
follow links to theories and document files etc.
wenzelm@67215
    80
wenzelm@66993
    81
* Completion supports theory header imports, using theory base name.
wenzelm@66994
    82
E.g. "Prob" may be completed to "HOL-Probability.Probability".
wenzelm@66768
    83
wenzelm@66988
    84
* The command-line tool "isabelle jedit" provides more flexible options
wenzelm@66988
    85
for session selection:
wenzelm@66988
    86
  - options -P opens the parent session image of -l
wenzelm@66988
    87
  - options -A and -B modify the meaning of -l to produce a base
wenzelm@66988
    88
    image on the spot, based on the specified ancestor (or parent)
wenzelm@66987
    89
  - option -F focuses on the specified logic session
wenzelm@66987
    90
  - option -R has changed: it only opens the session ROOT entry
wenzelm@66987
    91
  - option -S sets up the development environment to edit the
wenzelm@66987
    92
    specified session: it abbreviates -B -F -R -l
wenzelm@66973
    93
wenzelm@66990
    94
  Examples:
wenzelm@66990
    95
    isabelle jedit -d '$AFP' -S Formal_SSA -A HOL
wenzelm@66990
    96
    isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis
wenzelm@66988
    97
wenzelm@67133
    98
* Named control symbols (without special Unicode rendering) are shown as
wenzelm@67133
    99
bold-italic keyword. This is particularly useful for the short form of
wenzelm@67133
   100
antiquotations with control symbol: \<^name>\<open>argument\<close>. The action
wenzelm@67133
   101
"isabelle.antiquoted_cartouche" turns an antiquotation with 0 or 1
wenzelm@67133
   102
arguments into this format.
wenzelm@67133
   103
wenzelm@67311
   104
* Completion provides templates for named symbols with arguments,
wenzelm@67311
   105
e.g. "\<comment> \<open>ARGUMENT\<close>" or "\<^emph>\<open>ARGUMENT\<close>".
wenzelm@67311
   106
wenzelm@67295
   107
* Bibtex database files (.bib) are semantically checked.
wenzelm@67295
   108
wenzelm@67248
   109
* Action "isabelle.preview" is able to present more file formats,
wenzelm@67266
   110
notably bibtex database files and ML files.
wenzelm@67246
   111
wenzelm@67262
   112
* Action "isabelle.draft" is similar to "isabelle.preview", but shows a
wenzelm@68067
   113
plain-text document draft. Both are available via the menu "Plugins /
wenzelm@68067
   114
Isabelle".
wenzelm@67262
   115
wenzelm@67304
   116
* When loading text files, the Isabelle symbols encoding UTF-8-Isabelle
wenzelm@67304
   117
is only used if there is no conflict with existing Unicode sequences in
wenzelm@67304
   118
the file. Otherwise, the fallback encoding is plain UTF-8 and Isabelle
wenzelm@67304
   119
symbols remain in literal \<symbol> form. This avoids accidental loss of
wenzelm@67304
   120
Unicode content when saving the file.
wenzelm@67304
   121
wenzelm@67993
   122
* Update to jedit-5.5.0, the latest release.
wenzelm@67993
   123
wenzelm@67246
   124
wenzelm@67261
   125
*** Isabelle/VSCode Prover IDE ***
wenzelm@67261
   126
wenzelm@67261
   127
* HTML preview of theories and other file-formats similar to
wenzelm@67261
   128
Isabelle/jEdit.
wenzelm@67261
   129
wenzelm@66768
   130
wenzelm@67140
   131
*** Document preparation ***
wenzelm@67140
   132
wenzelm@67448
   133
* Formal comments work uniformly in outer syntax, inner syntax (term
wenzelm@67448
   134
language), Isabelle/ML and some other embedded languages of Isabelle.
wenzelm@67448
   135
See also "Document comments" in the isar-ref manual. The following forms
wenzelm@67448
   136
are supported:
wenzelm@67448
   137
wenzelm@67448
   138
  - marginal text comment: \<comment> \<open>\<dots>\<close>
wenzelm@67448
   139
  - canceled source: \<^cancel>\<open>\<dots>\<close>
wenzelm@67448
   140
  - raw LaTeX: \<^latex>\<open>\<dots>\<close>
wenzelm@67413
   141
wenzelm@67381
   142
* Outside of the inner theory body, the default presentation context is
wenzelm@67381
   143
theory Pure. Thus elementary antiquotations may be used in markup
wenzelm@67381
   144
commands (e.g. 'chapter', 'section', 'text') and formal comments.
wenzelm@67381
   145
wenzelm@67140
   146
* System option "document_tags" specifies a default for otherwise
wenzelm@67140
   147
untagged commands. This is occasionally useful to control the global
wenzelm@67140
   148
visibility of commands via session options (e.g. in ROOT).
wenzelm@67140
   149
wenzelm@67140
   150
* Document markup commands ('section', 'text' etc.) are implicitly
wenzelm@67140
   151
tagged as "document" and visible by default. This avoids the application
wenzelm@67140
   152
of option "document_tags" to these commands.
wenzelm@67140
   153
wenzelm@67145
   154
* Isabelle names are mangled into LaTeX macro names to allow the full
wenzelm@67145
   155
identifier syntax with underscore, prime, digits. This is relevant for
wenzelm@67145
   156
antiquotations in control symbol notation, e.g. \<^const_name> becomes
wenzelm@67145
   157
\isactrlconstUNDERSCOREname.
wenzelm@67145
   158
wenzelm@67297
   159
* Document antiquotation @{cite} now checks the given Bibtex entries
wenzelm@67297
   160
against the Bibtex database files -- only in batch-mode session builds.
wenzelm@67297
   161
wenzelm@67219
   162
* Document antiquotation @{session name} checks and prints the given
wenzelm@67219
   163
session name verbatim.
wenzelm@67219
   164
wenzelm@67157
   165
* Document preparation with skip_proofs option now preserves the content
wenzelm@67157
   166
more accurately: only terminal proof steps ('by' etc.) are skipped.
wenzelm@67157
   167
wenzelm@67176
   168
* Command-line tool "isabelle document" has been re-implemented in
wenzelm@67194
   169
Isabelle/Scala, with simplified arguments and explicit errors from the
wenzelm@67203
   170
latex and bibtex process. Minor INCOMPATIBILITY.
wenzelm@67173
   171
wenzelm@67140
   172
wenzelm@67702
   173
*** Isar ***
wenzelm@67702
   174
wenzelm@67702
   175
* Command 'interpret' no longer exposes resulting theorems as literal
wenzelm@67702
   176
facts, notably for the \<open>prop\<close> notation or the "fact" proof method. This
wenzelm@67702
   177
improves modularity of proofs and scalability of locale interpretation.
wenzelm@67702
   178
Rare INCOMPATIBILITY, need to refer to explicitly named facts instead
wenzelm@67702
   179
(e.g. use 'find_theorems' or 'try' to figure this out).
wenzelm@67702
   180
ballarin@67740
   181
* Rewrites clauses (keyword 'rewrites') were moved into the locale
ballarin@67764
   182
expression syntax, where they are part of locale instances.  In
ballarin@67764
   183
interpretation commands rewrites clauses now need to occur before
ballarin@67764
   184
'for' and 'defines'.  Minor INCOMPATIBILITY.
ballarin@67764
   185
ballarin@67764
   186
* For rewrites clauses, if activating a locale instance fails, fall
ballarin@67764
   187
back to reading the clause first.  This helps avoid qualification of
ballarin@67764
   188
locale instances where the qualifier's sole purpose is avoiding
ballarin@67764
   189
duplicate constant declarations.
ballarin@67741
   190
wenzelm@67702
   191
wenzelm@67718
   192
*** Pure ***
wenzelm@67718
   193
wenzelm@67718
   194
* The inner syntax category "sort" now includes notation "_" for the
wenzelm@67718
   195
dummy sort: it is effectively ignored in type-inference.
wenzelm@67718
   196
wenzelm@67718
   197
blanchet@66661
   198
*** HOL ***
blanchet@66661
   199
haftmann@68028
   200
* Clarified relationship of characters, strings and code generation:
haftmann@68028
   201
haftmann@68028
   202
  * Type "char" is now a proper datatype of 8-bit values.
haftmann@68028
   203
haftmann@68028
   204
  * Conversions "nat_of_char" and "char_of_nat" are gone; use more
haftmann@68028
   205
    general conversions "of_char" and "char_of" with suitable
haftmann@68028
   206
    type constraints instead.
haftmann@68028
   207
haftmann@68028
   208
  * The zero character is just written "CHR 0x00", not
haftmann@68028
   209
    "0" any longer.
haftmann@68028
   210
haftmann@68028
   211
  * Type "String.literal" (for code generation) is now isomorphic
haftmann@68028
   212
    to lists of 7-bit (ASCII) values; concrete values can be written
haftmann@68028
   213
    as "STR ''...''" for sequences of printable characters and
haftmann@68033
   214
    "STR 0x..." for one single ASCII code point given
haftmann@68028
   215
    as hexadecimal numeral.
haftmann@68028
   216
haftmann@68028
   217
  * Type "String.literal" supports concatenation "... + ..."
haftmann@68028
   218
    for all standard target languages.
haftmann@68028
   219
haftmann@68028
   220
  * Theory Library/Code_Char is gone; study the explanations concerning
haftmann@68028
   221
    "String.literal" in the tutorial on code generation to get an idea
haftmann@68028
   222
    how target-language string literals can be converted to HOL string
haftmann@68028
   223
    values and vice versa.
haftmann@68028
   224
haftmann@68028
   225
  * Imperative-HOL: operation "raise" directly takes a value of type
haftmann@68028
   226
    "String.literal" as argument, not type "string".
haftmann@68028
   227
haftmann@68028
   228
INCOMPATIBILITY.
haftmann@68028
   229
haftmann@68027
   230
* Abstract bit operations as part of Main: push_bit, take_bit,
haftmann@68027
   231
drop_bit.
haftmann@67928
   232
eberlm@67831
   233
* New, more general, axiomatization of complete_distrib_lattice. 
eberlm@67831
   234
The former axioms:
eberlm@67831
   235
"sup x (Inf X) = Inf (sup x ` X)" and "inf x (Sup X) = Sup (inf x ` X)"
eberlm@67831
   236
are replaced by 
eberlm@67831
   237
"Inf (Sup ` A) <= Sup (Inf ` {f ` A | f . (! Y \<in> A . f Y \<in> Y)})"
eberlm@67831
   238
The instantiations of sets and functions as complete_distrib_lattice 
eberlm@67831
   239
are moved to Hilbert_Choice.thy because their proofs need the Hilbert
eberlm@67831
   240
choice operator. The dual of this property is also proved in 
eberlm@67831
   241
Hilbert_Choice.thy.
eberlm@67831
   242
lp15@67999
   243
* New syntax for the minimum/maximum of a function over a finite set:
lp15@67999
   244
MIN x\<in>A. B  and even  MIN x. B (only useful for finite types), also
lp15@67999
   245
MAX.
lp15@67999
   246
haftmann@67525
   247
* Clarifed theorem names:
haftmann@67525
   248
haftmann@67525
   249
  Min.antimono ~> Min.subset_imp
haftmann@67525
   250
  Max.antimono ~> Max.subset_imp
haftmann@67525
   251
haftmann@67525
   252
Minor INCOMPATIBILITY.
haftmann@67525
   253
traytel@67224
   254
* A new command parametric_constant for proving parametricity of
wenzelm@67303
   255
non-recursive definitions. For constants that are not fully parametric
wenzelm@67303
   256
the command will infer conditions on relations (e.g., bi_unique,
wenzelm@67303
   257
bi_total, or type class conditions such as "respects 0") sufficient for
wenzelm@67303
   258
parametricity. See ~~/src/HOL/ex/Conditional_Parametricity_Examples for
wenzelm@67303
   259
some examples.
traytel@67224
   260
blanchet@66661
   261
* SMT module:
blanchet@66661
   262
  - The 'smt_oracle' option is now necessary when using the 'smt' method
blanchet@66662
   263
    with a solver other than Z3. INCOMPATIBILITY.
wenzelm@66844
   264
  - The encoding to first-order logic is now more complete in the
wenzelm@66844
   265
    presence of higher-order quantifiers. An 'smt_explicit_application'
wenzelm@66844
   266
    option has been added to control this. INCOMPATIBILITY.
wenzelm@66844
   267
blanchet@67335
   268
* Datatypes:
blanchet@67335
   269
  - The legacy command 'old_datatype', provided by
blanchet@67335
   270
    '~~/src/HOL/Library/Old_Datatype.thy', has been removed. INCOMPATIBILITY.
blanchet@67335
   271
wenzelm@66844
   272
* Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide
wenzelm@66844
   273
instances of rat, real, complex as factorial rings etc. Import
wenzelm@66844
   274
HOL-Computational_Algebra.Field_as_Ring explicitly in case of need.
wenzelm@66844
   275
INCOMPATIBILITY.
wenzelm@66844
   276
wenzelm@66844
   277
* Fact mod_mult_self4 (on nat) renamed to mod_mult_self3', to avoid
wenzelm@66844
   278
clash with fact mod_mult_self4 (on more generic semirings).
wenzelm@66844
   279
INCOMPATIBILITY.
haftmann@66801
   280
haftmann@66804
   281
* Facts sum.commute(_restrict) and prod.commute(_restrict) renamed to
wenzelm@66844
   282
sum.swap(_restrict) and prod.swap(_restrict), to avoid name clashes on
wenzelm@66844
   283
interpretation of abstract locales. INCOMPATIBILITY.
haftmann@66804
   284
haftmann@66803
   285
* Predicate pairwise_coprime abolished, use "pairwise coprime" instead.
haftmann@66803
   286
INCOMPATIBILITY.
haftmann@66803
   287
Andreas@67616
   288
* The relator rel_filter on filters has been strengthened to its 
Andreas@67616
   289
canonical categorical definition with better properties. INCOMPATIBILITY.
Andreas@67616
   290
immler@68072
   291
* Generalized linear algebra involving linear, span, dependent, dim
immler@68072
   292
from type class real_vector to locales module and vector_space.
immler@68072
   293
Renamed:
immler@68072
   294
  - span_inc ~> span_superset
immler@68072
   295
  - span_superset ~> span_base
immler@68072
   296
  - span_eq ~> span_eq_iff
immler@68072
   297
INCOMPATIBILITY.
immler@68072
   298
immler@68072
   299
nipkow@67341
   300
* HOL-Algebra: renamed (^) to [^]
nipkow@67341
   301
lp15@67999
   302
* Session HOL-Analysis: Moebius functions, the Riemann mapping
lp15@67999
   303
theorem, the Vitali covering theorem, change-of-variables results for
lp15@67999
   304
integration and measures.
wenzelm@66844
   305
haftmann@66937
   306
* Class linordered_semiring_1 covers zero_less_one also, ruling out
haftmann@66937
   307
pathologic instances. Minor INCOMPATIBILITY.
haftmann@66937
   308
haftmann@67051
   309
* Removed nat-int transfer machinery. Rare INCOMPATIBILITY.
haftmann@67051
   310
haftmann@67051
   311
* Predicate coprime is now a real definition, not a mere
haftmann@67051
   312
abbreviation. INCOMPATIBILITY.
haftmann@66954
   313
haftmann@67207
   314
* Code generation: Code generation takes an explicit option
haftmann@67207
   315
"case_insensitive" to accomodate case-insensitive file systems.
haftmann@67207
   316
wenzelm@66651
   317
wenzelm@66729
   318
*** System ***
wenzelm@66729
   319
wenzelm@67904
   320
* The command-line tools "isabelle server" and "isabelle client" provide
wenzelm@67904
   321
access to the Isabelle Server: it supports responsive session management
wenzelm@67904
   322
and concurrent use of theories, based on Isabelle/PIDE infrastructure.
wenzelm@67904
   323
See also the "system" manual.
wenzelm@67904
   324
wenzelm@67433
   325
* The command-line tool "isabelle update_comments" normalizes formal
wenzelm@67433
   326
comments in outer syntax as follows: \<comment> \<open>text\<close> (whith a single space to
wenzelm@67433
   327
approximate the appearance in document output). This is more specific
wenzelm@67433
   328
than former "isabelle update_cartouches -c": the latter tool option has
wenzelm@67433
   329
been discontinued.
wenzelm@67433
   330
wenzelm@66949
   331
* Session ROOT entry: empty 'document_files' means there is no document
wenzelm@66949
   332
for this session. There is no need to specify options [document = false]
wenzelm@66949
   333
anymore.
wenzelm@66949
   334
wenzelm@67043
   335
* The command-line tool "isabelle mkroot" now always produces a document
wenzelm@67043
   336
outline: its options have been adapted accordingly. INCOMPATIBILITY.
wenzelm@67043
   337
wenzelm@67069
   338
* The command-line tool "isabelle mkroot -I" initializes a Mercurial
wenzelm@67069
   339
repository for the generated session files.
wenzelm@67069
   340
wenzelm@66909
   341
* Linux and Windows/Cygwin is for x86_64 only. Old 32bit platform
wenzelm@66909
   342
support has been discontinued.
wenzelm@66729
   343
wenzelm@67088
   344
* Mac OS X 10.10 Yosemite is now the baseline version; Mavericks is no
wenzelm@67088
   345
longer supported.
wenzelm@67088
   346
wenzelm@66906
   347
* Java runtime is for x86_64 only. Corresponding Isabelle settings have
wenzelm@66906
   348
been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,
wenzelm@66906
   349
instead of former 32/64 variants. INCOMPATIBILITY.
wenzelm@66906
   350
wenzelm@68003
   351
* Old settings ISABELLE_PLATFORM and ISABELLE_WINDOWS_PLATFORM should be
wenzelm@68003
   352
phased out due to unclear preference of 32bit vs. 64bit architecture.
wenzelm@68003
   353
Explicit GNU bash expressions are now preferred, for example (with
wenzelm@68003
   354
quotes):
wenzelm@68003
   355
wenzelm@68003
   356
  #Posix executables (Unix or Cygwin), with preference for 64bit
wenzelm@68003
   357
  "${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}"
wenzelm@68003
   358
wenzelm@68003
   359
  #native Windows or Unix executables, with preference for 64bit
wenzelm@68003
   360
  "${ISABELLE_WINDOWS_PLATFORM64:-${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}}"
wenzelm@68003
   361
wenzelm@68003
   362
  #native Windows (32bit) or Unix executables (preference for 64bit)
wenzelm@68003
   363
  "${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}"
wenzelm@68003
   364
wenzelm@66745
   365
* Command-line tool "isabelle build" supports new options:
wenzelm@66745
   366
  - option -B NAME: include session NAME and all descendants
wenzelm@66745
   367
  - option -S: only observe changes of sources, not heap images
wenzelm@66841
   368
  - option -f: forces a fresh build
wenzelm@66737
   369
wenzelm@66843
   370
* Command-line tool "isabelle build" takes "condition" options with the
wenzelm@66843
   371
corresponding environment values into account, when determining the
wenzelm@66843
   372
up-to-date status of a session.
wenzelm@66843
   373
wenzelm@66851
   374
* Command-line tool "isabelle imports -I" also reports actual session
wenzelm@66851
   375
imports. This helps to minimize the session dependency graph.
wenzelm@66851
   376
wenzelm@67099
   377
* Update to current Poly/ML 5.7.1 with slightly improved performance and
wenzelm@67099
   378
PIDE markup for identifier bindings.
wenzelm@67099
   379
wenzelm@67199
   380
* ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific
wenzelm@67199
   381
options for improved error reporting. Potential INCOMPATIBILITY with
wenzelm@67199
   382
unusual LaTeX installations, may have to adapt these settings.
wenzelm@67199
   383
wenzelm@67591
   384
* The bundled Poly/ML 5.7.1 now uses The GNU Multiple Precision
wenzelm@67591
   385
Arithmetic Library (libgmp) on all platforms, notably Mac OS X with
wenzelm@67591
   386
32/64 bit.
wenzelm@67591
   387
wenzelm@67099
   388
wenzelm@66729
   389
wenzelm@66472
   390
New in Isabelle2017 (October 2017)
wenzelm@66472
   391
----------------------------------
wenzelm@64439
   392
wenzelm@64986
   393
*** General ***
wenzelm@64986
   394
wenzelm@66238
   395
* Experimental support for Visual Studio Code (VSCode) as alternative
wenzelm@66238
   396
Isabelle/PIDE front-end, see also
wenzelm@66599
   397
https://marketplace.visualstudio.com/items?itemName=makarius.Isabelle2017
wenzelm@66238
   398
wenzelm@66238
   399
VSCode is a new type of application that continues the concepts of
wenzelm@66238
   400
"programmer's editor" and "integrated development environment" towards
wenzelm@66238
   401
fully semantic editing and debugging -- in a relatively light-weight
wenzelm@66238
   402
manner. Thus it fits nicely on top of the Isabelle/PIDE infrastructure.
wenzelm@66238
   403
Technically, VSCode is based on the Electron application framework
wenzelm@66238
   404
(Node.js + Chromium browser + V8), which is implemented in JavaScript
wenzelm@66238
   405
and TypeScript, while Isabelle/VSCode mainly consists of Isabelle/Scala
wenzelm@66238
   406
modules around a Language Server implementation.
wenzelm@66238
   407
wenzelm@65504
   408
* Theory names are qualified by the session name that they belong to.
wenzelm@66454
   409
This affects imports, but not the theory name space prefix (which is
wenzelm@66454
   410
just the theory base name as before).
wenzelm@66454
   411
wenzelm@66454
   412
In order to import theories from other sessions, the ROOT file format
wenzelm@66454
   413
provides a new 'sessions' keyword. In contrast, a theory that is
wenzelm@66454
   414
imported in the old-fashioned manner via an explicit file-system path
wenzelm@66472
   415
belongs to the current session, and might cause theory name conflicts
wenzelm@66454
   416
later on. Theories that are imported from other sessions are excluded
wenzelm@66454
   417
from the current session document. The command-line tool "isabelle
wenzelm@66454
   418
imports" helps to update theory imports.
wenzelm@66454
   419
wenzelm@65451
   420
* The main theory entry points for some non-HOL sessions have changed,
wenzelm@65451
   421
to avoid confusion with the global name "Main" of the session HOL. This
wenzelm@65451
   422
leads to the follow renamings:
wenzelm@65451
   423
wenzelm@65451
   424
  CTT/Main.thy    ~>  CTT/CTT.thy
wenzelm@65451
   425
  ZF/Main.thy     ~>  ZF/ZF.thy
wenzelm@65451
   426
  ZF/Main_ZF.thy  ~>  ZF/ZF.thy
wenzelm@65451
   427
  ZF/Main_ZFC.thy ~>  ZF/ZFC.thy
wenzelm@65451
   428
  ZF/ZF.thy       ~>  ZF/ZF_Base.thy
wenzelm@65451
   429
wenzelm@65451
   430
INCOMPATIBILITY.
wenzelm@65451
   431
wenzelm@66472
   432
* Commands 'alias' and 'type_alias' introduce aliases for constants and
wenzelm@66472
   433
type constructors, respectively. This allows adhoc changes to name-space
wenzelm@66472
   434
accesses within global or local theory contexts, e.g. within a 'bundle'.
wenzelm@66472
   435
wenzelm@64986
   436
* Document antiquotations @{prf} and @{full_prf} output proof terms
wenzelm@64986
   437
(again) in the same way as commands 'prf' and 'full_prf'.
wenzelm@64986
   438
wenzelm@65055
   439
* Computations generated by the code generator can be embedded directly
wenzelm@65055
   440
into ML, alongside with @{code} antiquotations, using the following
wenzelm@65055
   441
antiquotations:
wenzelm@65055
   442
wenzelm@65055
   443
  @{computation ... terms: ... datatypes: ...} :
wenzelm@65055
   444
    ((term -> term) -> 'ml option -> 'a) -> Proof.context -> term -> 'a
wenzelm@65055
   445
  @{computation_conv ... terms: ... datatypes: ...} :
wenzelm@65055
   446
    (Proof.context -> 'ml -> conv) -> Proof.context -> conv
wenzelm@65045
   447
  @{computation_check terms: ... datatypes: ...} : Proof.context -> conv
haftmann@65041
   448
wenzelm@65055
   449
See src/HOL/ex/Computations.thy,
wenzelm@65055
   450
src/HOL/Decision_Procs/Commutative_Ring.thy and
wenzelm@65055
   451
src/HOL/Decision_Procs/Reflective_Field.thy for examples and the
wenzelm@65055
   452
tutorial on code generation.
haftmann@65041
   453
wenzelm@64986
   454
wenzelm@64602
   455
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@64602
   456
wenzelm@66472
   457
* Session-qualified theory imports allow the Prover IDE to process
wenzelm@66472
   458
arbitrary theory hierarchies independently of the underlying logic
wenzelm@66472
   459
session image (e.g. option "isabelle jedit -l"), but the directory
wenzelm@66472
   460
structure needs to be known in advance (e.g. option "isabelle jedit -d"
wenzelm@66472
   461
or a line in the file $ISABELLE_HOME_USER/ROOTS).
wenzelm@64602
   462
wenzelm@64842
   463
* The PIDE document model maintains file content independently of the
wenzelm@64842
   464
status of jEdit editor buffers. Reloading jEdit buffers no longer causes
wenzelm@64842
   465
changes of formal document content. Theory dependencies are always
wenzelm@64842
   466
resolved internally, without the need for corresponding editor buffers.
wenzelm@64842
   467
The system option "jedit_auto_load" has been discontinued: it is
wenzelm@64842
   468
effectively always enabled.
wenzelm@64842
   469
wenzelm@64867
   470
* The Theories dockable provides a "Purge" button, in order to restrict
wenzelm@64867
   471
the document model to theories that are required for open editor
wenzelm@64867
   472
buffers.
wenzelm@64867
   473
wenzelm@66424
   474
* The Theories dockable indicates the overall status of checking of each
wenzelm@66424
   475
entry. When all forked tasks of a theory are finished, the border is
wenzelm@66424
   476
painted with thick lines; remaining errors in this situation are
wenzelm@66424
   477
represented by a different border color.
wenzelm@66424
   478
wenzelm@66472
   479
* Automatic indentation is more careful to avoid redundant spaces in
wenzelm@66472
   480
intermediate situations. Keywords are indented after input (via typed
wenzelm@66472
   481
characters or completion); see also option "jedit_indent_input".
wenzelm@66472
   482
wenzelm@66472
   483
* Action "isabelle.preview" opens an HTML preview of the current theory
wenzelm@66472
   484
document in the default web browser.
wenzelm@66472
   485
wenzelm@66574
   486
* Command-line invocation "isabelle jedit -R -l LOGIC" opens the ROOT
wenzelm@66574
   487
entry of the specified logic session in the editor, while its parent is
wenzelm@66574
   488
used for formal checking.
wenzelm@66472
   489
wenzelm@66462
   490
* The main Isabelle/jEdit plugin may be restarted manually (using the
wenzelm@66462
   491
jEdit Plugin Manager), as long as the "Isabelle Base" plugin remains
wenzelm@66462
   492
enabled at all times.
wenzelm@66462
   493
wenzelm@66472
   494
* Update to current jedit-5.4.0.
wenzelm@65329
   495
wenzelm@64602
   496
haftmann@66149
   497
*** Pure ***
haftmann@66149
   498
haftmann@66149
   499
* Deleting the last code equations for a particular function using
haftmann@66149
   500
[code del] results in function with no equations (runtime abort) rather
wenzelm@66472
   501
than an unimplemented function (generation time abort). Use explicit
haftmann@66665
   502
[[code drop:]] to enforce the latter. Minor INCOMPATIBILITY.
haftmann@66149
   503
haftmann@66310
   504
* Proper concept of code declarations in code.ML:
wenzelm@66472
   505
  - Regular code declarations act only on the global theory level, being
wenzelm@66472
   506
    ignored with warnings if syntactically malformed.
wenzelm@66472
   507
  - Explicitly global code declarations yield errors if syntactically
wenzelm@66472
   508
    malformed.
wenzelm@66472
   509
  - Default code declarations are silently ignored if syntactically
wenzelm@66472
   510
    malformed.
haftmann@66310
   511
Minor INCOMPATIBILITY.
haftmann@66310
   512
wenzelm@66472
   513
* Clarified and standardized internal data bookkeeping of code
wenzelm@66472
   514
declarations: history of serials allows to track potentially
wenzelm@66472
   515
non-monotonous declarations appropriately. Minor INCOMPATIBILITY.
haftmann@66310
   516
haftmann@66149
   517
haftmann@64593
   518
*** HOL ***
haftmann@64593
   519
blanchet@66614
   520
* The Nunchaku model finder is now part of "Main".
blanchet@66614
   521
wenzelm@66472
   522
* SMT module:
wenzelm@66472
   523
  - A new option, 'smt_nat_as_int', has been added to translate 'nat' to
wenzelm@66472
   524
    'int' and benefit from the SMT solver's theory reasoning. It is
wenzelm@66472
   525
    disabled by default.
wenzelm@66472
   526
  - The legacy module "src/HOL/Library/Old_SMT.thy" has been removed.
wenzelm@66472
   527
  - Several small issues have been rectified in the 'smt' command.
wenzelm@66472
   528
wenzelm@66472
   529
* (Co)datatype package: The 'size_gen_o_map' lemma is no longer
wenzelm@66472
   530
generated for datatypes with type class annotations. As a result, the
wenzelm@66472
   531
tactic that derives it no longer fails on nested datatypes. Slight
wenzelm@66472
   532
INCOMPATIBILITY.
eberlm@66450
   533
haftmann@66345
   534
* Command and antiquotation "value" with modified default strategy:
haftmann@66345
   535
terms without free variables are always evaluated using plain evaluation
wenzelm@66472
   536
only, with no fallback on normalization by evaluation. Minor
wenzelm@66472
   537
INCOMPATIBILITY.
eberlm@65956
   538
wenzelm@65552
   539
* Theories "GCD" and "Binomial" are already included in "Main" (instead
wenzelm@65575
   540
of "Complex_Main").
wenzelm@65552
   541
haftmann@65170
   542
* Constant "surj" is a full input/output abbreviation (again).
haftmann@65170
   543
Minor INCOMPATIBILITY.
haftmann@65170
   544
haftmann@64632
   545
* Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively.
haftmann@64632
   546
INCOMPATIBILITY.
haftmann@64632
   547
wenzelm@66472
   548
* Renamed ii to imaginary_unit in order to free up ii as a variable
wenzelm@66472
   549
name. The syntax \<i> remains available. INCOMPATIBILITY.
wenzelm@66472
   550
wenzelm@66472
   551
* Dropped abbreviations transP, antisymP, single_valuedP; use constants
wenzelm@66472
   552
transp, antisymp, single_valuedp instead. INCOMPATIBILITY.
wenzelm@66472
   553
wenzelm@66472
   554
* Constant "subseq" in Topological_Spaces has been removed -- it is
wenzelm@66472
   555
subsumed by "strict_mono". Some basic lemmas specific to "subseq" have
wenzelm@66472
   556
been renamed accordingly, e.g. "subseq_o" -> "strict_mono_o" etc.
wenzelm@66472
   557
wenzelm@66472
   558
* Theory List: "sublist" renamed to "nths" in analogy with "nth", and
wenzelm@66472
   559
"sublisteq" renamed to "subseq". Minor INCOMPATIBILITY.
wenzelm@66472
   560
wenzelm@66472
   561
* Theory List: new generic function "sorted_wrt".
wenzelm@66472
   562
wenzelm@66472
   563
* Named theorems mod_simps covers various congruence rules concerning
wenzelm@66472
   564
mod, replacing former zmod_simps. INCOMPATIBILITY.
haftmann@64787
   565
haftmann@64593
   566
* Swapped orientation of congruence rules mod_add_left_eq,
haftmann@64593
   567
mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,
haftmann@64593
   568
mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,
wenzelm@66472
   569
mod_diff_eq. INCOMPATIBILITY.
haftmann@64593
   570
haftmann@64593
   571
* Generalized some facts:
blanchet@64876
   572
    measure_induct_rule
blanchet@64876
   573
    measure_induct
haftmann@64593
   574
    zminus_zmod ~> mod_minus_eq
haftmann@64593
   575
    zdiff_zmod_left ~> mod_diff_left_eq
haftmann@64593
   576
    zdiff_zmod_right ~> mod_diff_right_eq
haftmann@64593
   577
    zmod_eq_dvd_iff ~> mod_eq_dvd_iff
haftmann@64593
   578
INCOMPATIBILITY.
haftmann@64593
   579
wenzelm@66472
   580
* Algebraic type class hierarchy of euclidean (semi)rings in HOL:
wenzelm@66472
   581
euclidean_(semi)ring, euclidean_(semi)ring_cancel,
wenzelm@66472
   582
unique_euclidean_(semi)ring; instantiation requires provision of a
wenzelm@66472
   583
euclidean size.
wenzelm@66472
   584
wenzelm@66472
   585
* Theory "HOL-Number_Theory.Euclidean_Algorithm" has been reworked:
wenzelm@66472
   586
  - Euclidean induction is available as rule eucl_induct.
wenzelm@66472
   587
  - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,
wenzelm@66472
   588
    Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow
wenzelm@66472
   589
    easy instantiation of euclidean (semi)rings as GCD (semi)rings.
wenzelm@66472
   590
  - Coefficients obtained by extended euclidean algorithm are
wenzelm@66472
   591
    available as "bezout_coefficients".
wenzelm@66472
   592
INCOMPATIBILITY.
wenzelm@66472
   593
wenzelm@66472
   594
* Theory "Number_Theory.Totient" introduces basic notions about Euler's
wenzelm@66472
   595
totient function previously hidden as solitary example in theory
wenzelm@66472
   596
Residues. Definition changed so that "totient 1 = 1" in agreement with
wenzelm@66472
   597
the literature. Minor INCOMPATIBILITY.
wenzelm@66472
   598
wenzelm@66542
   599
* New styles in theory "HOL-Library.LaTeXsugar":
nipkow@66541
   600
  - "dummy_pats" for printing equations with "_" on the lhs;
nipkow@66541
   601
  - "eta_expand" for printing eta-expanded terms.
nipkow@66541
   602
wenzelm@66472
   603
* Theory "HOL-Library.Permutations": theorem bij_swap_ompose_bij has
wenzelm@66472
   604
been renamed to bij_swap_compose_bij. INCOMPATIBILITY.
wenzelm@66472
   605
lp15@66643
   606
* New theory "HOL-Library.Going_To_Filter" providing the "f going_to F"
eberlm@66488
   607
filter for describing points x such that f(x) is in the filter F.
eberlm@66488
   608
eberlm@66480
   609
* Theory "HOL-Library.Formal_Power_Series": constants X/E/L/F have been
eberlm@66480
   610
renamed to fps_X/fps_exp/fps_ln/fps_hypergeo to avoid polluting the name
wenzelm@66472
   611
space. INCOMPATIBILITY.
wenzelm@66472
   612
wenzelm@66472
   613
* Theory "HOL-Library.FinFun" has been moved to AFP (again).
wenzelm@66472
   614
INCOMPATIBILITY.
wenzelm@66472
   615
wenzelm@66472
   616
* Theory "HOL-Library.FuncSet": some old and rarely used ASCII
wenzelm@66472
   617
replacement syntax has been removed. INCOMPATIBILITY, standard syntax
wenzelm@66472
   618
with symbols should be used instead. The subsequent commands help to
wenzelm@66472
   619
reproduce the old forms, e.g. to simplify porting old theories:
wenzelm@66472
   620
wenzelm@66472
   621
syntax (ASCII)
wenzelm@66472
   622
  "_PiE" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PIE _:_./ _)" 10)
wenzelm@66472
   623
  "_Pi"  :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PI _:_./ _)" 10)
wenzelm@66472
   624
  "_lam" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a \<Rightarrow> 'b)"  ("(3%_:_./ _)" [0,0,3] 3)
wenzelm@66472
   625
wenzelm@66472
   626
* Theory "HOL-Library.Multiset": the simprocs on subsets operators of
wenzelm@66472
   627
multisets have been renamed:
wenzelm@66472
   628
wenzelm@66472
   629
  msetless_cancel_numerals ~> msetsubset_cancel
wenzelm@66472
   630
  msetle_cancel_numerals ~> msetsubset_eq_cancel
wenzelm@66472
   631
wenzelm@66472
   632
INCOMPATIBILITY.
wenzelm@66472
   633
lars@66481
   634
* Theory "HOL-Library.Pattern_Aliases" provides input and output syntax
lars@66481
   635
for pattern aliases as known from Haskell, Scala and ML.
blanchet@65515
   636
Andreas@66563
   637
* Theory "HOL-Library.Uprod" formalizes the type of unordered pairs.
Andreas@66563
   638
wenzelm@64898
   639
* Session HOL-Analysis: more material involving arcs, paths, covering
wenzelm@66650
   640
spaces, innessential maps, retracts, infinite products, simplicial
wenzelm@66650
   641
complexes. Baire Category theorem. Major results include the Jordan
wenzelm@66650
   642
Curve Theorem and the Great Picard Theorem.
wenzelm@66472
   643
wenzelm@66472
   644
* Session HOL-Algebra has been extended by additional lattice theory:
wenzelm@66472
   645
the Knaster-Tarski fixed point theorem and Galois Connections.
wenzelm@66472
   646
wenzelm@66472
   647
* Sessions HOL-Computational_Algebra and HOL-Number_Theory: new notions
wenzelm@66472
   648
of squarefreeness, n-th powers, and prime powers.
wenzelm@66472
   649
wenzelm@66472
   650
* Session "HOL-Computional_Algebra" covers many previously scattered
wenzelm@66472
   651
theories, notably Euclidean_Algorithm, Factorial_Ring,
wenzelm@66472
   652
Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,
wenzelm@66472
   653
Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor
wenzelm@66472
   654
INCOMPATIBILITY.
Mathias@65027
   655
wenzelm@60331
   656
wenzelm@64844
   657
*** System ***
wenzelm@64844
   658
wenzelm@66474
   659
* Isabelle/Scala: the SQL module supports access to relational
wenzelm@66474
   660
databases, either as plain file (SQLite) or full-scale server
wenzelm@66474
   661
(PostgreSQL via local port or remote ssh connection).
wenzelm@66474
   662
wenzelm@66474
   663
* Results of "isabelle build" are recorded as SQLite database (i.e.
wenzelm@66474
   664
"Application File Format" in the sense of
wenzelm@66474
   665
https://www.sqlite.org/appfileformat.html). This allows systematic
wenzelm@66474
   666
access via operations from module Sessions.Store in Isabelle/Scala.
wenzelm@66474
   667
wenzelm@66472
   668
* System option "parallel_proofs" is 1 by default (instead of more
wenzelm@66472
   669
aggressive 2). This requires less heap space and avoids burning parallel
wenzelm@66472
   670
CPU cycles, while full subproof parallelization is enabled for repeated
wenzelm@66472
   671
builds (according to parallel_subproofs_threshold).
wenzelm@65072
   672
wenzelm@65448
   673
* System option "record_proofs" allows to change the global
wenzelm@65448
   674
Proofterm.proofs variable for a session. Regular values are are 0, 1, 2;
wenzelm@65448
   675
a negative value means the current state in the ML heap image remains
wenzelm@65448
   676
unchanged.
wenzelm@65448
   677
wenzelm@66472
   678
* Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been
wenzelm@66472
   679
renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.
wenzelm@66472
   680
wenzelm@66472
   681
* Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,
wenzelm@66472
   682
ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the
wenzelm@66472
   683
native Windows platform (independently of the Cygwin installation). This
wenzelm@66472
   684
is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,
wenzelm@66472
   685
ISABELLE_PLATFORM64.
wenzelm@65557
   686
wenzelm@66786
   687
* Command-line tool "isabelle build_docker" builds a Docker image from
wenzelm@66786
   688
the Isabelle application bundle for Linux. See also
wenzelm@66786
   689
https://hub.docker.com/r/makarius/isabelle
wenzelm@66786
   690
wenzelm@66473
   691
* Command-line tool "isabelle vscode_server" provides a Language Server
wenzelm@66473
   692
Protocol implementation, e.g. for the Visual Studio Code editor. It
wenzelm@66473
   693
serves as example for alternative PIDE front-ends.
wenzelm@66473
   694
wenzelm@66472
   695
* Command-line tool "isabelle imports" helps to maintain theory imports
wenzelm@66671
   696
wrt. session structure. Examples for the main Isabelle distribution:
wenzelm@66472
   697
wenzelm@66472
   698
  isabelle imports -I -a
wenzelm@66472
   699
  isabelle imports -U -a
wenzelm@66472
   700
  isabelle imports -U -i -a
wenzelm@66472
   701
  isabelle imports -M -a -d '~~/src/Benchmarks'
wenzelm@66472
   702
wenzelm@64844
   703
wenzelm@67099
   704
wenzelm@64072
   705
New in Isabelle2016-1 (December 2016)
wenzelm@64072
   706
-------------------------------------
wenzelm@62216
   707
wenzelm@62440
   708
*** General ***
wenzelm@62440
   709
wenzelm@64390
   710
* Splitter in proof methods "simp", "auto" and friends:
wenzelm@64390
   711
  - The syntax "split add" has been discontinued, use plain "split",
wenzelm@64390
   712
    INCOMPATIBILITY.
wenzelm@64390
   713
  - For situations with many conditional or case expressions, there is
wenzelm@64390
   714
    an alternative splitting strategy that can be much faster. It is
wenzelm@64390
   715
    selected by writing "split!" instead of "split". It applies safe
wenzelm@64390
   716
    introduction and elimination rules after each split rule. As a
wenzelm@64390
   717
    result the subgoal may be split into several subgoals.
wenzelm@64390
   718
wenzelm@63273
   719
* Command 'bundle' provides a local theory target to define a bundle
wenzelm@63273
   720
from the body of specification commands (such as 'declare',
wenzelm@63273
   721
'declaration', 'notation', 'lemmas', 'lemma'). For example:
wenzelm@63273
   722
wenzelm@63273
   723
bundle foo
wenzelm@63273
   724
begin
wenzelm@63273
   725
  declare a [simp]
wenzelm@63273
   726
  declare b [intro]
wenzelm@63273
   727
end
wenzelm@63272
   728
wenzelm@63282
   729
* Command 'unbundle' is like 'include', but works within a local theory
wenzelm@63282
   730
context. Unlike "context includes ... begin", the effect of 'unbundle'
wenzelm@63282
   731
on the target context persists, until different declarations are given.
wenzelm@63282
   732
wenzelm@63977
   733
* Simplified outer syntax: uniform category "name" includes long
wenzelm@63977
   734
identifiers. Former "xname" / "nameref" / "name reference" has been
wenzelm@63977
   735
discontinued.
wenzelm@63977
   736
wenzelm@63977
   737
* Embedded content (e.g. the inner syntax of types, terms, props) may be
wenzelm@63977
   738
delimited uniformly via cartouches. This works better than old-fashioned
wenzelm@63977
   739
quotes when sub-languages are nested.
wenzelm@63977
   740
wenzelm@63977
   741
* Mixfix annotations support general block properties, with syntax
wenzelm@63977
   742
"(\<open>x=a y=b z \<dots>\<close>". Notable property names are "indent", "consistent",
wenzelm@63977
   743
"unbreakable", "markup". The existing notation "(DIGITS" is equivalent
wenzelm@63977
   744
to "(\<open>indent=DIGITS\<close>". The former notation "(00" for unbreakable blocks
wenzelm@63977
   745
is superseded by "(\<open>unbreabable\<close>" --- rare INCOMPATIBILITY.
nipkow@63650
   746
wenzelm@63383
   747
* Proof method "blast" is more robust wrt. corner cases of Pure
wenzelm@63383
   748
statements without object-logic judgment.
wenzelm@63383
   749
wenzelm@63624
   750
* Commands 'prf' and 'full_prf' are somewhat more informative (again):
wenzelm@63977
   751
proof terms are reconstructed and cleaned from administrative thm nodes.
wenzelm@63977
   752
wenzelm@63977
   753
* Code generator: config option "code_timing" triggers measurements of
wenzelm@63977
   754
different phases of code generation. See src/HOL/ex/Code_Timing.thy for
wenzelm@63977
   755
examples.
wenzelm@63977
   756
wenzelm@63977
   757
* Code generator: implicits in Scala (stemming from type class
wenzelm@63977
   758
instances) are generated into companion object of corresponding type
wenzelm@63977
   759
class, to resolve some situations where ambiguities may occur.
wenzelm@63977
   760
wenzelm@64390
   761
* Solve direct: option "solve_direct_strict_warnings" gives explicit
wenzelm@64390
   762
warnings for lemma statements with trivial proofs.
haftmann@64013
   763
wenzelm@64602
   764
wenzelm@62904
   765
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@62904
   766
wenzelm@64527
   767
* More aggressive flushing of machine-generated input, according to
wenzelm@64527
   768
system option editor_generated_input_delay (in addition to existing
wenzelm@64527
   769
editor_input_delay for regular user edits). This may affect overall PIDE
wenzelm@64527
   770
reactivity and CPU usage.
wenzelm@64527
   771
wenzelm@64390
   772
* Syntactic indentation according to Isabelle outer syntax. Action
wenzelm@64390
   773
"indent-lines" (shortcut C+i) indents the current line according to
wenzelm@64390
   774
command keywords and some command substructure. Action
wenzelm@64390
   775
"isabelle.newline" (shortcut ENTER) indents the old and the new line
wenzelm@64390
   776
according to command keywords only; see also option
wenzelm@64390
   777
"jedit_indent_newline".
wenzelm@64390
   778
wenzelm@64390
   779
* Semantic indentation for unstructured proof scripts ('apply' etc.) via
wenzelm@64390
   780
number of subgoals. This requires information of ongoing document
wenzelm@64390
   781
processing and may thus lag behind, when the user is editing too
wenzelm@64390
   782
quickly; see also option "jedit_script_indent" and
wenzelm@64390
   783
"jedit_script_indent_limit".
wenzelm@64390
   784
wenzelm@64390
   785
* Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed'
wenzelm@64390
   786
are treated as delimiters for fold structure; 'begin' and 'end'
wenzelm@64390
   787
structure of theory specifications is treated as well.
wenzelm@64390
   788
wenzelm@64390
   789
* Command 'proof' provides information about proof outline with cases,
wenzelm@64390
   790
e.g. for proof methods "cases", "induct", "goal_cases".
wenzelm@64390
   791
wenzelm@64390
   792
* Completion templates for commands involving "begin ... end" blocks,
wenzelm@64390
   793
e.g. 'context', 'notepad'.
wenzelm@64390
   794
wenzelm@64390
   795
* Sidekick parser "isabelle-context" shows nesting of context blocks
wenzelm@64390
   796
according to 'begin' and 'end' structure.
wenzelm@64390
   797
wenzelm@63977
   798
* Highlighting of entity def/ref positions wrt. cursor.
wenzelm@63977
   799
wenzelm@63977
   800
* Action "isabelle.select-entity" (shortcut CS+ENTER) selects all
wenzelm@64514
   801
occurrences of the formal entity at the caret position. This facilitates
wenzelm@63977
   802
systematic renaming.
wenzelm@63977
   803
wenzelm@63977
   804
* PIDE document markup works across multiple Isar commands, e.g. the
wenzelm@63977
   805
results established at the end of a proof are properly identified in the
wenzelm@63977
   806
theorem statement.
wenzelm@63977
   807
wenzelm@63977
   808
* Cartouche abbreviations work both for " and ` to accomodate typical
wenzelm@63977
   809
situations where old ASCII notation may be updated.
wenzelm@63977
   810
wenzelm@63875
   811
* Dockable window "Symbols" also provides access to 'abbrevs' from the
wenzelm@63875
   812
outer syntax of the current theory buffer. This provides clickable
wenzelm@63875
   813
syntax templates, including entries with empty abbrevs name (which are
wenzelm@63875
   814
inaccessible via keyboard completion).
wenzelm@63875
   815
wenzelm@63022
   816
* IDE support for the Isabelle/Pure bootstrap process, with the
wenzelm@63022
   817
following independent stages:
wenzelm@63022
   818
wenzelm@63022
   819
  src/Pure/ROOT0.ML
wenzelm@63022
   820
  src/Pure/ROOT.ML
wenzelm@63022
   821
  src/Pure/Pure.thy
wenzelm@63022
   822
  src/Pure/ML_Bootstrap.thy
wenzelm@63022
   823
wenzelm@63022
   824
The ML ROOT files act like quasi-theories in the context of theory
wenzelm@63022
   825
ML_Bootstrap: this allows continuous checking of all loaded ML files.
wenzelm@63022
   826
The theory files are presented with a modified header to import Pure
wenzelm@63022
   827
from the running Isabelle instance. Results from changed versions of
wenzelm@63022
   828
each stage are *not* propagated to the next stage, and isolated from the
wenzelm@63022
   829
actual Isabelle/Pure that runs the IDE itself. The sequential
wenzelm@63307
   830
dependencies of the above files are only observed for batch build.
wenzelm@62904
   831
wenzelm@63977
   832
* Isabelle/ML and Standard ML files are presented in Sidekick with the
wenzelm@63977
   833
tree structure of section headings: this special comment format is
wenzelm@63977
   834
described in "implementation" chapter 0, e.g. (*** section ***).
wenzelm@63461
   835
wenzelm@63581
   836
* Additional abbreviations for syntactic completion may be specified
wenzelm@63871
   837
within the theory header as 'abbrevs'. The theory syntax for 'keywords'
wenzelm@63871
   838
has been simplified accordingly: optional abbrevs need to go into the
wenzelm@63871
   839
new 'abbrevs' section.
wenzelm@63871
   840
wenzelm@63871
   841
* Global abbreviations via $ISABELLE_HOME/etc/abbrevs and
wenzelm@63871
   842
$ISABELLE_HOME_USER/etc/abbrevs are no longer supported. Minor
wenzelm@63871
   843
INCOMPATIBILITY, use 'abbrevs' within theory header instead.
wenzelm@63579
   844
wenzelm@64390
   845
* Action "isabelle.keymap-merge" asks the user to resolve pending
wenzelm@64390
   846
Isabelle keymap changes that are in conflict with the current jEdit
wenzelm@64390
   847
keymap; non-conflicting changes are always applied implicitly. This
wenzelm@64390
   848
action is automatically invoked on Isabelle/jEdit startup and thus
wenzelm@64390
   849
increases chances that users see new keyboard shortcuts when re-using
wenzelm@64390
   850
old keymaps.
wenzelm@64390
   851
wenzelm@63675
   852
* ML and document antiquotations for file-systems paths are more uniform
wenzelm@63675
   853
and diverse:
wenzelm@63675
   854
wenzelm@63675
   855
  @{path NAME}   -- no file-system check
wenzelm@63675
   856
  @{file NAME}   -- check for plain file
wenzelm@63675
   857
  @{dir NAME}    -- check for directory
wenzelm@63675
   858
wenzelm@63675
   859
Minor INCOMPATIBILITY, former uses of @{file} and @{file_unchecked} may
wenzelm@63675
   860
have to be changed.
wenzelm@63669
   861
wenzelm@63669
   862
wenzelm@63977
   863
*** Document preparation ***
wenzelm@63977
   864
wenzelm@63977
   865
* New symbol \<circle>, e.g. for temporal operator.
wenzelm@63977
   866
wenzelm@64073
   867
* New document and ML antiquotation @{locale} for locales, similar to
wenzelm@64073
   868
existing antiquotation @{class}.
wenzelm@64073
   869
wenzelm@63977
   870
* Mixfix annotations support delimiters like \<^control>\<open>cartouche\<close> --
wenzelm@63977
   871
this allows special forms of document output.
wenzelm@63977
   872
wenzelm@63977
   873
* Raw LaTeX output now works via \<^latex>\<open>...\<close> instead of raw control
wenzelm@63977
   874
symbol \<^raw:...>. INCOMPATIBILITY, notably for LaTeXsugar.thy and its
wenzelm@63977
   875
derivatives.
wenzelm@63977
   876
wenzelm@63977
   877
* \<^raw:...> symbols are no longer supported.
wenzelm@63977
   878
wenzelm@63977
   879
* Old 'header' command is no longer supported (legacy since
wenzelm@63977
   880
Isabelle2015).
wenzelm@63977
   881
wenzelm@63977
   882
wenzelm@62312
   883
*** Isar ***
wenzelm@62312
   884
wenzelm@63180
   885
* Many specification elements support structured statements with 'if' /
wenzelm@63180
   886
'for' eigen-context, e.g. 'axiomatization', 'abbreviation',
wenzelm@63180
   887
'definition', 'inductive', 'function'.
wenzelm@63180
   888
wenzelm@63094
   889
* Toplevel theorem statements support eigen-context notation with 'if' /
wenzelm@63284
   890
'for' (in postfix), which corresponds to 'assumes' / 'fixes' in the
wenzelm@63094
   891
traditional long statement form (in prefix). Local premises are called
wenzelm@63094
   892
"that" or "assms", respectively. Empty premises are *not* bound in the
wenzelm@63094
   893
context: INCOMPATIBILITY.
wenzelm@63094
   894
wenzelm@63039
   895
* Command 'define' introduces a local (non-polymorphic) definition, with
wenzelm@63039
   896
optional abstraction over local parameters. The syntax resembles
wenzelm@63043
   897
'definition' and 'obtain'. It fits better into the Isar language than
wenzelm@63043
   898
old 'def', which is now a legacy feature.
wenzelm@63039
   899
wenzelm@63059
   900
* Command 'obtain' supports structured statements with 'if' / 'for'
wenzelm@63059
   901
context.
wenzelm@63059
   902
wenzelm@62312
   903
* Command '\<proof>' is an alias for 'sorry', with different
wenzelm@62312
   904
typesetting. E.g. to produce proof holes in examples and documentation.
wenzelm@62216
   905
wenzelm@63977
   906
* The defining position of a literal fact \<open>prop\<close> is maintained more
wenzelm@63977
   907
carefully, and made accessible as hyperlink in the Prover IDE.
wenzelm@63977
   908
wenzelm@63977
   909
* Commands 'finally' and 'ultimately' used to expose the result as
wenzelm@63977
   910
literal fact: this accidental behaviour has been discontinued. Rare
wenzelm@63977
   911
INCOMPATIBILITY, use more explicit means to refer to facts in Isar.
wenzelm@63977
   912
wenzelm@63977
   913
* Command 'axiomatization' has become more restrictive to correspond
wenzelm@63977
   914
better to internal axioms as singleton facts with mandatory name. Minor
wenzelm@63977
   915
INCOMPATIBILITY.
wenzelm@62939
   916
wenzelm@63259
   917
* Proof methods may refer to the main facts via the dynamic fact
wenzelm@63259
   918
"method_facts". This is particularly useful for Eisbach method
wenzelm@63259
   919
definitions.
wenzelm@63259
   920
wenzelm@63527
   921
* Proof method "use" allows to modify the main facts of a given method
wenzelm@63527
   922
expression, e.g.
wenzelm@63259
   923
wenzelm@63259
   924
  (use facts in simp)
wenzelm@63259
   925
  (use facts in \<open>simp add: ...\<close>)
wenzelm@63259
   926
wenzelm@63977
   927
* The old proof method "default" has been removed (legacy since
wenzelm@63977
   928
Isabelle2016). INCOMPATIBILITY, use "standard" instead.
wenzelm@63977
   929
wenzelm@62216
   930
haftmann@63165
   931
*** Pure ***
haftmann@63165
   932
wenzelm@63977
   933
* Pure provides basic versions of proof methods "simp" and "simp_all"
wenzelm@63977
   934
that only know about meta-equality (==). Potential INCOMPATIBILITY in
wenzelm@63977
   935
theory imports that merge Pure with e.g. Main of Isabelle/HOL: the order
wenzelm@63977
   936
is relevant to avoid confusion of Pure.simp vs. HOL.simp.
wenzelm@63977
   937
wenzelm@63977
   938
* The command 'unfolding' and proof method "unfold" include a second
wenzelm@63977
   939
stage where given equations are passed through the attribute "abs_def"
wenzelm@63977
   940
before rewriting. This ensures that definitions are fully expanded,
wenzelm@63977
   941
regardless of the actual parameters that are provided. Rare
wenzelm@63977
   942
INCOMPATIBILITY in some corner cases: use proof method (simp only:)
wenzelm@63977
   943
instead, or declare [[unfold_abs_def = false]] in the proof context.
wenzelm@63977
   944
wenzelm@63977
   945
* Type-inference improves sorts of newly introduced type variables for
wenzelm@63977
   946
the object-logic, using its base sort (i.e. HOL.type for Isabelle/HOL).
wenzelm@63977
   947
Thus terms like "f x" or "\<And>x. P x" without any further syntactic context
wenzelm@63977
   948
produce x::'a::type in HOL instead of x::'a::{} in Pure. Rare
wenzelm@63977
   949
INCOMPATIBILITY, need to provide explicit type constraints for Pure
wenzelm@63977
   950
types where this is really intended.
haftmann@63350
   951
haftmann@63165
   952
blanchet@62327
   953
*** HOL ***
blanchet@62327
   954
wenzelm@63977
   955
* New proof method "argo" using the built-in Argo solver based on SMT
wenzelm@63977
   956
technology. The method can be used to prove goals of quantifier-free
wenzelm@63977
   957
propositional logic, goals based on a combination of quantifier-free
wenzelm@63977
   958
propositional logic with equality, and goals based on a combination of
wenzelm@63977
   959
quantifier-free propositional logic with linear real arithmetic
wenzelm@63977
   960
including min/max/abs. See HOL/ex/Argo_Examples.thy for examples.
wenzelm@63977
   961
blanchet@66614
   962
* The new "nunchaku" command integrates the Nunchaku model finder. The
wenzelm@64390
   963
tool is experimental. See ~~/src/HOL/Nunchaku/Nunchaku.thy for details.
wenzelm@64390
   964
wenzelm@63977
   965
* Metis: The problem encoding has changed very slightly. This might
blanchet@63785
   966
break existing proofs. INCOMPATIBILITY.
blanchet@63785
   967
blanchet@63116
   968
* Sledgehammer:
lp15@63967
   969
  - The MaSh relevance filter is now faster than before.
blanchet@63116
   970
  - Produce syntactically correct Vampire 4.0 problem files.
blanchet@63116
   971
blanchet@62327
   972
* (Co)datatype package:
blanchet@62693
   973
  - New commands for defining corecursive functions and reasoning about
blanchet@62693
   974
    them in "~~/src/HOL/Library/BNF_Corec.thy": 'corec', 'corecursive',
blanchet@62693
   975
    'friend_of_corec', and 'corecursion_upto'; and 'corec_unique' proof
blanchet@62842
   976
    method. See 'isabelle doc corec'.
wenzelm@63977
   977
  - The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a first-class
blanchet@63855
   978
    citizen in bounded natural functors.
blanchet@62693
   979
  - 'primrec' now allows nested calls through the predicator in addition
blanchet@62327
   980
    to the map function.
blanchet@63855
   981
  - 'bnf' automatically discharges reflexive proof obligations.
blanchet@62693
   982
  - 'bnf' outputs a slightly modified proof obligation expressing rel in
traytel@62332
   983
       terms of map and set
blanchet@63855
   984
       (not giving a specification for rel makes this one reflexive).
blanchet@62693
   985
  - 'bnf' outputs a new proof obligation expressing pred in terms of set
blanchet@63855
   986
       (not giving a specification for pred makes this one reflexive).
blanchet@63855
   987
    INCOMPATIBILITY: manual 'bnf' declarations may need adjustment.
blanchet@62335
   988
  - Renamed lemmas:
blanchet@62335
   989
      rel_prod_apply ~> rel_prod_inject
blanchet@62335
   990
      pred_prod_apply ~> pred_prod_inject
blanchet@62335
   991
    INCOMPATIBILITY.
blanchet@62536
   992
  - The "size" plugin has been made compatible again with locales.
blanchet@63855
   993
  - The theorems about "rel" and "set" may have a slightly different (but
blanchet@63855
   994
    equivalent) form.
blanchet@63855
   995
    INCOMPATIBILITY.
blanchet@62327
   996
wenzelm@63977
   997
* The 'coinductive' command produces a proper coinduction rule for
wenzelm@63977
   998
mutual coinductive predicates. This new rule replaces the old rule,
wenzelm@63977
   999
which exposed details of the internal fixpoint construction and was
wenzelm@63977
  1000
hard to use. INCOMPATIBILITY.
wenzelm@63977
  1001
wenzelm@63977
  1002
* New abbreviations for negated existence (but not bounded existence):
wenzelm@63977
  1003
wenzelm@63977
  1004
  \<nexists>x. P x \<equiv> \<not> (\<exists>x. P x)
wenzelm@63977
  1005
  \<nexists>!x. P x \<equiv> \<not> (\<exists>!x. P x)
wenzelm@63977
  1006
wenzelm@63977
  1007
* The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@"
wenzelm@63977
  1008
has been removed for output. It is retained for input only, until it is
wenzelm@63977
  1009
eliminated altogether.
wenzelm@63977
  1010
wenzelm@63977
  1011
* The unique existence quantifier no longer provides 'binder' syntax,
wenzelm@63977
  1012
but uses syntax translations (as for bounded unique existence). Thus
wenzelm@63977
  1013
iterated quantification \<exists>!x y. P x y with its slightly confusing
wenzelm@63977
  1014
sequential meaning \<exists>!x. \<exists>!y. P x y is no longer possible. Instead,
wenzelm@63977
  1015
pattern abstraction admits simultaneous unique existence \<exists>!(x, y). P x y
wenzelm@63977
  1016
(analogous to existing notation \<exists>!(x, y)\<in>A. P x y). Potential
wenzelm@63977
  1017
INCOMPATIBILITY in rare situations.
wenzelm@63977
  1018
wenzelm@63977
  1019
* Conventional syntax "%(). t" for unit abstractions. Slight syntactic
wenzelm@63977
  1020
INCOMPATIBILITY.
wenzelm@63977
  1021
wenzelm@64390
  1022
* Renamed constants and corresponding theorems:
wenzelm@64390
  1023
wenzelm@64390
  1024
    setsum ~> sum
wenzelm@64390
  1025
    setprod ~> prod
wenzelm@64390
  1026
    listsum ~> sum_list
wenzelm@64390
  1027
    listprod ~> prod_list
wenzelm@64390
  1028
wenzelm@64390
  1029
INCOMPATIBILITY.
wenzelm@64390
  1030
wenzelm@64390
  1031
* Sligthly more standardized theorem names:
wenzelm@64390
  1032
    sgn_times ~> sgn_mult
wenzelm@64390
  1033
    sgn_mult' ~> Real_Vector_Spaces.sgn_mult
wenzelm@64390
  1034
    divide_zero_left ~> div_0
wenzelm@64390
  1035
    zero_mod_left ~> mod_0
wenzelm@64390
  1036
    divide_zero ~> div_by_0
wenzelm@64390
  1037
    divide_1 ~> div_by_1
wenzelm@64390
  1038
    nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left
wenzelm@64390
  1039
    div_mult_self1_is_id ~> nonzero_mult_div_cancel_left
wenzelm@64390
  1040
    nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right
wenzelm@64390
  1041
    div_mult_self2_is_id ~> nonzero_mult_div_cancel_right
wenzelm@64390
  1042
    is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left
wenzelm@64390
  1043
    is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right
wenzelm@64390
  1044
    mod_div_equality ~> div_mult_mod_eq
wenzelm@64390
  1045
    mod_div_equality2 ~> mult_div_mod_eq
wenzelm@64390
  1046
    mod_div_equality3 ~> mod_div_mult_eq
wenzelm@64390
  1047
    mod_div_equality4 ~> mod_mult_div_eq
wenzelm@64390
  1048
    minus_div_eq_mod ~> minus_div_mult_eq_mod
wenzelm@64390
  1049
    minus_div_eq_mod2 ~> minus_mult_div_eq_mod
wenzelm@64390
  1050
    minus_mod_eq_div ~> minus_mod_eq_div_mult
wenzelm@64390
  1051
    minus_mod_eq_div2 ~> minus_mod_eq_mult_div
wenzelm@64390
  1052
    div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]
wenzelm@64390
  1053
    mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]
wenzelm@64390
  1054
    zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]
wenzelm@64390
  1055
    zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]
wenzelm@64390
  1056
    Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
  1057
    mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
  1058
    zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
  1059
    div_1 ~> div_by_Suc_0
wenzelm@64390
  1060
    mod_1 ~> mod_by_Suc_0
wenzelm@64390
  1061
INCOMPATIBILITY.
wenzelm@64390
  1062
wenzelm@64390
  1063
* New type class "idom_abs_sgn" specifies algebraic properties
wenzelm@64390
  1064
of sign and absolute value functions.  Type class "sgn_if" has
wenzelm@64390
  1065
disappeared.  Slight INCOMPATIBILITY.
wenzelm@64390
  1066
wenzelm@64390
  1067
* Dedicated syntax LENGTH('a) for length of types.
wenzelm@64390
  1068
wenzelm@63977
  1069
* Characters (type char) are modelled as finite algebraic type
wenzelm@63977
  1070
corresponding to {0..255}.
wenzelm@63977
  1071
wenzelm@63977
  1072
  - Logical representation:
wenzelm@63977
  1073
    * 0 is instantiated to the ASCII zero character.
wenzelm@63977
  1074
    * All other characters are represented as "Char n"
wenzelm@63977
  1075
      with n being a raw numeral expression less than 256.
wenzelm@63977
  1076
    * Expressions of the form "Char n" with n greater than 255
wenzelm@63977
  1077
      are non-canonical.
wenzelm@63977
  1078
  - Printing and parsing:
wenzelm@63977
  1079
    * Printable characters are printed and parsed as "CHR ''\<dots>''"
wenzelm@63977
  1080
      (as before).
wenzelm@63977
  1081
    * The ASCII zero character is printed and parsed as "0".
wenzelm@63977
  1082
    * All other canonical characters are printed as "CHR 0xXX"
wenzelm@63977
  1083
      with XX being the hexadecimal character code.  "CHR n"
wenzelm@63977
  1084
      is parsable for every numeral expression n.
wenzelm@63977
  1085
    * Non-canonical characters have no special syntax and are
wenzelm@63977
  1086
      printed as their logical representation.
wenzelm@63977
  1087
  - Explicit conversions from and to the natural numbers are
wenzelm@63977
  1088
    provided as char_of_nat, nat_of_char (as before).
wenzelm@63977
  1089
  - The auxiliary nibble type has been discontinued.
wenzelm@63977
  1090
wenzelm@63977
  1091
INCOMPATIBILITY.
wenzelm@63977
  1092
wenzelm@63977
  1093
* Type class "div" with operation "mod" renamed to type class "modulo"
wenzelm@63977
  1094
with operation "modulo", analogously to type class "divide". This
wenzelm@63977
  1095
eliminates the need to qualify any of those names in the presence of
wenzelm@63977
  1096
infix "mod" syntax. INCOMPATIBILITY.
wenzelm@63977
  1097
wenzelm@63979
  1098
* Statements and proofs of Knaster-Tarski fixpoint combinators lfp/gfp
wenzelm@63979
  1099
have been clarified. The fixpoint properties are lfp_fixpoint, its
wenzelm@63979
  1100
symmetric lfp_unfold (as before), and the duals for gfp. Auxiliary items
wenzelm@63979
  1101
for the proof (lfp_lemma2 etc.) are no longer exported, but can be
wenzelm@63979
  1102
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.
wenzelm@63979
  1103
wenzelm@63977
  1104
* Constant "surj" is a mere input abbreviation, to avoid hiding an
wenzelm@63977
  1105
equation in term output. Minor INCOMPATIBILITY.
wenzelm@63977
  1106
wenzelm@63977
  1107
* Command 'code_reflect' accepts empty constructor lists for datatypes,
wenzelm@63977
  1108
which renders those abstract effectively.
wenzelm@63977
  1109
wenzelm@63977
  1110
* Command 'export_code' checks given constants for abstraction
wenzelm@63977
  1111
violations: a small guarantee that given constants specify a safe
wenzelm@63977
  1112
interface for the generated code.
wenzelm@63977
  1113
wenzelm@63977
  1114
* Code generation for Scala: ambiguous implicts in class diagrams are
wenzelm@63977
  1115
spelt out explicitly.
wenzelm@63977
  1116
wenzelm@63977
  1117
* Static evaluators (Code_Evaluation.static_* in Isabelle/ML) rely on
wenzelm@63977
  1118
explicitly provided auxiliary definitions for required type class
wenzelm@64390
  1119
dictionaries rather than half-working magic. INCOMPATIBILITY, see the
wenzelm@64390
  1120
tutorial on code generation for details.
wenzelm@64390
  1121
wenzelm@64390
  1122
* Theory Set_Interval: substantial new theorems on indexed sums and
wenzelm@64390
  1123
products.
wenzelm@63977
  1124
wenzelm@63977
  1125
* Locale bijection establishes convenient default simp rules such as
wenzelm@63977
  1126
"inv f (f a) = a" for total bijections.
wenzelm@63977
  1127
wenzelm@63977
  1128
* Abstract locales semigroup, abel_semigroup, semilattice,
wenzelm@63977
  1129
semilattice_neutr, ordering, ordering_top, semilattice_order,
wenzelm@63977
  1130
semilattice_neutr_order, comm_monoid_set, semilattice_set,
wenzelm@63977
  1131
semilattice_neutr_set, semilattice_order_set,
wenzelm@63977
  1132
semilattice_order_neutr_set monoid_list, comm_monoid_list,
wenzelm@63977
  1133
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified
wenzelm@63977
  1134
syntax uniformly that does not clash with corresponding global syntax.
wenzelm@63977
  1135
INCOMPATIBILITY.
wenzelm@63977
  1136
wenzelm@63977
  1137
* Former locale lifting_syntax is now a bundle, which is easier to
wenzelm@63977
  1138
include in a local context or theorem statement, e.g. "context includes
wenzelm@63977
  1139
lifting_syntax begin ... end". Minor INCOMPATIBILITY.
wenzelm@63977
  1140
wenzelm@63807
  1141
* Some old / obsolete theorems have been renamed / removed, potential
wenzelm@63807
  1142
INCOMPATIBILITY.
wenzelm@63807
  1143
wenzelm@63807
  1144
  nat_less_cases  --  removed, use linorder_cases instead
wenzelm@63807
  1145
  inv_image_comp  --  removed, use image_inv_f_f instead
wenzelm@63807
  1146
  image_surj_f_inv_f  ~>  image_f_inv_f
wenzelm@63113
  1147
Mathias@63456
  1148
* Some theorems about groups and orders have been generalised from
Mathias@63456
  1149
  groups to semi-groups that are also monoids:
Mathias@63456
  1150
    le_add_same_cancel1
Mathias@63456
  1151
    le_add_same_cancel2
Mathias@63456
  1152
    less_add_same_cancel1
Mathias@63456
  1153
    less_add_same_cancel2
Mathias@63456
  1154
    add_le_same_cancel1
Mathias@63456
  1155
    add_le_same_cancel2
Mathias@63456
  1156
    add_less_same_cancel1
Mathias@63456
  1157
    add_less_same_cancel2
Mathias@63456
  1158
Mathias@63456
  1159
* Some simplifications theorems about rings have been removed, since
Mathias@63456
  1160
  superseeded by a more general version:
Mathias@63456
  1161
    less_add_cancel_left_greater_zero ~> less_add_same_cancel1
Mathias@63456
  1162
    less_add_cancel_right_greater_zero ~> less_add_same_cancel2
Mathias@63456
  1163
    less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1
Mathias@63456
  1164
    less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2
Mathias@63456
  1165
    less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1
Mathias@63456
  1166
    less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2
Mathias@63456
  1167
    less_add_cancel_left_less_zero ~> add_less_same_cancel1
Mathias@63456
  1168
    less_add_cancel_right_less_zero ~> add_less_same_cancel2
Mathias@63456
  1169
INCOMPATIBILITY.
Mathias@63456
  1170
wenzelm@62407
  1171
* Renamed split_if -> if_split and split_if_asm -> if_split_asm to
wenzelm@62407
  1172
resemble the f.split naming convention, INCOMPATIBILITY.
nipkow@62396
  1173
wenzelm@63977
  1174
* Added class topological_monoid.
wenzelm@63977
  1175
wenzelm@64391
  1176
* The following theorems have been renamed:
wenzelm@64391
  1177
nipkow@64457
  1178
  setsum_left_distrib ~> sum_distrib_right
nipkow@64457
  1179
  setsum_right_distrib ~> sum_distrib_left
wenzelm@64391
  1180
wenzelm@64391
  1181
INCOMPATIBILITY.
wenzelm@64391
  1182
wenzelm@64391
  1183
* Compound constants INFIMUM and SUPREMUM are mere abbreviations now.
wenzelm@64391
  1184
INCOMPATIBILITY.
wenzelm@64391
  1185
wenzelm@64391
  1186
* "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional
wenzelm@64391
  1187
comprehension-like syntax analogously to "Inf (f ` A)" and "Sup (f `
wenzelm@64391
  1188
A)".
wenzelm@64391
  1189
wenzelm@64391
  1190
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.
wenzelm@64391
  1191
wenzelm@64391
  1192
* The type class ordered_comm_monoid_add is now called
wenzelm@64391
  1193
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add
wenzelm@64391
  1194
is introduced as the combination of ordered_ab_semigroup_add +
wenzelm@64391
  1195
comm_monoid_add. INCOMPATIBILITY.
wenzelm@64391
  1196
wenzelm@64391
  1197
* Introduced the type classes canonically_ordered_comm_monoid_add and
wenzelm@64391
  1198
dioid.
wenzelm@64391
  1199
wenzelm@64391
  1200
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When
wenzelm@64391
  1201
instantiating linordered_semiring_strict and ordered_ab_group_add, an
wenzelm@64391
  1202
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might
wenzelm@64391
  1203
be required. INCOMPATIBILITY.
nipkow@63117
  1204
haftmann@62348
  1205
* Dropped various legacy fact bindings, whose replacements are often
haftmann@62348
  1206
of a more general type also:
haftmann@62348
  1207
  lcm_left_commute_nat ~> lcm.left_commute
haftmann@62348
  1208
  lcm_left_commute_int ~> lcm.left_commute
haftmann@62348
  1209
  gcd_left_commute_nat ~> gcd.left_commute
haftmann@62348
  1210
  gcd_left_commute_int ~> gcd.left_commute
haftmann@62348
  1211
  gcd_greatest_iff_nat ~> gcd_greatest_iff
haftmann@62348
  1212
  gcd_greatest_iff_int ~> gcd_greatest_iff
haftmann@62348
  1213
  coprime_dvd_mult_nat ~> coprime_dvd_mult
haftmann@62348
  1214
  coprime_dvd_mult_int ~> coprime_dvd_mult
haftmann@62348
  1215
  zpower_numeral_even ~> power_numeral_even
haftmann@62348
  1216
  gcd_mult_cancel_nat ~> gcd_mult_cancel
haftmann@62348
  1217
  gcd_mult_cancel_int ~> gcd_mult_cancel
haftmann@62348
  1218
  div_gcd_coprime_nat ~> div_gcd_coprime
haftmann@62348
  1219
  div_gcd_coprime_int ~> div_gcd_coprime
haftmann@62348
  1220
  zpower_numeral_odd ~> power_numeral_odd
haftmann@62348
  1221
  zero_less_int_conv ~> of_nat_0_less_iff
haftmann@62348
  1222
  gcd_greatest_nat ~> gcd_greatest
haftmann@62348
  1223
  gcd_greatest_int ~> gcd_greatest
haftmann@62348
  1224
  coprime_mult_nat ~> coprime_mult
haftmann@62348
  1225
  coprime_mult_int ~> coprime_mult
haftmann@62348
  1226
  lcm_commute_nat ~> lcm.commute
haftmann@62348
  1227
  lcm_commute_int ~> lcm.commute
haftmann@62348
  1228
  int_less_0_conv ~> of_nat_less_0_iff
haftmann@62348
  1229
  gcd_commute_nat ~> gcd.commute
haftmann@62348
  1230
  gcd_commute_int ~> gcd.commute
haftmann@62348
  1231
  Gcd_insert_nat ~> Gcd_insert
haftmann@62348
  1232
  Gcd_insert_int ~> Gcd_insert
haftmann@62348
  1233
  of_int_int_eq ~> of_int_of_nat_eq
haftmann@62348
  1234
  lcm_least_nat ~> lcm_least
haftmann@62348
  1235
  lcm_least_int ~> lcm_least
haftmann@62348
  1236
  lcm_assoc_nat ~> lcm.assoc
haftmann@62348
  1237
  lcm_assoc_int ~> lcm.assoc
haftmann@62348
  1238
  int_le_0_conv ~> of_nat_le_0_iff
haftmann@62348
  1239
  int_eq_0_conv ~> of_nat_eq_0_iff
haftmann@62348
  1240
  Gcd_empty_nat ~> Gcd_empty
haftmann@62348
  1241
  Gcd_empty_int ~> Gcd_empty
haftmann@62348
  1242
  gcd_assoc_nat ~> gcd.assoc
haftmann@62348
  1243
  gcd_assoc_int ~> gcd.assoc
haftmann@62348
  1244
  zero_zle_int ~> of_nat_0_le_iff
haftmann@62348
  1245
  lcm_dvd2_nat ~> dvd_lcm2
haftmann@62348
  1246
  lcm_dvd2_int ~> dvd_lcm2
haftmann@62348
  1247
  lcm_dvd1_nat ~> dvd_lcm1
haftmann@62348
  1248
  lcm_dvd1_int ~> dvd_lcm1
haftmann@62348
  1249
  gcd_zero_nat ~> gcd_eq_0_iff
haftmann@62348
  1250
  gcd_zero_int ~> gcd_eq_0_iff
haftmann@62348
  1251
  gcd_dvd2_nat ~> gcd_dvd2
haftmann@62348
  1252
  gcd_dvd2_int ~> gcd_dvd2
haftmann@62348
  1253
  gcd_dvd1_nat ~> gcd_dvd1
haftmann@62348
  1254
  gcd_dvd1_int ~> gcd_dvd1
haftmann@62348
  1255
  int_numeral ~> of_nat_numeral
haftmann@62348
  1256
  lcm_ac_nat ~> ac_simps
haftmann@62348
  1257
  lcm_ac_int ~> ac_simps
haftmann@62348
  1258
  gcd_ac_nat ~> ac_simps
haftmann@62348
  1259
  gcd_ac_int ~> ac_simps
haftmann@62348
  1260
  abs_int_eq ~> abs_of_nat
haftmann@62348
  1261
  zless_int ~> of_nat_less_iff
haftmann@62348
  1262
  zdiff_int ~> of_nat_diff
haftmann@62348
  1263
  zadd_int ~> of_nat_add
haftmann@62348
  1264
  int_mult ~> of_nat_mult
haftmann@62348
  1265
  int_Suc ~> of_nat_Suc
haftmann@62348
  1266
  inj_int ~> inj_of_nat
haftmann@62348
  1267
  int_1 ~> of_nat_1
haftmann@62348
  1268
  int_0 ~> of_nat_0
haftmann@62353
  1269
  Lcm_empty_nat ~> Lcm_empty
haftmann@62353
  1270
  Lcm_empty_int ~> Lcm_empty
haftmann@62353
  1271
  Lcm_insert_nat ~> Lcm_insert
haftmann@62353
  1272
  Lcm_insert_int ~> Lcm_insert
haftmann@62353
  1273
  comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd
haftmann@62353
  1274
  comp_fun_idem_gcd_int ~> comp_fun_idem_gcd
haftmann@62353
  1275
  comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm
haftmann@62353
  1276
  comp_fun_idem_lcm_int ~> comp_fun_idem_lcm
haftmann@62353
  1277
  Lcm_eq_0 ~> Lcm_eq_0_I
haftmann@62353
  1278
  Lcm0_iff ~> Lcm_0_iff
haftmann@62353
  1279
  Lcm_dvd_int ~> Lcm_least
haftmann@62353
  1280
  divides_mult_nat ~> divides_mult
haftmann@62353
  1281
  divides_mult_int ~> divides_mult
haftmann@62353
  1282
  lcm_0_nat ~> lcm_0_right
haftmann@62353
  1283
  lcm_0_int ~> lcm_0_right
haftmann@62353
  1284
  lcm_0_left_nat ~> lcm_0_left
haftmann@62353
  1285
  lcm_0_left_int ~> lcm_0_left
haftmann@62353
  1286
  dvd_gcd_D1_nat ~> dvd_gcdD1
haftmann@62353
  1287
  dvd_gcd_D1_int ~> dvd_gcdD1
haftmann@62353
  1288
  dvd_gcd_D2_nat ~> dvd_gcdD2
haftmann@62353
  1289
  dvd_gcd_D2_int ~> dvd_gcdD2
haftmann@62353
  1290
  coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff
haftmann@62353
  1291
  coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff
haftmann@62348
  1292
  realpow_minus_mult ~> power_minus_mult
haftmann@62348
  1293
  realpow_Suc_le_self ~> power_Suc_le_self
haftmann@62353
  1294
  dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest
haftmann@62347
  1295
INCOMPATIBILITY.
haftmann@62347
  1296
lp15@63967
  1297
* Renamed HOL/Quotient_Examples/FSet.thy to
wenzelm@63977
  1298
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.
wenzelm@63977
  1299
wenzelm@64390
  1300
* Session HOL-Library: theory FinFun bundles "finfun_syntax" and
wenzelm@64390
  1301
"no_finfun_syntax" allow to control optional syntax in local contexts;
wenzelm@64390
  1302
this supersedes former theory FinFun_Syntax. INCOMPATIBILITY, e.g. use
wenzelm@64390
  1303
"unbundle finfun_syntax" to imitate import of
wenzelm@64390
  1304
"~~/src/HOL/Library/FinFun_Syntax".
wenzelm@64390
  1305
wenzelm@64390
  1306
* Session HOL-Library: theory Multiset_Permutations (executably) defines
wenzelm@64390
  1307
the set of permutations of a given set or multiset, i.e. the set of all
wenzelm@64390
  1308
lists that contain every element of the carrier (multi-)set exactly
wenzelm@64390
  1309
once.
wenzelm@64390
  1310
wenzelm@64390
  1311
* Session HOL-Library: multiset membership is now expressed using
wenzelm@64390
  1312
set_mset rather than count.
wenzelm@64390
  1313
wenzelm@64390
  1314
  - Expressions "count M a > 0" and similar simplify to membership
wenzelm@64390
  1315
    by default.
wenzelm@64390
  1316
wenzelm@64390
  1317
  - Converting between "count M a = 0" and non-membership happens using
wenzelm@64390
  1318
    equations count_eq_zero_iff and not_in_iff.
wenzelm@64390
  1319
wenzelm@64390
  1320
  - Rules count_inI and in_countE obtain facts of the form
wenzelm@64390
  1321
    "count M a = n" from membership.
wenzelm@64390
  1322
wenzelm@64390
  1323
  - Rules count_in_diffI and in_diff_countE obtain facts of the form
wenzelm@64390
  1324
    "count M a = n + count N a" from membership on difference sets.
wenzelm@64390
  1325
wenzelm@64390
  1326
INCOMPATIBILITY.
wenzelm@64390
  1327
wenzelm@64390
  1328
* Session HOL-Library: theory LaTeXsugar uses new-style "dummy_pats" for
wenzelm@64390
  1329
displaying equations in functional programming style --- variables
wenzelm@64390
  1330
present on the left-hand but not on the righ-hand side are replaced by
wenzelm@64390
  1331
underscores.
wenzelm@64390
  1332
wenzelm@64390
  1333
* Session HOL-Library: theory Combinator_PER provides combinator to
wenzelm@64390
  1334
build partial equivalence relations from a predicate and an equivalence
wenzelm@64390
  1335
relation.
wenzelm@64390
  1336
wenzelm@64390
  1337
* Session HOL-Library: theory Perm provides basic facts about almost
wenzelm@64390
  1338
everywhere fix bijections.
wenzelm@64390
  1339
wenzelm@64390
  1340
* Session HOL-Library: theory Normalized_Fraction allows viewing an
wenzelm@64390
  1341
element of a field of fractions as a normalized fraction (i.e. a pair of
wenzelm@64390
  1342
numerator and denominator such that the two are coprime and the
wenzelm@64390
  1343
denominator is normalized wrt. unit factors).
wenzelm@64390
  1344
wenzelm@64390
  1345
* Session HOL-NSA has been renamed to HOL-Nonstandard_Analysis.
wenzelm@64390
  1346
wenzelm@64390
  1347
* Session HOL-Multivariate_Analysis has been renamed to HOL-Analysis.
wenzelm@64390
  1348
wenzelm@64390
  1349
* Session HOL-Analysis: measure theory has been moved here from
wenzelm@64390
  1350
HOL-Probability. When importing HOL-Analysis some theorems need
wenzelm@64390
  1351
additional name spaces prefixes due to name clashes. INCOMPATIBILITY.
wenzelm@64390
  1352
wenzelm@64390
  1353
* Session HOL-Analysis: more complex analysis including Cauchy's
wenzelm@64390
  1354
inequality, Liouville theorem, open mapping theorem, maximum modulus
wenzelm@64390
  1355
principle, Residue theorem, Schwarz Lemma.
wenzelm@64390
  1356
wenzelm@64390
  1357
* Session HOL-Analysis: Theory of polyhedra: faces, extreme points,
wenzelm@64390
  1358
polytopes, and the Krein–Milman Minkowski theorem.
wenzelm@64390
  1359
wenzelm@64390
  1360
* Session HOL-Analysis: Numerous results ported from the HOL Light
wenzelm@64390
  1361
libraries: homeomorphisms, continuous function extensions, invariance of
wenzelm@64390
  1362
domain.
wenzelm@64390
  1363
wenzelm@64390
  1364
* Session HOL-Probability: the type of emeasure and nn_integral was
wenzelm@64390
  1365
changed from ereal to ennreal, INCOMPATIBILITY.
wenzelm@64390
  1366
wenzelm@64390
  1367
  emeasure :: 'a measure \<Rightarrow> 'a set \<Rightarrow> ennreal
wenzelm@64390
  1368
  nn_integral :: 'a measure \<Rightarrow> ('a \<Rightarrow> ennreal) \<Rightarrow> ennreal
wenzelm@64390
  1369
wenzelm@64390
  1370
* Session HOL-Probability: Code generation and QuickCheck for
wenzelm@64390
  1371
Probability Mass Functions.
wenzelm@64390
  1372
wenzelm@64390
  1373
* Session HOL-Probability: theory Random_Permutations contains some
wenzelm@64390
  1374
theory about choosing a permutation of a set uniformly at random and
wenzelm@64390
  1375
folding over a list in random order.
wenzelm@64390
  1376
wenzelm@64390
  1377
* Session HOL-Probability: theory SPMF formalises discrete
wenzelm@64390
  1378
subprobability distributions.
wenzelm@64390
  1379
wenzelm@64390
  1380
* Session HOL-Library: the names of multiset theorems have been
wenzelm@64390
  1381
normalised to distinguish which ordering the theorems are about
wenzelm@64390
  1382
wenzelm@64390
  1383
    mset_less_eqI ~> mset_subset_eqI
wenzelm@64390
  1384
    mset_less_insertD ~> mset_subset_insertD
wenzelm@64390
  1385
    mset_less_eq_count ~> mset_subset_eq_count
wenzelm@64390
  1386
    mset_less_diff_self ~> mset_subset_diff_self
wenzelm@64390
  1387
    mset_le_exists_conv ~> mset_subset_eq_exists_conv
wenzelm@64390
  1388
    mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel
wenzelm@64390
  1389
    mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel
wenzelm@64390
  1390
    mset_le_mono_add ~> mset_subset_eq_mono_add
wenzelm@64390
  1391
    mset_le_add_left ~> mset_subset_eq_add_left
wenzelm@64390
  1392
    mset_le_add_right ~> mset_subset_eq_add_right
wenzelm@64390
  1393
    mset_le_single ~> mset_subset_eq_single
wenzelm@64390
  1394
    mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute
wenzelm@64390
  1395
    diff_le_self ~> diff_subset_eq_self
wenzelm@64390
  1396
    mset_leD ~> mset_subset_eqD
wenzelm@64390
  1397
    mset_lessD ~> mset_subsetD
wenzelm@64390
  1398
    mset_le_insertD ~> mset_subset_eq_insertD
wenzelm@64390
  1399
    mset_less_of_empty ~> mset_subset_of_empty
wenzelm@64390
  1400
    mset_less_size ~> mset_subset_size
wenzelm@64390
  1401
    wf_less_mset_rel ~> wf_subset_mset_rel
wenzelm@64390
  1402
    count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq
wenzelm@64390
  1403
    mset_remdups_le ~> mset_remdups_subset_eq
wenzelm@64390
  1404
    ms_lesseq_impl ~> subset_eq_mset_impl
wenzelm@64390
  1405
wenzelm@64390
  1406
Some functions have been renamed:
wenzelm@64390
  1407
    ms_lesseq_impl -> subset_eq_mset_impl
wenzelm@64390
  1408
wenzelm@64390
  1409
* HOL-Library: multisets are now ordered with the multiset ordering
wenzelm@64390
  1410
    #\<subseteq># ~> \<le>
wenzelm@64390
  1411
    #\<subset># ~> <
wenzelm@64390
  1412
    le_multiset ~> less_eq_multiset
wenzelm@64390
  1413
    less_multiset ~> le_multiset
wenzelm@64390
  1414
INCOMPATIBILITY.
wenzelm@64390
  1415
wenzelm@64390
  1416
* Session HOL-Library: the prefix multiset_order has been discontinued:
wenzelm@64390
  1417
the theorems can be directly accessed. As a consequence, the lemmas
wenzelm@64390
  1418
"order_multiset" and "linorder_multiset" have been discontinued, and the
wenzelm@64390
  1419
interpretations "multiset_linorder" and "multiset_wellorder" have been
wenzelm@64390
  1420
replaced by instantiations. INCOMPATIBILITY.
wenzelm@64390
  1421
wenzelm@64390
  1422
* Session HOL-Library: some theorems about the multiset ordering have
wenzelm@64390
  1423
been renamed:
wenzelm@64390
  1424
wenzelm@64390
  1425
    le_multiset_def ~> less_eq_multiset_def
wenzelm@64390
  1426
    less_multiset_def ~> le_multiset_def
wenzelm@64390
  1427
    less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset
wenzelm@64390
  1428
    mult_less_not_refl ~> mset_le_not_refl
wenzelm@64390
  1429
    mult_less_trans ~> mset_le_trans
wenzelm@64390
  1430
    mult_less_not_sym ~> mset_le_not_sym
wenzelm@64390
  1431
    mult_less_asym ~> mset_le_asym
wenzelm@64390
  1432
    mult_less_irrefl ~> mset_le_irrefl
wenzelm@64390
  1433
    union_less_mono2{,1,2} ~> union_le_mono2{,1,2}
wenzelm@64390
  1434
wenzelm@64390
  1435
    le_multiset\<^sub>H\<^sub>O ~> less_eq_multiset\<^sub>H\<^sub>O
wenzelm@64390
  1436
    le_multiset_total ~> less_eq_multiset_total
wenzelm@64390
  1437
    less_multiset_right_total ~> subset_eq_imp_le_multiset
wenzelm@64390
  1438
    le_multiset_empty_left ~> less_eq_multiset_empty_left
wenzelm@64390
  1439
    le_multiset_empty_right ~> less_eq_multiset_empty_right
wenzelm@64390
  1440
    less_multiset_empty_right ~> le_multiset_empty_left
wenzelm@64390
  1441
    less_multiset_empty_left ~> le_multiset_empty_right
wenzelm@64390
  1442
    union_less_diff_plus ~> union_le_diff_plus
wenzelm@64390
  1443
    ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset
wenzelm@64390
  1444
    less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty
wenzelm@64390
  1445
    le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty
wenzelm@64390
  1446
INCOMPATIBILITY.
wenzelm@64390
  1447
wenzelm@64390
  1448
* Session HOL-Library: the lemma mset_map has now the attribute [simp].
wenzelm@64390
  1449
INCOMPATIBILITY.
wenzelm@64390
  1450
wenzelm@64390
  1451
* Session HOL-Library: some theorems about multisets have been removed.
wenzelm@64390
  1452
INCOMPATIBILITY, use the following replacements:
wenzelm@64390
  1453
wenzelm@64390
  1454
    le_multiset_plus_plus_left_iff ~> add_less_cancel_right
wenzelm@64390
  1455
    less_multiset_plus_plus_left_iff ~> add_less_cancel_right
wenzelm@64390
  1456
    le_multiset_plus_plus_right_iff ~> add_less_cancel_left
wenzelm@64390
  1457
    less_multiset_plus_plus_right_iff ~> add_less_cancel_left
wenzelm@64390
  1458
    add_eq_self_empty_iff ~> add_cancel_left_right
wenzelm@64390
  1459
    mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1460
    mset_less_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1461
    mset_le_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1462
    empty_inter ~> subset_mset.inf_bot_left
wenzelm@64390
  1463
    inter_empty ~> subset_mset.inf_bot_right
wenzelm@64390
  1464
    empty_sup ~> subset_mset.sup_bot_left
wenzelm@64390
  1465
    sup_empty ~> subset_mset.sup_bot_right
wenzelm@64390
  1466
    bdd_below_multiset ~> subset_mset.bdd_above_bot
wenzelm@64390
  1467
    subset_eq_empty ~> subset_mset.le_zero_eq
wenzelm@64390
  1468
    le_empty ~> subset_mset.le_zero_eq
wenzelm@64390
  1469
    mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
wenzelm@64390
  1470
    mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
wenzelm@64390
  1471
wenzelm@64390
  1472
* Session HOL-Library: some typeclass constraints about multisets have
wenzelm@64390
  1473
been reduced from ordered or linordered to preorder. Multisets have the
wenzelm@64390
  1474
additional typeclasses order_bot, no_top,
wenzelm@64390
  1475
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,
wenzelm@64390
  1476
linordered_cancel_ab_semigroup_add, and
wenzelm@64390
  1477
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.
wenzelm@64390
  1478
wenzelm@64390
  1479
* Session HOL-Library: there are some new simplification rules about
wenzelm@64390
  1480
multisets, the multiset ordering, and the subset ordering on multisets.
wenzelm@64390
  1481
INCOMPATIBILITY.
wenzelm@64390
  1482
wenzelm@64390
  1483
* Session HOL-Library: the subset ordering on multisets has now the
wenzelm@64390
  1484
interpretations ordered_ab_semigroup_monoid_add_imp_le and
wenzelm@64390
  1485
bounded_lattice_bot. INCOMPATIBILITY.
wenzelm@64390
  1486
wenzelm@64390
  1487
* Session HOL-Library, theory Multiset: single has been removed in favor
wenzelm@64390
  1488
of add_mset that roughly corresponds to Set.insert. Some theorems have
wenzelm@64390
  1489
removed or changed:
wenzelm@64390
  1490
wenzelm@64390
  1491
  single_not_empty ~> add_mset_not_empty or empty_not_add_mset
wenzelm@64390
  1492
  fold_mset_insert ~> fold_mset_add_mset
wenzelm@64390
  1493
  image_mset_insert ~> image_mset_add_mset
wenzelm@64390
  1494
  union_single_eq_diff
wenzelm@64390
  1495
  multi_self_add_other_not_self
wenzelm@64390
  1496
  diff_single_eq_union
wenzelm@64390
  1497
INCOMPATIBILITY.
wenzelm@64390
  1498
wenzelm@64390
  1499
* Session HOL-Library, theory Multiset: some theorems have been changed
wenzelm@64390
  1500
to use add_mset instead of single:
wenzelm@64390
  1501
wenzelm@64390
  1502
  mset_add
wenzelm@64390
  1503
  multi_self_add_other_not_self
wenzelm@64390
  1504
  diff_single_eq_union
wenzelm@64390
  1505
  union_single_eq_diff
wenzelm@64390
  1506
  union_single_eq_member
wenzelm@64390
  1507
  add_eq_conv_diff
wenzelm@64390
  1508
  insert_noteq_member
wenzelm@64390
  1509
  add_eq_conv_ex
wenzelm@64390
  1510
  multi_member_split
wenzelm@64390
  1511
  multiset_add_sub_el_shuffle
wenzelm@64390
  1512
  mset_subset_eq_insertD
wenzelm@64390
  1513
  mset_subset_insertD
wenzelm@64390
  1514
  insert_subset_eq_iff
wenzelm@64390
  1515
  insert_union_subset_iff
wenzelm@64390
  1516
  multi_psub_of_add_self
wenzelm@64390
  1517
  inter_add_left1
wenzelm@64390
  1518
  inter_add_left2
wenzelm@64390
  1519
  inter_add_right1
wenzelm@64390
  1520
  inter_add_right2
wenzelm@64390
  1521
  sup_union_left1
wenzelm@64390
  1522
  sup_union_left2
wenzelm@64390
  1523
  sup_union_right1
wenzelm@64390
  1524
  sup_union_right2
wenzelm@64390
  1525
  size_eq_Suc_imp_eq_union
wenzelm@64390
  1526
  multi_nonempty_split
wenzelm@64390
  1527
  mset_insort
wenzelm@64390
  1528
  mset_update
wenzelm@64390
  1529
  mult1I
wenzelm@64390
  1530
  less_add
wenzelm@64390
  1531
  mset_zip_take_Cons_drop_twice
wenzelm@64390
  1532
  rel_mset_Zero
wenzelm@64390
  1533
  msed_map_invL
wenzelm@64390
  1534
  msed_map_invR
wenzelm@64390
  1535
  msed_rel_invL
wenzelm@64390
  1536
  msed_rel_invR
wenzelm@64390
  1537
  le_multiset_right_total
wenzelm@64390
  1538
  multiset_induct
wenzelm@64390
  1539
  multiset_induct2_size
wenzelm@64390
  1540
  multiset_induct2
wenzelm@64390
  1541
INCOMPATIBILITY.
wenzelm@64390
  1542
wenzelm@64390
  1543
* Session HOL-Library, theory Multiset: the definitions of some
wenzelm@64390
  1544
constants have changed to use add_mset instead of adding a single
wenzelm@64390
  1545
element:
wenzelm@64390
  1546
wenzelm@64390
  1547
  image_mset
wenzelm@64390
  1548
  mset
wenzelm@64390
  1549
  replicate_mset
wenzelm@64390
  1550
  mult1
wenzelm@64390
  1551
  pred_mset
wenzelm@64390
  1552
  rel_mset'
wenzelm@64390
  1553
  mset_insort
wenzelm@64390
  1554
wenzelm@64390
  1555
INCOMPATIBILITY.
wenzelm@64390
  1556
wenzelm@64390
  1557
* Session HOL-Library, theory Multiset: due to the above changes, the
wenzelm@64390
  1558
attributes of some multiset theorems have been changed:
wenzelm@64390
  1559
wenzelm@64390
  1560
  insert_DiffM  [] ~> [simp]
wenzelm@64390
  1561
  insert_DiffM2 [simp] ~> []
wenzelm@64390
  1562
  diff_add_mset_swap [simp]
wenzelm@64390
  1563
  fold_mset_add_mset [simp]
wenzelm@64390
  1564
  diff_diff_add [simp] (for multisets only)
wenzelm@64390
  1565
  diff_cancel [simp] ~> []
wenzelm@64390
  1566
  count_single [simp] ~> []
wenzelm@64390
  1567
  set_mset_single [simp] ~> []
wenzelm@64390
  1568
  size_multiset_single [simp] ~> []
wenzelm@64390
  1569
  size_single [simp] ~> []
wenzelm@64390
  1570
  image_mset_single [simp] ~> []
wenzelm@64390
  1571
  mset_subset_eq_mono_add_right_cancel [simp] ~> []
wenzelm@64390
  1572
  mset_subset_eq_mono_add_left_cancel [simp] ~> []
wenzelm@64390
  1573
  fold_mset_single [simp] ~> []
wenzelm@64390
  1574
  subset_eq_empty [simp] ~> []
wenzelm@64390
  1575
  empty_sup [simp] ~> []
wenzelm@64390
  1576
  sup_empty [simp] ~> []
wenzelm@64390
  1577
  inter_empty [simp] ~> []
wenzelm@64390
  1578
  empty_inter [simp] ~> []
wenzelm@64390
  1579
INCOMPATIBILITY.
wenzelm@64390
  1580
wenzelm@64391
  1581
* Session HOL-Library, theory Multiset: the order of the variables in
wenzelm@64390
  1582
the second cases of multiset_induct, multiset_induct2_size,
wenzelm@64390
  1583
multiset_induct2 has been changed (e.g. Add A a ~> Add a A).
wenzelm@64390
  1584
INCOMPATIBILITY.
wenzelm@64390
  1585
wenzelm@64390
  1586
* Session HOL-Library, theory Multiset: there is now a simplification
wenzelm@64390
  1587
procedure on multisets. It mimics the behavior of the procedure on
wenzelm@64390
  1588
natural numbers. INCOMPATIBILITY.
wenzelm@64390
  1589
wenzelm@64390
  1590
* Session HOL-Library, theory Multiset: renamed sums and products of
wenzelm@64390
  1591
multisets:
wenzelm@64390
  1592
wenzelm@64390
  1593
  msetsum ~> sum_mset
wenzelm@64390
  1594
  msetprod ~> prod_mset
wenzelm@64390
  1595
wenzelm@64390
  1596
* Session HOL-Library, theory Multiset: the notation for intersection
wenzelm@64390
  1597
and union of multisets have been changed:
wenzelm@64390
  1598
wenzelm@64390
  1599
  #\<inter> ~> \<inter>#
wenzelm@64390
  1600
  #\<union> ~> \<union>#
wenzelm@64390
  1601
wenzelm@64390
  1602
INCOMPATIBILITY.
wenzelm@64390
  1603
wenzelm@64390
  1604
* Session HOL-Library, theory Multiset: the lemma
wenzelm@64390
  1605
one_step_implies_mult_aux on multisets has been removed, use
wenzelm@64390
  1606
one_step_implies_mult instead. INCOMPATIBILITY.
wenzelm@64390
  1607
wenzelm@64390
  1608
* Session HOL-Library: theory Complete_Partial_Order2 provides reasoning
wenzelm@64390
  1609
support for monotonicity and continuity in chain-complete partial orders
wenzelm@64390
  1610
and about admissibility conditions for fixpoint inductions.
wenzelm@64390
  1611
haftmann@64523
  1612
* Session HOL-Library: theory Library/Polynomial contains also
haftmann@64523
  1613
derivation of polynomials (formerly in Library/Poly_Deriv) but not
haftmann@64523
  1614
gcd/lcm on polynomials over fields. This has been moved to a separate
haftmann@64523
  1615
theory Library/Polynomial_GCD_euclidean.thy, to pave way for a possible
haftmann@64523
  1616
future different type class instantiation for polynomials over factorial
haftmann@64523
  1617
rings. INCOMPATIBILITY.
wenzelm@64390
  1618
wenzelm@64390
  1619
* Session HOL-Library: theory Sublist provides function "prefixes" with
wenzelm@64390
  1620
the following renaming
wenzelm@64390
  1621
wenzelm@64390
  1622
  prefixeq -> prefix
wenzelm@64390
  1623
  prefix -> strict_prefix
wenzelm@64390
  1624
  suffixeq -> suffix
wenzelm@64390
  1625
  suffix -> strict_suffix
wenzelm@64390
  1626
wenzelm@64390
  1627
Added theory of longest common prefixes.
blanchet@64389
  1628
wenzelm@64391
  1629
* Session HOL-Number_Theory: algebraic foundation for primes:
wenzelm@64391
  1630
Generalisation of predicate "prime" and introduction of predicates
wenzelm@64391
  1631
"prime_elem", "irreducible", a "prime_factorization" function, and the
wenzelm@64391
  1632
"factorial_ring" typeclass with instance proofs for nat, int, poly. Some
wenzelm@64391
  1633
theorems now have different names, most notably "prime_def" is now
wenzelm@64391
  1634
"prime_nat_iff". INCOMPATIBILITY.
wenzelm@64391
  1635
wenzelm@64391
  1636
* Session Old_Number_Theory has been removed, after porting remaining
wenzelm@64391
  1637
theories.
wenzelm@64391
  1638
wenzelm@64551
  1639
* Session HOL-Types_To_Sets provides an experimental extension of
wenzelm@64551
  1640
Higher-Order Logic to allow translation of types to sets.
wenzelm@64551
  1641
wenzelm@63198
  1642
wenzelm@62498
  1643
*** ML ***
wenzelm@62498
  1644
wenzelm@63227
  1645
* Integer.gcd and Integer.lcm use efficient operations from the Poly/ML
wenzelm@63228
  1646
library (notably for big integers). Subtle change of semantics:
wenzelm@63228
  1647
Integer.gcd and Integer.lcm both normalize the sign, results are never
wenzelm@63228
  1648
negative. This coincides with the definitions in HOL/GCD.thy.
wenzelm@63228
  1649
INCOMPATIBILITY.
wenzelm@63227
  1650
wenzelm@63212
  1651
* Structure Rat for rational numbers is now an integral part of
wenzelm@63215
  1652
Isabelle/ML, with special notation @int/nat or @int for numerals (an
wenzelm@63215
  1653
abbreviation for antiquotation @{Pure.rat argument}) and ML pretty
wenzelm@63212
  1654
printing. Standard operations on type Rat.rat are provided via ad-hoc
wenzelm@63215
  1655
overloading of + - * / < <= > >= ~ abs. INCOMPATIBILITY, need to
wenzelm@63212
  1656
use + instead of +/ etc. Moreover, exception Rat.DIVZERO has been
wenzelm@63212
  1657
superseded by General.Div.
wenzelm@63198
  1658
wenzelm@64390
  1659
* ML antiquotation @{path} is superseded by @{file}, which ensures that
wenzelm@64390
  1660
the argument is a plain file. Minor INCOMPATIBILITY.
wenzelm@64390
  1661
wenzelm@64390
  1662
* Antiquotation @{make_string} is available during Pure bootstrap --
wenzelm@64390
  1663
with approximative output quality.
wenzelm@64390
  1664
wenzelm@64390
  1665
* Low-level ML system structures (like PolyML and RunCall) are no longer
wenzelm@64390
  1666
exposed to Isabelle/ML user-space. Potential INCOMPATIBILITY.
wenzelm@64390
  1667
wenzelm@62861
  1668
* The ML function "ML" provides easy access to run-time compilation.
wenzelm@62861
  1669
This is particularly useful for conditional compilation, without
wenzelm@62861
  1670
requiring separate files.
wenzelm@62861
  1671
wenzelm@62498
  1672
* Option ML_exception_debugger controls detailed exception trace via the
wenzelm@62498
  1673
Poly/ML debugger. Relevant ML modules need to be compiled beforehand
wenzelm@62498
  1674
with ML_file_debug, or with ML_file and option ML_debugger enabled. Note
wenzelm@62498
  1675
debugger information requires consirable time and space: main
wenzelm@62498
  1676
Isabelle/HOL with full debugger support may need ML_system_64.
wenzelm@62498
  1677
wenzelm@62514
  1678
* Local_Theory.restore has been renamed to Local_Theory.reset to
wenzelm@62514
  1679
emphasize its disruptive impact on the cumulative context, notably the
wenzelm@62514
  1680
scope of 'private' or 'qualified' names. Note that Local_Theory.reset is
wenzelm@62514
  1681
only appropriate when targets are managed, e.g. starting from a global
wenzelm@62514
  1682
theory and returning to it. Regular definitional packages should use
wenzelm@62514
  1683
balanced blocks of Local_Theory.open_target versus
wenzelm@62514
  1684
Local_Theory.close_target instead. Rare INCOMPATIBILITY.
wenzelm@62514
  1685
wenzelm@62519
  1686
* Structure TimeLimit (originally from the SML/NJ library) has been
wenzelm@62519
  1687
replaced by structure Timeout, with slightly different signature.
wenzelm@62519
  1688
INCOMPATIBILITY.
wenzelm@62519
  1689
wenzelm@62551
  1690
* Discontinued cd and pwd operations, which are not well-defined in a
wenzelm@62551
  1691
multi-threaded environment. Note that files are usually located
wenzelm@62551
  1692
relatively to the master directory of a theory (see also
wenzelm@62551
  1693
File.full_path). Potential INCOMPATIBILITY.
wenzelm@62551
  1694
wenzelm@63352
  1695
* Binding.empty_atts supersedes Thm.empty_binding and
wenzelm@63352
  1696
Attrib.empty_binding. Minor INCOMPATIBILITY.
wenzelm@63352
  1697
wenzelm@62498
  1698
wenzelm@62354
  1699
*** System ***
wenzelm@62354
  1700
wenzelm@64390
  1701
* SML/NJ and old versions of Poly/ML are no longer supported.
wenzelm@64390
  1702
wenzelm@64390
  1703
* Poly/ML heaps now follow the hierarchy of sessions, and thus require
wenzelm@64390
  1704
much less disk space.
wenzelm@63226
  1705
wenzelm@62591
  1706
* The Isabelle ML process is now managed directly by Isabelle/Scala, and
wenzelm@62591
  1707
shell scripts merely provide optional command-line access. In
wenzelm@62591
  1708
particular:
wenzelm@62591
  1709
wenzelm@62591
  1710
  . Scala module ML_Process to connect to the raw ML process,
wenzelm@62591
  1711
    with interaction via stdin/stdout/stderr or in batch mode;
wenzelm@62591
  1712
  . command-line tool "isabelle console" as interactive wrapper;
wenzelm@62591
  1713
  . command-line tool "isabelle process" as batch mode wrapper.
wenzelm@62588
  1714
wenzelm@62588
  1715
* The executable "isabelle_process" has been discontinued. Tools and
wenzelm@62588
  1716
prover front-ends should use ML_Process or Isabelle_Process in
wenzelm@62591
  1717
Isabelle/Scala. INCOMPATIBILITY.
wenzelm@62588
  1718
wenzelm@62588
  1719
* New command-line tool "isabelle process" supports ML evaluation of
wenzelm@62588
  1720
literal expressions (option -e) or files (option -f) in the context of a
wenzelm@62588
  1721
given heap image. Errors lead to premature exit of the ML process with
wenzelm@62588
  1722
return code 1.
wenzelm@62588
  1723
wenzelm@64390
  1724
* The command-line tool "isabelle build" supports option -N for cyclic
wenzelm@64390
  1725
shuffling of NUMA CPU nodes. This may help performance tuning on Linux
wenzelm@64390
  1726
servers with separate CPU/memory modules.
wenzelm@64390
  1727
wenzelm@64390
  1728
* System option "threads" (for the size of the Isabelle/ML thread farm)
wenzelm@64390
  1729
is also passed to the underlying ML runtime system as --gcthreads,
wenzelm@64274
  1730
unless there is already a default provided via ML_OPTIONS settings.
wenzelm@64274
  1731
wenzelm@63827
  1732
* System option "checkpoint" helps to fine-tune the global heap space
wenzelm@63827
  1733
management of isabelle build. This is relevant for big sessions that may
wenzelm@63827
  1734
exhaust the small 32-bit address space of the ML process (which is used
wenzelm@63827
  1735
by default).
wenzelm@63827
  1736
wenzelm@64308
  1737
* System option "profiling" specifies the mode for global ML profiling
wenzelm@64342
  1738
in "isabelle build". Possible values are "time", "allocations". The
wenzelm@64342
  1739
command-line tool "isabelle profiling_report" helps to digest the
wenzelm@64342
  1740
resulting log files.
wenzelm@64308
  1741
wenzelm@63986
  1742
* System option "ML_process_policy" specifies an optional command prefix
wenzelm@63986
  1743
for the underlying ML process, e.g. to control CPU affinity on
wenzelm@63987
  1744
multiprocessor systems. The "isabelle jedit" tool allows to override the
wenzelm@63987
  1745
implicit default via option -p.
wenzelm@63986
  1746
wenzelm@64390
  1747
* Command-line tool "isabelle console" provides option -r to help to
wenzelm@64390
  1748
bootstrapping Isabelle/Pure interactively.
wenzelm@64390
  1749
wenzelm@64390
  1750
* Command-line tool "isabelle yxml" has been discontinued.
wenzelm@64390
  1751
INCOMPATIBILITY, use operations from the modules "XML" and "YXML" in
wenzelm@64390
  1752
Isabelle/ML or Isabelle/Scala.
wenzelm@64390
  1753
wenzelm@64390
  1754
* Many Isabelle tools that require a Java runtime system refer to the
wenzelm@64390
  1755
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,
wenzelm@64390
  1756
depending on the underlying platform. The settings for "isabelle build"
wenzelm@64390
  1757
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been
wenzelm@64390
  1758
discontinued. Potential INCOMPATIBILITY.
wenzelm@64390
  1759
wenzelm@64390
  1760
* The Isabelle system environment always ensures that the main
wenzelm@64390
  1761
executables are found within the shell search $PATH: "isabelle" and
wenzelm@64390
  1762
"isabelle_scala_script".
wenzelm@64390
  1763
wenzelm@64390
  1764
* Isabelle tools may consist of .scala files: the Scala compiler is
wenzelm@64390
  1765
invoked on the spot. The source needs to define some object that extends
wenzelm@64390
  1766
Isabelle_Tool.Body.
wenzelm@64390
  1767
wenzelm@64390
  1768
* File.bash_string, File.bash_path etc. represent Isabelle/ML and
wenzelm@64390
  1769
Isabelle/Scala strings authentically within GNU bash. This is useful to
wenzelm@64390
  1770
produce robust shell scripts under program control, without worrying
wenzelm@64390
  1771
about spaces or special characters. Note that user output works via
wenzelm@64390
  1772
Path.print (ML) or Path.toString (Scala). INCOMPATIBILITY, the old (and
wenzelm@64390
  1773
less versatile) operations File.shell_quote, File.shell_path etc. have
wenzelm@64390
  1774
been discontinued.
wenzelm@64390
  1775
wenzelm@63995
  1776
* The isabelle_java executable allows to run a Java process within the
wenzelm@63995
  1777
name space of Java and Scala components that are bundled with Isabelle,
wenzelm@63995
  1778
but without the Isabelle settings environment.
wenzelm@63995
  1779
wenzelm@64390
  1780
* Isabelle/Scala: the SSH module supports ssh and sftp connections, for
wenzelm@64390
  1781
remote command-execution and file-system access. This resembles
wenzelm@64390
  1782
operations from module File and Isabelle_System to some extent. Note
wenzelm@64390
  1783
that Path specifications need to be resolved remotely via
wenzelm@64390
  1784
ssh.remote_path instead of File.standard_path: the implicit process
wenzelm@64390
  1785
environment is different, Isabelle settings are not available remotely.
wenzelm@64390
  1786
wenzelm@64390
  1787
* Isabelle/Scala: the Mercurial module supports repositories via the
wenzelm@64390
  1788
regular hg command-line interface. The repositroy clone and working
wenzelm@64390
  1789
directory may reside on a local or remote file-system (via ssh
wenzelm@64390
  1790
connection).
wenzelm@64265
  1791
wenzelm@62354
  1792
wenzelm@62354
  1793
wenzelm@62031
  1794
New in Isabelle2016 (February 2016)
wenzelm@62016
  1795
-----------------------------------
wenzelm@60138
  1796
wenzelm@61337
  1797
*** General ***
wenzelm@61337
  1798
wenzelm@62168
  1799
* Eisbach is now based on Pure instead of HOL. Objects-logics may import
wenzelm@62168
  1800
either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or
wenzelm@62168
  1801
~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that
wenzelm@62168
  1802
the HOL-Eisbach session located in ~~/src/HOL/Eisbach/ contains further
wenzelm@62168
  1803
examples that do require HOL.
wenzelm@62168
  1804
wenzelm@62157
  1805
* Better resource usage on all platforms (Linux, Windows, Mac OS X) for
wenzelm@62157
  1806
both Isabelle/ML and Isabelle/Scala.  Slightly reduced heap space usage.
wenzelm@62157
  1807
wenzelm@62017
  1808
* Former "xsymbols" syntax with Isabelle symbols is used by default,
wenzelm@62017
  1809
without any special print mode. Important ASCII replacement syntax
wenzelm@62017
  1810
remains available under print mode "ASCII", but less important syntax
wenzelm@62017
  1811
has been removed (see below).
wenzelm@62017
  1812
wenzelm@62109
  1813
* Support for more arrow symbols, with rendering in LaTeX and Isabelle
wenzelm@62109
  1814
fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>.
wenzelm@62017
  1815
wenzelm@62108
  1816
* Special notation \<struct> for the first implicit 'structure' in the
wenzelm@62108
  1817
context has been discontinued. Rare INCOMPATIBILITY, use explicit
wenzelm@62108
  1818
structure name instead, notably in indexed notation with block-subscript
wenzelm@62108
  1819
(e.g. \<odot>\<^bsub>A\<^esub>).
wenzelm@62108
  1820
wenzelm@62108
  1821
* The glyph for \<diamond> in the IsabelleText font now corresponds better to its
wenzelm@62108
  1822
counterpart \<box> as quantifier-like symbol. A small diamond is available as
wenzelm@62108
  1823
\<diamondop>; the old symbol \<struct> loses this rendering and any special
wenzelm@62108
  1824
meaning.
wenzelm@62108
  1825
wenzelm@62017
  1826
* Syntax for formal comments "-- text" now also supports the symbolic
wenzelm@62017
  1827
form "\<comment> text". Command-line tool "isabelle update_cartouches -c" helps
wenzelm@62017
  1828
to update old sources.
wenzelm@62017
  1829
wenzelm@61337
  1830
* Toplevel theorem statements have been simplified as follows:
wenzelm@61337
  1831
wenzelm@61337
  1832
  theorems             ~>  lemmas
wenzelm@61337
  1833
  schematic_lemma      ~>  schematic_goal
wenzelm@61337
  1834
  schematic_theorem    ~>  schematic_goal
wenzelm@61337
  1835
  schematic_corollary  ~>  schematic_goal
wenzelm@61337
  1836
wenzelm@61337
  1837
Command-line tool "isabelle update_theorems" updates theory sources
wenzelm@61337
  1838
accordingly.
wenzelm@61337
  1839
wenzelm@61338
  1840
* Toplevel theorem statement 'proposition' is another alias for
wenzelm@61338
  1841
'theorem'.
wenzelm@61338
  1842
wenzelm@62169
  1843
* The old 'defs' command has been removed (legacy since Isabelle2014).
wenzelm@62169
  1844
INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or
wenzelm@62169
  1845
deferred definitions require a surrounding 'overloading' block.
wenzelm@62169
  1846
wenzelm@61337
  1847
wenzelm@60610
  1848
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@60610
  1849
wenzelm@60986
  1850
* IDE support for the source-level debugger of Poly/ML, to work with
wenzelm@62253
  1851
Isabelle/ML and official Standard ML. Option "ML_debugger" and commands
wenzelm@62253
  1852
'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',
wenzelm@62253
  1853
'SML_file_no_debug' control compilation of sources with or without
wenzelm@62253
  1854
debugging information. The Debugger panel allows to set breakpoints (via
wenzelm@62253
  1855
context menu), step through stopped threads, evaluate local ML
wenzelm@62253
  1856
expressions etc. At least one Debugger view needs to be active to have
wenzelm@62253
  1857
any effect on the running ML program.
wenzelm@60984
  1858
wenzelm@61803
  1859
* The State panel manages explicit proof state output, with dynamic
wenzelm@61803
  1860
auto-update according to cursor movement. Alternatively, the jEdit
wenzelm@61803
  1861
action "isabelle.update-state" (shortcut S+ENTER) triggers manual
wenzelm@61803
  1862
update.
wenzelm@61729
  1863
wenzelm@61729
  1864
* The Output panel no longer shows proof state output by default, to
wenzelm@61729
  1865
avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or
wenzelm@61729
  1866
enable option "editor_output_state".
wenzelm@61215
  1867
wenzelm@61803
  1868
* The text overview column (status of errors, warnings etc.) is updated
wenzelm@61803
  1869
asynchronously, leading to much better editor reactivity. Moreover, the
wenzelm@61803
  1870
full document node content is taken into account. The width of the
wenzelm@61803
  1871
column is scaled according to the main text area font, for improved
wenzelm@61803
  1872
visibility.
wenzelm@61803
  1873
wenzelm@61803
  1874
* The main text area no longer changes its color hue in outdated
wenzelm@61803
  1875
situations. The text overview column takes over the role to indicate
wenzelm@61803
  1876
unfinished edits in the PIDE pipeline. This avoids flashing text display
wenzelm@61803
  1877
due to ad-hoc updates by auxiliary GUI components, such as the State
wenzelm@61803
  1878
panel.
wenzelm@61803
  1879
wenzelm@62254
  1880
* Slightly improved scheduling for urgent print tasks (e.g. command
wenzelm@62254
  1881
state output, interactive queries) wrt. long-running background tasks.
wenzelm@62017
  1882
wenzelm@62017
  1883
* Completion of symbols via prefix of \<name> or \<^name> or \name is
wenzelm@62017
  1884
always possible, independently of the language context. It is never
wenzelm@62017
  1885
implicit: a popup will show up unconditionally.
wenzelm@62017
  1886
wenzelm@62017
  1887
* Additional abbreviations for syntactic completion may be specified in
wenzelm@62017
  1888
$ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with
wenzelm@62017
  1889
support for simple templates using ASCII 007 (bell) as placeholder.
wenzelm@62017
  1890
wenzelm@62234
  1891
* Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for
wenzelm@62234
  1892
completion like "+o", "*o", ".o" etc. -- due to conflicts with other
wenzelm@62234
  1893
ASCII syntax. INCOMPATIBILITY, use plain backslash-completion or define
wenzelm@62234
  1894
suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.
wenzelm@62234
  1895
wenzelm@61483
  1896
* Action "isabelle-emph" (with keyboard shortcut C+e LEFT) controls
wenzelm@61483
  1897
emphasized text style; the effect is visible in document output, not in
wenzelm@61483
  1898
the editor.
wenzelm@61483
  1899
wenzelm@61483
  1900
* Action "isabelle-reset" now uses keyboard shortcut C+e BACK_SPACE,
wenzelm@61483
  1901
instead of former C+e LEFT.
wenzelm@61483
  1902
wenzelm@61512
  1903
* The command-line tool "isabelle jedit" and the isabelle.Main
wenzelm@62027
  1904
application wrapper treat the default $USER_HOME/Scratch.thy more
wenzelm@61512
  1905
uniformly, and allow the dummy file argument ":" to open an empty buffer
wenzelm@61512
  1906
instead.
wenzelm@61512
  1907
wenzelm@62017
  1908
* New command-line tool "isabelle jedit_client" allows to connect to an
wenzelm@62017
  1909
already running Isabelle/jEdit process. This achieves the effect of
wenzelm@62017
  1910
single-instance applications seen on common GUI desktops.
wenzelm@62017
  1911
wenzelm@61529
  1912
* The default look-and-feel for Linux is the traditional "Metal", which
wenzelm@61529
  1913
works better with GUI scaling for very high-resolution displays (e.g.
wenzelm@61529
  1914
4K). Moreover, it is generally more robust than "Nimbus".
wenzelm@61529
  1915
wenzelm@62163
  1916
* Update to jedit-5.3.0, with improved GUI scaling and support of
wenzelm@62163
  1917
high-resolution displays (e.g. 4K).
wenzelm@62163
  1918
wenzelm@62034
  1919
* The main Isabelle executable is managed as single-instance Desktop
wenzelm@62034
  1920
application uniformly on all platforms: Linux, Windows, Mac OS X.
wenzelm@62034
  1921
wenzelm@60610
  1922
wenzelm@61405
  1923
*** Document preparation ***
wenzelm@61405
  1924
wenzelm@62017
  1925
* Commands 'paragraph' and 'subparagraph' provide additional section
wenzelm@62017
  1926
headings. Thus there are 6 levels of standard headings, as in HTML.
wenzelm@62017
  1927
wenzelm@62017
  1928
* Command 'text_raw' has been clarified: input text is processed as in
wenzelm@62017
  1929
'text' (with antiquotations and control symbols). The key difference is
wenzelm@62017
  1930
the lack of the surrounding isabelle markup environment in output.
wenzelm@62017
  1931
wenzelm@62017
  1932
* Text is structured in paragraphs and nested lists, using notation that
wenzelm@62017
  1933
is similar to Markdown. The control symbols for list items are as
wenzelm@62017
  1934
follows:
wenzelm@62017
  1935
wenzelm@62017
  1936
  \<^item>  itemize
wenzelm@62017
  1937
  \<^enum>  enumerate
wenzelm@62017
  1938
  \<^descr>  description
wenzelm@62017
  1939
wenzelm@61491
  1940
* There is a new short form for antiquotations with a single argument
wenzelm@61491
  1941
that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and
wenzelm@61595
  1942
\<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}.
wenzelm@61595
  1943
\<^name> without following cartouche is equivalent to @{name}. The
wenzelm@61501
  1944
standard Isabelle fonts provide glyphs to render important control
wenzelm@61501
  1945
symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>".
wenzelm@61491
  1946
wenzelm@61595
  1947
* Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with
wenzelm@61595
  1948
corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using
wenzelm@61595
  1949
standard LaTeX macros of the same names.
wenzelm@61595
  1950
wenzelm@61491
  1951
* Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}.
wenzelm@61491
  1952
Consequently, \<open>...\<close> without any decoration prints literal quasi-formal
wenzelm@61492
  1953
text. Command-line tool "isabelle update_cartouches -t" helps to update
wenzelm@61492
  1954
old sources, by approximative patching of the content of string and
wenzelm@61492
  1955
cartouche tokens seen in theory sources.
wenzelm@61491
  1956
wenzelm@61491
  1957
* The @{text} antiquotation now ignores the antiquotation option
wenzelm@61491
  1958
"source". The given text content is output unconditionally, without any
wenzelm@61491
  1959
surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the
wenzelm@61494
  1960
argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial
wenzelm@61494
  1961
or terminal spaces are ignored.
wenzelm@61491
  1962
wenzelm@62017
  1963
* Antiquotations @{emph} and @{bold} output LaTeX source recursively,
wenzelm@62017
  1964
adding appropriate text style markup. These may be used in the short
wenzelm@62017
  1965
form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>.
wenzelm@62017
  1966
wenzelm@62017
  1967
* Document antiquotation @{footnote} outputs LaTeX source recursively,
wenzelm@62017
  1968
marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>.
wenzelm@62017
  1969
wenzelm@62017
  1970
* Antiquotation @{verbatim [display]} supports option "indent".
wenzelm@62017
  1971
wenzelm@62017
  1972
* Antiquotation @{theory_text} prints uninterpreted theory source text
wenzelm@62231
  1973
(Isar outer syntax with command keywords etc.). This may be used in the
wenzelm@62231
  1974
short form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent".
wenzelm@62017
  1975
wenzelm@62017
  1976
* Antiquotation @{doc ENTRY} provides a reference to the given
wenzelm@62017
  1977
documentation, with a hyperlink in the Prover IDE.
wenzelm@62017
  1978
wenzelm@62017
  1979
* Antiquotations @{command}, @{method}, @{attribute} print checked
wenzelm@62017
  1980
entities of the Isar language.
wenzelm@62017
  1981
wenzelm@61471
  1982
* HTML presentation uses the standard IsabelleText font and Unicode
wenzelm@61471
  1983
rendering of Isabelle symbols like Isabelle/Scala/jEdit.  The former
wenzelm@61488
  1984
print mode "HTML" loses its special meaning.
wenzelm@61471
  1985
wenzelm@61405
  1986
wenzelm@60406
  1987
*** Isar ***
wenzelm@60406
  1988
wenzelm@62205
  1989
* Local goals ('have', 'show', 'hence', 'thus') allow structured rule
wenzelm@62205
  1990
statements like fixes/assumes/shows in theorem specifications, but the
wenzelm@62205
  1991
notation is postfix with keywords 'if' (or 'when') and 'for'. For
wenzelm@60555
  1992
example:
wenzelm@60414
  1993
wenzelm@60414
  1994
  have result: "C x y"
wenzelm@60414
  1995
    if "A x" and "B y"
wenzelm@60414
  1996
    for x :: 'a and y :: 'a
wenzelm@60414
  1997
    <proof>
wenzelm@60414
  1998
wenzelm@60449
  1999
The local assumptions are bound to the name "that". The result is
wenzelm@60449
  2000
exported from context of the statement as usual. The above roughly
wenzelm@60414
  2001
corresponds to a raw proof block like this:
wenzelm@60414
  2002
wenzelm@60414
  2003
  {
wenzelm@60414
  2004
    fix x :: 'a and y :: 'a
wenzelm@60449
  2005
    assume that: "A x" "B y"
wenzelm@60414
  2006
    have "C x y" <proof>
wenzelm@60414
  2007
  }
wenzelm@60414
  2008
  note result = this
wenzelm@60406
  2009
wenzelm@60555
  2010
The keyword 'when' may be used instead of 'if', to indicate 'presume'
wenzelm@60555
  2011
instead of 'assume' above.
wenzelm@60555
  2012
wenzelm@61733
  2013
* Assumptions ('assume', 'presume') allow structured rule statements
wenzelm@61733
  2014
using 'if' and 'for', similar to 'have' etc. above. For example:
wenzelm@61658
  2015
wenzelm@61658
  2016
  assume result: "C x y"
wenzelm@61658
  2017
    if "A x" and "B y"
wenzelm@61658
  2018
    for x :: 'a and y :: 'a
wenzelm@61658
  2019
wenzelm@61658
  2020
This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general
wenzelm@61658
  2021
result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y".
wenzelm@61658
  2022
wenzelm@61658
  2023
Vacuous quantification in assumptions is omitted, i.e. a for-context
wenzelm@61658
  2024
only effects propositions according to actual use of variables. For
wenzelm@61658
  2025
example:
wenzelm@61658
  2026
wenzelm@61658
  2027
  assume "A x" and "B y" for x and y
wenzelm@61658
  2028
wenzelm@61658
  2029
is equivalent to:
wenzelm@61658
  2030
wenzelm@61658
  2031
  assume "\<And>x. A x" and "\<And>y. B y"
wenzelm@61658
  2032
wenzelm@60595
  2033
* The meaning of 'show' with Pure rule statements has changed: premises
wenzelm@60595
  2034
are treated in the sense of 'assume', instead of 'presume'. This means,
wenzelm@62205
  2035
a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as
wenzelm@62205
  2036
follows:
wenzelm@60595
  2037
wenzelm@60595
  2038
  show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60595
  2039
wenzelm@60595
  2040
or:
wenzelm@60595
  2041
wenzelm@60595
  2042
  show "C x" if "A x" "B x" for x
wenzelm@60595
  2043
wenzelm@60595
  2044
Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:
wenzelm@60595
  2045
wenzelm@60595
  2046
  show "C x" when "A x" "B x" for x
wenzelm@60595
  2047
wenzelm@60459
  2048
* New command 'consider' states rules for generalized elimination and
wenzelm@60459
  2049
case splitting. This is like a toplevel statement "theorem obtains" used
wenzelm@60459
  2050
within a proof body; or like a multi-branch 'obtain' without activation
wenzelm@60459
  2051
of the local context elements yet.
wenzelm@60459
  2052
wenzelm@60455
  2053
* Proof method "cases" allows to specify the rule as first entry of
wenzelm@60455
  2054
chained facts.  This is particularly useful with 'consider':
wenzelm@60455
  2055
wenzelm@60455
  2056
  consider (a) A | (b) B | (c) C <proof>
wenzelm@60455
  2057
  then have something
wenzelm@60455
  2058
  proof cases
wenzelm@60455
  2059
    case a
wenzelm@60455
  2060
    then show ?thesis <proof>
wenzelm@60455
  2061
  next
wenzelm@60455
  2062
    case b
wenzelm@60455
  2063
    then show ?thesis <proof>
wenzelm@60455
  2064
  next
wenzelm@60455
  2065
    case c
wenzelm@60455
  2066
    then show ?thesis <proof>
wenzelm@60455
  2067
  qed
wenzelm@60455
  2068
wenzelm@60565
  2069
* Command 'case' allows fact name and attribute specification like this:
wenzelm@60565
  2070
wenzelm@60565
  2071
  case a: (c xs)
wenzelm@60565
  2072
  case a [attributes]: (c xs)
wenzelm@60565
  2073
wenzelm@60565
  2074
Facts that are introduced by invoking the case context are uniformly
wenzelm@60565
  2075
qualified by "a"; the same name is used for the cumulative fact. The old
wenzelm@60565
  2076
form "case (c xs) [attributes]" is no longer supported. Rare
wenzelm@60565
  2077
INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,
wenzelm@60565
  2078
and always put attributes in front.
wenzelm@60565
  2079
wenzelm@60618
  2080
* The standard proof method of commands 'proof' and '..' is now called
wenzelm@60618
  2081
"standard" to make semantically clear what it is; the old name "default"
wenzelm@60618
  2082
is still available as legacy for some time. Documentation now explains
wenzelm@60618
  2083
'..' more accurately as "by standard" instead of "by rule".
wenzelm@60618
  2084
wenzelm@62017
  2085
* Nesting of Isar goal structure has been clarified: the context after
wenzelm@62017
  2086
the initial backwards refinement is retained for the whole proof, within
wenzelm@62017
  2087
all its context sections (as indicated via 'next'). This is e.g.
wenzelm@62017
  2088
relevant for 'using', 'including', 'supply':
wenzelm@62017
  2089
wenzelm@62017
  2090
  have "A \<and> A" if a: A for A
wenzelm@62017
  2091
    supply [simp] = a
wenzelm@62017
  2092
  proof
wenzelm@62017
  2093
    show A by simp
wenzelm@62017
  2094
  next
wenzelm@62017
  2095
    show A by simp
wenzelm@62017
  2096
  qed
wenzelm@62017
  2097
wenzelm@62017
  2098
* Command 'obtain' binds term abbreviations (via 'is' patterns) in the
wenzelm@62017
  2099
proof body as well, abstracted over relevant parameters.
wenzelm@62017
  2100
wenzelm@62017
  2101
* Improved type-inference for theorem statement 'obtains': separate
wenzelm@62017
  2102
parameter scope for of each clause.
wenzelm@62017
  2103
wenzelm@62017
  2104
* Term abbreviations via 'is' patterns also work for schematic
wenzelm@62017
  2105
statements: result is abstracted over unknowns.
wenzelm@62017
  2106
wenzelm@60631
  2107
* Command 'subgoal' allows to impose some structure on backward
wenzelm@60631
  2108
refinements, to avoid proof scripts degenerating into long of 'apply'
wenzelm@60631
  2109
sequences. Further explanations and examples are given in the isar-ref
wenzelm@60631
  2110
manual.
wenzelm@60631
  2111
wenzelm@62017
  2112
* Command 'supply' supports fact definitions during goal refinement
wenzelm@62017
  2113
('apply' scripts).
wenzelm@62017
  2114
wenzelm@61166
  2115
* Proof method "goal_cases" turns the current subgoals into cases within
wenzelm@61166
  2116
the context; the conclusion is bound to variable ?case in each case. For
wenzelm@61166
  2117
example:
wenzelm@60617
  2118
wenzelm@60617
  2119
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
  2120
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
  2121
proof goal_cases
wenzelm@60622
  2122
  case (1 x)
wenzelm@60622
  2123
  then show ?case using \<open>A x\<close> \<open>B x\<close> sorry
wenzelm@60622
  2124
next
wenzelm@60622
  2125
  case (2 y z)
wenzelm@60622
  2126
  then show ?case using \<open>U y\<close> \<open>V z\<close> sorry
wenzelm@60622
  2127
qed
wenzelm@60622
  2128
wenzelm@60622
  2129
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
  2130
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
  2131
proof goal_cases
wenzelm@60617
  2132
  case prems: 1
wenzelm@60617
  2133
  then show ?case using prems sorry
wenzelm@60617
  2134
next
wenzelm@60617
  2135
  case prems: 2
wenzelm@60617
  2136
  then show ?case using prems sorry
wenzelm@60617
  2137
qed
wenzelm@60578
  2138
wenzelm@60581
  2139
* The undocumented feature of implicit cases goal1, goal2, goal3, etc.
wenzelm@60617
  2140
is marked as legacy, and will be removed eventually. The proof method
wenzelm@60617
  2141
"goals" achieves a similar effect within regular Isar; often it can be
wenzelm@60617
  2142
done more adequately by other means (e.g. 'consider').
wenzelm@60581
  2143
wenzelm@62017
  2144
* The vacuous fact "TERM x" may be established "by fact" or as `TERM x`
wenzelm@62017
  2145
as well, not just "by this" or "." as before.
wenzelm@60551
  2146
wenzelm@60554
  2147
* Method "sleep" succeeds after a real-time delay (in seconds). This is
wenzelm@60554
  2148
occasionally useful for demonstration and testing purposes.
wenzelm@60554
  2149
wenzelm@60406
  2150
wenzelm@60331
  2151
*** Pure ***
wenzelm@60331
  2152
wenzelm@61606
  2153
* Qualifiers in locale expressions default to mandatory ('!') regardless
wenzelm@61606
  2154
of the command. Previously, for 'locale' and 'sublocale' the default was
wenzelm@61606
  2155
optional ('?'). The old synatx '!' has been discontinued.
wenzelm@61606
  2156
INCOMPATIBILITY, remove '!' and add '?' as required.
ballarin@61565
  2157
ballarin@61566
  2158
* Keyword 'rewrites' identifies rewrite morphisms in interpretation
wenzelm@62017
  2159
commands. Previously, the keyword was 'where'. INCOMPATIBILITY.
ballarin@61566
  2160
ballarin@61701
  2161
* More gentle suppression of syntax along locale morphisms while
wenzelm@62017
  2162
printing terms. Previously 'abbreviation' and 'notation' declarations
wenzelm@62017
  2163
would be suppressed for morphisms except term identity. Now
ballarin@61701
  2164
'abbreviation' is also kept for morphims that only change the involved
wenzelm@62017
  2165
parameters, and only 'notation' is suppressed. This can be of great help
wenzelm@62017
  2166
when working with complex locale hierarchies, because proof states are
wenzelm@62017
  2167
displayed much more succinctly. It also means that only notation needs
wenzelm@62017
  2168
to be redeclared if desired, as illustrated by this example:
ballarin@61701
  2169
ballarin@61701
  2170
  locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65)
ballarin@61701
  2171
  begin
ballarin@61701
  2172
    definition derived (infixl "\<odot>" 65) where ...
ballarin@61701
  2173
  end
ballarin@61701
  2174
ballarin@61701
  2175
  locale morphism =
ballarin@61701
  2176
    left: struct composition + right: struct composition'
ballarin@61701
  2177
    for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65)
ballarin@61701
  2178
  begin
ballarin@61701
  2179
    notation right.derived ("\<odot>''")
ballarin@61701
  2180
  end
ballarin@61701
  2181
wenzelm@61895
  2182
* Command 'global_interpretation' issues interpretations into global
wenzelm@61895
  2183
theories, with optional rewrite definitions following keyword 'defines'.
wenzelm@61895
  2184
wenzelm@61895
  2185
* Command 'sublocale' accepts optional rewrite definitions after keyword
haftmann@61675
  2186
'defines'.
haftmann@61675
  2187
wenzelm@61895
  2188
* Command 'permanent_interpretation' has been discontinued. Use
wenzelm@61895
  2189
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.
haftmann@61670
  2190
wenzelm@61252
  2191
* Command 'print_definitions' prints dependencies of definitional
wenzelm@61252
  2192
specifications. This functionality used to be part of 'print_theory'.
wenzelm@61252
  2193
wenzelm@60331
  2194
* Configuration option rule_insts_schematic has been discontinued
wenzelm@62017
  2195
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.
wenzelm@60331
  2196
wenzelm@62205
  2197
* Abbreviations in type classes now carry proper sort constraint. Rare
wenzelm@62205
  2198
INCOMPATIBILITY in situations where the previous misbehaviour has been
wenzelm@62205
  2199
exploited.
haftmann@60347
  2200
haftmann@60347
  2201
* Refinement of user-space type system in type classes: pseudo-local
wenzelm@62205
  2202
operations behave more similar to abbreviations. Potential
haftmann@60347
  2203
INCOMPATIBILITY in exotic situations.
haftmann@60347
  2204
haftmann@60347
  2205
nipkow@60171
  2206
*** HOL ***
nipkow@60171
  2207
wenzelm@62017
  2208
* The 'typedef' command has been upgraded from a partially checked
wenzelm@62017
  2209
"axiomatization", to a full definitional specification that takes the
wenzelm@62017
  2210
global collection of overloaded constant / type definitions into
wenzelm@62017
  2211
account. Type definitions with open dependencies on overloaded
wenzelm@62017
  2212
definitions need to be specified as "typedef (overloaded)". This
wenzelm@62017
  2213
provides extra robustness in theory construction. Rare INCOMPATIBILITY.
wenzelm@62017
  2214
wenzelm@62017
  2215
* Qualification of various formal entities in the libraries is done more
wenzelm@62017
  2216
uniformly via "context begin qualified definition ... end" instead of
wenzelm@62017
  2217
old-style "hide_const (open) ...". Consequently, both the defined
wenzelm@62017
  2218
constant and its defining fact become qualified, e.g. Option.is_none and
wenzelm@62017
  2219
Option.is_none_def. Occasional INCOMPATIBILITY in applications.
wenzelm@62017
  2220
wenzelm@62017
  2221
* Some old and rarely used ASCII replacement syntax has been removed.
wenzelm@62017
  2222
INCOMPATIBILITY, standard syntax with symbols should be used instead.
wenzelm@62017
  2223
The subsequent commands help to reproduce the old forms, e.g. to
wenzelm@62017
  2224
simplify porting old theories:
wenzelm@62017
  2225
wenzelm@62017
  2226
  notation iff  (infixr "<->" 25)
wenzelm@62017
  2227
wenzelm@62017
  2228
  notation Times  (infixr "<*>" 80)
wenzelm@62017
  2229
wenzelm@62017
  2230
  type_notation Map.map  (infixr "~=>" 0)
wenzelm@62017
  2231
  notation Map.map_comp  (infixl "o'_m" 55)
wenzelm@62017
  2232
wenzelm@62017
  2233
  type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21)
wenzelm@62017
  2234
wenzelm@62017
  2235
  notation FuncSet.funcset  (infixr "->" 60)
wenzelm@62017
  2236
  notation FuncSet.extensional_funcset  (infixr "->\<^sub>E" 60)
wenzelm@62017
  2237
wenzelm@62017
  2238
  notation Omega_Words_Fun.conc (infixr "conc" 65)
wenzelm@62017
  2239
wenzelm@62017
  2240
  notation Preorder.equiv ("op ~~")
wenzelm@62017
  2241
    and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50)
wenzelm@62017
  2242
wenzelm@62017
  2243
  notation (in topological_space) tendsto (infixr "--->" 55)
wenzelm@62017
  2244
  notation (in topological_space) LIMSEQ ("((_)/ ----> (_))" [60, 60] 60)
wenzelm@62017
  2245
  notation LIM ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)
wenzelm@62017
  2246
wenzelm@62017
  2247
  notation NSA.approx (infixl "@=" 50)
wenzelm@62017
  2248
  notation NSLIMSEQ ("((_)/ ----NS> (_))" [60, 60] 60)
wenzelm@62017
  2249
  notation NSLIM ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)
wenzelm@62017
  2250
wenzelm@62017
  2251
* The alternative notation "\<Colon>" for type and sort constraints has been
wenzelm@62017
  2252
removed: in LaTeX document output it looks the same as "::".
wenzelm@62017
  2253
INCOMPATIBILITY, use plain "::" instead.
wenzelm@62017
  2254
wenzelm@62017
  2255
* Commands 'inductive' and 'inductive_set' work better when names for
wenzelm@62017
  2256
intro rules are omitted: the "cases" and "induct" rules no longer
wenzelm@62017
  2257
declare empty case_names, but no case_names at all. This allows to use
wenzelm@62017
  2258
numbered cases in proofs, without requiring method "goal_cases".
wenzelm@62017
  2259
wenzelm@62017
  2260
* Inductive definitions ('inductive', 'coinductive', etc.) expose
wenzelm@62017
  2261
low-level facts of the internal construction only if the option
wenzelm@62093
  2262
"inductive_internals" is enabled. This refers to the internal predicate
wenzelm@62017
  2263
definition and its monotonicity result. Rare INCOMPATIBILITY.
wenzelm@62017
  2264
wenzelm@62017
  2265
* Recursive function definitions ('fun', 'function', 'partial_function')
wenzelm@62017
  2266
expose low-level facts of the internal construction only if the option
wenzelm@62205
  2267
"function_internals" is enabled. Its internal inductive definition is
wenzelm@62205
  2268
also subject to "inductive_internals". Rare INCOMPATIBILITY.
wenzelm@62093
  2269
wenzelm@62093
  2270
* BNF datatypes ('datatype', 'codatatype', etc.) expose low-level facts
wenzelm@62093
  2271
of the internal construction only if the option "bnf_internals" is
wenzelm@62093
  2272
enabled. This supersedes the former option "bnf_note_all". Rare
wenzelm@62093
  2273
INCOMPATIBILITY.
wenzelm@62017
  2274
wenzelm@62017
  2275
* Combinator to represent case distinction on products is named
wenzelm@62017
  2276
"case_prod", uniformly, discontinuing any input aliasses. Very popular
wenzelm@62017
  2277
theorem aliasses have been retained.
wenzelm@62017
  2278
haftmann@61424
  2279
Consolidated facts:
haftmann@61424
  2280
  PairE ~> prod.exhaust
haftmann@61424
  2281
  Pair_eq ~> prod.inject
haftmann@61424
  2282
  pair_collapse ~> prod.collapse
haftmann@61424
  2283
  Pair_fst_snd_eq ~> prod_eq_iff
haftmann@61424
  2284
  split_twice ~> prod.case_distrib
haftmann@61424
  2285
  split_weak_cong ~> prod.case_cong_weak
haftmann@61424
  2286
  split_split ~> prod.split
haftmann@61424
  2287
  split_split_asm ~> prod.split_asm
haftmann@61424
  2288
  splitI ~> case_prodI
haftmann@61424
  2289
  splitD ~> case_prodD
haftmann@61424
  2290
  splitI2 ~> case_prodI2
haftmann@61424
  2291
  splitI2' ~> case_prodI2'
haftmann@61424
  2292
  splitE ~> case_prodE
haftmann@61424
  2293
  splitE' ~> case_prodE'
haftmann@61424
  2294
  split_pair ~> case_prod_Pair
haftmann@61424
  2295
  split_eta ~> case_prod_eta
haftmann@61424
  2296
  split_comp ~> case_prod_comp
haftmann@61424
  2297
  mem_splitI ~> mem_case_prodI
haftmann@61424
  2298
  mem_splitI2 ~> mem_case_prodI2
haftmann@61424
  2299
  mem_splitE ~> mem_case_prodE
haftmann@61424
  2300
  The_split ~> The_case_prod
haftmann@61424
  2301
  cond_split_eta ~> cond_case_prod_eta
haftmann@61424
  2302
  Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE
haftmann@61424
  2303
  Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI
haftmann@61424
  2304
  in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq
haftmann@61424
  2305
  Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD
haftmann@61424
  2306
  Collect_split_Grp_inD ~> Collect_case_prod_Grp_in
haftmann@61424
  2307
  Domain_Collect_split ~> Domain_Collect_case_prod
haftmann@61424
  2308
  Image_Collect_split ~> Image_Collect_case_prod
haftmann@61424
  2309
  Range_Collect_split ~> Range_Collect_case_prod
haftmann@61424
  2310
  Eps_split ~> Eps_case_prod
haftmann@61424
  2311
  Eps_split_eq ~> Eps_case_prod_eq
haftmann@61424
  2312
  split_rsp ~> case_prod_rsp
haftmann@61424
  2313
  curry_split ~> curry_case_prod
haftmann@61424
  2314
  split_curry ~> case_prod_curry
wenzelm@62017
  2315
haftmann@61424
  2316
Changes in structure HOLogic:
haftmann@61424
  2317
  split_const ~> case_prod_const
haftmann@61424
  2318
  mk_split ~> mk_case_prod
haftmann@61424
  2319
  mk_psplits ~> mk_ptupleabs
haftmann@61424
  2320
  strip_psplits ~> strip_ptupleabs
wenzelm@62017
  2321
wenzelm@62017
  2322
INCOMPATIBILITY.
wenzelm@62017
  2323
wenzelm@62017
  2324
* The coercions to type 'real' have been reorganised. The function
wenzelm@62017
  2325
'real' is no longer overloaded, but has type 'nat => real' and
wenzelm@62017
  2326
abbreviates of_nat for that type. Also 'real_of_int :: int => real'
wenzelm@62017
  2327
abbreviates of_int for that type. Other overloaded instances of 'real'
wenzelm@62017
  2328
have been replaced by 'real_of_ereal' and 'real_of_float'.
wenzelm@62017
  2329
lp15@61694
  2330
Consolidated facts (among others):
lp15@61694
  2331
  real_of_nat_le_iff -> of_nat_le_iff
lp15@61694
  2332
  real_of_nat_numeral of_nat_numeral
lp15@61694
  2333
  real_of_int_zero of_int_0
lp15@61694
  2334
  real_of_nat_zero of_nat_0
lp15@61694
  2335
  real_of_one of_int_1
lp15@61694
  2336
  real_of_int_add of_int_add
lp15@61694
  2337
  real_of_nat_add of_nat_add
lp15@61694
  2338
  real_of_int_diff of_int_diff
lp15@61694
  2339
  real_of_nat_diff of_nat_diff
lp15@61694
  2340
  floor_subtract floor_diff_of_int
lp15@61694
  2341
  real_of_int_inject of_int_eq_iff
lp15@61694
  2342
  real_of_int_gt_zero_cancel_iff of_int_0_less_iff
lp15@61694
  2343
  real_of_int_ge_zero_cancel_iff of_int_0_le_iff
lp15@61694
  2344
  real_of_nat_ge_zero of_nat_0_le_iff
lp15@61694
  2345
  real_of_int_ceiling_ge le_of_int_ceiling
lp15@61694
  2346
  ceiling_less_eq ceiling_less_iff
lp15@61694
  2347
  ceiling_le_eq ceiling_le_iff
lp15@61694
  2348
  less_floor_eq less_floor_iff
lp15@61694
  2349
  floor_less_eq floor_less_iff
lp15@61694
  2350
  floor_divide_eq_div floor_divide_of_int_eq
lp15@61694
  2351
  real_of_int_zero_cancel of_nat_eq_0_iff
lp15@61694
  2352
  ceiling_real_of_int ceiling_of_int
wenzelm@62017
  2353
wenzelm@62017
  2354
INCOMPATIBILITY.
wenzelm@61143
  2355
wenzelm@60841
  2356
* Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has
wenzelm@60841
  2357
been removed. INCOMPATIBILITY.
wenzelm@60841
  2358
lars@60712
  2359
* Quickcheck setup for finite sets.
lars@60712
  2360
nipkow@60171
  2361
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.
wenzelm@60138
  2362
blanchet@60306
  2363
* Sledgehammer:
blanchet@61318
  2364
  - The MaSh relevance filter has been sped up.
blanchet@60306
  2365
  - Proof reconstruction has been improved, to minimize the incidence of
blanchet@60306
  2366
    cases where Sledgehammer gives a proof that does not work.
blanchet@60306
  2367
  - Auto Sledgehammer now minimizes and preplays the results.
blanchet@61030
  2368
  - Handle Vampire 4.0 proof output without raising exception.
blanchet@61043
  2369
  - Eliminated "MASH" environment variable. Use the "MaSh" option in
blanchet@61043
  2370
    Isabelle/jEdit instead. INCOMPATIBILITY.
blanchet@61317
  2371
  - Eliminated obsolete "blocking" option and related subcommands.
blanchet@60306
  2372
blanchet@60310
  2373
* Nitpick:
blanchet@61325
  2374
  - Fixed soundness bug in translation of "finite" predicate.
blanchet@61324
  2375
  - Fixed soundness bug in "destroy_constrs" optimization.
blanchet@62080
  2376
  - Fixed soundness bug in translation of "rat" type.
blanchet@60310
  2377
  - Removed "check_potential" and "check_genuine" options.
blanchet@61317
  2378
  - Eliminated obsolete "blocking" option.
blanchet@60310
  2379
wenzelm@62027
  2380
* (Co)datatype package:
blanchet@61345
  2381
  - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF
blanchet@61345
  2382
    structure on the raw type to an abstract type defined using typedef.
blanchet@61345
  2383
  - Always generate "case_transfer" theorem.
wenzelm@62235
  2384
  - For mutual types, generate slightly stronger "rel_induct",
haftmann@63946
  2385
    "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.
blanchet@61551
  2386
  - Allow discriminators and selectors with the same name as the type
blanchet@61551
  2387
    being defined.
blanchet@61551
  2388
  - Avoid various internal name clashes (e.g., 'datatype f = f').
traytel@60920
  2389
wenzelm@62098
  2390
* Transfer: new methods for interactive debugging of 'transfer' and
wenzelm@62098
  2391
'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',
wenzelm@62098
  2392
'transfer_prover_start' and 'transfer_prover_end'.
kuncar@61370
  2393
kleing@62118
  2394
* New diagnostic command print_record for displaying record definitions.
kleing@62118
  2395
haftmann@60868
  2396
* Division on integers is bootstrapped directly from division on
wenzelm@62017
  2397
naturals and uses generic numeral algorithm for computations. Slight
wenzelm@62017
  2398
INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former
wenzelm@62017
  2399
simprocs binary_int_div and binary_int_mod
wenzelm@62017
  2400
wenzelm@62017
  2401
* Tightened specification of class semiring_no_zero_divisors. Minor
haftmann@60516
  2402
INCOMPATIBILITY.
haftmann@60516
  2403
haftmann@60688
  2404
* Class algebraic_semidom introduces common algebraic notions of
wenzelm@62017
  2405
integral (semi)domains, particularly units. Although logically subsumed
wenzelm@62017
  2406
by fields, is is not a super class of these in order not to burden
wenzelm@62017
  2407
fields with notions that are trivial there.
wenzelm@62017
  2408
wenzelm@62017
  2409
* Class normalization_semidom specifies canonical representants for
wenzelm@62017
  2410
equivalence classes of associated elements in an integral (semi)domain.
wenzelm@62017
  2411
This formalizes associated elements as well.
haftmann@60688
  2412
haftmann@60688
  2413
* Abstract specification of gcd/lcm operations in classes semiring_gcd,
wenzelm@62017
  2414
semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute
wenzelm@62017
  2415
and gcd_int.commute are subsumed by gcd.commute, as well as
wenzelm@62017
  2416
gcd_nat.assoc and gcd_int.assoc by gcd.assoc.
wenzelm@62017
  2417
wenzelm@62017
  2418
* Former constants Fields.divide (_ / _) and Divides.div (_ div _) are
wenzelm@62017
  2419
logically unified to Rings.divide in syntactic type class Rings.divide,
wenzelm@62017
  2420
with infix syntax (_ div _). Infix syntax (_ / _) for field division is
wenzelm@62017
  2421
added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,
wenzelm@62017
  2422
instantiations must refer to Rings.divide rather than the former
wenzelm@62017
  2423
separate constants, hence infix syntax (_ / _) is usually not available
wenzelm@62017
  2424
during instantiation.
wenzelm@62017
  2425
wenzelm@62017
  2426
* New cancellation simprocs for boolean algebras to cancel complementary
wenzelm@62017
  2427
terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to
wenzelm@62017
  2428
"top". INCOMPATIBILITY.
Andreas@61629
  2429
hoelzl@62101
  2430
* Class uniform_space introduces uniform spaces btw topological spaces
hoelzl@62101
  2431
and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be
wenzelm@62205
  2432
introduced in the form of an uniformity. Some constants are more general
wenzelm@62205
  2433
now, it may be necessary to add type class constraints.
hoelzl@62101
  2434
hoelzl@62101
  2435
  open_real_def \<leadsto> open_dist
hoelzl@62101
  2436
  open_complex_def \<leadsto> open_dist
hoelzl@62101
  2437
wenzelm@62026
  2438
* Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.
wenzelm@62026
  2439
Mathias@60397
  2440
* Library/Multiset:
Mathias@60397
  2441
  - Renamed multiset inclusion operators:
Mathias@60397
  2442
      < ~> <#
blanchet@62208
  2443
      > ~> >#
Mathias@60397
  2444
      <= ~> <=#
blanchet@62208
  2445
      >= ~> >=#
Mathias@60397
  2446
      \<le> ~> \<le>#
blanchet@62208
  2447
      \<ge> ~> \<ge>#
Mathias@60397
  2448
    INCOMPATIBILITY.
blanchet@62209
  2449
  - Added multiset inclusion operator syntax:
blanchet@62209
  2450
      \<subset>#
blanchet@62209
  2451
      \<subseteq>#
blanchet@62209
  2452
      \<supset>#
blanchet@62209
  2453
      \<supseteq>#
Mathias@60397
  2454
  - "'a multiset" is no longer an instance of the "order",
Mathias@60397
  2455
    "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",
Mathias@60397
  2456
    "semilattice_inf", and "semilattice_sup" type classes. The theorems
Mathias@60397
  2457
    previously provided by these type classes (directly or indirectly)
Mathias@60397
  2458
    are now available through the "subset_mset" interpretation
Mathias@60397
  2459
    (e.g. add_mono ~> subset_mset.add_mono).
Mathias@60397
  2460
    INCOMPATIBILITY.
nipkow@60497
  2461
  - Renamed conversions:
nipkow@60515
  2462
      multiset_of ~> mset
nipkow@60515
  2463
      multiset_of_set ~> mset_set
nipkow@60497
  2464
      set_of ~> set_mset
nipkow@60497
  2465
    INCOMPATIBILITY
Mathias@60398
  2466
  - Renamed lemmas:
Mathias@60398
  2467
      mset_le_def ~> subseteq_mset_def
Mathias@60398
  2468
      mset_less_def ~> subset_mset_def
Mathias@60400
  2469
      less_eq_multiset.rep_eq ~> subseteq_mset_def
Mathias@60400
  2470
    INCOMPATIBILITY
Mathias@60400
  2471
  - Removed lemmas generated by lift_definition:
wenzelm@62235
  2472
    less_eq_multiset.abs_eq, less_eq_multiset.rsp,
wenzelm@62235
  2473
    less_eq_multiset.transfer, less_eq_multiset_def
Mathias@60400
  2474
    INCOMPATIBILITY
wenzelm@60006
  2475
wenzelm@62017
  2476
* Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.
wenzelm@62017
  2477
wenzelm@62017
  2478
* Library/Bourbaki_Witt_Fixpoint: Added formalisation of the
wenzelm@62017
  2479
Bourbaki-Witt fixpoint theorem for increasing functions in
wenzelm@62017
  2480
chain-complete partial orders.
wenzelm@62017
  2481
wenzelm@62017
  2482
* Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.
wenzelm@62017
  2483
Minor INCOMPATIBILITY, use 'function' instead.
wenzelm@62017
  2484
wenzelm@62064
  2485
* Library/Periodic_Fun: a locale that provides convenient lemmas for
wenzelm@62064
  2486
periodic functions.
eberlm@62060
  2487
wenzelm@62098
  2488
* Library/Formal_Power_Series: proper definition of division (with
wenzelm@62098
  2489
remainder) for formal power series; instances for Euclidean Ring and
wenzelm@62098
  2490
GCD.
eberlm@62086
  2491
wenzelm@62084
  2492
* HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.
wenzelm@62084
  2493
wenzelm@62084
  2494
* HOL-Statespace: command 'statespace' uses mandatory qualifier for
wenzelm@62084
  2495
import of parent, as for general 'locale' expressions. INCOMPATIBILITY,
wenzelm@62084
  2496
remove '!' and add '?' as required.
wenzelm@62084
  2497
wenzelm@62237
  2498
* HOL-Decision_Procs: The "approximation" method works with "powr"
wenzelm@62237
  2499
(exponentiation on real numbers) again.
wenzelm@62237
  2500
wenzelm@62084
  2501
* HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour
wenzelm@62084
  2502
integrals (= complex path integrals), Cauchy's integral theorem, winding
wenzelm@62084
  2503
numbers and Cauchy's integral formula, Liouville theorem, Fundamental
wenzelm@62084
  2504
Theorem of Algebra. Ported from HOL Light.
wenzelm@62084
  2505
wenzelm@62084
  2506
* HOL-Multivariate_Analysis: topological concepts such as connected
wenzelm@62017
  2507
components, homotopic paths and the inside or outside of a set.
wenzelm@61121
  2508
wenzelm@62084
  2509
* HOL-Multivariate_Analysis: radius of convergence of power series and
wenzelm@62064
  2510
various summability tests; Harmonic numbers and the Euler–Mascheroni
wenzelm@62064
  2511
constant; the Generalised Binomial Theorem; the complex and real
wenzelm@62064
  2512
Gamma/log-Gamma/Digamma/ Polygamma functions and their most important
wenzelm@62064
  2513
properties.
eberlm@62060
  2514
wenzelm@62084
  2515
* HOL-Probability: The central limit theorem based on Levy's uniqueness
wenzelm@62084
  2516
and continuity theorems, weak convergence, and characterisitc functions.
wenzelm@62084
  2517
wenzelm@62084
  2518
* HOL-Data_Structures: new and growing session of standard data
wenzelm@62084
  2519
structures.
lammich@61178
  2520
wenzelm@60479
  2521
wenzelm@60793
  2522
*** ML ***
wenzelm@60793
  2523
wenzelm@62017
  2524
* The following combinators for low-level profiling of the ML runtime
wenzelm@62017
  2525
system are available:
wenzelm@62017
  2526
wenzelm@62017
  2527
  profile_time          (*CPU time*)
wenzelm@62017
  2528
  profile_time_thread   (*CPU time on this thread*)
wenzelm@62017
  2529
  profile_allocations   (*overall heap allocations*)
wenzelm@62017
  2530
wenzelm@62017
  2531
* Antiquotation @{undefined} or \<^undefined> inlines (raise Match).
wenzelm@62017
  2532
wenzelm@62075
  2533
* Antiquotation @{method NAME} inlines the (checked) name of the given
wenzelm@62075
  2534
Isar proof method.
wenzelm@62075
  2535
wenzelm@61922
  2536
* Pretty printing of Poly/ML compiler output in Isabelle has been
wenzelm@61922
  2537
improved: proper treatment of break offsets and blocks with consistent
wenzelm@61922
  2538
breaks.
wenzelm@61922
  2539
wenzelm@61268
  2540
* The auxiliary module Pure/display.ML has been eliminated. Its
wenzelm@61268
  2541
elementary thm print operations are now in Pure/more_thm.ML and thus
wenzelm@61268
  2542
called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.
wenzelm@61268
  2543
wenzelm@61144
  2544
* Simproc programming interfaces have been simplified:
wenzelm@61144
  2545
Simplifier.make_simproc and Simplifier.define_simproc supersede various
wenzelm@61144
  2546
forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that
wenzelm@61144
  2547
term patterns for the left-hand sides are specified with implicitly
wenzelm@61144
  2548
fixed variables, like top-level theorem statements. INCOMPATIBILITY.
wenzelm@61144
  2549
wenzelm@60802
  2550
* Instantiation rules have been re-organized as follows:
wenzelm@60802
  2551
wenzelm@60802
  2552
  Thm.instantiate  (*low-level instantiation with named arguments*)
wenzelm@60802
  2553
  Thm.instantiate' (*version with positional arguments*)
wenzelm@60802
  2554
wenzelm@60802
  2555
  Drule.infer_instantiate  (*instantiation with type inference*)
wenzelm@60802
  2556
  Drule.infer_instantiate'  (*version with positional arguments*)
wenzelm@60802
  2557
wenzelm@60802
  2558
The LHS only requires variable specifications, instead of full terms.
wenzelm@60802
  2559
Old cterm_instantiate is superseded by infer_instantiate.
wenzelm@60802
  2560
INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.
wenzelm@60802
  2561
wenzelm@60793
  2562
* Old tactic shorthands atac, rtac, etac, dtac, ftac have been
wenzelm@60793
  2563
discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.
wenzelm@60793
  2564
instead (with proper context).
wenzelm@60642
  2565
wenzelm@60642
  2566
* Thm.instantiate (and derivatives) no longer require the LHS of the
wenzelm@60642
  2567
instantiation to be certified: plain variables are given directly.
wenzelm@60642
  2568
wenzelm@60707
  2569
* Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous
wenzelm@60707
  2570
quasi-bound variables (like the Simplifier), instead of accidentally
wenzelm@60707
  2571
named local fixes. This has the potential to improve stability of proof
wenzelm@60707
  2572
tools, but can also cause INCOMPATIBILITY for tools that don't observe
wenzelm@60707
  2573
the proof context discipline.
wenzelm@60707
  2574
wenzelm@62017
  2575
* Isar proof methods are based on a slightly more general type
wenzelm@62017
  2576
context_tactic, which allows to change the proof context dynamically
wenzelm@62017
  2577
(e.g. to update cases) and indicate explicit Seq.Error results. Former
wenzelm@62017
  2578
METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are
wenzelm@62017
  2579
provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.
wenzelm@61885
  2580
wenzelm@60642
  2581
wenzelm@60983
  2582
*** System ***
wenzelm@60983
  2583
wenzelm@62525
  2584
* Command-line tool "isabelle console" enables print mode "ASCII".
wenzelm@61958
  2585
wenzelm@62017
  2586
* Command-line tool "isabelle update_then" expands old Isar command
wenzelm@62017
  2587
conflations:
wenzelm@62017
  2588
wenzelm@62017
  2589
    hence  ~>  then have
wenzelm@62017
  2590
    thus   ~>  then show
wenzelm@62017
  2591
wenzelm@62017
  2592
This syntax is more orthogonal and improves readability and
wenzelm@62017
  2593
maintainability of proofs.
wenzelm@62017
  2594
wenzelm@61602
  2595
* Global session timeout is multiplied by timeout_scale factor. This
wenzelm@61602
  2596
allows to adjust large-scale tests (e.g. AFP) to overall hardware
wenzelm@61602
  2597
performance.
wenzelm@61602
  2598
wenzelm@61174
  2599
* Property values in etc/symbols may contain spaces, if written with the
wenzelm@62671
  2600
replacement character "␣" (Unicode point 0x2324). For example:
wenzelm@62671
  2601
wenzelm@62671
  2602
    \<star>  code: 0x0022c6  group: operator  font: Deja␣Vu␣Sans␣Mono
wenzelm@61174
  2603
wenzelm@60995
  2604
* Java runtime environment for x86_64-windows allows to use larger heap
wenzelm@60995
  2605
space.
wenzelm@60995
  2606
wenzelm@61135
  2607
* Java runtime options are determined separately for 32bit vs. 64bit
wenzelm@61135
  2608
platforms as follows.
wenzelm@61135
  2609
wenzelm@61135
  2610
  - Isabelle desktop application: platform-specific files that are
wenzelm@61135
  2611
    associated with the main app bundle
wenzelm@61135
  2612
wenzelm@61135
  2613
  - isabelle jedit: settings
wenzelm@61135
  2614
    JEDIT_JAVA_SYSTEM_OPTIONS
wenzelm@61135
  2615
    JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64
wenzelm@61135
  2616
wenzelm@61135
  2617
  - isabelle build: settings
wenzelm@61135
  2618
    ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64
wenzelm@61135
  2619
wenzelm@61294
  2620
* Bash shell function "jvmpath" has been renamed to "platform_path": it
wenzelm@61294
  2621
is relevant both for Poly/ML and JVM processes.
wenzelm@61294
  2622
wenzelm@62017
  2623
* Poly/ML default platform architecture may be changed from 32bit to
wenzelm@62205
  2624
64bit via system option ML_system_64. A system restart (and rebuild) is
wenzelm@62205
  2625
required after change.
wenzelm@62017
  2626
wenzelm@62017
  2627
* Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which
wenzelm@62017
  2628
both allow larger heap space than former x86-cygwin.
wenzelm@62017
  2629
wenzelm@62157
  2630
* Heap images are 10-15% smaller due to less wasteful persistent theory
wenzelm@62157
  2631
content (using ML type theory_id instead of theory);
wenzelm@62157
  2632
wenzelm@60983
  2633
wenzelm@60479
  2634
wenzelm@60009
  2635
New in Isabelle2015 (May 2015)
wenzelm@60009
  2636
------------------------------
wenzelm@57695
  2637
wenzelm@57941
  2638
*** General ***
wenzelm@57941
  2639
wenzelm@59939
  2640
* Local theory specification commands may have a 'private' or
wenzelm@59990
  2641
'qualified' modifier to restrict name space accesses to the local scope,
wenzelm@59939
  2642
as provided by some "context begin ... end" block. For example:
wenzelm@59926
  2643
wenzelm@59926
  2644
  context
wenzelm@59926
  2645
  begin
wenzelm@59926
  2646
wenzelm@59926
  2647
  private definition ...
wenzelm@59926
  2648
  private lemma ...
wenzelm@59926
  2649
wenzelm@59990
  2650
  qualified definition ...
wenzelm@59990
  2651
  qualified lemma ...
wenzelm@59990
  2652
wenzelm@59926
  2653
  lemma ...
wenzelm@59926
  2654
  theorem ...
wenzelm@59926
  2655
wenzelm@59926
  2656
  end
wenzelm@59926
  2657
wenzelm@59901
  2658
* Command 'experiment' opens an anonymous locale context with private
wenzelm@59901
  2659
naming policy.
wenzelm@59901
  2660
wenzelm@59951
  2661
* Command 'notepad' requires proper nesting of begin/end and its proof
wenzelm@59951
  2662
structure in the body: 'oops' is no longer supported here. Minor
wenzelm@59951
  2663
INCOMPATIBILITY, use 'sorry' instead.
wenzelm@59951
  2664
wenzelm@59951
  2665
* Command 'named_theorems' declares a dynamic fact within the context,
wenzelm@59951
  2666
together with an attribute to maintain the content incrementally. This
wenzelm@59951
  2667
supersedes functor Named_Thms in Isabelle/ML, but with a subtle change
wenzelm@59951
  2668
of semantics due to external visual order vs. internal reverse order.
wenzelm@59951
  2669
wenzelm@59951
  2670
* 'find_theorems': search patterns which are abstractions are
wenzelm@59951
  2671
schematically expanded before search. Search results match the naive
wenzelm@59951
  2672
expectation more closely, particularly wrt. abbreviations.
wenzelm@59951
  2673
INCOMPATIBILITY.
wenzelm@59648
  2674
wenzelm@59569
  2675
* Commands 'method_setup' and 'attribute_setup' now work within a local
wenzelm@59569
  2676
theory context.
wenzelm@57941
  2677
wenzelm@58928
  2678
* Outer syntax commands are managed authentically within the theory
wenzelm@59569
  2679
context, without implicit global state. Potential for accidental
wenzelm@58928
  2680
INCOMPATIBILITY, make sure that required theories are really imported.
wenzelm@58928
  2681
wenzelm@60115
  2682
* Historical command-line terminator ";" is no longer accepted (and
wenzelm@60115
  2683
already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle
wenzelm@60115
  2684
update_semicolons" to remove obsolete semicolons from old theory
wenzelm@60115
  2685
sources.
wenzelm@60115
  2686
wenzelm@59951
  2687
* Structural composition of proof methods (meth1; meth2) in Isar
wenzelm@59951
  2688
corresponds to (tac1 THEN_ALL_NEW tac2) in ML.
haftmann@59105
  2689
wenzelm@60119
  2690
* The Eisbach proof method language allows to define new proof methods
wenzelm@60119
  2691
by combining existing ones with their usual syntax. The "match" proof
wenzelm@60119
  2692
method provides basic fact/term matching in addition to
wenzelm@60119
  2693
premise/conclusion matching through Subgoal.focus, and binds fact names
wenzelm@60288
  2694
from matches as well as term patterns within matches. The Isabelle
wenzelm@60288
  2695
documentation provides an entry "eisbach" for the Eisbach User Manual.
wenzelm@60288
  2696
Sources and various examples are in ~~/src/HOL/Eisbach/.
wenzelm@60119
  2697
wenzelm@57941
  2698
wenzelm@58524
  2699
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@58524
  2700
wenzelm@59569
  2701
* Improved folding mode "isabelle" based on Isar syntax. Alternatively,
wenzelm@59569
  2702
the "sidekick" mode may be used for document structure.
wenzelm@59569
  2703
wenzelm@59569
  2704
* Extended bracket matching based on Isar language structure. System
wenzelm@59569
  2705
option jedit_structure_limit determines maximum number of lines to scan
wenzelm@59569
  2706
in the buffer.
wenzelm@58758
  2707
wenzelm@58540
  2708
* Support for BibTeX files: context menu, context-sensitive token
wenzelm@58540
  2709
marker, SideKick parser.
wenzelm@58524
  2710
wenzelm@58551
  2711
* Document antiquotation @{cite} provides formal markup, which is
wenzelm@60265
  2712
interpreted semi-formally based on .bib files that happen to be open in
wenzelm@60265
  2713
the editor (hyperlinks, completion etc.).
wenzelm@58551
  2714
wenzelm@58785
  2715
* Less waste of vertical space via negative line spacing (see Global
wenzelm@58785
  2716
Options / Text Area).
wenzelm@58785
  2717
wenzelm@60089
  2718
* Improved graphview panel with optional output of PNG or PDF, for
wenzelm@60273
  2719
display of 'thy_deps', 'class_deps' etc.
wenzelm@60009
  2720
wenzelm@60115
  2721
* The commands 'thy_deps' and 'class_deps' allow optional bounds to
wenzelm@60115
  2722
restrict the visualized hierarchy.
wenzelm@60093
  2723
wenzelm@60072
  2724
* Improved scheduling for asynchronous print commands (e.g. provers
wenzelm@60072
  2725
managed by the Sledgehammer panel) wrt. ongoing document processing.
wenzelm@60072
  2726
wenzelm@58524
  2727
wenzelm@59951
  2728
*** Document preparation ***
wenzelm@59951
  2729
wenzelm@59951
  2730
* Document markup commands 'chapter', 'section', 'subsection',
wenzelm@59951
  2731
'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any
wenzelm@59951
  2732
context, even before the initial 'theory' command. Obsolete proof
wenzelm@59951
  2733
commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been
wenzelm@59951
  2734
discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'
wenzelm@59951
  2735
instead. The old 'header' command is still retained for some time, but
wenzelm@59951
  2736
should be replaced by 'chapter', 'section' etc. (using "isabelle