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