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