NEWS
author wenzelm
Tue Feb 08 17:36:21 2011 +0100 (2011-02-08)
changeset 41718 05514b09bb4b
parent 41703 d27950860514
child 41728 2837df4d1c7a
permissions -rw-r--r--
discontinued support for Poly/ML 5.2, which was the last version without proper multithreading and TimeLimit implementation;
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@41651
     4
New in this Isabelle version
wenzelm@41651
     5
----------------------------
wenzelm@41651
     6
wenzelm@41703
     7
*** General ***
wenzelm@41703
     8
wenzelm@41703
     9
* Parallelization of nested Isar proofs is subject to
wenzelm@41703
    10
Goal.parallel_proofs_threshold (default 100).  See also isabelle
wenzelm@41703
    11
usedir option -Q.
wenzelm@41703
    12
wenzelm@41718
    13
* Discontinued support for Poly/ML 5.2, which was the last version
wenzelm@41718
    14
without proper multithreading and TimeLimit implementation.
wenzelm@41718
    15
wenzelm@41703
    16
krauss@41685
    17
*** Document preparation ***
krauss@41685
    18
krauss@41685
    19
* New term style "isub" as ad-hoc conversion of variables x1, y23 into
krauss@41685
    20
subscripted form x\<^isub>1, y\<^isub>2\<^isub>3.
wenzelm@41651
    21
wenzelm@41651
    22
wenzelm@41703
    23
wenzelm@41512
    24
New in Isabelle2011 (January 2011)
wenzelm@41512
    25
----------------------------------
wenzelm@37383
    26
wenzelm@37536
    27
*** General ***
wenzelm@37536
    28
wenzelm@41573
    29
* Experimental Prover IDE based on Isabelle/Scala and jEdit (see
wenzelm@41612
    30
src/Tools/jEdit).  This also serves as IDE for Isabelle/ML, with
wenzelm@41612
    31
useful tooltips and hyperlinks produced from its static analysis.  The
wenzelm@41612
    32
bundled component provides an executable Isabelle tool that can be run
wenzelm@41612
    33
like this:
wenzelm@41612
    34
wenzelm@41612
    35
  Isabelle2011/bin/isabelle jedit
wenzelm@41573
    36
wenzelm@40948
    37
* Significantly improved Isabelle/Isar implementation manual.
wenzelm@40948
    38
wenzelm@41594
    39
* System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
wenzelm@41595
    40
(and thus refers to something like $HOME/.isabelle/Isabelle2011),
wenzelm@41594
    41
while the default heap location within that directory lacks that extra
wenzelm@41594
    42
suffix.  This isolates multiple Isabelle installations from each
wenzelm@41594
    43
other, avoiding problems with old settings in new versions.
wenzelm@41594
    44
INCOMPATIBILITY, need to copy/upgrade old user settings manually.
wenzelm@41594
    45
wenzelm@40947
    46
* Source files are always encoded as UTF-8, instead of old-fashioned
wenzelm@40947
    47
ISO-Latin-1.  INCOMPATIBILITY.  Isabelle LaTeX documents might require
wenzelm@40948
    48
the following package declarations:
wenzelm@40947
    49
wenzelm@40947
    50
  \usepackage[utf8]{inputenc}
wenzelm@40947
    51
  \usepackage{textcomp}
wenzelm@40947
    52
krauss@41440
    53
* Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
wenzelm@37536
    54
a Unicode character is treated as a single symbol, not a sequence of
wenzelm@37536
    55
non-ASCII bytes as before.  Since Isabelle/ML string literals may
wenzelm@37536
    56
contain symbols without further backslash escapes, Unicode can now be
wenzelm@37536
    57
used here as well.  Recall that Symbol.explode in ML provides a
wenzelm@37536
    58
consistent view on symbols, while raw explode (or String.explode)
wenzelm@37536
    59
merely give a byte-oriented representation.
wenzelm@37536
    60
wenzelm@41594
    61
* Theory loader: source files are primarily located via the master
wenzelm@41594
    62
directory of each theory node (where the .thy file itself resides).
wenzelm@41594
    63
The global load path is still partially available as legacy feature.
wenzelm@41594
    64
Minor INCOMPATIBILITY due to subtle change in file lookup: use
wenzelm@41594
    65
explicit paths, relatively to the theory.
wenzelm@38135
    66
wenzelm@37939
    67
* Special treatment of ML file names has been discontinued.
wenzelm@37939
    68
Historically, optional extensions .ML or .sml were added on demand --
wenzelm@37939
    69
at the cost of clarity of file dependencies.  Recall that Isabelle/ML
wenzelm@37939
    70
files exclusively use the .ML extension.  Minor INCOMPATIBILTY.
wenzelm@37939
    71
wenzelm@38980
    72
* Various options that affect pretty printing etc. are now properly
wenzelm@38767
    73
handled within the context via configuration options, instead of
wenzelm@40879
    74
unsynchronized references or print modes.  There are both ML Config.T
wenzelm@40879
    75
entities and Isar declaration attributes to access these.
wenzelm@38767
    76
wenzelm@39125
    77
  ML (Config.T)                 Isar (attribute)
wenzelm@39125
    78
wenzelm@39128
    79
  eta_contract                  eta_contract
wenzelm@39137
    80
  show_brackets                 show_brackets
wenzelm@39134
    81
  show_sorts                    show_sorts
wenzelm@39134
    82
  show_types                    show_types
wenzelm@39126
    83
  show_question_marks           show_question_marks
wenzelm@39126
    84
  show_consts                   show_consts
wenzelm@40879
    85
  show_abbrevs                  show_abbrevs
wenzelm@39126
    86
wenzelm@41379
    87
  Syntax.ast_trace              syntax_ast_trace
wenzelm@41379
    88
  Syntax.ast_stat               syntax_ast_stat
wenzelm@39126
    89
  Syntax.ambiguity_level        syntax_ambiguity_level
wenzelm@39126
    90
wenzelm@39126
    91
  Goal_Display.goals_limit      goals_limit
wenzelm@39126
    92
  Goal_Display.show_main_goal   show_main_goal
wenzelm@39126
    93
wenzelm@41379
    94
  Method.rule_trace             rule_trace
wenzelm@41379
    95
wenzelm@39125
    96
  Thy_Output.display            thy_output_display
wenzelm@39125
    97
  Thy_Output.quotes             thy_output_quotes
wenzelm@39125
    98
  Thy_Output.indent             thy_output_indent
wenzelm@39125
    99
  Thy_Output.source             thy_output_source
wenzelm@39125
   100
  Thy_Output.break              thy_output_break
wenzelm@39125
   101
krauss@41440
   102
Note that corresponding "..._default" references in ML may only be
wenzelm@38767
   103
changed globally at the ROOT session setup, but *not* within a theory.
wenzelm@40879
   104
The option "show_abbrevs" supersedes the former print mode
wenzelm@40879
   105
"no_abbrevs" with inverted meaning.
wenzelm@38767
   106
wenzelm@40878
   107
* More systematic naming of some configuration options.
huffman@41294
   108
INCOMPATIBILITY.
wenzelm@40878
   109
wenzelm@40878
   110
  trace_simp  ~>  simp_trace
wenzelm@40878
   111
  debug_simp  ~>  simp_debug
wenzelm@40878
   112
wenzelm@40291
   113
* Support for real valued configuration options, using simplistic
wenzelm@40291
   114
floating-point notation that coincides with the inner syntax for
wenzelm@40291
   115
float_token.
wenzelm@40291
   116
wenzelm@41594
   117
* Support for real valued preferences (with approximative PGIP type):
wenzelm@41594
   118
front-ends need to accept "pgint" values in float notation.
wenzelm@41594
   119
INCOMPATIBILITY.
wenzelm@41573
   120
wenzelm@41573
   121
* The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
wenzelm@41573
   122
DejaVu Sans.
wenzelm@41573
   123
wenzelm@41594
   124
* Discontinued support for Poly/ML 5.0 and 5.1 versions.
wenzelm@41594
   125
wenzelm@40948
   126
wenzelm@40948
   127
*** Pure ***
wenzelm@40948
   128
wenzelm@41249
   129
* Command 'type_synonym' (with single argument) replaces somewhat
wenzelm@41249
   130
outdated 'types', which is still available as legacy feature for some
wenzelm@41249
   131
time.
wenzelm@41249
   132
wenzelm@41249
   133
* Command 'nonterminal' (with 'and' separated list of arguments)
wenzelm@41249
   134
replaces somewhat outdated 'nonterminals'.  INCOMPATIBILITY.
wenzelm@41229
   135
wenzelm@40965
   136
* Command 'notepad' replaces former 'example_proof' for
wenzelm@41020
   137
experimentation in Isar without any result.  INCOMPATIBILITY.
wenzelm@40965
   138
ballarin@41435
   139
* Locale interpretation commands 'interpret' and 'sublocale' accept
ballarin@41435
   140
lists of equations to map definitions in a locale to appropriate
ballarin@41435
   141
entities in the context of the interpretation.  The 'interpretation'
ballarin@41435
   142
command already provided this functionality.
ballarin@41435
   143
wenzelm@41594
   144
* Diagnostic command 'print_dependencies' prints the locale instances
wenzelm@41594
   145
that would be activated if the specified expression was interpreted in
wenzelm@41594
   146
the current context.  Variant "print_dependencies!" assumes a context
wenzelm@41594
   147
without interpretations.
ballarin@38110
   148
ballarin@38110
   149
* Diagnostic command 'print_interps' prints interpretations in proofs
ballarin@38110
   150
in addition to interpretations in theories.
ballarin@38110
   151
wenzelm@38708
   152
* Discontinued obsolete 'global' and 'local' commands to manipulate
wenzelm@38708
   153
the theory name space.  Rare INCOMPATIBILITY.  The ML functions
wenzelm@38708
   154
Sign.root_path and Sign.local_path may be applied directly where this
wenzelm@38708
   155
feature is still required for historical reasons.
wenzelm@38708
   156
wenzelm@40948
   157
* Discontinued obsolete 'constdefs' command.  INCOMPATIBILITY, use
haftmann@39215
   158
'definition' instead.
haftmann@39215
   159
wenzelm@41574
   160
* The "prems" fact, which refers to the accidental collection of
wenzelm@41574
   161
foundational premises in the context, is now explicitly marked as
wenzelm@41594
   162
legacy feature and will be discontinued soon.  Consider using "assms"
wenzelm@41594
   163
of the head statement or reference facts by explicit names.
wenzelm@41574
   164
wenzelm@40801
   165
* Document antiquotations @{class} and @{type} print classes and type
wenzelm@40801
   166
constructors.
wenzelm@40801
   167
wenzelm@40801
   168
* Document antiquotation @{file} checks file/directory entries within
wenzelm@40801
   169
the local file system.
haftmann@39305
   170
ballarin@38110
   171
haftmann@37387
   172
*** HOL ***
haftmann@37387
   173
wenzelm@41594
   174
* Coercive subtyping: functions can be declared as coercions and type
wenzelm@41594
   175
inference will add them as necessary upon input of a term.  Theory
wenzelm@41594
   176
Complex_Main declares real :: nat => real and real :: int => real as
wenzelm@41594
   177
coercions. A coercion function f is declared like this:
wenzelm@40939
   178
wenzelm@40939
   179
  declare [[coercion f]]
nipkow@40866
   180
wenzelm@41571
   181
To lift coercions through type constructors (e.g. from nat => real to
nipkow@40866
   182
nat list => real list), map functions can be declared, e.g.
nipkow@40866
   183
wenzelm@40939
   184
  declare [[coercion_map map]]
wenzelm@40939
   185
wenzelm@40939
   186
Currently coercion inference is activated only in theories including
wenzelm@40939
   187
real numbers, i.e. descendants of Complex_Main.  This is controlled by
wenzelm@41020
   188
the configuration option "coercion_enabled", e.g. it can be enabled in
wenzelm@40939
   189
other theories like this:
wenzelm@40939
   190
wenzelm@40939
   191
  declare [[coercion_enabled]]
nipkow@40866
   192
wenzelm@41571
   193
* Command 'partial_function' provides basic support for recursive
wenzelm@41571
   194
function definitions over complete partial orders.  Concrete instances
krauss@40183
   195
are provided for i) the option type, ii) tail recursion on arbitrary
wenzelm@41571
   196
types, and iii) the heap monad of Imperative_HOL.  See
wenzelm@41571
   197
src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
wenzelm@41571
   198
for examples.
krauss@40183
   199
wenzelm@41571
   200
* Function package: f.psimps rules are no longer implicitly declared
wenzelm@41571
   201
as [simp].  INCOMPATIBILITY.
haftmann@41398
   202
haftmann@41398
   203
* Datatype package: theorems generated for executable equality (class
wenzelm@41571
   204
"eq") carry proper names and are treated as default code equations.
wenzelm@41571
   205
wenzelm@41594
   206
* Inductive package: now offers command 'inductive_simps' to
wenzelm@41594
   207
automatically derive instantiated and simplified equations for
wenzelm@41594
   208
inductive predicates, similar to 'inductive_cases'.
wenzelm@41594
   209
wenzelm@41571
   210
* Command 'enriched_type' allows to register properties of the
wenzelm@41571
   211
functorial structure of types.
haftmann@39771
   212
haftmann@39644
   213
* Improved infrastructure for term evaluation using code generator
haftmann@39644
   214
techniques, in particular static evaluation conversions.
haftmann@39644
   215
wenzelm@41594
   216
* Code generator: Scala (2.8 or higher) has been added to the target
wenzelm@41594
   217
languages.
wenzelm@41594
   218
haftmann@41398
   219
* Code generator: globbing constant expressions "*" and "Theory.*"
haftmann@41398
   220
have been replaced by the more idiomatic "_" and "Theory._".
haftmann@41398
   221
INCOMPATIBILITY.
haftmann@41398
   222
haftmann@41398
   223
* Code generator: export_code without explicit file declaration prints
haftmann@41398
   224
to standard output.  INCOMPATIBILITY.
haftmann@41398
   225
haftmann@41398
   226
* Code generator: do not print function definitions for case
haftmann@41398
   227
combinators any longer.
haftmann@41398
   228
wenzelm@41594
   229
* Code generator: simplification with rules determined with
wenzelm@41571
   230
src/Tools/Code/code_simp.ML and method "code_simp".
wenzelm@41571
   231
wenzelm@41594
   232
* Code generator for records: more idiomatic representation of record
wenzelm@40948
   233
types.  Warning: records are not covered by ancient SML code
wenzelm@40948
   234
generation any longer.  INCOMPATIBILITY.  In cases of need, a suitable
wenzelm@40948
   235
rep_datatype declaration helps to succeed then:
haftmann@38537
   236
haftmann@38537
   237
  record 'a foo = ...
haftmann@38537
   238
  ...
haftmann@38537
   239
  rep_datatype foo_ext ...
haftmann@38535
   240
wenzelm@41594
   241
* Records: logical foundation type for records does not carry a
wenzelm@41594
   242
'_type' suffix any longer (obsolete due to authentic syntax).
wenzelm@41594
   243
INCOMPATIBILITY.
wenzelm@41594
   244
haftmann@41398
   245
* Quickcheck now by default uses exhaustive testing instead of random
wenzelm@41571
   246
testing.  Random testing can be invoked by "quickcheck [random]",
wenzelm@41571
   247
exhaustive testing by "quickcheck [exhaustive]".
haftmann@41398
   248
haftmann@41398
   249
* Quickcheck instantiates polymorphic types with small finite
haftmann@41398
   250
datatypes by default. This enables a simple execution mechanism to
haftmann@41398
   251
handle quantifiers and function equality over the finite datatypes.
haftmann@41398
   252
wenzelm@41571
   253
* Quickcheck random generator has been renamed from "code" to
wenzelm@41571
   254
"random".  INCOMPATIBILITY.
haftmann@41398
   255
haftmann@41398
   256
* Quickcheck now has a configurable time limit which is set to 30
haftmann@41398
   257
seconds by default. This can be changed by adding [timeout = n] to the
haftmann@41398
   258
quickcheck command. The time limit for Auto Quickcheck is still set
haftmann@41398
   259
independently.
haftmann@38461
   260
haftmann@38461
   261
* Quickcheck in locales considers interpretations of that locale for
haftmann@38461
   262
counter example search.
haftmann@38461
   263
blanchet@40059
   264
* Sledgehammer:
wenzelm@41571
   265
  - Added "smt" and "remote_smt" provers based on the "smt" proof
wenzelm@41571
   266
    method. See the Sledgehammer manual for details ("isabelle doc
wenzelm@41571
   267
    sledgehammer").
blanchet@40059
   268
  - Renamed commands:
blanchet@40059
   269
    sledgehammer atp_info ~> sledgehammer running_provers
blanchet@40059
   270
    sledgehammer atp_kill ~> sledgehammer kill_provers
blanchet@40059
   271
    sledgehammer available_atps ~> sledgehammer available_provers
blanchet@40059
   272
    INCOMPATIBILITY.
blanchet@40059
   273
  - Renamed options:
blanchet@40059
   274
    sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
blanchet@40062
   275
    sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
blanchet@40341
   276
    sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
blanchet@40341
   277
    (and "ms" and "min" are no longer supported)
blanchet@40341
   278
    INCOMPATIBILITY.
blanchet@40341
   279
blanchet@40341
   280
* Nitpick:
blanchet@40341
   281
  - Renamed options:
blanchet@40341
   282
    nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
blanchet@40341
   283
    nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
blanchet@40059
   284
    INCOMPATIBILITY.
blanchet@40725
   285
  - Added support for partial quotient types.
blanchet@40725
   286
  - Added local versions of the "Nitpick.register_xxx" functions.
blanchet@40725
   287
  - Added "whack" option.
blanchet@40725
   288
  - Allow registration of quotient types as codatatypes.
blanchet@40725
   289
  - Improved "merge_type_vars" option to merge more types.
blanchet@40725
   290
  - Removed unsound "fast_descrs" option.
blanchet@40725
   291
  - Added custom symmetry breaking for datatypes, making it possible to reach
blanchet@40725
   292
    higher cardinalities.
blanchet@40725
   293
  - Prevent the expansion of too large definitions.
blanchet@39957
   294
wenzelm@41571
   295
* Proof methods "metis" and "meson" now have configuration options
wenzelm@41571
   296
"meson_trace", "metis_trace", and "metis_verbose" that can be enabled
wenzelm@41571
   297
to diagnose these tools. E.g.
wenzelm@41571
   298
wenzelm@41571
   299
    using [[metis_trace = true]]
wenzelm@41571
   300
haftmann@41398
   301
* Auto Solve: Renamed "Auto Solve Direct".  The tool is now available
haftmann@41398
   302
manually as command 'solve_direct'.
haftmann@41398
   303
boehmes@41601
   304
* The default SMT solver Z3 must be enabled explicitly (due to
boehmes@41601
   305
licensing issues) by setting the environment variable
wenzelm@41603
   306
Z3_NON_COMMERCIAL in etc/settings of the component, for example.  For
wenzelm@41603
   307
commercial applications, the SMT solver CVC3 is provided as fall-back;
wenzelm@41603
   308
changing the SMT solver is done via the configuration option
wenzelm@41603
   309
"smt_solver".
boehmes@41432
   310
boehmes@41432
   311
* Remote SMT solvers need to be referred to by the "remote_" prefix,
wenzelm@41571
   312
i.e. "remote_cvc3" and "remote_z3".
wenzelm@41571
   313
wenzelm@41571
   314
* Added basic SMT support for datatypes, records, and typedefs using
wenzelm@41571
   315
the oracle mode (no proofs).  Direct support of pairs has been dropped
wenzelm@41571
   316
in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
wenzelm@41571
   317
support for a similar behavior).  Minor INCOMPATIBILITY.
boehmes@41432
   318
boehmes@40162
   319
* Changed SMT configuration options:
boehmes@40162
   320
  - Renamed:
boehmes@41432
   321
    z3_proofs ~> smt_oracle (with inverted meaning)
boehmes@40162
   322
    z3_trace_assms ~> smt_trace_used_facts
boehmes@40162
   323
    INCOMPATIBILITY.
boehmes@40162
   324
  - Added:
boehmes@40424
   325
    smt_verbose
boehmes@41432
   326
    smt_random_seed
boehmes@40424
   327
    smt_datatypes
boehmes@41432
   328
    smt_infer_triggers
boehmes@41432
   329
    smt_monomorph_limit
boehmes@40162
   330
    cvc3_options
boehmes@41432
   331
    remote_cvc3_options
boehmes@41432
   332
    remote_z3_options
boehmes@40162
   333
    yices_options
blanchet@39957
   334
wenzelm@40948
   335
* Boogie output files (.b2i files) need to be declared in the theory
wenzelm@40948
   336
header.
boehmes@40580
   337
wenzelm@41594
   338
* Simplification procedure "list_to_set_comprehension" rewrites list
wenzelm@41594
   339
comprehensions applied to List.set to set comprehensions.  Occasional
wenzelm@41594
   340
INCOMPATIBILITY, may be deactivated like this:
wenzelm@41594
   341
wenzelm@41594
   342
  declare [[simproc del: list_to_set_comprehension]]
wenzelm@41594
   343
wenzelm@41573
   344
* Removed old version of primrec package.  INCOMPATIBILITY.
haftmann@41398
   345
haftmann@41398
   346
* Removed simplifier congruence rule of "prod_case", as has for long
haftmann@41398
   347
been the case with "split".  INCOMPATIBILITY.
haftmann@41398
   348
haftmann@41398
   349
* String.literal is a type, but not a datatype.  INCOMPATIBILITY.
haftmann@41398
   350
krauss@40388
   351
* Removed [split_format ... and ... and ...] version of
krauss@40388
   352
[split_format].  Potential INCOMPATIBILITY.
krauss@40388
   353
wenzelm@41571
   354
* Predicate "sorted" now defined inductively, with nice induction
wenzelm@41571
   355
rules.  INCOMPATIBILITY: former sorted.simps now named sorted_simps.
haftmann@41398
   356
haftmann@41398
   357
* Constant "contents" renamed to "the_elem", to free the generic name
haftmann@41398
   358
contents for other uses.  INCOMPATIBILITY.
haftmann@41398
   359
haftmann@41398
   360
* Renamed class eq and constant eq (for code generation) to class
haftmann@41398
   361
equal and constant equal, plus renaming of related facts and various
haftmann@41398
   362
tuning.  INCOMPATIBILITY.
haftmann@41398
   363
haftmann@41398
   364
* Dropped type classes mult_mono and mult_mono1.  INCOMPATIBILITY.
haftmann@41398
   365
wenzelm@41571
   366
* Removed output syntax "'a ~=> 'b" for "'a => 'b option".
wenzelm@41571
   367
INCOMPATIBILITY.
haftmann@41398
   368
haftmann@41398
   369
* Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
haftmann@41398
   370
avoid confusion with finite sets.  INCOMPATIBILITY.
haftmann@41398
   371
haftmann@41398
   372
* Abandoned locales equiv, congruent and congruent2 for equivalence
haftmann@41398
   373
relations.  INCOMPATIBILITY: use equivI rather than equiv_intro (same
haftmann@41398
   374
for congruent(2)).
haftmann@41398
   375
haftmann@41398
   376
* Some previously unqualified names have been qualified:
haftmann@41398
   377
haftmann@41398
   378
  types
haftmann@41398
   379
    bool ~> HOL.bool
haftmann@41398
   380
    nat ~> Nat.nat
haftmann@41398
   381
haftmann@41398
   382
  constants
haftmann@41398
   383
    Trueprop ~> HOL.Trueprop
haftmann@41398
   384
    True ~> HOL.True
haftmann@41398
   385
    False ~> HOL.False
haftmann@41398
   386
    op & ~> HOL.conj
haftmann@41398
   387
    op | ~> HOL.disj
haftmann@41398
   388
    op --> ~> HOL.implies
haftmann@41398
   389
    op = ~> HOL.eq
haftmann@41398
   390
    Not ~> HOL.Not
haftmann@41398
   391
    The ~> HOL.The
haftmann@41398
   392
    All ~> HOL.All
haftmann@41398
   393
    Ex ~> HOL.Ex
haftmann@41398
   394
    Ex1 ~> HOL.Ex1
haftmann@41398
   395
    Let ~> HOL.Let
haftmann@41398
   396
    If ~> HOL.If
haftmann@41398
   397
    Ball ~> Set.Ball
haftmann@41398
   398
    Bex ~> Set.Bex
haftmann@41398
   399
    Suc ~> Nat.Suc
haftmann@41398
   400
    Pair ~> Product_Type.Pair
haftmann@41398
   401
    fst ~> Product_Type.fst
haftmann@41398
   402
    snd ~> Product_Type.snd
haftmann@41398
   403
    curry ~> Product_Type.curry
haftmann@41398
   404
    op : ~> Set.member
haftmann@41398
   405
    Collect ~> Set.Collect
haftmann@41398
   406
haftmann@41398
   407
INCOMPATIBILITY.
haftmann@41398
   408
haftmann@41398
   409
* More canonical naming convention for some fundamental definitions:
haftmann@41398
   410
haftmann@41398
   411
    bot_bool_eq ~> bot_bool_def
haftmann@41398
   412
    top_bool_eq ~> top_bool_def
haftmann@41398
   413
    inf_bool_eq ~> inf_bool_def
haftmann@41398
   414
    sup_bool_eq ~> sup_bool_def
haftmann@41398
   415
    bot_fun_eq  ~> bot_fun_def
haftmann@41398
   416
    top_fun_eq  ~> top_fun_def
haftmann@41398
   417
    inf_fun_eq  ~> inf_fun_def
haftmann@41398
   418
    sup_fun_eq  ~> sup_fun_def
haftmann@41398
   419
haftmann@41398
   420
INCOMPATIBILITY.
haftmann@41398
   421
haftmann@41398
   422
* More stylized fact names:
haftmann@41398
   423
haftmann@41398
   424
  expand_fun_eq ~> fun_eq_iff
haftmann@41398
   425
  expand_set_eq ~> set_eq_iff
haftmann@41398
   426
  set_ext       ~> set_eqI
haftmann@41398
   427
  nat_number    ~> eval_nat_numeral
haftmann@41398
   428
haftmann@41398
   429
INCOMPATIBILITY.
haftmann@41398
   430
wenzelm@41571
   431
* Refactoring of code-generation specific operations in theory List:
haftmann@41398
   432
haftmann@41398
   433
  constants
haftmann@41398
   434
    null ~> List.null
haftmann@41398
   435
haftmann@41398
   436
  facts
haftmann@41398
   437
    mem_iff ~> member_def
haftmann@41398
   438
    null_empty ~> null_def
haftmann@41398
   439
haftmann@41398
   440
INCOMPATIBILITY.  Note that these were not supposed to be used
haftmann@41398
   441
regularly unless for striking reasons; their main purpose was code
haftmann@41398
   442
generation.
haftmann@41398
   443
haftmann@41398
   444
Various operations from the Haskell prelude are used for generating
haftmann@41398
   445
Haskell code.
haftmann@41398
   446
wenzelm@41571
   447
* Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV".  Term
wenzelm@41571
   448
"surj f" is now an abbreviation of "range f = UNIV".  The theorems
wenzelm@41571
   449
bij_def and surj_def are unchanged.  INCOMPATIBILITY.
haftmann@41398
   450
haftmann@41398
   451
* Abolished some non-alphabetic type names: "prod" and "sum" replace
haftmann@41398
   452
"*" and "+" respectively.  INCOMPATIBILITY.
haftmann@41398
   453
haftmann@41398
   454
* Name "Plus" of disjoint sum operator "<+>" is now hidden.  Write
wenzelm@41571
   455
"Sum_Type.Plus" instead.
haftmann@41398
   456
haftmann@41398
   457
* Constant "split" has been merged with constant "prod_case"; names of
haftmann@41398
   458
ML functions, facts etc. involving split have been retained so far,
haftmann@41398
   459
though.  INCOMPATIBILITY.
haftmann@41398
   460
haftmann@41398
   461
* Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
haftmann@41398
   462
instead.  INCOMPATIBILITY.
haftmann@41398
   463
wenzelm@41571
   464
* Removed lemma "Option.is_none_none" which duplicates "is_none_def".
haftmann@41398
   465
INCOMPATIBILITY.
haftmann@41398
   466
wenzelm@41594
   467
* Former theory Library/Enum is now part of the HOL-Main image.
wenzelm@41594
   468
INCOMPATIBILITY: all constants of the Enum theory now have to be
wenzelm@41594
   469
referred to by its qualified name.
wenzelm@41594
   470
wenzelm@41594
   471
  enum    ~>  Enum.enum
wenzelm@41594
   472
  nlists  ~>  Enum.nlists
wenzelm@41594
   473
  product ~>  Enum.product
wenzelm@41594
   474
wenzelm@41594
   475
* Theory Library/Monad_Syntax provides do-syntax for monad types.
wenzelm@41594
   476
Syntax in Library/State_Monad has been changed to avoid ambiguities.
wenzelm@41594
   477
INCOMPATIBILITY.
wenzelm@41594
   478
wenzelm@41594
   479
* Theory Library/SetsAndFunctions has been split into
wenzelm@41594
   480
Library/Function_Algebras and Library/Set_Algebras; canonical names
wenzelm@41594
   481
for instance definitions for functions; various improvements.
wenzelm@41594
   482
INCOMPATIBILITY.
wenzelm@41594
   483
wenzelm@41594
   484
* Theory Library/Multiset provides stable quicksort implementation of
wenzelm@41594
   485
sort_key.
wenzelm@41594
   486
wenzelm@41594
   487
* Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
wenzelm@41594
   488
INCOMPATIBILITY.
wenzelm@41594
   489
wenzelm@41594
   490
* Session Multivariate_Analysis: introduced a type class for euclidean
wenzelm@41594
   491
space.  Most theorems are now stated in terms of euclidean spaces
wenzelm@41594
   492
instead of finite cartesian products.
wenzelm@41594
   493
wenzelm@41594
   494
  types
wenzelm@41594
   495
    real ^ 'n ~>  'a::real_vector
wenzelm@41594
   496
              ~>  'a::euclidean_space
wenzelm@41594
   497
              ~>  'a::ordered_euclidean_space
wenzelm@41594
   498
        (depends on your needs)
wenzelm@41594
   499
wenzelm@41594
   500
  constants
wenzelm@41594
   501
     _ $ _        ~> _ $$ _
wenzelm@41594
   502
     \<chi> x. _  ~> \<chi>\<chi> x. _
wenzelm@41594
   503
     CARD('n)     ~> DIM('a)
wenzelm@41594
   504
wenzelm@41594
   505
Also note that the indices are now natural numbers and not from some
wenzelm@41594
   506
finite type. Finite cartesian products of euclidean spaces, products
wenzelm@41594
   507
of euclidean spaces the real and complex numbers are instantiated to
wenzelm@41594
   508
be euclidean_spaces.  INCOMPATIBILITY.
wenzelm@41594
   509
wenzelm@41594
   510
* Session Probability: introduced pextreal as positive extended real
wenzelm@41594
   511
numbers.  Use pextreal as value for measures.  Introduce the
wenzelm@41594
   512
Radon-Nikodym derivative, product spaces and Fubini's theorem for
wenzelm@41594
   513
arbitrary sigma finite measures.  Introduces Lebesgue measure based on
wenzelm@41594
   514
the integral in Multivariate Analysis.  INCOMPATIBILITY.
wenzelm@41594
   515
wenzelm@41594
   516
* Session Imperative_HOL: revamped, corrected dozens of inadequacies.
wenzelm@41594
   517
INCOMPATIBILITY.
wenzelm@41594
   518
wenzelm@41594
   519
* Session SPARK (with image HOL-SPARK) provides commands to load and
wenzelm@41594
   520
prove verification conditions generated by the SPARK Ada program
wenzelm@41594
   521
verifier.  See also src/HOL/SPARK and src/HOL/SPARK/Examples.
berghofe@41567
   522
huffman@40621
   523
ballarin@41433
   524
*** HOL-Algebra ***
ballarin@41433
   525
ballarin@41433
   526
* Theorems for additive ring operations (locale abelian_monoid and
ballarin@41433
   527
descendants) are generated by interpretation from their multiplicative
ballarin@41434
   528
counterparts.  Names (in particular theorem names) have the mandatory
ballarin@41434
   529
qualifier 'add'.  Previous theorem names are redeclared for
ballarin@41434
   530
compatibility.
ballarin@41434
   531
wenzelm@41571
   532
* Structure "int_ring" is now an abbreviation (previously a
ballarin@41434
   533
definition).  This fits more natural with advanced interpretations.
ballarin@41433
   534
ballarin@41433
   535
huffman@40621
   536
*** HOLCF ***
huffman@40621
   537
huffman@40621
   538
* The domain package now runs in definitional mode by default: The
wenzelm@41571
   539
former command 'new_domain' is now called 'domain'.  To use the domain
huffman@40621
   540
package in its original axiomatic mode, use 'domain (unsafe)'.
huffman@40621
   541
INCOMPATIBILITY.
huffman@40621
   542
wenzelm@41571
   543
* The new class "domain" is now the default sort.  Class "predomain"
wenzelm@41571
   544
is an unpointed version of "domain". Theories can be updated by
wenzelm@41571
   545
replacing sort annotations as shown below.  INCOMPATIBILITY.
huffman@40621
   546
huffman@40621
   547
  'a::type ~> 'a::countable
huffman@40621
   548
  'a::cpo  ~> 'a::predomain
huffman@40621
   549
  'a::pcpo ~> 'a::domain
huffman@40621
   550
wenzelm@41571
   551
* The old type class "rep" has been superseded by class "domain".
huffman@40621
   552
Accordingly, users of the definitional package must remove any
wenzelm@41571
   553
"default_sort rep" declarations.  INCOMPATIBILITY.
huffman@40621
   554
huffman@41401
   555
* The domain package (definitional mode) now supports unpointed
huffman@41401
   556
predomain argument types, as long as they are marked 'lazy'. (Strict
wenzelm@41571
   557
arguments must be in class "domain".) For example, the following
huffman@41401
   558
domain definition now works:
huffman@41401
   559
huffman@41401
   560
  domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
huffman@41401
   561
huffman@41401
   562
* Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
wenzelm@41571
   563
instances for types from main HOL: bool, nat, int, char, 'a + 'b,
wenzelm@41571
   564
'a option, and 'a list.  Additionally, it configures fixrec and the
wenzelm@41571
   565
domain package to work with these types.  For example:
huffman@41401
   566
huffman@41401
   567
  fixrec isInl :: "('a + 'b) u -> tr"
huffman@41401
   568
    where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
huffman@41401
   569
huffman@41401
   570
  domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
huffman@41401
   571
wenzelm@41571
   572
* The "(permissive)" option of fixrec has been replaced with a
wenzelm@41571
   573
per-equation "(unchecked)" option. See
wenzelm@41571
   574
src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
wenzelm@41571
   575
wenzelm@41571
   576
* The "bifinite" class no longer fixes a constant "approx"; the class
wenzelm@41571
   577
now just asserts that such a function exists.  INCOMPATIBILITY.
wenzelm@41571
   578
wenzelm@41571
   579
* Former type "alg_defl" has been renamed to "defl".  HOLCF no longer
huffman@41287
   580
defines an embedding of type 'a defl into udom by default; instances
wenzelm@41571
   581
of "bifinite" and "domain" classes are available in
wenzelm@41571
   582
src/HOL/HOLCF/Library/Defl_Bifinite.thy.
wenzelm@41571
   583
wenzelm@41571
   584
* The syntax "REP('a)" has been replaced with "DEFL('a)".
wenzelm@41571
   585
wenzelm@41571
   586
* The predicate "directed" has been removed.  INCOMPATIBILITY.
wenzelm@41571
   587
wenzelm@41571
   588
* The type class "finite_po" has been removed.  INCOMPATIBILITY.
wenzelm@41571
   589
wenzelm@41571
   590
* The function "cprod_map" has been renamed to "prod_map".
huffman@41401
   591
INCOMPATIBILITY.
huffman@41401
   592
huffman@41401
   593
* The monadic bind operator on each powerdomain has new binder syntax
wenzelm@41571
   594
similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
wenzelm@41571
   595
"upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
huffman@41401
   596
huffman@41401
   597
* The infix syntax for binary union on each powerdomain has changed
wenzelm@41571
   598
from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
wenzelm@41571
   599
syntax.  INCOMPATIBILITY.
wenzelm@41571
   600
wenzelm@41571
   601
* The constant "UU" has been renamed to "bottom".  The syntax "UU" is
huffman@41429
   602
still supported as an input translation.
huffman@41429
   603
huffman@40621
   604
* Renamed some theorems (the original names are also still available).
wenzelm@41571
   605
huffman@40621
   606
  expand_fun_below   ~> fun_below_iff
huffman@40621
   607
  below_fun_ext      ~> fun_belowI
huffman@40621
   608
  expand_cfun_eq     ~> cfun_eq_iff
huffman@40621
   609
  ext_cfun           ~> cfun_eqI
huffman@40621
   610
  expand_cfun_below  ~> cfun_below_iff
huffman@40621
   611
  below_cfun_ext     ~> cfun_belowI
huffman@40621
   612
  cont2cont_Rep_CFun ~> cont2cont_APP
huffman@40621
   613
huffman@40621
   614
* The Abs and Rep functions for various types have changed names.
wenzelm@40948
   615
Related theorem names have also changed to match. INCOMPATIBILITY.
wenzelm@41571
   616
huffman@40621
   617
  Rep_CFun  ~> Rep_cfun
huffman@40621
   618
  Abs_CFun  ~> Abs_cfun
huffman@40621
   619
  Rep_Sprod ~> Rep_sprod
huffman@40621
   620
  Abs_Sprod ~> Abs_sprod
huffman@40621
   621
  Rep_Ssum  ~> Rep_ssum
huffman@40621
   622
  Abs_Ssum  ~> Abs_ssum
huffman@40621
   623
huffman@40621
   624
* Lemmas with names of the form *_defined_iff or *_strict_iff have
wenzelm@41571
   625
been renamed to *_bottom_iff.  INCOMPATIBILITY.
huffman@40621
   626
huffman@40621
   627
* Various changes to bisimulation/coinduction with domain package:
wenzelm@41571
   628
wenzelm@41571
   629
  - Definitions of "bisim" constants no longer mention definedness.
wenzelm@41571
   630
  - With mutual recursion, "bisim" predicate is now curried.
huffman@40621
   631
  - With mutual recursion, each type gets a separate coind theorem.
huffman@40621
   632
  - Variable names in bisim_def and coinduct rules have changed.
wenzelm@41571
   633
huffman@40621
   634
INCOMPATIBILITY.
huffman@40621
   635
wenzelm@41571
   636
* Case combinators generated by the domain package for type "foo" are
wenzelm@41571
   637
now named "foo_case" instead of "foo_when".  INCOMPATIBILITY.
huffman@40621
   638
huffman@40771
   639
* Several theorems have been renamed to more accurately reflect the
wenzelm@41571
   640
names of constants and types involved.  INCOMPATIBILITY.
wenzelm@41571
   641
huffman@40771
   642
  thelub_const    ~> lub_const
huffman@40771
   643
  lub_const       ~> is_lub_const
huffman@40771
   644
  thelubI         ~> lub_eqI
huffman@40771
   645
  is_lub_lub      ~> is_lubD2
huffman@40771
   646
  lubI            ~> is_lub_lub
huffman@40771
   647
  unique_lub      ~> is_lub_unique
huffman@40771
   648
  is_ub_lub       ~> is_lub_rangeD1
huffman@40771
   649
  lub_bin_chain   ~> is_lub_bin_chain
huffman@41030
   650
  lub_fun         ~> is_lub_fun
huffman@41030
   651
  thelub_fun      ~> lub_fun
huffman@41031
   652
  thelub_cfun     ~> lub_cfun
huffman@40771
   653
  thelub_Pair     ~> lub_Pair
huffman@40771
   654
  lub_cprod       ~> is_lub_prod
huffman@40771
   655
  thelub_cprod    ~> lub_prod
huffman@40771
   656
  minimal_cprod   ~> minimal_prod
huffman@40771
   657
  inst_cprod_pcpo ~> inst_prod_pcpo
huffman@41430
   658
  UU_I            ~> bottomI
huffman@41430
   659
  compact_UU      ~> compact_bottom
huffman@41430
   660
  deflation_UU    ~> deflation_bottom
huffman@41430
   661
  finite_deflation_UU ~> finite_deflation_bottom
huffman@40771
   662
wenzelm@41571
   663
* Many legacy theorem names have been discontinued.  INCOMPATIBILITY.
wenzelm@41571
   664
huffman@40621
   665
  sq_ord_less_eq_trans ~> below_eq_trans
huffman@40621
   666
  sq_ord_eq_less_trans ~> eq_below_trans
huffman@40621
   667
  refl_less            ~> below_refl
huffman@40621
   668
  trans_less           ~> below_trans
huffman@40621
   669
  antisym_less         ~> below_antisym
huffman@40621
   670
  antisym_less_inverse ~> po_eq_conv [THEN iffD1]
huffman@40621
   671
  box_less             ~> box_below
huffman@40621
   672
  rev_trans_less       ~> rev_below_trans
huffman@40621
   673
  not_less2not_eq      ~> not_below2not_eq
huffman@40621
   674
  less_UU_iff          ~> below_UU_iff
huffman@40621
   675
  flat_less_iff        ~> flat_below_iff
huffman@40621
   676
  adm_less             ~> adm_below
huffman@40621
   677
  adm_not_less         ~> adm_not_below
huffman@40621
   678
  adm_compact_not_less ~> adm_compact_not_below
huffman@40621
   679
  less_fun_def         ~> below_fun_def
huffman@40621
   680
  expand_fun_less      ~> fun_below_iff
huffman@40621
   681
  less_fun_ext         ~> fun_belowI
huffman@40621
   682
  less_discr_def       ~> below_discr_def
huffman@40621
   683
  discr_less_eq        ~> discr_below_eq
huffman@40621
   684
  less_unit_def        ~> below_unit_def
huffman@40621
   685
  less_cprod_def       ~> below_prod_def
huffman@40621
   686
  prod_lessI           ~> prod_belowI
huffman@40621
   687
  Pair_less_iff        ~> Pair_below_iff
huffman@40621
   688
  fst_less_iff         ~> fst_below_iff
huffman@40621
   689
  snd_less_iff         ~> snd_below_iff
huffman@40621
   690
  expand_cfun_less     ~> cfun_below_iff
huffman@40621
   691
  less_cfun_ext        ~> cfun_belowI
huffman@40621
   692
  injection_less       ~> injection_below
huffman@40621
   693
  less_up_def          ~> below_up_def
huffman@40621
   694
  not_Iup_less         ~> not_Iup_below
huffman@40621
   695
  Iup_less             ~> Iup_below
huffman@40621
   696
  up_less              ~> up_below
huffman@40621
   697
  Def_inject_less_eq   ~> Def_below_Def
huffman@40621
   698
  Def_less_is_eq       ~> Def_below_iff
huffman@40621
   699
  spair_less_iff       ~> spair_below_iff
huffman@40621
   700
  less_sprod           ~> below_sprod
huffman@40621
   701
  spair_less           ~> spair_below
huffman@40621
   702
  sfst_less_iff        ~> sfst_below_iff
huffman@40621
   703
  ssnd_less_iff        ~> ssnd_below_iff
huffman@40621
   704
  fix_least_less       ~> fix_least_below
huffman@40621
   705
  dist_less_one        ~> dist_below_one
huffman@40621
   706
  less_ONE             ~> below_ONE
huffman@40621
   707
  ONE_less_iff         ~> ONE_below_iff
huffman@40621
   708
  less_sinlD           ~> below_sinlD
huffman@40621
   709
  less_sinrD           ~> below_sinrD
huffman@40621
   710
huffman@40621
   711
wenzelm@40948
   712
*** FOL and ZF ***
haftmann@38522
   713
wenzelm@41310
   714
* All constant names are now qualified internally and use proper
wenzelm@41310
   715
identifiers, e.g. "IFOL.eq" instead of "op =".  INCOMPATIBILITY.
wenzelm@41310
   716
haftmann@38522
   717
wenzelm@37868
   718
*** ML ***
wenzelm@37868
   719
wenzelm@41594
   720
* Antiquotation @{assert} inlines a function bool -> unit that raises
wenzelm@41594
   721
Fail if the argument is false.  Due to inlining the source position of
wenzelm@41594
   722
failed assertions is included in the error output.
wenzelm@41594
   723
wenzelm@41594
   724
* Discontinued antiquotation @{theory_ref}, which is obsolete since ML
wenzelm@41594
   725
text is in practice always evaluated with a stable theory checkpoint.
wenzelm@41594
   726
Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
wenzelm@41594
   727
wenzelm@41594
   728
* Antiquotation @{theory A} refers to theory A from the ancestry of
wenzelm@41594
   729
the current context, not any accidental theory loader state as before.
wenzelm@41594
   730
Potential INCOMPATIBILITY, subtle change in semantics.
wenzelm@41228
   731
wenzelm@40956
   732
* Syntax.pretty_priority (default 0) configures the required priority
wenzelm@40956
   733
of pretty-printed output and thus affects insertion of parentheses.
wenzelm@40956
   734
wenzelm@40959
   735
* Syntax.default_root (default "any") configures the inner syntax
wenzelm@40959
   736
category (nonterminal symbol) for parsing of terms.
wenzelm@40959
   737
wenzelm@40722
   738
* Former exception Library.UnequalLengths now coincides with
wenzelm@40722
   739
ListPair.UnequalLengths.
wenzelm@40722
   740
wenzelm@41594
   741
* Renamed structure MetaSimplifier to Raw_Simplifier.  Note that the
wenzelm@41594
   742
main functionality is provided by structure Simplifier.
wenzelm@41594
   743
wenzelm@40627
   744
* Renamed raw "explode" function to "raw_explode" to emphasize its
wenzelm@40627
   745
meaning.  Note that internally to Isabelle, Symbol.explode is used in
wenzelm@40627
   746
almost all situations.
wenzelm@40627
   747
wenzelm@40318
   748
* Discontinued obsolete function sys_error and exception SYS_ERROR.
wenzelm@40318
   749
See implementation manual for further details on exceptions in
wenzelm@40318
   750
Isabelle/ML.
wenzelm@40318
   751
wenzelm@39616
   752
* Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
wenzelm@39616
   753
meaning.
wenzelm@39616
   754
wenzelm@39557
   755
* Renamed structure PureThy to Pure_Thy and moved most of its
wenzelm@39557
   756
operations to structure Global_Theory, to emphasize that this is
wenzelm@39557
   757
rarely-used global-only stuff.
wenzelm@39557
   758
wenzelm@39513
   759
* Discontinued Output.debug.  Minor INCOMPATIBILITY, use plain writeln
wenzelm@39513
   760
instead (or tracing for high-volume output).
wenzelm@39513
   761
wenzelm@38980
   762
* Configuration option show_question_marks only affects regular pretty
wenzelm@38980
   763
printing of types and terms, not raw Term.string_of_vname.
wenzelm@38980
   764
wenzelm@39164
   765
* ML_Context.thm and ML_Context.thms are no longer pervasive.  Rare
wenzelm@39164
   766
INCOMPATIBILITY, superseded by static antiquotations @{thm} and
wenzelm@39164
   767
@{thms} for most purposes.
wenzelm@39164
   768
wenzelm@41594
   769
* ML structure Unsynchronized is never opened, not even in Isar
wenzelm@38980
   770
interaction mode as before.  Old Unsynchronized.set etc. have been
wenzelm@38980
   771
discontinued -- use plain := instead.  This should be *rare* anyway,
wenzelm@38980
   772
since modern tools always work via official context data, notably
wenzelm@38980
   773
configuration options.
wenzelm@38980
   774
wenzelm@39239
   775
* Parallel and asynchronous execution requires special care concerning
wenzelm@39239
   776
interrupts.  Structure Exn provides some convenience functions that
wenzelm@39239
   777
avoid working directly with raw Interrupt.  User code must not absorb
wenzelm@39239
   778
interrupts -- intermediate handling (for cleanup etc.) needs to be
wenzelm@39239
   779
followed by re-raising of the original exception.  Another common
wenzelm@39239
   780
source of mistakes are "handle _" patterns, which make the meaning of
wenzelm@39239
   781
the program subject to physical effects of the environment.
wenzelm@39239
   782
wenzelm@37868
   783
wenzelm@37868
   784
wenzelm@37144
   785
New in Isabelle2009-2 (June 2010)
wenzelm@37144
   786
---------------------------------
haftmann@33993
   787
wenzelm@35260
   788
*** General ***
wenzelm@35260
   789
wenzelm@35436
   790
* Authentic syntax for *all* logical entities (type classes, type
wenzelm@35436
   791
constructors, term constants): provides simple and robust
wenzelm@35436
   792
correspondence between formal entities and concrete syntax.  Within
wenzelm@35436
   793
the parse tree / AST representations, "constants" are decorated by
wenzelm@35436
   794
their category (class, type, const) and spelled out explicitly with
wenzelm@35436
   795
their full internal name.
wenzelm@35436
   796
wenzelm@35436
   797
Substantial INCOMPATIBILITY concerning low-level syntax declarations
wenzelm@35436
   798
and translations (translation rules and translation functions in ML).
wenzelm@35436
   799
Some hints on upgrading:
wenzelm@35260
   800
wenzelm@35260
   801
  - Many existing uses of 'syntax' and 'translations' can be replaced
wenzelm@35436
   802
    by more modern 'type_notation', 'notation' and 'abbreviation',
wenzelm@35436
   803
    which are independent of this issue.
wenzelm@35260
   804
wenzelm@35260
   805
  - 'translations' require markup within the AST; the term syntax
wenzelm@35260
   806
    provides the following special forms:
wenzelm@35260
   807
wenzelm@35260
   808
      CONST c   -- produces syntax version of constant c from context
wenzelm@35261
   809
      XCONST c  -- literally c, checked as constant from context
wenzelm@35261
   810
      c         -- literally c, if declared by 'syntax'
wenzelm@35261
   811
wenzelm@35261
   812
    Plain identifiers are treated as AST variables -- occasionally the
wenzelm@35261
   813
    system indicates accidental variables via the error "rhs contains
wenzelm@35261
   814
    extra variables".
wenzelm@35260
   815
wenzelm@35436
   816
    Type classes and type constructors are marked according to their
wenzelm@35436
   817
    concrete syntax.  Some old translations rules need to be written
wenzelm@35436
   818
    for the "type" category, using type constructor application
wenzelm@35436
   819
    instead of pseudo-term application of the default category
wenzelm@35436
   820
    "logic".
wenzelm@35436
   821
wenzelm@35260
   822
  - 'parse_translation' etc. in ML may use the following
wenzelm@35260
   823
    antiquotations:
wenzelm@35260
   824
wenzelm@35436
   825
      @{class_syntax c}   -- type class c within parse tree / AST
wenzelm@35436
   826
      @{term_syntax c}    -- type constructor c within parse tree / AST
wenzelm@35260
   827
      @{const_syntax c}   -- ML version of "CONST c" above
wenzelm@35260
   828
      @{syntax_const c}   -- literally c (checked wrt. 'syntax' declarations)
wenzelm@35260
   829
wenzelm@35436
   830
  - Literal types within 'typed_print_translations', i.e. those *not*
wenzelm@35436
   831
    represented as pseudo-terms are represented verbatim.  Use @{class
wenzelm@35436
   832
    c} or @{type_name c} here instead of the above syntax
wenzelm@35436
   833
    antiquotations.
wenzelm@35436
   834
wenzelm@35260
   835
Note that old non-authentic syntax was based on unqualified base
wenzelm@35436
   836
names, so all of the above "constant" names would coincide.  Recall
wenzelm@35436
   837
that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
wenzelm@35436
   838
diagnose syntax problems.
wenzelm@35260
   839
wenzelm@35351
   840
* Type constructors admit general mixfix syntax, not just infix.
wenzelm@35351
   841
wenzelm@36508
   842
* Concrete syntax may be attached to local entities without a proof
wenzelm@36508
   843
body, too.  This works via regular mixfix annotations for 'fix',
wenzelm@36508
   844
'def', 'obtain' etc. or via the explicit 'write' command, which is
wenzelm@36508
   845
similar to the 'notation' command in theory specifications.
wenzelm@36508
   846
wenzelm@37351
   847
* Discontinued unnamed infix syntax (legacy feature for many years) --
wenzelm@37351
   848
need to specify constant name and syntax separately.  Internal ML
wenzelm@37351
   849
datatype constructors have been renamed from InfixName to Infix etc.
wenzelm@37351
   850
Minor INCOMPATIBILITY.
wenzelm@37351
   851
wenzelm@37351
   852
* Schematic theorem statements need to be explicitly markup as such,
wenzelm@37351
   853
via commands 'schematic_lemma', 'schematic_theorem',
wenzelm@37351
   854
'schematic_corollary'.  Thus the relevance of the proof is made
wenzelm@37351
   855
syntactically clear, which impacts performance in a parallel or
wenzelm@37351
   856
asynchronous interactive environment.  Minor INCOMPATIBILITY.
wenzelm@37351
   857
wenzelm@35613
   858
* Use of cumulative prems via "!" in some proof methods has been
wenzelm@37351
   859
discontinued (old legacy feature).
wenzelm@35613
   860
boehmes@35979
   861
* References 'trace_simp' and 'debug_simp' have been replaced by
wenzelm@36857
   862
configuration options stored in the context. Enabling tracing (the
wenzelm@36857
   863
case of debugging is similar) in proofs works via
wenzelm@36857
   864
wenzelm@36857
   865
  using [[trace_simp = true]]
wenzelm@36857
   866
wenzelm@36857
   867
Tracing is then active for all invocations of the simplifier in
wenzelm@36857
   868
subsequent goal refinement steps. Tracing may also still be enabled or
wenzelm@40780
   869
disabled via the ProofGeneral settings menu.
boehmes@35979
   870
wenzelm@36177
   871
* Separate commands 'hide_class', 'hide_type', 'hide_const',
wenzelm@36177
   872
'hide_fact' replace the former 'hide' KIND command.  Minor
wenzelm@36177
   873
INCOMPATIBILITY.
wenzelm@36177
   874
wenzelm@37298
   875
* Improved parallelism of proof term normalization: usedir -p2 -q0 is
wenzelm@37298
   876
more efficient than combinations with -q1 or -q2.
wenzelm@37298
   877
wenzelm@35260
   878
haftmann@34170
   879
*** Pure ***
haftmann@34170
   880
wenzelm@37351
   881
* Proofterms record type-class reasoning explicitly, using the
wenzelm@37351
   882
"unconstrain" operation internally.  This eliminates all sort
wenzelm@37351
   883
constraints from a theorem and proof, introducing explicit
wenzelm@37351
   884
OFCLASS-premises.  On the proof term level, this operation is
wenzelm@37351
   885
automatically applied at theorem boundaries, such that closed proofs
wenzelm@37351
   886
are always free of sort constraints.  INCOMPATIBILITY for tools that
wenzelm@37351
   887
inspect proof terms.
haftmann@36147
   888
wenzelm@35765
   889
* Local theory specifications may depend on extra type variables that
wenzelm@35765
   890
are not present in the result type -- arguments TYPE('a) :: 'a itself
wenzelm@35765
   891
are added internally.  For example:
wenzelm@35765
   892
wenzelm@35765
   893
  definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
wenzelm@35765
   894
wenzelm@37351
   895
* Predicates of locales introduced by classes carry a mandatory
wenzelm@37351
   896
"class" prefix.  INCOMPATIBILITY.
wenzelm@37351
   897
wenzelm@37351
   898
* Vacuous class specifications observe default sort.  INCOMPATIBILITY.
wenzelm@37351
   899
wenzelm@37351
   900
* Old 'axclass' command has been discontinued.  INCOMPATIBILITY, use
wenzelm@37351
   901
'class' instead.
wenzelm@37351
   902
wenzelm@37351
   903
* Command 'code_reflect' allows to incorporate generated ML code into
wenzelm@37351
   904
runtime environment; replaces immature code_datatype antiquotation.
wenzelm@37351
   905
INCOMPATIBILITY.
wenzelm@37351
   906
wenzelm@37351
   907
* Code generator: simple concept for abstract datatypes obeying
wenzelm@37351
   908
invariants.
wenzelm@37351
   909
wenzelm@36857
   910
* Code generator: details of internal data cache have no impact on the
wenzelm@36857
   911
user space functionality any longer.
wenzelm@36857
   912
wenzelm@37351
   913
* Methods "unfold_locales" and "intro_locales" ignore non-locale
wenzelm@37351
   914
subgoals.  This is more appropriate for interpretations with 'where'.
wenzelm@36857
   915
INCOMPATIBILITY.
haftmann@34170
   916
wenzelm@36356
   917
* Command 'example_proof' opens an empty proof body.  This allows to
wenzelm@36356
   918
experiment with Isar, without producing any persistent result.
wenzelm@36356
   919
wenzelm@35413
   920
* Commands 'type_notation' and 'no_type_notation' declare type syntax
wenzelm@35413
   921
within a local theory context, with explicit checking of the
wenzelm@35413
   922
constructors involved (in contrast to the raw 'syntax' versions).
wenzelm@35413
   923
wenzelm@36178
   924
* Commands 'types' and 'typedecl' now work within a local theory
wenzelm@36178
   925
context -- without introducing dependencies on parameters or
wenzelm@36178
   926
assumptions, which is not possible in Isabelle/Pure.
wenzelm@35681
   927
wenzelm@36857
   928
* Command 'defaultsort' has been renamed to 'default_sort', it works
wenzelm@36857
   929
within a local theory context.  Minor INCOMPATIBILITY.
wenzelm@36454
   930
haftmann@34170
   931
haftmann@33993
   932
*** HOL ***
haftmann@33993
   933
wenzelm@37351
   934
* Command 'typedef' now works within a local theory context -- without
wenzelm@37351
   935
introducing dependencies on parameters or assumptions, which is not
wenzelm@37351
   936
possible in Isabelle/Pure/HOL.  Note that the logical environment may
wenzelm@37351
   937
contain multiple interpretations of local typedefs (with different
wenzelm@37351
   938
non-emptiness proofs), even in a global theory context.
wenzelm@37351
   939
wenzelm@37351
   940
* New package for quotient types.  Commands 'quotient_type' and
wenzelm@37351
   941
'quotient_definition' may be used for defining types and constants by
wenzelm@37351
   942
quotient constructions.  An example is the type of integers created by
wenzelm@37351
   943
quotienting pairs of natural numbers:
wenzelm@37380
   944
wenzelm@37351
   945
  fun
wenzelm@37380
   946
    intrel :: "(nat * nat) => (nat * nat) => bool"
wenzelm@37351
   947
  where
wenzelm@37351
   948
    "intrel (x, y) (u, v) = (x + v = u + y)"
wenzelm@37351
   949
wenzelm@37380
   950
  quotient_type int = "nat * nat" / intrel
wenzelm@37351
   951
    by (auto simp add: equivp_def expand_fun_eq)
wenzelm@37380
   952
wenzelm@37351
   953
  quotient_definition
wenzelm@37351
   954
    "0::int" is "(0::nat, 0::nat)"
wenzelm@37351
   955
wenzelm@37351
   956
The method "lifting" can be used to lift of theorems from the
wenzelm@37351
   957
underlying "raw" type to the quotient type.  The example
wenzelm@37351
   958
src/HOL/Quotient_Examples/FSet.thy includes such a quotient
wenzelm@37351
   959
construction and provides a reasoning infrastructure for finite sets.
wenzelm@37351
   960
wenzelm@37351
   961
* Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
wenzelm@37351
   962
clash with new theory Quotient in Main HOL.
wenzelm@37351
   963
wenzelm@37351
   964
* Moved the SMT binding into the main HOL session, eliminating
wenzelm@37351
   965
separate HOL-SMT session.
wenzelm@37351
   966
haftmann@37020
   967
* List membership infix mem operation is only an input abbreviation.
haftmann@37020
   968
INCOMPATIBILITY.
haftmann@37020
   969
wenzelm@37144
   970
* Theory Library/Word.thy has been removed.  Use library Word/Word.thy
wenzelm@37144
   971
for future developements; former Library/Word.thy is still present in
wenzelm@37144
   972
the AFP entry RSAPPS.
haftmann@36963
   973
wenzelm@36857
   974
* Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
wenzelm@36857
   975
longer shadowed.  INCOMPATIBILITY.
haftmann@36808
   976
huffman@36836
   977
* Dropped theorem duplicate comp_arith; use semiring_norm instead.
huffman@36836
   978
INCOMPATIBILITY.
huffman@36836
   979
huffman@36836
   980
* Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
huffman@36836
   981
INCOMPATIBILITY.
haftmann@36714
   982
wenzelm@36857
   983
* Dropped normalizing_semiring etc; use the facts in semiring classes
wenzelm@36857
   984
instead.  INCOMPATIBILITY.
wenzelm@36857
   985
huffman@36979
   986
* Dropped several real-specific versions of lemmas about floor and
wenzelm@37351
   987
ceiling; use the generic lemmas from theory "Archimedean_Field"
wenzelm@37351
   988
instead.  INCOMPATIBILITY.
huffman@36979
   989
huffman@36979
   990
  floor_number_of_eq         ~> floor_number_of
huffman@36979
   991
  le_floor_eq_number_of      ~> number_of_le_floor
huffman@36979
   992
  le_floor_eq_zero           ~> zero_le_floor
huffman@36979
   993
  le_floor_eq_one            ~> one_le_floor
huffman@36979
   994
  floor_less_eq_number_of    ~> floor_less_number_of
huffman@36979
   995
  floor_less_eq_zero         ~> floor_less_zero
huffman@36979
   996
  floor_less_eq_one          ~> floor_less_one
huffman@36979
   997
  less_floor_eq_number_of    ~> number_of_less_floor
huffman@36979
   998
  less_floor_eq_zero         ~> zero_less_floor
huffman@36979
   999
  less_floor_eq_one          ~> one_less_floor
huffman@36979
  1000
  floor_le_eq_number_of      ~> floor_le_number_of
huffman@36979
  1001
  floor_le_eq_zero           ~> floor_le_zero
huffman@36979
  1002
  floor_le_eq_one            ~> floor_le_one
huffman@36979
  1003
  floor_subtract_number_of   ~> floor_diff_number_of
huffman@36979
  1004
  floor_subtract_one         ~> floor_diff_one
huffman@36979
  1005
  ceiling_number_of_eq       ~> ceiling_number_of
huffman@36979
  1006
  ceiling_le_eq_number_of    ~> ceiling_le_number_of
huffman@36979
  1007
  ceiling_le_zero_eq         ~> ceiling_le_zero
huffman@36979
  1008
  ceiling_le_eq_one          ~> ceiling_le_one
huffman@36979
  1009
  less_ceiling_eq_number_of  ~> number_of_less_ceiling
huffman@36979
  1010
  less_ceiling_eq_zero       ~> zero_less_ceiling
huffman@36979
  1011
  less_ceiling_eq_one        ~> one_less_ceiling
huffman@36979
  1012
  ceiling_less_eq_number_of  ~> ceiling_less_number_of
huffman@36979
  1013
  ceiling_less_eq_zero       ~> ceiling_less_zero
huffman@36979
  1014
  ceiling_less_eq_one        ~> ceiling_less_one
huffman@36979
  1015
  le_ceiling_eq_number_of    ~> number_of_le_ceiling
huffman@36979
  1016
  le_ceiling_eq_zero         ~> zero_le_ceiling
huffman@36979
  1017
  le_ceiling_eq_one          ~> one_le_ceiling
huffman@36979
  1018
  ceiling_subtract_number_of ~> ceiling_diff_number_of
huffman@36979
  1019
  ceiling_subtract_one       ~> ceiling_diff_one
huffman@36979
  1020
wenzelm@37144
  1021
* Theory "Finite_Set": various folding_XXX locales facilitate the
wenzelm@36857
  1022
application of the various fold combinators on finite sets.
wenzelm@36857
  1023
wenzelm@36857
  1024
* Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
wenzelm@36857
  1025
provides abstract red-black tree type which is backed by "RBT_Impl" as
wenzelm@36857
  1026
implementation.  INCOMPATIBILTY.
haftmann@36147
  1027
huffman@36830
  1028
* Theory Library/Coinductive_List has been removed -- superseded by
wenzelm@35763
  1029
AFP/thys/Coinductive.
wenzelm@35763
  1030
huffman@36829
  1031
* Theory PReal, including the type "preal" and related operations, has
huffman@36829
  1032
been removed.  INCOMPATIBILITY.
huffman@36829
  1033
wenzelm@37380
  1034
* Real: new development using Cauchy Sequences.
wenzelm@37380
  1035
wenzelm@37351
  1036
* Split off theory "Big_Operators" containing setsum, setprod,
wenzelm@37351
  1037
Inf_fin, Sup_fin, Min, Max from theory Finite_Set.  INCOMPATIBILITY.
wenzelm@36857
  1038
wenzelm@36857
  1039
* Theory "Rational" renamed to "Rat", for consistency with "Nat",
wenzelm@36857
  1040
"Int" etc.  INCOMPATIBILITY.
wenzelm@36857
  1041
wenzelm@37351
  1042
* Constant Rat.normalize needs to be qualified.  INCOMPATIBILITY.
wenzelm@37143
  1043
wenzelm@36857
  1044
* New set of rules "ac_simps" provides combined assoc / commute
wenzelm@36857
  1045
rewrites for all interpretations of the appropriate generic locales.
wenzelm@36857
  1046
wenzelm@36857
  1047
* Renamed theory "OrderedGroup" to "Groups" and split theory
wenzelm@36857
  1048
"Ring_and_Field" into theories "Rings" and "Fields"; for more
wenzelm@36857
  1049
appropriate and more consistent names suitable for name prefixes
wenzelm@36857
  1050
within the HOL theories.  INCOMPATIBILITY.
haftmann@35050
  1051
haftmann@35084
  1052
* Some generic constants have been put to appropriate theories:
wenzelm@36857
  1053
  - less_eq, less: Orderings
wenzelm@36857
  1054
  - zero, one, plus, minus, uminus, times, abs, sgn: Groups
wenzelm@36857
  1055
  - inverse, divide: Rings
haftmann@35084
  1056
INCOMPATIBILITY.
haftmann@35084
  1057
wenzelm@36857
  1058
* More consistent naming of type classes involving orderings (and
wenzelm@36857
  1059
lattices):
haftmann@35027
  1060
haftmann@35027
  1061
    lower_semilattice                   ~> semilattice_inf
haftmann@35027
  1062
    upper_semilattice                   ~> semilattice_sup
haftmann@35027
  1063
haftmann@35027
  1064
    dense_linear_order                  ~> dense_linorder
haftmann@35027
  1065
haftmann@35027
  1066
    pordered_ab_group_add               ~> ordered_ab_group_add
haftmann@35027
  1067
    pordered_ab_group_add_abs           ~> ordered_ab_group_add_abs
haftmann@35027
  1068
    pordered_ab_semigroup_add           ~> ordered_ab_semigroup_add
haftmann@35027
  1069
    pordered_ab_semigroup_add_imp_le    ~> ordered_ab_semigroup_add_imp_le
haftmann@35027
  1070
    pordered_cancel_ab_semigroup_add    ~> ordered_cancel_ab_semigroup_add
haftmann@35027
  1071
    pordered_cancel_comm_semiring       ~> ordered_cancel_comm_semiring
haftmann@35027
  1072
    pordered_cancel_semiring            ~> ordered_cancel_semiring
haftmann@35027
  1073
    pordered_comm_monoid_add            ~> ordered_comm_monoid_add
haftmann@35027
  1074
    pordered_comm_ring                  ~> ordered_comm_ring
haftmann@35027
  1075
    pordered_comm_semiring              ~> ordered_comm_semiring
haftmann@35027
  1076
    pordered_ring                       ~> ordered_ring
haftmann@35027
  1077
    pordered_ring_abs                   ~> ordered_ring_abs
haftmann@35027
  1078
    pordered_semiring                   ~> ordered_semiring
haftmann@35027
  1079
haftmann@35027
  1080
    ordered_ab_group_add                ~> linordered_ab_group_add
haftmann@35027
  1081
    ordered_ab_semigroup_add            ~> linordered_ab_semigroup_add
haftmann@35027
  1082
    ordered_cancel_ab_semigroup_add     ~> linordered_cancel_ab_semigroup_add
haftmann@35027
  1083
    ordered_comm_semiring_strict        ~> linordered_comm_semiring_strict
haftmann@35027
  1084
    ordered_field                       ~> linordered_field
haftmann@35027
  1085
    ordered_field_no_lb                 ~> linordered_field_no_lb
haftmann@35027
  1086
    ordered_field_no_ub                 ~> linordered_field_no_ub
haftmann@35027
  1087
    ordered_field_dense_linear_order    ~> dense_linordered_field
haftmann@35027
  1088
    ordered_idom                        ~> linordered_idom
haftmann@35027
  1089
    ordered_ring                        ~> linordered_ring
haftmann@35027
  1090
    ordered_ring_le_cancel_factor       ~> linordered_ring_le_cancel_factor
haftmann@35027
  1091
    ordered_ring_less_cancel_factor     ~> linordered_ring_less_cancel_factor
haftmann@35027
  1092
    ordered_ring_strict                 ~> linordered_ring_strict
haftmann@35027
  1093
    ordered_semidom                     ~> linordered_semidom
haftmann@35027
  1094
    ordered_semiring                    ~> linordered_semiring
haftmann@35027
  1095
    ordered_semiring_1                  ~> linordered_semiring_1
haftmann@35027
  1096
    ordered_semiring_1_strict           ~> linordered_semiring_1_strict
haftmann@35027
  1097
    ordered_semiring_strict             ~> linordered_semiring_strict
haftmann@35027
  1098
wenzelm@36857
  1099
  The following slightly odd type classes have been moved to a
wenzelm@37351
  1100
  separate theory Library/Lattice_Algebras:
haftmann@35032
  1101
haftmann@35032
  1102
    lordered_ab_group_add               ~> lattice_ab_group_add
haftmann@35032
  1103
    lordered_ab_group_add_abs           ~> lattice_ab_group_add_abs
haftmann@35032
  1104
    lordered_ab_group_add_meet          ~> semilattice_inf_ab_group_add
haftmann@35032
  1105
    lordered_ab_group_add_join          ~> semilattice_sup_ab_group_add
haftmann@35032
  1106
    lordered_ring                       ~> lattice_ring
haftmann@35032
  1107
haftmann@35027
  1108
INCOMPATIBILITY.
haftmann@35027
  1109
haftmann@36416
  1110
* Refined field classes:
wenzelm@36857
  1111
  - classes division_ring_inverse_zero, field_inverse_zero,
wenzelm@36857
  1112
    linordered_field_inverse_zero include rule inverse 0 = 0 --
wenzelm@36857
  1113
    subsumes former division_by_zero class;
wenzelm@36857
  1114
  - numerous lemmas have been ported from field to division_ring.
wenzelm@36857
  1115
INCOMPATIBILITY.
haftmann@36416
  1116
haftmann@36416
  1117
* Refined algebra theorem collections:
wenzelm@36857
  1118
  - dropped theorem group group_simps, use algebra_simps instead;
wenzelm@36857
  1119
  - dropped theorem group ring_simps, use field_simps instead;
wenzelm@36857
  1120
  - proper theorem collection field_simps subsumes former theorem
wenzelm@36857
  1121
    groups field_eq_simps and field_simps;
wenzelm@36857
  1122
  - dropped lemma eq_minus_self_iff which is a duplicate for
wenzelm@36857
  1123
    equal_neg_zero.
wenzelm@36857
  1124
INCOMPATIBILITY.
wenzelm@35009
  1125
wenzelm@35009
  1126
* Theory Finite_Set and List: some lemmas have been generalized from
wenzelm@34076
  1127
sets to lattices:
wenzelm@34076
  1128
haftmann@34007
  1129
  fun_left_comm_idem_inter      ~> fun_left_comm_idem_inf
haftmann@34007
  1130
  fun_left_comm_idem_union      ~> fun_left_comm_idem_sup
haftmann@34007
  1131
  inter_Inter_fold_inter        ~> inf_Inf_fold_inf
haftmann@34007
  1132
  union_Union_fold_union        ~> sup_Sup_fold_sup
haftmann@34007
  1133
  Inter_fold_inter              ~> Inf_fold_inf
haftmann@34007
  1134
  Union_fold_union              ~> Sup_fold_sup
haftmann@34007
  1135
  inter_INTER_fold_inter        ~> inf_INFI_fold_inf
haftmann@34007
  1136
  union_UNION_fold_union        ~> sup_SUPR_fold_sup
haftmann@34007
  1137
  INTER_fold_inter              ~> INFI_fold_inf
haftmann@34007
  1138
  UNION_fold_union              ~> SUPR_fold_sup
haftmann@34007
  1139
wenzelm@37351
  1140
* Theory "Complete_Lattice": lemmas top_def and bot_def have been
haftmann@36416
  1141
replaced by the more convenient lemmas Inf_empty and Sup_empty.
haftmann@36416
  1142
Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
haftmann@36416
  1143
by Inf_insert and Sup_insert.  Lemmas Inf_UNIV and Sup_UNIV replace
haftmann@36416
  1144
former Inf_Univ and Sup_Univ.  Lemmas inf_top_right and sup_bot_right
haftmann@36416
  1145
subsume inf_top and sup_bot respectively.  INCOMPATIBILITY.
haftmann@36416
  1146
wenzelm@36857
  1147
* Reorganized theory Multiset: swapped notation of pointwise and
wenzelm@36857
  1148
multiset order:
wenzelm@37351
  1149
wenzelm@36857
  1150
  - pointwise ordering is instance of class order with standard syntax
wenzelm@36857
  1151
    <= and <;
wenzelm@36857
  1152
  - multiset ordering has syntax <=# and <#; partial order properties
wenzelm@36857
  1153
    are provided by means of interpretation with prefix
wenzelm@36857
  1154
    multiset_order;
wenzelm@36857
  1155
  - less duplication, less historical organization of sections,
wenzelm@36857
  1156
    conversion from associations lists to multisets, rudimentary code
wenzelm@36857
  1157
    generation;
wenzelm@36857
  1158
  - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
wenzelm@36857
  1159
    if needed.
wenzelm@37351
  1160
nipkow@36903
  1161
Renamed:
wenzelm@37351
  1162
wenzelm@37351
  1163
  multiset_eq_conv_count_eq  ~>  multiset_ext_iff
wenzelm@37351
  1164
  multi_count_ext  ~>  multiset_ext
wenzelm@37351
  1165
  diff_union_inverse2  ~>  diff_union_cancelR
wenzelm@37351
  1166
wenzelm@36857
  1167
INCOMPATIBILITY.
haftmann@36416
  1168
nipkow@36903
  1169
* Theory Permutation: replaced local "remove" by List.remove1.
nipkow@36903
  1170
haftmann@36416
  1171
* Code generation: ML and OCaml code is decorated with signatures.
haftmann@36416
  1172
wenzelm@35009
  1173
* Theory List: added transpose.
wenzelm@35009
  1174
huffman@35810
  1175
* Library/Nat_Bijection.thy is a collection of bijective functions
huffman@35810
  1176
between nat and other types, which supersedes the older libraries
huffman@35810
  1177
Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy.  INCOMPATIBILITY.
huffman@35810
  1178
huffman@35810
  1179
  Constants:
huffman@35810
  1180
  Nat_Int_Bij.nat2_to_nat         ~> prod_encode
huffman@35810
  1181
  Nat_Int_Bij.nat_to_nat2         ~> prod_decode
huffman@35810
  1182
  Nat_Int_Bij.int_to_nat_bij      ~> int_encode
huffman@35810
  1183
  Nat_Int_Bij.nat_to_int_bij      ~> int_decode
huffman@35810
  1184
  Countable.pair_encode           ~> prod_encode
huffman@35810
  1185
  NatIso.prod2nat                 ~> prod_encode
huffman@35810
  1186
  NatIso.nat2prod                 ~> prod_decode
huffman@35810
  1187
  NatIso.sum2nat                  ~> sum_encode
huffman@35810
  1188
  NatIso.nat2sum                  ~> sum_decode
huffman@35810
  1189
  NatIso.list2nat                 ~> list_encode
huffman@35810
  1190
  NatIso.nat2list                 ~> list_decode
huffman@35810
  1191
  NatIso.set2nat                  ~> set_encode
huffman@35810
  1192
  NatIso.nat2set                  ~> set_decode
huffman@35810
  1193
huffman@35810
  1194
  Lemmas:
huffman@35810
  1195
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_decode
huffman@35810
  1196
  Nat_Int_Bij.nat2_to_nat_inj     ~> inj_prod_encode
huffman@35810
  1197
  Nat_Int_Bij.nat2_to_nat_surj    ~> surj_prod_encode
huffman@35810
  1198
  Nat_Int_Bij.nat_to_nat2_inj     ~> inj_prod_decode
huffman@35810
  1199
  Nat_Int_Bij.nat_to_nat2_surj    ~> surj_prod_decode
huffman@35810
  1200
  Nat_Int_Bij.i2n_n2i_id          ~> int_encode_inverse
huffman@35810
  1201
  Nat_Int_Bij.n2i_i2n_id          ~> int_decode_inverse
huffman@35810
  1202
  Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
huffman@35810
  1203
  Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
huffman@35810
  1204
  Nat_Int_Bij.inj_nat_to_int_bij  ~> inj_int_encode
huffman@35810
  1205
  Nat_Int_Bij.inj_int_to_nat_bij  ~> inj_int_decode
huffman@35810
  1206
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_encode
huffman@35810
  1207
  Nat_Int_Bij.bij_int_to_nat_bij  ~> bij_int_decode
huffman@35810
  1208
blanchet@36929
  1209
* Sledgehammer:
blanchet@36929
  1210
  - Renamed ATP commands:
blanchet@36929
  1211
    atp_info     ~> sledgehammer running_atps
blanchet@36929
  1212
    atp_kill     ~> sledgehammer kill_atps
blanchet@36929
  1213
    atp_messages ~> sledgehammer messages
blanchet@36929
  1214
    atp_minimize ~> sledgehammer minimize
blanchet@36929
  1215
    print_atps   ~> sledgehammer available_atps
blanchet@36929
  1216
    INCOMPATIBILITY.
blanchet@36929
  1217
  - Added user's manual ("isabelle doc sledgehammer").
blanchet@36929
  1218
  - Added option syntax and "sledgehammer_params" to customize
blanchet@36929
  1219
    Sledgehammer's behavior.  See the manual for details.
blanchet@36929
  1220
  - Modified the Isar proof reconstruction code so that it produces
blanchet@36929
  1221
    direct proofs rather than proofs by contradiction.  (This feature
blanchet@36929
  1222
    is still experimental.)
blanchet@36929
  1223
  - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
blanchet@36929
  1224
    full-typed mode.
blanchet@36929
  1225
  - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
blanchet@36929
  1226
blanchet@36928
  1227
* Nitpick:
blanchet@36928
  1228
  - Added and implemented "binary_ints" and "bits" options.
blanchet@36928
  1229
  - Added "std" option and implemented support for nonstandard models.
blanchet@36928
  1230
  - Added and implemented "finitize" option to improve the precision
blanchet@36928
  1231
    of infinite datatypes based on a monotonicity analysis.
blanchet@36928
  1232
  - Added support for quotient types.
blanchet@36928
  1233
  - Added support for "specification" and "ax_specification"
blanchet@36928
  1234
    constructs.
blanchet@36928
  1235
  - Added support for local definitions (for "function" and
blanchet@36928
  1236
    "termination" proofs).
blanchet@36928
  1237
  - Added support for term postprocessors.
blanchet@36928
  1238
  - Optimized "Multiset.multiset" and "FinFun.finfun".
blanchet@36928
  1239
  - Improved efficiency of "destroy_constrs" optimization.
blanchet@36928
  1240
  - Fixed soundness bugs related to "destroy_constrs" optimization and
blanchet@36928
  1241
    record getters.
blanchet@37272
  1242
  - Fixed soundness bug related to higher-order constructors.
blanchet@37272
  1243
  - Fixed soundness bug when "full_descrs" is enabled.
blanchet@36928
  1244
  - Improved precision of set constructs.
blanchet@37260
  1245
  - Added "atoms" option.
blanchet@36928
  1246
  - Added cache to speed up repeated Kodkod invocations on the same
blanchet@36928
  1247
    problems.
blanchet@36928
  1248
  - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
blanchet@36928
  1249
    "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
blanchet@36928
  1250
    "SAT4J_Light".  INCOMPATIBILITY.
blanchet@36928
  1251
  - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
blanchet@36928
  1252
    "sharing_depth", and "show_skolems" options.  INCOMPATIBILITY.
blanchet@37264
  1253
  - Removed "nitpick_intro" attribute.  INCOMPATIBILITY.
blanchet@36928
  1254
berghofe@37361
  1255
* Method "induct" now takes instantiations of the form t, where t is not
berghofe@37361
  1256
  a variable, as a shorthand for "x == t", where x is a fresh variable.
berghofe@37361
  1257
  If this is not intended, t has to be enclosed in parentheses.
berghofe@37361
  1258
  By default, the equalities generated by definitional instantiations
berghofe@37361
  1259
  are pre-simplified, which may cause parameters of inductive cases
berghofe@37361
  1260
  to disappear, or may even delete some of the inductive cases.
berghofe@37361
  1261
  Use "induct (no_simp)" instead of "induct" to restore the old
berghofe@37361
  1262
  behaviour. The (no_simp) option is also understood by the "cases"
berghofe@37361
  1263
  and "nominal_induct" methods, which now perform pre-simplification, too.
berghofe@37361
  1264
  INCOMPATIBILITY.
berghofe@37361
  1265
haftmann@33993
  1266
huffman@36828
  1267
*** HOLCF ***
huffman@36828
  1268
huffman@36828
  1269
* Variable names in lemmas generated by the domain package have
huffman@36828
  1270
changed; the naming scheme is now consistent with the HOL datatype
huffman@36828
  1271
package.  Some proof scripts may be affected, INCOMPATIBILITY.
huffman@36828
  1272
huffman@36828
  1273
* The domain package no longer defines the function "foo_copy" for
huffman@36828
  1274
recursive domain "foo".  The reach lemma is now stated directly in
huffman@36828
  1275
terms of "foo_take".  Lemmas and proofs that mention "foo_copy" must
huffman@36828
  1276
be reformulated in terms of "foo_take", INCOMPATIBILITY.
huffman@36828
  1277
huffman@36828
  1278
* Most definedness lemmas generated by the domain package (previously
huffman@36828
  1279
of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
huffman@36828
  1280
like "foo$x = UU <-> x = UU", which works better as a simp rule.
wenzelm@37351
  1281
Proofs that used definedness lemmas as intro rules may break,
huffman@36828
  1282
potential INCOMPATIBILITY.
huffman@36828
  1283
huffman@36828
  1284
* Induction and casedist rules generated by the domain package now
huffman@36828
  1285
declare proper case_names (one called "bottom", and one named for each
huffman@36828
  1286
constructor).  INCOMPATIBILITY.
huffman@36828
  1287
huffman@36828
  1288
* For mutually-recursive domains, separate "reach" and "take_lemma"
huffman@36828
  1289
rules are generated for each domain, INCOMPATIBILITY.
huffman@36828
  1290
huffman@36828
  1291
  foo_bar.reach       ~> foo.reach  bar.reach
huffman@36828
  1292
  foo_bar.take_lemmas ~> foo.take_lemma  bar.take_lemma
huffman@36828
  1293
huffman@36828
  1294
* Some lemmas generated by the domain package have been renamed for
huffman@36828
  1295
consistency with the datatype package, INCOMPATIBILITY.
huffman@36828
  1296
huffman@36828
  1297
  foo.ind        ~> foo.induct
huffman@36828
  1298
  foo.finite_ind ~> foo.finite_induct
huffman@36828
  1299
  foo.coind      ~> foo.coinduct
huffman@36828
  1300
  foo.casedist   ~> foo.exhaust
huffman@36828
  1301
  foo.exhaust    ~> foo.nchotomy
huffman@36828
  1302
huffman@36828
  1303
* For consistency with other definition packages, the fixrec package
huffman@36828
  1304
now generates qualified theorem names, INCOMPATIBILITY.
huffman@36828
  1305
huffman@36828
  1306
  foo_simps  ~> foo.simps
huffman@36828
  1307
  foo_unfold ~> foo.unfold
huffman@36828
  1308
  foo_induct ~> foo.induct
huffman@36828
  1309
huffman@37087
  1310
* The "fixrec_simp" attribute has been removed.  The "fixrec_simp"
huffman@37087
  1311
method and internal fixrec proofs now use the default simpset instead.
huffman@37087
  1312
INCOMPATIBILITY.
huffman@37087
  1313
huffman@36828
  1314
* The "contlub" predicate has been removed.  Proof scripts should use
huffman@36828
  1315
lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
huffman@36828
  1316
huffman@36828
  1317
* The "admw" predicate has been removed, INCOMPATIBILITY.
huffman@36828
  1318
huffman@36828
  1319
* The constants cpair, cfst, and csnd have been removed in favor of
huffman@36828
  1320
Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
huffman@36828
  1321
huffman@36828
  1322
haftmann@33993
  1323
*** ML ***
haftmann@33993
  1324
wenzelm@37351
  1325
* Antiquotations for basic formal entities:
wenzelm@37351
  1326
wenzelm@37351
  1327
    @{class NAME}         -- type class
wenzelm@37351
  1328
    @{class_syntax NAME}  -- syntax representation of the above
wenzelm@37351
  1329
wenzelm@37351
  1330
    @{type_name NAME}     -- logical type
wenzelm@37351
  1331
    @{type_abbrev NAME}   -- type abbreviation
wenzelm@37351
  1332
    @{nonterminal NAME}   -- type of concrete syntactic category
wenzelm@37351
  1333
    @{type_syntax NAME}   -- syntax representation of any of the above
wenzelm@37351
  1334
wenzelm@37351
  1335
    @{const_name NAME}    -- logical constant (INCOMPATIBILITY)
wenzelm@37351
  1336
    @{const_abbrev NAME}  -- abbreviated constant
wenzelm@37351
  1337
    @{const_syntax NAME}  -- syntax representation of any of the above
wenzelm@37351
  1338
wenzelm@37351
  1339
* Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
wenzelm@37351
  1340
syntax constant (cf. 'syntax' command).
wenzelm@37351
  1341
wenzelm@37351
  1342
* Antiquotation @{make_string} inlines a function to print arbitrary
wenzelm@37351
  1343
values similar to the ML toplevel.  The result is compiler dependent
wenzelm@37351
  1344
and may fall back on "?" in certain situations.
wenzelm@37351
  1345
wenzelm@37351
  1346
* Diagnostic commands 'ML_val' and 'ML_command' may refer to
wenzelm@37351
  1347
antiquotations @{Isar.state} and @{Isar.goal}.  This replaces impure
wenzelm@37351
  1348
Isar.state() and Isar.goal(), which belong to the old TTY loop and do
wenzelm@37351
  1349
not work with the asynchronous Isar document model.
wenzelm@37351
  1350
wenzelm@37351
  1351
* Configuration options now admit dynamic default values, depending on
wenzelm@37351
  1352
the context or even global references.
wenzelm@37351
  1353
wenzelm@37351
  1354
* SHA1.digest digests strings according to SHA-1 (see RFC 3174).  It
wenzelm@37351
  1355
uses an efficient external library if available (for Poly/ML).
wenzelm@37351
  1356
wenzelm@37144
  1357
* Renamed some important ML structures, while keeping the old names
wenzelm@37144
  1358
for some time as aliases within the structure Legacy:
wenzelm@37144
  1359
wenzelm@37144
  1360
  OuterKeyword  ~>  Keyword
wenzelm@37144
  1361
  OuterLex      ~>  Token
wenzelm@37144
  1362
  OuterParse    ~>  Parse
wenzelm@37144
  1363
  OuterSyntax   ~>  Outer_Syntax
wenzelm@37216
  1364
  PrintMode     ~>  Print_Mode
wenzelm@37144
  1365
  SpecParse     ~>  Parse_Spec
wenzelm@37216
  1366
  ThyInfo       ~>  Thy_Info
wenzelm@37216
  1367
  ThyLoad       ~>  Thy_Load
wenzelm@37216
  1368
  ThyOutput     ~>  Thy_Output
wenzelm@37145
  1369
  TypeInfer     ~>  Type_Infer
wenzelm@37144
  1370
wenzelm@37144
  1371
Note that "open Legacy" simplifies porting of sources, but forgetting
wenzelm@37144
  1372
to remove it again will complicate porting again in the future.
wenzelm@37144
  1373
wenzelm@37144
  1374
* Most operations that refer to a global context are named
wenzelm@37144
  1375
accordingly, e.g. Simplifier.global_context or
wenzelm@37144
  1376
ProofContext.init_global.  There are some situations where a global
wenzelm@37144
  1377
context actually works, but under normal circumstances one needs to
wenzelm@37144
  1378
pass the proper local context through the code!
wenzelm@37144
  1379
wenzelm@37144
  1380
* Discontinued old TheoryDataFun with its copy/init operation -- data
wenzelm@37144
  1381
needs to be pure.  Functor Theory_Data_PP retains the traditional
wenzelm@37144
  1382
Pretty.pp argument to merge, which is absent in the standard
wenzelm@37144
  1383
Theory_Data version.
wenzelm@36429
  1384
wenzelm@37144
  1385
* Sorts.certify_sort and derived "cert" operations for types and terms
wenzelm@37144
  1386
no longer minimize sorts.  Thus certification at the boundary of the
wenzelm@37144
  1387
inference kernel becomes invariant under addition of class relations,
wenzelm@37144
  1388
which is an important monotonicity principle.  Sorts are now minimized
wenzelm@37144
  1389
in the syntax layer only, at the boundary between the end-user and the
wenzelm@37144
  1390
system.  Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
wenzelm@37144
  1391
explicitly in rare situations.
wenzelm@37144
  1392
wenzelm@35021
  1393
* Renamed old-style Drule.standard to Drule.export_without_context, to
wenzelm@35021
  1394
emphasize that this is in no way a standard operation.
wenzelm@35021
  1395
INCOMPATIBILITY.
wenzelm@35021
  1396
wenzelm@34076
  1397
* Subgoal.FOCUS (and variants): resulting goal state is normalized as
wenzelm@34076
  1398
usual for resolution.  Rare INCOMPATIBILITY.
wenzelm@34076
  1399
wenzelm@35845
  1400
* Renamed varify/unvarify operations to varify_global/unvarify_global
wenzelm@35845
  1401
to emphasize that these only work in a global situation (which is
wenzelm@35845
  1402
quite rare).
wenzelm@35845
  1403
wenzelm@37144
  1404
* Curried take and drop in library.ML; negative length is interpreted
wenzelm@37144
  1405
as infinity (as in chop).  Subtle INCOMPATIBILITY.
wenzelm@36961
  1406
wenzelm@37351
  1407
* Proof terms: type substitutions on proof constants now use canonical
wenzelm@37351
  1408
order of type variables.  INCOMPATIBILITY for tools working with proof
wenzelm@37351
  1409
terms.
wenzelm@37351
  1410
wenzelm@37351
  1411
* Raw axioms/defs may no longer carry sort constraints, and raw defs
wenzelm@37351
  1412
may no longer carry premises.  User-level specifications are
wenzelm@37351
  1413
transformed accordingly by Thm.add_axiom/add_def.
wenzelm@37351
  1414
haftmann@33993
  1415
wenzelm@34238
  1416
*** System ***
wenzelm@34238
  1417
wenzelm@34238
  1418
* Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
wenzelm@34238
  1419
ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions.  Note that
wenzelm@34238
  1420
proof terms are enabled unconditionally in the new HOL-Proofs image.
wenzelm@34238
  1421
wenzelm@34255
  1422
* Discontinued old ISABELLE and ISATOOL environment settings (legacy
wenzelm@34255
  1423
feature since Isabelle2009).  Use ISABELLE_PROCESS and ISABELLE_TOOL,
wenzelm@34255
  1424
respectively.
wenzelm@34255
  1425
wenzelm@36201
  1426
* Old lib/scripts/polyml-platform is superseded by the
wenzelm@36201
  1427
ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
wenzelm@36201
  1428
variant, even on a 64 bit machine.  The following example setting
wenzelm@36201
  1429
prefers 64 bit if available:
wenzelm@36201
  1430
wenzelm@36201
  1431
  ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
wenzelm@36201
  1432
wenzelm@37218
  1433
* The preliminary Isabelle/jEdit application demonstrates the emerging
wenzelm@37218
  1434
Isabelle/Scala layer for advanced prover interaction and integration.
wenzelm@37218
  1435
See src/Tools/jEdit or "isabelle jedit" provided by the properly built
wenzelm@37218
  1436
component.
wenzelm@37218
  1437
wenzelm@37375
  1438
* "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
wenzelm@37375
  1439
and Bluesky TeX fonts.  It provides the usual Isabelle symbols,
wenzelm@37375
  1440
similar to the default assignment of the document preparation system
wenzelm@37375
  1441
(cf. isabellesym.sty).  The Isabelle/Scala class Isabelle_System
wenzelm@37375
  1442
provides some operations for direct access to the font without asking
wenzelm@37375
  1443
the user for manual installation.
wenzelm@37375
  1444
wenzelm@34238
  1445
haftmann@33993
  1446
wenzelm@33842
  1447
New in Isabelle2009-1 (December 2009)
wenzelm@33842
  1448
-------------------------------------
wenzelm@30904
  1449
wenzelm@31547
  1450
*** General ***
wenzelm@31547
  1451
wenzelm@31547
  1452
* Discontinued old form of "escaped symbols" such as \\<forall>.  Only
wenzelm@31547
  1453
one backslash should be used, even in ML sources.
wenzelm@31547
  1454
wenzelm@31547
  1455
haftmann@30951
  1456
*** Pure ***
haftmann@30951
  1457
ballarin@32846
  1458
* Locale interpretation propagates mixins along the locale hierarchy.
ballarin@32846
  1459
The currently only available mixins are the equations used to map
ballarin@32846
  1460
local definitions to terms of the target domain of an interpretation.
ballarin@32846
  1461
wenzelm@33842
  1462
* Reactivated diagnostic command 'print_interps'.  Use "print_interps
wenzelm@33842
  1463
loc" to print all interpretations of locale "loc" in the theory.
wenzelm@33842
  1464
Interpretations in proofs are not shown.
ballarin@32846
  1465
ballarin@32983
  1466
* Thoroughly revised locales tutorial.  New section on conditional
ballarin@32983
  1467
interpretation.
ballarin@32983
  1468
wenzelm@33843
  1469
* On instantiation of classes, remaining undefined class parameters
wenzelm@33843
  1470
are formally declared.  INCOMPATIBILITY.
wenzelm@33843
  1471
haftmann@30951
  1472
wenzelm@33842
  1473
*** Document preparation ***
wenzelm@33842
  1474
wenzelm@33842
  1475
* New generalized style concept for printing terms: @{foo (style) ...}
wenzelm@33842
  1476
instead of @{foo_style style ...}  (old form is still retained for
wenzelm@33842
  1477
backward compatibility).  Styles can be also applied for
wenzelm@33842
  1478
antiquotations prop, term_type and typeof.
haftmann@32891
  1479
haftmann@32891
  1480
haftmann@30930
  1481
*** HOL ***
haftmann@30930
  1482
wenzelm@33842
  1483
* New proof method "smt" for a combination of first-order logic with
wenzelm@33842
  1484
equality, linear and nonlinear (natural/integer/real) arithmetic, and
wenzelm@33842
  1485
fixed-size bitvectors; there is also basic support for higher-order
wenzelm@33842
  1486
features (esp. lambda abstractions).  It is an incomplete decision
wenzelm@33842
  1487
procedure based on external SMT solvers using the oracle mechanism;
wenzelm@33842
  1488
for the SMT solver Z3, this method is proof-producing.  Certificates
wenzelm@33842
  1489
are provided to avoid calling the external solvers solely for
wenzelm@33842
  1490
re-checking proofs.  Due to a remote SMT service there is no need for
wenzelm@33842
  1491
installing SMT solvers locally.  See src/HOL/SMT.
wenzelm@33842
  1492
wenzelm@33842
  1493
* New commands to load and prove verification conditions generated by
wenzelm@33842
  1494
the Boogie program verifier or derived systems (e.g. the Verifying C
wenzelm@33842
  1495
Compiler (VCC) or Spec#).  See src/HOL/Boogie.
wenzelm@33842
  1496
wenzelm@33842
  1497
* New counterexample generator tool 'nitpick' based on the Kodkod
wenzelm@33842
  1498
relational model finder.  See src/HOL/Tools/Nitpick and
wenzelm@33842
  1499
src/HOL/Nitpick_Examples.
wenzelm@33842
  1500
haftmann@33860
  1501
* New commands 'code_pred' and 'values' to invoke the predicate
haftmann@33860
  1502
compiler and to enumerate values of inductive predicates.
haftmann@33860
  1503
haftmann@33860
  1504
* A tabled implementation of the reflexive transitive closure.
haftmann@33860
  1505
haftmann@33860
  1506
* New implementation of quickcheck uses generic code generator;
haftmann@33860
  1507
default generators are provided for all suitable HOL types, records
haftmann@33860
  1508
and datatypes.  Old quickcheck can be re-activated importing theory
haftmann@33860
  1509
Library/SML_Quickcheck.
haftmann@33860
  1510
wenzelm@33843
  1511
* New testing tool Mirabelle for automated proof tools.  Applies
wenzelm@33843
  1512
several tools and tactics like sledgehammer, metis, or quickcheck, to
wenzelm@33843
  1513
every proof step in a theory.  To be used in batch mode via the
wenzelm@33843
  1514
"mirabelle" utility.
wenzelm@33843
  1515
wenzelm@33843
  1516
* New proof method "sos" (sum of squares) for nonlinear real
wenzelm@33843
  1517
arithmetic (originally due to John Harison). It requires theory
wenzelm@33843
  1518
Library/Sum_Of_Squares.  It is not a complete decision procedure but
wenzelm@33843
  1519
works well in practice on quantifier-free real arithmetic with +, -,
wenzelm@33843
  1520
*, ^, =, <= and <, i.e. boolean combinations of equalities and
wenzelm@33843
  1521
inequalities between polynomials.  It makes use of external
wenzelm@33843
  1522
semidefinite programming solvers.  Method "sos" generates a
wenzelm@33843
  1523
certificate that can be pasted into the proof thus avoiding the need
wenzelm@33843
  1524
to call an external tool every time the proof is checked.  See
wenzelm@33843
  1525
src/HOL/Library/Sum_Of_Squares.
wenzelm@33843
  1526
wenzelm@33843
  1527
* New method "linarith" invokes existing linear arithmetic decision
wenzelm@33843
  1528
procedure only.
wenzelm@33843
  1529
wenzelm@33843
  1530
* New command 'atp_minimal' reduces result produced by Sledgehammer.
wenzelm@33843
  1531
wenzelm@33843
  1532
* New Sledgehammer option "Full Types" in Proof General settings menu.
wenzelm@33843
  1533
Causes full type information to be output to the ATPs.  This slows
wenzelm@33843
  1534
ATPs down considerably but eliminates a source of unsound "proofs"
wenzelm@33843
  1535
that fail later.
wenzelm@33843
  1536
wenzelm@33843
  1537
* New method "metisFT": A version of metis that uses full type
wenzelm@33843
  1538
information in order to avoid failures of proof reconstruction.
wenzelm@33843
  1539
wenzelm@33843
  1540
* New evaluator "approximate" approximates an real valued term using
wenzelm@33843
  1541
the same method as the approximation method.
wenzelm@33843
  1542
wenzelm@33843
  1543
* Method "approximate" now supports arithmetic expressions as
wenzelm@33843
  1544
boundaries of intervals and implements interval splitting and Taylor
wenzelm@33843
  1545
series expansion.
wenzelm@33843
  1546
wenzelm@33843
  1547
* ML antiquotation @{code_datatype} inserts definition of a datatype
wenzelm@33843
  1548
generated by the code generator; e.g. see src/HOL/Predicate.thy.
wenzelm@33843
  1549
haftmann@33860
  1550
* New theory SupInf of the supremum and infimum operators for sets of
haftmann@33860
  1551
reals.
haftmann@33860
  1552
haftmann@33860
  1553
* New theory Probability, which contains a development of measure
haftmann@33860
  1554
theory, eventually leading to Lebesgue integration and probability.
haftmann@33860
  1555
haftmann@33860
  1556
* Extended Multivariate Analysis to include derivation and Brouwer's
haftmann@33860
  1557
fixpoint theorem.
wenzelm@33843
  1558
wenzelm@33842
  1559
* Reorganization of number theory, INCOMPATIBILITY:
wenzelm@33873
  1560
  - new number theory development for nat and int, in theories Divides
wenzelm@33873
  1561
    and GCD as well as in new session Number_Theory
wenzelm@33873
  1562
  - some constants and facts now suffixed with _nat and _int
wenzelm@33873
  1563
    accordingly
wenzelm@33873
  1564
  - former session NumberTheory now named Old_Number_Theory, including
wenzelm@33873
  1565
    theories Legacy_GCD and Primes (prefer Number_Theory if possible)
wenzelm@33842
  1566
  - moved theory Pocklington from src/HOL/Library to
wenzelm@33842
  1567
    src/HOL/Old_Number_Theory
haftmann@32479
  1568
wenzelm@33873
  1569
* Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
wenzelm@33873
  1570
lcm of finite and infinite sets. It is shown that they form a complete
haftmann@32600
  1571
lattice.
haftmann@32600
  1572
haftmann@32600
  1573
* Class semiring_div requires superclass no_zero_divisors and proof of
haftmann@32600
  1574
div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
haftmann@32600
  1575
div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
haftmann@32600
  1576
generalized to class semiring_div, subsuming former theorems
haftmann@32600
  1577
zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
haftmann@32600
  1578
zdiv_zmult_zmult2.  div_mult_mult1 is now [simp] by default.
haftmann@32600
  1579
INCOMPATIBILITY.
haftmann@32600
  1580
haftmann@32588
  1581
* Refinements to lattice classes and sets:
haftmann@32064
  1582
  - less default intro/elim rules in locale variant, more default
haftmann@32064
  1583
    intro/elim rules in class variant: more uniformity
wenzelm@33842
  1584
  - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
wenzelm@33842
  1585
    le_inf_iff
wenzelm@33842
  1586
  - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
wenzelm@33842
  1587
    sup_aci)
haftmann@32064
  1588
  - renamed ACI to inf_sup_aci
haftmann@32600
  1589
  - new class "boolean_algebra"
wenzelm@33842
  1590
  - class "complete_lattice" moved to separate theory
haftmann@33860
  1591
    "Complete_Lattice"; corresponding constants (and abbreviations)
wenzelm@33842
  1592
    renamed and with authentic syntax:
haftmann@33860
  1593
    Set.Inf ~>    Complete_Lattice.Inf
haftmann@33860
  1594
    Set.Sup ~>    Complete_Lattice.Sup
haftmann@33860
  1595
    Set.INFI ~>   Complete_Lattice.INFI
haftmann@33860
  1596
    Set.SUPR ~>   Complete_Lattice.SUPR
haftmann@33860
  1597
    Set.Inter ~>  Complete_Lattice.Inter
haftmann@33860
  1598
    Set.Union ~>  Complete_Lattice.Union
haftmann@33860
  1599
    Set.INTER ~>  Complete_Lattice.INTER
haftmann@33860
  1600
    Set.UNION ~>  Complete_Lattice.UNION
haftmann@32600
  1601
  - authentic syntax for
haftmann@32600
  1602
    Set.Pow
haftmann@32600
  1603
    Set.image
haftmann@32588
  1604
  - mere abbreviations:
haftmann@32588
  1605
    Set.empty               (for bot)
haftmann@32588
  1606
    Set.UNIV                (for top)
haftmann@33860
  1607
    Set.inter               (for inf, formerly Set.Int)
haftmann@33860
  1608
    Set.union               (for sup, formerly Set.Un)
haftmann@32588
  1609
    Complete_Lattice.Inter  (for Inf)
haftmann@32588
  1610
    Complete_Lattice.Union  (for Sup)
haftmann@32606
  1611
    Complete_Lattice.INTER  (for INFI)
haftmann@32606
  1612
    Complete_Lattice.UNION  (for SUPR)
haftmann@32600
  1613
  - object-logic definitions as far as appropriate
haftmann@32217
  1614
haftmann@32691
  1615
INCOMPATIBILITY.  Care is required when theorems Int_subset_iff or
wenzelm@33842
  1616
Un_subset_iff are explicitly deleted as default simp rules; then also
wenzelm@33842
  1617
their lattice counterparts le_inf_iff and le_sup_iff have to be
haftmann@32691
  1618
deleted to achieve the desired effect.
haftmann@32064
  1619
wenzelm@33842
  1620
* Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
wenzelm@33842
  1621
rules by default any longer; the same applies to min_max.inf_absorb1
wenzelm@33842
  1622
etc.  INCOMPATIBILITY.
wenzelm@33842
  1623
wenzelm@33842
  1624
* Rules sup_Int_eq and sup_Un_eq are no longer declared as
wenzelm@33842
  1625
pred_set_conv by default.  INCOMPATIBILITY.
wenzelm@33842
  1626
wenzelm@33842
  1627
* Power operations on relations and functions are now one dedicated
haftmann@32706
  1628
constant "compow" with infix syntax "^^".  Power operation on
wenzelm@31547
  1629
multiplicative monoids retains syntax "^" and is now defined generic
wenzelm@31547
  1630
in class power.  INCOMPATIBILITY.
wenzelm@31547
  1631
wenzelm@33842
  1632
* Relation composition "R O S" now has a more standard argument order:
wenzelm@33842
  1633
"R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}".  INCOMPATIBILITY,
wenzelm@33842
  1634
rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
wenzelm@33842
  1635
break, since the O_assoc rule was not rewritten like this.  Fix using
wenzelm@33842
  1636
O_assoc[symmetric].  The same applies to the curried version "R OO S".
wenzelm@32427
  1637
nipkow@33057
  1638
* Function "Inv" is renamed to "inv_into" and function "inv" is now an
wenzelm@33842
  1639
abbreviation for "inv_into UNIV".  Lemmas are renamed accordingly.
nipkow@32988
  1640
INCOMPATIBILITY.
nipkow@32988
  1641
haftmann@33860
  1642
* Most rules produced by inductive and datatype package have mandatory
haftmann@33860
  1643
prefixes.  INCOMPATIBILITY.
nipkow@31790
  1644
wenzelm@33842
  1645
* Changed "DERIV_intros" to a dynamic fact, which can be augmented by
wenzelm@33842
  1646
the attribute of the same name.  Each of the theorems in the list
wenzelm@33842
  1647
DERIV_intros assumes composition with an additional function and
wenzelm@33842
  1648
matches a variable to the derivative, which has to be solved by the
wenzelm@33842
  1649
Simplifier.  Hence (auto intro!: DERIV_intros) computes the derivative
wenzelm@33873
  1650
of most elementary terms.  Former Maclauren.DERIV_tac and
wenzelm@33873
  1651
Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
wenzelm@33873
  1652
INCOMPATIBILITY.
haftmann@33860
  1653
haftmann@33860
  1654
* Code generator attributes follow the usual underscore convention:
haftmann@33860
  1655
    code_unfold     replaces    code unfold
haftmann@33860
  1656
    code_post       replaces    code post
haftmann@33860
  1657
    etc.
haftmann@33860
  1658
  INCOMPATIBILITY.
wenzelm@31900
  1659
krauss@33471
  1660
* Renamed methods:
krauss@33471
  1661
    sizechange -> size_change
krauss@33471
  1662
    induct_scheme -> induction_schema
haftmann@33860
  1663
  INCOMPATIBILITY.
nipkow@33673
  1664
wenzelm@33843
  1665
* Discontinued abbreviation "arbitrary" of constant "undefined".
wenzelm@33843
  1666
INCOMPATIBILITY, use "undefined" directly.
wenzelm@33843
  1667
haftmann@33860
  1668
* Renamed theorems:
haftmann@33860
  1669
    Suc_eq_add_numeral_1 -> Suc_eq_plus1
haftmann@33860
  1670
    Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
haftmann@33860
  1671
    Suc_plus1 -> Suc_eq_plus1
haftmann@33860
  1672
    *anti_sym -> *antisym*
haftmann@33860
  1673
    vector_less_eq_def -> vector_le_def
haftmann@33860
  1674
  INCOMPATIBILITY.
haftmann@33860
  1675
haftmann@33860
  1676
* Added theorem List.map_map as [simp].  Removed List.map_compose.
haftmann@33860
  1677
INCOMPATIBILITY.
haftmann@33860
  1678
haftmann@33860
  1679
* Removed predicate "M hassize n" (<--> card M = n & finite M).
haftmann@33860
  1680
INCOMPATIBILITY.
haftmann@33860
  1681
hoelzl@31812
  1682
huffman@33825
  1683
*** HOLCF ***
huffman@33825
  1684
wenzelm@33842
  1685
* Theory Representable defines a class "rep" of domains that are
wenzelm@33842
  1686
representable (via an ep-pair) in the universal domain type "udom".
huffman@33825
  1687
Instances are provided for all type constructors defined in HOLCF.
huffman@33825
  1688
huffman@33825
  1689
* The 'new_domain' command is a purely definitional version of the
huffman@33825
  1690
domain package, for representable domains.  Syntax is identical to the
huffman@33825
  1691
old domain package.  The 'new_domain' package also supports indirect
huffman@33825
  1692
recursion using previously-defined type constructors.  See
wenzelm@33842
  1693
src/HOLCF/ex/New_Domain.thy for examples.
wenzelm@33842
  1694
wenzelm@33842
  1695
* Method "fixrec_simp" unfolds one step of a fixrec-defined constant
huffman@33825
  1696
on the left-hand side of an equation, and then performs
huffman@33825
  1697
simplification.  Rewriting is done using rules declared with the
wenzelm@33842
  1698
"fixrec_simp" attribute.  The "fixrec_simp" method is intended as a
wenzelm@33842
  1699
replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
huffman@33825
  1700
huffman@33825
  1701
* The pattern-match compiler in 'fixrec' can now handle constructors
huffman@33825
  1702
with HOL function types.  Pattern-match combinators for the Pair
huffman@33825
  1703
constructor are pre-configured.
huffman@33825
  1704
huffman@33825
  1705
* The 'fixrec' package now produces better fixed-point induction rules
huffman@33825
  1706
for mutually-recursive definitions:  Induction rules have conclusions
huffman@33825
  1707
of the form "P foo bar" instead of "P <foo, bar>".
huffman@33825
  1708
huffman@33825
  1709
* The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
huffman@33825
  1710
been renamed to "below".  The name "below" now replaces "less" in many
wenzelm@33842
  1711
theorem names.  (Legacy theorem names using "less" are still supported
wenzelm@33842
  1712
as well.)
huffman@33825
  1713
huffman@33825
  1714
* The 'fixrec' package now supports "bottom patterns".  Bottom
huffman@33825
  1715
patterns can be used to generate strictness rules, or to make
huffman@33825
  1716
functions more strict (much like the bang-patterns supported by the
wenzelm@33873
  1717
Glasgow Haskell Compiler).  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@33873
  1718
examples.
huffman@33825
  1719
huffman@33825
  1720
wenzelm@31304
  1721
*** ML ***
wenzelm@31304
  1722
wenzelm@33843
  1723
* Support for Poly/ML 5.3.0, with improved reporting of compiler
wenzelm@33843
  1724
errors and run-time exceptions, including detailed source positions.
wenzelm@33843
  1725
wenzelm@33843
  1726
* Structure Name_Space (formerly NameSpace) now manages uniquely
wenzelm@33843
  1727
identified entries, with some additional information such as source
wenzelm@33843
  1728
position, logical grouping etc.
wenzelm@33843
  1729
wenzelm@33524
  1730
* Theory and context data is now introduced by the simplified and
wenzelm@33524
  1731
modernized functors Theory_Data, Proof_Data, Generic_Data.  Data needs
wenzelm@33524
  1732
to be pure, but the old TheoryDataFun for mutable data (with explicit
wenzelm@33524
  1733
copy operation) is still available for some time.
wenzelm@33524
  1734
wenzelm@32742
  1735
* Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
wenzelm@32742
  1736
provides a high-level programming interface to synchronized state
wenzelm@32742
  1737
variables with atomic update.  This works via pure function
wenzelm@32742
  1738
application within a critical section -- its runtime should be as
wenzelm@32742
  1739
short as possible; beware of deadlocks if critical code is nested,
wenzelm@32742
  1740
either directly or indirectly via other synchronized variables!
wenzelm@32742
  1741
wenzelm@32742
  1742
* Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
wenzelm@32742
  1743
wraps raw ML references, explicitly indicating their non-thread-safe
wenzelm@32742
  1744
behaviour.  The Isar toplevel keeps this structure open, to
wenzelm@32742
  1745
accommodate Proof General as well as quick and dirty interactive
wenzelm@32742
  1746
experiments with references.
wenzelm@32742
  1747
wenzelm@32365
  1748
* PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
wenzelm@32365
  1749
parallel tactical reasoning.
wenzelm@32365
  1750
wenzelm@32427
  1751
* Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
wenzelm@32427
  1752
are similar to SUBPROOF, but are slightly more flexible: only the
wenzelm@32427
  1753
specified parts of the subgoal are imported into the context, and the
wenzelm@32427
  1754
body tactic may introduce new subgoals and schematic variables.
wenzelm@32427
  1755
wenzelm@32427
  1756
* Old tactical METAHYPS, which does not observe the proof context, has
wenzelm@32427
  1757
been renamed to Old_Goals.METAHYPS and awaits deletion.  Use SUBPROOF
wenzelm@32427
  1758
or Subgoal.FOCUS etc.
wenzelm@32216
  1759
wenzelm@31971
  1760
* Renamed functor TableFun to Table, and GraphFun to Graph.  (Since
wenzelm@31971
  1761
functors have their own ML name space there is no point to mark them
wenzelm@31971
  1762
separately.)  Minor INCOMPATIBILITY.
wenzelm@31971
  1763
wenzelm@31901
  1764
* Renamed NamedThmsFun to Named_Thms.  INCOMPATIBILITY.
wenzelm@31901
  1765
wenzelm@33842
  1766
* Renamed several structures FooBar to Foo_Bar.  Occasional,
wenzelm@33842
  1767
INCOMPATIBILITY.
wenzelm@33842
  1768
wenzelm@33843
  1769
* Operations of structure Skip_Proof no longer require quick_and_dirty
wenzelm@33843
  1770
mode, which avoids critical setmp.
wenzelm@33843
  1771
wenzelm@31306
  1772
* Eliminated old Attrib.add_attributes, Method.add_methods and related
wenzelm@33842
  1773
combinators for "args".  INCOMPATIBILITY, need to use simplified
wenzelm@31306
  1774
Attrib/Method.setup introduced in Isabelle2009.
wenzelm@31304
  1775
wenzelm@32151
  1776
* Proper context for simpset_of, claset_of, clasimpset_of.  May fall
wenzelm@32151
  1777
back on global_simpset_of, global_claset_of, global_clasimpset_of as
wenzelm@32151
  1778
last resort.  INCOMPATIBILITY.
wenzelm@32151
  1779
wenzelm@32092
  1780
* Display.pretty_thm now requires a proper context (cf. former
wenzelm@32092
  1781
ProofContext.pretty_thm).  May fall back on Display.pretty_thm_global
wenzelm@32092
  1782
or even Display.pretty_thm_without_context as last resort.
wenzelm@32092
  1783
INCOMPATIBILITY.
wenzelm@32092
  1784
wenzelm@32433
  1785
* Discontinued Display.pretty_ctyp/cterm etc.  INCOMPATIBILITY, use
wenzelm@32433
  1786
Syntax.pretty_typ/term directly, preferably with proper context
wenzelm@32433
  1787
instead of global theory.
wenzelm@32433
  1788
wenzelm@31304
  1789
wenzelm@31308
  1790
*** System ***
wenzelm@31308
  1791
wenzelm@33842
  1792
* Further fine tuning of parallel proof checking, scales up to 8 cores
wenzelm@33842
  1793
(max. speedup factor 5.0).  See also Goal.parallel_proofs in ML and
wenzelm@33842
  1794
usedir option -q.
wenzelm@33842
  1795
wenzelm@32326
  1796
* Support for additional "Isabelle components" via etc/components, see
wenzelm@32326
  1797
also the system manual.
wenzelm@32326
  1798
wenzelm@32326
  1799
* The isabelle makeall tool now operates on all components with
wenzelm@32326
  1800
IsaMakefile, not just hardwired "logics".
wenzelm@32326
  1801
wenzelm@33842
  1802
* Removed "compress" option from isabelle-process and isabelle usedir;
wenzelm@33842
  1803
this is always enabled.
kleing@33818
  1804
wenzelm@31308
  1805
* Discontinued support for Poly/ML 4.x versions.
wenzelm@31308
  1806
wenzelm@33842
  1807
* Isabelle tool "wwwfind" provides web interface for 'find_theorems'
wenzelm@33842
  1808
on a given logic image.  This requires the lighttpd webserver and is
wenzelm@33842
  1809
currently supported on Linux only.
wenzelm@32061
  1810
wenzelm@31308
  1811
wenzelm@31304
  1812
wenzelm@30845
  1813
New in Isabelle2009 (April 2009)
wenzelm@30845
  1814
--------------------------------
haftmann@27104
  1815
wenzelm@27599
  1816
*** General ***
wenzelm@27599
  1817
wenzelm@28504
  1818
* Simplified main Isabelle executables, with less surprises on
wenzelm@28504
  1819
case-insensitive file-systems (such as Mac OS).
wenzelm@28504
  1820
wenzelm@28504
  1821
  - The main Isabelle tool wrapper is now called "isabelle" instead of
wenzelm@28504
  1822
    "isatool."
wenzelm@28504
  1823
wenzelm@28504
  1824
  - The former "isabelle" alias for "isabelle-process" has been
wenzelm@28504
  1825
    removed (should rarely occur to regular users).
wenzelm@28504
  1826
wenzelm@28915
  1827
  - The former "isabelle-interface" and its alias "Isabelle" have been
wenzelm@28915
  1828
    removed (interfaces are now regular Isabelle tools).
wenzelm@28504
  1829
wenzelm@28504
  1830
Within scripts and make files, the Isabelle environment variables
wenzelm@28504
  1831
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
wenzelm@28504
  1832
respectively.  (The latter are still available as legacy feature.)
wenzelm@28504
  1833
wenzelm@28915
  1834
The old isabelle-interface wrapper could react in confusing ways if
wenzelm@28915
  1835
the interface was uninstalled or changed otherwise.  Individual
wenzelm@28915
  1836
interface tool configuration is now more explicit, see also the
wenzelm@28915
  1837
Isabelle system manual.  In particular, Proof General is now available
wenzelm@28915
  1838
via "isabelle emacs".
wenzelm@28504
  1839
wenzelm@28504
  1840
INCOMPATIBILITY, need to adapt derivative scripts.  Users may need to
wenzelm@28504
  1841
purge installed copies of Isabelle executables and re-run "isabelle
wenzelm@28504
  1842
install -p ...", or use symlinks.
wenzelm@28504
  1843
wenzelm@28914
  1844
* The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
wenzelm@30845
  1845
old ~/isabelle, which was slightly non-standard and apt to cause
wenzelm@30845
  1846
surprises on case-insensitive file-systems (such as Mac OS).
wenzelm@28914
  1847
wenzelm@28914
  1848
INCOMPATIBILITY, need to move existing ~/isabelle/etc,
wenzelm@28914
  1849
~/isabelle/heaps, ~/isabelle/browser_info to the new place.  Special
wenzelm@28914
  1850
care is required when using older releases of Isabelle.  Note that
wenzelm@28914
  1851
ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
wenzelm@30845
  1852
Isabelle distribution, in order to use the new ~/.isabelle uniformly.
wenzelm@28914
  1853
wenzelm@29161
  1854
* Proofs of fully specified statements are run in parallel on
wenzelm@30845
  1855
multi-core systems.  A speedup factor of 2.5 to 3.2 can be expected on
wenzelm@30845
  1856
a regular 4-core machine, if the initial heap space is made reasonably
wenzelm@30845
  1857
large (cf. Poly/ML option -H).  (Requires Poly/ML 5.2.1 or later.)
wenzelm@30845
  1858
wenzelm@30845
  1859
* The main reference manuals ("isar-ref", "implementation", and
wenzelm@30845
  1860
"system") have been updated and extended.  Formally checked references
wenzelm@30845
  1861
as hyperlinks are now available uniformly.
wenzelm@30845
  1862
wenzelm@30163
  1863
wenzelm@27599
  1864
*** Pure ***
wenzelm@27599
  1865
wenzelm@30845
  1866
* Complete re-implementation of locales.  INCOMPATIBILITY in several
wenzelm@30845
  1867
respects.  The most important changes are listed below.  See the
wenzelm@30845
  1868
Tutorial on Locales ("locales" manual) for details.
ballarin@29253
  1869
ballarin@29253
  1870
- In locale expressions, instantiation replaces renaming.  Parameters
ballarin@29253
  1871
must be declared in a for clause.  To aid compatibility with previous
ballarin@29253
  1872
parameter inheritance, in locale declarations, parameters that are not
ballarin@29253
  1873
'touched' (instantiation position "_" or omitted) are implicitly added
ballarin@29253
  1874
with their syntax at the beginning of the for clause.
ballarin@29253
  1875
ballarin@29253
  1876
- Syntax from abbreviations and definitions in locales is available in
ballarin@29253
  1877
locale expressions and context elements.  The latter is particularly
ballarin@29253
  1878
useful in locale declarations.
ballarin@29253
  1879
ballarin@29253
  1880
- More flexible mechanisms to qualify names generated by locale
ballarin@29253
  1881
expressions.  Qualifiers (prefixes) may be specified in locale
wenzelm@30728
  1882
expressions, and can be marked as mandatory (syntax: "name!:") or
wenzelm@30728
  1883
optional (syntax "name?:").  The default depends for plain "name:"
wenzelm@30728
  1884
depends on the situation where a locale expression is used: in
wenzelm@30728
  1885
commands 'locale' and 'sublocale' prefixes are optional, in
wenzelm@30845
  1886
'interpretation' and 'interpret' prefixes are mandatory.  The old
wenzelm@30728
  1887
implicit qualifiers derived from the parameter names of a locale are
wenzelm@30728
  1888
no longer generated.
wenzelm@30106
  1889
wenzelm@30845
  1890
- Command "sublocale l < e" replaces "interpretation l < e".  The
wenzelm@30106
  1891
instantiation clause in "interpretation" and "interpret" (square
wenzelm@30106
  1892
brackets) is no longer available.  Use locale expressions.
ballarin@29253
  1893
wenzelm@30845
  1894
- When converting proof scripts, mandatory qualifiers in
wenzelm@30728
  1895
'interpretation' and 'interpret' should be retained by default, even
wenzelm@30845
  1896
if this is an INCOMPATIBILITY compared to former behavior.  In the
wenzelm@30845
  1897
worst case, use the "name?:" form for non-mandatory ones.  Qualifiers
wenzelm@30845
  1898
in locale expressions range over a single locale instance only.
wenzelm@30845
  1899
wenzelm@30845
  1900
- Dropped locale element "includes".  This is a major INCOMPATIBILITY.
wenzelm@30845
  1901
In existing theorem specifications replace the includes element by the
wenzelm@30845
  1902
respective context elements of the included locale, omitting those
wenzelm@30845
  1903
that are already present in the theorem specification.  Multiple
wenzelm@30845
  1904
assume elements of a locale should be replaced by a single one
wenzelm@30845
  1905
involving the locale predicate.  In the proof body, declarations (most
wenzelm@30845
  1906
notably theorems) may be regained by interpreting the respective
wenzelm@30845
  1907
locales in the proof context as required (command "interpret").
wenzelm@30845
  1908
wenzelm@30845
  1909
If using "includes" in replacement of a target solely because the
wenzelm@30845
  1910
parameter types in the theorem are not as general as in the target,
wenzelm@30845
  1911
consider declaring a new locale with additional type constraints on
wenzelm@30845
  1912
the parameters (context element "constrains").
wenzelm@30845
  1913
wenzelm@30845
  1914
- Discontinued "locale (open)".  INCOMPATIBILITY.
wenzelm@30845
  1915
wenzelm@30845
  1916
- Locale interpretation commands no longer attempt to simplify goal.
wenzelm@30845
  1917
INCOMPATIBILITY: in rare situations the generated goal differs.  Use
wenzelm@30845
  1918
methods intro_locales and unfold_locales to clarify.
wenzelm@30845
  1919
wenzelm@30845
  1920
- Locale interpretation commands no longer accept interpretation
wenzelm@30845
  1921
attributes.  INCOMPATIBILITY.
wenzelm@30845
  1922
wenzelm@30845
  1923
* Class declaration: so-called "base sort" must not be given in import
wenzelm@30845
  1924
list any longer, but is inferred from the specification.  Particularly
wenzelm@30845
  1925
in HOL, write
wenzelm@30845
  1926
wenzelm@30845
  1927
    class foo = ...
wenzelm@30845
  1928
wenzelm@30845
  1929
instead of
wenzelm@30845
  1930
wenzelm@30845
  1931
    class foo = type + ...
wenzelm@30845
  1932
wenzelm@30845
  1933
* Class target: global versions of theorems stemming do not carry a
wenzelm@30845
  1934
parameter prefix any longer.  INCOMPATIBILITY.
wenzelm@30845
  1935
wenzelm@30845
  1936
* Class 'instance' command no longer accepts attached definitions.
wenzelm@30845
  1937
INCOMPATIBILITY, use proper 'instantiation' target instead.
wenzelm@30845
  1938
wenzelm@30845
  1939
* Recovered hiding of consts, which was accidentally broken in
wenzelm@30845
  1940
Isabelle2007.  Potential INCOMPATIBILITY, ``hide const c'' really
wenzelm@30845
  1941
makes c inaccessible; consider using ``hide (open) const c'' instead.
wenzelm@30845
  1942
wenzelm@30845
  1943
* Slightly more coherent Pure syntax, with updated documentation in
wenzelm@30845
  1944
isar-ref manual.  Removed locales meta_term_syntax and
wenzelm@30845
  1945
meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
wenzelm@30845
  1946
INCOMPATIBILITY in rare situations.  Note that &&& should not be used
wenzelm@30845
  1947
directly in regular applications.
wenzelm@30845
  1948
wenzelm@30845
  1949
* There is a new syntactic category "float_const" for signed decimal
wenzelm@30845
  1950
fractions (e.g. 123.45 or -123.45).
wenzelm@30845
  1951
wenzelm@30845
  1952
* Removed exotic 'token_translation' command.  INCOMPATIBILITY, use ML
wenzelm@30845
  1953
interface with 'setup' command instead.
wenzelm@30845
  1954
wenzelm@30845
  1955
* Command 'local_setup' is similar to 'setup', but operates on a local
wenzelm@30845
  1956
theory context.
haftmann@27104
  1957
wenzelm@28114
  1958
* The 'axiomatization' command now only works within a global theory
wenzelm@28114
  1959
context.  INCOMPATIBILITY.
wenzelm@28114
  1960
wenzelm@30845
  1961
* Goal-directed proof now enforces strict proof irrelevance wrt. sort
wenzelm@30845
  1962
hypotheses.  Sorts required in the course of reasoning need to be
wenzelm@30845
  1963
covered by the constraints in the initial statement, completed by the
wenzelm@30845
  1964
type instance information of the background theory.  Non-trivial sort
wenzelm@30845
  1965
hypotheses, which rarely occur in practice, may be specified via
wenzelm@30845
  1966
vacuous propositions of the form SORT_CONSTRAINT('a::c).  For example:
wenzelm@30845
  1967
wenzelm@30845
  1968
  lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
wenzelm@30845
  1969
wenzelm@30845
  1970
The result contains an implicit sort hypotheses as before --
wenzelm@30845
  1971
SORT_CONSTRAINT premises are eliminated as part of the canonical rule
wenzelm@30845
  1972
normalization.
wenzelm@30845
  1973
wenzelm@30845
  1974
* Generalized Isar history, with support for linear undo, direct state
wenzelm@30845
  1975
addressing etc.
wenzelm@30845
  1976
wenzelm@30845
  1977
* Changed defaults for unify configuration options:
wenzelm@30845
  1978
wenzelm@30845
  1979
  unify_trace_bound = 50 (formerly 25)
wenzelm@30845
  1980
  unify_search_bound = 60 (formerly 30)
wenzelm@30845
  1981
wenzelm@30845
  1982
* Different bookkeeping for code equations (INCOMPATIBILITY):
wenzelm@30845
  1983
wenzelm@30845
  1984
  a) On theory merge, the last set of code equations for a particular
wenzelm@30845
  1985
     constant is taken (in accordance with the policy applied by other
wenzelm@30845
  1986
     parts of the code generator framework).
wenzelm@30845
  1987
wenzelm@30845
  1988
  b) Code equations stemming from explicit declarations (e.g. code
wenzelm@30845
  1989
     attribute) gain priority over default code equations stemming
wenzelm@30845
  1990
     from definition, primrec, fun etc.
wenzelm@30845
  1991
wenzelm@30845
  1992
* Keyword 'code_exception' now named 'code_abort'.  INCOMPATIBILITY.
wenzelm@30845
  1993
haftmann@30965
  1994
* Unified theorem tables for both code generators.  Thus [code
wenzelm@30845
  1995
func] has disappeared and only [code] remains.  INCOMPATIBILITY.
wenzelm@30577
  1996
wenzelm@30577
  1997
* Command 'find_consts' searches for constants based on type and name
wenzelm@30577
  1998
patterns, e.g.
kleing@29883
  1999
kleing@29883
  2000
    find_consts "_ => bool"
kleing@29883
  2001
wenzelm@30106
  2002
By default, matching is against subtypes, but it may be restricted to
wenzelm@30728
  2003
the whole type.  Searching by name is possible.  Multiple queries are
wenzelm@30106
  2004
conjunctive and queries may be negated by prefixing them with a
wenzelm@30106
  2005
hyphen:
kleing@29883
  2006
kleing@29883
  2007
    find_consts strict: "_ => bool" name: "Int" -"int => int"
kleing@29861
  2008
wenzelm@30845
  2009
* New 'find_theorems' criterion "solves" matches theorems that
wenzelm@30845
  2010
directly solve the current goal (modulo higher-order unification).
wenzelm@30845
  2011
wenzelm@30845
  2012
* Auto solve feature for main theorem statements: whenever a new goal
wenzelm@30845
  2013
is stated, "find_theorems solves" is called; any theorems that could
wenzelm@30845
  2014
solve the lemma directly are listed as part of the goal state.
wenzelm@30845
  2015
Cf. associated options in Proof General Isabelle settings menu,
wenzelm@30845
  2016
enabled by default, with reasonable timeout for pathological cases of
wenzelm@30845
  2017
higher-order unification.
webertj@30415
  2018
haftmann@27104
  2019
wenzelm@27381
  2020
*** Document preparation ***
wenzelm@27381
  2021
wenzelm@27381
  2022
* Antiquotation @{lemma} now imitates a regular terminal proof,
wenzelm@27392
  2023
demanding keyword 'by' and supporting the full method expression
wenzelm@27519
  2024
syntax just like the Isar command 'by'.
wenzelm@27381
  2025
wenzelm@27381
  2026
haftmann@27104
  2027
*** HOL ***
haftmann@27104
  2028
wenzelm@30845
  2029
* Integrated main parts of former image HOL-Complex with HOL.  Entry
wenzelm@30845
  2030
points Main and Complex_Main remain as before.
wenzelm@30845
  2031
wenzelm@30845
  2032
* Logic image HOL-Plain provides a minimal HOL with the most important
wenzelm@30845
  2033
tools available (inductive, datatype, primrec, ...).  This facilitates
wenzelm@30845
  2034
experimentation and tool development.  Note that user applications
wenzelm@30845
  2035
(and library theories) should never refer to anything below theory
wenzelm@30845
  2036
Main, as before.
wenzelm@30845
  2037
wenzelm@30845
  2038
* Logic image HOL-Main stops at theory Main, and thus facilitates
wenzelm@30845
  2039
experimentation due to shorter build times.
wenzelm@30845
  2040
wenzelm@30845
  2041
* Logic image HOL-NSA contains theories of nonstandard analysis which
wenzelm@30845
  2042
were previously part of former HOL-Complex.  Entry point Hyperreal
wenzelm@30845
  2043
remains valid, but theories formerly using Complex_Main should now use
wenzelm@30845
  2044
new entry point Hypercomplex.
wenzelm@30845
  2045
wenzelm@30845
  2046
* Generic ATP manager for Sledgehammer, based on ML threads instead of
wenzelm@30845
  2047
Posix processes.  Avoids potentially expensive forking of the ML
wenzelm@30845
  2048
process.  New thread-based implementation also works on non-Unix
wenzelm@30845
  2049
platforms (Cygwin).  Provers are no longer hardwired, but defined
wenzelm@30845
  2050
within the theory via plain ML wrapper functions.  Basic Sledgehammer
wenzelm@30845
  2051
commands are covered in the isar-ref manual.
wenzelm@30845
  2052
wenzelm@30845
  2053
* Wrapper scripts for remote SystemOnTPTP service allows to use
wenzelm@30845
  2054
sledgehammer without local ATP installation (Vampire etc.). Other
wenzelm@30845
  2055
provers may be included via suitable ML wrappers, see also
wenzelm@30845
  2056
src/HOL/ATP_Linkup.thy.
wenzelm@30845
  2057
wenzelm@30845
  2058
* ATP selection (E/Vampire/Spass) is now via Proof General's settings
wenzelm@30845
  2059
menu.
wenzelm@30845
  2060
wenzelm@30845
  2061
* The metis method no longer fails because the theorem is too trivial
wenzelm@30845
  2062
(contains the empty clause).
wenzelm@30845
  2063
wenzelm@30845
  2064
* The metis method now fails in the usual manner, rather than raising
wenzelm@30845
  2065
an exception, if it determines that it cannot prove the theorem.
wenzelm@30845
  2066
wenzelm@30845
  2067
* Method "coherent" implements a prover for coherent logic (see also
wenzelm@30845
  2068
src/Tools/coherent.ML).
wenzelm@30845
  2069
wenzelm@30845
  2070
* Constants "undefined" and "default" replace "arbitrary".  Usually
wenzelm@30845
  2071
"undefined" is the right choice to replace "arbitrary", though
wenzelm@30845
  2072
logically there is no difference.  INCOMPATIBILITY.
wenzelm@30845
  2073
wenzelm@30845
  2074
* Command "value" now integrates different evaluation mechanisms.  The
wenzelm@30845
  2075
result of the first successful evaluation mechanism is printed.  In
wenzelm@30845
  2076
square brackets a particular named evaluation mechanisms may be
wenzelm@30845
  2077
specified (currently, [SML], [code] or [nbe]).  See further
wenzelm@30845
  2078
src/HOL/ex/Eval_Examples.thy.
wenzelm@30845
  2079
wenzelm@30845
  2080
* Normalization by evaluation now allows non-leftlinear equations.
wenzelm@30845
  2081
Declare with attribute [code nbe].
wenzelm@30845
  2082
wenzelm@30845
  2083
* Methods "case_tac" and "induct_tac" now refer to the very same rules
wenzelm@30845
  2084
as the structured Isar versions "cases" and "induct", cf. the
wenzelm@30845
  2085
corresponding "cases" and "induct" attributes.  Mutual induction rules
wenzelm@30845
  2086
are now presented as a list of individual projections
wenzelm@30845
  2087
(e.g. foo_bar.inducts for types foo and bar); the old format with
wenzelm@30845
  2088
explicit HOL conjunction is no longer supported.  INCOMPATIBILITY, in
wenzelm@30845
  2089
rare situations a different rule is selected --- notably nested tuple
wenzelm@30845
  2090
elimination instead of former prod.exhaust: use explicit (case_tac t
wenzelm@30845
  2091
rule: prod.exhaust) here.
wenzelm@30845
  2092
wenzelm@30845
  2093
* Attributes "cases", "induct", "coinduct" support "del" option.
wenzelm@30845
  2094
wenzelm@30845
  2095
* Removed fact "case_split_thm", which duplicates "case_split".
wenzelm@30845
  2096
wenzelm@30845
  2097
* The option datatype has been moved to a new theory Option.  Renamed
wenzelm@30845
  2098
option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
wenzelm@30845
  2099
wenzelm@30845
  2100
* New predicate "strict_mono" classifies strict functions on partial
wenzelm@30845
  2101
orders.  With strict functions on linear orders, reasoning about
wenzelm@30845
  2102
(in)equalities is facilitated by theorems "strict_mono_eq",
wenzelm@30845
  2103
"strict_mono_less_eq" and "strict_mono_less".
wenzelm@30845
  2104
wenzelm@30845
  2105
* Some set operations are now proper qualified constants with
wenzelm@30845
  2106
authentic syntax.  INCOMPATIBILITY:
haftmann@30304
  2107
haftmann@30304
  2108
    op Int ~>   Set.Int
haftmann@30304
  2109
    op Un ~>    Set.Un
haftmann@30304
  2110
    INTER ~>    Set.INTER
haftmann@30304
  2111
    UNION ~>    Set.UNION
haftmann@30304
  2112
    Inter ~>    Set.Inter
haftmann@30304
  2113
    Union ~>    Set.Union
haftmann@30304
  2114
    {} ~>       Set.empty
haftmann@30304
  2115
    UNIV ~>     Set.UNIV
haftmann@30304
  2116
wenzelm@30845
  2117
* Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
wenzelm@30845
  2118
theory Set.
wenzelm@30845
  2119
wenzelm@30845
  2120
* Auxiliary class "itself" has disappeared -- classes without any
wenzelm@30845
  2121
parameter are treated as expected by the 'class' command.
haftmann@29797
  2122
haftmann@29823
  2123
* Leibnitz's Series for Pi and the arcus tangens and logarithm series.
haftmann@29823
  2124
wenzelm@30845
  2125
* Common decision procedures (Cooper, MIR, Ferrack, Approximation,
wenzelm@30845
  2126
Dense_Linear_Order) are now in directory HOL/Decision_Procs.
wenzelm@30845
  2127
wenzelm@30845
  2128
* Theory src/HOL/Decision_Procs/Approximation provides the new proof
wenzelm@30845
  2129
method "approximation".  It proves formulas on real values by using
wenzelm@30845
  2130
interval arithmetic.  In the formulas are also the transcendental
wenzelm@30845
  2131
functions sin, cos, tan, atan, ln, exp and the constant pi are
wenzelm@30845
  2132
allowed. For examples see
wenzelm@30845
  2133
src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
haftmann@29823
  2134
haftmann@29823
  2135
* Theory "Reflection" now resides in HOL/Library.
haftmann@29650
  2136
wenzelm@30845
  2137
* Entry point to Word library now simply named "Word".
wenzelm@30845
  2138
INCOMPATIBILITY.
haftmann@29628
  2139
haftmann@29197
  2140
* Made source layout more coherent with logical distribution
haftmann@29197
  2141
structure:
haftmann@28952
  2142
haftmann@28952
  2143
    src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
haftmann@28952
  2144
    src/HOL/Library/Code_Message.thy ~> src/HOL/
haftmann@28952
  2145
    src/HOL/Library/GCD.thy ~> src/HOL/
haftmann@28952
  2146
    src/HOL/Library/Order_Relation.thy ~> src/HOL/
haftmann@28952
  2147
    src/HOL/Library/Parity.thy ~> src/HOL/
haftmann@28952
  2148
    src/HOL/Library/Univ_Poly.thy ~> src/HOL/
huffman@30176
  2149
    src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
haftmann@28952
  2150
    src/HOL/Real/Lubs.thy ~> src/HOL/
haftmann@28952
  2151
    src/HOL/Real/PReal.thy ~> src/HOL/
haftmann@28952
  2152
    src/HOL/Real/Rational.thy ~> src/HOL/
haftmann@28952
  2153
    src/HOL/Real/RComplete.thy ~> src/HOL/
haftmann@28952
  2154
    src/HOL/Real/RealDef.thy ~> src/HOL/
haftmann@28952
  2155
    src/HOL/Real/RealPow.thy ~> src/HOL/
haftmann@28952
  2156
    src/HOL/Real/Real.thy ~> src/HOL/
haftmann@28952
  2157
    src/HOL/Complex/Complex_Main.thy ~> src/HOL/
haftmann@28952
  2158
    src/HOL/Complex/Complex.thy ~> src/HOL/
huffman@30176
  2159
    src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
huffman@30176
  2160
    src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
haftmann@28952
  2161
    src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
haftmann@28952
  2162
    src/HOL/Hyperreal/Fact.thy ~> src/HOL/
haftmann@28952
  2163
    src/HOL/Hyperreal/Integration.thy ~> src/HOL/
haftmann@28952
  2164
    src/HOL/Hyperreal/Lim.thy ~> src/HOL/
haftmann@28952
  2165
    src/HOL/Hyperreal/Ln.thy ~> src/HOL/
haftmann@28952
  2166
    src/HOL/Hyperreal/Log.thy ~> src/HOL/
haftmann@28952
  2167
    src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
haftmann@28952
  2168
    src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
haftmann@28952
  2169
    src/HOL/Hyperreal/Series.thy ~> src/HOL/
haftmann@29197
  2170
    src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
haftmann@28952
  2171
    src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
haftmann@28952
  2172
    src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
haftmann@28952
  2173
    src/HOL/Real/Float ~> src/HOL/Library/
haftmann@29197
  2174
    src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
haftmann@29197
  2175
    src/HOL/Real/RealVector.thy ~> src/HOL/
haftmann@28952
  2176
haftmann@28952
  2177
    src/HOL/arith_data.ML ~> src/HOL/Tools
haftmann@28952
  2178
    src/HOL/hologic.ML ~> src/HOL/Tools
haftmann@28952
  2179
    src/HOL/simpdata.ML ~> src/HOL/Tools
haftmann@28952
  2180
    src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
haftmann@28952
  2181
    src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
haftmann@28952
  2182
    src/HOL/nat_simprocs.ML ~> src/HOL/Tools
haftmann@28952
  2183
    src/HOL/Real/float_arith.ML ~> src/HOL/Tools
haftmann@28952
  2184
    src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
haftmann@28952
  2185
    src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
haftmann@28952
  2186
    src/HOL/Real/real_arith.ML ~> src/HOL/Tools
haftmann@28952
  2187
haftmann@29398
  2188
    src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2189
    src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2190
    src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2191
    src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2192
    src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2193
    src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2194
wenzelm@30845
  2195
* If methods "eval" and "evaluation" encounter a structured proof
wenzelm@30845
  2196
state with !!/==>, only the conclusion is evaluated to True (if
wenzelm@30845
  2197
possible), avoiding strange error messages.
wenzelm@30845
  2198
wenzelm@30845
  2199
* Method "sizechange" automates termination proofs using (a
wenzelm@30845
  2200
modification of) the size-change principle.  Requires SAT solver.  See
wenzelm@30845
  2201
src/HOL/ex/Termination.thy for examples.
wenzelm@30845
  2202
wenzelm@30845
  2203
* Simplifier: simproc for let expressions now unfolds if bound
wenzelm@30845
  2204
variable occurs at most once in let expression body.  INCOMPATIBILITY.
wenzelm@30845
  2205
wenzelm@30845
  2206
* Method "arith": Linear arithmetic now ignores all inequalities when
wenzelm@30845
  2207
fast_arith_neq_limit is exceeded, instead of giving up entirely.
wenzelm@30845
  2208
wenzelm@30845
  2209
* New attribute "arith" for facts that should always be used
wenzelm@30845
  2210
automatically by arithmetic. It is intended to be used locally in
wenzelm@30845
  2211
proofs, e.g.
wenzelm@30845
  2212
wenzelm@30845
  2213
  assumes [arith]: "x > 0"
wenzelm@30845
  2214
nipkow@30706
  2215
Global usage is discouraged because of possible performance impact.
nipkow@30706
  2216
wenzelm@30845
  2217
* New classes "top" and "bot" with corresponding operations "top" and
wenzelm@30845
  2218
"bot" in theory Orderings; instantiation of class "complete_lattice"
wenzelm@30845
  2219
requires instantiation of classes "top" and "bot".  INCOMPATIBILITY.
wenzelm@30845
  2220
wenzelm@30845
  2221
* Changed definition lemma "less_fun_def" in order to provide an
wenzelm@30845
  2222
instance for preorders on functions; use lemma "less_le" instead.
wenzelm@30845
  2223
INCOMPATIBILITY.
wenzelm@30845
  2224
wenzelm@30845
  2225
* Theory Orderings: class "wellorder" moved here, with explicit
wenzelm@30845
  2226
induction rule "less_induct" as assumption.  For instantiation of
wenzelm@30845
  2227
"wellorder" by means of predicate "wf", use rule wf_wellorderI.
wenzelm@30845
  2228
INCOMPATIBILITY.
wenzelm@30845
  2229
wenzelm@30845
  2230
* Theory Orderings: added class "preorder" as superclass of "order".
wenzelm@27793
  2231
INCOMPATIBILITY: Instantiation proofs for order, linorder
wenzelm@27793
  2232
etc. slightly changed.  Some theorems named order_class.* now named
wenzelm@27793
  2233
preorder_class.*.
wenzelm@27793
  2234
wenzelm@30845
  2235
* Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
wenzelm@30845
  2236
"diag" to "Id_on".
wenzelm@30845
  2237
wenzelm@30845
  2238
* Theory Finite_Set: added a new fold combinator of type
wenzelm@30845
  2239
nipkow@28855
  2240
  ('a => 'b => 'b) => 'b => 'a set => 'b
wenzelm@30845
  2241
wenzelm@30845
  2242
Occasionally this is more convenient than the old fold combinator
wenzelm@30845
  2243
which is now defined in terms of the new one and renamed to
wenzelm@30845
  2244
fold_image.
wenzelm@30845
  2245
wenzelm@30845
  2246
* Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
wenzelm@30845
  2247
and "ring_simps" have been replaced by "algebra_simps" (which can be
wenzelm@30845
  2248
extended with further lemmas!).  At the moment both still exist but
wenzelm@30845
  2249
the former will disappear at some point.
wenzelm@30845
  2250
wenzelm@30845
  2251
* Theory Power: Lemma power_Suc is now declared as a simp rule in
wenzelm@30845
  2252
class recpower.  Type-specific simp rules for various recpower types
wenzelm@30845
  2253
have been removed.  INCOMPATIBILITY, rename old lemmas as follows:
huffman@30273
  2254
huffman@30273
  2255
rat_power_0    -> power_0
huffman@30273
  2256
rat_power_Suc  -> power_Suc
huffman@30273
  2257
realpow_0      -> power_0
huffman@30273
  2258
realpow_Suc    -> power_Suc
huffman@30273
  2259
complexpow_0   -> power_0
huffman@30273
  2260
complexpow_Suc -> power_Suc
huffman@30273
  2261
power_poly_0   -> power_0
huffman@30273
  2262
power_poly_Suc -> power_Suc
huffman@30273
  2263
wenzelm@30845
  2264
* Theories Ring_and_Field and Divides: Definition of "op dvd" has been
wenzelm@27793
  2265
moved to separate class dvd in Ring_and_Field; a couple of lemmas on
wenzelm@27793
  2266
dvd has been generalized to class comm_semiring_1.  Likewise a bunch
wenzelm@27793
  2267
of lemmas from Divides has been generalized from nat to class
wenzelm@27793
  2268
semiring_div.  INCOMPATIBILITY.  This involves the following theorem
wenzelm@27793
  2269
renames resulting from duplicate elimination:
haftmann@27651
  2270
haftmann@27651
  2271
    dvd_def_mod ~>          dvd_eq_mod_eq_0
haftmann@27651
  2272
    zero_dvd_iff ~>         dvd_0_left_iff
haftmann@28559
  2273
    dvd_0 ~>                dvd_0_right
haftmann@27651
  2274
    DIVISION_BY_ZERO_DIV ~> div_by_0
haftmann@27651
  2275
    DIVISION_BY_ZERO_MOD ~> mod_by_0
haftmann@27651
  2276
    mult_div ~>             div_mult_self2_is_id
haftmann@27651
  2277
    mult_mod ~>             mod_mult_self2_is_0
haftmann@27651
  2278
wenzelm@30845
  2279
* Theory IntDiv: removed many lemmas that are instances of class-based
wenzelm@30845
  2280
generalizations (from Divides and Ring_and_Field).  INCOMPATIBILITY,
wenzelm@30845
  2281
rename old lemmas as follows:
nipkow@30044
  2282
nipkow@30044
  2283
dvd_diff               -> nat_dvd_diff
nipkow@30044
  2284
dvd_zminus_iff         -> dvd_minus_iff
nipkow@30224
  2285
mod_add1_eq            -> mod_add_eq
nipkow@30224
  2286
mod_mult1_eq           -> mod_mult_right_eq
nipkow@30224
  2287
mod_mult1_eq'          -> mod_mult_left_eq
nipkow@30224
  2288
mod_mult_distrib_mod   -> mod_mult_eq
nipkow@30044
  2289
nat_mod_add_left_eq    -> mod_add_left_eq
nipkow@30044
  2290
nat_mod_add_right_eq   -> mod_add_right_eq
nipkow@30044
  2291
nat_mod_div_trivial    -> mod_div_trivial
nipkow@30044
  2292
nat_mod_mod_trivial    -> mod_mod_trivial
nipkow@30044
  2293
zdiv_zadd_self1        -> div_add_self1
nipkow@30044
  2294
zdiv_zadd_self2        -> div_add_self2
nipkow@30181
  2295
zdiv_zmult_self1       -> div_mult_self2_is_id
nipkow@30044
  2296
zdiv_zmult_self2       -> div_mult_self1_is_id
nipkow@30044
  2297
zdvd_triv_left         -> dvd_triv_left
nipkow@30044
  2298
zdvd_triv_right        -> dvd_triv_right
nipkow@30044
  2299
zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
nipkow@30085
  2300
zmod_eq0_zdvd_iff      -> dvd_eq_mod_eq_0[symmetric]
nipkow@30044
  2301
zmod_zadd_left_eq      -> mod_add_left_eq
nipkow@30044
  2302
zmod_zadd_right_eq     -> mod_add_right_eq
nipkow@30044
  2303
zmod_zadd_self1        -> mod_add_self1
nipkow@30044
  2304
zmod_zadd_self2        -> mod_add_self2
nipkow@30224
  2305
zmod_zadd1_eq          -> mod_add_eq
nipkow@30044
  2306
zmod_zdiff1_eq         -> mod_diff_eq
nipkow@30044
  2307
zmod_zdvd_zmod         -> mod_mod_cancel
nipkow@30044
  2308
zmod_zmod_cancel       -> mod_mod_cancel
nipkow@30044
  2309
zmod_zmult_self1       -> mod_mult_self2_is_0
nipkow@30044
  2310
zmod_zmult_self2       -> mod_mult_self1_is_0
nipkow@30044
  2311
zmod_1                 -> mod_by_1
nipkow@30044
  2312
zdiv_1                 -> div_by_1
nipkow@30044
  2313
zdvd_abs1              -> abs_dvd_iff
nipkow@30044
  2314
zdvd_abs2              -> dvd_abs_iff
nipkow@30044
  2315
zdvd_refl              -> dvd_refl
nipkow@30044
  2316
zdvd_trans             -> dvd_trans
nipkow@30044
  2317
zdvd_zadd              -> dvd_add
nipkow@30044
  2318
zdvd_zdiff             -> dvd_diff
nipkow@30044
  2319
zdvd_zminus_iff        -> dvd_minus_iff
nipkow@30044
  2320
zdvd_zminus2_iff       -> minus_dvd_iff
nipkow@30044
  2321
zdvd_zmultD            -> dvd_mult_right
nipkow@30044
  2322
zdvd_zmultD2           -> dvd_mult_left
nipkow@30044
  2323
zdvd_zmult_mono        -> mult_dvd_mono
nipkow@30044
  2324
zdvd_0_right           -> dvd_0_right
nipkow@30044
  2325
zdvd_0_left            -> dvd_0_left_iff
nipkow@30044
  2326
zdvd_1_left            -> one_dvd
nipkow@30044
  2327
zminus_dvd_iff         -> minus_dvd_iff
nipkow@30044
  2328
wenzelm@30845
  2329
* Theory Rational: 'Fract k 0' now equals '0'.  INCOMPATIBILITY.
wenzelm@30845
  2330
wenzelm@30845
  2331
* The real numbers offer decimal input syntax: 12.34 is translated
wenzelm@30845
  2332
into 1234/10^2. This translation is not reversed upon output.
wenzelm@30845
  2333
wenzelm@30845
  2334
* Theory Library/Polynomial defines an abstract type 'a poly of
wenzelm@30845
  2335
univariate polynomials with coefficients of type 'a.  In addition to
wenzelm@30845
  2336
the standard ring operations, it also supports div and mod.  Code
wenzelm@30845
  2337
generation is also supported, using list-style constructors.
wenzelm@30845
  2338
wenzelm@30845
  2339
* Theory Library/Inner_Product defines a class of real_inner for real
wenzelm@30845
  2340
inner product spaces, with an overloaded operation inner :: 'a => 'a
wenzelm@30845
  2341
=> real.  Class real_inner is a subclass of real_normed_vector from
wenzelm@30845
  2342
theory RealVector.
wenzelm@30845
  2343
wenzelm@30845
  2344
* Theory Library/Product_Vector provides instances for the product
wenzelm@30845
  2345
type 'a * 'b of several classes from RealVector and Inner_Product.
wenzelm@30845
  2346
Definitions of addition, subtraction, scalar multiplication, norms,
wenzelm@30845
  2347
and inner products are included.
wenzelm@30845
  2348
wenzelm@30845
  2349
* Theory Library/Bit defines the field "bit" of integers modulo 2.  In
wenzelm@30845
  2350
addition to the field operations, numerals and case syntax are also
wenzelm@30845
  2351
supported.
wenzelm@30845
  2352
wenzelm@30845
  2353
* Theory Library/Diagonalize provides constructive version of Cantor's
wenzelm@30845
  2354
first diagonalization argument.
wenzelm@30845
  2355
wenzelm@30845
  2356
* Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
wenzelm@27599
  2357
zlcm (for int); carried together from various gcd/lcm developements in
wenzelm@30845
  2358
the HOL Distribution.  Constants zgcd and zlcm replace former igcd and
wenzelm@30845
  2359
ilcm; corresponding theorems renamed accordingly.  INCOMPATIBILITY,
wenzelm@30845
  2360
may recover tupled syntax as follows:
haftmann@27556
  2361
haftmann@27556
  2362
    hide (open) const gcd
haftmann@27556
  2363
    abbreviation gcd where
haftmann@27556
  2364
      "gcd == (%(a, b). GCD.gcd a b)"
haftmann@27556
  2365
    notation (output)
haftmann@27556
  2366
      GCD.gcd ("gcd '(_, _')")
haftmann@27556
  2367
wenzelm@30845
  2368
The same works for lcm, zgcd, zlcm.
wenzelm@30845
  2369
wenzelm@30845
  2370
* Theory Library/Nat_Infinity: added addition, numeral syntax and more
wenzelm@30845
  2371
instantiations for algebraic structures.  Removed some duplicate
wenzelm@30845
  2372
theorems.  Changes in simp rules.  INCOMPATIBILITY.
wenzelm@30845
  2373
wenzelm@30845
  2374
* ML antiquotation @{code} takes a constant as argument and generates
haftmann@27651
  2375
corresponding code in background and inserts name of the corresponding
haftmann@27651
  2376
resulting ML value/function/datatype constructor binding in place.
haftmann@27651
  2377
All occurrences of @{code} with a single ML block are generated
haftmann@27651
  2378
simultaneously.  Provides a generic and safe interface for
wenzelm@30845
  2379
instrumentalizing code generation.  See
wenzelm@30845
  2380
src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
wenzelm@30845
  2381
In future you ought to refrain from ad-hoc compiling generated SML
wenzelm@30845
  2382
code on the ML toplevel.  Note that (for technical reasons) @{code}
wenzelm@30845
  2383
cannot refer to constants for which user-defined serializations are
wenzelm@30845
  2384
set.  Refer to the corresponding ML counterpart directly in that
wenzelm@30845
  2385
cases.
wenzelm@27122
  2386
wenzelm@27122
  2387
* Command 'rep_datatype': instead of theorem names the command now
wenzelm@27122
  2388
takes a list of terms denoting the constructors of the type to be
wenzelm@27122
  2389
represented as datatype.  The characteristic theorems have to be
wenzelm@27122
  2390
proven.  INCOMPATIBILITY.  Also observe that the following theorems
wenzelm@27122
  2391
have disappeared in favour of existing ones:
wenzelm@27122
  2392
haftmann@27104
  2393
    unit_induct                 ~> unit.induct
haftmann@27104
  2394
    prod_induct                 ~> prod.induct
haftmann@27104
  2395
    sum_induct                  ~> sum.induct
haftmann@27104
  2396
    Suc_Suc_eq                  ~> nat.inject
haftmann@27104
  2397
    Suc_not_Zero Zero_not_Suc   ~> nat.distinct
haftmann@27104
  2398
haftmann@27104
  2399
ballarin@27696
  2400
*** HOL-Algebra ***
ballarin@27696
  2401
ballarin@27713
  2402
* New locales for orders and lattices where the equivalence relation
wenzelm@30106
  2403
is not restricted to equality.  INCOMPATIBILITY: all order and lattice
wenzelm@30106
  2404
locales use a record structure with field eq for the equivalence.
ballarin@27713
  2405
ballarin@27713
  2406
* New theory of factorial domains.
ballarin@27713
  2407
wenzelm@30845
  2408
* Units_l_inv and Units_r_inv are now simp rules by default.
ballarin@27696
  2409
INCOMPATIBILITY.  Simplifier proof that require deletion of l_inv
ballarin@27696
  2410
and/or r_inv will now also require deletion of these lemmas.
ballarin@27696
  2411
wenzelm@30845
  2412
* Renamed the following theorems, INCOMPATIBILITY:
wenzelm@30845
  2413
ballarin@27696
  2414
UpperD ~> Upper_memD
ballarin@27696
  2415
LowerD ~> Lower_memD
ballarin@27696
  2416
least_carrier ~> least_closed
ballarin@27696
  2417
greatest_carrier ~> greatest_closed
ballarin@27696
  2418
greatest_Lower_above ~> greatest_Lower_below
ballarin@27717
  2419
one_zero ~> carrier_one_zero
ballarin@27717
  2420
one_not_zero ~> carrier_one_not_zero  (collision with assumption)
ballarin@27696
  2421
wenzelm@27793
  2422
wenzelm@30849
  2423
*** HOL-Nominal ***
wenzelm@30849
  2424
wenzelm@30855
  2425
* Nominal datatypes can now contain type-variables.
wenzelm@30855
  2426
wenzelm@30855
  2427
* Commands 'nominal_inductive' and 'equivariance' work with local
wenzelm@30855
  2428
theory targets.
wenzelm@30855
  2429
wenzelm@30855
  2430
* Nominal primrec can now works with local theory targets and its
wenzelm@30855
  2431
specification syntax now conforms to the general format as seen in
wenzelm@30855
  2432
'inductive' etc.
wenzelm@30855
  2433
wenzelm@30855
  2434
* Method "perm_simp" honours the standard simplifier attributes
wenzelm@30855
  2435
(no_asm), (no_asm_use) etc.
wenzelm@30855
  2436
wenzelm@30855
  2437
* The new predicate #* is defined like freshness, except that on the
wenzelm@30855
  2438
left hand side can be a set or list of atoms.
wenzelm@30855
  2439
wenzelm@30855
  2440
* Experimental command 'nominal_inductive2' derives strong induction
wenzelm@30855
  2441
principles for inductive definitions.  In contrast to
wenzelm@30855
  2442
'nominal_inductive', which can only deal with a fixed number of
wenzelm@30855
  2443
binders, it can deal with arbitrary expressions standing for sets of
wenzelm@30855
  2444
atoms to be avoided.  The only inductive definition we have at the
wenzelm@30855
  2445
moment that needs this generalisation is the typing rule for Lets in
wenzelm@30855
  2446
the algorithm W:
wenzelm@30855
  2447
wenzelm@30855
  2448
 Gamma |- t1 : T1   (x,close Gamma T1)::Gamma |- t2 : T2   x#Gamma
wenzelm@30855
  2449
 -----------------------------------------------------------------
wenzelm@30855
  2450
         Gamma |- Let x be t1 in t2 : T2
wenzelm@30855
  2451
wenzelm@30855
  2452
In this rule one wants to avoid all the binders that are introduced by
wenzelm@30855
  2453
"close Gamma T1".  We are looking for other examples where this
wenzelm@30855
  2454
feature might be useful.  Please let us know.
wenzelm@30849
  2455
wenzelm@30849
  2456
huffman@30176
  2457
*** HOLCF ***
huffman@30176
  2458
huffman@30176
  2459
* Reimplemented the simplification procedure for proving continuity
huffman@30176
  2460
subgoals.  The new simproc is extensible; users can declare additional
huffman@30176
  2461
continuity introduction rules with the attribute [cont2cont].
huffman@30176
  2462
huffman@30176
  2463
* The continuity simproc now uses a different introduction rule for
huffman@30176
  2464
solving continuity subgoals on terms with lambda abstractions.  In
huffman@30176
  2465
some rare cases the new simproc may fail to solve subgoals that the
huffman@30176
  2466
old one could solve, and "simp add: cont2cont_LAM" may be necessary.
huffman@30176
  2467
Potential INCOMPATIBILITY.
huffman@30176
  2468
wenzelm@30847
  2469
* Command 'fixrec': specification syntax now conforms to the general
wenzelm@30855
  2470
format as seen in 'inductive' etc.  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@30855
  2471
examples.  INCOMPATIBILITY.
wenzelm@30845
  2472
wenzelm@30845
  2473
wenzelm@30845
  2474
*** ZF ***
wenzelm@30845
  2475
wenzelm@30845
  2476
* Proof of Zorn's Lemma for partial orders.
huffman@30176
  2477
huffman@30176
  2478
wenzelm@27246
  2479
*** ML ***
wenzelm@28088
  2480
wenzelm@30845
  2481
* Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
wenzelm@30845
  2482
Poly/ML 5.2.1 or later.  Important note: the TimeLimit facility
wenzelm@30845
  2483
depends on multithreading, so timouts will not work before Poly/ML
wenzelm@30845
  2484
5.2.1!
wenzelm@30845
  2485
wenzelm@29161
  2486
* High-level support for concurrent ML programming, see
wenzelm@29161
  2487
src/Pure/Cuncurrent.  The data-oriented model of "future values" is
wenzelm@29161
  2488
particularly convenient to organize independent functional
wenzelm@29161
  2489
computations.  The concept of "synchronized variables" provides a
wenzelm@29161
  2490
higher-order interface for components with shared state, avoiding the
wenzelm@30845
  2491
delicate details of mutexes and condition variables.  (Requires
wenzelm@30845
  2492
Poly/ML 5.2.1 or later.)
wenzelm@30845
  2493
wenzelm@30845
  2494
* ML bindings produced via Isar commands are stored within the Isar
wenzelm@30845
  2495
context (theory or proof).  Consequently, commands like 'use' and 'ML'
wenzelm@30845
  2496
become thread-safe and work with undo as expected (concerning
wenzelm@30845
  2497
top-level bindings, not side-effects on global references).
wenzelm@30845
  2498
INCOMPATIBILITY, need to provide proper Isar context when invoking the
wenzelm@30845
  2499
compiler at runtime; really global bindings need to be given outside a
wenzelm@30845
  2500
theory.  (Requires Poly/ML 5.2 or later.)
wenzelm@30845
  2501
wenzelm@30845
  2502
* Command 'ML_prf' is analogous to 'ML' but works within a proof
wenzelm@30845
  2503
context.  Top-level ML bindings are stored within the proof context in
wenzelm@30845
  2504
a purely sequential fashion, disregarding the nested proof structure.
wenzelm@30845
  2505
ML bindings introduced by 'ML_prf' are discarded at the end of the
wenzelm@30845
  2506
proof.  (Requires Poly/ML 5.2 or later.)
wenzelm@29161
  2507
wenzelm@30530
  2508
* Simplified ML attribute and method setup, cf. functions Attrib.setup
wenzelm@30845
  2509
and Method.setup, as well as Isar commands 'attribute_setup' and
wenzelm@30547
  2510
'method_setup'.  INCOMPATIBILITY for 'method_setup', need to simplify
wenzelm@30547
  2511
existing code accordingly, or use plain 'setup' together with old
wenzelm@30547
  2512
Method.add_method.
wenzelm@30530
  2513
wenzelm@28294
  2514
* Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
wenzelm@28294
  2515
to 'a -> thm, while results are always tagged with an authentic oracle
wenzelm@28294
  2516
name.  The Isar command 'oracle' is now polymorphic, no argument type
wenzelm@28294
  2517
is specified.  INCOMPATIBILITY, need to simplify existing oracle code
wenzelm@28294
  2518
accordingly.  Note that extra performance may be gained by producing
wenzelm@28294
  2519
the cterm carefully, avoiding slow Thm.cterm_of.
wenzelm@28294
  2520
wenzelm@30845
  2521
* Simplified interface for defining document antiquotations via
wenzelm@30845
  2522
ThyOutput.antiquotation, ThyOutput.output, and optionally
wenzelm@30845
  2523
ThyOutput.maybe_pretty_source.  INCOMPATIBILITY, need to simplify user
wenzelm@30845
  2524
antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
wenzelm@30845
  2525
examples.
wenzelm@28099
  2526
wenzelm@30395
  2527
* More systematic treatment of long names, abstract name bindings, and
wenzelm@30395
  2528
name space operations.  Basic operations on qualified names have been
wenzelm@30399
  2529
move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
wenzelm@30395
  2530
Long_Name.append.  Old type bstring has been mostly replaced by
wenzelm@30395
  2531
abstract type binding (see structure Binding), which supports precise
wenzelm@30845
  2532
qualification by packages and local theory targets, as well as proper
wenzelm@30845
  2533
tracking of source positions.  INCOMPATIBILITY, need to wrap old
wenzelm@30845
  2534
bstring values into Binding.name, or better pass through abstract
wenzelm@30399
  2535
bindings everywhere.  See further src/Pure/General/long_name.ML,
wenzelm@30395
  2536
src/Pure/General/binding.ML and src/Pure/General/name_space.ML
wenzelm@30395
  2537
wenzelm@28089
  2538
* Result facts (from PureThy.note_thms, ProofContext.note_thms,
wenzelm@28089
  2539
LocalTheory.note etc.) now refer to the *full* internal name, not the
wenzelm@28089
  2540
bstring as before.  INCOMPATIBILITY, not detected by ML type-checking!
wenzelm@28089
  2541
wenzelm@27287
  2542
* Disposed old type and term read functions (Sign.read_def_typ,
wenzelm@27287
  2543
Sign.read_typ, Sign.read_def_terms, Sign.read_term,
wenzelm@27287
  2544
Thm.read_def_cterms, Thm.read_cterm etc.).  INCOMPATIBILITY, should
wenzelm@27287
  2545
use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
wenzelm@27269
  2546
Syntax.read_term_global etc.; see also OldGoals.read_term as last
wenzelm@27269
  2547
resort for legacy applications.
wenzelm@27269
  2548
wenzelm@30609
  2549
* Disposed old declarations, tactics, tactic combinators that refer to
wenzelm@30609
  2550
the simpset or claset of an implicit theory (such as Addsimps,
wenzelm@30609
  2551
Simp_tac, SIMPSET).  INCOMPATIBILITY, should use @{simpset} etc. in
wenzelm@30609
  2552
embedded ML text, or local_simpset_of with a proper context passed as
wenzelm@30609
  2553
explicit runtime argument.
wenzelm@30609
  2554
wenzelm@30845
  2555
* Rules and tactics that read instantiations (read_instantiate,
wenzelm@30845
  2556
res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
wenzelm@30845
  2557
context, which is required for parsing and type-checking.  Moreover,
wenzelm@30845
  2558
the variables are specified as plain indexnames, not string encodings
wenzelm@30845
  2559
thereof.  INCOMPATIBILITY.
wenzelm@30845
  2560
wenzelm@30845
  2561
* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm@30845
  2562
transactions.  E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
wenzelm@30845
  2563
for theorem dependency output of transactions resulting in a new
wenzelm@30845
  2564
theory state.
wenzelm@30845
  2565
wenzelm@30845
  2566
* ML antiquotations: block-structured compilation context indicated by
wenzelm@27391
  2567
\<lbrace> ... \<rbrace>; additional antiquotation forms:
wenzelm@27391
  2568
wenzelm@30845
  2569
  @{binding name}                         - basic name binding
wenzelm@27519
  2570
  @{let ?pat = term}                      - term abbreviation (HO matching)
wenzelm@27519
  2571
  @{note name = fact}                     - fact abbreviation
wenzelm@27519
  2572
  @{thm fact}                             - singleton fact (with attributes)
wenzelm@27519
  2573
  @{thms fact}                            - general fact (with attributes)
wenzelm@27519
  2574
  @{lemma prop by method}                 - singleton goal
wenzelm@27519
  2575
  @{lemma prop by meth1 meth2}            - singleton goal
wenzelm@27519
  2576
  @{lemma prop1 ... propN by method}      - general goal
wenzelm@27519
  2577
  @{lemma prop1 ... propN by meth1 meth2} - general goal
wenzelm@27519
  2578
  @{lemma (open) ...}                     - open derivation
wenzelm@27380
  2579
wenzelm@27246
  2580
wenzelm@27979
  2581
*** System ***
wenzelm@27979
  2582
wenzelm@28248
  2583
* The Isabelle "emacs" tool provides a specific interface to invoke
wenzelm@28248
  2584
Proof General / Emacs, with more explicit failure if that is not
wenzelm@28248
  2585
installed (the old isabelle-interface script silently falls back on
wenzelm@28248
  2586
isabelle-process).  The PROOFGENERAL_HOME setting determines the
wenzelm@28248
  2587
installation location of the Proof General distribution.
wenzelm@28248
  2588
wenzelm@27979
  2589
* Isabelle/lib/classes/Pure.jar provides basic support to integrate
wenzelm@27979
  2590
the Isabelle process into a JVM/Scala application.  See
wenzelm@27979
  2591
Isabelle/lib/jedit/plugin for a minimal example.  (The obsolete Java
wenzelm@27979
  2592
process wrapper has been discontinued.)
wenzelm@27979
  2593
wenzelm@30845
  2594
* Added homegrown Isabelle font with unicode layout, see lib/fonts.
wenzelm@30845
  2595
wenzelm@30845
  2596
* Various status messages (with exact source position information) are
wenzelm@27979
  2597
emitted, if proper markup print mode is enabled.  This allows
wenzelm@27979
  2598
user-interface components to provide detailed feedback on internal
wenzelm@27979
  2599
prover operations.
wenzelm@27979
  2600
wenzelm@27979
  2601
wenzelm@27143
  2602
wenzelm@27008
  2603
New in Isabelle2008 (June 2008)
wenzelm@27008
  2604
-------------------------------
wenzelm@25464
  2605
wenzelm@25522
  2606
*** General ***
wenzelm@25522
  2607
wenzelm@27061
  2608
* The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
wenzelm@27061
  2609
and updated, with formally checked references as hyperlinks.
wenzelm@27061
  2610
wenzelm@25994
  2611
* Theory loader: use_thy (and similar operations) no longer set the
wenzelm@25994
  2612
implicit ML context, which was occasionally hard to predict and in
wenzelm@25994
  2613
conflict with concurrency.  INCOMPATIBILITY, use ML within Isar which
wenzelm@25994
  2614
provides a proper context already.
wenzelm@25994
  2615
wenzelm@26323
  2616
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@26323
  2617
file are no longer supported.  INCOMPATIBILITY, regular 'uses' and
wenzelm@26323
  2618
'use' within a theory file will do the job.
wenzelm@26323
  2619
wenzelm@26650
  2620
* Name space merge now observes canonical order, i.e. the second space
wenzelm@26650
  2621
is inserted into the first one, while existing entries in the first
wenzelm@26659
  2622
space take precedence.  INCOMPATIBILITY in rare situations, may try to
wenzelm@26650
  2623
swap theory imports.
wenzelm@26650
  2624
wenzelm@27067
  2625
* Syntax: symbol \<chi> is now considered a letter.  Potential
wenzelm@27067
  2626
INCOMPATIBILITY in identifier syntax etc.
wenzelm@27067
  2627
wenzelm@27067
  2628
* Outer syntax: string tokens no longer admit escaped white space,
wenzelm@27067
  2629
which was an accidental (undocumented) feature.  INCOMPATIBILITY, use
wenzelm@27067
  2630
white space without escapes.
wenzelm@27067
  2631
wenzelm@27067
  2632
* Outer syntax: string tokens may contain arbitrary character codes
wenzelm@27067
  2633
specified via 3 decimal digits (as in SML).  E.g. "foo\095bar" for
wenzelm@27067
  2634
"foo_bar".
wenzelm@27067
  2635
wenzelm@25522
  2636
haftmann@25502
  2637
*** Pure ***
haftmann@25502
  2638
wenzelm@26718
  2639
* Context-dependent token translations.  Default setup reverts locally
wenzelm@26718
  2640
fixed variables, and adds hilite markup for undeclared frees.
wenzelm@26718
  2641
berghofe@26681
  2642
* Unused theorems can be found using the new command 'unused_thms'.
berghofe@26681
  2643
There are three ways of invoking it:
berghofe@26681
  2644
berghofe@26681
  2645
(1) unused_thms
berghofe@26681
  2646
     Only finds unused theorems in the current theory.
berghofe@26681
  2647
berghofe@26681
  2648
(2) unused_thms thy_1 ... thy_n -
berghofe@26681
  2649
     Finds unused theorems in the current theory and all of its ancestors,
berghofe@26681
  2650
     excluding the theories thy_1 ... thy_n and all of their ancestors.
berghofe@26681
  2651
berghofe@26681
  2652
(3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
berghofe@26681
  2653
     Finds unused theorems in the theories thy'_1 ... thy'_m and all of
berghofe@26681
  2654
     their ancestors, excluding the theories thy_1 ... thy_n and all of
berghofe@26681
  2655
     their ancestors.
berghofe@26681
  2656
wenzelm@26718
  2657
In order to increase the readability of the list produced by
wenzelm@26718
  2658
unused_thms, theorems that have been created by a particular instance
wenzelm@26874
  2659
of a theory command such as 'inductive' or 'function' are considered
wenzelm@26874
  2660
to belong to the same "group", meaning that if at least one theorem in
wenzelm@26718
  2661
this group is used, the other theorems in the same group are no longer
wenzelm@26718
  2662
reported as unused.  Moreover, if all theorems in the group are
wenzelm@26718
  2663
unused, only one theorem in the group is displayed.
wenzelm@26718
  2664
wenzelm@26718
  2665
Note that proof objects have to be switched on in order for
wenzelm@26718
  2666
unused_thms to work properly (i.e. !proofs must be >= 1, which is
wenzelm@26874
  2667
usually the case when using Proof General with the default settings).
berghofe@26681
  2668