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