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