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