NEWS
author wenzelm
Wed Sep 19 11:50:07 2007 +0200 (2007-09-19)
changeset 24643 d5e4b170d132
parent 24636 e758837c0d18
child 24649 f7b68d12a91e
permissions -rw-r--r--
* ML: just one true type int;
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@20807
     4
New in this Isabelle version
wenzelm@17754
     5
----------------------------
wenzelm@17754
     6
wenzelm@17754
     7
*** General ***
wenzelm@17754
     8
wenzelm@22826
     9
* More uniform information about legacy features, notably a
wenzelm@22826
    10
warning/error of "Legacy feature: ...", depending on the state of the
wenzelm@23367
    11
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
wenzelm@23367
    12
legacy features will disappear eventually.
wenzelm@22826
    13
wenzelm@17918
    14
* Theory syntax: the header format ``theory A = B + C:'' has been
wenzelm@17918
    15
discontinued in favour of ``theory A imports B C begin''.  Use isatool
wenzelm@17918
    16
fixheaders to convert existing theory files.  INCOMPATIBILITY.
wenzelm@17918
    17
wenzelm@17918
    18
* Theory syntax: the old non-Isar theory file format has been
wenzelm@17918
    19
discontinued altogether.  Note that ML proof scripts may still be used
wenzelm@17918
    20
with Isar theories; migration is usually quite simple with the ML
wenzelm@17918
    21
function use_legacy_bindings.  INCOMPATIBILITY.
wenzelm@17918
    22
wenzelm@22871
    23
* Theory syntax: some popular names (e.g. 'class', 'declaration',
wenzelm@22871
    24
'fun', 'help', 'if') are now keywords.  INCOMPATIBILITY, use double
wenzelm@22871
    25
quotes.
wenzelm@19814
    26
wenzelm@23888
    27
* Theory loader: be more serious about observing the static theory
wenzelm@23888
    28
header specifications (including optional directories), but not the
wenzelm@24172
    29
accidental file locations of previously successful loads.  The strict
wenzelm@24172
    30
update policy of former update_thy is now already performed by
wenzelm@24172
    31
use_thy, so the former has been removed; use_thys updates several
wenzelm@24172
    32
theories simultaneously, just as 'imports' within a theory header
wenzelm@24172
    33
specification, but without merging the results.  Potential
wenzelm@24172
    34
INCOMPATIBILITY: may need to refine theory headers and commands
wenzelm@24172
    35
ROOT.ML which depend on load order.
wenzelm@23888
    36
wenzelm@23888
    37
* Theory loader: optional support for content-based file
wenzelm@23888
    38
identification, instead of the traditional scheme of full physical
wenzelm@23889
    39
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
wenzelm@23888
    40
(cf. the system manual).  The new scheme allows to work with
wenzelm@23888
    41
non-finished theories in persistent session images, such that source
wenzelm@23888
    42
files may be moved later on without requiring reloads.
wenzelm@23888
    43
wenzelm@24187
    44
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@24187
    45
file (with the same base name as the theory) are considered a legacy
wenzelm@24187
    46
feature, which will disappear eventually. Even now, the theory loader no
wenzelm@24187
    47
longer maintains dependencies on such files.
wenzelm@24187
    48
wenzelm@24234
    49
* Syntax: the scope for resolving ambiguities via type-inference is now
wenzelm@24234
    50
limited to individual terms, instead of whole simultaneous
wenzelm@24234
    51
specifications as before. This greatly reduces the complexity of the
wenzelm@24234
    52
syntax module and improves flexibility by separating parsing and
wenzelm@24234
    53
type-checking. INCOMPATIBILITY: additional type-constraints (explicit
wenzelm@24234
    54
'fixes' etc.) are required in rare situations.
wenzelm@24234
    55
wenzelm@17981
    56
* Legacy goal package: reduced interface to the bare minimum required
wenzelm@17981
    57
to keep existing proof scripts running.  Most other user-level
wenzelm@17981
    58
functions are now part of the OldGoals structure, which is *not* open
wenzelm@17981
    59
by default (consider isatool expandshort before open OldGoals).
wenzelm@17981
    60
Removed top_sg, prin, printyp, pprint_term/typ altogether, because
wenzelm@17981
    61
these tend to cause confusion about the actual goal (!) context being
wenzelm@17981
    62
used here, which is not necessarily the same as the_context().
wenzelm@17918
    63
wenzelm@23379
    64
* Command 'find_theorems': supports "*" wild-card in "name:"
wenzelm@23379
    65
criterion; "with_dups" option.  Certain ProofGeneral versions might
wenzelm@23379
    66
support a specific search form (see ProofGeneral/CHANGES).
webertj@22965
    67
wenzelm@20370
    68
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
wenzelm@20370
    69
by default, which means that "prems" (and also "fixed variables") are
wenzelm@20370
    70
suppressed from proof state output.  Note that the ProofGeneral
wenzelm@20370
    71
settings mechanism allows to change and save options persistently, but
wenzelm@20370
    72
older versions of Isabelle will fail to start up if a negative prems
wenzelm@20370
    73
limit is imposed.
wenzelm@20370
    74
wenzelm@21308
    75
* Local theory targets may be specified by non-nested blocks of
wenzelm@21308
    76
``context/locale/class ... begin'' followed by ``end''.  The body may
wenzelm@21308
    77
contain definitions, theorems etc., including any derived mechanism
wenzelm@21308
    78
that has been implemented on top of these primitives.  This concept
wenzelm@21308
    79
generalizes the existing ``theorem (in ...)'' towards more versatility
wenzelm@21308
    80
and scalability.
wenzelm@21308
    81
wenzelm@21960
    82
* Proof General interface: proper undo of final 'end' command;
wenzelm@21960
    83
discontinued Isabelle/classic mode (ML proof scripts).
wenzelm@21960
    84
wenzelm@17754
    85
wenzelm@17865
    86
*** Document preparation ***
wenzelm@17865
    87
wenzelm@21717
    88
* Added antiquotation @{theory name} which prints the given name,
wenzelm@21717
    89
after checking that it refers to a valid ancestor theory in the
wenzelm@21717
    90
current context.
haftmann@21339
    91
wenzelm@17869
    92
* Added antiquotations @{ML_type text} and @{ML_struct text} which
wenzelm@17869
    93
check the given source text as ML type/structure, printing verbatim.
wenzelm@17865
    94
wenzelm@21717
    95
* Added antiquotation @{abbrev "c args"} which prints the abbreviation
wenzelm@21717
    96
"c args == rhs" given in the current context.  (Any number of
wenzelm@21735
    97
arguments may be given on the LHS.)
wenzelm@21717
    98
wenzelm@21717
    99
wenzelm@17865
   100
wenzelm@17779
   101
*** Pure ***
wenzelm@17779
   102
haftmann@22921
   103
* code generator: consts in 'consts_code' Isar commands are now referred
haftmann@22921
   104
  to by usual term syntax (including optional type annotations).
haftmann@22921
   105
haftmann@22735
   106
* code generator: 
haftmann@22921
   107
  - Isar 'definition's, 'constdef's and primitive instance definitions are added
haftmann@22921
   108
    explicitly to the table of defining equations
haftmann@22754
   109
  - primitive definitions are not used as defining equations by default any longer
haftmann@22735
   110
  - defining equations are now definitly restricted to meta "==" and object
haftmann@22735
   111
        equality "="
haftmann@22735
   112
  - HOL theories have been adopted accordingly
haftmann@22735
   113
wenzelm@20807
   114
* class_package.ML offers a combination of axclasses and locales to
haftmann@22921
   115
achieve Haskell-like type classes in Isabelle.  See
wenzelm@20807
   116
HOL/ex/Classpackage.thy for examples.
wenzelm@20807
   117
wenzelm@20807
   118
* Yet another code generator framework allows to generate executable
haftmann@22921
   119
code for ML and Haskell (including "class"es).  A short usage sketch:
haftmann@20188
   120
haftmann@20188
   121
    internal compilation:
haftmann@23850
   122
        code_gen <list of constants (term syntax)> in SML
haftmann@20453
   123
    writing SML code to a file:
haftmann@23850
   124
        code_gen <list of constants (term syntax)> in SML <filename>
haftmann@22735
   125
    writing OCaml code to a file:
haftmann@23850
   126
        code_gen <list of constants (term syntax)> in OCaml <filename>
haftmann@20188
   127
    writing Haskell code to a bunch of files:
haftmann@23850
   128
        code_gen <list of constants (term syntax)> in Haskell <filename>
haftmann@20453
   129
haftmann@20453
   130
Reasonable default setup of framework in HOL/Main.
haftmann@20453
   131
haftmann@20453
   132
Theorem attributs for selecting and transforming function equations theorems:
haftmann@20453
   133
haftmann@22845
   134
    [code fun]:        select a theorem as function equation for a specific constant
haftmann@22845
   135
    [code fun del]:    deselect a theorem as function equation for a specific constant
haftmann@22845
   136
    [code inline]:     select an equation theorem for unfolding (inlining) in place
haftmann@22845
   137
    [code inline del]: deselect an equation theorem for unfolding (inlining) in place
haftmann@20453
   138
haftmann@22735
   139
User-defined serializations (target in {SML, OCaml, Haskell}):
haftmann@20453
   140
haftmann@20453
   141
    code_const <and-list of constants (term syntax)>
haftmann@20453
   142
      {(target) <and-list of const target syntax>}+
haftmann@20453
   143
haftmann@20453
   144
    code_type <and-list of type constructors>
haftmann@20453
   145
      {(target) <and-list of type target syntax>}+
haftmann@20453
   146
haftmann@20453
   147
    code_instance <and-list of instances>
haftmann@20453
   148
      {(target)}+
haftmann@20453
   149
        where instance ::= <type constructor> :: <class>
haftmann@20453
   150
haftmann@20453
   151
    code_class <and_list of classes>
haftmann@20453
   152
      {(target) <and-list of class target syntax>}+
haftmann@20453
   153
        where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
haftmann@20453
   154
haftmann@22735
   155
code_instance and code_class only apply to target Haskell.
haftmann@22735
   156
haftmann@22735
   157
See HOL theories and HOL/ex/Codegenerator*.thy for usage examples.
haftmann@22735
   158
Doc/Isar/Advanced/Codegen/ provides a tutorial.
haftmann@20188
   159
wenzelm@19254
   160
* Command 'no_translations' removes translation rules from theory
wenzelm@19254
   161
syntax.
wenzelm@19254
   162
wenzelm@19625
   163
* Overloaded definitions are now actually checked for acyclic
wenzelm@19714
   164
dependencies.  The overloading scheme is slightly more general than
wenzelm@19714
   165
that of Haskell98, although Isabelle does not demand an exact
wenzelm@19714
   166
correspondence to type class and instance declarations.
wenzelm@19714
   167
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
wenzelm@19714
   168
exotic versions of overloading -- at the discretion of the user!
wenzelm@19711
   169
wenzelm@19711
   170
Polymorphic constants are represented via type arguments, i.e. the
wenzelm@19711
   171
instantiation that matches an instance against the most general
wenzelm@19711
   172
declaration given in the signature.  For example, with the declaration
wenzelm@19711
   173
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
wenzelm@19711
   174
as c(nat).  Overloading is essentially simultaneous structural
wenzelm@19711
   175
recursion over such type arguments.  Incomplete specification patterns
wenzelm@19714
   176
impose global constraints on all occurrences, e.g. c('a * 'a) on the
wenzelm@19715
   177
LHS means that more general c('a * 'b) will be disallowed on any RHS.
wenzelm@19714
   178
Command 'print_theory' outputs the normalized system of recursive
wenzelm@19714
   179
equations, see section "definitions".
wenzelm@19625
   180
wenzelm@24086
   181
* Configuration options are maintained within the theory or proof
wenzelm@24086
   182
context (with name and type bool/int/string), providing a very simple
wenzelm@24086
   183
interface to a poor-man's version of general context data.  Tools may
wenzelm@24110
   184
declare options in ML (e.g. using Attrib.config_int) and then refer to
wenzelm@24110
   185
these values using Config.get etc.  Users may change options via an
wenzelm@24110
   186
associated attribute of the same name.  This form of context
wenzelm@24110
   187
declaration works particularly well with commands 'declare' or
wenzelm@24110
   188
'using', for example ``declare [[foo = 42]]''.  Thus it has become
wenzelm@24110
   189
very easy to avoid global references, which would not observe Isar
wenzelm@24110
   190
toplevel undo/redo and fail to work with multithreading.
wenzelm@24086
   191
wenzelm@24172
   192
Various global ML references of Pure and HOL have been turned into
wenzelm@24172
   193
configuration options:
wenzelm@24172
   194
wenzelm@24172
   195
  Unify.search_bound		unify_search_bound
wenzelm@24172
   196
  Unify.trace_bound		unify_trace_bound
wenzelm@24172
   197
  Unify.trace_simp		unify_trace_simp
wenzelm@24172
   198
  Unify.trace_types		unify_trace_types
wenzelm@24172
   199
  Simplifier.simp_depth_limit	simp_depth_limit
wenzelm@24172
   200
  Blast.depth_limit		blast_depth_limit
wenzelm@24172
   201
  DatatypeProp.dtK		datatype_distinctness_limit
wenzelm@24172
   202
  fast_arith_neq_limit  	fast_arith_neq_limit
wenzelm@24172
   203
  fast_arith_split_limit	fast_arith_split_limit
wenzelm@24172
   204
wenzelm@24086
   205
* Named collections of theorems may be easily installed as context
wenzelm@24086
   206
data using the functor NamedThmsFun (see
wenzelm@24086
   207
src/Pure/Tools/named_thms.ML).  The user may add or delete facts via
wenzelm@24110
   208
attributes; there is also a toplevel print command.  This facility is
wenzelm@24110
   209
just a common case of general context data, which is the preferred way
wenzelm@24110
   210
for anything more complex than just a list of facts in canonical
wenzelm@24110
   211
order.
wenzelm@24086
   212
wenzelm@24032
   213
* Isar: command 'declaration' augments a local theory by generic
wenzelm@24032
   214
declaration functions written in ML.  This enables arbitrary content
wenzelm@24032
   215
being added to the context, depending on a morphism that tells the
wenzelm@24032
   216
difference of the original declaration context wrt. the application
wenzelm@24032
   217
context encountered later on.
wenzelm@24032
   218
wenzelm@24032
   219
* Isar: proper interfaces for simplification procedures.  Command
wenzelm@24032
   220
'simproc_setup' declares named simprocs (with match patterns, and body
wenzelm@24032
   221
text in ML).  Attribute "simproc" adds/deletes simprocs in the current
wenzelm@24032
   222
context.  ML antiquotation @{simproc name} retrieves named simprocs.
wenzelm@24032
   223
wenzelm@24032
   224
* Isar: an extra pair of brackets around attribute declarations
wenzelm@24032
   225
abbreviates a theorem reference involving an internal dummy fact,
wenzelm@24032
   226
which will be ignored later --- only the effect of the attribute on
wenzelm@24032
   227
the background context will persist.  This form of in-place
wenzelm@24032
   228
declarations is particularly useful with commands like 'declare' and
wenzelm@24032
   229
'using', for example ``have A using [[simproc a]] by simp''.
wenzelm@24032
   230
wenzelm@23369
   231
* Isar: method "assumption" (and implicit closing of subproofs) now
wenzelm@23369
   232
takes simple non-atomic goal assumptions into account: after applying
wenzelm@23369
   233
an assumption as a rule the resulting subgoals are solved by atomic
wenzelm@23369
   234
assumption steps.  This is particularly useful to finish 'obtain'
wenzelm@23369
   235
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
wenzelm@23369
   236
without referring to the original premise "!!x. P x ==> thesis" in the
wenzelm@23369
   237
Isar proof context.  POTENTIAL INCOMPATIBILITY: method "assumption" is
wenzelm@23369
   238
more permissive.
wenzelm@23369
   239
wenzelm@23369
   240
* Isar: implicit use of prems from the Isar proof context is
wenzelm@23369
   241
considered a legacy feature.  Common applications like ``have A .''
wenzelm@23369
   242
may be replaced by ``have A by fact'' or ``note `A`''.  In general,
wenzelm@23369
   243
referencing facts explicitly here improves readability and
wenzelm@23369
   244
maintainability of proof texts.
wenzelm@23369
   245
wenzelm@17865
   246
* Isar: improper proof element 'guess' is like 'obtain', but derives
wenzelm@17865
   247
the obtained context from the course of reasoning!  For example:
wenzelm@17865
   248
wenzelm@17865
   249
  assume "EX x y. A x & B y"   -- "any previous fact"
wenzelm@17865
   250
  then guess x and y by clarify
wenzelm@17865
   251
wenzelm@17865
   252
This technique is potentially adventurous, depending on the facts and
wenzelm@17865
   253
proof tools being involved here.
wenzelm@17865
   254
wenzelm@18020
   255
* Isar: known facts from the proof context may be specified as literal
wenzelm@18020
   256
propositions, using ASCII back-quote syntax.  This works wherever
wenzelm@18020
   257
named facts used to be allowed so far, in proof commands, proof
wenzelm@18020
   258
methods, attributes etc.  Literal facts are retrieved from the context
wenzelm@18020
   259
according to unification of type and term parameters.  For example,
wenzelm@18020
   260
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
wenzelm@18020
   261
theorems in the current context, then these are valid literal facts:
wenzelm@18020
   262
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
wenzelm@18020
   263
wenzelm@18020
   264
There is also a proof method "fact" which does the same composition
wenzelm@18044
   265
for explicit goal states, e.g. the following proof texts coincide with
wenzelm@18044
   266
certain special cases of literal facts:
wenzelm@18020
   267
wenzelm@18020
   268
  have "A" by fact                 ==  note `A`
wenzelm@18020
   269
  have "A ==> B" by fact           ==  note `A ==> B`
wenzelm@18020
   270
  have "!!x. P x ==> Q x" by fact  ==  note `!!x. P x ==> Q x`
wenzelm@18020
   271
  have "P a ==> Q a" by fact       ==  note `P a ==> Q a`
wenzelm@18020
   272
wenzelm@20118
   273
* Isar: ":" (colon) is no longer a symbolic identifier character in
wenzelm@20118
   274
outer syntax.  Thus symbolic identifiers may be used without
wenzelm@20118
   275
additional white space in declarations like this: ``assume *: A''.
wenzelm@20118
   276
wenzelm@20013
   277
* Isar: 'print_facts' prints all local facts of the current context,
wenzelm@20013
   278
both named and unnamed ones.
wenzelm@20013
   279
wenzelm@18308
   280
* Isar: 'def' now admits simultaneous definitions, e.g.:
wenzelm@18308
   281
wenzelm@18308
   282
  def x == "t" and y == "u"
wenzelm@18308
   283
wenzelm@18540
   284
* Isar: added command 'unfolding', which is structurally similar to
wenzelm@18540
   285
'using', but affects both the goal state and facts by unfolding given
wenzelm@18815
   286
rewrite rules.  Thus many occurrences of the 'unfold' method or
wenzelm@18540
   287
'unfolded' attribute may be replaced by first-class proof text.
wenzelm@18540
   288
wenzelm@18815
   289
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
wenzelm@18815
   290
and command 'unfolding' now all support object-level equalities
wenzelm@18815
   291
(potentially conditional).  The underlying notion of rewrite rule is
wenzelm@18815
   292
analogous to the 'rule_format' attribute, but *not* that of the
wenzelm@18815
   293
Simplifier (which is usually more generous).
wenzelm@18815
   294
kleing@24238
   295
* Isar: the new attribute [rotated n] (default n = 1) rotates the
kleing@24238
   296
premises of a theorem by n. Useful in conjunction with drule.
kleing@24238
   297
wenzelm@19220
   298
* Isar: the goal restriction operator [N] (default N = 1) evaluates a
wenzelm@19220
   299
method expression within a sandbox consisting of the first N
wenzelm@19240
   300
sub-goals, which need to exist.  For example, ``simp_all [3]''
wenzelm@19240
   301
simplifies the first three sub-goals, while (rule foo, simp_all)[]
wenzelm@19240
   302
simplifies all new goals that emerge from applying rule foo to the
wenzelm@19240
   303
originally first one.
wenzelm@19220
   304
wenzelm@19814
   305
* Isar: schematic goals are no longer restricted to higher-order
wenzelm@19814
   306
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
wenzelm@19814
   307
expected.
wenzelm@19814
   308
wenzelm@18901
   309
* Isar: the conclusion of a long theorem statement is now either
wenzelm@18901
   310
'shows' (a simultaneous conjunction, as before), or 'obtains'
wenzelm@18901
   311
(essentially a disjunction of cases with local parameters and
wenzelm@18901
   312
assumptions).  The latter allows to express general elimination rules
wenzelm@18910
   313
adequately; in this notation common elimination rules look like this:
wenzelm@18901
   314
wenzelm@18901
   315
  lemma exE:    -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
wenzelm@18901
   316
    assumes "EX x. P x"
wenzelm@18901
   317
    obtains x where "P x"
wenzelm@18901
   318
wenzelm@18901
   319
  lemma conjE:  -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
wenzelm@18901
   320
    assumes "A & B"
wenzelm@18901
   321
    obtains A and B
wenzelm@18901
   322
wenzelm@18901
   323
  lemma disjE:  -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
wenzelm@18901
   324
    assumes "A | B"
wenzelm@18901
   325
    obtains
wenzelm@18901
   326
      A
wenzelm@18901
   327
    | B
wenzelm@18901
   328
wenzelm@18910
   329
The subsequent classical rules even refer to the formal "thesis"
wenzelm@18901
   330
explicitly:
wenzelm@18901
   331
wenzelm@18901
   332
  lemma classical:     -- "(~ thesis ==> thesis) ==> thesis"
wenzelm@18901
   333
    obtains "~ thesis"
wenzelm@18901
   334
wenzelm@18910
   335
  lemma Peirce's_Law:  -- "((thesis ==> something) ==> thesis) ==> thesis"
wenzelm@18910
   336
    obtains "thesis ==> something"
wenzelm@18901
   337
wenzelm@18901
   338
The actual proof of an 'obtains' statement is analogous to that of the
wenzelm@18910
   339
Isar proof element 'obtain', only that there may be several cases.
wenzelm@18910
   340
Optional case names may be specified in parentheses; these will be
wenzelm@18910
   341
available both in the present proof and as annotations in the
wenzelm@18910
   342
resulting rule, for later use with the 'cases' method (cf. attribute
wenzelm@18910
   343
case_names).
wenzelm@18901
   344
wenzelm@21447
   345
* Isar: the assumptions of a long theorem statement are available as
wenzelm@21447
   346
"assms" fact in the proof context.  This is more appropriate than the
wenzelm@21447
   347
(historical) "prems", which refers to all assumptions of the current
wenzelm@21447
   348
context, including those from the target locale, proof body etc.
wenzelm@21447
   349
wenzelm@19263
   350
* Isar: 'print_statement' prints theorems from the current theory or
wenzelm@19263
   351
proof context in long statement form, according to the syntax of a
wenzelm@19263
   352
top-level lemma.
wenzelm@19263
   353
wenzelm@18901
   354
* Isar: 'obtain' takes an optional case name for the local context
wenzelm@18901
   355
introduction rule (default "that").
wenzelm@18901
   356
wenzelm@19587
   357
* Isar: removed obsolete 'concl is' patterns.  INCOMPATIBILITY, use
wenzelm@19587
   358
explicit (is "_ ==> ?foo") in the rare cases where this still happens
wenzelm@19587
   359
to occur.
wenzelm@19587
   360
wenzelm@19682
   361
* Pure: syntax "CONST name" produces a fully internalized constant
wenzelm@19682
   362
according to the current context.  This is particularly useful for
wenzelm@19682
   363
syntax translations that should refer to internal constant
wenzelm@19682
   364
representations independently of name spaces.
wenzelm@19682
   365
wenzelm@21537
   366
* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
wenzelm@21537
   367
instead of "FOO ". This allows multiple binder declarations to coexist
wenzelm@21537
   368
in the same context.  INCOMPATIBILITY.
wenzelm@21537
   369
wenzelm@21209
   370
* Isar/locales: 'notation' provides a robust interface to the 'syntax'
wenzelm@21209
   371
primitive that also works in a locale context (both for constants and
wenzelm@21209
   372
fixed variables).  Type declaration and internal syntactic
wenzelm@21209
   373
representation of given constants retrieved from the context.
wenzelm@19682
   374
wenzelm@19665
   375
* Isar/locales: new derived specification elements 'axiomatization',
wenzelm@19665
   376
'definition', 'abbreviation', which support type-inference, admit
wenzelm@19083
   377
object-level specifications (equality, equivalence).  See also the
wenzelm@19083
   378
isar-ref manual.  Examples:
wenzelm@19081
   379
wenzelm@19665
   380
  axiomatization
wenzelm@21595
   381
    eq  (infix "===" 50) where
wenzelm@21595
   382
    eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
wenzelm@21595
   383
wenzelm@21595
   384
  definition "f x y = x + y + 1"
wenzelm@21595
   385
  definition g where "g x = f x x"
wenzelm@19081
   386
wenzelm@19363
   387
  abbreviation
wenzelm@21595
   388
    neq  (infix "=!=" 50) where
wenzelm@19363
   389
    "x =!= y == ~ (x === y)"
wenzelm@19081
   390
wenzelm@19083
   391
These specifications may be also used in a locale context.  Then the
wenzelm@19083
   392
constants being introduced depend on certain fixed parameters, and the
wenzelm@19083
   393
constant name is qualified by the locale base name.  An internal
wenzelm@19083
   394
abbreviation takes care for convenient input and output, making the
wenzelm@19088
   395
parameters implicit and using the original short name.  See also
wenzelm@19083
   396
HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
wenzelm@19083
   397
entities from a monomorphic theory.
wenzelm@19083
   398
wenzelm@19083
   399
Presently, abbreviations are only available 'in' a target locale, but
wenzelm@19363
   400
not inherited by general import expressions.  Also note that
wenzelm@19363
   401
'abbreviation' may be used as a type-safe replacement for 'syntax' +
wenzelm@19363
   402
'translations' in common applications.
wenzelm@19084
   403
wenzelm@19682
   404
Concrete syntax is attached to specified constants in internal form,
wenzelm@19682
   405
independently of name spaces.  The parse tree representation is
wenzelm@21209
   406
slightly different -- use 'notation' instead of raw 'syntax', and
wenzelm@19682
   407
'translations' with explicit "CONST" markup to accommodate this.
wenzelm@19665
   408
wenzelm@21735
   409
* Pure: command 'print_abbrevs' prints all constant abbreviations of
wenzelm@21735
   410
the current context.  Print mode "no_abbrevs" prevents inversion of
wenzelm@21735
   411
abbreviations on output.
wenzelm@21735
   412
ballarin@19783
   413
* Isar/locales: improved parameter handling:
ballarin@19783
   414
- use of locales "var" and "struct" no longer necessary;
ballarin@19783
   415
- parameter renamings are no longer required to be injective.
ballarin@19783
   416
  This enables, for example, to define a locale for endomorphisms thus:
ballarin@19783
   417
  locale endom = homom mult mult h.
ballarin@19783
   418
ballarin@19931
   419
* Isar/locales: changed the way locales with predicates are defined.
ballarin@19931
   420
Instead of accumulating the specification, the imported expression is
wenzelm@22126
   421
now an interpretation.  INCOMPATIBILITY: different normal form of
wenzelm@22126
   422
locale expressions.  In particular, in interpretations of locales with
wenzelm@22126
   423
predicates, goals repesenting already interpreted fragments are not
wenzelm@22126
   424
removed automatically.  Use methods `intro_locales' and
wenzelm@22126
   425
`unfold_locales'; see below.
wenzelm@22126
   426
wenzelm@22126
   427
* Isar/locales: new methods `intro_locales' and `unfold_locales'
wenzelm@22126
   428
provide backward reasoning on locales predicates.  The methods are
wenzelm@22126
   429
aware of interpretations and discharge corresponding goals.
wenzelm@22126
   430
`intro_locales' is less aggressive then `unfold_locales' and does not
wenzelm@22126
   431
unfold predicates to assumptions.
ballarin@19931
   432
ballarin@19931
   433
* Isar/locales: the order in which locale fragments are accumulated
wenzelm@22126
   434
has changed.  This enables to override declarations from fragments due
wenzelm@22126
   435
to interpretations -- for example, unwanted simp rules.
ballarin@19931
   436
ballarin@23920
   437
* Isar/locales: interpretation in theories and proof contexts has been
ballarin@23920
   438
extended.  One may now specify (and prove) equations, which are
ballarin@23920
   439
unfolded in interpreted theorems.  This is useful for replacing
ballarin@23920
   440
defined concepts (constants depending on locale parameters) by
ballarin@23920
   441
concepts already existing in the target context.  Example:
ballarin@23920
   442
ballarin@23920
   443
  interpretation partial_order ["op <= :: [int, int] => bool"]
ballarin@23920
   444
    where "partial_order.less (op <=) (x::int) y = (x < y)"
ballarin@23920
   445
ballarin@23977
   446
Typically, the constant `partial_order.less' is created by a definition
ballarin@23977
   447
specification element in the context of locale partial_order.
ballarin@23920
   448
wenzelm@24606
   449
* Provers/induct: improved internal context management to support local
wenzelm@24606
   450
fixes and defines on-the-fly. Thus explicit meta-level connectives !!
wenzelm@24606
   451
and ==> are rarely required anymore in inductive goals (using
wenzelm@24606
   452
object-logic connectives for this purpose has been long obsolete
wenzelm@24606
   453
anyway). Common proof patterns are explained in
wenzelm@24606
   454
HOL/Induct/Common_Patterns.thy, see also HOL/Isar_examples/Puzzle.thy
wenzelm@24606
   455
and src/HOL/Lambda for realistic examples.
wenzelm@24606
   456
wenzelm@24606
   457
* Provers/induct: improved handling of simultaneous goals. Instead of
wenzelm@24606
   458
introducing object-level conjunction, the statement is now split into
wenzelm@24606
   459
several conclusions, while the corresponding symbolic cases are nested
wenzelm@24606
   460
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
wenzelm@24606
   461
see HOL/Induct/Common_Patterns.thy, for example.
wenzelm@24606
   462
wenzelm@24606
   463
* Provers/induct: mutual induction rules are now specified as a list of
wenzelm@24606
   464
rule sharing the same induction cases. HOL packages usually provide
wenzelm@24606
   465
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
wenzelm@24606
   466
sets or datatypes). INCOMPATIBILITY, users need to specify mutual
wenzelm@24606
   467
induction rules differently, i.e. like this:
wenzelm@18506
   468
wenzelm@18506
   469
  (induct rule: foo_bar.inducts)
wenzelm@18506
   470
  (induct set: foo bar)
wenzelm@18506
   471
  (induct type: foo bar)
wenzelm@18506
   472
wenzelm@18506
   473
The ML function ProjectRule.projections turns old-style rules into the
wenzelm@18506
   474
new format.
wenzelm@18506
   475
wenzelm@24606
   476
* Provers/induct: support coinduction as well. See
wenzelm@18399
   477
src/HOL/Library/Coinductive_List.thy for various examples.
wenzelm@18399
   478
wenzelm@20919
   479
* Attribute "symmetric" produces result with standardized schematic
wenzelm@20919
   480
variables (index 0).  Potential INCOMPATIBILITY.
wenzelm@20919
   481
wenzelm@22126
   482
* Simplifier: by default the simplifier trace only shows top level
wenzelm@22126
   483
rewrites now. That is, trace_simp_depth_limit is set to 1 by
wenzelm@22126
   484
default. Thus there is less danger of being flooded by the trace. The
wenzelm@22126
   485
trace indicates where parts have been suppressed.
nipkow@18674
   486
  
wenzelm@18536
   487
* Provers/classical: removed obsolete classical version of elim_format
wenzelm@18536
   488
attribute; classical elim/dest rules are now treated uniformly when
wenzelm@18536
   489
manipulating the claset.
wenzelm@18536
   490
wenzelm@18694
   491
* Provers/classical: stricter checks to ensure that supplied intro,
wenzelm@18694
   492
dest and elim rules are well-formed; dest and elim rules must have at
wenzelm@18694
   493
least one premise.
wenzelm@18694
   494
wenzelm@18694
   495
* Provers/classical: attributes dest/elim/intro take an optional
wenzelm@18695
   496
weight argument for the rule (just as the Pure versions).  Weights are
wenzelm@18696
   497
ignored by automated tools, but determine the search order of single
wenzelm@18694
   498
rule steps.
paulson@18557
   499
wenzelm@18536
   500
* Syntax: input syntax now supports dummy variable binding "%_. b",
wenzelm@18536
   501
where the body does not mention the bound variable.  Note that dummy
wenzelm@18536
   502
patterns implicitly depend on their context of bounds, which makes
wenzelm@18536
   503
"{_. _}" match any set comprehension as expected.  Potential
wenzelm@18536
   504
INCOMPATIBILITY -- parse translations need to cope with syntactic
wenzelm@18536
   505
constant "_idtdummy" in the binding position.
wenzelm@18536
   506
wenzelm@18536
   507
* Syntax: removed obsolete syntactic constant "_K" and its associated
wenzelm@18536
   508
parse translation.  INCOMPATIBILITY -- use dummy abstraction instead,
wenzelm@18536
   509
for example "A -> B" => "Pi A (%_. B)".
wenzelm@17779
   510
wenzelm@20582
   511
* Pure: 'class_deps' command visualizes the subclass relation, using
wenzelm@20582
   512
the graph browser tool.
wenzelm@20582
   513
wenzelm@20620
   514
* Pure: 'print_theory' now suppresses entities with internal name
wenzelm@20620
   515
(trailing "_") by default; use '!' option for full details.
wenzelm@20620
   516
wenzelm@17865
   517
nipkow@17806
   518
*** HOL ***
nipkow@17806
   519
ballarin@24636
   520
* The transitivity reasoner for partial and linear orders is set up for
ballarin@24636
   521
locales `order' and `linorder' generated by the new class package.  Previously
ballarin@24636
   522
the reasoner was only set up for axiomatic type classes.  Instances of the
ballarin@24636
   523
reasoner are available in all contexts importing or interpreting these locales.
ballarin@24636
   524
The following functionality is provided:
ballarin@24636
   525
  - method `order' to invoke the reasoner manually.
ballarin@24636
   526
  - diagnostic command `print_orders' shows which instances of the reasoner are
ballarin@24636
   527
    available in the current context.
ballarin@24636
   528
As previously, the reasoner is integrated with the simplifier as a solver. 
ballarin@24636
   529
haftmann@24422
   530
* Formulation of theorem "dense" changed slightly due to integration with new
haftmann@24422
   531
class dense_linear_order.
haftmann@24422
   532
haftmann@24342
   533
* theory Finite_Set: "name-space" locales Lattice, Distrib_lattice, Linorder etc.
haftmann@24342
   534
have disappeared; operations defined in terms of fold_set now are named
haftmann@24342
   535
Inf_fin, Sup_fin.  INCOMPATIBILITY.
haftmann@24342
   536
kleing@24333
   537
* HOL-Word:
kleing@24333
   538
  New extensive library and type for generic, fixed size machine
kleing@24333
   539
  words, with arithemtic, bit-wise, shifting and rotating operations,
kleing@24333
   540
  reflection into int, nat, and bool lists, automation for linear
kleing@24333
   541
  arithmetic (by automatic reflection into nat or int), including
kleing@24333
   542
  lemmas on overflow and monotonicity. Instantiated to all appropriate
kleing@24333
   543
  arithmetic type classes, supporting automatic simplification of
kleing@24333
   544
  numerals on all operations. Jointly developed by NICTA, Galois, and
kleing@24333
   545
  PSU.
kleing@24333
   546
kleing@24333
   547
* Library/Boolean_Algebra: locales for abstract boolean algebras.
kleing@24333
   548
kleing@24333
   549
* Library/Numeral_Type: numbers as types, e.g. TYPE(32).
kleing@24333
   550
haftmann@23850
   551
* Code generator library theories:
haftmann@23850
   552
  * Pretty_Int represents HOL integers by big integer literals in target
haftmann@23850
   553
    languages.
haftmann@23850
   554
  * Pretty_Char represents HOL characters by character literals in target
haftmann@23850
   555
    languages.
haftmann@23850
   556
  * Pretty_Char_chr like Pretty_Char, but also offers treatment of character
haftmann@23850
   557
    codes; includes Pretty_Int.
haftmann@23850
   558
  * Executable_Set allows to generate code for finite sets using lists.
haftmann@23850
   559
  * Executable_Rat implements rational numbers as triples (sign, enumerator,
haftmann@23850
   560
    denominator).
haftmann@23850
   561
  * Executable_Real implements a subset of real numbers, namly those
haftmann@23850
   562
    representable by rational numbers.
haftmann@23850
   563
  * Efficient_Nat implements natural numbers by integers, which in general will
haftmann@23850
   564
    result in higher efficency; pattern matching with 0/Suc is eliminated;
haftmann@23850
   565
    includes Pretty_Int.
haftmann@23850
   566
  * ML_String provides an additional datatype ml_string; in the HOL default
haftmann@23850
   567
    setup, strings in HOL are mapped to lists of HOL characters in SML; values
haftmann@23850
   568
    of type ml_string are mapped to strings in SML.
haftmann@23850
   569
  * ML_Int provides an additional datatype ml_int which is mapped to to SML
haftmann@23850
   570
    built-in integers.
haftmann@23850
   571
berghofe@23783
   572
* New package for inductive predicates
berghofe@23783
   573
berghofe@23783
   574
  An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
berghofe@23783
   575
berghofe@23783
   576
    inductive
berghofe@23783
   577
      p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
   578
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
   579
    where
berghofe@23783
   580
      rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
berghofe@23783
   581
    | ...
berghofe@23783
   582
berghofe@23783
   583
  rather than
berghofe@23783
   584
berghofe@23783
   585
    consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
   586
berghofe@23783
   587
    abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
   588
    where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
berghofe@23783
   589
berghofe@23783
   590
    inductive "s z_1 ... z_m"
berghofe@23783
   591
    intros
berghofe@23783
   592
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
berghofe@23783
   593
      ...
berghofe@23783
   594
berghofe@23783
   595
  For backward compatibility, there is a wrapper allowing inductive
berghofe@23783
   596
  sets to be defined with the new package via
berghofe@23783
   597
berghofe@23783
   598
    inductive_set
berghofe@23783
   599
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
   600
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
   601
    where
berghofe@23783
   602
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
berghofe@23783
   603
    | ...
berghofe@23783
   604
berghofe@23783
   605
  or
berghofe@23783
   606
berghofe@23783
   607
    inductive_set
berghofe@23783
   608
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
   609
      and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
   610
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
   611
    where
berghofe@23783
   612
      "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
berghofe@23783
   613
    | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
berghofe@23783
   614
    | ...
berghofe@23783
   615
berghofe@23783
   616
  if the additional syntax "p ..." is required.
berghofe@23783
   617
berghofe@23783
   618
  Many examples can be found in the subdirectories Auth, Bali, Induct,
berghofe@23783
   619
  or MicroJava.
berghofe@23783
   620
berghofe@23783
   621
  INCOMPATIBILITIES:
berghofe@23783
   622
berghofe@23783
   623
  - Since declaration and definition of inductive sets or predicates
berghofe@23783
   624
    is no longer separated, abbreviations involving the newly introduced
berghofe@23783
   625
    sets or predicates must be specified together with the introduction
berghofe@23783
   626
    rules after the "where" keyword (see example above), rather than before
berghofe@23783
   627
    the actual inductive definition.
berghofe@23783
   628
berghofe@23783
   629
  - The variables in induction and elimination rules are now quantified
berghofe@23783
   630
    in the order of their occurrence in the introduction rules, rather than
berghofe@23783
   631
    in alphabetical order. Since this may break some proofs, these proofs
berghofe@23783
   632
    either have to be repaired, e.g. by reordering the variables
berghofe@23783
   633
    a_i_1 ... a_i_{k_i} in Isar "case" statements of the form
berghofe@23783
   634
berghofe@23783
   635
      case (rule_i a_i_1 ... a_i_{k_i})
berghofe@23783
   636
berghofe@23783
   637
    or the old order of quantification has to be restored by explicitly adding
berghofe@23783
   638
    meta-level quantifiers in the introduction rules, i.e.
berghofe@23783
   639
berghofe@23783
   640
      | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
berghofe@23783
   641
berghofe@23783
   642
  - The format of the elimination rules is now
berghofe@23783
   643
berghofe@23783
   644
      p z_1 ... z_m x_1 ... x_n ==>
berghofe@23783
   645
        (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
berghofe@23783
   646
        ==> ... ==> P
berghofe@23783
   647
berghofe@23783
   648
    for predicates and
berghofe@23783
   649
berghofe@23783
   650
      (x_1, ..., x_n) : s z_1 ... z_m ==>
berghofe@23783
   651
        (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
berghofe@23783
   652
        ==> ... ==> P
berghofe@23783
   653
berghofe@23783
   654
    for sets rather than
berghofe@23783
   655
berghofe@23783
   656
      x : s z_1 ... z_m ==>
berghofe@23783
   657
        (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
berghofe@23783
   658
        ==> ... ==> P
berghofe@23783
   659
berghofe@23783
   660
    This may require terms in goals to be expanded to n-tuples (e.g. using case_tac
berghofe@23783
   661
    or simplification with the split_paired_all rule) before the above elimination
berghofe@23783
   662
    rule is applicable.
berghofe@23783
   663
berghofe@23783
   664
  - The elimination or case analysis rules for (mutually) inductive sets or
berghofe@23783
   665
    predicates are now called "p_1.cases" ... "p_k.cases". The list of rules
berghofe@23783
   666
    "p_1_..._p_k.elims" is no longer available.
berghofe@23783
   667
wenzelm@23562
   668
* Method "metis" proves goals by applying the Metis general-purpose
wenzelm@23562
   669
resolution prover.  Examples are in the directory MetisExamples.  See
wenzelm@23562
   670
also http://gilith.com/software/metis/
paulson@23449
   671
  
wenzelm@23562
   672
* Command 'sledgehammer' invokes external automatic theorem provers as
wenzelm@23562
   673
background processes.  It generates calls to the "metis" method if
wenzelm@23562
   674
successful. These can be pasted into the proof.  Users do not have to
wenzelm@23562
   675
wait for the automatic provers to return.
paulson@23449
   676
nipkow@23564
   677
* Case-expressions allow arbitrary constructor-patterns (including "_") and
nipkow@23565
   678
  take their order into account, like in functional programming.
nipkow@23564
   679
  Internally, this is translated into nested case-expressions; missing cases
nipkow@23564
   680
  are added and mapped to the predefined constant "undefined". In complicated
nipkow@23564
   681
  cases printing may no longer show the original input but the internal
nipkow@23565
   682
  form. Lambda-abstractions allow the same form of pattern matching:
nipkow@23564
   683
  "% pat1 => e1 | ..." is an abbreviation for
nipkow@23564
   684
  "%x. case x of pat1 => e1 | ..." where x is a new variable.
nipkow@23564
   685
huffman@23468
   686
* IntDef: The constant "int :: nat => int" has been removed; now "int"
huffman@23468
   687
  is an abbreviation for "of_nat :: nat => int". The simplification rules
huffman@23468
   688
  for "of_nat" have been changed to work like "int" did previously.
huffman@23468
   689
  (potential INCOMPATIBILITY)
huffman@23468
   690
  - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
huffman@23468
   691
  - of_nat_diff and of_nat_mult are no longer default simp rules
huffman@23377
   692
chaieb@23295
   693
* Method "algebra" solves polynomial equations over (semi)rings using
chaieb@23295
   694
  Groebner bases. The (semi)ring structure is defined by locales and
chaieb@23295
   695
  the tool setup depends on that generic context. Installing the
chaieb@23295
   696
  method for a specific type involves instantiating the locale and
chaieb@23295
   697
  possibly adding declarations for computation on the coefficients.
chaieb@23295
   698
  The method is already instantiated for natural numbers and for the
chaieb@23295
   699
  axiomatic class of idoms with numerals.  See also the paper by
chaieb@23295
   700
  Chaieb and Wenzel at CALCULEMUS 2007 for the general principles
chaieb@23295
   701
  underlying this architecture of context-aware proof-tools.
chaieb@23295
   702
haftmann@23029
   703
* constant "List.op @" now named "List.append".  Use ML antiquotations
haftmann@23029
   704
@{const_name List.append} or @{term " ... @ ... "} to circumvent
haftmann@23029
   705
possible incompatibilities when working on ML level.
haftmann@23029
   706
haftmann@22997
   707
* Constant renames due to introduction of canonical name prefixing for
haftmann@22997
   708
  class package:
haftmann@22997
   709
haftmann@22997
   710
    HOL.abs ~> HOL.minus_class.abs
haftmann@22997
   711
    HOL.divide ~> HOL.divide_class.divide
haftmann@22997
   712
    Nat.power ~> Nat.power_class.power
haftmann@22997
   713
    Nat.size ~> Nat.size_class.size
haftmann@22997
   714
    Numeral.number_of ~> Numeral.number_class.number_of
haftmann@23129
   715
    FixedPoint.Inf ~> FixedPoint.complete_lattice_class.Inf
haftmann@24342
   716
    FixedPoint.Sup ~> FixedPoint.complete_lattice_class.Sup
haftmann@23129
   717
haftmann@23180
   718
* Rudimentary class target mechanism involves constant renames:
haftmann@23129
   719
haftmann@23129
   720
    Orderings.min ~> Orderings.ord_class.min
haftmann@23129
   721
    Orderings.max ~> Orderings.ord_class.max
haftmann@22997
   722
nipkow@23564
   723
* primrec: missing cases mapped to "undefined" instead of "arbitrary"
haftmann@22845
   724
haftmann@22845
   725
* new constant "undefined" with axiom "undefined x = undefined"
haftmann@22845
   726
haftmann@22845
   727
* new class "default" with associated constant "default"
haftmann@22845
   728
nipkow@23104
   729
* new function listsum :: 'a list => 'a for arbitrary monoids.
nipkow@23104
   730
  Special syntax: "SUM x <- xs. f x" (and latex variants)
nipkow@23104
   731
nipkow@23210
   732
* new (input only) syntax for Haskell-like list comprehension, eg
nipkow@23210
   733
  [(x,y). x <- xs, y <- ys, x ~= y]
nipkow@23210
   734
  For details see List.thy.
nipkow@23102
   735
nipkow@23300
   736
* The special syntax for function "filter" has changed from [x : xs. P] to
nipkow@23300
   737
  [x <- xs. P] to avoid an ambiguity caused by list comprehension syntax,
nipkow@23300
   738
  and for uniformity. INCOMPATIBILITY
nipkow@23300
   739
krauss@23971
   740
* Lemma "set_take_whileD" renamed to "set_takeWhileD"
krauss@23971
   741
nipkow@24627
   742
* new functions sorted and sort in List.
nipkow@24627
   743
nipkow@24507
   744
* function "sgn" is now overloaded and available on int, real, complex
nipkow@24507
   745
  (and other numeric types).
nipkow@24507
   746
  The details: new class "sgn" with function "sgn";
nipkow@24507
   747
  two possible defs of sgn in the classes sgn_if and sgn_div_norm
nipkow@24507
   748
  (as equational assumptions);
nipkow@24507
   749
  ordered_idom now also inherits from sgn_if - INCOMPATIBILITY.
nipkow@24492
   750
nipkow@23480
   751
* New lemma collection field_simps (an extension of ring_simps)
nipkow@23480
   752
  for manipulating (in)equations involving division. Multiplies
nipkow@23481
   753
  with all denominators that can be proved to be non-zero (in equations)
nipkow@23480
   754
  or positive/negative (in inequations).
nipkow@23480
   755
nipkow@23480
   756
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
nipkow@23478
   757
  have been improved and renamed to ring_simps, group_simps and ring_distribs.
nipkow@23509
   758
  Removed lemmas field_xyz in Ring_and_Field
nipkow@23509
   759
  because they were subsumed by lemmas xyz.
nipkow@23509
   760
INCOMPATIBILITY.
nipkow@23478
   761
haftmann@22799
   762
* Library/Pretty_Int.thy: maps HOL numerals on target language integer literals
nipkow@23480
   763
  when generating code.
haftmann@22799
   764
haftmann@22799
   765
* Library/Pretty_Char.thy: maps HOL characters on target language character literals
nipkow@23480
   766
  when generating code.
haftmann@22799
   767
haftmann@22735
   768
* Library/Commutative_Ring.thy: switched from recdef to function package;
nipkow@23480
   769
  constants add, mul, pow now curried.  Infix syntax for algebraic operations.
haftmann@22735
   770
haftmann@22450
   771
* Some steps towards more uniform lattice theory development in HOL.
haftmann@22422
   772
haftmann@22422
   773
    constants "meet" and "join" now named "inf" and "sup"
haftmann@22422
   774
    constant "Meet" now named "Inf"
haftmann@22422
   775
haftmann@22450
   776
    classes "meet_semilorder" and "join_semilorder" now named
haftmann@22450
   777
      "lower_semilattice" and "upper_semilattice"
haftmann@22450
   778
    class "lorder" now named "lattice"
haftmann@22450
   779
    class "comp_lat" now named "complete_lattice"
haftmann@22450
   780
haftmann@22450
   781
    Instantiation of lattice classes allows explicit definitions
haftmann@24342
   782
    for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
haftmann@22450
   783
haftmann@23129
   784
  INCOMPATIBILITY.  Theorem renames:
haftmann@22450
   785
haftmann@22422
   786
    meet_left_le            ~> inf_le1
haftmann@22422
   787
    meet_right_le           ~> inf_le2
haftmann@22422
   788
    join_left_le            ~> sup_ge1
haftmann@22422
   789
    join_right_le           ~> sup_ge2
haftmann@22422
   790
    meet_join_le            ~> inf_sup_ord
haftmann@22422
   791
    le_meetI                ~> le_infI
haftmann@22422
   792
    join_leI                ~> le_supI
haftmann@22422
   793
    le_meet                 ~> le_inf_iff
haftmann@22422
   794
    le_join                 ~> ge_sup_conv
haftmann@22422
   795
    meet_idempotent         ~> inf_idem
haftmann@22422
   796
    join_idempotent         ~> sup_idem
haftmann@22422
   797
    meet_comm               ~> inf_commute
haftmann@22422
   798
    join_comm               ~> sup_commute
haftmann@22422
   799
    meet_leI1               ~> le_infI1
haftmann@22422
   800
    meet_leI2               ~> le_infI2
haftmann@22422
   801
    le_joinI1               ~> le_supI1
haftmann@22422
   802
    le_joinI2               ~> le_supI2
haftmann@22422
   803
    meet_assoc              ~> inf_assoc
haftmann@22422
   804
    join_assoc              ~> sup_assoc
haftmann@22422
   805
    meet_left_comm          ~> inf_left_commute
haftmann@22422
   806
    meet_left_idempotent    ~> inf_left_idem
haftmann@22422
   807
    join_left_comm          ~> sup_left_commute
haftmann@22422
   808
    join_left_idempotent    ~> sup_left_idem
haftmann@22422
   809
    meet_aci                ~> inf_aci
haftmann@22422
   810
    join_aci                ~> sup_aci
haftmann@22422
   811
    le_def_meet             ~> le_iff_inf
haftmann@22422
   812
    le_def_join             ~> le_iff_sup
haftmann@22422
   813
    join_absorp2            ~> sup_absorb2
haftmann@22422
   814
    join_absorp1            ~> sup_absorb1
haftmann@22422
   815
    meet_absorp1            ~> inf_absorb1
haftmann@22422
   816
    meet_absorp2            ~> inf_absorb2
haftmann@22422
   817
    meet_join_absorp        ~> inf_sup_absorb
haftmann@22422
   818
    join_meet_absorp        ~> sup_inf_absorb
haftmann@22422
   819
    distrib_join_le         ~> distrib_sup_le
haftmann@22422
   820
    distrib_meet_le         ~> distrib_inf_le
haftmann@22422
   821
haftmann@22422
   822
    add_meet_distrib_left   ~> add_inf_distrib_left
haftmann@22422
   823
    add_join_distrib_left   ~> add_sup_distrib_left
haftmann@22422
   824
    is_join_neg_meet        ~> is_join_neg_inf
haftmann@22422
   825
    is_meet_neg_join        ~> is_meet_neg_sup
haftmann@22422
   826
    add_meet_distrib_right  ~> add_inf_distrib_right
haftmann@22422
   827
    add_join_distrib_right  ~> add_sup_distrib_right
haftmann@22422
   828
    add_meet_join_distribs  ~> add_sup_inf_distribs
haftmann@22422
   829
    join_eq_neg_meet        ~> sup_eq_neg_inf
haftmann@22422
   830
    meet_eq_neg_join        ~> inf_eq_neg_sup
haftmann@22422
   831
    add_eq_meet_join        ~> add_eq_inf_sup
haftmann@22422
   832
    meet_0_imp_0            ~> inf_0_imp_0
haftmann@22422
   833
    join_0_imp_0            ~> sup_0_imp_0
haftmann@22422
   834
    meet_0_eq_0             ~> inf_0_eq_0
haftmann@22422
   835
    join_0_eq_0             ~> sup_0_eq_0
haftmann@22422
   836
    neg_meet_eq_join        ~> neg_inf_eq_sup
haftmann@22422
   837
    neg_join_eq_meet        ~> neg_sup_eq_inf
haftmann@22422
   838
    join_eq_if              ~> sup_eq_if
haftmann@22422
   839
haftmann@22422
   840
    mono_meet               ~> mono_inf
haftmann@22422
   841
    mono_join               ~> mono_sup
haftmann@22422
   842
    meet_bool_eq            ~> inf_bool_eq
haftmann@22422
   843
    join_bool_eq            ~> sup_bool_eq
haftmann@22422
   844
    meet_fun_eq             ~> inf_fun_eq
haftmann@22422
   845
    join_fun_eq             ~> sup_fun_eq
haftmann@22422
   846
    meet_set_eq             ~> inf_set_eq
haftmann@22422
   847
    join_set_eq             ~> sup_set_eq
haftmann@22422
   848
    meet1_iff               ~> inf1_iff
haftmann@22422
   849
    meet2_iff               ~> inf2_iff
haftmann@22422
   850
    meet1I                  ~> inf1I
haftmann@22422
   851
    meet2I                  ~> inf2I
haftmann@22422
   852
    meet1D1                 ~> inf1D1
haftmann@22422
   853
    meet2D1                 ~> inf2D1
haftmann@22422
   854
    meet1D2                 ~> inf1D2
haftmann@22422
   855
    meet2D2                 ~> inf2D2
haftmann@22422
   856
    meet1E                  ~> inf1E
haftmann@22422
   857
    meet2E                  ~> inf2E
haftmann@22422
   858
    join1_iff               ~> sup1_iff
haftmann@22422
   859
    join2_iff               ~> sup2_iff
haftmann@22422
   860
    join1I1                 ~> sup1I1
haftmann@22422
   861
    join2I1                 ~> sup2I1
haftmann@22422
   862
    join1I1                 ~> sup1I1
haftmann@22422
   863
    join2I2                 ~> sup1I2
haftmann@22422
   864
    join1CI                 ~> sup1CI
haftmann@22422
   865
    join2CI                 ~> sup2CI
haftmann@22422
   866
    join1E                  ~> sup1E
haftmann@22422
   867
    join2E                  ~> sup2E
haftmann@22422
   868
haftmann@22422
   869
    is_meet_Meet            ~> is_meet_Inf
haftmann@22422
   870
    Meet_bool_def           ~> Inf_bool_def
haftmann@22422
   871
    Meet_fun_def            ~> Inf_fun_def
haftmann@22422
   872
    Meet_greatest           ~> Inf_greatest
haftmann@22422
   873
    Meet_lower              ~> Inf_lower
haftmann@22422
   874
    Meet_set_def            ~> Inf_set_def
haftmann@22422
   875
haftmann@24342
   876
    Sup_def                 ~> Sup_Inf
haftmann@24342
   877
    Sup_bool_eq             ~> Sup_bool_def
haftmann@24342
   878
    Sup_fun_eq              ~> Sup_fun_def
haftmann@24342
   879
    Sup_set_eq              ~> Sup_set_def
haftmann@24342
   880
haftmann@22422
   881
    listsp_meetI            ~> listsp_infI
haftmann@22422
   882
    listsp_meet_eq          ~> listsp_inf_eq
haftmann@22422
   883
haftmann@22450
   884
    meet_min                ~> inf_min
haftmann@22450
   885
    join_max                ~> sup_max
haftmann@22450
   886
haftmann@22845
   887
* Classes "order" and "linorder": facts "refl", "trans" and
haftmann@22384
   888
"cases" renamed ro "order_refl", "order_trans" and "linorder_cases", to
haftmann@22384
   889
avoid clashes with HOL "refl" and "trans". INCOMPATIBILITY.
haftmann@22384
   890
haftmann@22845
   891
* Classes "order" and "linorder": 
haftmann@22316
   892
potential INCOMPATIBILITY: order of proof goals in order/linorder instance
haftmann@22316
   893
proofs changed.
haftmann@22316
   894
haftmann@22218
   895
* Dropped lemma duplicate def_imp_eq in favor of meta_eq_to_obj_eq.
haftmann@22218
   896
INCOMPATIBILITY.
haftmann@22218
   897
haftmann@22218
   898
* Dropped lemma duplicate if_def2 in favor of if_bool_eq_conj.
haftmann@22218
   899
INCOMPATIBILITY.
haftmann@22218
   900
wenzelm@22126
   901
* Added syntactic class "size"; overloaded constant "size" now has
wenzelm@22126
   902
type "'a::size ==> bool"
wenzelm@22126
   903
wenzelm@22126
   904
* Renamed constants "Divides.op div", "Divides.op mod" and "Divides.op
haftmann@22997
   905
dvd" to "Divides.div_class.div", "Divides.div_class.mod" and "Divides.dvd". INCOMPATIBILITY.
wenzelm@22126
   906
wenzelm@22126
   907
* Added method "lexicographic_order" automatically synthesizes
wenzelm@22126
   908
termination relations as lexicographic combinations of size measures
wenzelm@22126
   909
-- 'function' package.
wenzelm@22126
   910
wenzelm@22126
   911
* HOL/records: generalised field-update to take a function on the
wenzelm@22126
   912
field rather than the new value: r(|A := x|) is translated to A_update
wenzelm@22126
   913
(K x) r The K-combinator that is internally used is called K_record.
schirmer@21226
   914
INCOMPATIBILITY: Usage of the plain update functions has to be
schirmer@21226
   915
adapted.
schirmer@21226
   916
 
wenzelm@22126
   917
* axclass "semiring_0" now contains annihilation axioms x * 0 = 0 and
wenzelm@22126
   918
0 * x = 0, which are required for a semiring.  Richer structures do
wenzelm@22126
   919
not inherit from semiring_0 anymore, because this property is a
wenzelm@22126
   920
theorem there, not an axiom.  INCOMPATIBILITY: In instances of
wenzelm@22126
   921
semiring_0, there is more to prove, but this is mostly trivial.
wenzelm@22126
   922
wenzelm@22126
   923
* axclass "recpower" was generalized to arbitrary monoids, not just
wenzelm@22126
   924
commutative semirings.  INCOMPATIBILITY: If you use recpower and need
wenzelm@22126
   925
commutativity or a semiring property, add the corresponding classes.
wenzelm@22126
   926
wenzelm@22126
   927
* Unified locale partial_order with class definition (cf. theory
wenzelm@22126
   928
Orderings), added parameter ``less''.  INCOMPATIBILITY.
haftmann@21215
   929
haftmann@21099
   930
* Constant "List.list_all2" in List.thy now uses authentic syntax.
wenzelm@22126
   931
INCOMPATIBILITY: translations containing list_all2 may go wrong.  On
wenzelm@22126
   932
Isar level, use abbreviations instead.
wenzelm@22126
   933
wenzelm@22126
   934
* Renamed constant "List.op mem" to "List.memberl" INCOMPATIBILITY:
wenzelm@22126
   935
rarely occuring name references (e.g. ``List.op mem.simps'') require
wenzelm@22126
   936
renaming (e.g. ``List.memberl.simps'').
wenzelm@22126
   937
haftmann@22997
   938
* Renamed constants "0" to "HOL.zero_class.zero" and "1" to "HOL.one_class.one".
wenzelm@22126
   939
INCOMPATIBILITY.
wenzelm@22126
   940
haftmann@23251
   941
* Added class "HOL.eq", allowing for code generation with polymorphic equality.
wenzelm@22126
   942
wenzelm@22126
   943
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has
wenzelm@22126
   944
been abandoned in favour of plain 'int'. INCOMPATIBILITY --
wenzelm@22126
   945
significant changes for setting up numeral syntax for types:
haftmann@20485
   946
haftmann@20485
   947
  - new constants Numeral.pred and Numeral.succ instead
haftmann@20485
   948
      of former Numeral.bin_pred and Numeral.bin_succ.
haftmann@20485
   949
  - Use integer operations instead of bin_add, bin_mult and so on.
haftmann@20485
   950
  - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
haftmann@20485
   951
  - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
haftmann@20485
   952
haftmann@20485
   953
See HOL/Integ/IntArith.thy for an example setup.
haftmann@20485
   954
wenzelm@22126
   955
* New top level command 'normal_form' computes the normal form of a
wenzelm@22126
   956
term that may contain free variables. For example ``normal_form
wenzelm@22126
   957
"rev[a,b,c]"'' produces ``[b,c,a]'' (without proof).  This command is
wenzelm@22126
   958
suitable for heavy-duty computations because the functions are
wenzelm@22126
   959
compiled to ML first.
nipkow@19895
   960
wenzelm@17996
   961
* Alternative iff syntax "A <-> B" for equality on bool (with priority
wenzelm@17996
   962
25 like -->); output depends on the "iff" print_mode, the default is
wenzelm@17996
   963
"A = B" (with priority 50).
wenzelm@17996
   964
ballarin@19279
   965
* Renamed constants in HOL.thy and Orderings.thy:
haftmann@22997
   966
    op +   ~> HOL.plus_class.plus
haftmann@22997
   967
    op -   ~> HOL.minus_class.minus
haftmann@22997
   968
    uminus ~> HOL.minus_class.uminus
haftmann@23881
   969
    abs    ~> HOL.abs_class.abs
haftmann@22997
   970
    op *   ~> HOL.times_class.times
haftmann@23881
   971
    op <   ~> HOL.ord_class.less
haftmann@23881
   972
    op <=  ~> HOL.ord_class.less_eq
haftmann@19233
   973
haftmann@19233
   974
Adaptions may be required in the following cases:
haftmann@19233
   975
nipkow@19377
   976
a) User-defined constants using any of the names "plus", "minus", "times",
nipkow@19377
   977
"less" or "less_eq". The standard syntax translations for "+", "-" and "*"
nipkow@19377
   978
may go wrong.
haftmann@19233
   979
INCOMPATIBILITY: use more specific names.
haftmann@19233
   980
haftmann@19277
   981
b) Variables named "plus", "minus", "times", "less", "less_eq"
haftmann@19233
   982
INCOMPATIBILITY: use more specific names.
haftmann@19233
   983
nipkow@19377
   984
c) Permutative equations (e.g. "a + b = b + a")
nipkow@19377
   985
Since the change of names also changes the order of terms, permutative
nipkow@19377
   986
rewrite rules may get applied in a different order. Experience shows that
nipkow@19377
   987
this is rarely the case (only two adaptions in the whole Isabelle
nipkow@19377
   988
distribution).
nipkow@19377
   989
INCOMPATIBILITY: rewrite proofs
haftmann@19233
   990
haftmann@19233
   991
d) ML code directly refering to constant names
haftmann@19233
   992
This in general only affects hand-written proof tactics, simprocs and so on.
haftmann@22997
   993
INCOMPATIBILITY: grep your sourcecode and replace names.  Consider use
haftmann@22997
   994
of const_name ML antiquotations.
haftmann@19233
   995
wenzelm@21265
   996
* Relations less (<) and less_eq (<=) are also available on type bool.
wenzelm@21265
   997
Modified syntax to disallow nesting without explicit parentheses,
wenzelm@21265
   998
e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z".
wenzelm@21265
   999
nipkow@18674
  1000
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
nipkow@18674
  1001
krauss@20716
  1002
* Relation composition operator "op O" now has precedence 75 and binds
krauss@20716
  1003
stronger than union and intersection. INCOMPATIBILITY.
krauss@20716
  1004
wenzelm@22126
  1005
* The old set interval syntax "{m..n(}" (and relatives) has been
wenzelm@22126
  1006
removed.  Use "{m..<n}" (and relatives) instead.
nipkow@19377
  1007
wenzelm@17865
  1008
* In the context of the assumption "~(s = t)" the Simplifier rewrites
wenzelm@17865
  1009
"t = s" to False (by simproc "neq_simproc").  For backward
wenzelm@17865
  1010
compatibility this can be disabled by ML "reset use_neq_simproc".
wenzelm@17779
  1011
wenzelm@22126
  1012
* "m dvd n" where m and n are numbers is evaluated to True/False by
wenzelm@22126
  1013
simp.
wenzelm@22126
  1014
wenzelm@22126
  1015
* Theorem Cons_eq_map_conv no longer declared as ``simp''.
nipkow@19211
  1016
ballarin@19279
  1017
* Theorem setsum_mult renamed to setsum_right_distrib.
ballarin@19279
  1018
nipkow@19211
  1019
* Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
wenzelm@22126
  1020
``rule'' method.
wenzelm@22126
  1021
wenzelm@22126
  1022
* Reimplemented methods ``sat'' and ``satx'', with several
wenzelm@22126
  1023
improvements: goals no longer need to be stated as "<prems> ==>
wenzelm@22126
  1024
False", equivalences (i.e. "=" on type bool) are handled, variable
wenzelm@22126
  1025
names of the form "lit_<n>" are no longer reserved, significant
wenzelm@22126
  1026
speedup.
wenzelm@22126
  1027
wenzelm@22126
  1028
* Methods ``sat'' and ``satx'' can now replay MiniSat proof traces.
wenzelm@22126
  1029
zChaff is still supported as well.
wenzelm@22126
  1030
wenzelm@22126
  1031
* 'inductive' and 'datatype': provide projections of mutual rules,
wenzelm@22126
  1032
bundled as foo_bar.inducts;
wenzelm@22126
  1033
wenzelm@22126
  1034
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to
wenzelm@22126
  1035
Library.
wenzelm@21256
  1036
wenzelm@21256
  1037
* Library: moved theory Accessible_Part to main HOL.
wenzelm@19572
  1038
wenzelm@18446
  1039
* Library: added theory Coinductive_List of potentially infinite lists
wenzelm@18446
  1040
as greatest fixed-point.
wenzelm@18399
  1041
wenzelm@19254
  1042
* Library: added theory AssocList which implements (finite) maps as
schirmer@19252
  1043
association lists.
webertj@17809
  1044
wenzelm@22126
  1045
* Added proof method ``evaluation'' for efficiently solving a goal
wenzelm@22126
  1046
(i.e. a boolean expression) by compiling it to ML. The goal is
wenzelm@22126
  1047
"proved" (via an oracle) if it evaluates to True.
wenzelm@20807
  1048
wenzelm@20807
  1049
* Linear arithmetic now splits certain operators (e.g. min, max, abs)
wenzelm@20807
  1050
also when invoked by the simplifier.  This results in the simplifier
haftmann@21056
  1051
being more powerful on arithmetic goals.  INCOMPATIBILITY.  Set
wenzelm@20807
  1052
fast_arith_split_limit to 0 to obtain the old behavior.
webertj@20217
  1053
wenzelm@22126
  1054
* Support for hex (0x20) and binary (0b1001) numerals.
wenzelm@19254
  1055
wenzelm@20807
  1056
* New method: reify eqs (t), where eqs are equations for an
wenzelm@20807
  1057
interpretation I :: 'a list => 'b => 'c and t::'c is an optional
wenzelm@20807
  1058
parameter, computes a term s::'b and a list xs::'a list and proves the
wenzelm@20807
  1059
theorem I xs s = t. This is also known as reification or quoting. The
wenzelm@20807
  1060
resulting theorem is applied to the subgoal to substitute t with I xs
wenzelm@20807
  1061
s.  If t is omitted, the subgoal itself is reified.
wenzelm@20807
  1062
wenzelm@20807
  1063
* New method: reflection corr_thm eqs (t). The parameters eqs and (t)
wenzelm@20807
  1064
are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
wenzelm@20807
  1065
where f is supposed to be a computable function (in the sense of code
wenzelm@20807
  1066
generattion). The method uses reify to compute s and xs as above then
wenzelm@20807
  1067
applies corr_thm and uses normalization by evaluation to "prove" f s =
wenzelm@20807
  1068
r and finally gets the theorem t = r, which is again applied to the
wenzelm@20807
  1069
subgoal. An Example is available in HOL/ex/ReflectionEx.thy.
wenzelm@20807
  1070
haftmann@23881
  1071
* Reflection: Automatic reification now handels binding, an example
wenzelm@20807
  1072
is available in HOL/ex/ReflectionEx.thy
wenzelm@20807
  1073
wenzelm@20807
  1074
ballarin@20169
  1075
*** HOL-Algebra ***
ballarin@20169
  1076
wenzelm@21170
  1077
* Formalisation of ideals and the quotient construction over rings.
wenzelm@21170
  1078
wenzelm@21170
  1079
* Order and lattice theory no longer based on records.
wenzelm@21170
  1080
INCOMPATIBILITY.
wenzelm@21170
  1081
wenzelm@22126
  1082
* Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
wenzelm@22126
  1083
greatest_closed.  INCOMPATIBILITY.
ballarin@21896
  1084
wenzelm@21170
  1085
* Method algebra is now set up via an attribute.  For examples see
ballarin@21896
  1086
Ring.thy.  INCOMPATIBILITY: the method is now weaker on combinations
wenzelm@21170
  1087
of algebraic structures.
ballarin@20318
  1088
wenzelm@22126
  1089
* Renamed theory CRing to Ring.
ballarin@20169
  1090
wenzelm@20807
  1091
wenzelm@19653
  1092
*** HOL-Complex ***
wenzelm@19653
  1093
wenzelm@19653
  1094
* Theory Real: new method ferrack implements quantifier elimination
wenzelm@19653
  1095
for linear arithmetic over the reals. The quantifier elimination
wenzelm@19653
  1096
feature is used only for decision, for compatibility with arith. This
wenzelm@19653
  1097
means a goal is either solved or left unchanged, no simplification.
wenzelm@19653
  1098
huffman@22971
  1099
* Hyperreal: Functions root and sqrt are now defined on negative real
huffman@22971
  1100
inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
huffman@22971
  1101
Nonnegativity side conditions have been removed from many lemmas, so
huffman@22971
  1102
that more subgoals may now be solved by simplification; potential
huffman@22971
  1103
INCOMPATIBILITY.
huffman@22971
  1104
huffman@21791
  1105
* Real: New axiomatic classes formalize real normed vector spaces and
huffman@21791
  1106
algebras, using new overloaded constants scaleR :: real => 'a => 'a
huffman@21791
  1107
and norm :: 'a => real.
huffman@21791
  1108
wenzelm@22126
  1109
* Real: New constant of_real :: real => 'a::real_algebra_1 injects
wenzelm@22126
  1110
from reals into other types. The overloaded constant Reals :: 'a set
wenzelm@22126
  1111
is now defined as range of_real; potential INCOMPATIBILITY.
wenzelm@22126
  1112
nipkow@23013
  1113
* Real: ML code generation is supported now and hence also quickcheck.
nipkow@23013
  1114
Reals are implemented as arbitrary precision rationals.
nipkow@23013
  1115
wenzelm@22126
  1116
* Hyperreal: Several constants that previously worked only for the
wenzelm@22126
  1117
reals have been generalized, so they now work over arbitrary vector
wenzelm@22126
  1118
spaces. Type annotations may need to be added in some cases; potential
wenzelm@22126
  1119
INCOMPATIBILITY.
huffman@21791
  1120
huffman@22972
  1121
  Infinitesimal  :: ('a::real_normed_vector) star set
huffman@22972
  1122
  HFinite        :: ('a::real_normed_vector) star set
huffman@22972
  1123
  HInfinite      :: ('a::real_normed_vector) star set
huffman@21791
  1124
  approx         :: ('a::real_normed_vector) star => 'a star => bool
huffman@21791
  1125
  monad          :: ('a::real_normed_vector) star => 'a star set
huffman@21791
  1126
  galaxy         :: ('a::real_normed_vector) star => 'a star set
huffman@22972
  1127
  (NS)LIMSEQ     :: [nat => 'a::real_normed_vector, 'a] => bool
huffman@21791
  1128
  (NS)convergent :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  1129
  (NS)Bseq       :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  1130
  (NS)Cauchy     :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  1131
  (NS)LIM        :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
huffman@21791
  1132
  is(NS)Cont     :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
huffman@21791
  1133
  deriv          :: ['a::real_normed_field => 'a, 'a, 'a] => bool
huffman@22972
  1134
  sgn            :: 'a::real_normed_vector => 'a
huffman@23116
  1135
  exp            :: 'a::{recpower,real_normed_field,banach} => 'a
huffman@21791
  1136
huffman@21791
  1137
* Complex: Some complex-specific constants are now abbreviations for
wenzelm@22126
  1138
overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
wenzelm@22126
  1139
hnorm.  Other constants have been entirely removed in favor of the
wenzelm@22126
  1140
polymorphic versions (INCOMPATIBILITY):
huffman@21791
  1141
huffman@21791
  1142
  approx        <-- capprox
huffman@21791
  1143
  HFinite       <-- CFinite
huffman@21791
  1144
  HInfinite     <-- CInfinite
huffman@21791
  1145
  Infinitesimal <-- CInfinitesimal
huffman@21791
  1146
  monad         <-- cmonad
huffman@21791
  1147
  galaxy        <-- cgalaxy
huffman@21791
  1148
  (NS)LIM       <-- (NS)CLIM, (NS)CRLIM
huffman@21791
  1149
  is(NS)Cont    <-- is(NS)Contc, is(NS)contCR
huffman@21791
  1150
  (ns)deriv     <-- (ns)cderiv
huffman@21791
  1151
wenzelm@19653
  1152
wenzelm@17878
  1153
*** ML ***
wenzelm@17878
  1154
wenzelm@24643
  1155
* ML basics: just one true type int, which coincides with IntInf.int
wenzelm@24643
  1156
(even on SML/NJ).
wenzelm@24643
  1157
wenzelm@24633
  1158
* Generic arithmetic modules: Tools/rat.ML, Tools/float.ML
haftmann@23251
  1159
wenzelm@22848
  1160
* Context data interfaces (Theory/Proof/GenericDataFun): removed
wenzelm@22863
  1161
name/print, uninitialized data defaults to ad-hoc copy of empty value,
wenzelm@22863
  1162
init only required for impure data.  INCOMPATIBILITY: empty really
wenzelm@22863
  1163
need to be empty (no dependencies on theory content!)
wenzelm@22848
  1164
wenzelm@22138
  1165
* ML within Isar: antiquotations allow to embed statically-checked
wenzelm@22138
  1166
formal entities in the source, referring to the context available at
wenzelm@22138
  1167
compile-time.  For example:
wenzelm@22138
  1168
wenzelm@22138
  1169
ML {* @{typ "'a => 'b"} *}
wenzelm@22138
  1170
ML {* @{term "%x. x"} *}
wenzelm@22138
  1171
ML {* @{prop "x == y"} *}
wenzelm@22138
  1172
ML {* @{ctyp "'a => 'b"} *}
wenzelm@22138
  1173
ML {* @{cterm "%x. x"} *}
wenzelm@22138
  1174
ML {* @{cprop "x == y"} *}
wenzelm@22138
  1175
ML {* @{thm asm_rl} *}
wenzelm@22138
  1176
ML {* @{thms asm_rl} *}
wenzelm@22376
  1177
ML {* @{const_name c} *}
wenzelm@22376
  1178
ML {* @{const_syntax c} *}
wenzelm@22138
  1179
ML {* @{context} *}
wenzelm@22138
  1180
ML {* @{theory} *}
wenzelm@22138
  1181
ML {* @{theory Pure} *}
wenzelm@22138
  1182
ML {* @{simpset} *}
wenzelm@22138
  1183
ML {* @{claset} *}
wenzelm@22138
  1184
ML {* @{clasimpset} *}
wenzelm@22138
  1185
wenzelm@22151
  1186
The same works for sources being ``used'' within an Isar context.
wenzelm@22151
  1187
wenzelm@22152
  1188
* ML in Isar: improved error reporting; extra verbosity with
wenzelm@22152
  1189
Toplevel.debug enabled.
wenzelm@22152
  1190
haftmann@20348
  1191
* Pure/library:
haftmann@20348
  1192
haftmann@18450
  1193
  val burrow: ('a list -> 'b list) -> 'a list list -> 'b list list
haftmann@18549
  1194
  val fold_burrow: ('a list -> 'c -> 'b list * 'd) -> 'a list list -> 'c -> 'b list list * 'd
haftmann@18450
  1195
wenzelm@18540
  1196
The semantics of "burrow" is: "take a function with *simulatanously*
wenzelm@18540
  1197
transforms a list of value, and apply it *simulatanously* to a list of
wenzelm@22126
  1198
list of values of the appropriate type". Compare this with "map" which
wenzelm@18540
  1199
would *not* apply its argument function simulatanously but in
wenzelm@22126
  1200
sequence; "fold_burrow" has an additional context.
haftmann@18450
  1201
wenzelm@18446
  1202
* Pure/library: functions map2 and fold2 with curried syntax for
wenzelm@18446
  1203
simultanous mapping and folding:
wenzelm@18446
  1204
haftmann@18422
  1205
    val map2: ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
haftmann@18422
  1206
    val fold2: ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c
haftmann@18422
  1207
wenzelm@18446
  1208
* Pure/library: indexed lists - some functions in the Isabelle library
wenzelm@18446
  1209
treating lists over 'a as finite mappings from [0...n] to 'a have been
wenzelm@18446
  1210
given more convenient names and signatures reminiscent of similar
wenzelm@18446
  1211
functions for alists, tables, etc:
haftmann@18051
  1212
haftmann@18051
  1213
  val nth: 'a list -> int -> 'a 
haftmann@18051
  1214
  val nth_map: int -> ('a -> 'a) -> 'a list -> 'a list
haftmann@18051
  1215
  val fold_index: (int * 'a -> 'b -> 'b) -> 'a list -> 'b -> 'b
haftmann@18051
  1216
wenzelm@18446
  1217
Note that fold_index starts counting at index 0, not 1 like foldln
wenzelm@18446
  1218
used to.
wenzelm@18446
  1219
wenzelm@22126
  1220
* Pure/library: added general ``divide_and_conquer'' combinator on
wenzelm@22126
  1221
lists.
wenzelm@19032
  1222
wenzelm@19032
  1223
* Pure/General/table.ML: the join operations now works via exceptions
wenzelm@19081
  1224
DUP/SAME instead of type option.  This is simpler in simple cases, and
wenzelm@19081
  1225
admits slightly more efficient complex applications.
wenzelm@18446
  1226
wenzelm@18642
  1227
* Pure: datatype Context.generic joins theory/Proof.context and
wenzelm@18644
  1228
provides some facilities for code that works in either kind of
wenzelm@18642
  1229
context, notably GenericDataFun for uniform theory and proof data.
wenzelm@18642
  1230
wenzelm@18862
  1231
* Pure: 'advanced' translation functions (parse_translation etc.) now
wenzelm@18862
  1232
use Context.generic instead of just theory.
wenzelm@18862
  1233
wenzelm@18737
  1234
* Pure: simplified internal attribute type, which is now always
wenzelm@18737
  1235
Context.generic * thm -> Context.generic * thm.  Global (theory)
wenzelm@18737
  1236
vs. local (Proof.context) attributes have been discontinued, while
wenzelm@18738
  1237
minimizing code duplication.  Thm.rule_attribute and
wenzelm@18738
  1238
Thm.declaration_attribute build canonical attributes; see also
wenzelm@19006
  1239
structure Context for further operations on Context.generic, notably
wenzelm@19006
  1240
GenericDataFun.  INCOMPATIBILITY, need to adapt attribute type
wenzelm@19006
  1241
declarations and definitions.
wenzelm@19006
  1242
wenzelm@19508
  1243
* Pure/kernel: consts certification ignores sort constraints given in
wenzelm@19508
  1244
signature declarations.  (This information is not relevant to the
wenzelm@22126
  1245
logic, but only for type inference.)  IMPORTANT INTERNAL CHANGE,
wenzelm@22126
  1246
potential INCOMPATIBILITY.
wenzelm@19508
  1247
wenzelm@19508
  1248
* Pure: axiomatic type classes are now purely definitional, with
wenzelm@19508
  1249
explicit proofs of class axioms and super class relations performed
wenzelm@19508
  1250
internally.  See Pure/axclass.ML for the main internal interfaces --
wenzelm@19508
  1251
notably AxClass.define_class supercedes AxClass.add_axclass, and
wenzelm@19508
  1252
AxClass.axiomatize_class/classrel/arity supercede
wenzelm@19508
  1253
Sign.add_classes/classrel/arities.
wenzelm@19508
  1254
wenzelm@19006
  1255
* Pure/Isar: Args/Attrib parsers operate on Context.generic --
wenzelm@19006
  1256
global/local versions on theory vs. Proof.context have been
wenzelm@19006
  1257
discontinued; Attrib.syntax and Method.syntax have been adapted
wenzelm@19006
  1258
accordingly.  INCOMPATIBILITY, need to adapt parser expressions for
wenzelm@19006
  1259
attributes, methods, etc.
wenzelm@18642
  1260
wenzelm@18446
  1261
* Pure: several functions of signature "... -> theory -> theory * ..."
wenzelm@18446
  1262
have been reoriented to "... -> theory -> ... * theory" in order to
wenzelm@18446
  1263
allow natural usage in combination with the ||>, ||>>, |-> and
wenzelm@18446
  1264
fold_map combinators.
haftmann@18051
  1265
wenzelm@21647
  1266
* Pure: official theorem names (closed derivations) and additional
wenzelm@21647
  1267
comments (tags) are now strictly separate.  Name hints -- which are
wenzelm@21647
  1268
maintained as tags -- may be attached any time without affecting the
wenzelm@21647
  1269
derivation.
wenzelm@21647
  1270
wenzelm@18020
  1271
* Pure: primitive rule lift_rule now takes goal cterm instead of an
wenzelm@18145
  1272
actual goal state (thm).  Use Thm.lift_rule (Thm.cprem_of st i) to
wenzelm@18020
  1273
achieve the old behaviour.
wenzelm@18020
  1274
wenzelm@18020
  1275
* Pure: the "Goal" constant is now called "prop", supporting a
wenzelm@18020
  1276
slightly more general idea of ``protecting'' meta-level rule
wenzelm@18020
  1277
statements.
wenzelm@18020
  1278
wenzelm@20040
  1279
* Pure: Logic.(un)varify only works in a global context, which is now
wenzelm@20040
  1280
enforced instead of silently assumed.  INCOMPATIBILITY, may use
wenzelm@20040
  1281
Logic.legacy_(un)varify as temporary workaround.
wenzelm@20040
  1282
wenzelm@20090
  1283
* Pure: structure Name provides scalable operations for generating
wenzelm@20090
  1284
internal variable names, notably Name.variants etc.  This replaces
wenzelm@20090
  1285
some popular functions from term.ML:
wenzelm@20090
  1286
wenzelm@20090
  1287
  Term.variant		->  Name.variant
wenzelm@20090
  1288
  Term.variantlist	->  Name.variant_list  (*canonical argument order*)
wenzelm@20090
  1289
  Term.invent_names	->  Name.invent_list
wenzelm@20090
  1290
wenzelm@20090
  1291
Note that low-level renaming rarely occurs in new code -- operations
wenzelm@20090
  1292
from structure Variable are used instead (see below).
wenzelm@20090
  1293
wenzelm@20040
  1294
* Pure: structure Variable provides fundamental operations for proper
wenzelm@20040
  1295
treatment of fixed/schematic variables in a context.  For example,
wenzelm@20040
  1296
Variable.import introduces fixes for schematics of given facts and
wenzelm@20040
  1297
Variable.export reverses the effect (up to renaming) -- this replaces
wenzelm@20040
  1298
various freeze_thaw operations.
wenzelm@20040
  1299
wenzelm@18567
  1300
* Pure: structure Goal provides simple interfaces for
wenzelm@17981
  1301
init/conclude/finish and tactical prove operations (replacing former
wenzelm@20040
  1302
Tactic.prove).  Goal.prove is the canonical way to prove results
wenzelm@20040
  1303
within a given context; Goal.prove_global is a degraded version for
wenzelm@20040
  1304
theory level goals, including a global Drule.standard.  Note that
wenzelm@20040
  1305
OldGoals.prove_goalw_cterm has long been obsolete, since it is
wenzelm@20040
  1306
ill-behaved in a local proof context (e.g. with local fixes/assumes or
wenzelm@20040
  1307
in a locale context).
wenzelm@17981
  1308
wenzelm@18815
  1309
* Isar: simplified treatment of user-level errors, using exception
wenzelm@18687
  1310
ERROR of string uniformly.  Function error now merely raises ERROR,
wenzelm@18686
  1311
without any side effect on output channels.  The Isar toplevel takes
wenzelm@18686
  1312
care of proper display of ERROR exceptions.  ML code may use plain
wenzelm@18686
  1313
handle/can/try; cat_error may be used to concatenate errors like this:
wenzelm@18686
  1314
wenzelm@18686
  1315
  ... handle ERROR msg => cat_error msg "..."
wenzelm@18686
  1316
wenzelm@18686
  1317
Toplevel ML code (run directly or through the Isar toplevel) may be
wenzelm@18687
  1318
embedded into the Isar toplevel with exception display/debug like
wenzelm@18687
  1319
this:
wenzelm@18686
  1320
wenzelm@18686
  1321
  Isar.toplevel (fn () => ...)
wenzelm@18686
  1322
wenzelm@18686
  1323
INCOMPATIBILITY, removed special transform_error facilities, removed
wenzelm@18686
  1324
obsolete variants of user-level exceptions (ERROR_MESSAGE,
wenzelm@18686
  1325
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
wenzelm@18686
  1326
-- use plain ERROR instead.
wenzelm@18686
  1327
wenzelm@18815
  1328
* Isar: theory setup now has type (theory -> theory), instead of a
wenzelm@18722
  1329
list.  INCOMPATIBILITY, may use #> to compose setup functions.
wenzelm@18722
  1330
wenzelm@18815
  1331
* Isar: installed ML toplevel pretty printer for type Proof.context,
wenzelm@18815
  1332
subject to ProofContext.debug/verbose flags.
wenzelm@18815
  1333
wenzelm@18815
  1334
* Isar: Toplevel.theory_to_proof admits transactions that modify the
wenzelm@18815
  1335
theory before entering a proof state.  Transactions now always see a
wenzelm@18815
  1336
quasi-functional intermediate checkpoint, both in interactive and
wenzelm@18590
  1337
batch mode.
wenzelm@18567
  1338
wenzelm@17878
  1339
* Simplifier: the simpset of a running simplification process now
wenzelm@17878
  1340
contains a proof context (cf. Simplifier.the_context), which is the
wenzelm@17878
  1341
very context that the initial simpset has been retrieved from (by
wenzelm@17890
  1342
simpset_of/local_simpset_of).  Consequently, all plug-in components
wenzelm@17878
  1343
(solver, looper etc.) may depend on arbitrary proof data.
wenzelm@17878
  1344
wenzelm@17878
  1345
* Simplifier.inherit_context inherits the proof context (plus the
wenzelm@17878
  1346
local bounds) of the current simplification process; any simproc
wenzelm@17878
  1347
etc. that calls the Simplifier recursively should do this!  Removed
wenzelm@17878
  1348
former Simplifier.inherit_bounds, which is already included here --
wenzelm@17890
  1349
INCOMPATIBILITY.  Tools based on low-level rewriting may even have to
wenzelm@17890
  1350
specify an explicit context using Simplifier.context/theory_context.
wenzelm@17878
  1351
wenzelm@17878
  1352
* Simplifier/Classical Reasoner: more abstract interfaces
wenzelm@17878
  1353
change_simpset/claset for modifying the simpset/claset reference of a
wenzelm@17878
  1354
theory; raw versions simpset/claset_ref etc. have been discontinued --
wenzelm@17878
  1355
INCOMPATIBILITY.
wenzelm@17878
  1356
wenzelm@18540
  1357
* Provers: more generic wrt. syntax of object-logics, avoid hardwired
wenzelm@18540
  1358
"Trueprop" etc.
wenzelm@18540
  1359
wenzelm@17878
  1360
wenzelm@20988
  1361
*** System ***
wenzelm@20988
  1362
wenzelm@21471
  1363
* settings: ML_IDENTIFIER -- which is appended to user specific heap
wenzelm@21471
  1364
locations -- now includes the Isabelle version identifier as well.
wenzelm@21471
  1365
This simplifies use of multiple Isabelle installations.
wenzelm@21471
  1366
wenzelm@20988
  1367
* isabelle-process: option -S (secure mode) disables some critical
wenzelm@20988
  1368
operations, notably runtime compilation and evaluation of ML source
wenzelm@20988
  1369
code.
wenzelm@20988
  1370
wenzelm@24498
  1371
* Support for multithreading, using Poly/ML 5.1 (internal version from
wenzelm@24498
  1372
CVS). The theory loader exploits parallelism when processing independent
wenzelm@24498
  1373
theories, following the header specifications. The maximum number of
wenzelm@24498
  1374
worker threads is specified via usedir option -M or the "max-threads"
wenzelm@24498
  1375
setting in Proof General. A speedup factor of 1.5--3.5 can be expected
wenzelm@24498
  1376
on a 4-core machine, and up to 6 on a 8-core machine. User-code needs to
wenzelm@24213
  1377
observe certain guidelines for thread-safe programming, see appendix A
wenzelm@24213
  1378
in the Isar Implementation manual.
wenzelm@24210
  1379
wenzelm@17754
  1380
wenzelm@17720
  1381
New in Isabelle2005 (October 2005)
wenzelm@17720
  1382
----------------------------------
wenzelm@14655
  1383
wenzelm@14655
  1384
*** General ***
wenzelm@14655
  1385
nipkow@15130
  1386
* Theory headers: the new header syntax for Isar theories is
nipkow@15130
  1387
nipkow@15130
  1388
  theory <name>
wenzelm@16234
  1389
  imports <theory1> ... <theoryN>
wenzelm@16234
  1390
  uses <file1> ... <fileM>
nipkow@15130
  1391
  begin
nipkow@15130
  1392
wenzelm@16234
  1393
where the 'uses' part is optional.  The previous syntax
wenzelm@16234
  1394
wenzelm@16234
  1395
  theory <name> = <theory1> + ... + <theoryN>:
wenzelm@16234
  1396
wenzelm@16717
  1397
will disappear in the next release.  Use isatool fixheaders to convert
wenzelm@16717
  1398
existing theory files.  Note that there is no change in ancient
wenzelm@17371
  1399
non-Isar theories now, but these will disappear soon.
nipkow@15130
  1400
berghofe@15475
  1401
* Theory loader: parent theories can now also be referred to via
wenzelm@16234
  1402
relative and absolute paths.
wenzelm@16234
  1403
wenzelm@17408
  1404
* Command 'find_theorems' searches for a list of criteria instead of a
wenzelm@17408
  1405
list of constants. Known criteria are: intro, elim, dest, name:string,
wenzelm@17408
  1406
simp:term, and any term. Criteria can be preceded by '-' to select
wenzelm@17408
  1407
theorems that do not match. Intro, elim, dest select theorems that
wenzelm@17408
  1408
match the current goal, name:s selects theorems whose fully qualified
wenzelm@17408
  1409
name contain s, and simp:term selects all simplification rules whose
wenzelm@17408
  1410
lhs match term.  Any other term is interpreted as pattern and selects
wenzelm@17408
  1411
all theorems matching the pattern. Available in ProofGeneral under
wenzelm@17408
  1412
'ProofGeneral -> Find Theorems' or C-c C-f.  Example:
wenzelm@16234
  1413
wenzelm@17275
  1414
  C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
wenzelm@16234
  1415
wenzelm@16234
  1416
prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
wenzelm@16234
  1417
matching the current goal as introduction rule and not having "HOL."
wenzelm@16234
  1418
in their name (i.e. not being defined in theory HOL).
wenzelm@16013
  1419
wenzelm@17408
  1420
* Command 'thms_containing' has been discontinued in favour of
wenzelm@17408
  1421
'find_theorems'; INCOMPATIBILITY.
wenzelm@17408
  1422
wenzelm@17385
  1423
* Communication with Proof General is now 8bit clean, which means that
wenzelm@17385
  1424
Unicode text in UTF-8 encoding may be used within theory texts (both
wenzelm@17408
  1425
formal and informal parts).  Cf. option -U of the Isabelle Proof
wenzelm@17538
  1426
General interface.  Here are some simple examples (cf. src/HOL/ex):
wenzelm@17538
  1427
wenzelm@17538
  1428
  http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
wenzelm@17538
  1429
  http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
wenzelm@17385
  1430
wenzelm@17425
  1431
* Improved efficiency of the Simplifier and, to a lesser degree, the
wenzelm@17425
  1432
Classical Reasoner.  Typical big applications run around 2 times
wenzelm@17425
  1433
faster.
wenzelm@17425
  1434
wenzelm@15703
  1435
wenzelm@15703
  1436
*** Document preparation ***
wenzelm@15703
  1437
wenzelm@16234
  1438
* Commands 'display_drafts' and 'print_drafts' perform simple output
wenzelm@16234
  1439
of raw sources.  Only those symbols that do not require additional
wenzelm@16234
  1440
LaTeX packages (depending on comments in isabellesym.sty) are
wenzelm@16234
  1441
displayed properly, everything else is left verbatim.  isatool display
wenzelm@16234
  1442
and isatool print are used as front ends (these are subject to the
wenzelm@16234
  1443
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
wenzelm@16234
  1444
wenzelm@17047
  1445
* Command tags control specific markup of certain regions of text,
wenzelm@17047
  1446
notably folding and hiding.  Predefined tags include "theory" (for
wenzelm@17047
  1447
theory begin and end), "proof" for proof commands, and "ML" for
wenzelm@17047
  1448
commands involving ML code; the additional tags "visible" and
wenzelm@17047
  1449
"invisible" are unused by default.  Users may give explicit tag
wenzelm@17047
  1450
specifications in the text, e.g. ''by %invisible (auto)''.  The
wenzelm@17047
  1451
interpretation of tags is determined by the LaTeX job during document
wenzelm@17047
  1452
preparation: see option -V of isatool usedir, or options -n and -t of
wenzelm@17047
  1453
isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
wenzelm@17047
  1454
\isadroptag.
wenzelm@17047
  1455
wenzelm@17047
  1456
Several document versions may be produced at the same time via isatool
wenzelm@17047
  1457
usedir (the generated index.html will link all of them).  Typical
wenzelm@17047
  1458
specifications include ''-V document=theory,proof,ML'' to present
wenzelm@17047
  1459
theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
wenzelm@17047
  1460
proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
wenzelm@17047
  1461
these parts without any formal replacement text.  The Isabelle site
wenzelm@17047
  1462
default settings produce ''document'' and ''outline'' versions as
wenzelm@17047
  1463
specified above.
wenzelm@16234
  1464
haftmann@17402
  1465
* Several new antiquotations:
wenzelm@15979
  1466
wenzelm@15979
  1467
  @{term_type term} prints a term with its type annotated;
wenzelm@15979
  1468
wenzelm@15979
  1469
  @{typeof term} prints the type of a term;
wenzelm@15979
  1470
wenzelm@16234
  1471
  @{const const} is the same as @{term const}, but checks that the
wenzelm@16234
  1472
  argument is a known logical constant;
wenzelm@15979
  1473
wenzelm@15979
  1474
  @{term_style style term} and @{thm_style style thm} print a term or
wenzelm@16234
  1475
  theorem applying a "style" to it
wenzelm@16234
  1476
wenzelm@17117
  1477
  @{ML text}
wenzelm@17117
  1478
wenzelm@16234
  1479
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
wenzelm@16234
  1480
definitions, equations, inequations etc., 'concl' printing only the
schirmer@17393
  1481
conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
wenzelm@16234
  1482
to print the specified premise.  TermStyle.add_style provides an ML
wenzelm@16234
  1483
interface for introducing further styles.  See also the "LaTeX Sugar"
wenzelm@17117
  1484
document practical applications.  The ML antiquotation prints
wenzelm@17117
  1485
type-checked ML expressions verbatim.
wenzelm@16234
  1486
wenzelm@17259
  1487
* Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
wenzelm@17259
  1488
and 'text' support optional locale specification '(in loc)', which
wenzelm@17269
  1489
specifies the default context for interpreting antiquotations.  For
wenzelm@17269
  1490
example: 'text (in lattice) {* @{thm inf_assoc}*}'.
wenzelm@17259
  1491
wenzelm@17259
  1492
* Option 'locale=NAME' of antiquotations specifies an alternative
wenzelm@17259
  1493
context interpreting the subsequent argument.  For example: @{thm
wenzelm@17269
  1494
[locale=lattice] inf_assoc}.
wenzelm@17259
  1495
wenzelm@17097
  1496
* Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
wenzelm@17097
  1497
a proof context.
wenzelm@17097
  1498
wenzelm@17097
  1499
* Proper output of antiquotations for theory commands involving a
wenzelm@17097
  1500
proof context (such as 'locale' or 'theorem (in loc) ...').
wenzelm@17097
  1501
wenzelm@17193
  1502
* Delimiters of outer tokens (string etc.) now produce separate LaTeX
wenzelm@17193
  1503
macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
wenzelm@17193
  1504
wenzelm@17193
  1505
* isatool usedir: new option -C (default true) controls whether option
wenzelm@17193
  1506
-D should include a copy of the original document directory; -C false
wenzelm@17193
  1507
prevents unwanted effects such as copying of administrative CVS data.
wenzelm@17193
  1508
wenzelm@16234
  1509
wenzelm@16234
  1510
*** Pure ***
wenzelm@16234
  1511
wenzelm@16234
  1512
* Considerably improved version of 'constdefs' command.  Now performs
wenzelm@16234
  1513
automatic type-inference of declared constants; additional support for
wenzelm@16234
  1514
local structure declarations (cf. locales and HOL records), see also
wenzelm@16234
  1515
isar-ref manual.  Potential INCOMPATIBILITY: need to observe strictly
wenzelm@16234
  1516
sequential dependencies of definitions within a single 'constdefs'
wenzelm@16234
  1517
section; moreover, the declared name needs to be an identifier.  If
wenzelm@16234
  1518
all fails, consider to fall back on 'consts' and 'defs' separately.
wenzelm@16234
  1519
wenzelm@16234
  1520
* Improved indexed syntax and implicit structures.  First of all,
wenzelm@16234
  1521
indexed syntax provides a notational device for subscripted
wenzelm@16234
  1522
application, using the new syntax \<^bsub>term\<^esub> for arbitrary
wenzelm@16234
  1523
expressions.  Secondly, in a local context with structure
wenzelm@16234
  1524
declarations, number indexes \<^sub>n or the empty index (default
wenzelm@16234
  1525
number 1) refer to a certain fixed variable implicitly; option
wenzelm@16234
  1526
show_structs controls printing of implicit structures.  Typical
wenzelm@16234
  1527
applications of these concepts involve record types and locales.
wenzelm@16234
  1528
wenzelm@16234
  1529
* New command 'no_syntax' removes grammar declarations (and
wenzelm@16234
  1530
translations) resulting from the given syntax specification, which is
wenzelm@16234
  1531
interpreted in the same manner as for the 'syntax' command.
wenzelm@16234
  1532
wenzelm@16234
  1533
* 'Advanced' translation functions (parse_translation etc.) may depend
wenzelm@16234
  1534
on the signature of the theory context being presently used for
wenzelm@16234
  1535
parsing/printing, see also isar-ref manual.
wenzelm@16234
  1536
wenzelm@16856
  1537
* Improved 'oracle' command provides a type-safe interface to turn an
wenzelm@16856
  1538
ML expression of type theory -> T -> term into a primitive rule of
wenzelm@16856
  1539
type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
wenzelm@16856
  1540
is already included here); see also FOL/ex/IffExample.thy;
wenzelm@16856
  1541
INCOMPATIBILITY.
wenzelm@16856
  1542
wenzelm@17275
  1543
* axclass: name space prefix for class "c" is now "c_class" (was "c"
wenzelm@17275
  1544
before); "cI" is no longer bound, use "c.intro" instead.
wenzelm@17275
  1545
INCOMPATIBILITY.  This change avoids clashes of fact bindings for
wenzelm@17275
  1546
axclasses vs. locales.
wenzelm@17275
  1547
wenzelm@16234
  1548
* Improved internal renaming of symbolic identifiers -- attach primes
wenzelm@16234
  1549
instead of base 26 numbers.
wenzelm@16234
  1550
wenzelm@16234
  1551
* New flag show_question_marks controls printing of leading question
wenzelm@16234
  1552
marks in schematic variable names.
wenzelm@16234
  1553
wenzelm@16234
  1554
* In schematic variable names, *any* symbol following \<^isub> or
wenzelm@16234
  1555
\<^isup> is now treated as part of the base name.  For example, the
wenzelm@16234
  1556
following works without printing of awkward ".0" indexes:
wenzelm@16234
  1557
wenzelm@16234
  1558
  lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
wenzelm@16234
  1559
    by simp
wenzelm@16234
  1560
wenzelm@16234
  1561
* Inner syntax includes (*(*nested*) comments*).
wenzelm@16234
  1562
wenzelm@17548
  1563
* Pretty printer now supports unbreakable blocks, specified in mixfix
wenzelm@16234
  1564
annotations as "(00...)".
wenzelm@16234
  1565
wenzelm@16234
  1566
* Clear separation of logical types and nonterminals, where the latter
wenzelm@16234
  1567
may only occur in 'syntax' specifications or type abbreviations.
wenzelm@16234
  1568
Before that distinction was only partially implemented via type class
wenzelm@16234
  1569
"logic" vs. "{}".  Potential INCOMPATIBILITY in rare cases of improper
wenzelm@16234
  1570
use of 'types'/'consts' instead of 'nonterminals'/'syntax'.  Some very
wenzelm@16234
  1571
exotic syntax specifications may require further adaption
wenzelm@17691
  1572
(e.g. Cube/Cube.thy).
wenzelm@16234
  1573
wenzelm@16234
  1574
* Removed obsolete type class "logic", use the top sort {} instead.
wenzelm@16234
  1575
Note that non-logical types should be declared as 'nonterminals'
wenzelm@16234
  1576
rather than 'types'.  INCOMPATIBILITY for new object-logic
wenzelm@16234
  1577
specifications.
wenzelm@16234
  1578
ballarin@17095
  1579
* Attributes 'induct' and 'cases': type or set names may now be
ballarin@17095
  1580
locally fixed variables as well.
ballarin@17095
  1581
wenzelm@16234
  1582
* Simplifier: can now control the depth to which conditional rewriting
wenzelm@16234
  1583
is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
wenzelm@16234
  1584
Limit.
wenzelm@16234
  1585
wenzelm@16234
  1586
* Simplifier: simplification procedures may now take the current
wenzelm@16234
  1587
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
wenzelm@16234
  1588
interface), which is very useful for calling the Simplifier
wenzelm@16234
  1589
recursively.  Minor INCOMPATIBILITY: the 'prems' argument of simprocs
wenzelm@16234
  1590
is gone -- use prems_of_ss on the simpset instead.  Moreover, the
wenzelm@16234
  1591
low-level mk_simproc no longer applies Logic.varify internally, to
wenzelm@16234
  1592
allow for use in a context of fixed variables.
wenzelm@16234
  1593
wenzelm@16234
  1594
* thin_tac now works even if the assumption being deleted contains !!
wenzelm@16234
  1595
or ==>.  More generally, erule now works even if the major premise of
wenzelm@16234
  1596
the elimination rule contains !! or ==>.
wenzelm@16234
  1597
wenzelm@17597
  1598
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
nipkow@17590
  1599
wenzelm@16234
  1600
* Reorganized bootstrapping of the Pure theories; CPure is now derived
wenzelm@16234
  1601
from Pure, which contains all common declarations already.  Both
wenzelm@16234
  1602
theories are defined via plain Isabelle/Isar .thy files.
wenzelm@16234
  1603
INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
wenzelm@16234
  1604
CPure.elim / CPure.dest attributes) now appear in the Pure name space;
wenzelm@16234
  1605
use isatool fixcpure to adapt your theory and ML sources.
wenzelm@16234
  1606
wenzelm@16234
  1607
* New syntax 'name(i-j, i-, i, ...)' for referring to specific
wenzelm@16234
  1608
selections of theorems in named facts via index ranges.
wenzelm@16234
  1609
wenzelm@17097
  1610
* 'print_theorems': in theory mode, really print the difference
wenzelm@17097
  1611
wrt. the last state (works for interactive theory development only),
wenzelm@17097
  1612
in proof mode print all local facts (cf. 'print_facts');
wenzelm@17097
  1613
wenzelm@17397
  1614
* 'hide': option '(open)' hides only base names.
wenzelm@17397
  1615
wenzelm@17275
  1616
* More efficient treatment of intermediate checkpoints in interactive
wenzelm@17275
  1617
theory development.
wenzelm@17275
  1618
berghofe@17663
  1619
* Code generator is now invoked via code_module (incremental code
wenzelm@17664
  1620
generation) and code_library (modular code generation, ML structures
wenzelm@17664
  1621
for each theory).  INCOMPATIBILITY: new keywords 'file' and 'contains'
wenzelm@17664
  1622
must be quoted when used as identifiers.
wenzelm@17664
  1623
wenzelm@17664
  1624
* New 'value' command for reading, evaluating and printing terms using
wenzelm@17664
  1625
the code generator.  INCOMPATIBILITY: command keyword 'value' must be
wenzelm@17664
  1626
quoted when used as identifier.
berghofe@17663
  1627
wenzelm@16234
  1628
wenzelm@16234
  1629
*** Locales ***
ballarin@17095
  1630
wenzelm@17385
  1631
* New commands for the interpretation of locale expressions in
wenzelm@17385
  1632
theories (1), locales (2) and proof contexts (3).  These generate
wenzelm@17385
  1633
proof obligations from the expression specification.  After the
wenzelm@17385
  1634
obligations have been discharged, theorems of the expression are added
wenzelm@17385
  1635
to the theory, target locale or proof context.  The synopsis of the
wenzelm@17385
  1636
commands is a follows:
wenzelm@17385
  1637
ballarin@17095
  1638
  (1) interpretation expr inst
ballarin@17095
  1639
  (2) interpretation target < expr
ballarin@17095
  1640
  (3) interpret expr inst
wenzelm@17385
  1641
ballarin@17095
  1642
Interpretation in theories and proof contexts require a parameter
ballarin@17095
  1643
instantiation of terms from the current context.  This is applied to
wenzelm@17385
  1644
specifications and theorems of the interpreted expression.
wenzelm@17385
  1645
Interpretation in locales only permits parameter renaming through the
wenzelm@17385
  1646
locale expression.  Interpretation is smart in that interpretations
wenzelm@17385
  1647
that are active already do not occur in proof obligations, neither are
wenzelm@17385
  1648
instantiated theorems stored in duplicate.  Use 'print_interps' to
wenzelm@17385
  1649
inspect active interpretations of a particular locale.  For details,
ballarin@17436
  1650
see the Isar Reference manual.  Examples can be found in
ballarin@17436
  1651
HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
wenzelm@16234
  1652
wenzelm@16234
  1653
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
wenzelm@16234
  1654
'interpret' instead.
wenzelm@16234
  1655
wenzelm@17385
  1656
* New context element 'constrains' for adding type constraints to
wenzelm@17385
  1657
parameters.
wenzelm@17385
  1658
wenzelm@17385
  1659
* Context expressions: renaming of parameters with syntax
wenzelm@17385
  1660
redeclaration.
ballarin@17095
  1661
ballarin@17095
  1662
* Locale declaration: 'includes' disallowed.
ballarin@17095
  1663
wenzelm@16234
  1664
* Proper static binding of attribute syntax -- i.e. types / terms /
wenzelm@16234
  1665
facts mentioned as arguments are always those of the locale definition
wenzelm@16234
  1666
context, independently of the context of later invocations.  Moreover,
wenzelm@16234
  1667
locale operations (renaming and type / term instantiation) are applied
wenzelm@16234
  1668
to attribute arguments as expected.
wenzelm@16234
  1669
wenzelm@16234
  1670
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
wenzelm@16234
  1671
actual attributes; rare situations may require Attrib.attribute to
wenzelm@16234
  1672
embed those attributes into Attrib.src that lack concrete syntax.
wenzelm@16234
  1673
Attribute implementations need to cooperate properly with the static
wenzelm@16234
  1674
binding mechanism.  Basic parsers Args.XXX_typ/term/prop and
wenzelm@16234
  1675
Attrib.XXX_thm etc. already do the right thing without further
wenzelm@16234
  1676
intervention.  Only unusual applications -- such as "where" or "of"
wenzelm@16234
  1677
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both
wenzelm@16234
  1678
on the context and the facts involved -- may have to assign parsed
wenzelm@16234
  1679
values to argument tokens explicitly.
wenzelm@16234
  1680
wenzelm@16234
  1681
* Changed parameter management in theorem generation for long goal
wenzelm@16234
  1682
statements with 'includes'.  INCOMPATIBILITY: produces a different
wenzelm@16234
  1683
theorem statement in rare situations.
wenzelm@16234
  1684
ballarin@17228
  1685
* Locale inspection command 'print_locale' omits notes elements.  Use
ballarin@17228
  1686
'print_locale!' to have them included in the output.
ballarin@17228
  1687
wenzelm@16234
  1688
wenzelm@16234
  1689
*** Provers ***
wenzelm@16234
  1690
wenzelm@16234
  1691
* Provers/hypsubst.ML: improved version of the subst method, for
wenzelm@16234
  1692
single-step rewriting: it now works in bound variable contexts. New is
wenzelm@16234
  1693
'subst (asm)', for rewriting an assumption.  INCOMPATIBILITY: may
wenzelm@16234
  1694
rewrite a different subterm than the original subst method, which is
wenzelm@16234
  1695
still available as 'simplesubst'.
wenzelm@16234
  1696
wenzelm@16234
  1697
* Provers/quasi.ML: new transitivity reasoners for transitivity only
wenzelm@16234
  1698
and quasi orders.
wenzelm@16234
  1699
wenzelm@16234
  1700
* Provers/trancl.ML: new transitivity reasoner for transitive and
wenzelm@16234
  1701
reflexive-transitive closure of relations.
wenzelm@16234
  1702
wenzelm@16234
  1703
* Provers/blast.ML: new reference depth_limit to make blast's depth
wenzelm@16234
  1704
limit (previously hard-coded with a value of 20) user-definable.
wenzelm@16234
  1705
wenzelm@16234
  1706
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
wenzelm@16234
  1707
is peformed already.  Object-logics merely need to finish their
wenzelm@16234
  1708
initial simpset configuration as before.  INCOMPATIBILITY.
wenzelm@15703
  1709
berghofe@15475
  1710
schirmer@14700
  1711
*** HOL ***
schirmer@14700
  1712
wenzelm@16234
  1713
* Symbolic syntax of Hilbert Choice Operator is now as follows:
wenzelm@14878
  1714
wenzelm@14878
  1715
  syntax (epsilon)
wenzelm@14878
  1716
    "_Eps" :: "[pttrn, bool] => 'a"    ("(3\<some>_./ _)" [0, 10] 10)
wenzelm@14878
  1717
wenzelm@16234
  1718
The symbol \<some> is displayed as the alternative epsilon of LaTeX
wenzelm@16234
  1719
and x-symbol; use option '-m epsilon' to get it actually printed.
wenzelm@16234
  1720
Moreover, the mathematically important symbolic identifier \<epsilon>
wenzelm@16234
  1721
becomes available as variable, constant etc.  INCOMPATIBILITY,
wenzelm@16234
  1722
wenzelm@16234
  1723
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
wenzelm@16234
  1724
Similarly for all quantifiers: "ALL x > y" etc.  The x-symbol for >=
wenzelm@17371
  1725
is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
avigad@17016
  1726
support corresponding Isar calculations.
wenzelm@16234
  1727
wenzelm@16234
  1728
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
wenzelm@16234
  1729
instead of ":".
wenzelm@16234
  1730
wenzelm@16234
  1731
* theory SetInterval: changed the syntax for open intervals:
wenzelm@16234
  1732
wenzelm@16234
  1733
  Old       New
wenzelm@16234
  1734
  {..n(}    {..<n}
wenzelm@16234
  1735
  {)n..}    {n<..}
wenzelm@16234
  1736
  {m..n(}   {m..<n}
wenzelm@16234
  1737
  {)m..n}   {m<..n}
wenzelm@16234
  1738
  {)m..n(}  {m<..<n}
wenzelm@16234
  1739
wenzelm@16234
  1740
The old syntax is still supported but will disappear in the next
wenzelm@16234
  1741
release.  For conversion use the following Emacs search and replace
wenzelm@16234
  1742
patterns (these are not perfect but work quite well):
nipkow@15046
  1743
nipkow@15046
  1744
  {)\([^\.]*\)\.\.  ->  {\1<\.\.}
nipkow@15046
  1745
  \.\.\([^(}]*\)(}  ->  \.\.<\1}
nipkow@15046
  1746
wenzelm@17533
  1747
* Theory Commutative_Ring (in Library): method comm_ring for proving
wenzelm@17533
  1748
equalities in commutative rings; method 'algebra' provides a generic
wenzelm@17533
  1749
interface.
wenzelm@17389
  1750
wenzelm@17389
  1751
* Theory Finite_Set: changed the syntax for 'setsum', summation over
wenzelm@16234
  1752
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
wenzelm@17371
  1753
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
paulson@17189
  1754
be a tuple pattern.
wenzelm@16234
  1755
wenzelm@16234
  1756
Some new syntax forms are available:
wenzelm@16234
  1757
wenzelm@16234
  1758
  "\<Sum>x | P. e"      for     "setsum (%x. e) {x. P}"
wenzelm@16234
  1759
  "\<Sum>x = a..b. e"   for     "setsum (%x. e) {a..b}"
wenzelm@16234
  1760
  "\<Sum>x = a..<b. e"  for     "setsum (%x. e) {a..<b}"
wenzelm@16234
  1761
  "\<Sum>x < k. e"      for     "setsum (%x. e) {..<k}"
wenzelm@16234
  1762
wenzelm@16234
  1763
The latter form "\<Sum>x < k. e" used to be based on a separate
wenzelm@16234
  1764
function "Summation", which has been discontinued.
wenzelm@16234
  1765
wenzelm@16234
  1766
* theory Finite_Set: in structured induction proofs, the insert case
wenzelm@16234
  1767
is now 'case (insert x F)' instead of the old counterintuitive 'case
wenzelm@16234
  1768
(insert F x)'.
wenzelm@16234
  1769
wenzelm@16234
  1770
* The 'refute' command has been extended to support a much larger
wenzelm@16234
  1771
fragment of HOL, including axiomatic type classes, constdefs and
wenzelm@16234
  1772
typedefs, inductive datatypes and recursion.
wenzelm@16234
  1773
webertj@17700
  1774
* New tactics 'sat' and 'satx' to prove propositional tautologies.
webertj@17700
  1775
Requires zChaff with proof generation to be installed.  See
webertj@17700
  1776
HOL/ex/SAT_Examples.thy for examples.
webertj@17619
  1777
wenzelm@16234
  1778
* Datatype induction via method 'induct' now preserves the name of the
wenzelm@16234
  1779
induction variable. For example, when proving P(xs::'a list) by
wenzelm@16234
  1780
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
wenzelm@16234
  1781
than P(list) ==> P(a#list) as previously.  Potential INCOMPATIBILITY
wenzelm@16234
  1782
in unstructured proof scripts.
wenzelm@16234
  1783
wenzelm@16234
  1784
* Reworked implementation of records.  Improved scalability for
wenzelm@16234
  1785
records with many fields, avoiding performance problems for type
wenzelm@16234
  1786
inference. Records are no longer composed of nested field types, but
wenzelm@16234
  1787
of nested extension types. Therefore the record type only grows linear
wenzelm@16234
  1788
in the number of extensions and not in the number of fields.  The
wenzelm@16234
  1789
top-level (users) view on records is preserved.  Potential
wenzelm@16234
  1790
INCOMPATIBILITY only in strange cases, where the theory depends on the
wenzelm@16234
  1791
old record representation. The type generated for a record is called
wenzelm@16234
  1792
<record_name>_ext_type.
wenzelm@16234
  1793
wenzelm@16234
  1794
Flag record_quick_and_dirty_sensitive can be enabled to skip the
wenzelm@16234
  1795
proofs triggered by a record definition or a simproc (if
wenzelm@16234
  1796
quick_and_dirty is enabled).  Definitions of large records can take
wenzelm@16234
  1797
quite long.
wenzelm@16234
  1798
wenzelm@16234
  1799
New simproc record_upd_simproc for simplification of multiple record
wenzelm@16234
  1800
updates enabled by default.  Moreover, trivial updates are also
wenzelm@16234
  1801
removed: r(|x := x r|) = r.  INCOMPATIBILITY: old proofs break
wenzelm@16234
  1802
occasionally, since simplification is more powerful by default.
wenzelm@16234
  1803
wenzelm@17275
  1804
* typedef: proper support for polymorphic sets, which contain extra
wenzelm@17275
  1805
type-variables in the term.
wenzelm@17275
  1806
wenzelm@16234
  1807
* Simplifier: automatically reasons about transitivity chains
wenzelm@16234
  1808
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
wenzelm@16234
  1809
provided by Provers/trancl.ML as additional solvers.  INCOMPATIBILITY:
wenzelm@16234
  1810
old proofs break occasionally as simplification may now solve more
wenzelm@16234
  1811
goals than previously.
wenzelm@16234
  1812
wenzelm@16234
  1813
* Simplifier: converts x <= y into x = y if assumption y <= x is
wenzelm@16234
  1814
present.  Works for all partial orders (class "order"), in particular
wenzelm@16234
  1815
numbers and sets.  For linear orders (e.g. numbers) it treats ~ x < y
wenzelm@16234
  1816
just like y <= x.
wenzelm@16234
  1817
wenzelm@16234
  1818
* Simplifier: new simproc for "let x = a in f x".  If a is a free or
wenzelm@16234
  1819
bound variable or a constant then the let is unfolded.  Otherwise
wenzelm@16234
  1820
first a is simplified to b, and then f b is simplified to g. If
wenzelm@16234
  1821
possible we abstract b from g arriving at "let x = b in h x",
wenzelm@16234
  1822
otherwise we unfold the let and arrive at g.  The simproc can be
wenzelm@16234
  1823
enabled/disabled by the reference use_let_simproc.  Potential
wenzelm@16234
  1824
INCOMPATIBILITY since simplification is more powerful by default.
webertj@15776
  1825
paulson@16563
  1826
* Classical reasoning: the meson method now accepts theorems as arguments.
paulson@16563
  1827
paulson@17595
  1828
* Prover support: pre-release of the Isabelle-ATP linkup, which runs background
paulson@17595
  1829
jobs to provide advice on the provability of subgoals.
paulson@17595
  1830
wenzelm@16891
  1831
* Theory OrderedGroup and Ring_and_Field: various additions and
wenzelm@16891
  1832
improvements to faciliate calculations involving equalities and
wenzelm@16891
  1833
inequalities.
wenzelm@16891
  1834
wenzelm@16891
  1835
The following theorems have been eliminated or modified
wenzelm@16891
  1836
(INCOMPATIBILITY):
avigad@16888
  1837
avigad@16888
  1838
  abs_eq             now named abs_of_nonneg
wenzelm@17371
  1839
  abs_of_ge_0        now named abs_of_nonneg
wenzelm@17371
  1840
  abs_minus_eq       now named abs_of_nonpos
avigad@16888
  1841
  imp_abs_id         now named abs_of_nonneg
avigad@16888
  1842
  imp_abs_neg_id     now named abs_of_nonpos
avigad@16888
  1843
  mult_pos           now named mult_pos_pos
avigad@16888
  1844
  mult_pos_le        now named mult_nonneg_nonneg
avigad@16888
  1845
  mult_pos_neg_le    now named mult_nonneg_nonpos
avigad@16888
  1846
  mult_pos_neg2_le   now named mult_nonneg_nonpos2
avigad@16888
  1847
  mult_neg           now named mult_neg_neg
avigad@16888
  1848
  mult_neg_le        now named mult_nonpos_nonpos
avigad@16888
  1849
obua@23495
  1850
* The following lemmas in Ring_and_Field have been added to the simplifier:
obua@23495
  1851
     
obua@23495
  1852
     zero_le_square
obua@23495
  1853
     not_square_less_zero 
obua@23495
  1854
obua@23495
  1855
  The following lemmas have been deleted from Real/RealPow:
obua@23495
  1856
  
obua@23495
  1857
     realpow_zero_zero
obua@23495
  1858
     realpow_two
obua@23495
  1859
     realpow_less
obua@23495
  1860
     zero_le_power
obua@23495
  1861
     realpow_two_le
obua@23495
  1862
     abs_realpow_two
obua@23495
  1863
     realpow_two_abs     
obua@23495
  1864
wenzelm@16891
  1865
* Theory Parity: added rules for simplifying exponents.
wenzelm@16891
  1866
nipkow@17092
  1867
* Theory List:
nipkow@17092
  1868
nipkow@17092
  1869
The following theorems have been eliminated or modified
nipkow@17092
  1870
(INCOMPATIBILITY):
nipkow@17092
  1871
nipkow@17092
  1872
  list_all_Nil       now named list_all.simps(1)
nipkow@17092
  1873
  list_all_Cons      now named list_all.simps(2)
nipkow@17092
  1874
  list_all_conv      now named list_all_iff
nipkow@17092
  1875
  set_mem_eq         now named mem_iff
nipkow@17092
  1876
wenzelm@16929
  1877
* Theories SetsAndFunctions and BigO (see HOL/Library) support
wenzelm@16929
  1878
asymptotic "big O" calculations.  See the notes in BigO.thy.
wenzelm@16929
  1879
avigad@16888
  1880
avigad@16888
  1881
*** HOL-Complex ***
avigad@16888
  1882
wenzelm@16891
  1883
* Theory RealDef: better support for embedding natural numbers and
wenzelm@16891
  1884
integers in the reals.
wenzelm@16891
  1885
wenzelm@16891
  1886
The following theorems have been eliminated or modified
wenzelm@16891
  1887
(INCOMPATIBILITY):
wenzelm@16891
  1888
avigad@17016
  1889
  exp_ge_add_one_self  now requires no hypotheses
avigad@17016
  1890
  real_of_int_add      reversed direction of equality (use [symmetric])
avigad@17016
  1891
  real_of_int_minus    reversed direction of equality (use [symmetric])
avigad@17016
  1892
  real_of_int_diff     reversed direction of equality (use [symmetric])
avigad@17016
  1893
  real_of_int_mult     reversed direction of equality (use [symmetric])
wenzelm@16891
  1894
wenzelm@16891
  1895
* Theory RComplete: expanded support for floor and ceiling functions.
avigad@16888
  1896
avigad@16962
  1897
* Theory Ln is new, with properties of the natural logarithm
avigad@16962
  1898
wenzelm@17423
  1899
* Hyperreal: There is a new type constructor "star" for making
wenzelm@17423
  1900
nonstandard types.  The old type names are now type synonyms:
wenzelm@17423
  1901
wenzelm@17423
  1902
  hypreal = real star
wenzelm@17423
  1903
  hypnat = nat star
wenzelm@17423
  1904
  hcomplex = complex star
wenzelm@17423
  1905
wenzelm@17423
  1906
* Hyperreal: Many groups of similarly-defined constants have been
huffman@17442
  1907
replaced by polymorphic versions (INCOMPATIBILITY):
wenzelm@17423
  1908
wenzelm@17423
  1909
  star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
wenzelm@17423
  1910
wenzelm@17423
  1911
  starset      <-- starsetNat, starsetC
wenzelm@17423
  1912
  *s*          <-- *sNat*, *sc*
wenzelm@17423
  1913
  starset_n    <-- starsetNat_n, starsetC_n
wenzelm@17423
  1914
  *sn*         <-- *sNatn*, *scn*
wenzelm@17423
  1915
  InternalSets <-- InternalNatSets, InternalCSets
wenzelm@17423
  1916
huffman@17442
  1917
  starfun      <-- starfun{Nat,Nat2,C,RC,CR}
wenzelm@17423
  1918
  *f*          <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
huffman@17442
  1919
  starfun_n    <-- starfun{Nat,Nat2,C,RC,CR}_n
wenzelm@17423
  1920
  *fn*         <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
huffman@17442
  1921
  InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
wenzelm@17423
  1922
wenzelm@17423
  1923
* Hyperreal: Many type-specific theorems have been removed in favor of
huffman@17442
  1924
theorems specific to various axiomatic type classes (INCOMPATIBILITY):
huffman@17442
  1925
huffman@17442
  1926
  add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
huffman@17442
  1927
  add_assoc   <-- {hypreal,hypnat,hcomplex}_add_assocs
huffman@17442
  1928
  OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
huffman@17442
  1929
  OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
wenzelm@17423
  1930
  right_minus <-- hypreal_add_minus
huffman@17442
  1931
  left_minus <-- {hypreal,hcomplex}_add_minus_left
huffman@17442
  1932
  mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
huffman@17442
  1933
  mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
huffman@17442
  1934
  mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
wenzelm@17423
  1935
  mult_1_right <-- hcomplex_mult_one_right
wenzelm@17423
  1936
  mult_zero_left <-- hcomplex_mult_zero_left
huffman@17442
  1937
  left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
wenzelm@17423
  1938
  right_distrib <-- hypnat_add_mult_distrib2
huffman@17442
  1939
  zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
wenzelm@17423
  1940
  right_inverse <-- hypreal_mult_inverse
wenzelm@17423
  1941
  left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
huffman@17442
  1942
  order_refl <-- {hypreal,hypnat}_le_refl
huffman@17442
  1943
  order_trans <-- {hypreal,hypnat}_le_trans
huffman@17442
  1944
  order_antisym <-- {hypreal,hypnat}_le_anti_sym
huffman@17442
  1945
  order_less_le <-- {hypreal,hypnat}_less_le
huffman@17442
  1946
  linorder_linear <-- {hypreal,hypnat}_le_linear
huffman@17442
  1947
  add_left_mono <-- {hypreal,hypnat}_add_left_mono
huffman@17442
  1948
  mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
wenzelm@17423
  1949
  add_nonneg_nonneg <-- hypreal_le_add_order
wenzelm@17423
  1950
wenzelm@17423
  1951
* Hyperreal: Separate theorems having to do with type-specific
wenzelm@17423
  1952
versions of constants have been merged into theorems that apply to the
huffman@17442
  1953
new polymorphic constants (INCOMPATIBILITY):
huffman@17442
  1954
huffman@17442
  1955
  STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
huffman@17442
  1956
  STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
huffman@17442
  1957
  STAR_Un <-- {STAR,NatStar,STARC}_Un
huffman@17442
  1958
  STAR_Int <-- {STAR,NatStar,STARC}_Int
huffman@17442
  1959
  STAR_Compl <-- {STAR,NatStar,STARC}_Compl
huffman@17442
  1960
  STAR_subset <-- {STAR,NatStar,STARC}_subset
huffman@17442
  1961
  STAR_mem <-- {STAR,NatStar,STARC}_mem
huffman@17442
  1962
  STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
huffman@17442
  1963
  STAR_diff <-- {STAR,STARC}_diff
huffman@17442
  1964
  STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
huffman@17442
  1965
    STARC_hcomplex_of_complex}_image_subset
huffman@17442
  1966
  starset_n_Un <-- starset{Nat,C}_n_Un
huffman@17442
  1967
  starset_n_Int <-- starset{Nat,C}_n_Int
huffman@17442
  1968
  starset_n_Compl <-- starset{Nat,C}_n_Compl
huffman@17442
  1969
  starset_n_diff <-- starset{Nat,C}_n_diff
huffman@17442
  1970
  InternalSets_Un <-- Internal{Nat,C}Sets_Un
huffman@17442
  1971
  InternalSets_Int <-- Internal{Nat,C}Sets_Int
huffman@17442
  1972
  InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
huffman@17442
  1973
  InternalSets_diff <-- Internal{Nat,C}Sets_diff
huffman@17442
  1974
  InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
huffman@17442
  1975
  InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
huffman@17442
  1976
  starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
huffman@17442
  1977
  starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
huffman@17442
  1978
  starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
huffman@17442
  1979
  starfun <-- starfun{Nat,Nat2,C,RC,CR}
huffman@17442
  1980
  starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
huffman@17442
  1981
  starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
huffman@17442
  1982
  starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
huffman@17442
  1983
  starfun_diff <-- starfun{C,RC,CR}_diff
huffman@17442
  1984
  starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
huffman@17442
  1985
  starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
huffman@17442
  1986
  starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
huffman@17442
  1987
  starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
huffman@17442
  1988
  starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
huffman@17442
  1989
  starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
wenzelm@17423
  1990
  starfun_Id <-- starfunC_Id
huffman@17442
  1991
  starfun_approx <-- starfun{Nat,CR}_approx
huffman@17442
  1992
  starfun_capprox <-- starfun{C,RC}_capprox
wenzelm@17423
  1993
  starfun_abs <-- starfunNat_rabs
huffman@17442
  1994
  starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
huffman@17442
  1995
  starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
wenzelm@17423
  1996
  starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
huffman@17442
  1997
  starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
huffman@17442
  1998
  starfun_add_capprox <-- starfun{C,RC}_add_capprox
wenzelm@17423
  1999
  starfun_add_approx <-- starfunCR_add_approx
wenzelm@17423
  2000
  starfun_inverse_inverse <-- starfunC_inverse_inverse
huffman@17442
  2001
  starfun_divide <-- starfun{C,CR,RC}_divide
huffman@17442
  2002
  starfun_n <-- starfun{Nat,C}_n
huffman@17442
  2003
  starfun_n_mult <-- starfun{Nat,C}_n_mult
huffman@17442
  2004
  starfun_n_add <-- starfun{Nat,C}_n_add
wenzelm@17423
  2005
  starfun_n_add_minus <-- starfunNat_n_add_minus
huffman@17442
  2006
  starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
huffman@17442
  2007
  starfun_n_minus <-- starfun{Nat,C}_n_minus
huffman@17442
  2008
  starfun_n_eq <-- starfun{Nat,C}_n_eq
huffman@17442
  2009
huffman@17442
  2010
  star_n_add <-- {hypreal,hypnat,hcomplex}_add
huffman@17442
  2011
  star_n_minus <-- {hypreal,hcomplex}_minus
huffman@17442
  2012
  star_n_diff <-- {hypreal,hcomplex}_diff
huffman@17442
  2013
  star_n_mult <-- {hypreal,hcomplex}_mult
huffman@17442
  2014
  star_n_inverse <-- {hypreal,hcomplex}_inverse
huffman@17442
  2015
  star_n_le <-- {hypreal,hypnat}_le
huffman@17442
  2016
  star_n_less <-- {hypreal,hypnat}_less
huffman@17442
  2017
  star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
huffman@17442
  2018
  star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
wenzelm@17423
  2019
  star_n_abs <-- hypreal_hrabs
wenzelm@17423
  2020
  star_n_divide <-- hcomplex_divide
wenzelm@17423
  2021
huffman@17442
  2022
  star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
huffman@17442
  2023
  star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
wenzelm@17423
  2024
  star_of_diff <-- hypreal_of_real_diff
huffman@17442
  2025
  star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
huffman@17442
  2026
  star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
huffman@17442
  2027
  star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
huffman@17442
  2028
  star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
huffman@17442
  2029
  star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
huffman@17442
  2030
  star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
huffman@17442
  2031
  star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
huffman@17442
  2032
  star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
huffman@17442
  2033
  star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
huffman@17442
  2034
  star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
huffman@17442
  2035
  star_of_number_of <-- {hypreal,hcomplex}_number_of
wenzelm@17423
  2036
  star_of_number_less <-- number_of_less_hypreal_of_real_iff
wenzelm@17423
  2037
  star_of_number_le <-- number_of_le_hypreal_of_real_iff
wenzelm@17423
  2038
  star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
wenzelm@17423
  2039
  star_of_less_number <-- hypreal_of_real_less_number_of_iff
wenzelm@17423
  2040
  star_of_le_number <-- hypreal_of_real_le_number_of_iff
wenzelm@17423
  2041
  star_of_power <-- hypreal_of_real_power
wenzelm@17423
  2042
  star_of_eq_0 <-- hcomplex_of_complex_zero_iff
wenzelm@17423
  2043
huffman@17442
  2044
* Hyperreal: new method "transfer" that implements the transfer
huffman@17442
  2045
principle of nonstandard analysis. With a subgoal that mentions
huffman@17442
  2046
nonstandard types like "'a star", the command "apply transfer"
huffman@17442
  2047
replaces it with an equivalent one that mentions only standard types.
huffman@17442
  2048
To be successful, all free variables must have standard types; non-
huffman@17442
  2049
standard variables must have explicit universal quantifiers.
huffman@17442
  2050
wenzelm@17641
  2051
* Hyperreal: A theory of Taylor series.
wenzelm@17641
  2052
wenzelm@14655
  2053
wenzelm@14682
  2054
*** HOLCF ***
wenzelm@14682
  2055
wenzelm@17533
  2056
* Discontinued special version of 'constdefs' (which used to support
wenzelm@17533
  2057
continuous functions) in favor of the general Pure one with full
wenzelm@17533
  2058
type-inference.
wenzelm@17533
  2059
wenzelm@17533
  2060
* New simplification procedure for solving continuity conditions; it
wenzelm@17533
  2061
is much faster on terms with many nested lambda abstractions (cubic
huffman@17442
  2062
instead of exponential time).
huffman@17442
  2063
wenzelm@17533
  2064
* New syntax for domain package: selector names are now optional.
huffman@17442
  2065
Parentheses should be omitted unless argument is lazy, for example:
huffman@17442
  2066
huffman@17442
  2067
  domain 'a stream = cons "'a" (lazy "'a stream")
huffman@17442
  2068
wenzelm@17533
  2069
* New command 'fixrec' for defining recursive functions with pattern
wenzelm@17533
  2070
matching; defining multiple functions with mutual recursion is also
wenzelm@17533
  2071
supported.  Patterns may include the constants cpair, spair, up, sinl,
wenzelm@17533
  2072
sinr, or any data constructor defined by the domain package. The given
wenzelm@17533
  2073
equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
wenzelm@17533
  2074
syntax and examples.
wenzelm@17533
  2075
wenzelm@17533
  2076
* New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
wenzelm@17533
  2077
of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
wenzelm@17533
  2078
but the proof obligation additionally includes an admissibility
wenzelm@17533
  2079
requirement. The packages generate instances of class cpo or pcpo,
wenzelm@17533
  2080
with continuity and strictness theorems for Rep and Abs.
huffman@17442
  2081
huffman@17584
  2082
* HOLCF: Many theorems have been renamed according to a more standard naming
huffman@17584
  2083
scheme (INCOMPATIBILITY):
huffman@17584
  2084
huffman@17584
  2085
  foo_inject:  "foo$x = foo$y ==> x = y"
huffman@17584
  2086
  foo_eq:      "(foo$x = foo$y) = (x = y)"
huffman@17584
  2087
  foo_less:    "(foo$x << foo$y) = (x << y)"
huffman@17584
  2088
  foo_strict:  "foo$UU = UU"
huffman@17584
  2089
  foo_defined: "... ==> foo$x ~= UU"
huffman@17584
  2090
  foo_defined_iff: "(foo$x = UU) = (x = UU)"
huffman@17584
  2091
wenzelm@14682
  2092
paulson@14885
  2093
*** ZF ***
paulson@14885
  2094
wenzelm@16234
  2095
* ZF/ex: theories Group and Ring provide examples in abstract algebra,
wenzelm@16234
  2096
including the First Isomorphism Theorem (on quotienting by the kernel
wenzelm@16234
  2097
of a homomorphism).
wenzelm@15089
  2098
wenzelm@15089
  2099
* ZF/Simplifier: install second copy of type solver that actually
wenzelm@16234
  2100
makes use of TC rules declared to Isar proof contexts (or locales);
wenzelm@16234
  2101
the old version is still required for ML proof scripts.
wenzelm@15703
  2102
wenzelm@15703
  2103
wenzelm@17445
  2104
*** Cube ***
wenzelm@17445
  2105
wenzelm@17445
  2106
* Converted to Isar theory format; use locales instead of axiomatic
wenzelm@17445
  2107
theories.
wenzelm@17445
  2108
wenzelm@17445
  2109
wenzelm@15703
  2110
*** ML ***
wenzelm@15703
  2111
haftmann@21339
  2112
* Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
haftmann@21339
  2113
for ||>, ||>>, |>>,
haftmann@21339
  2114
wenzelm@15973
  2115
* Pure/library.ML no longer defines its own option datatype, but uses
wenzelm@16234
  2116
that of the SML basis, which has constructors NONE and SOME instead of
wenzelm@16234
  2117
None and Some, as well as exception Option.Option instead of OPTION.
wenzelm@16234
  2118
The functions the, if_none, is_some, is_none have been adapted
wenzelm@16234
  2119
accordingly, while Option.map replaces apsome.
wenzelm@15973
  2120
wenzelm@16860
  2121
* Pure/library.ML: the exception LIST has been given up in favour of
wenzelm@16860
  2122
the standard exceptions Empty and Subscript, as well as
wenzelm@16860
  2123
Library.UnequalLengths.  Function like Library.hd and Library.tl are
wenzelm@16860
  2124
superceded by the standard hd and tl functions etc.
wenzelm@16860
  2125
wenzelm@16860
  2126
A number of basic list functions are no longer exported to the ML
wenzelm@16860
  2127
toplevel, as they are variants of predefined functions.  The following
wenzelm@16234
  2128
suggests how one can translate existing code:
wenzelm@15973
  2129
wenzelm@15973
  2130
    rev_append xs ys = List.revAppend (xs, ys)
wenzelm@15973
  2131
    nth_elem (i, xs) = List.nth (xs, i)
wenzelm@15973
  2132
    last_elem xs = List.last xs
wenzelm@15973
  2133
    flat xss = List.concat xss
wenzelm@16234
  2134
    seq fs = List.app fs
wenzelm@15973
  2135
    partition P xs = List.partition P xs
wenzelm@15973
  2136
    mapfilter f xs = List.mapPartial f xs
wenzelm@15973
  2137
wenzelm@16860
  2138
* Pure/library.ML: several combinators for linear functional
wenzelm@16860
  2139
transformations, notably reverse application and composition:
wenzelm@16860
  2140
wenzelm@17371
  2141
  x |> f                f #> g
wenzelm@17371
  2142
  (x, y) |-> f          f #-> g
wenzelm@16860
  2143
haftmann@17495
  2144
* Pure/library.ML: introduced/changed precedence of infix operators:
haftmann@17495
  2145
haftmann@17495
  2146
  infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
haftmann@17495
  2147
  infix 2 ?;
haftmann@17495
  2148
  infix 3 o oo ooo oooo;
haftmann@17495
  2149
  infix 4 ~~ upto downto;
haftmann@17495
  2150
haftmann@17495
  2151
Maybe INCOMPATIBILITY when any of those is used in conjunction with other
haftmann@17495
  2152
infix operators.
haftmann@17495
  2153
wenzelm@17408
  2154
* Pure/library.ML: natural list combinators fold, fold_rev, and
haftmann@16869
  2155
fold_map support linear functional transformations and nesting.  For
wenzelm@16860
  2156
example:
wenzelm@16860
  2157
wenzelm@16860
  2158
  fold f [x1, ..., xN] y =
wenzelm@16860
  2159
    y |> f x1 |> ... |> f xN
wenzelm@16860
  2160
wenzelm@16860
  2161
  (fold o fold) f [xs1, ..., xsN] y =
wenzelm@16860
  2162
    y |> fold f xs1 |> ... |> fold f xsN
wenzelm@16860
  2163
wenzelm@16860
  2164
  fold f [x1, ..., xN] =
wenzelm@16860
  2165
    f x1 #> ... #> f xN
wenzelm@16860
  2166
wenzelm@16860
  2167
  (fold o fold) f [xs1, ..., xsN] =
wenzelm@16860
  2168
    fold f xs1 #> ... #> fold f xsN
wenzelm@16860
  2169
wenzelm@17408
  2170
* Pure/library.ML: the following selectors on type 'a option are
wenzelm@17408
  2171
available:
wenzelm@17408
  2172
wenzelm@17408
  2173
  the:               'a option -> 'a  (*partial*)
wenzelm@17408
  2174
  these:             'a option -> 'a  where 'a = 'b list
haftmann@17402
  2175
  the_default: 'a -> 'a option -> 'a
haftmann@17402
  2176
  the_list:          'a option -> 'a list
haftmann@17402
  2177
wenzelm@17408
  2178
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
wenzelm@17408
  2179
basic operations for association lists, following natural argument
haftmann@17564
  2180
order; moreover the explicit equality predicate passed here avoids
haftmann@17495
  2181
potentially expensive polymorphic runtime equality checks.
haftmann@17495
  2182
The old functions may be expressed as follows:
wenzelm@17408
  2183
wenzelm@17408
  2184
  assoc = uncurry (AList.lookup (op =))
wenzelm@17408
  2185
  assocs = these oo AList.lookup (op =)
wenzelm@17408
  2186
  overwrite = uncurry (AList.update (op =)) o swap
wenzelm@17408
  2187
haftmann@17564
  2188
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
haftmann@17564
  2189
haftmann@17564
  2190
  val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
haftmann@17564
  2191
  val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
haftmann@17564
  2192
haftmann@17564
  2193
replacing make_keylist and keyfilter (occassionally used)
haftmann@17564
  2194
Naive rewrites:
haftmann@17564
  2195
haftmann@17564
  2196
  make_keylist = AList.make
haftmann@17564
  2197
  keyfilter = AList.find (op =)
haftmann@17564
  2198
haftmann@17564
  2199
* eq_fst and eq_snd now take explicit equality parameter, thus
haftmann@17564
  2200
  avoiding eqtypes. Naive rewrites:
haftmann@17564
  2201
haftmann@17564
  2202
    eq_fst = eq_fst (op =)
haftmann@17564
  2203
    eq_snd = eq_snd (op =)
haftmann@17564
  2204
haftmann@17564
  2205
* Removed deprecated apl and apr (rarely used).
haftmann@17564
  2206
  Naive rewrites:
haftmann@17564
  2207
haftmann@17564
  2208
    apl (n, op) =>>= curry op n
haftmann@17564
  2209
    apr (op, m) =>>= fn n => op (n, m)
haftmann@17564
  2210
wenzelm@17408
  2211
* Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
wenzelm@17408
  2212
provides a reasonably efficient light-weight implementation of sets as
wenzelm@17408
  2213
lists.
wenzelm@17408
  2214
wenzelm@17408
  2215
* Pure/General: generic tables (cf. Pure/General/table.ML) provide a
wenzelm@17408
  2216
few new operations; existing lookup and update are now curried to
wenzelm@17408
  2217
follow natural argument order (for use with fold etc.);
wenzelm@17408
  2218
INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
wenzelm@17408
  2219
wenzelm@17408
  2220
* Pure/General: output via the Isabelle channels of
wenzelm@17408
  2221
writeln/warning/error etc. is now passed through Output.output, with a
wenzelm@17408
  2222
hook for arbitrary transformations depending on the print_mode
wenzelm@17408
  2223
(cf. Output.add_mode -- the first active mode that provides a output
wenzelm@17408
  2224
function wins).  Already formatted output may be embedded into further
wenzelm@17408
  2225
text via Output.raw; the result of Pretty.string_of/str_of and derived
wenzelm@17408
  2226
functions (string_of_term/cterm/thm etc.) is already marked raw to
wenzelm@17408
  2227
accommodate easy composition of diagnostic messages etc.  Programmers
wenzelm@17408
  2228
rarely need to care about Output.output or Output.raw at all, with
wenzelm@17408
  2229
some notable exceptions: Output.output is required when bypassing the
wenzelm@17408
  2230
standard channels (writeln etc.), or in token translations to produce
wenzelm@17408
  2231
properly formatted results; Output.raw is required when capturing
wenzelm@17408
  2232
already output material that will eventually be presented to the user
wenzelm@17408
  2233
a second time.  For the default print mode, both Output.output and
wenzelm@17408
  2234
Output.raw have no effect.
wenzelm@17408
  2235
wenzelm@17408
  2236
* Pure/General: Output.time_accumulator NAME creates an operator ('a
wenzelm@17408
  2237
-> 'b) -> 'a -> 'b to measure runtime and count invocations; the
wenzelm@17408
  2238
cumulative results are displayed at the end of a batch session.
wenzelm@17408
  2239
wenzelm@17408
  2240
* Pure/General: File.sysify_path and File.quote_sysify path have been
wenzelm@17408
  2241
replaced by File.platform_path and File.shell_path (with appropriate
wenzelm@17408
  2242
hooks).  This provides a clean interface for unusual systems where the
wenzelm@17408
  2243
internal and external process view of file names are different.
wenzelm@17408
  2244
wenzelm@16689
  2245
* Pure: more efficient orders for basic syntactic entities: added
wenzelm@16689
  2246
fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
wenzelm@16689
  2247
and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
wenzelm@16689
  2248
NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
wenzelm@16689
  2249
orders now -- potential INCOMPATIBILITY for code that depends on a
wenzelm@16689
  2250
particular order for Symtab.keys, Symtab.dest, etc. (consider using
wenzelm@16689
  2251
Library.sort_strings on result).
wenzelm@16689
  2252
wenzelm@17408
  2253
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
wenzelm@17408
  2254
fold_types traverse types/terms from left to right, observing natural
wenzelm@17408
  2255
argument order.  Supercedes previous foldl_XXX versions, add_frees,
wenzelm@17408
  2256
add_vars etc. have been adapted as well: INCOMPATIBILITY.
wenzelm@17408
  2257
wenzelm@16151
  2258
* Pure: name spaces have been refined, with significant changes of the
wenzelm@16234
  2259
internal interfaces -- INCOMPATIBILITY.  Renamed cond_extern(_table)
wenzelm@16234
  2260
to extern(_table).  The plain name entry path is superceded by a
wenzelm@16234
  2261
general 'naming' context, which also includes the 'policy' to produce
wenzelm@16234
  2262
a fully qualified name and external accesses of a fully qualified
wenzelm@16234
  2263
name; NameSpace.extend is superceded by context dependent
wenzelm@16234
  2264
Sign.declare_name.  Several theory and proof context operations modify
wenzelm@16234
  2265
the naming context.  Especially note Theory.restore_naming and
wenzelm@16234
  2266
ProofContext.restore_naming to get back to a sane state; note that
wenzelm@16234
  2267
Theory.add_path is no longer sufficient to recover from
wenzelm@16234
  2268
Theory.absolute_path in particular.
wenzelm@16234
  2269
wenzelm@16234
  2270
* Pure: new flags short_names (default false) and unique_names
wenzelm@16234
  2271
(default true) for controlling output of qualified names.  If
wenzelm@16234
  2272
short_names is set, names are printed unqualified.  If unique_names is
wenzelm@16234
  2273
reset, the name prefix is reduced to the minimum required to achieve
wenzelm@16234
  2274
the original result when interning again, even if there is an overlap
wenzelm@16234
  2275
with earlier declarations.
wenzelm@16151
  2276
wenzelm@16456
  2277
* Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
wenzelm@16456
  2278
now 'extend', and 'merge' gets an additional Pretty.pp argument
wenzelm@16456
  2279
(useful for printing error messages).  INCOMPATIBILITY.
wenzelm@16456
  2280
wenzelm@16456
  2281
* Pure: major reorganization of the theory context.  Type Sign.sg and
wenzelm@16456
  2282
Theory.theory are now identified, referring to the universal
wenzelm@16456
  2283
Context.theory (see Pure/context.ML).  Actual signature and theory
wenzelm@16456
  2284
content is managed as theory data.  The old code and interfaces were
wenzelm@16456
  2285
spread over many files and structures; the new arrangement introduces
wenzelm@16456
  2286
considerable INCOMPATIBILITY to gain more clarity:
wenzelm@16456
  2287
wenzelm@16456
  2288
  Context -- theory management operations (name, identity, inclusion,
wenzelm@16456
  2289
    parents, ancestors, merge, etc.), plus generic theory data;
wenzelm@16456
  2290
wenzelm@16456
  2291
  Sign -- logical signature and syntax operations (declaring consts,
wenzelm@16456
  2292
    types, etc.), plus certify/read for common entities;
wenzelm@16456
  2293
wenzelm@16456
  2294
  Theory -- logical theory operations (stating axioms, definitions,
wenzelm@16456
  2295
    oracles), plus a copy of logical signature operations (consts,
wenzelm@16456
  2296
    types, etc.); also a few basic management operations (Theory.copy,
wenzelm@16456
  2297
    Theory.merge, etc.)
wenzelm@16456
  2298
wenzelm@16456
  2299
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
wenzelm@16456
  2300
etc.) as well as the sign field in Thm.rep_thm etc. have been retained
wenzelm@16456
  2301
for convenience -- they merely return the theory.
wenzelm@16456
  2302
wenzelm@17193
  2303
* Pure: type Type.tsig is superceded by theory in most interfaces.
wenzelm@17193
  2304
wenzelm@16547
  2305
* Pure: the Isar proof context type is already defined early in Pure
wenzelm@16547
  2306
as Context.proof (note that ProofContext.context and Proof.context are
wenzelm@16547
  2307
aliases, where the latter is the preferred name).  This enables other
wenzelm@16547
  2308
Isabelle components to refer to that type even before Isar is present.
wenzelm@16547
  2309
wenzelm@16373
  2310
* Pure/sign/theory: discontinued named name spaces (i.e. classK,
wenzelm@16373
  2311
typeK, constK, axiomK, oracleK), but provide explicit operations for
wenzelm@16373
  2312
any of these kinds.  For example, Sign.intern typeK is now
wenzelm@16373
  2313
Sign.intern_type, Theory.hide_space Sign.typeK is now
wenzelm@16373
  2314
Theory.hide_types.  Also note that former
wenzelm@16373
  2315
Theory.hide_classes/types/consts are now
wenzelm@16373
  2316
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
wenzelm@16373
  2317
internalize their arguments!  INCOMPATIBILITY.
wenzelm@16373
  2318
wenzelm@16506
  2319
* Pure: get_thm interface (of PureThy and ProofContext) expects
wenzelm@16506
  2320
datatype thmref (with constructors Name and NameSelection) instead of
wenzelm@16506
  2321
plain string -- INCOMPATIBILITY;
wenzelm@16506
  2322
wenzelm@16151
  2323
* Pure: cases produced by proof methods specify options, where NONE
wenzelm@16234
  2324
means to remove case bindings -- INCOMPATIBILITY in
wenzelm@16234
  2325
(RAW_)METHOD_CASES.
wenzelm@16151
  2326
wenzelm@16373
  2327
* Pure: the following operations retrieve axioms or theorems from a
wenzelm@16373
  2328
theory node or theory hierarchy, respectively:
wenzelm@16373
  2329
wenzelm@16373
  2330
  Theory.axioms_of: theory -> (string * term) list
wenzelm@16373
  2331
  Theory.all_axioms_of: theory -> (string * term) list
wenzelm@16373
  2332
  PureThy.thms_of: theory -> (string * thm) list
wenzelm@16373
  2333
  PureThy.all_thms_of: theory -> (string * thm) list
wenzelm@16373
  2334
wenzelm@16718
  2335
* Pure: print_tac now outputs the goal through the trace channel.
wenzelm@16718
  2336
wenzelm@17408
  2337
* Isar toplevel: improved diagnostics, mostly for Poly/ML only.
wenzelm@17408
  2338
Reference Toplevel.debug (default false) controls detailed printing
wenzelm@17408
  2339
and tracing of low-level exceptions; Toplevel.profiling (default 0)
wenzelm@17408
  2340
controls execution profiling -- set to 1 for time and 2 for space
wenzelm@17408
  2341
(both increase the runtime).
wenzelm@17408
  2342
wenzelm@17408
  2343
* Isar session: The initial use of ROOT.ML is now always timed,
wenzelm@17408
  2344
i.e. the log will show the actual process times, in contrast to the
wenzelm@17408
  2345
elapsed wall-clock time that the outer shell wrapper produces.
wenzelm@17408
  2346
wenzelm@17408
  2347
* Simplifier: improved handling of bound variables (nameless
wenzelm@16997
  2348
representation, avoid allocating new strings).  Simprocs that invoke
wenzelm@16997
  2349
the Simplifier recursively should use Simplifier.inherit_bounds to
wenzelm@17720
  2350
avoid local name clashes.  Failure to do so produces warnings
wenzelm@17720
  2351
"Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
wenzelm@17720
  2352
for further details.
wenzelm@16234
  2353
wenzelm@17166
  2354
* ML functions legacy_bindings and use_legacy_bindings produce ML fact
wenzelm@17166
  2355
bindings for all theorems stored within a given theory; this may help
wenzelm@17166
  2356
in porting non-Isar theories to Isar ones, while keeping ML proof
wenzelm@17166
  2357
scripts for the time being.
wenzelm@17166
  2358
wenzelm@17457
  2359
* ML operator HTML.with_charset specifies the charset begin used for
wenzelm@17457
  2360
generated HTML files.  For example:
wenzelm@17457
  2361
wenzelm@17457
  2362
  HTML.with_charset "utf-8" use_thy "Hebrew";
wenzelm@17538
  2363
  HTML.with_charset "utf-8" use_thy "Chinese";
wenzelm@17457
  2364
wenzelm@16234
  2365
wenzelm@16234
  2366
*** System ***
wenzelm@16234
  2367
wenzelm@16234
  2368
* Allow symlinks to all proper Isabelle executables (Isabelle,
wenzelm@16234
  2369
isabelle, isatool etc.).
wenzelm@16234
  2370
wenzelm@16234
  2371
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for
wenzelm@16234
  2372
isatool doc, isatool mkdir, display_drafts etc.).
wenzelm@16234
  2373
wenzelm@16234
  2374
* isatool usedir: option -f allows specification of the ML file to be
wenzelm@16234
  2375
used by Isabelle; default is ROOT.ML.
wenzelm@16234
  2376
wenzelm@16251
  2377
* New isatool version outputs the version identifier of the Isabelle
wenzelm@16251
  2378
distribution being used.
wenzelm@16251
  2379
wenzelm@16251
  2380
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format
wenzelm@16234
  2381
(containing Boolean satisfiability problems) into Isabelle/HOL
wenzelm@16234
  2382
theories.
wenzelm@15703
  2383
wenzelm@15703
  2384
wenzelm@14655
  2385
wenzelm@14606
  2386
New in Isabelle2004 (April 2004)
wenzelm@14606
  2387
--------------------------------
wenzelm@13280
  2388
skalberg@14171
  2389
*** General ***
skalberg@14171
  2390
ballarin@14398
  2391
* Provers/order.ML:  new efficient reasoner for partial and linear orders.
ballarin@14398
  2392
  Replaces linorder.ML.
ballarin@14398
  2393
wenzelm@14606
  2394
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
wenzelm@14606
  2395
  (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
skalberg@14173
  2396
  (\<a>...\<z>), are now considered normal letters, and can therefore
skalberg@14173
  2397
  be used anywhere where an ASCII letter (a...zA...Z) has until
skalberg@14173
  2398
  now. COMPATIBILITY: This obviously changes the parsing of some
skalberg@14173
  2399
  terms, especially where a symbol has been used as a binder, say
skalberg@14173
  2400
  '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
skalberg@14173
  2401
  as an identifier.  Fix it by inserting a space around former
skalberg@14173
  2402
  symbols.  Call 'isatool fixgreek' to try to fix parsing errors in
skalberg@14173
  2403
  existing theory and ML files.
skalberg@14171
  2404
paulson@14237
  2405
* Pure: Macintosh and Windows line-breaks are now allowed in theory files.
paulson@14237
  2406
wenzelm@14731
  2407
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
wenzelm@14731
  2408
  allowed in identifiers. Similar to Greek letters \<^isub> is now considered
wenzelm@14731
  2409
  a normal (but invisible) letter. For multiple letter subscripts repeat
wenzelm@14731
  2410
  \<^isub> like this: x\<^isub>1\<^isub>2.
kleing@14233
  2411
kleing@14333
  2412
* Pure: There are now sub-/superscripts that can span more than one
kleing@14333
  2413
  character. Text between \<^bsub> and \<^esub> is set in subscript in
wenzelm@14606
  2414
  ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
wenzelm@14606
  2415
  superscript. The new control characters are not identifier parts.
kleing@14333
  2416
schirmer@14561
  2417
* Pure: Control-symbols of the form \<^raw:...> will literally print the
wenzelm@14606
  2418
  content of "..." to the latex file instead of \isacntrl... . The "..."
wenzelm@14606
  2419
  may consist of any printable characters excluding the end bracket >.
schirmer@14361
  2420
paulson@14237
  2421
* Pure: Using new Isar command "finalconsts" (or the ML functions
paulson@14237
  2422
  Theory.add_finals or Theory.add_finals_i) it is now possible to
paulson@14237
  2423
  declare constants "final", which prevents their being given a definition
paulson@14237
  2424
  later.  It is useful for constants whose behaviour is fixed axiomatically
skalberg@14224
  2425
  rather than definitionally, such as the meta-logic connectives.
skalberg@14224
  2426
wenzelm@14606
  2427
* Pure: 'instance' now handles general arities with general sorts
wenzelm@14606
  2428
  (i.e. intersections of classes),
skalberg@14503
  2429
kleing@14547
  2430
* Presentation: generated HTML now uses a CSS style sheet to make layout
wenzelm@14731
  2431
  (somewhat) independent of content. It is copied from lib/html/isabelle.css.
kleing@14547
  2432
  It can be changed to alter the colors/layout of generated pages.
kleing@14547
  2433
wenzelm@14556
  2434
ballarin@14175
  2435
*** Isar ***
ballarin@14175
  2436
ballarin@14508
  2437
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
ballarin@14508
  2438
  cut_tac, subgoal_tac and thin_tac:
ballarin@14175
  2439
  - Now understand static (Isar) contexts.  As a consequence, users of Isar
ballarin@14175
  2440
    locales are no longer forced to write Isar proof scripts.
ballarin@14175
  2441
    For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
ballarin@14175
  2442
    emulations.
ballarin@14175
  2443
  - INCOMPATIBILITY: names of variables to be instantiated may no
ballarin@14211
  2444
    longer be enclosed in quotes.  Instead, precede variable name with `?'.
ballarin@14211
  2445
    This is consistent with the instantiation attribute "where".
ballarin@14211
  2446
ballarin@14257
  2447
* Attributes "where" and "of":
ballarin@14285
  2448
  - Now take type variables of instantiated theorem into account when reading
ballarin@14285
  2449
    the instantiation string.  This fixes a bug that caused instantiated
ballarin@14285
  2450
    theorems to have too special types in some circumstances.
ballarin@14285
  2451
  - "where" permits explicit instantiations of type variables.
ballarin@14257
  2452
wenzelm@14556
  2453
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm@14556
  2454
  current facts ("this"), admitting arbitrary combinations with "then"
wenzelm@14556
  2455
  and derived forms.
kleing@14283
  2456
ballarin@14211
  2457
* Locales:
ballarin@14211
  2458
  - Goal statements involving the context element "includes" no longer
ballarin@14211
  2459
    generate theorems with internal delta predicates (those ending on
ballarin@14211
  2460
    "_axioms") in the premise.
ballarin@14211
  2461
    Resolve particular premise with <locale>.intro to obtain old form.
ballarin@14211
  2462
  - Fixed bug in type inference ("unify_frozen") that prevented mix of target
ballarin@14211
  2463
    specification and "includes" elements in goal statement.
ballarin@14254
  2464
  - Rule sets <locale>.intro and <locale>.axioms no longer declared as
ballarin@14254
  2465
    [intro?] and [elim?] (respectively) by default.
ballarin@14508
  2466
  - Experimental command for instantiation of locales in proof contexts:
ballarin@14551
  2467
        instantiate <label>[<attrs>]: <loc>
ballarin@14508
  2468
    Instantiates locale <loc> and adds all its theorems to the current context
ballarin@14551
  2469
    taking into account their attributes.  Label and attrs are optional
ballarin@14551
  2470
    modifiers, like in theorem declarations.  If present, names of
ballarin@14551
  2471
    instantiated theorems are qualified with <label>, and the attributes
ballarin@14551
  2472
    <attrs> are applied after any attributes these theorems might have already.
ballarin@14551
  2473
      If the locale has assumptions, a chained fact of the form
ballarin@14508
  2474
    "<loc> t1 ... tn" is expected from which instantiations of the parameters
ballarin@14551
  2475
    are derived.  The command does not support old-style locales declared
ballarin@14551
  2476
    with "locale (open)".
ballarin@14551
  2477
      A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
ballarin@14175
  2478
ballarin@14175
  2479
* HOL: Tactic emulation methods induct_tac and case_tac understand static
ballarin@14175
  2480
  (Isar) contexts.
ballarin@14175
  2481
wenzelm@14556
  2482
kleing@14136
  2483
*** HOL ***
kleing@14136
  2484
kleing@14624
  2485
* Proof import: new image HOL4 contains the imported library from
kleing@14624
  2486
  the HOL4 system with about 2500 theorems. It is imported by
kleing@14624
  2487
  replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
kleing@14624
  2488
  can be used like any other Isabelle image.  See
kleing@14624
  2489
  HOL/Import/HOL/README for more information.
kleing@14624
  2490
ballarin@14398
  2491
* Simplifier:
ballarin@14398
  2492
  - Much improved handling of linear and partial orders.
ballarin@14398
  2493
    Reasoners for linear and partial orders are set up for type classes
ballarin@14398
  2494
    "linorder" and "order" respectively, and are added to the default simpset
ballarin@14398
  2495
    as solvers.  This means that the simplifier can build transitivity chains
ballarin@14398
  2496
    to solve goals from the assumptions.
ballarin@14398
  2497
  - INCOMPATIBILITY: old proofs break occasionally.  Typically, applications
ballarin@14398
  2498
    of blast or auto after simplification become unnecessary because the goal
ballarin@14398
  2499
    is solved by simplification already.
ballarin@14398
  2500
wenzelm@14731
  2501
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
paulson@14389
  2502
    all proved in axiomatic type classes for semirings, rings and fields.
paulson@14389
  2503
paulson@14389
  2504
* Numerics:
paulson@14389
  2505
  - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
wenzelm@14731
  2506
    now formalized using the Ring_and_Field theory mentioned above.
paulson@14389
  2507
  - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
paulson@14389
  2508
    than before, because now they are set up once in a generic manner.
wenzelm@14731
  2509
  - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
paulson@14480
  2510
    Look for the general versions in Ring_and_Field (and Power if they concern
paulson@14480
  2511
    exponentiation).
paulson@14389
  2512
paulson@14401
  2513
* Type "rat" of the rational numbers is now available in HOL-Complex.
paulson@14389
  2514
schirmer@14255
  2515
* Records:
schirmer@14255
  2516
  - Record types are now by default printed with their type abbreviation
schirmer@14255
  2517
    instead of the list of all field types. This can be configured via
schirmer@14255
  2518
    the reference "print_record_type_abbr".
wenzelm@14731
  2519
  - Simproc "record_upd_simproc" for simplification of multiple updates added
schirmer@14255
  2520
    (not enabled by default).
schirmer@14427
  2521
  - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
schirmer@14427
  2522
    EX x. x = sel r to True (not enabled by default).
schirmer@14255
  2523
  - Tactic "record_split_simp_tac" to split and simplify records added.
wenzelm@14731
  2524
kleing@14136
  2525
* 'specification' command added, allowing for definition by
skalberg@14224
  2526
  specification.  There is also an 'ax_specification' command that
skalberg@14224
  2527
  introduces the new constants axiomatically.
kleing@14136
  2528
nipkow@14375
  2529
* arith(_tac) is now able to generate counterexamples for reals as well.
nipkow@14375
  2530
ballarin@14399
  2531
* HOL-Algebra: new locale "ring" for non-commutative rings.
ballarin@14399
  2532
paulson@14243
  2533
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
kleing@14610
  2534
  definitions, thanks to Sava Krsti\'{c} and John Matthews.
kleing@14610
  2535
wenzelm@14731
  2536
* HOL-Matrix: a first theory for matrices in HOL with an application of
kleing@14610
  2537
  matrix theory to linear programming.
kleing@14136
  2538
nipkow@14380
  2539
* Unions and Intersections:
nipkow@15119
  2540
  The latex output syntax of UN and INT has been changed
nipkow@15119
  2541
  from "\Union x \in A. B" to "\Union_{x \in A} B"
nipkow@15119
  2542
  i.e. the index formulae has become a subscript.