1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Theory loader: source files are identified by content via SHA1
10 digests. Discontinued former path/modtime identification and optional
11 ISABELLE_FILE_IDENT plugin scripts.
13 * Parallelization of nested Isar proofs is subject to
14 Goal.parallel_proofs_threshold (default 100). See also isabelle
17 * Discontinued support for Poly/ML 5.2, which was the last version
18 without proper multithreading and TimeLimit implementation.
20 * Discontinued old lib/scripts/polyml-platform, which has been
21 obsolete since Isabelle2009-2.
23 * Theory loader: source files are exclusively located via the master
24 directory of each theory node (where the .thy file itself resides).
25 The global load path (such as src/HOL/Library) is has been
26 discontinued. INCOMPATIBILITY.
28 * Various optional external tools are referenced more robustly and
29 uniformly by explicit Isabelle settings as follows:
31 ISABELLE_CSDP (formerly CSDP_EXE)
32 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
33 ISABELLE_OCAML (formerly EXEC_OCAML)
34 ISABELLE_SWIPL (formerly EXEC_SWIPL)
35 ISABELLE_YAP (formerly EXEC_YAP)
37 Note that automated detection from the file-system or search path has
38 been discontinued. INCOMPATIBILITY.
40 * Name space: proper configuration options "long_names",
41 "short_names", "unique_names" instead of former unsynchronized
42 references. Minor INCOMPATIBILITY, need to declare options in context
45 declare [[unique_names = false]]
47 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
48 that the result needs to be unique, which means fact specifications
49 may have to be refined after enriching a proof context.
55 - Added "need" and "total_consts" options.
56 - Reintroduced "show_skolems" option by popular demand.
57 - Renamed attribute: nitpick_def ~> nitpick_unfold.
61 - sledgehammer available_provers ~> sledgehammer supported_provers
63 - Added "monomorphize", "monomorphize_limit", and "type_sys" options.
66 - Added "simp:", "intro:", and "elim:" options.
69 - Added "eval" option to evaluate terms for the found counterexample
70 (currently only supported by the default (exhaustive) tester)
71 - Added post-processing of terms to obtain readable counterexamples
72 (currently only supported by the default (exhaustive) tester)
74 * Function package: discontinued option "tailrec".
75 INCOMPATIBILITY. Use partial_function instead.
78 - Caratheodory's extension lemma is now proved for ring_of_sets.
79 - Infinite products of probability measures are now available.
80 - Use extended reals instead of positive extended reals.
84 *** Document preparation ***
86 * Localized \isabellestyle switch can be used within blocks or groups
89 \isabellestyle{it} %preferred default
90 {\isabellestylett @{text "typewriter stuff"}}
92 * New term style "isub" as ad-hoc conversion of variables x1, y23 into
93 subscripted form x\<^isub>1, y\<^isub>2\<^isub>3.
95 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
96 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
101 * Structure Proof_Context follows standard naming scheme. Old
102 ProofContext is still available for some time as legacy alias.
104 * Structure Timing provides various operations for timing; supersedes
105 former start_timing/end_timing etc.
107 * Path.print is the official way to show file-system paths to users
108 (including quotes etc.).
110 * Inner syntax: identifiers in parse trees of generic categories
111 "logic", "aprop", "idt" etc. carry position information (disguised as
112 type constraints). Occasional INCOMPATIBILITY with non-compliant
113 translations that choke on unexpected type constraints. Positions can
114 be stripped in ML translations via Syntax.strip_positions /
115 Syntax.strip_positions_ast, or via the syntax constant
116 "_strip_positions" within parse trees. As last resort, positions can
117 be disabled via the configuration option Syntax.positions, which is
118 called "syntax_positions" in Isar attribute syntax.
120 * Discontinued special status of various ML structures that contribute
121 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
122 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
123 refer directly to Ast.Constant, Lexicon.is_identifier,
124 Syntax_Trans.mk_binder_tr etc.
126 * Typed print translation: discontinued show_sorts argument, which is
127 already available via context of "advanced" translation.
129 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
130 goal states; body tactic needs to address all subgoals uniformly.
132 * Slightly more special eq_list/eq_set, with shortcut involving
133 pointer equality (assumes that eq relation is reflexive).
137 New in Isabelle2011 (January 2011)
138 ----------------------------------
142 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
143 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
144 useful tooltips and hyperlinks produced from its static analysis. The
145 bundled component provides an executable Isabelle tool that can be run
148 Isabelle2011/bin/isabelle jedit
150 * Significantly improved Isabelle/Isar implementation manual.
152 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
153 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
154 while the default heap location within that directory lacks that extra
155 suffix. This isolates multiple Isabelle installations from each
156 other, avoiding problems with old settings in new versions.
157 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
159 * Source files are always encoded as UTF-8, instead of old-fashioned
160 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
161 the following package declarations:
163 \usepackage[utf8]{inputenc}
164 \usepackage{textcomp}
166 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
167 a Unicode character is treated as a single symbol, not a sequence of
168 non-ASCII bytes as before. Since Isabelle/ML string literals may
169 contain symbols without further backslash escapes, Unicode can now be
170 used here as well. Recall that Symbol.explode in ML provides a
171 consistent view on symbols, while raw explode (or String.explode)
172 merely give a byte-oriented representation.
174 * Theory loader: source files are primarily located via the master
175 directory of each theory node (where the .thy file itself resides).
176 The global load path is still partially available as legacy feature.
177 Minor INCOMPATIBILITY due to subtle change in file lookup: use
178 explicit paths, relatively to the theory.
180 * Special treatment of ML file names has been discontinued.
181 Historically, optional extensions .ML or .sml were added on demand --
182 at the cost of clarity of file dependencies. Recall that Isabelle/ML
183 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
185 * Various options that affect pretty printing etc. are now properly
186 handled within the context via configuration options, instead of
187 unsynchronized references or print modes. There are both ML Config.T
188 entities and Isar declaration attributes to access these.
190 ML (Config.T) Isar (attribute)
192 eta_contract eta_contract
193 show_brackets show_brackets
194 show_sorts show_sorts
195 show_types show_types
196 show_question_marks show_question_marks
197 show_consts show_consts
198 show_abbrevs show_abbrevs
200 Syntax.ast_trace syntax_ast_trace
201 Syntax.ast_stat syntax_ast_stat
202 Syntax.ambiguity_level syntax_ambiguity_level
204 Goal_Display.goals_limit goals_limit
205 Goal_Display.show_main_goal show_main_goal
207 Method.rule_trace rule_trace
209 Thy_Output.display thy_output_display
210 Thy_Output.quotes thy_output_quotes
211 Thy_Output.indent thy_output_indent
212 Thy_Output.source thy_output_source
213 Thy_Output.break thy_output_break
215 Note that corresponding "..._default" references in ML may only be
216 changed globally at the ROOT session setup, but *not* within a theory.
217 The option "show_abbrevs" supersedes the former print mode
218 "no_abbrevs" with inverted meaning.
220 * More systematic naming of some configuration options.
223 trace_simp ~> simp_trace
224 debug_simp ~> simp_debug
226 * Support for real valued configuration options, using simplistic
227 floating-point notation that coincides with the inner syntax for
230 * Support for real valued preferences (with approximative PGIP type):
231 front-ends need to accept "pgint" values in float notation.
234 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
237 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
242 * Command 'type_synonym' (with single argument) replaces somewhat
243 outdated 'types', which is still available as legacy feature for some
246 * Command 'nonterminal' (with 'and' separated list of arguments)
247 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
249 * Command 'notepad' replaces former 'example_proof' for
250 experimentation in Isar without any result. INCOMPATIBILITY.
252 * Locale interpretation commands 'interpret' and 'sublocale' accept
253 lists of equations to map definitions in a locale to appropriate
254 entities in the context of the interpretation. The 'interpretation'
255 command already provided this functionality.
257 * Diagnostic command 'print_dependencies' prints the locale instances
258 that would be activated if the specified expression was interpreted in
259 the current context. Variant "print_dependencies!" assumes a context
260 without interpretations.
262 * Diagnostic command 'print_interps' prints interpretations in proofs
263 in addition to interpretations in theories.
265 * Discontinued obsolete 'global' and 'local' commands to manipulate
266 the theory name space. Rare INCOMPATIBILITY. The ML functions
267 Sign.root_path and Sign.local_path may be applied directly where this
268 feature is still required for historical reasons.
270 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
271 'definition' instead.
273 * The "prems" fact, which refers to the accidental collection of
274 foundational premises in the context, is now explicitly marked as
275 legacy feature and will be discontinued soon. Consider using "assms"
276 of the head statement or reference facts by explicit names.
278 * Document antiquotations @{class} and @{type} print classes and type
281 * Document antiquotation @{file} checks file/directory entries within
282 the local file system.
287 * Coercive subtyping: functions can be declared as coercions and type
288 inference will add them as necessary upon input of a term. Theory
289 Complex_Main declares real :: nat => real and real :: int => real as
290 coercions. A coercion function f is declared like this:
292 declare [[coercion f]]
294 To lift coercions through type constructors (e.g. from nat => real to
295 nat list => real list), map functions can be declared, e.g.
297 declare [[coercion_map map]]
299 Currently coercion inference is activated only in theories including
300 real numbers, i.e. descendants of Complex_Main. This is controlled by
301 the configuration option "coercion_enabled", e.g. it can be enabled in
302 other theories like this:
304 declare [[coercion_enabled]]
306 * Command 'partial_function' provides basic support for recursive
307 function definitions over complete partial orders. Concrete instances
308 are provided for i) the option type, ii) tail recursion on arbitrary
309 types, and iii) the heap monad of Imperative_HOL. See
310 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
313 * Function package: f.psimps rules are no longer implicitly declared
314 as [simp]. INCOMPATIBILITY.
316 * Datatype package: theorems generated for executable equality (class
317 "eq") carry proper names and are treated as default code equations.
319 * Inductive package: now offers command 'inductive_simps' to
320 automatically derive instantiated and simplified equations for
321 inductive predicates, similar to 'inductive_cases'.
323 * Command 'enriched_type' allows to register properties of the
324 functorial structure of types.
326 * Improved infrastructure for term evaluation using code generator
327 techniques, in particular static evaluation conversions.
329 * Code generator: Scala (2.8 or higher) has been added to the target
332 * Code generator: globbing constant expressions "*" and "Theory.*"
333 have been replaced by the more idiomatic "_" and "Theory._".
336 * Code generator: export_code without explicit file declaration prints
337 to standard output. INCOMPATIBILITY.
339 * Code generator: do not print function definitions for case
340 combinators any longer.
342 * Code generator: simplification with rules determined with
343 src/Tools/Code/code_simp.ML and method "code_simp".
345 * Code generator for records: more idiomatic representation of record
346 types. Warning: records are not covered by ancient SML code
347 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
348 rep_datatype declaration helps to succeed then:
352 rep_datatype foo_ext ...
354 * Records: logical foundation type for records does not carry a
355 '_type' suffix any longer (obsolete due to authentic syntax).
358 * Quickcheck now by default uses exhaustive testing instead of random
359 testing. Random testing can be invoked by "quickcheck [random]",
360 exhaustive testing by "quickcheck [exhaustive]".
362 * Quickcheck instantiates polymorphic types with small finite
363 datatypes by default. This enables a simple execution mechanism to
364 handle quantifiers and function equality over the finite datatypes.
366 * Quickcheck random generator has been renamed from "code" to
367 "random". INCOMPATIBILITY.
369 * Quickcheck now has a configurable time limit which is set to 30
370 seconds by default. This can be changed by adding [timeout = n] to the
371 quickcheck command. The time limit for Auto Quickcheck is still set
374 * Quickcheck in locales considers interpretations of that locale for
375 counter example search.
378 - Added "smt" and "remote_smt" provers based on the "smt" proof
379 method. See the Sledgehammer manual for details ("isabelle doc
382 sledgehammer atp_info ~> sledgehammer running_provers
383 sledgehammer atp_kill ~> sledgehammer kill_provers
384 sledgehammer available_atps ~> sledgehammer available_provers
387 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
388 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
389 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
390 (and "ms" and "min" are no longer supported)
395 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
396 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
398 - Added support for partial quotient types.
399 - Added local versions of the "Nitpick.register_xxx" functions.
400 - Added "whack" option.
401 - Allow registration of quotient types as codatatypes.
402 - Improved "merge_type_vars" option to merge more types.
403 - Removed unsound "fast_descrs" option.
404 - Added custom symmetry breaking for datatypes, making it possible to reach
405 higher cardinalities.
406 - Prevent the expansion of too large definitions.
408 * Proof methods "metis" and "meson" now have configuration options
409 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
410 to diagnose these tools. E.g.
412 using [[metis_trace = true]]
414 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
415 manually as command 'solve_direct'.
417 * The default SMT solver Z3 must be enabled explicitly (due to
418 licensing issues) by setting the environment variable
419 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
420 commercial applications, the SMT solver CVC3 is provided as fall-back;
421 changing the SMT solver is done via the configuration option
424 * Remote SMT solvers need to be referred to by the "remote_" prefix,
425 i.e. "remote_cvc3" and "remote_z3".
427 * Added basic SMT support for datatypes, records, and typedefs using
428 the oracle mode (no proofs). Direct support of pairs has been dropped
429 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
430 support for a similar behavior). Minor INCOMPATIBILITY.
432 * Changed SMT configuration options:
434 z3_proofs ~> smt_oracle (with inverted meaning)
435 z3_trace_assms ~> smt_trace_used_facts
448 * Boogie output files (.b2i files) need to be declared in the theory
451 * Simplification procedure "list_to_set_comprehension" rewrites list
452 comprehensions applied to List.set to set comprehensions. Occasional
453 INCOMPATIBILITY, may be deactivated like this:
455 declare [[simproc del: list_to_set_comprehension]]
457 * Removed old version of primrec package. INCOMPATIBILITY.
459 * Removed simplifier congruence rule of "prod_case", as has for long
460 been the case with "split". INCOMPATIBILITY.
462 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
464 * Removed [split_format ... and ... and ...] version of
465 [split_format]. Potential INCOMPATIBILITY.
467 * Predicate "sorted" now defined inductively, with nice induction
468 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
470 * Constant "contents" renamed to "the_elem", to free the generic name
471 contents for other uses. INCOMPATIBILITY.
473 * Renamed class eq and constant eq (for code generation) to class
474 equal and constant equal, plus renaming of related facts and various
475 tuning. INCOMPATIBILITY.
477 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
479 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
482 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
483 avoid confusion with finite sets. INCOMPATIBILITY.
485 * Abandoned locales equiv, congruent and congruent2 for equivalence
486 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
489 * Some previously unqualified names have been qualified:
496 Trueprop ~> HOL.Trueprop
501 op --> ~> HOL.implies
513 Pair ~> Product_Type.Pair
514 fst ~> Product_Type.fst
515 snd ~> Product_Type.snd
516 curry ~> Product_Type.curry
518 Collect ~> Set.Collect
522 * More canonical naming convention for some fundamental definitions:
524 bot_bool_eq ~> bot_bool_def
525 top_bool_eq ~> top_bool_def
526 inf_bool_eq ~> inf_bool_def
527 sup_bool_eq ~> sup_bool_def
528 bot_fun_eq ~> bot_fun_def
529 top_fun_eq ~> top_fun_def
530 inf_fun_eq ~> inf_fun_def
531 sup_fun_eq ~> sup_fun_def
535 * More stylized fact names:
537 expand_fun_eq ~> fun_eq_iff
538 expand_set_eq ~> set_eq_iff
540 nat_number ~> eval_nat_numeral
544 * Refactoring of code-generation specific operations in theory List:
550 mem_iff ~> member_def
551 null_empty ~> null_def
553 INCOMPATIBILITY. Note that these were not supposed to be used
554 regularly unless for striking reasons; their main purpose was code
557 Various operations from the Haskell prelude are used for generating
560 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
561 "surj f" is now an abbreviation of "range f = UNIV". The theorems
562 bij_def and surj_def are unchanged. INCOMPATIBILITY.
564 * Abolished some non-alphabetic type names: "prod" and "sum" replace
565 "*" and "+" respectively. INCOMPATIBILITY.
567 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
568 "Sum_Type.Plus" instead.
570 * Constant "split" has been merged with constant "prod_case"; names of
571 ML functions, facts etc. involving split have been retained so far,
572 though. INCOMPATIBILITY.
574 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
575 instead. INCOMPATIBILITY.
577 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
580 * Former theory Library/Enum is now part of the HOL-Main image.
581 INCOMPATIBILITY: all constants of the Enum theory now have to be
582 referred to by its qualified name.
585 nlists ~> Enum.nlists
586 product ~> Enum.product
588 * Theory Library/Monad_Syntax provides do-syntax for monad types.
589 Syntax in Library/State_Monad has been changed to avoid ambiguities.
592 * Theory Library/SetsAndFunctions has been split into
593 Library/Function_Algebras and Library/Set_Algebras; canonical names
594 for instance definitions for functions; various improvements.
597 * Theory Library/Multiset provides stable quicksort implementation of
600 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
603 * Session Multivariate_Analysis: introduced a type class for euclidean
604 space. Most theorems are now stated in terms of euclidean spaces
605 instead of finite cartesian products.
608 real ^ 'n ~> 'a::real_vector
609 ~> 'a::euclidean_space
610 ~> 'a::ordered_euclidean_space
611 (depends on your needs)
615 \<chi> x. _ ~> \<chi>\<chi> x. _
618 Also note that the indices are now natural numbers and not from some
619 finite type. Finite cartesian products of euclidean spaces, products
620 of euclidean spaces the real and complex numbers are instantiated to
621 be euclidean_spaces. INCOMPATIBILITY.
623 * Session Probability: introduced pextreal as positive extended real
624 numbers. Use pextreal as value for measures. Introduce the
625 Radon-Nikodym derivative, product spaces and Fubini's theorem for
626 arbitrary sigma finite measures. Introduces Lebesgue measure based on
627 the integral in Multivariate Analysis. INCOMPATIBILITY.
629 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
632 * Session SPARK (with image HOL-SPARK) provides commands to load and
633 prove verification conditions generated by the SPARK Ada program
634 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
639 * Theorems for additive ring operations (locale abelian_monoid and
640 descendants) are generated by interpretation from their multiplicative
641 counterparts. Names (in particular theorem names) have the mandatory
642 qualifier 'add'. Previous theorem names are redeclared for
645 * Structure "int_ring" is now an abbreviation (previously a
646 definition). This fits more natural with advanced interpretations.
651 * The domain package now runs in definitional mode by default: The
652 former command 'new_domain' is now called 'domain'. To use the domain
653 package in its original axiomatic mode, use 'domain (unsafe)'.
656 * The new class "domain" is now the default sort. Class "predomain"
657 is an unpointed version of "domain". Theories can be updated by
658 replacing sort annotations as shown below. INCOMPATIBILITY.
660 'a::type ~> 'a::countable
661 'a::cpo ~> 'a::predomain
662 'a::pcpo ~> 'a::domain
664 * The old type class "rep" has been superseded by class "domain".
665 Accordingly, users of the definitional package must remove any
666 "default_sort rep" declarations. INCOMPATIBILITY.
668 * The domain package (definitional mode) now supports unpointed
669 predomain argument types, as long as they are marked 'lazy'. (Strict
670 arguments must be in class "domain".) For example, the following
671 domain definition now works:
673 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
675 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
676 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
677 'a option, and 'a list. Additionally, it configures fixrec and the
678 domain package to work with these types. For example:
680 fixrec isInl :: "('a + 'b) u -> tr"
681 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
683 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
685 * The "(permissive)" option of fixrec has been replaced with a
686 per-equation "(unchecked)" option. See
687 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
689 * The "bifinite" class no longer fixes a constant "approx"; the class
690 now just asserts that such a function exists. INCOMPATIBILITY.
692 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
693 defines an embedding of type 'a defl into udom by default; instances
694 of "bifinite" and "domain" classes are available in
695 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
697 * The syntax "REP('a)" has been replaced with "DEFL('a)".
699 * The predicate "directed" has been removed. INCOMPATIBILITY.
701 * The type class "finite_po" has been removed. INCOMPATIBILITY.
703 * The function "cprod_map" has been renamed to "prod_map".
706 * The monadic bind operator on each powerdomain has new binder syntax
707 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
708 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
710 * The infix syntax for binary union on each powerdomain has changed
711 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
712 syntax. INCOMPATIBILITY.
714 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
715 still supported as an input translation.
717 * Renamed some theorems (the original names are also still available).
719 expand_fun_below ~> fun_below_iff
720 below_fun_ext ~> fun_belowI
721 expand_cfun_eq ~> cfun_eq_iff
723 expand_cfun_below ~> cfun_below_iff
724 below_cfun_ext ~> cfun_belowI
725 cont2cont_Rep_CFun ~> cont2cont_APP
727 * The Abs and Rep functions for various types have changed names.
728 Related theorem names have also changed to match. INCOMPATIBILITY.
732 Rep_Sprod ~> Rep_sprod
733 Abs_Sprod ~> Abs_sprod
737 * Lemmas with names of the form *_defined_iff or *_strict_iff have
738 been renamed to *_bottom_iff. INCOMPATIBILITY.
740 * Various changes to bisimulation/coinduction with domain package:
742 - Definitions of "bisim" constants no longer mention definedness.
743 - With mutual recursion, "bisim" predicate is now curried.
744 - With mutual recursion, each type gets a separate coind theorem.
745 - Variable names in bisim_def and coinduct rules have changed.
749 * Case combinators generated by the domain package for type "foo" are
750 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
752 * Several theorems have been renamed to more accurately reflect the
753 names of constants and types involved. INCOMPATIBILITY.
755 thelub_const ~> lub_const
756 lub_const ~> is_lub_const
758 is_lub_lub ~> is_lubD2
760 unique_lub ~> is_lub_unique
761 is_ub_lub ~> is_lub_rangeD1
762 lub_bin_chain ~> is_lub_bin_chain
763 lub_fun ~> is_lub_fun
764 thelub_fun ~> lub_fun
765 thelub_cfun ~> lub_cfun
766 thelub_Pair ~> lub_Pair
767 lub_cprod ~> is_lub_prod
768 thelub_cprod ~> lub_prod
769 minimal_cprod ~> minimal_prod
770 inst_cprod_pcpo ~> inst_prod_pcpo
772 compact_UU ~> compact_bottom
773 deflation_UU ~> deflation_bottom
774 finite_deflation_UU ~> finite_deflation_bottom
776 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
778 sq_ord_less_eq_trans ~> below_eq_trans
779 sq_ord_eq_less_trans ~> eq_below_trans
780 refl_less ~> below_refl
781 trans_less ~> below_trans
782 antisym_less ~> below_antisym
783 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
784 box_less ~> box_below
785 rev_trans_less ~> rev_below_trans
786 not_less2not_eq ~> not_below2not_eq
787 less_UU_iff ~> below_UU_iff
788 flat_less_iff ~> flat_below_iff
789 adm_less ~> adm_below
790 adm_not_less ~> adm_not_below
791 adm_compact_not_less ~> adm_compact_not_below
792 less_fun_def ~> below_fun_def
793 expand_fun_less ~> fun_below_iff
794 less_fun_ext ~> fun_belowI
795 less_discr_def ~> below_discr_def
796 discr_less_eq ~> discr_below_eq
797 less_unit_def ~> below_unit_def
798 less_cprod_def ~> below_prod_def
799 prod_lessI ~> prod_belowI
800 Pair_less_iff ~> Pair_below_iff
801 fst_less_iff ~> fst_below_iff
802 snd_less_iff ~> snd_below_iff
803 expand_cfun_less ~> cfun_below_iff
804 less_cfun_ext ~> cfun_belowI
805 injection_less ~> injection_below
806 less_up_def ~> below_up_def
807 not_Iup_less ~> not_Iup_below
808 Iup_less ~> Iup_below
810 Def_inject_less_eq ~> Def_below_Def
811 Def_less_is_eq ~> Def_below_iff
812 spair_less_iff ~> spair_below_iff
813 less_sprod ~> below_sprod
814 spair_less ~> spair_below
815 sfst_less_iff ~> sfst_below_iff
816 ssnd_less_iff ~> ssnd_below_iff
817 fix_least_less ~> fix_least_below
818 dist_less_one ~> dist_below_one
819 less_ONE ~> below_ONE
820 ONE_less_iff ~> ONE_below_iff
821 less_sinlD ~> below_sinlD
822 less_sinrD ~> below_sinrD
827 * All constant names are now qualified internally and use proper
828 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
833 * Antiquotation @{assert} inlines a function bool -> unit that raises
834 Fail if the argument is false. Due to inlining the source position of
835 failed assertions is included in the error output.
837 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
838 text is in practice always evaluated with a stable theory checkpoint.
839 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
841 * Antiquotation @{theory A} refers to theory A from the ancestry of
842 the current context, not any accidental theory loader state as before.
843 Potential INCOMPATIBILITY, subtle change in semantics.
845 * Syntax.pretty_priority (default 0) configures the required priority
846 of pretty-printed output and thus affects insertion of parentheses.
848 * Syntax.default_root (default "any") configures the inner syntax
849 category (nonterminal symbol) for parsing of terms.
851 * Former exception Library.UnequalLengths now coincides with
852 ListPair.UnequalLengths.
854 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
855 main functionality is provided by structure Simplifier.
857 * Renamed raw "explode" function to "raw_explode" to emphasize its
858 meaning. Note that internally to Isabelle, Symbol.explode is used in
859 almost all situations.
861 * Discontinued obsolete function sys_error and exception SYS_ERROR.
862 See implementation manual for further details on exceptions in
865 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
868 * Renamed structure PureThy to Pure_Thy and moved most of its
869 operations to structure Global_Theory, to emphasize that this is
870 rarely-used global-only stuff.
872 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
873 instead (or tracing for high-volume output).
875 * Configuration option show_question_marks only affects regular pretty
876 printing of types and terms, not raw Term.string_of_vname.
878 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
879 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
880 @{thms} for most purposes.
882 * ML structure Unsynchronized is never opened, not even in Isar
883 interaction mode as before. Old Unsynchronized.set etc. have been
884 discontinued -- use plain := instead. This should be *rare* anyway,
885 since modern tools always work via official context data, notably
886 configuration options.
888 * Parallel and asynchronous execution requires special care concerning
889 interrupts. Structure Exn provides some convenience functions that
890 avoid working directly with raw Interrupt. User code must not absorb
891 interrupts -- intermediate handling (for cleanup etc.) needs to be
892 followed by re-raising of the original exception. Another common
893 source of mistakes are "handle _" patterns, which make the meaning of
894 the program subject to physical effects of the environment.
898 New in Isabelle2009-2 (June 2010)
899 ---------------------------------
903 * Authentic syntax for *all* logical entities (type classes, type
904 constructors, term constants): provides simple and robust
905 correspondence between formal entities and concrete syntax. Within
906 the parse tree / AST representations, "constants" are decorated by
907 their category (class, type, const) and spelled out explicitly with
908 their full internal name.
910 Substantial INCOMPATIBILITY concerning low-level syntax declarations
911 and translations (translation rules and translation functions in ML).
912 Some hints on upgrading:
914 - Many existing uses of 'syntax' and 'translations' can be replaced
915 by more modern 'type_notation', 'notation' and 'abbreviation',
916 which are independent of this issue.
918 - 'translations' require markup within the AST; the term syntax
919 provides the following special forms:
921 CONST c -- produces syntax version of constant c from context
922 XCONST c -- literally c, checked as constant from context
923 c -- literally c, if declared by 'syntax'
925 Plain identifiers are treated as AST variables -- occasionally the
926 system indicates accidental variables via the error "rhs contains
929 Type classes and type constructors are marked according to their
930 concrete syntax. Some old translations rules need to be written
931 for the "type" category, using type constructor application
932 instead of pseudo-term application of the default category
935 - 'parse_translation' etc. in ML may use the following
938 @{class_syntax c} -- type class c within parse tree / AST
939 @{term_syntax c} -- type constructor c within parse tree / AST
940 @{const_syntax c} -- ML version of "CONST c" above
941 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
943 - Literal types within 'typed_print_translations', i.e. those *not*
944 represented as pseudo-terms are represented verbatim. Use @{class
945 c} or @{type_name c} here instead of the above syntax
948 Note that old non-authentic syntax was based on unqualified base
949 names, so all of the above "constant" names would coincide. Recall
950 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
951 diagnose syntax problems.
953 * Type constructors admit general mixfix syntax, not just infix.
955 * Concrete syntax may be attached to local entities without a proof
956 body, too. This works via regular mixfix annotations for 'fix',
957 'def', 'obtain' etc. or via the explicit 'write' command, which is
958 similar to the 'notation' command in theory specifications.
960 * Discontinued unnamed infix syntax (legacy feature for many years) --
961 need to specify constant name and syntax separately. Internal ML
962 datatype constructors have been renamed from InfixName to Infix etc.
963 Minor INCOMPATIBILITY.
965 * Schematic theorem statements need to be explicitly markup as such,
966 via commands 'schematic_lemma', 'schematic_theorem',
967 'schematic_corollary'. Thus the relevance of the proof is made
968 syntactically clear, which impacts performance in a parallel or
969 asynchronous interactive environment. Minor INCOMPATIBILITY.
971 * Use of cumulative prems via "!" in some proof methods has been
972 discontinued (old legacy feature).
974 * References 'trace_simp' and 'debug_simp' have been replaced by
975 configuration options stored in the context. Enabling tracing (the
976 case of debugging is similar) in proofs works via
978 using [[trace_simp = true]]
980 Tracing is then active for all invocations of the simplifier in
981 subsequent goal refinement steps. Tracing may also still be enabled or
982 disabled via the ProofGeneral settings menu.
984 * Separate commands 'hide_class', 'hide_type', 'hide_const',
985 'hide_fact' replace the former 'hide' KIND command. Minor
988 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
989 more efficient than combinations with -q1 or -q2.
994 * Proofterms record type-class reasoning explicitly, using the
995 "unconstrain" operation internally. This eliminates all sort
996 constraints from a theorem and proof, introducing explicit
997 OFCLASS-premises. On the proof term level, this operation is
998 automatically applied at theorem boundaries, such that closed proofs
999 are always free of sort constraints. INCOMPATIBILITY for tools that
1000 inspect proof terms.
1002 * Local theory specifications may depend on extra type variables that
1003 are not present in the result type -- arguments TYPE('a) :: 'a itself
1004 are added internally. For example:
1006 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
1008 * Predicates of locales introduced by classes carry a mandatory
1009 "class" prefix. INCOMPATIBILITY.
1011 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
1013 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
1016 * Command 'code_reflect' allows to incorporate generated ML code into
1017 runtime environment; replaces immature code_datatype antiquotation.
1020 * Code generator: simple concept for abstract datatypes obeying
1023 * Code generator: details of internal data cache have no impact on the
1024 user space functionality any longer.
1026 * Methods "unfold_locales" and "intro_locales" ignore non-locale
1027 subgoals. This is more appropriate for interpretations with 'where'.
1030 * Command 'example_proof' opens an empty proof body. This allows to
1031 experiment with Isar, without producing any persistent result.
1033 * Commands 'type_notation' and 'no_type_notation' declare type syntax
1034 within a local theory context, with explicit checking of the
1035 constructors involved (in contrast to the raw 'syntax' versions).
1037 * Commands 'types' and 'typedecl' now work within a local theory
1038 context -- without introducing dependencies on parameters or
1039 assumptions, which is not possible in Isabelle/Pure.
1041 * Command 'defaultsort' has been renamed to 'default_sort', it works
1042 within a local theory context. Minor INCOMPATIBILITY.
1047 * Command 'typedef' now works within a local theory context -- without
1048 introducing dependencies on parameters or assumptions, which is not
1049 possible in Isabelle/Pure/HOL. Note that the logical environment may
1050 contain multiple interpretations of local typedefs (with different
1051 non-emptiness proofs), even in a global theory context.
1053 * New package for quotient types. Commands 'quotient_type' and
1054 'quotient_definition' may be used for defining types and constants by
1055 quotient constructions. An example is the type of integers created by
1056 quotienting pairs of natural numbers:
1059 intrel :: "(nat * nat) => (nat * nat) => bool"
1061 "intrel (x, y) (u, v) = (x + v = u + y)"
1063 quotient_type int = "nat * nat" / intrel
1064 by (auto simp add: equivp_def expand_fun_eq)
1067 "0::int" is "(0::nat, 0::nat)"
1069 The method "lifting" can be used to lift of theorems from the
1070 underlying "raw" type to the quotient type. The example
1071 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
1072 construction and provides a reasoning infrastructure for finite sets.
1074 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
1075 clash with new theory Quotient in Main HOL.
1077 * Moved the SMT binding into the main HOL session, eliminating
1078 separate HOL-SMT session.
1080 * List membership infix mem operation is only an input abbreviation.
1083 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
1084 for future developements; former Library/Word.thy is still present in
1085 the AFP entry RSAPPS.
1087 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
1088 longer shadowed. INCOMPATIBILITY.
1090 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
1093 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
1096 * Dropped normalizing_semiring etc; use the facts in semiring classes
1097 instead. INCOMPATIBILITY.
1099 * Dropped several real-specific versions of lemmas about floor and
1100 ceiling; use the generic lemmas from theory "Archimedean_Field"
1101 instead. INCOMPATIBILITY.
1103 floor_number_of_eq ~> floor_number_of
1104 le_floor_eq_number_of ~> number_of_le_floor
1105 le_floor_eq_zero ~> zero_le_floor
1106 le_floor_eq_one ~> one_le_floor
1107 floor_less_eq_number_of ~> floor_less_number_of
1108 floor_less_eq_zero ~> floor_less_zero
1109 floor_less_eq_one ~> floor_less_one
1110 less_floor_eq_number_of ~> number_of_less_floor
1111 less_floor_eq_zero ~> zero_less_floor
1112 less_floor_eq_one ~> one_less_floor
1113 floor_le_eq_number_of ~> floor_le_number_of
1114 floor_le_eq_zero ~> floor_le_zero
1115 floor_le_eq_one ~> floor_le_one
1116 floor_subtract_number_of ~> floor_diff_number_of
1117 floor_subtract_one ~> floor_diff_one
1118 ceiling_number_of_eq ~> ceiling_number_of
1119 ceiling_le_eq_number_of ~> ceiling_le_number_of
1120 ceiling_le_zero_eq ~> ceiling_le_zero
1121 ceiling_le_eq_one ~> ceiling_le_one
1122 less_ceiling_eq_number_of ~> number_of_less_ceiling
1123 less_ceiling_eq_zero ~> zero_less_ceiling
1124 less_ceiling_eq_one ~> one_less_ceiling
1125 ceiling_less_eq_number_of ~> ceiling_less_number_of
1126 ceiling_less_eq_zero ~> ceiling_less_zero
1127 ceiling_less_eq_one ~> ceiling_less_one
1128 le_ceiling_eq_number_of ~> number_of_le_ceiling
1129 le_ceiling_eq_zero ~> zero_le_ceiling
1130 le_ceiling_eq_one ~> one_le_ceiling
1131 ceiling_subtract_number_of ~> ceiling_diff_number_of
1132 ceiling_subtract_one ~> ceiling_diff_one
1134 * Theory "Finite_Set": various folding_XXX locales facilitate the
1135 application of the various fold combinators on finite sets.
1137 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
1138 provides abstract red-black tree type which is backed by "RBT_Impl" as
1139 implementation. INCOMPATIBILTY.
1141 * Theory Library/Coinductive_List has been removed -- superseded by
1142 AFP/thys/Coinductive.
1144 * Theory PReal, including the type "preal" and related operations, has
1145 been removed. INCOMPATIBILITY.
1147 * Real: new development using Cauchy Sequences.
1149 * Split off theory "Big_Operators" containing setsum, setprod,
1150 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
1152 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
1153 "Int" etc. INCOMPATIBILITY.
1155 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
1157 * New set of rules "ac_simps" provides combined assoc / commute
1158 rewrites for all interpretations of the appropriate generic locales.
1160 * Renamed theory "OrderedGroup" to "Groups" and split theory
1161 "Ring_and_Field" into theories "Rings" and "Fields"; for more
1162 appropriate and more consistent names suitable for name prefixes
1163 within the HOL theories. INCOMPATIBILITY.
1165 * Some generic constants have been put to appropriate theories:
1166 - less_eq, less: Orderings
1167 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
1168 - inverse, divide: Rings
1171 * More consistent naming of type classes involving orderings (and
1174 lower_semilattice ~> semilattice_inf
1175 upper_semilattice ~> semilattice_sup
1177 dense_linear_order ~> dense_linorder
1179 pordered_ab_group_add ~> ordered_ab_group_add
1180 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
1181 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
1182 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
1183 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
1184 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
1185 pordered_cancel_semiring ~> ordered_cancel_semiring
1186 pordered_comm_monoid_add ~> ordered_comm_monoid_add
1187 pordered_comm_ring ~> ordered_comm_ring
1188 pordered_comm_semiring ~> ordered_comm_semiring
1189 pordered_ring ~> ordered_ring
1190 pordered_ring_abs ~> ordered_ring_abs
1191 pordered_semiring ~> ordered_semiring
1193 ordered_ab_group_add ~> linordered_ab_group_add
1194 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
1195 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
1196 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
1197 ordered_field ~> linordered_field
1198 ordered_field_no_lb ~> linordered_field_no_lb
1199 ordered_field_no_ub ~> linordered_field_no_ub
1200 ordered_field_dense_linear_order ~> dense_linordered_field
1201 ordered_idom ~> linordered_idom
1202 ordered_ring ~> linordered_ring
1203 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
1204 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
1205 ordered_ring_strict ~> linordered_ring_strict
1206 ordered_semidom ~> linordered_semidom
1207 ordered_semiring ~> linordered_semiring
1208 ordered_semiring_1 ~> linordered_semiring_1
1209 ordered_semiring_1_strict ~> linordered_semiring_1_strict
1210 ordered_semiring_strict ~> linordered_semiring_strict
1212 The following slightly odd type classes have been moved to a
1213 separate theory Library/Lattice_Algebras:
1215 lordered_ab_group_add ~> lattice_ab_group_add
1216 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
1217 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
1218 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
1219 lordered_ring ~> lattice_ring
1223 * Refined field classes:
1224 - classes division_ring_inverse_zero, field_inverse_zero,
1225 linordered_field_inverse_zero include rule inverse 0 = 0 --
1226 subsumes former division_by_zero class;
1227 - numerous lemmas have been ported from field to division_ring.
1230 * Refined algebra theorem collections:
1231 - dropped theorem group group_simps, use algebra_simps instead;
1232 - dropped theorem group ring_simps, use field_simps instead;
1233 - proper theorem collection field_simps subsumes former theorem
1234 groups field_eq_simps and field_simps;
1235 - dropped lemma eq_minus_self_iff which is a duplicate for
1239 * Theory Finite_Set and List: some lemmas have been generalized from
1242 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
1243 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
1244 inter_Inter_fold_inter ~> inf_Inf_fold_inf
1245 union_Union_fold_union ~> sup_Sup_fold_sup
1246 Inter_fold_inter ~> Inf_fold_inf
1247 Union_fold_union ~> Sup_fold_sup
1248 inter_INTER_fold_inter ~> inf_INFI_fold_inf
1249 union_UNION_fold_union ~> sup_SUPR_fold_sup
1250 INTER_fold_inter ~> INFI_fold_inf
1251 UNION_fold_union ~> SUPR_fold_sup
1253 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
1254 replaced by the more convenient lemmas Inf_empty and Sup_empty.
1255 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
1256 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
1257 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
1258 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
1260 * Reorganized theory Multiset: swapped notation of pointwise and
1263 - pointwise ordering is instance of class order with standard syntax
1265 - multiset ordering has syntax <=# and <#; partial order properties
1266 are provided by means of interpretation with prefix
1268 - less duplication, less historical organization of sections,
1269 conversion from associations lists to multisets, rudimentary code
1271 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
1276 multiset_eq_conv_count_eq ~> multiset_ext_iff
1277 multi_count_ext ~> multiset_ext
1278 diff_union_inverse2 ~> diff_union_cancelR
1282 * Theory Permutation: replaced local "remove" by List.remove1.
1284 * Code generation: ML and OCaml code is decorated with signatures.
1286 * Theory List: added transpose.
1288 * Library/Nat_Bijection.thy is a collection of bijective functions
1289 between nat and other types, which supersedes the older libraries
1290 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
1293 Nat_Int_Bij.nat2_to_nat ~> prod_encode
1294 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
1295 Nat_Int_Bij.int_to_nat_bij ~> int_encode
1296 Nat_Int_Bij.nat_to_int_bij ~> int_decode
1297 Countable.pair_encode ~> prod_encode
1298 NatIso.prod2nat ~> prod_encode
1299 NatIso.nat2prod ~> prod_decode
1300 NatIso.sum2nat ~> sum_encode
1301 NatIso.nat2sum ~> sum_decode
1302 NatIso.list2nat ~> list_encode
1303 NatIso.nat2list ~> list_decode
1304 NatIso.set2nat ~> set_encode
1305 NatIso.nat2set ~> set_decode
1308 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
1309 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
1310 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
1311 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
1312 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
1313 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
1314 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
1315 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
1316 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
1317 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
1318 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
1319 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
1320 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
1323 - Renamed ATP commands:
1324 atp_info ~> sledgehammer running_atps
1325 atp_kill ~> sledgehammer kill_atps
1326 atp_messages ~> sledgehammer messages
1327 atp_minimize ~> sledgehammer minimize
1328 print_atps ~> sledgehammer available_atps
1330 - Added user's manual ("isabelle doc sledgehammer").
1331 - Added option syntax and "sledgehammer_params" to customize
1332 Sledgehammer's behavior. See the manual for details.
1333 - Modified the Isar proof reconstruction code so that it produces
1334 direct proofs rather than proofs by contradiction. (This feature
1335 is still experimental.)
1336 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
1338 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
1341 - Added and implemented "binary_ints" and "bits" options.
1342 - Added "std" option and implemented support for nonstandard models.
1343 - Added and implemented "finitize" option to improve the precision
1344 of infinite datatypes based on a monotonicity analysis.
1345 - Added support for quotient types.
1346 - Added support for "specification" and "ax_specification"
1348 - Added support for local definitions (for "function" and
1349 "termination" proofs).
1350 - Added support for term postprocessors.
1351 - Optimized "Multiset.multiset" and "FinFun.finfun".
1352 - Improved efficiency of "destroy_constrs" optimization.
1353 - Fixed soundness bugs related to "destroy_constrs" optimization and
1355 - Fixed soundness bug related to higher-order constructors.
1356 - Fixed soundness bug when "full_descrs" is enabled.
1357 - Improved precision of set constructs.
1358 - Added "atoms" option.
1359 - Added cache to speed up repeated Kodkod invocations on the same
1361 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
1362 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
1363 "SAT4J_Light". INCOMPATIBILITY.
1364 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
1365 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
1366 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
1368 * Method "induct" now takes instantiations of the form t, where t is not
1369 a variable, as a shorthand for "x == t", where x is a fresh variable.
1370 If this is not intended, t has to be enclosed in parentheses.
1371 By default, the equalities generated by definitional instantiations
1372 are pre-simplified, which may cause parameters of inductive cases
1373 to disappear, or may even delete some of the inductive cases.
1374 Use "induct (no_simp)" instead of "induct" to restore the old
1375 behaviour. The (no_simp) option is also understood by the "cases"
1376 and "nominal_induct" methods, which now perform pre-simplification, too.
1382 * Variable names in lemmas generated by the domain package have
1383 changed; the naming scheme is now consistent with the HOL datatype
1384 package. Some proof scripts may be affected, INCOMPATIBILITY.
1386 * The domain package no longer defines the function "foo_copy" for
1387 recursive domain "foo". The reach lemma is now stated directly in
1388 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
1389 be reformulated in terms of "foo_take", INCOMPATIBILITY.
1391 * Most definedness lemmas generated by the domain package (previously
1392 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
1393 like "foo$x = UU <-> x = UU", which works better as a simp rule.
1394 Proofs that used definedness lemmas as intro rules may break,
1395 potential INCOMPATIBILITY.
1397 * Induction and casedist rules generated by the domain package now
1398 declare proper case_names (one called "bottom", and one named for each
1399 constructor). INCOMPATIBILITY.
1401 * For mutually-recursive domains, separate "reach" and "take_lemma"
1402 rules are generated for each domain, INCOMPATIBILITY.
1404 foo_bar.reach ~> foo.reach bar.reach
1405 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
1407 * Some lemmas generated by the domain package have been renamed for
1408 consistency with the datatype package, INCOMPATIBILITY.
1410 foo.ind ~> foo.induct
1411 foo.finite_ind ~> foo.finite_induct
1412 foo.coind ~> foo.coinduct
1413 foo.casedist ~> foo.exhaust
1414 foo.exhaust ~> foo.nchotomy
1416 * For consistency with other definition packages, the fixrec package
1417 now generates qualified theorem names, INCOMPATIBILITY.
1419 foo_simps ~> foo.simps
1420 foo_unfold ~> foo.unfold
1421 foo_induct ~> foo.induct
1423 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
1424 method and internal fixrec proofs now use the default simpset instead.
1427 * The "contlub" predicate has been removed. Proof scripts should use
1428 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
1430 * The "admw" predicate has been removed, INCOMPATIBILITY.
1432 * The constants cpair, cfst, and csnd have been removed in favor of
1433 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
1438 * Antiquotations for basic formal entities:
1440 @{class NAME} -- type class
1441 @{class_syntax NAME} -- syntax representation of the above
1443 @{type_name NAME} -- logical type
1444 @{type_abbrev NAME} -- type abbreviation
1445 @{nonterminal NAME} -- type of concrete syntactic category
1446 @{type_syntax NAME} -- syntax representation of any of the above
1448 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
1449 @{const_abbrev NAME} -- abbreviated constant
1450 @{const_syntax NAME} -- syntax representation of any of the above
1452 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
1453 syntax constant (cf. 'syntax' command).
1455 * Antiquotation @{make_string} inlines a function to print arbitrary
1456 values similar to the ML toplevel. The result is compiler dependent
1457 and may fall back on "?" in certain situations.
1459 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
1460 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
1461 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
1462 not work with the asynchronous Isar document model.
1464 * Configuration options now admit dynamic default values, depending on
1465 the context or even global references.
1467 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
1468 uses an efficient external library if available (for Poly/ML).
1470 * Renamed some important ML structures, while keeping the old names
1471 for some time as aliases within the structure Legacy:
1473 OuterKeyword ~> Keyword
1476 OuterSyntax ~> Outer_Syntax
1477 PrintMode ~> Print_Mode
1478 SpecParse ~> Parse_Spec
1481 ThyOutput ~> Thy_Output
1482 TypeInfer ~> Type_Infer
1484 Note that "open Legacy" simplifies porting of sources, but forgetting
1485 to remove it again will complicate porting again in the future.
1487 * Most operations that refer to a global context are named
1488 accordingly, e.g. Simplifier.global_context or
1489 ProofContext.init_global. There are some situations where a global
1490 context actually works, but under normal circumstances one needs to
1491 pass the proper local context through the code!
1493 * Discontinued old TheoryDataFun with its copy/init operation -- data
1494 needs to be pure. Functor Theory_Data_PP retains the traditional
1495 Pretty.pp argument to merge, which is absent in the standard
1496 Theory_Data version.
1498 * Sorts.certify_sort and derived "cert" operations for types and terms
1499 no longer minimize sorts. Thus certification at the boundary of the
1500 inference kernel becomes invariant under addition of class relations,
1501 which is an important monotonicity principle. Sorts are now minimized
1502 in the syntax layer only, at the boundary between the end-user and the
1503 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
1504 explicitly in rare situations.
1506 * Renamed old-style Drule.standard to Drule.export_without_context, to
1507 emphasize that this is in no way a standard operation.
1510 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
1511 usual for resolution. Rare INCOMPATIBILITY.
1513 * Renamed varify/unvarify operations to varify_global/unvarify_global
1514 to emphasize that these only work in a global situation (which is
1517 * Curried take and drop in library.ML; negative length is interpreted
1518 as infinity (as in chop). Subtle INCOMPATIBILITY.
1520 * Proof terms: type substitutions on proof constants now use canonical
1521 order of type variables. INCOMPATIBILITY for tools working with proof
1524 * Raw axioms/defs may no longer carry sort constraints, and raw defs
1525 may no longer carry premises. User-level specifications are
1526 transformed accordingly by Thm.add_axiom/add_def.
1531 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
1532 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
1533 proof terms are enabled unconditionally in the new HOL-Proofs image.
1535 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
1536 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
1539 * Old lib/scripts/polyml-platform is superseded by the
1540 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
1541 variant, even on a 64 bit machine. The following example setting
1542 prefers 64 bit if available:
1544 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
1546 * The preliminary Isabelle/jEdit application demonstrates the emerging
1547 Isabelle/Scala layer for advanced prover interaction and integration.
1548 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
1551 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
1552 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
1553 similar to the default assignment of the document preparation system
1554 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
1555 provides some operations for direct access to the font without asking
1556 the user for manual installation.
1560 New in Isabelle2009-1 (December 2009)
1561 -------------------------------------
1565 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
1566 one backslash should be used, even in ML sources.
1571 * Locale interpretation propagates mixins along the locale hierarchy.
1572 The currently only available mixins are the equations used to map
1573 local definitions to terms of the target domain of an interpretation.
1575 * Reactivated diagnostic command 'print_interps'. Use "print_interps
1576 loc" to print all interpretations of locale "loc" in the theory.
1577 Interpretations in proofs are not shown.
1579 * Thoroughly revised locales tutorial. New section on conditional
1582 * On instantiation of classes, remaining undefined class parameters
1583 are formally declared. INCOMPATIBILITY.
1586 *** Document preparation ***
1588 * New generalized style concept for printing terms: @{foo (style) ...}
1589 instead of @{foo_style style ...} (old form is still retained for
1590 backward compatibility). Styles can be also applied for
1591 antiquotations prop, term_type and typeof.
1596 * New proof method "smt" for a combination of first-order logic with
1597 equality, linear and nonlinear (natural/integer/real) arithmetic, and
1598 fixed-size bitvectors; there is also basic support for higher-order
1599 features (esp. lambda abstractions). It is an incomplete decision
1600 procedure based on external SMT solvers using the oracle mechanism;
1601 for the SMT solver Z3, this method is proof-producing. Certificates
1602 are provided to avoid calling the external solvers solely for
1603 re-checking proofs. Due to a remote SMT service there is no need for
1604 installing SMT solvers locally. See src/HOL/SMT.
1606 * New commands to load and prove verification conditions generated by
1607 the Boogie program verifier or derived systems (e.g. the Verifying C
1608 Compiler (VCC) or Spec#). See src/HOL/Boogie.
1610 * New counterexample generator tool 'nitpick' based on the Kodkod
1611 relational model finder. See src/HOL/Tools/Nitpick and
1612 src/HOL/Nitpick_Examples.
1614 * New commands 'code_pred' and 'values' to invoke the predicate
1615 compiler and to enumerate values of inductive predicates.
1617 * A tabled implementation of the reflexive transitive closure.
1619 * New implementation of quickcheck uses generic code generator;
1620 default generators are provided for all suitable HOL types, records
1621 and datatypes. Old quickcheck can be re-activated importing theory
1622 Library/SML_Quickcheck.
1624 * New testing tool Mirabelle for automated proof tools. Applies
1625 several tools and tactics like sledgehammer, metis, or quickcheck, to
1626 every proof step in a theory. To be used in batch mode via the
1627 "mirabelle" utility.
1629 * New proof method "sos" (sum of squares) for nonlinear real
1630 arithmetic (originally due to John Harison). It requires theory
1631 Library/Sum_Of_Squares. It is not a complete decision procedure but
1632 works well in practice on quantifier-free real arithmetic with +, -,
1633 *, ^, =, <= and <, i.e. boolean combinations of equalities and
1634 inequalities between polynomials. It makes use of external
1635 semidefinite programming solvers. Method "sos" generates a
1636 certificate that can be pasted into the proof thus avoiding the need
1637 to call an external tool every time the proof is checked. See
1638 src/HOL/Library/Sum_Of_Squares.
1640 * New method "linarith" invokes existing linear arithmetic decision
1643 * New command 'atp_minimal' reduces result produced by Sledgehammer.
1645 * New Sledgehammer option "Full Types" in Proof General settings menu.
1646 Causes full type information to be output to the ATPs. This slows
1647 ATPs down considerably but eliminates a source of unsound "proofs"
1650 * New method "metisFT": A version of metis that uses full type
1651 information in order to avoid failures of proof reconstruction.
1653 * New evaluator "approximate" approximates an real valued term using
1654 the same method as the approximation method.
1656 * Method "approximate" now supports arithmetic expressions as
1657 boundaries of intervals and implements interval splitting and Taylor
1660 * ML antiquotation @{code_datatype} inserts definition of a datatype
1661 generated by the code generator; e.g. see src/HOL/Predicate.thy.
1663 * New theory SupInf of the supremum and infimum operators for sets of
1666 * New theory Probability, which contains a development of measure
1667 theory, eventually leading to Lebesgue integration and probability.
1669 * Extended Multivariate Analysis to include derivation and Brouwer's
1672 * Reorganization of number theory, INCOMPATIBILITY:
1673 - new number theory development for nat and int, in theories Divides
1674 and GCD as well as in new session Number_Theory
1675 - some constants and facts now suffixed with _nat and _int
1677 - former session NumberTheory now named Old_Number_Theory, including
1678 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
1679 - moved theory Pocklington from src/HOL/Library to
1680 src/HOL/Old_Number_Theory
1682 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
1683 lcm of finite and infinite sets. It is shown that they form a complete
1686 * Class semiring_div requires superclass no_zero_divisors and proof of
1687 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
1688 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
1689 generalized to class semiring_div, subsuming former theorems
1690 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
1691 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
1694 * Refinements to lattice classes and sets:
1695 - less default intro/elim rules in locale variant, more default
1696 intro/elim rules in class variant: more uniformity
1697 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
1699 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
1701 - renamed ACI to inf_sup_aci
1702 - new class "boolean_algebra"
1703 - class "complete_lattice" moved to separate theory
1704 "Complete_Lattice"; corresponding constants (and abbreviations)
1705 renamed and with authentic syntax:
1706 Set.Inf ~> Complete_Lattice.Inf
1707 Set.Sup ~> Complete_Lattice.Sup
1708 Set.INFI ~> Complete_Lattice.INFI
1709 Set.SUPR ~> Complete_Lattice.SUPR
1710 Set.Inter ~> Complete_Lattice.Inter
1711 Set.Union ~> Complete_Lattice.Union
1712 Set.INTER ~> Complete_Lattice.INTER
1713 Set.UNION ~> Complete_Lattice.UNION
1714 - authentic syntax for
1717 - mere abbreviations:
1720 Set.inter (for inf, formerly Set.Int)
1721 Set.union (for sup, formerly Set.Un)
1722 Complete_Lattice.Inter (for Inf)
1723 Complete_Lattice.Union (for Sup)
1724 Complete_Lattice.INTER (for INFI)
1725 Complete_Lattice.UNION (for SUPR)
1726 - object-logic definitions as far as appropriate
1728 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
1729 Un_subset_iff are explicitly deleted as default simp rules; then also
1730 their lattice counterparts le_inf_iff and le_sup_iff have to be
1731 deleted to achieve the desired effect.
1733 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
1734 rules by default any longer; the same applies to min_max.inf_absorb1
1735 etc. INCOMPATIBILITY.
1737 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
1738 pred_set_conv by default. INCOMPATIBILITY.
1740 * Power operations on relations and functions are now one dedicated
1741 constant "compow" with infix syntax "^^". Power operation on
1742 multiplicative monoids retains syntax "^" and is now defined generic
1743 in class power. INCOMPATIBILITY.
1745 * Relation composition "R O S" now has a more standard argument order:
1746 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
1747 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
1748 break, since the O_assoc rule was not rewritten like this. Fix using
1749 O_assoc[symmetric]. The same applies to the curried version "R OO S".
1751 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
1752 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
1755 * Most rules produced by inductive and datatype package have mandatory
1756 prefixes. INCOMPATIBILITY.
1758 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
1759 the attribute of the same name. Each of the theorems in the list
1760 DERIV_intros assumes composition with an additional function and
1761 matches a variable to the derivative, which has to be solved by the
1762 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
1763 of most elementary terms. Former Maclauren.DERIV_tac and
1764 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
1767 * Code generator attributes follow the usual underscore convention:
1768 code_unfold replaces code unfold
1769 code_post replaces code post
1774 sizechange -> size_change
1775 induct_scheme -> induction_schema
1778 * Discontinued abbreviation "arbitrary" of constant "undefined".
1779 INCOMPATIBILITY, use "undefined" directly.
1782 Suc_eq_add_numeral_1 -> Suc_eq_plus1
1783 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
1784 Suc_plus1 -> Suc_eq_plus1
1785 *anti_sym -> *antisym*
1786 vector_less_eq_def -> vector_le_def
1789 * Added theorem List.map_map as [simp]. Removed List.map_compose.
1792 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1798 * Theory Representable defines a class "rep" of domains that are
1799 representable (via an ep-pair) in the universal domain type "udom".
1800 Instances are provided for all type constructors defined in HOLCF.
1802 * The 'new_domain' command is a purely definitional version of the
1803 domain package, for representable domains. Syntax is identical to the
1804 old domain package. The 'new_domain' package also supports indirect
1805 recursion using previously-defined type constructors. See
1806 src/HOLCF/ex/New_Domain.thy for examples.
1808 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1809 on the left-hand side of an equation, and then performs
1810 simplification. Rewriting is done using rules declared with the
1811 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1812 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1814 * The pattern-match compiler in 'fixrec' can now handle constructors
1815 with HOL function types. Pattern-match combinators for the Pair
1816 constructor are pre-configured.
1818 * The 'fixrec' package now produces better fixed-point induction rules
1819 for mutually-recursive definitions: Induction rules have conclusions
1820 of the form "P foo bar" instead of "P <foo, bar>".
1822 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1823 been renamed to "below". The name "below" now replaces "less" in many
1824 theorem names. (Legacy theorem names using "less" are still supported
1827 * The 'fixrec' package now supports "bottom patterns". Bottom
1828 patterns can be used to generate strictness rules, or to make
1829 functions more strict (much like the bang-patterns supported by the
1830 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1836 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1837 errors and run-time exceptions, including detailed source positions.
1839 * Structure Name_Space (formerly NameSpace) now manages uniquely
1840 identified entries, with some additional information such as source
1841 position, logical grouping etc.
1843 * Theory and context data is now introduced by the simplified and
1844 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1845 to be pure, but the old TheoryDataFun for mutable data (with explicit
1846 copy operation) is still available for some time.
1848 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1849 provides a high-level programming interface to synchronized state
1850 variables with atomic update. This works via pure function
1851 application within a critical section -- its runtime should be as
1852 short as possible; beware of deadlocks if critical code is nested,
1853 either directly or indirectly via other synchronized variables!
1855 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1856 wraps raw ML references, explicitly indicating their non-thread-safe
1857 behaviour. The Isar toplevel keeps this structure open, to
1858 accommodate Proof General as well as quick and dirty interactive
1859 experiments with references.
1861 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1862 parallel tactical reasoning.
1864 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1865 are similar to SUBPROOF, but are slightly more flexible: only the
1866 specified parts of the subgoal are imported into the context, and the
1867 body tactic may introduce new subgoals and schematic variables.
1869 * Old tactical METAHYPS, which does not observe the proof context, has
1870 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1871 or Subgoal.FOCUS etc.
1873 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1874 functors have their own ML name space there is no point to mark them
1875 separately.) Minor INCOMPATIBILITY.
1877 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1879 * Renamed several structures FooBar to Foo_Bar. Occasional,
1882 * Operations of structure Skip_Proof no longer require quick_and_dirty
1883 mode, which avoids critical setmp.
1885 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1886 combinators for "args". INCOMPATIBILITY, need to use simplified
1887 Attrib/Method.setup introduced in Isabelle2009.
1889 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1890 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1891 last resort. INCOMPATIBILITY.
1893 * Display.pretty_thm now requires a proper context (cf. former
1894 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1895 or even Display.pretty_thm_without_context as last resort.
1898 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1899 Syntax.pretty_typ/term directly, preferably with proper context
1900 instead of global theory.
1905 * Further fine tuning of parallel proof checking, scales up to 8 cores
1906 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1909 * Support for additional "Isabelle components" via etc/components, see
1910 also the system manual.
1912 * The isabelle makeall tool now operates on all components with
1913 IsaMakefile, not just hardwired "logics".
1915 * Removed "compress" option from isabelle-process and isabelle usedir;
1916 this is always enabled.
1918 * Discontinued support for Poly/ML 4.x versions.
1920 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1921 on a given logic image. This requires the lighttpd webserver and is
1922 currently supported on Linux only.
1926 New in Isabelle2009 (April 2009)
1927 --------------------------------
1931 * Simplified main Isabelle executables, with less surprises on
1932 case-insensitive file-systems (such as Mac OS).
1934 - The main Isabelle tool wrapper is now called "isabelle" instead of
1937 - The former "isabelle" alias for "isabelle-process" has been
1938 removed (should rarely occur to regular users).
1940 - The former "isabelle-interface" and its alias "Isabelle" have been
1941 removed (interfaces are now regular Isabelle tools).
1943 Within scripts and make files, the Isabelle environment variables
1944 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1945 respectively. (The latter are still available as legacy feature.)
1947 The old isabelle-interface wrapper could react in confusing ways if
1948 the interface was uninstalled or changed otherwise. Individual
1949 interface tool configuration is now more explicit, see also the
1950 Isabelle system manual. In particular, Proof General is now available
1951 via "isabelle emacs".
1953 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1954 purge installed copies of Isabelle executables and re-run "isabelle
1955 install -p ...", or use symlinks.
1957 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1958 old ~/isabelle, which was slightly non-standard and apt to cause
1959 surprises on case-insensitive file-systems (such as Mac OS).
1961 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1962 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1963 care is required when using older releases of Isabelle. Note that
1964 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1965 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1967 * Proofs of fully specified statements are run in parallel on
1968 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1969 a regular 4-core machine, if the initial heap space is made reasonably
1970 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1972 * The main reference manuals ("isar-ref", "implementation", and
1973 "system") have been updated and extended. Formally checked references
1974 as hyperlinks are now available uniformly.
1979 * Complete re-implementation of locales. INCOMPATIBILITY in several
1980 respects. The most important changes are listed below. See the
1981 Tutorial on Locales ("locales" manual) for details.
1983 - In locale expressions, instantiation replaces renaming. Parameters
1984 must be declared in a for clause. To aid compatibility with previous
1985 parameter inheritance, in locale declarations, parameters that are not
1986 'touched' (instantiation position "_" or omitted) are implicitly added
1987 with their syntax at the beginning of the for clause.
1989 - Syntax from abbreviations and definitions in locales is available in
1990 locale expressions and context elements. The latter is particularly
1991 useful in locale declarations.
1993 - More flexible mechanisms to qualify names generated by locale
1994 expressions. Qualifiers (prefixes) may be specified in locale
1995 expressions, and can be marked as mandatory (syntax: "name!:") or
1996 optional (syntax "name?:"). The default depends for plain "name:"
1997 depends on the situation where a locale expression is used: in
1998 commands 'locale' and 'sublocale' prefixes are optional, in
1999 'interpretation' and 'interpret' prefixes are mandatory. The old
2000 implicit qualifiers derived from the parameter names of a locale are
2001 no longer generated.
2003 - Command "sublocale l < e" replaces "interpretation l < e". The
2004 instantiation clause in "interpretation" and "interpret" (square
2005 brackets) is no longer available. Use locale expressions.
2007 - When converting proof scripts, mandatory qualifiers in
2008 'interpretation' and 'interpret' should be retained by default, even
2009 if this is an INCOMPATIBILITY compared to former behavior. In the
2010 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
2011 in locale expressions range over a single locale instance only.
2013 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
2014 In existing theorem specifications replace the includes element by the
2015 respective context elements of the included locale, omitting those
2016 that are already present in the theorem specification. Multiple
2017 assume elements of a locale should be replaced by a single one
2018 involving the locale predicate. In the proof body, declarations (most
2019 notably theorems) may be regained by interpreting the respective
2020 locales in the proof context as required (command "interpret").
2022 If using "includes" in replacement of a target solely because the
2023 parameter types in the theorem are not as general as in the target,
2024 consider declaring a new locale with additional type constraints on
2025 the parameters (context element "constrains").
2027 - Discontinued "locale (open)". INCOMPATIBILITY.
2029 - Locale interpretation commands no longer attempt to simplify goal.
2030 INCOMPATIBILITY: in rare situations the generated goal differs. Use
2031 methods intro_locales and unfold_locales to clarify.
2033 - Locale interpretation commands no longer accept interpretation
2034 attributes. INCOMPATIBILITY.
2036 * Class declaration: so-called "base sort" must not be given in import
2037 list any longer, but is inferred from the specification. Particularly
2044 class foo = type + ...
2046 * Class target: global versions of theorems stemming do not carry a
2047 parameter prefix any longer. INCOMPATIBILITY.
2049 * Class 'instance' command no longer accepts attached definitions.
2050 INCOMPATIBILITY, use proper 'instantiation' target instead.
2052 * Recovered hiding of consts, which was accidentally broken in
2053 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
2054 makes c inaccessible; consider using ``hide (open) const c'' instead.
2056 * Slightly more coherent Pure syntax, with updated documentation in
2057 isar-ref manual. Removed locales meta_term_syntax and
2058 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
2059 INCOMPATIBILITY in rare situations. Note that &&& should not be used
2060 directly in regular applications.
2062 * There is a new syntactic category "float_const" for signed decimal
2063 fractions (e.g. 123.45 or -123.45).
2065 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
2066 interface with 'setup' command instead.
2068 * Command 'local_setup' is similar to 'setup', but operates on a local
2071 * The 'axiomatization' command now only works within a global theory
2072 context. INCOMPATIBILITY.
2074 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
2075 hypotheses. Sorts required in the course of reasoning need to be
2076 covered by the constraints in the initial statement, completed by the
2077 type instance information of the background theory. Non-trivial sort
2078 hypotheses, which rarely occur in practice, may be specified via
2079 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
2081 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
2083 The result contains an implicit sort hypotheses as before --
2084 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
2087 * Generalized Isar history, with support for linear undo, direct state
2090 * Changed defaults for unify configuration options:
2092 unify_trace_bound = 50 (formerly 25)
2093 unify_search_bound = 60 (formerly 30)
2095 * Different bookkeeping for code equations (INCOMPATIBILITY):
2097 a) On theory merge, the last set of code equations for a particular
2098 constant is taken (in accordance with the policy applied by other
2099 parts of the code generator framework).
2101 b) Code equations stemming from explicit declarations (e.g. code
2102 attribute) gain priority over default code equations stemming
2103 from definition, primrec, fun etc.
2105 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
2107 * Unified theorem tables for both code generators. Thus [code
2108 func] has disappeared and only [code] remains. INCOMPATIBILITY.
2110 * Command 'find_consts' searches for constants based on type and name
2113 find_consts "_ => bool"
2115 By default, matching is against subtypes, but it may be restricted to
2116 the whole type. Searching by name is possible. Multiple queries are
2117 conjunctive and queries may be negated by prefixing them with a
2120 find_consts strict: "_ => bool" name: "Int" -"int => int"
2122 * New 'find_theorems' criterion "solves" matches theorems that
2123 directly solve the current goal (modulo higher-order unification).
2125 * Auto solve feature for main theorem statements: whenever a new goal
2126 is stated, "find_theorems solves" is called; any theorems that could
2127 solve the lemma directly are listed as part of the goal state.
2128 Cf. associated options in Proof General Isabelle settings menu,
2129 enabled by default, with reasonable timeout for pathological cases of
2130 higher-order unification.
2133 *** Document preparation ***
2135 * Antiquotation @{lemma} now imitates a regular terminal proof,
2136 demanding keyword 'by' and supporting the full method expression
2137 syntax just like the Isar command 'by'.
2142 * Integrated main parts of former image HOL-Complex with HOL. Entry
2143 points Main and Complex_Main remain as before.
2145 * Logic image HOL-Plain provides a minimal HOL with the most important
2146 tools available (inductive, datatype, primrec, ...). This facilitates
2147 experimentation and tool development. Note that user applications
2148 (and library theories) should never refer to anything below theory
2151 * Logic image HOL-Main stops at theory Main, and thus facilitates
2152 experimentation due to shorter build times.
2154 * Logic image HOL-NSA contains theories of nonstandard analysis which
2155 were previously part of former HOL-Complex. Entry point Hyperreal
2156 remains valid, but theories formerly using Complex_Main should now use
2157 new entry point Hypercomplex.
2159 * Generic ATP manager for Sledgehammer, based on ML threads instead of
2160 Posix processes. Avoids potentially expensive forking of the ML
2161 process. New thread-based implementation also works on non-Unix
2162 platforms (Cygwin). Provers are no longer hardwired, but defined
2163 within the theory via plain ML wrapper functions. Basic Sledgehammer
2164 commands are covered in the isar-ref manual.
2166 * Wrapper scripts for remote SystemOnTPTP service allows to use
2167 sledgehammer without local ATP installation (Vampire etc.). Other
2168 provers may be included via suitable ML wrappers, see also
2169 src/HOL/ATP_Linkup.thy.
2171 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
2174 * The metis method no longer fails because the theorem is too trivial
2175 (contains the empty clause).
2177 * The metis method now fails in the usual manner, rather than raising
2178 an exception, if it determines that it cannot prove the theorem.
2180 * Method "coherent" implements a prover for coherent logic (see also
2181 src/Tools/coherent.ML).
2183 * Constants "undefined" and "default" replace "arbitrary". Usually
2184 "undefined" is the right choice to replace "arbitrary", though
2185 logically there is no difference. INCOMPATIBILITY.
2187 * Command "value" now integrates different evaluation mechanisms. The
2188 result of the first successful evaluation mechanism is printed. In
2189 square brackets a particular named evaluation mechanisms may be
2190 specified (currently, [SML], [code] or [nbe]). See further
2191 src/HOL/ex/Eval_Examples.thy.
2193 * Normalization by evaluation now allows non-leftlinear equations.
2194 Declare with attribute [code nbe].
2196 * Methods "case_tac" and "induct_tac" now refer to the very same rules
2197 as the structured Isar versions "cases" and "induct", cf. the
2198 corresponding "cases" and "induct" attributes. Mutual induction rules
2199 are now presented as a list of individual projections
2200 (e.g. foo_bar.inducts for types foo and bar); the old format with
2201 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
2202 rare situations a different rule is selected --- notably nested tuple
2203 elimination instead of former prod.exhaust: use explicit (case_tac t
2204 rule: prod.exhaust) here.
2206 * Attributes "cases", "induct", "coinduct" support "del" option.
2208 * Removed fact "case_split_thm", which duplicates "case_split".
2210 * The option datatype has been moved to a new theory Option. Renamed
2211 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
2213 * New predicate "strict_mono" classifies strict functions on partial
2214 orders. With strict functions on linear orders, reasoning about
2215 (in)equalities is facilitated by theorems "strict_mono_eq",
2216 "strict_mono_less_eq" and "strict_mono_less".
2218 * Some set operations are now proper qualified constants with
2219 authentic syntax. INCOMPATIBILITY:
2230 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
2233 * Auxiliary class "itself" has disappeared -- classes without any
2234 parameter are treated as expected by the 'class' command.
2236 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
2238 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
2239 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
2241 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
2242 method "approximation". It proves formulas on real values by using
2243 interval arithmetic. In the formulas are also the transcendental
2244 functions sin, cos, tan, atan, ln, exp and the constant pi are
2245 allowed. For examples see
2246 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
2248 * Theory "Reflection" now resides in HOL/Library.
2250 * Entry point to Word library now simply named "Word".
2253 * Made source layout more coherent with logical distribution
2256 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
2257 src/HOL/Library/Code_Message.thy ~> src/HOL/
2258 src/HOL/Library/GCD.thy ~> src/HOL/
2259 src/HOL/Library/Order_Relation.thy ~> src/HOL/
2260 src/HOL/Library/Parity.thy ~> src/HOL/
2261 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
2262 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
2263 src/HOL/Real/Lubs.thy ~> src/HOL/
2264 src/HOL/Real/PReal.thy ~> src/HOL/
2265 src/HOL/Real/Rational.thy ~> src/HOL/
2266 src/HOL/Real/RComplete.thy ~> src/HOL/
2267 src/HOL/Real/RealDef.thy ~> src/HOL/
2268 src/HOL/Real/RealPow.thy ~> src/HOL/
2269 src/HOL/Real/Real.thy ~> src/HOL/
2270 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
2271 src/HOL/Complex/Complex.thy ~> src/HOL/
2272 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
2273 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
2274 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
2275 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
2276 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
2277 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
2278 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
2279 src/HOL/Hyperreal/Log.thy ~> src/HOL/
2280 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
2281 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
2282 src/HOL/Hyperreal/Series.thy ~> src/HOL/
2283 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
2284 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
2285 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
2286 src/HOL/Real/Float ~> src/HOL/Library/
2287 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
2288 src/HOL/Real/RealVector.thy ~> src/HOL/
2290 src/HOL/arith_data.ML ~> src/HOL/Tools
2291 src/HOL/hologic.ML ~> src/HOL/Tools
2292 src/HOL/simpdata.ML ~> src/HOL/Tools
2293 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
2294 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
2295 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
2296 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
2297 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
2298 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
2299 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
2301 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
2302 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
2303 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
2304 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
2305 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
2306 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
2308 * If methods "eval" and "evaluation" encounter a structured proof
2309 state with !!/==>, only the conclusion is evaluated to True (if
2310 possible), avoiding strange error messages.
2312 * Method "sizechange" automates termination proofs using (a
2313 modification of) the size-change principle. Requires SAT solver. See
2314 src/HOL/ex/Termination.thy for examples.
2316 * Simplifier: simproc for let expressions now unfolds if bound
2317 variable occurs at most once in let expression body. INCOMPATIBILITY.
2319 * Method "arith": Linear arithmetic now ignores all inequalities when
2320 fast_arith_neq_limit is exceeded, instead of giving up entirely.
2322 * New attribute "arith" for facts that should always be used
2323 automatically by arithmetic. It is intended to be used locally in
2326 assumes [arith]: "x > 0"
2328 Global usage is discouraged because of possible performance impact.
2330 * New classes "top" and "bot" with corresponding operations "top" and
2331 "bot" in theory Orderings; instantiation of class "complete_lattice"
2332 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
2334 * Changed definition lemma "less_fun_def" in order to provide an
2335 instance for preorders on functions; use lemma "less_le" instead.
2338 * Theory Orderings: class "wellorder" moved here, with explicit
2339 induction rule "less_induct" as assumption. For instantiation of
2340 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
2343 * Theory Orderings: added class "preorder" as superclass of "order".
2344 INCOMPATIBILITY: Instantiation proofs for order, linorder
2345 etc. slightly changed. Some theorems named order_class.* now named
2348 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
2351 * Theory Finite_Set: added a new fold combinator of type
2353 ('a => 'b => 'b) => 'b => 'a set => 'b
2355 Occasionally this is more convenient than the old fold combinator
2356 which is now defined in terms of the new one and renamed to
2359 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
2360 and "ring_simps" have been replaced by "algebra_simps" (which can be
2361 extended with further lemmas!). At the moment both still exist but
2362 the former will disappear at some point.
2364 * Theory Power: Lemma power_Suc is now declared as a simp rule in
2365 class recpower. Type-specific simp rules for various recpower types
2366 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
2368 rat_power_0 -> power_0
2369 rat_power_Suc -> power_Suc
2370 realpow_0 -> power_0
2371 realpow_Suc -> power_Suc
2372 complexpow_0 -> power_0
2373 complexpow_Suc -> power_Suc
2374 power_poly_0 -> power_0
2375 power_poly_Suc -> power_Suc
2377 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
2378 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
2379 dvd has been generalized to class comm_semiring_1. Likewise a bunch
2380 of lemmas from Divides has been generalized from nat to class
2381 semiring_div. INCOMPATIBILITY. This involves the following theorem
2382 renames resulting from duplicate elimination:
2384 dvd_def_mod ~> dvd_eq_mod_eq_0
2385 zero_dvd_iff ~> dvd_0_left_iff
2386 dvd_0 ~> dvd_0_right
2387 DIVISION_BY_ZERO_DIV ~> div_by_0
2388 DIVISION_BY_ZERO_MOD ~> mod_by_0
2389 mult_div ~> div_mult_self2_is_id
2390 mult_mod ~> mod_mult_self2_is_0
2392 * Theory IntDiv: removed many lemmas that are instances of class-based
2393 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
2394 rename old lemmas as follows:
2396 dvd_diff -> nat_dvd_diff
2397 dvd_zminus_iff -> dvd_minus_iff
2398 mod_add1_eq -> mod_add_eq
2399 mod_mult1_eq -> mod_mult_right_eq
2400 mod_mult1_eq' -> mod_mult_left_eq
2401 mod_mult_distrib_mod -> mod_mult_eq
2402 nat_mod_add_left_eq -> mod_add_left_eq
2403 nat_mod_add_right_eq -> mod_add_right_eq
2404 nat_mod_div_trivial -> mod_div_trivial
2405 nat_mod_mod_trivial -> mod_mod_trivial
2406 zdiv_zadd_self1 -> div_add_self1
2407 zdiv_zadd_self2 -> div_add_self2
2408 zdiv_zmult_self1 -> div_mult_self2_is_id
2409 zdiv_zmult_self2 -> div_mult_self1_is_id
2410 zdvd_triv_left -> dvd_triv_left
2411 zdvd_triv_right -> dvd_triv_right
2412 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
2413 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
2414 zmod_zadd_left_eq -> mod_add_left_eq
2415 zmod_zadd_right_eq -> mod_add_right_eq
2416 zmod_zadd_self1 -> mod_add_self1
2417 zmod_zadd_self2 -> mod_add_self2
2418 zmod_zadd1_eq -> mod_add_eq
2419 zmod_zdiff1_eq -> mod_diff_eq
2420 zmod_zdvd_zmod -> mod_mod_cancel
2421 zmod_zmod_cancel -> mod_mod_cancel
2422 zmod_zmult_self1 -> mod_mult_self2_is_0
2423 zmod_zmult_self2 -> mod_mult_self1_is_0
2426 zdvd_abs1 -> abs_dvd_iff
2427 zdvd_abs2 -> dvd_abs_iff
2428 zdvd_refl -> dvd_refl
2429 zdvd_trans -> dvd_trans
2430 zdvd_zadd -> dvd_add
2431 zdvd_zdiff -> dvd_diff
2432 zdvd_zminus_iff -> dvd_minus_iff
2433 zdvd_zminus2_iff -> minus_dvd_iff
2434 zdvd_zmultD -> dvd_mult_right
2435 zdvd_zmultD2 -> dvd_mult_left
2436 zdvd_zmult_mono -> mult_dvd_mono
2437 zdvd_0_right -> dvd_0_right
2438 zdvd_0_left -> dvd_0_left_iff
2439 zdvd_1_left -> one_dvd
2440 zminus_dvd_iff -> minus_dvd_iff
2442 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
2444 * The real numbers offer decimal input syntax: 12.34 is translated
2445 into 1234/10^2. This translation is not reversed upon output.
2447 * Theory Library/Polynomial defines an abstract type 'a poly of
2448 univariate polynomials with coefficients of type 'a. In addition to
2449 the standard ring operations, it also supports div and mod. Code
2450 generation is also supported, using list-style constructors.
2452 * Theory Library/Inner_Product defines a class of real_inner for real
2453 inner product spaces, with an overloaded operation inner :: 'a => 'a
2454 => real. Class real_inner is a subclass of real_normed_vector from
2457 * Theory Library/Product_Vector provides instances for the product
2458 type 'a * 'b of several classes from RealVector and Inner_Product.
2459 Definitions of addition, subtraction, scalar multiplication, norms,
2460 and inner products are included.
2462 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
2463 addition to the field operations, numerals and case syntax are also
2466 * Theory Library/Diagonalize provides constructive version of Cantor's
2467 first diagonalization argument.
2469 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
2470 zlcm (for int); carried together from various gcd/lcm developements in
2471 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
2472 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
2473 may recover tupled syntax as follows:
2475 hide (open) const gcd
2476 abbreviation gcd where
2477 "gcd == (%(a, b). GCD.gcd a b)"
2479 GCD.gcd ("gcd '(_, _')")
2481 The same works for lcm, zgcd, zlcm.
2483 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
2484 instantiations for algebraic structures. Removed some duplicate
2485 theorems. Changes in simp rules. INCOMPATIBILITY.
2487 * ML antiquotation @{code} takes a constant as argument and generates
2488 corresponding code in background and inserts name of the corresponding
2489 resulting ML value/function/datatype constructor binding in place.
2490 All occurrences of @{code} with a single ML block are generated
2491 simultaneously. Provides a generic and safe interface for
2492 instrumentalizing code generation. See
2493 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
2494 In future you ought to refrain from ad-hoc compiling generated SML
2495 code on the ML toplevel. Note that (for technical reasons) @{code}
2496 cannot refer to constants for which user-defined serializations are
2497 set. Refer to the corresponding ML counterpart directly in that
2500 * Command 'rep_datatype': instead of theorem names the command now
2501 takes a list of terms denoting the constructors of the type to be
2502 represented as datatype. The characteristic theorems have to be
2503 proven. INCOMPATIBILITY. Also observe that the following theorems
2504 have disappeared in favour of existing ones:
2506 unit_induct ~> unit.induct
2507 prod_induct ~> prod.induct
2508 sum_induct ~> sum.induct
2509 Suc_Suc_eq ~> nat.inject
2510 Suc_not_Zero Zero_not_Suc ~> nat.distinct
2515 * New locales for orders and lattices where the equivalence relation
2516 is not restricted to equality. INCOMPATIBILITY: all order and lattice
2517 locales use a record structure with field eq for the equivalence.
2519 * New theory of factorial domains.
2521 * Units_l_inv and Units_r_inv are now simp rules by default.
2522 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
2523 and/or r_inv will now also require deletion of these lemmas.
2525 * Renamed the following theorems, INCOMPATIBILITY:
2527 UpperD ~> Upper_memD
2528 LowerD ~> Lower_memD
2529 least_carrier ~> least_closed
2530 greatest_carrier ~> greatest_closed
2531 greatest_Lower_above ~> greatest_Lower_below
2532 one_zero ~> carrier_one_zero
2533 one_not_zero ~> carrier_one_not_zero (collision with assumption)
2538 * Nominal datatypes can now contain type-variables.
2540 * Commands 'nominal_inductive' and 'equivariance' work with local
2543 * Nominal primrec can now works with local theory targets and its
2544 specification syntax now conforms to the general format as seen in
2547 * Method "perm_simp" honours the standard simplifier attributes
2548 (no_asm), (no_asm_use) etc.
2550 * The new predicate #* is defined like freshness, except that on the
2551 left hand side can be a set or list of atoms.
2553 * Experimental command 'nominal_inductive2' derives strong induction
2554 principles for inductive definitions. In contrast to
2555 'nominal_inductive', which can only deal with a fixed number of
2556 binders, it can deal with arbitrary expressions standing for sets of
2557 atoms to be avoided. The only inductive definition we have at the
2558 moment that needs this generalisation is the typing rule for Lets in
2561 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
2562 -----------------------------------------------------------------
2563 Gamma |- Let x be t1 in t2 : T2
2565 In this rule one wants to avoid all the binders that are introduced by
2566 "close Gamma T1". We are looking for other examples where this
2567 feature might be useful. Please let us know.
2572 * Reimplemented the simplification procedure for proving continuity
2573 subgoals. The new simproc is extensible; users can declare additional
2574 continuity introduction rules with the attribute [cont2cont].
2576 * The continuity simproc now uses a different introduction rule for
2577 solving continuity subgoals on terms with lambda abstractions. In
2578 some rare cases the new simproc may fail to solve subgoals that the
2579 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
2580 Potential INCOMPATIBILITY.
2582 * Command 'fixrec': specification syntax now conforms to the general
2583 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
2584 examples. INCOMPATIBILITY.
2589 * Proof of Zorn's Lemma for partial orders.
2594 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
2595 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
2596 depends on multithreading, so timouts will not work before Poly/ML
2599 * High-level support for concurrent ML programming, see
2600 src/Pure/Cuncurrent. The data-oriented model of "future values" is
2601 particularly convenient to organize independent functional
2602 computations. The concept of "synchronized variables" provides a
2603 higher-order interface for components with shared state, avoiding the
2604 delicate details of mutexes and condition variables. (Requires
2605 Poly/ML 5.2.1 or later.)
2607 * ML bindings produced via Isar commands are stored within the Isar
2608 context (theory or proof). Consequently, commands like 'use' and 'ML'
2609 become thread-safe and work with undo as expected (concerning
2610 top-level bindings, not side-effects on global references).
2611 INCOMPATIBILITY, need to provide proper Isar context when invoking the
2612 compiler at runtime; really global bindings need to be given outside a
2613 theory. (Requires Poly/ML 5.2 or later.)
2615 * Command 'ML_prf' is analogous to 'ML' but works within a proof
2616 context. Top-level ML bindings are stored within the proof context in
2617 a purely sequential fashion, disregarding the nested proof structure.
2618 ML bindings introduced by 'ML_prf' are discarded at the end of the
2619 proof. (Requires Poly/ML 5.2 or later.)
2621 * Simplified ML attribute and method setup, cf. functions Attrib.setup
2622 and Method.setup, as well as Isar commands 'attribute_setup' and
2623 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
2624 existing code accordingly, or use plain 'setup' together with old
2627 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
2628 to 'a -> thm, while results are always tagged with an authentic oracle
2629 name. The Isar command 'oracle' is now polymorphic, no argument type
2630 is specified. INCOMPATIBILITY, need to simplify existing oracle code
2631 accordingly. Note that extra performance may be gained by producing
2632 the cterm carefully, avoiding slow Thm.cterm_of.
2634 * Simplified interface for defining document antiquotations via
2635 ThyOutput.antiquotation, ThyOutput.output, and optionally
2636 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
2637 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
2640 * More systematic treatment of long names, abstract name bindings, and
2641 name space operations. Basic operations on qualified names have been
2642 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
2643 Long_Name.append. Old type bstring has been mostly replaced by
2644 abstract type binding (see structure Binding), which supports precise
2645 qualification by packages and local theory targets, as well as proper
2646 tracking of source positions. INCOMPATIBILITY, need to wrap old
2647 bstring values into Binding.name, or better pass through abstract
2648 bindings everywhere. See further src/Pure/General/long_name.ML,
2649 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
2651 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
2652 LocalTheory.note etc.) now refer to the *full* internal name, not the
2653 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
2655 * Disposed old type and term read functions (Sign.read_def_typ,
2656 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
2657 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
2658 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
2659 Syntax.read_term_global etc.; see also OldGoals.read_term as last
2660 resort for legacy applications.
2662 * Disposed old declarations, tactics, tactic combinators that refer to
2663 the simpset or claset of an implicit theory (such as Addsimps,
2664 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
2665 embedded ML text, or local_simpset_of with a proper context passed as
2666 explicit runtime argument.
2668 * Rules and tactics that read instantiations (read_instantiate,
2669 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
2670 context, which is required for parsing and type-checking. Moreover,
2671 the variables are specified as plain indexnames, not string encodings
2672 thereof. INCOMPATIBILITY.
2674 * Generic Toplevel.add_hook interface allows to analyze the result of
2675 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
2676 for theorem dependency output of transactions resulting in a new
2679 * ML antiquotations: block-structured compilation context indicated by
2680 \<lbrace> ... \<rbrace>; additional antiquotation forms:
2682 @{binding name} - basic name binding
2683 @{let ?pat = term} - term abbreviation (HO matching)
2684 @{note name = fact} - fact abbreviation
2685 @{thm fact} - singleton fact (with attributes)
2686 @{thms fact} - general fact (with attributes)
2687 @{lemma prop by method} - singleton goal
2688 @{lemma prop by meth1 meth2} - singleton goal
2689 @{lemma prop1 ... propN by method} - general goal
2690 @{lemma prop1 ... propN by meth1 meth2} - general goal
2691 @{lemma (open) ...} - open derivation
2696 * The Isabelle "emacs" tool provides a specific interface to invoke
2697 Proof General / Emacs, with more explicit failure if that is not
2698 installed (the old isabelle-interface script silently falls back on
2699 isabelle-process). The PROOFGENERAL_HOME setting determines the
2700 installation location of the Proof General distribution.
2702 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
2703 the Isabelle process into a JVM/Scala application. See
2704 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
2705 process wrapper has been discontinued.)
2707 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
2709 * Various status messages (with exact source position information) are
2710 emitted, if proper markup print mode is enabled. This allows
2711 user-interface components to provide detailed feedback on internal
2716 New in Isabelle2008 (June 2008)
2717 -------------------------------
2721 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
2722 and updated, with formally checked references as hyperlinks.
2724 * Theory loader: use_thy (and similar operations) no longer set the
2725 implicit ML context, which was occasionally hard to predict and in
2726 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
2727 provides a proper context already.
2729 * Theory loader: old-style ML proof scripts being *attached* to a thy
2730 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
2731 'use' within a theory file will do the job.
2733 * Name space merge now observes canonical order, i.e. the second space
2734 is inserted into the first one, while existing entries in the first
2735 space take precedence. INCOMPATIBILITY in rare situations, may try to
2736 swap theory imports.
2738 * Syntax: symbol \<chi> is now considered a letter. Potential
2739 INCOMPATIBILITY in identifier syntax etc.
2741 * Outer syntax: string tokens no longer admit escaped white space,
2742 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
2743 white space without escapes.
2745 * Outer syntax: string tokens may contain arbitrary character codes
2746 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
2752 * Context-dependent token translations. Default setup reverts locally
2753 fixed variables, and adds hilite markup for undeclared frees.
2755 * Unused theorems can be found using the new command 'unused_thms'.
2756 There are three ways of invoking it:
2759 Only finds unused theorems in the current theory.
2761 (2) unused_thms thy_1 ... thy_n -
2762 Finds unused theorems in the current theory and all of its ancestors,
2763 excluding the theories thy_1 ... thy_n and all of their ancestors.
2765 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
2766 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
2767 their ancestors, excluding the theories thy_1 ... thy_n and all of
2770 In order to increase the readability of the list produced by
2771 unused_thms, theorems that have been created by a particular instance
2772 of a theory command such as 'inductive' or 'function' are considered
2773 to belong to the same "group", meaning that if at least one theorem in
2774 this group is used, the other theorems in the same group are no longer
2775 reported as unused. Moreover, if all theorems in the group are
2776 unused, only one theorem in the group is displayed.
2778 Note that proof objects have to be switched on in order for
2779 unused_thms to work properly (i.e. !proofs must be >= 1, which is
2780 usually the case when using Proof General with the default settings).
2782 * Authentic naming of facts disallows ad-hoc overwriting of previous
2783 theorems within the same name space. INCOMPATIBILITY, need to remove
2784 duplicate fact bindings, or even accidental fact duplications. Note
2785 that tools may maintain dynamically scoped facts systematically, using
2786 PureThy.add_thms_dynamic.
2788 * Command 'hide' now allows to hide from "fact" name space as well.
2790 * Eliminated destructive theorem database, simpset, claset, and
2791 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
2792 update of theories within ML code.
2794 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2795 INCOMPATIBILITY, object-logics depending on former Pure require
2796 additional setup PureThy.old_appl_syntax_setup; object-logics
2797 depending on former CPure need to refer to Pure.
2799 * Commands 'use' and 'ML' are now purely functional, operating on
2800 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2801 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2804 * Command 'setup': discontinued implicit version with ML reference.
2806 * Instantiation target allows for simultaneous specification of class
2807 instance operations together with an instantiation proof.
2808 Type-checking phase allows to refer to class operations uniformly.
2809 See src/HOL/Complex/Complex.thy for an Isar example and
2810 src/HOL/Library/Eval.thy for an ML example.
2812 * Indexing of literal facts: be more serious about including only
2813 facts from the visible specification/proof context, but not the
2814 background context (locale etc.). Affects `prop` notation and method
2815 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2818 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2819 "(open)" option, which used to expose internal bound variables to the
2822 * Isar statements: removed obsolete case "rule_context".
2823 INCOMPATIBILITY, better use explicit fixes/assumes.
2825 * Locale proofs: default proof step now includes 'unfold_locales';
2826 hence 'proof' without argument may be used to unfold locale
2830 *** Document preparation ***
2832 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2833 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2834 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2835 spot); renamed link color from "darkblue" to "linkcolor" (default
2836 value unchanged, can be redefined via \definecolor); no longer sets
2837 "a4paper" option (unnecessary or even intrusive).
2839 * Antiquotation @{lemma A method} proves proposition A by the given
2840 method (either a method name or a method name plus (optional) method
2841 arguments in parentheses) and prints A just like @{prop A}.
2846 * New primrec package. Specification syntax conforms in style to
2847 definition/function/.... No separate induction rule is provided. The
2848 "primrec" command distinguishes old-style and new-style specifications
2849 by syntax. The former primrec package is now named OldPrimrecPackage.
2850 When adjusting theories, beware: constants stemming from new-style
2851 primrec specifications have authentic syntax.
2853 * Metis prover is now an order of magnitude faster, and also works
2854 with multithreading.
2856 * Metis: the maximum number of clauses that can be produced from a
2857 theorem is now given by the attribute max_clauses. Theorems that
2858 exceed this number are ignored, with a warning printed.
2860 * Sledgehammer no longer produces structured proofs by default. To
2861 enable, declare [[sledgehammer_full = true]]. Attributes
2862 reconstruction_modulus, reconstruction_sorts renamed
2863 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2865 * Method "induct_scheme" derives user-specified induction rules
2866 from well-founded induction and completeness of patterns. This factors
2867 out some operations that are done internally by the function package
2868 and makes them available separately. See
2869 src/HOL/ex/Induction_Scheme.thy for examples.
2871 * More flexible generation of measure functions for termination
2872 proofs: Measure functions can be declared by proving a rule of the
2873 form "is_measure f" and giving it the [measure_function] attribute.
2874 The "is_measure" predicate is logically meaningless (always true), and
2875 just guides the heuristic. To find suitable measure functions, the
2876 termination prover sets up the goal "is_measure ?f" of the appropriate
2877 type and generates all solutions by prolog-style backwards proof using
2880 This setup also deals with rules like
2882 "is_measure f ==> is_measure (list_size f)"
2884 which accommodates nested datatypes that recurse through lists.
2885 Similar rules are predeclared for products and option types.
2887 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2891 - Definitions of overloaded constants on sets have to be replaced by
2892 definitions on => and bool.
2894 - Some definitions of overloaded operators on sets can now be proved
2895 using the definitions of the operators on => and bool. Therefore,
2896 the following theorems have been renamed:
2898 subset_def -> subset_eq
2899 psubset_def -> psubset_eq
2900 set_diff_def -> set_diff_eq
2901 Compl_def -> Compl_eq
2902 Sup_set_def -> Sup_set_eq
2903 Inf_set_def -> Inf_set_eq
2904 sup_set_def -> sup_set_eq
2905 inf_set_def -> inf_set_eq
2907 - Due to the incompleteness of the HO unification algorithm, some
2908 rules such as subst may require manual instantiation, if some of
2909 the unknowns in the rule is a set.
2911 - Higher order unification and forward proofs:
2914 have "P (S::'a set)" <...>
2915 then have "EX S. P S" ..
2917 no longer works (due to the incompleteness of the HO unification
2918 algorithm) and must be replaced by the pattern
2925 - Calculational reasoning with subst (or similar rules):
2928 have "P (S::'a set)" <...>
2929 also have "S = T" <...>
2930 finally have "P T" .
2932 no longer works (for similar reasons as the previous example) and
2933 must be replaced by something like
2935 have "P (S::'a set)" <...>
2936 moreover have "S = T" <...>
2937 ultimately have "P T" by simp
2939 - Tactics or packages written in ML code:
2940 Code performing pattern matching on types via
2942 Type ("set", [T]) => ...
2944 must be rewritten. Moreover, functions like strip_type or
2945 binder_types no longer return the right value when applied to a
2948 T1 => ... => Tn => U => bool
2952 T1 => ... => Tn => U set
2954 * Merged theories Wellfounded_Recursion, Accessible_Part and
2955 Wellfounded_Relations to theory Wellfounded.
2957 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2959 * Class finite no longer treats UNIV as class parameter. Use class
2960 enum from theory Library/Enum instead to achieve a similar effect.
2963 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2964 and "Cons". INCOMPATIBILITY.
2966 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2967 Potential INCOMPATIBILITY.
2969 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2970 injective_fst_snd removed, use split_eta and prod_eqI instead.
2971 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2973 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2974 the same name in theory Orderings:
2984 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2985 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2986 and different variable names.
2988 * Library/Option_ord.thy: Canonical order on option type.
2990 * Library/RBT.thy: Red-black trees, an efficient implementation of
2993 * Library/Countable.thy: Type class for countable types.
2995 * Theory Int: The representation of numerals has changed. The infix
2996 operator BIT and the bit datatype with constructors B0 and B1 have
2997 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2998 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2999 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
3002 * Theory Nat: definition of <= and < on natural numbers no longer
3003 depend on well-founded relations. INCOMPATIBILITY. Definitions
3004 le_def and less_def have disappeared. Consider lemmas not_less
3005 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
3007 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
3008 (whose purpose mainly is for various fold_set functionals) have been
3009 abandoned in favor of the existing algebraic classes
3010 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
3011 lower_semilattice (resp. upper_semilattice) and linorder.
3014 * Theory Transitive_Closure: induct and cases rules now declare proper
3015 case_names ("base" and "step"). INCOMPATIBILITY.
3017 * Theorem Inductive.lfp_ordinal_induct generalized to complete
3018 lattices. The form set-specific version is available as
3019 Inductive.lfp_ordinal_induct_set.
3021 * Renamed theorems "power.simps" to "power_int.simps".
3024 * Class semiring_div provides basic abstract properties of semirings
3025 with division and modulo operations. Subsumes former class dvd_mod.
3027 * Merged theories IntDef, Numeral and IntArith into unified theory
3028 Int. INCOMPATIBILITY.
3030 * Theory Library/Code_Index: type "index" now represents natural
3031 numbers rather than integers. INCOMPATIBILITY.
3033 * New class "uminus" with operation "uminus" (split of from class
3034 "minus" which now only has operation "minus", binary).
3037 * Constants "card", "internal_split", "option_map" now with authentic
3038 syntax. INCOMPATIBILITY.
3040 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
3041 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
3042 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
3043 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
3044 Sup_set_def, le_def, less_def, option_map_def now with object
3045 equality. INCOMPATIBILITY.
3047 * Records. Removed K_record, and replaced it by pure lambda term
3048 %x. c. The simplifier setup is now more robust against eta expansion.
3049 INCOMPATIBILITY: in cases explicitly referring to K_record.
3051 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
3053 * Library/ListVector: new theory of arithmetic vector operations.
3055 * Library/Order_Relation: new theory of various orderings as sets of
3056 pairs. Defines preorders, partial orders, linear orders and
3057 well-orders on sets and on types.
3062 * Renamed some theories to allow to loading both ZF and HOL in the
3065 Datatype -> Datatype_ZF
3066 Inductive -> Inductive_ZF
3073 INCOMPATIBILITY: ZF theories that import individual theories below
3074 Main might need to be adapted. Regular theory Main is still
3075 available, as trivial extension of Main_ZF.
3080 * ML within Isar: antiquotation @{const name} or @{const
3081 name(typargs)} produces statically-checked Const term.
3083 * Functor NamedThmsFun: data is available to the user as dynamic fact
3084 (of the same name). Removed obsolete print command.
3086 * Removed obsolete "use_legacy_bindings" function.
3088 * The ``print mode'' is now a thread-local value derived from a global
3089 template (the former print_mode reference), thus access becomes
3090 non-critical. The global print_mode reference is for session
3091 management only; user-code should use print_mode_value,
3092 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
3094 * Functions system/system_out provide a robust way to invoke external
3095 shell commands, with propagation of interrupts (requires Poly/ML
3096 5.2.1). Do not use OS.Process.system etc. from the basis library!
3101 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
3102 in accordance with Proof General 3.7, which prefers GNU emacs.
3104 * isatool tty runs Isabelle process with plain tty interaction;
3105 optional line editor may be specified via ISABELLE_LINE_EDITOR
3106 setting, the default settings attempt to locate "ledit" and "rlwrap".
3108 * isatool browser now works with Cygwin as well, using general
3109 "javapath" function defined in Isabelle process environment.
3111 * YXML notation provides a simple and efficient alternative to
3112 standard XML transfer syntax. See src/Pure/General/yxml.ML and
3113 isatool yxml as described in the Isabelle system manual.
3115 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
3116 provides general wrapper for managing an Isabelle process in a robust
3117 fashion, with ``cooked'' output from stdin/stderr.
3119 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
3120 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
3122 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
3123 way of changing the user's settings is via
3124 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
3127 * Multithreading.max_threads := 0 refers to the number of actual CPU
3128 cores of the underlying machine, which is a good starting point for
3129 optimal performance tuning. The corresponding usedir option -M allows
3130 "max" as an alias for "0". WARNING: does not work on certain versions
3131 of Mac OS (with Poly/ML 5.1).
3133 * isabelle-process: non-ML sessions are run with "nice", to reduce the
3134 adverse effect of Isabelle flooding interactive front-ends (notably
3135 ProofGeneral / XEmacs).
3139 New in Isabelle2007 (November 2007)
3140 -----------------------------------
3144 * More uniform information about legacy features, notably a
3145 warning/error of "Legacy feature: ...", depending on the state of the
3146 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
3147 legacy features will disappear eventually.
3149 * Theory syntax: the header format ``theory A = B + C:'' has been
3150 discontinued in favour of ``theory A imports B C begin''. Use isatool
3151 fixheaders to convert existing theory files. INCOMPATIBILITY.
3153 * Theory syntax: the old non-Isar theory file format has been
3154 discontinued altogether. Note that ML proof scripts may still be used
3155 with Isar theories; migration is usually quite simple with the ML
3156 function use_legacy_bindings. INCOMPATIBILITY.
3158 * Theory syntax: some popular names (e.g. 'class', 'declaration',
3159 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
3162 * Theory loader: be more serious about observing the static theory
3163 header specifications (including optional directories), but not the
3164 accidental file locations of previously successful loads. The strict
3165 update policy of former update_thy is now already performed by
3166 use_thy, so the former has been removed; use_thys updates several
3167 theories simultaneously, just as 'imports' within a theory header
3168 specification, but without merging the results. Potential
3169 INCOMPATIBILITY: may need to refine theory headers and commands
3170 ROOT.ML which depend on load order.
3172 * Theory loader: optional support for content-based file
3173 identification, instead of the traditional scheme of full physical
3174 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
3175 (cf. the system manual). The new scheme allows to work with
3176 non-finished theories in persistent session images, such that source
3177 files may be moved later on without requiring reloads.
3179 * Theory loader: old-style ML proof scripts being *attached* to a thy
3180 file (with the same base name as the theory) are considered a legacy
3181 feature, which will disappear eventually. Even now, the theory loader
3182 no longer maintains dependencies on such files.
3184 * Syntax: the scope for resolving ambiguities via type-inference is
3185 now limited to individual terms, instead of whole simultaneous
3186 specifications as before. This greatly reduces the complexity of the
3187 syntax module and improves flexibility by separating parsing and
3188 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
3189 'fixes' etc.) are required in rare situations.
3191 * Syntax: constants introduced by new-style packages ('definition',
3192 'abbreviation' etc.) are passed through the syntax module in
3193 ``authentic mode''. This means that associated mixfix annotations
3194 really stick to such constants, independently of potential name space
3195 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
3196 trees are represented slightly differently, may need to adapt syntax
3197 translations accordingly. Use CONST marker in 'translations' and
3198 @{const_syntax} antiquotation in 'parse_translation' etc.
3200 * Legacy goal package: reduced interface to the bare minimum required
3201 to keep existing proof scripts running. Most other user-level
3202 functions are now part of the OldGoals structure, which is *not* open
3203 by default (consider isatool expandshort before open OldGoals).
3204 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
3205 these tend to cause confusion about the actual goal (!) context being
3206 used here, which is not necessarily the same as the_context().
3208 * Command 'find_theorems': supports "*" wild-card in "name:"
3209 criterion; "with_dups" option. Certain ProofGeneral versions might
3210 support a specific search form (see ProofGeneral/CHANGES).
3212 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
3213 by default, which means that "prems" (and also "fixed variables") are
3214 suppressed from proof state output. Note that the ProofGeneral
3215 settings mechanism allows to change and save options persistently, but
3216 older versions of Isabelle will fail to start up if a negative prems
3219 * Local theory targets may be specified by non-nested blocks of
3220 ``context/locale/class ... begin'' followed by ``end''. The body may
3221 contain definitions, theorems etc., including any derived mechanism
3222 that has been implemented on top of these primitives. This concept
3223 generalizes the existing ``theorem (in ...)'' towards more versatility
3226 * Proof General interface: proper undo of final 'end' command;
3227 discontinued Isabelle/classic mode (ML proof scripts).
3230 *** Document preparation ***
3232 * Added antiquotation @{theory name} which prints the given name,
3233 after checking that it refers to a valid ancestor theory in the
3236 * Added antiquotations @{ML_type text} and @{ML_struct text} which
3237 check the given source text as ML type/structure, printing verbatim.
3239 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
3240 "c args == rhs" given in the current context. (Any number of
3241 arguments may be given on the LHS.)
3246 * The 'class' package offers a combination of axclass and locale to
3247 achieve Haskell-like type classes in Isabelle. Definitions and
3248 theorems within a class context produce both relative results (with
3249 implicit parameters according to the locale context), and polymorphic
3250 constants with qualified polymorphism (according to the class
3251 context). Within the body context of a 'class' target, a separate
3252 syntax layer ("user space type system") takes care of converting
3253 between global polymorphic consts and internal locale representation.
3254 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
3255 "isatool doc classes" provides a tutorial.
3257 * Generic code generator framework allows to generate executable
3258 code for ML and Haskell (including Isabelle classes). A short usage
3261 internal compilation:
3262 export_code <list of constants (term syntax)> in SML
3263 writing SML code to a file:
3264 export_code <list of constants (term syntax)> in SML <filename>
3265 writing OCaml code to a file:
3266 export_code <list of constants (term syntax)> in OCaml <filename>
3267 writing Haskell code to a bunch of files:
3268 export_code <list of constants (term syntax)> in Haskell <filename>
3270 evaluating closed propositions to True/False using code generation:
3273 Reasonable default setup of framework in HOL.
3275 Theorem attributs for selecting and transforming function equations theorems:
3277 [code fun]: select a theorem as function equation for a specific constant
3278 [code fun del]: deselect a theorem as function equation for a specific constant
3279 [code inline]: select an equation theorem for unfolding (inlining) in place
3280 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
3282 User-defined serializations (target in {SML, OCaml, Haskell}):
3284 code_const <and-list of constants (term syntax)>
3285 {(target) <and-list of const target syntax>}+
3287 code_type <and-list of type constructors>
3288 {(target) <and-list of type target syntax>}+
3290 code_instance <and-list of instances>
3292 where instance ::= <type constructor> :: <class>
3294 code_class <and_list of classes>
3295 {(target) <and-list of class target syntax>}+
3296 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
3298 code_instance and code_class only are effective to target Haskell.
3300 For example usage see src/HOL/ex/Codegenerator.thy and
3301 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
3302 generation from Isabelle/HOL theories is available via "isatool doc
3305 * Code generator: consts in 'consts_code' Isar commands are now
3306 referred to by usual term syntax (including optional type
3309 * Command 'no_translations' removes translation rules from theory
3312 * Overloaded definitions are now actually checked for acyclic
3313 dependencies. The overloading scheme is slightly more general than
3314 that of Haskell98, although Isabelle does not demand an exact
3315 correspondence to type class and instance declarations.
3316 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
3317 exotic versions of overloading -- at the discretion of the user!
3319 Polymorphic constants are represented via type arguments, i.e. the
3320 instantiation that matches an instance against the most general
3321 declaration given in the signature. For example, with the declaration
3322 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
3323 as c(nat). Overloading is essentially simultaneous structural
3324 recursion over such type arguments. Incomplete specification patterns
3325 impose global constraints on all occurrences, e.g. c('a * 'a) on the
3326 LHS means that more general c('a * 'b) will be disallowed on any RHS.
3327 Command 'print_theory' outputs the normalized system of recursive
3328 equations, see section "definitions".
3330 * Configuration options are maintained within the theory or proof
3331 context (with name and type bool/int/string), providing a very simple
3332 interface to a poor-man's version of general context data. Tools may
3333 declare options in ML (e.g. using Attrib.config_int) and then refer to
3334 these values using Config.get etc. Users may change options via an
3335 associated attribute of the same name. This form of context
3336 declaration works particularly well with commands 'declare' or
3337 'using', for example ``declare [[foo = 42]]''. Thus it has become
3338 very easy to avoid global references, which would not observe Isar
3339 toplevel undo/redo and fail to work with multithreading.
3341 Various global ML references of Pure and HOL have been turned into
3342 configuration options:
3344 Unify.search_bound unify_search_bound
3345 Unify.trace_bound unify_trace_bound
3346 Unify.trace_simp unify_trace_simp
3347 Unify.trace_types unify_trace_types
3348 Simplifier.simp_depth_limit simp_depth_limit
3349 Blast.depth_limit blast_depth_limit
3350 DatatypeProp.dtK datatype_distinctness_limit
3351 fast_arith_neq_limit fast_arith_neq_limit
3352 fast_arith_split_limit fast_arith_split_limit
3354 * Named collections of theorems may be easily installed as context
3355 data using the functor NamedThmsFun (see also
3356 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
3357 attributes; there is also a toplevel print command. This facility is
3358 just a common case of general context data, which is the preferred way
3359 for anything more complex than just a list of facts in canonical
3362 * Isar: command 'declaration' augments a local theory by generic
3363 declaration functions written in ML. This enables arbitrary content
3364 being added to the context, depending on a morphism that tells the
3365 difference of the original declaration context wrt. the application
3366 context encountered later on.
3368 * Isar: proper interfaces for simplification procedures. Command
3369 'simproc_setup' declares named simprocs (with match patterns, and body
3370 text in ML). Attribute "simproc" adds/deletes simprocs in the current
3371 context. ML antiquotation @{simproc name} retrieves named simprocs.
3373 * Isar: an extra pair of brackets around attribute declarations
3374 abbreviates a theorem reference involving an internal dummy fact,
3375 which will be ignored later --- only the effect of the attribute on
3376 the background context will persist. This form of in-place
3377 declarations is particularly useful with commands like 'declare' and
3378 'using', for example ``have A using [[simproc a]] by simp''.
3380 * Isar: method "assumption" (and implicit closing of subproofs) now
3381 takes simple non-atomic goal assumptions into account: after applying
3382 an assumption as a rule the resulting subgoals are solved by atomic
3383 assumption steps. This is particularly useful to finish 'obtain'
3384 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
3385 without referring to the original premise "!!x. P x ==> thesis" in the
3386 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
3389 * Isar: implicit use of prems from the Isar proof context is
3390 considered a legacy feature. Common applications like ``have A .''
3391 may be replaced by ``have A by fact'' or ``note `A`''. In general,
3392 referencing facts explicitly here improves readability and
3393 maintainability of proof texts.
3395 * Isar: improper proof element 'guess' is like 'obtain', but derives
3396 the obtained context from the course of reasoning! For example:
3398 assume "EX x y. A x & B y" -- "any previous fact"
3399 then guess x and y by clarify
3401 This technique is potentially adventurous, depending on the facts and
3402 proof tools being involved here.
3404 * Isar: known facts from the proof context may be specified as literal
3405 propositions, using ASCII back-quote syntax. This works wherever
3406 named facts used to be allowed so far, in proof commands, proof
3407 methods, attributes etc. Literal facts are retrieved from the context
3408 according to unification of type and term parameters. For example,
3409 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
3410 theorems in the current context, then these are valid literal facts:
3411 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
3413 There is also a proof method "fact" which does the same composition
3414 for explicit goal states, e.g. the following proof texts coincide with
3415 certain special cases of literal facts:
3417 have "A" by fact == note `A`
3418 have "A ==> B" by fact == note `A ==> B`
3419 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
3420 have "P a ==> Q a" by fact == note `P a ==> Q a`
3422 * Isar: ":" (colon) is no longer a symbolic identifier character in
3423 outer syntax. Thus symbolic identifiers may be used without
3424 additional white space in declarations like this: ``assume *: A''.
3426 * Isar: 'print_facts' prints all local facts of the current context,
3427 both named and unnamed ones.
3429 * Isar: 'def' now admits simultaneous definitions, e.g.:
3431 def x == "t" and y == "u"
3433 * Isar: added command 'unfolding', which is structurally similar to
3434 'using', but affects both the goal state and facts by unfolding given
3435 rewrite rules. Thus many occurrences of the 'unfold' method or
3436 'unfolded' attribute may be replaced by first-class proof text.
3438 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
3439 and command 'unfolding' now all support object-level equalities
3440 (potentially conditional). The underlying notion of rewrite rule is
3441 analogous to the 'rule_format' attribute, but *not* that of the
3442 Simplifier (which is usually more generous).
3444 * Isar: the new attribute [rotated n] (default n = 1) rotates the
3445 premises of a theorem by n. Useful in conjunction with drule.
3447 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
3448 method expression within a sandbox consisting of the first N
3449 sub-goals, which need to exist. For example, ``simp_all [3]''
3450 simplifies the first three sub-goals, while (rule foo, simp_all)[]
3451 simplifies all new goals that emerge from applying rule foo to the
3452 originally first one.
3454 * Isar: schematic goals are no longer restricted to higher-order
3455 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
3458 * Isar: the conclusion of a long theorem statement is now either
3459 'shows' (a simultaneous conjunction, as before), or 'obtains'
3460 (essentially a disjunction of cases with local parameters and
3461 assumptions). The latter allows to express general elimination rules
3462 adequately; in this notation common elimination rules look like this:
3464 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
3466 obtains x where "P x"
3468 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
3472 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
3478 The subsequent classical rules even refer to the formal "thesis"
3481 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
3484 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
3485 obtains "thesis ==> something"
3487 The actual proof of an 'obtains' statement is analogous to that of the
3488 Isar proof element 'obtain', only that there may be several cases.
3489 Optional case names may be specified in parentheses; these will be
3490 available both in the present proof and as annotations in the
3491 resulting rule, for later use with the 'cases' method (cf. attribute
3494 * Isar: the assumptions of a long theorem statement are available as
3495 "assms" fact in the proof context. This is more appropriate than the
3496 (historical) "prems", which refers to all assumptions of the current
3497 context, including those from the target locale, proof body etc.
3499 * Isar: 'print_statement' prints theorems from the current theory or
3500 proof context in long statement form, according to the syntax of a
3503 * Isar: 'obtain' takes an optional case name for the local context
3504 introduction rule (default "that").
3506 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
3507 explicit (is "_ ==> ?foo") in the rare cases where this still happens
3510 * Pure: syntax "CONST name" produces a fully internalized constant
3511 according to the current context. This is particularly useful for
3512 syntax translations that should refer to internal constant
3513 representations independently of name spaces.
3515 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
3516 instead of "FOO ". This allows multiple binder declarations to coexist
3517 in the same context. INCOMPATIBILITY.
3519 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
3520 primitive that also works in a locale context (both for constants and
3521 fixed variables). Type declaration and internal syntactic representation
3522 of given constants retrieved from the context. Likewise, the
3523 'no_notation' command allows to remove given syntax annotations from the
3526 * Isar/locales: new derived specification elements 'axiomatization',
3527 'definition', 'abbreviation', which support type-inference, admit
3528 object-level specifications (equality, equivalence). See also the
3529 isar-ref manual. Examples:
3532 eq (infix "===" 50) where
3533 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
3535 definition "f x y = x + y + 1"
3536 definition g where "g x = f x x"
3539 neq (infix "=!=" 50) where
3540 "x =!= y == ~ (x === y)"
3542 These specifications may be also used in a locale context. Then the
3543 constants being introduced depend on certain fixed parameters, and the
3544 constant name is qualified by the locale base name. An internal
3545 abbreviation takes care for convenient input and output, making the
3546 parameters implicit and using the original short name. See also
3547 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
3548 entities from a monomorphic theory.
3550 Presently, abbreviations are only available 'in' a target locale, but
3551 not inherited by general import expressions. Also note that
3552 'abbreviation' may be used as a type-safe replacement for 'syntax' +
3553 'translations' in common applications. The "no_abbrevs" print mode
3554 prevents folding of abbreviations in term output.
3556 Concrete syntax is attached to specified constants in internal form,
3557 independently of name spaces. The parse tree representation is
3558 slightly different -- use 'notation' instead of raw 'syntax', and
3559 'translations' with explicit "CONST" markup to accommodate this.
3561 * Pure/Isar: unified syntax for new-style specification mechanisms
3562 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
3563 full type inference and dummy patterns ("_"). For example:
3565 definition "K x _ = x"
3567 inductive conj for A B
3568 where "A ==> B ==> conj A B"
3570 * Pure: command 'print_abbrevs' prints all constant abbreviations of
3571 the current context. Print mode "no_abbrevs" prevents inversion of
3572 abbreviations on output.
3574 * Isar/locales: improved parameter handling: use of locales "var" and
3575 "struct" no longer necessary; - parameter renamings are no longer
3576 required to be injective. For example, this allows to define
3577 endomorphisms as locale endom = homom mult mult h.
3579 * Isar/locales: changed the way locales with predicates are defined.
3580 Instead of accumulating the specification, the imported expression is
3581 now an interpretation. INCOMPATIBILITY: different normal form of
3582 locale expressions. In particular, in interpretations of locales with
3583 predicates, goals repesenting already interpreted fragments are not
3584 removed automatically. Use methods `intro_locales' and
3585 `unfold_locales'; see below.
3587 * Isar/locales: new methods `intro_locales' and `unfold_locales'
3588 provide backward reasoning on locales predicates. The methods are
3589 aware of interpretations and discharge corresponding goals.
3590 `intro_locales' is less aggressive then `unfold_locales' and does not
3591 unfold predicates to assumptions.
3593 * Isar/locales: the order in which locale fragments are accumulated
3594 has changed. This enables to override declarations from fragments due
3595 to interpretations -- for example, unwanted simp rules.
3597 * Isar/locales: interpretation in theories and proof contexts has been
3598 extended. One may now specify (and prove) equations, which are
3599 unfolded in interpreted theorems. This is useful for replacing
3600 defined concepts (constants depending on locale parameters) by
3601 concepts already existing in the target context. Example:
3603 interpretation partial_order ["op <= :: [int, int] => bool"]
3604 where "partial_order.less (op <=) (x::int) y = (x < y)"
3606 Typically, the constant `partial_order.less' is created by a
3607 definition specification element in the context of locale
3610 * Method "induct": improved internal context management to support
3611 local fixes and defines on-the-fly. Thus explicit meta-level
3612 connectives !! and ==> are rarely required anymore in inductive goals
3613 (using object-logic connectives for this purpose has been long
3614 obsolete anyway). Common proof patterns are explained in
3615 src/HOL/Induct/Common_Patterns.thy, see also
3616 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
3619 * Method "induct": improved handling of simultaneous goals. Instead of
3620 introducing object-level conjunction, the statement is now split into
3621 several conclusions, while the corresponding symbolic cases are nested
3622 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
3623 see src/HOL/Induct/Common_Patterns.thy, for example.
3625 * Method "induct": mutual induction rules are now specified as a list
3626 of rule sharing the same induction cases. HOL packages usually provide
3627 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
3628 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
3629 mutual induction rules differently, i.e. like this:
3631 (induct rule: foo_bar.inducts)
3632 (induct set: foo bar)
3633 (induct pred: foo bar)
3634 (induct type: foo bar)
3636 The ML function ProjectRule.projections turns old-style rules into the
3639 * Method "coinduct": dual of induction, see
3640 src/HOL/Library/Coinductive_List.thy for various examples.
3642 * Method "cases", "induct", "coinduct": the ``(open)'' option is
3643 considered a legacy feature.
3645 * Attribute "symmetric" produces result with standardized schematic
3646 variables (index 0). Potential INCOMPATIBILITY.
3648 * Simplifier: by default the simplifier trace only shows top level
3649 rewrites now. That is, trace_simp_depth_limit is set to 1 by
3650 default. Thus there is less danger of being flooded by the trace. The
3651 trace indicates where parts have been suppressed.
3653 * Provers/classical: removed obsolete classical version of elim_format
3654 attribute; classical elim/dest rules are now treated uniformly when
3655 manipulating the claset.
3657 * Provers/classical: stricter checks to ensure that supplied intro,
3658 dest and elim rules are well-formed; dest and elim rules must have at
3661 * Provers/classical: attributes dest/elim/intro take an optional
3662 weight argument for the rule (just as the Pure versions). Weights are
3663 ignored by automated tools, but determine the search order of single
3666 * Syntax: input syntax now supports dummy variable binding "%_. b",
3667 where the body does not mention the bound variable. Note that dummy
3668 patterns implicitly depend on their context of bounds, which makes
3669 "{_. _}" match any set comprehension as expected. Potential
3670 INCOMPATIBILITY -- parse translations need to cope with syntactic
3671 constant "_idtdummy" in the binding position.
3673 * Syntax: removed obsolete syntactic constant "_K" and its associated
3674 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
3675 for example "A -> B" => "Pi A (%_. B)".
3677 * Pure: 'class_deps' command visualizes the subclass relation, using
3678 the graph browser tool.
3680 * Pure: 'print_theory' now suppresses certain internal declarations by
3681 default; use '!' option for full details.
3686 * Method "metis" proves goals by applying the Metis general-purpose
3687 resolution prover (see also http://gilith.com/software/metis/).
3688 Examples are in the directory MetisExamples. WARNING: the
3689 Isabelle/HOL-Metis integration does not yet work properly with
3692 * Command 'sledgehammer' invokes external automatic theorem provers as
3693 background processes. It generates calls to the "metis" method if
3694 successful. These can be pasted into the proof. Users do not have to
3695 wait for the automatic provers to return. WARNING: does not really
3696 work with multi-threading.
3698 * New "auto_quickcheck" feature tests outermost goal statements for
3699 potential counter-examples. Controlled by ML references
3700 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
3701 5000 milliseconds). Fails silently if statements is outside of
3702 executable fragment, or any other codgenerator problem occurs.
3704 * New constant "undefined" with axiom "undefined x = undefined".
3706 * Added class "HOL.eq", allowing for code generation with polymorphic
3709 * Some renaming of class constants due to canonical name prefixing in
3710 the new 'class' package:
3712 HOL.abs ~> HOL.abs_class.abs
3713 HOL.divide ~> HOL.divide_class.divide
3714 0 ~> HOL.zero_class.zero
3715 1 ~> HOL.one_class.one
3716 op + ~> HOL.plus_class.plus
3717 op - ~> HOL.minus_class.minus
3718 uminus ~> HOL.minus_class.uminus
3719 op * ~> HOL.times_class.times
3720 op < ~> HOL.ord_class.less
3721 op <= > HOL.ord_class.less_eq
3722 Nat.power ~> Power.power_class.power
3723 Nat.size ~> Nat.size_class.size
3724 Numeral.number_of ~> Numeral.number_class.number_of
3725 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
3726 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
3727 Orderings.min ~> Orderings.ord_class.min
3728 Orderings.max ~> Orderings.ord_class.max
3729 Divides.op div ~> Divides.div_class.div
3730 Divides.op mod ~> Divides.div_class.mod
3731 Divides.op dvd ~> Divides.div_class.dvd
3733 INCOMPATIBILITY. Adaptions may be required in the following cases:
3735 a) User-defined constants using any of the names "plus", "minus",
3736 "times", "less" or "less_eq". The standard syntax translations for
3737 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
3740 b) Variables named "plus", "minus", "times", "less", "less_eq"
3741 INCOMPATIBILITY: use more specific names.
3743 c) Permutative equations (e.g. "a + b = b + a")
3744 Since the change of names also changes the order of terms, permutative
3745 rewrite rules may get applied in a different order. Experience shows
3746 that this is rarely the case (only two adaptions in the whole Isabelle
3747 distribution). INCOMPATIBILITY: rewrite proofs
3749 d) ML code directly refering to constant names
3750 This in general only affects hand-written proof tactics, simprocs and
3751 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
3752 Consider using @{const_name} antiquotation.
3754 * New class "default" with associated constant "default".
3756 * Function "sgn" is now overloaded and available on int, real, complex
3757 (and other numeric types), using class "sgn". Two possible defs of
3758 sgn are given as equational assumptions in the classes sgn_if and
3759 sgn_div_norm; ordered_idom now also inherits from sgn_if.
3762 * Locale "partial_order" now unified with class "order" (cf. theory
3763 Orderings), added parameter "less". INCOMPATIBILITY.
3765 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
3766 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
3767 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
3769 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
3770 changed order of proof goals in instance proofs.
3772 * The transitivity reasoner for partial and linear orders is set up
3773 for classes "order" and "linorder". Instances of the reasoner are available
3774 in all contexts importing or interpreting the corresponding locales.
3775 Method "order" invokes the reasoner separately; the reasoner
3776 is also integrated with the Simplifier as a solver. Diagnostic
3777 command 'print_orders' shows the available instances of the reasoner
3778 in the current context.
3780 * Localized monotonicity predicate in theory "Orderings"; integrated
3781 lemmas max_of_mono and min_of_mono with this predicate.
3784 * Formulation of theorem "dense" changed slightly due to integration
3785 with new class dense_linear_order.
3787 * Uniform lattice theory development in HOL.
3789 constants "meet" and "join" now named "inf" and "sup"
3790 constant "Meet" now named "Inf"
3792 classes "meet_semilorder" and "join_semilorder" now named
3793 "lower_semilattice" and "upper_semilattice"
3794 class "lorder" now named "lattice"
3795 class "comp_lat" now named "complete_lattice"
3797 Instantiation of lattice classes allows explicit definitions
3798 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3800 INCOMPATIBILITY. Theorem renames:
3802 meet_left_le ~> inf_le1
3803 meet_right_le ~> inf_le2
3804 join_left_le ~> sup_ge1
3805 join_right_le ~> sup_ge2
3806 meet_join_le ~> inf_sup_ord
3809 le_meet ~> le_inf_iff
3810 le_join ~> ge_sup_conv
3811 meet_idempotent ~> inf_idem
3812 join_idempotent ~> sup_idem
3813 meet_comm ~> inf_commute
3814 join_comm ~> sup_commute
3815 meet_leI1 ~> le_infI1
3816 meet_leI2 ~> le_infI2
3817 le_joinI1 ~> le_supI1
3818 le_joinI2 ~> le_supI2
3819 meet_assoc ~> inf_assoc
3820 join_assoc ~> sup_assoc
3821 meet_left_comm ~> inf_left_commute
3822 meet_left_idempotent ~> inf_left_idem
3823 join_left_comm ~> sup_left_commute
3824 join_left_idempotent ~> sup_left_idem
3827 le_def_meet ~> le_iff_inf
3828 le_def_join ~> le_iff_sup
3829 join_absorp2 ~> sup_absorb2
3830 join_absorp1 ~> sup_absorb1
3831 meet_absorp1 ~> inf_absorb1
3832 meet_absorp2 ~> inf_absorb2
3833 meet_join_absorp ~> inf_sup_absorb
3834 join_meet_absorp ~> sup_inf_absorb
3835 distrib_join_le ~> distrib_sup_le
3836 distrib_meet_le ~> distrib_inf_le
3838 add_meet_distrib_left ~> add_inf_distrib_left
3839 add_join_distrib_left ~> add_sup_distrib_left
3840 is_join_neg_meet ~> is_join_neg_inf
3841 is_meet_neg_join ~> is_meet_neg_sup
3842 add_meet_distrib_right ~> add_inf_distrib_right
3843 add_join_distrib_right ~> add_sup_distrib_right
3844 add_meet_join_distribs ~> add_sup_inf_distribs
3845 join_eq_neg_meet ~> sup_eq_neg_inf
3846 meet_eq_neg_join ~> inf_eq_neg_sup
3847 add_eq_meet_join ~> add_eq_inf_sup
3848 meet_0_imp_0 ~> inf_0_imp_0
3849 join_0_imp_0 ~> sup_0_imp_0
3850 meet_0_eq_0 ~> inf_0_eq_0
3851 join_0_eq_0 ~> sup_0_eq_0
3852 neg_meet_eq_join ~> neg_inf_eq_sup
3853 neg_join_eq_meet ~> neg_sup_eq_inf
3854 join_eq_if ~> sup_eq_if
3856 mono_meet ~> mono_inf
3857 mono_join ~> mono_sup
3858 meet_bool_eq ~> inf_bool_eq
3859 join_bool_eq ~> sup_bool_eq
3860 meet_fun_eq ~> inf_fun_eq
3861 join_fun_eq ~> sup_fun_eq
3862 meet_set_eq ~> inf_set_eq
3863 join_set_eq ~> sup_set_eq
3864 meet1_iff ~> inf1_iff
3865 meet2_iff ~> inf2_iff
3874 join1_iff ~> sup1_iff
3875 join2_iff ~> sup2_iff
3885 is_meet_Meet ~> is_meet_Inf
3886 Meet_bool_def ~> Inf_bool_def
3887 Meet_fun_def ~> Inf_fun_def
3888 Meet_greatest ~> Inf_greatest
3889 Meet_lower ~> Inf_lower
3890 Meet_set_def ~> Inf_set_def
3893 Sup_bool_eq ~> Sup_bool_def
3894 Sup_fun_eq ~> Sup_fun_def
3895 Sup_set_eq ~> Sup_set_def
3897 listsp_meetI ~> listsp_infI
3898 listsp_meet_eq ~> listsp_inf_eq
3903 * Added syntactic class "size"; overloaded constant "size" now has
3904 type "'a::size ==> bool"
3906 * Internal reorganisation of `size' of datatypes: size theorems
3907 "foo.size" are no longer subsumed by "foo.simps" (but are still
3908 simplification rules by default!); theorems "prod.size" now named
3911 * Class "div" now inherits from class "times" rather than "type".
3914 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3915 Linorder etc. have disappeared; operations defined in terms of
3916 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3918 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3920 * HOL-Word: New extensive library and type for generic, fixed size
3921 machine words, with arithemtic, bit-wise, shifting and rotating
3922 operations, reflection into int, nat, and bool lists, automation for
3923 linear arithmetic (by automatic reflection into nat or int), including
3924 lemmas on overflow and monotonicity. Instantiated to all appropriate
3925 arithmetic type classes, supporting automatic simplification of
3926 numerals on all operations.
3928 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3930 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3932 * Code generator library theories:
3933 - Code_Integer represents HOL integers by big integer literals in target
3935 - Code_Char represents HOL characters by character literals in target
3937 - Code_Char_chr like Code_Char, but also offers treatment of character
3938 codes; includes Code_Integer.
3939 - Executable_Set allows to generate code for finite sets using lists.
3940 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3942 - Executable_Real implements a subset of real numbers, namly those
3943 representable by rational numbers.
3944 - Efficient_Nat implements natural numbers by integers, which in general will
3945 result in higher efficency; pattern matching with 0/Suc is eliminated;
3946 includes Code_Integer.
3947 - Code_Index provides an additional datatype index which is mapped to
3948 target-language built-in integers.
3949 - Code_Message provides an additional datatype message_string which is isomorphic to
3950 strings; messages are mapped to target-language strings.
3952 * New package for inductive predicates
3954 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3957 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3958 for z_1 :: U_1 and ... and z_n :: U_m
3960 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3963 with full support for type-inference, rather than
3965 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3967 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3968 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3970 inductive "s z_1 ... z_m"
3972 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3975 For backward compatibility, there is a wrapper allowing inductive
3976 sets to be defined with the new package via
3979 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3980 for z_1 :: U_1 and ... and z_n :: U_m
3982 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3988 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3989 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3990 for z_1 :: U_1 and ... and z_n :: U_m
3992 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3993 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3996 if the additional syntax "p ..." is required.
3998 Numerous examples can be found in the subdirectories src/HOL/Auth,
3999 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
4003 - Since declaration and definition of inductive sets or predicates
4004 is no longer separated, abbreviations involving the newly
4005 introduced sets or predicates must be specified together with the
4006 introduction rules after the 'where' keyword (see above), rather
4007 than before the actual inductive definition.
4009 - The variables in induction and elimination rules are now
4010 quantified in the order of their occurrence in the introduction
4011 rules, rather than in alphabetical order. Since this may break
4012 some proofs, these proofs either have to be repaired, e.g. by
4013 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
4014 statements of the form
4016 case (rule_i a_i_1 ... a_i_{k_i})
4018 or the old order of quantification has to be restored by explicitly adding
4019 meta-level quantifiers in the introduction rules, i.e.
4021 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
4023 - The format of the elimination rules is now
4025 p z_1 ... z_m x_1 ... x_n ==>
4026 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4031 (x_1, ..., x_n) : s z_1 ... z_m ==>
4032 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4035 for sets rather than
4037 x : s z_1 ... z_m ==>
4038 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
4041 This may require terms in goals to be expanded to n-tuples
4042 (e.g. using case_tac or simplification with the split_paired_all
4043 rule) before the above elimination rule is applicable.
4045 - The elimination or case analysis rules for (mutually) inductive
4046 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
4047 list of rules "p_1_..._p_k.elims" is no longer available.
4049 * New package "function"/"fun" for general recursive functions,
4050 supporting mutual and nested recursion, definitions in local contexts,
4051 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
4052 for small examples, and the separate tutorial on the function
4053 package. The old recdef "package" is still available as before, but
4054 users are encouraged to use the new package.
4056 * Method "lexicographic_order" automatically synthesizes termination
4057 relations as lexicographic combinations of size measures.
4059 * Case-expressions allow arbitrary constructor-patterns (including
4060 "_") and take their order into account, like in functional
4061 programming. Internally, this is translated into nested
4062 case-expressions; missing cases are added and mapped to the predefined
4063 constant "undefined". In complicated cases printing may no longer show
4064 the original input but the internal form. Lambda-abstractions allow
4065 the same form of pattern matching: "% pat1 => e1 | ..." is an
4066 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
4069 * IntDef: The constant "int :: nat => int" has been removed; now "int"
4070 is an abbreviation for "of_nat :: nat => int". The simplification
4071 rules for "of_nat" have been changed to work like "int" did
4072 previously. Potential INCOMPATIBILITY:
4073 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
4074 - of_nat_diff and of_nat_mult are no longer default simp rules
4076 * Method "algebra" solves polynomial equations over (semi)rings using
4077 Groebner bases. The (semi)ring structure is defined by locales and the
4078 tool setup depends on that generic context. Installing the method for
4079 a specific type involves instantiating the locale and possibly adding
4080 declarations for computation on the coefficients. The method is
4081 already instantiated for natural numbers and for the axiomatic class
4082 of idoms with numerals. See also the paper by Chaieb and Wenzel at
4083 CALCULEMUS 2007 for the general principles underlying this
4084 architecture of context-aware proof-tools.
4086 * Method "ferrack" implements quantifier elimination over
4087 special-purpose dense linear orders using locales (analogous to
4088 "algebra"). The method is already installed for class
4089 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
4092 * Former constant "List.op @" now named "List.append". Use ML
4093 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
4094 circumvent possible incompatibilities when working on ML level.
4096 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
4098 * New function listsum :: 'a list => 'a for arbitrary monoids.
4099 Special syntax: "SUM x <- xs. f x" (and latex variants)
4101 * New syntax for Haskell-like list comprehension (input only), eg.
4102 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
4104 * The special syntax for function "filter" has changed from [x :
4105 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
4106 comprehension syntax, and for uniformity. INCOMPATIBILITY.
4108 * [a..b] is now defined for arbitrary linear orders. It used to be
4109 defined on nat only, as an abbreviation for [a..<Suc b]
4112 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
4114 * New functions "sorted" and "sort" in src/HOL/List.thy.
4116 * New lemma collection field_simps (an extension of ring_simps) for
4117 manipulating (in)equations involving division. Multiplies with all
4118 denominators that can be proved to be non-zero (in equations) or
4119 positive/negative (in inequations).
4121 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
4122 have been improved and renamed to ring_simps, group_simps and
4123 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
4124 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
4126 * Theory Library/Commutative_Ring: switched from recdef to function
4127 package; constants add, mul, pow now curried. Infix syntax for
4128 algebraic operations.
4130 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
4133 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
4136 * HOL/records: generalised field-update to take a function on the
4137 field rather than the new value: r(|A := x|) is translated to A_update
4138 (K x) r The K-combinator that is internally used is called K_record.
4139 INCOMPATIBILITY: Usage of the plain update functions has to be
4142 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
4143 * x = 0, which are required for a semiring. Richer structures do not
4144 inherit from semiring_0 anymore, because this property is a theorem
4145 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
4146 there is more to prove, but this is mostly trivial.
4148 * Class "recpower" is generalized to arbitrary monoids, not just
4149 commutative semirings. INCOMPATIBILITY: may need to incorporate
4150 commutativity or semiring properties additionally.
4152 * Constant "List.list_all2" in List.thy now uses authentic syntax.
4153 INCOMPATIBILITY: translations containing list_all2 may go wrong,
4154 better use 'abbreviation'.
4156 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
4158 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
4159 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
4160 significant changes for setting up numeral syntax for types:
4161 - New constants Numeral.pred and Numeral.succ instead
4162 of former Numeral.bin_pred and Numeral.bin_succ.
4163 - Use integer operations instead of bin_add, bin_mult and so on.
4164 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
4165 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
4167 See src/HOL/Integ/IntArith.thy for an example setup.
4169 * Command 'normal_form' computes the normal form of a term that may
4170 contain free variables. For example ``normal_form "rev [a, b, c]"''
4171 produces ``[b, c, a]'' (without proof). This command is suitable for
4172 heavy-duty computations because the functions are compiled to ML
4173 first. Correspondingly, a method "normalization" is provided. See
4174 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
4176 * Alternative iff syntax "A <-> B" for equality on bool (with priority
4177 25 like -->); output depends on the "iff" print_mode, the default is
4178 "A = B" (with priority 50).
4180 * Relations less (<) and less_eq (<=) are also available on type bool.
4181 Modified syntax to disallow nesting without explicit parentheses,
4182 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
4185 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
4187 * Relation composition operator "op O" now has precedence 75 and binds
4188 stronger than union and intersection. INCOMPATIBILITY.
4190 * The old set interval syntax "{m..n(}" (and relatives) has been
4191 removed. Use "{m..<n}" (and relatives) instead.
4193 * In the context of the assumption "~(s = t)" the Simplifier rewrites
4194 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
4195 ``declare [[simproc del: neq]]''.
4197 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
4200 * Theorem Cons_eq_map_conv no longer declared as "simp".
4202 * Theorem setsum_mult renamed to setsum_right_distrib.
4204 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
4207 * Reimplemented methods "sat" and "satx", with several improvements:
4208 goals no longer need to be stated as "<prems> ==> False", equivalences
4209 (i.e. "=" on type bool) are handled, variable names of the form
4210 "lit_<n>" are no longer reserved, significant speedup.
4212 * Methods "sat" and "satx" can now replay MiniSat proof traces.
4213 zChaff is still supported as well.
4215 * 'inductive' and 'datatype': provide projections of mutual rules,
4216 bundled as foo_bar.inducts;
4218 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
4221 * Library: moved theory Accessible_Part to main HOL.
4223 * Library: added theory Coinductive_List of potentially infinite lists
4224 as greatest fixed-point.
4226 * Library: added theory AssocList which implements (finite) maps as
4229 * Method "evaluation" solves goals (i.e. a boolean expression)
4230 efficiently by compiling it to ML. The goal is "proved" (via an
4231 oracle) if it evaluates to True.
4233 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
4234 also when invoked by the simplifier. This results in the Simplifier
4235 being more powerful on arithmetic goals. INCOMPATIBILITY.
4236 Configuration option fast_arith_split_limit=0 recovers the old
4239 * Support for hex (0x20) and binary (0b1001) numerals.
4241 * New method: reify eqs (t), where eqs are equations for an
4242 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
4243 parameter, computes a term s::'b and a list xs::'a list and proves the
4244 theorem I xs s = t. This is also known as reification or quoting. The
4245 resulting theorem is applied to the subgoal to substitute t with I xs
4246 s. If t is omitted, the subgoal itself is reified.
4248 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
4249 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
4250 where f is supposed to be a computable function (in the sense of code
4251 generattion). The method uses reify to compute s and xs as above then
4252 applies corr_thm and uses normalization by evaluation to "prove" f s =
4253 r and finally gets the theorem t = r, which is again applied to the
4254 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
4256 * Reflection: Automatic reification now handels binding, an example is
4257 available in src/HOL/ex/ReflectionEx.thy
4259 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
4260 command 'statespace' that is similar to 'record', but introduces an
4261 abstract specification based on the locale infrastructure instead of
4262 HOL types. This leads to extra flexibility in composing state spaces,
4263 in particular multiple inheritance and renaming of components.
4268 * Hyperreal: Functions root and sqrt are now defined on negative real
4269 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
4270 Nonnegativity side conditions have been removed from many lemmas, so
4271 that more subgoals may now be solved by simplification; potential
4274 * Real: new type classes formalize real normed vector spaces and
4275 algebras, using new overloaded constants scaleR :: real => 'a => 'a
4276 and norm :: 'a => real.
4278 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
4279 reals into other types. The overloaded constant Reals :: 'a set is now
4280 defined as range of_real; potential INCOMPATIBILITY.
4282 * Real: proper support for ML code generation, including 'quickcheck'.
4283 Reals are implemented as arbitrary precision rationals.
4285 * Hyperreal: Several constants that previously worked only for the
4286 reals have been generalized, so they now work over arbitrary vector
4287 spaces. Type annotations may need to be added in some cases; potential
4290 Infinitesimal :: ('a::real_normed_vector) star set
4291 HFinite :: ('a::real_normed_vector) star set
4292 HInfinite :: ('a::real_normed_vector) star set
4293 approx :: ('a::real_normed_vector) star => 'a star => bool
4294 monad :: ('a::real_normed_vector) star => 'a star set
4295 galaxy :: ('a::real_normed_vector) star => 'a star set
4296 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
4297 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
4298 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
4299 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
4300 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
4301 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
4302 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
4303 sgn :: 'a::real_normed_vector => 'a
4304 exp :: 'a::{recpower,real_normed_field,banach} => 'a
4306 * Complex: Some complex-specific constants are now abbreviations for
4307 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
4308 hnorm. Other constants have been entirely removed in favor of the
4309 polymorphic versions (INCOMPATIBILITY):
4313 HInfinite <-- CInfinite
4314 Infinitesimal <-- CInfinitesimal
4317 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
4318 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
4319 (ns)deriv <-- (ns)cderiv
4324 * Formalisation of ideals and the quotient construction over rings.
4326 * Order and lattice theory no longer based on records.
4329 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
4330 greatest_closed. INCOMPATIBILITY.
4332 * Method algebra is now set up via an attribute. For examples see
4333 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
4334 of algebraic structures.
4336 * Renamed theory CRing to Ring.
4341 * Substantial, yet incomplete support for nominal datatypes (binding
4342 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
4343 src/HOL/Nominal/Examples. Prospective users should consult
4344 http://isabelle.in.tum.de/nominal/
4349 * ML basics: just one true type int, which coincides with IntInf.int
4352 * ML within Isar: antiquotations allow to embed statically-checked
4353 formal entities in the source, referring to the context available at
4354 compile-time. For example:
4356 ML {* @{sort "{zero,one}"} *}
4357 ML {* @{typ "'a => 'b"} *}
4358 ML {* @{term "%x. x"} *}
4359 ML {* @{prop "x == y"} *}
4360 ML {* @{ctyp "'a => 'b"} *}
4361 ML {* @{cterm "%x. x"} *}
4362 ML {* @{cprop "x == y"} *}
4363 ML {* @{thm asm_rl} *}
4364 ML {* @{thms asm_rl} *}
4365 ML {* @{type_name c} *}
4366 ML {* @{type_syntax c} *}
4367 ML {* @{const_name c} *}
4368 ML {* @{const_syntax c} *}
4371 ML {* @{theory Pure} *}
4372 ML {* @{theory_ref} *}
4373 ML {* @{theory_ref Pure} *}
4376 ML {* @{clasimpset} *}
4378 The same works for sources being ``used'' within an Isar context.
4380 * ML in Isar: improved error reporting; extra verbosity with
4381 ML_Context.trace enabled.
4383 * Pure/General/table.ML: the join operations now works via exceptions
4384 DUP/SAME instead of type option. This is simpler in simple cases, and
4385 admits slightly more efficient complex applications.
4387 * Pure: 'advanced' translation functions (parse_translation etc.) now
4388 use Context.generic instead of just theory.
4390 * Pure: datatype Context.generic joins theory/Proof.context and
4391 provides some facilities for code that works in either kind of
4392 context, notably GenericDataFun for uniform theory and proof data.
4394 * Pure: simplified internal attribute type, which is now always
4395 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
4396 local (Proof.context) attributes have been discontinued, while
4397 minimizing code duplication. Thm.rule_attribute and
4398 Thm.declaration_attribute build canonical attributes; see also structure
4399 Context for further operations on Context.generic, notably
4400 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
4401 declarations and definitions.
4403 * Context data interfaces (Theory/Proof/GenericDataFun): removed
4404 name/print, uninitialized data defaults to ad-hoc copy of empty value,
4405 init only required for impure data. INCOMPATIBILITY: empty really need
4406 to be empty (no dependencies on theory content!)
4408 * Pure/kernel: consts certification ignores sort constraints given in
4409 signature declarations. (This information is not relevant to the
4410 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
4411 potential INCOMPATIBILITY.
4413 * Pure: axiomatic type classes are now purely definitional, with
4414 explicit proofs of class axioms and super class relations performed
4415 internally. See Pure/axclass.ML for the main internal interfaces --
4416 notably AxClass.define_class supercedes AxClass.add_axclass, and
4417 AxClass.axiomatize_class/classrel/arity supersede
4418 Sign.add_classes/classrel/arities.
4420 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
4421 global/local versions on theory vs. Proof.context have been
4422 discontinued; Attrib.syntax and Method.syntax have been adapted
4423 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
4424 attributes, methods, etc.
4426 * Pure: several functions of signature "... -> theory -> theory * ..."
4427 have been reoriented to "... -> theory -> ... * theory" in order to
4428 allow natural usage in combination with the ||>, ||>>, |-> and
4429 fold_map combinators.
4431 * Pure: official theorem names (closed derivations) and additional
4432 comments (tags) are now strictly separate. Name hints -- which are
4433 maintained as tags -- may be attached any time without affecting the
4436 * Pure: primitive rule lift_rule now takes goal cterm instead of an
4437 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
4438 achieve the old behaviour.
4440 * Pure: the "Goal" constant is now called "prop", supporting a
4441 slightly more general idea of ``protecting'' meta-level rule
4444 * Pure: Logic.(un)varify only works in a global context, which is now
4445 enforced instead of silently assumed. INCOMPATIBILITY, may use
4446 Logic.legacy_(un)varify as temporary workaround.
4448 * Pure: structure Name provides scalable operations for generating
4449 internal variable names, notably Name.variants etc. This replaces
4450 some popular functions from term.ML:
4452 Term.variant -> Name.variant
4453 Term.variantlist -> Name.variant_list
4454 Term.invent_names -> Name.invent_list
4456 Note that low-level renaming rarely occurs in new code -- operations
4457 from structure Variable are used instead (see below).
4459 * Pure: structure Variable provides fundamental operations for proper
4460 treatment of fixed/schematic variables in a context. For example,
4461 Variable.import introduces fixes for schematics of given facts and
4462 Variable.export reverses the effect (up to renaming) -- this replaces
4463 various freeze_thaw operations.
4465 * Pure: structure Goal provides simple interfaces for
4466 init/conclude/finish and tactical prove operations (replacing former
4467 Tactic.prove). Goal.prove is the canonical way to prove results
4468 within a given context; Goal.prove_global is a degraded version for
4469 theory level goals, including a global Drule.standard. Note that
4470 OldGoals.prove_goalw_cterm has long been obsolete, since it is
4471 ill-behaved in a local proof context (e.g. with local fixes/assumes or
4472 in a locale context).
4474 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
4475 and type checking (Syntax.check_term etc.), with common combinations
4476 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
4477 which are considered legacy and await removal.
4479 * Pure/Syntax: generic interfaces for type unchecking
4480 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
4481 with common combinations (Syntax.pretty_term, Syntax.string_of_term
4482 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
4483 available for convenience, but refer to the very same operations using
4484 a mere theory instead of a full context.
4486 * Isar: simplified treatment of user-level errors, using exception
4487 ERROR of string uniformly. Function error now merely raises ERROR,
4488 without any side effect on output channels. The Isar toplevel takes
4489 care of proper display of ERROR exceptions. ML code may use plain
4490 handle/can/try; cat_error may be used to concatenate errors like this:
4492 ... handle ERROR msg => cat_error msg "..."
4494 Toplevel ML code (run directly or through the Isar toplevel) may be
4495 embedded into the Isar toplevel with exception display/debug like
4498 Isar.toplevel (fn () => ...)
4500 INCOMPATIBILITY, removed special transform_error facilities, removed
4501 obsolete variants of user-level exceptions (ERROR_MESSAGE,
4502 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
4503 -- use plain ERROR instead.
4505 * Isar: theory setup now has type (theory -> theory), instead of a
4506 list. INCOMPATIBILITY, may use #> to compose setup functions.
4508 * Isar: ML toplevel pretty printer for type Proof.context, subject to
4509 ProofContext.debug/verbose flags.
4511 * Isar: Toplevel.theory_to_proof admits transactions that modify the
4512 theory before entering a proof state. Transactions now always see a
4513 quasi-functional intermediate checkpoint, both in interactive and
4516 * Isar: simplified interfaces for outer syntax. Renamed
4517 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
4518 OuterSyntax.add_parsers -- this functionality is now included in
4519 OuterSyntax.command etc. INCOMPATIBILITY.
4521 * Simplifier: the simpset of a running simplification process now
4522 contains a proof context (cf. Simplifier.the_context), which is the
4523 very context that the initial simpset has been retrieved from (by
4524 simpset_of/local_simpset_of). Consequently, all plug-in components
4525 (solver, looper etc.) may depend on arbitrary proof data.
4527 * Simplifier.inherit_context inherits the proof context (plus the
4528 local bounds) of the current simplification process; any simproc
4529 etc. that calls the Simplifier recursively should do this! Removed
4530 former Simplifier.inherit_bounds, which is already included here --
4531 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
4532 specify an explicit context using Simplifier.context/theory_context.
4534 * Simplifier/Classical Reasoner: more abstract interfaces
4535 change_simpset/claset for modifying the simpset/claset reference of a
4536 theory; raw versions simpset/claset_ref etc. have been discontinued --
4539 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
4545 * settings: the default heap location within ISABELLE_HOME_USER now
4546 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
4547 Isabelle installations.
4549 * isabelle-process: option -S (secure mode) disables some critical
4550 operations, notably runtime compilation and evaluation of ML source
4553 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
4555 * Support for parallel execution, using native multicore support of
4556 Poly/ML 5.1. The theory loader exploits parallelism when processing
4557 independent theories, according to the given theory header
4558 specifications. The maximum number of worker threads is specified via
4559 usedir option -M or the "max-threads" setting in Proof General. A
4560 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
4561 to 6 on a 8-core machine. User-code needs to observe certain
4562 guidelines for thread-safe programming, see appendix A in the Isar
4563 Implementation manual.
4567 New in Isabelle2005 (October 2005)
4568 ----------------------------------
4572 * Theory headers: the new header syntax for Isar theories is
4575 imports <theory1> ... <theoryN>
4576 uses <file1> ... <fileM>
4579 where the 'uses' part is optional. The previous syntax
4581 theory <name> = <theory1> + ... + <theoryN>:
4583 will disappear in the next release. Use isatool fixheaders to convert
4584 existing theory files. Note that there is no change in ancient
4585 non-Isar theories now, but these will disappear soon.
4587 * Theory loader: parent theories can now also be referred to via
4588 relative and absolute paths.
4590 * Command 'find_theorems' searches for a list of criteria instead of a
4591 list of constants. Known criteria are: intro, elim, dest, name:string,
4592 simp:term, and any term. Criteria can be preceded by '-' to select
4593 theorems that do not match. Intro, elim, dest select theorems that
4594 match the current goal, name:s selects theorems whose fully qualified
4595 name contain s, and simp:term selects all simplification rules whose
4596 lhs match term. Any other term is interpreted as pattern and selects
4597 all theorems matching the pattern. Available in ProofGeneral under
4598 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
4600 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
4602 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
4603 matching the current goal as introduction rule and not having "HOL."
4604 in their name (i.e. not being defined in theory HOL).
4606 * Command 'thms_containing' has been discontinued in favour of
4607 'find_theorems'; INCOMPATIBILITY.
4609 * Communication with Proof General is now 8bit clean, which means that
4610 Unicode text in UTF-8 encoding may be used within theory texts (both
4611 formal and informal parts). Cf. option -U of the Isabelle Proof
4612 General interface. Here are some simple examples (cf. src/HOL/ex):
4614 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
4615 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
4617 * Improved efficiency of the Simplifier and, to a lesser degree, the
4618 Classical Reasoner. Typical big applications run around 2 times
4622 *** Document preparation ***
4624 * Commands 'display_drafts' and 'print_drafts' perform simple output
4625 of raw sources. Only those symbols that do not require additional
4626 LaTeX packages (depending on comments in isabellesym.sty) are
4627 displayed properly, everything else is left verbatim. isatool display
4628 and isatool print are used as front ends (these are subject to the
4629 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
4631 * Command tags control specific markup of certain regions of text,
4632 notably folding and hiding. Predefined tags include "theory" (for
4633 theory begin and end), "proof" for proof commands, and "ML" for
4634 commands involving ML code; the additional tags "visible" and
4635 "invisible" are unused by default. Users may give explicit tag
4636 specifications in the text, e.g. ''by %invisible (auto)''. The
4637 interpretation of tags is determined by the LaTeX job during document
4638 preparation: see option -V of isatool usedir, or options -n and -t of
4639 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
4642 Several document versions may be produced at the same time via isatool
4643 usedir (the generated index.html will link all of them). Typical
4644 specifications include ''-V document=theory,proof,ML'' to present
4645 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
4646 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
4647 these parts without any formal replacement text. The Isabelle site
4648 default settings produce ''document'' and ''outline'' versions as
4651 * Several new antiquotations:
4653 @{term_type term} prints a term with its type annotated;
4655 @{typeof term} prints the type of a term;
4657 @{const const} is the same as @{term const}, but checks that the
4658 argument is a known logical constant;
4660 @{term_style style term} and @{thm_style style thm} print a term or
4661 theorem applying a "style" to it
4665 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
4666 definitions, equations, inequations etc., 'concl' printing only the
4667 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
4668 to print the specified premise. TermStyle.add_style provides an ML
4669 interface for introducing further styles. See also the "LaTeX Sugar"
4670 document practical applications. The ML antiquotation prints
4671 type-checked ML expressions verbatim.
4673 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
4674 and 'text' support optional locale specification '(in loc)', which
4675 specifies the default context for interpreting antiquotations. For
4676 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
4678 * Option 'locale=NAME' of antiquotations specifies an alternative
4679 context interpreting the subsequent argument. For example: @{thm
4680 [locale=lattice] inf_assoc}.
4682 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
4685 * Proper output of antiquotations for theory commands involving a
4686 proof context (such as 'locale' or 'theorem (in loc) ...').
4688 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
4689 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
4691 * isatool usedir: new option -C (default true) controls whether option
4692 -D should include a copy of the original document directory; -C false
4693 prevents unwanted effects such as copying of administrative CVS data.
4698 * Considerably improved version of 'constdefs' command. Now performs
4699 automatic type-inference of declared constants; additional support for
4700 local structure declarations (cf. locales and HOL records), see also
4701 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
4702 sequential dependencies of definitions within a single 'constdefs'
4703 section; moreover, the declared name needs to be an identifier. If
4704 all fails, consider to fall back on 'consts' and 'defs' separately.
4706 * Improved indexed syntax and implicit structures. First of all,
4707 indexed syntax provides a notational device for subscripted
4708 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
4709 expressions. Secondly, in a local context with structure
4710 declarations, number indexes \<^sub>n or the empty index (default
4711 number 1) refer to a certain fixed variable implicitly; option
4712 show_structs controls printing of implicit structures. Typical
4713 applications of these concepts involve record types and locales.
4715 * New command 'no_syntax' removes grammar declarations (and
4716 translations) resulting from the given syntax specification, which is
4717 interpreted in the same manner as for the 'syntax' command.
4719 * 'Advanced' translation functions (parse_translation etc.) may depend
4720 on the signature of the theory context being presently used for
4721 parsing/printing, see also isar-ref manual.
4723 * Improved 'oracle' command provides a type-safe interface to turn an
4724 ML expression of type theory -> T -> term into a primitive rule of
4725 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
4726 is already included here); see also FOL/ex/IffExample.thy;
4729 * axclass: name space prefix for class "c" is now "c_class" (was "c"
4730 before); "cI" is no longer bound, use "c.intro" instead.
4731 INCOMPATIBILITY. This change avoids clashes of fact bindings for
4732 axclasses vs. locales.
4734 * Improved internal renaming of symbolic identifiers -- attach primes
4735 instead of base 26 numbers.
4737 * New flag show_question_marks controls printing of leading question
4738 marks in schematic variable names.
4740 * In schematic variable names, *any* symbol following \<^isub> or
4741 \<^isup> is now treated as part of the base name. For example, the
4742 following works without printing of awkward ".0" indexes:
4744 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
4747 * Inner syntax includes (*(*nested*) comments*).
4749 * Pretty printer now supports unbreakable blocks, specified in mixfix
4750 annotations as "(00...)".
4752 * Clear separation of logical types and nonterminals, where the latter
4753 may only occur in 'syntax' specifications or type abbreviations.
4754 Before that distinction was only partially implemented via type class
4755 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
4756 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
4757 exotic syntax specifications may require further adaption
4758 (e.g. Cube/Cube.thy).
4760 * Removed obsolete type class "logic", use the top sort {} instead.
4761 Note that non-logical types should be declared as 'nonterminals'
4762 rather than 'types'. INCOMPATIBILITY for new object-logic
4765 * Attributes 'induct' and 'cases': type or set names may now be
4766 locally fixed variables as well.
4768 * Simplifier: can now control the depth to which conditional rewriting
4769 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
4772 * Simplifier: simplification procedures may now take the current
4773 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
4774 interface), which is very useful for calling the Simplifier
4775 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
4776 is gone -- use prems_of_ss on the simpset instead. Moreover, the
4777 low-level mk_simproc no longer applies Logic.varify internally, to
4778 allow for use in a context of fixed variables.
4780 * thin_tac now works even if the assumption being deleted contains !!
4781 or ==>. More generally, erule now works even if the major premise of
4782 the elimination rule contains !! or ==>.
4784 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
4786 * Reorganized bootstrapping of the Pure theories; CPure is now derived
4787 from Pure, which contains all common declarations already. Both
4788 theories are defined via plain Isabelle/Isar .thy files.
4789 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
4790 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
4791 use isatool fixcpure to adapt your theory and ML sources.
4793 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
4794 selections of theorems in named facts via index ranges.
4796 * 'print_theorems': in theory mode, really print the difference
4797 wrt. the last state (works for interactive theory development only),
4798 in proof mode print all local facts (cf. 'print_facts');
4800 * 'hide': option '(open)' hides only base names.
4802 * More efficient treatment of intermediate checkpoints in interactive
4805 * Code generator is now invoked via code_module (incremental code
4806 generation) and code_library (modular code generation, ML structures
4807 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4808 must be quoted when used as identifiers.
4810 * New 'value' command for reading, evaluating and printing terms using
4811 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4812 quoted when used as identifier.
4817 * New commands for the interpretation of locale expressions in
4818 theories (1), locales (2) and proof contexts (3). These generate
4819 proof obligations from the expression specification. After the
4820 obligations have been discharged, theorems of the expression are added
4821 to the theory, target locale or proof context. The synopsis of the
4822 commands is a follows:
4824 (1) interpretation expr inst
4825 (2) interpretation target < expr
4826 (3) interpret expr inst
4828 Interpretation in theories and proof contexts require a parameter
4829 instantiation of terms from the current context. This is applied to
4830 specifications and theorems of the interpreted expression.
4831 Interpretation in locales only permits parameter renaming through the
4832 locale expression. Interpretation is smart in that interpretations
4833 that are active already do not occur in proof obligations, neither are
4834 instantiated theorems stored in duplicate. Use 'print_interps' to
4835 inspect active interpretations of a particular locale. For details,
4836 see the Isar Reference manual. Examples can be found in
4837 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4839 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4840 'interpret' instead.
4842 * New context element 'constrains' for adding type constraints to
4845 * Context expressions: renaming of parameters with syntax
4848 * Locale declaration: 'includes' disallowed.
4850 * Proper static binding of attribute syntax -- i.e. types / terms /
4851 facts mentioned as arguments are always those of the locale definition
4852 context, independently of the context of later invocations. Moreover,
4853 locale operations (renaming and type / term instantiation) are applied
4854 to attribute arguments as expected.
4856 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4857 actual attributes; rare situations may require Attrib.attribute to
4858 embed those attributes into Attrib.src that lack concrete syntax.
4859 Attribute implementations need to cooperate properly with the static
4860 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4861 Attrib.XXX_thm etc. already do the right thing without further
4862 intervention. Only unusual applications -- such as "where" or "of"
4863 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4864 on the context and the facts involved -- may have to assign parsed
4865 values to argument tokens explicitly.
4867 * Changed parameter management in theorem generation for long goal
4868 statements with 'includes'. INCOMPATIBILITY: produces a different
4869 theorem statement in rare situations.
4871 * Locale inspection command 'print_locale' omits notes elements. Use
4872 'print_locale!' to have them included in the output.
4877 * Provers/hypsubst.ML: improved version of the subst method, for
4878 single-step rewriting: it now works in bound variable contexts. New is
4879 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4880 rewrite a different subterm than the original subst method, which is
4881 still available as 'simplesubst'.
4883 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4886 * Provers/trancl.ML: new transitivity reasoner for transitive and
4887 reflexive-transitive closure of relations.
4889 * Provers/blast.ML: new reference depth_limit to make blast's depth
4890 limit (previously hard-coded with a value of 20) user-definable.
4892 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4893 is peformed already. Object-logics merely need to finish their
4894 initial simpset configuration as before. INCOMPATIBILITY.
4899 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4902 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4904 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4905 and x-symbol; use option '-m epsilon' to get it actually printed.
4906 Moreover, the mathematically important symbolic identifier \<epsilon>
4907 becomes available as variable, constant etc. INCOMPATIBILITY,
4909 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4910 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4911 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4912 support corresponding Isar calculations.
4914 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4917 * theory SetInterval: changed the syntax for open intervals:
4926 The old syntax is still supported but will disappear in the next
4927 release. For conversion use the following Emacs search and replace
4928 patterns (these are not perfect but work quite well):
4930 {)\([^\.]*\)\.\. -> {\1<\.\.}
4931 \.\.\([^(}]*\)(} -> \.\.<\1}
4933 * Theory Commutative_Ring (in Library): method comm_ring for proving
4934 equalities in commutative rings; method 'algebra' provides a generic
4937 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4938 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4939 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4942 Some new syntax forms are available:
4944 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4945 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4946 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4947 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4949 The latter form "\<Sum>x < k. e" used to be based on a separate
4950 function "Summation", which has been discontinued.
4952 * theory Finite_Set: in structured induction proofs, the insert case
4953 is now 'case (insert x F)' instead of the old counterintuitive 'case
4956 * The 'refute' command has been extended to support a much larger
4957 fragment of HOL, including axiomatic type classes, constdefs and
4958 typedefs, inductive datatypes and recursion.
4960 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4961 Requires zChaff with proof generation to be installed. See
4962 HOL/ex/SAT_Examples.thy for examples.
4964 * Datatype induction via method 'induct' now preserves the name of the
4965 induction variable. For example, when proving P(xs::'a list) by
4966 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4967 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4968 in unstructured proof scripts.
4970 * Reworked implementation of records. Improved scalability for
4971 records with many fields, avoiding performance problems for type
4972 inference. Records are no longer composed of nested field types, but
4973 of nested extension types. Therefore the record type only grows linear
4974 in the number of extensions and not in the number of fields. The
4975 top-level (users) view on records is preserved. Potential
4976 INCOMPATIBILITY only in strange cases, where the theory depends on the
4977 old record representation. The type generated for a record is called
4978 <record_name>_ext_type.
4980 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4981 proofs triggered by a record definition or a simproc (if
4982 quick_and_dirty is enabled). Definitions of large records can take
4985 New simproc record_upd_simproc for simplification of multiple record
4986 updates enabled by default. Moreover, trivial updates are also
4987 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4988 occasionally, since simplification is more powerful by default.
4990 * typedef: proper support for polymorphic sets, which contain extra
4991 type-variables in the term.
4993 * Simplifier: automatically reasons about transitivity chains
4994 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4995 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4996 old proofs break occasionally as simplification may now solve more
4997 goals than previously.
4999 * Simplifier: converts x <= y into x = y if assumption y <= x is
5000 present. Works for all partial orders (class "order"), in particular
5001 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
5004 * Simplifier: new simproc for "let x = a in f x". If a is a free or
5005 bound variable or a constant then the let is unfolded. Otherwise
5006 first a is simplified to b, and then f b is simplified to g. If
5007 possible we abstract b from g arriving at "let x = b in h x",
5008 otherwise we unfold the let and arrive at g. The simproc can be
5009 enabled/disabled by the reference use_let_simproc. Potential
5010 INCOMPATIBILITY since simplification is more powerful by default.
5012 * Classical reasoning: the meson method now accepts theorems as arguments.
5014 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
5015 jobs to provide advice on the provability of subgoals.
5017 * Theory OrderedGroup and Ring_and_Field: various additions and
5018 improvements to faciliate calculations involving equalities and
5021 The following theorems have been eliminated or modified
5024 abs_eq now named abs_of_nonneg
5025 abs_of_ge_0 now named abs_of_nonneg
5026 abs_minus_eq now named abs_of_nonpos
5027 imp_abs_id now named abs_of_nonneg
5028 imp_abs_neg_id now named abs_of_nonpos
5029 mult_pos now named mult_pos_pos
5030 mult_pos_le now named mult_nonneg_nonneg
5031 mult_pos_neg_le now named mult_nonneg_nonpos
5032 mult_pos_neg2_le now named mult_nonneg_nonpos2
5033 mult_neg now named mult_neg_neg
5034 mult_neg_le now named mult_nonpos_nonpos
5036 * The following lemmas in Ring_and_Field have been added to the simplifier:
5039 not_square_less_zero
5041 The following lemmas have been deleted from Real/RealPow:
5051 * Theory Parity: added rules for simplifying exponents.
5055 The following theorems have been eliminated or modified
5058 list_all_Nil now named list_all.simps(1)
5059 list_all_Cons now named list_all.simps(2)
5060 list_all_conv now named list_all_iff
5061 set_mem_eq now named mem_iff
5063 * Theories SetsAndFunctions and BigO (see HOL/Library) support
5064 asymptotic "big O" calculations. See the notes in BigO.thy.
5069 * Theory RealDef: better support for embedding natural numbers and
5070 integers in the reals.
5072 The following theorems have been eliminated or modified
5075 exp_ge_add_one_self now requires no hypotheses
5076 real_of_int_add reversed direction of equality (use [symmetric])
5077 real_of_int_minus reversed direction of equality (use [symmetric])
5078 real_of_int_diff reversed direction of equality (use [symmetric])
5079 real_of_int_mult reversed direction of equality (use [symmetric])
5081 * Theory RComplete: expanded support for floor and ceiling functions.
5083 * Theory Ln is new, with properties of the natural logarithm
5085 * Hyperreal: There is a new type constructor "star" for making
5086 nonstandard types. The old type names are now type synonyms:
5090 hcomplex = complex star
5092 * Hyperreal: Many groups of similarly-defined constants have been
5093 replaced by polymorphic versions (INCOMPATIBILITY):
5095 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
5097 starset <-- starsetNat, starsetC
5098 *s* <-- *sNat*, *sc*
5099 starset_n <-- starsetNat_n, starsetC_n
5100 *sn* <-- *sNatn*, *scn*
5101 InternalSets <-- InternalNatSets, InternalCSets
5103 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5104 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
5105 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
5106 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
5107 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
5109 * Hyperreal: Many type-specific theorems have been removed in favor of
5110 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
5112 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
5113 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
5114 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
5115 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
5116 right_minus <-- hypreal_add_minus
5117 left_minus <-- {hypreal,hcomplex}_add_minus_left
5118 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
5119 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
5120 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
5121 mult_1_right <-- hcomplex_mult_one_right
5122 mult_zero_left <-- hcomplex_mult_zero_left
5123 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
5124 right_distrib <-- hypnat_add_mult_distrib2
5125 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
5126 right_inverse <-- hypreal_mult_inverse
5127 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
5128 order_refl <-- {hypreal,hypnat}_le_refl
5129 order_trans <-- {hypreal,hypnat}_le_trans
5130 order_antisym <-- {hypreal,hypnat}_le_anti_sym
5131 order_less_le <-- {hypreal,hypnat}_less_le
5132 linorder_linear <-- {hypreal,hypnat}_le_linear
5133 add_left_mono <-- {hypreal,hypnat}_add_left_mono
5134 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
5135 add_nonneg_nonneg <-- hypreal_le_add_order
5137 * Hyperreal: Separate theorems having to do with type-specific
5138 versions of constants have been merged into theorems that apply to the
5139 new polymorphic constants (INCOMPATIBILITY):
5141 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
5142 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
5143 STAR_Un <-- {STAR,NatStar,STARC}_Un
5144 STAR_Int <-- {STAR,NatStar,STARC}_Int
5145 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
5146 STAR_subset <-- {STAR,NatStar,STARC}_subset
5147 STAR_mem <-- {STAR,NatStar,STARC}_mem
5148 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
5149 STAR_diff <-- {STAR,STARC}_diff
5150 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
5151 STARC_hcomplex_of_complex}_image_subset
5152 starset_n_Un <-- starset{Nat,C}_n_Un
5153 starset_n_Int <-- starset{Nat,C}_n_Int
5154 starset_n_Compl <-- starset{Nat,C}_n_Compl
5155 starset_n_diff <-- starset{Nat,C}_n_diff
5156 InternalSets_Un <-- Internal{Nat,C}Sets_Un
5157 InternalSets_Int <-- Internal{Nat,C}Sets_Int
5158 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
5159 InternalSets_diff <-- Internal{Nat,C}Sets_diff
5160 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
5161 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
5162 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
5163 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
5164 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
5165 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5166 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
5167 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
5168 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
5169 starfun_diff <-- starfun{C,RC,CR}_diff
5170 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
5171 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
5172 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
5173 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
5174 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
5175 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
5176 starfun_Id <-- starfunC_Id
5177 starfun_approx <-- starfun{Nat,CR}_approx
5178 starfun_capprox <-- starfun{C,RC}_capprox
5179 starfun_abs <-- starfunNat_rabs
5180 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
5181 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
5182 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
5183 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
5184 starfun_add_capprox <-- starfun{C,RC}_add_capprox
5185 starfun_add_approx <-- starfunCR_add_approx
5186 starfun_inverse_inverse <-- starfunC_inverse_inverse
5187 starfun_divide <-- starfun{C,CR,RC}_divide
5188 starfun_n <-- starfun{Nat,C}_n
5189 starfun_n_mult <-- starfun{Nat,C}_n_mult
5190 starfun_n_add <-- starfun{Nat,C}_n_add
5191 starfun_n_add_minus <-- starfunNat_n_add_minus
5192 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
5193 starfun_n_minus <-- starfun{Nat,C}_n_minus
5194 starfun_n_eq <-- starfun{Nat,C}_n_eq
5196 star_n_add <-- {hypreal,hypnat,hcomplex}_add
5197 star_n_minus <-- {hypreal,hcomplex}_minus
5198 star_n_diff <-- {hypreal,hcomplex}_diff
5199 star_n_mult <-- {hypreal,hcomplex}_mult
5200 star_n_inverse <-- {hypreal,hcomplex}_inverse
5201 star_n_le <-- {hypreal,hypnat}_le
5202 star_n_less <-- {hypreal,hypnat}_less
5203 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
5204 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
5205 star_n_abs <-- hypreal_hrabs
5206 star_n_divide <-- hcomplex_divide
5208 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
5209 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
5210 star_of_diff <-- hypreal_of_real_diff
5211 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
5212 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
5213 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
5214 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
5215 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
5216 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
5217 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
5218 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
5219 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
5220 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
5221 star_of_number_of <-- {hypreal,hcomplex}_number_of
5222 star_of_number_less <-- number_of_less_hypreal_of_real_iff
5223 star_of_number_le <-- number_of_le_hypreal_of_real_iff
5224 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
5225 star_of_less_number <-- hypreal_of_real_less_number_of_iff
5226 star_of_le_number <-- hypreal_of_real_le_number_of_iff
5227 star_of_power <-- hypreal_of_real_power
5228 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
5230 * Hyperreal: new method "transfer" that implements the transfer
5231 principle of nonstandard analysis. With a subgoal that mentions
5232 nonstandard types like "'a star", the command "apply transfer"
5233 replaces it with an equivalent one that mentions only standard types.
5234 To be successful, all free variables must have standard types; non-
5235 standard variables must have explicit universal quantifiers.
5237 * Hyperreal: A theory of Taylor series.
5242 * Discontinued special version of 'constdefs' (which used to support
5243 continuous functions) in favor of the general Pure one with full
5246 * New simplification procedure for solving continuity conditions; it
5247 is much faster on terms with many nested lambda abstractions (cubic
5248 instead of exponential time).
5250 * New syntax for domain package: selector names are now optional.
5251 Parentheses should be omitted unless argument is lazy, for example:
5253 domain 'a stream = cons "'a" (lazy "'a stream")
5255 * New command 'fixrec' for defining recursive functions with pattern
5256 matching; defining multiple functions with mutual recursion is also
5257 supported. Patterns may include the constants cpair, spair, up, sinl,
5258 sinr, or any data constructor defined by the domain package. The given
5259 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
5260 syntax and examples.
5262 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
5263 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
5264 but the proof obligation additionally includes an admissibility
5265 requirement. The packages generate instances of class cpo or pcpo,
5266 with continuity and strictness theorems for Rep and Abs.
5268 * HOLCF: Many theorems have been renamed according to a more standard naming
5269 scheme (INCOMPATIBILITY):
5271 foo_inject: "foo$x = foo$y ==> x = y"
5272 foo_eq: "(foo$x = foo$y) = (x = y)"
5273 foo_less: "(foo$x << foo$y) = (x << y)"
5274 foo_strict: "foo$UU = UU"
5275 foo_defined: "... ==> foo$x ~= UU"
5276 foo_defined_iff: "(foo$x = UU) = (x = UU)"
5281 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
5282 including the First Isomorphism Theorem (on quotienting by the kernel
5285 * ZF/Simplifier: install second copy of type solver that actually
5286 makes use of TC rules declared to Isar proof contexts (or locales);
5287 the old version is still required for ML proof scripts.
5292 * Converted to Isar theory format; use locales instead of axiomatic
5298 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
5301 * Pure/library.ML no longer defines its own option datatype, but uses
5302 that of the SML basis, which has constructors NONE and SOME instead of
5303 None and Some, as well as exception Option.Option instead of OPTION.
5304 The functions the, if_none, is_some, is_none have been adapted
5305 accordingly, while Option.map replaces apsome.
5307 * Pure/library.ML: the exception LIST has been given up in favour of
5308 the standard exceptions Empty and Subscript, as well as
5309 Library.UnequalLengths. Function like Library.hd and Library.tl are
5310 superceded by the standard hd and tl functions etc.
5312 A number of basic list functions are no longer exported to the ML
5313 toplevel, as they are variants of predefined functions. The following
5314 suggests how one can translate existing code:
5316 rev_append xs ys = List.revAppend (xs, ys)
5317 nth_elem (i, xs) = List.nth (xs, i)
5318 last_elem xs = List.last xs
5319 flat xss = List.concat xss
5320 seq fs = List.app fs
5321 partition P xs = List.partition P xs
5322 mapfilter f xs = List.mapPartial f xs
5324 * Pure/library.ML: several combinators for linear functional
5325 transformations, notably reverse application and composition:
5328 (x, y) |-> f f #-> g
5330 * Pure/library.ML: introduced/changed precedence of infix operators:
5332 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
5334 infix 3 o oo ooo oooo;
5335 infix 4 ~~ upto downto;
5337 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
5340 * Pure/library.ML: natural list combinators fold, fold_rev, and
5341 fold_map support linear functional transformations and nesting. For
5344 fold f [x1, ..., xN] y =
5345 y |> f x1 |> ... |> f xN
5347 (fold o fold) f [xs1, ..., xsN] y =
5348 y |> fold f xs1 |> ... |> fold f xsN
5350 fold f [x1, ..., xN] =
5353 (fold o fold) f [xs1, ..., xsN] =
5354 fold f xs1 #> ... #> fold f xsN
5356 * Pure/library.ML: the following selectors on type 'a option are
5359 the: 'a option -> 'a (*partial*)
5360 these: 'a option -> 'a where 'a = 'b list
5361 the_default: 'a -> 'a option -> 'a
5362 the_list: 'a option -> 'a list
5364 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5365 basic operations for association lists, following natural argument
5366 order; moreover the explicit equality predicate passed here avoids
5367 potentially expensive polymorphic runtime equality checks.
5368 The old functions may be expressed as follows:
5370 assoc = uncurry (AList.lookup (op =))
5371 assocs = these oo AList.lookup (op =)
5372 overwrite = uncurry (AList.update (op =)) o swap
5374 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5376 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
5377 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
5379 replacing make_keylist and keyfilter (occassionally used)
5382 make_keylist = AList.make
5383 keyfilter = AList.find (op =)
5385 * eq_fst and eq_snd now take explicit equality parameter, thus
5386 avoiding eqtypes. Naive rewrites:
5388 eq_fst = eq_fst (op =)
5389 eq_snd = eq_snd (op =)
5391 * Removed deprecated apl and apr (rarely used).
5394 apl (n, op) =>>= curry op n
5395 apr (op, m) =>>= fn n => op (n, m)
5397 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
5398 provides a reasonably efficient light-weight implementation of sets as
5401 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
5402 few new operations; existing lookup and update are now curried to
5403 follow natural argument order (for use with fold etc.);
5404 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
5406 * Pure/General: output via the Isabelle channels of
5407 writeln/warning/error etc. is now passed through Output.output, with a
5408 hook for arbitrary transformations depending on the print_mode
5409 (cf. Output.add_mode -- the first active mode that provides a output
5410 function wins). Already formatted output may be embedded into further
5411 text via Output.raw; the result of Pretty.string_of/str_of and derived
5412 functions (string_of_term/cterm/thm etc.) is already marked raw to
5413 accommodate easy composition of diagnostic messages etc. Programmers
5414 rarely need to care about Output.output or Output.raw at all, with
5415 some notable exceptions: Output.output is required when bypassing the
5416 standard channels (writeln etc.), or in token translations to produce
5417 properly formatted results; Output.raw is required when capturing
5418 already output material that will eventually be presented to the user
5419 a second time. For the default print mode, both Output.output and
5420 Output.raw have no effect.
5422 * Pure/General: Output.time_accumulator NAME creates an operator ('a
5423 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
5424 cumulative results are displayed at the end of a batch session.
5426 * Pure/General: File.sysify_path and File.quote_sysify path have been
5427 replaced by File.platform_path and File.shell_path (with appropriate
5428 hooks). This provides a clean interface for unusual systems where the
5429 internal and external process view of file names are different.
5431 * Pure: more efficient orders for basic syntactic entities: added
5432 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
5433 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
5434 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
5435 orders now -- potential INCOMPATIBILITY for code that depends on a
5436 particular order for Symtab.keys, Symtab.dest, etc. (consider using
5437 Library.sort_strings on result).
5439 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
5440 fold_types traverse types/terms from left to right, observing natural
5441 argument order. Supercedes previous foldl_XXX versions, add_frees,
5442 add_vars etc. have been adapted as well: INCOMPATIBILITY.
5444 * Pure: name spaces have been refined, with significant changes of the
5445 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
5446 to extern(_table). The plain name entry path is superceded by a
5447 general 'naming' context, which also includes the 'policy' to produce
5448 a fully qualified name and external accesses of a fully qualified
5449 name; NameSpace.extend is superceded by context dependent
5450 Sign.declare_name. Several theory and proof context operations modify
5451 the naming context. Especially note Theory.restore_naming and
5452 ProofContext.restore_naming to get back to a sane state; note that
5453 Theory.add_path is no longer sufficient to recover from
5454 Theory.absolute_path in particular.
5456 * Pure: new flags short_names (default false) and unique_names
5457 (default true) for controlling output of qualified names. If
5458 short_names is set, names are printed unqualified. If unique_names is
5459 reset, the name prefix is reduced to the minimum required to achieve
5460 the original result when interning again, even if there is an overlap
5461 with earlier declarations.
5463 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
5464 now 'extend', and 'merge' gets an additional Pretty.pp argument
5465 (useful for printing error messages). INCOMPATIBILITY.
5467 * Pure: major reorganization of the theory context. Type Sign.sg and
5468 Theory.theory are now identified, referring to the universal
5469 Context.theory (see Pure/context.ML). Actual signature and theory
5470 content is managed as theory data. The old code and interfaces were
5471 spread over many files and structures; the new arrangement introduces
5472 considerable INCOMPATIBILITY to gain more clarity:
5474 Context -- theory management operations (name, identity, inclusion,
5475 parents, ancestors, merge, etc.), plus generic theory data;
5477 Sign -- logical signature and syntax operations (declaring consts,
5478 types, etc.), plus certify/read for common entities;
5480 Theory -- logical theory operations (stating axioms, definitions,
5481 oracles), plus a copy of logical signature operations (consts,
5482 types, etc.); also a few basic management operations (Theory.copy,
5485 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
5486 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
5487 for convenience -- they merely return the theory.
5489 * Pure: type Type.tsig is superceded by theory in most interfaces.
5491 * Pure: the Isar proof context type is already defined early in Pure
5492 as Context.proof (note that ProofContext.context and Proof.context are
5493 aliases, where the latter is the preferred name). This enables other
5494 Isabelle components to refer to that type even before Isar is present.
5496 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
5497 typeK, constK, axiomK, oracleK), but provide explicit operations for
5498 any of these kinds. For example, Sign.intern typeK is now
5499 Sign.intern_type, Theory.hide_space Sign.typeK is now
5500 Theory.hide_types. Also note that former
5501 Theory.hide_classes/types/consts are now
5502 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
5503 internalize their arguments! INCOMPATIBILITY.
5505 * Pure: get_thm interface (of PureThy and ProofContext) expects
5506 datatype thmref (with constructors Name and NameSelection) instead of
5507 plain string -- INCOMPATIBILITY;
5509 * Pure: cases produced by proof methods specify options, where NONE
5510 means to remove case bindings -- INCOMPATIBILITY in
5513 * Pure: the following operations retrieve axioms or theorems from a
5514 theory node or theory hierarchy, respectively:
5516 Theory.axioms_of: theory -> (string * term) list
5517 Theory.all_axioms_of: theory -> (string * term) list
5518 PureThy.thms_of: theory -> (string * thm) list
5519 PureThy.all_thms_of: theory -> (string * thm) list
5521 * Pure: print_tac now outputs the goal through the trace channel.
5523 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
5524 Reference Toplevel.debug (default false) controls detailed printing
5525 and tracing of low-level exceptions; Toplevel.profiling (default 0)
5526 controls execution profiling -- set to 1 for time and 2 for space
5527 (both increase the runtime).
5529 * Isar session: The initial use of ROOT.ML is now always timed,
5530 i.e. the log will show the actual process times, in contrast to the
5531 elapsed wall-clock time that the outer shell wrapper produces.
5533 * Simplifier: improved handling of bound variables (nameless
5534 representation, avoid allocating new strings). Simprocs that invoke
5535 the Simplifier recursively should use Simplifier.inherit_bounds to
5536 avoid local name clashes. Failure to do so produces warnings
5537 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
5538 for further details.
5540 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
5541 bindings for all theorems stored within a given theory; this may help
5542 in porting non-Isar theories to Isar ones, while keeping ML proof
5543 scripts for the time being.
5545 * ML operator HTML.with_charset specifies the charset begin used for
5546 generated HTML files. For example:
5548 HTML.with_charset "utf-8" use_thy "Hebrew";
5549 HTML.with_charset "utf-8" use_thy "Chinese";
5554 * Allow symlinks to all proper Isabelle executables (Isabelle,
5555 isabelle, isatool etc.).
5557 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
5558 isatool doc, isatool mkdir, display_drafts etc.).
5560 * isatool usedir: option -f allows specification of the ML file to be
5561 used by Isabelle; default is ROOT.ML.
5563 * New isatool version outputs the version identifier of the Isabelle
5564 distribution being used.
5566 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
5567 (containing Boolean satisfiability problems) into Isabelle/HOL
5572 New in Isabelle2004 (April 2004)
5573 --------------------------------
5577 * Provers/order.ML: new efficient reasoner for partial and linear orders.
5578 Replaces linorder.ML.
5580 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
5581 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
5582 (\<a>...\<z>), are now considered normal letters, and can therefore
5583 be used anywhere where an ASCII letter (a...zA...Z) has until
5584 now. COMPATIBILITY: This obviously changes the parsing of some
5585 terms, especially where a symbol has been used as a binder, say
5586 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
5587 as an identifier. Fix it by inserting a space around former
5588 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
5589 existing theory and ML files.
5591 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
5593 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
5594 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
5595 a normal (but invisible) letter. For multiple letter subscripts repeat
5596 \<^isub> like this: x\<^isub>1\<^isub>2.
5598 * Pure: There are now sub-/superscripts that can span more than one
5599 character. Text between \<^bsub> and \<^esub> is set in subscript in
5600 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
5601 superscript. The new control characters are not identifier parts.
5603 * Pure: Control-symbols of the form \<^raw:...> will literally print the
5604 content of "..." to the latex file instead of \isacntrl... . The "..."
5605 may consist of any printable characters excluding the end bracket >.
5607 * Pure: Using new Isar command "finalconsts" (or the ML functions
5608 Theory.add_finals or Theory.add_finals_i) it is now possible to
5609 declare constants "final", which prevents their being given a definition
5610 later. It is useful for constants whose behaviour is fixed axiomatically
5611 rather than definitionally, such as the meta-logic connectives.
5613 * Pure: 'instance' now handles general arities with general sorts
5614 (i.e. intersections of classes),
5616 * Presentation: generated HTML now uses a CSS style sheet to make layout
5617 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
5618 It can be changed to alter the colors/layout of generated pages.
5623 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
5624 cut_tac, subgoal_tac and thin_tac:
5625 - Now understand static (Isar) contexts. As a consequence, users of Isar
5626 locales are no longer forced to write Isar proof scripts.
5627 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
5629 - INCOMPATIBILITY: names of variables to be instantiated may no
5630 longer be enclosed in quotes. Instead, precede variable name with `?'.
5631 This is consistent with the instantiation attribute "where".
5633 * Attributes "where" and "of":
5634 - Now take type variables of instantiated theorem into account when reading
5635 the instantiation string. This fixes a bug that caused instantiated
5636 theorems to have too special types in some circumstances.
5637 - "where" permits explicit instantiations of type variables.
5639 * Calculation commands "moreover" and "also" no longer interfere with
5640 current facts ("this"), admitting arbitrary combinations with "then"
5644 - Goal statements involving the context element "includes" no longer
5645 generate theorems with internal delta predicates (those ending on
5646 "_axioms") in the premise.
5647 Resolve particular premise with <locale>.intro to obtain old form.
5648 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
5649 specification and "includes" elements in goal statement.
5650 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
5651 [intro?] and [elim?] (respectively) by default.
5652 - Experimental command for instantiation of locales in proof contexts:
5653 instantiate <label>[<attrs>]: <loc>
5654 Instantiates locale <loc> and adds all its theorems to the current context
5655 taking into account their attributes. Label and attrs are optional
5656 modifiers, like in theorem declarations. If present, names of
5657 instantiated theorems are qualified with <label>, and the attributes
5658 <attrs> are applied after any attributes these theorems might have already.
5659 If the locale has assumptions, a chained fact of the form
5660 "<loc> t1 ... tn" is expected from which instantiations of the parameters
5661 are derived. The command does not support old-style locales declared
5662 with "locale (open)".
5663 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
5665 * HOL: Tactic emulation methods induct_tac and case_tac understand static
5671 * Proof import: new image HOL4 contains the imported library from
5672 the HOL4 system with about 2500 theorems. It is imported by
5673 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
5674 can be used like any other Isabelle image. See
5675 HOL/Import/HOL/README for more information.
5678 - Much improved handling of linear and partial orders.
5679 Reasoners for linear and partial orders are set up for type classes
5680 "linorder" and "order" respectively, and are added to the default simpset
5681 as solvers. This means that the simplifier can build transitivity chains
5682 to solve goals from the assumptions.
5683 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
5684 of blast or auto after simplification become unnecessary because the goal
5685 is solved by simplification already.
5687 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
5688 all proved in axiomatic type classes for semirings, rings and fields.
5691 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
5692 now formalized using the Ring_and_Field theory mentioned above.
5693 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
5694 than before, because now they are set up once in a generic manner.
5695 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
5696 Look for the general versions in Ring_and_Field (and Power if they concern
5699 * Type "rat" of the rational numbers is now available in HOL-Complex.
5702 - Record types are now by default printed with their type abbreviation
5703 instead of the list of all field types. This can be configured via
5704 the reference "print_record_type_abbr".
5705 - Simproc "record_upd_simproc" for simplification of multiple updates added
5706 (not enabled by default).
5707 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
5708 EX x. x = sel r to True (not enabled by default).
5709 - Tactic "record_split_simp_tac" to split and simplify records added.
5711 * 'specification' command added, allowing for definition by
5712 specification. There is also an 'ax_specification' command that
5713 introduces the new constants axiomatically.
5715 * arith(_tac) is now able to generate counterexamples for reals as well.
5717 * HOL-Algebra: new locale "ring" for non-commutative rings.
5719 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
5720 definitions, thanks to Sava Krsti\'{c} and John Matthews.
5722 * HOL-Matrix: a first theory for matrices in HOL with an application of
5723 matrix theory to linear programming.
5725 * Unions and Intersections:
5726 The latex output syntax of UN and INT has been changed
5727 from "\Union x \in A. B" to "\Union_{x \in A} B"
5728 i.e. the index formulae has become a subscript.
5729 Similarly for "\Union x. B", and for \Inter instead of \Union.
5731 * Unions and Intersections over Intervals:
5732 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
5733 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
5734 like in normal math, and corresponding versions for < and for intersection.
5736 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
5737 lexicographic dictonary ordering has been added as "lexord".
5739 * ML: the legacy theory structures Int and List have been removed. They had
5740 conflicted with ML Basis Library structures having the same names.
5742 * 'refute' command added to search for (finite) countermodels. Only works
5743 for a fragment of HOL. The installation of an external SAT solver is
5744 highly recommended. See "HOL/Refute.thy" for details.
5746 * 'quickcheck' command: Allows to find counterexamples by evaluating
5747 formulae under an assignment of free variables to random values.
5748 In contrast to 'refute', it can deal with inductive datatypes,
5749 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
5755 * Streams now come with concatenation and are part of the HOLCF image
5759 New in Isabelle2003 (May 2003)
5760 ------------------------------
5764 * Provers/simplifier:
5766 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
5767 Assumptions are now subject to complete mutual simplification,
5768 not just from left to right. The simplifier now preserves
5769 the order of assumptions.
5771 Potential INCOMPATIBILITY:
5773 -- simp sometimes diverges where the old version did
5774 not, e.g. invoking simp on the goal
5776 [| P (f x); y = x; f x = f y |] ==> Q
5778 now gives rise to the infinite reduction sequence
5780 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
5782 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
5785 -- Tactics combining classical reasoner and simplification (such as auto)
5786 are also affected by this change, because many of them rely on
5787 simp. They may sometimes diverge as well or yield a different numbers
5788 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
5789 in case of problems. Sometimes subsequent calls to the classical
5790 reasoner will fail because a preceeding call to the simplifier too
5791 eagerly simplified the goal, e.g. deleted redundant premises.
5793 - The simplifier trace now shows the names of the applied rewrite rules
5795 - You can limit the number of recursive invocations of the simplifier
5796 during conditional rewriting (where the simplifie tries to solve the
5797 conditions before applying the rewrite rule):
5798 ML "simp_depth_limit := n"
5799 where n is an integer. Thus you can force termination where previously
5800 the simplifier would diverge.
5802 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5804 - No longer aborts on failed congruence proof. Instead, the
5805 congruence is ignored.
5807 * Pure: New generic framework for extracting programs from constructive
5808 proofs. See HOL/Extraction.thy for an example instantiation, as well
5809 as HOL/Extraction for some case studies.
5811 * Pure: The main goal of the proof state is no longer shown by default, only
5812 the subgoals. This behaviour is controlled by a new flag.
5813 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5814 (ML: Proof.show_main_goal).
5816 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5817 rules whose conclusion matches subgoal 1:
5818 PG menu: Isabelle/Isar -> Show me -> matching rules
5819 The rules are ordered by how closely they match the subgoal.
5820 In particular, rules that solve a subgoal outright are displayed first
5821 (or rather last, the way they are printed).
5822 (ML: ProofGeneral.print_intros())
5824 * Pure: New flag trace_unify_fail causes unification to print
5825 diagnostic information (PG: in trace buffer) when it fails. This is
5826 useful for figuring out why single step proofs like rule, erule or
5829 * Pure: Locale specifications now produce predicate definitions
5830 according to the body of text (covering assumptions modulo local
5831 definitions); predicate "loc_axioms" covers newly introduced text,
5832 while "loc" is cumulative wrt. all included locale expressions; the
5833 latter view is presented only on export into the global theory
5834 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5835 on the old view without predicates;
5837 * Pure: predefined locales "var" and "struct" are useful for sharing
5838 parameters (as in CASL, for example); just specify something like
5839 ``var x + var y + struct M'' as import;
5841 * Pure: improved thms_containing: proper indexing of facts instead of
5842 raw theorems; check validity of results wrt. current name space;
5843 include local facts of proof configuration (also covers active
5844 locales), cover fixed variables in index; may use "_" in term
5845 specification; an optional limit for the number of printed facts may
5846 be given (the default is 40);
5848 * Pure: disallow duplicate fact bindings within new-style theory files
5851 * Provers: improved induct method: assumptions introduced by case
5852 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5853 the goal statement); "foo" still refers to all facts collectively;
5855 * Provers: the function blast.overloaded has been removed: all constants
5856 are regarded as potentially overloaded, which improves robustness in exchange
5857 for slight decrease in efficiency;
5859 * Provers/linorder: New generic prover for transitivity reasoning over
5860 linear orders. Note: this prover is not efficient!
5862 * Isar: preview of problems to finish 'show' now produce an error
5863 rather than just a warning (in interactive mode);
5870 - Produces a counter example if it cannot prove a goal.
5871 Note that the counter example may be spurious if the goal is not a formula
5872 of quantifier-free linear arithmetic.
5873 In ProofGeneral the counter example appears in the trace buffer.
5875 - Knows about div k and mod k where k is a numeral of type nat or int.
5877 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5878 linear arithmetic fails. This takes account of quantifiers and divisibility.
5879 Presburger arithmetic can also be called explicitly via presburger(_tac).
5881 * simp's arithmetic capabilities have been enhanced a bit: it now
5882 takes ~= in premises into account (by performing a case split);
5884 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5885 are distributed over a sum of terms;
5887 * New tactic "trans_tac" and method "trans" instantiate
5888 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5891 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5892 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5894 * 'typedef' command has new option "open" to suppress the set
5897 * functions Min and Max on finite sets have been introduced (theory
5900 * attribute [symmetric] now works for relations as well; it turns
5901 (x,y) : R^-1 into (y,x) : R, and vice versa;
5903 * induct over a !!-quantified statement (say !!x1..xn):
5904 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5906 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5907 %x. None. Warning: empty_def now refers to the previously hidden definition
5910 * Algebra: formalization of classical algebra. Intended as base for
5911 any algebraic development in Isabelle. Currently covers group theory
5912 (up to Sylow's theorem) and ring theory (Universal Property of
5913 Univariate Polynomials). Contributions welcome;
5915 * GroupTheory: deleted, since its material has been moved to Algebra;
5917 * Complex: new directory of the complex numbers with numeric constants,
5918 nonstandard complex numbers, and some complex analysis, standard and
5919 nonstandard (Jacques Fleuriot);
5921 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5923 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5926 * Real/HahnBanach: updated and adapted to locales;
5928 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5931 * UNITY: added the Meier-Sanders theory of progress sets;
5933 * MicroJava: bytecode verifier and lightweight bytecode verifier
5934 as abstract algorithms, instantiated to the JVM;
5936 * Bali: Java source language formalization. Type system, operational
5937 semantics, axiomatic semantics. Supported language features:
5938 classes, interfaces, objects,virtual methods, static methods,
5939 static/instance fields, arrays, access modifiers, definite
5940 assignment, exceptions.
5945 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5948 * Main ZF: virtually all theories converted to new-style format;
5953 * Pure: Tactic.prove provides sane interface for internal proofs;
5954 omits the infamous "standard" operation, so this is more appropriate
5955 than prove_goalw_cterm in many situations (e.g. in simprocs);
5957 * Pure: improved error reporting of simprocs;
5959 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5963 *** Document preparation ***
5965 * uses \par instead of \\ for line breaks in theory text. This may
5966 shift some page breaks in large documents. To get the old behaviour
5967 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5969 * minimized dependencies of isabelle.sty and isabellesym.sty on
5972 * \<euro> now needs package babel/greek instead of marvosym (which
5975 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5980 New in Isabelle2002 (March 2002)
5981 --------------------------------
5983 *** Document preparation ***
5985 * greatly simplified document preparation setup, including more
5986 graceful interpretation of isatool usedir -i/-d/-D options, and more
5987 instructive isatool mkdir; users should basically be able to get
5988 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5989 users may run a separate document processing stage manually like this:
5990 "isatool usedir -D output HOL Test && isatool document Test/output";
5992 * theory dependency graph may now be incorporated into documents;
5993 isatool usedir -g true will produce session_graph.eps/.pdf for use
5994 with \includegraphics of LaTeX;
5996 * proper spacing of consecutive markup elements, especially text
5997 blocks after section headings;
5999 * support bold style (for single symbols only), input syntax is like
6000 this: "\<^bold>\<alpha>" or "\<^bold>A";
6002 * \<bullet> is now output as bold \cdot by default, which looks much
6003 better in printed text;
6005 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
6006 note that these symbols are currently unavailable in Proof General /
6007 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
6009 * isatool latex no longer depends on changed TEXINPUTS, instead
6010 isatool document copies the Isabelle style files to the target
6016 * Pure/Provers: improved proof by cases and induction;
6017 - 'case' command admits impromptu naming of parameters (such as
6019 - 'induct' method divinates rule instantiation from the inductive
6020 claim; no longer requires excessive ?P bindings for proper
6021 instantiation of cases;
6022 - 'induct' method properly enumerates all possibilities of set/type
6023 rules; as a consequence facts may be also passed through *type*
6024 rules without further ado;
6025 - 'induct' method now derives symbolic cases from the *rulified*
6026 rule (before it used to rulify cases stemming from the internal
6027 atomized version); this means that the context of a non-atomic
6028 statement becomes is included in the hypothesis, avoiding the
6029 slightly cumbersome show "PROP ?case" form;
6030 - 'induct' may now use elim-style induction rules without chaining
6031 facts, using ``missing'' premises from the goal state; this allows
6032 rules stemming from inductive sets to be applied in unstructured
6033 scripts, while still benefitting from proper handling of non-atomic
6034 statements; NB: major inductive premises need to be put first, all
6035 the rest of the goal is passed through the induction;
6036 - 'induct' proper support for mutual induction involving non-atomic
6037 rule statements (uses the new concept of simultaneous goals, see
6039 - append all possible rule selections, but only use the first
6040 success (no backtracking);
6041 - removed obsolete "(simplified)" and "(stripped)" options of methods;
6042 - undeclared rule case names default to numbers 1, 2, 3, ...;
6043 - added 'print_induct_rules' (covered by help item in recent Proof
6045 - moved induct/cases attributes to Pure, methods to Provers;
6046 - generic method setup instantiated for FOL and HOL;
6048 * Pure: support multiple simultaneous goal statements, for example
6049 "have a: A and b: B" (same for 'theorem' etc.); being a pure
6050 meta-level mechanism, this acts as if several individual goals had
6051 been stated separately; in particular common proof methods need to be
6052 repeated in order to cover all claims; note that a single elimination
6053 step is *not* sufficient to establish the two conjunctions, so this
6056 assume "A & B" then have A and B .. (*".." fails*)
6058 better use "obtain" in situations as above; alternative refer to
6059 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
6061 * Pure: proper integration with ``locales''; unlike the original
6062 version by Florian Kammller, Isar locales package high-level proof
6063 contexts rather than raw logical ones (e.g. we admit to include
6064 attributes everywhere); operations on locales include merge and
6065 rename; support for implicit arguments (``structures''); simultaneous
6066 type-inference over imports and text; see also HOL/ex/Locales.thy for
6069 * Pure: the following commands have been ``localized'', supporting a
6070 target locale specification "(in name)": 'lemma', 'theorem',
6071 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
6072 stored both within the locale and at the theory level (exported and
6073 qualified by the locale name);
6075 * Pure: theory goals may now be specified in ``long'' form, with
6076 ad-hoc contexts consisting of arbitrary locale elements. for example
6077 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
6078 definitions may be given, too); the result is a meta-level rule with
6079 the context elements being discharged in the obvious way;
6081 * Pure: new proof command 'using' allows to augment currently used
6082 facts after a goal statement ('using' is syntactically analogous to
6083 'apply', but acts on the goal's facts only); this allows chained facts
6084 to be separated into parts given before and after a claim, as in
6085 ``from a and b have C using d and e <proof>'';
6087 * Pure: renamed "antecedent" case to "rule_context";
6089 * Pure: new 'judgment' command records explicit information about the
6090 object-logic embedding (used by several tools internally); no longer
6091 use hard-wired "Trueprop";
6093 * Pure: added 'corollary' command;
6095 * Pure: fixed 'token_translation' command;
6097 * Pure: removed obsolete 'exported' attribute;
6099 * Pure: dummy pattern "_" in is/let is now automatically lifted over
6100 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
6101 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
6103 * Pure: method 'atomize' presents local goal premises as object-level
6104 statements (atomic meta-level propositions); setup controlled via
6105 rewrite rules declarations of 'atomize' attribute; example
6106 application: 'induct' method with proper rule statements in improper
6109 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
6110 now consider the syntactic context of assumptions, giving a better
6111 chance to get type-inference of the arguments right (this is
6112 especially important for locales);
6114 * Pure: "sorry" no longer requires quick_and_dirty in interactive
6117 * Pure/obtain: the formal conclusion "thesis", being marked as
6118 ``internal'', may no longer be reference directly in the text;
6119 potential INCOMPATIBILITY, may need to use "?thesis" in rare
6122 * Pure: generic 'sym' attribute which declares a rule both as pure
6123 'elim?' and for the 'symmetric' operation;
6125 * Pure: marginal comments ``--'' may now occur just anywhere in the
6126 text; the fixed correlation with particular command syntax has been
6129 * Pure: new method 'rules' is particularly well-suited for proof
6130 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
6131 but often produces more compact proof terms with less detours;
6133 * Pure/Provers/classical: simplified integration with pure rule
6134 attributes and methods; the classical "intro?/elim?/dest?"
6135 declarations coincide with the pure ones; the "rule" method no longer
6136 includes classically swapped intros; "intro" and "elim" methods no
6137 longer pick rules from the context; also got rid of ML declarations
6138 AddXIs/AddXEs/AddXDs; all of this has some potential for
6141 * Provers/classical: attribute 'swapped' produces classical inversions
6142 of introduction rules;
6144 * Provers/simplifier: 'simplified' attribute may refer to explicit
6145 rules instead of full simplifier context; 'iff' attribute handles
6148 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
6150 * HOL: 'recdef' now fails on unfinished automated proofs, use
6151 "(permissive)" option to recover old behavior;
6153 * HOL: 'inductive' no longer features separate (collective) attributes
6154 for 'intros' (was found too confusing);
6156 * HOL: properly declared induction rules less_induct and
6162 * HOL: moved over to sane numeral syntax; the new policy is as
6165 - 0 and 1 are polymorphic constants, which are defined on any
6166 numeric type (nat, int, real etc.);
6168 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
6169 binary representation internally;
6171 - type nat has special constructor Suc, and generally prefers Suc 0
6172 over 1::nat and Suc (Suc 0) over 2::nat;
6174 This change may cause significant problems of INCOMPATIBILITY; here
6175 are some hints on converting existing sources:
6177 - due to the new "num" token, "-0" and "-1" etc. are now atomic
6178 entities, so expressions involving "-" (unary or binary minus) need
6179 to be spaced properly;
6181 - existing occurrences of "1" may need to be constraint "1::nat" or
6182 even replaced by Suc 0; similar for old "2";
6184 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
6186 - remove all special provisions on numerals in proofs;
6188 * HOL: simp rules nat_number expand numerals on nat to Suc/0
6189 representation (depends on bin_arith_simps in the default context);
6191 * HOL: symbolic syntax for x^2 (numeral 2);
6193 * HOL: the class of all HOL types is now called "type" rather than
6194 "term"; INCOMPATIBILITY, need to adapt references to this type class
6195 in axclass/classes, instance/arities, and (usually rare) occurrences
6196 in typings (of consts etc.); internally the class is called
6197 "HOL.type", ML programs should refer to HOLogic.typeS;
6199 * HOL/record package improvements:
6200 - new derived operations "fields" to build a partial record section,
6201 "extend" to promote a fixed record to a record scheme, and
6202 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
6203 declared as simp by default;
6204 - shared operations ("more", "fields", etc.) now need to be always
6205 qualified) --- potential INCOMPATIBILITY;
6206 - removed "make_scheme" operations (use "make" with "extend") --
6208 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
6209 - provides cases/induct rules for use with corresponding Isar
6210 methods (for concrete records, record schemes, concrete more
6211 parts, and schematic more parts -- in that order);
6212 - internal definitions directly based on a light-weight abstract
6213 theory of product types over typedef rather than datatype;
6215 * HOL: generic code generator for generating executable ML code from
6216 specifications; specific support for HOL constructs such as inductive
6217 datatypes and sets, as well as recursive functions; can be invoked
6218 via 'generate_code' theory section;
6220 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
6222 * HOL: consolidated and renamed several theories. In particular:
6223 Ord.thy has been absorbed into HOL.thy
6224 String.thy has been absorbed into List.thy
6226 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
6227 (beware of argument permutation!);
6229 * HOL: linorder_less_split superseded by linorder_cases;
6231 * HOL/List: "nodups" renamed to "distinct";
6233 * HOL: added "The" definite description operator; move Hilbert's "Eps"
6234 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
6235 - Ex_def has changed, now need to use some_eq_ex
6237 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
6238 in this (rare) case use:
6240 delSWrapper "split_all_tac"
6241 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
6243 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
6246 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
6247 Isabelle's type classes, ^ on functions and relations has too general
6248 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
6249 necessary to attach explicit type constraints;
6251 * HOL/Relation: the prefix name of the infix "O" has been changed from
6252 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
6253 renamed accordingly (eg "compI" -> "rel_compI").
6255 * HOL: syntax translations now work properly with numerals and records
6258 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
6259 of "lam" -- INCOMPATIBILITY;
6261 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
6262 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
6263 renamed "Product_Type.unit";
6265 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
6267 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
6268 the "cases" method);
6270 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
6273 * HOL/IMP: updated and converted to new-style theory format; several
6274 parts turned into readable document, with proper Isar proof texts and
6275 some explanations (by Gerwin Klein);
6277 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
6279 * HOL-Hyperreal is now a logic image;
6284 * Isar: consts/constdefs supports mixfix syntax for continuous
6287 * Isar: domain package adapted to new-style theory format, e.g. see
6290 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
6291 potential INCOMPATIBILITY; now use plain induct_tac instead of former
6292 lift.induct_tac, always use UU instead of Undef;
6294 * HOLCF/IMP: updated and converted to new-style theory;
6299 * Isar: proper integration of logic-specific tools and packages,
6300 including theory commands '(co)inductive', '(co)datatype',
6301 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
6302 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
6304 * theory Main no longer includes AC; for the Axiom of Choice, base
6305 your theory on Main_ZFC;
6307 * the integer library now covers quotients and remainders, with many
6308 laws relating division to addition, multiplication, etc.;
6310 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
6311 typeless version of the formalism;
6313 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
6316 * ZF/Induct: new directory for examples of inductive definitions,
6317 including theory Multiset for multiset orderings; converted to
6318 new-style theory format;
6320 * ZF: many new theorems about lists, ordinals, etc.;
6325 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
6326 variable proof controls level of detail: 0 = no proofs (only oracle
6327 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
6328 also ref manual for further ML interfaces;
6330 * Pure/axclass: removed obsolete ML interface
6331 goal_subclass/goal_arity;
6333 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
6334 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
6335 separate tokens, so expressions involving minus need to be spaced
6338 * Pure/syntax: support non-oriented infixes, using keyword "infix"
6339 rather than "infixl" or "infixr";
6341 * Pure/syntax: concrete syntax for dummy type variables admits genuine
6342 sort constraint specifications in type inference; e.g. "x::_::foo"
6343 ensures that the type of "x" is of sort "foo" (but not necessarily a
6346 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
6347 control output of nested => (types); the default behavior is
6350 * Pure/syntax: builtin parse translation for "_constify" turns valued
6351 tokens into AST constants;
6353 * Pure/syntax: prefer later declarations of translations and print
6354 translation functions; potential INCOMPATIBILITY: need to reverse
6355 multiple declarations for same syntax element constant;
6357 * Pure/show_hyps reset by default (in accordance to existing Isar
6360 * Provers/classical: renamed addaltern to addafter, addSaltern to
6363 * Provers/clasimp: ``iff'' declarations now handle conditional rules
6366 * system: tested support for MacOS X; should be able to get Isabelle +
6367 Proof General to work in a plain Terminal after installing Poly/ML
6368 (e.g. from the Isabelle distribution area) and GNU bash alone
6369 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
6370 support requires further installations, e.g. from
6371 http://fink.sourceforge.net/);
6373 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
6375 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
6376 of 40 MB), cf. ML_OPTIONS;
6378 * system: Proof General keywords specification is now part of the
6379 Isabelle distribution (see etc/isar-keywords.el);
6381 * system: support for persistent Proof General sessions (refrain from
6382 outdating all loaded theories on startup); user may create writable
6383 logic images like this: ``isabelle -q HOL Test'';
6385 * system: smart selection of Isabelle process versus Isabelle
6386 interface, accommodates case-insensitive file systems (e.g. HFS+); may
6387 run both "isabelle" and "Isabelle" even if file names are badly
6388 damaged (executable inspects the case of the first letter of its own
6389 name); added separate "isabelle-process" and "isabelle-interface";
6391 * system: refrain from any attempt at filtering input streams; no
6392 longer support ``8bit'' encoding of old isabelle font, instead proper
6393 iso-latin characters may now be used; the related isatools
6394 "symbolinput" and "nonascii" have disappeared as well;
6396 * system: removed old "xterm" interface (the print modes "xterm" and
6397 "xterm_color" are still available for direct use in a suitable
6402 New in Isabelle99-2 (February 2001)
6403 -----------------------------------
6405 *** Overview of INCOMPATIBILITIES ***
6407 * HOL: please note that theories in the Library and elsewhere often use the
6408 new-style (Isar) format; to refer to their theorems in an ML script you must
6409 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
6411 * HOL: inductive package no longer splits induction rule aggressively,
6412 but only as far as specified by the introductions given; the old
6413 format may be recovered via ML function complete_split_rule or attribute
6414 'split_rule (complete)';
6416 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
6417 gfp_Tarski to gfp_unfold;
6419 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
6421 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
6422 relation); infix "^^" has been renamed "``"; infix "``" has been
6423 renamed "`"; "univalent" has been renamed "single_valued";
6425 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
6428 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
6430 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
6432 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
6433 consequence, it is no longer monotonic wrt. the local goal context
6434 (which is now passed through the inductive cases);
6436 * Document preparation: renamed standard symbols \<ll> to \<lless> and
6437 \<gg> to \<ggreater>;
6440 *** Document preparation ***
6442 * \isabellestyle{NAME} selects version of Isabelle output (currently
6443 available: are "it" for near math-mode best-style output, "sl" for
6444 slanted text style, and "tt" for plain type-writer; if no
6445 \isabellestyle command is given, output is according to slanted
6448 * support sub/super scripts (for single symbols only), input syntax is
6449 like this: "A\<^sup>*" or "A\<^sup>\<star>";
6451 * some more standard symbols; see Appendix A of the system manual for
6452 the complete list of symbols defined in isabellesym.sty;
6454 * improved isabelle style files; more abstract symbol implementation
6455 (should now use \isamath{...} and \isatext{...} in custom symbol
6458 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
6459 state; Note that presentation of goal states does not conform to
6460 actual human-readable proof documents. Please do not include goal
6461 states into document output unless you really know what you are doing!
6463 * proper indentation of antiquoted output with proportional LaTeX
6466 * no_document ML operator temporarily disables LaTeX document
6469 * isatool unsymbolize tunes sources for plain ASCII communication;
6474 * Pure: Isar now suffers initial goal statements to contain unbound
6475 schematic variables (this does not conform to actual readable proof
6476 documents, due to unpredictable outcome and non-compositional proof
6477 checking); users who know what they are doing may use schematic goals
6478 for Prolog-style synthesis of proven results;
6480 * Pure: assumption method (an implicit finishing) now handles actual
6483 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
6484 initial goal, declare "that" only as Pure intro (only for single
6485 steps); the "that" rule assumption may now be involved in implicit
6486 finishing, thus ".." becomes a feasible for trivial obtains;
6488 * Pure: default proof step now includes 'intro_classes'; thus trivial
6489 instance proofs may be performed by "..";
6491 * Pure: ?thesis / ?this / "..." now work for pure meta-level
6494 * Pure: more robust selection of calculational rules;
6496 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
6497 rule (as well as the assumption rule);
6499 * Pure: 'thm_deps' command visualizes dependencies of theorems and
6500 lemmas, using the graph browser tool;
6502 * Pure: predict failure of "show" in interactive mode;
6504 * Pure: 'thms_containing' now takes actual terms as arguments;
6506 * HOL: improved method 'induct' --- now handles non-atomic goals
6507 (potential INCOMPATIBILITY); tuned error handling;
6509 * HOL: cases and induct rules now provide explicit hints about the
6510 number of facts to be consumed (0 for "type" and 1 for "set" rules);
6511 any remaining facts are inserted into the goal verbatim;
6513 * HOL: local contexts (aka cases) may now contain term bindings as
6514 well; the 'cases' and 'induct' methods new provide a ?case binding for
6515 the result to be shown in each case;
6517 * HOL: added 'recdef_tc' command;
6519 * isatool convert assists in eliminating legacy ML scripts;
6524 * HOL/Library: a collection of generic theories to be used together
6525 with main HOL; the theory loader path already includes this directory
6526 by default; the following existing theories have been moved here:
6527 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
6528 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
6530 * HOL/Unix: "Some aspects of Unix file-system security", a typical
6531 modelling and verification task performed in Isabelle/HOL +
6532 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
6534 * HOL/Algebra: special summation operator SUM no longer exists, it has
6535 been replaced by setsum; infix 'assoc' now has priority 50 (like
6536 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
6537 'domain', this makes the theory consistent with mathematical
6540 * HOL basics: added overloaded operations "inverse" and "divide"
6541 (infix "/"), syntax for generic "abs" operation, generic summation
6544 * HOL/typedef: simplified package, provide more useful rules (see also
6547 * HOL/datatype: induction rule for arbitrarily branching datatypes is
6548 now expressed as a proper nested rule (old-style tactic scripts may
6549 require atomize_strip_tac to cope with non-atomic premises);
6551 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
6552 to "split_conv" (old name still available for compatibility);
6554 * HOL: improved concrete syntax for strings (e.g. allows translation
6555 rules with string literals);
6557 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
6558 and Fleuriot's mechanization of analysis, including the transcendental
6559 functions for the reals;
6561 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
6566 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
6567 "lam" is displayed as TWO lambda-symbols
6569 * CTT: theory Main now available, containing everything (that is, Bool
6575 * Pure: the Simplifier has been implemented properly as a derived rule
6576 outside of the actual kernel (at last!); the overall performance
6577 penalty in practical applications is about 50%, while reliability of
6578 the Isabelle inference kernel has been greatly improved;
6580 * print modes "brackets" and "no_brackets" control output of nested =>
6581 (types) and ==> (props); the default behaviour is "brackets";
6583 * Provers: fast_tac (and friends) now handle actual object-logic rules
6584 as assumptions as well;
6586 * system: support Poly/ML 4.0;
6588 * system: isatool install handles KDE version 1 or 2;
6592 New in Isabelle99-1 (October 2000)
6593 ----------------------------------
6595 *** Overview of INCOMPATIBILITIES ***
6597 * HOL: simplification of natural numbers is much changed; to partly
6598 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
6599 issue the following ML commands:
6601 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
6602 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
6604 * HOL: simplification no longer dives into case-expressions; this is
6605 controlled by "t.weak_case_cong" for each datatype t;
6607 * HOL: nat_less_induct renamed to less_induct;
6609 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
6610 fixsome to patch .thy and .ML sources automatically;
6612 select_equality -> some_equality
6613 select_eq_Ex -> some_eq_ex
6614 selectI2EX -> someI2_ex
6617 select1_equality -> some1_equality
6618 Eps_sym_eq -> some_sym_eq_trivial
6619 Eps_eq -> some_eq_trivial
6621 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
6623 * HOL: removed obsolete theorem binding expand_if (refer to split_if
6626 * HOL: the recursion equations generated by 'recdef' are now called
6627 f.simps instead of f.rules;
6629 * HOL: qed_spec_mp now also handles bounded ALL as well;
6631 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
6632 sometimes be needed;
6634 * HOL: the constant for "f``x" is now "image" rather than "op ``";
6636 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
6638 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
6639 product is now "<*>" instead of "Times"; the lexicographic product is
6640 now "<*lex*>" instead of "**";
6642 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
6643 of main HOL, but was unused); better use HOL's datatype package;
6645 * HOL: removed "symbols" syntax for constant "override" of theory Map;
6646 the old syntax may be recovered as follows:
6649 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
6650 (infixl "\\<oplus>" 100)
6652 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6654 * HOL/ML: even fewer consts are declared as global (see theories Ord,
6655 Lfp, Gfp, WF); this only affects ML packages that refer to const names
6658 * HOL and ZF: syntax for quotienting wrt an equivalence relation
6659 changed from A/r to A//r;
6661 * ZF: new treatment of arithmetic (nat & int) may break some old
6664 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
6665 rulify -> rule_format, elimify -> elim_format, ...);
6667 * Isar/Provers: intro/elim/dest attributes changed; renamed
6668 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
6669 should have to change intro!! to intro? only); replaced "delrule" by
6672 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
6674 * Provers: strengthened force_tac by using new first_best_tac;
6676 * LaTeX document preparation: several changes of isabelle.sty (see
6680 *** Document preparation ***
6682 * formal comments (text blocks etc.) in new-style theories may now
6683 contain antiquotations of thm/prop/term/typ/text to be presented
6684 according to latex print mode; concrete syntax is like this:
6685 @{term[show_types] "f(x) = a + x"};
6687 * isatool mkdir provides easy setup of Isabelle session directories,
6688 including proper document sources;
6690 * generated LaTeX sources are now deleted after successful run
6691 (isatool document -c); may retain a copy somewhere else via -D option
6694 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
6695 style files, achieving self-contained LaTeX sources and simplifying
6698 * old-style theories now produce (crude) LaTeX output as well;
6700 * browser info session directories are now self-contained (may be put
6701 on WWW server seperately); improved graphs of nested sessions; removed
6702 graph for 'all sessions';
6704 * several improvements in isabelle style files; \isabellestyle{it}
6705 produces fake math mode output; \isamarkupheader is now \section by
6706 default; see lib/texinputs/isabelle.sty etc.;
6711 * Isar/Pure: local results and corresponding term bindings are now
6712 subject to Hindley-Milner polymorphism (similar to ML); this
6713 accommodates incremental type-inference very nicely;
6715 * Isar/Pure: new derived language element 'obtain' supports
6716 generalized existence reasoning;
6718 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
6719 support accumulation of results, without applying any rules yet;
6720 useful to collect intermediate results without explicit name
6721 references, and for use with transitivity rules with more than 2
6724 * Isar/Pure: scalable support for case-analysis type proofs: new
6725 'case' language element refers to local contexts symbolically, as
6726 produced by certain proof methods; internally, case names are attached
6727 to theorems as "tags";
6729 * Isar/Pure: theory command 'hide' removes declarations from
6730 class/type/const name spaces;
6732 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
6733 indicate potential overloading;
6735 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
6737 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
6738 "{a,b,c}" instead of {a,b,c};
6740 * Isar/Pure now provides its own version of intro/elim/dest
6741 attributes; useful for building new logics, but beware of confusion
6742 with the version in Provers/classical;
6744 * Isar/Pure: the local context of (non-atomic) goals is provided via
6745 case name 'antecedent';
6747 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
6748 to the current context is now done automatically);
6750 * Isar/Pure: theory command 'method_setup' provides a simple interface
6751 for definining proof methods in ML;
6753 * Isar/Provers: intro/elim/dest attributes changed; renamed
6754 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
6755 most cases, one should have to change intro!! to intro? only);
6756 replaced "delrule" by "rule del";
6758 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
6759 'symmetric' attribute (the latter supercedes [RS sym]);
6761 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
6762 method modifier); 'simp' method: 'only:' modifier removes loopers as
6763 well (including splits);
6765 * Isar/Provers: Simplifier and Classical methods now support all kind
6766 of modifiers used in the past, including 'cong', 'iff', etc.
6768 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
6769 of Simplifier and Classical reasoner);
6771 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
6772 now support named cases; major packages (inductive, datatype, primrec,
6773 recdef) support case names and properly name parameters;
6775 * Isar/HOL: new transitivity rules for substitution in inequalities --
6776 monotonicity conditions are extracted to be proven at end of
6779 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
6782 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
6783 split_if split_if_asm; datatype package provides theorems foo.splits =
6784 foo.split foo.split_asm for each datatype;
6786 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
6787 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
6788 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
6789 use "(cases (simplified))" method in proper proof texts);
6791 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
6793 * Isar: names of theorems etc. may be natural numbers as well;
6795 * Isar: 'pr' command: optional arguments for goals_limit and
6796 ProofContext.prems_limit; no longer prints theory contexts, but only
6799 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6800 additional print modes to be specified; e.g. "pr(latex)" will print
6801 proof state according to the Isabelle LaTeX style;
6803 * Isar: improved support for emulating tactic scripts, including proof
6804 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6805 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6806 (for HOL datatypes);
6808 * Isar: simplified (more robust) goal selection of proof methods: 1st
6809 goal, all goals, or explicit goal specifier (tactic emulation); thus
6810 'proof method scripts' have to be in depth-first order;
6812 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6814 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6815 should instead use individual commands for printing items
6816 (print_commands, print_methods etc.);
6818 * Isar: added 'nothing' --- the empty list of theorems;
6823 * HOL/MicroJava: formalization of a fragment of Java, together with a
6824 corresponding virtual machine and a specification of its bytecode
6825 verifier and a lightweight bytecode verifier, including proofs of
6826 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6827 Cornelia Pusch (see also the homepage of project Bali at
6828 http://isabelle.in.tum.de/Bali/);
6830 * HOL/Algebra: new theory of rings and univariate polynomials, by
6833 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6834 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6837 * HOL/Lattice: fundamental concepts of lattice theory and order
6838 structures, including duals, properties of bounds versus algebraic
6839 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6840 Theorem for complete lattices etc.; may also serve as a demonstration
6841 for abstract algebraic reasoning using axiomatic type classes, and
6842 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6844 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6847 * HOL/IMPP: extension of IMP with local variables and mutually
6848 recursive procedures, by David von Oheimb;
6850 * HOL/Lambda: converted into new-style theory and document;
6852 * HOL/ex/Multiquote: example of multiple nested quotations and
6853 anti-quotations -- basically a generalized version of de-Bruijn
6854 representation; very useful in avoiding lifting of operations;
6856 * HOL/record: added general record equality rule to simpset; fixed
6857 select-update simplification procedure to handle extended records as
6858 well; admit "r" as field name;
6860 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6861 other numeric types and also as the identity of groups, rings, etc.;
6863 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6864 Types nat and int belong to this axclass;
6866 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6867 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6868 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6869 two terms #m*u and #n*u are replaced by #(m+n)*u
6870 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6871 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6872 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6874 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6875 powerful prover for predicate logic but knows nothing of clasets; see
6876 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6878 * HOL: new version of "case_tac" subsumes both boolean case split and
6879 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6880 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6882 * HOL: simplification no longer dives into case-expressions: only the
6883 selector expression is simplified, but not the remaining arms; to
6884 enable full simplification of case-expressions for datatype t, you may
6885 remove t.weak_case_cong from the simpset, either globally (Delcongs
6886 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6888 * HOL/recdef: the recursion equations generated by 'recdef' for
6889 function 'f' are now called f.simps instead of f.rules; if all
6890 termination conditions are proved automatically, these simplification
6891 rules are added to the simpset, as in primrec; rules may be named
6892 individually as well, resulting in a separate list of theorems for
6895 * HOL/While is a new theory that provides a while-combinator. It
6896 permits the definition of tail-recursive functions without the
6897 provision of a termination measure. The latter is necessary once the
6898 invariant proof rule for while is applied.
6900 * HOL: new (overloaded) notation for the set of elements below/above
6901 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6903 * HOL: theorems impI, allI, ballI bound as "strip";
6905 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6906 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6907 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6909 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6911 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6912 main HOL, but was unused);
6914 * HOL: fewer consts declared as global (e.g. have to refer to
6915 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6917 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6918 in case of overlap with user translations (e.g. judgements over
6919 tuples); (note that the underlying logical represenation is still
6925 * ZF: simplification automatically cancels common terms in arithmetic
6926 expressions over nat and int;
6928 * ZF: new treatment of nat to minimize type-checking: all operators
6929 coerce their operands to a natural number using the function natify,
6930 making the algebraic laws unconditional;
6932 * ZF: as above, for int: operators coerce their operands to an integer
6933 using the function intify;
6935 * ZF: the integer library now contains many of the usual laws for the
6936 orderings, including $<=, and monotonicity laws for $+ and $*;
6938 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6941 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6942 to the simplifier and classical reasoner simultaneously;
6947 * Provers: blast_tac now handles actual object-logic rules as
6948 assumptions; note that auto_tac uses blast_tac internally as well;
6950 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6951 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6953 * Provers: delrules now handles destruct rules as well (no longer need
6954 explicit make_elim);
6956 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6957 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6958 use instead the strong form,
6959 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6960 in HOL, FOL and ZF the function cla_make_elim will create such rules
6961 from destruct-rules;
6963 * Provers: Simplifier.easy_setup provides a fast path to basic
6964 Simplifier setup for new object-logics;
6966 * Pure: AST translation rules no longer require constant head on LHS;
6968 * Pure: improved name spaces: ambiguous output is qualified; support
6969 for hiding of names;
6971 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6972 XSYMBOL_HOME; no longer need to do manual configuration in most
6975 * system: compression of ML heaps images may now be controlled via -c
6976 option of isabelle and isatool usedir (currently only observed by
6979 * system: isatool installfonts may handle X-Symbol fonts as well (very
6980 useful for remote X11);
6982 * system: provide TAGS file for Isabelle sources;
6984 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6987 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6988 timing flag supersedes proof_timing and Toplevel.trace;
6990 * ML: new combinators |>> and |>>> for incremental transformations
6991 with secondary results (e.g. certain theory extensions):
6993 * ML: PureThy.add_defs gets additional argument to indicate potential
6994 overloading (usually false);
6996 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
7001 New in Isabelle99 (October 1999)
7002 --------------------------------
7004 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7006 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
7007 are no longer simplified. (This allows the simplifier to unfold recursive
7008 functional programs.) To restore the old behaviour, declare
7010 Delcongs [if_weak_cong];
7012 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
7015 * HOL: the predicate "inj" is now defined by translation to "inj_on";
7017 * HOL/datatype: mutual_induct_tac no longer exists --
7018 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
7020 * HOL/typedef: fixed type inference for representing set; type
7021 arguments now have to occur explicitly on the rhs as type constraints;
7023 * ZF: The con_defs part of an inductive definition may no longer refer
7024 to constants declared in the same theory;
7026 * HOL, ZF: the function mk_cases, generated by the inductive
7027 definition package, has lost an argument. To simplify its result, it
7028 uses the default simpset instead of a supplied list of theorems.
7030 * HOL/List: the constructors of type list are now Nil and Cons;
7032 * Simplifier: the type of the infix ML functions
7033 setSSolver addSSolver setSolver addSolver
7034 is now simpset * solver -> simpset where `solver' is a new abstract type
7035 for packaging solvers. A solver is created via
7036 mk_solver: string -> (thm list -> int -> tactic) -> solver
7037 where the string argument is only a comment.
7042 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
7043 decision procedure for linear arithmetic. Currently it is used for
7044 types `nat', `int', and `real' in HOL (see below); it can, should and
7045 will be instantiated for other types and logics as well.
7047 * The simplifier now accepts rewrite rules with flexible heads, eg
7048 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
7049 They are applied like any rule with a non-pattern lhs, i.e. by first-order
7055 * New Isabelle/Isar subsystem provides an alternative to traditional
7056 tactical theorem proving; together with the ProofGeneral/isar user
7057 interface it offers an interactive environment for developing human
7058 readable proof documents (Isar == Intelligible semi-automated
7059 reasoning); for further information see isatool doc isar-ref,
7060 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
7062 * improved and simplified presentation of theories: better HTML markup
7063 (including colors), graph views in several sizes; isatool usedir now
7064 provides a proper interface for user theories (via -P option); actual
7065 document preparation based on (PDF)LaTeX is available as well (for
7066 new-style theories only); see isatool doc system for more information;
7068 * native support for Proof General, both for classic Isabelle and
7071 * ML function thm_deps visualizes dependencies of theorems and lemmas,
7072 using the graph browser tool;
7074 * Isabelle manuals now also available as PDF;
7076 * theory loader rewritten from scratch (may not be fully
7077 bug-compatible); old loadpath variable has been replaced by show_path,
7078 add_path, del_path, reset_path functions; new operations such as
7079 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
7082 * improved isatool install: option -k creates KDE application icon,
7083 option -p DIR installs standalone binaries;
7085 * added ML_PLATFORM setting (useful for cross-platform installations);
7086 more robust handling of platform specific ML images for SML/NJ;
7088 * the settings environment is now statically scoped, i.e. it is never
7089 created again in sub-processes invoked from isabelle, isatool, or
7092 * path element specification '~~' refers to '$ISABELLE_HOME';
7094 * in locales, the "assumes" and "defines" parts may be omitted if
7097 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
7100 * new print_mode "HTML";
7102 * new flag show_tags controls display of tags of theorems (which are
7103 basically just comments that may be attached by some tools);
7105 * Isamode 2.6 requires patch to accomodate change of Isabelle font
7106 mode and goal output format:
7108 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
7110 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
7112 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
7113 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
7115 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
7117 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
7119 * function bind_thms stores lists of theorems (cf. bind_thm);
7121 * new shorthand tactics ftac, eatac, datac, fatac;
7123 * qed (and friends) now accept "" as result name; in that case the
7124 theorem is not stored, but proper checks and presentation of the
7127 * theorem database now also indexes constants "Trueprop", "all",
7128 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
7133 ** HOL arithmetic **
7135 * There are now decision procedures for linear arithmetic over nat and
7138 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
7139 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
7140 are treated as atomic; subformulae not involving type `nat' or `int'
7141 are ignored; quantified subformulae are ignored unless they are
7142 positive universal or negative existential. The tactic has to be
7143 invoked by hand and can be a little bit slow. In particular, the
7144 running time is exponential in the number of occurrences of `min' and
7145 `max', and `-' on `nat'.
7147 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
7148 (negated) (in)equalities among the premises and the conclusion into
7149 account (i.e. no compound formulae) and does not know about `min' and
7150 `max', and `-' on `nat'. It is fast and is used automatically by the
7153 NB: At the moment, these decision procedures do not cope with mixed
7154 nat/int formulae where the two parts interact, such as `m < n ==>
7157 * HOL/Numeral provides a generic theory of numerals (encoded
7158 efficiently as bit strings); setup for types nat/int/real is in place;
7159 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
7160 int, existing theories and proof scripts may require a few additional
7163 * integer division and remainder can now be performed on constant
7166 * many properties of integer multiplication, division and remainder
7169 * An interface to the Stanford Validity Checker (SVC) is available through the
7170 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
7171 are proved automatically. SVC must be installed separately, and its results
7172 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
7173 invocation of the underlying oracle). For SVC see
7174 http://verify.stanford.edu/SVC
7176 * IsaMakefile: the HOL-Real target now builds an actual image;
7181 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
7182 (in Isabelle/Isar) -- by Gertrud Bauer;
7184 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
7185 analysis for assembly languages with subtypes;
7187 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
7188 -- avoids syntactic ambiguities and treats state, transition, and
7189 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
7190 changed syntax and (many) tactics;
7192 * HOL/inductive: Now also handles more general introduction rules such
7193 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
7194 theorems are now maintained within the theory (maintained via the
7197 * HOL/datatype: Now also handles arbitrarily branching datatypes
7198 (using function types) such as
7200 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
7202 * HOL/record: record_simproc (part of the default simpset) takes care
7203 of selectors applied to updated records; record_split_tac is no longer
7204 part of the default claset; update_defs may now be removed from the
7205 simpset in many cases; COMPATIBILITY: old behavior achieved by
7207 claset_ref () := claset() addSWrapper record_split_wrapper;
7208 Delsimprocs [record_simproc]
7210 * HOL/typedef: fixed type inference for representing set; type
7211 arguments now have to occur explicitly on the rhs as type constraints;
7213 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
7214 names rather than an ML expression;
7216 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
7217 supplied later. Program schemes can be defined, such as
7218 "While B C s = (if B s then While B C (C s) else s)"
7219 where the well-founded relation can be chosen after B and C have been given.
7221 * HOL/List: the constructors of type list are now Nil and Cons;
7222 INCOMPATIBILITY: while [] and infix # syntax is still there, of
7223 course, ML tools referring to List.list.op # etc. have to be adapted;
7225 * HOL_quantifiers flag superseded by "HOL" print mode, which is
7226 disabled by default; run isabelle with option -m HOL to get back to
7227 the original Gordon/HOL-style output;
7229 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
7230 ALL x<=y. P, EX x<y. P, EX x<=y. P;
7232 * HOL basic syntax simplified (more orthogonal): all variants of
7233 All/Ex now support plain / symbolic / HOL notation; plain syntax for
7234 Eps operator is provided as well: "SOME x. P[x]";
7236 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
7238 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
7239 thus available for user theories;
7241 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
7242 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
7245 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
7246 several times and then mp;
7251 * the notation <<...>> is now available as a notation for sequences of
7254 * the simplifier is now installed
7256 * the axiom system has been generalized (thanks to Soren Heilmann)
7258 * the classical reasoner now has a default rule database
7263 * new primrec section allows primitive recursive functions to be given
7264 directly (as in HOL) over datatypes and the natural numbers;
7266 * new tactics induct_tac and exhaust_tac for induction (or case
7267 analysis) over datatypes and the natural numbers;
7269 * the datatype declaration of type T now defines the recursor T_rec;
7271 * simplification automatically does freeness reasoning for datatype
7274 * automatic type-inference, with AddTCs command to insert new
7275 type-checking rules;
7277 * datatype introduction rules are now added as Safe Introduction rules
7280 * the syntax "if P then x else y" is now available in addition to
7284 *** Internal programming interfaces ***
7286 * tuned simplifier trace output; new flag debug_simp;
7288 * structures Vartab / Termtab (instances of TableFun) offer efficient
7289 tables indexed by indexname_ord / term_ord (compatible with aconv);
7291 * AxClass.axclass_tac lost the theory argument;
7293 * tuned current_goals_markers semantics: begin / end goal avoids
7294 printing empty lines;
7296 * removed prs and prs_fn hook, which was broken because it did not
7297 include \n in its semantics, forcing writeln to add one
7298 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
7299 string -> unit if you really want to output text without newline;
7301 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
7302 plain output, interface builders may have to enable 'isabelle_font'
7303 mode to get Isabelle font glyphs as before;
7305 * refined token_translation interface; INCOMPATIBILITY: output length
7306 now of type real instead of int;
7308 * theory loader actions may be traced via new ThyInfo.add_hook
7309 interface (see src/Pure/Thy/thy_info.ML); example application: keep
7310 your own database of information attached to *whole* theories -- as
7311 opposed to intra-theory data slots offered via TheoryDataFun;
7313 * proper handling of dangling sort hypotheses (at last!);
7314 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
7315 extra sort hypotheses that can be witnessed from the type signature;
7316 the force_strip_shyps flag is gone, any remaining shyps are simply
7317 left in the theorem (with a warning issued by strip_shyps_warning);
7321 New in Isabelle98-1 (October 1998)
7322 ----------------------------------
7324 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7326 * several changes of automated proof tools;
7328 * HOL: major changes to the inductive and datatype packages, including
7329 some minor incompatibilities of theory syntax;
7331 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
7334 * HOL: removed duplicate thms in Arith:
7335 less_imp_add_less should be replaced by trans_less_add1
7336 le_imp_add_le should be replaced by trans_le_add1
7338 * HOL: unary minus is now overloaded (new type constraints may be
7341 * HOL and ZF: unary minus for integers is now #- instead of #~. In
7342 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
7343 now taken as an integer constant.
7345 * Pure: ML function 'theory_of' renamed to 'theory';
7351 1. Asm_full_simp_tac is now more aggressive.
7352 1. It will sometimes reorient premises if that increases their power to
7354 2. It does no longer proceed strictly from left to right but may also
7355 rotate premises to achieve further simplification.
7356 For compatibility reasons there is now Asm_lr_simp_tac which is like the
7357 old Asm_full_simp_tac in that it does not rotate premises.
7358 2. The simplifier now knows a little bit about nat-arithmetic.
7360 * Classical reasoner: wrapper mechanism for the classical reasoner now
7361 allows for selected deletion of wrappers, by introduction of names for
7362 wrapper functionals. This implies that addbefore, addSbefore,
7363 addaltern, and addSaltern now take a pair (name, tactic) as argument,
7364 and that adding two tactics with the same name overwrites the first
7365 one (emitting a warning).
7366 type wrapper = (int -> tactic) -> (int -> tactic)
7367 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
7368 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
7369 delWrapper, delSWrapper: claset * string -> claset
7370 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
7372 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
7373 semantics; addbefore now affects only the unsafe part of step_tac
7374 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
7375 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
7378 * Classical reasoner: setwrapper to setWrapper and compwrapper to
7379 compWrapper; added safe wrapper (and access functions for it);
7381 * HOL/split_all_tac is now much faster and fails if there is nothing
7382 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
7383 and the names of the automatically generated variables have changed.
7384 split_all_tac has moved within claset() from unsafe wrappers to safe
7385 wrappers, which means that !!-bound variables are split much more
7386 aggressively, and safe_tac and clarify_tac now split such variables.
7387 If this splitting is not appropriate, use delSWrapper "split_all_tac".
7388 Note: the same holds for record_split_tac, which does the job of
7389 split_all_tac for record fields.
7391 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
7392 permanently to the default simpset using Addsplits just like
7393 Addsimps. They can be removed via Delsplits just like
7394 Delsimps. Lower-case versions are also available.
7396 * HOL/Simplifier: The rule split_if is now part of the default
7397 simpset. This means that the simplifier will eliminate all occurrences
7398 of if-then-else in the conclusion of a goal. To prevent this, you can
7399 either remove split_if completely from the default simpset by
7400 `Delsplits [split_if]' or remove it in a specific call of the
7401 simplifier using `... delsplits [split_if]'. You can also add/delete
7402 other case splitting rules to/from the default simpset: every datatype
7403 generates suitable rules `split_t_case' and `split_t_case_asm' (where
7404 t is the name of the datatype).
7406 * Classical reasoner / Simplifier combination: new force_tac (and
7407 derivatives Force_tac, force) combines rewriting and classical
7408 reasoning (and whatever other tools) similarly to auto_tac, but is
7409 aimed to solve the given subgoal completely.
7414 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
7415 and `goalw': the theory is no longer needed as an explicit argument -
7416 the current theory context is used; assumptions are no longer returned
7417 at the ML-level unless one of them starts with ==> or !!; it is
7418 recommended to convert to these new commands using isatool fixgoal
7419 (backup your sources first!);
7421 * new top-level commands 'thm' and 'thms' for retrieving theorems from
7422 the current theory context, and 'theory' to lookup stored theories;
7424 * new theory section 'locale' for declaring constants, assumptions and
7425 definitions that have local scope;
7427 * new theory section 'nonterminals' for purely syntactic types;
7429 * new theory section 'setup' for generic ML setup functions
7430 (e.g. package initialization);
7432 * the distribution now includes Isabelle icons: see
7433 lib/logo/isabelle-{small,tiny}.xpm;
7435 * isatool install - install binaries with absolute references to
7438 * isatool logo -- create instances of the Isabelle logo (as EPS);
7440 * print mode 'emacs' reserved for Isamode;
7442 * support multiple print (ast) translations per constant name;
7444 * theorems involving oracles are now printed with a suffixed [!];
7449 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
7451 * HOL/inductive package reorganized and improved: now supports mutual
7457 oddI "n : EVEN ==> Suc n : ODD"
7458 evenI "n : ODD ==> Suc n : EVEN"
7460 new theorem list "elims" contains an elimination rule for each of the
7461 recursive sets; inductive definitions now handle disjunctive premises
7462 correctly (also ZF);
7464 INCOMPATIBILITIES: requires Inductive as an ancestor; component
7465 "mutual_induct" no longer exists - the induction rule is always
7466 contained in "induct";
7469 * HOL/datatype package re-implemented and greatly improved: now
7470 supports mutually recursive datatypes such as
7473 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
7474 | SUM ('a aexp) ('a aexp)
7475 | DIFF ('a aexp) ('a aexp)
7478 'a bexp = LESS ('a aexp) ('a aexp)
7479 | AND ('a bexp) ('a bexp)
7480 | OR ('a bexp) ('a bexp)
7482 as well as indirectly recursive datatypes such as
7485 ('a, 'b) term = Var 'a
7486 | App 'b ((('a, 'b) term) list)
7488 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
7489 induction on mutually / indirectly recursive datatypes.
7491 Primrec equations are now stored in theory and can be accessed via
7492 <function_name>.simps.
7496 - Theories using datatypes must now have theory Datatype as an
7498 - The specific <typename>.induct_tac no longer exists - use the
7499 generic induct_tac instead.
7500 - natE has been renamed to nat.exhaust - use exhaust_tac
7501 instead of res_inst_tac ... natE. Note that the variable
7502 names in nat.exhaust differ from the names in natE, this
7503 may cause some "fragile" proofs to fail.
7504 - The theorems split_<typename>_case and split_<typename>_case_asm
7505 have been renamed to <typename>.split and <typename>.split_asm.
7506 - Since default sorts of type variables are now handled correctly,
7507 some datatype definitions may have to be annotated with explicit
7509 - Primrec definitions no longer require function name and type
7510 of recursive argument.
7512 Consider using isatool fixdatatype to adapt your theories and proof
7513 scripts to the new package (backup your sources first!).
7516 * HOL/record package: considerably improved implementation; now
7517 includes concrete syntax for record types, terms, updates; theorems
7518 for surjective pairing and splitting !!-bound record variables; proof
7519 support is as follows:
7521 1) standard conversions (selectors or updates applied to record
7522 constructor terms) are part of the standard simpset;
7524 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
7525 made part of standard simpset and claset via addIffs;
7527 3) a tactic for record field splitting (record_split_tac) is part of
7528 the standard claset (addSWrapper);
7530 To get a better idea about these rules you may retrieve them via
7531 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
7532 the name of your record type.
7534 The split tactic 3) conceptually simplifies by the following rule:
7536 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
7538 Thus any record variable that is bound by meta-all will automatically
7539 blow up into some record constructor term, consequently the
7540 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
7541 solve record problems automatically.
7544 * reorganized the main HOL image: HOL/Integ and String loaded by
7545 default; theory Main includes everything;
7547 * automatic simplification of integer sums and comparisons, using cancellation;
7549 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
7551 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
7553 * many new identities for unions, intersections, set difference, etc.;
7555 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
7556 called split_if, split_split, split_sum_case and split_nat_case (to go
7557 with add/delsplits);
7559 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
7560 (?x::unit) = (); this is made part of the default simpset, which COULD
7561 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
7562 'Delsimprocs [unit_eq_proc];' as last resort); also note that
7563 unit_abs_eta_conv is added in order to counter the effect of
7564 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
7567 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
7570 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
7571 It and 'sym RS equals0D' are now in the default claset, giving automatic
7572 disjointness reasoning but breaking a few old proofs.
7574 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
7575 to 'converse' from 'inverse' (for compatibility with ZF and some
7578 * HOL/recdef can now declare non-recursive functions, with {} supplied as
7579 the well-founded relation;
7581 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
7582 Compl A. The "Compl" syntax remains available as input syntax for this
7585 * HOL/Update: new theory of function updates:
7586 f(a:=b) == %x. if x=a then b else f x
7587 may also be iterated as in f(a:=b,c:=d,...);
7589 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
7592 - new function list_update written xs[i:=v] that updates the i-th
7593 list position. May also be iterated as in xs[i:=a,j:=b,...].
7594 - new function `upt' written [i..j(] which generates the list
7595 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
7596 bound write [i..j], which is a shorthand for [i..j+1(].
7597 - new lexicographic orderings and corresponding wellfoundedness theorems.
7600 - removed 'pred' (predecessor) function;
7601 - generalized some theorems about n-1;
7602 - many new laws about "div" and "mod";
7603 - new laws about greatest common divisors (see theory ex/Primes);
7605 * HOL/Relation: renamed the relational operator r^-1 "converse"
7606 instead of "inverse";
7608 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
7609 of the multiset ordering;
7611 * directory HOL/Real: a construction of the reals using Dedekind cuts
7612 (not included by default);
7614 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
7616 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
7617 programs, i.e. different program variables may have different types.
7619 * calling (stac rew i) now fails if "rew" has no effect on the goal
7620 [previously, this check worked only if the rewrite rule was unconditional]
7621 Now rew can involve either definitions or equalities (either == or =).
7626 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
7627 only the theorems proved on ZF.ML;
7629 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
7630 It and 'sym RS equals0D' are now in the default claset, giving automatic
7631 disjointness reasoning but breaking a few old proofs.
7633 * ZF/Update: new theory of function updates
7634 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
7635 may also be iterated as in f(a:=b,c:=d,...);
7637 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
7639 * calling (stac rew i) now fails if "rew" has no effect on the goal
7640 [previously, this check worked only if the rewrite rule was unconditional]
7641 Now rew can involve either definitions or equalities (either == or =).
7643 * case_tac provided for compatibility with HOL
7644 (like the old excluded_middle_tac, but with subgoals swapped)
7647 *** Internal programming interfaces ***
7649 * Pure: several new basic modules made available for general use, see
7650 also src/Pure/README;
7652 * improved the theory data mechanism to support encapsulation (data
7653 kind name replaced by private Object.kind, acting as authorization
7654 key); new type-safe user interface via functor TheoryDataFun; generic
7655 print_data function becomes basically useless;
7657 * removed global_names compatibility flag -- all theory declarations
7658 are qualified by default;
7660 * module Pure/Syntax now offers quote / antiquote translation
7661 functions (useful for Hoare logic etc. with implicit dependencies);
7662 see HOL/ex/Antiquote for an example use;
7664 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
7667 * new tactical CHANGED_GOAL for checking that a tactic modifies a
7670 * Display.print_goals function moved to Locale.print_goals;
7672 * standard print function for goals supports current_goals_markers
7673 variable for marking begin of proof, end of proof, start of goal; the
7674 default is ("", "", ""); setting current_goals_markers := ("<proof>",
7675 "</proof>", "<goal>") causes SGML like tagged proof state printing,
7680 New in Isabelle98 (January 1998)
7681 --------------------------------
7683 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7685 * changed lexical syntax of terms / types: dots made part of long
7686 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
7688 * simpset (and claset) reference variable replaced by functions
7689 simpset / simpset_ref;
7691 * no longer supports theory aliases (via merge) and non-trivial
7692 implicit merge of thms' signatures;
7694 * most internal names of constants changed due to qualified names;
7696 * changed Pure/Sequence interface (see Pure/seq.ML);
7699 *** General Changes ***
7701 * hierachically structured name spaces (for consts, types, axms, thms
7702 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
7703 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
7704 isatool fixdots ensures space after dots (e.g. "%x. x"); set
7705 long_names for fully qualified output names; NOTE: ML programs
7706 (special tactics, packages etc.) referring to internal names may have
7707 to be adapted to cope with fully qualified names; in case of severe
7708 backward campatibility problems try setting 'global_names' at compile
7709 time to have enrything declared within a flat name space; one may also
7710 fine tune name declarations in theories via the 'global' and 'local'
7713 * reimplemented the implicit simpset and claset using the new anytype
7714 data filed in signatures; references simpset:simpset ref etc. are
7715 replaced by functions simpset:unit->simpset and
7716 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
7717 to patch your ML files accordingly;
7719 * HTML output now includes theory graph data for display with Java
7720 applet or isatool browser; data generated automatically via isatool
7721 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
7723 * defs may now be conditional; improved rewrite_goals_tac to handle
7724 conditional equations;
7726 * defs now admits additional type arguments, using TYPE('a) syntax;
7728 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
7729 creates a new theory node; implicit merge of thms' signatures is
7730 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
7731 transfer:theory->thm->thm in (rare) cases;
7733 * improved handling of draft signatures / theories; draft thms (and
7734 ctyps, cterms) are automatically promoted to real ones;
7736 * slightly changed interfaces for oracles: admit many per theory, named
7737 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
7739 * print_goals: optional output of const types (set show_consts and
7742 * improved output of warnings (###) and errors (***);
7744 * subgoal_tac displays a warning if the new subgoal has type variables;
7746 * removed old README and Makefiles;
7748 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
7750 * removed obsolete init_pps and init_database;
7752 * deleted the obsolete tactical STATE, which was declared by
7753 fun STATE tacfun st = tacfun st st;
7755 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
7756 (which abbreviates $HOME);
7758 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
7759 use isatool fixseq to adapt your ML programs (this works for fully
7760 qualified references to the Sequence structure only!);
7762 * use_thy no longer requires writable current directory; it always
7763 reloads .ML *and* .thy file, if either one is out of date;
7766 *** Classical Reasoner ***
7768 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
7769 tactics that use classical reasoning to simplify a subgoal without
7770 splitting it into several subgoals;
7772 * Safe_tac: like safe_tac but uses the default claset;
7777 * added simplification meta rules:
7778 (asm_)(full_)simplify: simpset -> thm -> thm;
7780 * simplifier.ML no longer part of Pure -- has to be loaded by object
7783 * added prems argument to simplification procedures;
7785 * HOL, FOL, ZF: added infix function `addsplits':
7786 instead of `<simpset> setloop (split_tac <thms>)'
7787 you can simply write `<simpset> addsplits <thms>'
7792 * TYPE('a) syntax for type reflection terms;
7794 * no longer handles consts with name "" -- declare as 'syntax' instead;
7796 * pretty printer: changed order of mixfix annotation preference (again!);
7798 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7803 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7804 with `addloop' of the simplifier to faciliate case splitting in premises.
7806 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7808 * HOL/Auth: new protocol proofs including some for the Internet
7811 * HOL/Map: new theory of `maps' a la VDM;
7813 * HOL/simplifier: simplification procedures nat_cancel_sums for
7814 cancelling out common nat summands from =, <, <= (in)equalities, or
7815 differences; simplification procedures nat_cancel_factor for
7816 cancelling common factor from =, <, <= (in)equalities over natural
7817 sums; nat_cancel contains both kinds of procedures, it is installed by
7818 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7820 * HOL/simplifier: terms of the form
7821 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7823 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7824 and those of the form
7825 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7827 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7830 Each datatype `t' now comes with a theorem `split_t_case' of the form
7832 P(t_case f1 ... fn x) =
7833 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7835 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7838 and a theorem `split_t_case_asm' of the form
7840 P(t_case f1 ... fn x) =
7841 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7843 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7845 which can be added to a simpset via `addsplits'. The existing theorems
7846 expand_list_case and expand_option_case have been renamed to
7847 split_list_case and split_option_case.
7850 - `pred n' is automatically converted to `n-1'.
7851 Users are strongly encouraged not to use `pred' any longer,
7852 because it will disappear altogether at some point.
7853 - Users are strongly encouraged to write "0 < n" rather than
7854 "n ~= 0". Theorems and proof tools have been modified towards this
7858 the function "set_of_list" has been renamed "set" (and its theorems too);
7859 the function "nth" now takes its arguments in the reverse order and
7860 has acquired the infix notation "!" as in "xs!n".
7862 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7864 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7865 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7867 * HOL/record: extensible records with schematic structural subtyping
7868 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7869 still lacks various theorems and concrete record syntax;
7874 * removed "axioms" and "generated by" sections;
7876 * replaced "ops" section by extended "consts" section, which is capable of
7877 handling the continuous function space "->" directly;
7880 . proves theorems immediately and stores them in the theory,
7881 . creates hierachical name space,
7882 . now uses normal mixfix annotations (instead of cinfix...),
7883 . minor changes to some names and values (for consistency),
7884 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7885 . separator between mutual domain defs: changed "," to "and",
7886 . improved handling of sort constraints; now they have to
7887 appear on the left-hand side of the equations only;
7889 * fixed LAM <x,y,zs>.b syntax;
7891 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7892 adm (%x. P (t x)), where P is chainfinite and t continuous;
7897 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7898 with `addloop' of the simplifier to faciliate case splitting in premises.
7900 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7901 in HOL, they strip ALL and --> from proved theorems;
7905 New in Isabelle94-8 (May 1997)
7906 ------------------------------
7908 *** General Changes ***
7910 * new utilities to build / run / maintain Isabelle etc. (in parts
7911 still somewhat experimental); old Makefiles etc. still functional;
7913 * new 'Isabelle System Manual';
7915 * INSTALL text, together with ./configure and ./build scripts;
7917 * reimplemented type inference for greater efficiency, better error
7918 messages and clean internal interface;
7920 * prlim command for dealing with lots of subgoals (an easier way of
7921 setting goals_limit);
7926 * supports alternative (named) syntax tables (parser and pretty
7927 printer); internal interface is provided by add_modesyntax(_i);
7929 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7930 be used in conjunction with the Isabelle symbol font; uses the
7931 "symbols" syntax table;
7933 * added token_translation interface (may translate name tokens in
7934 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7935 the current print_mode); IMPORTANT: user print translation functions
7936 are responsible for marking newly introduced bounds
7937 (Syntax.mark_boundT);
7939 * token translations for modes "xterm" and "xterm_color" that display
7940 names in bold, underline etc. or colors (which requires a color
7943 * infixes may now be declared with names independent of their syntax;
7945 * added typed_print_translation (like print_translation, but may
7946 access type of constant);
7949 *** Classical Reasoner ***
7951 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7952 some limitations. Blast_tac...
7953 + ignores addss, addbefore, addafter; this restriction is intrinsic
7954 + ignores elimination rules that don't have the correct format
7955 (the conclusion MUST be a formula variable)
7956 + ignores types, which can make HOL proofs fail
7957 + rules must not require higher-order unification, e.g. apply_type in ZF
7958 [message "Function Var's argument not a bound variable" relates to this]
7959 + its proof strategy is more general but can actually be slower
7961 * substitution with equality assumptions no longer permutes other
7964 * minor changes in semantics of addafter (now called addaltern); renamed
7965 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7966 (and access functions for it);
7968 * improved combination of classical reasoner and simplifier:
7969 + functions for handling clasimpsets
7970 + improvement of addss: now the simplifier is called _after_ the
7972 + safe variant of addss called addSss: uses safe simplifications
7973 _during_ the safe steps. It is more complete as it allows multiple
7974 instantiations of unknowns (e.g. with slow_tac).
7978 * added interface for simplification procedures (functions that
7979 produce *proven* rewrite rules on the fly, depending on current
7982 * ordering on terms as parameter (used for ordered rewriting);
7984 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7986 * the solver is now split into a safe and an unsafe part.
7987 This should be invisible for the normal user, except that the
7988 functions setsolver and addsolver have been renamed to setSolver and
7989 addSolver; added safe_asm_full_simp_tac;
7994 * a generic induction tactic `induct_tac' which works for all datatypes and
7995 also for type `nat';
7997 * a generic case distinction tactic `exhaust_tac' which works for all
7998 datatypes and also for type `nat';
8000 * each datatype comes with a function `size';
8002 * patterns in case expressions allow tuple patterns as arguments to
8003 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
8005 * primrec now also works with type nat;
8007 * recdef: a new declaration form, allows general recursive functions to be
8008 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
8010 * the constant for negation has been renamed from "not" to "Not" to
8011 harmonize with FOL, ZF, LK, etc.;
8013 * HOL/ex/LFilter theory of a corecursive "filter" functional for
8016 * HOL/Modelcheck demonstrates invocation of model checker oracle;
8018 * HOL/ex/Ring.thy declares cring_simp, which solves equational
8019 problems in commutative rings, using axiomatic type classes for + and *;
8021 * more examples in HOL/MiniML and HOL/Auth;
8023 * more default rewrite rules for quantifiers, union/intersection;
8025 * a new constant `arbitrary == @x.False';
8027 * HOLCF/IOA replaces old HOL/IOA;
8029 * HOLCF changes: derived all rules and arities
8030 + axiomatic type classes instead of classes
8031 + typedef instead of faking type definitions
8032 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
8033 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
8034 + eliminated the types void, one, tr
8035 + use unit lift and bool lift (with translations) instead of one and tr
8036 + eliminated blift from Lift3.thy (use Def instead of blift)
8037 all eliminated rules are derived as theorems --> no visible changes ;
8042 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
8043 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
8044 as ZF_cs addSIs [equalityI];
8048 New in Isabelle94-7 (November 96)
8049 ---------------------------------
8051 * allowing negative levels (as offsets) in prlev and choplev;
8053 * super-linear speedup for large simplifications;
8055 * FOL, ZF and HOL now use miniscoping: rewriting pushes
8056 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
8057 FAIL); can suppress it using the command Delsimps (ex_simps @
8058 all_simps); De Morgan laws are also now included, by default;
8060 * improved printing of ==> : ~:
8062 * new object-logic "Sequents" adds linear logic, while replacing LK
8063 and Modal (thanks to Sara Kalvala);
8065 * HOL/Auth: correctness proofs for authentication protocols;
8067 * HOL: new auto_tac combines rewriting and classical reasoning (many
8068 examples on HOL/Auth);
8070 * HOL: new command AddIffs for declaring theorems of the form P=Q to
8071 the rewriter and classical reasoner simultaneously;
8073 * function uresult no longer returns theorems in "standard" format;
8074 regain previous version by: val uresult = standard o uresult;
8081 * oracles -- these establish an interface between Isabelle and trusted
8082 external reasoners, which may deliver results as theorems;
8084 * proof objects (in particular record all uses of oracles);
8086 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
8088 * "constdefs" section in theory files;
8090 * "primrec" section (HOL) no longer requires names;
8092 * internal type "tactic" now simply "thm -> thm Sequence.seq";
8099 * reduced space requirements;
8101 * automatic HTML generation from theories;
8103 * theory files no longer require "..." (quotes) around most types;
8105 * new examples, including two proofs of the Church-Rosser theorem;
8107 * non-curried (1994) version of HOL is no longer distributed;
8114 * greatly reduced space requirements;
8116 * theory files (.thy) no longer require \...\ escapes at line breaks;
8118 * searchable theorem database (see the section "Retrieving theorems" on
8119 page 8 of the Reference Manual);
8121 * new examples, including Grabczewski's monumental case study of the
8124 * The previous version of HOL renamed to Old_HOL;
8126 * The new version of HOL (previously called CHOL) uses a curried syntax
8127 for functions. Application looks like f a b instead of f(a,b);
8129 * Mutually recursive inductive definitions finally work in HOL;
8131 * In ZF, pattern-matching on tuples is now available in all abstractions and
8132 translates to the operator "split";
8139 * new infix operator, addss, allowing the classical reasoner to
8140 perform simplification at each step of its search. Example:
8141 fast_tac (cs addss ss)
8143 * a new logic, CHOL, the same as HOL, but with a curried syntax
8144 for functions. Application looks like f a b instead of f(a,b). Also pairs
8145 look like (a,b) instead of <a,b>;
8147 * PLEASE NOTE: CHOL will eventually replace HOL!
8149 * In CHOL, pattern-matching on tuples is now available in all abstractions.
8150 It translates to the operator "split". A new theory of integers is available;
8152 * In ZF, integer numerals now denote two's-complement binary integers.
8153 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
8155 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
8156 of the Axiom of Choice;
8163 * Significantly faster resolution;
8165 * the different sections in a .thy file can now be mixed and repeated
8168 * Database of theorems for FOL, HOL and ZF. New
8169 commands including qed, qed_goal and bind_thm store theorems in the database.
8171 * Simple database queries: return a named theorem (get_thm) or all theorems of
8172 a given theory (thms_of), or find out what theory a theorem was proved in
8175 * Bugs fixed in the inductive definition and datatype packages;
8177 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
8178 and HOL_dup_cs obsolete;
8180 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
8183 * Simpler definition of function space in ZF;
8185 * new results about cardinal and ordinal arithmetic in ZF;
8187 * 'subtype' facility in HOL for introducing new types as subsets of existing
8190 :mode=text:wrap=hard:maxLineLen=72: