1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
10 (and thus refers to something like $HOME/.isabelle/IsabelleXXXX),
11 while the default heap location within that directory lacks that extra
12 suffix. This isolates multiple Isabelle installations from each
13 other, avoiding problems with old settings in new versions.
14 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
16 * Significantly improved Isabelle/Isar implementation manual.
18 * Explicit treatment of UTF8 sequences as Isabelle symbols, such that
19 a Unicode character is treated as a single symbol, not a sequence of
20 non-ASCII bytes as before. Since Isabelle/ML string literals may
21 contain symbols without further backslash escapes, Unicode can now be
22 used here as well. Recall that Symbol.explode in ML provides a
23 consistent view on symbols, while raw explode (or String.explode)
24 merely give a byte-oriented representation.
26 * Theory loading: only the master source file is looked-up in the
27 implicit load path, all other files are addressed relatively to its
28 directory. Minor INCOMPATIBILITY, subtle change in semantics.
30 * Special treatment of ML file names has been discontinued.
31 Historically, optional extensions .ML or .sml were added on demand --
32 at the cost of clarity of file dependencies. Recall that Isabelle/ML
33 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
35 * Various options that affect pretty printing etc. are now properly
36 handled within the context via configuration options, instead of
37 unsynchronized references. There are both ML Config.T entities and
38 Isar declaration attributes to access these.
40 ML (Config.T) Isar (attribute)
42 eta_contract eta_contract
43 show_brackets show_brackets
46 show_question_marks show_question_marks
47 show_consts show_consts
49 Syntax.ambiguity_level syntax_ambiguity_level
51 Goal_Display.goals_limit goals_limit
52 Goal_Display.show_main_goal show_main_goal
54 Thy_Output.display thy_output_display
55 Thy_Output.quotes thy_output_quotes
56 Thy_Output.indent thy_output_indent
57 Thy_Output.source thy_output_source
58 Thy_Output.break thy_output_break
60 Note that corresponding "..._default" references in ML may be only
61 changed globally at the ROOT session setup, but *not* within a theory.
66 * Support for real valued configuration options, using simplistic
67 floating-point notation that coincides with the inner syntax for
70 * Support for real valued preferences (with approximative PGIP type).
72 * Interpretation command 'interpret' accepts a list of equations like
73 'interpretation' does.
75 * Diagnostic command 'print_interps' prints interpretations in proofs
76 in addition to interpretations in theories.
78 * Discontinued obsolete 'global' and 'local' commands to manipulate
79 the theory name space. Rare INCOMPATIBILITY. The ML functions
80 Sign.root_path and Sign.local_path may be applied directly where this
81 feature is still required for historical reasons.
83 * Discontinued ancient 'constdefs' command. INCOMPATIBILITY, use
86 * Document antiquotations @{class} and @{type} print classes and type
89 * Document antiquotation @{file} checks file/directory entries within
90 the local file system.
95 * Abandoned locale equiv for equivalence relations. INCOMPATIBILITY: use
96 equivI rather than equiv_intro.
98 * Code generator: globbing constant expressions "*" and "Theory.*" have been
99 replaced by the more idiomatic "_" and "Theory._". INCOMPATIBILITY.
101 * Theory Enum (for explicit enumerations of finite types) is now part of
102 the HOL-Main image. INCOMPATIBILITY: All constants of the Enum theory now
103 have to be referred to by its qualified name.
106 nlists -> Enum.nlists
107 product -> Enum.product
109 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
110 avoid confusion with finite sets. INCOMPATIBILITY.
112 * Quickcheck's generator for random generation is renamed from "code" to
113 "random". INCOMPATIBILITY.
115 * Theory Multiset provides stable quicksort implementation of sort_key.
117 * Quickcheck now has a configurable time limit which is set to 30 seconds
118 by default. This can be changed by adding [timeout = n] to the quickcheck
119 command. The time limit for Auto Quickcheck is still set independently.
121 * New command 'partial_function' provides basic support for recursive
122 function definitions over complete partial orders. Concrete instances
123 are provided for i) the option type, ii) tail recursion on arbitrary
124 types, and iii) the heap monad of Imperative_HOL. See
125 HOL/ex/Fundefs.thy and HOL/Imperative_HOL/ex/Linked_Lists.thy for
128 * Predicates `distinct` and `sorted` now defined inductively, with nice
129 induction rules. INCOMPATIBILITY: former distinct.simps and sorted.simps
130 now named distinct_simps and sorted_simps.
132 * Constant `contents` renamed to `the_elem`, to free the generic name
133 contents for other uses. INCOMPATIBILITY.
135 * Dropped syntax for old primrec package. INCOMPATIBILITY.
137 * Improved infrastructure for term evaluation using code generator
138 techniques, in particular static evaluation conversions.
140 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
143 expand_fun_eq -> fun_eq_iff
144 expand_set_eq -> set_eq_iff
148 * Renamed lemma list: nat_number -> eval_nat_numeral
150 * Renamed class eq and constant eq (for code generation) to class equal
151 and constant equal, plus renaming of related facts and various tuning.
154 * Scala (2.8 or higher) has been added to the target languages of
157 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
159 * Removed output syntax "'a ~=> 'b" for "'a => 'b option". INCOMPATIBILITY.
161 * Theory SetsAndFunctions has been split into Function_Algebras and Set_Algebras;
162 canonical names for instance definitions for functions; various improvements.
165 * Records: logical foundation type for records do not carry a '_type' suffix
166 any longer. INCOMPATIBILITY.
168 * Code generation for records: more idiomatic representation of record types.
169 Warning: records are not covered by ancient SML code generation any longer.
170 INCOMPATIBILITY. In cases of need, a suitable rep_datatype declaration
171 helps to succeed then:
175 rep_datatype foo_ext ...
177 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
180 * Quickcheck in locales considers interpretations of that locale for
181 counter example search.
183 * Theory Library/Monad_Syntax provides do-syntax for monad types. Syntax
184 in Library/State_Monad has been changed to avoid ambiguities.
187 * Code generator: export_code without explicit file declaration prints
188 to standard output. INCOMPATIBILITY.
190 * Abolished symbol type names: "prod" and "sum" replace "*" and "+"
191 respectively. INCOMPATIBILITY.
193 * Name "Plus" of disjoint sum operator "<+>" is now hidden.
196 * Constant "split" has been merged with constant "prod_case"; names
197 of ML functions, facts etc. involving split have been retained so far,
198 though. INCOMPATIBILITY.
200 * Dropped old infix syntax "mem" for List.member; use "in set"
201 instead. INCOMPATIBILITY.
203 * Refactoring of code-generation specific operations in List.thy
209 mem_iff ~> member_def
210 null_empty ~> null_def
212 INCOMPATIBILITY. Note that these were not suppossed to be used
213 regularly unless for striking reasons; their main purpose was code
216 * Some previously unqualified names have been qualified:
223 Trueprop ~> HOL.Trueprop
228 op --> ~> HOL.implies
240 Pair ~> Product_Type.Pair
241 fst ~> Product_Type.fst
242 snd ~> Product_Type.snd
243 curry ~> Product_Type.curry
245 Collect ~> Set.Collect
249 * Removed simplifier congruence rule of "prod_case", as has for long
250 been the case with "split". INCOMPATIBILITY.
252 * Datatype package: theorems generated for executable equality
253 (class eq) carry proper names and are treated as default code
256 * Removed lemma Option.is_none_none (Duplicate of is_none_def).
259 * List.thy: use various operations from the Haskell prelude when
260 generating Haskell code.
262 * Multiset.thy: renamed empty_idemp -> empty_neutral
264 * code_simp.ML and method code_simp: simplification with rules determined
267 * code generator: do not print function definitions for case
268 combinators any longer.
270 * Multivariate Analysis: Introduced a type class for euclidean space. Most
271 theorems are now stated in terms of euclidean spaces instead of finite
275 real ^ 'n ~> 'a::real_vector
276 ~> 'a::euclidean_space
277 ~> 'a::ordered_euclidean_space
278 (depends on your needs)
282 \<chi> x. _ ~> \<chi>\<chi> x. _
285 Also note that the indices are now natural numbers and not from some finite
286 type. Finite cartesian products of euclidean spaces, products of euclidean
287 spaces the real and complex numbers are instantiated to be euclidean_spaces.
291 * Probability: Introduced pinfreal as real numbers with infinity. Use pinfreal
292 as value for measures. Introduces Lebesgue Measure based on the integral in
293 Multivariate Analysis. Proved Radon Nikodym for arbitrary sigma finite measure
298 * Inductive package: offers new command "inductive_simps" to automatically
299 derive instantiated and simplified equations for inductive predicates,
300 similar to inductive_cases.
302 * "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". "surj f"
303 is now an abbreviation of "range f = UNIV". The theorems bij_def and
304 surj_def are unchanged. INCOMPATIBILITY.
306 * Function package: .psimps rules are no longer implicitly declared [simp].
309 * Weaker versions of the "meson" and "metis" proof methods are now available in
310 "HOL-Plain", without dependency on "Hilbert_Choice". The proof methods become
311 more powerful after "Hilbert_Choice" is loaded in "HOL-Main".
313 * MESON: Renamed lemmas:
314 meson_not_conjD ~> Meson.not_conjD
315 meson_not_disjD ~> Meson.not_disjD
316 meson_not_notD ~> Meson.not_notD
317 meson_not_allD ~> Meson.not_allD
318 meson_not_exD ~> Meson.not_exD
319 meson_imp_to_disjD ~> Meson.imp_to_disjD
320 meson_not_impD ~> Meson.not_impD
321 meson_iff_to_disjD ~> Meson.iff_to_disjD
322 meson_not_iffD ~> Meson.not_iffD
323 meson_not_refl_disj_D ~> Meson.not_refl_disj_D
324 meson_conj_exD1 ~> Meson.conj_exD1
325 meson_conj_exD2 ~> Meson.conj_exD2
326 meson_disj_exD ~> Meson.disj_exD
327 meson_disj_exD1 ~> Meson.disj_exD1
328 meson_disj_exD2 ~> Meson.disj_exD2
329 meson_disj_assoc ~> Meson.disj_assoc
330 meson_disj_comm ~> Meson.disj_comm
331 meson_disj_FalseD1 ~> Meson.disj_FalseD1
332 meson_disj_FalseD2 ~> Meson.disj_FalseD2
335 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available manually as
339 - Added "smt" and "remote_smt" provers based on the "smt" proof method. See
340 the Sledgehammer manual for details ("isabelle doc sledgehammer").
342 COMBI_def ~> Meson.COMBI_def
343 COMBK_def ~> Meson.COMBK_def
344 COMBB_def ~> Meson.COMBB_def
345 COMBC_def ~> Meson.COMBC_def
346 COMBS_def ~> Meson.COMBS_def
354 sledgehammer atp_info ~> sledgehammer running_provers
355 sledgehammer atp_kill ~> sledgehammer kill_provers
356 sledgehammer available_atps ~> sledgehammer available_provers
359 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
360 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
361 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
362 (and "ms" and "min" are no longer supported)
365 * Metis and Meson now have configuration options "meson_trace", "metis_trace",
366 and "metis_verbose" that can be enabled to diagnose these tools. E.g.
368 using [[metis_trace = true]]
372 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
373 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
375 - Now requires Kodkodi 1.2.9. INCOMPATIBILITY.
376 - Added support for partial quotient types.
377 - Added local versions of the "Nitpick.register_xxx" functions.
378 - Added "whack" option.
379 - Allow registration of quotient types as codatatypes.
380 - Improved "merge_type_vars" option to merge more types.
381 - Removed unsound "fast_descrs" option.
382 - Added custom symmetry breaking for datatypes, making it possible to reach
383 higher cardinalities.
384 - Prevent the expansion of too large definitions.
386 * Changed SMT configuration options:
388 z3_proofs ~> smt_oracle (with swapped semantics)
389 z3_trace_assms ~> smt_trace_used_facts
397 * Boogie output files (.b2i files) need to be declared in the
400 * Removed [split_format ... and ... and ...] version of
401 [split_format]. Potential INCOMPATIBILITY.
406 * The domain package now runs in definitional mode by default: The
407 former command 'new_domain' is now called 'domain'. To use the domain
408 package in its original axiomatic mode, use 'domain (unsafe)'.
411 * The new class 'domain' is now the default sort; the definitional
412 domain package and the powerdomain theories both require this class.
413 The new class 'predomain' is an unpointed version of 'domain'.
414 Theories can be updated by replacing sort annotations as shown below.
417 'a::type ~> 'a::countable
418 'a::cpo ~> 'a::predomain
419 'a::pcpo ~> 'a::domain
421 * The old type class 'rep' has been superseded by class 'domain'.
422 Accordingly, users of the definitional package must remove any
423 'default_sort rep' declarations. INCOMPATIBILITY.
425 * The old type classes 'profinite' and 'bifinite', along with the
426 overloaded constant 'approx' have been removed. INCOMPATIBILITY.
428 * The type 'udom alg_defl' has been replaced by the non-parameterized
429 type 'defl'. HOLCF no longer defines an embedding of type defl into
430 udom by default; the instance proof defl :: domain is now available in
431 HOLCF/Library/Defl_Bifinite.thy.
433 * The syntax 'REP('a)' has been replaced with 'DEFL('a)'.
435 * The predicate 'directed' has been removed. INCOMPATIBILITY.
437 * The type class 'finite_po' has been removed. INCOMPATIBILITY.
439 * Renamed some theorems (the original names are also still available).
440 expand_fun_below ~> fun_below_iff
441 below_fun_ext ~> fun_belowI
442 expand_cfun_eq ~> cfun_eq_iff
444 expand_cfun_below ~> cfun_below_iff
445 below_cfun_ext ~> cfun_belowI
446 cont2cont_Rep_CFun ~> cont2cont_APP
448 * The Abs and Rep functions for various types have changed names.
449 Related theorem names have also changed to match. INCOMPATIBILITY.
452 Rep_Sprod ~> Rep_sprod
453 Abs_Sprod ~> Abs_sprod
457 * Lemmas with names of the form *_defined_iff or *_strict_iff have
458 been renamed to *_bottom_iff. INCOMPATIBILITY.
460 * Various changes to bisimulation/coinduction with domain package:
461 - Definitions of 'bisim' constants no longer mention definedness.
462 - With mutual recursion, 'bisim' predicate is now curried.
463 - With mutual recursion, each type gets a separate coind theorem.
464 - Variable names in bisim_def and coinduct rules have changed.
467 * Case combinators generated by the domain package for type 'foo'
468 are now named 'foo_case' instead of 'foo_when'. INCOMPATIBILITY.
470 * Several theorems have been renamed to more accurately reflect the
471 names of constants and types involved. INCOMPATIBILITY.
472 thelub_const ~> lub_const
473 lub_const ~> is_lub_const
475 is_lub_lub ~> is_lubD2
477 unique_lub ~> is_lub_unique
478 is_ub_lub ~> is_lub_rangeD1
479 lub_bin_chain ~> is_lub_bin_chain
480 thelub_Pair ~> lub_Pair
481 lub_cprod ~> is_lub_prod
482 thelub_cprod ~> lub_prod
483 minimal_cprod ~> minimal_prod
484 inst_cprod_pcpo ~> inst_prod_pcpo
486 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
487 sq_ord_less_eq_trans ~> below_eq_trans
488 sq_ord_eq_less_trans ~> eq_below_trans
489 refl_less ~> below_refl
490 trans_less ~> below_trans
491 antisym_less ~> below_antisym
492 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
493 box_less ~> box_below
494 rev_trans_less ~> rev_below_trans
495 not_less2not_eq ~> not_below2not_eq
496 less_UU_iff ~> below_UU_iff
497 flat_less_iff ~> flat_below_iff
498 adm_less ~> adm_below
499 adm_not_less ~> adm_not_below
500 adm_compact_not_less ~> adm_compact_not_below
501 less_fun_def ~> below_fun_def
502 expand_fun_less ~> fun_below_iff
503 less_fun_ext ~> fun_belowI
504 less_discr_def ~> below_discr_def
505 discr_less_eq ~> discr_below_eq
506 less_unit_def ~> below_unit_def
507 less_cprod_def ~> below_prod_def
508 prod_lessI ~> prod_belowI
509 Pair_less_iff ~> Pair_below_iff
510 fst_less_iff ~> fst_below_iff
511 snd_less_iff ~> snd_below_iff
512 expand_cfun_less ~> cfun_below_iff
513 less_cfun_ext ~> cfun_belowI
514 injection_less ~> injection_below
515 less_up_def ~> below_up_def
516 not_Iup_less ~> not_Iup_below
517 Iup_less ~> Iup_below
519 Def_inject_less_eq ~> Def_below_Def
520 Def_less_is_eq ~> Def_below_iff
521 spair_less_iff ~> spair_below_iff
522 less_sprod ~> below_sprod
523 spair_less ~> spair_below
524 sfst_less_iff ~> sfst_below_iff
525 ssnd_less_iff ~> ssnd_below_iff
526 fix_least_less ~> fix_least_below
527 dist_less_one ~> dist_below_one
528 less_ONE ~> below_ONE
529 ONE_less_iff ~> ONE_below_iff
530 less_sinlD ~> below_sinlD
531 less_sinrD ~> below_sinrD
536 * All constant names are now qualified. INCOMPATIBILITY.
541 * All constant names are now qualified. INCOMPATIBILITY.
546 * Former exception Library.UnequalLengths now coincides with
547 ListPair.UnequalLengths.
549 * Renamed raw "explode" function to "raw_explode" to emphasize its
550 meaning. Note that internally to Isabelle, Symbol.explode is used in
551 almost all situations.
553 * Discontinued obsolete function sys_error and exception SYS_ERROR.
554 See implementation manual for further details on exceptions in
557 * Antiquotation @{assert} inlines a function bool -> unit that raises
558 Fail if the argument is false. Due to inlining the source position of
559 failed assertions is included in the error output.
561 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
562 text is in practice always evaluated with a stable theory checkpoint.
563 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
565 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
568 * Renamed structure PureThy to Pure_Thy and moved most of its
569 operations to structure Global_Theory, to emphasize that this is
570 rarely-used global-only stuff.
572 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
573 instead (or tracing for high-volume output).
575 * Configuration option show_question_marks only affects regular pretty
576 printing of types and terms, not raw Term.string_of_vname.
578 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
579 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
580 @{thms} for most purposes.
582 * ML structure Unsynchronized never opened, not even in Isar
583 interaction mode as before. Old Unsynchronized.set etc. have been
584 discontinued -- use plain := instead. This should be *rare* anyway,
585 since modern tools always work via official context data, notably
586 configuration options.
588 * ML antiquotations @{theory} and @{theory_ref} refer to named
589 theories from the ancestry of the current context, not any accidental
590 theory loader state as before. Potential INCOMPATIBILITY, subtle
593 * Parallel and asynchronous execution requires special care concerning
594 interrupts. Structure Exn provides some convenience functions that
595 avoid working directly with raw Interrupt. User code must not absorb
596 interrupts -- intermediate handling (for cleanup etc.) needs to be
597 followed by re-raising of the original exception. Another common
598 source of mistakes are "handle _" patterns, which make the meaning of
599 the program subject to physical effects of the environment.
604 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
608 New in Isabelle2009-2 (June 2010)
609 ---------------------------------
613 * Authentic syntax for *all* logical entities (type classes, type
614 constructors, term constants): provides simple and robust
615 correspondence between formal entities and concrete syntax. Within
616 the parse tree / AST representations, "constants" are decorated by
617 their category (class, type, const) and spelled out explicitly with
618 their full internal name.
620 Substantial INCOMPATIBILITY concerning low-level syntax declarations
621 and translations (translation rules and translation functions in ML).
622 Some hints on upgrading:
624 - Many existing uses of 'syntax' and 'translations' can be replaced
625 by more modern 'type_notation', 'notation' and 'abbreviation',
626 which are independent of this issue.
628 - 'translations' require markup within the AST; the term syntax
629 provides the following special forms:
631 CONST c -- produces syntax version of constant c from context
632 XCONST c -- literally c, checked as constant from context
633 c -- literally c, if declared by 'syntax'
635 Plain identifiers are treated as AST variables -- occasionally the
636 system indicates accidental variables via the error "rhs contains
639 Type classes and type constructors are marked according to their
640 concrete syntax. Some old translations rules need to be written
641 for the "type" category, using type constructor application
642 instead of pseudo-term application of the default category
645 - 'parse_translation' etc. in ML may use the following
648 @{class_syntax c} -- type class c within parse tree / AST
649 @{term_syntax c} -- type constructor c within parse tree / AST
650 @{const_syntax c} -- ML version of "CONST c" above
651 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
653 - Literal types within 'typed_print_translations', i.e. those *not*
654 represented as pseudo-terms are represented verbatim. Use @{class
655 c} or @{type_name c} here instead of the above syntax
658 Note that old non-authentic syntax was based on unqualified base
659 names, so all of the above "constant" names would coincide. Recall
660 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
661 diagnose syntax problems.
663 * Type constructors admit general mixfix syntax, not just infix.
665 * Concrete syntax may be attached to local entities without a proof
666 body, too. This works via regular mixfix annotations for 'fix',
667 'def', 'obtain' etc. or via the explicit 'write' command, which is
668 similar to the 'notation' command in theory specifications.
670 * Discontinued unnamed infix syntax (legacy feature for many years) --
671 need to specify constant name and syntax separately. Internal ML
672 datatype constructors have been renamed from InfixName to Infix etc.
673 Minor INCOMPATIBILITY.
675 * Schematic theorem statements need to be explicitly markup as such,
676 via commands 'schematic_lemma', 'schematic_theorem',
677 'schematic_corollary'. Thus the relevance of the proof is made
678 syntactically clear, which impacts performance in a parallel or
679 asynchronous interactive environment. Minor INCOMPATIBILITY.
681 * Use of cumulative prems via "!" in some proof methods has been
682 discontinued (old legacy feature).
684 * References 'trace_simp' and 'debug_simp' have been replaced by
685 configuration options stored in the context. Enabling tracing (the
686 case of debugging is similar) in proofs works via
688 using [[trace_simp = true]]
690 Tracing is then active for all invocations of the simplifier in
691 subsequent goal refinement steps. Tracing may also still be enabled or
692 disabled via the ProofGeneral settings menu.
694 * Separate commands 'hide_class', 'hide_type', 'hide_const',
695 'hide_fact' replace the former 'hide' KIND command. Minor
698 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
699 more efficient than combinations with -q1 or -q2.
704 * Proofterms record type-class reasoning explicitly, using the
705 "unconstrain" operation internally. This eliminates all sort
706 constraints from a theorem and proof, introducing explicit
707 OFCLASS-premises. On the proof term level, this operation is
708 automatically applied at theorem boundaries, such that closed proofs
709 are always free of sort constraints. INCOMPATIBILITY for tools that
712 * Local theory specifications may depend on extra type variables that
713 are not present in the result type -- arguments TYPE('a) :: 'a itself
714 are added internally. For example:
716 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
718 * Predicates of locales introduced by classes carry a mandatory
719 "class" prefix. INCOMPATIBILITY.
721 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
723 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
726 * Command 'code_reflect' allows to incorporate generated ML code into
727 runtime environment; replaces immature code_datatype antiquotation.
730 * Code generator: simple concept for abstract datatypes obeying
733 * Code generator: details of internal data cache have no impact on the
734 user space functionality any longer.
736 * Methods "unfold_locales" and "intro_locales" ignore non-locale
737 subgoals. This is more appropriate for interpretations with 'where'.
740 * Command 'example_proof' opens an empty proof body. This allows to
741 experiment with Isar, without producing any persistent result.
743 * Commands 'type_notation' and 'no_type_notation' declare type syntax
744 within a local theory context, with explicit checking of the
745 constructors involved (in contrast to the raw 'syntax' versions).
747 * Commands 'types' and 'typedecl' now work within a local theory
748 context -- without introducing dependencies on parameters or
749 assumptions, which is not possible in Isabelle/Pure.
751 * Command 'defaultsort' has been renamed to 'default_sort', it works
752 within a local theory context. Minor INCOMPATIBILITY.
757 * Command 'typedef' now works within a local theory context -- without
758 introducing dependencies on parameters or assumptions, which is not
759 possible in Isabelle/Pure/HOL. Note that the logical environment may
760 contain multiple interpretations of local typedefs (with different
761 non-emptiness proofs), even in a global theory context.
763 * New package for quotient types. Commands 'quotient_type' and
764 'quotient_definition' may be used for defining types and constants by
765 quotient constructions. An example is the type of integers created by
766 quotienting pairs of natural numbers:
769 intrel :: "(nat * nat) => (nat * nat) => bool"
771 "intrel (x, y) (u, v) = (x + v = u + y)"
773 quotient_type int = "nat * nat" / intrel
774 by (auto simp add: equivp_def expand_fun_eq)
777 "0::int" is "(0::nat, 0::nat)"
779 The method "lifting" can be used to lift of theorems from the
780 underlying "raw" type to the quotient type. The example
781 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
782 construction and provides a reasoning infrastructure for finite sets.
784 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
785 clash with new theory Quotient in Main HOL.
787 * Moved the SMT binding into the main HOL session, eliminating
788 separate HOL-SMT session.
790 * List membership infix mem operation is only an input abbreviation.
793 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
794 for future developements; former Library/Word.thy is still present in
795 the AFP entry RSAPPS.
797 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
798 longer shadowed. INCOMPATIBILITY.
800 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
803 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
806 * Dropped normalizing_semiring etc; use the facts in semiring classes
807 instead. INCOMPATIBILITY.
809 * Dropped several real-specific versions of lemmas about floor and
810 ceiling; use the generic lemmas from theory "Archimedean_Field"
811 instead. INCOMPATIBILITY.
813 floor_number_of_eq ~> floor_number_of
814 le_floor_eq_number_of ~> number_of_le_floor
815 le_floor_eq_zero ~> zero_le_floor
816 le_floor_eq_one ~> one_le_floor
817 floor_less_eq_number_of ~> floor_less_number_of
818 floor_less_eq_zero ~> floor_less_zero
819 floor_less_eq_one ~> floor_less_one
820 less_floor_eq_number_of ~> number_of_less_floor
821 less_floor_eq_zero ~> zero_less_floor
822 less_floor_eq_one ~> one_less_floor
823 floor_le_eq_number_of ~> floor_le_number_of
824 floor_le_eq_zero ~> floor_le_zero
825 floor_le_eq_one ~> floor_le_one
826 floor_subtract_number_of ~> floor_diff_number_of
827 floor_subtract_one ~> floor_diff_one
828 ceiling_number_of_eq ~> ceiling_number_of
829 ceiling_le_eq_number_of ~> ceiling_le_number_of
830 ceiling_le_zero_eq ~> ceiling_le_zero
831 ceiling_le_eq_one ~> ceiling_le_one
832 less_ceiling_eq_number_of ~> number_of_less_ceiling
833 less_ceiling_eq_zero ~> zero_less_ceiling
834 less_ceiling_eq_one ~> one_less_ceiling
835 ceiling_less_eq_number_of ~> ceiling_less_number_of
836 ceiling_less_eq_zero ~> ceiling_less_zero
837 ceiling_less_eq_one ~> ceiling_less_one
838 le_ceiling_eq_number_of ~> number_of_le_ceiling
839 le_ceiling_eq_zero ~> zero_le_ceiling
840 le_ceiling_eq_one ~> one_le_ceiling
841 ceiling_subtract_number_of ~> ceiling_diff_number_of
842 ceiling_subtract_one ~> ceiling_diff_one
844 * Theory "Finite_Set": various folding_XXX locales facilitate the
845 application of the various fold combinators on finite sets.
847 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
848 provides abstract red-black tree type which is backed by "RBT_Impl" as
849 implementation. INCOMPATIBILTY.
851 * Theory Library/Coinductive_List has been removed -- superseded by
852 AFP/thys/Coinductive.
854 * Theory PReal, including the type "preal" and related operations, has
855 been removed. INCOMPATIBILITY.
857 * Real: new development using Cauchy Sequences.
859 * Split off theory "Big_Operators" containing setsum, setprod,
860 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
862 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
863 "Int" etc. INCOMPATIBILITY.
865 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
867 * New set of rules "ac_simps" provides combined assoc / commute
868 rewrites for all interpretations of the appropriate generic locales.
870 * Renamed theory "OrderedGroup" to "Groups" and split theory
871 "Ring_and_Field" into theories "Rings" and "Fields"; for more
872 appropriate and more consistent names suitable for name prefixes
873 within the HOL theories. INCOMPATIBILITY.
875 * Some generic constants have been put to appropriate theories:
876 - less_eq, less: Orderings
877 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
878 - inverse, divide: Rings
881 * More consistent naming of type classes involving orderings (and
884 lower_semilattice ~> semilattice_inf
885 upper_semilattice ~> semilattice_sup
887 dense_linear_order ~> dense_linorder
889 pordered_ab_group_add ~> ordered_ab_group_add
890 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
891 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
892 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
893 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
894 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
895 pordered_cancel_semiring ~> ordered_cancel_semiring
896 pordered_comm_monoid_add ~> ordered_comm_monoid_add
897 pordered_comm_ring ~> ordered_comm_ring
898 pordered_comm_semiring ~> ordered_comm_semiring
899 pordered_ring ~> ordered_ring
900 pordered_ring_abs ~> ordered_ring_abs
901 pordered_semiring ~> ordered_semiring
903 ordered_ab_group_add ~> linordered_ab_group_add
904 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
905 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
906 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
907 ordered_field ~> linordered_field
908 ordered_field_no_lb ~> linordered_field_no_lb
909 ordered_field_no_ub ~> linordered_field_no_ub
910 ordered_field_dense_linear_order ~> dense_linordered_field
911 ordered_idom ~> linordered_idom
912 ordered_ring ~> linordered_ring
913 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
914 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
915 ordered_ring_strict ~> linordered_ring_strict
916 ordered_semidom ~> linordered_semidom
917 ordered_semiring ~> linordered_semiring
918 ordered_semiring_1 ~> linordered_semiring_1
919 ordered_semiring_1_strict ~> linordered_semiring_1_strict
920 ordered_semiring_strict ~> linordered_semiring_strict
922 The following slightly odd type classes have been moved to a
923 separate theory Library/Lattice_Algebras:
925 lordered_ab_group_add ~> lattice_ab_group_add
926 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
927 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
928 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
929 lordered_ring ~> lattice_ring
933 * Refined field classes:
934 - classes division_ring_inverse_zero, field_inverse_zero,
935 linordered_field_inverse_zero include rule inverse 0 = 0 --
936 subsumes former division_by_zero class;
937 - numerous lemmas have been ported from field to division_ring.
940 * Refined algebra theorem collections:
941 - dropped theorem group group_simps, use algebra_simps instead;
942 - dropped theorem group ring_simps, use field_simps instead;
943 - proper theorem collection field_simps subsumes former theorem
944 groups field_eq_simps and field_simps;
945 - dropped lemma eq_minus_self_iff which is a duplicate for
949 * Theory Finite_Set and List: some lemmas have been generalized from
952 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
953 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
954 inter_Inter_fold_inter ~> inf_Inf_fold_inf
955 union_Union_fold_union ~> sup_Sup_fold_sup
956 Inter_fold_inter ~> Inf_fold_inf
957 Union_fold_union ~> Sup_fold_sup
958 inter_INTER_fold_inter ~> inf_INFI_fold_inf
959 union_UNION_fold_union ~> sup_SUPR_fold_sup
960 INTER_fold_inter ~> INFI_fold_inf
961 UNION_fold_union ~> SUPR_fold_sup
963 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
964 replaced by the more convenient lemmas Inf_empty and Sup_empty.
965 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
966 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
967 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
968 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
970 * Reorganized theory Multiset: swapped notation of pointwise and
973 - pointwise ordering is instance of class order with standard syntax
975 - multiset ordering has syntax <=# and <#; partial order properties
976 are provided by means of interpretation with prefix
978 - less duplication, less historical organization of sections,
979 conversion from associations lists to multisets, rudimentary code
981 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
986 multiset_eq_conv_count_eq ~> multiset_ext_iff
987 multi_count_ext ~> multiset_ext
988 diff_union_inverse2 ~> diff_union_cancelR
992 * Theory Permutation: replaced local "remove" by List.remove1.
994 * Code generation: ML and OCaml code is decorated with signatures.
996 * Theory List: added transpose.
998 * Library/Nat_Bijection.thy is a collection of bijective functions
999 between nat and other types, which supersedes the older libraries
1000 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
1003 Nat_Int_Bij.nat2_to_nat ~> prod_encode
1004 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
1005 Nat_Int_Bij.int_to_nat_bij ~> int_encode
1006 Nat_Int_Bij.nat_to_int_bij ~> int_decode
1007 Countable.pair_encode ~> prod_encode
1008 NatIso.prod2nat ~> prod_encode
1009 NatIso.nat2prod ~> prod_decode
1010 NatIso.sum2nat ~> sum_encode
1011 NatIso.nat2sum ~> sum_decode
1012 NatIso.list2nat ~> list_encode
1013 NatIso.nat2list ~> list_decode
1014 NatIso.set2nat ~> set_encode
1015 NatIso.nat2set ~> set_decode
1018 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
1019 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
1020 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
1021 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
1022 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
1023 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
1024 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
1025 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
1026 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
1027 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
1028 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
1029 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
1030 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
1033 - Renamed ATP commands:
1034 atp_info ~> sledgehammer running_atps
1035 atp_kill ~> sledgehammer kill_atps
1036 atp_messages ~> sledgehammer messages
1037 atp_minimize ~> sledgehammer minimize
1038 print_atps ~> sledgehammer available_atps
1040 - Added user's manual ("isabelle doc sledgehammer").
1041 - Added option syntax and "sledgehammer_params" to customize
1042 Sledgehammer's behavior. See the manual for details.
1043 - Modified the Isar proof reconstruction code so that it produces
1044 direct proofs rather than proofs by contradiction. (This feature
1045 is still experimental.)
1046 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
1048 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
1051 - Added and implemented "binary_ints" and "bits" options.
1052 - Added "std" option and implemented support for nonstandard models.
1053 - Added and implemented "finitize" option to improve the precision
1054 of infinite datatypes based on a monotonicity analysis.
1055 - Added support for quotient types.
1056 - Added support for "specification" and "ax_specification"
1058 - Added support for local definitions (for "function" and
1059 "termination" proofs).
1060 - Added support for term postprocessors.
1061 - Optimized "Multiset.multiset" and "FinFun.finfun".
1062 - Improved efficiency of "destroy_constrs" optimization.
1063 - Fixed soundness bugs related to "destroy_constrs" optimization and
1065 - Fixed soundness bug related to higher-order constructors.
1066 - Fixed soundness bug when "full_descrs" is enabled.
1067 - Improved precision of set constructs.
1068 - Added "atoms" option.
1069 - Added cache to speed up repeated Kodkod invocations on the same
1071 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
1072 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
1073 "SAT4J_Light". INCOMPATIBILITY.
1074 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
1075 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
1076 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
1078 * Method "induct" now takes instantiations of the form t, where t is not
1079 a variable, as a shorthand for "x == t", where x is a fresh variable.
1080 If this is not intended, t has to be enclosed in parentheses.
1081 By default, the equalities generated by definitional instantiations
1082 are pre-simplified, which may cause parameters of inductive cases
1083 to disappear, or may even delete some of the inductive cases.
1084 Use "induct (no_simp)" instead of "induct" to restore the old
1085 behaviour. The (no_simp) option is also understood by the "cases"
1086 and "nominal_induct" methods, which now perform pre-simplification, too.
1092 * Variable names in lemmas generated by the domain package have
1093 changed; the naming scheme is now consistent with the HOL datatype
1094 package. Some proof scripts may be affected, INCOMPATIBILITY.
1096 * The domain package no longer defines the function "foo_copy" for
1097 recursive domain "foo". The reach lemma is now stated directly in
1098 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
1099 be reformulated in terms of "foo_take", INCOMPATIBILITY.
1101 * Most definedness lemmas generated by the domain package (previously
1102 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
1103 like "foo$x = UU <-> x = UU", which works better as a simp rule.
1104 Proofs that used definedness lemmas as intro rules may break,
1105 potential INCOMPATIBILITY.
1107 * Induction and casedist rules generated by the domain package now
1108 declare proper case_names (one called "bottom", and one named for each
1109 constructor). INCOMPATIBILITY.
1111 * For mutually-recursive domains, separate "reach" and "take_lemma"
1112 rules are generated for each domain, INCOMPATIBILITY.
1114 foo_bar.reach ~> foo.reach bar.reach
1115 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
1117 * Some lemmas generated by the domain package have been renamed for
1118 consistency with the datatype package, INCOMPATIBILITY.
1120 foo.ind ~> foo.induct
1121 foo.finite_ind ~> foo.finite_induct
1122 foo.coind ~> foo.coinduct
1123 foo.casedist ~> foo.exhaust
1124 foo.exhaust ~> foo.nchotomy
1126 * For consistency with other definition packages, the fixrec package
1127 now generates qualified theorem names, INCOMPATIBILITY.
1129 foo_simps ~> foo.simps
1130 foo_unfold ~> foo.unfold
1131 foo_induct ~> foo.induct
1133 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
1134 method and internal fixrec proofs now use the default simpset instead.
1137 * The "contlub" predicate has been removed. Proof scripts should use
1138 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
1140 * The "admw" predicate has been removed, INCOMPATIBILITY.
1142 * The constants cpair, cfst, and csnd have been removed in favor of
1143 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
1148 * Antiquotations for basic formal entities:
1150 @{class NAME} -- type class
1151 @{class_syntax NAME} -- syntax representation of the above
1153 @{type_name NAME} -- logical type
1154 @{type_abbrev NAME} -- type abbreviation
1155 @{nonterminal NAME} -- type of concrete syntactic category
1156 @{type_syntax NAME} -- syntax representation of any of the above
1158 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
1159 @{const_abbrev NAME} -- abbreviated constant
1160 @{const_syntax NAME} -- syntax representation of any of the above
1162 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
1163 syntax constant (cf. 'syntax' command).
1165 * Antiquotation @{make_string} inlines a function to print arbitrary
1166 values similar to the ML toplevel. The result is compiler dependent
1167 and may fall back on "?" in certain situations.
1169 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
1170 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
1171 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
1172 not work with the asynchronous Isar document model.
1174 * Configuration options now admit dynamic default values, depending on
1175 the context or even global references.
1177 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
1178 uses an efficient external library if available (for Poly/ML).
1180 * Renamed some important ML structures, while keeping the old names
1181 for some time as aliases within the structure Legacy:
1183 OuterKeyword ~> Keyword
1186 OuterSyntax ~> Outer_Syntax
1187 PrintMode ~> Print_Mode
1188 SpecParse ~> Parse_Spec
1191 ThyOutput ~> Thy_Output
1192 TypeInfer ~> Type_Infer
1194 Note that "open Legacy" simplifies porting of sources, but forgetting
1195 to remove it again will complicate porting again in the future.
1197 * Most operations that refer to a global context are named
1198 accordingly, e.g. Simplifier.global_context or
1199 ProofContext.init_global. There are some situations where a global
1200 context actually works, but under normal circumstances one needs to
1201 pass the proper local context through the code!
1203 * Discontinued old TheoryDataFun with its copy/init operation -- data
1204 needs to be pure. Functor Theory_Data_PP retains the traditional
1205 Pretty.pp argument to merge, which is absent in the standard
1206 Theory_Data version.
1208 * Sorts.certify_sort and derived "cert" operations for types and terms
1209 no longer minimize sorts. Thus certification at the boundary of the
1210 inference kernel becomes invariant under addition of class relations,
1211 which is an important monotonicity principle. Sorts are now minimized
1212 in the syntax layer only, at the boundary between the end-user and the
1213 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
1214 explicitly in rare situations.
1216 * Renamed old-style Drule.standard to Drule.export_without_context, to
1217 emphasize that this is in no way a standard operation.
1220 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
1221 usual for resolution. Rare INCOMPATIBILITY.
1223 * Renamed varify/unvarify operations to varify_global/unvarify_global
1224 to emphasize that these only work in a global situation (which is
1227 * Curried take and drop in library.ML; negative length is interpreted
1228 as infinity (as in chop). Subtle INCOMPATIBILITY.
1230 * Proof terms: type substitutions on proof constants now use canonical
1231 order of type variables. INCOMPATIBILITY for tools working with proof
1234 * Raw axioms/defs may no longer carry sort constraints, and raw defs
1235 may no longer carry premises. User-level specifications are
1236 transformed accordingly by Thm.add_axiom/add_def.
1241 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
1242 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
1243 proof terms are enabled unconditionally in the new HOL-Proofs image.
1245 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
1246 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
1249 * Old lib/scripts/polyml-platform is superseded by the
1250 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
1251 variant, even on a 64 bit machine. The following example setting
1252 prefers 64 bit if available:
1254 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
1256 * The preliminary Isabelle/jEdit application demonstrates the emerging
1257 Isabelle/Scala layer for advanced prover interaction and integration.
1258 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
1261 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
1262 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
1263 similar to the default assignment of the document preparation system
1264 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
1265 provides some operations for direct access to the font without asking
1266 the user for manual installation.
1270 New in Isabelle2009-1 (December 2009)
1271 -------------------------------------
1275 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
1276 one backslash should be used, even in ML sources.
1281 * Locale interpretation propagates mixins along the locale hierarchy.
1282 The currently only available mixins are the equations used to map
1283 local definitions to terms of the target domain of an interpretation.
1285 * Reactivated diagnostic command 'print_interps'. Use "print_interps
1286 loc" to print all interpretations of locale "loc" in the theory.
1287 Interpretations in proofs are not shown.
1289 * Thoroughly revised locales tutorial. New section on conditional
1292 * On instantiation of classes, remaining undefined class parameters
1293 are formally declared. INCOMPATIBILITY.
1296 *** Document preparation ***
1298 * New generalized style concept for printing terms: @{foo (style) ...}
1299 instead of @{foo_style style ...} (old form is still retained for
1300 backward compatibility). Styles can be also applied for
1301 antiquotations prop, term_type and typeof.
1306 * New proof method "smt" for a combination of first-order logic with
1307 equality, linear and nonlinear (natural/integer/real) arithmetic, and
1308 fixed-size bitvectors; there is also basic support for higher-order
1309 features (esp. lambda abstractions). It is an incomplete decision
1310 procedure based on external SMT solvers using the oracle mechanism;
1311 for the SMT solver Z3, this method is proof-producing. Certificates
1312 are provided to avoid calling the external solvers solely for
1313 re-checking proofs. Due to a remote SMT service there is no need for
1314 installing SMT solvers locally. See src/HOL/SMT.
1316 * New commands to load and prove verification conditions generated by
1317 the Boogie program verifier or derived systems (e.g. the Verifying C
1318 Compiler (VCC) or Spec#). See src/HOL/Boogie.
1320 * New counterexample generator tool 'nitpick' based on the Kodkod
1321 relational model finder. See src/HOL/Tools/Nitpick and
1322 src/HOL/Nitpick_Examples.
1324 * New commands 'code_pred' and 'values' to invoke the predicate
1325 compiler and to enumerate values of inductive predicates.
1327 * A tabled implementation of the reflexive transitive closure.
1329 * New implementation of quickcheck uses generic code generator;
1330 default generators are provided for all suitable HOL types, records
1331 and datatypes. Old quickcheck can be re-activated importing theory
1332 Library/SML_Quickcheck.
1334 * New testing tool Mirabelle for automated proof tools. Applies
1335 several tools and tactics like sledgehammer, metis, or quickcheck, to
1336 every proof step in a theory. To be used in batch mode via the
1337 "mirabelle" utility.
1339 * New proof method "sos" (sum of squares) for nonlinear real
1340 arithmetic (originally due to John Harison). It requires theory
1341 Library/Sum_Of_Squares. It is not a complete decision procedure but
1342 works well in practice on quantifier-free real arithmetic with +, -,
1343 *, ^, =, <= and <, i.e. boolean combinations of equalities and
1344 inequalities between polynomials. It makes use of external
1345 semidefinite programming solvers. Method "sos" generates a
1346 certificate that can be pasted into the proof thus avoiding the need
1347 to call an external tool every time the proof is checked. See
1348 src/HOL/Library/Sum_Of_Squares.
1350 * New method "linarith" invokes existing linear arithmetic decision
1353 * New command 'atp_minimal' reduces result produced by Sledgehammer.
1355 * New Sledgehammer option "Full Types" in Proof General settings menu.
1356 Causes full type information to be output to the ATPs. This slows
1357 ATPs down considerably but eliminates a source of unsound "proofs"
1360 * New method "metisFT": A version of metis that uses full type
1361 information in order to avoid failures of proof reconstruction.
1363 * New evaluator "approximate" approximates an real valued term using
1364 the same method as the approximation method.
1366 * Method "approximate" now supports arithmetic expressions as
1367 boundaries of intervals and implements interval splitting and Taylor
1370 * ML antiquotation @{code_datatype} inserts definition of a datatype
1371 generated by the code generator; e.g. see src/HOL/Predicate.thy.
1373 * New theory SupInf of the supremum and infimum operators for sets of
1376 * New theory Probability, which contains a development of measure
1377 theory, eventually leading to Lebesgue integration and probability.
1379 * Extended Multivariate Analysis to include derivation and Brouwer's
1382 * Reorganization of number theory, INCOMPATIBILITY:
1383 - new number theory development for nat and int, in theories Divides
1384 and GCD as well as in new session Number_Theory
1385 - some constants and facts now suffixed with _nat and _int
1387 - former session NumberTheory now named Old_Number_Theory, including
1388 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
1389 - moved theory Pocklington from src/HOL/Library to
1390 src/HOL/Old_Number_Theory
1392 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
1393 lcm of finite and infinite sets. It is shown that they form a complete
1396 * Class semiring_div requires superclass no_zero_divisors and proof of
1397 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
1398 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
1399 generalized to class semiring_div, subsuming former theorems
1400 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
1401 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
1404 * Refinements to lattice classes and sets:
1405 - less default intro/elim rules in locale variant, more default
1406 intro/elim rules in class variant: more uniformity
1407 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
1409 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
1411 - renamed ACI to inf_sup_aci
1412 - new class "boolean_algebra"
1413 - class "complete_lattice" moved to separate theory
1414 "Complete_Lattice"; corresponding constants (and abbreviations)
1415 renamed and with authentic syntax:
1416 Set.Inf ~> Complete_Lattice.Inf
1417 Set.Sup ~> Complete_Lattice.Sup
1418 Set.INFI ~> Complete_Lattice.INFI
1419 Set.SUPR ~> Complete_Lattice.SUPR
1420 Set.Inter ~> Complete_Lattice.Inter
1421 Set.Union ~> Complete_Lattice.Union
1422 Set.INTER ~> Complete_Lattice.INTER
1423 Set.UNION ~> Complete_Lattice.UNION
1424 - authentic syntax for
1427 - mere abbreviations:
1430 Set.inter (for inf, formerly Set.Int)
1431 Set.union (for sup, formerly Set.Un)
1432 Complete_Lattice.Inter (for Inf)
1433 Complete_Lattice.Union (for Sup)
1434 Complete_Lattice.INTER (for INFI)
1435 Complete_Lattice.UNION (for SUPR)
1436 - object-logic definitions as far as appropriate
1438 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
1439 Un_subset_iff are explicitly deleted as default simp rules; then also
1440 their lattice counterparts le_inf_iff and le_sup_iff have to be
1441 deleted to achieve the desired effect.
1443 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
1444 rules by default any longer; the same applies to min_max.inf_absorb1
1445 etc. INCOMPATIBILITY.
1447 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
1448 pred_set_conv by default. INCOMPATIBILITY.
1450 * Power operations on relations and functions are now one dedicated
1451 constant "compow" with infix syntax "^^". Power operation on
1452 multiplicative monoids retains syntax "^" and is now defined generic
1453 in class power. INCOMPATIBILITY.
1455 * Relation composition "R O S" now has a more standard argument order:
1456 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
1457 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
1458 break, since the O_assoc rule was not rewritten like this. Fix using
1459 O_assoc[symmetric]. The same applies to the curried version "R OO S".
1461 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
1462 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
1465 * Most rules produced by inductive and datatype package have mandatory
1466 prefixes. INCOMPATIBILITY.
1468 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
1469 the attribute of the same name. Each of the theorems in the list
1470 DERIV_intros assumes composition with an additional function and
1471 matches a variable to the derivative, which has to be solved by the
1472 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
1473 of most elementary terms. Former Maclauren.DERIV_tac and
1474 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
1477 * Code generator attributes follow the usual underscore convention:
1478 code_unfold replaces code unfold
1479 code_post replaces code post
1484 sizechange -> size_change
1485 induct_scheme -> induction_schema
1488 * Discontinued abbreviation "arbitrary" of constant "undefined".
1489 INCOMPATIBILITY, use "undefined" directly.
1492 Suc_eq_add_numeral_1 -> Suc_eq_plus1
1493 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
1494 Suc_plus1 -> Suc_eq_plus1
1495 *anti_sym -> *antisym*
1496 vector_less_eq_def -> vector_le_def
1499 * Added theorem List.map_map as [simp]. Removed List.map_compose.
1502 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1508 * Theory Representable defines a class "rep" of domains that are
1509 representable (via an ep-pair) in the universal domain type "udom".
1510 Instances are provided for all type constructors defined in HOLCF.
1512 * The 'new_domain' command is a purely definitional version of the
1513 domain package, for representable domains. Syntax is identical to the
1514 old domain package. The 'new_domain' package also supports indirect
1515 recursion using previously-defined type constructors. See
1516 src/HOLCF/ex/New_Domain.thy for examples.
1518 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1519 on the left-hand side of an equation, and then performs
1520 simplification. Rewriting is done using rules declared with the
1521 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1522 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1524 * The pattern-match compiler in 'fixrec' can now handle constructors
1525 with HOL function types. Pattern-match combinators for the Pair
1526 constructor are pre-configured.
1528 * The 'fixrec' package now produces better fixed-point induction rules
1529 for mutually-recursive definitions: Induction rules have conclusions
1530 of the form "P foo bar" instead of "P <foo, bar>".
1532 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1533 been renamed to "below". The name "below" now replaces "less" in many
1534 theorem names. (Legacy theorem names using "less" are still supported
1537 * The 'fixrec' package now supports "bottom patterns". Bottom
1538 patterns can be used to generate strictness rules, or to make
1539 functions more strict (much like the bang-patterns supported by the
1540 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1546 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1547 errors and run-time exceptions, including detailed source positions.
1549 * Structure Name_Space (formerly NameSpace) now manages uniquely
1550 identified entries, with some additional information such as source
1551 position, logical grouping etc.
1553 * Theory and context data is now introduced by the simplified and
1554 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1555 to be pure, but the old TheoryDataFun for mutable data (with explicit
1556 copy operation) is still available for some time.
1558 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1559 provides a high-level programming interface to synchronized state
1560 variables with atomic update. This works via pure function
1561 application within a critical section -- its runtime should be as
1562 short as possible; beware of deadlocks if critical code is nested,
1563 either directly or indirectly via other synchronized variables!
1565 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1566 wraps raw ML references, explicitly indicating their non-thread-safe
1567 behaviour. The Isar toplevel keeps this structure open, to
1568 accommodate Proof General as well as quick and dirty interactive
1569 experiments with references.
1571 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1572 parallel tactical reasoning.
1574 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1575 are similar to SUBPROOF, but are slightly more flexible: only the
1576 specified parts of the subgoal are imported into the context, and the
1577 body tactic may introduce new subgoals and schematic variables.
1579 * Old tactical METAHYPS, which does not observe the proof context, has
1580 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1581 or Subgoal.FOCUS etc.
1583 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1584 functors have their own ML name space there is no point to mark them
1585 separately.) Minor INCOMPATIBILITY.
1587 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1589 * Renamed several structures FooBar to Foo_Bar. Occasional,
1592 * Operations of structure Skip_Proof no longer require quick_and_dirty
1593 mode, which avoids critical setmp.
1595 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1596 combinators for "args". INCOMPATIBILITY, need to use simplified
1597 Attrib/Method.setup introduced in Isabelle2009.
1599 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1600 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1601 last resort. INCOMPATIBILITY.
1603 * Display.pretty_thm now requires a proper context (cf. former
1604 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1605 or even Display.pretty_thm_without_context as last resort.
1608 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1609 Syntax.pretty_typ/term directly, preferably with proper context
1610 instead of global theory.
1615 * Further fine tuning of parallel proof checking, scales up to 8 cores
1616 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1619 * Support for additional "Isabelle components" via etc/components, see
1620 also the system manual.
1622 * The isabelle makeall tool now operates on all components with
1623 IsaMakefile, not just hardwired "logics".
1625 * Removed "compress" option from isabelle-process and isabelle usedir;
1626 this is always enabled.
1628 * Discontinued support for Poly/ML 4.x versions.
1630 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1631 on a given logic image. This requires the lighttpd webserver and is
1632 currently supported on Linux only.
1636 New in Isabelle2009 (April 2009)
1637 --------------------------------
1641 * Simplified main Isabelle executables, with less surprises on
1642 case-insensitive file-systems (such as Mac OS).
1644 - The main Isabelle tool wrapper is now called "isabelle" instead of
1647 - The former "isabelle" alias for "isabelle-process" has been
1648 removed (should rarely occur to regular users).
1650 - The former "isabelle-interface" and its alias "Isabelle" have been
1651 removed (interfaces are now regular Isabelle tools).
1653 Within scripts and make files, the Isabelle environment variables
1654 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1655 respectively. (The latter are still available as legacy feature.)
1657 The old isabelle-interface wrapper could react in confusing ways if
1658 the interface was uninstalled or changed otherwise. Individual
1659 interface tool configuration is now more explicit, see also the
1660 Isabelle system manual. In particular, Proof General is now available
1661 via "isabelle emacs".
1663 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1664 purge installed copies of Isabelle executables and re-run "isabelle
1665 install -p ...", or use symlinks.
1667 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1668 old ~/isabelle, which was slightly non-standard and apt to cause
1669 surprises on case-insensitive file-systems (such as Mac OS).
1671 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1672 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1673 care is required when using older releases of Isabelle. Note that
1674 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1675 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1677 * Proofs of fully specified statements are run in parallel on
1678 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1679 a regular 4-core machine, if the initial heap space is made reasonably
1680 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1682 * The main reference manuals ("isar-ref", "implementation", and
1683 "system") have been updated and extended. Formally checked references
1684 as hyperlinks are now available uniformly.
1689 * Complete re-implementation of locales. INCOMPATIBILITY in several
1690 respects. The most important changes are listed below. See the
1691 Tutorial on Locales ("locales" manual) for details.
1693 - In locale expressions, instantiation replaces renaming. Parameters
1694 must be declared in a for clause. To aid compatibility with previous
1695 parameter inheritance, in locale declarations, parameters that are not
1696 'touched' (instantiation position "_" or omitted) are implicitly added
1697 with their syntax at the beginning of the for clause.
1699 - Syntax from abbreviations and definitions in locales is available in
1700 locale expressions and context elements. The latter is particularly
1701 useful in locale declarations.
1703 - More flexible mechanisms to qualify names generated by locale
1704 expressions. Qualifiers (prefixes) may be specified in locale
1705 expressions, and can be marked as mandatory (syntax: "name!:") or
1706 optional (syntax "name?:"). The default depends for plain "name:"
1707 depends on the situation where a locale expression is used: in
1708 commands 'locale' and 'sublocale' prefixes are optional, in
1709 'interpretation' and 'interpret' prefixes are mandatory. The old
1710 implicit qualifiers derived from the parameter names of a locale are
1711 no longer generated.
1713 - Command "sublocale l < e" replaces "interpretation l < e". The
1714 instantiation clause in "interpretation" and "interpret" (square
1715 brackets) is no longer available. Use locale expressions.
1717 - When converting proof scripts, mandatory qualifiers in
1718 'interpretation' and 'interpret' should be retained by default, even
1719 if this is an INCOMPATIBILITY compared to former behavior. In the
1720 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1721 in locale expressions range over a single locale instance only.
1723 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1724 In existing theorem specifications replace the includes element by the
1725 respective context elements of the included locale, omitting those
1726 that are already present in the theorem specification. Multiple
1727 assume elements of a locale should be replaced by a single one
1728 involving the locale predicate. In the proof body, declarations (most
1729 notably theorems) may be regained by interpreting the respective
1730 locales in the proof context as required (command "interpret").
1732 If using "includes" in replacement of a target solely because the
1733 parameter types in the theorem are not as general as in the target,
1734 consider declaring a new locale with additional type constraints on
1735 the parameters (context element "constrains").
1737 - Discontinued "locale (open)". INCOMPATIBILITY.
1739 - Locale interpretation commands no longer attempt to simplify goal.
1740 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1741 methods intro_locales and unfold_locales to clarify.
1743 - Locale interpretation commands no longer accept interpretation
1744 attributes. INCOMPATIBILITY.
1746 * Class declaration: so-called "base sort" must not be given in import
1747 list any longer, but is inferred from the specification. Particularly
1754 class foo = type + ...
1756 * Class target: global versions of theorems stemming do not carry a
1757 parameter prefix any longer. INCOMPATIBILITY.
1759 * Class 'instance' command no longer accepts attached definitions.
1760 INCOMPATIBILITY, use proper 'instantiation' target instead.
1762 * Recovered hiding of consts, which was accidentally broken in
1763 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1764 makes c inaccessible; consider using ``hide (open) const c'' instead.
1766 * Slightly more coherent Pure syntax, with updated documentation in
1767 isar-ref manual. Removed locales meta_term_syntax and
1768 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1769 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1770 directly in regular applications.
1772 * There is a new syntactic category "float_const" for signed decimal
1773 fractions (e.g. 123.45 or -123.45).
1775 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1776 interface with 'setup' command instead.
1778 * Command 'local_setup' is similar to 'setup', but operates on a local
1781 * The 'axiomatization' command now only works within a global theory
1782 context. INCOMPATIBILITY.
1784 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1785 hypotheses. Sorts required in the course of reasoning need to be
1786 covered by the constraints in the initial statement, completed by the
1787 type instance information of the background theory. Non-trivial sort
1788 hypotheses, which rarely occur in practice, may be specified via
1789 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1791 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1793 The result contains an implicit sort hypotheses as before --
1794 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1797 * Generalized Isar history, with support for linear undo, direct state
1800 * Changed defaults for unify configuration options:
1802 unify_trace_bound = 50 (formerly 25)
1803 unify_search_bound = 60 (formerly 30)
1805 * Different bookkeeping for code equations (INCOMPATIBILITY):
1807 a) On theory merge, the last set of code equations for a particular
1808 constant is taken (in accordance with the policy applied by other
1809 parts of the code generator framework).
1811 b) Code equations stemming from explicit declarations (e.g. code
1812 attribute) gain priority over default code equations stemming
1813 from definition, primrec, fun etc.
1815 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1817 * Unified theorem tables for both code generators. Thus [code
1818 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1820 * Command 'find_consts' searches for constants based on type and name
1823 find_consts "_ => bool"
1825 By default, matching is against subtypes, but it may be restricted to
1826 the whole type. Searching by name is possible. Multiple queries are
1827 conjunctive and queries may be negated by prefixing them with a
1830 find_consts strict: "_ => bool" name: "Int" -"int => int"
1832 * New 'find_theorems' criterion "solves" matches theorems that
1833 directly solve the current goal (modulo higher-order unification).
1835 * Auto solve feature for main theorem statements: whenever a new goal
1836 is stated, "find_theorems solves" is called; any theorems that could
1837 solve the lemma directly are listed as part of the goal state.
1838 Cf. associated options in Proof General Isabelle settings menu,
1839 enabled by default, with reasonable timeout for pathological cases of
1840 higher-order unification.
1843 *** Document preparation ***
1845 * Antiquotation @{lemma} now imitates a regular terminal proof,
1846 demanding keyword 'by' and supporting the full method expression
1847 syntax just like the Isar command 'by'.
1852 * Integrated main parts of former image HOL-Complex with HOL. Entry
1853 points Main and Complex_Main remain as before.
1855 * Logic image HOL-Plain provides a minimal HOL with the most important
1856 tools available (inductive, datatype, primrec, ...). This facilitates
1857 experimentation and tool development. Note that user applications
1858 (and library theories) should never refer to anything below theory
1861 * Logic image HOL-Main stops at theory Main, and thus facilitates
1862 experimentation due to shorter build times.
1864 * Logic image HOL-NSA contains theories of nonstandard analysis which
1865 were previously part of former HOL-Complex. Entry point Hyperreal
1866 remains valid, but theories formerly using Complex_Main should now use
1867 new entry point Hypercomplex.
1869 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1870 Posix processes. Avoids potentially expensive forking of the ML
1871 process. New thread-based implementation also works on non-Unix
1872 platforms (Cygwin). Provers are no longer hardwired, but defined
1873 within the theory via plain ML wrapper functions. Basic Sledgehammer
1874 commands are covered in the isar-ref manual.
1876 * Wrapper scripts for remote SystemOnTPTP service allows to use
1877 sledgehammer without local ATP installation (Vampire etc.). Other
1878 provers may be included via suitable ML wrappers, see also
1879 src/HOL/ATP_Linkup.thy.
1881 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1884 * The metis method no longer fails because the theorem is too trivial
1885 (contains the empty clause).
1887 * The metis method now fails in the usual manner, rather than raising
1888 an exception, if it determines that it cannot prove the theorem.
1890 * Method "coherent" implements a prover for coherent logic (see also
1891 src/Tools/coherent.ML).
1893 * Constants "undefined" and "default" replace "arbitrary". Usually
1894 "undefined" is the right choice to replace "arbitrary", though
1895 logically there is no difference. INCOMPATIBILITY.
1897 * Command "value" now integrates different evaluation mechanisms. The
1898 result of the first successful evaluation mechanism is printed. In
1899 square brackets a particular named evaluation mechanisms may be
1900 specified (currently, [SML], [code] or [nbe]). See further
1901 src/HOL/ex/Eval_Examples.thy.
1903 * Normalization by evaluation now allows non-leftlinear equations.
1904 Declare with attribute [code nbe].
1906 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1907 as the structured Isar versions "cases" and "induct", cf. the
1908 corresponding "cases" and "induct" attributes. Mutual induction rules
1909 are now presented as a list of individual projections
1910 (e.g. foo_bar.inducts for types foo and bar); the old format with
1911 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1912 rare situations a different rule is selected --- notably nested tuple
1913 elimination instead of former prod.exhaust: use explicit (case_tac t
1914 rule: prod.exhaust) here.
1916 * Attributes "cases", "induct", "coinduct" support "del" option.
1918 * Removed fact "case_split_thm", which duplicates "case_split".
1920 * The option datatype has been moved to a new theory Option. Renamed
1921 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1923 * New predicate "strict_mono" classifies strict functions on partial
1924 orders. With strict functions on linear orders, reasoning about
1925 (in)equalities is facilitated by theorems "strict_mono_eq",
1926 "strict_mono_less_eq" and "strict_mono_less".
1928 * Some set operations are now proper qualified constants with
1929 authentic syntax. INCOMPATIBILITY:
1940 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1943 * Auxiliary class "itself" has disappeared -- classes without any
1944 parameter are treated as expected by the 'class' command.
1946 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1948 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1949 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1951 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1952 method "approximation". It proves formulas on real values by using
1953 interval arithmetic. In the formulas are also the transcendental
1954 functions sin, cos, tan, atan, ln, exp and the constant pi are
1955 allowed. For examples see
1956 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1958 * Theory "Reflection" now resides in HOL/Library.
1960 * Entry point to Word library now simply named "Word".
1963 * Made source layout more coherent with logical distribution
1966 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1967 src/HOL/Library/Code_Message.thy ~> src/HOL/
1968 src/HOL/Library/GCD.thy ~> src/HOL/
1969 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1970 src/HOL/Library/Parity.thy ~> src/HOL/
1971 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1972 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1973 src/HOL/Real/Lubs.thy ~> src/HOL/
1974 src/HOL/Real/PReal.thy ~> src/HOL/
1975 src/HOL/Real/Rational.thy ~> src/HOL/
1976 src/HOL/Real/RComplete.thy ~> src/HOL/
1977 src/HOL/Real/RealDef.thy ~> src/HOL/
1978 src/HOL/Real/RealPow.thy ~> src/HOL/
1979 src/HOL/Real/Real.thy ~> src/HOL/
1980 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1981 src/HOL/Complex/Complex.thy ~> src/HOL/
1982 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1983 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1984 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1985 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1986 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1987 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1988 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1989 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1990 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1991 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1992 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1993 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1994 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1995 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1996 src/HOL/Real/Float ~> src/HOL/Library/
1997 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1998 src/HOL/Real/RealVector.thy ~> src/HOL/
2000 src/HOL/arith_data.ML ~> src/HOL/Tools
2001 src/HOL/hologic.ML ~> src/HOL/Tools
2002 src/HOL/simpdata.ML ~> src/HOL/Tools
2003 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
2004 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
2005 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
2006 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
2007 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
2008 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
2009 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
2011 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
2012 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
2013 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
2014 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
2015 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
2016 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
2018 * If methods "eval" and "evaluation" encounter a structured proof
2019 state with !!/==>, only the conclusion is evaluated to True (if
2020 possible), avoiding strange error messages.
2022 * Method "sizechange" automates termination proofs using (a
2023 modification of) the size-change principle. Requires SAT solver. See
2024 src/HOL/ex/Termination.thy for examples.
2026 * Simplifier: simproc for let expressions now unfolds if bound
2027 variable occurs at most once in let expression body. INCOMPATIBILITY.
2029 * Method "arith": Linear arithmetic now ignores all inequalities when
2030 fast_arith_neq_limit is exceeded, instead of giving up entirely.
2032 * New attribute "arith" for facts that should always be used
2033 automatically by arithmetic. It is intended to be used locally in
2036 assumes [arith]: "x > 0"
2038 Global usage is discouraged because of possible performance impact.
2040 * New classes "top" and "bot" with corresponding operations "top" and
2041 "bot" in theory Orderings; instantiation of class "complete_lattice"
2042 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
2044 * Changed definition lemma "less_fun_def" in order to provide an
2045 instance for preorders on functions; use lemma "less_le" instead.
2048 * Theory Orderings: class "wellorder" moved here, with explicit
2049 induction rule "less_induct" as assumption. For instantiation of
2050 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
2053 * Theory Orderings: added class "preorder" as superclass of "order".
2054 INCOMPATIBILITY: Instantiation proofs for order, linorder
2055 etc. slightly changed. Some theorems named order_class.* now named
2058 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
2061 * Theory Finite_Set: added a new fold combinator of type
2063 ('a => 'b => 'b) => 'b => 'a set => 'b
2065 Occasionally this is more convenient than the old fold combinator
2066 which is now defined in terms of the new one and renamed to
2069 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
2070 and "ring_simps" have been replaced by "algebra_simps" (which can be
2071 extended with further lemmas!). At the moment both still exist but
2072 the former will disappear at some point.
2074 * Theory Power: Lemma power_Suc is now declared as a simp rule in
2075 class recpower. Type-specific simp rules for various recpower types
2076 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
2078 rat_power_0 -> power_0
2079 rat_power_Suc -> power_Suc
2080 realpow_0 -> power_0
2081 realpow_Suc -> power_Suc
2082 complexpow_0 -> power_0
2083 complexpow_Suc -> power_Suc
2084 power_poly_0 -> power_0
2085 power_poly_Suc -> power_Suc
2087 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
2088 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
2089 dvd has been generalized to class comm_semiring_1. Likewise a bunch
2090 of lemmas from Divides has been generalized from nat to class
2091 semiring_div. INCOMPATIBILITY. This involves the following theorem
2092 renames resulting from duplicate elimination:
2094 dvd_def_mod ~> dvd_eq_mod_eq_0
2095 zero_dvd_iff ~> dvd_0_left_iff
2096 dvd_0 ~> dvd_0_right
2097 DIVISION_BY_ZERO_DIV ~> div_by_0
2098 DIVISION_BY_ZERO_MOD ~> mod_by_0
2099 mult_div ~> div_mult_self2_is_id
2100 mult_mod ~> mod_mult_self2_is_0
2102 * Theory IntDiv: removed many lemmas that are instances of class-based
2103 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
2104 rename old lemmas as follows:
2106 dvd_diff -> nat_dvd_diff
2107 dvd_zminus_iff -> dvd_minus_iff
2108 mod_add1_eq -> mod_add_eq
2109 mod_mult1_eq -> mod_mult_right_eq
2110 mod_mult1_eq' -> mod_mult_left_eq
2111 mod_mult_distrib_mod -> mod_mult_eq
2112 nat_mod_add_left_eq -> mod_add_left_eq
2113 nat_mod_add_right_eq -> mod_add_right_eq
2114 nat_mod_div_trivial -> mod_div_trivial
2115 nat_mod_mod_trivial -> mod_mod_trivial
2116 zdiv_zadd_self1 -> div_add_self1
2117 zdiv_zadd_self2 -> div_add_self2
2118 zdiv_zmult_self1 -> div_mult_self2_is_id
2119 zdiv_zmult_self2 -> div_mult_self1_is_id
2120 zdvd_triv_left -> dvd_triv_left
2121 zdvd_triv_right -> dvd_triv_right
2122 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
2123 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
2124 zmod_zadd_left_eq -> mod_add_left_eq
2125 zmod_zadd_right_eq -> mod_add_right_eq
2126 zmod_zadd_self1 -> mod_add_self1
2127 zmod_zadd_self2 -> mod_add_self2
2128 zmod_zadd1_eq -> mod_add_eq
2129 zmod_zdiff1_eq -> mod_diff_eq
2130 zmod_zdvd_zmod -> mod_mod_cancel
2131 zmod_zmod_cancel -> mod_mod_cancel
2132 zmod_zmult_self1 -> mod_mult_self2_is_0
2133 zmod_zmult_self2 -> mod_mult_self1_is_0
2136 zdvd_abs1 -> abs_dvd_iff
2137 zdvd_abs2 -> dvd_abs_iff
2138 zdvd_refl -> dvd_refl
2139 zdvd_trans -> dvd_trans
2140 zdvd_zadd -> dvd_add
2141 zdvd_zdiff -> dvd_diff
2142 zdvd_zminus_iff -> dvd_minus_iff
2143 zdvd_zminus2_iff -> minus_dvd_iff
2144 zdvd_zmultD -> dvd_mult_right
2145 zdvd_zmultD2 -> dvd_mult_left
2146 zdvd_zmult_mono -> mult_dvd_mono
2147 zdvd_0_right -> dvd_0_right
2148 zdvd_0_left -> dvd_0_left_iff
2149 zdvd_1_left -> one_dvd
2150 zminus_dvd_iff -> minus_dvd_iff
2152 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
2154 * The real numbers offer decimal input syntax: 12.34 is translated
2155 into 1234/10^2. This translation is not reversed upon output.
2157 * Theory Library/Polynomial defines an abstract type 'a poly of
2158 univariate polynomials with coefficients of type 'a. In addition to
2159 the standard ring operations, it also supports div and mod. Code
2160 generation is also supported, using list-style constructors.
2162 * Theory Library/Inner_Product defines a class of real_inner for real
2163 inner product spaces, with an overloaded operation inner :: 'a => 'a
2164 => real. Class real_inner is a subclass of real_normed_vector from
2167 * Theory Library/Product_Vector provides instances for the product
2168 type 'a * 'b of several classes from RealVector and Inner_Product.
2169 Definitions of addition, subtraction, scalar multiplication, norms,
2170 and inner products are included.
2172 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
2173 addition to the field operations, numerals and case syntax are also
2176 * Theory Library/Diagonalize provides constructive version of Cantor's
2177 first diagonalization argument.
2179 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
2180 zlcm (for int); carried together from various gcd/lcm developements in
2181 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
2182 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
2183 may recover tupled syntax as follows:
2185 hide (open) const gcd
2186 abbreviation gcd where
2187 "gcd == (%(a, b). GCD.gcd a b)"
2189 GCD.gcd ("gcd '(_, _')")
2191 The same works for lcm, zgcd, zlcm.
2193 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
2194 instantiations for algebraic structures. Removed some duplicate
2195 theorems. Changes in simp rules. INCOMPATIBILITY.
2197 * ML antiquotation @{code} takes a constant as argument and generates
2198 corresponding code in background and inserts name of the corresponding
2199 resulting ML value/function/datatype constructor binding in place.
2200 All occurrences of @{code} with a single ML block are generated
2201 simultaneously. Provides a generic and safe interface for
2202 instrumentalizing code generation. See
2203 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
2204 In future you ought to refrain from ad-hoc compiling generated SML
2205 code on the ML toplevel. Note that (for technical reasons) @{code}
2206 cannot refer to constants for which user-defined serializations are
2207 set. Refer to the corresponding ML counterpart directly in that
2210 * Command 'rep_datatype': instead of theorem names the command now
2211 takes a list of terms denoting the constructors of the type to be
2212 represented as datatype. The characteristic theorems have to be
2213 proven. INCOMPATIBILITY. Also observe that the following theorems
2214 have disappeared in favour of existing ones:
2216 unit_induct ~> unit.induct
2217 prod_induct ~> prod.induct
2218 sum_induct ~> sum.induct
2219 Suc_Suc_eq ~> nat.inject
2220 Suc_not_Zero Zero_not_Suc ~> nat.distinct
2225 * New locales for orders and lattices where the equivalence relation
2226 is not restricted to equality. INCOMPATIBILITY: all order and lattice
2227 locales use a record structure with field eq for the equivalence.
2229 * New theory of factorial domains.
2231 * Units_l_inv and Units_r_inv are now simp rules by default.
2232 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
2233 and/or r_inv will now also require deletion of these lemmas.
2235 * Renamed the following theorems, INCOMPATIBILITY:
2237 UpperD ~> Upper_memD
2238 LowerD ~> Lower_memD
2239 least_carrier ~> least_closed
2240 greatest_carrier ~> greatest_closed
2241 greatest_Lower_above ~> greatest_Lower_below
2242 one_zero ~> carrier_one_zero
2243 one_not_zero ~> carrier_one_not_zero (collision with assumption)
2248 * Nominal datatypes can now contain type-variables.
2250 * Commands 'nominal_inductive' and 'equivariance' work with local
2253 * Nominal primrec can now works with local theory targets and its
2254 specification syntax now conforms to the general format as seen in
2257 * Method "perm_simp" honours the standard simplifier attributes
2258 (no_asm), (no_asm_use) etc.
2260 * The new predicate #* is defined like freshness, except that on the
2261 left hand side can be a set or list of atoms.
2263 * Experimental command 'nominal_inductive2' derives strong induction
2264 principles for inductive definitions. In contrast to
2265 'nominal_inductive', which can only deal with a fixed number of
2266 binders, it can deal with arbitrary expressions standing for sets of
2267 atoms to be avoided. The only inductive definition we have at the
2268 moment that needs this generalisation is the typing rule for Lets in
2271 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
2272 -----------------------------------------------------------------
2273 Gamma |- Let x be t1 in t2 : T2
2275 In this rule one wants to avoid all the binders that are introduced by
2276 "close Gamma T1". We are looking for other examples where this
2277 feature might be useful. Please let us know.
2282 * Reimplemented the simplification procedure for proving continuity
2283 subgoals. The new simproc is extensible; users can declare additional
2284 continuity introduction rules with the attribute [cont2cont].
2286 * The continuity simproc now uses a different introduction rule for
2287 solving continuity subgoals on terms with lambda abstractions. In
2288 some rare cases the new simproc may fail to solve subgoals that the
2289 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
2290 Potential INCOMPATIBILITY.
2292 * Command 'fixrec': specification syntax now conforms to the general
2293 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
2294 examples. INCOMPATIBILITY.
2299 * Proof of Zorn's Lemma for partial orders.
2304 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
2305 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
2306 depends on multithreading, so timouts will not work before Poly/ML
2309 * High-level support for concurrent ML programming, see
2310 src/Pure/Cuncurrent. The data-oriented model of "future values" is
2311 particularly convenient to organize independent functional
2312 computations. The concept of "synchronized variables" provides a
2313 higher-order interface for components with shared state, avoiding the
2314 delicate details of mutexes and condition variables. (Requires
2315 Poly/ML 5.2.1 or later.)
2317 * ML bindings produced via Isar commands are stored within the Isar
2318 context (theory or proof). Consequently, commands like 'use' and 'ML'
2319 become thread-safe and work with undo as expected (concerning
2320 top-level bindings, not side-effects on global references).
2321 INCOMPATIBILITY, need to provide proper Isar context when invoking the
2322 compiler at runtime; really global bindings need to be given outside a
2323 theory. (Requires Poly/ML 5.2 or later.)
2325 * Command 'ML_prf' is analogous to 'ML' but works within a proof
2326 context. Top-level ML bindings are stored within the proof context in
2327 a purely sequential fashion, disregarding the nested proof structure.
2328 ML bindings introduced by 'ML_prf' are discarded at the end of the
2329 proof. (Requires Poly/ML 5.2 or later.)
2331 * Simplified ML attribute and method setup, cf. functions Attrib.setup
2332 and Method.setup, as well as Isar commands 'attribute_setup' and
2333 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
2334 existing code accordingly, or use plain 'setup' together with old
2337 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
2338 to 'a -> thm, while results are always tagged with an authentic oracle
2339 name. The Isar command 'oracle' is now polymorphic, no argument type
2340 is specified. INCOMPATIBILITY, need to simplify existing oracle code
2341 accordingly. Note that extra performance may be gained by producing
2342 the cterm carefully, avoiding slow Thm.cterm_of.
2344 * Simplified interface for defining document antiquotations via
2345 ThyOutput.antiquotation, ThyOutput.output, and optionally
2346 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
2347 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
2350 * More systematic treatment of long names, abstract name bindings, and
2351 name space operations. Basic operations on qualified names have been
2352 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
2353 Long_Name.append. Old type bstring has been mostly replaced by
2354 abstract type binding (see structure Binding), which supports precise
2355 qualification by packages and local theory targets, as well as proper
2356 tracking of source positions. INCOMPATIBILITY, need to wrap old
2357 bstring values into Binding.name, or better pass through abstract
2358 bindings everywhere. See further src/Pure/General/long_name.ML,
2359 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
2361 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
2362 LocalTheory.note etc.) now refer to the *full* internal name, not the
2363 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
2365 * Disposed old type and term read functions (Sign.read_def_typ,
2366 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
2367 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
2368 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
2369 Syntax.read_term_global etc.; see also OldGoals.read_term as last
2370 resort for legacy applications.
2372 * Disposed old declarations, tactics, tactic combinators that refer to
2373 the simpset or claset of an implicit theory (such as Addsimps,
2374 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
2375 embedded ML text, or local_simpset_of with a proper context passed as
2376 explicit runtime argument.
2378 * Rules and tactics that read instantiations (read_instantiate,
2379 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
2380 context, which is required for parsing and type-checking. Moreover,
2381 the variables are specified as plain indexnames, not string encodings
2382 thereof. INCOMPATIBILITY.
2384 * Generic Toplevel.add_hook interface allows to analyze the result of
2385 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
2386 for theorem dependency output of transactions resulting in a new
2389 * ML antiquotations: block-structured compilation context indicated by
2390 \<lbrace> ... \<rbrace>; additional antiquotation forms:
2392 @{binding name} - basic name binding
2393 @{let ?pat = term} - term abbreviation (HO matching)
2394 @{note name = fact} - fact abbreviation
2395 @{thm fact} - singleton fact (with attributes)
2396 @{thms fact} - general fact (with attributes)
2397 @{lemma prop by method} - singleton goal
2398 @{lemma prop by meth1 meth2} - singleton goal
2399 @{lemma prop1 ... propN by method} - general goal
2400 @{lemma prop1 ... propN by meth1 meth2} - general goal
2401 @{lemma (open) ...} - open derivation
2406 * The Isabelle "emacs" tool provides a specific interface to invoke
2407 Proof General / Emacs, with more explicit failure if that is not
2408 installed (the old isabelle-interface script silently falls back on
2409 isabelle-process). The PROOFGENERAL_HOME setting determines the
2410 installation location of the Proof General distribution.
2412 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
2413 the Isabelle process into a JVM/Scala application. See
2414 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
2415 process wrapper has been discontinued.)
2417 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
2419 * Various status messages (with exact source position information) are
2420 emitted, if proper markup print mode is enabled. This allows
2421 user-interface components to provide detailed feedback on internal
2426 New in Isabelle2008 (June 2008)
2427 -------------------------------
2431 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
2432 and updated, with formally checked references as hyperlinks.
2434 * Theory loader: use_thy (and similar operations) no longer set the
2435 implicit ML context, which was occasionally hard to predict and in
2436 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
2437 provides a proper context already.
2439 * Theory loader: old-style ML proof scripts being *attached* to a thy
2440 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
2441 'use' within a theory file will do the job.
2443 * Name space merge now observes canonical order, i.e. the second space
2444 is inserted into the first one, while existing entries in the first
2445 space take precedence. INCOMPATIBILITY in rare situations, may try to
2446 swap theory imports.
2448 * Syntax: symbol \<chi> is now considered a letter. Potential
2449 INCOMPATIBILITY in identifier syntax etc.
2451 * Outer syntax: string tokens no longer admit escaped white space,
2452 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
2453 white space without escapes.
2455 * Outer syntax: string tokens may contain arbitrary character codes
2456 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
2462 * Context-dependent token translations. Default setup reverts locally
2463 fixed variables, and adds hilite markup for undeclared frees.
2465 * Unused theorems can be found using the new command 'unused_thms'.
2466 There are three ways of invoking it:
2469 Only finds unused theorems in the current theory.
2471 (2) unused_thms thy_1 ... thy_n -
2472 Finds unused theorems in the current theory and all of its ancestors,
2473 excluding the theories thy_1 ... thy_n and all of their ancestors.
2475 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
2476 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
2477 their ancestors, excluding the theories thy_1 ... thy_n and all of
2480 In order to increase the readability of the list produced by
2481 unused_thms, theorems that have been created by a particular instance
2482 of a theory command such as 'inductive' or 'function' are considered
2483 to belong to the same "group", meaning that if at least one theorem in
2484 this group is used, the other theorems in the same group are no longer
2485 reported as unused. Moreover, if all theorems in the group are
2486 unused, only one theorem in the group is displayed.
2488 Note that proof objects have to be switched on in order for
2489 unused_thms to work properly (i.e. !proofs must be >= 1, which is
2490 usually the case when using Proof General with the default settings).
2492 * Authentic naming of facts disallows ad-hoc overwriting of previous
2493 theorems within the same name space. INCOMPATIBILITY, need to remove
2494 duplicate fact bindings, or even accidental fact duplications. Note
2495 that tools may maintain dynamically scoped facts systematically, using
2496 PureThy.add_thms_dynamic.
2498 * Command 'hide' now allows to hide from "fact" name space as well.
2500 * Eliminated destructive theorem database, simpset, claset, and
2501 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
2502 update of theories within ML code.
2504 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2505 INCOMPATIBILITY, object-logics depending on former Pure require
2506 additional setup PureThy.old_appl_syntax_setup; object-logics
2507 depending on former CPure need to refer to Pure.
2509 * Commands 'use' and 'ML' are now purely functional, operating on
2510 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2511 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2514 * Command 'setup': discontinued implicit version with ML reference.
2516 * Instantiation target allows for simultaneous specification of class
2517 instance operations together with an instantiation proof.
2518 Type-checking phase allows to refer to class operations uniformly.
2519 See src/HOL/Complex/Complex.thy for an Isar example and
2520 src/HOL/Library/Eval.thy for an ML example.
2522 * Indexing of literal facts: be more serious about including only
2523 facts from the visible specification/proof context, but not the
2524 background context (locale etc.). Affects `prop` notation and method
2525 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2528 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2529 "(open)" option, which used to expose internal bound variables to the
2532 * Isar statements: removed obsolete case "rule_context".
2533 INCOMPATIBILITY, better use explicit fixes/assumes.
2535 * Locale proofs: default proof step now includes 'unfold_locales';
2536 hence 'proof' without argument may be used to unfold locale
2540 *** Document preparation ***
2542 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2543 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2544 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2545 spot); renamed link color from "darkblue" to "linkcolor" (default
2546 value unchanged, can be redefined via \definecolor); no longer sets
2547 "a4paper" option (unnecessary or even intrusive).
2549 * Antiquotation @{lemma A method} proves proposition A by the given
2550 method (either a method name or a method name plus (optional) method
2551 arguments in parentheses) and prints A just like @{prop A}.
2556 * New primrec package. Specification syntax conforms in style to
2557 definition/function/.... No separate induction rule is provided. The
2558 "primrec" command distinguishes old-style and new-style specifications
2559 by syntax. The former primrec package is now named OldPrimrecPackage.
2560 When adjusting theories, beware: constants stemming from new-style
2561 primrec specifications have authentic syntax.
2563 * Metis prover is now an order of magnitude faster, and also works
2564 with multithreading.
2566 * Metis: the maximum number of clauses that can be produced from a
2567 theorem is now given by the attribute max_clauses. Theorems that
2568 exceed this number are ignored, with a warning printed.
2570 * Sledgehammer no longer produces structured proofs by default. To
2571 enable, declare [[sledgehammer_full = true]]. Attributes
2572 reconstruction_modulus, reconstruction_sorts renamed
2573 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2575 * Method "induct_scheme" derives user-specified induction rules
2576 from well-founded induction and completeness of patterns. This factors
2577 out some operations that are done internally by the function package
2578 and makes them available separately. See
2579 src/HOL/ex/Induction_Scheme.thy for examples.
2581 * More flexible generation of measure functions for termination
2582 proofs: Measure functions can be declared by proving a rule of the
2583 form "is_measure f" and giving it the [measure_function] attribute.
2584 The "is_measure" predicate is logically meaningless (always true), and
2585 just guides the heuristic. To find suitable measure functions, the
2586 termination prover sets up the goal "is_measure ?f" of the appropriate
2587 type and generates all solutions by prolog-style backwards proof using
2590 This setup also deals with rules like
2592 "is_measure f ==> is_measure (list_size f)"
2594 which accommodates nested datatypes that recurse through lists.
2595 Similar rules are predeclared for products and option types.
2597 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2601 - Definitions of overloaded constants on sets have to be replaced by
2602 definitions on => and bool.
2604 - Some definitions of overloaded operators on sets can now be proved
2605 using the definitions of the operators on => and bool. Therefore,
2606 the following theorems have been renamed:
2608 subset_def -> subset_eq
2609 psubset_def -> psubset_eq
2610 set_diff_def -> set_diff_eq
2611 Compl_def -> Compl_eq
2612 Sup_set_def -> Sup_set_eq
2613 Inf_set_def -> Inf_set_eq
2614 sup_set_def -> sup_set_eq
2615 inf_set_def -> inf_set_eq
2617 - Due to the incompleteness of the HO unification algorithm, some
2618 rules such as subst may require manual instantiation, if some of
2619 the unknowns in the rule is a set.
2621 - Higher order unification and forward proofs:
2624 have "P (S::'a set)" <...>
2625 then have "EX S. P S" ..
2627 no longer works (due to the incompleteness of the HO unification
2628 algorithm) and must be replaced by the pattern
2635 - Calculational reasoning with subst (or similar rules):
2638 have "P (S::'a set)" <...>
2639 also have "S = T" <...>
2640 finally have "P T" .
2642 no longer works (for similar reasons as the previous example) and
2643 must be replaced by something like
2645 have "P (S::'a set)" <...>
2646 moreover have "S = T" <...>
2647 ultimately have "P T" by simp
2649 - Tactics or packages written in ML code:
2650 Code performing pattern matching on types via
2652 Type ("set", [T]) => ...
2654 must be rewritten. Moreover, functions like strip_type or
2655 binder_types no longer return the right value when applied to a
2658 T1 => ... => Tn => U => bool
2662 T1 => ... => Tn => U set
2664 * Merged theories Wellfounded_Recursion, Accessible_Part and
2665 Wellfounded_Relations to theory Wellfounded.
2667 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2669 * Class finite no longer treats UNIV as class parameter. Use class
2670 enum from theory Library/Enum instead to achieve a similar effect.
2673 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2674 and "Cons". INCOMPATIBILITY.
2676 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2677 Potential INCOMPATIBILITY.
2679 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2680 injective_fst_snd removed, use split_eta and prod_eqI instead.
2681 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2683 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2684 the same name in theory Orderings:
2694 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2695 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2696 and different variable names.
2698 * Library/Option_ord.thy: Canonical order on option type.
2700 * Library/RBT.thy: Red-black trees, an efficient implementation of
2703 * Library/Countable.thy: Type class for countable types.
2705 * Theory Int: The representation of numerals has changed. The infix
2706 operator BIT and the bit datatype with constructors B0 and B1 have
2707 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2708 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2709 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2712 * Theory Nat: definition of <= and < on natural numbers no longer
2713 depend on well-founded relations. INCOMPATIBILITY. Definitions
2714 le_def and less_def have disappeared. Consider lemmas not_less
2715 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2717 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2718 (whose purpose mainly is for various fold_set functionals) have been
2719 abandoned in favor of the existing algebraic classes
2720 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2721 lower_semilattice (resp. upper_semilattice) and linorder.
2724 * Theory Transitive_Closure: induct and cases rules now declare proper
2725 case_names ("base" and "step"). INCOMPATIBILITY.
2727 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2728 lattices. The form set-specific version is available as
2729 Inductive.lfp_ordinal_induct_set.
2731 * Renamed theorems "power.simps" to "power_int.simps".
2734 * Class semiring_div provides basic abstract properties of semirings
2735 with division and modulo operations. Subsumes former class dvd_mod.
2737 * Merged theories IntDef, Numeral and IntArith into unified theory
2738 Int. INCOMPATIBILITY.
2740 * Theory Library/Code_Index: type "index" now represents natural
2741 numbers rather than integers. INCOMPATIBILITY.
2743 * New class "uminus" with operation "uminus" (split of from class
2744 "minus" which now only has operation "minus", binary).
2747 * Constants "card", "internal_split", "option_map" now with authentic
2748 syntax. INCOMPATIBILITY.
2750 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2751 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2752 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2753 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2754 Sup_set_def, le_def, less_def, option_map_def now with object
2755 equality. INCOMPATIBILITY.
2757 * Records. Removed K_record, and replaced it by pure lambda term
2758 %x. c. The simplifier setup is now more robust against eta expansion.
2759 INCOMPATIBILITY: in cases explicitly referring to K_record.
2761 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2763 * Library/ListVector: new theory of arithmetic vector operations.
2765 * Library/Order_Relation: new theory of various orderings as sets of
2766 pairs. Defines preorders, partial orders, linear orders and
2767 well-orders on sets and on types.
2772 * Renamed some theories to allow to loading both ZF and HOL in the
2775 Datatype -> Datatype_ZF
2776 Inductive -> Inductive_ZF
2783 INCOMPATIBILITY: ZF theories that import individual theories below
2784 Main might need to be adapted. Regular theory Main is still
2785 available, as trivial extension of Main_ZF.
2790 * ML within Isar: antiquotation @{const name} or @{const
2791 name(typargs)} produces statically-checked Const term.
2793 * Functor NamedThmsFun: data is available to the user as dynamic fact
2794 (of the same name). Removed obsolete print command.
2796 * Removed obsolete "use_legacy_bindings" function.
2798 * The ``print mode'' is now a thread-local value derived from a global
2799 template (the former print_mode reference), thus access becomes
2800 non-critical. The global print_mode reference is for session
2801 management only; user-code should use print_mode_value,
2802 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2804 * Functions system/system_out provide a robust way to invoke external
2805 shell commands, with propagation of interrupts (requires Poly/ML
2806 5.2.1). Do not use OS.Process.system etc. from the basis library!
2811 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2812 in accordance with Proof General 3.7, which prefers GNU emacs.
2814 * isatool tty runs Isabelle process with plain tty interaction;
2815 optional line editor may be specified via ISABELLE_LINE_EDITOR
2816 setting, the default settings attempt to locate "ledit" and "rlwrap".
2818 * isatool browser now works with Cygwin as well, using general
2819 "javapath" function defined in Isabelle process environment.
2821 * YXML notation provides a simple and efficient alternative to
2822 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2823 isatool yxml as described in the Isabelle system manual.
2825 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2826 provides general wrapper for managing an Isabelle process in a robust
2827 fashion, with ``cooked'' output from stdin/stderr.
2829 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2830 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2832 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2833 way of changing the user's settings is via
2834 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2837 * Multithreading.max_threads := 0 refers to the number of actual CPU
2838 cores of the underlying machine, which is a good starting point for
2839 optimal performance tuning. The corresponding usedir option -M allows
2840 "max" as an alias for "0". WARNING: does not work on certain versions
2841 of Mac OS (with Poly/ML 5.1).
2843 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2844 adverse effect of Isabelle flooding interactive front-ends (notably
2845 ProofGeneral / XEmacs).
2849 New in Isabelle2007 (November 2007)
2850 -----------------------------------
2854 * More uniform information about legacy features, notably a
2855 warning/error of "Legacy feature: ...", depending on the state of the
2856 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2857 legacy features will disappear eventually.
2859 * Theory syntax: the header format ``theory A = B + C:'' has been
2860 discontinued in favour of ``theory A imports B C begin''. Use isatool
2861 fixheaders to convert existing theory files. INCOMPATIBILITY.
2863 * Theory syntax: the old non-Isar theory file format has been
2864 discontinued altogether. Note that ML proof scripts may still be used
2865 with Isar theories; migration is usually quite simple with the ML
2866 function use_legacy_bindings. INCOMPATIBILITY.
2868 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2869 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2872 * Theory loader: be more serious about observing the static theory
2873 header specifications (including optional directories), but not the
2874 accidental file locations of previously successful loads. The strict
2875 update policy of former update_thy is now already performed by
2876 use_thy, so the former has been removed; use_thys updates several
2877 theories simultaneously, just as 'imports' within a theory header
2878 specification, but without merging the results. Potential
2879 INCOMPATIBILITY: may need to refine theory headers and commands
2880 ROOT.ML which depend on load order.
2882 * Theory loader: optional support for content-based file
2883 identification, instead of the traditional scheme of full physical
2884 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2885 (cf. the system manual). The new scheme allows to work with
2886 non-finished theories in persistent session images, such that source
2887 files may be moved later on without requiring reloads.
2889 * Theory loader: old-style ML proof scripts being *attached* to a thy
2890 file (with the same base name as the theory) are considered a legacy
2891 feature, which will disappear eventually. Even now, the theory loader
2892 no longer maintains dependencies on such files.
2894 * Syntax: the scope for resolving ambiguities via type-inference is
2895 now limited to individual terms, instead of whole simultaneous
2896 specifications as before. This greatly reduces the complexity of the
2897 syntax module and improves flexibility by separating parsing and
2898 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2899 'fixes' etc.) are required in rare situations.
2901 * Syntax: constants introduced by new-style packages ('definition',
2902 'abbreviation' etc.) are passed through the syntax module in
2903 ``authentic mode''. This means that associated mixfix annotations
2904 really stick to such constants, independently of potential name space
2905 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2906 trees are represented slightly differently, may need to adapt syntax
2907 translations accordingly. Use CONST marker in 'translations' and
2908 @{const_syntax} antiquotation in 'parse_translation' etc.
2910 * Legacy goal package: reduced interface to the bare minimum required
2911 to keep existing proof scripts running. Most other user-level
2912 functions are now part of the OldGoals structure, which is *not* open
2913 by default (consider isatool expandshort before open OldGoals).
2914 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2915 these tend to cause confusion about the actual goal (!) context being
2916 used here, which is not necessarily the same as the_context().
2918 * Command 'find_theorems': supports "*" wild-card in "name:"
2919 criterion; "with_dups" option. Certain ProofGeneral versions might
2920 support a specific search form (see ProofGeneral/CHANGES).
2922 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2923 by default, which means that "prems" (and also "fixed variables") are
2924 suppressed from proof state output. Note that the ProofGeneral
2925 settings mechanism allows to change and save options persistently, but
2926 older versions of Isabelle will fail to start up if a negative prems
2929 * Local theory targets may be specified by non-nested blocks of
2930 ``context/locale/class ... begin'' followed by ``end''. The body may
2931 contain definitions, theorems etc., including any derived mechanism
2932 that has been implemented on top of these primitives. This concept
2933 generalizes the existing ``theorem (in ...)'' towards more versatility
2936 * Proof General interface: proper undo of final 'end' command;
2937 discontinued Isabelle/classic mode (ML proof scripts).
2940 *** Document preparation ***
2942 * Added antiquotation @{theory name} which prints the given name,
2943 after checking that it refers to a valid ancestor theory in the
2946 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2947 check the given source text as ML type/structure, printing verbatim.
2949 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2950 "c args == rhs" given in the current context. (Any number of
2951 arguments may be given on the LHS.)
2956 * The 'class' package offers a combination of axclass and locale to
2957 achieve Haskell-like type classes in Isabelle. Definitions and
2958 theorems within a class context produce both relative results (with
2959 implicit parameters according to the locale context), and polymorphic
2960 constants with qualified polymorphism (according to the class
2961 context). Within the body context of a 'class' target, a separate
2962 syntax layer ("user space type system") takes care of converting
2963 between global polymorphic consts and internal locale representation.
2964 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2965 "isatool doc classes" provides a tutorial.
2967 * Generic code generator framework allows to generate executable
2968 code for ML and Haskell (including Isabelle classes). A short usage
2971 internal compilation:
2972 export_code <list of constants (term syntax)> in SML
2973 writing SML code to a file:
2974 export_code <list of constants (term syntax)> in SML <filename>
2975 writing OCaml code to a file:
2976 export_code <list of constants (term syntax)> in OCaml <filename>
2977 writing Haskell code to a bunch of files:
2978 export_code <list of constants (term syntax)> in Haskell <filename>
2980 evaluating closed propositions to True/False using code generation:
2983 Reasonable default setup of framework in HOL.
2985 Theorem attributs for selecting and transforming function equations theorems:
2987 [code fun]: select a theorem as function equation for a specific constant
2988 [code fun del]: deselect a theorem as function equation for a specific constant
2989 [code inline]: select an equation theorem for unfolding (inlining) in place
2990 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2992 User-defined serializations (target in {SML, OCaml, Haskell}):
2994 code_const <and-list of constants (term syntax)>
2995 {(target) <and-list of const target syntax>}+
2997 code_type <and-list of type constructors>
2998 {(target) <and-list of type target syntax>}+
3000 code_instance <and-list of instances>
3002 where instance ::= <type constructor> :: <class>
3004 code_class <and_list of classes>
3005 {(target) <and-list of class target syntax>}+
3006 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
3008 code_instance and code_class only are effective to target Haskell.
3010 For example usage see src/HOL/ex/Codegenerator.thy and
3011 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
3012 generation from Isabelle/HOL theories is available via "isatool doc
3015 * Code generator: consts in 'consts_code' Isar commands are now
3016 referred to by usual term syntax (including optional type
3019 * Command 'no_translations' removes translation rules from theory
3022 * Overloaded definitions are now actually checked for acyclic
3023 dependencies. The overloading scheme is slightly more general than
3024 that of Haskell98, although Isabelle does not demand an exact
3025 correspondence to type class and instance declarations.
3026 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
3027 exotic versions of overloading -- at the discretion of the user!
3029 Polymorphic constants are represented via type arguments, i.e. the
3030 instantiation that matches an instance against the most general
3031 declaration given in the signature. For example, with the declaration
3032 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
3033 as c(nat). Overloading is essentially simultaneous structural
3034 recursion over such type arguments. Incomplete specification patterns
3035 impose global constraints on all occurrences, e.g. c('a * 'a) on the
3036 LHS means that more general c('a * 'b) will be disallowed on any RHS.
3037 Command 'print_theory' outputs the normalized system of recursive
3038 equations, see section "definitions".
3040 * Configuration options are maintained within the theory or proof
3041 context (with name and type bool/int/string), providing a very simple
3042 interface to a poor-man's version of general context data. Tools may
3043 declare options in ML (e.g. using Attrib.config_int) and then refer to
3044 these values using Config.get etc. Users may change options via an
3045 associated attribute of the same name. This form of context
3046 declaration works particularly well with commands 'declare' or
3047 'using', for example ``declare [[foo = 42]]''. Thus it has become
3048 very easy to avoid global references, which would not observe Isar
3049 toplevel undo/redo and fail to work with multithreading.
3051 Various global ML references of Pure and HOL have been turned into
3052 configuration options:
3054 Unify.search_bound unify_search_bound
3055 Unify.trace_bound unify_trace_bound
3056 Unify.trace_simp unify_trace_simp
3057 Unify.trace_types unify_trace_types
3058 Simplifier.simp_depth_limit simp_depth_limit
3059 Blast.depth_limit blast_depth_limit
3060 DatatypeProp.dtK datatype_distinctness_limit
3061 fast_arith_neq_limit fast_arith_neq_limit
3062 fast_arith_split_limit fast_arith_split_limit
3064 * Named collections of theorems may be easily installed as context
3065 data using the functor NamedThmsFun (see also
3066 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
3067 attributes; there is also a toplevel print command. This facility is
3068 just a common case of general context data, which is the preferred way
3069 for anything more complex than just a list of facts in canonical
3072 * Isar: command 'declaration' augments a local theory by generic
3073 declaration functions written in ML. This enables arbitrary content
3074 being added to the context, depending on a morphism that tells the
3075 difference of the original declaration context wrt. the application
3076 context encountered later on.
3078 * Isar: proper interfaces for simplification procedures. Command
3079 'simproc_setup' declares named simprocs (with match patterns, and body
3080 text in ML). Attribute "simproc" adds/deletes simprocs in the current
3081 context. ML antiquotation @{simproc name} retrieves named simprocs.
3083 * Isar: an extra pair of brackets around attribute declarations
3084 abbreviates a theorem reference involving an internal dummy fact,
3085 which will be ignored later --- only the effect of the attribute on
3086 the background context will persist. This form of in-place
3087 declarations is particularly useful with commands like 'declare' and
3088 'using', for example ``have A using [[simproc a]] by simp''.
3090 * Isar: method "assumption" (and implicit closing of subproofs) now
3091 takes simple non-atomic goal assumptions into account: after applying
3092 an assumption as a rule the resulting subgoals are solved by atomic
3093 assumption steps. This is particularly useful to finish 'obtain'
3094 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
3095 without referring to the original premise "!!x. P x ==> thesis" in the
3096 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
3099 * Isar: implicit use of prems from the Isar proof context is
3100 considered a legacy feature. Common applications like ``have A .''
3101 may be replaced by ``have A by fact'' or ``note `A`''. In general,
3102 referencing facts explicitly here improves readability and
3103 maintainability of proof texts.
3105 * Isar: improper proof element 'guess' is like 'obtain', but derives
3106 the obtained context from the course of reasoning! For example:
3108 assume "EX x y. A x & B y" -- "any previous fact"
3109 then guess x and y by clarify
3111 This technique is potentially adventurous, depending on the facts and
3112 proof tools being involved here.
3114 * Isar: known facts from the proof context may be specified as literal
3115 propositions, using ASCII back-quote syntax. This works wherever
3116 named facts used to be allowed so far, in proof commands, proof
3117 methods, attributes etc. Literal facts are retrieved from the context
3118 according to unification of type and term parameters. For example,
3119 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
3120 theorems in the current context, then these are valid literal facts:
3121 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
3123 There is also a proof method "fact" which does the same composition
3124 for explicit goal states, e.g. the following proof texts coincide with
3125 certain special cases of literal facts:
3127 have "A" by fact == note `A`
3128 have "A ==> B" by fact == note `A ==> B`
3129 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
3130 have "P a ==> Q a" by fact == note `P a ==> Q a`
3132 * Isar: ":" (colon) is no longer a symbolic identifier character in
3133 outer syntax. Thus symbolic identifiers may be used without
3134 additional white space in declarations like this: ``assume *: A''.
3136 * Isar: 'print_facts' prints all local facts of the current context,
3137 both named and unnamed ones.
3139 * Isar: 'def' now admits simultaneous definitions, e.g.:
3141 def x == "t" and y == "u"
3143 * Isar: added command 'unfolding', which is structurally similar to
3144 'using', but affects both the goal state and facts by unfolding given
3145 rewrite rules. Thus many occurrences of the 'unfold' method or
3146 'unfolded' attribute may be replaced by first-class proof text.
3148 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
3149 and command 'unfolding' now all support object-level equalities
3150 (potentially conditional). The underlying notion of rewrite rule is
3151 analogous to the 'rule_format' attribute, but *not* that of the
3152 Simplifier (which is usually more generous).
3154 * Isar: the new attribute [rotated n] (default n = 1) rotates the
3155 premises of a theorem by n. Useful in conjunction with drule.
3157 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
3158 method expression within a sandbox consisting of the first N
3159 sub-goals, which need to exist. For example, ``simp_all [3]''
3160 simplifies the first three sub-goals, while (rule foo, simp_all)[]
3161 simplifies all new goals that emerge from applying rule foo to the
3162 originally first one.
3164 * Isar: schematic goals are no longer restricted to higher-order
3165 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
3168 * Isar: the conclusion of a long theorem statement is now either
3169 'shows' (a simultaneous conjunction, as before), or 'obtains'
3170 (essentially a disjunction of cases with local parameters and
3171 assumptions). The latter allows to express general elimination rules
3172 adequately; in this notation common elimination rules look like this:
3174 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
3176 obtains x where "P x"
3178 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
3182 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
3188 The subsequent classical rules even refer to the formal "thesis"
3191 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
3194 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
3195 obtains "thesis ==> something"
3197 The actual proof of an 'obtains' statement is analogous to that of the
3198 Isar proof element 'obtain', only that there may be several cases.
3199 Optional case names may be specified in parentheses; these will be
3200 available both in the present proof and as annotations in the
3201 resulting rule, for later use with the 'cases' method (cf. attribute
3204 * Isar: the assumptions of a long theorem statement are available as
3205 "assms" fact in the proof context. This is more appropriate than the
3206 (historical) "prems", which refers to all assumptions of the current
3207 context, including those from the target locale, proof body etc.
3209 * Isar: 'print_statement' prints theorems from the current theory or
3210 proof context in long statement form, according to the syntax of a
3213 * Isar: 'obtain' takes an optional case name for the local context
3214 introduction rule (default "that").
3216 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
3217 explicit (is "_ ==> ?foo") in the rare cases where this still happens
3220 * Pure: syntax "CONST name" produces a fully internalized constant
3221 according to the current context. This is particularly useful for
3222 syntax translations that should refer to internal constant
3223 representations independently of name spaces.
3225 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
3226 instead of "FOO ". This allows multiple binder declarations to coexist
3227 in the same context. INCOMPATIBILITY.
3229 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
3230 primitive that also works in a locale context (both for constants and
3231 fixed variables). Type declaration and internal syntactic representation
3232 of given constants retrieved from the context. Likewise, the
3233 'no_notation' command allows to remove given syntax annotations from the
3236 * Isar/locales: new derived specification elements 'axiomatization',
3237 'definition', 'abbreviation', which support type-inference, admit
3238 object-level specifications (equality, equivalence). See also the
3239 isar-ref manual. Examples:
3242 eq (infix "===" 50) where
3243 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
3245 definition "f x y = x + y + 1"
3246 definition g where "g x = f x x"
3249 neq (infix "=!=" 50) where
3250 "x =!= y == ~ (x === y)"
3252 These specifications may be also used in a locale context. Then the
3253 constants being introduced depend on certain fixed parameters, and the
3254 constant name is qualified by the locale base name. An internal
3255 abbreviation takes care for convenient input and output, making the
3256 parameters implicit and using the original short name. See also
3257 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
3258 entities from a monomorphic theory.
3260 Presently, abbreviations are only available 'in' a target locale, but
3261 not inherited by general import expressions. Also note that
3262 'abbreviation' may be used as a type-safe replacement for 'syntax' +
3263 'translations' in common applications. The "no_abbrevs" print mode
3264 prevents folding of abbreviations in term output.
3266 Concrete syntax is attached to specified constants in internal form,
3267 independently of name spaces. The parse tree representation is
3268 slightly different -- use 'notation' instead of raw 'syntax', and
3269 'translations' with explicit "CONST" markup to accommodate this.
3271 * Pure/Isar: unified syntax for new-style specification mechanisms
3272 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
3273 full type inference and dummy patterns ("_"). For example:
3275 definition "K x _ = x"
3277 inductive conj for A B
3278 where "A ==> B ==> conj A B"
3280 * Pure: command 'print_abbrevs' prints all constant abbreviations of
3281 the current context. Print mode "no_abbrevs" prevents inversion of
3282 abbreviations on output.
3284 * Isar/locales: improved parameter handling: use of locales "var" and
3285 "struct" no longer necessary; - parameter renamings are no longer
3286 required to be injective. For example, this allows to define
3287 endomorphisms as locale endom = homom mult mult h.
3289 * Isar/locales: changed the way locales with predicates are defined.
3290 Instead of accumulating the specification, the imported expression is
3291 now an interpretation. INCOMPATIBILITY: different normal form of
3292 locale expressions. In particular, in interpretations of locales with
3293 predicates, goals repesenting already interpreted fragments are not
3294 removed automatically. Use methods `intro_locales' and
3295 `unfold_locales'; see below.
3297 * Isar/locales: new methods `intro_locales' and `unfold_locales'
3298 provide backward reasoning on locales predicates. The methods are
3299 aware of interpretations and discharge corresponding goals.
3300 `intro_locales' is less aggressive then `unfold_locales' and does not
3301 unfold predicates to assumptions.
3303 * Isar/locales: the order in which locale fragments are accumulated
3304 has changed. This enables to override declarations from fragments due
3305 to interpretations -- for example, unwanted simp rules.
3307 * Isar/locales: interpretation in theories and proof contexts has been
3308 extended. One may now specify (and prove) equations, which are
3309 unfolded in interpreted theorems. This is useful for replacing
3310 defined concepts (constants depending on locale parameters) by
3311 concepts already existing in the target context. Example:
3313 interpretation partial_order ["op <= :: [int, int] => bool"]
3314 where "partial_order.less (op <=) (x::int) y = (x < y)"
3316 Typically, the constant `partial_order.less' is created by a
3317 definition specification element in the context of locale
3320 * Method "induct": improved internal context management to support
3321 local fixes and defines on-the-fly. Thus explicit meta-level
3322 connectives !! and ==> are rarely required anymore in inductive goals
3323 (using object-logic connectives for this purpose has been long
3324 obsolete anyway). Common proof patterns are explained in
3325 src/HOL/Induct/Common_Patterns.thy, see also
3326 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
3329 * Method "induct": improved handling of simultaneous goals. Instead of
3330 introducing object-level conjunction, the statement is now split into
3331 several conclusions, while the corresponding symbolic cases are nested
3332 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
3333 see src/HOL/Induct/Common_Patterns.thy, for example.
3335 * Method "induct": mutual induction rules are now specified as a list
3336 of rule sharing the same induction cases. HOL packages usually provide
3337 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
3338 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
3339 mutual induction rules differently, i.e. like this:
3341 (induct rule: foo_bar.inducts)
3342 (induct set: foo bar)
3343 (induct pred: foo bar)
3344 (induct type: foo bar)
3346 The ML function ProjectRule.projections turns old-style rules into the
3349 * Method "coinduct": dual of induction, see
3350 src/HOL/Library/Coinductive_List.thy for various examples.
3352 * Method "cases", "induct", "coinduct": the ``(open)'' option is
3353 considered a legacy feature.
3355 * Attribute "symmetric" produces result with standardized schematic
3356 variables (index 0). Potential INCOMPATIBILITY.
3358 * Simplifier: by default the simplifier trace only shows top level
3359 rewrites now. That is, trace_simp_depth_limit is set to 1 by
3360 default. Thus there is less danger of being flooded by the trace. The
3361 trace indicates where parts have been suppressed.
3363 * Provers/classical: removed obsolete classical version of elim_format
3364 attribute; classical elim/dest rules are now treated uniformly when
3365 manipulating the claset.
3367 * Provers/classical: stricter checks to ensure that supplied intro,
3368 dest and elim rules are well-formed; dest and elim rules must have at
3371 * Provers/classical: attributes dest/elim/intro take an optional
3372 weight argument for the rule (just as the Pure versions). Weights are
3373 ignored by automated tools, but determine the search order of single
3376 * Syntax: input syntax now supports dummy variable binding "%_. b",
3377 where the body does not mention the bound variable. Note that dummy
3378 patterns implicitly depend on their context of bounds, which makes
3379 "{_. _}" match any set comprehension as expected. Potential
3380 INCOMPATIBILITY -- parse translations need to cope with syntactic
3381 constant "_idtdummy" in the binding position.
3383 * Syntax: removed obsolete syntactic constant "_K" and its associated
3384 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
3385 for example "A -> B" => "Pi A (%_. B)".
3387 * Pure: 'class_deps' command visualizes the subclass relation, using
3388 the graph browser tool.
3390 * Pure: 'print_theory' now suppresses certain internal declarations by
3391 default; use '!' option for full details.
3396 * Method "metis" proves goals by applying the Metis general-purpose
3397 resolution prover (see also http://gilith.com/software/metis/).
3398 Examples are in the directory MetisExamples. WARNING: the
3399 Isabelle/HOL-Metis integration does not yet work properly with
3402 * Command 'sledgehammer' invokes external automatic theorem provers as
3403 background processes. It generates calls to the "metis" method if
3404 successful. These can be pasted into the proof. Users do not have to
3405 wait for the automatic provers to return. WARNING: does not really
3406 work with multi-threading.
3408 * New "auto_quickcheck" feature tests outermost goal statements for
3409 potential counter-examples. Controlled by ML references
3410 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
3411 5000 milliseconds). Fails silently if statements is outside of
3412 executable fragment, or any other codgenerator problem occurs.
3414 * New constant "undefined" with axiom "undefined x = undefined".
3416 * Added class "HOL.eq", allowing for code generation with polymorphic
3419 * Some renaming of class constants due to canonical name prefixing in
3420 the new 'class' package:
3422 HOL.abs ~> HOL.abs_class.abs
3423 HOL.divide ~> HOL.divide_class.divide
3424 0 ~> HOL.zero_class.zero
3425 1 ~> HOL.one_class.one
3426 op + ~> HOL.plus_class.plus
3427 op - ~> HOL.minus_class.minus
3428 uminus ~> HOL.minus_class.uminus
3429 op * ~> HOL.times_class.times
3430 op < ~> HOL.ord_class.less
3431 op <= > HOL.ord_class.less_eq
3432 Nat.power ~> Power.power_class.power
3433 Nat.size ~> Nat.size_class.size
3434 Numeral.number_of ~> Numeral.number_class.number_of
3435 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
3436 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
3437 Orderings.min ~> Orderings.ord_class.min
3438 Orderings.max ~> Orderings.ord_class.max
3439 Divides.op div ~> Divides.div_class.div
3440 Divides.op mod ~> Divides.div_class.mod
3441 Divides.op dvd ~> Divides.div_class.dvd
3443 INCOMPATIBILITY. Adaptions may be required in the following cases:
3445 a) User-defined constants using any of the names "plus", "minus",
3446 "times", "less" or "less_eq". The standard syntax translations for
3447 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
3450 b) Variables named "plus", "minus", "times", "less", "less_eq"
3451 INCOMPATIBILITY: use more specific names.
3453 c) Permutative equations (e.g. "a + b = b + a")
3454 Since the change of names also changes the order of terms, permutative
3455 rewrite rules may get applied in a different order. Experience shows
3456 that this is rarely the case (only two adaptions in the whole Isabelle
3457 distribution). INCOMPATIBILITY: rewrite proofs
3459 d) ML code directly refering to constant names
3460 This in general only affects hand-written proof tactics, simprocs and
3461 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
3462 Consider using @{const_name} antiquotation.
3464 * New class "default" with associated constant "default".
3466 * Function "sgn" is now overloaded and available on int, real, complex
3467 (and other numeric types), using class "sgn". Two possible defs of
3468 sgn are given as equational assumptions in the classes sgn_if and
3469 sgn_div_norm; ordered_idom now also inherits from sgn_if.
3472 * Locale "partial_order" now unified with class "order" (cf. theory
3473 Orderings), added parameter "less". INCOMPATIBILITY.
3475 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
3476 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
3477 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
3479 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
3480 changed order of proof goals in instance proofs.
3482 * The transitivity reasoner for partial and linear orders is set up
3483 for classes "order" and "linorder". Instances of the reasoner are available
3484 in all contexts importing or interpreting the corresponding locales.
3485 Method "order" invokes the reasoner separately; the reasoner
3486 is also integrated with the Simplifier as a solver. Diagnostic
3487 command 'print_orders' shows the available instances of the reasoner
3488 in the current context.
3490 * Localized monotonicity predicate in theory "Orderings"; integrated
3491 lemmas max_of_mono and min_of_mono with this predicate.
3494 * Formulation of theorem "dense" changed slightly due to integration
3495 with new class dense_linear_order.
3497 * Uniform lattice theory development in HOL.
3499 constants "meet" and "join" now named "inf" and "sup"
3500 constant "Meet" now named "Inf"
3502 classes "meet_semilorder" and "join_semilorder" now named
3503 "lower_semilattice" and "upper_semilattice"
3504 class "lorder" now named "lattice"
3505 class "comp_lat" now named "complete_lattice"
3507 Instantiation of lattice classes allows explicit definitions
3508 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3510 INCOMPATIBILITY. Theorem renames:
3512 meet_left_le ~> inf_le1
3513 meet_right_le ~> inf_le2
3514 join_left_le ~> sup_ge1
3515 join_right_le ~> sup_ge2
3516 meet_join_le ~> inf_sup_ord
3519 le_meet ~> le_inf_iff
3520 le_join ~> ge_sup_conv
3521 meet_idempotent ~> inf_idem
3522 join_idempotent ~> sup_idem
3523 meet_comm ~> inf_commute
3524 join_comm ~> sup_commute
3525 meet_leI1 ~> le_infI1
3526 meet_leI2 ~> le_infI2
3527 le_joinI1 ~> le_supI1
3528 le_joinI2 ~> le_supI2
3529 meet_assoc ~> inf_assoc
3530 join_assoc ~> sup_assoc
3531 meet_left_comm ~> inf_left_commute
3532 meet_left_idempotent ~> inf_left_idem
3533 join_left_comm ~> sup_left_commute
3534 join_left_idempotent ~> sup_left_idem
3537 le_def_meet ~> le_iff_inf
3538 le_def_join ~> le_iff_sup
3539 join_absorp2 ~> sup_absorb2
3540 join_absorp1 ~> sup_absorb1
3541 meet_absorp1 ~> inf_absorb1
3542 meet_absorp2 ~> inf_absorb2
3543 meet_join_absorp ~> inf_sup_absorb
3544 join_meet_absorp ~> sup_inf_absorb
3545 distrib_join_le ~> distrib_sup_le
3546 distrib_meet_le ~> distrib_inf_le
3548 add_meet_distrib_left ~> add_inf_distrib_left
3549 add_join_distrib_left ~> add_sup_distrib_left
3550 is_join_neg_meet ~> is_join_neg_inf
3551 is_meet_neg_join ~> is_meet_neg_sup
3552 add_meet_distrib_right ~> add_inf_distrib_right
3553 add_join_distrib_right ~> add_sup_distrib_right
3554 add_meet_join_distribs ~> add_sup_inf_distribs
3555 join_eq_neg_meet ~> sup_eq_neg_inf
3556 meet_eq_neg_join ~> inf_eq_neg_sup
3557 add_eq_meet_join ~> add_eq_inf_sup
3558 meet_0_imp_0 ~> inf_0_imp_0
3559 join_0_imp_0 ~> sup_0_imp_0
3560 meet_0_eq_0 ~> inf_0_eq_0
3561 join_0_eq_0 ~> sup_0_eq_0
3562 neg_meet_eq_join ~> neg_inf_eq_sup
3563 neg_join_eq_meet ~> neg_sup_eq_inf
3564 join_eq_if ~> sup_eq_if
3566 mono_meet ~> mono_inf
3567 mono_join ~> mono_sup
3568 meet_bool_eq ~> inf_bool_eq
3569 join_bool_eq ~> sup_bool_eq
3570 meet_fun_eq ~> inf_fun_eq
3571 join_fun_eq ~> sup_fun_eq
3572 meet_set_eq ~> inf_set_eq
3573 join_set_eq ~> sup_set_eq
3574 meet1_iff ~> inf1_iff
3575 meet2_iff ~> inf2_iff
3584 join1_iff ~> sup1_iff
3585 join2_iff ~> sup2_iff
3595 is_meet_Meet ~> is_meet_Inf
3596 Meet_bool_def ~> Inf_bool_def
3597 Meet_fun_def ~> Inf_fun_def
3598 Meet_greatest ~> Inf_greatest
3599 Meet_lower ~> Inf_lower
3600 Meet_set_def ~> Inf_set_def
3603 Sup_bool_eq ~> Sup_bool_def
3604 Sup_fun_eq ~> Sup_fun_def
3605 Sup_set_eq ~> Sup_set_def
3607 listsp_meetI ~> listsp_infI
3608 listsp_meet_eq ~> listsp_inf_eq
3613 * Added syntactic class "size"; overloaded constant "size" now has
3614 type "'a::size ==> bool"
3616 * Internal reorganisation of `size' of datatypes: size theorems
3617 "foo.size" are no longer subsumed by "foo.simps" (but are still
3618 simplification rules by default!); theorems "prod.size" now named
3621 * Class "div" now inherits from class "times" rather than "type".
3624 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3625 Linorder etc. have disappeared; operations defined in terms of
3626 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3628 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3630 * HOL-Word: New extensive library and type for generic, fixed size
3631 machine words, with arithemtic, bit-wise, shifting and rotating
3632 operations, reflection into int, nat, and bool lists, automation for
3633 linear arithmetic (by automatic reflection into nat or int), including
3634 lemmas on overflow and monotonicity. Instantiated to all appropriate
3635 arithmetic type classes, supporting automatic simplification of
3636 numerals on all operations.
3638 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3640 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3642 * Code generator library theories:
3643 - Code_Integer represents HOL integers by big integer literals in target
3645 - Code_Char represents HOL characters by character literals in target
3647 - Code_Char_chr like Code_Char, but also offers treatment of character
3648 codes; includes Code_Integer.
3649 - Executable_Set allows to generate code for finite sets using lists.
3650 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3652 - Executable_Real implements a subset of real numbers, namly those
3653 representable by rational numbers.
3654 - Efficient_Nat implements natural numbers by integers, which in general will
3655 result in higher efficency; pattern matching with 0/Suc is eliminated;
3656 includes Code_Integer.
3657 - Code_Index provides an additional datatype index which is mapped to
3658 target-language built-in integers.
3659 - Code_Message provides an additional datatype message_string which is isomorphic to
3660 strings; messages are mapped to target-language strings.
3662 * New package for inductive predicates
3664 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3667 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3668 for z_1 :: U_1 and ... and z_n :: U_m
3670 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3673 with full support for type-inference, rather than
3675 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3677 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3678 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3680 inductive "s z_1 ... z_m"
3682 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3685 For backward compatibility, there is a wrapper allowing inductive
3686 sets to be defined with the new package via
3689 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3690 for z_1 :: U_1 and ... and z_n :: U_m
3692 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3698 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3699 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3700 for z_1 :: U_1 and ... and z_n :: U_m
3702 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3703 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3706 if the additional syntax "p ..." is required.
3708 Numerous examples can be found in the subdirectories src/HOL/Auth,
3709 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3713 - Since declaration and definition of inductive sets or predicates
3714 is no longer separated, abbreviations involving the newly
3715 introduced sets or predicates must be specified together with the
3716 introduction rules after the 'where' keyword (see above), rather
3717 than before the actual inductive definition.
3719 - The variables in induction and elimination rules are now
3720 quantified in the order of their occurrence in the introduction
3721 rules, rather than in alphabetical order. Since this may break
3722 some proofs, these proofs either have to be repaired, e.g. by
3723 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3724 statements of the form
3726 case (rule_i a_i_1 ... a_i_{k_i})
3728 or the old order of quantification has to be restored by explicitly adding
3729 meta-level quantifiers in the introduction rules, i.e.
3731 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3733 - The format of the elimination rules is now
3735 p z_1 ... z_m x_1 ... x_n ==>
3736 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3741 (x_1, ..., x_n) : s z_1 ... z_m ==>
3742 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3745 for sets rather than
3747 x : s z_1 ... z_m ==>
3748 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3751 This may require terms in goals to be expanded to n-tuples
3752 (e.g. using case_tac or simplification with the split_paired_all
3753 rule) before the above elimination rule is applicable.
3755 - The elimination or case analysis rules for (mutually) inductive
3756 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3757 list of rules "p_1_..._p_k.elims" is no longer available.
3759 * New package "function"/"fun" for general recursive functions,
3760 supporting mutual and nested recursion, definitions in local contexts,
3761 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3762 for small examples, and the separate tutorial on the function
3763 package. The old recdef "package" is still available as before, but
3764 users are encouraged to use the new package.
3766 * Method "lexicographic_order" automatically synthesizes termination
3767 relations as lexicographic combinations of size measures.
3769 * Case-expressions allow arbitrary constructor-patterns (including
3770 "_") and take their order into account, like in functional
3771 programming. Internally, this is translated into nested
3772 case-expressions; missing cases are added and mapped to the predefined
3773 constant "undefined". In complicated cases printing may no longer show
3774 the original input but the internal form. Lambda-abstractions allow
3775 the same form of pattern matching: "% pat1 => e1 | ..." is an
3776 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3779 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3780 is an abbreviation for "of_nat :: nat => int". The simplification
3781 rules for "of_nat" have been changed to work like "int" did
3782 previously. Potential INCOMPATIBILITY:
3783 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3784 - of_nat_diff and of_nat_mult are no longer default simp rules
3786 * Method "algebra" solves polynomial equations over (semi)rings using
3787 Groebner bases. The (semi)ring structure is defined by locales and the
3788 tool setup depends on that generic context. Installing the method for
3789 a specific type involves instantiating the locale and possibly adding
3790 declarations for computation on the coefficients. The method is
3791 already instantiated for natural numbers and for the axiomatic class
3792 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3793 CALCULEMUS 2007 for the general principles underlying this
3794 architecture of context-aware proof-tools.
3796 * Method "ferrack" implements quantifier elimination over
3797 special-purpose dense linear orders using locales (analogous to
3798 "algebra"). The method is already installed for class
3799 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3802 * Former constant "List.op @" now named "List.append". Use ML
3803 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3804 circumvent possible incompatibilities when working on ML level.
3806 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3808 * New function listsum :: 'a list => 'a for arbitrary monoids.
3809 Special syntax: "SUM x <- xs. f x" (and latex variants)
3811 * New syntax for Haskell-like list comprehension (input only), eg.
3812 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3814 * The special syntax for function "filter" has changed from [x :
3815 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3816 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3818 * [a..b] is now defined for arbitrary linear orders. It used to be
3819 defined on nat only, as an abbreviation for [a..<Suc b]
3822 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3824 * New functions "sorted" and "sort" in src/HOL/List.thy.
3826 * New lemma collection field_simps (an extension of ring_simps) for
3827 manipulating (in)equations involving division. Multiplies with all
3828 denominators that can be proved to be non-zero (in equations) or
3829 positive/negative (in inequations).
3831 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3832 have been improved and renamed to ring_simps, group_simps and
3833 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3834 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3836 * Theory Library/Commutative_Ring: switched from recdef to function
3837 package; constants add, mul, pow now curried. Infix syntax for
3838 algebraic operations.
3840 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3843 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3846 * HOL/records: generalised field-update to take a function on the
3847 field rather than the new value: r(|A := x|) is translated to A_update
3848 (K x) r The K-combinator that is internally used is called K_record.
3849 INCOMPATIBILITY: Usage of the plain update functions has to be
3852 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3853 * x = 0, which are required for a semiring. Richer structures do not
3854 inherit from semiring_0 anymore, because this property is a theorem
3855 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3856 there is more to prove, but this is mostly trivial.
3858 * Class "recpower" is generalized to arbitrary monoids, not just
3859 commutative semirings. INCOMPATIBILITY: may need to incorporate
3860 commutativity or semiring properties additionally.
3862 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3863 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3864 better use 'abbreviation'.
3866 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3868 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3869 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3870 significant changes for setting up numeral syntax for types:
3871 - New constants Numeral.pred and Numeral.succ instead
3872 of former Numeral.bin_pred and Numeral.bin_succ.
3873 - Use integer operations instead of bin_add, bin_mult and so on.
3874 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3875 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3877 See src/HOL/Integ/IntArith.thy for an example setup.
3879 * Command 'normal_form' computes the normal form of a term that may
3880 contain free variables. For example ``normal_form "rev [a, b, c]"''
3881 produces ``[b, c, a]'' (without proof). This command is suitable for
3882 heavy-duty computations because the functions are compiled to ML
3883 first. Correspondingly, a method "normalization" is provided. See
3884 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3886 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3887 25 like -->); output depends on the "iff" print_mode, the default is
3888 "A = B" (with priority 50).
3890 * Relations less (<) and less_eq (<=) are also available on type bool.
3891 Modified syntax to disallow nesting without explicit parentheses,
3892 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3895 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3897 * Relation composition operator "op O" now has precedence 75 and binds
3898 stronger than union and intersection. INCOMPATIBILITY.
3900 * The old set interval syntax "{m..n(}" (and relatives) has been
3901 removed. Use "{m..<n}" (and relatives) instead.
3903 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3904 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3905 ``declare [[simproc del: neq]]''.
3907 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3910 * Theorem Cons_eq_map_conv no longer declared as "simp".
3912 * Theorem setsum_mult renamed to setsum_right_distrib.
3914 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3917 * Reimplemented methods "sat" and "satx", with several improvements:
3918 goals no longer need to be stated as "<prems> ==> False", equivalences
3919 (i.e. "=" on type bool) are handled, variable names of the form
3920 "lit_<n>" are no longer reserved, significant speedup.
3922 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3923 zChaff is still supported as well.
3925 * 'inductive' and 'datatype': provide projections of mutual rules,
3926 bundled as foo_bar.inducts;
3928 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3931 * Library: moved theory Accessible_Part to main HOL.
3933 * Library: added theory Coinductive_List of potentially infinite lists
3934 as greatest fixed-point.
3936 * Library: added theory AssocList which implements (finite) maps as
3939 * Method "evaluation" solves goals (i.e. a boolean expression)
3940 efficiently by compiling it to ML. The goal is "proved" (via an
3941 oracle) if it evaluates to True.
3943 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3944 also when invoked by the simplifier. This results in the Simplifier
3945 being more powerful on arithmetic goals. INCOMPATIBILITY.
3946 Configuration option fast_arith_split_limit=0 recovers the old
3949 * Support for hex (0x20) and binary (0b1001) numerals.
3951 * New method: reify eqs (t), where eqs are equations for an
3952 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3953 parameter, computes a term s::'b and a list xs::'a list and proves the
3954 theorem I xs s = t. This is also known as reification or quoting. The
3955 resulting theorem is applied to the subgoal to substitute t with I xs
3956 s. If t is omitted, the subgoal itself is reified.
3958 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3959 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3960 where f is supposed to be a computable function (in the sense of code
3961 generattion). The method uses reify to compute s and xs as above then
3962 applies corr_thm and uses normalization by evaluation to "prove" f s =
3963 r and finally gets the theorem t = r, which is again applied to the
3964 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3966 * Reflection: Automatic reification now handels binding, an example is
3967 available in src/HOL/ex/ReflectionEx.thy
3969 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3970 command 'statespace' that is similar to 'record', but introduces an
3971 abstract specification based on the locale infrastructure instead of
3972 HOL types. This leads to extra flexibility in composing state spaces,
3973 in particular multiple inheritance and renaming of components.
3978 * Hyperreal: Functions root and sqrt are now defined on negative real
3979 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3980 Nonnegativity side conditions have been removed from many lemmas, so
3981 that more subgoals may now be solved by simplification; potential
3984 * Real: new type classes formalize real normed vector spaces and
3985 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3986 and norm :: 'a => real.
3988 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3989 reals into other types. The overloaded constant Reals :: 'a set is now
3990 defined as range of_real; potential INCOMPATIBILITY.
3992 * Real: proper support for ML code generation, including 'quickcheck'.
3993 Reals are implemented as arbitrary precision rationals.
3995 * Hyperreal: Several constants that previously worked only for the
3996 reals have been generalized, so they now work over arbitrary vector
3997 spaces. Type annotations may need to be added in some cases; potential
4000 Infinitesimal :: ('a::real_normed_vector) star set
4001 HFinite :: ('a::real_normed_vector) star set
4002 HInfinite :: ('a::real_normed_vector) star set
4003 approx :: ('a::real_normed_vector) star => 'a star => bool
4004 monad :: ('a::real_normed_vector) star => 'a star set
4005 galaxy :: ('a::real_normed_vector) star => 'a star set
4006 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
4007 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
4008 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
4009 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
4010 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
4011 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
4012 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
4013 sgn :: 'a::real_normed_vector => 'a
4014 exp :: 'a::{recpower,real_normed_field,banach} => 'a
4016 * Complex: Some complex-specific constants are now abbreviations for
4017 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
4018 hnorm. Other constants have been entirely removed in favor of the
4019 polymorphic versions (INCOMPATIBILITY):
4023 HInfinite <-- CInfinite
4024 Infinitesimal <-- CInfinitesimal
4027 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
4028 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
4029 (ns)deriv <-- (ns)cderiv
4034 * Formalisation of ideals and the quotient construction over rings.
4036 * Order and lattice theory no longer based on records.
4039 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
4040 greatest_closed. INCOMPATIBILITY.
4042 * Method algebra is now set up via an attribute. For examples see
4043 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
4044 of algebraic structures.
4046 * Renamed theory CRing to Ring.
4051 * Substantial, yet incomplete support for nominal datatypes (binding
4052 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
4053 src/HOL/Nominal/Examples. Prospective users should consult
4054 http://isabelle.in.tum.de/nominal/
4059 * ML basics: just one true type int, which coincides with IntInf.int
4062 * ML within Isar: antiquotations allow to embed statically-checked
4063 formal entities in the source, referring to the context available at
4064 compile-time. For example:
4066 ML {* @{sort "{zero,one}"} *}
4067 ML {* @{typ "'a => 'b"} *}
4068 ML {* @{term "%x. x"} *}
4069 ML {* @{prop "x == y"} *}
4070 ML {* @{ctyp "'a => 'b"} *}
4071 ML {* @{cterm "%x. x"} *}
4072 ML {* @{cprop "x == y"} *}
4073 ML {* @{thm asm_rl} *}
4074 ML {* @{thms asm_rl} *}
4075 ML {* @{type_name c} *}
4076 ML {* @{type_syntax c} *}
4077 ML {* @{const_name c} *}
4078 ML {* @{const_syntax c} *}
4081 ML {* @{theory Pure} *}
4082 ML {* @{theory_ref} *}
4083 ML {* @{theory_ref Pure} *}
4086 ML {* @{clasimpset} *}
4088 The same works for sources being ``used'' within an Isar context.
4090 * ML in Isar: improved error reporting; extra verbosity with
4091 ML_Context.trace enabled.
4093 * Pure/General/table.ML: the join operations now works via exceptions
4094 DUP/SAME instead of type option. This is simpler in simple cases, and
4095 admits slightly more efficient complex applications.
4097 * Pure: 'advanced' translation functions (parse_translation etc.) now
4098 use Context.generic instead of just theory.
4100 * Pure: datatype Context.generic joins theory/Proof.context and
4101 provides some facilities for code that works in either kind of
4102 context, notably GenericDataFun for uniform theory and proof data.
4104 * Pure: simplified internal attribute type, which is now always
4105 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
4106 local (Proof.context) attributes have been discontinued, while
4107 minimizing code duplication. Thm.rule_attribute and
4108 Thm.declaration_attribute build canonical attributes; see also structure
4109 Context for further operations on Context.generic, notably
4110 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
4111 declarations and definitions.
4113 * Context data interfaces (Theory/Proof/GenericDataFun): removed
4114 name/print, uninitialized data defaults to ad-hoc copy of empty value,
4115 init only required for impure data. INCOMPATIBILITY: empty really need
4116 to be empty (no dependencies on theory content!)
4118 * Pure/kernel: consts certification ignores sort constraints given in
4119 signature declarations. (This information is not relevant to the
4120 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
4121 potential INCOMPATIBILITY.
4123 * Pure: axiomatic type classes are now purely definitional, with
4124 explicit proofs of class axioms and super class relations performed
4125 internally. See Pure/axclass.ML for the main internal interfaces --
4126 notably AxClass.define_class supercedes AxClass.add_axclass, and
4127 AxClass.axiomatize_class/classrel/arity supersede
4128 Sign.add_classes/classrel/arities.
4130 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
4131 global/local versions on theory vs. Proof.context have been
4132 discontinued; Attrib.syntax and Method.syntax have been adapted
4133 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
4134 attributes, methods, etc.
4136 * Pure: several functions of signature "... -> theory -> theory * ..."
4137 have been reoriented to "... -> theory -> ... * theory" in order to
4138 allow natural usage in combination with the ||>, ||>>, |-> and
4139 fold_map combinators.
4141 * Pure: official theorem names (closed derivations) and additional
4142 comments (tags) are now strictly separate. Name hints -- which are
4143 maintained as tags -- may be attached any time without affecting the
4146 * Pure: primitive rule lift_rule now takes goal cterm instead of an
4147 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
4148 achieve the old behaviour.
4150 * Pure: the "Goal" constant is now called "prop", supporting a
4151 slightly more general idea of ``protecting'' meta-level rule
4154 * Pure: Logic.(un)varify only works in a global context, which is now
4155 enforced instead of silently assumed. INCOMPATIBILITY, may use
4156 Logic.legacy_(un)varify as temporary workaround.
4158 * Pure: structure Name provides scalable operations for generating
4159 internal variable names, notably Name.variants etc. This replaces
4160 some popular functions from term.ML:
4162 Term.variant -> Name.variant
4163 Term.variantlist -> Name.variant_list
4164 Term.invent_names -> Name.invent_list
4166 Note that low-level renaming rarely occurs in new code -- operations
4167 from structure Variable are used instead (see below).
4169 * Pure: structure Variable provides fundamental operations for proper
4170 treatment of fixed/schematic variables in a context. For example,
4171 Variable.import introduces fixes for schematics of given facts and
4172 Variable.export reverses the effect (up to renaming) -- this replaces
4173 various freeze_thaw operations.
4175 * Pure: structure Goal provides simple interfaces for
4176 init/conclude/finish and tactical prove operations (replacing former
4177 Tactic.prove). Goal.prove is the canonical way to prove results
4178 within a given context; Goal.prove_global is a degraded version for
4179 theory level goals, including a global Drule.standard. Note that
4180 OldGoals.prove_goalw_cterm has long been obsolete, since it is
4181 ill-behaved in a local proof context (e.g. with local fixes/assumes or
4182 in a locale context).
4184 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
4185 and type checking (Syntax.check_term etc.), with common combinations
4186 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
4187 which are considered legacy and await removal.
4189 * Pure/Syntax: generic interfaces for type unchecking
4190 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
4191 with common combinations (Syntax.pretty_term, Syntax.string_of_term
4192 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
4193 available for convenience, but refer to the very same operations using
4194 a mere theory instead of a full context.
4196 * Isar: simplified treatment of user-level errors, using exception
4197 ERROR of string uniformly. Function error now merely raises ERROR,
4198 without any side effect on output channels. The Isar toplevel takes
4199 care of proper display of ERROR exceptions. ML code may use plain
4200 handle/can/try; cat_error may be used to concatenate errors like this:
4202 ... handle ERROR msg => cat_error msg "..."
4204 Toplevel ML code (run directly or through the Isar toplevel) may be
4205 embedded into the Isar toplevel with exception display/debug like
4208 Isar.toplevel (fn () => ...)
4210 INCOMPATIBILITY, removed special transform_error facilities, removed
4211 obsolete variants of user-level exceptions (ERROR_MESSAGE,
4212 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
4213 -- use plain ERROR instead.
4215 * Isar: theory setup now has type (theory -> theory), instead of a
4216 list. INCOMPATIBILITY, may use #> to compose setup functions.
4218 * Isar: ML toplevel pretty printer for type Proof.context, subject to
4219 ProofContext.debug/verbose flags.
4221 * Isar: Toplevel.theory_to_proof admits transactions that modify the
4222 theory before entering a proof state. Transactions now always see a
4223 quasi-functional intermediate checkpoint, both in interactive and
4226 * Isar: simplified interfaces for outer syntax. Renamed
4227 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
4228 OuterSyntax.add_parsers -- this functionality is now included in
4229 OuterSyntax.command etc. INCOMPATIBILITY.
4231 * Simplifier: the simpset of a running simplification process now
4232 contains a proof context (cf. Simplifier.the_context), which is the
4233 very context that the initial simpset has been retrieved from (by
4234 simpset_of/local_simpset_of). Consequently, all plug-in components
4235 (solver, looper etc.) may depend on arbitrary proof data.
4237 * Simplifier.inherit_context inherits the proof context (plus the
4238 local bounds) of the current simplification process; any simproc
4239 etc. that calls the Simplifier recursively should do this! Removed
4240 former Simplifier.inherit_bounds, which is already included here --
4241 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
4242 specify an explicit context using Simplifier.context/theory_context.
4244 * Simplifier/Classical Reasoner: more abstract interfaces
4245 change_simpset/claset for modifying the simpset/claset reference of a
4246 theory; raw versions simpset/claset_ref etc. have been discontinued --
4249 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
4255 * settings: the default heap location within ISABELLE_HOME_USER now
4256 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
4257 Isabelle installations.
4259 * isabelle-process: option -S (secure mode) disables some critical
4260 operations, notably runtime compilation and evaluation of ML source
4263 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
4265 * Support for parallel execution, using native multicore support of
4266 Poly/ML 5.1. The theory loader exploits parallelism when processing
4267 independent theories, according to the given theory header
4268 specifications. The maximum number of worker threads is specified via
4269 usedir option -M or the "max-threads" setting in Proof General. A
4270 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
4271 to 6 on a 8-core machine. User-code needs to observe certain
4272 guidelines for thread-safe programming, see appendix A in the Isar
4273 Implementation manual.
4277 New in Isabelle2005 (October 2005)
4278 ----------------------------------
4282 * Theory headers: the new header syntax for Isar theories is
4285 imports <theory1> ... <theoryN>
4286 uses <file1> ... <fileM>
4289 where the 'uses' part is optional. The previous syntax
4291 theory <name> = <theory1> + ... + <theoryN>:
4293 will disappear in the next release. Use isatool fixheaders to convert
4294 existing theory files. Note that there is no change in ancient
4295 non-Isar theories now, but these will disappear soon.
4297 * Theory loader: parent theories can now also be referred to via
4298 relative and absolute paths.
4300 * Command 'find_theorems' searches for a list of criteria instead of a
4301 list of constants. Known criteria are: intro, elim, dest, name:string,
4302 simp:term, and any term. Criteria can be preceded by '-' to select
4303 theorems that do not match. Intro, elim, dest select theorems that
4304 match the current goal, name:s selects theorems whose fully qualified
4305 name contain s, and simp:term selects all simplification rules whose
4306 lhs match term. Any other term is interpreted as pattern and selects
4307 all theorems matching the pattern. Available in ProofGeneral under
4308 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
4310 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
4312 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
4313 matching the current goal as introduction rule and not having "HOL."
4314 in their name (i.e. not being defined in theory HOL).
4316 * Command 'thms_containing' has been discontinued in favour of
4317 'find_theorems'; INCOMPATIBILITY.
4319 * Communication with Proof General is now 8bit clean, which means that
4320 Unicode text in UTF-8 encoding may be used within theory texts (both
4321 formal and informal parts). Cf. option -U of the Isabelle Proof
4322 General interface. Here are some simple examples (cf. src/HOL/ex):
4324 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
4325 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
4327 * Improved efficiency of the Simplifier and, to a lesser degree, the
4328 Classical Reasoner. Typical big applications run around 2 times
4332 *** Document preparation ***
4334 * Commands 'display_drafts' and 'print_drafts' perform simple output
4335 of raw sources. Only those symbols that do not require additional
4336 LaTeX packages (depending on comments in isabellesym.sty) are
4337 displayed properly, everything else is left verbatim. isatool display
4338 and isatool print are used as front ends (these are subject to the
4339 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
4341 * Command tags control specific markup of certain regions of text,
4342 notably folding and hiding. Predefined tags include "theory" (for
4343 theory begin and end), "proof" for proof commands, and "ML" for
4344 commands involving ML code; the additional tags "visible" and
4345 "invisible" are unused by default. Users may give explicit tag
4346 specifications in the text, e.g. ''by %invisible (auto)''. The
4347 interpretation of tags is determined by the LaTeX job during document
4348 preparation: see option -V of isatool usedir, or options -n and -t of
4349 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
4352 Several document versions may be produced at the same time via isatool
4353 usedir (the generated index.html will link all of them). Typical
4354 specifications include ''-V document=theory,proof,ML'' to present
4355 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
4356 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
4357 these parts without any formal replacement text. The Isabelle site
4358 default settings produce ''document'' and ''outline'' versions as
4361 * Several new antiquotations:
4363 @{term_type term} prints a term with its type annotated;
4365 @{typeof term} prints the type of a term;
4367 @{const const} is the same as @{term const}, but checks that the
4368 argument is a known logical constant;
4370 @{term_style style term} and @{thm_style style thm} print a term or
4371 theorem applying a "style" to it
4375 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
4376 definitions, equations, inequations etc., 'concl' printing only the
4377 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
4378 to print the specified premise. TermStyle.add_style provides an ML
4379 interface for introducing further styles. See also the "LaTeX Sugar"
4380 document practical applications. The ML antiquotation prints
4381 type-checked ML expressions verbatim.
4383 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
4384 and 'text' support optional locale specification '(in loc)', which
4385 specifies the default context for interpreting antiquotations. For
4386 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
4388 * Option 'locale=NAME' of antiquotations specifies an alternative
4389 context interpreting the subsequent argument. For example: @{thm
4390 [locale=lattice] inf_assoc}.
4392 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
4395 * Proper output of antiquotations for theory commands involving a
4396 proof context (such as 'locale' or 'theorem (in loc) ...').
4398 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
4399 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
4401 * isatool usedir: new option -C (default true) controls whether option
4402 -D should include a copy of the original document directory; -C false
4403 prevents unwanted effects such as copying of administrative CVS data.
4408 * Considerably improved version of 'constdefs' command. Now performs
4409 automatic type-inference of declared constants; additional support for
4410 local structure declarations (cf. locales and HOL records), see also
4411 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
4412 sequential dependencies of definitions within a single 'constdefs'
4413 section; moreover, the declared name needs to be an identifier. If
4414 all fails, consider to fall back on 'consts' and 'defs' separately.
4416 * Improved indexed syntax and implicit structures. First of all,
4417 indexed syntax provides a notational device for subscripted
4418 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
4419 expressions. Secondly, in a local context with structure
4420 declarations, number indexes \<^sub>n or the empty index (default
4421 number 1) refer to a certain fixed variable implicitly; option
4422 show_structs controls printing of implicit structures. Typical
4423 applications of these concepts involve record types and locales.
4425 * New command 'no_syntax' removes grammar declarations (and
4426 translations) resulting from the given syntax specification, which is
4427 interpreted in the same manner as for the 'syntax' command.
4429 * 'Advanced' translation functions (parse_translation etc.) may depend
4430 on the signature of the theory context being presently used for
4431 parsing/printing, see also isar-ref manual.
4433 * Improved 'oracle' command provides a type-safe interface to turn an
4434 ML expression of type theory -> T -> term into a primitive rule of
4435 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
4436 is already included here); see also FOL/ex/IffExample.thy;
4439 * axclass: name space prefix for class "c" is now "c_class" (was "c"
4440 before); "cI" is no longer bound, use "c.intro" instead.
4441 INCOMPATIBILITY. This change avoids clashes of fact bindings for
4442 axclasses vs. locales.
4444 * Improved internal renaming of symbolic identifiers -- attach primes
4445 instead of base 26 numbers.
4447 * New flag show_question_marks controls printing of leading question
4448 marks in schematic variable names.
4450 * In schematic variable names, *any* symbol following \<^isub> or
4451 \<^isup> is now treated as part of the base name. For example, the
4452 following works without printing of awkward ".0" indexes:
4454 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
4457 * Inner syntax includes (*(*nested*) comments*).
4459 * Pretty printer now supports unbreakable blocks, specified in mixfix
4460 annotations as "(00...)".
4462 * Clear separation of logical types and nonterminals, where the latter
4463 may only occur in 'syntax' specifications or type abbreviations.
4464 Before that distinction was only partially implemented via type class
4465 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
4466 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
4467 exotic syntax specifications may require further adaption
4468 (e.g. Cube/Cube.thy).
4470 * Removed obsolete type class "logic", use the top sort {} instead.
4471 Note that non-logical types should be declared as 'nonterminals'
4472 rather than 'types'. INCOMPATIBILITY for new object-logic
4475 * Attributes 'induct' and 'cases': type or set names may now be
4476 locally fixed variables as well.
4478 * Simplifier: can now control the depth to which conditional rewriting
4479 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
4482 * Simplifier: simplification procedures may now take the current
4483 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
4484 interface), which is very useful for calling the Simplifier
4485 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
4486 is gone -- use prems_of_ss on the simpset instead. Moreover, the
4487 low-level mk_simproc no longer applies Logic.varify internally, to
4488 allow for use in a context of fixed variables.
4490 * thin_tac now works even if the assumption being deleted contains !!
4491 or ==>. More generally, erule now works even if the major premise of
4492 the elimination rule contains !! or ==>.
4494 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
4496 * Reorganized bootstrapping of the Pure theories; CPure is now derived
4497 from Pure, which contains all common declarations already. Both
4498 theories are defined via plain Isabelle/Isar .thy files.
4499 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
4500 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
4501 use isatool fixcpure to adapt your theory and ML sources.
4503 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
4504 selections of theorems in named facts via index ranges.
4506 * 'print_theorems': in theory mode, really print the difference
4507 wrt. the last state (works for interactive theory development only),
4508 in proof mode print all local facts (cf. 'print_facts');
4510 * 'hide': option '(open)' hides only base names.
4512 * More efficient treatment of intermediate checkpoints in interactive
4515 * Code generator is now invoked via code_module (incremental code
4516 generation) and code_library (modular code generation, ML structures
4517 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4518 must be quoted when used as identifiers.
4520 * New 'value' command for reading, evaluating and printing terms using
4521 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4522 quoted when used as identifier.
4527 * New commands for the interpretation of locale expressions in
4528 theories (1), locales (2) and proof contexts (3). These generate
4529 proof obligations from the expression specification. After the
4530 obligations have been discharged, theorems of the expression are added
4531 to the theory, target locale or proof context. The synopsis of the
4532 commands is a follows:
4534 (1) interpretation expr inst
4535 (2) interpretation target < expr
4536 (3) interpret expr inst
4538 Interpretation in theories and proof contexts require a parameter
4539 instantiation of terms from the current context. This is applied to
4540 specifications and theorems of the interpreted expression.
4541 Interpretation in locales only permits parameter renaming through the
4542 locale expression. Interpretation is smart in that interpretations
4543 that are active already do not occur in proof obligations, neither are
4544 instantiated theorems stored in duplicate. Use 'print_interps' to
4545 inspect active interpretations of a particular locale. For details,
4546 see the Isar Reference manual. Examples can be found in
4547 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4549 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4550 'interpret' instead.
4552 * New context element 'constrains' for adding type constraints to
4555 * Context expressions: renaming of parameters with syntax
4558 * Locale declaration: 'includes' disallowed.
4560 * Proper static binding of attribute syntax -- i.e. types / terms /
4561 facts mentioned as arguments are always those of the locale definition
4562 context, independently of the context of later invocations. Moreover,
4563 locale operations (renaming and type / term instantiation) are applied
4564 to attribute arguments as expected.
4566 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4567 actual attributes; rare situations may require Attrib.attribute to
4568 embed those attributes into Attrib.src that lack concrete syntax.
4569 Attribute implementations need to cooperate properly with the static
4570 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4571 Attrib.XXX_thm etc. already do the right thing without further
4572 intervention. Only unusual applications -- such as "where" or "of"
4573 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4574 on the context and the facts involved -- may have to assign parsed
4575 values to argument tokens explicitly.
4577 * Changed parameter management in theorem generation for long goal
4578 statements with 'includes'. INCOMPATIBILITY: produces a different
4579 theorem statement in rare situations.
4581 * Locale inspection command 'print_locale' omits notes elements. Use
4582 'print_locale!' to have them included in the output.
4587 * Provers/hypsubst.ML: improved version of the subst method, for
4588 single-step rewriting: it now works in bound variable contexts. New is
4589 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4590 rewrite a different subterm than the original subst method, which is
4591 still available as 'simplesubst'.
4593 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4596 * Provers/trancl.ML: new transitivity reasoner for transitive and
4597 reflexive-transitive closure of relations.
4599 * Provers/blast.ML: new reference depth_limit to make blast's depth
4600 limit (previously hard-coded with a value of 20) user-definable.
4602 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4603 is peformed already. Object-logics merely need to finish their
4604 initial simpset configuration as before. INCOMPATIBILITY.
4609 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4612 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4614 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4615 and x-symbol; use option '-m epsilon' to get it actually printed.
4616 Moreover, the mathematically important symbolic identifier \<epsilon>
4617 becomes available as variable, constant etc. INCOMPATIBILITY,
4619 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4620 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4621 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4622 support corresponding Isar calculations.
4624 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4627 * theory SetInterval: changed the syntax for open intervals:
4636 The old syntax is still supported but will disappear in the next
4637 release. For conversion use the following Emacs search and replace
4638 patterns (these are not perfect but work quite well):
4640 {)\([^\.]*\)\.\. -> {\1<\.\.}
4641 \.\.\([^(}]*\)(} -> \.\.<\1}
4643 * Theory Commutative_Ring (in Library): method comm_ring for proving
4644 equalities in commutative rings; method 'algebra' provides a generic
4647 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4648 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4649 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4652 Some new syntax forms are available:
4654 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4655 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4656 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4657 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4659 The latter form "\<Sum>x < k. e" used to be based on a separate
4660 function "Summation", which has been discontinued.
4662 * theory Finite_Set: in structured induction proofs, the insert case
4663 is now 'case (insert x F)' instead of the old counterintuitive 'case
4666 * The 'refute' command has been extended to support a much larger
4667 fragment of HOL, including axiomatic type classes, constdefs and
4668 typedefs, inductive datatypes and recursion.
4670 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4671 Requires zChaff with proof generation to be installed. See
4672 HOL/ex/SAT_Examples.thy for examples.
4674 * Datatype induction via method 'induct' now preserves the name of the
4675 induction variable. For example, when proving P(xs::'a list) by
4676 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4677 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4678 in unstructured proof scripts.
4680 * Reworked implementation of records. Improved scalability for
4681 records with many fields, avoiding performance problems for type
4682 inference. Records are no longer composed of nested field types, but
4683 of nested extension types. Therefore the record type only grows linear
4684 in the number of extensions and not in the number of fields. The
4685 top-level (users) view on records is preserved. Potential
4686 INCOMPATIBILITY only in strange cases, where the theory depends on the
4687 old record representation. The type generated for a record is called
4688 <record_name>_ext_type.
4690 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4691 proofs triggered by a record definition or a simproc (if
4692 quick_and_dirty is enabled). Definitions of large records can take
4695 New simproc record_upd_simproc for simplification of multiple record
4696 updates enabled by default. Moreover, trivial updates are also
4697 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4698 occasionally, since simplification is more powerful by default.
4700 * typedef: proper support for polymorphic sets, which contain extra
4701 type-variables in the term.
4703 * Simplifier: automatically reasons about transitivity chains
4704 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4705 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4706 old proofs break occasionally as simplification may now solve more
4707 goals than previously.
4709 * Simplifier: converts x <= y into x = y if assumption y <= x is
4710 present. Works for all partial orders (class "order"), in particular
4711 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4714 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4715 bound variable or a constant then the let is unfolded. Otherwise
4716 first a is simplified to b, and then f b is simplified to g. If
4717 possible we abstract b from g arriving at "let x = b in h x",
4718 otherwise we unfold the let and arrive at g. The simproc can be
4719 enabled/disabled by the reference use_let_simproc. Potential
4720 INCOMPATIBILITY since simplification is more powerful by default.
4722 * Classical reasoning: the meson method now accepts theorems as arguments.
4724 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4725 jobs to provide advice on the provability of subgoals.
4727 * Theory OrderedGroup and Ring_and_Field: various additions and
4728 improvements to faciliate calculations involving equalities and
4731 The following theorems have been eliminated or modified
4734 abs_eq now named abs_of_nonneg
4735 abs_of_ge_0 now named abs_of_nonneg
4736 abs_minus_eq now named abs_of_nonpos
4737 imp_abs_id now named abs_of_nonneg
4738 imp_abs_neg_id now named abs_of_nonpos
4739 mult_pos now named mult_pos_pos
4740 mult_pos_le now named mult_nonneg_nonneg
4741 mult_pos_neg_le now named mult_nonneg_nonpos
4742 mult_pos_neg2_le now named mult_nonneg_nonpos2
4743 mult_neg now named mult_neg_neg
4744 mult_neg_le now named mult_nonpos_nonpos
4746 * The following lemmas in Ring_and_Field have been added to the simplifier:
4749 not_square_less_zero
4751 The following lemmas have been deleted from Real/RealPow:
4761 * Theory Parity: added rules for simplifying exponents.
4765 The following theorems have been eliminated or modified
4768 list_all_Nil now named list_all.simps(1)
4769 list_all_Cons now named list_all.simps(2)
4770 list_all_conv now named list_all_iff
4771 set_mem_eq now named mem_iff
4773 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4774 asymptotic "big O" calculations. See the notes in BigO.thy.
4779 * Theory RealDef: better support for embedding natural numbers and
4780 integers in the reals.
4782 The following theorems have been eliminated or modified
4785 exp_ge_add_one_self now requires no hypotheses
4786 real_of_int_add reversed direction of equality (use [symmetric])
4787 real_of_int_minus reversed direction of equality (use [symmetric])
4788 real_of_int_diff reversed direction of equality (use [symmetric])
4789 real_of_int_mult reversed direction of equality (use [symmetric])
4791 * Theory RComplete: expanded support for floor and ceiling functions.
4793 * Theory Ln is new, with properties of the natural logarithm
4795 * Hyperreal: There is a new type constructor "star" for making
4796 nonstandard types. The old type names are now type synonyms:
4800 hcomplex = complex star
4802 * Hyperreal: Many groups of similarly-defined constants have been
4803 replaced by polymorphic versions (INCOMPATIBILITY):
4805 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4807 starset <-- starsetNat, starsetC
4808 *s* <-- *sNat*, *sc*
4809 starset_n <-- starsetNat_n, starsetC_n
4810 *sn* <-- *sNatn*, *scn*
4811 InternalSets <-- InternalNatSets, InternalCSets
4813 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4814 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4815 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4816 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4817 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4819 * Hyperreal: Many type-specific theorems have been removed in favor of
4820 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4822 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4823 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4824 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4825 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4826 right_minus <-- hypreal_add_minus
4827 left_minus <-- {hypreal,hcomplex}_add_minus_left
4828 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4829 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4830 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4831 mult_1_right <-- hcomplex_mult_one_right
4832 mult_zero_left <-- hcomplex_mult_zero_left
4833 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4834 right_distrib <-- hypnat_add_mult_distrib2
4835 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4836 right_inverse <-- hypreal_mult_inverse
4837 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4838 order_refl <-- {hypreal,hypnat}_le_refl
4839 order_trans <-- {hypreal,hypnat}_le_trans
4840 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4841 order_less_le <-- {hypreal,hypnat}_less_le
4842 linorder_linear <-- {hypreal,hypnat}_le_linear
4843 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4844 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4845 add_nonneg_nonneg <-- hypreal_le_add_order
4847 * Hyperreal: Separate theorems having to do with type-specific
4848 versions of constants have been merged into theorems that apply to the
4849 new polymorphic constants (INCOMPATIBILITY):
4851 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4852 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4853 STAR_Un <-- {STAR,NatStar,STARC}_Un
4854 STAR_Int <-- {STAR,NatStar,STARC}_Int
4855 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4856 STAR_subset <-- {STAR,NatStar,STARC}_subset
4857 STAR_mem <-- {STAR,NatStar,STARC}_mem
4858 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4859 STAR_diff <-- {STAR,STARC}_diff
4860 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4861 STARC_hcomplex_of_complex}_image_subset
4862 starset_n_Un <-- starset{Nat,C}_n_Un
4863 starset_n_Int <-- starset{Nat,C}_n_Int
4864 starset_n_Compl <-- starset{Nat,C}_n_Compl
4865 starset_n_diff <-- starset{Nat,C}_n_diff
4866 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4867 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4868 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4869 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4870 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4871 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4872 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4873 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4874 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4875 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4876 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4877 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4878 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4879 starfun_diff <-- starfun{C,RC,CR}_diff
4880 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4881 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4882 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4883 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4884 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4885 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4886 starfun_Id <-- starfunC_Id
4887 starfun_approx <-- starfun{Nat,CR}_approx
4888 starfun_capprox <-- starfun{C,RC}_capprox
4889 starfun_abs <-- starfunNat_rabs
4890 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4891 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4892 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4893 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4894 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4895 starfun_add_approx <-- starfunCR_add_approx
4896 starfun_inverse_inverse <-- starfunC_inverse_inverse
4897 starfun_divide <-- starfun{C,CR,RC}_divide
4898 starfun_n <-- starfun{Nat,C}_n
4899 starfun_n_mult <-- starfun{Nat,C}_n_mult
4900 starfun_n_add <-- starfun{Nat,C}_n_add
4901 starfun_n_add_minus <-- starfunNat_n_add_minus
4902 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4903 starfun_n_minus <-- starfun{Nat,C}_n_minus
4904 starfun_n_eq <-- starfun{Nat,C}_n_eq
4906 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4907 star_n_minus <-- {hypreal,hcomplex}_minus
4908 star_n_diff <-- {hypreal,hcomplex}_diff
4909 star_n_mult <-- {hypreal,hcomplex}_mult
4910 star_n_inverse <-- {hypreal,hcomplex}_inverse
4911 star_n_le <-- {hypreal,hypnat}_le
4912 star_n_less <-- {hypreal,hypnat}_less
4913 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4914 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4915 star_n_abs <-- hypreal_hrabs
4916 star_n_divide <-- hcomplex_divide
4918 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4919 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4920 star_of_diff <-- hypreal_of_real_diff
4921 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4922 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4923 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4924 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4925 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4926 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4927 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4928 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4929 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4930 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4931 star_of_number_of <-- {hypreal,hcomplex}_number_of
4932 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4933 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4934 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4935 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4936 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4937 star_of_power <-- hypreal_of_real_power
4938 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4940 * Hyperreal: new method "transfer" that implements the transfer
4941 principle of nonstandard analysis. With a subgoal that mentions
4942 nonstandard types like "'a star", the command "apply transfer"
4943 replaces it with an equivalent one that mentions only standard types.
4944 To be successful, all free variables must have standard types; non-
4945 standard variables must have explicit universal quantifiers.
4947 * Hyperreal: A theory of Taylor series.
4952 * Discontinued special version of 'constdefs' (which used to support
4953 continuous functions) in favor of the general Pure one with full
4956 * New simplification procedure for solving continuity conditions; it
4957 is much faster on terms with many nested lambda abstractions (cubic
4958 instead of exponential time).
4960 * New syntax for domain package: selector names are now optional.
4961 Parentheses should be omitted unless argument is lazy, for example:
4963 domain 'a stream = cons "'a" (lazy "'a stream")
4965 * New command 'fixrec' for defining recursive functions with pattern
4966 matching; defining multiple functions with mutual recursion is also
4967 supported. Patterns may include the constants cpair, spair, up, sinl,
4968 sinr, or any data constructor defined by the domain package. The given
4969 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4970 syntax and examples.
4972 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4973 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4974 but the proof obligation additionally includes an admissibility
4975 requirement. The packages generate instances of class cpo or pcpo,
4976 with continuity and strictness theorems for Rep and Abs.
4978 * HOLCF: Many theorems have been renamed according to a more standard naming
4979 scheme (INCOMPATIBILITY):
4981 foo_inject: "foo$x = foo$y ==> x = y"
4982 foo_eq: "(foo$x = foo$y) = (x = y)"
4983 foo_less: "(foo$x << foo$y) = (x << y)"
4984 foo_strict: "foo$UU = UU"
4985 foo_defined: "... ==> foo$x ~= UU"
4986 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4991 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4992 including the First Isomorphism Theorem (on quotienting by the kernel
4995 * ZF/Simplifier: install second copy of type solver that actually
4996 makes use of TC rules declared to Isar proof contexts (or locales);
4997 the old version is still required for ML proof scripts.
5002 * Converted to Isar theory format; use locales instead of axiomatic
5008 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
5011 * Pure/library.ML no longer defines its own option datatype, but uses
5012 that of the SML basis, which has constructors NONE and SOME instead of
5013 None and Some, as well as exception Option.Option instead of OPTION.
5014 The functions the, if_none, is_some, is_none have been adapted
5015 accordingly, while Option.map replaces apsome.
5017 * Pure/library.ML: the exception LIST has been given up in favour of
5018 the standard exceptions Empty and Subscript, as well as
5019 Library.UnequalLengths. Function like Library.hd and Library.tl are
5020 superceded by the standard hd and tl functions etc.
5022 A number of basic list functions are no longer exported to the ML
5023 toplevel, as they are variants of predefined functions. The following
5024 suggests how one can translate existing code:
5026 rev_append xs ys = List.revAppend (xs, ys)
5027 nth_elem (i, xs) = List.nth (xs, i)
5028 last_elem xs = List.last xs
5029 flat xss = List.concat xss
5030 seq fs = List.app fs
5031 partition P xs = List.partition P xs
5032 mapfilter f xs = List.mapPartial f xs
5034 * Pure/library.ML: several combinators for linear functional
5035 transformations, notably reverse application and composition:
5038 (x, y) |-> f f #-> g
5040 * Pure/library.ML: introduced/changed precedence of infix operators:
5042 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
5044 infix 3 o oo ooo oooo;
5045 infix 4 ~~ upto downto;
5047 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
5050 * Pure/library.ML: natural list combinators fold, fold_rev, and
5051 fold_map support linear functional transformations and nesting. For
5054 fold f [x1, ..., xN] y =
5055 y |> f x1 |> ... |> f xN
5057 (fold o fold) f [xs1, ..., xsN] y =
5058 y |> fold f xs1 |> ... |> fold f xsN
5060 fold f [x1, ..., xN] =
5063 (fold o fold) f [xs1, ..., xsN] =
5064 fold f xs1 #> ... #> fold f xsN
5066 * Pure/library.ML: the following selectors on type 'a option are
5069 the: 'a option -> 'a (*partial*)
5070 these: 'a option -> 'a where 'a = 'b list
5071 the_default: 'a -> 'a option -> 'a
5072 the_list: 'a option -> 'a list
5074 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5075 basic operations for association lists, following natural argument
5076 order; moreover the explicit equality predicate passed here avoids
5077 potentially expensive polymorphic runtime equality checks.
5078 The old functions may be expressed as follows:
5080 assoc = uncurry (AList.lookup (op =))
5081 assocs = these oo AList.lookup (op =)
5082 overwrite = uncurry (AList.update (op =)) o swap
5084 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5086 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
5087 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
5089 replacing make_keylist and keyfilter (occassionally used)
5092 make_keylist = AList.make
5093 keyfilter = AList.find (op =)
5095 * eq_fst and eq_snd now take explicit equality parameter, thus
5096 avoiding eqtypes. Naive rewrites:
5098 eq_fst = eq_fst (op =)
5099 eq_snd = eq_snd (op =)
5101 * Removed deprecated apl and apr (rarely used).
5104 apl (n, op) =>>= curry op n
5105 apr (op, m) =>>= fn n => op (n, m)
5107 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
5108 provides a reasonably efficient light-weight implementation of sets as
5111 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
5112 few new operations; existing lookup and update are now curried to
5113 follow natural argument order (for use with fold etc.);
5114 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
5116 * Pure/General: output via the Isabelle channels of
5117 writeln/warning/error etc. is now passed through Output.output, with a
5118 hook for arbitrary transformations depending on the print_mode
5119 (cf. Output.add_mode -- the first active mode that provides a output
5120 function wins). Already formatted output may be embedded into further
5121 text via Output.raw; the result of Pretty.string_of/str_of and derived
5122 functions (string_of_term/cterm/thm etc.) is already marked raw to
5123 accommodate easy composition of diagnostic messages etc. Programmers
5124 rarely need to care about Output.output or Output.raw at all, with
5125 some notable exceptions: Output.output is required when bypassing the
5126 standard channels (writeln etc.), or in token translations to produce
5127 properly formatted results; Output.raw is required when capturing
5128 already output material that will eventually be presented to the user
5129 a second time. For the default print mode, both Output.output and
5130 Output.raw have no effect.
5132 * Pure/General: Output.time_accumulator NAME creates an operator ('a
5133 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
5134 cumulative results are displayed at the end of a batch session.
5136 * Pure/General: File.sysify_path and File.quote_sysify path have been
5137 replaced by File.platform_path and File.shell_path (with appropriate
5138 hooks). This provides a clean interface for unusual systems where the
5139 internal and external process view of file names are different.
5141 * Pure: more efficient orders for basic syntactic entities: added
5142 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
5143 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
5144 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
5145 orders now -- potential INCOMPATIBILITY for code that depends on a
5146 particular order for Symtab.keys, Symtab.dest, etc. (consider using
5147 Library.sort_strings on result).
5149 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
5150 fold_types traverse types/terms from left to right, observing natural
5151 argument order. Supercedes previous foldl_XXX versions, add_frees,
5152 add_vars etc. have been adapted as well: INCOMPATIBILITY.
5154 * Pure: name spaces have been refined, with significant changes of the
5155 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
5156 to extern(_table). The plain name entry path is superceded by a
5157 general 'naming' context, which also includes the 'policy' to produce
5158 a fully qualified name and external accesses of a fully qualified
5159 name; NameSpace.extend is superceded by context dependent
5160 Sign.declare_name. Several theory and proof context operations modify
5161 the naming context. Especially note Theory.restore_naming and
5162 ProofContext.restore_naming to get back to a sane state; note that
5163 Theory.add_path is no longer sufficient to recover from
5164 Theory.absolute_path in particular.
5166 * Pure: new flags short_names (default false) and unique_names
5167 (default true) for controlling output of qualified names. If
5168 short_names is set, names are printed unqualified. If unique_names is
5169 reset, the name prefix is reduced to the minimum required to achieve
5170 the original result when interning again, even if there is an overlap
5171 with earlier declarations.
5173 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
5174 now 'extend', and 'merge' gets an additional Pretty.pp argument
5175 (useful for printing error messages). INCOMPATIBILITY.
5177 * Pure: major reorganization of the theory context. Type Sign.sg and
5178 Theory.theory are now identified, referring to the universal
5179 Context.theory (see Pure/context.ML). Actual signature and theory
5180 content is managed as theory data. The old code and interfaces were
5181 spread over many files and structures; the new arrangement introduces
5182 considerable INCOMPATIBILITY to gain more clarity:
5184 Context -- theory management operations (name, identity, inclusion,
5185 parents, ancestors, merge, etc.), plus generic theory data;
5187 Sign -- logical signature and syntax operations (declaring consts,
5188 types, etc.), plus certify/read for common entities;
5190 Theory -- logical theory operations (stating axioms, definitions,
5191 oracles), plus a copy of logical signature operations (consts,
5192 types, etc.); also a few basic management operations (Theory.copy,
5195 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
5196 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
5197 for convenience -- they merely return the theory.
5199 * Pure: type Type.tsig is superceded by theory in most interfaces.
5201 * Pure: the Isar proof context type is already defined early in Pure
5202 as Context.proof (note that ProofContext.context and Proof.context are
5203 aliases, where the latter is the preferred name). This enables other
5204 Isabelle components to refer to that type even before Isar is present.
5206 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
5207 typeK, constK, axiomK, oracleK), but provide explicit operations for
5208 any of these kinds. For example, Sign.intern typeK is now
5209 Sign.intern_type, Theory.hide_space Sign.typeK is now
5210 Theory.hide_types. Also note that former
5211 Theory.hide_classes/types/consts are now
5212 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
5213 internalize their arguments! INCOMPATIBILITY.
5215 * Pure: get_thm interface (of PureThy and ProofContext) expects
5216 datatype thmref (with constructors Name and NameSelection) instead of
5217 plain string -- INCOMPATIBILITY;
5219 * Pure: cases produced by proof methods specify options, where NONE
5220 means to remove case bindings -- INCOMPATIBILITY in
5223 * Pure: the following operations retrieve axioms or theorems from a
5224 theory node or theory hierarchy, respectively:
5226 Theory.axioms_of: theory -> (string * term) list
5227 Theory.all_axioms_of: theory -> (string * term) list
5228 PureThy.thms_of: theory -> (string * thm) list
5229 PureThy.all_thms_of: theory -> (string * thm) list
5231 * Pure: print_tac now outputs the goal through the trace channel.
5233 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
5234 Reference Toplevel.debug (default false) controls detailed printing
5235 and tracing of low-level exceptions; Toplevel.profiling (default 0)
5236 controls execution profiling -- set to 1 for time and 2 for space
5237 (both increase the runtime).
5239 * Isar session: The initial use of ROOT.ML is now always timed,
5240 i.e. the log will show the actual process times, in contrast to the
5241 elapsed wall-clock time that the outer shell wrapper produces.
5243 * Simplifier: improved handling of bound variables (nameless
5244 representation, avoid allocating new strings). Simprocs that invoke
5245 the Simplifier recursively should use Simplifier.inherit_bounds to
5246 avoid local name clashes. Failure to do so produces warnings
5247 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
5248 for further details.
5250 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
5251 bindings for all theorems stored within a given theory; this may help
5252 in porting non-Isar theories to Isar ones, while keeping ML proof
5253 scripts for the time being.
5255 * ML operator HTML.with_charset specifies the charset begin used for
5256 generated HTML files. For example:
5258 HTML.with_charset "utf-8" use_thy "Hebrew";
5259 HTML.with_charset "utf-8" use_thy "Chinese";
5264 * Allow symlinks to all proper Isabelle executables (Isabelle,
5265 isabelle, isatool etc.).
5267 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
5268 isatool doc, isatool mkdir, display_drafts etc.).
5270 * isatool usedir: option -f allows specification of the ML file to be
5271 used by Isabelle; default is ROOT.ML.
5273 * New isatool version outputs the version identifier of the Isabelle
5274 distribution being used.
5276 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
5277 (containing Boolean satisfiability problems) into Isabelle/HOL
5282 New in Isabelle2004 (April 2004)
5283 --------------------------------
5287 * Provers/order.ML: new efficient reasoner for partial and linear orders.
5288 Replaces linorder.ML.
5290 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
5291 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
5292 (\<a>...\<z>), are now considered normal letters, and can therefore
5293 be used anywhere where an ASCII letter (a...zA...Z) has until
5294 now. COMPATIBILITY: This obviously changes the parsing of some
5295 terms, especially where a symbol has been used as a binder, say
5296 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
5297 as an identifier. Fix it by inserting a space around former
5298 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
5299 existing theory and ML files.
5301 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
5303 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
5304 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
5305 a normal (but invisible) letter. For multiple letter subscripts repeat
5306 \<^isub> like this: x\<^isub>1\<^isub>2.
5308 * Pure: There are now sub-/superscripts that can span more than one
5309 character. Text between \<^bsub> and \<^esub> is set in subscript in
5310 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
5311 superscript. The new control characters are not identifier parts.
5313 * Pure: Control-symbols of the form \<^raw:...> will literally print the
5314 content of "..." to the latex file instead of \isacntrl... . The "..."
5315 may consist of any printable characters excluding the end bracket >.
5317 * Pure: Using new Isar command "finalconsts" (or the ML functions
5318 Theory.add_finals or Theory.add_finals_i) it is now possible to
5319 declare constants "final", which prevents their being given a definition
5320 later. It is useful for constants whose behaviour is fixed axiomatically
5321 rather than definitionally, such as the meta-logic connectives.
5323 * Pure: 'instance' now handles general arities with general sorts
5324 (i.e. intersections of classes),
5326 * Presentation: generated HTML now uses a CSS style sheet to make layout
5327 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
5328 It can be changed to alter the colors/layout of generated pages.
5333 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
5334 cut_tac, subgoal_tac and thin_tac:
5335 - Now understand static (Isar) contexts. As a consequence, users of Isar
5336 locales are no longer forced to write Isar proof scripts.
5337 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
5339 - INCOMPATIBILITY: names of variables to be instantiated may no
5340 longer be enclosed in quotes. Instead, precede variable name with `?'.
5341 This is consistent with the instantiation attribute "where".
5343 * Attributes "where" and "of":
5344 - Now take type variables of instantiated theorem into account when reading
5345 the instantiation string. This fixes a bug that caused instantiated
5346 theorems to have too special types in some circumstances.
5347 - "where" permits explicit instantiations of type variables.
5349 * Calculation commands "moreover" and "also" no longer interfere with
5350 current facts ("this"), admitting arbitrary combinations with "then"
5354 - Goal statements involving the context element "includes" no longer
5355 generate theorems with internal delta predicates (those ending on
5356 "_axioms") in the premise.
5357 Resolve particular premise with <locale>.intro to obtain old form.
5358 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
5359 specification and "includes" elements in goal statement.
5360 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
5361 [intro?] and [elim?] (respectively) by default.
5362 - Experimental command for instantiation of locales in proof contexts:
5363 instantiate <label>[<attrs>]: <loc>
5364 Instantiates locale <loc> and adds all its theorems to the current context
5365 taking into account their attributes. Label and attrs are optional
5366 modifiers, like in theorem declarations. If present, names of
5367 instantiated theorems are qualified with <label>, and the attributes
5368 <attrs> are applied after any attributes these theorems might have already.
5369 If the locale has assumptions, a chained fact of the form
5370 "<loc> t1 ... tn" is expected from which instantiations of the parameters
5371 are derived. The command does not support old-style locales declared
5372 with "locale (open)".
5373 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
5375 * HOL: Tactic emulation methods induct_tac and case_tac understand static
5381 * Proof import: new image HOL4 contains the imported library from
5382 the HOL4 system with about 2500 theorems. It is imported by
5383 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
5384 can be used like any other Isabelle image. See
5385 HOL/Import/HOL/README for more information.
5388 - Much improved handling of linear and partial orders.
5389 Reasoners for linear and partial orders are set up for type classes
5390 "linorder" and "order" respectively, and are added to the default simpset
5391 as solvers. This means that the simplifier can build transitivity chains
5392 to solve goals from the assumptions.
5393 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
5394 of blast or auto after simplification become unnecessary because the goal
5395 is solved by simplification already.
5397 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
5398 all proved in axiomatic type classes for semirings, rings and fields.
5401 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
5402 now formalized using the Ring_and_Field theory mentioned above.
5403 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
5404 than before, because now they are set up once in a generic manner.
5405 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
5406 Look for the general versions in Ring_and_Field (and Power if they concern
5409 * Type "rat" of the rational numbers is now available in HOL-Complex.
5412 - Record types are now by default printed with their type abbreviation
5413 instead of the list of all field types. This can be configured via
5414 the reference "print_record_type_abbr".
5415 - Simproc "record_upd_simproc" for simplification of multiple updates added
5416 (not enabled by default).
5417 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
5418 EX x. x = sel r to True (not enabled by default).
5419 - Tactic "record_split_simp_tac" to split and simplify records added.
5421 * 'specification' command added, allowing for definition by
5422 specification. There is also an 'ax_specification' command that
5423 introduces the new constants axiomatically.
5425 * arith(_tac) is now able to generate counterexamples for reals as well.
5427 * HOL-Algebra: new locale "ring" for non-commutative rings.
5429 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
5430 definitions, thanks to Sava Krsti\'{c} and John Matthews.
5432 * HOL-Matrix: a first theory for matrices in HOL with an application of
5433 matrix theory to linear programming.
5435 * Unions and Intersections:
5436 The latex output syntax of UN and INT has been changed
5437 from "\Union x \in A. B" to "\Union_{x \in A} B"
5438 i.e. the index formulae has become a subscript.
5439 Similarly for "\Union x. B", and for \Inter instead of \Union.
5441 * Unions and Intersections over Intervals:
5442 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
5443 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
5444 like in normal math, and corresponding versions for < and for intersection.
5446 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
5447 lexicographic dictonary ordering has been added as "lexord".
5449 * ML: the legacy theory structures Int and List have been removed. They had
5450 conflicted with ML Basis Library structures having the same names.
5452 * 'refute' command added to search for (finite) countermodels. Only works
5453 for a fragment of HOL. The installation of an external SAT solver is
5454 highly recommended. See "HOL/Refute.thy" for details.
5456 * 'quickcheck' command: Allows to find counterexamples by evaluating
5457 formulae under an assignment of free variables to random values.
5458 In contrast to 'refute', it can deal with inductive datatypes,
5459 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
5465 * Streams now come with concatenation and are part of the HOLCF image
5469 New in Isabelle2003 (May 2003)
5470 ------------------------------
5474 * Provers/simplifier:
5476 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
5477 Assumptions are now subject to complete mutual simplification,
5478 not just from left to right. The simplifier now preserves
5479 the order of assumptions.
5481 Potential INCOMPATIBILITY:
5483 -- simp sometimes diverges where the old version did
5484 not, e.g. invoking simp on the goal
5486 [| P (f x); y = x; f x = f y |] ==> Q
5488 now gives rise to the infinite reduction sequence
5490 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
5492 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
5495 -- Tactics combining classical reasoner and simplification (such as auto)
5496 are also affected by this change, because many of them rely on
5497 simp. They may sometimes diverge as well or yield a different numbers
5498 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
5499 in case of problems. Sometimes subsequent calls to the classical
5500 reasoner will fail because a preceeding call to the simplifier too
5501 eagerly simplified the goal, e.g. deleted redundant premises.
5503 - The simplifier trace now shows the names of the applied rewrite rules
5505 - You can limit the number of recursive invocations of the simplifier
5506 during conditional rewriting (where the simplifie tries to solve the
5507 conditions before applying the rewrite rule):
5508 ML "simp_depth_limit := n"
5509 where n is an integer. Thus you can force termination where previously
5510 the simplifier would diverge.
5512 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5514 - No longer aborts on failed congruence proof. Instead, the
5515 congruence is ignored.
5517 * Pure: New generic framework for extracting programs from constructive
5518 proofs. See HOL/Extraction.thy for an example instantiation, as well
5519 as HOL/Extraction for some case studies.
5521 * Pure: The main goal of the proof state is no longer shown by default, only
5522 the subgoals. This behaviour is controlled by a new flag.
5523 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5524 (ML: Proof.show_main_goal).
5526 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5527 rules whose conclusion matches subgoal 1:
5528 PG menu: Isabelle/Isar -> Show me -> matching rules
5529 The rules are ordered by how closely they match the subgoal.
5530 In particular, rules that solve a subgoal outright are displayed first
5531 (or rather last, the way they are printed).
5532 (ML: ProofGeneral.print_intros())
5534 * Pure: New flag trace_unify_fail causes unification to print
5535 diagnostic information (PG: in trace buffer) when it fails. This is
5536 useful for figuring out why single step proofs like rule, erule or
5539 * Pure: Locale specifications now produce predicate definitions
5540 according to the body of text (covering assumptions modulo local
5541 definitions); predicate "loc_axioms" covers newly introduced text,
5542 while "loc" is cumulative wrt. all included locale expressions; the
5543 latter view is presented only on export into the global theory
5544 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5545 on the old view without predicates;
5547 * Pure: predefined locales "var" and "struct" are useful for sharing
5548 parameters (as in CASL, for example); just specify something like
5549 ``var x + var y + struct M'' as import;
5551 * Pure: improved thms_containing: proper indexing of facts instead of
5552 raw theorems; check validity of results wrt. current name space;
5553 include local facts of proof configuration (also covers active
5554 locales), cover fixed variables in index; may use "_" in term
5555 specification; an optional limit for the number of printed facts may
5556 be given (the default is 40);
5558 * Pure: disallow duplicate fact bindings within new-style theory files
5561 * Provers: improved induct method: assumptions introduced by case
5562 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5563 the goal statement); "foo" still refers to all facts collectively;
5565 * Provers: the function blast.overloaded has been removed: all constants
5566 are regarded as potentially overloaded, which improves robustness in exchange
5567 for slight decrease in efficiency;
5569 * Provers/linorder: New generic prover for transitivity reasoning over
5570 linear orders. Note: this prover is not efficient!
5572 * Isar: preview of problems to finish 'show' now produce an error
5573 rather than just a warning (in interactive mode);
5580 - Produces a counter example if it cannot prove a goal.
5581 Note that the counter example may be spurious if the goal is not a formula
5582 of quantifier-free linear arithmetic.
5583 In ProofGeneral the counter example appears in the trace buffer.
5585 - Knows about div k and mod k where k is a numeral of type nat or int.
5587 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5588 linear arithmetic fails. This takes account of quantifiers and divisibility.
5589 Presburger arithmetic can also be called explicitly via presburger(_tac).
5591 * simp's arithmetic capabilities have been enhanced a bit: it now
5592 takes ~= in premises into account (by performing a case split);
5594 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5595 are distributed over a sum of terms;
5597 * New tactic "trans_tac" and method "trans" instantiate
5598 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5601 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5602 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5604 * 'typedef' command has new option "open" to suppress the set
5607 * functions Min and Max on finite sets have been introduced (theory
5610 * attribute [symmetric] now works for relations as well; it turns
5611 (x,y) : R^-1 into (y,x) : R, and vice versa;
5613 * induct over a !!-quantified statement (say !!x1..xn):
5614 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5616 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5617 %x. None. Warning: empty_def now refers to the previously hidden definition
5620 * Algebra: formalization of classical algebra. Intended as base for
5621 any algebraic development in Isabelle. Currently covers group theory
5622 (up to Sylow's theorem) and ring theory (Universal Property of
5623 Univariate Polynomials). Contributions welcome;
5625 * GroupTheory: deleted, since its material has been moved to Algebra;
5627 * Complex: new directory of the complex numbers with numeric constants,
5628 nonstandard complex numbers, and some complex analysis, standard and
5629 nonstandard (Jacques Fleuriot);
5631 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5633 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5636 * Real/HahnBanach: updated and adapted to locales;
5638 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5641 * UNITY: added the Meier-Sanders theory of progress sets;
5643 * MicroJava: bytecode verifier and lightweight bytecode verifier
5644 as abstract algorithms, instantiated to the JVM;
5646 * Bali: Java source language formalization. Type system, operational
5647 semantics, axiomatic semantics. Supported language features:
5648 classes, interfaces, objects,virtual methods, static methods,
5649 static/instance fields, arrays, access modifiers, definite
5650 assignment, exceptions.
5655 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5658 * Main ZF: virtually all theories converted to new-style format;
5663 * Pure: Tactic.prove provides sane interface for internal proofs;
5664 omits the infamous "standard" operation, so this is more appropriate
5665 than prove_goalw_cterm in many situations (e.g. in simprocs);
5667 * Pure: improved error reporting of simprocs;
5669 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5673 *** Document preparation ***
5675 * uses \par instead of \\ for line breaks in theory text. This may
5676 shift some page breaks in large documents. To get the old behaviour
5677 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5679 * minimized dependencies of isabelle.sty and isabellesym.sty on
5682 * \<euro> now needs package babel/greek instead of marvosym (which
5685 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5690 New in Isabelle2002 (March 2002)
5691 --------------------------------
5693 *** Document preparation ***
5695 * greatly simplified document preparation setup, including more
5696 graceful interpretation of isatool usedir -i/-d/-D options, and more
5697 instructive isatool mkdir; users should basically be able to get
5698 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5699 users may run a separate document processing stage manually like this:
5700 "isatool usedir -D output HOL Test && isatool document Test/output";
5702 * theory dependency graph may now be incorporated into documents;
5703 isatool usedir -g true will produce session_graph.eps/.pdf for use
5704 with \includegraphics of LaTeX;
5706 * proper spacing of consecutive markup elements, especially text
5707 blocks after section headings;
5709 * support bold style (for single symbols only), input syntax is like
5710 this: "\<^bold>\<alpha>" or "\<^bold>A";
5712 * \<bullet> is now output as bold \cdot by default, which looks much
5713 better in printed text;
5715 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5716 note that these symbols are currently unavailable in Proof General /
5717 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5719 * isatool latex no longer depends on changed TEXINPUTS, instead
5720 isatool document copies the Isabelle style files to the target
5726 * Pure/Provers: improved proof by cases and induction;
5727 - 'case' command admits impromptu naming of parameters (such as
5729 - 'induct' method divinates rule instantiation from the inductive
5730 claim; no longer requires excessive ?P bindings for proper
5731 instantiation of cases;
5732 - 'induct' method properly enumerates all possibilities of set/type
5733 rules; as a consequence facts may be also passed through *type*
5734 rules without further ado;
5735 - 'induct' method now derives symbolic cases from the *rulified*
5736 rule (before it used to rulify cases stemming from the internal
5737 atomized version); this means that the context of a non-atomic
5738 statement becomes is included in the hypothesis, avoiding the
5739 slightly cumbersome show "PROP ?case" form;
5740 - 'induct' may now use elim-style induction rules without chaining
5741 facts, using ``missing'' premises from the goal state; this allows
5742 rules stemming from inductive sets to be applied in unstructured
5743 scripts, while still benefitting from proper handling of non-atomic
5744 statements; NB: major inductive premises need to be put first, all
5745 the rest of the goal is passed through the induction;
5746 - 'induct' proper support for mutual induction involving non-atomic
5747 rule statements (uses the new concept of simultaneous goals, see
5749 - append all possible rule selections, but only use the first
5750 success (no backtracking);
5751 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5752 - undeclared rule case names default to numbers 1, 2, 3, ...;
5753 - added 'print_induct_rules' (covered by help item in recent Proof
5755 - moved induct/cases attributes to Pure, methods to Provers;
5756 - generic method setup instantiated for FOL and HOL;
5758 * Pure: support multiple simultaneous goal statements, for example
5759 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5760 meta-level mechanism, this acts as if several individual goals had
5761 been stated separately; in particular common proof methods need to be
5762 repeated in order to cover all claims; note that a single elimination
5763 step is *not* sufficient to establish the two conjunctions, so this
5766 assume "A & B" then have A and B .. (*".." fails*)
5768 better use "obtain" in situations as above; alternative refer to
5769 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5771 * Pure: proper integration with ``locales''; unlike the original
5772 version by Florian Kammller, Isar locales package high-level proof
5773 contexts rather than raw logical ones (e.g. we admit to include
5774 attributes everywhere); operations on locales include merge and
5775 rename; support for implicit arguments (``structures''); simultaneous
5776 type-inference over imports and text; see also HOL/ex/Locales.thy for
5779 * Pure: the following commands have been ``localized'', supporting a
5780 target locale specification "(in name)": 'lemma', 'theorem',
5781 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5782 stored both within the locale and at the theory level (exported and
5783 qualified by the locale name);
5785 * Pure: theory goals may now be specified in ``long'' form, with
5786 ad-hoc contexts consisting of arbitrary locale elements. for example
5787 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5788 definitions may be given, too); the result is a meta-level rule with
5789 the context elements being discharged in the obvious way;
5791 * Pure: new proof command 'using' allows to augment currently used
5792 facts after a goal statement ('using' is syntactically analogous to
5793 'apply', but acts on the goal's facts only); this allows chained facts
5794 to be separated into parts given before and after a claim, as in
5795 ``from a and b have C using d and e <proof>'';
5797 * Pure: renamed "antecedent" case to "rule_context";
5799 * Pure: new 'judgment' command records explicit information about the
5800 object-logic embedding (used by several tools internally); no longer
5801 use hard-wired "Trueprop";
5803 * Pure: added 'corollary' command;
5805 * Pure: fixed 'token_translation' command;
5807 * Pure: removed obsolete 'exported' attribute;
5809 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5810 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5811 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5813 * Pure: method 'atomize' presents local goal premises as object-level
5814 statements (atomic meta-level propositions); setup controlled via
5815 rewrite rules declarations of 'atomize' attribute; example
5816 application: 'induct' method with proper rule statements in improper
5819 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5820 now consider the syntactic context of assumptions, giving a better
5821 chance to get type-inference of the arguments right (this is
5822 especially important for locales);
5824 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5827 * Pure/obtain: the formal conclusion "thesis", being marked as
5828 ``internal'', may no longer be reference directly in the text;
5829 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5832 * Pure: generic 'sym' attribute which declares a rule both as pure
5833 'elim?' and for the 'symmetric' operation;
5835 * Pure: marginal comments ``--'' may now occur just anywhere in the
5836 text; the fixed correlation with particular command syntax has been
5839 * Pure: new method 'rules' is particularly well-suited for proof
5840 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5841 but often produces more compact proof terms with less detours;
5843 * Pure/Provers/classical: simplified integration with pure rule
5844 attributes and methods; the classical "intro?/elim?/dest?"
5845 declarations coincide with the pure ones; the "rule" method no longer
5846 includes classically swapped intros; "intro" and "elim" methods no
5847 longer pick rules from the context; also got rid of ML declarations
5848 AddXIs/AddXEs/AddXDs; all of this has some potential for
5851 * Provers/classical: attribute 'swapped' produces classical inversions
5852 of introduction rules;
5854 * Provers/simplifier: 'simplified' attribute may refer to explicit
5855 rules instead of full simplifier context; 'iff' attribute handles
5858 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5860 * HOL: 'recdef' now fails on unfinished automated proofs, use
5861 "(permissive)" option to recover old behavior;
5863 * HOL: 'inductive' no longer features separate (collective) attributes
5864 for 'intros' (was found too confusing);
5866 * HOL: properly declared induction rules less_induct and
5872 * HOL: moved over to sane numeral syntax; the new policy is as
5875 - 0 and 1 are polymorphic constants, which are defined on any
5876 numeric type (nat, int, real etc.);
5878 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5879 binary representation internally;
5881 - type nat has special constructor Suc, and generally prefers Suc 0
5882 over 1::nat and Suc (Suc 0) over 2::nat;
5884 This change may cause significant problems of INCOMPATIBILITY; here
5885 are some hints on converting existing sources:
5887 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5888 entities, so expressions involving "-" (unary or binary minus) need
5889 to be spaced properly;
5891 - existing occurrences of "1" may need to be constraint "1::nat" or
5892 even replaced by Suc 0; similar for old "2";
5894 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5896 - remove all special provisions on numerals in proofs;
5898 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5899 representation (depends on bin_arith_simps in the default context);
5901 * HOL: symbolic syntax for x^2 (numeral 2);
5903 * HOL: the class of all HOL types is now called "type" rather than
5904 "term"; INCOMPATIBILITY, need to adapt references to this type class
5905 in axclass/classes, instance/arities, and (usually rare) occurrences
5906 in typings (of consts etc.); internally the class is called
5907 "HOL.type", ML programs should refer to HOLogic.typeS;
5909 * HOL/record package improvements:
5910 - new derived operations "fields" to build a partial record section,
5911 "extend" to promote a fixed record to a record scheme, and
5912 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5913 declared as simp by default;
5914 - shared operations ("more", "fields", etc.) now need to be always
5915 qualified) --- potential INCOMPATIBILITY;
5916 - removed "make_scheme" operations (use "make" with "extend") --
5918 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5919 - provides cases/induct rules for use with corresponding Isar
5920 methods (for concrete records, record schemes, concrete more
5921 parts, and schematic more parts -- in that order);
5922 - internal definitions directly based on a light-weight abstract
5923 theory of product types over typedef rather than datatype;
5925 * HOL: generic code generator for generating executable ML code from
5926 specifications; specific support for HOL constructs such as inductive
5927 datatypes and sets, as well as recursive functions; can be invoked
5928 via 'generate_code' theory section;
5930 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5932 * HOL: consolidated and renamed several theories. In particular:
5933 Ord.thy has been absorbed into HOL.thy
5934 String.thy has been absorbed into List.thy
5936 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5937 (beware of argument permutation!);
5939 * HOL: linorder_less_split superseded by linorder_cases;
5941 * HOL/List: "nodups" renamed to "distinct";
5943 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5944 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5945 - Ex_def has changed, now need to use some_eq_ex
5947 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5948 in this (rare) case use:
5950 delSWrapper "split_all_tac"
5951 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5953 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5956 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5957 Isabelle's type classes, ^ on functions and relations has too general
5958 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5959 necessary to attach explicit type constraints;
5961 * HOL/Relation: the prefix name of the infix "O" has been changed from
5962 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5963 renamed accordingly (eg "compI" -> "rel_compI").
5965 * HOL: syntax translations now work properly with numerals and records
5968 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5969 of "lam" -- INCOMPATIBILITY;
5971 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5972 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5973 renamed "Product_Type.unit";
5975 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5977 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5978 the "cases" method);
5980 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5983 * HOL/IMP: updated and converted to new-style theory format; several
5984 parts turned into readable document, with proper Isar proof texts and
5985 some explanations (by Gerwin Klein);
5987 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5989 * HOL-Hyperreal is now a logic image;
5994 * Isar: consts/constdefs supports mixfix syntax for continuous
5997 * Isar: domain package adapted to new-style theory format, e.g. see
6000 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
6001 potential INCOMPATIBILITY; now use plain induct_tac instead of former
6002 lift.induct_tac, always use UU instead of Undef;
6004 * HOLCF/IMP: updated and converted to new-style theory;
6009 * Isar: proper integration of logic-specific tools and packages,
6010 including theory commands '(co)inductive', '(co)datatype',
6011 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
6012 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
6014 * theory Main no longer includes AC; for the Axiom of Choice, base
6015 your theory on Main_ZFC;
6017 * the integer library now covers quotients and remainders, with many
6018 laws relating division to addition, multiplication, etc.;
6020 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
6021 typeless version of the formalism;
6023 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
6026 * ZF/Induct: new directory for examples of inductive definitions,
6027 including theory Multiset for multiset orderings; converted to
6028 new-style theory format;
6030 * ZF: many new theorems about lists, ordinals, etc.;
6035 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
6036 variable proof controls level of detail: 0 = no proofs (only oracle
6037 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
6038 also ref manual for further ML interfaces;
6040 * Pure/axclass: removed obsolete ML interface
6041 goal_subclass/goal_arity;
6043 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
6044 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
6045 separate tokens, so expressions involving minus need to be spaced
6048 * Pure/syntax: support non-oriented infixes, using keyword "infix"
6049 rather than "infixl" or "infixr";
6051 * Pure/syntax: concrete syntax for dummy type variables admits genuine
6052 sort constraint specifications in type inference; e.g. "x::_::foo"
6053 ensures that the type of "x" is of sort "foo" (but not necessarily a
6056 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
6057 control output of nested => (types); the default behavior is
6060 * Pure/syntax: builtin parse translation for "_constify" turns valued
6061 tokens into AST constants;
6063 * Pure/syntax: prefer later declarations of translations and print
6064 translation functions; potential INCOMPATIBILITY: need to reverse
6065 multiple declarations for same syntax element constant;
6067 * Pure/show_hyps reset by default (in accordance to existing Isar
6070 * Provers/classical: renamed addaltern to addafter, addSaltern to
6073 * Provers/clasimp: ``iff'' declarations now handle conditional rules
6076 * system: tested support for MacOS X; should be able to get Isabelle +
6077 Proof General to work in a plain Terminal after installing Poly/ML
6078 (e.g. from the Isabelle distribution area) and GNU bash alone
6079 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
6080 support requires further installations, e.g. from
6081 http://fink.sourceforge.net/);
6083 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
6085 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
6086 of 40 MB), cf. ML_OPTIONS;
6088 * system: Proof General keywords specification is now part of the
6089 Isabelle distribution (see etc/isar-keywords.el);
6091 * system: support for persistent Proof General sessions (refrain from
6092 outdating all loaded theories on startup); user may create writable
6093 logic images like this: ``isabelle -q HOL Test'';
6095 * system: smart selection of Isabelle process versus Isabelle
6096 interface, accommodates case-insensitive file systems (e.g. HFS+); may
6097 run both "isabelle" and "Isabelle" even if file names are badly
6098 damaged (executable inspects the case of the first letter of its own
6099 name); added separate "isabelle-process" and "isabelle-interface";
6101 * system: refrain from any attempt at filtering input streams; no
6102 longer support ``8bit'' encoding of old isabelle font, instead proper
6103 iso-latin characters may now be used; the related isatools
6104 "symbolinput" and "nonascii" have disappeared as well;
6106 * system: removed old "xterm" interface (the print modes "xterm" and
6107 "xterm_color" are still available for direct use in a suitable
6112 New in Isabelle99-2 (February 2001)
6113 -----------------------------------
6115 *** Overview of INCOMPATIBILITIES ***
6117 * HOL: please note that theories in the Library and elsewhere often use the
6118 new-style (Isar) format; to refer to their theorems in an ML script you must
6119 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
6121 * HOL: inductive package no longer splits induction rule aggressively,
6122 but only as far as specified by the introductions given; the old
6123 format may be recovered via ML function complete_split_rule or attribute
6124 'split_rule (complete)';
6126 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
6127 gfp_Tarski to gfp_unfold;
6129 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
6131 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
6132 relation); infix "^^" has been renamed "``"; infix "``" has been
6133 renamed "`"; "univalent" has been renamed "single_valued";
6135 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
6138 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
6140 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
6142 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
6143 consequence, it is no longer monotonic wrt. the local goal context
6144 (which is now passed through the inductive cases);
6146 * Document preparation: renamed standard symbols \<ll> to \<lless> and
6147 \<gg> to \<ggreater>;
6150 *** Document preparation ***
6152 * \isabellestyle{NAME} selects version of Isabelle output (currently
6153 available: are "it" for near math-mode best-style output, "sl" for
6154 slanted text style, and "tt" for plain type-writer; if no
6155 \isabellestyle command is given, output is according to slanted
6158 * support sub/super scripts (for single symbols only), input syntax is
6159 like this: "A\<^sup>*" or "A\<^sup>\<star>";
6161 * some more standard symbols; see Appendix A of the system manual for
6162 the complete list of symbols defined in isabellesym.sty;
6164 * improved isabelle style files; more abstract symbol implementation
6165 (should now use \isamath{...} and \isatext{...} in custom symbol
6168 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
6169 state; Note that presentation of goal states does not conform to
6170 actual human-readable proof documents. Please do not include goal
6171 states into document output unless you really know what you are doing!
6173 * proper indentation of antiquoted output with proportional LaTeX
6176 * no_document ML operator temporarily disables LaTeX document
6179 * isatool unsymbolize tunes sources for plain ASCII communication;
6184 * Pure: Isar now suffers initial goal statements to contain unbound
6185 schematic variables (this does not conform to actual readable proof
6186 documents, due to unpredictable outcome and non-compositional proof
6187 checking); users who know what they are doing may use schematic goals
6188 for Prolog-style synthesis of proven results;
6190 * Pure: assumption method (an implicit finishing) now handles actual
6193 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
6194 initial goal, declare "that" only as Pure intro (only for single
6195 steps); the "that" rule assumption may now be involved in implicit
6196 finishing, thus ".." becomes a feasible for trivial obtains;
6198 * Pure: default proof step now includes 'intro_classes'; thus trivial
6199 instance proofs may be performed by "..";
6201 * Pure: ?thesis / ?this / "..." now work for pure meta-level
6204 * Pure: more robust selection of calculational rules;
6206 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
6207 rule (as well as the assumption rule);
6209 * Pure: 'thm_deps' command visualizes dependencies of theorems and
6210 lemmas, using the graph browser tool;
6212 * Pure: predict failure of "show" in interactive mode;
6214 * Pure: 'thms_containing' now takes actual terms as arguments;
6216 * HOL: improved method 'induct' --- now handles non-atomic goals
6217 (potential INCOMPATIBILITY); tuned error handling;
6219 * HOL: cases and induct rules now provide explicit hints about the
6220 number of facts to be consumed (0 for "type" and 1 for "set" rules);
6221 any remaining facts are inserted into the goal verbatim;
6223 * HOL: local contexts (aka cases) may now contain term bindings as
6224 well; the 'cases' and 'induct' methods new provide a ?case binding for
6225 the result to be shown in each case;
6227 * HOL: added 'recdef_tc' command;
6229 * isatool convert assists in eliminating legacy ML scripts;
6234 * HOL/Library: a collection of generic theories to be used together
6235 with main HOL; the theory loader path already includes this directory
6236 by default; the following existing theories have been moved here:
6237 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
6238 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
6240 * HOL/Unix: "Some aspects of Unix file-system security", a typical
6241 modelling and verification task performed in Isabelle/HOL +
6242 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
6244 * HOL/Algebra: special summation operator SUM no longer exists, it has
6245 been replaced by setsum; infix 'assoc' now has priority 50 (like
6246 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
6247 'domain', this makes the theory consistent with mathematical
6250 * HOL basics: added overloaded operations "inverse" and "divide"
6251 (infix "/"), syntax for generic "abs" operation, generic summation
6254 * HOL/typedef: simplified package, provide more useful rules (see also
6257 * HOL/datatype: induction rule for arbitrarily branching datatypes is
6258 now expressed as a proper nested rule (old-style tactic scripts may
6259 require atomize_strip_tac to cope with non-atomic premises);
6261 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
6262 to "split_conv" (old name still available for compatibility);
6264 * HOL: improved concrete syntax for strings (e.g. allows translation
6265 rules with string literals);
6267 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
6268 and Fleuriot's mechanization of analysis, including the transcendental
6269 functions for the reals;
6271 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
6276 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
6277 "lam" is displayed as TWO lambda-symbols
6279 * CTT: theory Main now available, containing everything (that is, Bool
6285 * Pure: the Simplifier has been implemented properly as a derived rule
6286 outside of the actual kernel (at last!); the overall performance
6287 penalty in practical applications is about 50%, while reliability of
6288 the Isabelle inference kernel has been greatly improved;
6290 * print modes "brackets" and "no_brackets" control output of nested =>
6291 (types) and ==> (props); the default behaviour is "brackets";
6293 * Provers: fast_tac (and friends) now handle actual object-logic rules
6294 as assumptions as well;
6296 * system: support Poly/ML 4.0;
6298 * system: isatool install handles KDE version 1 or 2;
6302 New in Isabelle99-1 (October 2000)
6303 ----------------------------------
6305 *** Overview of INCOMPATIBILITIES ***
6307 * HOL: simplification of natural numbers is much changed; to partly
6308 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
6309 issue the following ML commands:
6311 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
6312 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
6314 * HOL: simplification no longer dives into case-expressions; this is
6315 controlled by "t.weak_case_cong" for each datatype t;
6317 * HOL: nat_less_induct renamed to less_induct;
6319 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
6320 fixsome to patch .thy and .ML sources automatically;
6322 select_equality -> some_equality
6323 select_eq_Ex -> some_eq_ex
6324 selectI2EX -> someI2_ex
6327 select1_equality -> some1_equality
6328 Eps_sym_eq -> some_sym_eq_trivial
6329 Eps_eq -> some_eq_trivial
6331 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
6333 * HOL: removed obsolete theorem binding expand_if (refer to split_if
6336 * HOL: the recursion equations generated by 'recdef' are now called
6337 f.simps instead of f.rules;
6339 * HOL: qed_spec_mp now also handles bounded ALL as well;
6341 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
6342 sometimes be needed;
6344 * HOL: the constant for "f``x" is now "image" rather than "op ``";
6346 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
6348 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
6349 product is now "<*>" instead of "Times"; the lexicographic product is
6350 now "<*lex*>" instead of "**";
6352 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
6353 of main HOL, but was unused); better use HOL's datatype package;
6355 * HOL: removed "symbols" syntax for constant "override" of theory Map;
6356 the old syntax may be recovered as follows:
6359 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
6360 (infixl "\\<oplus>" 100)
6362 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6364 * HOL/ML: even fewer consts are declared as global (see theories Ord,
6365 Lfp, Gfp, WF); this only affects ML packages that refer to const names
6368 * HOL and ZF: syntax for quotienting wrt an equivalence relation
6369 changed from A/r to A//r;
6371 * ZF: new treatment of arithmetic (nat & int) may break some old
6374 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
6375 rulify -> rule_format, elimify -> elim_format, ...);
6377 * Isar/Provers: intro/elim/dest attributes changed; renamed
6378 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
6379 should have to change intro!! to intro? only); replaced "delrule" by
6382 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
6384 * Provers: strengthened force_tac by using new first_best_tac;
6386 * LaTeX document preparation: several changes of isabelle.sty (see
6390 *** Document preparation ***
6392 * formal comments (text blocks etc.) in new-style theories may now
6393 contain antiquotations of thm/prop/term/typ/text to be presented
6394 according to latex print mode; concrete syntax is like this:
6395 @{term[show_types] "f(x) = a + x"};
6397 * isatool mkdir provides easy setup of Isabelle session directories,
6398 including proper document sources;
6400 * generated LaTeX sources are now deleted after successful run
6401 (isatool document -c); may retain a copy somewhere else via -D option
6404 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
6405 style files, achieving self-contained LaTeX sources and simplifying
6408 * old-style theories now produce (crude) LaTeX output as well;
6410 * browser info session directories are now self-contained (may be put
6411 on WWW server seperately); improved graphs of nested sessions; removed
6412 graph for 'all sessions';
6414 * several improvements in isabelle style files; \isabellestyle{it}
6415 produces fake math mode output; \isamarkupheader is now \section by
6416 default; see lib/texinputs/isabelle.sty etc.;
6421 * Isar/Pure: local results and corresponding term bindings are now
6422 subject to Hindley-Milner polymorphism (similar to ML); this
6423 accommodates incremental type-inference very nicely;
6425 * Isar/Pure: new derived language element 'obtain' supports
6426 generalized existence reasoning;
6428 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
6429 support accumulation of results, without applying any rules yet;
6430 useful to collect intermediate results without explicit name
6431 references, and for use with transitivity rules with more than 2
6434 * Isar/Pure: scalable support for case-analysis type proofs: new
6435 'case' language element refers to local contexts symbolically, as
6436 produced by certain proof methods; internally, case names are attached
6437 to theorems as "tags";
6439 * Isar/Pure: theory command 'hide' removes declarations from
6440 class/type/const name spaces;
6442 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
6443 indicate potential overloading;
6445 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
6447 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
6448 "{a,b,c}" instead of {a,b,c};
6450 * Isar/Pure now provides its own version of intro/elim/dest
6451 attributes; useful for building new logics, but beware of confusion
6452 with the version in Provers/classical;
6454 * Isar/Pure: the local context of (non-atomic) goals is provided via
6455 case name 'antecedent';
6457 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
6458 to the current context is now done automatically);
6460 * Isar/Pure: theory command 'method_setup' provides a simple interface
6461 for definining proof methods in ML;
6463 * Isar/Provers: intro/elim/dest attributes changed; renamed
6464 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
6465 most cases, one should have to change intro!! to intro? only);
6466 replaced "delrule" by "rule del";
6468 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
6469 'symmetric' attribute (the latter supercedes [RS sym]);
6471 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
6472 method modifier); 'simp' method: 'only:' modifier removes loopers as
6473 well (including splits);
6475 * Isar/Provers: Simplifier and Classical methods now support all kind
6476 of modifiers used in the past, including 'cong', 'iff', etc.
6478 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
6479 of Simplifier and Classical reasoner);
6481 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
6482 now support named cases; major packages (inductive, datatype, primrec,
6483 recdef) support case names and properly name parameters;
6485 * Isar/HOL: new transitivity rules for substitution in inequalities --
6486 monotonicity conditions are extracted to be proven at end of
6489 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
6492 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
6493 split_if split_if_asm; datatype package provides theorems foo.splits =
6494 foo.split foo.split_asm for each datatype;
6496 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
6497 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
6498 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
6499 use "(cases (simplified))" method in proper proof texts);
6501 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
6503 * Isar: names of theorems etc. may be natural numbers as well;
6505 * Isar: 'pr' command: optional arguments for goals_limit and
6506 ProofContext.prems_limit; no longer prints theory contexts, but only
6509 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6510 additional print modes to be specified; e.g. "pr(latex)" will print
6511 proof state according to the Isabelle LaTeX style;
6513 * Isar: improved support for emulating tactic scripts, including proof
6514 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6515 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6516 (for HOL datatypes);
6518 * Isar: simplified (more robust) goal selection of proof methods: 1st
6519 goal, all goals, or explicit goal specifier (tactic emulation); thus
6520 'proof method scripts' have to be in depth-first order;
6522 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6524 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6525 should instead use individual commands for printing items
6526 (print_commands, print_methods etc.);
6528 * Isar: added 'nothing' --- the empty list of theorems;
6533 * HOL/MicroJava: formalization of a fragment of Java, together with a
6534 corresponding virtual machine and a specification of its bytecode
6535 verifier and a lightweight bytecode verifier, including proofs of
6536 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6537 Cornelia Pusch (see also the homepage of project Bali at
6538 http://isabelle.in.tum.de/Bali/);
6540 * HOL/Algebra: new theory of rings and univariate polynomials, by
6543 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6544 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6547 * HOL/Lattice: fundamental concepts of lattice theory and order
6548 structures, including duals, properties of bounds versus algebraic
6549 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6550 Theorem for complete lattices etc.; may also serve as a demonstration
6551 for abstract algebraic reasoning using axiomatic type classes, and
6552 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6554 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6557 * HOL/IMPP: extension of IMP with local variables and mutually
6558 recursive procedures, by David von Oheimb;
6560 * HOL/Lambda: converted into new-style theory and document;
6562 * HOL/ex/Multiquote: example of multiple nested quotations and
6563 anti-quotations -- basically a generalized version of de-Bruijn
6564 representation; very useful in avoiding lifting of operations;
6566 * HOL/record: added general record equality rule to simpset; fixed
6567 select-update simplification procedure to handle extended records as
6568 well; admit "r" as field name;
6570 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6571 other numeric types and also as the identity of groups, rings, etc.;
6573 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6574 Types nat and int belong to this axclass;
6576 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6577 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6578 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6579 two terms #m*u and #n*u are replaced by #(m+n)*u
6580 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6581 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6582 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6584 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6585 powerful prover for predicate logic but knows nothing of clasets; see
6586 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6588 * HOL: new version of "case_tac" subsumes both boolean case split and
6589 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6590 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6592 * HOL: simplification no longer dives into case-expressions: only the
6593 selector expression is simplified, but not the remaining arms; to
6594 enable full simplification of case-expressions for datatype t, you may
6595 remove t.weak_case_cong from the simpset, either globally (Delcongs
6596 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6598 * HOL/recdef: the recursion equations generated by 'recdef' for
6599 function 'f' are now called f.simps instead of f.rules; if all
6600 termination conditions are proved automatically, these simplification
6601 rules are added to the simpset, as in primrec; rules may be named
6602 individually as well, resulting in a separate list of theorems for
6605 * HOL/While is a new theory that provides a while-combinator. It
6606 permits the definition of tail-recursive functions without the
6607 provision of a termination measure. The latter is necessary once the
6608 invariant proof rule for while is applied.
6610 * HOL: new (overloaded) notation for the set of elements below/above
6611 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6613 * HOL: theorems impI, allI, ballI bound as "strip";
6615 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6616 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6617 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6619 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6621 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6622 main HOL, but was unused);
6624 * HOL: fewer consts declared as global (e.g. have to refer to
6625 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6627 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6628 in case of overlap with user translations (e.g. judgements over
6629 tuples); (note that the underlying logical represenation is still
6635 * ZF: simplification automatically cancels common terms in arithmetic
6636 expressions over nat and int;
6638 * ZF: new treatment of nat to minimize type-checking: all operators
6639 coerce their operands to a natural number using the function natify,
6640 making the algebraic laws unconditional;
6642 * ZF: as above, for int: operators coerce their operands to an integer
6643 using the function intify;
6645 * ZF: the integer library now contains many of the usual laws for the
6646 orderings, including $<=, and monotonicity laws for $+ and $*;
6648 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6651 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6652 to the simplifier and classical reasoner simultaneously;
6657 * Provers: blast_tac now handles actual object-logic rules as
6658 assumptions; note that auto_tac uses blast_tac internally as well;
6660 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6661 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6663 * Provers: delrules now handles destruct rules as well (no longer need
6664 explicit make_elim);
6666 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6667 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6668 use instead the strong form,
6669 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6670 in HOL, FOL and ZF the function cla_make_elim will create such rules
6671 from destruct-rules;
6673 * Provers: Simplifier.easy_setup provides a fast path to basic
6674 Simplifier setup for new object-logics;
6676 * Pure: AST translation rules no longer require constant head on LHS;
6678 * Pure: improved name spaces: ambiguous output is qualified; support
6679 for hiding of names;
6681 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6682 XSYMBOL_HOME; no longer need to do manual configuration in most
6685 * system: compression of ML heaps images may now be controlled via -c
6686 option of isabelle and isatool usedir (currently only observed by
6689 * system: isatool installfonts may handle X-Symbol fonts as well (very
6690 useful for remote X11);
6692 * system: provide TAGS file for Isabelle sources;
6694 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6697 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6698 timing flag supersedes proof_timing and Toplevel.trace;
6700 * ML: new combinators |>> and |>>> for incremental transformations
6701 with secondary results (e.g. certain theory extensions):
6703 * ML: PureThy.add_defs gets additional argument to indicate potential
6704 overloading (usually false);
6706 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6711 New in Isabelle99 (October 1999)
6712 --------------------------------
6714 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6716 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6717 are no longer simplified. (This allows the simplifier to unfold recursive
6718 functional programs.) To restore the old behaviour, declare
6720 Delcongs [if_weak_cong];
6722 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6725 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6727 * HOL/datatype: mutual_induct_tac no longer exists --
6728 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6730 * HOL/typedef: fixed type inference for representing set; type
6731 arguments now have to occur explicitly on the rhs as type constraints;
6733 * ZF: The con_defs part of an inductive definition may no longer refer
6734 to constants declared in the same theory;
6736 * HOL, ZF: the function mk_cases, generated by the inductive
6737 definition package, has lost an argument. To simplify its result, it
6738 uses the default simpset instead of a supplied list of theorems.
6740 * HOL/List: the constructors of type list are now Nil and Cons;
6742 * Simplifier: the type of the infix ML functions
6743 setSSolver addSSolver setSolver addSolver
6744 is now simpset * solver -> simpset where `solver' is a new abstract type
6745 for packaging solvers. A solver is created via
6746 mk_solver: string -> (thm list -> int -> tactic) -> solver
6747 where the string argument is only a comment.
6752 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6753 decision procedure for linear arithmetic. Currently it is used for
6754 types `nat', `int', and `real' in HOL (see below); it can, should and
6755 will be instantiated for other types and logics as well.
6757 * The simplifier now accepts rewrite rules with flexible heads, eg
6758 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6759 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6765 * New Isabelle/Isar subsystem provides an alternative to traditional
6766 tactical theorem proving; together with the ProofGeneral/isar user
6767 interface it offers an interactive environment for developing human
6768 readable proof documents (Isar == Intelligible semi-automated
6769 reasoning); for further information see isatool doc isar-ref,
6770 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6772 * improved and simplified presentation of theories: better HTML markup
6773 (including colors), graph views in several sizes; isatool usedir now
6774 provides a proper interface for user theories (via -P option); actual
6775 document preparation based on (PDF)LaTeX is available as well (for
6776 new-style theories only); see isatool doc system for more information;
6778 * native support for Proof General, both for classic Isabelle and
6781 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6782 using the graph browser tool;
6784 * Isabelle manuals now also available as PDF;
6786 * theory loader rewritten from scratch (may not be fully
6787 bug-compatible); old loadpath variable has been replaced by show_path,
6788 add_path, del_path, reset_path functions; new operations such as
6789 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6792 * improved isatool install: option -k creates KDE application icon,
6793 option -p DIR installs standalone binaries;
6795 * added ML_PLATFORM setting (useful for cross-platform installations);
6796 more robust handling of platform specific ML images for SML/NJ;
6798 * the settings environment is now statically scoped, i.e. it is never
6799 created again in sub-processes invoked from isabelle, isatool, or
6802 * path element specification '~~' refers to '$ISABELLE_HOME';
6804 * in locales, the "assumes" and "defines" parts may be omitted if
6807 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6810 * new print_mode "HTML";
6812 * new flag show_tags controls display of tags of theorems (which are
6813 basically just comments that may be attached by some tools);
6815 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6816 mode and goal output format:
6818 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6820 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6822 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6823 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6825 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6827 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6829 * function bind_thms stores lists of theorems (cf. bind_thm);
6831 * new shorthand tactics ftac, eatac, datac, fatac;
6833 * qed (and friends) now accept "" as result name; in that case the
6834 theorem is not stored, but proper checks and presentation of the
6837 * theorem database now also indexes constants "Trueprop", "all",
6838 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6843 ** HOL arithmetic **
6845 * There are now decision procedures for linear arithmetic over nat and
6848 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6849 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6850 are treated as atomic; subformulae not involving type `nat' or `int'
6851 are ignored; quantified subformulae are ignored unless they are
6852 positive universal or negative existential. The tactic has to be
6853 invoked by hand and can be a little bit slow. In particular, the
6854 running time is exponential in the number of occurrences of `min' and
6855 `max', and `-' on `nat'.
6857 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6858 (negated) (in)equalities among the premises and the conclusion into
6859 account (i.e. no compound formulae) and does not know about `min' and
6860 `max', and `-' on `nat'. It is fast and is used automatically by the
6863 NB: At the moment, these decision procedures do not cope with mixed
6864 nat/int formulae where the two parts interact, such as `m < n ==>
6867 * HOL/Numeral provides a generic theory of numerals (encoded
6868 efficiently as bit strings); setup for types nat/int/real is in place;
6869 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6870 int, existing theories and proof scripts may require a few additional
6873 * integer division and remainder can now be performed on constant
6876 * many properties of integer multiplication, division and remainder
6879 * An interface to the Stanford Validity Checker (SVC) is available through the
6880 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6881 are proved automatically. SVC must be installed separately, and its results
6882 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6883 invocation of the underlying oracle). For SVC see
6884 http://verify.stanford.edu/SVC
6886 * IsaMakefile: the HOL-Real target now builds an actual image;
6891 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6892 (in Isabelle/Isar) -- by Gertrud Bauer;
6894 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6895 analysis for assembly languages with subtypes;
6897 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6898 -- avoids syntactic ambiguities and treats state, transition, and
6899 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6900 changed syntax and (many) tactics;
6902 * HOL/inductive: Now also handles more general introduction rules such
6903 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6904 theorems are now maintained within the theory (maintained via the
6907 * HOL/datatype: Now also handles arbitrarily branching datatypes
6908 (using function types) such as
6910 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6912 * HOL/record: record_simproc (part of the default simpset) takes care
6913 of selectors applied to updated records; record_split_tac is no longer
6914 part of the default claset; update_defs may now be removed from the
6915 simpset in many cases; COMPATIBILITY: old behavior achieved by
6917 claset_ref () := claset() addSWrapper record_split_wrapper;
6918 Delsimprocs [record_simproc]
6920 * HOL/typedef: fixed type inference for representing set; type
6921 arguments now have to occur explicitly on the rhs as type constraints;
6923 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6924 names rather than an ML expression;
6926 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6927 supplied later. Program schemes can be defined, such as
6928 "While B C s = (if B s then While B C (C s) else s)"
6929 where the well-founded relation can be chosen after B and C have been given.
6931 * HOL/List: the constructors of type list are now Nil and Cons;
6932 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6933 course, ML tools referring to List.list.op # etc. have to be adapted;
6935 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6936 disabled by default; run isabelle with option -m HOL to get back to
6937 the original Gordon/HOL-style output;
6939 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6940 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6942 * HOL basic syntax simplified (more orthogonal): all variants of
6943 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6944 Eps operator is provided as well: "SOME x. P[x]";
6946 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6948 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6949 thus available for user theories;
6951 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6952 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6955 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6956 several times and then mp;
6961 * the notation <<...>> is now available as a notation for sequences of
6964 * the simplifier is now installed
6966 * the axiom system has been generalized (thanks to Soren Heilmann)
6968 * the classical reasoner now has a default rule database
6973 * new primrec section allows primitive recursive functions to be given
6974 directly (as in HOL) over datatypes and the natural numbers;
6976 * new tactics induct_tac and exhaust_tac for induction (or case
6977 analysis) over datatypes and the natural numbers;
6979 * the datatype declaration of type T now defines the recursor T_rec;
6981 * simplification automatically does freeness reasoning for datatype
6984 * automatic type-inference, with AddTCs command to insert new
6985 type-checking rules;
6987 * datatype introduction rules are now added as Safe Introduction rules
6990 * the syntax "if P then x else y" is now available in addition to
6994 *** Internal programming interfaces ***
6996 * tuned simplifier trace output; new flag debug_simp;
6998 * structures Vartab / Termtab (instances of TableFun) offer efficient
6999 tables indexed by indexname_ord / term_ord (compatible with aconv);
7001 * AxClass.axclass_tac lost the theory argument;
7003 * tuned current_goals_markers semantics: begin / end goal avoids
7004 printing empty lines;
7006 * removed prs and prs_fn hook, which was broken because it did not
7007 include \n in its semantics, forcing writeln to add one
7008 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
7009 string -> unit if you really want to output text without newline;
7011 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
7012 plain output, interface builders may have to enable 'isabelle_font'
7013 mode to get Isabelle font glyphs as before;
7015 * refined token_translation interface; INCOMPATIBILITY: output length
7016 now of type real instead of int;
7018 * theory loader actions may be traced via new ThyInfo.add_hook
7019 interface (see src/Pure/Thy/thy_info.ML); example application: keep
7020 your own database of information attached to *whole* theories -- as
7021 opposed to intra-theory data slots offered via TheoryDataFun;
7023 * proper handling of dangling sort hypotheses (at last!);
7024 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
7025 extra sort hypotheses that can be witnessed from the type signature;
7026 the force_strip_shyps flag is gone, any remaining shyps are simply
7027 left in the theorem (with a warning issued by strip_shyps_warning);
7031 New in Isabelle98-1 (October 1998)
7032 ----------------------------------
7034 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7036 * several changes of automated proof tools;
7038 * HOL: major changes to the inductive and datatype packages, including
7039 some minor incompatibilities of theory syntax;
7041 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
7044 * HOL: removed duplicate thms in Arith:
7045 less_imp_add_less should be replaced by trans_less_add1
7046 le_imp_add_le should be replaced by trans_le_add1
7048 * HOL: unary minus is now overloaded (new type constraints may be
7051 * HOL and ZF: unary minus for integers is now #- instead of #~. In
7052 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
7053 now taken as an integer constant.
7055 * Pure: ML function 'theory_of' renamed to 'theory';
7061 1. Asm_full_simp_tac is now more aggressive.
7062 1. It will sometimes reorient premises if that increases their power to
7064 2. It does no longer proceed strictly from left to right but may also
7065 rotate premises to achieve further simplification.
7066 For compatibility reasons there is now Asm_lr_simp_tac which is like the
7067 old Asm_full_simp_tac in that it does not rotate premises.
7068 2. The simplifier now knows a little bit about nat-arithmetic.
7070 * Classical reasoner: wrapper mechanism for the classical reasoner now
7071 allows for selected deletion of wrappers, by introduction of names for
7072 wrapper functionals. This implies that addbefore, addSbefore,
7073 addaltern, and addSaltern now take a pair (name, tactic) as argument,
7074 and that adding two tactics with the same name overwrites the first
7075 one (emitting a warning).
7076 type wrapper = (int -> tactic) -> (int -> tactic)
7077 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
7078 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
7079 delWrapper, delSWrapper: claset * string -> claset
7080 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
7082 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
7083 semantics; addbefore now affects only the unsafe part of step_tac
7084 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
7085 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
7088 * Classical reasoner: setwrapper to setWrapper and compwrapper to
7089 compWrapper; added safe wrapper (and access functions for it);
7091 * HOL/split_all_tac is now much faster and fails if there is nothing
7092 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
7093 and the names of the automatically generated variables have changed.
7094 split_all_tac has moved within claset() from unsafe wrappers to safe
7095 wrappers, which means that !!-bound variables are split much more
7096 aggressively, and safe_tac and clarify_tac now split such variables.
7097 If this splitting is not appropriate, use delSWrapper "split_all_tac".
7098 Note: the same holds for record_split_tac, which does the job of
7099 split_all_tac for record fields.
7101 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
7102 permanently to the default simpset using Addsplits just like
7103 Addsimps. They can be removed via Delsplits just like
7104 Delsimps. Lower-case versions are also available.
7106 * HOL/Simplifier: The rule split_if is now part of the default
7107 simpset. This means that the simplifier will eliminate all occurrences
7108 of if-then-else in the conclusion of a goal. To prevent this, you can
7109 either remove split_if completely from the default simpset by
7110 `Delsplits [split_if]' or remove it in a specific call of the
7111 simplifier using `... delsplits [split_if]'. You can also add/delete
7112 other case splitting rules to/from the default simpset: every datatype
7113 generates suitable rules `split_t_case' and `split_t_case_asm' (where
7114 t is the name of the datatype).
7116 * Classical reasoner / Simplifier combination: new force_tac (and
7117 derivatives Force_tac, force) combines rewriting and classical
7118 reasoning (and whatever other tools) similarly to auto_tac, but is
7119 aimed to solve the given subgoal completely.
7124 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
7125 and `goalw': the theory is no longer needed as an explicit argument -
7126 the current theory context is used; assumptions are no longer returned
7127 at the ML-level unless one of them starts with ==> or !!; it is
7128 recommended to convert to these new commands using isatool fixgoal
7129 (backup your sources first!);
7131 * new top-level commands 'thm' and 'thms' for retrieving theorems from
7132 the current theory context, and 'theory' to lookup stored theories;
7134 * new theory section 'locale' for declaring constants, assumptions and
7135 definitions that have local scope;
7137 * new theory section 'nonterminals' for purely syntactic types;
7139 * new theory section 'setup' for generic ML setup functions
7140 (e.g. package initialization);
7142 * the distribution now includes Isabelle icons: see
7143 lib/logo/isabelle-{small,tiny}.xpm;
7145 * isatool install - install binaries with absolute references to
7148 * isatool logo -- create instances of the Isabelle logo (as EPS);
7150 * print mode 'emacs' reserved for Isamode;
7152 * support multiple print (ast) translations per constant name;
7154 * theorems involving oracles are now printed with a suffixed [!];
7159 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
7161 * HOL/inductive package reorganized and improved: now supports mutual
7167 oddI "n : EVEN ==> Suc n : ODD"
7168 evenI "n : ODD ==> Suc n : EVEN"
7170 new theorem list "elims" contains an elimination rule for each of the
7171 recursive sets; inductive definitions now handle disjunctive premises
7172 correctly (also ZF);
7174 INCOMPATIBILITIES: requires Inductive as an ancestor; component
7175 "mutual_induct" no longer exists - the induction rule is always
7176 contained in "induct";
7179 * HOL/datatype package re-implemented and greatly improved: now
7180 supports mutually recursive datatypes such as
7183 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
7184 | SUM ('a aexp) ('a aexp)
7185 | DIFF ('a aexp) ('a aexp)
7188 'a bexp = LESS ('a aexp) ('a aexp)
7189 | AND ('a bexp) ('a bexp)
7190 | OR ('a bexp) ('a bexp)
7192 as well as indirectly recursive datatypes such as
7195 ('a, 'b) term = Var 'a
7196 | App 'b ((('a, 'b) term) list)
7198 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
7199 induction on mutually / indirectly recursive datatypes.
7201 Primrec equations are now stored in theory and can be accessed via
7202 <function_name>.simps.
7206 - Theories using datatypes must now have theory Datatype as an
7208 - The specific <typename>.induct_tac no longer exists - use the
7209 generic induct_tac instead.
7210 - natE has been renamed to nat.exhaust - use exhaust_tac
7211 instead of res_inst_tac ... natE. Note that the variable
7212 names in nat.exhaust differ from the names in natE, this
7213 may cause some "fragile" proofs to fail.
7214 - The theorems split_<typename>_case and split_<typename>_case_asm
7215 have been renamed to <typename>.split and <typename>.split_asm.
7216 - Since default sorts of type variables are now handled correctly,
7217 some datatype definitions may have to be annotated with explicit
7219 - Primrec definitions no longer require function name and type
7220 of recursive argument.
7222 Consider using isatool fixdatatype to adapt your theories and proof
7223 scripts to the new package (backup your sources first!).
7226 * HOL/record package: considerably improved implementation; now
7227 includes concrete syntax for record types, terms, updates; theorems
7228 for surjective pairing and splitting !!-bound record variables; proof
7229 support is as follows:
7231 1) standard conversions (selectors or updates applied to record
7232 constructor terms) are part of the standard simpset;
7234 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
7235 made part of standard simpset and claset via addIffs;
7237 3) a tactic for record field splitting (record_split_tac) is part of
7238 the standard claset (addSWrapper);
7240 To get a better idea about these rules you may retrieve them via
7241 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
7242 the name of your record type.
7244 The split tactic 3) conceptually simplifies by the following rule:
7246 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
7248 Thus any record variable that is bound by meta-all will automatically
7249 blow up into some record constructor term, consequently the
7250 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
7251 solve record problems automatically.
7254 * reorganized the main HOL image: HOL/Integ and String loaded by
7255 default; theory Main includes everything;
7257 * automatic simplification of integer sums and comparisons, using cancellation;
7259 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
7261 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
7263 * many new identities for unions, intersections, set difference, etc.;
7265 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
7266 called split_if, split_split, split_sum_case and split_nat_case (to go
7267 with add/delsplits);
7269 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
7270 (?x::unit) = (); this is made part of the default simpset, which COULD
7271 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
7272 'Delsimprocs [unit_eq_proc];' as last resort); also note that
7273 unit_abs_eta_conv is added in order to counter the effect of
7274 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
7277 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
7280 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
7281 It and 'sym RS equals0D' are now in the default claset, giving automatic
7282 disjointness reasoning but breaking a few old proofs.
7284 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
7285 to 'converse' from 'inverse' (for compatibility with ZF and some
7288 * HOL/recdef can now declare non-recursive functions, with {} supplied as
7289 the well-founded relation;
7291 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
7292 Compl A. The "Compl" syntax remains available as input syntax for this
7295 * HOL/Update: new theory of function updates:
7296 f(a:=b) == %x. if x=a then b else f x
7297 may also be iterated as in f(a:=b,c:=d,...);
7299 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
7302 - new function list_update written xs[i:=v] that updates the i-th
7303 list position. May also be iterated as in xs[i:=a,j:=b,...].
7304 - new function `upt' written [i..j(] which generates the list
7305 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
7306 bound write [i..j], which is a shorthand for [i..j+1(].
7307 - new lexicographic orderings and corresponding wellfoundedness theorems.
7310 - removed 'pred' (predecessor) function;
7311 - generalized some theorems about n-1;
7312 - many new laws about "div" and "mod";
7313 - new laws about greatest common divisors (see theory ex/Primes);
7315 * HOL/Relation: renamed the relational operator r^-1 "converse"
7316 instead of "inverse";
7318 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
7319 of the multiset ordering;
7321 * directory HOL/Real: a construction of the reals using Dedekind cuts
7322 (not included by default);
7324 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
7326 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
7327 programs, i.e. different program variables may have different types.
7329 * calling (stac rew i) now fails if "rew" has no effect on the goal
7330 [previously, this check worked only if the rewrite rule was unconditional]
7331 Now rew can involve either definitions or equalities (either == or =).
7336 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
7337 only the theorems proved on ZF.ML;
7339 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
7340 It and 'sym RS equals0D' are now in the default claset, giving automatic
7341 disjointness reasoning but breaking a few old proofs.
7343 * ZF/Update: new theory of function updates
7344 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
7345 may also be iterated as in f(a:=b,c:=d,...);
7347 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
7349 * calling (stac rew i) now fails if "rew" has no effect on the goal
7350 [previously, this check worked only if the rewrite rule was unconditional]
7351 Now rew can involve either definitions or equalities (either == or =).
7353 * case_tac provided for compatibility with HOL
7354 (like the old excluded_middle_tac, but with subgoals swapped)
7357 *** Internal programming interfaces ***
7359 * Pure: several new basic modules made available for general use, see
7360 also src/Pure/README;
7362 * improved the theory data mechanism to support encapsulation (data
7363 kind name replaced by private Object.kind, acting as authorization
7364 key); new type-safe user interface via functor TheoryDataFun; generic
7365 print_data function becomes basically useless;
7367 * removed global_names compatibility flag -- all theory declarations
7368 are qualified by default;
7370 * module Pure/Syntax now offers quote / antiquote translation
7371 functions (useful for Hoare logic etc. with implicit dependencies);
7372 see HOL/ex/Antiquote for an example use;
7374 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
7377 * new tactical CHANGED_GOAL for checking that a tactic modifies a
7380 * Display.print_goals function moved to Locale.print_goals;
7382 * standard print function for goals supports current_goals_markers
7383 variable for marking begin of proof, end of proof, start of goal; the
7384 default is ("", "", ""); setting current_goals_markers := ("<proof>",
7385 "</proof>", "<goal>") causes SGML like tagged proof state printing,
7390 New in Isabelle98 (January 1998)
7391 --------------------------------
7393 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7395 * changed lexical syntax of terms / types: dots made part of long
7396 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
7398 * simpset (and claset) reference variable replaced by functions
7399 simpset / simpset_ref;
7401 * no longer supports theory aliases (via merge) and non-trivial
7402 implicit merge of thms' signatures;
7404 * most internal names of constants changed due to qualified names;
7406 * changed Pure/Sequence interface (see Pure/seq.ML);
7409 *** General Changes ***
7411 * hierachically structured name spaces (for consts, types, axms, thms
7412 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
7413 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
7414 isatool fixdots ensures space after dots (e.g. "%x. x"); set
7415 long_names for fully qualified output names; NOTE: ML programs
7416 (special tactics, packages etc.) referring to internal names may have
7417 to be adapted to cope with fully qualified names; in case of severe
7418 backward campatibility problems try setting 'global_names' at compile
7419 time to have enrything declared within a flat name space; one may also
7420 fine tune name declarations in theories via the 'global' and 'local'
7423 * reimplemented the implicit simpset and claset using the new anytype
7424 data filed in signatures; references simpset:simpset ref etc. are
7425 replaced by functions simpset:unit->simpset and
7426 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
7427 to patch your ML files accordingly;
7429 * HTML output now includes theory graph data for display with Java
7430 applet or isatool browser; data generated automatically via isatool
7431 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
7433 * defs may now be conditional; improved rewrite_goals_tac to handle
7434 conditional equations;
7436 * defs now admits additional type arguments, using TYPE('a) syntax;
7438 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
7439 creates a new theory node; implicit merge of thms' signatures is
7440 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
7441 transfer:theory->thm->thm in (rare) cases;
7443 * improved handling of draft signatures / theories; draft thms (and
7444 ctyps, cterms) are automatically promoted to real ones;
7446 * slightly changed interfaces for oracles: admit many per theory, named
7447 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
7449 * print_goals: optional output of const types (set show_consts and
7452 * improved output of warnings (###) and errors (***);
7454 * subgoal_tac displays a warning if the new subgoal has type variables;
7456 * removed old README and Makefiles;
7458 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
7460 * removed obsolete init_pps and init_database;
7462 * deleted the obsolete tactical STATE, which was declared by
7463 fun STATE tacfun st = tacfun st st;
7465 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
7466 (which abbreviates $HOME);
7468 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
7469 use isatool fixseq to adapt your ML programs (this works for fully
7470 qualified references to the Sequence structure only!);
7472 * use_thy no longer requires writable current directory; it always
7473 reloads .ML *and* .thy file, if either one is out of date;
7476 *** Classical Reasoner ***
7478 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
7479 tactics that use classical reasoning to simplify a subgoal without
7480 splitting it into several subgoals;
7482 * Safe_tac: like safe_tac but uses the default claset;
7487 * added simplification meta rules:
7488 (asm_)(full_)simplify: simpset -> thm -> thm;
7490 * simplifier.ML no longer part of Pure -- has to be loaded by object
7493 * added prems argument to simplification procedures;
7495 * HOL, FOL, ZF: added infix function `addsplits':
7496 instead of `<simpset> setloop (split_tac <thms>)'
7497 you can simply write `<simpset> addsplits <thms>'
7502 * TYPE('a) syntax for type reflection terms;
7504 * no longer handles consts with name "" -- declare as 'syntax' instead;
7506 * pretty printer: changed order of mixfix annotation preference (again!);
7508 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7513 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7514 with `addloop' of the simplifier to faciliate case splitting in premises.
7516 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7518 * HOL/Auth: new protocol proofs including some for the Internet
7521 * HOL/Map: new theory of `maps' a la VDM;
7523 * HOL/simplifier: simplification procedures nat_cancel_sums for
7524 cancelling out common nat summands from =, <, <= (in)equalities, or
7525 differences; simplification procedures nat_cancel_factor for
7526 cancelling common factor from =, <, <= (in)equalities over natural
7527 sums; nat_cancel contains both kinds of procedures, it is installed by
7528 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7530 * HOL/simplifier: terms of the form
7531 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7533 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7534 and those of the form
7535 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7537 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7540 Each datatype `t' now comes with a theorem `split_t_case' of the form
7542 P(t_case f1 ... fn x) =
7543 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7545 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7548 and a theorem `split_t_case_asm' of the form
7550 P(t_case f1 ... fn x) =
7551 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7553 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7555 which can be added to a simpset via `addsplits'. The existing theorems
7556 expand_list_case and expand_option_case have been renamed to
7557 split_list_case and split_option_case.
7560 - `pred n' is automatically converted to `n-1'.
7561 Users are strongly encouraged not to use `pred' any longer,
7562 because it will disappear altogether at some point.
7563 - Users are strongly encouraged to write "0 < n" rather than
7564 "n ~= 0". Theorems and proof tools have been modified towards this
7568 the function "set_of_list" has been renamed "set" (and its theorems too);
7569 the function "nth" now takes its arguments in the reverse order and
7570 has acquired the infix notation "!" as in "xs!n".
7572 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7574 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7575 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7577 * HOL/record: extensible records with schematic structural subtyping
7578 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7579 still lacks various theorems and concrete record syntax;
7584 * removed "axioms" and "generated by" sections;
7586 * replaced "ops" section by extended "consts" section, which is capable of
7587 handling the continuous function space "->" directly;
7590 . proves theorems immediately and stores them in the theory,
7591 . creates hierachical name space,
7592 . now uses normal mixfix annotations (instead of cinfix...),
7593 . minor changes to some names and values (for consistency),
7594 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7595 . separator between mutual domain defs: changed "," to "and",
7596 . improved handling of sort constraints; now they have to
7597 appear on the left-hand side of the equations only;
7599 * fixed LAM <x,y,zs>.b syntax;
7601 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7602 adm (%x. P (t x)), where P is chainfinite and t continuous;
7607 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7608 with `addloop' of the simplifier to faciliate case splitting in premises.
7610 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7611 in HOL, they strip ALL and --> from proved theorems;
7615 New in Isabelle94-8 (May 1997)
7616 ------------------------------
7618 *** General Changes ***
7620 * new utilities to build / run / maintain Isabelle etc. (in parts
7621 still somewhat experimental); old Makefiles etc. still functional;
7623 * new 'Isabelle System Manual';
7625 * INSTALL text, together with ./configure and ./build scripts;
7627 * reimplemented type inference for greater efficiency, better error
7628 messages and clean internal interface;
7630 * prlim command for dealing with lots of subgoals (an easier way of
7631 setting goals_limit);
7636 * supports alternative (named) syntax tables (parser and pretty
7637 printer); internal interface is provided by add_modesyntax(_i);
7639 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7640 be used in conjunction with the Isabelle symbol font; uses the
7641 "symbols" syntax table;
7643 * added token_translation interface (may translate name tokens in
7644 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7645 the current print_mode); IMPORTANT: user print translation functions
7646 are responsible for marking newly introduced bounds
7647 (Syntax.mark_boundT);
7649 * token translations for modes "xterm" and "xterm_color" that display
7650 names in bold, underline etc. or colors (which requires a color
7653 * infixes may now be declared with names independent of their syntax;
7655 * added typed_print_translation (like print_translation, but may
7656 access type of constant);
7659 *** Classical Reasoner ***
7661 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7662 some limitations. Blast_tac...
7663 + ignores addss, addbefore, addafter; this restriction is intrinsic
7664 + ignores elimination rules that don't have the correct format
7665 (the conclusion MUST be a formula variable)
7666 + ignores types, which can make HOL proofs fail
7667 + rules must not require higher-order unification, e.g. apply_type in ZF
7668 [message "Function Var's argument not a bound variable" relates to this]
7669 + its proof strategy is more general but can actually be slower
7671 * substitution with equality assumptions no longer permutes other
7674 * minor changes in semantics of addafter (now called addaltern); renamed
7675 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7676 (and access functions for it);
7678 * improved combination of classical reasoner and simplifier:
7679 + functions for handling clasimpsets
7680 + improvement of addss: now the simplifier is called _after_ the
7682 + safe variant of addss called addSss: uses safe simplifications
7683 _during_ the safe steps. It is more complete as it allows multiple
7684 instantiations of unknowns (e.g. with slow_tac).
7688 * added interface for simplification procedures (functions that
7689 produce *proven* rewrite rules on the fly, depending on current
7692 * ordering on terms as parameter (used for ordered rewriting);
7694 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7696 * the solver is now split into a safe and an unsafe part.
7697 This should be invisible for the normal user, except that the
7698 functions setsolver and addsolver have been renamed to setSolver and
7699 addSolver; added safe_asm_full_simp_tac;
7704 * a generic induction tactic `induct_tac' which works for all datatypes and
7705 also for type `nat';
7707 * a generic case distinction tactic `exhaust_tac' which works for all
7708 datatypes and also for type `nat';
7710 * each datatype comes with a function `size';
7712 * patterns in case expressions allow tuple patterns as arguments to
7713 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7715 * primrec now also works with type nat;
7717 * recdef: a new declaration form, allows general recursive functions to be
7718 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7720 * the constant for negation has been renamed from "not" to "Not" to
7721 harmonize with FOL, ZF, LK, etc.;
7723 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7726 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7728 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7729 problems in commutative rings, using axiomatic type classes for + and *;
7731 * more examples in HOL/MiniML and HOL/Auth;
7733 * more default rewrite rules for quantifiers, union/intersection;
7735 * a new constant `arbitrary == @x.False';
7737 * HOLCF/IOA replaces old HOL/IOA;
7739 * HOLCF changes: derived all rules and arities
7740 + axiomatic type classes instead of classes
7741 + typedef instead of faking type definitions
7742 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7743 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7744 + eliminated the types void, one, tr
7745 + use unit lift and bool lift (with translations) instead of one and tr
7746 + eliminated blift from Lift3.thy (use Def instead of blift)
7747 all eliminated rules are derived as theorems --> no visible changes ;
7752 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7753 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7754 as ZF_cs addSIs [equalityI];
7758 New in Isabelle94-7 (November 96)
7759 ---------------------------------
7761 * allowing negative levels (as offsets) in prlev and choplev;
7763 * super-linear speedup for large simplifications;
7765 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7766 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7767 FAIL); can suppress it using the command Delsimps (ex_simps @
7768 all_simps); De Morgan laws are also now included, by default;
7770 * improved printing of ==> : ~:
7772 * new object-logic "Sequents" adds linear logic, while replacing LK
7773 and Modal (thanks to Sara Kalvala);
7775 * HOL/Auth: correctness proofs for authentication protocols;
7777 * HOL: new auto_tac combines rewriting and classical reasoning (many
7778 examples on HOL/Auth);
7780 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7781 the rewriter and classical reasoner simultaneously;
7783 * function uresult no longer returns theorems in "standard" format;
7784 regain previous version by: val uresult = standard o uresult;
7791 * oracles -- these establish an interface between Isabelle and trusted
7792 external reasoners, which may deliver results as theorems;
7794 * proof objects (in particular record all uses of oracles);
7796 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7798 * "constdefs" section in theory files;
7800 * "primrec" section (HOL) no longer requires names;
7802 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7809 * reduced space requirements;
7811 * automatic HTML generation from theories;
7813 * theory files no longer require "..." (quotes) around most types;
7815 * new examples, including two proofs of the Church-Rosser theorem;
7817 * non-curried (1994) version of HOL is no longer distributed;
7824 * greatly reduced space requirements;
7826 * theory files (.thy) no longer require \...\ escapes at line breaks;
7828 * searchable theorem database (see the section "Retrieving theorems" on
7829 page 8 of the Reference Manual);
7831 * new examples, including Grabczewski's monumental case study of the
7834 * The previous version of HOL renamed to Old_HOL;
7836 * The new version of HOL (previously called CHOL) uses a curried syntax
7837 for functions. Application looks like f a b instead of f(a,b);
7839 * Mutually recursive inductive definitions finally work in HOL;
7841 * In ZF, pattern-matching on tuples is now available in all abstractions and
7842 translates to the operator "split";
7849 * new infix operator, addss, allowing the classical reasoner to
7850 perform simplification at each step of its search. Example:
7851 fast_tac (cs addss ss)
7853 * a new logic, CHOL, the same as HOL, but with a curried syntax
7854 for functions. Application looks like f a b instead of f(a,b). Also pairs
7855 look like (a,b) instead of <a,b>;
7857 * PLEASE NOTE: CHOL will eventually replace HOL!
7859 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7860 It translates to the operator "split". A new theory of integers is available;
7862 * In ZF, integer numerals now denote two's-complement binary integers.
7863 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7865 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7866 of the Axiom of Choice;
7873 * Significantly faster resolution;
7875 * the different sections in a .thy file can now be mixed and repeated
7878 * Database of theorems for FOL, HOL and ZF. New
7879 commands including qed, qed_goal and bind_thm store theorems in the database.
7881 * Simple database queries: return a named theorem (get_thm) or all theorems of
7882 a given theory (thms_of), or find out what theory a theorem was proved in
7885 * Bugs fixed in the inductive definition and datatype packages;
7887 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7888 and HOL_dup_cs obsolete;
7890 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7893 * Simpler definition of function space in ZF;
7895 * new results about cardinal and ordinal arithmetic in ZF;
7897 * 'subtype' facility in HOL for introducing new types as subsets of existing
7900 :mode=text:wrap=hard:maxLineLen=72: