1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2011 (January 2011)
5 ----------------------------------
9 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
10 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
11 useful tooltips and hyperlinks produced from its static analysis. The
12 bundled component provides an executable Isabelle tool that can be run
15 Isabelle2011/bin/isabelle jedit
17 * Significantly improved Isabelle/Isar implementation manual.
19 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
20 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
21 while the default heap location within that directory lacks that extra
22 suffix. This isolates multiple Isabelle installations from each
23 other, avoiding problems with old settings in new versions.
24 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
26 * Source files are always encoded as UTF-8, instead of old-fashioned
27 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
28 the following package declarations:
30 \usepackage[utf8]{inputenc}
33 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
34 a Unicode character is treated as a single symbol, not a sequence of
35 non-ASCII bytes as before. Since Isabelle/ML string literals may
36 contain symbols without further backslash escapes, Unicode can now be
37 used here as well. Recall that Symbol.explode in ML provides a
38 consistent view on symbols, while raw explode (or String.explode)
39 merely give a byte-oriented representation.
41 * Theory loader: source files are primarily located via the master
42 directory of each theory node (where the .thy file itself resides).
43 The global load path is still partially available as legacy feature.
44 Minor INCOMPATIBILITY due to subtle change in file lookup: use
45 explicit paths, relatively to the theory.
47 * Special treatment of ML file names has been discontinued.
48 Historically, optional extensions .ML or .sml were added on demand --
49 at the cost of clarity of file dependencies. Recall that Isabelle/ML
50 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
52 * Various options that affect pretty printing etc. are now properly
53 handled within the context via configuration options, instead of
54 unsynchronized references or print modes. There are both ML Config.T
55 entities and Isar declaration attributes to access these.
57 ML (Config.T) Isar (attribute)
59 eta_contract eta_contract
60 show_brackets show_brackets
63 show_question_marks show_question_marks
64 show_consts show_consts
65 show_abbrevs show_abbrevs
67 Syntax.ast_trace syntax_ast_trace
68 Syntax.ast_stat syntax_ast_stat
69 Syntax.ambiguity_level syntax_ambiguity_level
71 Goal_Display.goals_limit goals_limit
72 Goal_Display.show_main_goal show_main_goal
74 Method.rule_trace rule_trace
76 Thy_Output.display thy_output_display
77 Thy_Output.quotes thy_output_quotes
78 Thy_Output.indent thy_output_indent
79 Thy_Output.source thy_output_source
80 Thy_Output.break thy_output_break
82 Note that corresponding "..._default" references in ML may only be
83 changed globally at the ROOT session setup, but *not* within a theory.
84 The option "show_abbrevs" supersedes the former print mode
85 "no_abbrevs" with inverted meaning.
87 * More systematic naming of some configuration options.
90 trace_simp ~> simp_trace
91 debug_simp ~> simp_debug
93 * Support for real valued configuration options, using simplistic
94 floating-point notation that coincides with the inner syntax for
97 * Support for real valued preferences (with approximative PGIP type):
98 front-ends need to accept "pgint" values in float notation.
101 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
104 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
109 * Command 'type_synonym' (with single argument) replaces somewhat
110 outdated 'types', which is still available as legacy feature for some
113 * Command 'nonterminal' (with 'and' separated list of arguments)
114 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
116 * Command 'notepad' replaces former 'example_proof' for
117 experimentation in Isar without any result. INCOMPATIBILITY.
119 * Locale interpretation commands 'interpret' and 'sublocale' accept
120 lists of equations to map definitions in a locale to appropriate
121 entities in the context of the interpretation. The 'interpretation'
122 command already provided this functionality.
124 * Diagnostic command 'print_dependencies' prints the locale instances
125 that would be activated if the specified expression was interpreted in
126 the current context. Variant "print_dependencies!" assumes a context
127 without interpretations.
129 * Diagnostic command 'print_interps' prints interpretations in proofs
130 in addition to interpretations in theories.
132 * Discontinued obsolete 'global' and 'local' commands to manipulate
133 the theory name space. Rare INCOMPATIBILITY. The ML functions
134 Sign.root_path and Sign.local_path may be applied directly where this
135 feature is still required for historical reasons.
137 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
138 'definition' instead.
140 * The "prems" fact, which refers to the accidental collection of
141 foundational premises in the context, is now explicitly marked as
142 legacy feature and will be discontinued soon. Consider using "assms"
143 of the head statement or reference facts by explicit names.
145 * Document antiquotations @{class} and @{type} print classes and type
148 * Document antiquotation @{file} checks file/directory entries within
149 the local file system.
154 * Coercive subtyping: functions can be declared as coercions and type
155 inference will add them as necessary upon input of a term. Theory
156 Complex_Main declares real :: nat => real and real :: int => real as
157 coercions. A coercion function f is declared like this:
159 declare [[coercion f]]
161 To lift coercions through type constructors (e.g. from nat => real to
162 nat list => real list), map functions can be declared, e.g.
164 declare [[coercion_map map]]
166 Currently coercion inference is activated only in theories including
167 real numbers, i.e. descendants of Complex_Main. This is controlled by
168 the configuration option "coercion_enabled", e.g. it can be enabled in
169 other theories like this:
171 declare [[coercion_enabled]]
173 * Command 'partial_function' provides basic support for recursive
174 function definitions over complete partial orders. Concrete instances
175 are provided for i) the option type, ii) tail recursion on arbitrary
176 types, and iii) the heap monad of Imperative_HOL. See
177 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
180 * Function package: f.psimps rules are no longer implicitly declared
181 as [simp]. INCOMPATIBILITY.
183 * Datatype package: theorems generated for executable equality (class
184 "eq") carry proper names and are treated as default code equations.
186 * Inductive package: now offers command 'inductive_simps' to
187 automatically derive instantiated and simplified equations for
188 inductive predicates, similar to 'inductive_cases'.
190 * Command 'enriched_type' allows to register properties of the
191 functorial structure of types.
193 * Improved infrastructure for term evaluation using code generator
194 techniques, in particular static evaluation conversions.
196 * Code generator: Scala (2.8 or higher) has been added to the target
199 * Code generator: globbing constant expressions "*" and "Theory.*"
200 have been replaced by the more idiomatic "_" and "Theory._".
203 * Code generator: export_code without explicit file declaration prints
204 to standard output. INCOMPATIBILITY.
206 * Code generator: do not print function definitions for case
207 combinators any longer.
209 * Code generator: simplification with rules determined with
210 src/Tools/Code/code_simp.ML and method "code_simp".
212 * Code generator for records: more idiomatic representation of record
213 types. Warning: records are not covered by ancient SML code
214 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
215 rep_datatype declaration helps to succeed then:
219 rep_datatype foo_ext ...
221 * Records: logical foundation type for records does not carry a
222 '_type' suffix any longer (obsolete due to authentic syntax).
225 * Quickcheck now by default uses exhaustive testing instead of random
226 testing. Random testing can be invoked by "quickcheck [random]",
227 exhaustive testing by "quickcheck [exhaustive]".
229 * Quickcheck instantiates polymorphic types with small finite
230 datatypes by default. This enables a simple execution mechanism to
231 handle quantifiers and function equality over the finite datatypes.
233 * Quickcheck random generator has been renamed from "code" to
234 "random". INCOMPATIBILITY.
236 * Quickcheck now has a configurable time limit which is set to 30
237 seconds by default. This can be changed by adding [timeout = n] to the
238 quickcheck command. The time limit for Auto Quickcheck is still set
241 * Quickcheck in locales considers interpretations of that locale for
242 counter example search.
245 - Added "smt" and "remote_smt" provers based on the "smt" proof
246 method. See the Sledgehammer manual for details ("isabelle doc
249 sledgehammer atp_info ~> sledgehammer running_provers
250 sledgehammer atp_kill ~> sledgehammer kill_provers
251 sledgehammer available_atps ~> sledgehammer available_provers
254 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
255 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
256 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
257 (and "ms" and "min" are no longer supported)
262 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
263 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
265 - Added support for partial quotient types.
266 - Added local versions of the "Nitpick.register_xxx" functions.
267 - Added "whack" option.
268 - Allow registration of quotient types as codatatypes.
269 - Improved "merge_type_vars" option to merge more types.
270 - Removed unsound "fast_descrs" option.
271 - Added custom symmetry breaking for datatypes, making it possible to reach
272 higher cardinalities.
273 - Prevent the expansion of too large definitions.
275 * Proof methods "metis" and "meson" now have configuration options
276 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
277 to diagnose these tools. E.g.
279 using [[metis_trace = true]]
281 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
282 manually as command 'solve_direct'.
284 * The default SMT solver Z3 must be enabled explicitly (due to
285 licensing issues) by setting the environment variable
286 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
287 commercial applications, the SMT solver CVC3 is provided as fall-back;
288 changing the SMT solver is done via the configuration option
291 * Remote SMT solvers need to be referred to by the "remote_" prefix,
292 i.e. "remote_cvc3" and "remote_z3".
294 * Added basic SMT support for datatypes, records, and typedefs using
295 the oracle mode (no proofs). Direct support of pairs has been dropped
296 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
297 support for a similar behavior). Minor INCOMPATIBILITY.
299 * Changed SMT configuration options:
301 z3_proofs ~> smt_oracle (with inverted meaning)
302 z3_trace_assms ~> smt_trace_used_facts
315 * Boogie output files (.b2i files) need to be declared in the theory
318 * Simplification procedure "list_to_set_comprehension" rewrites list
319 comprehensions applied to List.set to set comprehensions. Occasional
320 INCOMPATIBILITY, may be deactivated like this:
322 declare [[simproc del: list_to_set_comprehension]]
324 * Removed old version of primrec package. INCOMPATIBILITY.
326 * Removed simplifier congruence rule of "prod_case", as has for long
327 been the case with "split". INCOMPATIBILITY.
329 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
331 * Removed [split_format ... and ... and ...] version of
332 [split_format]. Potential INCOMPATIBILITY.
334 * Predicate "sorted" now defined inductively, with nice induction
335 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
337 * Constant "contents" renamed to "the_elem", to free the generic name
338 contents for other uses. INCOMPATIBILITY.
340 * Renamed class eq and constant eq (for code generation) to class
341 equal and constant equal, plus renaming of related facts and various
342 tuning. INCOMPATIBILITY.
344 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
346 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
349 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
350 avoid confusion with finite sets. INCOMPATIBILITY.
352 * Abandoned locales equiv, congruent and congruent2 for equivalence
353 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
356 * Some previously unqualified names have been qualified:
363 Trueprop ~> HOL.Trueprop
368 op --> ~> HOL.implies
380 Pair ~> Product_Type.Pair
381 fst ~> Product_Type.fst
382 snd ~> Product_Type.snd
383 curry ~> Product_Type.curry
385 Collect ~> Set.Collect
389 * More canonical naming convention for some fundamental definitions:
391 bot_bool_eq ~> bot_bool_def
392 top_bool_eq ~> top_bool_def
393 inf_bool_eq ~> inf_bool_def
394 sup_bool_eq ~> sup_bool_def
395 bot_fun_eq ~> bot_fun_def
396 top_fun_eq ~> top_fun_def
397 inf_fun_eq ~> inf_fun_def
398 sup_fun_eq ~> sup_fun_def
402 * More stylized fact names:
404 expand_fun_eq ~> fun_eq_iff
405 expand_set_eq ~> set_eq_iff
407 nat_number ~> eval_nat_numeral
411 * Refactoring of code-generation specific operations in theory List:
417 mem_iff ~> member_def
418 null_empty ~> null_def
420 INCOMPATIBILITY. Note that these were not supposed to be used
421 regularly unless for striking reasons; their main purpose was code
424 Various operations from the Haskell prelude are used for generating
427 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
428 "surj f" is now an abbreviation of "range f = UNIV". The theorems
429 bij_def and surj_def are unchanged. INCOMPATIBILITY.
431 * Abolished some non-alphabetic type names: "prod" and "sum" replace
432 "*" and "+" respectively. INCOMPATIBILITY.
434 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
435 "Sum_Type.Plus" instead.
437 * Constant "split" has been merged with constant "prod_case"; names of
438 ML functions, facts etc. involving split have been retained so far,
439 though. INCOMPATIBILITY.
441 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
442 instead. INCOMPATIBILITY.
444 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
447 * Former theory Library/Enum is now part of the HOL-Main image.
448 INCOMPATIBILITY: all constants of the Enum theory now have to be
449 referred to by its qualified name.
452 nlists ~> Enum.nlists
453 product ~> Enum.product
455 * Theory Library/Monad_Syntax provides do-syntax for monad types.
456 Syntax in Library/State_Monad has been changed to avoid ambiguities.
459 * Theory Library/SetsAndFunctions has been split into
460 Library/Function_Algebras and Library/Set_Algebras; canonical names
461 for instance definitions for functions; various improvements.
464 * Theory Library/Multiset provides stable quicksort implementation of
467 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
470 * Session Multivariate_Analysis: introduced a type class for euclidean
471 space. Most theorems are now stated in terms of euclidean spaces
472 instead of finite cartesian products.
475 real ^ 'n ~> 'a::real_vector
476 ~> 'a::euclidean_space
477 ~> 'a::ordered_euclidean_space
478 (depends on your needs)
482 \<chi> x. _ ~> \<chi>\<chi> x. _
485 Also note that the indices are now natural numbers and not from some
486 finite type. Finite cartesian products of euclidean spaces, products
487 of euclidean spaces the real and complex numbers are instantiated to
488 be euclidean_spaces. INCOMPATIBILITY.
490 * Session Probability: introduced pextreal as positive extended real
491 numbers. Use pextreal as value for measures. Introduce the
492 Radon-Nikodym derivative, product spaces and Fubini's theorem for
493 arbitrary sigma finite measures. Introduces Lebesgue measure based on
494 the integral in Multivariate Analysis. INCOMPATIBILITY.
496 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
499 * Session SPARK (with image HOL-SPARK) provides commands to load and
500 prove verification conditions generated by the SPARK Ada program
501 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
506 * Theorems for additive ring operations (locale abelian_monoid and
507 descendants) are generated by interpretation from their multiplicative
508 counterparts. Names (in particular theorem names) have the mandatory
509 qualifier 'add'. Previous theorem names are redeclared for
512 * Structure "int_ring" is now an abbreviation (previously a
513 definition). This fits more natural with advanced interpretations.
518 * The domain package now runs in definitional mode by default: The
519 former command 'new_domain' is now called 'domain'. To use the domain
520 package in its original axiomatic mode, use 'domain (unsafe)'.
523 * The new class "domain" is now the default sort. Class "predomain"
524 is an unpointed version of "domain". Theories can be updated by
525 replacing sort annotations as shown below. INCOMPATIBILITY.
527 'a::type ~> 'a::countable
528 'a::cpo ~> 'a::predomain
529 'a::pcpo ~> 'a::domain
531 * The old type class "rep" has been superseded by class "domain".
532 Accordingly, users of the definitional package must remove any
533 "default_sort rep" declarations. INCOMPATIBILITY.
535 * The domain package (definitional mode) now supports unpointed
536 predomain argument types, as long as they are marked 'lazy'. (Strict
537 arguments must be in class "domain".) For example, the following
538 domain definition now works:
540 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
542 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
543 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
544 'a option, and 'a list. Additionally, it configures fixrec and the
545 domain package to work with these types. For example:
547 fixrec isInl :: "('a + 'b) u -> tr"
548 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
550 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
552 * The "(permissive)" option of fixrec has been replaced with a
553 per-equation "(unchecked)" option. See
554 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
556 * The "bifinite" class no longer fixes a constant "approx"; the class
557 now just asserts that such a function exists. INCOMPATIBILITY.
559 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
560 defines an embedding of type 'a defl into udom by default; instances
561 of "bifinite" and "domain" classes are available in
562 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
564 * The syntax "REP('a)" has been replaced with "DEFL('a)".
566 * The predicate "directed" has been removed. INCOMPATIBILITY.
568 * The type class "finite_po" has been removed. INCOMPATIBILITY.
570 * The function "cprod_map" has been renamed to "prod_map".
573 * The monadic bind operator on each powerdomain has new binder syntax
574 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
575 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
577 * The infix syntax for binary union on each powerdomain has changed
578 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
579 syntax. INCOMPATIBILITY.
581 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
582 still supported as an input translation.
584 * Renamed some theorems (the original names are also still available).
586 expand_fun_below ~> fun_below_iff
587 below_fun_ext ~> fun_belowI
588 expand_cfun_eq ~> cfun_eq_iff
590 expand_cfun_below ~> cfun_below_iff
591 below_cfun_ext ~> cfun_belowI
592 cont2cont_Rep_CFun ~> cont2cont_APP
594 * The Abs and Rep functions for various types have changed names.
595 Related theorem names have also changed to match. INCOMPATIBILITY.
599 Rep_Sprod ~> Rep_sprod
600 Abs_Sprod ~> Abs_sprod
604 * Lemmas with names of the form *_defined_iff or *_strict_iff have
605 been renamed to *_bottom_iff. INCOMPATIBILITY.
607 * Various changes to bisimulation/coinduction with domain package:
609 - Definitions of "bisim" constants no longer mention definedness.
610 - With mutual recursion, "bisim" predicate is now curried.
611 - With mutual recursion, each type gets a separate coind theorem.
612 - Variable names in bisim_def and coinduct rules have changed.
616 * Case combinators generated by the domain package for type "foo" are
617 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
619 * Several theorems have been renamed to more accurately reflect the
620 names of constants and types involved. INCOMPATIBILITY.
622 thelub_const ~> lub_const
623 lub_const ~> is_lub_const
625 is_lub_lub ~> is_lubD2
627 unique_lub ~> is_lub_unique
628 is_ub_lub ~> is_lub_rangeD1
629 lub_bin_chain ~> is_lub_bin_chain
630 lub_fun ~> is_lub_fun
631 thelub_fun ~> lub_fun
632 thelub_cfun ~> lub_cfun
633 thelub_Pair ~> lub_Pair
634 lub_cprod ~> is_lub_prod
635 thelub_cprod ~> lub_prod
636 minimal_cprod ~> minimal_prod
637 inst_cprod_pcpo ~> inst_prod_pcpo
639 compact_UU ~> compact_bottom
640 deflation_UU ~> deflation_bottom
641 finite_deflation_UU ~> finite_deflation_bottom
643 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
645 sq_ord_less_eq_trans ~> below_eq_trans
646 sq_ord_eq_less_trans ~> eq_below_trans
647 refl_less ~> below_refl
648 trans_less ~> below_trans
649 antisym_less ~> below_antisym
650 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
651 box_less ~> box_below
652 rev_trans_less ~> rev_below_trans
653 not_less2not_eq ~> not_below2not_eq
654 less_UU_iff ~> below_UU_iff
655 flat_less_iff ~> flat_below_iff
656 adm_less ~> adm_below
657 adm_not_less ~> adm_not_below
658 adm_compact_not_less ~> adm_compact_not_below
659 less_fun_def ~> below_fun_def
660 expand_fun_less ~> fun_below_iff
661 less_fun_ext ~> fun_belowI
662 less_discr_def ~> below_discr_def
663 discr_less_eq ~> discr_below_eq
664 less_unit_def ~> below_unit_def
665 less_cprod_def ~> below_prod_def
666 prod_lessI ~> prod_belowI
667 Pair_less_iff ~> Pair_below_iff
668 fst_less_iff ~> fst_below_iff
669 snd_less_iff ~> snd_below_iff
670 expand_cfun_less ~> cfun_below_iff
671 less_cfun_ext ~> cfun_belowI
672 injection_less ~> injection_below
673 less_up_def ~> below_up_def
674 not_Iup_less ~> not_Iup_below
675 Iup_less ~> Iup_below
677 Def_inject_less_eq ~> Def_below_Def
678 Def_less_is_eq ~> Def_below_iff
679 spair_less_iff ~> spair_below_iff
680 less_sprod ~> below_sprod
681 spair_less ~> spair_below
682 sfst_less_iff ~> sfst_below_iff
683 ssnd_less_iff ~> ssnd_below_iff
684 fix_least_less ~> fix_least_below
685 dist_less_one ~> dist_below_one
686 less_ONE ~> below_ONE
687 ONE_less_iff ~> ONE_below_iff
688 less_sinlD ~> below_sinlD
689 less_sinrD ~> below_sinrD
694 * All constant names are now qualified internally and use proper
695 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
700 * Antiquotation @{assert} inlines a function bool -> unit that raises
701 Fail if the argument is false. Due to inlining the source position of
702 failed assertions is included in the error output.
704 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
705 text is in practice always evaluated with a stable theory checkpoint.
706 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
708 * Antiquotation @{theory A} refers to theory A from the ancestry of
709 the current context, not any accidental theory loader state as before.
710 Potential INCOMPATIBILITY, subtle change in semantics.
712 * Syntax.pretty_priority (default 0) configures the required priority
713 of pretty-printed output and thus affects insertion of parentheses.
715 * Syntax.default_root (default "any") configures the inner syntax
716 category (nonterminal symbol) for parsing of terms.
718 * Former exception Library.UnequalLengths now coincides with
719 ListPair.UnequalLengths.
721 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
722 main functionality is provided by structure Simplifier.
724 * Renamed raw "explode" function to "raw_explode" to emphasize its
725 meaning. Note that internally to Isabelle, Symbol.explode is used in
726 almost all situations.
728 * Discontinued obsolete function sys_error and exception SYS_ERROR.
729 See implementation manual for further details on exceptions in
732 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
735 * Renamed structure PureThy to Pure_Thy and moved most of its
736 operations to structure Global_Theory, to emphasize that this is
737 rarely-used global-only stuff.
739 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
740 instead (or tracing for high-volume output).
742 * Configuration option show_question_marks only affects regular pretty
743 printing of types and terms, not raw Term.string_of_vname.
745 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
746 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
747 @{thms} for most purposes.
749 * ML structure Unsynchronized is never opened, not even in Isar
750 interaction mode as before. Old Unsynchronized.set etc. have been
751 discontinued -- use plain := instead. This should be *rare* anyway,
752 since modern tools always work via official context data, notably
753 configuration options.
755 * Parallel and asynchronous execution requires special care concerning
756 interrupts. Structure Exn provides some convenience functions that
757 avoid working directly with raw Interrupt. User code must not absorb
758 interrupts -- intermediate handling (for cleanup etc.) needs to be
759 followed by re-raising of the original exception. Another common
760 source of mistakes are "handle _" patterns, which make the meaning of
761 the program subject to physical effects of the environment.
765 New in Isabelle2009-2 (June 2010)
766 ---------------------------------
770 * Authentic syntax for *all* logical entities (type classes, type
771 constructors, term constants): provides simple and robust
772 correspondence between formal entities and concrete syntax. Within
773 the parse tree / AST representations, "constants" are decorated by
774 their category (class, type, const) and spelled out explicitly with
775 their full internal name.
777 Substantial INCOMPATIBILITY concerning low-level syntax declarations
778 and translations (translation rules and translation functions in ML).
779 Some hints on upgrading:
781 - Many existing uses of 'syntax' and 'translations' can be replaced
782 by more modern 'type_notation', 'notation' and 'abbreviation',
783 which are independent of this issue.
785 - 'translations' require markup within the AST; the term syntax
786 provides the following special forms:
788 CONST c -- produces syntax version of constant c from context
789 XCONST c -- literally c, checked as constant from context
790 c -- literally c, if declared by 'syntax'
792 Plain identifiers are treated as AST variables -- occasionally the
793 system indicates accidental variables via the error "rhs contains
796 Type classes and type constructors are marked according to their
797 concrete syntax. Some old translations rules need to be written
798 for the "type" category, using type constructor application
799 instead of pseudo-term application of the default category
802 - 'parse_translation' etc. in ML may use the following
805 @{class_syntax c} -- type class c within parse tree / AST
806 @{term_syntax c} -- type constructor c within parse tree / AST
807 @{const_syntax c} -- ML version of "CONST c" above
808 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
810 - Literal types within 'typed_print_translations', i.e. those *not*
811 represented as pseudo-terms are represented verbatim. Use @{class
812 c} or @{type_name c} here instead of the above syntax
815 Note that old non-authentic syntax was based on unqualified base
816 names, so all of the above "constant" names would coincide. Recall
817 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
818 diagnose syntax problems.
820 * Type constructors admit general mixfix syntax, not just infix.
822 * Concrete syntax may be attached to local entities without a proof
823 body, too. This works via regular mixfix annotations for 'fix',
824 'def', 'obtain' etc. or via the explicit 'write' command, which is
825 similar to the 'notation' command in theory specifications.
827 * Discontinued unnamed infix syntax (legacy feature for many years) --
828 need to specify constant name and syntax separately. Internal ML
829 datatype constructors have been renamed from InfixName to Infix etc.
830 Minor INCOMPATIBILITY.
832 * Schematic theorem statements need to be explicitly markup as such,
833 via commands 'schematic_lemma', 'schematic_theorem',
834 'schematic_corollary'. Thus the relevance of the proof is made
835 syntactically clear, which impacts performance in a parallel or
836 asynchronous interactive environment. Minor INCOMPATIBILITY.
838 * Use of cumulative prems via "!" in some proof methods has been
839 discontinued (old legacy feature).
841 * References 'trace_simp' and 'debug_simp' have been replaced by
842 configuration options stored in the context. Enabling tracing (the
843 case of debugging is similar) in proofs works via
845 using [[trace_simp = true]]
847 Tracing is then active for all invocations of the simplifier in
848 subsequent goal refinement steps. Tracing may also still be enabled or
849 disabled via the ProofGeneral settings menu.
851 * Separate commands 'hide_class', 'hide_type', 'hide_const',
852 'hide_fact' replace the former 'hide' KIND command. Minor
855 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
856 more efficient than combinations with -q1 or -q2.
861 * Proofterms record type-class reasoning explicitly, using the
862 "unconstrain" operation internally. This eliminates all sort
863 constraints from a theorem and proof, introducing explicit
864 OFCLASS-premises. On the proof term level, this operation is
865 automatically applied at theorem boundaries, such that closed proofs
866 are always free of sort constraints. INCOMPATIBILITY for tools that
869 * Local theory specifications may depend on extra type variables that
870 are not present in the result type -- arguments TYPE('a) :: 'a itself
871 are added internally. For example:
873 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
875 * Predicates of locales introduced by classes carry a mandatory
876 "class" prefix. INCOMPATIBILITY.
878 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
880 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
883 * Command 'code_reflect' allows to incorporate generated ML code into
884 runtime environment; replaces immature code_datatype antiquotation.
887 * Code generator: simple concept for abstract datatypes obeying
890 * Code generator: details of internal data cache have no impact on the
891 user space functionality any longer.
893 * Methods "unfold_locales" and "intro_locales" ignore non-locale
894 subgoals. This is more appropriate for interpretations with 'where'.
897 * Command 'example_proof' opens an empty proof body. This allows to
898 experiment with Isar, without producing any persistent result.
900 * Commands 'type_notation' and 'no_type_notation' declare type syntax
901 within a local theory context, with explicit checking of the
902 constructors involved (in contrast to the raw 'syntax' versions).
904 * Commands 'types' and 'typedecl' now work within a local theory
905 context -- without introducing dependencies on parameters or
906 assumptions, which is not possible in Isabelle/Pure.
908 * Command 'defaultsort' has been renamed to 'default_sort', it works
909 within a local theory context. Minor INCOMPATIBILITY.
914 * Command 'typedef' now works within a local theory context -- without
915 introducing dependencies on parameters or assumptions, which is not
916 possible in Isabelle/Pure/HOL. Note that the logical environment may
917 contain multiple interpretations of local typedefs (with different
918 non-emptiness proofs), even in a global theory context.
920 * New package for quotient types. Commands 'quotient_type' and
921 'quotient_definition' may be used for defining types and constants by
922 quotient constructions. An example is the type of integers created by
923 quotienting pairs of natural numbers:
926 intrel :: "(nat * nat) => (nat * nat) => bool"
928 "intrel (x, y) (u, v) = (x + v = u + y)"
930 quotient_type int = "nat * nat" / intrel
931 by (auto simp add: equivp_def expand_fun_eq)
934 "0::int" is "(0::nat, 0::nat)"
936 The method "lifting" can be used to lift of theorems from the
937 underlying "raw" type to the quotient type. The example
938 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
939 construction and provides a reasoning infrastructure for finite sets.
941 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
942 clash with new theory Quotient in Main HOL.
944 * Moved the SMT binding into the main HOL session, eliminating
945 separate HOL-SMT session.
947 * List membership infix mem operation is only an input abbreviation.
950 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
951 for future developements; former Library/Word.thy is still present in
952 the AFP entry RSAPPS.
954 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
955 longer shadowed. INCOMPATIBILITY.
957 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
960 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
963 * Dropped normalizing_semiring etc; use the facts in semiring classes
964 instead. INCOMPATIBILITY.
966 * Dropped several real-specific versions of lemmas about floor and
967 ceiling; use the generic lemmas from theory "Archimedean_Field"
968 instead. INCOMPATIBILITY.
970 floor_number_of_eq ~> floor_number_of
971 le_floor_eq_number_of ~> number_of_le_floor
972 le_floor_eq_zero ~> zero_le_floor
973 le_floor_eq_one ~> one_le_floor
974 floor_less_eq_number_of ~> floor_less_number_of
975 floor_less_eq_zero ~> floor_less_zero
976 floor_less_eq_one ~> floor_less_one
977 less_floor_eq_number_of ~> number_of_less_floor
978 less_floor_eq_zero ~> zero_less_floor
979 less_floor_eq_one ~> one_less_floor
980 floor_le_eq_number_of ~> floor_le_number_of
981 floor_le_eq_zero ~> floor_le_zero
982 floor_le_eq_one ~> floor_le_one
983 floor_subtract_number_of ~> floor_diff_number_of
984 floor_subtract_one ~> floor_diff_one
985 ceiling_number_of_eq ~> ceiling_number_of
986 ceiling_le_eq_number_of ~> ceiling_le_number_of
987 ceiling_le_zero_eq ~> ceiling_le_zero
988 ceiling_le_eq_one ~> ceiling_le_one
989 less_ceiling_eq_number_of ~> number_of_less_ceiling
990 less_ceiling_eq_zero ~> zero_less_ceiling
991 less_ceiling_eq_one ~> one_less_ceiling
992 ceiling_less_eq_number_of ~> ceiling_less_number_of
993 ceiling_less_eq_zero ~> ceiling_less_zero
994 ceiling_less_eq_one ~> ceiling_less_one
995 le_ceiling_eq_number_of ~> number_of_le_ceiling
996 le_ceiling_eq_zero ~> zero_le_ceiling
997 le_ceiling_eq_one ~> one_le_ceiling
998 ceiling_subtract_number_of ~> ceiling_diff_number_of
999 ceiling_subtract_one ~> ceiling_diff_one
1001 * Theory "Finite_Set": various folding_XXX locales facilitate the
1002 application of the various fold combinators on finite sets.
1004 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
1005 provides abstract red-black tree type which is backed by "RBT_Impl" as
1006 implementation. INCOMPATIBILTY.
1008 * Theory Library/Coinductive_List has been removed -- superseded by
1009 AFP/thys/Coinductive.
1011 * Theory PReal, including the type "preal" and related operations, has
1012 been removed. INCOMPATIBILITY.
1014 * Real: new development using Cauchy Sequences.
1016 * Split off theory "Big_Operators" containing setsum, setprod,
1017 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
1019 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
1020 "Int" etc. INCOMPATIBILITY.
1022 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
1024 * New set of rules "ac_simps" provides combined assoc / commute
1025 rewrites for all interpretations of the appropriate generic locales.
1027 * Renamed theory "OrderedGroup" to "Groups" and split theory
1028 "Ring_and_Field" into theories "Rings" and "Fields"; for more
1029 appropriate and more consistent names suitable for name prefixes
1030 within the HOL theories. INCOMPATIBILITY.
1032 * Some generic constants have been put to appropriate theories:
1033 - less_eq, less: Orderings
1034 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
1035 - inverse, divide: Rings
1038 * More consistent naming of type classes involving orderings (and
1041 lower_semilattice ~> semilattice_inf
1042 upper_semilattice ~> semilattice_sup
1044 dense_linear_order ~> dense_linorder
1046 pordered_ab_group_add ~> ordered_ab_group_add
1047 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
1048 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
1049 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
1050 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
1051 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
1052 pordered_cancel_semiring ~> ordered_cancel_semiring
1053 pordered_comm_monoid_add ~> ordered_comm_monoid_add
1054 pordered_comm_ring ~> ordered_comm_ring
1055 pordered_comm_semiring ~> ordered_comm_semiring
1056 pordered_ring ~> ordered_ring
1057 pordered_ring_abs ~> ordered_ring_abs
1058 pordered_semiring ~> ordered_semiring
1060 ordered_ab_group_add ~> linordered_ab_group_add
1061 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
1062 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
1063 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
1064 ordered_field ~> linordered_field
1065 ordered_field_no_lb ~> linordered_field_no_lb
1066 ordered_field_no_ub ~> linordered_field_no_ub
1067 ordered_field_dense_linear_order ~> dense_linordered_field
1068 ordered_idom ~> linordered_idom
1069 ordered_ring ~> linordered_ring
1070 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
1071 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
1072 ordered_ring_strict ~> linordered_ring_strict
1073 ordered_semidom ~> linordered_semidom
1074 ordered_semiring ~> linordered_semiring
1075 ordered_semiring_1 ~> linordered_semiring_1
1076 ordered_semiring_1_strict ~> linordered_semiring_1_strict
1077 ordered_semiring_strict ~> linordered_semiring_strict
1079 The following slightly odd type classes have been moved to a
1080 separate theory Library/Lattice_Algebras:
1082 lordered_ab_group_add ~> lattice_ab_group_add
1083 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
1084 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
1085 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
1086 lordered_ring ~> lattice_ring
1090 * Refined field classes:
1091 - classes division_ring_inverse_zero, field_inverse_zero,
1092 linordered_field_inverse_zero include rule inverse 0 = 0 --
1093 subsumes former division_by_zero class;
1094 - numerous lemmas have been ported from field to division_ring.
1097 * Refined algebra theorem collections:
1098 - dropped theorem group group_simps, use algebra_simps instead;
1099 - dropped theorem group ring_simps, use field_simps instead;
1100 - proper theorem collection field_simps subsumes former theorem
1101 groups field_eq_simps and field_simps;
1102 - dropped lemma eq_minus_self_iff which is a duplicate for
1106 * Theory Finite_Set and List: some lemmas have been generalized from
1109 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
1110 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
1111 inter_Inter_fold_inter ~> inf_Inf_fold_inf
1112 union_Union_fold_union ~> sup_Sup_fold_sup
1113 Inter_fold_inter ~> Inf_fold_inf
1114 Union_fold_union ~> Sup_fold_sup
1115 inter_INTER_fold_inter ~> inf_INFI_fold_inf
1116 union_UNION_fold_union ~> sup_SUPR_fold_sup
1117 INTER_fold_inter ~> INFI_fold_inf
1118 UNION_fold_union ~> SUPR_fold_sup
1120 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
1121 replaced by the more convenient lemmas Inf_empty and Sup_empty.
1122 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
1123 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
1124 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
1125 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
1127 * Reorganized theory Multiset: swapped notation of pointwise and
1130 - pointwise ordering is instance of class order with standard syntax
1132 - multiset ordering has syntax <=# and <#; partial order properties
1133 are provided by means of interpretation with prefix
1135 - less duplication, less historical organization of sections,
1136 conversion from associations lists to multisets, rudimentary code
1138 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
1143 multiset_eq_conv_count_eq ~> multiset_ext_iff
1144 multi_count_ext ~> multiset_ext
1145 diff_union_inverse2 ~> diff_union_cancelR
1149 * Theory Permutation: replaced local "remove" by List.remove1.
1151 * Code generation: ML and OCaml code is decorated with signatures.
1153 * Theory List: added transpose.
1155 * Library/Nat_Bijection.thy is a collection of bijective functions
1156 between nat and other types, which supersedes the older libraries
1157 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
1160 Nat_Int_Bij.nat2_to_nat ~> prod_encode
1161 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
1162 Nat_Int_Bij.int_to_nat_bij ~> int_encode
1163 Nat_Int_Bij.nat_to_int_bij ~> int_decode
1164 Countable.pair_encode ~> prod_encode
1165 NatIso.prod2nat ~> prod_encode
1166 NatIso.nat2prod ~> prod_decode
1167 NatIso.sum2nat ~> sum_encode
1168 NatIso.nat2sum ~> sum_decode
1169 NatIso.list2nat ~> list_encode
1170 NatIso.nat2list ~> list_decode
1171 NatIso.set2nat ~> set_encode
1172 NatIso.nat2set ~> set_decode
1175 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
1176 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
1177 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
1178 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
1179 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
1180 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
1181 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
1182 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
1183 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
1184 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
1185 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
1186 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
1187 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
1190 - Renamed ATP commands:
1191 atp_info ~> sledgehammer running_atps
1192 atp_kill ~> sledgehammer kill_atps
1193 atp_messages ~> sledgehammer messages
1194 atp_minimize ~> sledgehammer minimize
1195 print_atps ~> sledgehammer available_atps
1197 - Added user's manual ("isabelle doc sledgehammer").
1198 - Added option syntax and "sledgehammer_params" to customize
1199 Sledgehammer's behavior. See the manual for details.
1200 - Modified the Isar proof reconstruction code so that it produces
1201 direct proofs rather than proofs by contradiction. (This feature
1202 is still experimental.)
1203 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
1205 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
1208 - Added and implemented "binary_ints" and "bits" options.
1209 - Added "std" option and implemented support for nonstandard models.
1210 - Added and implemented "finitize" option to improve the precision
1211 of infinite datatypes based on a monotonicity analysis.
1212 - Added support for quotient types.
1213 - Added support for "specification" and "ax_specification"
1215 - Added support for local definitions (for "function" and
1216 "termination" proofs).
1217 - Added support for term postprocessors.
1218 - Optimized "Multiset.multiset" and "FinFun.finfun".
1219 - Improved efficiency of "destroy_constrs" optimization.
1220 - Fixed soundness bugs related to "destroy_constrs" optimization and
1222 - Fixed soundness bug related to higher-order constructors.
1223 - Fixed soundness bug when "full_descrs" is enabled.
1224 - Improved precision of set constructs.
1225 - Added "atoms" option.
1226 - Added cache to speed up repeated Kodkod invocations on the same
1228 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
1229 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
1230 "SAT4J_Light". INCOMPATIBILITY.
1231 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
1232 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
1233 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
1235 * Method "induct" now takes instantiations of the form t, where t is not
1236 a variable, as a shorthand for "x == t", where x is a fresh variable.
1237 If this is not intended, t has to be enclosed in parentheses.
1238 By default, the equalities generated by definitional instantiations
1239 are pre-simplified, which may cause parameters of inductive cases
1240 to disappear, or may even delete some of the inductive cases.
1241 Use "induct (no_simp)" instead of "induct" to restore the old
1242 behaviour. The (no_simp) option is also understood by the "cases"
1243 and "nominal_induct" methods, which now perform pre-simplification, too.
1249 * Variable names in lemmas generated by the domain package have
1250 changed; the naming scheme is now consistent with the HOL datatype
1251 package. Some proof scripts may be affected, INCOMPATIBILITY.
1253 * The domain package no longer defines the function "foo_copy" for
1254 recursive domain "foo". The reach lemma is now stated directly in
1255 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
1256 be reformulated in terms of "foo_take", INCOMPATIBILITY.
1258 * Most definedness lemmas generated by the domain package (previously
1259 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
1260 like "foo$x = UU <-> x = UU", which works better as a simp rule.
1261 Proofs that used definedness lemmas as intro rules may break,
1262 potential INCOMPATIBILITY.
1264 * Induction and casedist rules generated by the domain package now
1265 declare proper case_names (one called "bottom", and one named for each
1266 constructor). INCOMPATIBILITY.
1268 * For mutually-recursive domains, separate "reach" and "take_lemma"
1269 rules are generated for each domain, INCOMPATIBILITY.
1271 foo_bar.reach ~> foo.reach bar.reach
1272 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
1274 * Some lemmas generated by the domain package have been renamed for
1275 consistency with the datatype package, INCOMPATIBILITY.
1277 foo.ind ~> foo.induct
1278 foo.finite_ind ~> foo.finite_induct
1279 foo.coind ~> foo.coinduct
1280 foo.casedist ~> foo.exhaust
1281 foo.exhaust ~> foo.nchotomy
1283 * For consistency with other definition packages, the fixrec package
1284 now generates qualified theorem names, INCOMPATIBILITY.
1286 foo_simps ~> foo.simps
1287 foo_unfold ~> foo.unfold
1288 foo_induct ~> foo.induct
1290 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
1291 method and internal fixrec proofs now use the default simpset instead.
1294 * The "contlub" predicate has been removed. Proof scripts should use
1295 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
1297 * The "admw" predicate has been removed, INCOMPATIBILITY.
1299 * The constants cpair, cfst, and csnd have been removed in favor of
1300 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
1305 * Antiquotations for basic formal entities:
1307 @{class NAME} -- type class
1308 @{class_syntax NAME} -- syntax representation of the above
1310 @{type_name NAME} -- logical type
1311 @{type_abbrev NAME} -- type abbreviation
1312 @{nonterminal NAME} -- type of concrete syntactic category
1313 @{type_syntax NAME} -- syntax representation of any of the above
1315 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
1316 @{const_abbrev NAME} -- abbreviated constant
1317 @{const_syntax NAME} -- syntax representation of any of the above
1319 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
1320 syntax constant (cf. 'syntax' command).
1322 * Antiquotation @{make_string} inlines a function to print arbitrary
1323 values similar to the ML toplevel. The result is compiler dependent
1324 and may fall back on "?" in certain situations.
1326 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
1327 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
1328 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
1329 not work with the asynchronous Isar document model.
1331 * Configuration options now admit dynamic default values, depending on
1332 the context or even global references.
1334 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
1335 uses an efficient external library if available (for Poly/ML).
1337 * Renamed some important ML structures, while keeping the old names
1338 for some time as aliases within the structure Legacy:
1340 OuterKeyword ~> Keyword
1343 OuterSyntax ~> Outer_Syntax
1344 PrintMode ~> Print_Mode
1345 SpecParse ~> Parse_Spec
1348 ThyOutput ~> Thy_Output
1349 TypeInfer ~> Type_Infer
1351 Note that "open Legacy" simplifies porting of sources, but forgetting
1352 to remove it again will complicate porting again in the future.
1354 * Most operations that refer to a global context are named
1355 accordingly, e.g. Simplifier.global_context or
1356 ProofContext.init_global. There are some situations where a global
1357 context actually works, but under normal circumstances one needs to
1358 pass the proper local context through the code!
1360 * Discontinued old TheoryDataFun with its copy/init operation -- data
1361 needs to be pure. Functor Theory_Data_PP retains the traditional
1362 Pretty.pp argument to merge, which is absent in the standard
1363 Theory_Data version.
1365 * Sorts.certify_sort and derived "cert" operations for types and terms
1366 no longer minimize sorts. Thus certification at the boundary of the
1367 inference kernel becomes invariant under addition of class relations,
1368 which is an important monotonicity principle. Sorts are now minimized
1369 in the syntax layer only, at the boundary between the end-user and the
1370 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
1371 explicitly in rare situations.
1373 * Renamed old-style Drule.standard to Drule.export_without_context, to
1374 emphasize that this is in no way a standard operation.
1377 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
1378 usual for resolution. Rare INCOMPATIBILITY.
1380 * Renamed varify/unvarify operations to varify_global/unvarify_global
1381 to emphasize that these only work in a global situation (which is
1384 * Curried take and drop in library.ML; negative length is interpreted
1385 as infinity (as in chop). Subtle INCOMPATIBILITY.
1387 * Proof terms: type substitutions on proof constants now use canonical
1388 order of type variables. INCOMPATIBILITY for tools working with proof
1391 * Raw axioms/defs may no longer carry sort constraints, and raw defs
1392 may no longer carry premises. User-level specifications are
1393 transformed accordingly by Thm.add_axiom/add_def.
1398 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
1399 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
1400 proof terms are enabled unconditionally in the new HOL-Proofs image.
1402 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
1403 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
1406 * Old lib/scripts/polyml-platform is superseded by the
1407 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
1408 variant, even on a 64 bit machine. The following example setting
1409 prefers 64 bit if available:
1411 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
1413 * The preliminary Isabelle/jEdit application demonstrates the emerging
1414 Isabelle/Scala layer for advanced prover interaction and integration.
1415 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
1418 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
1419 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
1420 similar to the default assignment of the document preparation system
1421 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
1422 provides some operations for direct access to the font without asking
1423 the user for manual installation.
1427 New in Isabelle2009-1 (December 2009)
1428 -------------------------------------
1432 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
1433 one backslash should be used, even in ML sources.
1438 * Locale interpretation propagates mixins along the locale hierarchy.
1439 The currently only available mixins are the equations used to map
1440 local definitions to terms of the target domain of an interpretation.
1442 * Reactivated diagnostic command 'print_interps'. Use "print_interps
1443 loc" to print all interpretations of locale "loc" in the theory.
1444 Interpretations in proofs are not shown.
1446 * Thoroughly revised locales tutorial. New section on conditional
1449 * On instantiation of classes, remaining undefined class parameters
1450 are formally declared. INCOMPATIBILITY.
1453 *** Document preparation ***
1455 * New generalized style concept for printing terms: @{foo (style) ...}
1456 instead of @{foo_style style ...} (old form is still retained for
1457 backward compatibility). Styles can be also applied for
1458 antiquotations prop, term_type and typeof.
1463 * New proof method "smt" for a combination of first-order logic with
1464 equality, linear and nonlinear (natural/integer/real) arithmetic, and
1465 fixed-size bitvectors; there is also basic support for higher-order
1466 features (esp. lambda abstractions). It is an incomplete decision
1467 procedure based on external SMT solvers using the oracle mechanism;
1468 for the SMT solver Z3, this method is proof-producing. Certificates
1469 are provided to avoid calling the external solvers solely for
1470 re-checking proofs. Due to a remote SMT service there is no need for
1471 installing SMT solvers locally. See src/HOL/SMT.
1473 * New commands to load and prove verification conditions generated by
1474 the Boogie program verifier or derived systems (e.g. the Verifying C
1475 Compiler (VCC) or Spec#). See src/HOL/Boogie.
1477 * New counterexample generator tool 'nitpick' based on the Kodkod
1478 relational model finder. See src/HOL/Tools/Nitpick and
1479 src/HOL/Nitpick_Examples.
1481 * New commands 'code_pred' and 'values' to invoke the predicate
1482 compiler and to enumerate values of inductive predicates.
1484 * A tabled implementation of the reflexive transitive closure.
1486 * New implementation of quickcheck uses generic code generator;
1487 default generators are provided for all suitable HOL types, records
1488 and datatypes. Old quickcheck can be re-activated importing theory
1489 Library/SML_Quickcheck.
1491 * New testing tool Mirabelle for automated proof tools. Applies
1492 several tools and tactics like sledgehammer, metis, or quickcheck, to
1493 every proof step in a theory. To be used in batch mode via the
1494 "mirabelle" utility.
1496 * New proof method "sos" (sum of squares) for nonlinear real
1497 arithmetic (originally due to John Harison). It requires theory
1498 Library/Sum_Of_Squares. It is not a complete decision procedure but
1499 works well in practice on quantifier-free real arithmetic with +, -,
1500 *, ^, =, <= and <, i.e. boolean combinations of equalities and
1501 inequalities between polynomials. It makes use of external
1502 semidefinite programming solvers. Method "sos" generates a
1503 certificate that can be pasted into the proof thus avoiding the need
1504 to call an external tool every time the proof is checked. See
1505 src/HOL/Library/Sum_Of_Squares.
1507 * New method "linarith" invokes existing linear arithmetic decision
1510 * New command 'atp_minimal' reduces result produced by Sledgehammer.
1512 * New Sledgehammer option "Full Types" in Proof General settings menu.
1513 Causes full type information to be output to the ATPs. This slows
1514 ATPs down considerably but eliminates a source of unsound "proofs"
1517 * New method "metisFT": A version of metis that uses full type
1518 information in order to avoid failures of proof reconstruction.
1520 * New evaluator "approximate" approximates an real valued term using
1521 the same method as the approximation method.
1523 * Method "approximate" now supports arithmetic expressions as
1524 boundaries of intervals and implements interval splitting and Taylor
1527 * ML antiquotation @{code_datatype} inserts definition of a datatype
1528 generated by the code generator; e.g. see src/HOL/Predicate.thy.
1530 * New theory SupInf of the supremum and infimum operators for sets of
1533 * New theory Probability, which contains a development of measure
1534 theory, eventually leading to Lebesgue integration and probability.
1536 * Extended Multivariate Analysis to include derivation and Brouwer's
1539 * Reorganization of number theory, INCOMPATIBILITY:
1540 - new number theory development for nat and int, in theories Divides
1541 and GCD as well as in new session Number_Theory
1542 - some constants and facts now suffixed with _nat and _int
1544 - former session NumberTheory now named Old_Number_Theory, including
1545 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
1546 - moved theory Pocklington from src/HOL/Library to
1547 src/HOL/Old_Number_Theory
1549 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
1550 lcm of finite and infinite sets. It is shown that they form a complete
1553 * Class semiring_div requires superclass no_zero_divisors and proof of
1554 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
1555 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
1556 generalized to class semiring_div, subsuming former theorems
1557 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
1558 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
1561 * Refinements to lattice classes and sets:
1562 - less default intro/elim rules in locale variant, more default
1563 intro/elim rules in class variant: more uniformity
1564 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
1566 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
1568 - renamed ACI to inf_sup_aci
1569 - new class "boolean_algebra"
1570 - class "complete_lattice" moved to separate theory
1571 "Complete_Lattice"; corresponding constants (and abbreviations)
1572 renamed and with authentic syntax:
1573 Set.Inf ~> Complete_Lattice.Inf
1574 Set.Sup ~> Complete_Lattice.Sup
1575 Set.INFI ~> Complete_Lattice.INFI
1576 Set.SUPR ~> Complete_Lattice.SUPR
1577 Set.Inter ~> Complete_Lattice.Inter
1578 Set.Union ~> Complete_Lattice.Union
1579 Set.INTER ~> Complete_Lattice.INTER
1580 Set.UNION ~> Complete_Lattice.UNION
1581 - authentic syntax for
1584 - mere abbreviations:
1587 Set.inter (for inf, formerly Set.Int)
1588 Set.union (for sup, formerly Set.Un)
1589 Complete_Lattice.Inter (for Inf)
1590 Complete_Lattice.Union (for Sup)
1591 Complete_Lattice.INTER (for INFI)
1592 Complete_Lattice.UNION (for SUPR)
1593 - object-logic definitions as far as appropriate
1595 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
1596 Un_subset_iff are explicitly deleted as default simp rules; then also
1597 their lattice counterparts le_inf_iff and le_sup_iff have to be
1598 deleted to achieve the desired effect.
1600 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
1601 rules by default any longer; the same applies to min_max.inf_absorb1
1602 etc. INCOMPATIBILITY.
1604 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
1605 pred_set_conv by default. INCOMPATIBILITY.
1607 * Power operations on relations and functions are now one dedicated
1608 constant "compow" with infix syntax "^^". Power operation on
1609 multiplicative monoids retains syntax "^" and is now defined generic
1610 in class power. INCOMPATIBILITY.
1612 * Relation composition "R O S" now has a more standard argument order:
1613 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
1614 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
1615 break, since the O_assoc rule was not rewritten like this. Fix using
1616 O_assoc[symmetric]. The same applies to the curried version "R OO S".
1618 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
1619 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
1622 * Most rules produced by inductive and datatype package have mandatory
1623 prefixes. INCOMPATIBILITY.
1625 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
1626 the attribute of the same name. Each of the theorems in the list
1627 DERIV_intros assumes composition with an additional function and
1628 matches a variable to the derivative, which has to be solved by the
1629 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
1630 of most elementary terms. Former Maclauren.DERIV_tac and
1631 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
1634 * Code generator attributes follow the usual underscore convention:
1635 code_unfold replaces code unfold
1636 code_post replaces code post
1641 sizechange -> size_change
1642 induct_scheme -> induction_schema
1645 * Discontinued abbreviation "arbitrary" of constant "undefined".
1646 INCOMPATIBILITY, use "undefined" directly.
1649 Suc_eq_add_numeral_1 -> Suc_eq_plus1
1650 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
1651 Suc_plus1 -> Suc_eq_plus1
1652 *anti_sym -> *antisym*
1653 vector_less_eq_def -> vector_le_def
1656 * Added theorem List.map_map as [simp]. Removed List.map_compose.
1659 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1665 * Theory Representable defines a class "rep" of domains that are
1666 representable (via an ep-pair) in the universal domain type "udom".
1667 Instances are provided for all type constructors defined in HOLCF.
1669 * The 'new_domain' command is a purely definitional version of the
1670 domain package, for representable domains. Syntax is identical to the
1671 old domain package. The 'new_domain' package also supports indirect
1672 recursion using previously-defined type constructors. See
1673 src/HOLCF/ex/New_Domain.thy for examples.
1675 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1676 on the left-hand side of an equation, and then performs
1677 simplification. Rewriting is done using rules declared with the
1678 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1679 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1681 * The pattern-match compiler in 'fixrec' can now handle constructors
1682 with HOL function types. Pattern-match combinators for the Pair
1683 constructor are pre-configured.
1685 * The 'fixrec' package now produces better fixed-point induction rules
1686 for mutually-recursive definitions: Induction rules have conclusions
1687 of the form "P foo bar" instead of "P <foo, bar>".
1689 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1690 been renamed to "below". The name "below" now replaces "less" in many
1691 theorem names. (Legacy theorem names using "less" are still supported
1694 * The 'fixrec' package now supports "bottom patterns". Bottom
1695 patterns can be used to generate strictness rules, or to make
1696 functions more strict (much like the bang-patterns supported by the
1697 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1703 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1704 errors and run-time exceptions, including detailed source positions.
1706 * Structure Name_Space (formerly NameSpace) now manages uniquely
1707 identified entries, with some additional information such as source
1708 position, logical grouping etc.
1710 * Theory and context data is now introduced by the simplified and
1711 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1712 to be pure, but the old TheoryDataFun for mutable data (with explicit
1713 copy operation) is still available for some time.
1715 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1716 provides a high-level programming interface to synchronized state
1717 variables with atomic update. This works via pure function
1718 application within a critical section -- its runtime should be as
1719 short as possible; beware of deadlocks if critical code is nested,
1720 either directly or indirectly via other synchronized variables!
1722 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1723 wraps raw ML references, explicitly indicating their non-thread-safe
1724 behaviour. The Isar toplevel keeps this structure open, to
1725 accommodate Proof General as well as quick and dirty interactive
1726 experiments with references.
1728 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1729 parallel tactical reasoning.
1731 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1732 are similar to SUBPROOF, but are slightly more flexible: only the
1733 specified parts of the subgoal are imported into the context, and the
1734 body tactic may introduce new subgoals and schematic variables.
1736 * Old tactical METAHYPS, which does not observe the proof context, has
1737 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1738 or Subgoal.FOCUS etc.
1740 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1741 functors have their own ML name space there is no point to mark them
1742 separately.) Minor INCOMPATIBILITY.
1744 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1746 * Renamed several structures FooBar to Foo_Bar. Occasional,
1749 * Operations of structure Skip_Proof no longer require quick_and_dirty
1750 mode, which avoids critical setmp.
1752 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1753 combinators for "args". INCOMPATIBILITY, need to use simplified
1754 Attrib/Method.setup introduced in Isabelle2009.
1756 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1757 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1758 last resort. INCOMPATIBILITY.
1760 * Display.pretty_thm now requires a proper context (cf. former
1761 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1762 or even Display.pretty_thm_without_context as last resort.
1765 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1766 Syntax.pretty_typ/term directly, preferably with proper context
1767 instead of global theory.
1772 * Further fine tuning of parallel proof checking, scales up to 8 cores
1773 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1776 * Support for additional "Isabelle components" via etc/components, see
1777 also the system manual.
1779 * The isabelle makeall tool now operates on all components with
1780 IsaMakefile, not just hardwired "logics".
1782 * Removed "compress" option from isabelle-process and isabelle usedir;
1783 this is always enabled.
1785 * Discontinued support for Poly/ML 4.x versions.
1787 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1788 on a given logic image. This requires the lighttpd webserver and is
1789 currently supported on Linux only.
1793 New in Isabelle2009 (April 2009)
1794 --------------------------------
1798 * Simplified main Isabelle executables, with less surprises on
1799 case-insensitive file-systems (such as Mac OS).
1801 - The main Isabelle tool wrapper is now called "isabelle" instead of
1804 - The former "isabelle" alias for "isabelle-process" has been
1805 removed (should rarely occur to regular users).
1807 - The former "isabelle-interface" and its alias "Isabelle" have been
1808 removed (interfaces are now regular Isabelle tools).
1810 Within scripts and make files, the Isabelle environment variables
1811 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1812 respectively. (The latter are still available as legacy feature.)
1814 The old isabelle-interface wrapper could react in confusing ways if
1815 the interface was uninstalled or changed otherwise. Individual
1816 interface tool configuration is now more explicit, see also the
1817 Isabelle system manual. In particular, Proof General is now available
1818 via "isabelle emacs".
1820 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1821 purge installed copies of Isabelle executables and re-run "isabelle
1822 install -p ...", or use symlinks.
1824 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1825 old ~/isabelle, which was slightly non-standard and apt to cause
1826 surprises on case-insensitive file-systems (such as Mac OS).
1828 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1829 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1830 care is required when using older releases of Isabelle. Note that
1831 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1832 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1834 * Proofs of fully specified statements are run in parallel on
1835 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1836 a regular 4-core machine, if the initial heap space is made reasonably
1837 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1839 * The main reference manuals ("isar-ref", "implementation", and
1840 "system") have been updated and extended. Formally checked references
1841 as hyperlinks are now available uniformly.
1846 * Complete re-implementation of locales. INCOMPATIBILITY in several
1847 respects. The most important changes are listed below. See the
1848 Tutorial on Locales ("locales" manual) for details.
1850 - In locale expressions, instantiation replaces renaming. Parameters
1851 must be declared in a for clause. To aid compatibility with previous
1852 parameter inheritance, in locale declarations, parameters that are not
1853 'touched' (instantiation position "_" or omitted) are implicitly added
1854 with their syntax at the beginning of the for clause.
1856 - Syntax from abbreviations and definitions in locales is available in
1857 locale expressions and context elements. The latter is particularly
1858 useful in locale declarations.
1860 - More flexible mechanisms to qualify names generated by locale
1861 expressions. Qualifiers (prefixes) may be specified in locale
1862 expressions, and can be marked as mandatory (syntax: "name!:") or
1863 optional (syntax "name?:"). The default depends for plain "name:"
1864 depends on the situation where a locale expression is used: in
1865 commands 'locale' and 'sublocale' prefixes are optional, in
1866 'interpretation' and 'interpret' prefixes are mandatory. The old
1867 implicit qualifiers derived from the parameter names of a locale are
1868 no longer generated.
1870 - Command "sublocale l < e" replaces "interpretation l < e". The
1871 instantiation clause in "interpretation" and "interpret" (square
1872 brackets) is no longer available. Use locale expressions.
1874 - When converting proof scripts, mandatory qualifiers in
1875 'interpretation' and 'interpret' should be retained by default, even
1876 if this is an INCOMPATIBILITY compared to former behavior. In the
1877 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1878 in locale expressions range over a single locale instance only.
1880 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1881 In existing theorem specifications replace the includes element by the
1882 respective context elements of the included locale, omitting those
1883 that are already present in the theorem specification. Multiple
1884 assume elements of a locale should be replaced by a single one
1885 involving the locale predicate. In the proof body, declarations (most
1886 notably theorems) may be regained by interpreting the respective
1887 locales in the proof context as required (command "interpret").
1889 If using "includes" in replacement of a target solely because the
1890 parameter types in the theorem are not as general as in the target,
1891 consider declaring a new locale with additional type constraints on
1892 the parameters (context element "constrains").
1894 - Discontinued "locale (open)". INCOMPATIBILITY.
1896 - Locale interpretation commands no longer attempt to simplify goal.
1897 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1898 methods intro_locales and unfold_locales to clarify.
1900 - Locale interpretation commands no longer accept interpretation
1901 attributes. INCOMPATIBILITY.
1903 * Class declaration: so-called "base sort" must not be given in import
1904 list any longer, but is inferred from the specification. Particularly
1911 class foo = type + ...
1913 * Class target: global versions of theorems stemming do not carry a
1914 parameter prefix any longer. INCOMPATIBILITY.
1916 * Class 'instance' command no longer accepts attached definitions.
1917 INCOMPATIBILITY, use proper 'instantiation' target instead.
1919 * Recovered hiding of consts, which was accidentally broken in
1920 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1921 makes c inaccessible; consider using ``hide (open) const c'' instead.
1923 * Slightly more coherent Pure syntax, with updated documentation in
1924 isar-ref manual. Removed locales meta_term_syntax and
1925 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1926 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1927 directly in regular applications.
1929 * There is a new syntactic category "float_const" for signed decimal
1930 fractions (e.g. 123.45 or -123.45).
1932 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1933 interface with 'setup' command instead.
1935 * Command 'local_setup' is similar to 'setup', but operates on a local
1938 * The 'axiomatization' command now only works within a global theory
1939 context. INCOMPATIBILITY.
1941 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1942 hypotheses. Sorts required in the course of reasoning need to be
1943 covered by the constraints in the initial statement, completed by the
1944 type instance information of the background theory. Non-trivial sort
1945 hypotheses, which rarely occur in practice, may be specified via
1946 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1948 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1950 The result contains an implicit sort hypotheses as before --
1951 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1954 * Generalized Isar history, with support for linear undo, direct state
1957 * Changed defaults for unify configuration options:
1959 unify_trace_bound = 50 (formerly 25)
1960 unify_search_bound = 60 (formerly 30)
1962 * Different bookkeeping for code equations (INCOMPATIBILITY):
1964 a) On theory merge, the last set of code equations for a particular
1965 constant is taken (in accordance with the policy applied by other
1966 parts of the code generator framework).
1968 b) Code equations stemming from explicit declarations (e.g. code
1969 attribute) gain priority over default code equations stemming
1970 from definition, primrec, fun etc.
1972 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1974 * Unified theorem tables for both code generators. Thus [code
1975 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1977 * Command 'find_consts' searches for constants based on type and name
1980 find_consts "_ => bool"
1982 By default, matching is against subtypes, but it may be restricted to
1983 the whole type. Searching by name is possible. Multiple queries are
1984 conjunctive and queries may be negated by prefixing them with a
1987 find_consts strict: "_ => bool" name: "Int" -"int => int"
1989 * New 'find_theorems' criterion "solves" matches theorems that
1990 directly solve the current goal (modulo higher-order unification).
1992 * Auto solve feature for main theorem statements: whenever a new goal
1993 is stated, "find_theorems solves" is called; any theorems that could
1994 solve the lemma directly are listed as part of the goal state.
1995 Cf. associated options in Proof General Isabelle settings menu,
1996 enabled by default, with reasonable timeout for pathological cases of
1997 higher-order unification.
2000 *** Document preparation ***
2002 * Antiquotation @{lemma} now imitates a regular terminal proof,
2003 demanding keyword 'by' and supporting the full method expression
2004 syntax just like the Isar command 'by'.
2009 * Integrated main parts of former image HOL-Complex with HOL. Entry
2010 points Main and Complex_Main remain as before.
2012 * Logic image HOL-Plain provides a minimal HOL with the most important
2013 tools available (inductive, datatype, primrec, ...). This facilitates
2014 experimentation and tool development. Note that user applications
2015 (and library theories) should never refer to anything below theory
2018 * Logic image HOL-Main stops at theory Main, and thus facilitates
2019 experimentation due to shorter build times.
2021 * Logic image HOL-NSA contains theories of nonstandard analysis which
2022 were previously part of former HOL-Complex. Entry point Hyperreal
2023 remains valid, but theories formerly using Complex_Main should now use
2024 new entry point Hypercomplex.
2026 * Generic ATP manager for Sledgehammer, based on ML threads instead of
2027 Posix processes. Avoids potentially expensive forking of the ML
2028 process. New thread-based implementation also works on non-Unix
2029 platforms (Cygwin). Provers are no longer hardwired, but defined
2030 within the theory via plain ML wrapper functions. Basic Sledgehammer
2031 commands are covered in the isar-ref manual.
2033 * Wrapper scripts for remote SystemOnTPTP service allows to use
2034 sledgehammer without local ATP installation (Vampire etc.). Other
2035 provers may be included via suitable ML wrappers, see also
2036 src/HOL/ATP_Linkup.thy.
2038 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
2041 * The metis method no longer fails because the theorem is too trivial
2042 (contains the empty clause).
2044 * The metis method now fails in the usual manner, rather than raising
2045 an exception, if it determines that it cannot prove the theorem.
2047 * Method "coherent" implements a prover for coherent logic (see also
2048 src/Tools/coherent.ML).
2050 * Constants "undefined" and "default" replace "arbitrary". Usually
2051 "undefined" is the right choice to replace "arbitrary", though
2052 logically there is no difference. INCOMPATIBILITY.
2054 * Command "value" now integrates different evaluation mechanisms. The
2055 result of the first successful evaluation mechanism is printed. In
2056 square brackets a particular named evaluation mechanisms may be
2057 specified (currently, [SML], [code] or [nbe]). See further
2058 src/HOL/ex/Eval_Examples.thy.
2060 * Normalization by evaluation now allows non-leftlinear equations.
2061 Declare with attribute [code nbe].
2063 * Methods "case_tac" and "induct_tac" now refer to the very same rules
2064 as the structured Isar versions "cases" and "induct", cf. the
2065 corresponding "cases" and "induct" attributes. Mutual induction rules
2066 are now presented as a list of individual projections
2067 (e.g. foo_bar.inducts for types foo and bar); the old format with
2068 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
2069 rare situations a different rule is selected --- notably nested tuple
2070 elimination instead of former prod.exhaust: use explicit (case_tac t
2071 rule: prod.exhaust) here.
2073 * Attributes "cases", "induct", "coinduct" support "del" option.
2075 * Removed fact "case_split_thm", which duplicates "case_split".
2077 * The option datatype has been moved to a new theory Option. Renamed
2078 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
2080 * New predicate "strict_mono" classifies strict functions on partial
2081 orders. With strict functions on linear orders, reasoning about
2082 (in)equalities is facilitated by theorems "strict_mono_eq",
2083 "strict_mono_less_eq" and "strict_mono_less".
2085 * Some set operations are now proper qualified constants with
2086 authentic syntax. INCOMPATIBILITY:
2097 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
2100 * Auxiliary class "itself" has disappeared -- classes without any
2101 parameter are treated as expected by the 'class' command.
2103 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
2105 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
2106 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
2108 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
2109 method "approximation". It proves formulas on real values by using
2110 interval arithmetic. In the formulas are also the transcendental
2111 functions sin, cos, tan, atan, ln, exp and the constant pi are
2112 allowed. For examples see
2113 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
2115 * Theory "Reflection" now resides in HOL/Library.
2117 * Entry point to Word library now simply named "Word".
2120 * Made source layout more coherent with logical distribution
2123 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
2124 src/HOL/Library/Code_Message.thy ~> src/HOL/
2125 src/HOL/Library/GCD.thy ~> src/HOL/
2126 src/HOL/Library/Order_Relation.thy ~> src/HOL/
2127 src/HOL/Library/Parity.thy ~> src/HOL/
2128 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
2129 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
2130 src/HOL/Real/Lubs.thy ~> src/HOL/
2131 src/HOL/Real/PReal.thy ~> src/HOL/
2132 src/HOL/Real/Rational.thy ~> src/HOL/
2133 src/HOL/Real/RComplete.thy ~> src/HOL/
2134 src/HOL/Real/RealDef.thy ~> src/HOL/
2135 src/HOL/Real/RealPow.thy ~> src/HOL/
2136 src/HOL/Real/Real.thy ~> src/HOL/
2137 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
2138 src/HOL/Complex/Complex.thy ~> src/HOL/
2139 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
2140 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
2141 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
2142 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
2143 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
2144 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
2145 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
2146 src/HOL/Hyperreal/Log.thy ~> src/HOL/
2147 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
2148 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
2149 src/HOL/Hyperreal/Series.thy ~> src/HOL/
2150 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
2151 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
2152 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
2153 src/HOL/Real/Float ~> src/HOL/Library/
2154 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
2155 src/HOL/Real/RealVector.thy ~> src/HOL/
2157 src/HOL/arith_data.ML ~> src/HOL/Tools
2158 src/HOL/hologic.ML ~> src/HOL/Tools
2159 src/HOL/simpdata.ML ~> src/HOL/Tools
2160 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
2161 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
2162 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
2163 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
2164 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
2165 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
2166 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
2168 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
2169 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
2170 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
2171 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
2172 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
2173 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
2175 * If methods "eval" and "evaluation" encounter a structured proof
2176 state with !!/==>, only the conclusion is evaluated to True (if
2177 possible), avoiding strange error messages.
2179 * Method "sizechange" automates termination proofs using (a
2180 modification of) the size-change principle. Requires SAT solver. See
2181 src/HOL/ex/Termination.thy for examples.
2183 * Simplifier: simproc for let expressions now unfolds if bound
2184 variable occurs at most once in let expression body. INCOMPATIBILITY.
2186 * Method "arith": Linear arithmetic now ignores all inequalities when
2187 fast_arith_neq_limit is exceeded, instead of giving up entirely.
2189 * New attribute "arith" for facts that should always be used
2190 automatically by arithmetic. It is intended to be used locally in
2193 assumes [arith]: "x > 0"
2195 Global usage is discouraged because of possible performance impact.
2197 * New classes "top" and "bot" with corresponding operations "top" and
2198 "bot" in theory Orderings; instantiation of class "complete_lattice"
2199 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
2201 * Changed definition lemma "less_fun_def" in order to provide an
2202 instance for preorders on functions; use lemma "less_le" instead.
2205 * Theory Orderings: class "wellorder" moved here, with explicit
2206 induction rule "less_induct" as assumption. For instantiation of
2207 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
2210 * Theory Orderings: added class "preorder" as superclass of "order".
2211 INCOMPATIBILITY: Instantiation proofs for order, linorder
2212 etc. slightly changed. Some theorems named order_class.* now named
2215 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
2218 * Theory Finite_Set: added a new fold combinator of type
2220 ('a => 'b => 'b) => 'b => 'a set => 'b
2222 Occasionally this is more convenient than the old fold combinator
2223 which is now defined in terms of the new one and renamed to
2226 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
2227 and "ring_simps" have been replaced by "algebra_simps" (which can be
2228 extended with further lemmas!). At the moment both still exist but
2229 the former will disappear at some point.
2231 * Theory Power: Lemma power_Suc is now declared as a simp rule in
2232 class recpower. Type-specific simp rules for various recpower types
2233 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
2235 rat_power_0 -> power_0
2236 rat_power_Suc -> power_Suc
2237 realpow_0 -> power_0
2238 realpow_Suc -> power_Suc
2239 complexpow_0 -> power_0
2240 complexpow_Suc -> power_Suc
2241 power_poly_0 -> power_0
2242 power_poly_Suc -> power_Suc
2244 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
2245 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
2246 dvd has been generalized to class comm_semiring_1. Likewise a bunch
2247 of lemmas from Divides has been generalized from nat to class
2248 semiring_div. INCOMPATIBILITY. This involves the following theorem
2249 renames resulting from duplicate elimination:
2251 dvd_def_mod ~> dvd_eq_mod_eq_0
2252 zero_dvd_iff ~> dvd_0_left_iff
2253 dvd_0 ~> dvd_0_right
2254 DIVISION_BY_ZERO_DIV ~> div_by_0
2255 DIVISION_BY_ZERO_MOD ~> mod_by_0
2256 mult_div ~> div_mult_self2_is_id
2257 mult_mod ~> mod_mult_self2_is_0
2259 * Theory IntDiv: removed many lemmas that are instances of class-based
2260 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
2261 rename old lemmas as follows:
2263 dvd_diff -> nat_dvd_diff
2264 dvd_zminus_iff -> dvd_minus_iff
2265 mod_add1_eq -> mod_add_eq
2266 mod_mult1_eq -> mod_mult_right_eq
2267 mod_mult1_eq' -> mod_mult_left_eq
2268 mod_mult_distrib_mod -> mod_mult_eq
2269 nat_mod_add_left_eq -> mod_add_left_eq
2270 nat_mod_add_right_eq -> mod_add_right_eq
2271 nat_mod_div_trivial -> mod_div_trivial
2272 nat_mod_mod_trivial -> mod_mod_trivial
2273 zdiv_zadd_self1 -> div_add_self1
2274 zdiv_zadd_self2 -> div_add_self2
2275 zdiv_zmult_self1 -> div_mult_self2_is_id
2276 zdiv_zmult_self2 -> div_mult_self1_is_id
2277 zdvd_triv_left -> dvd_triv_left
2278 zdvd_triv_right -> dvd_triv_right
2279 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
2280 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
2281 zmod_zadd_left_eq -> mod_add_left_eq
2282 zmod_zadd_right_eq -> mod_add_right_eq
2283 zmod_zadd_self1 -> mod_add_self1
2284 zmod_zadd_self2 -> mod_add_self2
2285 zmod_zadd1_eq -> mod_add_eq
2286 zmod_zdiff1_eq -> mod_diff_eq
2287 zmod_zdvd_zmod -> mod_mod_cancel
2288 zmod_zmod_cancel -> mod_mod_cancel
2289 zmod_zmult_self1 -> mod_mult_self2_is_0
2290 zmod_zmult_self2 -> mod_mult_self1_is_0
2293 zdvd_abs1 -> abs_dvd_iff
2294 zdvd_abs2 -> dvd_abs_iff
2295 zdvd_refl -> dvd_refl
2296 zdvd_trans -> dvd_trans
2297 zdvd_zadd -> dvd_add
2298 zdvd_zdiff -> dvd_diff
2299 zdvd_zminus_iff -> dvd_minus_iff
2300 zdvd_zminus2_iff -> minus_dvd_iff
2301 zdvd_zmultD -> dvd_mult_right
2302 zdvd_zmultD2 -> dvd_mult_left
2303 zdvd_zmult_mono -> mult_dvd_mono
2304 zdvd_0_right -> dvd_0_right
2305 zdvd_0_left -> dvd_0_left_iff
2306 zdvd_1_left -> one_dvd
2307 zminus_dvd_iff -> minus_dvd_iff
2309 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
2311 * The real numbers offer decimal input syntax: 12.34 is translated
2312 into 1234/10^2. This translation is not reversed upon output.
2314 * Theory Library/Polynomial defines an abstract type 'a poly of
2315 univariate polynomials with coefficients of type 'a. In addition to
2316 the standard ring operations, it also supports div and mod. Code
2317 generation is also supported, using list-style constructors.
2319 * Theory Library/Inner_Product defines a class of real_inner for real
2320 inner product spaces, with an overloaded operation inner :: 'a => 'a
2321 => real. Class real_inner is a subclass of real_normed_vector from
2324 * Theory Library/Product_Vector provides instances for the product
2325 type 'a * 'b of several classes from RealVector and Inner_Product.
2326 Definitions of addition, subtraction, scalar multiplication, norms,
2327 and inner products are included.
2329 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
2330 addition to the field operations, numerals and case syntax are also
2333 * Theory Library/Diagonalize provides constructive version of Cantor's
2334 first diagonalization argument.
2336 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
2337 zlcm (for int); carried together from various gcd/lcm developements in
2338 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
2339 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
2340 may recover tupled syntax as follows:
2342 hide (open) const gcd
2343 abbreviation gcd where
2344 "gcd == (%(a, b). GCD.gcd a b)"
2346 GCD.gcd ("gcd '(_, _')")
2348 The same works for lcm, zgcd, zlcm.
2350 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
2351 instantiations for algebraic structures. Removed some duplicate
2352 theorems. Changes in simp rules. INCOMPATIBILITY.
2354 * ML antiquotation @{code} takes a constant as argument and generates
2355 corresponding code in background and inserts name of the corresponding
2356 resulting ML value/function/datatype constructor binding in place.
2357 All occurrences of @{code} with a single ML block are generated
2358 simultaneously. Provides a generic and safe interface for
2359 instrumentalizing code generation. See
2360 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
2361 In future you ought to refrain from ad-hoc compiling generated SML
2362 code on the ML toplevel. Note that (for technical reasons) @{code}
2363 cannot refer to constants for which user-defined serializations are
2364 set. Refer to the corresponding ML counterpart directly in that
2367 * Command 'rep_datatype': instead of theorem names the command now
2368 takes a list of terms denoting the constructors of the type to be
2369 represented as datatype. The characteristic theorems have to be
2370 proven. INCOMPATIBILITY. Also observe that the following theorems
2371 have disappeared in favour of existing ones:
2373 unit_induct ~> unit.induct
2374 prod_induct ~> prod.induct
2375 sum_induct ~> sum.induct
2376 Suc_Suc_eq ~> nat.inject
2377 Suc_not_Zero Zero_not_Suc ~> nat.distinct
2382 * New locales for orders and lattices where the equivalence relation
2383 is not restricted to equality. INCOMPATIBILITY: all order and lattice
2384 locales use a record structure with field eq for the equivalence.
2386 * New theory of factorial domains.
2388 * Units_l_inv and Units_r_inv are now simp rules by default.
2389 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
2390 and/or r_inv will now also require deletion of these lemmas.
2392 * Renamed the following theorems, INCOMPATIBILITY:
2394 UpperD ~> Upper_memD
2395 LowerD ~> Lower_memD
2396 least_carrier ~> least_closed
2397 greatest_carrier ~> greatest_closed
2398 greatest_Lower_above ~> greatest_Lower_below
2399 one_zero ~> carrier_one_zero
2400 one_not_zero ~> carrier_one_not_zero (collision with assumption)
2405 * Nominal datatypes can now contain type-variables.
2407 * Commands 'nominal_inductive' and 'equivariance' work with local
2410 * Nominal primrec can now works with local theory targets and its
2411 specification syntax now conforms to the general format as seen in
2414 * Method "perm_simp" honours the standard simplifier attributes
2415 (no_asm), (no_asm_use) etc.
2417 * The new predicate #* is defined like freshness, except that on the
2418 left hand side can be a set or list of atoms.
2420 * Experimental command 'nominal_inductive2' derives strong induction
2421 principles for inductive definitions. In contrast to
2422 'nominal_inductive', which can only deal with a fixed number of
2423 binders, it can deal with arbitrary expressions standing for sets of
2424 atoms to be avoided. The only inductive definition we have at the
2425 moment that needs this generalisation is the typing rule for Lets in
2428 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
2429 -----------------------------------------------------------------
2430 Gamma |- Let x be t1 in t2 : T2
2432 In this rule one wants to avoid all the binders that are introduced by
2433 "close Gamma T1". We are looking for other examples where this
2434 feature might be useful. Please let us know.
2439 * Reimplemented the simplification procedure for proving continuity
2440 subgoals. The new simproc is extensible; users can declare additional
2441 continuity introduction rules with the attribute [cont2cont].
2443 * The continuity simproc now uses a different introduction rule for
2444 solving continuity subgoals on terms with lambda abstractions. In
2445 some rare cases the new simproc may fail to solve subgoals that the
2446 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
2447 Potential INCOMPATIBILITY.
2449 * Command 'fixrec': specification syntax now conforms to the general
2450 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
2451 examples. INCOMPATIBILITY.
2456 * Proof of Zorn's Lemma for partial orders.
2461 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
2462 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
2463 depends on multithreading, so timouts will not work before Poly/ML
2466 * High-level support for concurrent ML programming, see
2467 src/Pure/Cuncurrent. The data-oriented model of "future values" is
2468 particularly convenient to organize independent functional
2469 computations. The concept of "synchronized variables" provides a
2470 higher-order interface for components with shared state, avoiding the
2471 delicate details of mutexes and condition variables. (Requires
2472 Poly/ML 5.2.1 or later.)
2474 * ML bindings produced via Isar commands are stored within the Isar
2475 context (theory or proof). Consequently, commands like 'use' and 'ML'
2476 become thread-safe and work with undo as expected (concerning
2477 top-level bindings, not side-effects on global references).
2478 INCOMPATIBILITY, need to provide proper Isar context when invoking the
2479 compiler at runtime; really global bindings need to be given outside a
2480 theory. (Requires Poly/ML 5.2 or later.)
2482 * Command 'ML_prf' is analogous to 'ML' but works within a proof
2483 context. Top-level ML bindings are stored within the proof context in
2484 a purely sequential fashion, disregarding the nested proof structure.
2485 ML bindings introduced by 'ML_prf' are discarded at the end of the
2486 proof. (Requires Poly/ML 5.2 or later.)
2488 * Simplified ML attribute and method setup, cf. functions Attrib.setup
2489 and Method.setup, as well as Isar commands 'attribute_setup' and
2490 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
2491 existing code accordingly, or use plain 'setup' together with old
2494 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
2495 to 'a -> thm, while results are always tagged with an authentic oracle
2496 name. The Isar command 'oracle' is now polymorphic, no argument type
2497 is specified. INCOMPATIBILITY, need to simplify existing oracle code
2498 accordingly. Note that extra performance may be gained by producing
2499 the cterm carefully, avoiding slow Thm.cterm_of.
2501 * Simplified interface for defining document antiquotations via
2502 ThyOutput.antiquotation, ThyOutput.output, and optionally
2503 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
2504 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
2507 * More systematic treatment of long names, abstract name bindings, and
2508 name space operations. Basic operations on qualified names have been
2509 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
2510 Long_Name.append. Old type bstring has been mostly replaced by
2511 abstract type binding (see structure Binding), which supports precise
2512 qualification by packages and local theory targets, as well as proper
2513 tracking of source positions. INCOMPATIBILITY, need to wrap old
2514 bstring values into Binding.name, or better pass through abstract
2515 bindings everywhere. See further src/Pure/General/long_name.ML,
2516 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
2518 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
2519 LocalTheory.note etc.) now refer to the *full* internal name, not the
2520 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
2522 * Disposed old type and term read functions (Sign.read_def_typ,
2523 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
2524 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
2525 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
2526 Syntax.read_term_global etc.; see also OldGoals.read_term as last
2527 resort for legacy applications.
2529 * Disposed old declarations, tactics, tactic combinators that refer to
2530 the simpset or claset of an implicit theory (such as Addsimps,
2531 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
2532 embedded ML text, or local_simpset_of with a proper context passed as
2533 explicit runtime argument.
2535 * Rules and tactics that read instantiations (read_instantiate,
2536 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
2537 context, which is required for parsing and type-checking. Moreover,
2538 the variables are specified as plain indexnames, not string encodings
2539 thereof. INCOMPATIBILITY.
2541 * Generic Toplevel.add_hook interface allows to analyze the result of
2542 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
2543 for theorem dependency output of transactions resulting in a new
2546 * ML antiquotations: block-structured compilation context indicated by
2547 \<lbrace> ... \<rbrace>; additional antiquotation forms:
2549 @{binding name} - basic name binding
2550 @{let ?pat = term} - term abbreviation (HO matching)
2551 @{note name = fact} - fact abbreviation
2552 @{thm fact} - singleton fact (with attributes)
2553 @{thms fact} - general fact (with attributes)
2554 @{lemma prop by method} - singleton goal
2555 @{lemma prop by meth1 meth2} - singleton goal
2556 @{lemma prop1 ... propN by method} - general goal
2557 @{lemma prop1 ... propN by meth1 meth2} - general goal
2558 @{lemma (open) ...} - open derivation
2563 * The Isabelle "emacs" tool provides a specific interface to invoke
2564 Proof General / Emacs, with more explicit failure if that is not
2565 installed (the old isabelle-interface script silently falls back on
2566 isabelle-process). The PROOFGENERAL_HOME setting determines the
2567 installation location of the Proof General distribution.
2569 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
2570 the Isabelle process into a JVM/Scala application. See
2571 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
2572 process wrapper has been discontinued.)
2574 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
2576 * Various status messages (with exact source position information) are
2577 emitted, if proper markup print mode is enabled. This allows
2578 user-interface components to provide detailed feedback on internal
2583 New in Isabelle2008 (June 2008)
2584 -------------------------------
2588 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
2589 and updated, with formally checked references as hyperlinks.
2591 * Theory loader: use_thy (and similar operations) no longer set the
2592 implicit ML context, which was occasionally hard to predict and in
2593 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
2594 provides a proper context already.
2596 * Theory loader: old-style ML proof scripts being *attached* to a thy
2597 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
2598 'use' within a theory file will do the job.
2600 * Name space merge now observes canonical order, i.e. the second space
2601 is inserted into the first one, while existing entries in the first
2602 space take precedence. INCOMPATIBILITY in rare situations, may try to
2603 swap theory imports.
2605 * Syntax: symbol \<chi> is now considered a letter. Potential
2606 INCOMPATIBILITY in identifier syntax etc.
2608 * Outer syntax: string tokens no longer admit escaped white space,
2609 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
2610 white space without escapes.
2612 * Outer syntax: string tokens may contain arbitrary character codes
2613 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
2619 * Context-dependent token translations. Default setup reverts locally
2620 fixed variables, and adds hilite markup for undeclared frees.
2622 * Unused theorems can be found using the new command 'unused_thms'.
2623 There are three ways of invoking it:
2626 Only finds unused theorems in the current theory.
2628 (2) unused_thms thy_1 ... thy_n -
2629 Finds unused theorems in the current theory and all of its ancestors,
2630 excluding the theories thy_1 ... thy_n and all of their ancestors.
2632 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
2633 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
2634 their ancestors, excluding the theories thy_1 ... thy_n and all of
2637 In order to increase the readability of the list produced by
2638 unused_thms, theorems that have been created by a particular instance
2639 of a theory command such as 'inductive' or 'function' are considered
2640 to belong to the same "group", meaning that if at least one theorem in
2641 this group is used, the other theorems in the same group are no longer
2642 reported as unused. Moreover, if all theorems in the group are
2643 unused, only one theorem in the group is displayed.
2645 Note that proof objects have to be switched on in order for
2646 unused_thms to work properly (i.e. !proofs must be >= 1, which is
2647 usually the case when using Proof General with the default settings).
2649 * Authentic naming of facts disallows ad-hoc overwriting of previous
2650 theorems within the same name space. INCOMPATIBILITY, need to remove
2651 duplicate fact bindings, or even accidental fact duplications. Note
2652 that tools may maintain dynamically scoped facts systematically, using
2653 PureThy.add_thms_dynamic.
2655 * Command 'hide' now allows to hide from "fact" name space as well.
2657 * Eliminated destructive theorem database, simpset, claset, and
2658 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
2659 update of theories within ML code.
2661 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2662 INCOMPATIBILITY, object-logics depending on former Pure require
2663 additional setup PureThy.old_appl_syntax_setup; object-logics
2664 depending on former CPure need to refer to Pure.
2666 * Commands 'use' and 'ML' are now purely functional, operating on
2667 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2668 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2671 * Command 'setup': discontinued implicit version with ML reference.
2673 * Instantiation target allows for simultaneous specification of class
2674 instance operations together with an instantiation proof.
2675 Type-checking phase allows to refer to class operations uniformly.
2676 See src/HOL/Complex/Complex.thy for an Isar example and
2677 src/HOL/Library/Eval.thy for an ML example.
2679 * Indexing of literal facts: be more serious about including only
2680 facts from the visible specification/proof context, but not the
2681 background context (locale etc.). Affects `prop` notation and method
2682 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2685 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2686 "(open)" option, which used to expose internal bound variables to the
2689 * Isar statements: removed obsolete case "rule_context".
2690 INCOMPATIBILITY, better use explicit fixes/assumes.
2692 * Locale proofs: default proof step now includes 'unfold_locales';
2693 hence 'proof' without argument may be used to unfold locale
2697 *** Document preparation ***
2699 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2700 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2701 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2702 spot); renamed link color from "darkblue" to "linkcolor" (default
2703 value unchanged, can be redefined via \definecolor); no longer sets
2704 "a4paper" option (unnecessary or even intrusive).
2706 * Antiquotation @{lemma A method} proves proposition A by the given
2707 method (either a method name or a method name plus (optional) method
2708 arguments in parentheses) and prints A just like @{prop A}.
2713 * New primrec package. Specification syntax conforms in style to
2714 definition/function/.... No separate induction rule is provided. The
2715 "primrec" command distinguishes old-style and new-style specifications
2716 by syntax. The former primrec package is now named OldPrimrecPackage.
2717 When adjusting theories, beware: constants stemming from new-style
2718 primrec specifications have authentic syntax.
2720 * Metis prover is now an order of magnitude faster, and also works
2721 with multithreading.
2723 * Metis: the maximum number of clauses that can be produced from a
2724 theorem is now given by the attribute max_clauses. Theorems that
2725 exceed this number are ignored, with a warning printed.
2727 * Sledgehammer no longer produces structured proofs by default. To
2728 enable, declare [[sledgehammer_full = true]]. Attributes
2729 reconstruction_modulus, reconstruction_sorts renamed
2730 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2732 * Method "induct_scheme" derives user-specified induction rules
2733 from well-founded induction and completeness of patterns. This factors
2734 out some operations that are done internally by the function package
2735 and makes them available separately. See
2736 src/HOL/ex/Induction_Scheme.thy for examples.
2738 * More flexible generation of measure functions for termination
2739 proofs: Measure functions can be declared by proving a rule of the
2740 form "is_measure f" and giving it the [measure_function] attribute.
2741 The "is_measure" predicate is logically meaningless (always true), and
2742 just guides the heuristic. To find suitable measure functions, the
2743 termination prover sets up the goal "is_measure ?f" of the appropriate
2744 type and generates all solutions by prolog-style backwards proof using
2747 This setup also deals with rules like
2749 "is_measure f ==> is_measure (list_size f)"
2751 which accommodates nested datatypes that recurse through lists.
2752 Similar rules are predeclared for products and option types.
2754 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2758 - Definitions of overloaded constants on sets have to be replaced by
2759 definitions on => and bool.
2761 - Some definitions of overloaded operators on sets can now be proved
2762 using the definitions of the operators on => and bool. Therefore,
2763 the following theorems have been renamed:
2765 subset_def -> subset_eq
2766 psubset_def -> psubset_eq
2767 set_diff_def -> set_diff_eq
2768 Compl_def -> Compl_eq
2769 Sup_set_def -> Sup_set_eq
2770 Inf_set_def -> Inf_set_eq
2771 sup_set_def -> sup_set_eq
2772 inf_set_def -> inf_set_eq
2774 - Due to the incompleteness of the HO unification algorithm, some
2775 rules such as subst may require manual instantiation, if some of
2776 the unknowns in the rule is a set.
2778 - Higher order unification and forward proofs:
2781 have "P (S::'a set)" <...>
2782 then have "EX S. P S" ..
2784 no longer works (due to the incompleteness of the HO unification
2785 algorithm) and must be replaced by the pattern
2792 - Calculational reasoning with subst (or similar rules):
2795 have "P (S::'a set)" <...>
2796 also have "S = T" <...>
2797 finally have "P T" .
2799 no longer works (for similar reasons as the previous example) and
2800 must be replaced by something like
2802 have "P (S::'a set)" <...>
2803 moreover have "S = T" <...>
2804 ultimately have "P T" by simp
2806 - Tactics or packages written in ML code:
2807 Code performing pattern matching on types via
2809 Type ("set", [T]) => ...
2811 must be rewritten. Moreover, functions like strip_type or
2812 binder_types no longer return the right value when applied to a
2815 T1 => ... => Tn => U => bool
2819 T1 => ... => Tn => U set
2821 * Merged theories Wellfounded_Recursion, Accessible_Part and
2822 Wellfounded_Relations to theory Wellfounded.
2824 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2826 * Class finite no longer treats UNIV as class parameter. Use class
2827 enum from theory Library/Enum instead to achieve a similar effect.
2830 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2831 and "Cons". INCOMPATIBILITY.
2833 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2834 Potential INCOMPATIBILITY.
2836 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2837 injective_fst_snd removed, use split_eta and prod_eqI instead.
2838 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2840 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2841 the same name in theory Orderings:
2851 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2852 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2853 and different variable names.
2855 * Library/Option_ord.thy: Canonical order on option type.
2857 * Library/RBT.thy: Red-black trees, an efficient implementation of
2860 * Library/Countable.thy: Type class for countable types.
2862 * Theory Int: The representation of numerals has changed. The infix
2863 operator BIT and the bit datatype with constructors B0 and B1 have
2864 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2865 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2866 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2869 * Theory Nat: definition of <= and < on natural numbers no longer
2870 depend on well-founded relations. INCOMPATIBILITY. Definitions
2871 le_def and less_def have disappeared. Consider lemmas not_less
2872 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2874 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2875 (whose purpose mainly is for various fold_set functionals) have been
2876 abandoned in favor of the existing algebraic classes
2877 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2878 lower_semilattice (resp. upper_semilattice) and linorder.
2881 * Theory Transitive_Closure: induct and cases rules now declare proper
2882 case_names ("base" and "step"). INCOMPATIBILITY.
2884 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2885 lattices. The form set-specific version is available as
2886 Inductive.lfp_ordinal_induct_set.
2888 * Renamed theorems "power.simps" to "power_int.simps".
2891 * Class semiring_div provides basic abstract properties of semirings
2892 with division and modulo operations. Subsumes former class dvd_mod.
2894 * Merged theories IntDef, Numeral and IntArith into unified theory
2895 Int. INCOMPATIBILITY.
2897 * Theory Library/Code_Index: type "index" now represents natural
2898 numbers rather than integers. INCOMPATIBILITY.
2900 * New class "uminus" with operation "uminus" (split of from class
2901 "minus" which now only has operation "minus", binary).
2904 * Constants "card", "internal_split", "option_map" now with authentic
2905 syntax. INCOMPATIBILITY.
2907 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2908 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2909 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2910 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2911 Sup_set_def, le_def, less_def, option_map_def now with object
2912 equality. INCOMPATIBILITY.
2914 * Records. Removed K_record, and replaced it by pure lambda term
2915 %x. c. The simplifier setup is now more robust against eta expansion.
2916 INCOMPATIBILITY: in cases explicitly referring to K_record.
2918 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2920 * Library/ListVector: new theory of arithmetic vector operations.
2922 * Library/Order_Relation: new theory of various orderings as sets of
2923 pairs. Defines preorders, partial orders, linear orders and
2924 well-orders on sets and on types.
2929 * Renamed some theories to allow to loading both ZF and HOL in the
2932 Datatype -> Datatype_ZF
2933 Inductive -> Inductive_ZF
2940 INCOMPATIBILITY: ZF theories that import individual theories below
2941 Main might need to be adapted. Regular theory Main is still
2942 available, as trivial extension of Main_ZF.
2947 * ML within Isar: antiquotation @{const name} or @{const
2948 name(typargs)} produces statically-checked Const term.
2950 * Functor NamedThmsFun: data is available to the user as dynamic fact
2951 (of the same name). Removed obsolete print command.
2953 * Removed obsolete "use_legacy_bindings" function.
2955 * The ``print mode'' is now a thread-local value derived from a global
2956 template (the former print_mode reference), thus access becomes
2957 non-critical. The global print_mode reference is for session
2958 management only; user-code should use print_mode_value,
2959 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2961 * Functions system/system_out provide a robust way to invoke external
2962 shell commands, with propagation of interrupts (requires Poly/ML
2963 5.2.1). Do not use OS.Process.system etc. from the basis library!
2968 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2969 in accordance with Proof General 3.7, which prefers GNU emacs.
2971 * isatool tty runs Isabelle process with plain tty interaction;
2972 optional line editor may be specified via ISABELLE_LINE_EDITOR
2973 setting, the default settings attempt to locate "ledit" and "rlwrap".
2975 * isatool browser now works with Cygwin as well, using general
2976 "javapath" function defined in Isabelle process environment.
2978 * YXML notation provides a simple and efficient alternative to
2979 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2980 isatool yxml as described in the Isabelle system manual.
2982 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2983 provides general wrapper for managing an Isabelle process in a robust
2984 fashion, with ``cooked'' output from stdin/stderr.
2986 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2987 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2989 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2990 way of changing the user's settings is via
2991 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2994 * Multithreading.max_threads := 0 refers to the number of actual CPU
2995 cores of the underlying machine, which is a good starting point for
2996 optimal performance tuning. The corresponding usedir option -M allows
2997 "max" as an alias for "0". WARNING: does not work on certain versions
2998 of Mac OS (with Poly/ML 5.1).
3000 * isabelle-process: non-ML sessions are run with "nice", to reduce the
3001 adverse effect of Isabelle flooding interactive front-ends (notably
3002 ProofGeneral / XEmacs).
3006 New in Isabelle2007 (November 2007)
3007 -----------------------------------
3011 * More uniform information about legacy features, notably a
3012 warning/error of "Legacy feature: ...", depending on the state of the
3013 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
3014 legacy features will disappear eventually.
3016 * Theory syntax: the header format ``theory A = B + C:'' has been
3017 discontinued in favour of ``theory A imports B C begin''. Use isatool
3018 fixheaders to convert existing theory files. INCOMPATIBILITY.
3020 * Theory syntax: the old non-Isar theory file format has been
3021 discontinued altogether. Note that ML proof scripts may still be used
3022 with Isar theories; migration is usually quite simple with the ML
3023 function use_legacy_bindings. INCOMPATIBILITY.
3025 * Theory syntax: some popular names (e.g. 'class', 'declaration',
3026 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
3029 * Theory loader: be more serious about observing the static theory
3030 header specifications (including optional directories), but not the
3031 accidental file locations of previously successful loads. The strict
3032 update policy of former update_thy is now already performed by
3033 use_thy, so the former has been removed; use_thys updates several
3034 theories simultaneously, just as 'imports' within a theory header
3035 specification, but without merging the results. Potential
3036 INCOMPATIBILITY: may need to refine theory headers and commands
3037 ROOT.ML which depend on load order.
3039 * Theory loader: optional support for content-based file
3040 identification, instead of the traditional scheme of full physical
3041 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
3042 (cf. the system manual). The new scheme allows to work with
3043 non-finished theories in persistent session images, such that source
3044 files may be moved later on without requiring reloads.
3046 * Theory loader: old-style ML proof scripts being *attached* to a thy
3047 file (with the same base name as the theory) are considered a legacy
3048 feature, which will disappear eventually. Even now, the theory loader
3049 no longer maintains dependencies on such files.
3051 * Syntax: the scope for resolving ambiguities via type-inference is
3052 now limited to individual terms, instead of whole simultaneous
3053 specifications as before. This greatly reduces the complexity of the
3054 syntax module and improves flexibility by separating parsing and
3055 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
3056 'fixes' etc.) are required in rare situations.
3058 * Syntax: constants introduced by new-style packages ('definition',
3059 'abbreviation' etc.) are passed through the syntax module in
3060 ``authentic mode''. This means that associated mixfix annotations
3061 really stick to such constants, independently of potential name space
3062 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
3063 trees are represented slightly differently, may need to adapt syntax
3064 translations accordingly. Use CONST marker in 'translations' and
3065 @{const_syntax} antiquotation in 'parse_translation' etc.
3067 * Legacy goal package: reduced interface to the bare minimum required
3068 to keep existing proof scripts running. Most other user-level
3069 functions are now part of the OldGoals structure, which is *not* open
3070 by default (consider isatool expandshort before open OldGoals).
3071 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
3072 these tend to cause confusion about the actual goal (!) context being
3073 used here, which is not necessarily the same as the_context().
3075 * Command 'find_theorems': supports "*" wild-card in "name:"
3076 criterion; "with_dups" option. Certain ProofGeneral versions might
3077 support a specific search form (see ProofGeneral/CHANGES).
3079 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
3080 by default, which means that "prems" (and also "fixed variables") are
3081 suppressed from proof state output. Note that the ProofGeneral
3082 settings mechanism allows to change and save options persistently, but
3083 older versions of Isabelle will fail to start up if a negative prems
3086 * Local theory targets may be specified by non-nested blocks of
3087 ``context/locale/class ... begin'' followed by ``end''. The body may
3088 contain definitions, theorems etc., including any derived mechanism
3089 that has been implemented on top of these primitives. This concept
3090 generalizes the existing ``theorem (in ...)'' towards more versatility
3093 * Proof General interface: proper undo of final 'end' command;
3094 discontinued Isabelle/classic mode (ML proof scripts).
3097 *** Document preparation ***
3099 * Added antiquotation @{theory name} which prints the given name,
3100 after checking that it refers to a valid ancestor theory in the
3103 * Added antiquotations @{ML_type text} and @{ML_struct text} which
3104 check the given source text as ML type/structure, printing verbatim.
3106 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
3107 "c args == rhs" given in the current context. (Any number of
3108 arguments may be given on the LHS.)
3113 * The 'class' package offers a combination of axclass and locale to
3114 achieve Haskell-like type classes in Isabelle. Definitions and
3115 theorems within a class context produce both relative results (with
3116 implicit parameters according to the locale context), and polymorphic
3117 constants with qualified polymorphism (according to the class
3118 context). Within the body context of a 'class' target, a separate
3119 syntax layer ("user space type system") takes care of converting
3120 between global polymorphic consts and internal locale representation.
3121 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
3122 "isatool doc classes" provides a tutorial.
3124 * Generic code generator framework allows to generate executable
3125 code for ML and Haskell (including Isabelle classes). A short usage
3128 internal compilation:
3129 export_code <list of constants (term syntax)> in SML
3130 writing SML code to a file:
3131 export_code <list of constants (term syntax)> in SML <filename>
3132 writing OCaml code to a file:
3133 export_code <list of constants (term syntax)> in OCaml <filename>
3134 writing Haskell code to a bunch of files:
3135 export_code <list of constants (term syntax)> in Haskell <filename>
3137 evaluating closed propositions to True/False using code generation:
3140 Reasonable default setup of framework in HOL.
3142 Theorem attributs for selecting and transforming function equations theorems:
3144 [code fun]: select a theorem as function equation for a specific constant
3145 [code fun del]: deselect a theorem as function equation for a specific constant
3146 [code inline]: select an equation theorem for unfolding (inlining) in place
3147 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
3149 User-defined serializations (target in {SML, OCaml, Haskell}):
3151 code_const <and-list of constants (term syntax)>
3152 {(target) <and-list of const target syntax>}+
3154 code_type <and-list of type constructors>
3155 {(target) <and-list of type target syntax>}+
3157 code_instance <and-list of instances>
3159 where instance ::= <type constructor> :: <class>
3161 code_class <and_list of classes>
3162 {(target) <and-list of class target syntax>}+
3163 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
3165 code_instance and code_class only are effective to target Haskell.
3167 For example usage see src/HOL/ex/Codegenerator.thy and
3168 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
3169 generation from Isabelle/HOL theories is available via "isatool doc
3172 * Code generator: consts in 'consts_code' Isar commands are now
3173 referred to by usual term syntax (including optional type
3176 * Command 'no_translations' removes translation rules from theory
3179 * Overloaded definitions are now actually checked for acyclic
3180 dependencies. The overloading scheme is slightly more general than
3181 that of Haskell98, although Isabelle does not demand an exact
3182 correspondence to type class and instance declarations.
3183 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
3184 exotic versions of overloading -- at the discretion of the user!
3186 Polymorphic constants are represented via type arguments, i.e. the
3187 instantiation that matches an instance against the most general
3188 declaration given in the signature. For example, with the declaration
3189 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
3190 as c(nat). Overloading is essentially simultaneous structural
3191 recursion over such type arguments. Incomplete specification patterns
3192 impose global constraints on all occurrences, e.g. c('a * 'a) on the
3193 LHS means that more general c('a * 'b) will be disallowed on any RHS.
3194 Command 'print_theory' outputs the normalized system of recursive
3195 equations, see section "definitions".
3197 * Configuration options are maintained within the theory or proof
3198 context (with name and type bool/int/string), providing a very simple
3199 interface to a poor-man's version of general context data. Tools may
3200 declare options in ML (e.g. using Attrib.config_int) and then refer to
3201 these values using Config.get etc. Users may change options via an
3202 associated attribute of the same name. This form of context
3203 declaration works particularly well with commands 'declare' or
3204 'using', for example ``declare [[foo = 42]]''. Thus it has become
3205 very easy to avoid global references, which would not observe Isar
3206 toplevel undo/redo and fail to work with multithreading.
3208 Various global ML references of Pure and HOL have been turned into
3209 configuration options:
3211 Unify.search_bound unify_search_bound
3212 Unify.trace_bound unify_trace_bound
3213 Unify.trace_simp unify_trace_simp
3214 Unify.trace_types unify_trace_types
3215 Simplifier.simp_depth_limit simp_depth_limit
3216 Blast.depth_limit blast_depth_limit
3217 DatatypeProp.dtK datatype_distinctness_limit
3218 fast_arith_neq_limit fast_arith_neq_limit
3219 fast_arith_split_limit fast_arith_split_limit
3221 * Named collections of theorems may be easily installed as context
3222 data using the functor NamedThmsFun (see also
3223 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
3224 attributes; there is also a toplevel print command. This facility is
3225 just a common case of general context data, which is the preferred way
3226 for anything more complex than just a list of facts in canonical
3229 * Isar: command 'declaration' augments a local theory by generic
3230 declaration functions written in ML. This enables arbitrary content
3231 being added to the context, depending on a morphism that tells the
3232 difference of the original declaration context wrt. the application
3233 context encountered later on.
3235 * Isar: proper interfaces for simplification procedures. Command
3236 'simproc_setup' declares named simprocs (with match patterns, and body
3237 text in ML). Attribute "simproc" adds/deletes simprocs in the current
3238 context. ML antiquotation @{simproc name} retrieves named simprocs.
3240 * Isar: an extra pair of brackets around attribute declarations
3241 abbreviates a theorem reference involving an internal dummy fact,
3242 which will be ignored later --- only the effect of the attribute on
3243 the background context will persist. This form of in-place
3244 declarations is particularly useful with commands like 'declare' and
3245 'using', for example ``have A using [[simproc a]] by simp''.
3247 * Isar: method "assumption" (and implicit closing of subproofs) now
3248 takes simple non-atomic goal assumptions into account: after applying
3249 an assumption as a rule the resulting subgoals are solved by atomic
3250 assumption steps. This is particularly useful to finish 'obtain'
3251 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
3252 without referring to the original premise "!!x. P x ==> thesis" in the
3253 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
3256 * Isar: implicit use of prems from the Isar proof context is
3257 considered a legacy feature. Common applications like ``have A .''
3258 may be replaced by ``have A by fact'' or ``note `A`''. In general,
3259 referencing facts explicitly here improves readability and
3260 maintainability of proof texts.
3262 * Isar: improper proof element 'guess' is like 'obtain', but derives
3263 the obtained context from the course of reasoning! For example:
3265 assume "EX x y. A x & B y" -- "any previous fact"
3266 then guess x and y by clarify
3268 This technique is potentially adventurous, depending on the facts and
3269 proof tools being involved here.
3271 * Isar: known facts from the proof context may be specified as literal
3272 propositions, using ASCII back-quote syntax. This works wherever
3273 named facts used to be allowed so far, in proof commands, proof
3274 methods, attributes etc. Literal facts are retrieved from the context
3275 according to unification of type and term parameters. For example,
3276 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
3277 theorems in the current context, then these are valid literal facts:
3278 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
3280 There is also a proof method "fact" which does the same composition
3281 for explicit goal states, e.g. the following proof texts coincide with
3282 certain special cases of literal facts:
3284 have "A" by fact == note `A`
3285 have "A ==> B" by fact == note `A ==> B`
3286 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
3287 have "P a ==> Q a" by fact == note `P a ==> Q a`
3289 * Isar: ":" (colon) is no longer a symbolic identifier character in
3290 outer syntax. Thus symbolic identifiers may be used without
3291 additional white space in declarations like this: ``assume *: A''.
3293 * Isar: 'print_facts' prints all local facts of the current context,
3294 both named and unnamed ones.
3296 * Isar: 'def' now admits simultaneous definitions, e.g.:
3298 def x == "t" and y == "u"
3300 * Isar: added command 'unfolding', which is structurally similar to
3301 'using', but affects both the goal state and facts by unfolding given
3302 rewrite rules. Thus many occurrences of the 'unfold' method or
3303 'unfolded' attribute may be replaced by first-class proof text.
3305 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
3306 and command 'unfolding' now all support object-level equalities
3307 (potentially conditional). The underlying notion of rewrite rule is
3308 analogous to the 'rule_format' attribute, but *not* that of the
3309 Simplifier (which is usually more generous).
3311 * Isar: the new attribute [rotated n] (default n = 1) rotates the
3312 premises of a theorem by n. Useful in conjunction with drule.
3314 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
3315 method expression within a sandbox consisting of the first N
3316 sub-goals, which need to exist. For example, ``simp_all [3]''
3317 simplifies the first three sub-goals, while (rule foo, simp_all)[]
3318 simplifies all new goals that emerge from applying rule foo to the
3319 originally first one.
3321 * Isar: schematic goals are no longer restricted to higher-order
3322 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
3325 * Isar: the conclusion of a long theorem statement is now either
3326 'shows' (a simultaneous conjunction, as before), or 'obtains'
3327 (essentially a disjunction of cases with local parameters and
3328 assumptions). The latter allows to express general elimination rules
3329 adequately; in this notation common elimination rules look like this:
3331 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
3333 obtains x where "P x"
3335 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
3339 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
3345 The subsequent classical rules even refer to the formal "thesis"
3348 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
3351 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
3352 obtains "thesis ==> something"
3354 The actual proof of an 'obtains' statement is analogous to that of the
3355 Isar proof element 'obtain', only that there may be several cases.
3356 Optional case names may be specified in parentheses; these will be
3357 available both in the present proof and as annotations in the
3358 resulting rule, for later use with the 'cases' method (cf. attribute
3361 * Isar: the assumptions of a long theorem statement are available as
3362 "assms" fact in the proof context. This is more appropriate than the
3363 (historical) "prems", which refers to all assumptions of the current
3364 context, including those from the target locale, proof body etc.
3366 * Isar: 'print_statement' prints theorems from the current theory or
3367 proof context in long statement form, according to the syntax of a
3370 * Isar: 'obtain' takes an optional case name for the local context
3371 introduction rule (default "that").
3373 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
3374 explicit (is "_ ==> ?foo") in the rare cases where this still happens
3377 * Pure: syntax "CONST name" produces a fully internalized constant
3378 according to the current context. This is particularly useful for
3379 syntax translations that should refer to internal constant
3380 representations independently of name spaces.
3382 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
3383 instead of "FOO ". This allows multiple binder declarations to coexist
3384 in the same context. INCOMPATIBILITY.
3386 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
3387 primitive that also works in a locale context (both for constants and
3388 fixed variables). Type declaration and internal syntactic representation
3389 of given constants retrieved from the context. Likewise, the
3390 'no_notation' command allows to remove given syntax annotations from the
3393 * Isar/locales: new derived specification elements 'axiomatization',
3394 'definition', 'abbreviation', which support type-inference, admit
3395 object-level specifications (equality, equivalence). See also the
3396 isar-ref manual. Examples:
3399 eq (infix "===" 50) where
3400 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
3402 definition "f x y = x + y + 1"
3403 definition g where "g x = f x x"
3406 neq (infix "=!=" 50) where
3407 "x =!= y == ~ (x === y)"
3409 These specifications may be also used in a locale context. Then the
3410 constants being introduced depend on certain fixed parameters, and the
3411 constant name is qualified by the locale base name. An internal
3412 abbreviation takes care for convenient input and output, making the
3413 parameters implicit and using the original short name. See also
3414 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
3415 entities from a monomorphic theory.
3417 Presently, abbreviations are only available 'in' a target locale, but
3418 not inherited by general import expressions. Also note that
3419 'abbreviation' may be used as a type-safe replacement for 'syntax' +
3420 'translations' in common applications. The "no_abbrevs" print mode
3421 prevents folding of abbreviations in term output.
3423 Concrete syntax is attached to specified constants in internal form,
3424 independently of name spaces. The parse tree representation is
3425 slightly different -- use 'notation' instead of raw 'syntax', and
3426 'translations' with explicit "CONST" markup to accommodate this.
3428 * Pure/Isar: unified syntax for new-style specification mechanisms
3429 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
3430 full type inference and dummy patterns ("_"). For example:
3432 definition "K x _ = x"
3434 inductive conj for A B
3435 where "A ==> B ==> conj A B"
3437 * Pure: command 'print_abbrevs' prints all constant abbreviations of
3438 the current context. Print mode "no_abbrevs" prevents inversion of
3439 abbreviations on output.
3441 * Isar/locales: improved parameter handling: use of locales "var" and
3442 "struct" no longer necessary; - parameter renamings are no longer
3443 required to be injective. For example, this allows to define
3444 endomorphisms as locale endom = homom mult mult h.
3446 * Isar/locales: changed the way locales with predicates are defined.
3447 Instead of accumulating the specification, the imported expression is
3448 now an interpretation. INCOMPATIBILITY: different normal form of
3449 locale expressions. In particular, in interpretations of locales with
3450 predicates, goals repesenting already interpreted fragments are not
3451 removed automatically. Use methods `intro_locales' and
3452 `unfold_locales'; see below.
3454 * Isar/locales: new methods `intro_locales' and `unfold_locales'
3455 provide backward reasoning on locales predicates. The methods are
3456 aware of interpretations and discharge corresponding goals.
3457 `intro_locales' is less aggressive then `unfold_locales' and does not
3458 unfold predicates to assumptions.
3460 * Isar/locales: the order in which locale fragments are accumulated
3461 has changed. This enables to override declarations from fragments due
3462 to interpretations -- for example, unwanted simp rules.
3464 * Isar/locales: interpretation in theories and proof contexts has been
3465 extended. One may now specify (and prove) equations, which are
3466 unfolded in interpreted theorems. This is useful for replacing
3467 defined concepts (constants depending on locale parameters) by
3468 concepts already existing in the target context. Example:
3470 interpretation partial_order ["op <= :: [int, int] => bool"]
3471 where "partial_order.less (op <=) (x::int) y = (x < y)"
3473 Typically, the constant `partial_order.less' is created by a
3474 definition specification element in the context of locale
3477 * Method "induct": improved internal context management to support
3478 local fixes and defines on-the-fly. Thus explicit meta-level
3479 connectives !! and ==> are rarely required anymore in inductive goals
3480 (using object-logic connectives for this purpose has been long
3481 obsolete anyway). Common proof patterns are explained in
3482 src/HOL/Induct/Common_Patterns.thy, see also
3483 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
3486 * Method "induct": improved handling of simultaneous goals. Instead of
3487 introducing object-level conjunction, the statement is now split into
3488 several conclusions, while the corresponding symbolic cases are nested
3489 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
3490 see src/HOL/Induct/Common_Patterns.thy, for example.
3492 * Method "induct": mutual induction rules are now specified as a list
3493 of rule sharing the same induction cases. HOL packages usually provide
3494 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
3495 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
3496 mutual induction rules differently, i.e. like this:
3498 (induct rule: foo_bar.inducts)
3499 (induct set: foo bar)
3500 (induct pred: foo bar)
3501 (induct type: foo bar)
3503 The ML function ProjectRule.projections turns old-style rules into the
3506 * Method "coinduct": dual of induction, see
3507 src/HOL/Library/Coinductive_List.thy for various examples.
3509 * Method "cases", "induct", "coinduct": the ``(open)'' option is
3510 considered a legacy feature.
3512 * Attribute "symmetric" produces result with standardized schematic
3513 variables (index 0). Potential INCOMPATIBILITY.
3515 * Simplifier: by default the simplifier trace only shows top level
3516 rewrites now. That is, trace_simp_depth_limit is set to 1 by
3517 default. Thus there is less danger of being flooded by the trace. The
3518 trace indicates where parts have been suppressed.
3520 * Provers/classical: removed obsolete classical version of elim_format
3521 attribute; classical elim/dest rules are now treated uniformly when
3522 manipulating the claset.
3524 * Provers/classical: stricter checks to ensure that supplied intro,
3525 dest and elim rules are well-formed; dest and elim rules must have at
3528 * Provers/classical: attributes dest/elim/intro take an optional
3529 weight argument for the rule (just as the Pure versions). Weights are
3530 ignored by automated tools, but determine the search order of single
3533 * Syntax: input syntax now supports dummy variable binding "%_. b",
3534 where the body does not mention the bound variable. Note that dummy
3535 patterns implicitly depend on their context of bounds, which makes
3536 "{_. _}" match any set comprehension as expected. Potential
3537 INCOMPATIBILITY -- parse translations need to cope with syntactic
3538 constant "_idtdummy" in the binding position.
3540 * Syntax: removed obsolete syntactic constant "_K" and its associated
3541 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
3542 for example "A -> B" => "Pi A (%_. B)".
3544 * Pure: 'class_deps' command visualizes the subclass relation, using
3545 the graph browser tool.
3547 * Pure: 'print_theory' now suppresses certain internal declarations by
3548 default; use '!' option for full details.
3553 * Method "metis" proves goals by applying the Metis general-purpose
3554 resolution prover (see also http://gilith.com/software/metis/).
3555 Examples are in the directory MetisExamples. WARNING: the
3556 Isabelle/HOL-Metis integration does not yet work properly with
3559 * Command 'sledgehammer' invokes external automatic theorem provers as
3560 background processes. It generates calls to the "metis" method if
3561 successful. These can be pasted into the proof. Users do not have to
3562 wait for the automatic provers to return. WARNING: does not really
3563 work with multi-threading.
3565 * New "auto_quickcheck" feature tests outermost goal statements for
3566 potential counter-examples. Controlled by ML references
3567 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
3568 5000 milliseconds). Fails silently if statements is outside of
3569 executable fragment, or any other codgenerator problem occurs.
3571 * New constant "undefined" with axiom "undefined x = undefined".
3573 * Added class "HOL.eq", allowing for code generation with polymorphic
3576 * Some renaming of class constants due to canonical name prefixing in
3577 the new 'class' package:
3579 HOL.abs ~> HOL.abs_class.abs
3580 HOL.divide ~> HOL.divide_class.divide
3581 0 ~> HOL.zero_class.zero
3582 1 ~> HOL.one_class.one
3583 op + ~> HOL.plus_class.plus
3584 op - ~> HOL.minus_class.minus
3585 uminus ~> HOL.minus_class.uminus
3586 op * ~> HOL.times_class.times
3587 op < ~> HOL.ord_class.less
3588 op <= > HOL.ord_class.less_eq
3589 Nat.power ~> Power.power_class.power
3590 Nat.size ~> Nat.size_class.size
3591 Numeral.number_of ~> Numeral.number_class.number_of
3592 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
3593 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
3594 Orderings.min ~> Orderings.ord_class.min
3595 Orderings.max ~> Orderings.ord_class.max
3596 Divides.op div ~> Divides.div_class.div
3597 Divides.op mod ~> Divides.div_class.mod
3598 Divides.op dvd ~> Divides.div_class.dvd
3600 INCOMPATIBILITY. Adaptions may be required in the following cases:
3602 a) User-defined constants using any of the names "plus", "minus",
3603 "times", "less" or "less_eq". The standard syntax translations for
3604 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
3607 b) Variables named "plus", "minus", "times", "less", "less_eq"
3608 INCOMPATIBILITY: use more specific names.
3610 c) Permutative equations (e.g. "a + b = b + a")
3611 Since the change of names also changes the order of terms, permutative
3612 rewrite rules may get applied in a different order. Experience shows
3613 that this is rarely the case (only two adaptions in the whole Isabelle
3614 distribution). INCOMPATIBILITY: rewrite proofs
3616 d) ML code directly refering to constant names
3617 This in general only affects hand-written proof tactics, simprocs and
3618 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
3619 Consider using @{const_name} antiquotation.
3621 * New class "default" with associated constant "default".
3623 * Function "sgn" is now overloaded and available on int, real, complex
3624 (and other numeric types), using class "sgn". Two possible defs of
3625 sgn are given as equational assumptions in the classes sgn_if and
3626 sgn_div_norm; ordered_idom now also inherits from sgn_if.
3629 * Locale "partial_order" now unified with class "order" (cf. theory
3630 Orderings), added parameter "less". INCOMPATIBILITY.
3632 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
3633 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
3634 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
3636 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
3637 changed order of proof goals in instance proofs.
3639 * The transitivity reasoner for partial and linear orders is set up
3640 for classes "order" and "linorder". Instances of the reasoner are available
3641 in all contexts importing or interpreting the corresponding locales.
3642 Method "order" invokes the reasoner separately; the reasoner
3643 is also integrated with the Simplifier as a solver. Diagnostic
3644 command 'print_orders' shows the available instances of the reasoner
3645 in the current context.
3647 * Localized monotonicity predicate in theory "Orderings"; integrated
3648 lemmas max_of_mono and min_of_mono with this predicate.
3651 * Formulation of theorem "dense" changed slightly due to integration
3652 with new class dense_linear_order.
3654 * Uniform lattice theory development in HOL.
3656 constants "meet" and "join" now named "inf" and "sup"
3657 constant "Meet" now named "Inf"
3659 classes "meet_semilorder" and "join_semilorder" now named
3660 "lower_semilattice" and "upper_semilattice"
3661 class "lorder" now named "lattice"
3662 class "comp_lat" now named "complete_lattice"
3664 Instantiation of lattice classes allows explicit definitions
3665 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3667 INCOMPATIBILITY. Theorem renames:
3669 meet_left_le ~> inf_le1
3670 meet_right_le ~> inf_le2
3671 join_left_le ~> sup_ge1
3672 join_right_le ~> sup_ge2
3673 meet_join_le ~> inf_sup_ord
3676 le_meet ~> le_inf_iff
3677 le_join ~> ge_sup_conv
3678 meet_idempotent ~> inf_idem
3679 join_idempotent ~> sup_idem
3680 meet_comm ~> inf_commute
3681 join_comm ~> sup_commute
3682 meet_leI1 ~> le_infI1
3683 meet_leI2 ~> le_infI2
3684 le_joinI1 ~> le_supI1
3685 le_joinI2 ~> le_supI2
3686 meet_assoc ~> inf_assoc
3687 join_assoc ~> sup_assoc
3688 meet_left_comm ~> inf_left_commute
3689 meet_left_idempotent ~> inf_left_idem
3690 join_left_comm ~> sup_left_commute
3691 join_left_idempotent ~> sup_left_idem
3694 le_def_meet ~> le_iff_inf
3695 le_def_join ~> le_iff_sup
3696 join_absorp2 ~> sup_absorb2
3697 join_absorp1 ~> sup_absorb1
3698 meet_absorp1 ~> inf_absorb1
3699 meet_absorp2 ~> inf_absorb2
3700 meet_join_absorp ~> inf_sup_absorb
3701 join_meet_absorp ~> sup_inf_absorb
3702 distrib_join_le ~> distrib_sup_le
3703 distrib_meet_le ~> distrib_inf_le
3705 add_meet_distrib_left ~> add_inf_distrib_left
3706 add_join_distrib_left ~> add_sup_distrib_left
3707 is_join_neg_meet ~> is_join_neg_inf
3708 is_meet_neg_join ~> is_meet_neg_sup
3709 add_meet_distrib_right ~> add_inf_distrib_right
3710 add_join_distrib_right ~> add_sup_distrib_right
3711 add_meet_join_distribs ~> add_sup_inf_distribs
3712 join_eq_neg_meet ~> sup_eq_neg_inf
3713 meet_eq_neg_join ~> inf_eq_neg_sup
3714 add_eq_meet_join ~> add_eq_inf_sup
3715 meet_0_imp_0 ~> inf_0_imp_0
3716 join_0_imp_0 ~> sup_0_imp_0
3717 meet_0_eq_0 ~> inf_0_eq_0
3718 join_0_eq_0 ~> sup_0_eq_0
3719 neg_meet_eq_join ~> neg_inf_eq_sup
3720 neg_join_eq_meet ~> neg_sup_eq_inf
3721 join_eq_if ~> sup_eq_if
3723 mono_meet ~> mono_inf
3724 mono_join ~> mono_sup
3725 meet_bool_eq ~> inf_bool_eq
3726 join_bool_eq ~> sup_bool_eq
3727 meet_fun_eq ~> inf_fun_eq
3728 join_fun_eq ~> sup_fun_eq
3729 meet_set_eq ~> inf_set_eq
3730 join_set_eq ~> sup_set_eq
3731 meet1_iff ~> inf1_iff
3732 meet2_iff ~> inf2_iff
3741 join1_iff ~> sup1_iff
3742 join2_iff ~> sup2_iff
3752 is_meet_Meet ~> is_meet_Inf
3753 Meet_bool_def ~> Inf_bool_def
3754 Meet_fun_def ~> Inf_fun_def
3755 Meet_greatest ~> Inf_greatest
3756 Meet_lower ~> Inf_lower
3757 Meet_set_def ~> Inf_set_def
3760 Sup_bool_eq ~> Sup_bool_def
3761 Sup_fun_eq ~> Sup_fun_def
3762 Sup_set_eq ~> Sup_set_def
3764 listsp_meetI ~> listsp_infI
3765 listsp_meet_eq ~> listsp_inf_eq
3770 * Added syntactic class "size"; overloaded constant "size" now has
3771 type "'a::size ==> bool"
3773 * Internal reorganisation of `size' of datatypes: size theorems
3774 "foo.size" are no longer subsumed by "foo.simps" (but are still
3775 simplification rules by default!); theorems "prod.size" now named
3778 * Class "div" now inherits from class "times" rather than "type".
3781 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3782 Linorder etc. have disappeared; operations defined in terms of
3783 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3785 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3787 * HOL-Word: New extensive library and type for generic, fixed size
3788 machine words, with arithemtic, bit-wise, shifting and rotating
3789 operations, reflection into int, nat, and bool lists, automation for
3790 linear arithmetic (by automatic reflection into nat or int), including
3791 lemmas on overflow and monotonicity. Instantiated to all appropriate
3792 arithmetic type classes, supporting automatic simplification of
3793 numerals on all operations.
3795 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3797 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3799 * Code generator library theories:
3800 - Code_Integer represents HOL integers by big integer literals in target
3802 - Code_Char represents HOL characters by character literals in target
3804 - Code_Char_chr like Code_Char, but also offers treatment of character
3805 codes; includes Code_Integer.
3806 - Executable_Set allows to generate code for finite sets using lists.
3807 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3809 - Executable_Real implements a subset of real numbers, namly those
3810 representable by rational numbers.
3811 - Efficient_Nat implements natural numbers by integers, which in general will
3812 result in higher efficency; pattern matching with 0/Suc is eliminated;
3813 includes Code_Integer.
3814 - Code_Index provides an additional datatype index which is mapped to
3815 target-language built-in integers.
3816 - Code_Message provides an additional datatype message_string which is isomorphic to
3817 strings; messages are mapped to target-language strings.
3819 * New package for inductive predicates
3821 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3824 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3825 for z_1 :: U_1 and ... and z_n :: U_m
3827 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3830 with full support for type-inference, rather than
3832 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3834 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3835 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3837 inductive "s z_1 ... z_m"
3839 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3842 For backward compatibility, there is a wrapper allowing inductive
3843 sets to be defined with the new package via
3846 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3847 for z_1 :: U_1 and ... and z_n :: U_m
3849 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3855 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3856 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3857 for z_1 :: U_1 and ... and z_n :: U_m
3859 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3860 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3863 if the additional syntax "p ..." is required.
3865 Numerous examples can be found in the subdirectories src/HOL/Auth,
3866 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3870 - Since declaration and definition of inductive sets or predicates
3871 is no longer separated, abbreviations involving the newly
3872 introduced sets or predicates must be specified together with the
3873 introduction rules after the 'where' keyword (see above), rather
3874 than before the actual inductive definition.
3876 - The variables in induction and elimination rules are now
3877 quantified in the order of their occurrence in the introduction
3878 rules, rather than in alphabetical order. Since this may break
3879 some proofs, these proofs either have to be repaired, e.g. by
3880 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3881 statements of the form
3883 case (rule_i a_i_1 ... a_i_{k_i})
3885 or the old order of quantification has to be restored by explicitly adding
3886 meta-level quantifiers in the introduction rules, i.e.
3888 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3890 - The format of the elimination rules is now
3892 p z_1 ... z_m x_1 ... x_n ==>
3893 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3898 (x_1, ..., x_n) : s z_1 ... z_m ==>
3899 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3902 for sets rather than
3904 x : s z_1 ... z_m ==>
3905 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3908 This may require terms in goals to be expanded to n-tuples
3909 (e.g. using case_tac or simplification with the split_paired_all
3910 rule) before the above elimination rule is applicable.
3912 - The elimination or case analysis rules for (mutually) inductive
3913 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3914 list of rules "p_1_..._p_k.elims" is no longer available.
3916 * New package "function"/"fun" for general recursive functions,
3917 supporting mutual and nested recursion, definitions in local contexts,
3918 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3919 for small examples, and the separate tutorial on the function
3920 package. The old recdef "package" is still available as before, but
3921 users are encouraged to use the new package.
3923 * Method "lexicographic_order" automatically synthesizes termination
3924 relations as lexicographic combinations of size measures.
3926 * Case-expressions allow arbitrary constructor-patterns (including
3927 "_") and take their order into account, like in functional
3928 programming. Internally, this is translated into nested
3929 case-expressions; missing cases are added and mapped to the predefined
3930 constant "undefined". In complicated cases printing may no longer show
3931 the original input but the internal form. Lambda-abstractions allow
3932 the same form of pattern matching: "% pat1 => e1 | ..." is an
3933 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3936 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3937 is an abbreviation for "of_nat :: nat => int". The simplification
3938 rules for "of_nat" have been changed to work like "int" did
3939 previously. Potential INCOMPATIBILITY:
3940 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3941 - of_nat_diff and of_nat_mult are no longer default simp rules
3943 * Method "algebra" solves polynomial equations over (semi)rings using
3944 Groebner bases. The (semi)ring structure is defined by locales and the
3945 tool setup depends on that generic context. Installing the method for
3946 a specific type involves instantiating the locale and possibly adding
3947 declarations for computation on the coefficients. The method is
3948 already instantiated for natural numbers and for the axiomatic class
3949 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3950 CALCULEMUS 2007 for the general principles underlying this
3951 architecture of context-aware proof-tools.
3953 * Method "ferrack" implements quantifier elimination over
3954 special-purpose dense linear orders using locales (analogous to
3955 "algebra"). The method is already installed for class
3956 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3959 * Former constant "List.op @" now named "List.append". Use ML
3960 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3961 circumvent possible incompatibilities when working on ML level.
3963 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3965 * New function listsum :: 'a list => 'a for arbitrary monoids.
3966 Special syntax: "SUM x <- xs. f x" (and latex variants)
3968 * New syntax for Haskell-like list comprehension (input only), eg.
3969 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3971 * The special syntax for function "filter" has changed from [x :
3972 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3973 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3975 * [a..b] is now defined for arbitrary linear orders. It used to be
3976 defined on nat only, as an abbreviation for [a..<Suc b]
3979 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3981 * New functions "sorted" and "sort" in src/HOL/List.thy.
3983 * New lemma collection field_simps (an extension of ring_simps) for
3984 manipulating (in)equations involving division. Multiplies with all
3985 denominators that can be proved to be non-zero (in equations) or
3986 positive/negative (in inequations).
3988 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3989 have been improved and renamed to ring_simps, group_simps and
3990 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3991 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3993 * Theory Library/Commutative_Ring: switched from recdef to function
3994 package; constants add, mul, pow now curried. Infix syntax for
3995 algebraic operations.
3997 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
4000 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
4003 * HOL/records: generalised field-update to take a function on the
4004 field rather than the new value: r(|A := x|) is translated to A_update
4005 (K x) r The K-combinator that is internally used is called K_record.
4006 INCOMPATIBILITY: Usage of the plain update functions has to be
4009 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
4010 * x = 0, which are required for a semiring. Richer structures do not
4011 inherit from semiring_0 anymore, because this property is a theorem
4012 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
4013 there is more to prove, but this is mostly trivial.
4015 * Class "recpower" is generalized to arbitrary monoids, not just
4016 commutative semirings. INCOMPATIBILITY: may need to incorporate
4017 commutativity or semiring properties additionally.
4019 * Constant "List.list_all2" in List.thy now uses authentic syntax.
4020 INCOMPATIBILITY: translations containing list_all2 may go wrong,
4021 better use 'abbreviation'.
4023 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
4025 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
4026 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
4027 significant changes for setting up numeral syntax for types:
4028 - New constants Numeral.pred and Numeral.succ instead
4029 of former Numeral.bin_pred and Numeral.bin_succ.
4030 - Use integer operations instead of bin_add, bin_mult and so on.
4031 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
4032 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
4034 See src/HOL/Integ/IntArith.thy for an example setup.
4036 * Command 'normal_form' computes the normal form of a term that may
4037 contain free variables. For example ``normal_form "rev [a, b, c]"''
4038 produces ``[b, c, a]'' (without proof). This command is suitable for
4039 heavy-duty computations because the functions are compiled to ML
4040 first. Correspondingly, a method "normalization" is provided. See
4041 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
4043 * Alternative iff syntax "A <-> B" for equality on bool (with priority
4044 25 like -->); output depends on the "iff" print_mode, the default is
4045 "A = B" (with priority 50).
4047 * Relations less (<) and less_eq (<=) are also available on type bool.
4048 Modified syntax to disallow nesting without explicit parentheses,
4049 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
4052 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
4054 * Relation composition operator "op O" now has precedence 75 and binds
4055 stronger than union and intersection. INCOMPATIBILITY.
4057 * The old set interval syntax "{m..n(}" (and relatives) has been
4058 removed. Use "{m..<n}" (and relatives) instead.
4060 * In the context of the assumption "~(s = t)" the Simplifier rewrites
4061 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
4062 ``declare [[simproc del: neq]]''.
4064 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
4067 * Theorem Cons_eq_map_conv no longer declared as "simp".
4069 * Theorem setsum_mult renamed to setsum_right_distrib.
4071 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
4074 * Reimplemented methods "sat" and "satx", with several improvements:
4075 goals no longer need to be stated as "<prems> ==> False", equivalences
4076 (i.e. "=" on type bool) are handled, variable names of the form
4077 "lit_<n>" are no longer reserved, significant speedup.
4079 * Methods "sat" and "satx" can now replay MiniSat proof traces.
4080 zChaff is still supported as well.
4082 * 'inductive' and 'datatype': provide projections of mutual rules,
4083 bundled as foo_bar.inducts;
4085 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
4088 * Library: moved theory Accessible_Part to main HOL.
4090 * Library: added theory Coinductive_List of potentially infinite lists
4091 as greatest fixed-point.
4093 * Library: added theory AssocList which implements (finite) maps as
4096 * Method "evaluation" solves goals (i.e. a boolean expression)
4097 efficiently by compiling it to ML. The goal is "proved" (via an
4098 oracle) if it evaluates to True.
4100 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
4101 also when invoked by the simplifier. This results in the Simplifier
4102 being more powerful on arithmetic goals. INCOMPATIBILITY.
4103 Configuration option fast_arith_split_limit=0 recovers the old
4106 * Support for hex (0x20) and binary (0b1001) numerals.
4108 * New method: reify eqs (t), where eqs are equations for an
4109 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
4110 parameter, computes a term s::'b and a list xs::'a list and proves the
4111 theorem I xs s = t. This is also known as reification or quoting. The
4112 resulting theorem is applied to the subgoal to substitute t with I xs
4113 s. If t is omitted, the subgoal itself is reified.
4115 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
4116 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
4117 where f is supposed to be a computable function (in the sense of code
4118 generattion). The method uses reify to compute s and xs as above then
4119 applies corr_thm and uses normalization by evaluation to "prove" f s =
4120 r and finally gets the theorem t = r, which is again applied to the
4121 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
4123 * Reflection: Automatic reification now handels binding, an example is
4124 available in src/HOL/ex/ReflectionEx.thy
4126 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
4127 command 'statespace' that is similar to 'record', but introduces an
4128 abstract specification based on the locale infrastructure instead of
4129 HOL types. This leads to extra flexibility in composing state spaces,
4130 in particular multiple inheritance and renaming of components.
4135 * Hyperreal: Functions root and sqrt are now defined on negative real
4136 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
4137 Nonnegativity side conditions have been removed from many lemmas, so
4138 that more subgoals may now be solved by simplification; potential
4141 * Real: new type classes formalize real normed vector spaces and
4142 algebras, using new overloaded constants scaleR :: real => 'a => 'a
4143 and norm :: 'a => real.
4145 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
4146 reals into other types. The overloaded constant Reals :: 'a set is now
4147 defined as range of_real; potential INCOMPATIBILITY.
4149 * Real: proper support for ML code generation, including 'quickcheck'.
4150 Reals are implemented as arbitrary precision rationals.
4152 * Hyperreal: Several constants that previously worked only for the
4153 reals have been generalized, so they now work over arbitrary vector
4154 spaces. Type annotations may need to be added in some cases; potential
4157 Infinitesimal :: ('a::real_normed_vector) star set
4158 HFinite :: ('a::real_normed_vector) star set
4159 HInfinite :: ('a::real_normed_vector) star set
4160 approx :: ('a::real_normed_vector) star => 'a star => bool
4161 monad :: ('a::real_normed_vector) star => 'a star set
4162 galaxy :: ('a::real_normed_vector) star => 'a star set
4163 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
4164 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
4165 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
4166 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
4167 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
4168 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
4169 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
4170 sgn :: 'a::real_normed_vector => 'a
4171 exp :: 'a::{recpower,real_normed_field,banach} => 'a
4173 * Complex: Some complex-specific constants are now abbreviations for
4174 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
4175 hnorm. Other constants have been entirely removed in favor of the
4176 polymorphic versions (INCOMPATIBILITY):
4180 HInfinite <-- CInfinite
4181 Infinitesimal <-- CInfinitesimal
4184 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
4185 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
4186 (ns)deriv <-- (ns)cderiv
4191 * Formalisation of ideals and the quotient construction over rings.
4193 * Order and lattice theory no longer based on records.
4196 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
4197 greatest_closed. INCOMPATIBILITY.
4199 * Method algebra is now set up via an attribute. For examples see
4200 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
4201 of algebraic structures.
4203 * Renamed theory CRing to Ring.
4208 * Substantial, yet incomplete support for nominal datatypes (binding
4209 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
4210 src/HOL/Nominal/Examples. Prospective users should consult
4211 http://isabelle.in.tum.de/nominal/
4216 * ML basics: just one true type int, which coincides with IntInf.int
4219 * ML within Isar: antiquotations allow to embed statically-checked
4220 formal entities in the source, referring to the context available at
4221 compile-time. For example:
4223 ML {* @{sort "{zero,one}"} *}
4224 ML {* @{typ "'a => 'b"} *}
4225 ML {* @{term "%x. x"} *}
4226 ML {* @{prop "x == y"} *}
4227 ML {* @{ctyp "'a => 'b"} *}
4228 ML {* @{cterm "%x. x"} *}
4229 ML {* @{cprop "x == y"} *}
4230 ML {* @{thm asm_rl} *}
4231 ML {* @{thms asm_rl} *}
4232 ML {* @{type_name c} *}
4233 ML {* @{type_syntax c} *}
4234 ML {* @{const_name c} *}
4235 ML {* @{const_syntax c} *}
4238 ML {* @{theory Pure} *}
4239 ML {* @{theory_ref} *}
4240 ML {* @{theory_ref Pure} *}
4243 ML {* @{clasimpset} *}
4245 The same works for sources being ``used'' within an Isar context.
4247 * ML in Isar: improved error reporting; extra verbosity with
4248 ML_Context.trace enabled.
4250 * Pure/General/table.ML: the join operations now works via exceptions
4251 DUP/SAME instead of type option. This is simpler in simple cases, and
4252 admits slightly more efficient complex applications.
4254 * Pure: 'advanced' translation functions (parse_translation etc.) now
4255 use Context.generic instead of just theory.
4257 * Pure: datatype Context.generic joins theory/Proof.context and
4258 provides some facilities for code that works in either kind of
4259 context, notably GenericDataFun for uniform theory and proof data.
4261 * Pure: simplified internal attribute type, which is now always
4262 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
4263 local (Proof.context) attributes have been discontinued, while
4264 minimizing code duplication. Thm.rule_attribute and
4265 Thm.declaration_attribute build canonical attributes; see also structure
4266 Context for further operations on Context.generic, notably
4267 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
4268 declarations and definitions.
4270 * Context data interfaces (Theory/Proof/GenericDataFun): removed
4271 name/print, uninitialized data defaults to ad-hoc copy of empty value,
4272 init only required for impure data. INCOMPATIBILITY: empty really need
4273 to be empty (no dependencies on theory content!)
4275 * Pure/kernel: consts certification ignores sort constraints given in
4276 signature declarations. (This information is not relevant to the
4277 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
4278 potential INCOMPATIBILITY.
4280 * Pure: axiomatic type classes are now purely definitional, with
4281 explicit proofs of class axioms and super class relations performed
4282 internally. See Pure/axclass.ML for the main internal interfaces --
4283 notably AxClass.define_class supercedes AxClass.add_axclass, and
4284 AxClass.axiomatize_class/classrel/arity supersede
4285 Sign.add_classes/classrel/arities.
4287 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
4288 global/local versions on theory vs. Proof.context have been
4289 discontinued; Attrib.syntax and Method.syntax have been adapted
4290 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
4291 attributes, methods, etc.
4293 * Pure: several functions of signature "... -> theory -> theory * ..."
4294 have been reoriented to "... -> theory -> ... * theory" in order to
4295 allow natural usage in combination with the ||>, ||>>, |-> and
4296 fold_map combinators.
4298 * Pure: official theorem names (closed derivations) and additional
4299 comments (tags) are now strictly separate. Name hints -- which are
4300 maintained as tags -- may be attached any time without affecting the
4303 * Pure: primitive rule lift_rule now takes goal cterm instead of an
4304 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
4305 achieve the old behaviour.
4307 * Pure: the "Goal" constant is now called "prop", supporting a
4308 slightly more general idea of ``protecting'' meta-level rule
4311 * Pure: Logic.(un)varify only works in a global context, which is now
4312 enforced instead of silently assumed. INCOMPATIBILITY, may use
4313 Logic.legacy_(un)varify as temporary workaround.
4315 * Pure: structure Name provides scalable operations for generating
4316 internal variable names, notably Name.variants etc. This replaces
4317 some popular functions from term.ML:
4319 Term.variant -> Name.variant
4320 Term.variantlist -> Name.variant_list
4321 Term.invent_names -> Name.invent_list
4323 Note that low-level renaming rarely occurs in new code -- operations
4324 from structure Variable are used instead (see below).
4326 * Pure: structure Variable provides fundamental operations for proper
4327 treatment of fixed/schematic variables in a context. For example,
4328 Variable.import introduces fixes for schematics of given facts and
4329 Variable.export reverses the effect (up to renaming) -- this replaces
4330 various freeze_thaw operations.
4332 * Pure: structure Goal provides simple interfaces for
4333 init/conclude/finish and tactical prove operations (replacing former
4334 Tactic.prove). Goal.prove is the canonical way to prove results
4335 within a given context; Goal.prove_global is a degraded version for
4336 theory level goals, including a global Drule.standard. Note that
4337 OldGoals.prove_goalw_cterm has long been obsolete, since it is
4338 ill-behaved in a local proof context (e.g. with local fixes/assumes or
4339 in a locale context).
4341 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
4342 and type checking (Syntax.check_term etc.), with common combinations
4343 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
4344 which are considered legacy and await removal.
4346 * Pure/Syntax: generic interfaces for type unchecking
4347 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
4348 with common combinations (Syntax.pretty_term, Syntax.string_of_term
4349 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
4350 available for convenience, but refer to the very same operations using
4351 a mere theory instead of a full context.
4353 * Isar: simplified treatment of user-level errors, using exception
4354 ERROR of string uniformly. Function error now merely raises ERROR,
4355 without any side effect on output channels. The Isar toplevel takes
4356 care of proper display of ERROR exceptions. ML code may use plain
4357 handle/can/try; cat_error may be used to concatenate errors like this:
4359 ... handle ERROR msg => cat_error msg "..."
4361 Toplevel ML code (run directly or through the Isar toplevel) may be
4362 embedded into the Isar toplevel with exception display/debug like
4365 Isar.toplevel (fn () => ...)
4367 INCOMPATIBILITY, removed special transform_error facilities, removed
4368 obsolete variants of user-level exceptions (ERROR_MESSAGE,
4369 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
4370 -- use plain ERROR instead.
4372 * Isar: theory setup now has type (theory -> theory), instead of a
4373 list. INCOMPATIBILITY, may use #> to compose setup functions.
4375 * Isar: ML toplevel pretty printer for type Proof.context, subject to
4376 ProofContext.debug/verbose flags.
4378 * Isar: Toplevel.theory_to_proof admits transactions that modify the
4379 theory before entering a proof state. Transactions now always see a
4380 quasi-functional intermediate checkpoint, both in interactive and
4383 * Isar: simplified interfaces for outer syntax. Renamed
4384 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
4385 OuterSyntax.add_parsers -- this functionality is now included in
4386 OuterSyntax.command etc. INCOMPATIBILITY.
4388 * Simplifier: the simpset of a running simplification process now
4389 contains a proof context (cf. Simplifier.the_context), which is the
4390 very context that the initial simpset has been retrieved from (by
4391 simpset_of/local_simpset_of). Consequently, all plug-in components
4392 (solver, looper etc.) may depend on arbitrary proof data.
4394 * Simplifier.inherit_context inherits the proof context (plus the
4395 local bounds) of the current simplification process; any simproc
4396 etc. that calls the Simplifier recursively should do this! Removed
4397 former Simplifier.inherit_bounds, which is already included here --
4398 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
4399 specify an explicit context using Simplifier.context/theory_context.
4401 * Simplifier/Classical Reasoner: more abstract interfaces
4402 change_simpset/claset for modifying the simpset/claset reference of a
4403 theory; raw versions simpset/claset_ref etc. have been discontinued --
4406 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
4412 * settings: the default heap location within ISABELLE_HOME_USER now
4413 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
4414 Isabelle installations.
4416 * isabelle-process: option -S (secure mode) disables some critical
4417 operations, notably runtime compilation and evaluation of ML source
4420 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
4422 * Support for parallel execution, using native multicore support of
4423 Poly/ML 5.1. The theory loader exploits parallelism when processing
4424 independent theories, according to the given theory header
4425 specifications. The maximum number of worker threads is specified via
4426 usedir option -M or the "max-threads" setting in Proof General. A
4427 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
4428 to 6 on a 8-core machine. User-code needs to observe certain
4429 guidelines for thread-safe programming, see appendix A in the Isar
4430 Implementation manual.
4434 New in Isabelle2005 (October 2005)
4435 ----------------------------------
4439 * Theory headers: the new header syntax for Isar theories is
4442 imports <theory1> ... <theoryN>
4443 uses <file1> ... <fileM>
4446 where the 'uses' part is optional. The previous syntax
4448 theory <name> = <theory1> + ... + <theoryN>:
4450 will disappear in the next release. Use isatool fixheaders to convert
4451 existing theory files. Note that there is no change in ancient
4452 non-Isar theories now, but these will disappear soon.
4454 * Theory loader: parent theories can now also be referred to via
4455 relative and absolute paths.
4457 * Command 'find_theorems' searches for a list of criteria instead of a
4458 list of constants. Known criteria are: intro, elim, dest, name:string,
4459 simp:term, and any term. Criteria can be preceded by '-' to select
4460 theorems that do not match. Intro, elim, dest select theorems that
4461 match the current goal, name:s selects theorems whose fully qualified
4462 name contain s, and simp:term selects all simplification rules whose
4463 lhs match term. Any other term is interpreted as pattern and selects
4464 all theorems matching the pattern. Available in ProofGeneral under
4465 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
4467 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
4469 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
4470 matching the current goal as introduction rule and not having "HOL."
4471 in their name (i.e. not being defined in theory HOL).
4473 * Command 'thms_containing' has been discontinued in favour of
4474 'find_theorems'; INCOMPATIBILITY.
4476 * Communication with Proof General is now 8bit clean, which means that
4477 Unicode text in UTF-8 encoding may be used within theory texts (both
4478 formal and informal parts). Cf. option -U of the Isabelle Proof
4479 General interface. Here are some simple examples (cf. src/HOL/ex):
4481 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
4482 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
4484 * Improved efficiency of the Simplifier and, to a lesser degree, the
4485 Classical Reasoner. Typical big applications run around 2 times
4489 *** Document preparation ***
4491 * Commands 'display_drafts' and 'print_drafts' perform simple output
4492 of raw sources. Only those symbols that do not require additional
4493 LaTeX packages (depending on comments in isabellesym.sty) are
4494 displayed properly, everything else is left verbatim. isatool display
4495 and isatool print are used as front ends (these are subject to the
4496 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
4498 * Command tags control specific markup of certain regions of text,
4499 notably folding and hiding. Predefined tags include "theory" (for
4500 theory begin and end), "proof" for proof commands, and "ML" for
4501 commands involving ML code; the additional tags "visible" and
4502 "invisible" are unused by default. Users may give explicit tag
4503 specifications in the text, e.g. ''by %invisible (auto)''. The
4504 interpretation of tags is determined by the LaTeX job during document
4505 preparation: see option -V of isatool usedir, or options -n and -t of
4506 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
4509 Several document versions may be produced at the same time via isatool
4510 usedir (the generated index.html will link all of them). Typical
4511 specifications include ''-V document=theory,proof,ML'' to present
4512 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
4513 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
4514 these parts without any formal replacement text. The Isabelle site
4515 default settings produce ''document'' and ''outline'' versions as
4518 * Several new antiquotations:
4520 @{term_type term} prints a term with its type annotated;
4522 @{typeof term} prints the type of a term;
4524 @{const const} is the same as @{term const}, but checks that the
4525 argument is a known logical constant;
4527 @{term_style style term} and @{thm_style style thm} print a term or
4528 theorem applying a "style" to it
4532 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
4533 definitions, equations, inequations etc., 'concl' printing only the
4534 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
4535 to print the specified premise. TermStyle.add_style provides an ML
4536 interface for introducing further styles. See also the "LaTeX Sugar"
4537 document practical applications. The ML antiquotation prints
4538 type-checked ML expressions verbatim.
4540 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
4541 and 'text' support optional locale specification '(in loc)', which
4542 specifies the default context for interpreting antiquotations. For
4543 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
4545 * Option 'locale=NAME' of antiquotations specifies an alternative
4546 context interpreting the subsequent argument. For example: @{thm
4547 [locale=lattice] inf_assoc}.
4549 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
4552 * Proper output of antiquotations for theory commands involving a
4553 proof context (such as 'locale' or 'theorem (in loc) ...').
4555 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
4556 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
4558 * isatool usedir: new option -C (default true) controls whether option
4559 -D should include a copy of the original document directory; -C false
4560 prevents unwanted effects such as copying of administrative CVS data.
4565 * Considerably improved version of 'constdefs' command. Now performs
4566 automatic type-inference of declared constants; additional support for
4567 local structure declarations (cf. locales and HOL records), see also
4568 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
4569 sequential dependencies of definitions within a single 'constdefs'
4570 section; moreover, the declared name needs to be an identifier. If
4571 all fails, consider to fall back on 'consts' and 'defs' separately.
4573 * Improved indexed syntax and implicit structures. First of all,
4574 indexed syntax provides a notational device for subscripted
4575 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
4576 expressions. Secondly, in a local context with structure
4577 declarations, number indexes \<^sub>n or the empty index (default
4578 number 1) refer to a certain fixed variable implicitly; option
4579 show_structs controls printing of implicit structures. Typical
4580 applications of these concepts involve record types and locales.
4582 * New command 'no_syntax' removes grammar declarations (and
4583 translations) resulting from the given syntax specification, which is
4584 interpreted in the same manner as for the 'syntax' command.
4586 * 'Advanced' translation functions (parse_translation etc.) may depend
4587 on the signature of the theory context being presently used for
4588 parsing/printing, see also isar-ref manual.
4590 * Improved 'oracle' command provides a type-safe interface to turn an
4591 ML expression of type theory -> T -> term into a primitive rule of
4592 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
4593 is already included here); see also FOL/ex/IffExample.thy;
4596 * axclass: name space prefix for class "c" is now "c_class" (was "c"
4597 before); "cI" is no longer bound, use "c.intro" instead.
4598 INCOMPATIBILITY. This change avoids clashes of fact bindings for
4599 axclasses vs. locales.
4601 * Improved internal renaming of symbolic identifiers -- attach primes
4602 instead of base 26 numbers.
4604 * New flag show_question_marks controls printing of leading question
4605 marks in schematic variable names.
4607 * In schematic variable names, *any* symbol following \<^isub> or
4608 \<^isup> is now treated as part of the base name. For example, the
4609 following works without printing of awkward ".0" indexes:
4611 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
4614 * Inner syntax includes (*(*nested*) comments*).
4616 * Pretty printer now supports unbreakable blocks, specified in mixfix
4617 annotations as "(00...)".
4619 * Clear separation of logical types and nonterminals, where the latter
4620 may only occur in 'syntax' specifications or type abbreviations.
4621 Before that distinction was only partially implemented via type class
4622 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
4623 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
4624 exotic syntax specifications may require further adaption
4625 (e.g. Cube/Cube.thy).
4627 * Removed obsolete type class "logic", use the top sort {} instead.
4628 Note that non-logical types should be declared as 'nonterminals'
4629 rather than 'types'. INCOMPATIBILITY for new object-logic
4632 * Attributes 'induct' and 'cases': type or set names may now be
4633 locally fixed variables as well.
4635 * Simplifier: can now control the depth to which conditional rewriting
4636 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
4639 * Simplifier: simplification procedures may now take the current
4640 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
4641 interface), which is very useful for calling the Simplifier
4642 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
4643 is gone -- use prems_of_ss on the simpset instead. Moreover, the
4644 low-level mk_simproc no longer applies Logic.varify internally, to
4645 allow for use in a context of fixed variables.
4647 * thin_tac now works even if the assumption being deleted contains !!
4648 or ==>. More generally, erule now works even if the major premise of
4649 the elimination rule contains !! or ==>.
4651 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
4653 * Reorganized bootstrapping of the Pure theories; CPure is now derived
4654 from Pure, which contains all common declarations already. Both
4655 theories are defined via plain Isabelle/Isar .thy files.
4656 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
4657 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
4658 use isatool fixcpure to adapt your theory and ML sources.
4660 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
4661 selections of theorems in named facts via index ranges.
4663 * 'print_theorems': in theory mode, really print the difference
4664 wrt. the last state (works for interactive theory development only),
4665 in proof mode print all local facts (cf. 'print_facts');
4667 * 'hide': option '(open)' hides only base names.
4669 * More efficient treatment of intermediate checkpoints in interactive
4672 * Code generator is now invoked via code_module (incremental code
4673 generation) and code_library (modular code generation, ML structures
4674 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4675 must be quoted when used as identifiers.
4677 * New 'value' command for reading, evaluating and printing terms using
4678 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4679 quoted when used as identifier.
4684 * New commands for the interpretation of locale expressions in
4685 theories (1), locales (2) and proof contexts (3). These generate
4686 proof obligations from the expression specification. After the
4687 obligations have been discharged, theorems of the expression are added
4688 to the theory, target locale or proof context. The synopsis of the
4689 commands is a follows:
4691 (1) interpretation expr inst
4692 (2) interpretation target < expr
4693 (3) interpret expr inst
4695 Interpretation in theories and proof contexts require a parameter
4696 instantiation of terms from the current context. This is applied to
4697 specifications and theorems of the interpreted expression.
4698 Interpretation in locales only permits parameter renaming through the
4699 locale expression. Interpretation is smart in that interpretations
4700 that are active already do not occur in proof obligations, neither are
4701 instantiated theorems stored in duplicate. Use 'print_interps' to
4702 inspect active interpretations of a particular locale. For details,
4703 see the Isar Reference manual. Examples can be found in
4704 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4706 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4707 'interpret' instead.
4709 * New context element 'constrains' for adding type constraints to
4712 * Context expressions: renaming of parameters with syntax
4715 * Locale declaration: 'includes' disallowed.
4717 * Proper static binding of attribute syntax -- i.e. types / terms /
4718 facts mentioned as arguments are always those of the locale definition
4719 context, independently of the context of later invocations. Moreover,
4720 locale operations (renaming and type / term instantiation) are applied
4721 to attribute arguments as expected.
4723 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4724 actual attributes; rare situations may require Attrib.attribute to
4725 embed those attributes into Attrib.src that lack concrete syntax.
4726 Attribute implementations need to cooperate properly with the static
4727 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4728 Attrib.XXX_thm etc. already do the right thing without further
4729 intervention. Only unusual applications -- such as "where" or "of"
4730 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4731 on the context and the facts involved -- may have to assign parsed
4732 values to argument tokens explicitly.
4734 * Changed parameter management in theorem generation for long goal
4735 statements with 'includes'. INCOMPATIBILITY: produces a different
4736 theorem statement in rare situations.
4738 * Locale inspection command 'print_locale' omits notes elements. Use
4739 'print_locale!' to have them included in the output.
4744 * Provers/hypsubst.ML: improved version of the subst method, for
4745 single-step rewriting: it now works in bound variable contexts. New is
4746 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4747 rewrite a different subterm than the original subst method, which is
4748 still available as 'simplesubst'.
4750 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4753 * Provers/trancl.ML: new transitivity reasoner for transitive and
4754 reflexive-transitive closure of relations.
4756 * Provers/blast.ML: new reference depth_limit to make blast's depth
4757 limit (previously hard-coded with a value of 20) user-definable.
4759 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4760 is peformed already. Object-logics merely need to finish their
4761 initial simpset configuration as before. INCOMPATIBILITY.
4766 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4769 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4771 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4772 and x-symbol; use option '-m epsilon' to get it actually printed.
4773 Moreover, the mathematically important symbolic identifier \<epsilon>
4774 becomes available as variable, constant etc. INCOMPATIBILITY,
4776 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4777 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4778 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4779 support corresponding Isar calculations.
4781 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4784 * theory SetInterval: changed the syntax for open intervals:
4793 The old syntax is still supported but will disappear in the next
4794 release. For conversion use the following Emacs search and replace
4795 patterns (these are not perfect but work quite well):
4797 {)\([^\.]*\)\.\. -> {\1<\.\.}
4798 \.\.\([^(}]*\)(} -> \.\.<\1}
4800 * Theory Commutative_Ring (in Library): method comm_ring for proving
4801 equalities in commutative rings; method 'algebra' provides a generic
4804 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4805 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4806 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4809 Some new syntax forms are available:
4811 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4812 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4813 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4814 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4816 The latter form "\<Sum>x < k. e" used to be based on a separate
4817 function "Summation", which has been discontinued.
4819 * theory Finite_Set: in structured induction proofs, the insert case
4820 is now 'case (insert x F)' instead of the old counterintuitive 'case
4823 * The 'refute' command has been extended to support a much larger
4824 fragment of HOL, including axiomatic type classes, constdefs and
4825 typedefs, inductive datatypes and recursion.
4827 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4828 Requires zChaff with proof generation to be installed. See
4829 HOL/ex/SAT_Examples.thy for examples.
4831 * Datatype induction via method 'induct' now preserves the name of the
4832 induction variable. For example, when proving P(xs::'a list) by
4833 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4834 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4835 in unstructured proof scripts.
4837 * Reworked implementation of records. Improved scalability for
4838 records with many fields, avoiding performance problems for type
4839 inference. Records are no longer composed of nested field types, but
4840 of nested extension types. Therefore the record type only grows linear
4841 in the number of extensions and not in the number of fields. The
4842 top-level (users) view on records is preserved. Potential
4843 INCOMPATIBILITY only in strange cases, where the theory depends on the
4844 old record representation. The type generated for a record is called
4845 <record_name>_ext_type.
4847 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4848 proofs triggered by a record definition or a simproc (if
4849 quick_and_dirty is enabled). Definitions of large records can take
4852 New simproc record_upd_simproc for simplification of multiple record
4853 updates enabled by default. Moreover, trivial updates are also
4854 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4855 occasionally, since simplification is more powerful by default.
4857 * typedef: proper support for polymorphic sets, which contain extra
4858 type-variables in the term.
4860 * Simplifier: automatically reasons about transitivity chains
4861 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4862 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4863 old proofs break occasionally as simplification may now solve more
4864 goals than previously.
4866 * Simplifier: converts x <= y into x = y if assumption y <= x is
4867 present. Works for all partial orders (class "order"), in particular
4868 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4871 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4872 bound variable or a constant then the let is unfolded. Otherwise
4873 first a is simplified to b, and then f b is simplified to g. If
4874 possible we abstract b from g arriving at "let x = b in h x",
4875 otherwise we unfold the let and arrive at g. The simproc can be
4876 enabled/disabled by the reference use_let_simproc. Potential
4877 INCOMPATIBILITY since simplification is more powerful by default.
4879 * Classical reasoning: the meson method now accepts theorems as arguments.
4881 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4882 jobs to provide advice on the provability of subgoals.
4884 * Theory OrderedGroup and Ring_and_Field: various additions and
4885 improvements to faciliate calculations involving equalities and
4888 The following theorems have been eliminated or modified
4891 abs_eq now named abs_of_nonneg
4892 abs_of_ge_0 now named abs_of_nonneg
4893 abs_minus_eq now named abs_of_nonpos
4894 imp_abs_id now named abs_of_nonneg
4895 imp_abs_neg_id now named abs_of_nonpos
4896 mult_pos now named mult_pos_pos
4897 mult_pos_le now named mult_nonneg_nonneg
4898 mult_pos_neg_le now named mult_nonneg_nonpos
4899 mult_pos_neg2_le now named mult_nonneg_nonpos2
4900 mult_neg now named mult_neg_neg
4901 mult_neg_le now named mult_nonpos_nonpos
4903 * The following lemmas in Ring_and_Field have been added to the simplifier:
4906 not_square_less_zero
4908 The following lemmas have been deleted from Real/RealPow:
4918 * Theory Parity: added rules for simplifying exponents.
4922 The following theorems have been eliminated or modified
4925 list_all_Nil now named list_all.simps(1)
4926 list_all_Cons now named list_all.simps(2)
4927 list_all_conv now named list_all_iff
4928 set_mem_eq now named mem_iff
4930 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4931 asymptotic "big O" calculations. See the notes in BigO.thy.
4936 * Theory RealDef: better support for embedding natural numbers and
4937 integers in the reals.
4939 The following theorems have been eliminated or modified
4942 exp_ge_add_one_self now requires no hypotheses
4943 real_of_int_add reversed direction of equality (use [symmetric])
4944 real_of_int_minus reversed direction of equality (use [symmetric])
4945 real_of_int_diff reversed direction of equality (use [symmetric])
4946 real_of_int_mult reversed direction of equality (use [symmetric])
4948 * Theory RComplete: expanded support for floor and ceiling functions.
4950 * Theory Ln is new, with properties of the natural logarithm
4952 * Hyperreal: There is a new type constructor "star" for making
4953 nonstandard types. The old type names are now type synonyms:
4957 hcomplex = complex star
4959 * Hyperreal: Many groups of similarly-defined constants have been
4960 replaced by polymorphic versions (INCOMPATIBILITY):
4962 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4964 starset <-- starsetNat, starsetC
4965 *s* <-- *sNat*, *sc*
4966 starset_n <-- starsetNat_n, starsetC_n
4967 *sn* <-- *sNatn*, *scn*
4968 InternalSets <-- InternalNatSets, InternalCSets
4970 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4971 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4972 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4973 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4974 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4976 * Hyperreal: Many type-specific theorems have been removed in favor of
4977 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4979 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4980 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4981 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4982 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4983 right_minus <-- hypreal_add_minus
4984 left_minus <-- {hypreal,hcomplex}_add_minus_left
4985 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4986 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4987 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4988 mult_1_right <-- hcomplex_mult_one_right
4989 mult_zero_left <-- hcomplex_mult_zero_left
4990 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4991 right_distrib <-- hypnat_add_mult_distrib2
4992 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4993 right_inverse <-- hypreal_mult_inverse
4994 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4995 order_refl <-- {hypreal,hypnat}_le_refl
4996 order_trans <-- {hypreal,hypnat}_le_trans
4997 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4998 order_less_le <-- {hypreal,hypnat}_less_le
4999 linorder_linear <-- {hypreal,hypnat}_le_linear
5000 add_left_mono <-- {hypreal,hypnat}_add_left_mono
5001 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
5002 add_nonneg_nonneg <-- hypreal_le_add_order
5004 * Hyperreal: Separate theorems having to do with type-specific
5005 versions of constants have been merged into theorems that apply to the
5006 new polymorphic constants (INCOMPATIBILITY):
5008 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
5009 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
5010 STAR_Un <-- {STAR,NatStar,STARC}_Un
5011 STAR_Int <-- {STAR,NatStar,STARC}_Int
5012 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
5013 STAR_subset <-- {STAR,NatStar,STARC}_subset
5014 STAR_mem <-- {STAR,NatStar,STARC}_mem
5015 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
5016 STAR_diff <-- {STAR,STARC}_diff
5017 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
5018 STARC_hcomplex_of_complex}_image_subset
5019 starset_n_Un <-- starset{Nat,C}_n_Un
5020 starset_n_Int <-- starset{Nat,C}_n_Int
5021 starset_n_Compl <-- starset{Nat,C}_n_Compl
5022 starset_n_diff <-- starset{Nat,C}_n_diff
5023 InternalSets_Un <-- Internal{Nat,C}Sets_Un
5024 InternalSets_Int <-- Internal{Nat,C}Sets_Int
5025 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
5026 InternalSets_diff <-- Internal{Nat,C}Sets_diff
5027 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
5028 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
5029 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
5030 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
5031 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
5032 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5033 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
5034 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
5035 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
5036 starfun_diff <-- starfun{C,RC,CR}_diff
5037 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
5038 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
5039 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
5040 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
5041 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
5042 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
5043 starfun_Id <-- starfunC_Id
5044 starfun_approx <-- starfun{Nat,CR}_approx
5045 starfun_capprox <-- starfun{C,RC}_capprox
5046 starfun_abs <-- starfunNat_rabs
5047 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
5048 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
5049 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
5050 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
5051 starfun_add_capprox <-- starfun{C,RC}_add_capprox
5052 starfun_add_approx <-- starfunCR_add_approx
5053 starfun_inverse_inverse <-- starfunC_inverse_inverse
5054 starfun_divide <-- starfun{C,CR,RC}_divide
5055 starfun_n <-- starfun{Nat,C}_n
5056 starfun_n_mult <-- starfun{Nat,C}_n_mult
5057 starfun_n_add <-- starfun{Nat,C}_n_add
5058 starfun_n_add_minus <-- starfunNat_n_add_minus
5059 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
5060 starfun_n_minus <-- starfun{Nat,C}_n_minus
5061 starfun_n_eq <-- starfun{Nat,C}_n_eq
5063 star_n_add <-- {hypreal,hypnat,hcomplex}_add
5064 star_n_minus <-- {hypreal,hcomplex}_minus
5065 star_n_diff <-- {hypreal,hcomplex}_diff
5066 star_n_mult <-- {hypreal,hcomplex}_mult
5067 star_n_inverse <-- {hypreal,hcomplex}_inverse
5068 star_n_le <-- {hypreal,hypnat}_le
5069 star_n_less <-- {hypreal,hypnat}_less
5070 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
5071 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
5072 star_n_abs <-- hypreal_hrabs
5073 star_n_divide <-- hcomplex_divide
5075 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
5076 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
5077 star_of_diff <-- hypreal_of_real_diff
5078 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
5079 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
5080 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
5081 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
5082 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
5083 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
5084 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
5085 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
5086 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
5087 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
5088 star_of_number_of <-- {hypreal,hcomplex}_number_of
5089 star_of_number_less <-- number_of_less_hypreal_of_real_iff
5090 star_of_number_le <-- number_of_le_hypreal_of_real_iff
5091 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
5092 star_of_less_number <-- hypreal_of_real_less_number_of_iff
5093 star_of_le_number <-- hypreal_of_real_le_number_of_iff
5094 star_of_power <-- hypreal_of_real_power
5095 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
5097 * Hyperreal: new method "transfer" that implements the transfer
5098 principle of nonstandard analysis. With a subgoal that mentions
5099 nonstandard types like "'a star", the command "apply transfer"
5100 replaces it with an equivalent one that mentions only standard types.
5101 To be successful, all free variables must have standard types; non-
5102 standard variables must have explicit universal quantifiers.
5104 * Hyperreal: A theory of Taylor series.
5109 * Discontinued special version of 'constdefs' (which used to support
5110 continuous functions) in favor of the general Pure one with full
5113 * New simplification procedure for solving continuity conditions; it
5114 is much faster on terms with many nested lambda abstractions (cubic
5115 instead of exponential time).
5117 * New syntax for domain package: selector names are now optional.
5118 Parentheses should be omitted unless argument is lazy, for example:
5120 domain 'a stream = cons "'a" (lazy "'a stream")
5122 * New command 'fixrec' for defining recursive functions with pattern
5123 matching; defining multiple functions with mutual recursion is also
5124 supported. Patterns may include the constants cpair, spair, up, sinl,
5125 sinr, or any data constructor defined by the domain package. The given
5126 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
5127 syntax and examples.
5129 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
5130 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
5131 but the proof obligation additionally includes an admissibility
5132 requirement. The packages generate instances of class cpo or pcpo,
5133 with continuity and strictness theorems for Rep and Abs.
5135 * HOLCF: Many theorems have been renamed according to a more standard naming
5136 scheme (INCOMPATIBILITY):
5138 foo_inject: "foo$x = foo$y ==> x = y"
5139 foo_eq: "(foo$x = foo$y) = (x = y)"
5140 foo_less: "(foo$x << foo$y) = (x << y)"
5141 foo_strict: "foo$UU = UU"
5142 foo_defined: "... ==> foo$x ~= UU"
5143 foo_defined_iff: "(foo$x = UU) = (x = UU)"
5148 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
5149 including the First Isomorphism Theorem (on quotienting by the kernel
5152 * ZF/Simplifier: install second copy of type solver that actually
5153 makes use of TC rules declared to Isar proof contexts (or locales);
5154 the old version is still required for ML proof scripts.
5159 * Converted to Isar theory format; use locales instead of axiomatic
5165 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
5168 * Pure/library.ML no longer defines its own option datatype, but uses
5169 that of the SML basis, which has constructors NONE and SOME instead of
5170 None and Some, as well as exception Option.Option instead of OPTION.
5171 The functions the, if_none, is_some, is_none have been adapted
5172 accordingly, while Option.map replaces apsome.
5174 * Pure/library.ML: the exception LIST has been given up in favour of
5175 the standard exceptions Empty and Subscript, as well as
5176 Library.UnequalLengths. Function like Library.hd and Library.tl are
5177 superceded by the standard hd and tl functions etc.
5179 A number of basic list functions are no longer exported to the ML
5180 toplevel, as they are variants of predefined functions. The following
5181 suggests how one can translate existing code:
5183 rev_append xs ys = List.revAppend (xs, ys)
5184 nth_elem (i, xs) = List.nth (xs, i)
5185 last_elem xs = List.last xs
5186 flat xss = List.concat xss
5187 seq fs = List.app fs
5188 partition P xs = List.partition P xs
5189 mapfilter f xs = List.mapPartial f xs
5191 * Pure/library.ML: several combinators for linear functional
5192 transformations, notably reverse application and composition:
5195 (x, y) |-> f f #-> g
5197 * Pure/library.ML: introduced/changed precedence of infix operators:
5199 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
5201 infix 3 o oo ooo oooo;
5202 infix 4 ~~ upto downto;
5204 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
5207 * Pure/library.ML: natural list combinators fold, fold_rev, and
5208 fold_map support linear functional transformations and nesting. For
5211 fold f [x1, ..., xN] y =
5212 y |> f x1 |> ... |> f xN
5214 (fold o fold) f [xs1, ..., xsN] y =
5215 y |> fold f xs1 |> ... |> fold f xsN
5217 fold f [x1, ..., xN] =
5220 (fold o fold) f [xs1, ..., xsN] =
5221 fold f xs1 #> ... #> fold f xsN
5223 * Pure/library.ML: the following selectors on type 'a option are
5226 the: 'a option -> 'a (*partial*)
5227 these: 'a option -> 'a where 'a = 'b list
5228 the_default: 'a -> 'a option -> 'a
5229 the_list: 'a option -> 'a list
5231 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5232 basic operations for association lists, following natural argument
5233 order; moreover the explicit equality predicate passed here avoids
5234 potentially expensive polymorphic runtime equality checks.
5235 The old functions may be expressed as follows:
5237 assoc = uncurry (AList.lookup (op =))
5238 assocs = these oo AList.lookup (op =)
5239 overwrite = uncurry (AList.update (op =)) o swap
5241 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5243 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
5244 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
5246 replacing make_keylist and keyfilter (occassionally used)
5249 make_keylist = AList.make
5250 keyfilter = AList.find (op =)
5252 * eq_fst and eq_snd now take explicit equality parameter, thus
5253 avoiding eqtypes. Naive rewrites:
5255 eq_fst = eq_fst (op =)
5256 eq_snd = eq_snd (op =)
5258 * Removed deprecated apl and apr (rarely used).
5261 apl (n, op) =>>= curry op n
5262 apr (op, m) =>>= fn n => op (n, m)
5264 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
5265 provides a reasonably efficient light-weight implementation of sets as
5268 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
5269 few new operations; existing lookup and update are now curried to
5270 follow natural argument order (for use with fold etc.);
5271 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
5273 * Pure/General: output via the Isabelle channels of
5274 writeln/warning/error etc. is now passed through Output.output, with a
5275 hook for arbitrary transformations depending on the print_mode
5276 (cf. Output.add_mode -- the first active mode that provides a output
5277 function wins). Already formatted output may be embedded into further
5278 text via Output.raw; the result of Pretty.string_of/str_of and derived
5279 functions (string_of_term/cterm/thm etc.) is already marked raw to
5280 accommodate easy composition of diagnostic messages etc. Programmers
5281 rarely need to care about Output.output or Output.raw at all, with
5282 some notable exceptions: Output.output is required when bypassing the
5283 standard channels (writeln etc.), or in token translations to produce
5284 properly formatted results; Output.raw is required when capturing
5285 already output material that will eventually be presented to the user
5286 a second time. For the default print mode, both Output.output and
5287 Output.raw have no effect.
5289 * Pure/General: Output.time_accumulator NAME creates an operator ('a
5290 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
5291 cumulative results are displayed at the end of a batch session.
5293 * Pure/General: File.sysify_path and File.quote_sysify path have been
5294 replaced by File.platform_path and File.shell_path (with appropriate
5295 hooks). This provides a clean interface for unusual systems where the
5296 internal and external process view of file names are different.
5298 * Pure: more efficient orders for basic syntactic entities: added
5299 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
5300 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
5301 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
5302 orders now -- potential INCOMPATIBILITY for code that depends on a
5303 particular order for Symtab.keys, Symtab.dest, etc. (consider using
5304 Library.sort_strings on result).
5306 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
5307 fold_types traverse types/terms from left to right, observing natural
5308 argument order. Supercedes previous foldl_XXX versions, add_frees,
5309 add_vars etc. have been adapted as well: INCOMPATIBILITY.
5311 * Pure: name spaces have been refined, with significant changes of the
5312 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
5313 to extern(_table). The plain name entry path is superceded by a
5314 general 'naming' context, which also includes the 'policy' to produce
5315 a fully qualified name and external accesses of a fully qualified
5316 name; NameSpace.extend is superceded by context dependent
5317 Sign.declare_name. Several theory and proof context operations modify
5318 the naming context. Especially note Theory.restore_naming and
5319 ProofContext.restore_naming to get back to a sane state; note that
5320 Theory.add_path is no longer sufficient to recover from
5321 Theory.absolute_path in particular.
5323 * Pure: new flags short_names (default false) and unique_names
5324 (default true) for controlling output of qualified names. If
5325 short_names is set, names are printed unqualified. If unique_names is
5326 reset, the name prefix is reduced to the minimum required to achieve
5327 the original result when interning again, even if there is an overlap
5328 with earlier declarations.
5330 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
5331 now 'extend', and 'merge' gets an additional Pretty.pp argument
5332 (useful for printing error messages). INCOMPATIBILITY.
5334 * Pure: major reorganization of the theory context. Type Sign.sg and
5335 Theory.theory are now identified, referring to the universal
5336 Context.theory (see Pure/context.ML). Actual signature and theory
5337 content is managed as theory data. The old code and interfaces were
5338 spread over many files and structures; the new arrangement introduces
5339 considerable INCOMPATIBILITY to gain more clarity:
5341 Context -- theory management operations (name, identity, inclusion,
5342 parents, ancestors, merge, etc.), plus generic theory data;
5344 Sign -- logical signature and syntax operations (declaring consts,
5345 types, etc.), plus certify/read for common entities;
5347 Theory -- logical theory operations (stating axioms, definitions,
5348 oracles), plus a copy of logical signature operations (consts,
5349 types, etc.); also a few basic management operations (Theory.copy,
5352 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
5353 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
5354 for convenience -- they merely return the theory.
5356 * Pure: type Type.tsig is superceded by theory in most interfaces.
5358 * Pure: the Isar proof context type is already defined early in Pure
5359 as Context.proof (note that ProofContext.context and Proof.context are
5360 aliases, where the latter is the preferred name). This enables other
5361 Isabelle components to refer to that type even before Isar is present.
5363 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
5364 typeK, constK, axiomK, oracleK), but provide explicit operations for
5365 any of these kinds. For example, Sign.intern typeK is now
5366 Sign.intern_type, Theory.hide_space Sign.typeK is now
5367 Theory.hide_types. Also note that former
5368 Theory.hide_classes/types/consts are now
5369 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
5370 internalize their arguments! INCOMPATIBILITY.
5372 * Pure: get_thm interface (of PureThy and ProofContext) expects
5373 datatype thmref (with constructors Name and NameSelection) instead of
5374 plain string -- INCOMPATIBILITY;
5376 * Pure: cases produced by proof methods specify options, where NONE
5377 means to remove case bindings -- INCOMPATIBILITY in
5380 * Pure: the following operations retrieve axioms or theorems from a
5381 theory node or theory hierarchy, respectively:
5383 Theory.axioms_of: theory -> (string * term) list
5384 Theory.all_axioms_of: theory -> (string * term) list
5385 PureThy.thms_of: theory -> (string * thm) list
5386 PureThy.all_thms_of: theory -> (string * thm) list
5388 * Pure: print_tac now outputs the goal through the trace channel.
5390 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
5391 Reference Toplevel.debug (default false) controls detailed printing
5392 and tracing of low-level exceptions; Toplevel.profiling (default 0)
5393 controls execution profiling -- set to 1 for time and 2 for space
5394 (both increase the runtime).
5396 * Isar session: The initial use of ROOT.ML is now always timed,
5397 i.e. the log will show the actual process times, in contrast to the
5398 elapsed wall-clock time that the outer shell wrapper produces.
5400 * Simplifier: improved handling of bound variables (nameless
5401 representation, avoid allocating new strings). Simprocs that invoke
5402 the Simplifier recursively should use Simplifier.inherit_bounds to
5403 avoid local name clashes. Failure to do so produces warnings
5404 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
5405 for further details.
5407 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
5408 bindings for all theorems stored within a given theory; this may help
5409 in porting non-Isar theories to Isar ones, while keeping ML proof
5410 scripts for the time being.
5412 * ML operator HTML.with_charset specifies the charset begin used for
5413 generated HTML files. For example:
5415 HTML.with_charset "utf-8" use_thy "Hebrew";
5416 HTML.with_charset "utf-8" use_thy "Chinese";
5421 * Allow symlinks to all proper Isabelle executables (Isabelle,
5422 isabelle, isatool etc.).
5424 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
5425 isatool doc, isatool mkdir, display_drafts etc.).
5427 * isatool usedir: option -f allows specification of the ML file to be
5428 used by Isabelle; default is ROOT.ML.
5430 * New isatool version outputs the version identifier of the Isabelle
5431 distribution being used.
5433 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
5434 (containing Boolean satisfiability problems) into Isabelle/HOL
5439 New in Isabelle2004 (April 2004)
5440 --------------------------------
5444 * Provers/order.ML: new efficient reasoner for partial and linear orders.
5445 Replaces linorder.ML.
5447 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
5448 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
5449 (\<a>...\<z>), are now considered normal letters, and can therefore
5450 be used anywhere where an ASCII letter (a...zA...Z) has until
5451 now. COMPATIBILITY: This obviously changes the parsing of some
5452 terms, especially where a symbol has been used as a binder, say
5453 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
5454 as an identifier. Fix it by inserting a space around former
5455 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
5456 existing theory and ML files.
5458 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
5460 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
5461 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
5462 a normal (but invisible) letter. For multiple letter subscripts repeat
5463 \<^isub> like this: x\<^isub>1\<^isub>2.
5465 * Pure: There are now sub-/superscripts that can span more than one
5466 character. Text between \<^bsub> and \<^esub> is set in subscript in
5467 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
5468 superscript. The new control characters are not identifier parts.
5470 * Pure: Control-symbols of the form \<^raw:...> will literally print the
5471 content of "..." to the latex file instead of \isacntrl... . The "..."
5472 may consist of any printable characters excluding the end bracket >.
5474 * Pure: Using new Isar command "finalconsts" (or the ML functions
5475 Theory.add_finals or Theory.add_finals_i) it is now possible to
5476 declare constants "final", which prevents their being given a definition
5477 later. It is useful for constants whose behaviour is fixed axiomatically
5478 rather than definitionally, such as the meta-logic connectives.
5480 * Pure: 'instance' now handles general arities with general sorts
5481 (i.e. intersections of classes),
5483 * Presentation: generated HTML now uses a CSS style sheet to make layout
5484 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
5485 It can be changed to alter the colors/layout of generated pages.
5490 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
5491 cut_tac, subgoal_tac and thin_tac:
5492 - Now understand static (Isar) contexts. As a consequence, users of Isar
5493 locales are no longer forced to write Isar proof scripts.
5494 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
5496 - INCOMPATIBILITY: names of variables to be instantiated may no
5497 longer be enclosed in quotes. Instead, precede variable name with `?'.
5498 This is consistent with the instantiation attribute "where".
5500 * Attributes "where" and "of":
5501 - Now take type variables of instantiated theorem into account when reading
5502 the instantiation string. This fixes a bug that caused instantiated
5503 theorems to have too special types in some circumstances.
5504 - "where" permits explicit instantiations of type variables.
5506 * Calculation commands "moreover" and "also" no longer interfere with
5507 current facts ("this"), admitting arbitrary combinations with "then"
5511 - Goal statements involving the context element "includes" no longer
5512 generate theorems with internal delta predicates (those ending on
5513 "_axioms") in the premise.
5514 Resolve particular premise with <locale>.intro to obtain old form.
5515 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
5516 specification and "includes" elements in goal statement.
5517 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
5518 [intro?] and [elim?] (respectively) by default.
5519 - Experimental command for instantiation of locales in proof contexts:
5520 instantiate <label>[<attrs>]: <loc>
5521 Instantiates locale <loc> and adds all its theorems to the current context
5522 taking into account their attributes. Label and attrs are optional
5523 modifiers, like in theorem declarations. If present, names of
5524 instantiated theorems are qualified with <label>, and the attributes
5525 <attrs> are applied after any attributes these theorems might have already.
5526 If the locale has assumptions, a chained fact of the form
5527 "<loc> t1 ... tn" is expected from which instantiations of the parameters
5528 are derived. The command does not support old-style locales declared
5529 with "locale (open)".
5530 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
5532 * HOL: Tactic emulation methods induct_tac and case_tac understand static
5538 * Proof import: new image HOL4 contains the imported library from
5539 the HOL4 system with about 2500 theorems. It is imported by
5540 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
5541 can be used like any other Isabelle image. See
5542 HOL/Import/HOL/README for more information.
5545 - Much improved handling of linear and partial orders.
5546 Reasoners for linear and partial orders are set up for type classes
5547 "linorder" and "order" respectively, and are added to the default simpset
5548 as solvers. This means that the simplifier can build transitivity chains
5549 to solve goals from the assumptions.
5550 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
5551 of blast or auto after simplification become unnecessary because the goal
5552 is solved by simplification already.
5554 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
5555 all proved in axiomatic type classes for semirings, rings and fields.
5558 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
5559 now formalized using the Ring_and_Field theory mentioned above.
5560 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
5561 than before, because now they are set up once in a generic manner.
5562 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
5563 Look for the general versions in Ring_and_Field (and Power if they concern
5566 * Type "rat" of the rational numbers is now available in HOL-Complex.
5569 - Record types are now by default printed with their type abbreviation
5570 instead of the list of all field types. This can be configured via
5571 the reference "print_record_type_abbr".
5572 - Simproc "record_upd_simproc" for simplification of multiple updates added
5573 (not enabled by default).
5574 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
5575 EX x. x = sel r to True (not enabled by default).
5576 - Tactic "record_split_simp_tac" to split and simplify records added.
5578 * 'specification' command added, allowing for definition by
5579 specification. There is also an 'ax_specification' command that
5580 introduces the new constants axiomatically.
5582 * arith(_tac) is now able to generate counterexamples for reals as well.
5584 * HOL-Algebra: new locale "ring" for non-commutative rings.
5586 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
5587 definitions, thanks to Sava Krsti\'{c} and John Matthews.
5589 * HOL-Matrix: a first theory for matrices in HOL with an application of
5590 matrix theory to linear programming.
5592 * Unions and Intersections:
5593 The latex output syntax of UN and INT has been changed
5594 from "\Union x \in A. B" to "\Union_{x \in A} B"
5595 i.e. the index formulae has become a subscript.
5596 Similarly for "\Union x. B", and for \Inter instead of \Union.
5598 * Unions and Intersections over Intervals:
5599 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
5600 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
5601 like in normal math, and corresponding versions for < and for intersection.
5603 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
5604 lexicographic dictonary ordering has been added as "lexord".
5606 * ML: the legacy theory structures Int and List have been removed. They had
5607 conflicted with ML Basis Library structures having the same names.
5609 * 'refute' command added to search for (finite) countermodels. Only works
5610 for a fragment of HOL. The installation of an external SAT solver is
5611 highly recommended. See "HOL/Refute.thy" for details.
5613 * 'quickcheck' command: Allows to find counterexamples by evaluating
5614 formulae under an assignment of free variables to random values.
5615 In contrast to 'refute', it can deal with inductive datatypes,
5616 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
5622 * Streams now come with concatenation and are part of the HOLCF image
5626 New in Isabelle2003 (May 2003)
5627 ------------------------------
5631 * Provers/simplifier:
5633 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
5634 Assumptions are now subject to complete mutual simplification,
5635 not just from left to right. The simplifier now preserves
5636 the order of assumptions.
5638 Potential INCOMPATIBILITY:
5640 -- simp sometimes diverges where the old version did
5641 not, e.g. invoking simp on the goal
5643 [| P (f x); y = x; f x = f y |] ==> Q
5645 now gives rise to the infinite reduction sequence
5647 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
5649 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
5652 -- Tactics combining classical reasoner and simplification (such as auto)
5653 are also affected by this change, because many of them rely on
5654 simp. They may sometimes diverge as well or yield a different numbers
5655 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
5656 in case of problems. Sometimes subsequent calls to the classical
5657 reasoner will fail because a preceeding call to the simplifier too
5658 eagerly simplified the goal, e.g. deleted redundant premises.
5660 - The simplifier trace now shows the names of the applied rewrite rules
5662 - You can limit the number of recursive invocations of the simplifier
5663 during conditional rewriting (where the simplifie tries to solve the
5664 conditions before applying the rewrite rule):
5665 ML "simp_depth_limit := n"
5666 where n is an integer. Thus you can force termination where previously
5667 the simplifier would diverge.
5669 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5671 - No longer aborts on failed congruence proof. Instead, the
5672 congruence is ignored.
5674 * Pure: New generic framework for extracting programs from constructive
5675 proofs. See HOL/Extraction.thy for an example instantiation, as well
5676 as HOL/Extraction for some case studies.
5678 * Pure: The main goal of the proof state is no longer shown by default, only
5679 the subgoals. This behaviour is controlled by a new flag.
5680 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5681 (ML: Proof.show_main_goal).
5683 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5684 rules whose conclusion matches subgoal 1:
5685 PG menu: Isabelle/Isar -> Show me -> matching rules
5686 The rules are ordered by how closely they match the subgoal.
5687 In particular, rules that solve a subgoal outright are displayed first
5688 (or rather last, the way they are printed).
5689 (ML: ProofGeneral.print_intros())
5691 * Pure: New flag trace_unify_fail causes unification to print
5692 diagnostic information (PG: in trace buffer) when it fails. This is
5693 useful for figuring out why single step proofs like rule, erule or
5696 * Pure: Locale specifications now produce predicate definitions
5697 according to the body of text (covering assumptions modulo local
5698 definitions); predicate "loc_axioms" covers newly introduced text,
5699 while "loc" is cumulative wrt. all included locale expressions; the
5700 latter view is presented only on export into the global theory
5701 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5702 on the old view without predicates;
5704 * Pure: predefined locales "var" and "struct" are useful for sharing
5705 parameters (as in CASL, for example); just specify something like
5706 ``var x + var y + struct M'' as import;
5708 * Pure: improved thms_containing: proper indexing of facts instead of
5709 raw theorems; check validity of results wrt. current name space;
5710 include local facts of proof configuration (also covers active
5711 locales), cover fixed variables in index; may use "_" in term
5712 specification; an optional limit for the number of printed facts may
5713 be given (the default is 40);
5715 * Pure: disallow duplicate fact bindings within new-style theory files
5718 * Provers: improved induct method: assumptions introduced by case
5719 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5720 the goal statement); "foo" still refers to all facts collectively;
5722 * Provers: the function blast.overloaded has been removed: all constants
5723 are regarded as potentially overloaded, which improves robustness in exchange
5724 for slight decrease in efficiency;
5726 * Provers/linorder: New generic prover for transitivity reasoning over
5727 linear orders. Note: this prover is not efficient!
5729 * Isar: preview of problems to finish 'show' now produce an error
5730 rather than just a warning (in interactive mode);
5737 - Produces a counter example if it cannot prove a goal.
5738 Note that the counter example may be spurious if the goal is not a formula
5739 of quantifier-free linear arithmetic.
5740 In ProofGeneral the counter example appears in the trace buffer.
5742 - Knows about div k and mod k where k is a numeral of type nat or int.
5744 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5745 linear arithmetic fails. This takes account of quantifiers and divisibility.
5746 Presburger arithmetic can also be called explicitly via presburger(_tac).
5748 * simp's arithmetic capabilities have been enhanced a bit: it now
5749 takes ~= in premises into account (by performing a case split);
5751 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5752 are distributed over a sum of terms;
5754 * New tactic "trans_tac" and method "trans" instantiate
5755 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5758 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5759 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5761 * 'typedef' command has new option "open" to suppress the set
5764 * functions Min and Max on finite sets have been introduced (theory
5767 * attribute [symmetric] now works for relations as well; it turns
5768 (x,y) : R^-1 into (y,x) : R, and vice versa;
5770 * induct over a !!-quantified statement (say !!x1..xn):
5771 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5773 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5774 %x. None. Warning: empty_def now refers to the previously hidden definition
5777 * Algebra: formalization of classical algebra. Intended as base for
5778 any algebraic development in Isabelle. Currently covers group theory
5779 (up to Sylow's theorem) and ring theory (Universal Property of
5780 Univariate Polynomials). Contributions welcome;
5782 * GroupTheory: deleted, since its material has been moved to Algebra;
5784 * Complex: new directory of the complex numbers with numeric constants,
5785 nonstandard complex numbers, and some complex analysis, standard and
5786 nonstandard (Jacques Fleuriot);
5788 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5790 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5793 * Real/HahnBanach: updated and adapted to locales;
5795 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5798 * UNITY: added the Meier-Sanders theory of progress sets;
5800 * MicroJava: bytecode verifier and lightweight bytecode verifier
5801 as abstract algorithms, instantiated to the JVM;
5803 * Bali: Java source language formalization. Type system, operational
5804 semantics, axiomatic semantics. Supported language features:
5805 classes, interfaces, objects,virtual methods, static methods,
5806 static/instance fields, arrays, access modifiers, definite
5807 assignment, exceptions.
5812 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5815 * Main ZF: virtually all theories converted to new-style format;
5820 * Pure: Tactic.prove provides sane interface for internal proofs;
5821 omits the infamous "standard" operation, so this is more appropriate
5822 than prove_goalw_cterm in many situations (e.g. in simprocs);
5824 * Pure: improved error reporting of simprocs;
5826 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5830 *** Document preparation ***
5832 * uses \par instead of \\ for line breaks in theory text. This may
5833 shift some page breaks in large documents. To get the old behaviour
5834 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5836 * minimized dependencies of isabelle.sty and isabellesym.sty on
5839 * \<euro> now needs package babel/greek instead of marvosym (which
5842 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5847 New in Isabelle2002 (March 2002)
5848 --------------------------------
5850 *** Document preparation ***
5852 * greatly simplified document preparation setup, including more
5853 graceful interpretation of isatool usedir -i/-d/-D options, and more
5854 instructive isatool mkdir; users should basically be able to get
5855 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5856 users may run a separate document processing stage manually like this:
5857 "isatool usedir -D output HOL Test && isatool document Test/output";
5859 * theory dependency graph may now be incorporated into documents;
5860 isatool usedir -g true will produce session_graph.eps/.pdf for use
5861 with \includegraphics of LaTeX;
5863 * proper spacing of consecutive markup elements, especially text
5864 blocks after section headings;
5866 * support bold style (for single symbols only), input syntax is like
5867 this: "\<^bold>\<alpha>" or "\<^bold>A";
5869 * \<bullet> is now output as bold \cdot by default, which looks much
5870 better in printed text;
5872 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5873 note that these symbols are currently unavailable in Proof General /
5874 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5876 * isatool latex no longer depends on changed TEXINPUTS, instead
5877 isatool document copies the Isabelle style files to the target
5883 * Pure/Provers: improved proof by cases and induction;
5884 - 'case' command admits impromptu naming of parameters (such as
5886 - 'induct' method divinates rule instantiation from the inductive
5887 claim; no longer requires excessive ?P bindings for proper
5888 instantiation of cases;
5889 - 'induct' method properly enumerates all possibilities of set/type
5890 rules; as a consequence facts may be also passed through *type*
5891 rules without further ado;
5892 - 'induct' method now derives symbolic cases from the *rulified*
5893 rule (before it used to rulify cases stemming from the internal
5894 atomized version); this means that the context of a non-atomic
5895 statement becomes is included in the hypothesis, avoiding the
5896 slightly cumbersome show "PROP ?case" form;
5897 - 'induct' may now use elim-style induction rules without chaining
5898 facts, using ``missing'' premises from the goal state; this allows
5899 rules stemming from inductive sets to be applied in unstructured
5900 scripts, while still benefitting from proper handling of non-atomic
5901 statements; NB: major inductive premises need to be put first, all
5902 the rest of the goal is passed through the induction;
5903 - 'induct' proper support for mutual induction involving non-atomic
5904 rule statements (uses the new concept of simultaneous goals, see
5906 - append all possible rule selections, but only use the first
5907 success (no backtracking);
5908 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5909 - undeclared rule case names default to numbers 1, 2, 3, ...;
5910 - added 'print_induct_rules' (covered by help item in recent Proof
5912 - moved induct/cases attributes to Pure, methods to Provers;
5913 - generic method setup instantiated for FOL and HOL;
5915 * Pure: support multiple simultaneous goal statements, for example
5916 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5917 meta-level mechanism, this acts as if several individual goals had
5918 been stated separately; in particular common proof methods need to be
5919 repeated in order to cover all claims; note that a single elimination
5920 step is *not* sufficient to establish the two conjunctions, so this
5923 assume "A & B" then have A and B .. (*".." fails*)
5925 better use "obtain" in situations as above; alternative refer to
5926 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5928 * Pure: proper integration with ``locales''; unlike the original
5929 version by Florian Kammller, Isar locales package high-level proof
5930 contexts rather than raw logical ones (e.g. we admit to include
5931 attributes everywhere); operations on locales include merge and
5932 rename; support for implicit arguments (``structures''); simultaneous
5933 type-inference over imports and text; see also HOL/ex/Locales.thy for
5936 * Pure: the following commands have been ``localized'', supporting a
5937 target locale specification "(in name)": 'lemma', 'theorem',
5938 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5939 stored both within the locale and at the theory level (exported and
5940 qualified by the locale name);
5942 * Pure: theory goals may now be specified in ``long'' form, with
5943 ad-hoc contexts consisting of arbitrary locale elements. for example
5944 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5945 definitions may be given, too); the result is a meta-level rule with
5946 the context elements being discharged in the obvious way;
5948 * Pure: new proof command 'using' allows to augment currently used
5949 facts after a goal statement ('using' is syntactically analogous to
5950 'apply', but acts on the goal's facts only); this allows chained facts
5951 to be separated into parts given before and after a claim, as in
5952 ``from a and b have C using d and e <proof>'';
5954 * Pure: renamed "antecedent" case to "rule_context";
5956 * Pure: new 'judgment' command records explicit information about the
5957 object-logic embedding (used by several tools internally); no longer
5958 use hard-wired "Trueprop";
5960 * Pure: added 'corollary' command;
5962 * Pure: fixed 'token_translation' command;
5964 * Pure: removed obsolete 'exported' attribute;
5966 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5967 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5968 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5970 * Pure: method 'atomize' presents local goal premises as object-level
5971 statements (atomic meta-level propositions); setup controlled via
5972 rewrite rules declarations of 'atomize' attribute; example
5973 application: 'induct' method with proper rule statements in improper
5976 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5977 now consider the syntactic context of assumptions, giving a better
5978 chance to get type-inference of the arguments right (this is
5979 especially important for locales);
5981 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5984 * Pure/obtain: the formal conclusion "thesis", being marked as
5985 ``internal'', may no longer be reference directly in the text;
5986 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5989 * Pure: generic 'sym' attribute which declares a rule both as pure
5990 'elim?' and for the 'symmetric' operation;
5992 * Pure: marginal comments ``--'' may now occur just anywhere in the
5993 text; the fixed correlation with particular command syntax has been
5996 * Pure: new method 'rules' is particularly well-suited for proof
5997 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5998 but often produces more compact proof terms with less detours;
6000 * Pure/Provers/classical: simplified integration with pure rule
6001 attributes and methods; the classical "intro?/elim?/dest?"
6002 declarations coincide with the pure ones; the "rule" method no longer
6003 includes classically swapped intros; "intro" and "elim" methods no
6004 longer pick rules from the context; also got rid of ML declarations
6005 AddXIs/AddXEs/AddXDs; all of this has some potential for
6008 * Provers/classical: attribute 'swapped' produces classical inversions
6009 of introduction rules;
6011 * Provers/simplifier: 'simplified' attribute may refer to explicit
6012 rules instead of full simplifier context; 'iff' attribute handles
6015 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
6017 * HOL: 'recdef' now fails on unfinished automated proofs, use
6018 "(permissive)" option to recover old behavior;
6020 * HOL: 'inductive' no longer features separate (collective) attributes
6021 for 'intros' (was found too confusing);
6023 * HOL: properly declared induction rules less_induct and
6029 * HOL: moved over to sane numeral syntax; the new policy is as
6032 - 0 and 1 are polymorphic constants, which are defined on any
6033 numeric type (nat, int, real etc.);
6035 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
6036 binary representation internally;
6038 - type nat has special constructor Suc, and generally prefers Suc 0
6039 over 1::nat and Suc (Suc 0) over 2::nat;
6041 This change may cause significant problems of INCOMPATIBILITY; here
6042 are some hints on converting existing sources:
6044 - due to the new "num" token, "-0" and "-1" etc. are now atomic
6045 entities, so expressions involving "-" (unary or binary minus) need
6046 to be spaced properly;
6048 - existing occurrences of "1" may need to be constraint "1::nat" or
6049 even replaced by Suc 0; similar for old "2";
6051 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
6053 - remove all special provisions on numerals in proofs;
6055 * HOL: simp rules nat_number expand numerals on nat to Suc/0
6056 representation (depends on bin_arith_simps in the default context);
6058 * HOL: symbolic syntax for x^2 (numeral 2);
6060 * HOL: the class of all HOL types is now called "type" rather than
6061 "term"; INCOMPATIBILITY, need to adapt references to this type class
6062 in axclass/classes, instance/arities, and (usually rare) occurrences
6063 in typings (of consts etc.); internally the class is called
6064 "HOL.type", ML programs should refer to HOLogic.typeS;
6066 * HOL/record package improvements:
6067 - new derived operations "fields" to build a partial record section,
6068 "extend" to promote a fixed record to a record scheme, and
6069 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
6070 declared as simp by default;
6071 - shared operations ("more", "fields", etc.) now need to be always
6072 qualified) --- potential INCOMPATIBILITY;
6073 - removed "make_scheme" operations (use "make" with "extend") --
6075 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
6076 - provides cases/induct rules for use with corresponding Isar
6077 methods (for concrete records, record schemes, concrete more
6078 parts, and schematic more parts -- in that order);
6079 - internal definitions directly based on a light-weight abstract
6080 theory of product types over typedef rather than datatype;
6082 * HOL: generic code generator for generating executable ML code from
6083 specifications; specific support for HOL constructs such as inductive
6084 datatypes and sets, as well as recursive functions; can be invoked
6085 via 'generate_code' theory section;
6087 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
6089 * HOL: consolidated and renamed several theories. In particular:
6090 Ord.thy has been absorbed into HOL.thy
6091 String.thy has been absorbed into List.thy
6093 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
6094 (beware of argument permutation!);
6096 * HOL: linorder_less_split superseded by linorder_cases;
6098 * HOL/List: "nodups" renamed to "distinct";
6100 * HOL: added "The" definite description operator; move Hilbert's "Eps"
6101 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
6102 - Ex_def has changed, now need to use some_eq_ex
6104 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
6105 in this (rare) case use:
6107 delSWrapper "split_all_tac"
6108 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
6110 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
6113 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
6114 Isabelle's type classes, ^ on functions and relations has too general
6115 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
6116 necessary to attach explicit type constraints;
6118 * HOL/Relation: the prefix name of the infix "O" has been changed from
6119 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
6120 renamed accordingly (eg "compI" -> "rel_compI").
6122 * HOL: syntax translations now work properly with numerals and records
6125 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
6126 of "lam" -- INCOMPATIBILITY;
6128 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
6129 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
6130 renamed "Product_Type.unit";
6132 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
6134 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
6135 the "cases" method);
6137 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
6140 * HOL/IMP: updated and converted to new-style theory format; several
6141 parts turned into readable document, with proper Isar proof texts and
6142 some explanations (by Gerwin Klein);
6144 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
6146 * HOL-Hyperreal is now a logic image;
6151 * Isar: consts/constdefs supports mixfix syntax for continuous
6154 * Isar: domain package adapted to new-style theory format, e.g. see
6157 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
6158 potential INCOMPATIBILITY; now use plain induct_tac instead of former
6159 lift.induct_tac, always use UU instead of Undef;
6161 * HOLCF/IMP: updated and converted to new-style theory;
6166 * Isar: proper integration of logic-specific tools and packages,
6167 including theory commands '(co)inductive', '(co)datatype',
6168 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
6169 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
6171 * theory Main no longer includes AC; for the Axiom of Choice, base
6172 your theory on Main_ZFC;
6174 * the integer library now covers quotients and remainders, with many
6175 laws relating division to addition, multiplication, etc.;
6177 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
6178 typeless version of the formalism;
6180 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
6183 * ZF/Induct: new directory for examples of inductive definitions,
6184 including theory Multiset for multiset orderings; converted to
6185 new-style theory format;
6187 * ZF: many new theorems about lists, ordinals, etc.;
6192 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
6193 variable proof controls level of detail: 0 = no proofs (only oracle
6194 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
6195 also ref manual for further ML interfaces;
6197 * Pure/axclass: removed obsolete ML interface
6198 goal_subclass/goal_arity;
6200 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
6201 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
6202 separate tokens, so expressions involving minus need to be spaced
6205 * Pure/syntax: support non-oriented infixes, using keyword "infix"
6206 rather than "infixl" or "infixr";
6208 * Pure/syntax: concrete syntax for dummy type variables admits genuine
6209 sort constraint specifications in type inference; e.g. "x::_::foo"
6210 ensures that the type of "x" is of sort "foo" (but not necessarily a
6213 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
6214 control output of nested => (types); the default behavior is
6217 * Pure/syntax: builtin parse translation for "_constify" turns valued
6218 tokens into AST constants;
6220 * Pure/syntax: prefer later declarations of translations and print
6221 translation functions; potential INCOMPATIBILITY: need to reverse
6222 multiple declarations for same syntax element constant;
6224 * Pure/show_hyps reset by default (in accordance to existing Isar
6227 * Provers/classical: renamed addaltern to addafter, addSaltern to
6230 * Provers/clasimp: ``iff'' declarations now handle conditional rules
6233 * system: tested support for MacOS X; should be able to get Isabelle +
6234 Proof General to work in a plain Terminal after installing Poly/ML
6235 (e.g. from the Isabelle distribution area) and GNU bash alone
6236 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
6237 support requires further installations, e.g. from
6238 http://fink.sourceforge.net/);
6240 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
6242 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
6243 of 40 MB), cf. ML_OPTIONS;
6245 * system: Proof General keywords specification is now part of the
6246 Isabelle distribution (see etc/isar-keywords.el);
6248 * system: support for persistent Proof General sessions (refrain from
6249 outdating all loaded theories on startup); user may create writable
6250 logic images like this: ``isabelle -q HOL Test'';
6252 * system: smart selection of Isabelle process versus Isabelle
6253 interface, accommodates case-insensitive file systems (e.g. HFS+); may
6254 run both "isabelle" and "Isabelle" even if file names are badly
6255 damaged (executable inspects the case of the first letter of its own
6256 name); added separate "isabelle-process" and "isabelle-interface";
6258 * system: refrain from any attempt at filtering input streams; no
6259 longer support ``8bit'' encoding of old isabelle font, instead proper
6260 iso-latin characters may now be used; the related isatools
6261 "symbolinput" and "nonascii" have disappeared as well;
6263 * system: removed old "xterm" interface (the print modes "xterm" and
6264 "xterm_color" are still available for direct use in a suitable
6269 New in Isabelle99-2 (February 2001)
6270 -----------------------------------
6272 *** Overview of INCOMPATIBILITIES ***
6274 * HOL: please note that theories in the Library and elsewhere often use the
6275 new-style (Isar) format; to refer to their theorems in an ML script you must
6276 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
6278 * HOL: inductive package no longer splits induction rule aggressively,
6279 but only as far as specified by the introductions given; the old
6280 format may be recovered via ML function complete_split_rule or attribute
6281 'split_rule (complete)';
6283 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
6284 gfp_Tarski to gfp_unfold;
6286 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
6288 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
6289 relation); infix "^^" has been renamed "``"; infix "``" has been
6290 renamed "`"; "univalent" has been renamed "single_valued";
6292 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
6295 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
6297 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
6299 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
6300 consequence, it is no longer monotonic wrt. the local goal context
6301 (which is now passed through the inductive cases);
6303 * Document preparation: renamed standard symbols \<ll> to \<lless> and
6304 \<gg> to \<ggreater>;
6307 *** Document preparation ***
6309 * \isabellestyle{NAME} selects version of Isabelle output (currently
6310 available: are "it" for near math-mode best-style output, "sl" for
6311 slanted text style, and "tt" for plain type-writer; if no
6312 \isabellestyle command is given, output is according to slanted
6315 * support sub/super scripts (for single symbols only), input syntax is
6316 like this: "A\<^sup>*" or "A\<^sup>\<star>";
6318 * some more standard symbols; see Appendix A of the system manual for
6319 the complete list of symbols defined in isabellesym.sty;
6321 * improved isabelle style files; more abstract symbol implementation
6322 (should now use \isamath{...} and \isatext{...} in custom symbol
6325 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
6326 state; Note that presentation of goal states does not conform to
6327 actual human-readable proof documents. Please do not include goal
6328 states into document output unless you really know what you are doing!
6330 * proper indentation of antiquoted output with proportional LaTeX
6333 * no_document ML operator temporarily disables LaTeX document
6336 * isatool unsymbolize tunes sources for plain ASCII communication;
6341 * Pure: Isar now suffers initial goal statements to contain unbound
6342 schematic variables (this does not conform to actual readable proof
6343 documents, due to unpredictable outcome and non-compositional proof
6344 checking); users who know what they are doing may use schematic goals
6345 for Prolog-style synthesis of proven results;
6347 * Pure: assumption method (an implicit finishing) now handles actual
6350 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
6351 initial goal, declare "that" only as Pure intro (only for single
6352 steps); the "that" rule assumption may now be involved in implicit
6353 finishing, thus ".." becomes a feasible for trivial obtains;
6355 * Pure: default proof step now includes 'intro_classes'; thus trivial
6356 instance proofs may be performed by "..";
6358 * Pure: ?thesis / ?this / "..." now work for pure meta-level
6361 * Pure: more robust selection of calculational rules;
6363 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
6364 rule (as well as the assumption rule);
6366 * Pure: 'thm_deps' command visualizes dependencies of theorems and
6367 lemmas, using the graph browser tool;
6369 * Pure: predict failure of "show" in interactive mode;
6371 * Pure: 'thms_containing' now takes actual terms as arguments;
6373 * HOL: improved method 'induct' --- now handles non-atomic goals
6374 (potential INCOMPATIBILITY); tuned error handling;
6376 * HOL: cases and induct rules now provide explicit hints about the
6377 number of facts to be consumed (0 for "type" and 1 for "set" rules);
6378 any remaining facts are inserted into the goal verbatim;
6380 * HOL: local contexts (aka cases) may now contain term bindings as
6381 well; the 'cases' and 'induct' methods new provide a ?case binding for
6382 the result to be shown in each case;
6384 * HOL: added 'recdef_tc' command;
6386 * isatool convert assists in eliminating legacy ML scripts;
6391 * HOL/Library: a collection of generic theories to be used together
6392 with main HOL; the theory loader path already includes this directory
6393 by default; the following existing theories have been moved here:
6394 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
6395 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
6397 * HOL/Unix: "Some aspects of Unix file-system security", a typical
6398 modelling and verification task performed in Isabelle/HOL +
6399 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
6401 * HOL/Algebra: special summation operator SUM no longer exists, it has
6402 been replaced by setsum; infix 'assoc' now has priority 50 (like
6403 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
6404 'domain', this makes the theory consistent with mathematical
6407 * HOL basics: added overloaded operations "inverse" and "divide"
6408 (infix "/"), syntax for generic "abs" operation, generic summation
6411 * HOL/typedef: simplified package, provide more useful rules (see also
6414 * HOL/datatype: induction rule for arbitrarily branching datatypes is
6415 now expressed as a proper nested rule (old-style tactic scripts may
6416 require atomize_strip_tac to cope with non-atomic premises);
6418 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
6419 to "split_conv" (old name still available for compatibility);
6421 * HOL: improved concrete syntax for strings (e.g. allows translation
6422 rules with string literals);
6424 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
6425 and Fleuriot's mechanization of analysis, including the transcendental
6426 functions for the reals;
6428 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
6433 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
6434 "lam" is displayed as TWO lambda-symbols
6436 * CTT: theory Main now available, containing everything (that is, Bool
6442 * Pure: the Simplifier has been implemented properly as a derived rule
6443 outside of the actual kernel (at last!); the overall performance
6444 penalty in practical applications is about 50%, while reliability of
6445 the Isabelle inference kernel has been greatly improved;
6447 * print modes "brackets" and "no_brackets" control output of nested =>
6448 (types) and ==> (props); the default behaviour is "brackets";
6450 * Provers: fast_tac (and friends) now handle actual object-logic rules
6451 as assumptions as well;
6453 * system: support Poly/ML 4.0;
6455 * system: isatool install handles KDE version 1 or 2;
6459 New in Isabelle99-1 (October 2000)
6460 ----------------------------------
6462 *** Overview of INCOMPATIBILITIES ***
6464 * HOL: simplification of natural numbers is much changed; to partly
6465 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
6466 issue the following ML commands:
6468 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
6469 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
6471 * HOL: simplification no longer dives into case-expressions; this is
6472 controlled by "t.weak_case_cong" for each datatype t;
6474 * HOL: nat_less_induct renamed to less_induct;
6476 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
6477 fixsome to patch .thy and .ML sources automatically;
6479 select_equality -> some_equality
6480 select_eq_Ex -> some_eq_ex
6481 selectI2EX -> someI2_ex
6484 select1_equality -> some1_equality
6485 Eps_sym_eq -> some_sym_eq_trivial
6486 Eps_eq -> some_eq_trivial
6488 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
6490 * HOL: removed obsolete theorem binding expand_if (refer to split_if
6493 * HOL: the recursion equations generated by 'recdef' are now called
6494 f.simps instead of f.rules;
6496 * HOL: qed_spec_mp now also handles bounded ALL as well;
6498 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
6499 sometimes be needed;
6501 * HOL: the constant for "f``x" is now "image" rather than "op ``";
6503 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
6505 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
6506 product is now "<*>" instead of "Times"; the lexicographic product is
6507 now "<*lex*>" instead of "**";
6509 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
6510 of main HOL, but was unused); better use HOL's datatype package;
6512 * HOL: removed "symbols" syntax for constant "override" of theory Map;
6513 the old syntax may be recovered as follows:
6516 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
6517 (infixl "\\<oplus>" 100)
6519 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6521 * HOL/ML: even fewer consts are declared as global (see theories Ord,
6522 Lfp, Gfp, WF); this only affects ML packages that refer to const names
6525 * HOL and ZF: syntax for quotienting wrt an equivalence relation
6526 changed from A/r to A//r;
6528 * ZF: new treatment of arithmetic (nat & int) may break some old
6531 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
6532 rulify -> rule_format, elimify -> elim_format, ...);
6534 * Isar/Provers: intro/elim/dest attributes changed; renamed
6535 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
6536 should have to change intro!! to intro? only); replaced "delrule" by
6539 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
6541 * Provers: strengthened force_tac by using new first_best_tac;
6543 * LaTeX document preparation: several changes of isabelle.sty (see
6547 *** Document preparation ***
6549 * formal comments (text blocks etc.) in new-style theories may now
6550 contain antiquotations of thm/prop/term/typ/text to be presented
6551 according to latex print mode; concrete syntax is like this:
6552 @{term[show_types] "f(x) = a + x"};
6554 * isatool mkdir provides easy setup of Isabelle session directories,
6555 including proper document sources;
6557 * generated LaTeX sources are now deleted after successful run
6558 (isatool document -c); may retain a copy somewhere else via -D option
6561 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
6562 style files, achieving self-contained LaTeX sources and simplifying
6565 * old-style theories now produce (crude) LaTeX output as well;
6567 * browser info session directories are now self-contained (may be put
6568 on WWW server seperately); improved graphs of nested sessions; removed
6569 graph for 'all sessions';
6571 * several improvements in isabelle style files; \isabellestyle{it}
6572 produces fake math mode output; \isamarkupheader is now \section by
6573 default; see lib/texinputs/isabelle.sty etc.;
6578 * Isar/Pure: local results and corresponding term bindings are now
6579 subject to Hindley-Milner polymorphism (similar to ML); this
6580 accommodates incremental type-inference very nicely;
6582 * Isar/Pure: new derived language element 'obtain' supports
6583 generalized existence reasoning;
6585 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
6586 support accumulation of results, without applying any rules yet;
6587 useful to collect intermediate results without explicit name
6588 references, and for use with transitivity rules with more than 2
6591 * Isar/Pure: scalable support for case-analysis type proofs: new
6592 'case' language element refers to local contexts symbolically, as
6593 produced by certain proof methods; internally, case names are attached
6594 to theorems as "tags";
6596 * Isar/Pure: theory command 'hide' removes declarations from
6597 class/type/const name spaces;
6599 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
6600 indicate potential overloading;
6602 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
6604 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
6605 "{a,b,c}" instead of {a,b,c};
6607 * Isar/Pure now provides its own version of intro/elim/dest
6608 attributes; useful for building new logics, but beware of confusion
6609 with the version in Provers/classical;
6611 * Isar/Pure: the local context of (non-atomic) goals is provided via
6612 case name 'antecedent';
6614 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
6615 to the current context is now done automatically);
6617 * Isar/Pure: theory command 'method_setup' provides a simple interface
6618 for definining proof methods in ML;
6620 * Isar/Provers: intro/elim/dest attributes changed; renamed
6621 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
6622 most cases, one should have to change intro!! to intro? only);
6623 replaced "delrule" by "rule del";
6625 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
6626 'symmetric' attribute (the latter supercedes [RS sym]);
6628 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
6629 method modifier); 'simp' method: 'only:' modifier removes loopers as
6630 well (including splits);
6632 * Isar/Provers: Simplifier and Classical methods now support all kind
6633 of modifiers used in the past, including 'cong', 'iff', etc.
6635 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
6636 of Simplifier and Classical reasoner);
6638 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
6639 now support named cases; major packages (inductive, datatype, primrec,
6640 recdef) support case names and properly name parameters;
6642 * Isar/HOL: new transitivity rules for substitution in inequalities --
6643 monotonicity conditions are extracted to be proven at end of
6646 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
6649 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
6650 split_if split_if_asm; datatype package provides theorems foo.splits =
6651 foo.split foo.split_asm for each datatype;
6653 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
6654 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
6655 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
6656 use "(cases (simplified))" method in proper proof texts);
6658 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
6660 * Isar: names of theorems etc. may be natural numbers as well;
6662 * Isar: 'pr' command: optional arguments for goals_limit and
6663 ProofContext.prems_limit; no longer prints theory contexts, but only
6666 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6667 additional print modes to be specified; e.g. "pr(latex)" will print
6668 proof state according to the Isabelle LaTeX style;
6670 * Isar: improved support for emulating tactic scripts, including proof
6671 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6672 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6673 (for HOL datatypes);
6675 * Isar: simplified (more robust) goal selection of proof methods: 1st
6676 goal, all goals, or explicit goal specifier (tactic emulation); thus
6677 'proof method scripts' have to be in depth-first order;
6679 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6681 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6682 should instead use individual commands for printing items
6683 (print_commands, print_methods etc.);
6685 * Isar: added 'nothing' --- the empty list of theorems;
6690 * HOL/MicroJava: formalization of a fragment of Java, together with a
6691 corresponding virtual machine and a specification of its bytecode
6692 verifier and a lightweight bytecode verifier, including proofs of
6693 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6694 Cornelia Pusch (see also the homepage of project Bali at
6695 http://isabelle.in.tum.de/Bali/);
6697 * HOL/Algebra: new theory of rings and univariate polynomials, by
6700 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6701 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6704 * HOL/Lattice: fundamental concepts of lattice theory and order
6705 structures, including duals, properties of bounds versus algebraic
6706 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6707 Theorem for complete lattices etc.; may also serve as a demonstration
6708 for abstract algebraic reasoning using axiomatic type classes, and
6709 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6711 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6714 * HOL/IMPP: extension of IMP with local variables and mutually
6715 recursive procedures, by David von Oheimb;
6717 * HOL/Lambda: converted into new-style theory and document;
6719 * HOL/ex/Multiquote: example of multiple nested quotations and
6720 anti-quotations -- basically a generalized version of de-Bruijn
6721 representation; very useful in avoiding lifting of operations;
6723 * HOL/record: added general record equality rule to simpset; fixed
6724 select-update simplification procedure to handle extended records as
6725 well; admit "r" as field name;
6727 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6728 other numeric types and also as the identity of groups, rings, etc.;
6730 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6731 Types nat and int belong to this axclass;
6733 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6734 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6735 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6736 two terms #m*u and #n*u are replaced by #(m+n)*u
6737 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6738 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6739 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6741 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6742 powerful prover for predicate logic but knows nothing of clasets; see
6743 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6745 * HOL: new version of "case_tac" subsumes both boolean case split and
6746 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6747 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6749 * HOL: simplification no longer dives into case-expressions: only the
6750 selector expression is simplified, but not the remaining arms; to
6751 enable full simplification of case-expressions for datatype t, you may
6752 remove t.weak_case_cong from the simpset, either globally (Delcongs
6753 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6755 * HOL/recdef: the recursion equations generated by 'recdef' for
6756 function 'f' are now called f.simps instead of f.rules; if all
6757 termination conditions are proved automatically, these simplification
6758 rules are added to the simpset, as in primrec; rules may be named
6759 individually as well, resulting in a separate list of theorems for
6762 * HOL/While is a new theory that provides a while-combinator. It
6763 permits the definition of tail-recursive functions without the
6764 provision of a termination measure. The latter is necessary once the
6765 invariant proof rule for while is applied.
6767 * HOL: new (overloaded) notation for the set of elements below/above
6768 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6770 * HOL: theorems impI, allI, ballI bound as "strip";
6772 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6773 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6774 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6776 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6778 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6779 main HOL, but was unused);
6781 * HOL: fewer consts declared as global (e.g. have to refer to
6782 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6784 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6785 in case of overlap with user translations (e.g. judgements over
6786 tuples); (note that the underlying logical represenation is still
6792 * ZF: simplification automatically cancels common terms in arithmetic
6793 expressions over nat and int;
6795 * ZF: new treatment of nat to minimize type-checking: all operators
6796 coerce their operands to a natural number using the function natify,
6797 making the algebraic laws unconditional;
6799 * ZF: as above, for int: operators coerce their operands to an integer
6800 using the function intify;
6802 * ZF: the integer library now contains many of the usual laws for the
6803 orderings, including $<=, and monotonicity laws for $+ and $*;
6805 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6808 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6809 to the simplifier and classical reasoner simultaneously;
6814 * Provers: blast_tac now handles actual object-logic rules as
6815 assumptions; note that auto_tac uses blast_tac internally as well;
6817 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6818 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6820 * Provers: delrules now handles destruct rules as well (no longer need
6821 explicit make_elim);
6823 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6824 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6825 use instead the strong form,
6826 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6827 in HOL, FOL and ZF the function cla_make_elim will create such rules
6828 from destruct-rules;
6830 * Provers: Simplifier.easy_setup provides a fast path to basic
6831 Simplifier setup for new object-logics;
6833 * Pure: AST translation rules no longer require constant head on LHS;
6835 * Pure: improved name spaces: ambiguous output is qualified; support
6836 for hiding of names;
6838 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6839 XSYMBOL_HOME; no longer need to do manual configuration in most
6842 * system: compression of ML heaps images may now be controlled via -c
6843 option of isabelle and isatool usedir (currently only observed by
6846 * system: isatool installfonts may handle X-Symbol fonts as well (very
6847 useful for remote X11);
6849 * system: provide TAGS file for Isabelle sources;
6851 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6854 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6855 timing flag supersedes proof_timing and Toplevel.trace;
6857 * ML: new combinators |>> and |>>> for incremental transformations
6858 with secondary results (e.g. certain theory extensions):
6860 * ML: PureThy.add_defs gets additional argument to indicate potential
6861 overloading (usually false);
6863 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6868 New in Isabelle99 (October 1999)
6869 --------------------------------
6871 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6873 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6874 are no longer simplified. (This allows the simplifier to unfold recursive
6875 functional programs.) To restore the old behaviour, declare
6877 Delcongs [if_weak_cong];
6879 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6882 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6884 * HOL/datatype: mutual_induct_tac no longer exists --
6885 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6887 * HOL/typedef: fixed type inference for representing set; type
6888 arguments now have to occur explicitly on the rhs as type constraints;
6890 * ZF: The con_defs part of an inductive definition may no longer refer
6891 to constants declared in the same theory;
6893 * HOL, ZF: the function mk_cases, generated by the inductive
6894 definition package, has lost an argument. To simplify its result, it
6895 uses the default simpset instead of a supplied list of theorems.
6897 * HOL/List: the constructors of type list are now Nil and Cons;
6899 * Simplifier: the type of the infix ML functions
6900 setSSolver addSSolver setSolver addSolver
6901 is now simpset * solver -> simpset where `solver' is a new abstract type
6902 for packaging solvers. A solver is created via
6903 mk_solver: string -> (thm list -> int -> tactic) -> solver
6904 where the string argument is only a comment.
6909 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6910 decision procedure for linear arithmetic. Currently it is used for
6911 types `nat', `int', and `real' in HOL (see below); it can, should and
6912 will be instantiated for other types and logics as well.
6914 * The simplifier now accepts rewrite rules with flexible heads, eg
6915 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6916 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6922 * New Isabelle/Isar subsystem provides an alternative to traditional
6923 tactical theorem proving; together with the ProofGeneral/isar user
6924 interface it offers an interactive environment for developing human
6925 readable proof documents (Isar == Intelligible semi-automated
6926 reasoning); for further information see isatool doc isar-ref,
6927 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6929 * improved and simplified presentation of theories: better HTML markup
6930 (including colors), graph views in several sizes; isatool usedir now
6931 provides a proper interface for user theories (via -P option); actual
6932 document preparation based on (PDF)LaTeX is available as well (for
6933 new-style theories only); see isatool doc system for more information;
6935 * native support for Proof General, both for classic Isabelle and
6938 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6939 using the graph browser tool;
6941 * Isabelle manuals now also available as PDF;
6943 * theory loader rewritten from scratch (may not be fully
6944 bug-compatible); old loadpath variable has been replaced by show_path,
6945 add_path, del_path, reset_path functions; new operations such as
6946 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6949 * improved isatool install: option -k creates KDE application icon,
6950 option -p DIR installs standalone binaries;
6952 * added ML_PLATFORM setting (useful for cross-platform installations);
6953 more robust handling of platform specific ML images for SML/NJ;
6955 * the settings environment is now statically scoped, i.e. it is never
6956 created again in sub-processes invoked from isabelle, isatool, or
6959 * path element specification '~~' refers to '$ISABELLE_HOME';
6961 * in locales, the "assumes" and "defines" parts may be omitted if
6964 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6967 * new print_mode "HTML";
6969 * new flag show_tags controls display of tags of theorems (which are
6970 basically just comments that may be attached by some tools);
6972 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6973 mode and goal output format:
6975 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6977 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6979 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6980 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6982 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6984 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6986 * function bind_thms stores lists of theorems (cf. bind_thm);
6988 * new shorthand tactics ftac, eatac, datac, fatac;
6990 * qed (and friends) now accept "" as result name; in that case the
6991 theorem is not stored, but proper checks and presentation of the
6994 * theorem database now also indexes constants "Trueprop", "all",
6995 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
7000 ** HOL arithmetic **
7002 * There are now decision procedures for linear arithmetic over nat and
7005 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
7006 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
7007 are treated as atomic; subformulae not involving type `nat' or `int'
7008 are ignored; quantified subformulae are ignored unless they are
7009 positive universal or negative existential. The tactic has to be
7010 invoked by hand and can be a little bit slow. In particular, the
7011 running time is exponential in the number of occurrences of `min' and
7012 `max', and `-' on `nat'.
7014 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
7015 (negated) (in)equalities among the premises and the conclusion into
7016 account (i.e. no compound formulae) and does not know about `min' and
7017 `max', and `-' on `nat'. It is fast and is used automatically by the
7020 NB: At the moment, these decision procedures do not cope with mixed
7021 nat/int formulae where the two parts interact, such as `m < n ==>
7024 * HOL/Numeral provides a generic theory of numerals (encoded
7025 efficiently as bit strings); setup for types nat/int/real is in place;
7026 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
7027 int, existing theories and proof scripts may require a few additional
7030 * integer division and remainder can now be performed on constant
7033 * many properties of integer multiplication, division and remainder
7036 * An interface to the Stanford Validity Checker (SVC) is available through the
7037 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
7038 are proved automatically. SVC must be installed separately, and its results
7039 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
7040 invocation of the underlying oracle). For SVC see
7041 http://verify.stanford.edu/SVC
7043 * IsaMakefile: the HOL-Real target now builds an actual image;
7048 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
7049 (in Isabelle/Isar) -- by Gertrud Bauer;
7051 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
7052 analysis for assembly languages with subtypes;
7054 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
7055 -- avoids syntactic ambiguities and treats state, transition, and
7056 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
7057 changed syntax and (many) tactics;
7059 * HOL/inductive: Now also handles more general introduction rules such
7060 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
7061 theorems are now maintained within the theory (maintained via the
7064 * HOL/datatype: Now also handles arbitrarily branching datatypes
7065 (using function types) such as
7067 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
7069 * HOL/record: record_simproc (part of the default simpset) takes care
7070 of selectors applied to updated records; record_split_tac is no longer
7071 part of the default claset; update_defs may now be removed from the
7072 simpset in many cases; COMPATIBILITY: old behavior achieved by
7074 claset_ref () := claset() addSWrapper record_split_wrapper;
7075 Delsimprocs [record_simproc]
7077 * HOL/typedef: fixed type inference for representing set; type
7078 arguments now have to occur explicitly on the rhs as type constraints;
7080 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
7081 names rather than an ML expression;
7083 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
7084 supplied later. Program schemes can be defined, such as
7085 "While B C s = (if B s then While B C (C s) else s)"
7086 where the well-founded relation can be chosen after B and C have been given.
7088 * HOL/List: the constructors of type list are now Nil and Cons;
7089 INCOMPATIBILITY: while [] and infix # syntax is still there, of
7090 course, ML tools referring to List.list.op # etc. have to be adapted;
7092 * HOL_quantifiers flag superseded by "HOL" print mode, which is
7093 disabled by default; run isabelle with option -m HOL to get back to
7094 the original Gordon/HOL-style output;
7096 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
7097 ALL x<=y. P, EX x<y. P, EX x<=y. P;
7099 * HOL basic syntax simplified (more orthogonal): all variants of
7100 All/Ex now support plain / symbolic / HOL notation; plain syntax for
7101 Eps operator is provided as well: "SOME x. P[x]";
7103 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
7105 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
7106 thus available for user theories;
7108 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
7109 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
7112 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
7113 several times and then mp;
7118 * the notation <<...>> is now available as a notation for sequences of
7121 * the simplifier is now installed
7123 * the axiom system has been generalized (thanks to Soren Heilmann)
7125 * the classical reasoner now has a default rule database
7130 * new primrec section allows primitive recursive functions to be given
7131 directly (as in HOL) over datatypes and the natural numbers;
7133 * new tactics induct_tac and exhaust_tac for induction (or case
7134 analysis) over datatypes and the natural numbers;
7136 * the datatype declaration of type T now defines the recursor T_rec;
7138 * simplification automatically does freeness reasoning for datatype
7141 * automatic type-inference, with AddTCs command to insert new
7142 type-checking rules;
7144 * datatype introduction rules are now added as Safe Introduction rules
7147 * the syntax "if P then x else y" is now available in addition to
7151 *** Internal programming interfaces ***
7153 * tuned simplifier trace output; new flag debug_simp;
7155 * structures Vartab / Termtab (instances of TableFun) offer efficient
7156 tables indexed by indexname_ord / term_ord (compatible with aconv);
7158 * AxClass.axclass_tac lost the theory argument;
7160 * tuned current_goals_markers semantics: begin / end goal avoids
7161 printing empty lines;
7163 * removed prs and prs_fn hook, which was broken because it did not
7164 include \n in its semantics, forcing writeln to add one
7165 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
7166 string -> unit if you really want to output text without newline;
7168 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
7169 plain output, interface builders may have to enable 'isabelle_font'
7170 mode to get Isabelle font glyphs as before;
7172 * refined token_translation interface; INCOMPATIBILITY: output length
7173 now of type real instead of int;
7175 * theory loader actions may be traced via new ThyInfo.add_hook
7176 interface (see src/Pure/Thy/thy_info.ML); example application: keep
7177 your own database of information attached to *whole* theories -- as
7178 opposed to intra-theory data slots offered via TheoryDataFun;
7180 * proper handling of dangling sort hypotheses (at last!);
7181 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
7182 extra sort hypotheses that can be witnessed from the type signature;
7183 the force_strip_shyps flag is gone, any remaining shyps are simply
7184 left in the theorem (with a warning issued by strip_shyps_warning);
7188 New in Isabelle98-1 (October 1998)
7189 ----------------------------------
7191 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7193 * several changes of automated proof tools;
7195 * HOL: major changes to the inductive and datatype packages, including
7196 some minor incompatibilities of theory syntax;
7198 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
7201 * HOL: removed duplicate thms in Arith:
7202 less_imp_add_less should be replaced by trans_less_add1
7203 le_imp_add_le should be replaced by trans_le_add1
7205 * HOL: unary minus is now overloaded (new type constraints may be
7208 * HOL and ZF: unary minus for integers is now #- instead of #~. In
7209 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
7210 now taken as an integer constant.
7212 * Pure: ML function 'theory_of' renamed to 'theory';
7218 1. Asm_full_simp_tac is now more aggressive.
7219 1. It will sometimes reorient premises if that increases their power to
7221 2. It does no longer proceed strictly from left to right but may also
7222 rotate premises to achieve further simplification.
7223 For compatibility reasons there is now Asm_lr_simp_tac which is like the
7224 old Asm_full_simp_tac in that it does not rotate premises.
7225 2. The simplifier now knows a little bit about nat-arithmetic.
7227 * Classical reasoner: wrapper mechanism for the classical reasoner now
7228 allows for selected deletion of wrappers, by introduction of names for
7229 wrapper functionals. This implies that addbefore, addSbefore,
7230 addaltern, and addSaltern now take a pair (name, tactic) as argument,
7231 and that adding two tactics with the same name overwrites the first
7232 one (emitting a warning).
7233 type wrapper = (int -> tactic) -> (int -> tactic)
7234 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
7235 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
7236 delWrapper, delSWrapper: claset * string -> claset
7237 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
7239 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
7240 semantics; addbefore now affects only the unsafe part of step_tac
7241 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
7242 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
7245 * Classical reasoner: setwrapper to setWrapper and compwrapper to
7246 compWrapper; added safe wrapper (and access functions for it);
7248 * HOL/split_all_tac is now much faster and fails if there is nothing
7249 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
7250 and the names of the automatically generated variables have changed.
7251 split_all_tac has moved within claset() from unsafe wrappers to safe
7252 wrappers, which means that !!-bound variables are split much more
7253 aggressively, and safe_tac and clarify_tac now split such variables.
7254 If this splitting is not appropriate, use delSWrapper "split_all_tac".
7255 Note: the same holds for record_split_tac, which does the job of
7256 split_all_tac for record fields.
7258 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
7259 permanently to the default simpset using Addsplits just like
7260 Addsimps. They can be removed via Delsplits just like
7261 Delsimps. Lower-case versions are also available.
7263 * HOL/Simplifier: The rule split_if is now part of the default
7264 simpset. This means that the simplifier will eliminate all occurrences
7265 of if-then-else in the conclusion of a goal. To prevent this, you can
7266 either remove split_if completely from the default simpset by
7267 `Delsplits [split_if]' or remove it in a specific call of the
7268 simplifier using `... delsplits [split_if]'. You can also add/delete
7269 other case splitting rules to/from the default simpset: every datatype
7270 generates suitable rules `split_t_case' and `split_t_case_asm' (where
7271 t is the name of the datatype).
7273 * Classical reasoner / Simplifier combination: new force_tac (and
7274 derivatives Force_tac, force) combines rewriting and classical
7275 reasoning (and whatever other tools) similarly to auto_tac, but is
7276 aimed to solve the given subgoal completely.
7281 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
7282 and `goalw': the theory is no longer needed as an explicit argument -
7283 the current theory context is used; assumptions are no longer returned
7284 at the ML-level unless one of them starts with ==> or !!; it is
7285 recommended to convert to these new commands using isatool fixgoal
7286 (backup your sources first!);
7288 * new top-level commands 'thm' and 'thms' for retrieving theorems from
7289 the current theory context, and 'theory' to lookup stored theories;
7291 * new theory section 'locale' for declaring constants, assumptions and
7292 definitions that have local scope;
7294 * new theory section 'nonterminals' for purely syntactic types;
7296 * new theory section 'setup' for generic ML setup functions
7297 (e.g. package initialization);
7299 * the distribution now includes Isabelle icons: see
7300 lib/logo/isabelle-{small,tiny}.xpm;
7302 * isatool install - install binaries with absolute references to
7305 * isatool logo -- create instances of the Isabelle logo (as EPS);
7307 * print mode 'emacs' reserved for Isamode;
7309 * support multiple print (ast) translations per constant name;
7311 * theorems involving oracles are now printed with a suffixed [!];
7316 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
7318 * HOL/inductive package reorganized and improved: now supports mutual
7324 oddI "n : EVEN ==> Suc n : ODD"
7325 evenI "n : ODD ==> Suc n : EVEN"
7327 new theorem list "elims" contains an elimination rule for each of the
7328 recursive sets; inductive definitions now handle disjunctive premises
7329 correctly (also ZF);
7331 INCOMPATIBILITIES: requires Inductive as an ancestor; component
7332 "mutual_induct" no longer exists - the induction rule is always
7333 contained in "induct";
7336 * HOL/datatype package re-implemented and greatly improved: now
7337 supports mutually recursive datatypes such as
7340 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
7341 | SUM ('a aexp) ('a aexp)
7342 | DIFF ('a aexp) ('a aexp)
7345 'a bexp = LESS ('a aexp) ('a aexp)
7346 | AND ('a bexp) ('a bexp)
7347 | OR ('a bexp) ('a bexp)
7349 as well as indirectly recursive datatypes such as
7352 ('a, 'b) term = Var 'a
7353 | App 'b ((('a, 'b) term) list)
7355 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
7356 induction on mutually / indirectly recursive datatypes.
7358 Primrec equations are now stored in theory and can be accessed via
7359 <function_name>.simps.
7363 - Theories using datatypes must now have theory Datatype as an
7365 - The specific <typename>.induct_tac no longer exists - use the
7366 generic induct_tac instead.
7367 - natE has been renamed to nat.exhaust - use exhaust_tac
7368 instead of res_inst_tac ... natE. Note that the variable
7369 names in nat.exhaust differ from the names in natE, this
7370 may cause some "fragile" proofs to fail.
7371 - The theorems split_<typename>_case and split_<typename>_case_asm
7372 have been renamed to <typename>.split and <typename>.split_asm.
7373 - Since default sorts of type variables are now handled correctly,
7374 some datatype definitions may have to be annotated with explicit
7376 - Primrec definitions no longer require function name and type
7377 of recursive argument.
7379 Consider using isatool fixdatatype to adapt your theories and proof
7380 scripts to the new package (backup your sources first!).
7383 * HOL/record package: considerably improved implementation; now
7384 includes concrete syntax for record types, terms, updates; theorems
7385 for surjective pairing and splitting !!-bound record variables; proof
7386 support is as follows:
7388 1) standard conversions (selectors or updates applied to record
7389 constructor terms) are part of the standard simpset;
7391 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
7392 made part of standard simpset and claset via addIffs;
7394 3) a tactic for record field splitting (record_split_tac) is part of
7395 the standard claset (addSWrapper);
7397 To get a better idea about these rules you may retrieve them via
7398 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
7399 the name of your record type.
7401 The split tactic 3) conceptually simplifies by the following rule:
7403 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
7405 Thus any record variable that is bound by meta-all will automatically
7406 blow up into some record constructor term, consequently the
7407 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
7408 solve record problems automatically.
7411 * reorganized the main HOL image: HOL/Integ and String loaded by
7412 default; theory Main includes everything;
7414 * automatic simplification of integer sums and comparisons, using cancellation;
7416 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
7418 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
7420 * many new identities for unions, intersections, set difference, etc.;
7422 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
7423 called split_if, split_split, split_sum_case and split_nat_case (to go
7424 with add/delsplits);
7426 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
7427 (?x::unit) = (); this is made part of the default simpset, which COULD
7428 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
7429 'Delsimprocs [unit_eq_proc];' as last resort); also note that
7430 unit_abs_eta_conv is added in order to counter the effect of
7431 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
7434 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
7437 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
7438 It and 'sym RS equals0D' are now in the default claset, giving automatic
7439 disjointness reasoning but breaking a few old proofs.
7441 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
7442 to 'converse' from 'inverse' (for compatibility with ZF and some
7445 * HOL/recdef can now declare non-recursive functions, with {} supplied as
7446 the well-founded relation;
7448 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
7449 Compl A. The "Compl" syntax remains available as input syntax for this
7452 * HOL/Update: new theory of function updates:
7453 f(a:=b) == %x. if x=a then b else f x
7454 may also be iterated as in f(a:=b,c:=d,...);
7456 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
7459 - new function list_update written xs[i:=v] that updates the i-th
7460 list position. May also be iterated as in xs[i:=a,j:=b,...].
7461 - new function `upt' written [i..j(] which generates the list
7462 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
7463 bound write [i..j], which is a shorthand for [i..j+1(].
7464 - new lexicographic orderings and corresponding wellfoundedness theorems.
7467 - removed 'pred' (predecessor) function;
7468 - generalized some theorems about n-1;
7469 - many new laws about "div" and "mod";
7470 - new laws about greatest common divisors (see theory ex/Primes);
7472 * HOL/Relation: renamed the relational operator r^-1 "converse"
7473 instead of "inverse";
7475 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
7476 of the multiset ordering;
7478 * directory HOL/Real: a construction of the reals using Dedekind cuts
7479 (not included by default);
7481 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
7483 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
7484 programs, i.e. different program variables may have different types.
7486 * calling (stac rew i) now fails if "rew" has no effect on the goal
7487 [previously, this check worked only if the rewrite rule was unconditional]
7488 Now rew can involve either definitions or equalities (either == or =).
7493 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
7494 only the theorems proved on ZF.ML;
7496 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
7497 It and 'sym RS equals0D' are now in the default claset, giving automatic
7498 disjointness reasoning but breaking a few old proofs.
7500 * ZF/Update: new theory of function updates
7501 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
7502 may also be iterated as in f(a:=b,c:=d,...);
7504 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
7506 * calling (stac rew i) now fails if "rew" has no effect on the goal
7507 [previously, this check worked only if the rewrite rule was unconditional]
7508 Now rew can involve either definitions or equalities (either == or =).
7510 * case_tac provided for compatibility with HOL
7511 (like the old excluded_middle_tac, but with subgoals swapped)
7514 *** Internal programming interfaces ***
7516 * Pure: several new basic modules made available for general use, see
7517 also src/Pure/README;
7519 * improved the theory data mechanism to support encapsulation (data
7520 kind name replaced by private Object.kind, acting as authorization
7521 key); new type-safe user interface via functor TheoryDataFun; generic
7522 print_data function becomes basically useless;
7524 * removed global_names compatibility flag -- all theory declarations
7525 are qualified by default;
7527 * module Pure/Syntax now offers quote / antiquote translation
7528 functions (useful for Hoare logic etc. with implicit dependencies);
7529 see HOL/ex/Antiquote for an example use;
7531 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
7534 * new tactical CHANGED_GOAL for checking that a tactic modifies a
7537 * Display.print_goals function moved to Locale.print_goals;
7539 * standard print function for goals supports current_goals_markers
7540 variable for marking begin of proof, end of proof, start of goal; the
7541 default is ("", "", ""); setting current_goals_markers := ("<proof>",
7542 "</proof>", "<goal>") causes SGML like tagged proof state printing,
7547 New in Isabelle98 (January 1998)
7548 --------------------------------
7550 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7552 * changed lexical syntax of terms / types: dots made part of long
7553 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
7555 * simpset (and claset) reference variable replaced by functions
7556 simpset / simpset_ref;
7558 * no longer supports theory aliases (via merge) and non-trivial
7559 implicit merge of thms' signatures;
7561 * most internal names of constants changed due to qualified names;
7563 * changed Pure/Sequence interface (see Pure/seq.ML);
7566 *** General Changes ***
7568 * hierachically structured name spaces (for consts, types, axms, thms
7569 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
7570 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
7571 isatool fixdots ensures space after dots (e.g. "%x. x"); set
7572 long_names for fully qualified output names; NOTE: ML programs
7573 (special tactics, packages etc.) referring to internal names may have
7574 to be adapted to cope with fully qualified names; in case of severe
7575 backward campatibility problems try setting 'global_names' at compile
7576 time to have enrything declared within a flat name space; one may also
7577 fine tune name declarations in theories via the 'global' and 'local'
7580 * reimplemented the implicit simpset and claset using the new anytype
7581 data filed in signatures; references simpset:simpset ref etc. are
7582 replaced by functions simpset:unit->simpset and
7583 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
7584 to patch your ML files accordingly;
7586 * HTML output now includes theory graph data for display with Java
7587 applet or isatool browser; data generated automatically via isatool
7588 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
7590 * defs may now be conditional; improved rewrite_goals_tac to handle
7591 conditional equations;
7593 * defs now admits additional type arguments, using TYPE('a) syntax;
7595 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
7596 creates a new theory node; implicit merge of thms' signatures is
7597 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
7598 transfer:theory->thm->thm in (rare) cases;
7600 * improved handling of draft signatures / theories; draft thms (and
7601 ctyps, cterms) are automatically promoted to real ones;
7603 * slightly changed interfaces for oracles: admit many per theory, named
7604 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
7606 * print_goals: optional output of const types (set show_consts and
7609 * improved output of warnings (###) and errors (***);
7611 * subgoal_tac displays a warning if the new subgoal has type variables;
7613 * removed old README and Makefiles;
7615 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
7617 * removed obsolete init_pps and init_database;
7619 * deleted the obsolete tactical STATE, which was declared by
7620 fun STATE tacfun st = tacfun st st;
7622 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
7623 (which abbreviates $HOME);
7625 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
7626 use isatool fixseq to adapt your ML programs (this works for fully
7627 qualified references to the Sequence structure only!);
7629 * use_thy no longer requires writable current directory; it always
7630 reloads .ML *and* .thy file, if either one is out of date;
7633 *** Classical Reasoner ***
7635 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
7636 tactics that use classical reasoning to simplify a subgoal without
7637 splitting it into several subgoals;
7639 * Safe_tac: like safe_tac but uses the default claset;
7644 * added simplification meta rules:
7645 (asm_)(full_)simplify: simpset -> thm -> thm;
7647 * simplifier.ML no longer part of Pure -- has to be loaded by object
7650 * added prems argument to simplification procedures;
7652 * HOL, FOL, ZF: added infix function `addsplits':
7653 instead of `<simpset> setloop (split_tac <thms>)'
7654 you can simply write `<simpset> addsplits <thms>'
7659 * TYPE('a) syntax for type reflection terms;
7661 * no longer handles consts with name "" -- declare as 'syntax' instead;
7663 * pretty printer: changed order of mixfix annotation preference (again!);
7665 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7670 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7671 with `addloop' of the simplifier to faciliate case splitting in premises.
7673 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7675 * HOL/Auth: new protocol proofs including some for the Internet
7678 * HOL/Map: new theory of `maps' a la VDM;
7680 * HOL/simplifier: simplification procedures nat_cancel_sums for
7681 cancelling out common nat summands from =, <, <= (in)equalities, or
7682 differences; simplification procedures nat_cancel_factor for
7683 cancelling common factor from =, <, <= (in)equalities over natural
7684 sums; nat_cancel contains both kinds of procedures, it is installed by
7685 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7687 * HOL/simplifier: terms of the form
7688 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7690 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7691 and those of the form
7692 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7694 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7697 Each datatype `t' now comes with a theorem `split_t_case' of the form
7699 P(t_case f1 ... fn x) =
7700 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7702 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7705 and a theorem `split_t_case_asm' of the form
7707 P(t_case f1 ... fn x) =
7708 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7710 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7712 which can be added to a simpset via `addsplits'. The existing theorems
7713 expand_list_case and expand_option_case have been renamed to
7714 split_list_case and split_option_case.
7717 - `pred n' is automatically converted to `n-1'.
7718 Users are strongly encouraged not to use `pred' any longer,
7719 because it will disappear altogether at some point.
7720 - Users are strongly encouraged to write "0 < n" rather than
7721 "n ~= 0". Theorems and proof tools have been modified towards this
7725 the function "set_of_list" has been renamed "set" (and its theorems too);
7726 the function "nth" now takes its arguments in the reverse order and
7727 has acquired the infix notation "!" as in "xs!n".
7729 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7731 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7732 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7734 * HOL/record: extensible records with schematic structural subtyping
7735 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7736 still lacks various theorems and concrete record syntax;
7741 * removed "axioms" and "generated by" sections;
7743 * replaced "ops" section by extended "consts" section, which is capable of
7744 handling the continuous function space "->" directly;
7747 . proves theorems immediately and stores them in the theory,
7748 . creates hierachical name space,
7749 . now uses normal mixfix annotations (instead of cinfix...),
7750 . minor changes to some names and values (for consistency),
7751 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7752 . separator between mutual domain defs: changed "," to "and",
7753 . improved handling of sort constraints; now they have to
7754 appear on the left-hand side of the equations only;
7756 * fixed LAM <x,y,zs>.b syntax;
7758 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7759 adm (%x. P (t x)), where P is chainfinite and t continuous;
7764 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7765 with `addloop' of the simplifier to faciliate case splitting in premises.
7767 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7768 in HOL, they strip ALL and --> from proved theorems;
7772 New in Isabelle94-8 (May 1997)
7773 ------------------------------
7775 *** General Changes ***
7777 * new utilities to build / run / maintain Isabelle etc. (in parts
7778 still somewhat experimental); old Makefiles etc. still functional;
7780 * new 'Isabelle System Manual';
7782 * INSTALL text, together with ./configure and ./build scripts;
7784 * reimplemented type inference for greater efficiency, better error
7785 messages and clean internal interface;
7787 * prlim command for dealing with lots of subgoals (an easier way of
7788 setting goals_limit);
7793 * supports alternative (named) syntax tables (parser and pretty
7794 printer); internal interface is provided by add_modesyntax(_i);
7796 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7797 be used in conjunction with the Isabelle symbol font; uses the
7798 "symbols" syntax table;
7800 * added token_translation interface (may translate name tokens in
7801 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7802 the current print_mode); IMPORTANT: user print translation functions
7803 are responsible for marking newly introduced bounds
7804 (Syntax.mark_boundT);
7806 * token translations for modes "xterm" and "xterm_color" that display
7807 names in bold, underline etc. or colors (which requires a color
7810 * infixes may now be declared with names independent of their syntax;
7812 * added typed_print_translation (like print_translation, but may
7813 access type of constant);
7816 *** Classical Reasoner ***
7818 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7819 some limitations. Blast_tac...
7820 + ignores addss, addbefore, addafter; this restriction is intrinsic
7821 + ignores elimination rules that don't have the correct format
7822 (the conclusion MUST be a formula variable)
7823 + ignores types, which can make HOL proofs fail
7824 + rules must not require higher-order unification, e.g. apply_type in ZF
7825 [message "Function Var's argument not a bound variable" relates to this]
7826 + its proof strategy is more general but can actually be slower
7828 * substitution with equality assumptions no longer permutes other
7831 * minor changes in semantics of addafter (now called addaltern); renamed
7832 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7833 (and access functions for it);
7835 * improved combination of classical reasoner and simplifier:
7836 + functions for handling clasimpsets
7837 + improvement of addss: now the simplifier is called _after_ the
7839 + safe variant of addss called addSss: uses safe simplifications
7840 _during_ the safe steps. It is more complete as it allows multiple
7841 instantiations of unknowns (e.g. with slow_tac).
7845 * added interface for simplification procedures (functions that
7846 produce *proven* rewrite rules on the fly, depending on current
7849 * ordering on terms as parameter (used for ordered rewriting);
7851 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7853 * the solver is now split into a safe and an unsafe part.
7854 This should be invisible for the normal user, except that the
7855 functions setsolver and addsolver have been renamed to setSolver and
7856 addSolver; added safe_asm_full_simp_tac;
7861 * a generic induction tactic `induct_tac' which works for all datatypes and
7862 also for type `nat';
7864 * a generic case distinction tactic `exhaust_tac' which works for all
7865 datatypes and also for type `nat';
7867 * each datatype comes with a function `size';
7869 * patterns in case expressions allow tuple patterns as arguments to
7870 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7872 * primrec now also works with type nat;
7874 * recdef: a new declaration form, allows general recursive functions to be
7875 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7877 * the constant for negation has been renamed from "not" to "Not" to
7878 harmonize with FOL, ZF, LK, etc.;
7880 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7883 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7885 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7886 problems in commutative rings, using axiomatic type classes for + and *;
7888 * more examples in HOL/MiniML and HOL/Auth;
7890 * more default rewrite rules for quantifiers, union/intersection;
7892 * a new constant `arbitrary == @x.False';
7894 * HOLCF/IOA replaces old HOL/IOA;
7896 * HOLCF changes: derived all rules and arities
7897 + axiomatic type classes instead of classes
7898 + typedef instead of faking type definitions
7899 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7900 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7901 + eliminated the types void, one, tr
7902 + use unit lift and bool lift (with translations) instead of one and tr
7903 + eliminated blift from Lift3.thy (use Def instead of blift)
7904 all eliminated rules are derived as theorems --> no visible changes ;
7909 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7910 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7911 as ZF_cs addSIs [equalityI];
7915 New in Isabelle94-7 (November 96)
7916 ---------------------------------
7918 * allowing negative levels (as offsets) in prlev and choplev;
7920 * super-linear speedup for large simplifications;
7922 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7923 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7924 FAIL); can suppress it using the command Delsimps (ex_simps @
7925 all_simps); De Morgan laws are also now included, by default;
7927 * improved printing of ==> : ~:
7929 * new object-logic "Sequents" adds linear logic, while replacing LK
7930 and Modal (thanks to Sara Kalvala);
7932 * HOL/Auth: correctness proofs for authentication protocols;
7934 * HOL: new auto_tac combines rewriting and classical reasoning (many
7935 examples on HOL/Auth);
7937 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7938 the rewriter and classical reasoner simultaneously;
7940 * function uresult no longer returns theorems in "standard" format;
7941 regain previous version by: val uresult = standard o uresult;
7948 * oracles -- these establish an interface between Isabelle and trusted
7949 external reasoners, which may deliver results as theorems;
7951 * proof objects (in particular record all uses of oracles);
7953 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7955 * "constdefs" section in theory files;
7957 * "primrec" section (HOL) no longer requires names;
7959 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7966 * reduced space requirements;
7968 * automatic HTML generation from theories;
7970 * theory files no longer require "..." (quotes) around most types;
7972 * new examples, including two proofs of the Church-Rosser theorem;
7974 * non-curried (1994) version of HOL is no longer distributed;
7981 * greatly reduced space requirements;
7983 * theory files (.thy) no longer require \...\ escapes at line breaks;
7985 * searchable theorem database (see the section "Retrieving theorems" on
7986 page 8 of the Reference Manual);
7988 * new examples, including Grabczewski's monumental case study of the
7991 * The previous version of HOL renamed to Old_HOL;
7993 * The new version of HOL (previously called CHOL) uses a curried syntax
7994 for functions. Application looks like f a b instead of f(a,b);
7996 * Mutually recursive inductive definitions finally work in HOL;
7998 * In ZF, pattern-matching on tuples is now available in all abstractions and
7999 translates to the operator "split";
8006 * new infix operator, addss, allowing the classical reasoner to
8007 perform simplification at each step of its search. Example:
8008 fast_tac (cs addss ss)
8010 * a new logic, CHOL, the same as HOL, but with a curried syntax
8011 for functions. Application looks like f a b instead of f(a,b). Also pairs
8012 look like (a,b) instead of <a,b>;
8014 * PLEASE NOTE: CHOL will eventually replace HOL!
8016 * In CHOL, pattern-matching on tuples is now available in all abstractions.
8017 It translates to the operator "split". A new theory of integers is available;
8019 * In ZF, integer numerals now denote two's-complement binary integers.
8020 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
8022 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
8023 of the Axiom of Choice;
8030 * Significantly faster resolution;
8032 * the different sections in a .thy file can now be mixed and repeated
8035 * Database of theorems for FOL, HOL and ZF. New
8036 commands including qed, qed_goal and bind_thm store theorems in the database.
8038 * Simple database queries: return a named theorem (get_thm) or all theorems of
8039 a given theory (thms_of), or find out what theory a theorem was proved in
8042 * Bugs fixed in the inductive definition and datatype packages;
8044 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
8045 and HOL_dup_cs obsolete;
8047 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
8050 * Simpler definition of function space in ZF;
8052 * new results about cardinal and ordinal arithmetic in ZF;
8054 * 'subtype' facility in HOL for introducing new types as subsets of existing
8057 :mode=text:wrap=hard:maxLineLen=72: