1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 New in Isabelle2011 (January 2011)
10 ----------------------------------
14 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
15 src/Tools/jEdit). A bundled component provides "isabelle jedit" as
16 executable Isabelle tool. Note that this also serves as IDE for
17 Isabelle/ML, with useful tooltips and hyperlinks produced from its
20 * Significantly improved Isabelle/Isar implementation manual.
22 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
23 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
24 while the default heap location within that directory lacks that extra
25 suffix. This isolates multiple Isabelle installations from each
26 other, avoiding problems with old settings in new versions.
27 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
29 * Source files are always encoded as UTF-8, instead of old-fashioned
30 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
31 the following package declarations:
33 \usepackage[utf8]{inputenc}
36 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
37 a Unicode character is treated as a single symbol, not a sequence of
38 non-ASCII bytes as before. Since Isabelle/ML string literals may
39 contain symbols without further backslash escapes, Unicode can now be
40 used here as well. Recall that Symbol.explode in ML provides a
41 consistent view on symbols, while raw explode (or String.explode)
42 merely give a byte-oriented representation.
44 * Theory loader: source files are primarily located via the master
45 directory of each theory node (where the .thy file itself resides).
46 The global load path is still partially available as legacy feature.
47 Minor INCOMPATIBILITY due to subtle change in file lookup: use
48 explicit paths, relatively to the theory.
50 * Special treatment of ML file names has been discontinued.
51 Historically, optional extensions .ML or .sml were added on demand --
52 at the cost of clarity of file dependencies. Recall that Isabelle/ML
53 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
55 * Various options that affect pretty printing etc. are now properly
56 handled within the context via configuration options, instead of
57 unsynchronized references or print modes. There are both ML Config.T
58 entities and Isar declaration attributes to access these.
60 ML (Config.T) Isar (attribute)
62 eta_contract eta_contract
63 show_brackets show_brackets
66 show_question_marks show_question_marks
67 show_consts show_consts
68 show_abbrevs show_abbrevs
70 Syntax.ast_trace syntax_ast_trace
71 Syntax.ast_stat syntax_ast_stat
72 Syntax.ambiguity_level syntax_ambiguity_level
74 Goal_Display.goals_limit goals_limit
75 Goal_Display.show_main_goal show_main_goal
77 Method.rule_trace rule_trace
79 Thy_Output.display thy_output_display
80 Thy_Output.quotes thy_output_quotes
81 Thy_Output.indent thy_output_indent
82 Thy_Output.source thy_output_source
83 Thy_Output.break thy_output_break
85 Note that corresponding "..._default" references in ML may only be
86 changed globally at the ROOT session setup, but *not* within a theory.
87 The option "show_abbrevs" supersedes the former print mode
88 "no_abbrevs" with inverted meaning.
90 * More systematic naming of some configuration options.
93 trace_simp ~> simp_trace
94 debug_simp ~> simp_debug
96 * Support for real valued configuration options, using simplistic
97 floating-point notation that coincides with the inner syntax for
100 * Support for real valued preferences (with approximative PGIP type):
101 front-ends need to accept "pgint" values in float notation.
104 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
107 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
112 * Command 'type_synonym' (with single argument) replaces somewhat
113 outdated 'types', which is still available as legacy feature for some
116 * Command 'nonterminal' (with 'and' separated list of arguments)
117 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
119 * Command 'notepad' replaces former 'example_proof' for
120 experimentation in Isar without any result. INCOMPATIBILITY.
122 * Locale interpretation commands 'interpret' and 'sublocale' accept
123 lists of equations to map definitions in a locale to appropriate
124 entities in the context of the interpretation. The 'interpretation'
125 command already provided this functionality.
127 * Diagnostic command 'print_dependencies' prints the locale instances
128 that would be activated if the specified expression was interpreted in
129 the current context. Variant "print_dependencies!" assumes a context
130 without interpretations.
132 * Diagnostic command 'print_interps' prints interpretations in proofs
133 in addition to interpretations in theories.
135 * Discontinued obsolete 'global' and 'local' commands to manipulate
136 the theory name space. Rare INCOMPATIBILITY. The ML functions
137 Sign.root_path and Sign.local_path may be applied directly where this
138 feature is still required for historical reasons.
140 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
141 'definition' instead.
143 * The "prems" fact, which refers to the accidental collection of
144 foundational premises in the context, is now explicitly marked as
145 legacy feature and will be discontinued soon. Consider using "assms"
146 of the head statement or reference facts by explicit names.
148 * Document antiquotations @{class} and @{type} print classes and type
151 * Document antiquotation @{file} checks file/directory entries within
152 the local file system.
157 * Coercive subtyping: functions can be declared as coercions and type
158 inference will add them as necessary upon input of a term. Theory
159 Complex_Main declares real :: nat => real and real :: int => real as
160 coercions. A coercion function f is declared like this:
162 declare [[coercion f]]
164 To lift coercions through type constructors (e.g. from nat => real to
165 nat list => real list), map functions can be declared, e.g.
167 declare [[coercion_map map]]
169 Currently coercion inference is activated only in theories including
170 real numbers, i.e. descendants of Complex_Main. This is controlled by
171 the configuration option "coercion_enabled", e.g. it can be enabled in
172 other theories like this:
174 declare [[coercion_enabled]]
176 * Command 'partial_function' provides basic support for recursive
177 function definitions over complete partial orders. Concrete instances
178 are provided for i) the option type, ii) tail recursion on arbitrary
179 types, and iii) the heap monad of Imperative_HOL. See
180 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
183 * Function package: f.psimps rules are no longer implicitly declared
184 as [simp]. INCOMPATIBILITY.
186 * Datatype package: theorems generated for executable equality (class
187 "eq") carry proper names and are treated as default code equations.
189 * Inductive package: now offers command 'inductive_simps' to
190 automatically derive instantiated and simplified equations for
191 inductive predicates, similar to 'inductive_cases'.
193 * Command 'enriched_type' allows to register properties of the
194 functorial structure of types.
196 * Improved infrastructure for term evaluation using code generator
197 techniques, in particular static evaluation conversions.
199 * Code generator: Scala (2.8 or higher) has been added to the target
202 * Code generator: globbing constant expressions "*" and "Theory.*"
203 have been replaced by the more idiomatic "_" and "Theory._".
206 * Code generator: export_code without explicit file declaration prints
207 to standard output. INCOMPATIBILITY.
209 * Code generator: do not print function definitions for case
210 combinators any longer.
212 * Code generator: simplification with rules determined with
213 src/Tools/Code/code_simp.ML and method "code_simp".
215 * Code generator for records: more idiomatic representation of record
216 types. Warning: records are not covered by ancient SML code
217 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
218 rep_datatype declaration helps to succeed then:
222 rep_datatype foo_ext ...
224 * Records: logical foundation type for records does not carry a
225 '_type' suffix any longer (obsolete due to authentic syntax).
228 * Quickcheck now by default uses exhaustive testing instead of random
229 testing. Random testing can be invoked by "quickcheck [random]",
230 exhaustive testing by "quickcheck [exhaustive]".
232 * Quickcheck instantiates polymorphic types with small finite
233 datatypes by default. This enables a simple execution mechanism to
234 handle quantifiers and function equality over the finite datatypes.
236 * Quickcheck random generator has been renamed from "code" to
237 "random". INCOMPATIBILITY.
239 * Quickcheck now has a configurable time limit which is set to 30
240 seconds by default. This can be changed by adding [timeout = n] to the
241 quickcheck command. The time limit for Auto Quickcheck is still set
244 * Quickcheck in locales considers interpretations of that locale for
245 counter example search.
248 - Added "smt" and "remote_smt" provers based on the "smt" proof
249 method. See the Sledgehammer manual for details ("isabelle doc
252 sledgehammer atp_info ~> sledgehammer running_provers
253 sledgehammer atp_kill ~> sledgehammer kill_provers
254 sledgehammer available_atps ~> sledgehammer available_provers
257 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
258 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
259 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
260 (and "ms" and "min" are no longer supported)
265 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
266 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
268 - Added support for partial quotient types.
269 - Added local versions of the "Nitpick.register_xxx" functions.
270 - Added "whack" option.
271 - Allow registration of quotient types as codatatypes.
272 - Improved "merge_type_vars" option to merge more types.
273 - Removed unsound "fast_descrs" option.
274 - Added custom symmetry breaking for datatypes, making it possible to reach
275 higher cardinalities.
276 - Prevent the expansion of too large definitions.
278 * Proof methods "metis" and "meson" now have configuration options
279 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
280 to diagnose these tools. E.g.
282 using [[metis_trace = true]]
284 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
285 manually as command 'solve_direct'.
287 * The default SMT solver Z3 must be enabled explicitly (due to
288 licensing issues) by setting the environment variable
289 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
290 commercial applications, the SMT solver CVC3 is provided as fall-back;
291 changing the SMT solver is done via the configuration option
294 * Remote SMT solvers need to be referred to by the "remote_" prefix,
295 i.e. "remote_cvc3" and "remote_z3".
297 * Added basic SMT support for datatypes, records, and typedefs using
298 the oracle mode (no proofs). Direct support of pairs has been dropped
299 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
300 support for a similar behavior). Minor INCOMPATIBILITY.
302 * Changed SMT configuration options:
304 z3_proofs ~> smt_oracle (with inverted meaning)
305 z3_trace_assms ~> smt_trace_used_facts
318 * Boogie output files (.b2i files) need to be declared in the theory
321 * Simplification procedure "list_to_set_comprehension" rewrites list
322 comprehensions applied to List.set to set comprehensions. Occasional
323 INCOMPATIBILITY, may be deactivated like this:
325 declare [[simproc del: list_to_set_comprehension]]
327 * Removed old version of primrec package. INCOMPATIBILITY.
329 * Removed simplifier congruence rule of "prod_case", as has for long
330 been the case with "split". INCOMPATIBILITY.
332 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
334 * Removed [split_format ... and ... and ...] version of
335 [split_format]. Potential INCOMPATIBILITY.
337 * Predicate "sorted" now defined inductively, with nice induction
338 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
340 * Constant "contents" renamed to "the_elem", to free the generic name
341 contents for other uses. INCOMPATIBILITY.
343 * Renamed class eq and constant eq (for code generation) to class
344 equal and constant equal, plus renaming of related facts and various
345 tuning. INCOMPATIBILITY.
347 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
349 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
352 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
353 avoid confusion with finite sets. INCOMPATIBILITY.
355 * Abandoned locales equiv, congruent and congruent2 for equivalence
356 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
359 * Some previously unqualified names have been qualified:
366 Trueprop ~> HOL.Trueprop
371 op --> ~> HOL.implies
383 Pair ~> Product_Type.Pair
384 fst ~> Product_Type.fst
385 snd ~> Product_Type.snd
386 curry ~> Product_Type.curry
388 Collect ~> Set.Collect
392 * More canonical naming convention for some fundamental definitions:
394 bot_bool_eq ~> bot_bool_def
395 top_bool_eq ~> top_bool_def
396 inf_bool_eq ~> inf_bool_def
397 sup_bool_eq ~> sup_bool_def
398 bot_fun_eq ~> bot_fun_def
399 top_fun_eq ~> top_fun_def
400 inf_fun_eq ~> inf_fun_def
401 sup_fun_eq ~> sup_fun_def
405 * More stylized fact names:
407 expand_fun_eq ~> fun_eq_iff
408 expand_set_eq ~> set_eq_iff
410 nat_number ~> eval_nat_numeral
414 * Refactoring of code-generation specific operations in theory List:
420 mem_iff ~> member_def
421 null_empty ~> null_def
423 INCOMPATIBILITY. Note that these were not supposed to be used
424 regularly unless for striking reasons; their main purpose was code
427 Various operations from the Haskell prelude are used for generating
430 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
431 "surj f" is now an abbreviation of "range f = UNIV". The theorems
432 bij_def and surj_def are unchanged. INCOMPATIBILITY.
434 * Abolished some non-alphabetic type names: "prod" and "sum" replace
435 "*" and "+" respectively. INCOMPATIBILITY.
437 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
438 "Sum_Type.Plus" instead.
440 * Constant "split" has been merged with constant "prod_case"; names of
441 ML functions, facts etc. involving split have been retained so far,
442 though. INCOMPATIBILITY.
444 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
445 instead. INCOMPATIBILITY.
447 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
450 * Former theory Library/Enum is now part of the HOL-Main image.
451 INCOMPATIBILITY: all constants of the Enum theory now have to be
452 referred to by its qualified name.
455 nlists ~> Enum.nlists
456 product ~> Enum.product
458 * Theory Library/Monad_Syntax provides do-syntax for monad types.
459 Syntax in Library/State_Monad has been changed to avoid ambiguities.
462 * Theory Library/SetsAndFunctions has been split into
463 Library/Function_Algebras and Library/Set_Algebras; canonical names
464 for instance definitions for functions; various improvements.
467 * Theory Library/Multiset provides stable quicksort implementation of
470 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
473 * Session Multivariate_Analysis: introduced a type class for euclidean
474 space. Most theorems are now stated in terms of euclidean spaces
475 instead of finite cartesian products.
478 real ^ 'n ~> 'a::real_vector
479 ~> 'a::euclidean_space
480 ~> 'a::ordered_euclidean_space
481 (depends on your needs)
485 \<chi> x. _ ~> \<chi>\<chi> x. _
488 Also note that the indices are now natural numbers and not from some
489 finite type. Finite cartesian products of euclidean spaces, products
490 of euclidean spaces the real and complex numbers are instantiated to
491 be euclidean_spaces. INCOMPATIBILITY.
493 * Session Probability: introduced pextreal as positive extended real
494 numbers. Use pextreal as value for measures. Introduce the
495 Radon-Nikodym derivative, product spaces and Fubini's theorem for
496 arbitrary sigma finite measures. Introduces Lebesgue measure based on
497 the integral in Multivariate Analysis. INCOMPATIBILITY.
499 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
502 * Session SPARK (with image HOL-SPARK) provides commands to load and
503 prove verification conditions generated by the SPARK Ada program
504 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
509 * Theorems for additive ring operations (locale abelian_monoid and
510 descendants) are generated by interpretation from their multiplicative
511 counterparts. Names (in particular theorem names) have the mandatory
512 qualifier 'add'. Previous theorem names are redeclared for
515 * Structure "int_ring" is now an abbreviation (previously a
516 definition). This fits more natural with advanced interpretations.
521 * The domain package now runs in definitional mode by default: The
522 former command 'new_domain' is now called 'domain'. To use the domain
523 package in its original axiomatic mode, use 'domain (unsafe)'.
526 * The new class "domain" is now the default sort. Class "predomain"
527 is an unpointed version of "domain". Theories can be updated by
528 replacing sort annotations as shown below. INCOMPATIBILITY.
530 'a::type ~> 'a::countable
531 'a::cpo ~> 'a::predomain
532 'a::pcpo ~> 'a::domain
534 * The old type class "rep" has been superseded by class "domain".
535 Accordingly, users of the definitional package must remove any
536 "default_sort rep" declarations. INCOMPATIBILITY.
538 * The domain package (definitional mode) now supports unpointed
539 predomain argument types, as long as they are marked 'lazy'. (Strict
540 arguments must be in class "domain".) For example, the following
541 domain definition now works:
543 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
545 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
546 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
547 'a option, and 'a list. Additionally, it configures fixrec and the
548 domain package to work with these types. For example:
550 fixrec isInl :: "('a + 'b) u -> tr"
551 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
553 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
555 * The "(permissive)" option of fixrec has been replaced with a
556 per-equation "(unchecked)" option. See
557 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
559 * The "bifinite" class no longer fixes a constant "approx"; the class
560 now just asserts that such a function exists. INCOMPATIBILITY.
562 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
563 defines an embedding of type 'a defl into udom by default; instances
564 of "bifinite" and "domain" classes are available in
565 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
567 * The syntax "REP('a)" has been replaced with "DEFL('a)".
569 * The predicate "directed" has been removed. INCOMPATIBILITY.
571 * The type class "finite_po" has been removed. INCOMPATIBILITY.
573 * The function "cprod_map" has been renamed to "prod_map".
576 * The monadic bind operator on each powerdomain has new binder syntax
577 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
578 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
580 * The infix syntax for binary union on each powerdomain has changed
581 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
582 syntax. INCOMPATIBILITY.
584 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
585 still supported as an input translation.
587 * Renamed some theorems (the original names are also still available).
589 expand_fun_below ~> fun_below_iff
590 below_fun_ext ~> fun_belowI
591 expand_cfun_eq ~> cfun_eq_iff
593 expand_cfun_below ~> cfun_below_iff
594 below_cfun_ext ~> cfun_belowI
595 cont2cont_Rep_CFun ~> cont2cont_APP
597 * The Abs and Rep functions for various types have changed names.
598 Related theorem names have also changed to match. INCOMPATIBILITY.
602 Rep_Sprod ~> Rep_sprod
603 Abs_Sprod ~> Abs_sprod
607 * Lemmas with names of the form *_defined_iff or *_strict_iff have
608 been renamed to *_bottom_iff. INCOMPATIBILITY.
610 * Various changes to bisimulation/coinduction with domain package:
612 - Definitions of "bisim" constants no longer mention definedness.
613 - With mutual recursion, "bisim" predicate is now curried.
614 - With mutual recursion, each type gets a separate coind theorem.
615 - Variable names in bisim_def and coinduct rules have changed.
619 * Case combinators generated by the domain package for type "foo" are
620 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
622 * Several theorems have been renamed to more accurately reflect the
623 names of constants and types involved. INCOMPATIBILITY.
625 thelub_const ~> lub_const
626 lub_const ~> is_lub_const
628 is_lub_lub ~> is_lubD2
630 unique_lub ~> is_lub_unique
631 is_ub_lub ~> is_lub_rangeD1
632 lub_bin_chain ~> is_lub_bin_chain
633 lub_fun ~> is_lub_fun
634 thelub_fun ~> lub_fun
635 thelub_cfun ~> lub_cfun
636 thelub_Pair ~> lub_Pair
637 lub_cprod ~> is_lub_prod
638 thelub_cprod ~> lub_prod
639 minimal_cprod ~> minimal_prod
640 inst_cprod_pcpo ~> inst_prod_pcpo
642 compact_UU ~> compact_bottom
643 deflation_UU ~> deflation_bottom
644 finite_deflation_UU ~> finite_deflation_bottom
646 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
648 sq_ord_less_eq_trans ~> below_eq_trans
649 sq_ord_eq_less_trans ~> eq_below_trans
650 refl_less ~> below_refl
651 trans_less ~> below_trans
652 antisym_less ~> below_antisym
653 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
654 box_less ~> box_below
655 rev_trans_less ~> rev_below_trans
656 not_less2not_eq ~> not_below2not_eq
657 less_UU_iff ~> below_UU_iff
658 flat_less_iff ~> flat_below_iff
659 adm_less ~> adm_below
660 adm_not_less ~> adm_not_below
661 adm_compact_not_less ~> adm_compact_not_below
662 less_fun_def ~> below_fun_def
663 expand_fun_less ~> fun_below_iff
664 less_fun_ext ~> fun_belowI
665 less_discr_def ~> below_discr_def
666 discr_less_eq ~> discr_below_eq
667 less_unit_def ~> below_unit_def
668 less_cprod_def ~> below_prod_def
669 prod_lessI ~> prod_belowI
670 Pair_less_iff ~> Pair_below_iff
671 fst_less_iff ~> fst_below_iff
672 snd_less_iff ~> snd_below_iff
673 expand_cfun_less ~> cfun_below_iff
674 less_cfun_ext ~> cfun_belowI
675 injection_less ~> injection_below
676 less_up_def ~> below_up_def
677 not_Iup_less ~> not_Iup_below
678 Iup_less ~> Iup_below
680 Def_inject_less_eq ~> Def_below_Def
681 Def_less_is_eq ~> Def_below_iff
682 spair_less_iff ~> spair_below_iff
683 less_sprod ~> below_sprod
684 spair_less ~> spair_below
685 sfst_less_iff ~> sfst_below_iff
686 ssnd_less_iff ~> ssnd_below_iff
687 fix_least_less ~> fix_least_below
688 dist_less_one ~> dist_below_one
689 less_ONE ~> below_ONE
690 ONE_less_iff ~> ONE_below_iff
691 less_sinlD ~> below_sinlD
692 less_sinrD ~> below_sinrD
697 * All constant names are now qualified internally and use proper
698 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
703 * Antiquotation @{assert} inlines a function bool -> unit that raises
704 Fail if the argument is false. Due to inlining the source position of
705 failed assertions is included in the error output.
707 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
708 text is in practice always evaluated with a stable theory checkpoint.
709 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
711 * Antiquotation @{theory A} refers to theory A from the ancestry of
712 the current context, not any accidental theory loader state as before.
713 Potential INCOMPATIBILITY, subtle change in semantics.
715 * Syntax.pretty_priority (default 0) configures the required priority
716 of pretty-printed output and thus affects insertion of parentheses.
718 * Syntax.default_root (default "any") configures the inner syntax
719 category (nonterminal symbol) for parsing of terms.
721 * Former exception Library.UnequalLengths now coincides with
722 ListPair.UnequalLengths.
724 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
725 main functionality is provided by structure Simplifier.
727 * Renamed raw "explode" function to "raw_explode" to emphasize its
728 meaning. Note that internally to Isabelle, Symbol.explode is used in
729 almost all situations.
731 * Discontinued obsolete function sys_error and exception SYS_ERROR.
732 See implementation manual for further details on exceptions in
735 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
738 * Renamed structure PureThy to Pure_Thy and moved most of its
739 operations to structure Global_Theory, to emphasize that this is
740 rarely-used global-only stuff.
742 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
743 instead (or tracing for high-volume output).
745 * Configuration option show_question_marks only affects regular pretty
746 printing of types and terms, not raw Term.string_of_vname.
748 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
749 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
750 @{thms} for most purposes.
752 * ML structure Unsynchronized is never opened, not even in Isar
753 interaction mode as before. Old Unsynchronized.set etc. have been
754 discontinued -- use plain := instead. This should be *rare* anyway,
755 since modern tools always work via official context data, notably
756 configuration options.
758 * Parallel and asynchronous execution requires special care concerning
759 interrupts. Structure Exn provides some convenience functions that
760 avoid working directly with raw Interrupt. User code must not absorb
761 interrupts -- intermediate handling (for cleanup etc.) needs to be
762 followed by re-raising of the original exception. Another common
763 source of mistakes are "handle _" patterns, which make the meaning of
764 the program subject to physical effects of the environment.
768 New in Isabelle2009-2 (June 2010)
769 ---------------------------------
773 * Authentic syntax for *all* logical entities (type classes, type
774 constructors, term constants): provides simple and robust
775 correspondence between formal entities and concrete syntax. Within
776 the parse tree / AST representations, "constants" are decorated by
777 their category (class, type, const) and spelled out explicitly with
778 their full internal name.
780 Substantial INCOMPATIBILITY concerning low-level syntax declarations
781 and translations (translation rules and translation functions in ML).
782 Some hints on upgrading:
784 - Many existing uses of 'syntax' and 'translations' can be replaced
785 by more modern 'type_notation', 'notation' and 'abbreviation',
786 which are independent of this issue.
788 - 'translations' require markup within the AST; the term syntax
789 provides the following special forms:
791 CONST c -- produces syntax version of constant c from context
792 XCONST c -- literally c, checked as constant from context
793 c -- literally c, if declared by 'syntax'
795 Plain identifiers are treated as AST variables -- occasionally the
796 system indicates accidental variables via the error "rhs contains
799 Type classes and type constructors are marked according to their
800 concrete syntax. Some old translations rules need to be written
801 for the "type" category, using type constructor application
802 instead of pseudo-term application of the default category
805 - 'parse_translation' etc. in ML may use the following
808 @{class_syntax c} -- type class c within parse tree / AST
809 @{term_syntax c} -- type constructor c within parse tree / AST
810 @{const_syntax c} -- ML version of "CONST c" above
811 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
813 - Literal types within 'typed_print_translations', i.e. those *not*
814 represented as pseudo-terms are represented verbatim. Use @{class
815 c} or @{type_name c} here instead of the above syntax
818 Note that old non-authentic syntax was based on unqualified base
819 names, so all of the above "constant" names would coincide. Recall
820 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
821 diagnose syntax problems.
823 * Type constructors admit general mixfix syntax, not just infix.
825 * Concrete syntax may be attached to local entities without a proof
826 body, too. This works via regular mixfix annotations for 'fix',
827 'def', 'obtain' etc. or via the explicit 'write' command, which is
828 similar to the 'notation' command in theory specifications.
830 * Discontinued unnamed infix syntax (legacy feature for many years) --
831 need to specify constant name and syntax separately. Internal ML
832 datatype constructors have been renamed from InfixName to Infix etc.
833 Minor INCOMPATIBILITY.
835 * Schematic theorem statements need to be explicitly markup as such,
836 via commands 'schematic_lemma', 'schematic_theorem',
837 'schematic_corollary'. Thus the relevance of the proof is made
838 syntactically clear, which impacts performance in a parallel or
839 asynchronous interactive environment. Minor INCOMPATIBILITY.
841 * Use of cumulative prems via "!" in some proof methods has been
842 discontinued (old legacy feature).
844 * References 'trace_simp' and 'debug_simp' have been replaced by
845 configuration options stored in the context. Enabling tracing (the
846 case of debugging is similar) in proofs works via
848 using [[trace_simp = true]]
850 Tracing is then active for all invocations of the simplifier in
851 subsequent goal refinement steps. Tracing may also still be enabled or
852 disabled via the ProofGeneral settings menu.
854 * Separate commands 'hide_class', 'hide_type', 'hide_const',
855 'hide_fact' replace the former 'hide' KIND command. Minor
858 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
859 more efficient than combinations with -q1 or -q2.
864 * Proofterms record type-class reasoning explicitly, using the
865 "unconstrain" operation internally. This eliminates all sort
866 constraints from a theorem and proof, introducing explicit
867 OFCLASS-premises. On the proof term level, this operation is
868 automatically applied at theorem boundaries, such that closed proofs
869 are always free of sort constraints. INCOMPATIBILITY for tools that
872 * Local theory specifications may depend on extra type variables that
873 are not present in the result type -- arguments TYPE('a) :: 'a itself
874 are added internally. For example:
876 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
878 * Predicates of locales introduced by classes carry a mandatory
879 "class" prefix. INCOMPATIBILITY.
881 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
883 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
886 * Command 'code_reflect' allows to incorporate generated ML code into
887 runtime environment; replaces immature code_datatype antiquotation.
890 * Code generator: simple concept for abstract datatypes obeying
893 * Code generator: details of internal data cache have no impact on the
894 user space functionality any longer.
896 * Methods "unfold_locales" and "intro_locales" ignore non-locale
897 subgoals. This is more appropriate for interpretations with 'where'.
900 * Command 'example_proof' opens an empty proof body. This allows to
901 experiment with Isar, without producing any persistent result.
903 * Commands 'type_notation' and 'no_type_notation' declare type syntax
904 within a local theory context, with explicit checking of the
905 constructors involved (in contrast to the raw 'syntax' versions).
907 * Commands 'types' and 'typedecl' now work within a local theory
908 context -- without introducing dependencies on parameters or
909 assumptions, which is not possible in Isabelle/Pure.
911 * Command 'defaultsort' has been renamed to 'default_sort', it works
912 within a local theory context. Minor INCOMPATIBILITY.
917 * Command 'typedef' now works within a local theory context -- without
918 introducing dependencies on parameters or assumptions, which is not
919 possible in Isabelle/Pure/HOL. Note that the logical environment may
920 contain multiple interpretations of local typedefs (with different
921 non-emptiness proofs), even in a global theory context.
923 * New package for quotient types. Commands 'quotient_type' and
924 'quotient_definition' may be used for defining types and constants by
925 quotient constructions. An example is the type of integers created by
926 quotienting pairs of natural numbers:
929 intrel :: "(nat * nat) => (nat * nat) => bool"
931 "intrel (x, y) (u, v) = (x + v = u + y)"
933 quotient_type int = "nat * nat" / intrel
934 by (auto simp add: equivp_def expand_fun_eq)
937 "0::int" is "(0::nat, 0::nat)"
939 The method "lifting" can be used to lift of theorems from the
940 underlying "raw" type to the quotient type. The example
941 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
942 construction and provides a reasoning infrastructure for finite sets.
944 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
945 clash with new theory Quotient in Main HOL.
947 * Moved the SMT binding into the main HOL session, eliminating
948 separate HOL-SMT session.
950 * List membership infix mem operation is only an input abbreviation.
953 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
954 for future developements; former Library/Word.thy is still present in
955 the AFP entry RSAPPS.
957 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
958 longer shadowed. INCOMPATIBILITY.
960 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
963 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
966 * Dropped normalizing_semiring etc; use the facts in semiring classes
967 instead. INCOMPATIBILITY.
969 * Dropped several real-specific versions of lemmas about floor and
970 ceiling; use the generic lemmas from theory "Archimedean_Field"
971 instead. INCOMPATIBILITY.
973 floor_number_of_eq ~> floor_number_of
974 le_floor_eq_number_of ~> number_of_le_floor
975 le_floor_eq_zero ~> zero_le_floor
976 le_floor_eq_one ~> one_le_floor
977 floor_less_eq_number_of ~> floor_less_number_of
978 floor_less_eq_zero ~> floor_less_zero
979 floor_less_eq_one ~> floor_less_one
980 less_floor_eq_number_of ~> number_of_less_floor
981 less_floor_eq_zero ~> zero_less_floor
982 less_floor_eq_one ~> one_less_floor
983 floor_le_eq_number_of ~> floor_le_number_of
984 floor_le_eq_zero ~> floor_le_zero
985 floor_le_eq_one ~> floor_le_one
986 floor_subtract_number_of ~> floor_diff_number_of
987 floor_subtract_one ~> floor_diff_one
988 ceiling_number_of_eq ~> ceiling_number_of
989 ceiling_le_eq_number_of ~> ceiling_le_number_of
990 ceiling_le_zero_eq ~> ceiling_le_zero
991 ceiling_le_eq_one ~> ceiling_le_one
992 less_ceiling_eq_number_of ~> number_of_less_ceiling
993 less_ceiling_eq_zero ~> zero_less_ceiling
994 less_ceiling_eq_one ~> one_less_ceiling
995 ceiling_less_eq_number_of ~> ceiling_less_number_of
996 ceiling_less_eq_zero ~> ceiling_less_zero
997 ceiling_less_eq_one ~> ceiling_less_one
998 le_ceiling_eq_number_of ~> number_of_le_ceiling
999 le_ceiling_eq_zero ~> zero_le_ceiling
1000 le_ceiling_eq_one ~> one_le_ceiling
1001 ceiling_subtract_number_of ~> ceiling_diff_number_of
1002 ceiling_subtract_one ~> ceiling_diff_one
1004 * Theory "Finite_Set": various folding_XXX locales facilitate the
1005 application of the various fold combinators on finite sets.
1007 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
1008 provides abstract red-black tree type which is backed by "RBT_Impl" as
1009 implementation. INCOMPATIBILTY.
1011 * Theory Library/Coinductive_List has been removed -- superseded by
1012 AFP/thys/Coinductive.
1014 * Theory PReal, including the type "preal" and related operations, has
1015 been removed. INCOMPATIBILITY.
1017 * Real: new development using Cauchy Sequences.
1019 * Split off theory "Big_Operators" containing setsum, setprod,
1020 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
1022 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
1023 "Int" etc. INCOMPATIBILITY.
1025 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
1027 * New set of rules "ac_simps" provides combined assoc / commute
1028 rewrites for all interpretations of the appropriate generic locales.
1030 * Renamed theory "OrderedGroup" to "Groups" and split theory
1031 "Ring_and_Field" into theories "Rings" and "Fields"; for more
1032 appropriate and more consistent names suitable for name prefixes
1033 within the HOL theories. INCOMPATIBILITY.
1035 * Some generic constants have been put to appropriate theories:
1036 - less_eq, less: Orderings
1037 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
1038 - inverse, divide: Rings
1041 * More consistent naming of type classes involving orderings (and
1044 lower_semilattice ~> semilattice_inf
1045 upper_semilattice ~> semilattice_sup
1047 dense_linear_order ~> dense_linorder
1049 pordered_ab_group_add ~> ordered_ab_group_add
1050 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
1051 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
1052 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
1053 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
1054 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
1055 pordered_cancel_semiring ~> ordered_cancel_semiring
1056 pordered_comm_monoid_add ~> ordered_comm_monoid_add
1057 pordered_comm_ring ~> ordered_comm_ring
1058 pordered_comm_semiring ~> ordered_comm_semiring
1059 pordered_ring ~> ordered_ring
1060 pordered_ring_abs ~> ordered_ring_abs
1061 pordered_semiring ~> ordered_semiring
1063 ordered_ab_group_add ~> linordered_ab_group_add
1064 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
1065 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
1066 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
1067 ordered_field ~> linordered_field
1068 ordered_field_no_lb ~> linordered_field_no_lb
1069 ordered_field_no_ub ~> linordered_field_no_ub
1070 ordered_field_dense_linear_order ~> dense_linordered_field
1071 ordered_idom ~> linordered_idom
1072 ordered_ring ~> linordered_ring
1073 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
1074 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
1075 ordered_ring_strict ~> linordered_ring_strict
1076 ordered_semidom ~> linordered_semidom
1077 ordered_semiring ~> linordered_semiring
1078 ordered_semiring_1 ~> linordered_semiring_1
1079 ordered_semiring_1_strict ~> linordered_semiring_1_strict
1080 ordered_semiring_strict ~> linordered_semiring_strict
1082 The following slightly odd type classes have been moved to a
1083 separate theory Library/Lattice_Algebras:
1085 lordered_ab_group_add ~> lattice_ab_group_add
1086 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
1087 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
1088 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
1089 lordered_ring ~> lattice_ring
1093 * Refined field classes:
1094 - classes division_ring_inverse_zero, field_inverse_zero,
1095 linordered_field_inverse_zero include rule inverse 0 = 0 --
1096 subsumes former division_by_zero class;
1097 - numerous lemmas have been ported from field to division_ring.
1100 * Refined algebra theorem collections:
1101 - dropped theorem group group_simps, use algebra_simps instead;
1102 - dropped theorem group ring_simps, use field_simps instead;
1103 - proper theorem collection field_simps subsumes former theorem
1104 groups field_eq_simps and field_simps;
1105 - dropped lemma eq_minus_self_iff which is a duplicate for
1109 * Theory Finite_Set and List: some lemmas have been generalized from
1112 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
1113 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
1114 inter_Inter_fold_inter ~> inf_Inf_fold_inf
1115 union_Union_fold_union ~> sup_Sup_fold_sup
1116 Inter_fold_inter ~> Inf_fold_inf
1117 Union_fold_union ~> Sup_fold_sup
1118 inter_INTER_fold_inter ~> inf_INFI_fold_inf
1119 union_UNION_fold_union ~> sup_SUPR_fold_sup
1120 INTER_fold_inter ~> INFI_fold_inf
1121 UNION_fold_union ~> SUPR_fold_sup
1123 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
1124 replaced by the more convenient lemmas Inf_empty and Sup_empty.
1125 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
1126 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
1127 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
1128 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
1130 * Reorganized theory Multiset: swapped notation of pointwise and
1133 - pointwise ordering is instance of class order with standard syntax
1135 - multiset ordering has syntax <=# and <#; partial order properties
1136 are provided by means of interpretation with prefix
1138 - less duplication, less historical organization of sections,
1139 conversion from associations lists to multisets, rudimentary code
1141 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
1146 multiset_eq_conv_count_eq ~> multiset_ext_iff
1147 multi_count_ext ~> multiset_ext
1148 diff_union_inverse2 ~> diff_union_cancelR
1152 * Theory Permutation: replaced local "remove" by List.remove1.
1154 * Code generation: ML and OCaml code is decorated with signatures.
1156 * Theory List: added transpose.
1158 * Library/Nat_Bijection.thy is a collection of bijective functions
1159 between nat and other types, which supersedes the older libraries
1160 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
1163 Nat_Int_Bij.nat2_to_nat ~> prod_encode
1164 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
1165 Nat_Int_Bij.int_to_nat_bij ~> int_encode
1166 Nat_Int_Bij.nat_to_int_bij ~> int_decode
1167 Countable.pair_encode ~> prod_encode
1168 NatIso.prod2nat ~> prod_encode
1169 NatIso.nat2prod ~> prod_decode
1170 NatIso.sum2nat ~> sum_encode
1171 NatIso.nat2sum ~> sum_decode
1172 NatIso.list2nat ~> list_encode
1173 NatIso.nat2list ~> list_decode
1174 NatIso.set2nat ~> set_encode
1175 NatIso.nat2set ~> set_decode
1178 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
1179 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
1180 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
1181 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
1182 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
1183 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
1184 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
1185 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
1186 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
1187 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
1188 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
1189 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
1190 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
1193 - Renamed ATP commands:
1194 atp_info ~> sledgehammer running_atps
1195 atp_kill ~> sledgehammer kill_atps
1196 atp_messages ~> sledgehammer messages
1197 atp_minimize ~> sledgehammer minimize
1198 print_atps ~> sledgehammer available_atps
1200 - Added user's manual ("isabelle doc sledgehammer").
1201 - Added option syntax and "sledgehammer_params" to customize
1202 Sledgehammer's behavior. See the manual for details.
1203 - Modified the Isar proof reconstruction code so that it produces
1204 direct proofs rather than proofs by contradiction. (This feature
1205 is still experimental.)
1206 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
1208 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
1211 - Added and implemented "binary_ints" and "bits" options.
1212 - Added "std" option and implemented support for nonstandard models.
1213 - Added and implemented "finitize" option to improve the precision
1214 of infinite datatypes based on a monotonicity analysis.
1215 - Added support for quotient types.
1216 - Added support for "specification" and "ax_specification"
1218 - Added support for local definitions (for "function" and
1219 "termination" proofs).
1220 - Added support for term postprocessors.
1221 - Optimized "Multiset.multiset" and "FinFun.finfun".
1222 - Improved efficiency of "destroy_constrs" optimization.
1223 - Fixed soundness bugs related to "destroy_constrs" optimization and
1225 - Fixed soundness bug related to higher-order constructors.
1226 - Fixed soundness bug when "full_descrs" is enabled.
1227 - Improved precision of set constructs.
1228 - Added "atoms" option.
1229 - Added cache to speed up repeated Kodkod invocations on the same
1231 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
1232 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
1233 "SAT4J_Light". INCOMPATIBILITY.
1234 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
1235 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
1236 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
1238 * Method "induct" now takes instantiations of the form t, where t is not
1239 a variable, as a shorthand for "x == t", where x is a fresh variable.
1240 If this is not intended, t has to be enclosed in parentheses.
1241 By default, the equalities generated by definitional instantiations
1242 are pre-simplified, which may cause parameters of inductive cases
1243 to disappear, or may even delete some of the inductive cases.
1244 Use "induct (no_simp)" instead of "induct" to restore the old
1245 behaviour. The (no_simp) option is also understood by the "cases"
1246 and "nominal_induct" methods, which now perform pre-simplification, too.
1252 * Variable names in lemmas generated by the domain package have
1253 changed; the naming scheme is now consistent with the HOL datatype
1254 package. Some proof scripts may be affected, INCOMPATIBILITY.
1256 * The domain package no longer defines the function "foo_copy" for
1257 recursive domain "foo". The reach lemma is now stated directly in
1258 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
1259 be reformulated in terms of "foo_take", INCOMPATIBILITY.
1261 * Most definedness lemmas generated by the domain package (previously
1262 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
1263 like "foo$x = UU <-> x = UU", which works better as a simp rule.
1264 Proofs that used definedness lemmas as intro rules may break,
1265 potential INCOMPATIBILITY.
1267 * Induction and casedist rules generated by the domain package now
1268 declare proper case_names (one called "bottom", and one named for each
1269 constructor). INCOMPATIBILITY.
1271 * For mutually-recursive domains, separate "reach" and "take_lemma"
1272 rules are generated for each domain, INCOMPATIBILITY.
1274 foo_bar.reach ~> foo.reach bar.reach
1275 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
1277 * Some lemmas generated by the domain package have been renamed for
1278 consistency with the datatype package, INCOMPATIBILITY.
1280 foo.ind ~> foo.induct
1281 foo.finite_ind ~> foo.finite_induct
1282 foo.coind ~> foo.coinduct
1283 foo.casedist ~> foo.exhaust
1284 foo.exhaust ~> foo.nchotomy
1286 * For consistency with other definition packages, the fixrec package
1287 now generates qualified theorem names, INCOMPATIBILITY.
1289 foo_simps ~> foo.simps
1290 foo_unfold ~> foo.unfold
1291 foo_induct ~> foo.induct
1293 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
1294 method and internal fixrec proofs now use the default simpset instead.
1297 * The "contlub" predicate has been removed. Proof scripts should use
1298 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
1300 * The "admw" predicate has been removed, INCOMPATIBILITY.
1302 * The constants cpair, cfst, and csnd have been removed in favor of
1303 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
1308 * Antiquotations for basic formal entities:
1310 @{class NAME} -- type class
1311 @{class_syntax NAME} -- syntax representation of the above
1313 @{type_name NAME} -- logical type
1314 @{type_abbrev NAME} -- type abbreviation
1315 @{nonterminal NAME} -- type of concrete syntactic category
1316 @{type_syntax NAME} -- syntax representation of any of the above
1318 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
1319 @{const_abbrev NAME} -- abbreviated constant
1320 @{const_syntax NAME} -- syntax representation of any of the above
1322 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
1323 syntax constant (cf. 'syntax' command).
1325 * Antiquotation @{make_string} inlines a function to print arbitrary
1326 values similar to the ML toplevel. The result is compiler dependent
1327 and may fall back on "?" in certain situations.
1329 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
1330 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
1331 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
1332 not work with the asynchronous Isar document model.
1334 * Configuration options now admit dynamic default values, depending on
1335 the context or even global references.
1337 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
1338 uses an efficient external library if available (for Poly/ML).
1340 * Renamed some important ML structures, while keeping the old names
1341 for some time as aliases within the structure Legacy:
1343 OuterKeyword ~> Keyword
1346 OuterSyntax ~> Outer_Syntax
1347 PrintMode ~> Print_Mode
1348 SpecParse ~> Parse_Spec
1351 ThyOutput ~> Thy_Output
1352 TypeInfer ~> Type_Infer
1354 Note that "open Legacy" simplifies porting of sources, but forgetting
1355 to remove it again will complicate porting again in the future.
1357 * Most operations that refer to a global context are named
1358 accordingly, e.g. Simplifier.global_context or
1359 ProofContext.init_global. There are some situations where a global
1360 context actually works, but under normal circumstances one needs to
1361 pass the proper local context through the code!
1363 * Discontinued old TheoryDataFun with its copy/init operation -- data
1364 needs to be pure. Functor Theory_Data_PP retains the traditional
1365 Pretty.pp argument to merge, which is absent in the standard
1366 Theory_Data version.
1368 * Sorts.certify_sort and derived "cert" operations for types and terms
1369 no longer minimize sorts. Thus certification at the boundary of the
1370 inference kernel becomes invariant under addition of class relations,
1371 which is an important monotonicity principle. Sorts are now minimized
1372 in the syntax layer only, at the boundary between the end-user and the
1373 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
1374 explicitly in rare situations.
1376 * Renamed old-style Drule.standard to Drule.export_without_context, to
1377 emphasize that this is in no way a standard operation.
1380 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
1381 usual for resolution. Rare INCOMPATIBILITY.
1383 * Renamed varify/unvarify operations to varify_global/unvarify_global
1384 to emphasize that these only work in a global situation (which is
1387 * Curried take and drop in library.ML; negative length is interpreted
1388 as infinity (as in chop). Subtle INCOMPATIBILITY.
1390 * Proof terms: type substitutions on proof constants now use canonical
1391 order of type variables. INCOMPATIBILITY for tools working with proof
1394 * Raw axioms/defs may no longer carry sort constraints, and raw defs
1395 may no longer carry premises. User-level specifications are
1396 transformed accordingly by Thm.add_axiom/add_def.
1401 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
1402 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
1403 proof terms are enabled unconditionally in the new HOL-Proofs image.
1405 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
1406 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
1409 * Old lib/scripts/polyml-platform is superseded by the
1410 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
1411 variant, even on a 64 bit machine. The following example setting
1412 prefers 64 bit if available:
1414 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
1416 * The preliminary Isabelle/jEdit application demonstrates the emerging
1417 Isabelle/Scala layer for advanced prover interaction and integration.
1418 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
1421 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
1422 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
1423 similar to the default assignment of the document preparation system
1424 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
1425 provides some operations for direct access to the font without asking
1426 the user for manual installation.
1430 New in Isabelle2009-1 (December 2009)
1431 -------------------------------------
1435 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
1436 one backslash should be used, even in ML sources.
1441 * Locale interpretation propagates mixins along the locale hierarchy.
1442 The currently only available mixins are the equations used to map
1443 local definitions to terms of the target domain of an interpretation.
1445 * Reactivated diagnostic command 'print_interps'. Use "print_interps
1446 loc" to print all interpretations of locale "loc" in the theory.
1447 Interpretations in proofs are not shown.
1449 * Thoroughly revised locales tutorial. New section on conditional
1452 * On instantiation of classes, remaining undefined class parameters
1453 are formally declared. INCOMPATIBILITY.
1456 *** Document preparation ***
1458 * New generalized style concept for printing terms: @{foo (style) ...}
1459 instead of @{foo_style style ...} (old form is still retained for
1460 backward compatibility). Styles can be also applied for
1461 antiquotations prop, term_type and typeof.
1466 * New proof method "smt" for a combination of first-order logic with
1467 equality, linear and nonlinear (natural/integer/real) arithmetic, and
1468 fixed-size bitvectors; there is also basic support for higher-order
1469 features (esp. lambda abstractions). It is an incomplete decision
1470 procedure based on external SMT solvers using the oracle mechanism;
1471 for the SMT solver Z3, this method is proof-producing. Certificates
1472 are provided to avoid calling the external solvers solely for
1473 re-checking proofs. Due to a remote SMT service there is no need for
1474 installing SMT solvers locally. See src/HOL/SMT.
1476 * New commands to load and prove verification conditions generated by
1477 the Boogie program verifier or derived systems (e.g. the Verifying C
1478 Compiler (VCC) or Spec#). See src/HOL/Boogie.
1480 * New counterexample generator tool 'nitpick' based on the Kodkod
1481 relational model finder. See src/HOL/Tools/Nitpick and
1482 src/HOL/Nitpick_Examples.
1484 * New commands 'code_pred' and 'values' to invoke the predicate
1485 compiler and to enumerate values of inductive predicates.
1487 * A tabled implementation of the reflexive transitive closure.
1489 * New implementation of quickcheck uses generic code generator;
1490 default generators are provided for all suitable HOL types, records
1491 and datatypes. Old quickcheck can be re-activated importing theory
1492 Library/SML_Quickcheck.
1494 * New testing tool Mirabelle for automated proof tools. Applies
1495 several tools and tactics like sledgehammer, metis, or quickcheck, to
1496 every proof step in a theory. To be used in batch mode via the
1497 "mirabelle" utility.
1499 * New proof method "sos" (sum of squares) for nonlinear real
1500 arithmetic (originally due to John Harison). It requires theory
1501 Library/Sum_Of_Squares. It is not a complete decision procedure but
1502 works well in practice on quantifier-free real arithmetic with +, -,
1503 *, ^, =, <= and <, i.e. boolean combinations of equalities and
1504 inequalities between polynomials. It makes use of external
1505 semidefinite programming solvers. Method "sos" generates a
1506 certificate that can be pasted into the proof thus avoiding the need
1507 to call an external tool every time the proof is checked. See
1508 src/HOL/Library/Sum_Of_Squares.
1510 * New method "linarith" invokes existing linear arithmetic decision
1513 * New command 'atp_minimal' reduces result produced by Sledgehammer.
1515 * New Sledgehammer option "Full Types" in Proof General settings menu.
1516 Causes full type information to be output to the ATPs. This slows
1517 ATPs down considerably but eliminates a source of unsound "proofs"
1520 * New method "metisFT": A version of metis that uses full type
1521 information in order to avoid failures of proof reconstruction.
1523 * New evaluator "approximate" approximates an real valued term using
1524 the same method as the approximation method.
1526 * Method "approximate" now supports arithmetic expressions as
1527 boundaries of intervals and implements interval splitting and Taylor
1530 * ML antiquotation @{code_datatype} inserts definition of a datatype
1531 generated by the code generator; e.g. see src/HOL/Predicate.thy.
1533 * New theory SupInf of the supremum and infimum operators for sets of
1536 * New theory Probability, which contains a development of measure
1537 theory, eventually leading to Lebesgue integration and probability.
1539 * Extended Multivariate Analysis to include derivation and Brouwer's
1542 * Reorganization of number theory, INCOMPATIBILITY:
1543 - new number theory development for nat and int, in theories Divides
1544 and GCD as well as in new session Number_Theory
1545 - some constants and facts now suffixed with _nat and _int
1547 - former session NumberTheory now named Old_Number_Theory, including
1548 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
1549 - moved theory Pocklington from src/HOL/Library to
1550 src/HOL/Old_Number_Theory
1552 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
1553 lcm of finite and infinite sets. It is shown that they form a complete
1556 * Class semiring_div requires superclass no_zero_divisors and proof of
1557 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
1558 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
1559 generalized to class semiring_div, subsuming former theorems
1560 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
1561 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
1564 * Refinements to lattice classes and sets:
1565 - less default intro/elim rules in locale variant, more default
1566 intro/elim rules in class variant: more uniformity
1567 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
1569 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
1571 - renamed ACI to inf_sup_aci
1572 - new class "boolean_algebra"
1573 - class "complete_lattice" moved to separate theory
1574 "Complete_Lattice"; corresponding constants (and abbreviations)
1575 renamed and with authentic syntax:
1576 Set.Inf ~> Complete_Lattice.Inf
1577 Set.Sup ~> Complete_Lattice.Sup
1578 Set.INFI ~> Complete_Lattice.INFI
1579 Set.SUPR ~> Complete_Lattice.SUPR
1580 Set.Inter ~> Complete_Lattice.Inter
1581 Set.Union ~> Complete_Lattice.Union
1582 Set.INTER ~> Complete_Lattice.INTER
1583 Set.UNION ~> Complete_Lattice.UNION
1584 - authentic syntax for
1587 - mere abbreviations:
1590 Set.inter (for inf, formerly Set.Int)
1591 Set.union (for sup, formerly Set.Un)
1592 Complete_Lattice.Inter (for Inf)
1593 Complete_Lattice.Union (for Sup)
1594 Complete_Lattice.INTER (for INFI)
1595 Complete_Lattice.UNION (for SUPR)
1596 - object-logic definitions as far as appropriate
1598 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
1599 Un_subset_iff are explicitly deleted as default simp rules; then also
1600 their lattice counterparts le_inf_iff and le_sup_iff have to be
1601 deleted to achieve the desired effect.
1603 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
1604 rules by default any longer; the same applies to min_max.inf_absorb1
1605 etc. INCOMPATIBILITY.
1607 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
1608 pred_set_conv by default. INCOMPATIBILITY.
1610 * Power operations on relations and functions are now one dedicated
1611 constant "compow" with infix syntax "^^". Power operation on
1612 multiplicative monoids retains syntax "^" and is now defined generic
1613 in class power. INCOMPATIBILITY.
1615 * Relation composition "R O S" now has a more standard argument order:
1616 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
1617 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
1618 break, since the O_assoc rule was not rewritten like this. Fix using
1619 O_assoc[symmetric]. The same applies to the curried version "R OO S".
1621 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
1622 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
1625 * Most rules produced by inductive and datatype package have mandatory
1626 prefixes. INCOMPATIBILITY.
1628 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
1629 the attribute of the same name. Each of the theorems in the list
1630 DERIV_intros assumes composition with an additional function and
1631 matches a variable to the derivative, which has to be solved by the
1632 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
1633 of most elementary terms. Former Maclauren.DERIV_tac and
1634 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
1637 * Code generator attributes follow the usual underscore convention:
1638 code_unfold replaces code unfold
1639 code_post replaces code post
1644 sizechange -> size_change
1645 induct_scheme -> induction_schema
1648 * Discontinued abbreviation "arbitrary" of constant "undefined".
1649 INCOMPATIBILITY, use "undefined" directly.
1652 Suc_eq_add_numeral_1 -> Suc_eq_plus1
1653 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
1654 Suc_plus1 -> Suc_eq_plus1
1655 *anti_sym -> *antisym*
1656 vector_less_eq_def -> vector_le_def
1659 * Added theorem List.map_map as [simp]. Removed List.map_compose.
1662 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1668 * Theory Representable defines a class "rep" of domains that are
1669 representable (via an ep-pair) in the universal domain type "udom".
1670 Instances are provided for all type constructors defined in HOLCF.
1672 * The 'new_domain' command is a purely definitional version of the
1673 domain package, for representable domains. Syntax is identical to the
1674 old domain package. The 'new_domain' package also supports indirect
1675 recursion using previously-defined type constructors. See
1676 src/HOLCF/ex/New_Domain.thy for examples.
1678 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1679 on the left-hand side of an equation, and then performs
1680 simplification. Rewriting is done using rules declared with the
1681 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1682 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1684 * The pattern-match compiler in 'fixrec' can now handle constructors
1685 with HOL function types. Pattern-match combinators for the Pair
1686 constructor are pre-configured.
1688 * The 'fixrec' package now produces better fixed-point induction rules
1689 for mutually-recursive definitions: Induction rules have conclusions
1690 of the form "P foo bar" instead of "P <foo, bar>".
1692 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1693 been renamed to "below". The name "below" now replaces "less" in many
1694 theorem names. (Legacy theorem names using "less" are still supported
1697 * The 'fixrec' package now supports "bottom patterns". Bottom
1698 patterns can be used to generate strictness rules, or to make
1699 functions more strict (much like the bang-patterns supported by the
1700 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1706 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1707 errors and run-time exceptions, including detailed source positions.
1709 * Structure Name_Space (formerly NameSpace) now manages uniquely
1710 identified entries, with some additional information such as source
1711 position, logical grouping etc.
1713 * Theory and context data is now introduced by the simplified and
1714 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1715 to be pure, but the old TheoryDataFun for mutable data (with explicit
1716 copy operation) is still available for some time.
1718 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1719 provides a high-level programming interface to synchronized state
1720 variables with atomic update. This works via pure function
1721 application within a critical section -- its runtime should be as
1722 short as possible; beware of deadlocks if critical code is nested,
1723 either directly or indirectly via other synchronized variables!
1725 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1726 wraps raw ML references, explicitly indicating their non-thread-safe
1727 behaviour. The Isar toplevel keeps this structure open, to
1728 accommodate Proof General as well as quick and dirty interactive
1729 experiments with references.
1731 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1732 parallel tactical reasoning.
1734 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1735 are similar to SUBPROOF, but are slightly more flexible: only the
1736 specified parts of the subgoal are imported into the context, and the
1737 body tactic may introduce new subgoals and schematic variables.
1739 * Old tactical METAHYPS, which does not observe the proof context, has
1740 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1741 or Subgoal.FOCUS etc.
1743 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1744 functors have their own ML name space there is no point to mark them
1745 separately.) Minor INCOMPATIBILITY.
1747 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1749 * Renamed several structures FooBar to Foo_Bar. Occasional,
1752 * Operations of structure Skip_Proof no longer require quick_and_dirty
1753 mode, which avoids critical setmp.
1755 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1756 combinators for "args". INCOMPATIBILITY, need to use simplified
1757 Attrib/Method.setup introduced in Isabelle2009.
1759 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1760 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1761 last resort. INCOMPATIBILITY.
1763 * Display.pretty_thm now requires a proper context (cf. former
1764 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1765 or even Display.pretty_thm_without_context as last resort.
1768 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1769 Syntax.pretty_typ/term directly, preferably with proper context
1770 instead of global theory.
1775 * Further fine tuning of parallel proof checking, scales up to 8 cores
1776 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1779 * Support for additional "Isabelle components" via etc/components, see
1780 also the system manual.
1782 * The isabelle makeall tool now operates on all components with
1783 IsaMakefile, not just hardwired "logics".
1785 * Removed "compress" option from isabelle-process and isabelle usedir;
1786 this is always enabled.
1788 * Discontinued support for Poly/ML 4.x versions.
1790 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1791 on a given logic image. This requires the lighttpd webserver and is
1792 currently supported on Linux only.
1796 New in Isabelle2009 (April 2009)
1797 --------------------------------
1801 * Simplified main Isabelle executables, with less surprises on
1802 case-insensitive file-systems (such as Mac OS).
1804 - The main Isabelle tool wrapper is now called "isabelle" instead of
1807 - The former "isabelle" alias for "isabelle-process" has been
1808 removed (should rarely occur to regular users).
1810 - The former "isabelle-interface" and its alias "Isabelle" have been
1811 removed (interfaces are now regular Isabelle tools).
1813 Within scripts and make files, the Isabelle environment variables
1814 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1815 respectively. (The latter are still available as legacy feature.)
1817 The old isabelle-interface wrapper could react in confusing ways if
1818 the interface was uninstalled or changed otherwise. Individual
1819 interface tool configuration is now more explicit, see also the
1820 Isabelle system manual. In particular, Proof General is now available
1821 via "isabelle emacs".
1823 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1824 purge installed copies of Isabelle executables and re-run "isabelle
1825 install -p ...", or use symlinks.
1827 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1828 old ~/isabelle, which was slightly non-standard and apt to cause
1829 surprises on case-insensitive file-systems (such as Mac OS).
1831 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1832 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1833 care is required when using older releases of Isabelle. Note that
1834 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1835 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1837 * Proofs of fully specified statements are run in parallel on
1838 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1839 a regular 4-core machine, if the initial heap space is made reasonably
1840 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1842 * The main reference manuals ("isar-ref", "implementation", and
1843 "system") have been updated and extended. Formally checked references
1844 as hyperlinks are now available uniformly.
1849 * Complete re-implementation of locales. INCOMPATIBILITY in several
1850 respects. The most important changes are listed below. See the
1851 Tutorial on Locales ("locales" manual) for details.
1853 - In locale expressions, instantiation replaces renaming. Parameters
1854 must be declared in a for clause. To aid compatibility with previous
1855 parameter inheritance, in locale declarations, parameters that are not
1856 'touched' (instantiation position "_" or omitted) are implicitly added
1857 with their syntax at the beginning of the for clause.
1859 - Syntax from abbreviations and definitions in locales is available in
1860 locale expressions and context elements. The latter is particularly
1861 useful in locale declarations.
1863 - More flexible mechanisms to qualify names generated by locale
1864 expressions. Qualifiers (prefixes) may be specified in locale
1865 expressions, and can be marked as mandatory (syntax: "name!:") or
1866 optional (syntax "name?:"). The default depends for plain "name:"
1867 depends on the situation where a locale expression is used: in
1868 commands 'locale' and 'sublocale' prefixes are optional, in
1869 'interpretation' and 'interpret' prefixes are mandatory. The old
1870 implicit qualifiers derived from the parameter names of a locale are
1871 no longer generated.
1873 - Command "sublocale l < e" replaces "interpretation l < e". The
1874 instantiation clause in "interpretation" and "interpret" (square
1875 brackets) is no longer available. Use locale expressions.
1877 - When converting proof scripts, mandatory qualifiers in
1878 'interpretation' and 'interpret' should be retained by default, even
1879 if this is an INCOMPATIBILITY compared to former behavior. In the
1880 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1881 in locale expressions range over a single locale instance only.
1883 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1884 In existing theorem specifications replace the includes element by the
1885 respective context elements of the included locale, omitting those
1886 that are already present in the theorem specification. Multiple
1887 assume elements of a locale should be replaced by a single one
1888 involving the locale predicate. In the proof body, declarations (most
1889 notably theorems) may be regained by interpreting the respective
1890 locales in the proof context as required (command "interpret").
1892 If using "includes" in replacement of a target solely because the
1893 parameter types in the theorem are not as general as in the target,
1894 consider declaring a new locale with additional type constraints on
1895 the parameters (context element "constrains").
1897 - Discontinued "locale (open)". INCOMPATIBILITY.
1899 - Locale interpretation commands no longer attempt to simplify goal.
1900 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1901 methods intro_locales and unfold_locales to clarify.
1903 - Locale interpretation commands no longer accept interpretation
1904 attributes. INCOMPATIBILITY.
1906 * Class declaration: so-called "base sort" must not be given in import
1907 list any longer, but is inferred from the specification. Particularly
1914 class foo = type + ...
1916 * Class target: global versions of theorems stemming do not carry a
1917 parameter prefix any longer. INCOMPATIBILITY.
1919 * Class 'instance' command no longer accepts attached definitions.
1920 INCOMPATIBILITY, use proper 'instantiation' target instead.
1922 * Recovered hiding of consts, which was accidentally broken in
1923 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1924 makes c inaccessible; consider using ``hide (open) const c'' instead.
1926 * Slightly more coherent Pure syntax, with updated documentation in
1927 isar-ref manual. Removed locales meta_term_syntax and
1928 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1929 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1930 directly in regular applications.
1932 * There is a new syntactic category "float_const" for signed decimal
1933 fractions (e.g. 123.45 or -123.45).
1935 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1936 interface with 'setup' command instead.
1938 * Command 'local_setup' is similar to 'setup', but operates on a local
1941 * The 'axiomatization' command now only works within a global theory
1942 context. INCOMPATIBILITY.
1944 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1945 hypotheses. Sorts required in the course of reasoning need to be
1946 covered by the constraints in the initial statement, completed by the
1947 type instance information of the background theory. Non-trivial sort
1948 hypotheses, which rarely occur in practice, may be specified via
1949 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1951 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1953 The result contains an implicit sort hypotheses as before --
1954 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1957 * Generalized Isar history, with support for linear undo, direct state
1960 * Changed defaults for unify configuration options:
1962 unify_trace_bound = 50 (formerly 25)
1963 unify_search_bound = 60 (formerly 30)
1965 * Different bookkeeping for code equations (INCOMPATIBILITY):
1967 a) On theory merge, the last set of code equations for a particular
1968 constant is taken (in accordance with the policy applied by other
1969 parts of the code generator framework).
1971 b) Code equations stemming from explicit declarations (e.g. code
1972 attribute) gain priority over default code equations stemming
1973 from definition, primrec, fun etc.
1975 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1977 * Unified theorem tables for both code generators. Thus [code
1978 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1980 * Command 'find_consts' searches for constants based on type and name
1983 find_consts "_ => bool"
1985 By default, matching is against subtypes, but it may be restricted to
1986 the whole type. Searching by name is possible. Multiple queries are
1987 conjunctive and queries may be negated by prefixing them with a
1990 find_consts strict: "_ => bool" name: "Int" -"int => int"
1992 * New 'find_theorems' criterion "solves" matches theorems that
1993 directly solve the current goal (modulo higher-order unification).
1995 * Auto solve feature for main theorem statements: whenever a new goal
1996 is stated, "find_theorems solves" is called; any theorems that could
1997 solve the lemma directly are listed as part of the goal state.
1998 Cf. associated options in Proof General Isabelle settings menu,
1999 enabled by default, with reasonable timeout for pathological cases of
2000 higher-order unification.
2003 *** Document preparation ***
2005 * Antiquotation @{lemma} now imitates a regular terminal proof,
2006 demanding keyword 'by' and supporting the full method expression
2007 syntax just like the Isar command 'by'.
2012 * Integrated main parts of former image HOL-Complex with HOL. Entry
2013 points Main and Complex_Main remain as before.
2015 * Logic image HOL-Plain provides a minimal HOL with the most important
2016 tools available (inductive, datatype, primrec, ...). This facilitates
2017 experimentation and tool development. Note that user applications
2018 (and library theories) should never refer to anything below theory
2021 * Logic image HOL-Main stops at theory Main, and thus facilitates
2022 experimentation due to shorter build times.
2024 * Logic image HOL-NSA contains theories of nonstandard analysis which
2025 were previously part of former HOL-Complex. Entry point Hyperreal
2026 remains valid, but theories formerly using Complex_Main should now use
2027 new entry point Hypercomplex.
2029 * Generic ATP manager for Sledgehammer, based on ML threads instead of
2030 Posix processes. Avoids potentially expensive forking of the ML
2031 process. New thread-based implementation also works on non-Unix
2032 platforms (Cygwin). Provers are no longer hardwired, but defined
2033 within the theory via plain ML wrapper functions. Basic Sledgehammer
2034 commands are covered in the isar-ref manual.
2036 * Wrapper scripts for remote SystemOnTPTP service allows to use
2037 sledgehammer without local ATP installation (Vampire etc.). Other
2038 provers may be included via suitable ML wrappers, see also
2039 src/HOL/ATP_Linkup.thy.
2041 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
2044 * The metis method no longer fails because the theorem is too trivial
2045 (contains the empty clause).
2047 * The metis method now fails in the usual manner, rather than raising
2048 an exception, if it determines that it cannot prove the theorem.
2050 * Method "coherent" implements a prover for coherent logic (see also
2051 src/Tools/coherent.ML).
2053 * Constants "undefined" and "default" replace "arbitrary". Usually
2054 "undefined" is the right choice to replace "arbitrary", though
2055 logically there is no difference. INCOMPATIBILITY.
2057 * Command "value" now integrates different evaluation mechanisms. The
2058 result of the first successful evaluation mechanism is printed. In
2059 square brackets a particular named evaluation mechanisms may be
2060 specified (currently, [SML], [code] or [nbe]). See further
2061 src/HOL/ex/Eval_Examples.thy.
2063 * Normalization by evaluation now allows non-leftlinear equations.
2064 Declare with attribute [code nbe].
2066 * Methods "case_tac" and "induct_tac" now refer to the very same rules
2067 as the structured Isar versions "cases" and "induct", cf. the
2068 corresponding "cases" and "induct" attributes. Mutual induction rules
2069 are now presented as a list of individual projections
2070 (e.g. foo_bar.inducts for types foo and bar); the old format with
2071 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
2072 rare situations a different rule is selected --- notably nested tuple
2073 elimination instead of former prod.exhaust: use explicit (case_tac t
2074 rule: prod.exhaust) here.
2076 * Attributes "cases", "induct", "coinduct" support "del" option.
2078 * Removed fact "case_split_thm", which duplicates "case_split".
2080 * The option datatype has been moved to a new theory Option. Renamed
2081 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
2083 * New predicate "strict_mono" classifies strict functions on partial
2084 orders. With strict functions on linear orders, reasoning about
2085 (in)equalities is facilitated by theorems "strict_mono_eq",
2086 "strict_mono_less_eq" and "strict_mono_less".
2088 * Some set operations are now proper qualified constants with
2089 authentic syntax. INCOMPATIBILITY:
2100 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
2103 * Auxiliary class "itself" has disappeared -- classes without any
2104 parameter are treated as expected by the 'class' command.
2106 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
2108 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
2109 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
2111 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
2112 method "approximation". It proves formulas on real values by using
2113 interval arithmetic. In the formulas are also the transcendental
2114 functions sin, cos, tan, atan, ln, exp and the constant pi are
2115 allowed. For examples see
2116 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
2118 * Theory "Reflection" now resides in HOL/Library.
2120 * Entry point to Word library now simply named "Word".
2123 * Made source layout more coherent with logical distribution
2126 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
2127 src/HOL/Library/Code_Message.thy ~> src/HOL/
2128 src/HOL/Library/GCD.thy ~> src/HOL/
2129 src/HOL/Library/Order_Relation.thy ~> src/HOL/
2130 src/HOL/Library/Parity.thy ~> src/HOL/
2131 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
2132 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
2133 src/HOL/Real/Lubs.thy ~> src/HOL/
2134 src/HOL/Real/PReal.thy ~> src/HOL/
2135 src/HOL/Real/Rational.thy ~> src/HOL/
2136 src/HOL/Real/RComplete.thy ~> src/HOL/
2137 src/HOL/Real/RealDef.thy ~> src/HOL/
2138 src/HOL/Real/RealPow.thy ~> src/HOL/
2139 src/HOL/Real/Real.thy ~> src/HOL/
2140 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
2141 src/HOL/Complex/Complex.thy ~> src/HOL/
2142 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
2143 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
2144 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
2145 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
2146 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
2147 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
2148 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
2149 src/HOL/Hyperreal/Log.thy ~> src/HOL/
2150 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
2151 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
2152 src/HOL/Hyperreal/Series.thy ~> src/HOL/
2153 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
2154 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
2155 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
2156 src/HOL/Real/Float ~> src/HOL/Library/
2157 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
2158 src/HOL/Real/RealVector.thy ~> src/HOL/
2160 src/HOL/arith_data.ML ~> src/HOL/Tools
2161 src/HOL/hologic.ML ~> src/HOL/Tools
2162 src/HOL/simpdata.ML ~> src/HOL/Tools
2163 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
2164 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
2165 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
2166 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
2167 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
2168 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
2169 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
2171 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
2172 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
2173 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
2174 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
2175 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
2176 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
2178 * If methods "eval" and "evaluation" encounter a structured proof
2179 state with !!/==>, only the conclusion is evaluated to True (if
2180 possible), avoiding strange error messages.
2182 * Method "sizechange" automates termination proofs using (a
2183 modification of) the size-change principle. Requires SAT solver. See
2184 src/HOL/ex/Termination.thy for examples.
2186 * Simplifier: simproc for let expressions now unfolds if bound
2187 variable occurs at most once in let expression body. INCOMPATIBILITY.
2189 * Method "arith": Linear arithmetic now ignores all inequalities when
2190 fast_arith_neq_limit is exceeded, instead of giving up entirely.
2192 * New attribute "arith" for facts that should always be used
2193 automatically by arithmetic. It is intended to be used locally in
2196 assumes [arith]: "x > 0"
2198 Global usage is discouraged because of possible performance impact.
2200 * New classes "top" and "bot" with corresponding operations "top" and
2201 "bot" in theory Orderings; instantiation of class "complete_lattice"
2202 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
2204 * Changed definition lemma "less_fun_def" in order to provide an
2205 instance for preorders on functions; use lemma "less_le" instead.
2208 * Theory Orderings: class "wellorder" moved here, with explicit
2209 induction rule "less_induct" as assumption. For instantiation of
2210 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
2213 * Theory Orderings: added class "preorder" as superclass of "order".
2214 INCOMPATIBILITY: Instantiation proofs for order, linorder
2215 etc. slightly changed. Some theorems named order_class.* now named
2218 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
2221 * Theory Finite_Set: added a new fold combinator of type
2223 ('a => 'b => 'b) => 'b => 'a set => 'b
2225 Occasionally this is more convenient than the old fold combinator
2226 which is now defined in terms of the new one and renamed to
2229 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
2230 and "ring_simps" have been replaced by "algebra_simps" (which can be
2231 extended with further lemmas!). At the moment both still exist but
2232 the former will disappear at some point.
2234 * Theory Power: Lemma power_Suc is now declared as a simp rule in
2235 class recpower. Type-specific simp rules for various recpower types
2236 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
2238 rat_power_0 -> power_0
2239 rat_power_Suc -> power_Suc
2240 realpow_0 -> power_0
2241 realpow_Suc -> power_Suc
2242 complexpow_0 -> power_0
2243 complexpow_Suc -> power_Suc
2244 power_poly_0 -> power_0
2245 power_poly_Suc -> power_Suc
2247 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
2248 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
2249 dvd has been generalized to class comm_semiring_1. Likewise a bunch
2250 of lemmas from Divides has been generalized from nat to class
2251 semiring_div. INCOMPATIBILITY. This involves the following theorem
2252 renames resulting from duplicate elimination:
2254 dvd_def_mod ~> dvd_eq_mod_eq_0
2255 zero_dvd_iff ~> dvd_0_left_iff
2256 dvd_0 ~> dvd_0_right
2257 DIVISION_BY_ZERO_DIV ~> div_by_0
2258 DIVISION_BY_ZERO_MOD ~> mod_by_0
2259 mult_div ~> div_mult_self2_is_id
2260 mult_mod ~> mod_mult_self2_is_0
2262 * Theory IntDiv: removed many lemmas that are instances of class-based
2263 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
2264 rename old lemmas as follows:
2266 dvd_diff -> nat_dvd_diff
2267 dvd_zminus_iff -> dvd_minus_iff
2268 mod_add1_eq -> mod_add_eq
2269 mod_mult1_eq -> mod_mult_right_eq
2270 mod_mult1_eq' -> mod_mult_left_eq
2271 mod_mult_distrib_mod -> mod_mult_eq
2272 nat_mod_add_left_eq -> mod_add_left_eq
2273 nat_mod_add_right_eq -> mod_add_right_eq
2274 nat_mod_div_trivial -> mod_div_trivial
2275 nat_mod_mod_trivial -> mod_mod_trivial
2276 zdiv_zadd_self1 -> div_add_self1
2277 zdiv_zadd_self2 -> div_add_self2
2278 zdiv_zmult_self1 -> div_mult_self2_is_id
2279 zdiv_zmult_self2 -> div_mult_self1_is_id
2280 zdvd_triv_left -> dvd_triv_left
2281 zdvd_triv_right -> dvd_triv_right
2282 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
2283 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
2284 zmod_zadd_left_eq -> mod_add_left_eq
2285 zmod_zadd_right_eq -> mod_add_right_eq
2286 zmod_zadd_self1 -> mod_add_self1
2287 zmod_zadd_self2 -> mod_add_self2
2288 zmod_zadd1_eq -> mod_add_eq
2289 zmod_zdiff1_eq -> mod_diff_eq
2290 zmod_zdvd_zmod -> mod_mod_cancel
2291 zmod_zmod_cancel -> mod_mod_cancel
2292 zmod_zmult_self1 -> mod_mult_self2_is_0
2293 zmod_zmult_self2 -> mod_mult_self1_is_0
2296 zdvd_abs1 -> abs_dvd_iff
2297 zdvd_abs2 -> dvd_abs_iff
2298 zdvd_refl -> dvd_refl
2299 zdvd_trans -> dvd_trans
2300 zdvd_zadd -> dvd_add
2301 zdvd_zdiff -> dvd_diff
2302 zdvd_zminus_iff -> dvd_minus_iff
2303 zdvd_zminus2_iff -> minus_dvd_iff
2304 zdvd_zmultD -> dvd_mult_right
2305 zdvd_zmultD2 -> dvd_mult_left
2306 zdvd_zmult_mono -> mult_dvd_mono
2307 zdvd_0_right -> dvd_0_right
2308 zdvd_0_left -> dvd_0_left_iff
2309 zdvd_1_left -> one_dvd
2310 zminus_dvd_iff -> minus_dvd_iff
2312 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
2314 * The real numbers offer decimal input syntax: 12.34 is translated
2315 into 1234/10^2. This translation is not reversed upon output.
2317 * Theory Library/Polynomial defines an abstract type 'a poly of
2318 univariate polynomials with coefficients of type 'a. In addition to
2319 the standard ring operations, it also supports div and mod. Code
2320 generation is also supported, using list-style constructors.
2322 * Theory Library/Inner_Product defines a class of real_inner for real
2323 inner product spaces, with an overloaded operation inner :: 'a => 'a
2324 => real. Class real_inner is a subclass of real_normed_vector from
2327 * Theory Library/Product_Vector provides instances for the product
2328 type 'a * 'b of several classes from RealVector and Inner_Product.
2329 Definitions of addition, subtraction, scalar multiplication, norms,
2330 and inner products are included.
2332 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
2333 addition to the field operations, numerals and case syntax are also
2336 * Theory Library/Diagonalize provides constructive version of Cantor's
2337 first diagonalization argument.
2339 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
2340 zlcm (for int); carried together from various gcd/lcm developements in
2341 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
2342 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
2343 may recover tupled syntax as follows:
2345 hide (open) const gcd
2346 abbreviation gcd where
2347 "gcd == (%(a, b). GCD.gcd a b)"
2349 GCD.gcd ("gcd '(_, _')")
2351 The same works for lcm, zgcd, zlcm.
2353 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
2354 instantiations for algebraic structures. Removed some duplicate
2355 theorems. Changes in simp rules. INCOMPATIBILITY.
2357 * ML antiquotation @{code} takes a constant as argument and generates
2358 corresponding code in background and inserts name of the corresponding
2359 resulting ML value/function/datatype constructor binding in place.
2360 All occurrences of @{code} with a single ML block are generated
2361 simultaneously. Provides a generic and safe interface for
2362 instrumentalizing code generation. See
2363 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
2364 In future you ought to refrain from ad-hoc compiling generated SML
2365 code on the ML toplevel. Note that (for technical reasons) @{code}
2366 cannot refer to constants for which user-defined serializations are
2367 set. Refer to the corresponding ML counterpart directly in that
2370 * Command 'rep_datatype': instead of theorem names the command now
2371 takes a list of terms denoting the constructors of the type to be
2372 represented as datatype. The characteristic theorems have to be
2373 proven. INCOMPATIBILITY. Also observe that the following theorems
2374 have disappeared in favour of existing ones:
2376 unit_induct ~> unit.induct
2377 prod_induct ~> prod.induct
2378 sum_induct ~> sum.induct
2379 Suc_Suc_eq ~> nat.inject
2380 Suc_not_Zero Zero_not_Suc ~> nat.distinct
2385 * New locales for orders and lattices where the equivalence relation
2386 is not restricted to equality. INCOMPATIBILITY: all order and lattice
2387 locales use a record structure with field eq for the equivalence.
2389 * New theory of factorial domains.
2391 * Units_l_inv and Units_r_inv are now simp rules by default.
2392 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
2393 and/or r_inv will now also require deletion of these lemmas.
2395 * Renamed the following theorems, INCOMPATIBILITY:
2397 UpperD ~> Upper_memD
2398 LowerD ~> Lower_memD
2399 least_carrier ~> least_closed
2400 greatest_carrier ~> greatest_closed
2401 greatest_Lower_above ~> greatest_Lower_below
2402 one_zero ~> carrier_one_zero
2403 one_not_zero ~> carrier_one_not_zero (collision with assumption)
2408 * Nominal datatypes can now contain type-variables.
2410 * Commands 'nominal_inductive' and 'equivariance' work with local
2413 * Nominal primrec can now works with local theory targets and its
2414 specification syntax now conforms to the general format as seen in
2417 * Method "perm_simp" honours the standard simplifier attributes
2418 (no_asm), (no_asm_use) etc.
2420 * The new predicate #* is defined like freshness, except that on the
2421 left hand side can be a set or list of atoms.
2423 * Experimental command 'nominal_inductive2' derives strong induction
2424 principles for inductive definitions. In contrast to
2425 'nominal_inductive', which can only deal with a fixed number of
2426 binders, it can deal with arbitrary expressions standing for sets of
2427 atoms to be avoided. The only inductive definition we have at the
2428 moment that needs this generalisation is the typing rule for Lets in
2431 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
2432 -----------------------------------------------------------------
2433 Gamma |- Let x be t1 in t2 : T2
2435 In this rule one wants to avoid all the binders that are introduced by
2436 "close Gamma T1". We are looking for other examples where this
2437 feature might be useful. Please let us know.
2442 * Reimplemented the simplification procedure for proving continuity
2443 subgoals. The new simproc is extensible; users can declare additional
2444 continuity introduction rules with the attribute [cont2cont].
2446 * The continuity simproc now uses a different introduction rule for
2447 solving continuity subgoals on terms with lambda abstractions. In
2448 some rare cases the new simproc may fail to solve subgoals that the
2449 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
2450 Potential INCOMPATIBILITY.
2452 * Command 'fixrec': specification syntax now conforms to the general
2453 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
2454 examples. INCOMPATIBILITY.
2459 * Proof of Zorn's Lemma for partial orders.
2464 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
2465 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
2466 depends on multithreading, so timouts will not work before Poly/ML
2469 * High-level support for concurrent ML programming, see
2470 src/Pure/Cuncurrent. The data-oriented model of "future values" is
2471 particularly convenient to organize independent functional
2472 computations. The concept of "synchronized variables" provides a
2473 higher-order interface for components with shared state, avoiding the
2474 delicate details of mutexes and condition variables. (Requires
2475 Poly/ML 5.2.1 or later.)
2477 * ML bindings produced via Isar commands are stored within the Isar
2478 context (theory or proof). Consequently, commands like 'use' and 'ML'
2479 become thread-safe and work with undo as expected (concerning
2480 top-level bindings, not side-effects on global references).
2481 INCOMPATIBILITY, need to provide proper Isar context when invoking the
2482 compiler at runtime; really global bindings need to be given outside a
2483 theory. (Requires Poly/ML 5.2 or later.)
2485 * Command 'ML_prf' is analogous to 'ML' but works within a proof
2486 context. Top-level ML bindings are stored within the proof context in
2487 a purely sequential fashion, disregarding the nested proof structure.
2488 ML bindings introduced by 'ML_prf' are discarded at the end of the
2489 proof. (Requires Poly/ML 5.2 or later.)
2491 * Simplified ML attribute and method setup, cf. functions Attrib.setup
2492 and Method.setup, as well as Isar commands 'attribute_setup' and
2493 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
2494 existing code accordingly, or use plain 'setup' together with old
2497 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
2498 to 'a -> thm, while results are always tagged with an authentic oracle
2499 name. The Isar command 'oracle' is now polymorphic, no argument type
2500 is specified. INCOMPATIBILITY, need to simplify existing oracle code
2501 accordingly. Note that extra performance may be gained by producing
2502 the cterm carefully, avoiding slow Thm.cterm_of.
2504 * Simplified interface for defining document antiquotations via
2505 ThyOutput.antiquotation, ThyOutput.output, and optionally
2506 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
2507 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
2510 * More systematic treatment of long names, abstract name bindings, and
2511 name space operations. Basic operations on qualified names have been
2512 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
2513 Long_Name.append. Old type bstring has been mostly replaced by
2514 abstract type binding (see structure Binding), which supports precise
2515 qualification by packages and local theory targets, as well as proper
2516 tracking of source positions. INCOMPATIBILITY, need to wrap old
2517 bstring values into Binding.name, or better pass through abstract
2518 bindings everywhere. See further src/Pure/General/long_name.ML,
2519 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
2521 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
2522 LocalTheory.note etc.) now refer to the *full* internal name, not the
2523 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
2525 * Disposed old type and term read functions (Sign.read_def_typ,
2526 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
2527 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
2528 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
2529 Syntax.read_term_global etc.; see also OldGoals.read_term as last
2530 resort for legacy applications.
2532 * Disposed old declarations, tactics, tactic combinators that refer to
2533 the simpset or claset of an implicit theory (such as Addsimps,
2534 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
2535 embedded ML text, or local_simpset_of with a proper context passed as
2536 explicit runtime argument.
2538 * Rules and tactics that read instantiations (read_instantiate,
2539 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
2540 context, which is required for parsing and type-checking. Moreover,
2541 the variables are specified as plain indexnames, not string encodings
2542 thereof. INCOMPATIBILITY.
2544 * Generic Toplevel.add_hook interface allows to analyze the result of
2545 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
2546 for theorem dependency output of transactions resulting in a new
2549 * ML antiquotations: block-structured compilation context indicated by
2550 \<lbrace> ... \<rbrace>; additional antiquotation forms:
2552 @{binding name} - basic name binding
2553 @{let ?pat = term} - term abbreviation (HO matching)
2554 @{note name = fact} - fact abbreviation
2555 @{thm fact} - singleton fact (with attributes)
2556 @{thms fact} - general fact (with attributes)
2557 @{lemma prop by method} - singleton goal
2558 @{lemma prop by meth1 meth2} - singleton goal
2559 @{lemma prop1 ... propN by method} - general goal
2560 @{lemma prop1 ... propN by meth1 meth2} - general goal
2561 @{lemma (open) ...} - open derivation
2566 * The Isabelle "emacs" tool provides a specific interface to invoke
2567 Proof General / Emacs, with more explicit failure if that is not
2568 installed (the old isabelle-interface script silently falls back on
2569 isabelle-process). The PROOFGENERAL_HOME setting determines the
2570 installation location of the Proof General distribution.
2572 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
2573 the Isabelle process into a JVM/Scala application. See
2574 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
2575 process wrapper has been discontinued.)
2577 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
2579 * Various status messages (with exact source position information) are
2580 emitted, if proper markup print mode is enabled. This allows
2581 user-interface components to provide detailed feedback on internal
2586 New in Isabelle2008 (June 2008)
2587 -------------------------------
2591 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
2592 and updated, with formally checked references as hyperlinks.
2594 * Theory loader: use_thy (and similar operations) no longer set the
2595 implicit ML context, which was occasionally hard to predict and in
2596 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
2597 provides a proper context already.
2599 * Theory loader: old-style ML proof scripts being *attached* to a thy
2600 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
2601 'use' within a theory file will do the job.
2603 * Name space merge now observes canonical order, i.e. the second space
2604 is inserted into the first one, while existing entries in the first
2605 space take precedence. INCOMPATIBILITY in rare situations, may try to
2606 swap theory imports.
2608 * Syntax: symbol \<chi> is now considered a letter. Potential
2609 INCOMPATIBILITY in identifier syntax etc.
2611 * Outer syntax: string tokens no longer admit escaped white space,
2612 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
2613 white space without escapes.
2615 * Outer syntax: string tokens may contain arbitrary character codes
2616 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
2622 * Context-dependent token translations. Default setup reverts locally
2623 fixed variables, and adds hilite markup for undeclared frees.
2625 * Unused theorems can be found using the new command 'unused_thms'.
2626 There are three ways of invoking it:
2629 Only finds unused theorems in the current theory.
2631 (2) unused_thms thy_1 ... thy_n -
2632 Finds unused theorems in the current theory and all of its ancestors,
2633 excluding the theories thy_1 ... thy_n and all of their ancestors.
2635 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
2636 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
2637 their ancestors, excluding the theories thy_1 ... thy_n and all of
2640 In order to increase the readability of the list produced by
2641 unused_thms, theorems that have been created by a particular instance
2642 of a theory command such as 'inductive' or 'function' are considered
2643 to belong to the same "group", meaning that if at least one theorem in
2644 this group is used, the other theorems in the same group are no longer
2645 reported as unused. Moreover, if all theorems in the group are
2646 unused, only one theorem in the group is displayed.
2648 Note that proof objects have to be switched on in order for
2649 unused_thms to work properly (i.e. !proofs must be >= 1, which is
2650 usually the case when using Proof General with the default settings).
2652 * Authentic naming of facts disallows ad-hoc overwriting of previous
2653 theorems within the same name space. INCOMPATIBILITY, need to remove
2654 duplicate fact bindings, or even accidental fact duplications. Note
2655 that tools may maintain dynamically scoped facts systematically, using
2656 PureThy.add_thms_dynamic.
2658 * Command 'hide' now allows to hide from "fact" name space as well.
2660 * Eliminated destructive theorem database, simpset, claset, and
2661 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
2662 update of theories within ML code.
2664 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2665 INCOMPATIBILITY, object-logics depending on former Pure require
2666 additional setup PureThy.old_appl_syntax_setup; object-logics
2667 depending on former CPure need to refer to Pure.
2669 * Commands 'use' and 'ML' are now purely functional, operating on
2670 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2671 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2674 * Command 'setup': discontinued implicit version with ML reference.
2676 * Instantiation target allows for simultaneous specification of class
2677 instance operations together with an instantiation proof.
2678 Type-checking phase allows to refer to class operations uniformly.
2679 See src/HOL/Complex/Complex.thy for an Isar example and
2680 src/HOL/Library/Eval.thy for an ML example.
2682 * Indexing of literal facts: be more serious about including only
2683 facts from the visible specification/proof context, but not the
2684 background context (locale etc.). Affects `prop` notation and method
2685 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2688 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2689 "(open)" option, which used to expose internal bound variables to the
2692 * Isar statements: removed obsolete case "rule_context".
2693 INCOMPATIBILITY, better use explicit fixes/assumes.
2695 * Locale proofs: default proof step now includes 'unfold_locales';
2696 hence 'proof' without argument may be used to unfold locale
2700 *** Document preparation ***
2702 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2703 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2704 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2705 spot); renamed link color from "darkblue" to "linkcolor" (default
2706 value unchanged, can be redefined via \definecolor); no longer sets
2707 "a4paper" option (unnecessary or even intrusive).
2709 * Antiquotation @{lemma A method} proves proposition A by the given
2710 method (either a method name or a method name plus (optional) method
2711 arguments in parentheses) and prints A just like @{prop A}.
2716 * New primrec package. Specification syntax conforms in style to
2717 definition/function/.... No separate induction rule is provided. The
2718 "primrec" command distinguishes old-style and new-style specifications
2719 by syntax. The former primrec package is now named OldPrimrecPackage.
2720 When adjusting theories, beware: constants stemming from new-style
2721 primrec specifications have authentic syntax.
2723 * Metis prover is now an order of magnitude faster, and also works
2724 with multithreading.
2726 * Metis: the maximum number of clauses that can be produced from a
2727 theorem is now given by the attribute max_clauses. Theorems that
2728 exceed this number are ignored, with a warning printed.
2730 * Sledgehammer no longer produces structured proofs by default. To
2731 enable, declare [[sledgehammer_full = true]]. Attributes
2732 reconstruction_modulus, reconstruction_sorts renamed
2733 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2735 * Method "induct_scheme" derives user-specified induction rules
2736 from well-founded induction and completeness of patterns. This factors
2737 out some operations that are done internally by the function package
2738 and makes them available separately. See
2739 src/HOL/ex/Induction_Scheme.thy for examples.
2741 * More flexible generation of measure functions for termination
2742 proofs: Measure functions can be declared by proving a rule of the
2743 form "is_measure f" and giving it the [measure_function] attribute.
2744 The "is_measure" predicate is logically meaningless (always true), and
2745 just guides the heuristic. To find suitable measure functions, the
2746 termination prover sets up the goal "is_measure ?f" of the appropriate
2747 type and generates all solutions by prolog-style backwards proof using
2750 This setup also deals with rules like
2752 "is_measure f ==> is_measure (list_size f)"
2754 which accommodates nested datatypes that recurse through lists.
2755 Similar rules are predeclared for products and option types.
2757 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2761 - Definitions of overloaded constants on sets have to be replaced by
2762 definitions on => and bool.
2764 - Some definitions of overloaded operators on sets can now be proved
2765 using the definitions of the operators on => and bool. Therefore,
2766 the following theorems have been renamed:
2768 subset_def -> subset_eq
2769 psubset_def -> psubset_eq
2770 set_diff_def -> set_diff_eq
2771 Compl_def -> Compl_eq
2772 Sup_set_def -> Sup_set_eq
2773 Inf_set_def -> Inf_set_eq
2774 sup_set_def -> sup_set_eq
2775 inf_set_def -> inf_set_eq
2777 - Due to the incompleteness of the HO unification algorithm, some
2778 rules such as subst may require manual instantiation, if some of
2779 the unknowns in the rule is a set.
2781 - Higher order unification and forward proofs:
2784 have "P (S::'a set)" <...>
2785 then have "EX S. P S" ..
2787 no longer works (due to the incompleteness of the HO unification
2788 algorithm) and must be replaced by the pattern
2795 - Calculational reasoning with subst (or similar rules):
2798 have "P (S::'a set)" <...>
2799 also have "S = T" <...>
2800 finally have "P T" .
2802 no longer works (for similar reasons as the previous example) and
2803 must be replaced by something like
2805 have "P (S::'a set)" <...>
2806 moreover have "S = T" <...>
2807 ultimately have "P T" by simp
2809 - Tactics or packages written in ML code:
2810 Code performing pattern matching on types via
2812 Type ("set", [T]) => ...
2814 must be rewritten. Moreover, functions like strip_type or
2815 binder_types no longer return the right value when applied to a
2818 T1 => ... => Tn => U => bool
2822 T1 => ... => Tn => U set
2824 * Merged theories Wellfounded_Recursion, Accessible_Part and
2825 Wellfounded_Relations to theory Wellfounded.
2827 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2829 * Class finite no longer treats UNIV as class parameter. Use class
2830 enum from theory Library/Enum instead to achieve a similar effect.
2833 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2834 and "Cons". INCOMPATIBILITY.
2836 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2837 Potential INCOMPATIBILITY.
2839 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2840 injective_fst_snd removed, use split_eta and prod_eqI instead.
2841 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2843 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2844 the same name in theory Orderings:
2854 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2855 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2856 and different variable names.
2858 * Library/Option_ord.thy: Canonical order on option type.
2860 * Library/RBT.thy: Red-black trees, an efficient implementation of
2863 * Library/Countable.thy: Type class for countable types.
2865 * Theory Int: The representation of numerals has changed. The infix
2866 operator BIT and the bit datatype with constructors B0 and B1 have
2867 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2868 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2869 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2872 * Theory Nat: definition of <= and < on natural numbers no longer
2873 depend on well-founded relations. INCOMPATIBILITY. Definitions
2874 le_def and less_def have disappeared. Consider lemmas not_less
2875 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2877 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2878 (whose purpose mainly is for various fold_set functionals) have been
2879 abandoned in favor of the existing algebraic classes
2880 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2881 lower_semilattice (resp. upper_semilattice) and linorder.
2884 * Theory Transitive_Closure: induct and cases rules now declare proper
2885 case_names ("base" and "step"). INCOMPATIBILITY.
2887 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2888 lattices. The form set-specific version is available as
2889 Inductive.lfp_ordinal_induct_set.
2891 * Renamed theorems "power.simps" to "power_int.simps".
2894 * Class semiring_div provides basic abstract properties of semirings
2895 with division and modulo operations. Subsumes former class dvd_mod.
2897 * Merged theories IntDef, Numeral and IntArith into unified theory
2898 Int. INCOMPATIBILITY.
2900 * Theory Library/Code_Index: type "index" now represents natural
2901 numbers rather than integers. INCOMPATIBILITY.
2903 * New class "uminus" with operation "uminus" (split of from class
2904 "minus" which now only has operation "minus", binary).
2907 * Constants "card", "internal_split", "option_map" now with authentic
2908 syntax. INCOMPATIBILITY.
2910 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2911 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2912 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2913 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2914 Sup_set_def, le_def, less_def, option_map_def now with object
2915 equality. INCOMPATIBILITY.
2917 * Records. Removed K_record, and replaced it by pure lambda term
2918 %x. c. The simplifier setup is now more robust against eta expansion.
2919 INCOMPATIBILITY: in cases explicitly referring to K_record.
2921 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2923 * Library/ListVector: new theory of arithmetic vector operations.
2925 * Library/Order_Relation: new theory of various orderings as sets of
2926 pairs. Defines preorders, partial orders, linear orders and
2927 well-orders on sets and on types.
2932 * Renamed some theories to allow to loading both ZF and HOL in the
2935 Datatype -> Datatype_ZF
2936 Inductive -> Inductive_ZF
2943 INCOMPATIBILITY: ZF theories that import individual theories below
2944 Main might need to be adapted. Regular theory Main is still
2945 available, as trivial extension of Main_ZF.
2950 * ML within Isar: antiquotation @{const name} or @{const
2951 name(typargs)} produces statically-checked Const term.
2953 * Functor NamedThmsFun: data is available to the user as dynamic fact
2954 (of the same name). Removed obsolete print command.
2956 * Removed obsolete "use_legacy_bindings" function.
2958 * The ``print mode'' is now a thread-local value derived from a global
2959 template (the former print_mode reference), thus access becomes
2960 non-critical. The global print_mode reference is for session
2961 management only; user-code should use print_mode_value,
2962 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2964 * Functions system/system_out provide a robust way to invoke external
2965 shell commands, with propagation of interrupts (requires Poly/ML
2966 5.2.1). Do not use OS.Process.system etc. from the basis library!
2971 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2972 in accordance with Proof General 3.7, which prefers GNU emacs.
2974 * isatool tty runs Isabelle process with plain tty interaction;
2975 optional line editor may be specified via ISABELLE_LINE_EDITOR
2976 setting, the default settings attempt to locate "ledit" and "rlwrap".
2978 * isatool browser now works with Cygwin as well, using general
2979 "javapath" function defined in Isabelle process environment.
2981 * YXML notation provides a simple and efficient alternative to
2982 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2983 isatool yxml as described in the Isabelle system manual.
2985 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2986 provides general wrapper for managing an Isabelle process in a robust
2987 fashion, with ``cooked'' output from stdin/stderr.
2989 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2990 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2992 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2993 way of changing the user's settings is via
2994 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2997 * Multithreading.max_threads := 0 refers to the number of actual CPU
2998 cores of the underlying machine, which is a good starting point for
2999 optimal performance tuning. The corresponding usedir option -M allows
3000 "max" as an alias for "0". WARNING: does not work on certain versions
3001 of Mac OS (with Poly/ML 5.1).
3003 * isabelle-process: non-ML sessions are run with "nice", to reduce the
3004 adverse effect of Isabelle flooding interactive front-ends (notably
3005 ProofGeneral / XEmacs).
3009 New in Isabelle2007 (November 2007)
3010 -----------------------------------
3014 * More uniform information about legacy features, notably a
3015 warning/error of "Legacy feature: ...", depending on the state of the
3016 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
3017 legacy features will disappear eventually.
3019 * Theory syntax: the header format ``theory A = B + C:'' has been
3020 discontinued in favour of ``theory A imports B C begin''. Use isatool
3021 fixheaders to convert existing theory files. INCOMPATIBILITY.
3023 * Theory syntax: the old non-Isar theory file format has been
3024 discontinued altogether. Note that ML proof scripts may still be used
3025 with Isar theories; migration is usually quite simple with the ML
3026 function use_legacy_bindings. INCOMPATIBILITY.
3028 * Theory syntax: some popular names (e.g. 'class', 'declaration',
3029 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
3032 * Theory loader: be more serious about observing the static theory
3033 header specifications (including optional directories), but not the
3034 accidental file locations of previously successful loads. The strict
3035 update policy of former update_thy is now already performed by
3036 use_thy, so the former has been removed; use_thys updates several
3037 theories simultaneously, just as 'imports' within a theory header
3038 specification, but without merging the results. Potential
3039 INCOMPATIBILITY: may need to refine theory headers and commands
3040 ROOT.ML which depend on load order.
3042 * Theory loader: optional support for content-based file
3043 identification, instead of the traditional scheme of full physical
3044 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
3045 (cf. the system manual). The new scheme allows to work with
3046 non-finished theories in persistent session images, such that source
3047 files may be moved later on without requiring reloads.
3049 * Theory loader: old-style ML proof scripts being *attached* to a thy
3050 file (with the same base name as the theory) are considered a legacy
3051 feature, which will disappear eventually. Even now, the theory loader
3052 no longer maintains dependencies on such files.
3054 * Syntax: the scope for resolving ambiguities via type-inference is
3055 now limited to individual terms, instead of whole simultaneous
3056 specifications as before. This greatly reduces the complexity of the
3057 syntax module and improves flexibility by separating parsing and
3058 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
3059 'fixes' etc.) are required in rare situations.
3061 * Syntax: constants introduced by new-style packages ('definition',
3062 'abbreviation' etc.) are passed through the syntax module in
3063 ``authentic mode''. This means that associated mixfix annotations
3064 really stick to such constants, independently of potential name space
3065 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
3066 trees are represented slightly differently, may need to adapt syntax
3067 translations accordingly. Use CONST marker in 'translations' and
3068 @{const_syntax} antiquotation in 'parse_translation' etc.
3070 * Legacy goal package: reduced interface to the bare minimum required
3071 to keep existing proof scripts running. Most other user-level
3072 functions are now part of the OldGoals structure, which is *not* open
3073 by default (consider isatool expandshort before open OldGoals).
3074 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
3075 these tend to cause confusion about the actual goal (!) context being
3076 used here, which is not necessarily the same as the_context().
3078 * Command 'find_theorems': supports "*" wild-card in "name:"
3079 criterion; "with_dups" option. Certain ProofGeneral versions might
3080 support a specific search form (see ProofGeneral/CHANGES).
3082 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
3083 by default, which means that "prems" (and also "fixed variables") are
3084 suppressed from proof state output. Note that the ProofGeneral
3085 settings mechanism allows to change and save options persistently, but
3086 older versions of Isabelle will fail to start up if a negative prems
3089 * Local theory targets may be specified by non-nested blocks of
3090 ``context/locale/class ... begin'' followed by ``end''. The body may
3091 contain definitions, theorems etc., including any derived mechanism
3092 that has been implemented on top of these primitives. This concept
3093 generalizes the existing ``theorem (in ...)'' towards more versatility
3096 * Proof General interface: proper undo of final 'end' command;
3097 discontinued Isabelle/classic mode (ML proof scripts).
3100 *** Document preparation ***
3102 * Added antiquotation @{theory name} which prints the given name,
3103 after checking that it refers to a valid ancestor theory in the
3106 * Added antiquotations @{ML_type text} and @{ML_struct text} which
3107 check the given source text as ML type/structure, printing verbatim.
3109 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
3110 "c args == rhs" given in the current context. (Any number of
3111 arguments may be given on the LHS.)
3116 * The 'class' package offers a combination of axclass and locale to
3117 achieve Haskell-like type classes in Isabelle. Definitions and
3118 theorems within a class context produce both relative results (with
3119 implicit parameters according to the locale context), and polymorphic
3120 constants with qualified polymorphism (according to the class
3121 context). Within the body context of a 'class' target, a separate
3122 syntax layer ("user space type system") takes care of converting
3123 between global polymorphic consts and internal locale representation.
3124 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
3125 "isatool doc classes" provides a tutorial.
3127 * Generic code generator framework allows to generate executable
3128 code for ML and Haskell (including Isabelle classes). A short usage
3131 internal compilation:
3132 export_code <list of constants (term syntax)> in SML
3133 writing SML code to a file:
3134 export_code <list of constants (term syntax)> in SML <filename>
3135 writing OCaml code to a file:
3136 export_code <list of constants (term syntax)> in OCaml <filename>
3137 writing Haskell code to a bunch of files:
3138 export_code <list of constants (term syntax)> in Haskell <filename>
3140 evaluating closed propositions to True/False using code generation:
3143 Reasonable default setup of framework in HOL.
3145 Theorem attributs for selecting and transforming function equations theorems:
3147 [code fun]: select a theorem as function equation for a specific constant
3148 [code fun del]: deselect a theorem as function equation for a specific constant
3149 [code inline]: select an equation theorem for unfolding (inlining) in place
3150 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
3152 User-defined serializations (target in {SML, OCaml, Haskell}):
3154 code_const <and-list of constants (term syntax)>
3155 {(target) <and-list of const target syntax>}+
3157 code_type <and-list of type constructors>
3158 {(target) <and-list of type target syntax>}+
3160 code_instance <and-list of instances>
3162 where instance ::= <type constructor> :: <class>
3164 code_class <and_list of classes>
3165 {(target) <and-list of class target syntax>}+
3166 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
3168 code_instance and code_class only are effective to target Haskell.
3170 For example usage see src/HOL/ex/Codegenerator.thy and
3171 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
3172 generation from Isabelle/HOL theories is available via "isatool doc
3175 * Code generator: consts in 'consts_code' Isar commands are now
3176 referred to by usual term syntax (including optional type
3179 * Command 'no_translations' removes translation rules from theory
3182 * Overloaded definitions are now actually checked for acyclic
3183 dependencies. The overloading scheme is slightly more general than
3184 that of Haskell98, although Isabelle does not demand an exact
3185 correspondence to type class and instance declarations.
3186 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
3187 exotic versions of overloading -- at the discretion of the user!
3189 Polymorphic constants are represented via type arguments, i.e. the
3190 instantiation that matches an instance against the most general
3191 declaration given in the signature. For example, with the declaration
3192 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
3193 as c(nat). Overloading is essentially simultaneous structural
3194 recursion over such type arguments. Incomplete specification patterns
3195 impose global constraints on all occurrences, e.g. c('a * 'a) on the
3196 LHS means that more general c('a * 'b) will be disallowed on any RHS.
3197 Command 'print_theory' outputs the normalized system of recursive
3198 equations, see section "definitions".
3200 * Configuration options are maintained within the theory or proof
3201 context (with name and type bool/int/string), providing a very simple
3202 interface to a poor-man's version of general context data. Tools may
3203 declare options in ML (e.g. using Attrib.config_int) and then refer to
3204 these values using Config.get etc. Users may change options via an
3205 associated attribute of the same name. This form of context
3206 declaration works particularly well with commands 'declare' or
3207 'using', for example ``declare [[foo = 42]]''. Thus it has become
3208 very easy to avoid global references, which would not observe Isar
3209 toplevel undo/redo and fail to work with multithreading.
3211 Various global ML references of Pure and HOL have been turned into
3212 configuration options:
3214 Unify.search_bound unify_search_bound
3215 Unify.trace_bound unify_trace_bound
3216 Unify.trace_simp unify_trace_simp
3217 Unify.trace_types unify_trace_types
3218 Simplifier.simp_depth_limit simp_depth_limit
3219 Blast.depth_limit blast_depth_limit
3220 DatatypeProp.dtK datatype_distinctness_limit
3221 fast_arith_neq_limit fast_arith_neq_limit
3222 fast_arith_split_limit fast_arith_split_limit
3224 * Named collections of theorems may be easily installed as context
3225 data using the functor NamedThmsFun (see also
3226 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
3227 attributes; there is also a toplevel print command. This facility is
3228 just a common case of general context data, which is the preferred way
3229 for anything more complex than just a list of facts in canonical
3232 * Isar: command 'declaration' augments a local theory by generic
3233 declaration functions written in ML. This enables arbitrary content
3234 being added to the context, depending on a morphism that tells the
3235 difference of the original declaration context wrt. the application
3236 context encountered later on.
3238 * Isar: proper interfaces for simplification procedures. Command
3239 'simproc_setup' declares named simprocs (with match patterns, and body
3240 text in ML). Attribute "simproc" adds/deletes simprocs in the current
3241 context. ML antiquotation @{simproc name} retrieves named simprocs.
3243 * Isar: an extra pair of brackets around attribute declarations
3244 abbreviates a theorem reference involving an internal dummy fact,
3245 which will be ignored later --- only the effect of the attribute on
3246 the background context will persist. This form of in-place
3247 declarations is particularly useful with commands like 'declare' and
3248 'using', for example ``have A using [[simproc a]] by simp''.
3250 * Isar: method "assumption" (and implicit closing of subproofs) now
3251 takes simple non-atomic goal assumptions into account: after applying
3252 an assumption as a rule the resulting subgoals are solved by atomic
3253 assumption steps. This is particularly useful to finish 'obtain'
3254 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
3255 without referring to the original premise "!!x. P x ==> thesis" in the
3256 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
3259 * Isar: implicit use of prems from the Isar proof context is
3260 considered a legacy feature. Common applications like ``have A .''
3261 may be replaced by ``have A by fact'' or ``note `A`''. In general,
3262 referencing facts explicitly here improves readability and
3263 maintainability of proof texts.
3265 * Isar: improper proof element 'guess' is like 'obtain', but derives
3266 the obtained context from the course of reasoning! For example:
3268 assume "EX x y. A x & B y" -- "any previous fact"
3269 then guess x and y by clarify
3271 This technique is potentially adventurous, depending on the facts and
3272 proof tools being involved here.
3274 * Isar: known facts from the proof context may be specified as literal
3275 propositions, using ASCII back-quote syntax. This works wherever
3276 named facts used to be allowed so far, in proof commands, proof
3277 methods, attributes etc. Literal facts are retrieved from the context
3278 according to unification of type and term parameters. For example,
3279 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
3280 theorems in the current context, then these are valid literal facts:
3281 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
3283 There is also a proof method "fact" which does the same composition
3284 for explicit goal states, e.g. the following proof texts coincide with
3285 certain special cases of literal facts:
3287 have "A" by fact == note `A`
3288 have "A ==> B" by fact == note `A ==> B`
3289 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
3290 have "P a ==> Q a" by fact == note `P a ==> Q a`
3292 * Isar: ":" (colon) is no longer a symbolic identifier character in
3293 outer syntax. Thus symbolic identifiers may be used without
3294 additional white space in declarations like this: ``assume *: A''.
3296 * Isar: 'print_facts' prints all local facts of the current context,
3297 both named and unnamed ones.
3299 * Isar: 'def' now admits simultaneous definitions, e.g.:
3301 def x == "t" and y == "u"
3303 * Isar: added command 'unfolding', which is structurally similar to
3304 'using', but affects both the goal state and facts by unfolding given
3305 rewrite rules. Thus many occurrences of the 'unfold' method or
3306 'unfolded' attribute may be replaced by first-class proof text.
3308 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
3309 and command 'unfolding' now all support object-level equalities
3310 (potentially conditional). The underlying notion of rewrite rule is
3311 analogous to the 'rule_format' attribute, but *not* that of the
3312 Simplifier (which is usually more generous).
3314 * Isar: the new attribute [rotated n] (default n = 1) rotates the
3315 premises of a theorem by n. Useful in conjunction with drule.
3317 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
3318 method expression within a sandbox consisting of the first N
3319 sub-goals, which need to exist. For example, ``simp_all [3]''
3320 simplifies the first three sub-goals, while (rule foo, simp_all)[]
3321 simplifies all new goals that emerge from applying rule foo to the
3322 originally first one.
3324 * Isar: schematic goals are no longer restricted to higher-order
3325 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
3328 * Isar: the conclusion of a long theorem statement is now either
3329 'shows' (a simultaneous conjunction, as before), or 'obtains'
3330 (essentially a disjunction of cases with local parameters and
3331 assumptions). The latter allows to express general elimination rules
3332 adequately; in this notation common elimination rules look like this:
3334 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
3336 obtains x where "P x"
3338 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
3342 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
3348 The subsequent classical rules even refer to the formal "thesis"
3351 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
3354 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
3355 obtains "thesis ==> something"
3357 The actual proof of an 'obtains' statement is analogous to that of the
3358 Isar proof element 'obtain', only that there may be several cases.
3359 Optional case names may be specified in parentheses; these will be
3360 available both in the present proof and as annotations in the
3361 resulting rule, for later use with the 'cases' method (cf. attribute
3364 * Isar: the assumptions of a long theorem statement are available as
3365 "assms" fact in the proof context. This is more appropriate than the
3366 (historical) "prems", which refers to all assumptions of the current
3367 context, including those from the target locale, proof body etc.
3369 * Isar: 'print_statement' prints theorems from the current theory or
3370 proof context in long statement form, according to the syntax of a
3373 * Isar: 'obtain' takes an optional case name for the local context
3374 introduction rule (default "that").
3376 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
3377 explicit (is "_ ==> ?foo") in the rare cases where this still happens
3380 * Pure: syntax "CONST name" produces a fully internalized constant
3381 according to the current context. This is particularly useful for
3382 syntax translations that should refer to internal constant
3383 representations independently of name spaces.
3385 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
3386 instead of "FOO ". This allows multiple binder declarations to coexist
3387 in the same context. INCOMPATIBILITY.
3389 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
3390 primitive that also works in a locale context (both for constants and
3391 fixed variables). Type declaration and internal syntactic representation
3392 of given constants retrieved from the context. Likewise, the
3393 'no_notation' command allows to remove given syntax annotations from the
3396 * Isar/locales: new derived specification elements 'axiomatization',
3397 'definition', 'abbreviation', which support type-inference, admit
3398 object-level specifications (equality, equivalence). See also the
3399 isar-ref manual. Examples:
3402 eq (infix "===" 50) where
3403 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
3405 definition "f x y = x + y + 1"
3406 definition g where "g x = f x x"
3409 neq (infix "=!=" 50) where
3410 "x =!= y == ~ (x === y)"
3412 These specifications may be also used in a locale context. Then the
3413 constants being introduced depend on certain fixed parameters, and the
3414 constant name is qualified by the locale base name. An internal
3415 abbreviation takes care for convenient input and output, making the
3416 parameters implicit and using the original short name. See also
3417 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
3418 entities from a monomorphic theory.
3420 Presently, abbreviations are only available 'in' a target locale, but
3421 not inherited by general import expressions. Also note that
3422 'abbreviation' may be used as a type-safe replacement for 'syntax' +
3423 'translations' in common applications. The "no_abbrevs" print mode
3424 prevents folding of abbreviations in term output.
3426 Concrete syntax is attached to specified constants in internal form,
3427 independently of name spaces. The parse tree representation is
3428 slightly different -- use 'notation' instead of raw 'syntax', and
3429 'translations' with explicit "CONST" markup to accommodate this.
3431 * Pure/Isar: unified syntax for new-style specification mechanisms
3432 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
3433 full type inference and dummy patterns ("_"). For example:
3435 definition "K x _ = x"
3437 inductive conj for A B
3438 where "A ==> B ==> conj A B"
3440 * Pure: command 'print_abbrevs' prints all constant abbreviations of
3441 the current context. Print mode "no_abbrevs" prevents inversion of
3442 abbreviations on output.
3444 * Isar/locales: improved parameter handling: use of locales "var" and
3445 "struct" no longer necessary; - parameter renamings are no longer
3446 required to be injective. For example, this allows to define
3447 endomorphisms as locale endom = homom mult mult h.
3449 * Isar/locales: changed the way locales with predicates are defined.
3450 Instead of accumulating the specification, the imported expression is
3451 now an interpretation. INCOMPATIBILITY: different normal form of
3452 locale expressions. In particular, in interpretations of locales with
3453 predicates, goals repesenting already interpreted fragments are not
3454 removed automatically. Use methods `intro_locales' and
3455 `unfold_locales'; see below.
3457 * Isar/locales: new methods `intro_locales' and `unfold_locales'
3458 provide backward reasoning on locales predicates. The methods are
3459 aware of interpretations and discharge corresponding goals.
3460 `intro_locales' is less aggressive then `unfold_locales' and does not
3461 unfold predicates to assumptions.
3463 * Isar/locales: the order in which locale fragments are accumulated
3464 has changed. This enables to override declarations from fragments due
3465 to interpretations -- for example, unwanted simp rules.
3467 * Isar/locales: interpretation in theories and proof contexts has been
3468 extended. One may now specify (and prove) equations, which are
3469 unfolded in interpreted theorems. This is useful for replacing
3470 defined concepts (constants depending on locale parameters) by
3471 concepts already existing in the target context. Example:
3473 interpretation partial_order ["op <= :: [int, int] => bool"]
3474 where "partial_order.less (op <=) (x::int) y = (x < y)"
3476 Typically, the constant `partial_order.less' is created by a
3477 definition specification element in the context of locale
3480 * Method "induct": improved internal context management to support
3481 local fixes and defines on-the-fly. Thus explicit meta-level
3482 connectives !! and ==> are rarely required anymore in inductive goals
3483 (using object-logic connectives for this purpose has been long
3484 obsolete anyway). Common proof patterns are explained in
3485 src/HOL/Induct/Common_Patterns.thy, see also
3486 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
3489 * Method "induct": improved handling of simultaneous goals. Instead of
3490 introducing object-level conjunction, the statement is now split into
3491 several conclusions, while the corresponding symbolic cases are nested
3492 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
3493 see src/HOL/Induct/Common_Patterns.thy, for example.
3495 * Method "induct": mutual induction rules are now specified as a list
3496 of rule sharing the same induction cases. HOL packages usually provide
3497 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
3498 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
3499 mutual induction rules differently, i.e. like this:
3501 (induct rule: foo_bar.inducts)
3502 (induct set: foo bar)
3503 (induct pred: foo bar)
3504 (induct type: foo bar)
3506 The ML function ProjectRule.projections turns old-style rules into the
3509 * Method "coinduct": dual of induction, see
3510 src/HOL/Library/Coinductive_List.thy for various examples.
3512 * Method "cases", "induct", "coinduct": the ``(open)'' option is
3513 considered a legacy feature.
3515 * Attribute "symmetric" produces result with standardized schematic
3516 variables (index 0). Potential INCOMPATIBILITY.
3518 * Simplifier: by default the simplifier trace only shows top level
3519 rewrites now. That is, trace_simp_depth_limit is set to 1 by
3520 default. Thus there is less danger of being flooded by the trace. The
3521 trace indicates where parts have been suppressed.
3523 * Provers/classical: removed obsolete classical version of elim_format
3524 attribute; classical elim/dest rules are now treated uniformly when
3525 manipulating the claset.
3527 * Provers/classical: stricter checks to ensure that supplied intro,
3528 dest and elim rules are well-formed; dest and elim rules must have at
3531 * Provers/classical: attributes dest/elim/intro take an optional
3532 weight argument for the rule (just as the Pure versions). Weights are
3533 ignored by automated tools, but determine the search order of single
3536 * Syntax: input syntax now supports dummy variable binding "%_. b",
3537 where the body does not mention the bound variable. Note that dummy
3538 patterns implicitly depend on their context of bounds, which makes
3539 "{_. _}" match any set comprehension as expected. Potential
3540 INCOMPATIBILITY -- parse translations need to cope with syntactic
3541 constant "_idtdummy" in the binding position.
3543 * Syntax: removed obsolete syntactic constant "_K" and its associated
3544 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
3545 for example "A -> B" => "Pi A (%_. B)".
3547 * Pure: 'class_deps' command visualizes the subclass relation, using
3548 the graph browser tool.
3550 * Pure: 'print_theory' now suppresses certain internal declarations by
3551 default; use '!' option for full details.
3556 * Method "metis" proves goals by applying the Metis general-purpose
3557 resolution prover (see also http://gilith.com/software/metis/).
3558 Examples are in the directory MetisExamples. WARNING: the
3559 Isabelle/HOL-Metis integration does not yet work properly with
3562 * Command 'sledgehammer' invokes external automatic theorem provers as
3563 background processes. It generates calls to the "metis" method if
3564 successful. These can be pasted into the proof. Users do not have to
3565 wait for the automatic provers to return. WARNING: does not really
3566 work with multi-threading.
3568 * New "auto_quickcheck" feature tests outermost goal statements for
3569 potential counter-examples. Controlled by ML references
3570 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
3571 5000 milliseconds). Fails silently if statements is outside of
3572 executable fragment, or any other codgenerator problem occurs.
3574 * New constant "undefined" with axiom "undefined x = undefined".
3576 * Added class "HOL.eq", allowing for code generation with polymorphic
3579 * Some renaming of class constants due to canonical name prefixing in
3580 the new 'class' package:
3582 HOL.abs ~> HOL.abs_class.abs
3583 HOL.divide ~> HOL.divide_class.divide
3584 0 ~> HOL.zero_class.zero
3585 1 ~> HOL.one_class.one
3586 op + ~> HOL.plus_class.plus
3587 op - ~> HOL.minus_class.minus
3588 uminus ~> HOL.minus_class.uminus
3589 op * ~> HOL.times_class.times
3590 op < ~> HOL.ord_class.less
3591 op <= > HOL.ord_class.less_eq
3592 Nat.power ~> Power.power_class.power
3593 Nat.size ~> Nat.size_class.size
3594 Numeral.number_of ~> Numeral.number_class.number_of
3595 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
3596 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
3597 Orderings.min ~> Orderings.ord_class.min
3598 Orderings.max ~> Orderings.ord_class.max
3599 Divides.op div ~> Divides.div_class.div
3600 Divides.op mod ~> Divides.div_class.mod
3601 Divides.op dvd ~> Divides.div_class.dvd
3603 INCOMPATIBILITY. Adaptions may be required in the following cases:
3605 a) User-defined constants using any of the names "plus", "minus",
3606 "times", "less" or "less_eq". The standard syntax translations for
3607 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
3610 b) Variables named "plus", "minus", "times", "less", "less_eq"
3611 INCOMPATIBILITY: use more specific names.
3613 c) Permutative equations (e.g. "a + b = b + a")
3614 Since the change of names also changes the order of terms, permutative
3615 rewrite rules may get applied in a different order. Experience shows
3616 that this is rarely the case (only two adaptions in the whole Isabelle
3617 distribution). INCOMPATIBILITY: rewrite proofs
3619 d) ML code directly refering to constant names
3620 This in general only affects hand-written proof tactics, simprocs and
3621 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
3622 Consider using @{const_name} antiquotation.
3624 * New class "default" with associated constant "default".
3626 * Function "sgn" is now overloaded and available on int, real, complex
3627 (and other numeric types), using class "sgn". Two possible defs of
3628 sgn are given as equational assumptions in the classes sgn_if and
3629 sgn_div_norm; ordered_idom now also inherits from sgn_if.
3632 * Locale "partial_order" now unified with class "order" (cf. theory
3633 Orderings), added parameter "less". INCOMPATIBILITY.
3635 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
3636 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
3637 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
3639 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
3640 changed order of proof goals in instance proofs.
3642 * The transitivity reasoner for partial and linear orders is set up
3643 for classes "order" and "linorder". Instances of the reasoner are available
3644 in all contexts importing or interpreting the corresponding locales.
3645 Method "order" invokes the reasoner separately; the reasoner
3646 is also integrated with the Simplifier as a solver. Diagnostic
3647 command 'print_orders' shows the available instances of the reasoner
3648 in the current context.
3650 * Localized monotonicity predicate in theory "Orderings"; integrated
3651 lemmas max_of_mono and min_of_mono with this predicate.
3654 * Formulation of theorem "dense" changed slightly due to integration
3655 with new class dense_linear_order.
3657 * Uniform lattice theory development in HOL.
3659 constants "meet" and "join" now named "inf" and "sup"
3660 constant "Meet" now named "Inf"
3662 classes "meet_semilorder" and "join_semilorder" now named
3663 "lower_semilattice" and "upper_semilattice"
3664 class "lorder" now named "lattice"
3665 class "comp_lat" now named "complete_lattice"
3667 Instantiation of lattice classes allows explicit definitions
3668 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3670 INCOMPATIBILITY. Theorem renames:
3672 meet_left_le ~> inf_le1
3673 meet_right_le ~> inf_le2
3674 join_left_le ~> sup_ge1
3675 join_right_le ~> sup_ge2
3676 meet_join_le ~> inf_sup_ord
3679 le_meet ~> le_inf_iff
3680 le_join ~> ge_sup_conv
3681 meet_idempotent ~> inf_idem
3682 join_idempotent ~> sup_idem
3683 meet_comm ~> inf_commute
3684 join_comm ~> sup_commute
3685 meet_leI1 ~> le_infI1
3686 meet_leI2 ~> le_infI2
3687 le_joinI1 ~> le_supI1
3688 le_joinI2 ~> le_supI2
3689 meet_assoc ~> inf_assoc
3690 join_assoc ~> sup_assoc
3691 meet_left_comm ~> inf_left_commute
3692 meet_left_idempotent ~> inf_left_idem
3693 join_left_comm ~> sup_left_commute
3694 join_left_idempotent ~> sup_left_idem
3697 le_def_meet ~> le_iff_inf
3698 le_def_join ~> le_iff_sup
3699 join_absorp2 ~> sup_absorb2
3700 join_absorp1 ~> sup_absorb1
3701 meet_absorp1 ~> inf_absorb1
3702 meet_absorp2 ~> inf_absorb2
3703 meet_join_absorp ~> inf_sup_absorb
3704 join_meet_absorp ~> sup_inf_absorb
3705 distrib_join_le ~> distrib_sup_le
3706 distrib_meet_le ~> distrib_inf_le
3708 add_meet_distrib_left ~> add_inf_distrib_left
3709 add_join_distrib_left ~> add_sup_distrib_left
3710 is_join_neg_meet ~> is_join_neg_inf
3711 is_meet_neg_join ~> is_meet_neg_sup
3712 add_meet_distrib_right ~> add_inf_distrib_right
3713 add_join_distrib_right ~> add_sup_distrib_right
3714 add_meet_join_distribs ~> add_sup_inf_distribs
3715 join_eq_neg_meet ~> sup_eq_neg_inf
3716 meet_eq_neg_join ~> inf_eq_neg_sup
3717 add_eq_meet_join ~> add_eq_inf_sup
3718 meet_0_imp_0 ~> inf_0_imp_0
3719 join_0_imp_0 ~> sup_0_imp_0
3720 meet_0_eq_0 ~> inf_0_eq_0
3721 join_0_eq_0 ~> sup_0_eq_0
3722 neg_meet_eq_join ~> neg_inf_eq_sup
3723 neg_join_eq_meet ~> neg_sup_eq_inf
3724 join_eq_if ~> sup_eq_if
3726 mono_meet ~> mono_inf
3727 mono_join ~> mono_sup
3728 meet_bool_eq ~> inf_bool_eq
3729 join_bool_eq ~> sup_bool_eq
3730 meet_fun_eq ~> inf_fun_eq
3731 join_fun_eq ~> sup_fun_eq
3732 meet_set_eq ~> inf_set_eq
3733 join_set_eq ~> sup_set_eq
3734 meet1_iff ~> inf1_iff
3735 meet2_iff ~> inf2_iff
3744 join1_iff ~> sup1_iff
3745 join2_iff ~> sup2_iff
3755 is_meet_Meet ~> is_meet_Inf
3756 Meet_bool_def ~> Inf_bool_def
3757 Meet_fun_def ~> Inf_fun_def
3758 Meet_greatest ~> Inf_greatest
3759 Meet_lower ~> Inf_lower
3760 Meet_set_def ~> Inf_set_def
3763 Sup_bool_eq ~> Sup_bool_def
3764 Sup_fun_eq ~> Sup_fun_def
3765 Sup_set_eq ~> Sup_set_def
3767 listsp_meetI ~> listsp_infI
3768 listsp_meet_eq ~> listsp_inf_eq
3773 * Added syntactic class "size"; overloaded constant "size" now has
3774 type "'a::size ==> bool"
3776 * Internal reorganisation of `size' of datatypes: size theorems
3777 "foo.size" are no longer subsumed by "foo.simps" (but are still
3778 simplification rules by default!); theorems "prod.size" now named
3781 * Class "div" now inherits from class "times" rather than "type".
3784 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3785 Linorder etc. have disappeared; operations defined in terms of
3786 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3788 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3790 * HOL-Word: New extensive library and type for generic, fixed size
3791 machine words, with arithemtic, bit-wise, shifting and rotating
3792 operations, reflection into int, nat, and bool lists, automation for
3793 linear arithmetic (by automatic reflection into nat or int), including
3794 lemmas on overflow and monotonicity. Instantiated to all appropriate
3795 arithmetic type classes, supporting automatic simplification of
3796 numerals on all operations.
3798 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3800 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3802 * Code generator library theories:
3803 - Code_Integer represents HOL integers by big integer literals in target
3805 - Code_Char represents HOL characters by character literals in target
3807 - Code_Char_chr like Code_Char, but also offers treatment of character
3808 codes; includes Code_Integer.
3809 - Executable_Set allows to generate code for finite sets using lists.
3810 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3812 - Executable_Real implements a subset of real numbers, namly those
3813 representable by rational numbers.
3814 - Efficient_Nat implements natural numbers by integers, which in general will
3815 result in higher efficency; pattern matching with 0/Suc is eliminated;
3816 includes Code_Integer.
3817 - Code_Index provides an additional datatype index which is mapped to
3818 target-language built-in integers.
3819 - Code_Message provides an additional datatype message_string which is isomorphic to
3820 strings; messages are mapped to target-language strings.
3822 * New package for inductive predicates
3824 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3827 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3828 for z_1 :: U_1 and ... and z_n :: U_m
3830 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3833 with full support for type-inference, rather than
3835 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3837 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3838 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3840 inductive "s z_1 ... z_m"
3842 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3845 For backward compatibility, there is a wrapper allowing inductive
3846 sets to be defined with the new package via
3849 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3850 for z_1 :: U_1 and ... and z_n :: U_m
3852 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3858 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3859 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3860 for z_1 :: U_1 and ... and z_n :: U_m
3862 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3863 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3866 if the additional syntax "p ..." is required.
3868 Numerous examples can be found in the subdirectories src/HOL/Auth,
3869 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3873 - Since declaration and definition of inductive sets or predicates
3874 is no longer separated, abbreviations involving the newly
3875 introduced sets or predicates must be specified together with the
3876 introduction rules after the 'where' keyword (see above), rather
3877 than before the actual inductive definition.
3879 - The variables in induction and elimination rules are now
3880 quantified in the order of their occurrence in the introduction
3881 rules, rather than in alphabetical order. Since this may break
3882 some proofs, these proofs either have to be repaired, e.g. by
3883 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3884 statements of the form
3886 case (rule_i a_i_1 ... a_i_{k_i})
3888 or the old order of quantification has to be restored by explicitly adding
3889 meta-level quantifiers in the introduction rules, i.e.
3891 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3893 - The format of the elimination rules is now
3895 p z_1 ... z_m x_1 ... x_n ==>
3896 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3901 (x_1, ..., x_n) : s z_1 ... z_m ==>
3902 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3905 for sets rather than
3907 x : s z_1 ... z_m ==>
3908 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3911 This may require terms in goals to be expanded to n-tuples
3912 (e.g. using case_tac or simplification with the split_paired_all
3913 rule) before the above elimination rule is applicable.
3915 - The elimination or case analysis rules for (mutually) inductive
3916 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3917 list of rules "p_1_..._p_k.elims" is no longer available.
3919 * New package "function"/"fun" for general recursive functions,
3920 supporting mutual and nested recursion, definitions in local contexts,
3921 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3922 for small examples, and the separate tutorial on the function
3923 package. The old recdef "package" is still available as before, but
3924 users are encouraged to use the new package.
3926 * Method "lexicographic_order" automatically synthesizes termination
3927 relations as lexicographic combinations of size measures.
3929 * Case-expressions allow arbitrary constructor-patterns (including
3930 "_") and take their order into account, like in functional
3931 programming. Internally, this is translated into nested
3932 case-expressions; missing cases are added and mapped to the predefined
3933 constant "undefined". In complicated cases printing may no longer show
3934 the original input but the internal form. Lambda-abstractions allow
3935 the same form of pattern matching: "% pat1 => e1 | ..." is an
3936 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3939 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3940 is an abbreviation for "of_nat :: nat => int". The simplification
3941 rules for "of_nat" have been changed to work like "int" did
3942 previously. Potential INCOMPATIBILITY:
3943 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3944 - of_nat_diff and of_nat_mult are no longer default simp rules
3946 * Method "algebra" solves polynomial equations over (semi)rings using
3947 Groebner bases. The (semi)ring structure is defined by locales and the
3948 tool setup depends on that generic context. Installing the method for
3949 a specific type involves instantiating the locale and possibly adding
3950 declarations for computation on the coefficients. The method is
3951 already instantiated for natural numbers and for the axiomatic class
3952 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3953 CALCULEMUS 2007 for the general principles underlying this
3954 architecture of context-aware proof-tools.
3956 * Method "ferrack" implements quantifier elimination over
3957 special-purpose dense linear orders using locales (analogous to
3958 "algebra"). The method is already installed for class
3959 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3962 * Former constant "List.op @" now named "List.append". Use ML
3963 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3964 circumvent possible incompatibilities when working on ML level.
3966 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3968 * New function listsum :: 'a list => 'a for arbitrary monoids.
3969 Special syntax: "SUM x <- xs. f x" (and latex variants)
3971 * New syntax for Haskell-like list comprehension (input only), eg.
3972 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3974 * The special syntax for function "filter" has changed from [x :
3975 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3976 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3978 * [a..b] is now defined for arbitrary linear orders. It used to be
3979 defined on nat only, as an abbreviation for [a..<Suc b]
3982 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3984 * New functions "sorted" and "sort" in src/HOL/List.thy.
3986 * New lemma collection field_simps (an extension of ring_simps) for
3987 manipulating (in)equations involving division. Multiplies with all
3988 denominators that can be proved to be non-zero (in equations) or
3989 positive/negative (in inequations).
3991 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3992 have been improved and renamed to ring_simps, group_simps and
3993 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3994 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3996 * Theory Library/Commutative_Ring: switched from recdef to function
3997 package; constants add, mul, pow now curried. Infix syntax for
3998 algebraic operations.
4000 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
4003 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
4006 * HOL/records: generalised field-update to take a function on the
4007 field rather than the new value: r(|A := x|) is translated to A_update
4008 (K x) r The K-combinator that is internally used is called K_record.
4009 INCOMPATIBILITY: Usage of the plain update functions has to be
4012 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
4013 * x = 0, which are required for a semiring. Richer structures do not
4014 inherit from semiring_0 anymore, because this property is a theorem
4015 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
4016 there is more to prove, but this is mostly trivial.
4018 * Class "recpower" is generalized to arbitrary monoids, not just
4019 commutative semirings. INCOMPATIBILITY: may need to incorporate
4020 commutativity or semiring properties additionally.
4022 * Constant "List.list_all2" in List.thy now uses authentic syntax.
4023 INCOMPATIBILITY: translations containing list_all2 may go wrong,
4024 better use 'abbreviation'.
4026 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
4028 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
4029 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
4030 significant changes for setting up numeral syntax for types:
4031 - New constants Numeral.pred and Numeral.succ instead
4032 of former Numeral.bin_pred and Numeral.bin_succ.
4033 - Use integer operations instead of bin_add, bin_mult and so on.
4034 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
4035 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
4037 See src/HOL/Integ/IntArith.thy for an example setup.
4039 * Command 'normal_form' computes the normal form of a term that may
4040 contain free variables. For example ``normal_form "rev [a, b, c]"''
4041 produces ``[b, c, a]'' (without proof). This command is suitable for
4042 heavy-duty computations because the functions are compiled to ML
4043 first. Correspondingly, a method "normalization" is provided. See
4044 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
4046 * Alternative iff syntax "A <-> B" for equality on bool (with priority
4047 25 like -->); output depends on the "iff" print_mode, the default is
4048 "A = B" (with priority 50).
4050 * Relations less (<) and less_eq (<=) are also available on type bool.
4051 Modified syntax to disallow nesting without explicit parentheses,
4052 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
4055 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
4057 * Relation composition operator "op O" now has precedence 75 and binds
4058 stronger than union and intersection. INCOMPATIBILITY.
4060 * The old set interval syntax "{m..n(}" (and relatives) has been
4061 removed. Use "{m..<n}" (and relatives) instead.
4063 * In the context of the assumption "~(s = t)" the Simplifier rewrites
4064 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
4065 ``declare [[simproc del: neq]]''.
4067 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
4070 * Theorem Cons_eq_map_conv no longer declared as "simp".
4072 * Theorem setsum_mult renamed to setsum_right_distrib.
4074 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
4077 * Reimplemented methods "sat" and "satx", with several improvements:
4078 goals no longer need to be stated as "<prems> ==> False", equivalences
4079 (i.e. "=" on type bool) are handled, variable names of the form
4080 "lit_<n>" are no longer reserved, significant speedup.
4082 * Methods "sat" and "satx" can now replay MiniSat proof traces.
4083 zChaff is still supported as well.
4085 * 'inductive' and 'datatype': provide projections of mutual rules,
4086 bundled as foo_bar.inducts;
4088 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
4091 * Library: moved theory Accessible_Part to main HOL.
4093 * Library: added theory Coinductive_List of potentially infinite lists
4094 as greatest fixed-point.
4096 * Library: added theory AssocList which implements (finite) maps as
4099 * Method "evaluation" solves goals (i.e. a boolean expression)
4100 efficiently by compiling it to ML. The goal is "proved" (via an
4101 oracle) if it evaluates to True.
4103 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
4104 also when invoked by the simplifier. This results in the Simplifier
4105 being more powerful on arithmetic goals. INCOMPATIBILITY.
4106 Configuration option fast_arith_split_limit=0 recovers the old
4109 * Support for hex (0x20) and binary (0b1001) numerals.
4111 * New method: reify eqs (t), where eqs are equations for an
4112 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
4113 parameter, computes a term s::'b and a list xs::'a list and proves the
4114 theorem I xs s = t. This is also known as reification or quoting. The
4115 resulting theorem is applied to the subgoal to substitute t with I xs
4116 s. If t is omitted, the subgoal itself is reified.
4118 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
4119 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
4120 where f is supposed to be a computable function (in the sense of code
4121 generattion). The method uses reify to compute s and xs as above then
4122 applies corr_thm and uses normalization by evaluation to "prove" f s =
4123 r and finally gets the theorem t = r, which is again applied to the
4124 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
4126 * Reflection: Automatic reification now handels binding, an example is
4127 available in src/HOL/ex/ReflectionEx.thy
4129 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
4130 command 'statespace' that is similar to 'record', but introduces an
4131 abstract specification based on the locale infrastructure instead of
4132 HOL types. This leads to extra flexibility in composing state spaces,
4133 in particular multiple inheritance and renaming of components.
4138 * Hyperreal: Functions root and sqrt are now defined on negative real
4139 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
4140 Nonnegativity side conditions have been removed from many lemmas, so
4141 that more subgoals may now be solved by simplification; potential
4144 * Real: new type classes formalize real normed vector spaces and
4145 algebras, using new overloaded constants scaleR :: real => 'a => 'a
4146 and norm :: 'a => real.
4148 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
4149 reals into other types. The overloaded constant Reals :: 'a set is now
4150 defined as range of_real; potential INCOMPATIBILITY.
4152 * Real: proper support for ML code generation, including 'quickcheck'.
4153 Reals are implemented as arbitrary precision rationals.
4155 * Hyperreal: Several constants that previously worked only for the
4156 reals have been generalized, so they now work over arbitrary vector
4157 spaces. Type annotations may need to be added in some cases; potential
4160 Infinitesimal :: ('a::real_normed_vector) star set
4161 HFinite :: ('a::real_normed_vector) star set
4162 HInfinite :: ('a::real_normed_vector) star set
4163 approx :: ('a::real_normed_vector) star => 'a star => bool
4164 monad :: ('a::real_normed_vector) star => 'a star set
4165 galaxy :: ('a::real_normed_vector) star => 'a star set
4166 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
4167 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
4168 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
4169 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
4170 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
4171 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
4172 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
4173 sgn :: 'a::real_normed_vector => 'a
4174 exp :: 'a::{recpower,real_normed_field,banach} => 'a
4176 * Complex: Some complex-specific constants are now abbreviations for
4177 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
4178 hnorm. Other constants have been entirely removed in favor of the
4179 polymorphic versions (INCOMPATIBILITY):
4183 HInfinite <-- CInfinite
4184 Infinitesimal <-- CInfinitesimal
4187 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
4188 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
4189 (ns)deriv <-- (ns)cderiv
4194 * Formalisation of ideals and the quotient construction over rings.
4196 * Order and lattice theory no longer based on records.
4199 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
4200 greatest_closed. INCOMPATIBILITY.
4202 * Method algebra is now set up via an attribute. For examples see
4203 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
4204 of algebraic structures.
4206 * Renamed theory CRing to Ring.
4211 * Substantial, yet incomplete support for nominal datatypes (binding
4212 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
4213 src/HOL/Nominal/Examples. Prospective users should consult
4214 http://isabelle.in.tum.de/nominal/
4219 * ML basics: just one true type int, which coincides with IntInf.int
4222 * ML within Isar: antiquotations allow to embed statically-checked
4223 formal entities in the source, referring to the context available at
4224 compile-time. For example:
4226 ML {* @{sort "{zero,one}"} *}
4227 ML {* @{typ "'a => 'b"} *}
4228 ML {* @{term "%x. x"} *}
4229 ML {* @{prop "x == y"} *}
4230 ML {* @{ctyp "'a => 'b"} *}
4231 ML {* @{cterm "%x. x"} *}
4232 ML {* @{cprop "x == y"} *}
4233 ML {* @{thm asm_rl} *}
4234 ML {* @{thms asm_rl} *}
4235 ML {* @{type_name c} *}
4236 ML {* @{type_syntax c} *}
4237 ML {* @{const_name c} *}
4238 ML {* @{const_syntax c} *}
4241 ML {* @{theory Pure} *}
4242 ML {* @{theory_ref} *}
4243 ML {* @{theory_ref Pure} *}
4246 ML {* @{clasimpset} *}
4248 The same works for sources being ``used'' within an Isar context.
4250 * ML in Isar: improved error reporting; extra verbosity with
4251 ML_Context.trace enabled.
4253 * Pure/General/table.ML: the join operations now works via exceptions
4254 DUP/SAME instead of type option. This is simpler in simple cases, and
4255 admits slightly more efficient complex applications.
4257 * Pure: 'advanced' translation functions (parse_translation etc.) now
4258 use Context.generic instead of just theory.
4260 * Pure: datatype Context.generic joins theory/Proof.context and
4261 provides some facilities for code that works in either kind of
4262 context, notably GenericDataFun for uniform theory and proof data.
4264 * Pure: simplified internal attribute type, which is now always
4265 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
4266 local (Proof.context) attributes have been discontinued, while
4267 minimizing code duplication. Thm.rule_attribute and
4268 Thm.declaration_attribute build canonical attributes; see also structure
4269 Context for further operations on Context.generic, notably
4270 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
4271 declarations and definitions.
4273 * Context data interfaces (Theory/Proof/GenericDataFun): removed
4274 name/print, uninitialized data defaults to ad-hoc copy of empty value,
4275 init only required for impure data. INCOMPATIBILITY: empty really need
4276 to be empty (no dependencies on theory content!)
4278 * Pure/kernel: consts certification ignores sort constraints given in
4279 signature declarations. (This information is not relevant to the
4280 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
4281 potential INCOMPATIBILITY.
4283 * Pure: axiomatic type classes are now purely definitional, with
4284 explicit proofs of class axioms and super class relations performed
4285 internally. See Pure/axclass.ML for the main internal interfaces --
4286 notably AxClass.define_class supercedes AxClass.add_axclass, and
4287 AxClass.axiomatize_class/classrel/arity supersede
4288 Sign.add_classes/classrel/arities.
4290 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
4291 global/local versions on theory vs. Proof.context have been
4292 discontinued; Attrib.syntax and Method.syntax have been adapted
4293 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
4294 attributes, methods, etc.
4296 * Pure: several functions of signature "... -> theory -> theory * ..."
4297 have been reoriented to "... -> theory -> ... * theory" in order to
4298 allow natural usage in combination with the ||>, ||>>, |-> and
4299 fold_map combinators.
4301 * Pure: official theorem names (closed derivations) and additional
4302 comments (tags) are now strictly separate. Name hints -- which are
4303 maintained as tags -- may be attached any time without affecting the
4306 * Pure: primitive rule lift_rule now takes goal cterm instead of an
4307 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
4308 achieve the old behaviour.
4310 * Pure: the "Goal" constant is now called "prop", supporting a
4311 slightly more general idea of ``protecting'' meta-level rule
4314 * Pure: Logic.(un)varify only works in a global context, which is now
4315 enforced instead of silently assumed. INCOMPATIBILITY, may use
4316 Logic.legacy_(un)varify as temporary workaround.
4318 * Pure: structure Name provides scalable operations for generating
4319 internal variable names, notably Name.variants etc. This replaces
4320 some popular functions from term.ML:
4322 Term.variant -> Name.variant
4323 Term.variantlist -> Name.variant_list
4324 Term.invent_names -> Name.invent_list
4326 Note that low-level renaming rarely occurs in new code -- operations
4327 from structure Variable are used instead (see below).
4329 * Pure: structure Variable provides fundamental operations for proper
4330 treatment of fixed/schematic variables in a context. For example,
4331 Variable.import introduces fixes for schematics of given facts and
4332 Variable.export reverses the effect (up to renaming) -- this replaces
4333 various freeze_thaw operations.
4335 * Pure: structure Goal provides simple interfaces for
4336 init/conclude/finish and tactical prove operations (replacing former
4337 Tactic.prove). Goal.prove is the canonical way to prove results
4338 within a given context; Goal.prove_global is a degraded version for
4339 theory level goals, including a global Drule.standard. Note that
4340 OldGoals.prove_goalw_cterm has long been obsolete, since it is
4341 ill-behaved in a local proof context (e.g. with local fixes/assumes or
4342 in a locale context).
4344 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
4345 and type checking (Syntax.check_term etc.), with common combinations
4346 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
4347 which are considered legacy and await removal.
4349 * Pure/Syntax: generic interfaces for type unchecking
4350 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
4351 with common combinations (Syntax.pretty_term, Syntax.string_of_term
4352 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
4353 available for convenience, but refer to the very same operations using
4354 a mere theory instead of a full context.
4356 * Isar: simplified treatment of user-level errors, using exception
4357 ERROR of string uniformly. Function error now merely raises ERROR,
4358 without any side effect on output channels. The Isar toplevel takes
4359 care of proper display of ERROR exceptions. ML code may use plain
4360 handle/can/try; cat_error may be used to concatenate errors like this:
4362 ... handle ERROR msg => cat_error msg "..."
4364 Toplevel ML code (run directly or through the Isar toplevel) may be
4365 embedded into the Isar toplevel with exception display/debug like
4368 Isar.toplevel (fn () => ...)
4370 INCOMPATIBILITY, removed special transform_error facilities, removed
4371 obsolete variants of user-level exceptions (ERROR_MESSAGE,
4372 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
4373 -- use plain ERROR instead.
4375 * Isar: theory setup now has type (theory -> theory), instead of a
4376 list. INCOMPATIBILITY, may use #> to compose setup functions.
4378 * Isar: ML toplevel pretty printer for type Proof.context, subject to
4379 ProofContext.debug/verbose flags.
4381 * Isar: Toplevel.theory_to_proof admits transactions that modify the
4382 theory before entering a proof state. Transactions now always see a
4383 quasi-functional intermediate checkpoint, both in interactive and
4386 * Isar: simplified interfaces for outer syntax. Renamed
4387 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
4388 OuterSyntax.add_parsers -- this functionality is now included in
4389 OuterSyntax.command etc. INCOMPATIBILITY.
4391 * Simplifier: the simpset of a running simplification process now
4392 contains a proof context (cf. Simplifier.the_context), which is the
4393 very context that the initial simpset has been retrieved from (by
4394 simpset_of/local_simpset_of). Consequently, all plug-in components
4395 (solver, looper etc.) may depend on arbitrary proof data.
4397 * Simplifier.inherit_context inherits the proof context (plus the
4398 local bounds) of the current simplification process; any simproc
4399 etc. that calls the Simplifier recursively should do this! Removed
4400 former Simplifier.inherit_bounds, which is already included here --
4401 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
4402 specify an explicit context using Simplifier.context/theory_context.
4404 * Simplifier/Classical Reasoner: more abstract interfaces
4405 change_simpset/claset for modifying the simpset/claset reference of a
4406 theory; raw versions simpset/claset_ref etc. have been discontinued --
4409 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
4415 * settings: the default heap location within ISABELLE_HOME_USER now
4416 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
4417 Isabelle installations.
4419 * isabelle-process: option -S (secure mode) disables some critical
4420 operations, notably runtime compilation and evaluation of ML source
4423 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
4425 * Support for parallel execution, using native multicore support of
4426 Poly/ML 5.1. The theory loader exploits parallelism when processing
4427 independent theories, according to the given theory header
4428 specifications. The maximum number of worker threads is specified via
4429 usedir option -M or the "max-threads" setting in Proof General. A
4430 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
4431 to 6 on a 8-core machine. User-code needs to observe certain
4432 guidelines for thread-safe programming, see appendix A in the Isar
4433 Implementation manual.
4437 New in Isabelle2005 (October 2005)
4438 ----------------------------------
4442 * Theory headers: the new header syntax for Isar theories is
4445 imports <theory1> ... <theoryN>
4446 uses <file1> ... <fileM>
4449 where the 'uses' part is optional. The previous syntax
4451 theory <name> = <theory1> + ... + <theoryN>:
4453 will disappear in the next release. Use isatool fixheaders to convert
4454 existing theory files. Note that there is no change in ancient
4455 non-Isar theories now, but these will disappear soon.
4457 * Theory loader: parent theories can now also be referred to via
4458 relative and absolute paths.
4460 * Command 'find_theorems' searches for a list of criteria instead of a
4461 list of constants. Known criteria are: intro, elim, dest, name:string,
4462 simp:term, and any term. Criteria can be preceded by '-' to select
4463 theorems that do not match. Intro, elim, dest select theorems that
4464 match the current goal, name:s selects theorems whose fully qualified
4465 name contain s, and simp:term selects all simplification rules whose
4466 lhs match term. Any other term is interpreted as pattern and selects
4467 all theorems matching the pattern. Available in ProofGeneral under
4468 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
4470 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
4472 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
4473 matching the current goal as introduction rule and not having "HOL."
4474 in their name (i.e. not being defined in theory HOL).
4476 * Command 'thms_containing' has been discontinued in favour of
4477 'find_theorems'; INCOMPATIBILITY.
4479 * Communication with Proof General is now 8bit clean, which means that
4480 Unicode text in UTF-8 encoding may be used within theory texts (both
4481 formal and informal parts). Cf. option -U of the Isabelle Proof
4482 General interface. Here are some simple examples (cf. src/HOL/ex):
4484 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
4485 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
4487 * Improved efficiency of the Simplifier and, to a lesser degree, the
4488 Classical Reasoner. Typical big applications run around 2 times
4492 *** Document preparation ***
4494 * Commands 'display_drafts' and 'print_drafts' perform simple output
4495 of raw sources. Only those symbols that do not require additional
4496 LaTeX packages (depending on comments in isabellesym.sty) are
4497 displayed properly, everything else is left verbatim. isatool display
4498 and isatool print are used as front ends (these are subject to the
4499 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
4501 * Command tags control specific markup of certain regions of text,
4502 notably folding and hiding. Predefined tags include "theory" (for
4503 theory begin and end), "proof" for proof commands, and "ML" for
4504 commands involving ML code; the additional tags "visible" and
4505 "invisible" are unused by default. Users may give explicit tag
4506 specifications in the text, e.g. ''by %invisible (auto)''. The
4507 interpretation of tags is determined by the LaTeX job during document
4508 preparation: see option -V of isatool usedir, or options -n and -t of
4509 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
4512 Several document versions may be produced at the same time via isatool
4513 usedir (the generated index.html will link all of them). Typical
4514 specifications include ''-V document=theory,proof,ML'' to present
4515 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
4516 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
4517 these parts without any formal replacement text. The Isabelle site
4518 default settings produce ''document'' and ''outline'' versions as
4521 * Several new antiquotations:
4523 @{term_type term} prints a term with its type annotated;
4525 @{typeof term} prints the type of a term;
4527 @{const const} is the same as @{term const}, but checks that the
4528 argument is a known logical constant;
4530 @{term_style style term} and @{thm_style style thm} print a term or
4531 theorem applying a "style" to it
4535 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
4536 definitions, equations, inequations etc., 'concl' printing only the
4537 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
4538 to print the specified premise. TermStyle.add_style provides an ML
4539 interface for introducing further styles. See also the "LaTeX Sugar"
4540 document practical applications. The ML antiquotation prints
4541 type-checked ML expressions verbatim.
4543 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
4544 and 'text' support optional locale specification '(in loc)', which
4545 specifies the default context for interpreting antiquotations. For
4546 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
4548 * Option 'locale=NAME' of antiquotations specifies an alternative
4549 context interpreting the subsequent argument. For example: @{thm
4550 [locale=lattice] inf_assoc}.
4552 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
4555 * Proper output of antiquotations for theory commands involving a
4556 proof context (such as 'locale' or 'theorem (in loc) ...').
4558 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
4559 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
4561 * isatool usedir: new option -C (default true) controls whether option
4562 -D should include a copy of the original document directory; -C false
4563 prevents unwanted effects such as copying of administrative CVS data.
4568 * Considerably improved version of 'constdefs' command. Now performs
4569 automatic type-inference of declared constants; additional support for
4570 local structure declarations (cf. locales and HOL records), see also
4571 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
4572 sequential dependencies of definitions within a single 'constdefs'
4573 section; moreover, the declared name needs to be an identifier. If
4574 all fails, consider to fall back on 'consts' and 'defs' separately.
4576 * Improved indexed syntax and implicit structures. First of all,
4577 indexed syntax provides a notational device for subscripted
4578 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
4579 expressions. Secondly, in a local context with structure
4580 declarations, number indexes \<^sub>n or the empty index (default
4581 number 1) refer to a certain fixed variable implicitly; option
4582 show_structs controls printing of implicit structures. Typical
4583 applications of these concepts involve record types and locales.
4585 * New command 'no_syntax' removes grammar declarations (and
4586 translations) resulting from the given syntax specification, which is
4587 interpreted in the same manner as for the 'syntax' command.
4589 * 'Advanced' translation functions (parse_translation etc.) may depend
4590 on the signature of the theory context being presently used for
4591 parsing/printing, see also isar-ref manual.
4593 * Improved 'oracle' command provides a type-safe interface to turn an
4594 ML expression of type theory -> T -> term into a primitive rule of
4595 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
4596 is already included here); see also FOL/ex/IffExample.thy;
4599 * axclass: name space prefix for class "c" is now "c_class" (was "c"
4600 before); "cI" is no longer bound, use "c.intro" instead.
4601 INCOMPATIBILITY. This change avoids clashes of fact bindings for
4602 axclasses vs. locales.
4604 * Improved internal renaming of symbolic identifiers -- attach primes
4605 instead of base 26 numbers.
4607 * New flag show_question_marks controls printing of leading question
4608 marks in schematic variable names.
4610 * In schematic variable names, *any* symbol following \<^isub> or
4611 \<^isup> is now treated as part of the base name. For example, the
4612 following works without printing of awkward ".0" indexes:
4614 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
4617 * Inner syntax includes (*(*nested*) comments*).
4619 * Pretty printer now supports unbreakable blocks, specified in mixfix
4620 annotations as "(00...)".
4622 * Clear separation of logical types and nonterminals, where the latter
4623 may only occur in 'syntax' specifications or type abbreviations.
4624 Before that distinction was only partially implemented via type class
4625 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
4626 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
4627 exotic syntax specifications may require further adaption
4628 (e.g. Cube/Cube.thy).
4630 * Removed obsolete type class "logic", use the top sort {} instead.
4631 Note that non-logical types should be declared as 'nonterminals'
4632 rather than 'types'. INCOMPATIBILITY for new object-logic
4635 * Attributes 'induct' and 'cases': type or set names may now be
4636 locally fixed variables as well.
4638 * Simplifier: can now control the depth to which conditional rewriting
4639 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
4642 * Simplifier: simplification procedures may now take the current
4643 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
4644 interface), which is very useful for calling the Simplifier
4645 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
4646 is gone -- use prems_of_ss on the simpset instead. Moreover, the
4647 low-level mk_simproc no longer applies Logic.varify internally, to
4648 allow for use in a context of fixed variables.
4650 * thin_tac now works even if the assumption being deleted contains !!
4651 or ==>. More generally, erule now works even if the major premise of
4652 the elimination rule contains !! or ==>.
4654 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
4656 * Reorganized bootstrapping of the Pure theories; CPure is now derived
4657 from Pure, which contains all common declarations already. Both
4658 theories are defined via plain Isabelle/Isar .thy files.
4659 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
4660 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
4661 use isatool fixcpure to adapt your theory and ML sources.
4663 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
4664 selections of theorems in named facts via index ranges.
4666 * 'print_theorems': in theory mode, really print the difference
4667 wrt. the last state (works for interactive theory development only),
4668 in proof mode print all local facts (cf. 'print_facts');
4670 * 'hide': option '(open)' hides only base names.
4672 * More efficient treatment of intermediate checkpoints in interactive
4675 * Code generator is now invoked via code_module (incremental code
4676 generation) and code_library (modular code generation, ML structures
4677 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4678 must be quoted when used as identifiers.
4680 * New 'value' command for reading, evaluating and printing terms using
4681 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4682 quoted when used as identifier.
4687 * New commands for the interpretation of locale expressions in
4688 theories (1), locales (2) and proof contexts (3). These generate
4689 proof obligations from the expression specification. After the
4690 obligations have been discharged, theorems of the expression are added
4691 to the theory, target locale or proof context. The synopsis of the
4692 commands is a follows:
4694 (1) interpretation expr inst
4695 (2) interpretation target < expr
4696 (3) interpret expr inst
4698 Interpretation in theories and proof contexts require a parameter
4699 instantiation of terms from the current context. This is applied to
4700 specifications and theorems of the interpreted expression.
4701 Interpretation in locales only permits parameter renaming through the
4702 locale expression. Interpretation is smart in that interpretations
4703 that are active already do not occur in proof obligations, neither are
4704 instantiated theorems stored in duplicate. Use 'print_interps' to
4705 inspect active interpretations of a particular locale. For details,
4706 see the Isar Reference manual. Examples can be found in
4707 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4709 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4710 'interpret' instead.
4712 * New context element 'constrains' for adding type constraints to
4715 * Context expressions: renaming of parameters with syntax
4718 * Locale declaration: 'includes' disallowed.
4720 * Proper static binding of attribute syntax -- i.e. types / terms /
4721 facts mentioned as arguments are always those of the locale definition
4722 context, independently of the context of later invocations. Moreover,
4723 locale operations (renaming and type / term instantiation) are applied
4724 to attribute arguments as expected.
4726 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4727 actual attributes; rare situations may require Attrib.attribute to
4728 embed those attributes into Attrib.src that lack concrete syntax.
4729 Attribute implementations need to cooperate properly with the static
4730 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4731 Attrib.XXX_thm etc. already do the right thing without further
4732 intervention. Only unusual applications -- such as "where" or "of"
4733 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4734 on the context and the facts involved -- may have to assign parsed
4735 values to argument tokens explicitly.
4737 * Changed parameter management in theorem generation for long goal
4738 statements with 'includes'. INCOMPATIBILITY: produces a different
4739 theorem statement in rare situations.
4741 * Locale inspection command 'print_locale' omits notes elements. Use
4742 'print_locale!' to have them included in the output.
4747 * Provers/hypsubst.ML: improved version of the subst method, for
4748 single-step rewriting: it now works in bound variable contexts. New is
4749 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4750 rewrite a different subterm than the original subst method, which is
4751 still available as 'simplesubst'.
4753 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4756 * Provers/trancl.ML: new transitivity reasoner for transitive and
4757 reflexive-transitive closure of relations.
4759 * Provers/blast.ML: new reference depth_limit to make blast's depth
4760 limit (previously hard-coded with a value of 20) user-definable.
4762 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4763 is peformed already. Object-logics merely need to finish their
4764 initial simpset configuration as before. INCOMPATIBILITY.
4769 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4772 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4774 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4775 and x-symbol; use option '-m epsilon' to get it actually printed.
4776 Moreover, the mathematically important symbolic identifier \<epsilon>
4777 becomes available as variable, constant etc. INCOMPATIBILITY,
4779 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4780 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4781 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4782 support corresponding Isar calculations.
4784 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4787 * theory SetInterval: changed the syntax for open intervals:
4796 The old syntax is still supported but will disappear in the next
4797 release. For conversion use the following Emacs search and replace
4798 patterns (these are not perfect but work quite well):
4800 {)\([^\.]*\)\.\. -> {\1<\.\.}
4801 \.\.\([^(}]*\)(} -> \.\.<\1}
4803 * Theory Commutative_Ring (in Library): method comm_ring for proving
4804 equalities in commutative rings; method 'algebra' provides a generic
4807 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4808 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4809 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4812 Some new syntax forms are available:
4814 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4815 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4816 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4817 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4819 The latter form "\<Sum>x < k. e" used to be based on a separate
4820 function "Summation", which has been discontinued.
4822 * theory Finite_Set: in structured induction proofs, the insert case
4823 is now 'case (insert x F)' instead of the old counterintuitive 'case
4826 * The 'refute' command has been extended to support a much larger
4827 fragment of HOL, including axiomatic type classes, constdefs and
4828 typedefs, inductive datatypes and recursion.
4830 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4831 Requires zChaff with proof generation to be installed. See
4832 HOL/ex/SAT_Examples.thy for examples.
4834 * Datatype induction via method 'induct' now preserves the name of the
4835 induction variable. For example, when proving P(xs::'a list) by
4836 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4837 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4838 in unstructured proof scripts.
4840 * Reworked implementation of records. Improved scalability for
4841 records with many fields, avoiding performance problems for type
4842 inference. Records are no longer composed of nested field types, but
4843 of nested extension types. Therefore the record type only grows linear
4844 in the number of extensions and not in the number of fields. The
4845 top-level (users) view on records is preserved. Potential
4846 INCOMPATIBILITY only in strange cases, where the theory depends on the
4847 old record representation. The type generated for a record is called
4848 <record_name>_ext_type.
4850 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4851 proofs triggered by a record definition or a simproc (if
4852 quick_and_dirty is enabled). Definitions of large records can take
4855 New simproc record_upd_simproc for simplification of multiple record
4856 updates enabled by default. Moreover, trivial updates are also
4857 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4858 occasionally, since simplification is more powerful by default.
4860 * typedef: proper support for polymorphic sets, which contain extra
4861 type-variables in the term.
4863 * Simplifier: automatically reasons about transitivity chains
4864 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4865 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4866 old proofs break occasionally as simplification may now solve more
4867 goals than previously.
4869 * Simplifier: converts x <= y into x = y if assumption y <= x is
4870 present. Works for all partial orders (class "order"), in particular
4871 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4874 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4875 bound variable or a constant then the let is unfolded. Otherwise
4876 first a is simplified to b, and then f b is simplified to g. If
4877 possible we abstract b from g arriving at "let x = b in h x",
4878 otherwise we unfold the let and arrive at g. The simproc can be
4879 enabled/disabled by the reference use_let_simproc. Potential
4880 INCOMPATIBILITY since simplification is more powerful by default.
4882 * Classical reasoning: the meson method now accepts theorems as arguments.
4884 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4885 jobs to provide advice on the provability of subgoals.
4887 * Theory OrderedGroup and Ring_and_Field: various additions and
4888 improvements to faciliate calculations involving equalities and
4891 The following theorems have been eliminated or modified
4894 abs_eq now named abs_of_nonneg
4895 abs_of_ge_0 now named abs_of_nonneg
4896 abs_minus_eq now named abs_of_nonpos
4897 imp_abs_id now named abs_of_nonneg
4898 imp_abs_neg_id now named abs_of_nonpos
4899 mult_pos now named mult_pos_pos
4900 mult_pos_le now named mult_nonneg_nonneg
4901 mult_pos_neg_le now named mult_nonneg_nonpos
4902 mult_pos_neg2_le now named mult_nonneg_nonpos2
4903 mult_neg now named mult_neg_neg
4904 mult_neg_le now named mult_nonpos_nonpos
4906 * The following lemmas in Ring_and_Field have been added to the simplifier:
4909 not_square_less_zero
4911 The following lemmas have been deleted from Real/RealPow:
4921 * Theory Parity: added rules for simplifying exponents.
4925 The following theorems have been eliminated or modified
4928 list_all_Nil now named list_all.simps(1)
4929 list_all_Cons now named list_all.simps(2)
4930 list_all_conv now named list_all_iff
4931 set_mem_eq now named mem_iff
4933 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4934 asymptotic "big O" calculations. See the notes in BigO.thy.
4939 * Theory RealDef: better support for embedding natural numbers and
4940 integers in the reals.
4942 The following theorems have been eliminated or modified
4945 exp_ge_add_one_self now requires no hypotheses
4946 real_of_int_add reversed direction of equality (use [symmetric])
4947 real_of_int_minus reversed direction of equality (use [symmetric])
4948 real_of_int_diff reversed direction of equality (use [symmetric])
4949 real_of_int_mult reversed direction of equality (use [symmetric])
4951 * Theory RComplete: expanded support for floor and ceiling functions.
4953 * Theory Ln is new, with properties of the natural logarithm
4955 * Hyperreal: There is a new type constructor "star" for making
4956 nonstandard types. The old type names are now type synonyms:
4960 hcomplex = complex star
4962 * Hyperreal: Many groups of similarly-defined constants have been
4963 replaced by polymorphic versions (INCOMPATIBILITY):
4965 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4967 starset <-- starsetNat, starsetC
4968 *s* <-- *sNat*, *sc*
4969 starset_n <-- starsetNat_n, starsetC_n
4970 *sn* <-- *sNatn*, *scn*
4971 InternalSets <-- InternalNatSets, InternalCSets
4973 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4974 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4975 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4976 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4977 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4979 * Hyperreal: Many type-specific theorems have been removed in favor of
4980 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4982 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4983 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4984 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4985 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4986 right_minus <-- hypreal_add_minus
4987 left_minus <-- {hypreal,hcomplex}_add_minus_left
4988 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4989 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4990 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4991 mult_1_right <-- hcomplex_mult_one_right
4992 mult_zero_left <-- hcomplex_mult_zero_left
4993 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4994 right_distrib <-- hypnat_add_mult_distrib2
4995 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4996 right_inverse <-- hypreal_mult_inverse
4997 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4998 order_refl <-- {hypreal,hypnat}_le_refl
4999 order_trans <-- {hypreal,hypnat}_le_trans
5000 order_antisym <-- {hypreal,hypnat}_le_anti_sym
5001 order_less_le <-- {hypreal,hypnat}_less_le
5002 linorder_linear <-- {hypreal,hypnat}_le_linear
5003 add_left_mono <-- {hypreal,hypnat}_add_left_mono
5004 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
5005 add_nonneg_nonneg <-- hypreal_le_add_order
5007 * Hyperreal: Separate theorems having to do with type-specific
5008 versions of constants have been merged into theorems that apply to the
5009 new polymorphic constants (INCOMPATIBILITY):
5011 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
5012 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
5013 STAR_Un <-- {STAR,NatStar,STARC}_Un
5014 STAR_Int <-- {STAR,NatStar,STARC}_Int
5015 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
5016 STAR_subset <-- {STAR,NatStar,STARC}_subset
5017 STAR_mem <-- {STAR,NatStar,STARC}_mem
5018 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
5019 STAR_diff <-- {STAR,STARC}_diff
5020 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
5021 STARC_hcomplex_of_complex}_image_subset
5022 starset_n_Un <-- starset{Nat,C}_n_Un
5023 starset_n_Int <-- starset{Nat,C}_n_Int
5024 starset_n_Compl <-- starset{Nat,C}_n_Compl
5025 starset_n_diff <-- starset{Nat,C}_n_diff
5026 InternalSets_Un <-- Internal{Nat,C}Sets_Un
5027 InternalSets_Int <-- Internal{Nat,C}Sets_Int
5028 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
5029 InternalSets_diff <-- Internal{Nat,C}Sets_diff
5030 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
5031 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
5032 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
5033 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
5034 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
5035 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5036 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
5037 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
5038 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
5039 starfun_diff <-- starfun{C,RC,CR}_diff
5040 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
5041 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
5042 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
5043 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
5044 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
5045 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
5046 starfun_Id <-- starfunC_Id
5047 starfun_approx <-- starfun{Nat,CR}_approx
5048 starfun_capprox <-- starfun{C,RC}_capprox
5049 starfun_abs <-- starfunNat_rabs
5050 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
5051 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
5052 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
5053 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
5054 starfun_add_capprox <-- starfun{C,RC}_add_capprox
5055 starfun_add_approx <-- starfunCR_add_approx
5056 starfun_inverse_inverse <-- starfunC_inverse_inverse
5057 starfun_divide <-- starfun{C,CR,RC}_divide
5058 starfun_n <-- starfun{Nat,C}_n
5059 starfun_n_mult <-- starfun{Nat,C}_n_mult
5060 starfun_n_add <-- starfun{Nat,C}_n_add
5061 starfun_n_add_minus <-- starfunNat_n_add_minus
5062 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
5063 starfun_n_minus <-- starfun{Nat,C}_n_minus
5064 starfun_n_eq <-- starfun{Nat,C}_n_eq
5066 star_n_add <-- {hypreal,hypnat,hcomplex}_add
5067 star_n_minus <-- {hypreal,hcomplex}_minus
5068 star_n_diff <-- {hypreal,hcomplex}_diff
5069 star_n_mult <-- {hypreal,hcomplex}_mult
5070 star_n_inverse <-- {hypreal,hcomplex}_inverse
5071 star_n_le <-- {hypreal,hypnat}_le
5072 star_n_less <-- {hypreal,hypnat}_less
5073 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
5074 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
5075 star_n_abs <-- hypreal_hrabs
5076 star_n_divide <-- hcomplex_divide
5078 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
5079 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
5080 star_of_diff <-- hypreal_of_real_diff
5081 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
5082 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
5083 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
5084 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
5085 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
5086 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
5087 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
5088 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
5089 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
5090 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
5091 star_of_number_of <-- {hypreal,hcomplex}_number_of
5092 star_of_number_less <-- number_of_less_hypreal_of_real_iff
5093 star_of_number_le <-- number_of_le_hypreal_of_real_iff
5094 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
5095 star_of_less_number <-- hypreal_of_real_less_number_of_iff
5096 star_of_le_number <-- hypreal_of_real_le_number_of_iff
5097 star_of_power <-- hypreal_of_real_power
5098 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
5100 * Hyperreal: new method "transfer" that implements the transfer
5101 principle of nonstandard analysis. With a subgoal that mentions
5102 nonstandard types like "'a star", the command "apply transfer"
5103 replaces it with an equivalent one that mentions only standard types.
5104 To be successful, all free variables must have standard types; non-
5105 standard variables must have explicit universal quantifiers.
5107 * Hyperreal: A theory of Taylor series.
5112 * Discontinued special version of 'constdefs' (which used to support
5113 continuous functions) in favor of the general Pure one with full
5116 * New simplification procedure for solving continuity conditions; it
5117 is much faster on terms with many nested lambda abstractions (cubic
5118 instead of exponential time).
5120 * New syntax for domain package: selector names are now optional.
5121 Parentheses should be omitted unless argument is lazy, for example:
5123 domain 'a stream = cons "'a" (lazy "'a stream")
5125 * New command 'fixrec' for defining recursive functions with pattern
5126 matching; defining multiple functions with mutual recursion is also
5127 supported. Patterns may include the constants cpair, spair, up, sinl,
5128 sinr, or any data constructor defined by the domain package. The given
5129 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
5130 syntax and examples.
5132 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
5133 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
5134 but the proof obligation additionally includes an admissibility
5135 requirement. The packages generate instances of class cpo or pcpo,
5136 with continuity and strictness theorems for Rep and Abs.
5138 * HOLCF: Many theorems have been renamed according to a more standard naming
5139 scheme (INCOMPATIBILITY):
5141 foo_inject: "foo$x = foo$y ==> x = y"
5142 foo_eq: "(foo$x = foo$y) = (x = y)"
5143 foo_less: "(foo$x << foo$y) = (x << y)"
5144 foo_strict: "foo$UU = UU"
5145 foo_defined: "... ==> foo$x ~= UU"
5146 foo_defined_iff: "(foo$x = UU) = (x = UU)"
5151 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
5152 including the First Isomorphism Theorem (on quotienting by the kernel
5155 * ZF/Simplifier: install second copy of type solver that actually
5156 makes use of TC rules declared to Isar proof contexts (or locales);
5157 the old version is still required for ML proof scripts.
5162 * Converted to Isar theory format; use locales instead of axiomatic
5168 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
5171 * Pure/library.ML no longer defines its own option datatype, but uses
5172 that of the SML basis, which has constructors NONE and SOME instead of
5173 None and Some, as well as exception Option.Option instead of OPTION.
5174 The functions the, if_none, is_some, is_none have been adapted
5175 accordingly, while Option.map replaces apsome.
5177 * Pure/library.ML: the exception LIST has been given up in favour of
5178 the standard exceptions Empty and Subscript, as well as
5179 Library.UnequalLengths. Function like Library.hd and Library.tl are
5180 superceded by the standard hd and tl functions etc.
5182 A number of basic list functions are no longer exported to the ML
5183 toplevel, as they are variants of predefined functions. The following
5184 suggests how one can translate existing code:
5186 rev_append xs ys = List.revAppend (xs, ys)
5187 nth_elem (i, xs) = List.nth (xs, i)
5188 last_elem xs = List.last xs
5189 flat xss = List.concat xss
5190 seq fs = List.app fs
5191 partition P xs = List.partition P xs
5192 mapfilter f xs = List.mapPartial f xs
5194 * Pure/library.ML: several combinators for linear functional
5195 transformations, notably reverse application and composition:
5198 (x, y) |-> f f #-> g
5200 * Pure/library.ML: introduced/changed precedence of infix operators:
5202 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
5204 infix 3 o oo ooo oooo;
5205 infix 4 ~~ upto downto;
5207 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
5210 * Pure/library.ML: natural list combinators fold, fold_rev, and
5211 fold_map support linear functional transformations and nesting. For
5214 fold f [x1, ..., xN] y =
5215 y |> f x1 |> ... |> f xN
5217 (fold o fold) f [xs1, ..., xsN] y =
5218 y |> fold f xs1 |> ... |> fold f xsN
5220 fold f [x1, ..., xN] =
5223 (fold o fold) f [xs1, ..., xsN] =
5224 fold f xs1 #> ... #> fold f xsN
5226 * Pure/library.ML: the following selectors on type 'a option are
5229 the: 'a option -> 'a (*partial*)
5230 these: 'a option -> 'a where 'a = 'b list
5231 the_default: 'a -> 'a option -> 'a
5232 the_list: 'a option -> 'a list
5234 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5235 basic operations for association lists, following natural argument
5236 order; moreover the explicit equality predicate passed here avoids
5237 potentially expensive polymorphic runtime equality checks.
5238 The old functions may be expressed as follows:
5240 assoc = uncurry (AList.lookup (op =))
5241 assocs = these oo AList.lookup (op =)
5242 overwrite = uncurry (AList.update (op =)) o swap
5244 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5246 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
5247 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
5249 replacing make_keylist and keyfilter (occassionally used)
5252 make_keylist = AList.make
5253 keyfilter = AList.find (op =)
5255 * eq_fst and eq_snd now take explicit equality parameter, thus
5256 avoiding eqtypes. Naive rewrites:
5258 eq_fst = eq_fst (op =)
5259 eq_snd = eq_snd (op =)
5261 * Removed deprecated apl and apr (rarely used).
5264 apl (n, op) =>>= curry op n
5265 apr (op, m) =>>= fn n => op (n, m)
5267 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
5268 provides a reasonably efficient light-weight implementation of sets as
5271 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
5272 few new operations; existing lookup and update are now curried to
5273 follow natural argument order (for use with fold etc.);
5274 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
5276 * Pure/General: output via the Isabelle channels of
5277 writeln/warning/error etc. is now passed through Output.output, with a
5278 hook for arbitrary transformations depending on the print_mode
5279 (cf. Output.add_mode -- the first active mode that provides a output
5280 function wins). Already formatted output may be embedded into further
5281 text via Output.raw; the result of Pretty.string_of/str_of and derived
5282 functions (string_of_term/cterm/thm etc.) is already marked raw to
5283 accommodate easy composition of diagnostic messages etc. Programmers
5284 rarely need to care about Output.output or Output.raw at all, with
5285 some notable exceptions: Output.output is required when bypassing the
5286 standard channels (writeln etc.), or in token translations to produce
5287 properly formatted results; Output.raw is required when capturing
5288 already output material that will eventually be presented to the user
5289 a second time. For the default print mode, both Output.output and
5290 Output.raw have no effect.
5292 * Pure/General: Output.time_accumulator NAME creates an operator ('a
5293 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
5294 cumulative results are displayed at the end of a batch session.
5296 * Pure/General: File.sysify_path and File.quote_sysify path have been
5297 replaced by File.platform_path and File.shell_path (with appropriate
5298 hooks). This provides a clean interface for unusual systems where the
5299 internal and external process view of file names are different.
5301 * Pure: more efficient orders for basic syntactic entities: added
5302 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
5303 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
5304 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
5305 orders now -- potential INCOMPATIBILITY for code that depends on a
5306 particular order for Symtab.keys, Symtab.dest, etc. (consider using
5307 Library.sort_strings on result).
5309 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
5310 fold_types traverse types/terms from left to right, observing natural
5311 argument order. Supercedes previous foldl_XXX versions, add_frees,
5312 add_vars etc. have been adapted as well: INCOMPATIBILITY.
5314 * Pure: name spaces have been refined, with significant changes of the
5315 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
5316 to extern(_table). The plain name entry path is superceded by a
5317 general 'naming' context, which also includes the 'policy' to produce
5318 a fully qualified name and external accesses of a fully qualified
5319 name; NameSpace.extend is superceded by context dependent
5320 Sign.declare_name. Several theory and proof context operations modify
5321 the naming context. Especially note Theory.restore_naming and
5322 ProofContext.restore_naming to get back to a sane state; note that
5323 Theory.add_path is no longer sufficient to recover from
5324 Theory.absolute_path in particular.
5326 * Pure: new flags short_names (default false) and unique_names
5327 (default true) for controlling output of qualified names. If
5328 short_names is set, names are printed unqualified. If unique_names is
5329 reset, the name prefix is reduced to the minimum required to achieve
5330 the original result when interning again, even if there is an overlap
5331 with earlier declarations.
5333 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
5334 now 'extend', and 'merge' gets an additional Pretty.pp argument
5335 (useful for printing error messages). INCOMPATIBILITY.
5337 * Pure: major reorganization of the theory context. Type Sign.sg and
5338 Theory.theory are now identified, referring to the universal
5339 Context.theory (see Pure/context.ML). Actual signature and theory
5340 content is managed as theory data. The old code and interfaces were
5341 spread over many files and structures; the new arrangement introduces
5342 considerable INCOMPATIBILITY to gain more clarity:
5344 Context -- theory management operations (name, identity, inclusion,
5345 parents, ancestors, merge, etc.), plus generic theory data;
5347 Sign -- logical signature and syntax operations (declaring consts,
5348 types, etc.), plus certify/read for common entities;
5350 Theory -- logical theory operations (stating axioms, definitions,
5351 oracles), plus a copy of logical signature operations (consts,
5352 types, etc.); also a few basic management operations (Theory.copy,
5355 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
5356 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
5357 for convenience -- they merely return the theory.
5359 * Pure: type Type.tsig is superceded by theory in most interfaces.
5361 * Pure: the Isar proof context type is already defined early in Pure
5362 as Context.proof (note that ProofContext.context and Proof.context are
5363 aliases, where the latter is the preferred name). This enables other
5364 Isabelle components to refer to that type even before Isar is present.
5366 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
5367 typeK, constK, axiomK, oracleK), but provide explicit operations for
5368 any of these kinds. For example, Sign.intern typeK is now
5369 Sign.intern_type, Theory.hide_space Sign.typeK is now
5370 Theory.hide_types. Also note that former
5371 Theory.hide_classes/types/consts are now
5372 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
5373 internalize their arguments! INCOMPATIBILITY.
5375 * Pure: get_thm interface (of PureThy and ProofContext) expects
5376 datatype thmref (with constructors Name and NameSelection) instead of
5377 plain string -- INCOMPATIBILITY;
5379 * Pure: cases produced by proof methods specify options, where NONE
5380 means to remove case bindings -- INCOMPATIBILITY in
5383 * Pure: the following operations retrieve axioms or theorems from a
5384 theory node or theory hierarchy, respectively:
5386 Theory.axioms_of: theory -> (string * term) list
5387 Theory.all_axioms_of: theory -> (string * term) list
5388 PureThy.thms_of: theory -> (string * thm) list
5389 PureThy.all_thms_of: theory -> (string * thm) list
5391 * Pure: print_tac now outputs the goal through the trace channel.
5393 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
5394 Reference Toplevel.debug (default false) controls detailed printing
5395 and tracing of low-level exceptions; Toplevel.profiling (default 0)
5396 controls execution profiling -- set to 1 for time and 2 for space
5397 (both increase the runtime).
5399 * Isar session: The initial use of ROOT.ML is now always timed,
5400 i.e. the log will show the actual process times, in contrast to the
5401 elapsed wall-clock time that the outer shell wrapper produces.
5403 * Simplifier: improved handling of bound variables (nameless
5404 representation, avoid allocating new strings). Simprocs that invoke
5405 the Simplifier recursively should use Simplifier.inherit_bounds to
5406 avoid local name clashes. Failure to do so produces warnings
5407 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
5408 for further details.
5410 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
5411 bindings for all theorems stored within a given theory; this may help
5412 in porting non-Isar theories to Isar ones, while keeping ML proof
5413 scripts for the time being.
5415 * ML operator HTML.with_charset specifies the charset begin used for
5416 generated HTML files. For example:
5418 HTML.with_charset "utf-8" use_thy "Hebrew";
5419 HTML.with_charset "utf-8" use_thy "Chinese";
5424 * Allow symlinks to all proper Isabelle executables (Isabelle,
5425 isabelle, isatool etc.).
5427 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
5428 isatool doc, isatool mkdir, display_drafts etc.).
5430 * isatool usedir: option -f allows specification of the ML file to be
5431 used by Isabelle; default is ROOT.ML.
5433 * New isatool version outputs the version identifier of the Isabelle
5434 distribution being used.
5436 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
5437 (containing Boolean satisfiability problems) into Isabelle/HOL
5442 New in Isabelle2004 (April 2004)
5443 --------------------------------
5447 * Provers/order.ML: new efficient reasoner for partial and linear orders.
5448 Replaces linorder.ML.
5450 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
5451 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
5452 (\<a>...\<z>), are now considered normal letters, and can therefore
5453 be used anywhere where an ASCII letter (a...zA...Z) has until
5454 now. COMPATIBILITY: This obviously changes the parsing of some
5455 terms, especially where a symbol has been used as a binder, say
5456 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
5457 as an identifier. Fix it by inserting a space around former
5458 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
5459 existing theory and ML files.
5461 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
5463 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
5464 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
5465 a normal (but invisible) letter. For multiple letter subscripts repeat
5466 \<^isub> like this: x\<^isub>1\<^isub>2.
5468 * Pure: There are now sub-/superscripts that can span more than one
5469 character. Text between \<^bsub> and \<^esub> is set in subscript in
5470 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
5471 superscript. The new control characters are not identifier parts.
5473 * Pure: Control-symbols of the form \<^raw:...> will literally print the
5474 content of "..." to the latex file instead of \isacntrl... . The "..."
5475 may consist of any printable characters excluding the end bracket >.
5477 * Pure: Using new Isar command "finalconsts" (or the ML functions
5478 Theory.add_finals or Theory.add_finals_i) it is now possible to
5479 declare constants "final", which prevents their being given a definition
5480 later. It is useful for constants whose behaviour is fixed axiomatically
5481 rather than definitionally, such as the meta-logic connectives.
5483 * Pure: 'instance' now handles general arities with general sorts
5484 (i.e. intersections of classes),
5486 * Presentation: generated HTML now uses a CSS style sheet to make layout
5487 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
5488 It can be changed to alter the colors/layout of generated pages.
5493 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
5494 cut_tac, subgoal_tac and thin_tac:
5495 - Now understand static (Isar) contexts. As a consequence, users of Isar
5496 locales are no longer forced to write Isar proof scripts.
5497 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
5499 - INCOMPATIBILITY: names of variables to be instantiated may no
5500 longer be enclosed in quotes. Instead, precede variable name with `?'.
5501 This is consistent with the instantiation attribute "where".
5503 * Attributes "where" and "of":
5504 - Now take type variables of instantiated theorem into account when reading
5505 the instantiation string. This fixes a bug that caused instantiated
5506 theorems to have too special types in some circumstances.
5507 - "where" permits explicit instantiations of type variables.
5509 * Calculation commands "moreover" and "also" no longer interfere with
5510 current facts ("this"), admitting arbitrary combinations with "then"
5514 - Goal statements involving the context element "includes" no longer
5515 generate theorems with internal delta predicates (those ending on
5516 "_axioms") in the premise.
5517 Resolve particular premise with <locale>.intro to obtain old form.
5518 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
5519 specification and "includes" elements in goal statement.
5520 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
5521 [intro?] and [elim?] (respectively) by default.
5522 - Experimental command for instantiation of locales in proof contexts:
5523 instantiate <label>[<attrs>]: <loc>
5524 Instantiates locale <loc> and adds all its theorems to the current context
5525 taking into account their attributes. Label and attrs are optional
5526 modifiers, like in theorem declarations. If present, names of
5527 instantiated theorems are qualified with <label>, and the attributes
5528 <attrs> are applied after any attributes these theorems might have already.
5529 If the locale has assumptions, a chained fact of the form
5530 "<loc> t1 ... tn" is expected from which instantiations of the parameters
5531 are derived. The command does not support old-style locales declared
5532 with "locale (open)".
5533 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
5535 * HOL: Tactic emulation methods induct_tac and case_tac understand static
5541 * Proof import: new image HOL4 contains the imported library from
5542 the HOL4 system with about 2500 theorems. It is imported by
5543 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
5544 can be used like any other Isabelle image. See
5545 HOL/Import/HOL/README for more information.
5548 - Much improved handling of linear and partial orders.
5549 Reasoners for linear and partial orders are set up for type classes
5550 "linorder" and "order" respectively, and are added to the default simpset
5551 as solvers. This means that the simplifier can build transitivity chains
5552 to solve goals from the assumptions.
5553 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
5554 of blast or auto after simplification become unnecessary because the goal
5555 is solved by simplification already.
5557 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
5558 all proved in axiomatic type classes for semirings, rings and fields.
5561 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
5562 now formalized using the Ring_and_Field theory mentioned above.
5563 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
5564 than before, because now they are set up once in a generic manner.
5565 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
5566 Look for the general versions in Ring_and_Field (and Power if they concern
5569 * Type "rat" of the rational numbers is now available in HOL-Complex.
5572 - Record types are now by default printed with their type abbreviation
5573 instead of the list of all field types. This can be configured via
5574 the reference "print_record_type_abbr".
5575 - Simproc "record_upd_simproc" for simplification of multiple updates added
5576 (not enabled by default).
5577 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
5578 EX x. x = sel r to True (not enabled by default).
5579 - Tactic "record_split_simp_tac" to split and simplify records added.
5581 * 'specification' command added, allowing for definition by
5582 specification. There is also an 'ax_specification' command that
5583 introduces the new constants axiomatically.
5585 * arith(_tac) is now able to generate counterexamples for reals as well.
5587 * HOL-Algebra: new locale "ring" for non-commutative rings.
5589 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
5590 definitions, thanks to Sava Krsti\'{c} and John Matthews.
5592 * HOL-Matrix: a first theory for matrices in HOL with an application of
5593 matrix theory to linear programming.
5595 * Unions and Intersections:
5596 The latex output syntax of UN and INT has been changed
5597 from "\Union x \in A. B" to "\Union_{x \in A} B"
5598 i.e. the index formulae has become a subscript.
5599 Similarly for "\Union x. B", and for \Inter instead of \Union.
5601 * Unions and Intersections over Intervals:
5602 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
5603 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
5604 like in normal math, and corresponding versions for < and for intersection.
5606 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
5607 lexicographic dictonary ordering has been added as "lexord".
5609 * ML: the legacy theory structures Int and List have been removed. They had
5610 conflicted with ML Basis Library structures having the same names.
5612 * 'refute' command added to search for (finite) countermodels. Only works
5613 for a fragment of HOL. The installation of an external SAT solver is
5614 highly recommended. See "HOL/Refute.thy" for details.
5616 * 'quickcheck' command: Allows to find counterexamples by evaluating
5617 formulae under an assignment of free variables to random values.
5618 In contrast to 'refute', it can deal with inductive datatypes,
5619 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
5625 * Streams now come with concatenation and are part of the HOLCF image
5629 New in Isabelle2003 (May 2003)
5630 ------------------------------
5634 * Provers/simplifier:
5636 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
5637 Assumptions are now subject to complete mutual simplification,
5638 not just from left to right. The simplifier now preserves
5639 the order of assumptions.
5641 Potential INCOMPATIBILITY:
5643 -- simp sometimes diverges where the old version did
5644 not, e.g. invoking simp on the goal
5646 [| P (f x); y = x; f x = f y |] ==> Q
5648 now gives rise to the infinite reduction sequence
5650 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
5652 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
5655 -- Tactics combining classical reasoner and simplification (such as auto)
5656 are also affected by this change, because many of them rely on
5657 simp. They may sometimes diverge as well or yield a different numbers
5658 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
5659 in case of problems. Sometimes subsequent calls to the classical
5660 reasoner will fail because a preceeding call to the simplifier too
5661 eagerly simplified the goal, e.g. deleted redundant premises.
5663 - The simplifier trace now shows the names of the applied rewrite rules
5665 - You can limit the number of recursive invocations of the simplifier
5666 during conditional rewriting (where the simplifie tries to solve the
5667 conditions before applying the rewrite rule):
5668 ML "simp_depth_limit := n"
5669 where n is an integer. Thus you can force termination where previously
5670 the simplifier would diverge.
5672 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5674 - No longer aborts on failed congruence proof. Instead, the
5675 congruence is ignored.
5677 * Pure: New generic framework for extracting programs from constructive
5678 proofs. See HOL/Extraction.thy for an example instantiation, as well
5679 as HOL/Extraction for some case studies.
5681 * Pure: The main goal of the proof state is no longer shown by default, only
5682 the subgoals. This behaviour is controlled by a new flag.
5683 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5684 (ML: Proof.show_main_goal).
5686 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5687 rules whose conclusion matches subgoal 1:
5688 PG menu: Isabelle/Isar -> Show me -> matching rules
5689 The rules are ordered by how closely they match the subgoal.
5690 In particular, rules that solve a subgoal outright are displayed first
5691 (or rather last, the way they are printed).
5692 (ML: ProofGeneral.print_intros())
5694 * Pure: New flag trace_unify_fail causes unification to print
5695 diagnostic information (PG: in trace buffer) when it fails. This is
5696 useful for figuring out why single step proofs like rule, erule or
5699 * Pure: Locale specifications now produce predicate definitions
5700 according to the body of text (covering assumptions modulo local
5701 definitions); predicate "loc_axioms" covers newly introduced text,
5702 while "loc" is cumulative wrt. all included locale expressions; the
5703 latter view is presented only on export into the global theory
5704 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5705 on the old view without predicates;
5707 * Pure: predefined locales "var" and "struct" are useful for sharing
5708 parameters (as in CASL, for example); just specify something like
5709 ``var x + var y + struct M'' as import;
5711 * Pure: improved thms_containing: proper indexing of facts instead of
5712 raw theorems; check validity of results wrt. current name space;
5713 include local facts of proof configuration (also covers active
5714 locales), cover fixed variables in index; may use "_" in term
5715 specification; an optional limit for the number of printed facts may
5716 be given (the default is 40);
5718 * Pure: disallow duplicate fact bindings within new-style theory files
5721 * Provers: improved induct method: assumptions introduced by case
5722 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5723 the goal statement); "foo" still refers to all facts collectively;
5725 * Provers: the function blast.overloaded has been removed: all constants
5726 are regarded as potentially overloaded, which improves robustness in exchange
5727 for slight decrease in efficiency;
5729 * Provers/linorder: New generic prover for transitivity reasoning over
5730 linear orders. Note: this prover is not efficient!
5732 * Isar: preview of problems to finish 'show' now produce an error
5733 rather than just a warning (in interactive mode);
5740 - Produces a counter example if it cannot prove a goal.
5741 Note that the counter example may be spurious if the goal is not a formula
5742 of quantifier-free linear arithmetic.
5743 In ProofGeneral the counter example appears in the trace buffer.
5745 - Knows about div k and mod k where k is a numeral of type nat or int.
5747 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5748 linear arithmetic fails. This takes account of quantifiers and divisibility.
5749 Presburger arithmetic can also be called explicitly via presburger(_tac).
5751 * simp's arithmetic capabilities have been enhanced a bit: it now
5752 takes ~= in premises into account (by performing a case split);
5754 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5755 are distributed over a sum of terms;
5757 * New tactic "trans_tac" and method "trans" instantiate
5758 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5761 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5762 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5764 * 'typedef' command has new option "open" to suppress the set
5767 * functions Min and Max on finite sets have been introduced (theory
5770 * attribute [symmetric] now works for relations as well; it turns
5771 (x,y) : R^-1 into (y,x) : R, and vice versa;
5773 * induct over a !!-quantified statement (say !!x1..xn):
5774 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5776 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5777 %x. None. Warning: empty_def now refers to the previously hidden definition
5780 * Algebra: formalization of classical algebra. Intended as base for
5781 any algebraic development in Isabelle. Currently covers group theory
5782 (up to Sylow's theorem) and ring theory (Universal Property of
5783 Univariate Polynomials). Contributions welcome;
5785 * GroupTheory: deleted, since its material has been moved to Algebra;
5787 * Complex: new directory of the complex numbers with numeric constants,
5788 nonstandard complex numbers, and some complex analysis, standard and
5789 nonstandard (Jacques Fleuriot);
5791 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5793 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5796 * Real/HahnBanach: updated and adapted to locales;
5798 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5801 * UNITY: added the Meier-Sanders theory of progress sets;
5803 * MicroJava: bytecode verifier and lightweight bytecode verifier
5804 as abstract algorithms, instantiated to the JVM;
5806 * Bali: Java source language formalization. Type system, operational
5807 semantics, axiomatic semantics. Supported language features:
5808 classes, interfaces, objects,virtual methods, static methods,
5809 static/instance fields, arrays, access modifiers, definite
5810 assignment, exceptions.
5815 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5818 * Main ZF: virtually all theories converted to new-style format;
5823 * Pure: Tactic.prove provides sane interface for internal proofs;
5824 omits the infamous "standard" operation, so this is more appropriate
5825 than prove_goalw_cterm in many situations (e.g. in simprocs);
5827 * Pure: improved error reporting of simprocs;
5829 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5833 *** Document preparation ***
5835 * uses \par instead of \\ for line breaks in theory text. This may
5836 shift some page breaks in large documents. To get the old behaviour
5837 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5839 * minimized dependencies of isabelle.sty and isabellesym.sty on
5842 * \<euro> now needs package babel/greek instead of marvosym (which
5845 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5850 New in Isabelle2002 (March 2002)
5851 --------------------------------
5853 *** Document preparation ***
5855 * greatly simplified document preparation setup, including more
5856 graceful interpretation of isatool usedir -i/-d/-D options, and more
5857 instructive isatool mkdir; users should basically be able to get
5858 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5859 users may run a separate document processing stage manually like this:
5860 "isatool usedir -D output HOL Test && isatool document Test/output";
5862 * theory dependency graph may now be incorporated into documents;
5863 isatool usedir -g true will produce session_graph.eps/.pdf for use
5864 with \includegraphics of LaTeX;
5866 * proper spacing of consecutive markup elements, especially text
5867 blocks after section headings;
5869 * support bold style (for single symbols only), input syntax is like
5870 this: "\<^bold>\<alpha>" or "\<^bold>A";
5872 * \<bullet> is now output as bold \cdot by default, which looks much
5873 better in printed text;
5875 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5876 note that these symbols are currently unavailable in Proof General /
5877 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5879 * isatool latex no longer depends on changed TEXINPUTS, instead
5880 isatool document copies the Isabelle style files to the target
5886 * Pure/Provers: improved proof by cases and induction;
5887 - 'case' command admits impromptu naming of parameters (such as
5889 - 'induct' method divinates rule instantiation from the inductive
5890 claim; no longer requires excessive ?P bindings for proper
5891 instantiation of cases;
5892 - 'induct' method properly enumerates all possibilities of set/type
5893 rules; as a consequence facts may be also passed through *type*
5894 rules without further ado;
5895 - 'induct' method now derives symbolic cases from the *rulified*
5896 rule (before it used to rulify cases stemming from the internal
5897 atomized version); this means that the context of a non-atomic
5898 statement becomes is included in the hypothesis, avoiding the
5899 slightly cumbersome show "PROP ?case" form;
5900 - 'induct' may now use elim-style induction rules without chaining
5901 facts, using ``missing'' premises from the goal state; this allows
5902 rules stemming from inductive sets to be applied in unstructured
5903 scripts, while still benefitting from proper handling of non-atomic
5904 statements; NB: major inductive premises need to be put first, all
5905 the rest of the goal is passed through the induction;
5906 - 'induct' proper support for mutual induction involving non-atomic
5907 rule statements (uses the new concept of simultaneous goals, see
5909 - append all possible rule selections, but only use the first
5910 success (no backtracking);
5911 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5912 - undeclared rule case names default to numbers 1, 2, 3, ...;
5913 - added 'print_induct_rules' (covered by help item in recent Proof
5915 - moved induct/cases attributes to Pure, methods to Provers;
5916 - generic method setup instantiated for FOL and HOL;
5918 * Pure: support multiple simultaneous goal statements, for example
5919 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5920 meta-level mechanism, this acts as if several individual goals had
5921 been stated separately; in particular common proof methods need to be
5922 repeated in order to cover all claims; note that a single elimination
5923 step is *not* sufficient to establish the two conjunctions, so this
5926 assume "A & B" then have A and B .. (*".." fails*)
5928 better use "obtain" in situations as above; alternative refer to
5929 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5931 * Pure: proper integration with ``locales''; unlike the original
5932 version by Florian Kammller, Isar locales package high-level proof
5933 contexts rather than raw logical ones (e.g. we admit to include
5934 attributes everywhere); operations on locales include merge and
5935 rename; support for implicit arguments (``structures''); simultaneous
5936 type-inference over imports and text; see also HOL/ex/Locales.thy for
5939 * Pure: the following commands have been ``localized'', supporting a
5940 target locale specification "(in name)": 'lemma', 'theorem',
5941 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5942 stored both within the locale and at the theory level (exported and
5943 qualified by the locale name);
5945 * Pure: theory goals may now be specified in ``long'' form, with
5946 ad-hoc contexts consisting of arbitrary locale elements. for example
5947 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5948 definitions may be given, too); the result is a meta-level rule with
5949 the context elements being discharged in the obvious way;
5951 * Pure: new proof command 'using' allows to augment currently used
5952 facts after a goal statement ('using' is syntactically analogous to
5953 'apply', but acts on the goal's facts only); this allows chained facts
5954 to be separated into parts given before and after a claim, as in
5955 ``from a and b have C using d and e <proof>'';
5957 * Pure: renamed "antecedent" case to "rule_context";
5959 * Pure: new 'judgment' command records explicit information about the
5960 object-logic embedding (used by several tools internally); no longer
5961 use hard-wired "Trueprop";
5963 * Pure: added 'corollary' command;
5965 * Pure: fixed 'token_translation' command;
5967 * Pure: removed obsolete 'exported' attribute;
5969 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5970 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5971 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5973 * Pure: method 'atomize' presents local goal premises as object-level
5974 statements (atomic meta-level propositions); setup controlled via
5975 rewrite rules declarations of 'atomize' attribute; example
5976 application: 'induct' method with proper rule statements in improper
5979 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5980 now consider the syntactic context of assumptions, giving a better
5981 chance to get type-inference of the arguments right (this is
5982 especially important for locales);
5984 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5987 * Pure/obtain: the formal conclusion "thesis", being marked as
5988 ``internal'', may no longer be reference directly in the text;
5989 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5992 * Pure: generic 'sym' attribute which declares a rule both as pure
5993 'elim?' and for the 'symmetric' operation;
5995 * Pure: marginal comments ``--'' may now occur just anywhere in the
5996 text; the fixed correlation with particular command syntax has been
5999 * Pure: new method 'rules' is particularly well-suited for proof
6000 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
6001 but often produces more compact proof terms with less detours;
6003 * Pure/Provers/classical: simplified integration with pure rule
6004 attributes and methods; the classical "intro?/elim?/dest?"
6005 declarations coincide with the pure ones; the "rule" method no longer
6006 includes classically swapped intros; "intro" and "elim" methods no
6007 longer pick rules from the context; also got rid of ML declarations
6008 AddXIs/AddXEs/AddXDs; all of this has some potential for
6011 * Provers/classical: attribute 'swapped' produces classical inversions
6012 of introduction rules;
6014 * Provers/simplifier: 'simplified' attribute may refer to explicit
6015 rules instead of full simplifier context; 'iff' attribute handles
6018 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
6020 * HOL: 'recdef' now fails on unfinished automated proofs, use
6021 "(permissive)" option to recover old behavior;
6023 * HOL: 'inductive' no longer features separate (collective) attributes
6024 for 'intros' (was found too confusing);
6026 * HOL: properly declared induction rules less_induct and
6032 * HOL: moved over to sane numeral syntax; the new policy is as
6035 - 0 and 1 are polymorphic constants, which are defined on any
6036 numeric type (nat, int, real etc.);
6038 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
6039 binary representation internally;
6041 - type nat has special constructor Suc, and generally prefers Suc 0
6042 over 1::nat and Suc (Suc 0) over 2::nat;
6044 This change may cause significant problems of INCOMPATIBILITY; here
6045 are some hints on converting existing sources:
6047 - due to the new "num" token, "-0" and "-1" etc. are now atomic
6048 entities, so expressions involving "-" (unary or binary minus) need
6049 to be spaced properly;
6051 - existing occurrences of "1" may need to be constraint "1::nat" or
6052 even replaced by Suc 0; similar for old "2";
6054 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
6056 - remove all special provisions on numerals in proofs;
6058 * HOL: simp rules nat_number expand numerals on nat to Suc/0
6059 representation (depends on bin_arith_simps in the default context);
6061 * HOL: symbolic syntax for x^2 (numeral 2);
6063 * HOL: the class of all HOL types is now called "type" rather than
6064 "term"; INCOMPATIBILITY, need to adapt references to this type class
6065 in axclass/classes, instance/arities, and (usually rare) occurrences
6066 in typings (of consts etc.); internally the class is called
6067 "HOL.type", ML programs should refer to HOLogic.typeS;
6069 * HOL/record package improvements:
6070 - new derived operations "fields" to build a partial record section,
6071 "extend" to promote a fixed record to a record scheme, and
6072 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
6073 declared as simp by default;
6074 - shared operations ("more", "fields", etc.) now need to be always
6075 qualified) --- potential INCOMPATIBILITY;
6076 - removed "make_scheme" operations (use "make" with "extend") --
6078 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
6079 - provides cases/induct rules for use with corresponding Isar
6080 methods (for concrete records, record schemes, concrete more
6081 parts, and schematic more parts -- in that order);
6082 - internal definitions directly based on a light-weight abstract
6083 theory of product types over typedef rather than datatype;
6085 * HOL: generic code generator for generating executable ML code from
6086 specifications; specific support for HOL constructs such as inductive
6087 datatypes and sets, as well as recursive functions; can be invoked
6088 via 'generate_code' theory section;
6090 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
6092 * HOL: consolidated and renamed several theories. In particular:
6093 Ord.thy has been absorbed into HOL.thy
6094 String.thy has been absorbed into List.thy
6096 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
6097 (beware of argument permutation!);
6099 * HOL: linorder_less_split superseded by linorder_cases;
6101 * HOL/List: "nodups" renamed to "distinct";
6103 * HOL: added "The" definite description operator; move Hilbert's "Eps"
6104 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
6105 - Ex_def has changed, now need to use some_eq_ex
6107 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
6108 in this (rare) case use:
6110 delSWrapper "split_all_tac"
6111 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
6113 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
6116 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
6117 Isabelle's type classes, ^ on functions and relations has too general
6118 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
6119 necessary to attach explicit type constraints;
6121 * HOL/Relation: the prefix name of the infix "O" has been changed from
6122 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
6123 renamed accordingly (eg "compI" -> "rel_compI").
6125 * HOL: syntax translations now work properly with numerals and records
6128 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
6129 of "lam" -- INCOMPATIBILITY;
6131 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
6132 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
6133 renamed "Product_Type.unit";
6135 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
6137 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
6138 the "cases" method);
6140 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
6143 * HOL/IMP: updated and converted to new-style theory format; several
6144 parts turned into readable document, with proper Isar proof texts and
6145 some explanations (by Gerwin Klein);
6147 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
6149 * HOL-Hyperreal is now a logic image;
6154 * Isar: consts/constdefs supports mixfix syntax for continuous
6157 * Isar: domain package adapted to new-style theory format, e.g. see
6160 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
6161 potential INCOMPATIBILITY; now use plain induct_tac instead of former
6162 lift.induct_tac, always use UU instead of Undef;
6164 * HOLCF/IMP: updated and converted to new-style theory;
6169 * Isar: proper integration of logic-specific tools and packages,
6170 including theory commands '(co)inductive', '(co)datatype',
6171 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
6172 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
6174 * theory Main no longer includes AC; for the Axiom of Choice, base
6175 your theory on Main_ZFC;
6177 * the integer library now covers quotients and remainders, with many
6178 laws relating division to addition, multiplication, etc.;
6180 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
6181 typeless version of the formalism;
6183 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
6186 * ZF/Induct: new directory for examples of inductive definitions,
6187 including theory Multiset for multiset orderings; converted to
6188 new-style theory format;
6190 * ZF: many new theorems about lists, ordinals, etc.;
6195 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
6196 variable proof controls level of detail: 0 = no proofs (only oracle
6197 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
6198 also ref manual for further ML interfaces;
6200 * Pure/axclass: removed obsolete ML interface
6201 goal_subclass/goal_arity;
6203 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
6204 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
6205 separate tokens, so expressions involving minus need to be spaced
6208 * Pure/syntax: support non-oriented infixes, using keyword "infix"
6209 rather than "infixl" or "infixr";
6211 * Pure/syntax: concrete syntax for dummy type variables admits genuine
6212 sort constraint specifications in type inference; e.g. "x::_::foo"
6213 ensures that the type of "x" is of sort "foo" (but not necessarily a
6216 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
6217 control output of nested => (types); the default behavior is
6220 * Pure/syntax: builtin parse translation for "_constify" turns valued
6221 tokens into AST constants;
6223 * Pure/syntax: prefer later declarations of translations and print
6224 translation functions; potential INCOMPATIBILITY: need to reverse
6225 multiple declarations for same syntax element constant;
6227 * Pure/show_hyps reset by default (in accordance to existing Isar
6230 * Provers/classical: renamed addaltern to addafter, addSaltern to
6233 * Provers/clasimp: ``iff'' declarations now handle conditional rules
6236 * system: tested support for MacOS X; should be able to get Isabelle +
6237 Proof General to work in a plain Terminal after installing Poly/ML
6238 (e.g. from the Isabelle distribution area) and GNU bash alone
6239 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
6240 support requires further installations, e.g. from
6241 http://fink.sourceforge.net/);
6243 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
6245 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
6246 of 40 MB), cf. ML_OPTIONS;
6248 * system: Proof General keywords specification is now part of the
6249 Isabelle distribution (see etc/isar-keywords.el);
6251 * system: support for persistent Proof General sessions (refrain from
6252 outdating all loaded theories on startup); user may create writable
6253 logic images like this: ``isabelle -q HOL Test'';
6255 * system: smart selection of Isabelle process versus Isabelle
6256 interface, accommodates case-insensitive file systems (e.g. HFS+); may
6257 run both "isabelle" and "Isabelle" even if file names are badly
6258 damaged (executable inspects the case of the first letter of its own
6259 name); added separate "isabelle-process" and "isabelle-interface";
6261 * system: refrain from any attempt at filtering input streams; no
6262 longer support ``8bit'' encoding of old isabelle font, instead proper
6263 iso-latin characters may now be used; the related isatools
6264 "symbolinput" and "nonascii" have disappeared as well;
6266 * system: removed old "xterm" interface (the print modes "xterm" and
6267 "xterm_color" are still available for direct use in a suitable
6272 New in Isabelle99-2 (February 2001)
6273 -----------------------------------
6275 *** Overview of INCOMPATIBILITIES ***
6277 * HOL: please note that theories in the Library and elsewhere often use the
6278 new-style (Isar) format; to refer to their theorems in an ML script you must
6279 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
6281 * HOL: inductive package no longer splits induction rule aggressively,
6282 but only as far as specified by the introductions given; the old
6283 format may be recovered via ML function complete_split_rule or attribute
6284 'split_rule (complete)';
6286 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
6287 gfp_Tarski to gfp_unfold;
6289 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
6291 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
6292 relation); infix "^^" has been renamed "``"; infix "``" has been
6293 renamed "`"; "univalent" has been renamed "single_valued";
6295 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
6298 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
6300 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
6302 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
6303 consequence, it is no longer monotonic wrt. the local goal context
6304 (which is now passed through the inductive cases);
6306 * Document preparation: renamed standard symbols \<ll> to \<lless> and
6307 \<gg> to \<ggreater>;
6310 *** Document preparation ***
6312 * \isabellestyle{NAME} selects version of Isabelle output (currently
6313 available: are "it" for near math-mode best-style output, "sl" for
6314 slanted text style, and "tt" for plain type-writer; if no
6315 \isabellestyle command is given, output is according to slanted
6318 * support sub/super scripts (for single symbols only), input syntax is
6319 like this: "A\<^sup>*" or "A\<^sup>\<star>";
6321 * some more standard symbols; see Appendix A of the system manual for
6322 the complete list of symbols defined in isabellesym.sty;
6324 * improved isabelle style files; more abstract symbol implementation
6325 (should now use \isamath{...} and \isatext{...} in custom symbol
6328 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
6329 state; Note that presentation of goal states does not conform to
6330 actual human-readable proof documents. Please do not include goal
6331 states into document output unless you really know what you are doing!
6333 * proper indentation of antiquoted output with proportional LaTeX
6336 * no_document ML operator temporarily disables LaTeX document
6339 * isatool unsymbolize tunes sources for plain ASCII communication;
6344 * Pure: Isar now suffers initial goal statements to contain unbound
6345 schematic variables (this does not conform to actual readable proof
6346 documents, due to unpredictable outcome and non-compositional proof
6347 checking); users who know what they are doing may use schematic goals
6348 for Prolog-style synthesis of proven results;
6350 * Pure: assumption method (an implicit finishing) now handles actual
6353 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
6354 initial goal, declare "that" only as Pure intro (only for single
6355 steps); the "that" rule assumption may now be involved in implicit
6356 finishing, thus ".." becomes a feasible for trivial obtains;
6358 * Pure: default proof step now includes 'intro_classes'; thus trivial
6359 instance proofs may be performed by "..";
6361 * Pure: ?thesis / ?this / "..." now work for pure meta-level
6364 * Pure: more robust selection of calculational rules;
6366 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
6367 rule (as well as the assumption rule);
6369 * Pure: 'thm_deps' command visualizes dependencies of theorems and
6370 lemmas, using the graph browser tool;
6372 * Pure: predict failure of "show" in interactive mode;
6374 * Pure: 'thms_containing' now takes actual terms as arguments;
6376 * HOL: improved method 'induct' --- now handles non-atomic goals
6377 (potential INCOMPATIBILITY); tuned error handling;
6379 * HOL: cases and induct rules now provide explicit hints about the
6380 number of facts to be consumed (0 for "type" and 1 for "set" rules);
6381 any remaining facts are inserted into the goal verbatim;
6383 * HOL: local contexts (aka cases) may now contain term bindings as
6384 well; the 'cases' and 'induct' methods new provide a ?case binding for
6385 the result to be shown in each case;
6387 * HOL: added 'recdef_tc' command;
6389 * isatool convert assists in eliminating legacy ML scripts;
6394 * HOL/Library: a collection of generic theories to be used together
6395 with main HOL; the theory loader path already includes this directory
6396 by default; the following existing theories have been moved here:
6397 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
6398 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
6400 * HOL/Unix: "Some aspects of Unix file-system security", a typical
6401 modelling and verification task performed in Isabelle/HOL +
6402 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
6404 * HOL/Algebra: special summation operator SUM no longer exists, it has
6405 been replaced by setsum; infix 'assoc' now has priority 50 (like
6406 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
6407 'domain', this makes the theory consistent with mathematical
6410 * HOL basics: added overloaded operations "inverse" and "divide"
6411 (infix "/"), syntax for generic "abs" operation, generic summation
6414 * HOL/typedef: simplified package, provide more useful rules (see also
6417 * HOL/datatype: induction rule for arbitrarily branching datatypes is
6418 now expressed as a proper nested rule (old-style tactic scripts may
6419 require atomize_strip_tac to cope with non-atomic premises);
6421 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
6422 to "split_conv" (old name still available for compatibility);
6424 * HOL: improved concrete syntax for strings (e.g. allows translation
6425 rules with string literals);
6427 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
6428 and Fleuriot's mechanization of analysis, including the transcendental
6429 functions for the reals;
6431 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
6436 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
6437 "lam" is displayed as TWO lambda-symbols
6439 * CTT: theory Main now available, containing everything (that is, Bool
6445 * Pure: the Simplifier has been implemented properly as a derived rule
6446 outside of the actual kernel (at last!); the overall performance
6447 penalty in practical applications is about 50%, while reliability of
6448 the Isabelle inference kernel has been greatly improved;
6450 * print modes "brackets" and "no_brackets" control output of nested =>
6451 (types) and ==> (props); the default behaviour is "brackets";
6453 * Provers: fast_tac (and friends) now handle actual object-logic rules
6454 as assumptions as well;
6456 * system: support Poly/ML 4.0;
6458 * system: isatool install handles KDE version 1 or 2;
6462 New in Isabelle99-1 (October 2000)
6463 ----------------------------------
6465 *** Overview of INCOMPATIBILITIES ***
6467 * HOL: simplification of natural numbers is much changed; to partly
6468 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
6469 issue the following ML commands:
6471 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
6472 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
6474 * HOL: simplification no longer dives into case-expressions; this is
6475 controlled by "t.weak_case_cong" for each datatype t;
6477 * HOL: nat_less_induct renamed to less_induct;
6479 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
6480 fixsome to patch .thy and .ML sources automatically;
6482 select_equality -> some_equality
6483 select_eq_Ex -> some_eq_ex
6484 selectI2EX -> someI2_ex
6487 select1_equality -> some1_equality
6488 Eps_sym_eq -> some_sym_eq_trivial
6489 Eps_eq -> some_eq_trivial
6491 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
6493 * HOL: removed obsolete theorem binding expand_if (refer to split_if
6496 * HOL: the recursion equations generated by 'recdef' are now called
6497 f.simps instead of f.rules;
6499 * HOL: qed_spec_mp now also handles bounded ALL as well;
6501 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
6502 sometimes be needed;
6504 * HOL: the constant for "f``x" is now "image" rather than "op ``";
6506 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
6508 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
6509 product is now "<*>" instead of "Times"; the lexicographic product is
6510 now "<*lex*>" instead of "**";
6512 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
6513 of main HOL, but was unused); better use HOL's datatype package;
6515 * HOL: removed "symbols" syntax for constant "override" of theory Map;
6516 the old syntax may be recovered as follows:
6519 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
6520 (infixl "\\<oplus>" 100)
6522 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6524 * HOL/ML: even fewer consts are declared as global (see theories Ord,
6525 Lfp, Gfp, WF); this only affects ML packages that refer to const names
6528 * HOL and ZF: syntax for quotienting wrt an equivalence relation
6529 changed from A/r to A//r;
6531 * ZF: new treatment of arithmetic (nat & int) may break some old
6534 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
6535 rulify -> rule_format, elimify -> elim_format, ...);
6537 * Isar/Provers: intro/elim/dest attributes changed; renamed
6538 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
6539 should have to change intro!! to intro? only); replaced "delrule" by
6542 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
6544 * Provers: strengthened force_tac by using new first_best_tac;
6546 * LaTeX document preparation: several changes of isabelle.sty (see
6550 *** Document preparation ***
6552 * formal comments (text blocks etc.) in new-style theories may now
6553 contain antiquotations of thm/prop/term/typ/text to be presented
6554 according to latex print mode; concrete syntax is like this:
6555 @{term[show_types] "f(x) = a + x"};
6557 * isatool mkdir provides easy setup of Isabelle session directories,
6558 including proper document sources;
6560 * generated LaTeX sources are now deleted after successful run
6561 (isatool document -c); may retain a copy somewhere else via -D option
6564 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
6565 style files, achieving self-contained LaTeX sources and simplifying
6568 * old-style theories now produce (crude) LaTeX output as well;
6570 * browser info session directories are now self-contained (may be put
6571 on WWW server seperately); improved graphs of nested sessions; removed
6572 graph for 'all sessions';
6574 * several improvements in isabelle style files; \isabellestyle{it}
6575 produces fake math mode output; \isamarkupheader is now \section by
6576 default; see lib/texinputs/isabelle.sty etc.;
6581 * Isar/Pure: local results and corresponding term bindings are now
6582 subject to Hindley-Milner polymorphism (similar to ML); this
6583 accommodates incremental type-inference very nicely;
6585 * Isar/Pure: new derived language element 'obtain' supports
6586 generalized existence reasoning;
6588 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
6589 support accumulation of results, without applying any rules yet;
6590 useful to collect intermediate results without explicit name
6591 references, and for use with transitivity rules with more than 2
6594 * Isar/Pure: scalable support for case-analysis type proofs: new
6595 'case' language element refers to local contexts symbolically, as
6596 produced by certain proof methods; internally, case names are attached
6597 to theorems as "tags";
6599 * Isar/Pure: theory command 'hide' removes declarations from
6600 class/type/const name spaces;
6602 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
6603 indicate potential overloading;
6605 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
6607 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
6608 "{a,b,c}" instead of {a,b,c};
6610 * Isar/Pure now provides its own version of intro/elim/dest
6611 attributes; useful for building new logics, but beware of confusion
6612 with the version in Provers/classical;
6614 * Isar/Pure: the local context of (non-atomic) goals is provided via
6615 case name 'antecedent';
6617 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
6618 to the current context is now done automatically);
6620 * Isar/Pure: theory command 'method_setup' provides a simple interface
6621 for definining proof methods in ML;
6623 * Isar/Provers: intro/elim/dest attributes changed; renamed
6624 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
6625 most cases, one should have to change intro!! to intro? only);
6626 replaced "delrule" by "rule del";
6628 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
6629 'symmetric' attribute (the latter supercedes [RS sym]);
6631 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
6632 method modifier); 'simp' method: 'only:' modifier removes loopers as
6633 well (including splits);
6635 * Isar/Provers: Simplifier and Classical methods now support all kind
6636 of modifiers used in the past, including 'cong', 'iff', etc.
6638 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
6639 of Simplifier and Classical reasoner);
6641 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
6642 now support named cases; major packages (inductive, datatype, primrec,
6643 recdef) support case names and properly name parameters;
6645 * Isar/HOL: new transitivity rules for substitution in inequalities --
6646 monotonicity conditions are extracted to be proven at end of
6649 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
6652 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
6653 split_if split_if_asm; datatype package provides theorems foo.splits =
6654 foo.split foo.split_asm for each datatype;
6656 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
6657 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
6658 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
6659 use "(cases (simplified))" method in proper proof texts);
6661 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
6663 * Isar: names of theorems etc. may be natural numbers as well;
6665 * Isar: 'pr' command: optional arguments for goals_limit and
6666 ProofContext.prems_limit; no longer prints theory contexts, but only
6669 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6670 additional print modes to be specified; e.g. "pr(latex)" will print
6671 proof state according to the Isabelle LaTeX style;
6673 * Isar: improved support for emulating tactic scripts, including proof
6674 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6675 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6676 (for HOL datatypes);
6678 * Isar: simplified (more robust) goal selection of proof methods: 1st
6679 goal, all goals, or explicit goal specifier (tactic emulation); thus
6680 'proof method scripts' have to be in depth-first order;
6682 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6684 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6685 should instead use individual commands for printing items
6686 (print_commands, print_methods etc.);
6688 * Isar: added 'nothing' --- the empty list of theorems;
6693 * HOL/MicroJava: formalization of a fragment of Java, together with a
6694 corresponding virtual machine and a specification of its bytecode
6695 verifier and a lightweight bytecode verifier, including proofs of
6696 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6697 Cornelia Pusch (see also the homepage of project Bali at
6698 http://isabelle.in.tum.de/Bali/);
6700 * HOL/Algebra: new theory of rings and univariate polynomials, by
6703 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6704 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6707 * HOL/Lattice: fundamental concepts of lattice theory and order
6708 structures, including duals, properties of bounds versus algebraic
6709 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6710 Theorem for complete lattices etc.; may also serve as a demonstration
6711 for abstract algebraic reasoning using axiomatic type classes, and
6712 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6714 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6717 * HOL/IMPP: extension of IMP with local variables and mutually
6718 recursive procedures, by David von Oheimb;
6720 * HOL/Lambda: converted into new-style theory and document;
6722 * HOL/ex/Multiquote: example of multiple nested quotations and
6723 anti-quotations -- basically a generalized version of de-Bruijn
6724 representation; very useful in avoiding lifting of operations;
6726 * HOL/record: added general record equality rule to simpset; fixed
6727 select-update simplification procedure to handle extended records as
6728 well; admit "r" as field name;
6730 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6731 other numeric types and also as the identity of groups, rings, etc.;
6733 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6734 Types nat and int belong to this axclass;
6736 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6737 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6738 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6739 two terms #m*u and #n*u are replaced by #(m+n)*u
6740 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6741 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6742 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6744 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6745 powerful prover for predicate logic but knows nothing of clasets; see
6746 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6748 * HOL: new version of "case_tac" subsumes both boolean case split and
6749 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6750 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6752 * HOL: simplification no longer dives into case-expressions: only the
6753 selector expression is simplified, but not the remaining arms; to
6754 enable full simplification of case-expressions for datatype t, you may
6755 remove t.weak_case_cong from the simpset, either globally (Delcongs
6756 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6758 * HOL/recdef: the recursion equations generated by 'recdef' for
6759 function 'f' are now called f.simps instead of f.rules; if all
6760 termination conditions are proved automatically, these simplification
6761 rules are added to the simpset, as in primrec; rules may be named
6762 individually as well, resulting in a separate list of theorems for
6765 * HOL/While is a new theory that provides a while-combinator. It
6766 permits the definition of tail-recursive functions without the
6767 provision of a termination measure. The latter is necessary once the
6768 invariant proof rule for while is applied.
6770 * HOL: new (overloaded) notation for the set of elements below/above
6771 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6773 * HOL: theorems impI, allI, ballI bound as "strip";
6775 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6776 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6777 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6779 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6781 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6782 main HOL, but was unused);
6784 * HOL: fewer consts declared as global (e.g. have to refer to
6785 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6787 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6788 in case of overlap with user translations (e.g. judgements over
6789 tuples); (note that the underlying logical represenation is still
6795 * ZF: simplification automatically cancels common terms in arithmetic
6796 expressions over nat and int;
6798 * ZF: new treatment of nat to minimize type-checking: all operators
6799 coerce their operands to a natural number using the function natify,
6800 making the algebraic laws unconditional;
6802 * ZF: as above, for int: operators coerce their operands to an integer
6803 using the function intify;
6805 * ZF: the integer library now contains many of the usual laws for the
6806 orderings, including $<=, and monotonicity laws for $+ and $*;
6808 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6811 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6812 to the simplifier and classical reasoner simultaneously;
6817 * Provers: blast_tac now handles actual object-logic rules as
6818 assumptions; note that auto_tac uses blast_tac internally as well;
6820 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6821 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6823 * Provers: delrules now handles destruct rules as well (no longer need
6824 explicit make_elim);
6826 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6827 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6828 use instead the strong form,
6829 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6830 in HOL, FOL and ZF the function cla_make_elim will create such rules
6831 from destruct-rules;
6833 * Provers: Simplifier.easy_setup provides a fast path to basic
6834 Simplifier setup for new object-logics;
6836 * Pure: AST translation rules no longer require constant head on LHS;
6838 * Pure: improved name spaces: ambiguous output is qualified; support
6839 for hiding of names;
6841 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6842 XSYMBOL_HOME; no longer need to do manual configuration in most
6845 * system: compression of ML heaps images may now be controlled via -c
6846 option of isabelle and isatool usedir (currently only observed by
6849 * system: isatool installfonts may handle X-Symbol fonts as well (very
6850 useful for remote X11);
6852 * system: provide TAGS file for Isabelle sources;
6854 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6857 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6858 timing flag supersedes proof_timing and Toplevel.trace;
6860 * ML: new combinators |>> and |>>> for incremental transformations
6861 with secondary results (e.g. certain theory extensions):
6863 * ML: PureThy.add_defs gets additional argument to indicate potential
6864 overloading (usually false);
6866 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6871 New in Isabelle99 (October 1999)
6872 --------------------------------
6874 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6876 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6877 are no longer simplified. (This allows the simplifier to unfold recursive
6878 functional programs.) To restore the old behaviour, declare
6880 Delcongs [if_weak_cong];
6882 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6885 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6887 * HOL/datatype: mutual_induct_tac no longer exists --
6888 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6890 * HOL/typedef: fixed type inference for representing set; type
6891 arguments now have to occur explicitly on the rhs as type constraints;
6893 * ZF: The con_defs part of an inductive definition may no longer refer
6894 to constants declared in the same theory;
6896 * HOL, ZF: the function mk_cases, generated by the inductive
6897 definition package, has lost an argument. To simplify its result, it
6898 uses the default simpset instead of a supplied list of theorems.
6900 * HOL/List: the constructors of type list are now Nil and Cons;
6902 * Simplifier: the type of the infix ML functions
6903 setSSolver addSSolver setSolver addSolver
6904 is now simpset * solver -> simpset where `solver' is a new abstract type
6905 for packaging solvers. A solver is created via
6906 mk_solver: string -> (thm list -> int -> tactic) -> solver
6907 where the string argument is only a comment.
6912 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6913 decision procedure for linear arithmetic. Currently it is used for
6914 types `nat', `int', and `real' in HOL (see below); it can, should and
6915 will be instantiated for other types and logics as well.
6917 * The simplifier now accepts rewrite rules with flexible heads, eg
6918 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6919 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6925 * New Isabelle/Isar subsystem provides an alternative to traditional
6926 tactical theorem proving; together with the ProofGeneral/isar user
6927 interface it offers an interactive environment for developing human
6928 readable proof documents (Isar == Intelligible semi-automated
6929 reasoning); for further information see isatool doc isar-ref,
6930 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6932 * improved and simplified presentation of theories: better HTML markup
6933 (including colors), graph views in several sizes; isatool usedir now
6934 provides a proper interface for user theories (via -P option); actual
6935 document preparation based on (PDF)LaTeX is available as well (for
6936 new-style theories only); see isatool doc system for more information;
6938 * native support for Proof General, both for classic Isabelle and
6941 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6942 using the graph browser tool;
6944 * Isabelle manuals now also available as PDF;
6946 * theory loader rewritten from scratch (may not be fully
6947 bug-compatible); old loadpath variable has been replaced by show_path,
6948 add_path, del_path, reset_path functions; new operations such as
6949 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6952 * improved isatool install: option -k creates KDE application icon,
6953 option -p DIR installs standalone binaries;
6955 * added ML_PLATFORM setting (useful for cross-platform installations);
6956 more robust handling of platform specific ML images for SML/NJ;
6958 * the settings environment is now statically scoped, i.e. it is never
6959 created again in sub-processes invoked from isabelle, isatool, or
6962 * path element specification '~~' refers to '$ISABELLE_HOME';
6964 * in locales, the "assumes" and "defines" parts may be omitted if
6967 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6970 * new print_mode "HTML";
6972 * new flag show_tags controls display of tags of theorems (which are
6973 basically just comments that may be attached by some tools);
6975 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6976 mode and goal output format:
6978 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6980 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6982 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6983 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6985 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6987 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6989 * function bind_thms stores lists of theorems (cf. bind_thm);
6991 * new shorthand tactics ftac, eatac, datac, fatac;
6993 * qed (and friends) now accept "" as result name; in that case the
6994 theorem is not stored, but proper checks and presentation of the
6997 * theorem database now also indexes constants "Trueprop", "all",
6998 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
7003 ** HOL arithmetic **
7005 * There are now decision procedures for linear arithmetic over nat and
7008 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
7009 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
7010 are treated as atomic; subformulae not involving type `nat' or `int'
7011 are ignored; quantified subformulae are ignored unless they are
7012 positive universal or negative existential. The tactic has to be
7013 invoked by hand and can be a little bit slow. In particular, the
7014 running time is exponential in the number of occurrences of `min' and
7015 `max', and `-' on `nat'.
7017 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
7018 (negated) (in)equalities among the premises and the conclusion into
7019 account (i.e. no compound formulae) and does not know about `min' and
7020 `max', and `-' on `nat'. It is fast and is used automatically by the
7023 NB: At the moment, these decision procedures do not cope with mixed
7024 nat/int formulae where the two parts interact, such as `m < n ==>
7027 * HOL/Numeral provides a generic theory of numerals (encoded
7028 efficiently as bit strings); setup for types nat/int/real is in place;
7029 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
7030 int, existing theories and proof scripts may require a few additional
7033 * integer division and remainder can now be performed on constant
7036 * many properties of integer multiplication, division and remainder
7039 * An interface to the Stanford Validity Checker (SVC) is available through the
7040 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
7041 are proved automatically. SVC must be installed separately, and its results
7042 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
7043 invocation of the underlying oracle). For SVC see
7044 http://verify.stanford.edu/SVC
7046 * IsaMakefile: the HOL-Real target now builds an actual image;
7051 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
7052 (in Isabelle/Isar) -- by Gertrud Bauer;
7054 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
7055 analysis for assembly languages with subtypes;
7057 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
7058 -- avoids syntactic ambiguities and treats state, transition, and
7059 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
7060 changed syntax and (many) tactics;
7062 * HOL/inductive: Now also handles more general introduction rules such
7063 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
7064 theorems are now maintained within the theory (maintained via the
7067 * HOL/datatype: Now also handles arbitrarily branching datatypes
7068 (using function types) such as
7070 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
7072 * HOL/record: record_simproc (part of the default simpset) takes care
7073 of selectors applied to updated records; record_split_tac is no longer
7074 part of the default claset; update_defs may now be removed from the
7075 simpset in many cases; COMPATIBILITY: old behavior achieved by
7077 claset_ref () := claset() addSWrapper record_split_wrapper;
7078 Delsimprocs [record_simproc]
7080 * HOL/typedef: fixed type inference for representing set; type
7081 arguments now have to occur explicitly on the rhs as type constraints;
7083 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
7084 names rather than an ML expression;
7086 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
7087 supplied later. Program schemes can be defined, such as
7088 "While B C s = (if B s then While B C (C s) else s)"
7089 where the well-founded relation can be chosen after B and C have been given.
7091 * HOL/List: the constructors of type list are now Nil and Cons;
7092 INCOMPATIBILITY: while [] and infix # syntax is still there, of
7093 course, ML tools referring to List.list.op # etc. have to be adapted;
7095 * HOL_quantifiers flag superseded by "HOL" print mode, which is
7096 disabled by default; run isabelle with option -m HOL to get back to
7097 the original Gordon/HOL-style output;
7099 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
7100 ALL x<=y. P, EX x<y. P, EX x<=y. P;
7102 * HOL basic syntax simplified (more orthogonal): all variants of
7103 All/Ex now support plain / symbolic / HOL notation; plain syntax for
7104 Eps operator is provided as well: "SOME x. P[x]";
7106 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
7108 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
7109 thus available for user theories;
7111 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
7112 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
7115 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
7116 several times and then mp;
7121 * the notation <<...>> is now available as a notation for sequences of
7124 * the simplifier is now installed
7126 * the axiom system has been generalized (thanks to Soren Heilmann)
7128 * the classical reasoner now has a default rule database
7133 * new primrec section allows primitive recursive functions to be given
7134 directly (as in HOL) over datatypes and the natural numbers;
7136 * new tactics induct_tac and exhaust_tac for induction (or case
7137 analysis) over datatypes and the natural numbers;
7139 * the datatype declaration of type T now defines the recursor T_rec;
7141 * simplification automatically does freeness reasoning for datatype
7144 * automatic type-inference, with AddTCs command to insert new
7145 type-checking rules;
7147 * datatype introduction rules are now added as Safe Introduction rules
7150 * the syntax "if P then x else y" is now available in addition to
7154 *** Internal programming interfaces ***
7156 * tuned simplifier trace output; new flag debug_simp;
7158 * structures Vartab / Termtab (instances of TableFun) offer efficient
7159 tables indexed by indexname_ord / term_ord (compatible with aconv);
7161 * AxClass.axclass_tac lost the theory argument;
7163 * tuned current_goals_markers semantics: begin / end goal avoids
7164 printing empty lines;
7166 * removed prs and prs_fn hook, which was broken because it did not
7167 include \n in its semantics, forcing writeln to add one
7168 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
7169 string -> unit if you really want to output text without newline;
7171 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
7172 plain output, interface builders may have to enable 'isabelle_font'
7173 mode to get Isabelle font glyphs as before;
7175 * refined token_translation interface; INCOMPATIBILITY: output length
7176 now of type real instead of int;
7178 * theory loader actions may be traced via new ThyInfo.add_hook
7179 interface (see src/Pure/Thy/thy_info.ML); example application: keep
7180 your own database of information attached to *whole* theories -- as
7181 opposed to intra-theory data slots offered via TheoryDataFun;
7183 * proper handling of dangling sort hypotheses (at last!);
7184 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
7185 extra sort hypotheses that can be witnessed from the type signature;
7186 the force_strip_shyps flag is gone, any remaining shyps are simply
7187 left in the theorem (with a warning issued by strip_shyps_warning);
7191 New in Isabelle98-1 (October 1998)
7192 ----------------------------------
7194 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7196 * several changes of automated proof tools;
7198 * HOL: major changes to the inductive and datatype packages, including
7199 some minor incompatibilities of theory syntax;
7201 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
7204 * HOL: removed duplicate thms in Arith:
7205 less_imp_add_less should be replaced by trans_less_add1
7206 le_imp_add_le should be replaced by trans_le_add1
7208 * HOL: unary minus is now overloaded (new type constraints may be
7211 * HOL and ZF: unary minus for integers is now #- instead of #~. In
7212 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
7213 now taken as an integer constant.
7215 * Pure: ML function 'theory_of' renamed to 'theory';
7221 1. Asm_full_simp_tac is now more aggressive.
7222 1. It will sometimes reorient premises if that increases their power to
7224 2. It does no longer proceed strictly from left to right but may also
7225 rotate premises to achieve further simplification.
7226 For compatibility reasons there is now Asm_lr_simp_tac which is like the
7227 old Asm_full_simp_tac in that it does not rotate premises.
7228 2. The simplifier now knows a little bit about nat-arithmetic.
7230 * Classical reasoner: wrapper mechanism for the classical reasoner now
7231 allows for selected deletion of wrappers, by introduction of names for
7232 wrapper functionals. This implies that addbefore, addSbefore,
7233 addaltern, and addSaltern now take a pair (name, tactic) as argument,
7234 and that adding two tactics with the same name overwrites the first
7235 one (emitting a warning).
7236 type wrapper = (int -> tactic) -> (int -> tactic)
7237 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
7238 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
7239 delWrapper, delSWrapper: claset * string -> claset
7240 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
7242 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
7243 semantics; addbefore now affects only the unsafe part of step_tac
7244 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
7245 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
7248 * Classical reasoner: setwrapper to setWrapper and compwrapper to
7249 compWrapper; added safe wrapper (and access functions for it);
7251 * HOL/split_all_tac is now much faster and fails if there is nothing
7252 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
7253 and the names of the automatically generated variables have changed.
7254 split_all_tac has moved within claset() from unsafe wrappers to safe
7255 wrappers, which means that !!-bound variables are split much more
7256 aggressively, and safe_tac and clarify_tac now split such variables.
7257 If this splitting is not appropriate, use delSWrapper "split_all_tac".
7258 Note: the same holds for record_split_tac, which does the job of
7259 split_all_tac for record fields.
7261 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
7262 permanently to the default simpset using Addsplits just like
7263 Addsimps. They can be removed via Delsplits just like
7264 Delsimps. Lower-case versions are also available.
7266 * HOL/Simplifier: The rule split_if is now part of the default
7267 simpset. This means that the simplifier will eliminate all occurrences
7268 of if-then-else in the conclusion of a goal. To prevent this, you can
7269 either remove split_if completely from the default simpset by
7270 `Delsplits [split_if]' or remove it in a specific call of the
7271 simplifier using `... delsplits [split_if]'. You can also add/delete
7272 other case splitting rules to/from the default simpset: every datatype
7273 generates suitable rules `split_t_case' and `split_t_case_asm' (where
7274 t is the name of the datatype).
7276 * Classical reasoner / Simplifier combination: new force_tac (and
7277 derivatives Force_tac, force) combines rewriting and classical
7278 reasoning (and whatever other tools) similarly to auto_tac, but is
7279 aimed to solve the given subgoal completely.
7284 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
7285 and `goalw': the theory is no longer needed as an explicit argument -
7286 the current theory context is used; assumptions are no longer returned
7287 at the ML-level unless one of them starts with ==> or !!; it is
7288 recommended to convert to these new commands using isatool fixgoal
7289 (backup your sources first!);
7291 * new top-level commands 'thm' and 'thms' for retrieving theorems from
7292 the current theory context, and 'theory' to lookup stored theories;
7294 * new theory section 'locale' for declaring constants, assumptions and
7295 definitions that have local scope;
7297 * new theory section 'nonterminals' for purely syntactic types;
7299 * new theory section 'setup' for generic ML setup functions
7300 (e.g. package initialization);
7302 * the distribution now includes Isabelle icons: see
7303 lib/logo/isabelle-{small,tiny}.xpm;
7305 * isatool install - install binaries with absolute references to
7308 * isatool logo -- create instances of the Isabelle logo (as EPS);
7310 * print mode 'emacs' reserved for Isamode;
7312 * support multiple print (ast) translations per constant name;
7314 * theorems involving oracles are now printed with a suffixed [!];
7319 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
7321 * HOL/inductive package reorganized and improved: now supports mutual
7327 oddI "n : EVEN ==> Suc n : ODD"
7328 evenI "n : ODD ==> Suc n : EVEN"
7330 new theorem list "elims" contains an elimination rule for each of the
7331 recursive sets; inductive definitions now handle disjunctive premises
7332 correctly (also ZF);
7334 INCOMPATIBILITIES: requires Inductive as an ancestor; component
7335 "mutual_induct" no longer exists - the induction rule is always
7336 contained in "induct";
7339 * HOL/datatype package re-implemented and greatly improved: now
7340 supports mutually recursive datatypes such as
7343 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
7344 | SUM ('a aexp) ('a aexp)
7345 | DIFF ('a aexp) ('a aexp)
7348 'a bexp = LESS ('a aexp) ('a aexp)
7349 | AND ('a bexp) ('a bexp)
7350 | OR ('a bexp) ('a bexp)
7352 as well as indirectly recursive datatypes such as
7355 ('a, 'b) term = Var 'a
7356 | App 'b ((('a, 'b) term) list)
7358 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
7359 induction on mutually / indirectly recursive datatypes.
7361 Primrec equations are now stored in theory and can be accessed via
7362 <function_name>.simps.
7366 - Theories using datatypes must now have theory Datatype as an
7368 - The specific <typename>.induct_tac no longer exists - use the
7369 generic induct_tac instead.
7370 - natE has been renamed to nat.exhaust - use exhaust_tac
7371 instead of res_inst_tac ... natE. Note that the variable
7372 names in nat.exhaust differ from the names in natE, this
7373 may cause some "fragile" proofs to fail.
7374 - The theorems split_<typename>_case and split_<typename>_case_asm
7375 have been renamed to <typename>.split and <typename>.split_asm.
7376 - Since default sorts of type variables are now handled correctly,
7377 some datatype definitions may have to be annotated with explicit
7379 - Primrec definitions no longer require function name and type
7380 of recursive argument.
7382 Consider using isatool fixdatatype to adapt your theories and proof
7383 scripts to the new package (backup your sources first!).
7386 * HOL/record package: considerably improved implementation; now
7387 includes concrete syntax for record types, terms, updates; theorems
7388 for surjective pairing and splitting !!-bound record variables; proof
7389 support is as follows:
7391 1) standard conversions (selectors or updates applied to record
7392 constructor terms) are part of the standard simpset;
7394 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
7395 made part of standard simpset and claset via addIffs;
7397 3) a tactic for record field splitting (record_split_tac) is part of
7398 the standard claset (addSWrapper);
7400 To get a better idea about these rules you may retrieve them via
7401 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
7402 the name of your record type.
7404 The split tactic 3) conceptually simplifies by the following rule:
7406 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
7408 Thus any record variable that is bound by meta-all will automatically
7409 blow up into some record constructor term, consequently the
7410 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
7411 solve record problems automatically.
7414 * reorganized the main HOL image: HOL/Integ and String loaded by
7415 default; theory Main includes everything;
7417 * automatic simplification of integer sums and comparisons, using cancellation;
7419 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
7421 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
7423 * many new identities for unions, intersections, set difference, etc.;
7425 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
7426 called split_if, split_split, split_sum_case and split_nat_case (to go
7427 with add/delsplits);
7429 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
7430 (?x::unit) = (); this is made part of the default simpset, which COULD
7431 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
7432 'Delsimprocs [unit_eq_proc];' as last resort); also note that
7433 unit_abs_eta_conv is added in order to counter the effect of
7434 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
7437 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
7440 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
7441 It and 'sym RS equals0D' are now in the default claset, giving automatic
7442 disjointness reasoning but breaking a few old proofs.
7444 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
7445 to 'converse' from 'inverse' (for compatibility with ZF and some
7448 * HOL/recdef can now declare non-recursive functions, with {} supplied as
7449 the well-founded relation;
7451 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
7452 Compl A. The "Compl" syntax remains available as input syntax for this
7455 * HOL/Update: new theory of function updates:
7456 f(a:=b) == %x. if x=a then b else f x
7457 may also be iterated as in f(a:=b,c:=d,...);
7459 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
7462 - new function list_update written xs[i:=v] that updates the i-th
7463 list position. May also be iterated as in xs[i:=a,j:=b,...].
7464 - new function `upt' written [i..j(] which generates the list
7465 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
7466 bound write [i..j], which is a shorthand for [i..j+1(].
7467 - new lexicographic orderings and corresponding wellfoundedness theorems.
7470 - removed 'pred' (predecessor) function;
7471 - generalized some theorems about n-1;
7472 - many new laws about "div" and "mod";
7473 - new laws about greatest common divisors (see theory ex/Primes);
7475 * HOL/Relation: renamed the relational operator r^-1 "converse"
7476 instead of "inverse";
7478 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
7479 of the multiset ordering;
7481 * directory HOL/Real: a construction of the reals using Dedekind cuts
7482 (not included by default);
7484 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
7486 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
7487 programs, i.e. different program variables may have different types.
7489 * calling (stac rew i) now fails if "rew" has no effect on the goal
7490 [previously, this check worked only if the rewrite rule was unconditional]
7491 Now rew can involve either definitions or equalities (either == or =).
7496 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
7497 only the theorems proved on ZF.ML;
7499 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
7500 It and 'sym RS equals0D' are now in the default claset, giving automatic
7501 disjointness reasoning but breaking a few old proofs.
7503 * ZF/Update: new theory of function updates
7504 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
7505 may also be iterated as in f(a:=b,c:=d,...);
7507 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
7509 * calling (stac rew i) now fails if "rew" has no effect on the goal
7510 [previously, this check worked only if the rewrite rule was unconditional]
7511 Now rew can involve either definitions or equalities (either == or =).
7513 * case_tac provided for compatibility with HOL
7514 (like the old excluded_middle_tac, but with subgoals swapped)
7517 *** Internal programming interfaces ***
7519 * Pure: several new basic modules made available for general use, see
7520 also src/Pure/README;
7522 * improved the theory data mechanism to support encapsulation (data
7523 kind name replaced by private Object.kind, acting as authorization
7524 key); new type-safe user interface via functor TheoryDataFun; generic
7525 print_data function becomes basically useless;
7527 * removed global_names compatibility flag -- all theory declarations
7528 are qualified by default;
7530 * module Pure/Syntax now offers quote / antiquote translation
7531 functions (useful for Hoare logic etc. with implicit dependencies);
7532 see HOL/ex/Antiquote for an example use;
7534 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
7537 * new tactical CHANGED_GOAL for checking that a tactic modifies a
7540 * Display.print_goals function moved to Locale.print_goals;
7542 * standard print function for goals supports current_goals_markers
7543 variable for marking begin of proof, end of proof, start of goal; the
7544 default is ("", "", ""); setting current_goals_markers := ("<proof>",
7545 "</proof>", "<goal>") causes SGML like tagged proof state printing,
7550 New in Isabelle98 (January 1998)
7551 --------------------------------
7553 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7555 * changed lexical syntax of terms / types: dots made part of long
7556 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
7558 * simpset (and claset) reference variable replaced by functions
7559 simpset / simpset_ref;
7561 * no longer supports theory aliases (via merge) and non-trivial
7562 implicit merge of thms' signatures;
7564 * most internal names of constants changed due to qualified names;
7566 * changed Pure/Sequence interface (see Pure/seq.ML);
7569 *** General Changes ***
7571 * hierachically structured name spaces (for consts, types, axms, thms
7572 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
7573 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
7574 isatool fixdots ensures space after dots (e.g. "%x. x"); set
7575 long_names for fully qualified output names; NOTE: ML programs
7576 (special tactics, packages etc.) referring to internal names may have
7577 to be adapted to cope with fully qualified names; in case of severe
7578 backward campatibility problems try setting 'global_names' at compile
7579 time to have enrything declared within a flat name space; one may also
7580 fine tune name declarations in theories via the 'global' and 'local'
7583 * reimplemented the implicit simpset and claset using the new anytype
7584 data filed in signatures; references simpset:simpset ref etc. are
7585 replaced by functions simpset:unit->simpset and
7586 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
7587 to patch your ML files accordingly;
7589 * HTML output now includes theory graph data for display with Java
7590 applet or isatool browser; data generated automatically via isatool
7591 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
7593 * defs may now be conditional; improved rewrite_goals_tac to handle
7594 conditional equations;
7596 * defs now admits additional type arguments, using TYPE('a) syntax;
7598 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
7599 creates a new theory node; implicit merge of thms' signatures is
7600 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
7601 transfer:theory->thm->thm in (rare) cases;
7603 * improved handling of draft signatures / theories; draft thms (and
7604 ctyps, cterms) are automatically promoted to real ones;
7606 * slightly changed interfaces for oracles: admit many per theory, named
7607 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
7609 * print_goals: optional output of const types (set show_consts and
7612 * improved output of warnings (###) and errors (***);
7614 * subgoal_tac displays a warning if the new subgoal has type variables;
7616 * removed old README and Makefiles;
7618 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
7620 * removed obsolete init_pps and init_database;
7622 * deleted the obsolete tactical STATE, which was declared by
7623 fun STATE tacfun st = tacfun st st;
7625 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
7626 (which abbreviates $HOME);
7628 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
7629 use isatool fixseq to adapt your ML programs (this works for fully
7630 qualified references to the Sequence structure only!);
7632 * use_thy no longer requires writable current directory; it always
7633 reloads .ML *and* .thy file, if either one is out of date;
7636 *** Classical Reasoner ***
7638 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
7639 tactics that use classical reasoning to simplify a subgoal without
7640 splitting it into several subgoals;
7642 * Safe_tac: like safe_tac but uses the default claset;
7647 * added simplification meta rules:
7648 (asm_)(full_)simplify: simpset -> thm -> thm;
7650 * simplifier.ML no longer part of Pure -- has to be loaded by object
7653 * added prems argument to simplification procedures;
7655 * HOL, FOL, ZF: added infix function `addsplits':
7656 instead of `<simpset> setloop (split_tac <thms>)'
7657 you can simply write `<simpset> addsplits <thms>'
7662 * TYPE('a) syntax for type reflection terms;
7664 * no longer handles consts with name "" -- declare as 'syntax' instead;
7666 * pretty printer: changed order of mixfix annotation preference (again!);
7668 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7673 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7674 with `addloop' of the simplifier to faciliate case splitting in premises.
7676 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7678 * HOL/Auth: new protocol proofs including some for the Internet
7681 * HOL/Map: new theory of `maps' a la VDM;
7683 * HOL/simplifier: simplification procedures nat_cancel_sums for
7684 cancelling out common nat summands from =, <, <= (in)equalities, or
7685 differences; simplification procedures nat_cancel_factor for
7686 cancelling common factor from =, <, <= (in)equalities over natural
7687 sums; nat_cancel contains both kinds of procedures, it is installed by
7688 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7690 * HOL/simplifier: terms of the form
7691 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7693 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7694 and those of the form
7695 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7697 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7700 Each datatype `t' now comes with a theorem `split_t_case' of the form
7702 P(t_case f1 ... fn x) =
7703 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7705 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7708 and a theorem `split_t_case_asm' of the form
7710 P(t_case f1 ... fn x) =
7711 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7713 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7715 which can be added to a simpset via `addsplits'. The existing theorems
7716 expand_list_case and expand_option_case have been renamed to
7717 split_list_case and split_option_case.
7720 - `pred n' is automatically converted to `n-1'.
7721 Users are strongly encouraged not to use `pred' any longer,
7722 because it will disappear altogether at some point.
7723 - Users are strongly encouraged to write "0 < n" rather than
7724 "n ~= 0". Theorems and proof tools have been modified towards this
7728 the function "set_of_list" has been renamed "set" (and its theorems too);
7729 the function "nth" now takes its arguments in the reverse order and
7730 has acquired the infix notation "!" as in "xs!n".
7732 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7734 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7735 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7737 * HOL/record: extensible records with schematic structural subtyping
7738 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7739 still lacks various theorems and concrete record syntax;
7744 * removed "axioms" and "generated by" sections;
7746 * replaced "ops" section by extended "consts" section, which is capable of
7747 handling the continuous function space "->" directly;
7750 . proves theorems immediately and stores them in the theory,
7751 . creates hierachical name space,
7752 . now uses normal mixfix annotations (instead of cinfix...),
7753 . minor changes to some names and values (for consistency),
7754 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7755 . separator between mutual domain defs: changed "," to "and",
7756 . improved handling of sort constraints; now they have to
7757 appear on the left-hand side of the equations only;
7759 * fixed LAM <x,y,zs>.b syntax;
7761 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7762 adm (%x. P (t x)), where P is chainfinite and t continuous;
7767 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7768 with `addloop' of the simplifier to faciliate case splitting in premises.
7770 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7771 in HOL, they strip ALL and --> from proved theorems;
7775 New in Isabelle94-8 (May 1997)
7776 ------------------------------
7778 *** General Changes ***
7780 * new utilities to build / run / maintain Isabelle etc. (in parts
7781 still somewhat experimental); old Makefiles etc. still functional;
7783 * new 'Isabelle System Manual';
7785 * INSTALL text, together with ./configure and ./build scripts;
7787 * reimplemented type inference for greater efficiency, better error
7788 messages and clean internal interface;
7790 * prlim command for dealing with lots of subgoals (an easier way of
7791 setting goals_limit);
7796 * supports alternative (named) syntax tables (parser and pretty
7797 printer); internal interface is provided by add_modesyntax(_i);
7799 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7800 be used in conjunction with the Isabelle symbol font; uses the
7801 "symbols" syntax table;
7803 * added token_translation interface (may translate name tokens in
7804 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7805 the current print_mode); IMPORTANT: user print translation functions
7806 are responsible for marking newly introduced bounds
7807 (Syntax.mark_boundT);
7809 * token translations for modes "xterm" and "xterm_color" that display
7810 names in bold, underline etc. or colors (which requires a color
7813 * infixes may now be declared with names independent of their syntax;
7815 * added typed_print_translation (like print_translation, but may
7816 access type of constant);
7819 *** Classical Reasoner ***
7821 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7822 some limitations. Blast_tac...
7823 + ignores addss, addbefore, addafter; this restriction is intrinsic
7824 + ignores elimination rules that don't have the correct format
7825 (the conclusion MUST be a formula variable)
7826 + ignores types, which can make HOL proofs fail
7827 + rules must not require higher-order unification, e.g. apply_type in ZF
7828 [message "Function Var's argument not a bound variable" relates to this]
7829 + its proof strategy is more general but can actually be slower
7831 * substitution with equality assumptions no longer permutes other
7834 * minor changes in semantics of addafter (now called addaltern); renamed
7835 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7836 (and access functions for it);
7838 * improved combination of classical reasoner and simplifier:
7839 + functions for handling clasimpsets
7840 + improvement of addss: now the simplifier is called _after_ the
7842 + safe variant of addss called addSss: uses safe simplifications
7843 _during_ the safe steps. It is more complete as it allows multiple
7844 instantiations of unknowns (e.g. with slow_tac).
7848 * added interface for simplification procedures (functions that
7849 produce *proven* rewrite rules on the fly, depending on current
7852 * ordering on terms as parameter (used for ordered rewriting);
7854 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7856 * the solver is now split into a safe and an unsafe part.
7857 This should be invisible for the normal user, except that the
7858 functions setsolver and addsolver have been renamed to setSolver and
7859 addSolver; added safe_asm_full_simp_tac;
7864 * a generic induction tactic `induct_tac' which works for all datatypes and
7865 also for type `nat';
7867 * a generic case distinction tactic `exhaust_tac' which works for all
7868 datatypes and also for type `nat';
7870 * each datatype comes with a function `size';
7872 * patterns in case expressions allow tuple patterns as arguments to
7873 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7875 * primrec now also works with type nat;
7877 * recdef: a new declaration form, allows general recursive functions to be
7878 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7880 * the constant for negation has been renamed from "not" to "Not" to
7881 harmonize with FOL, ZF, LK, etc.;
7883 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7886 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7888 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7889 problems in commutative rings, using axiomatic type classes for + and *;
7891 * more examples in HOL/MiniML and HOL/Auth;
7893 * more default rewrite rules for quantifiers, union/intersection;
7895 * a new constant `arbitrary == @x.False';
7897 * HOLCF/IOA replaces old HOL/IOA;
7899 * HOLCF changes: derived all rules and arities
7900 + axiomatic type classes instead of classes
7901 + typedef instead of faking type definitions
7902 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7903 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7904 + eliminated the types void, one, tr
7905 + use unit lift and bool lift (with translations) instead of one and tr
7906 + eliminated blift from Lift3.thy (use Def instead of blift)
7907 all eliminated rules are derived as theorems --> no visible changes ;
7912 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7913 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7914 as ZF_cs addSIs [equalityI];
7918 New in Isabelle94-7 (November 96)
7919 ---------------------------------
7921 * allowing negative levels (as offsets) in prlev and choplev;
7923 * super-linear speedup for large simplifications;
7925 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7926 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7927 FAIL); can suppress it using the command Delsimps (ex_simps @
7928 all_simps); De Morgan laws are also now included, by default;
7930 * improved printing of ==> : ~:
7932 * new object-logic "Sequents" adds linear logic, while replacing LK
7933 and Modal (thanks to Sara Kalvala);
7935 * HOL/Auth: correctness proofs for authentication protocols;
7937 * HOL: new auto_tac combines rewriting and classical reasoning (many
7938 examples on HOL/Auth);
7940 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7941 the rewriter and classical reasoner simultaneously;
7943 * function uresult no longer returns theorems in "standard" format;
7944 regain previous version by: val uresult = standard o uresult;
7951 * oracles -- these establish an interface between Isabelle and trusted
7952 external reasoners, which may deliver results as theorems;
7954 * proof objects (in particular record all uses of oracles);
7956 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7958 * "constdefs" section in theory files;
7960 * "primrec" section (HOL) no longer requires names;
7962 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7969 * reduced space requirements;
7971 * automatic HTML generation from theories;
7973 * theory files no longer require "..." (quotes) around most types;
7975 * new examples, including two proofs of the Church-Rosser theorem;
7977 * non-curried (1994) version of HOL is no longer distributed;
7984 * greatly reduced space requirements;
7986 * theory files (.thy) no longer require \...\ escapes at line breaks;
7988 * searchable theorem database (see the section "Retrieving theorems" on
7989 page 8 of the Reference Manual);
7991 * new examples, including Grabczewski's monumental case study of the
7994 * The previous version of HOL renamed to Old_HOL;
7996 * The new version of HOL (previously called CHOL) uses a curried syntax
7997 for functions. Application looks like f a b instead of f(a,b);
7999 * Mutually recursive inductive definitions finally work in HOL;
8001 * In ZF, pattern-matching on tuples is now available in all abstractions and
8002 translates to the operator "split";
8009 * new infix operator, addss, allowing the classical reasoner to
8010 perform simplification at each step of its search. Example:
8011 fast_tac (cs addss ss)
8013 * a new logic, CHOL, the same as HOL, but with a curried syntax
8014 for functions. Application looks like f a b instead of f(a,b). Also pairs
8015 look like (a,b) instead of <a,b>;
8017 * PLEASE NOTE: CHOL will eventually replace HOL!
8019 * In CHOL, pattern-matching on tuples is now available in all abstractions.
8020 It translates to the operator "split". A new theory of integers is available;
8022 * In ZF, integer numerals now denote two's-complement binary integers.
8023 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
8025 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
8026 of the Axiom of Choice;
8033 * Significantly faster resolution;
8035 * the different sections in a .thy file can now be mixed and repeated
8038 * Database of theorems for FOL, HOL and ZF. New
8039 commands including qed, qed_goal and bind_thm store theorems in the database.
8041 * Simple database queries: return a named theorem (get_thm) or all theorems of
8042 a given theory (thms_of), or find out what theory a theorem was proved in
8045 * Bugs fixed in the inductive definition and datatype packages;
8047 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
8048 and HOL_dup_cs obsolete;
8050 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
8053 * Simpler definition of function space in ZF;
8055 * new results about cardinal and ordinal arithmetic in ZF;
8057 * 'subtype' facility in HOL for introducing new types as subsets of existing
8060 :mode=text:wrap=hard:maxLineLen=72: