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