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