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