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