Name_Space: proper configuration options long_names, short_names, unique_names instead of former unsynchronized references;
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]]
51 - Added "need" and "total_consts" options.
52 - Reintroduced "show_skolems" option by popular demand.
53 - Renamed attribute: nitpick_def ~> nitpick_unfold.
57 - sledgehammer available_provers ~> sledgehammer supported_provers
59 - Added "monomorphize", "monomorphize_limit", and "type_sys" options.
62 - Added "simp:", "intro:", and "elim:" options.
65 - Added "eval" option to evaluate terms for the found counterexample
66 (currently only supported by the default (exhaustive) tester)
67 - Added post-processing of terms to obtain readable counterexamples
68 (currently only supported by the default (exhaustive) tester)
70 * Function package: discontinued option "tailrec".
71 INCOMPATIBILITY. Use partial_function instead.
74 - Caratheodory's extension lemma is now proved for ring_of_sets.
75 - Infinite products of probability measures are now available.
76 - Use extended reals instead of positive extended reals.
79 *** Document preparation ***
81 * New term style "isub" as ad-hoc conversion of variables x1, y23 into
82 subscripted form x\<^isub>1, y\<^isub>2\<^isub>3.
87 * Structure Timing provides various operations for timing; supersedes
88 former start_timing/end_timing etc.
90 * Path.print is the official way to show file-system paths to users
91 (including quotes etc.).
93 * Inner syntax: identifiers in parse trees of generic categories
94 "logic", "aprop", "idt" etc. carry position information (disguised as
95 type constraints). Occasional INCOMPATIBILITY with non-compliant
96 translations that choke on unexpected type constraints. Positions can
97 be stripped in ML translations via Syntax.strip_positions /
98 Syntax.strip_positions_ast, or via the syntax constant
99 "_strip_positions" within parse trees. As last resort, positions can
100 be disabled via the configuration option Syntax.positions, which is
101 called "syntax_positions" in Isar attribute syntax.
103 * Discontinued special status of various ML structures that contribute
104 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
105 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
106 refer directly to Ast.Constant, Lexicon.is_identifier,
107 Syntax_Trans.mk_binder_tr etc.
109 * Typed print translation: discontinued show_sorts argument, which is
110 already available via context of "advanced" translation.
114 New in Isabelle2011 (January 2011)
115 ----------------------------------
119 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
120 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
121 useful tooltips and hyperlinks produced from its static analysis. The
122 bundled component provides an executable Isabelle tool that can be run
125 Isabelle2011/bin/isabelle jedit
127 * Significantly improved Isabelle/Isar implementation manual.
129 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
130 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
131 while the default heap location within that directory lacks that extra
132 suffix. This isolates multiple Isabelle installations from each
133 other, avoiding problems with old settings in new versions.
134 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
136 * Source files are always encoded as UTF-8, instead of old-fashioned
137 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
138 the following package declarations:
140 \usepackage[utf8]{inputenc}
141 \usepackage{textcomp}
143 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
144 a Unicode character is treated as a single symbol, not a sequence of
145 non-ASCII bytes as before. Since Isabelle/ML string literals may
146 contain symbols without further backslash escapes, Unicode can now be
147 used here as well. Recall that Symbol.explode in ML provides a
148 consistent view on symbols, while raw explode (or String.explode)
149 merely give a byte-oriented representation.
151 * Theory loader: source files are primarily located via the master
152 directory of each theory node (where the .thy file itself resides).
153 The global load path is still partially available as legacy feature.
154 Minor INCOMPATIBILITY due to subtle change in file lookup: use
155 explicit paths, relatively to the theory.
157 * Special treatment of ML file names has been discontinued.
158 Historically, optional extensions .ML or .sml were added on demand --
159 at the cost of clarity of file dependencies. Recall that Isabelle/ML
160 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
162 * Various options that affect pretty printing etc. are now properly
163 handled within the context via configuration options, instead of
164 unsynchronized references or print modes. There are both ML Config.T
165 entities and Isar declaration attributes to access these.
167 ML (Config.T) Isar (attribute)
169 eta_contract eta_contract
170 show_brackets show_brackets
171 show_sorts show_sorts
172 show_types show_types
173 show_question_marks show_question_marks
174 show_consts show_consts
175 show_abbrevs show_abbrevs
177 Syntax.ast_trace syntax_ast_trace
178 Syntax.ast_stat syntax_ast_stat
179 Syntax.ambiguity_level syntax_ambiguity_level
181 Goal_Display.goals_limit goals_limit
182 Goal_Display.show_main_goal show_main_goal
184 Method.rule_trace rule_trace
186 Thy_Output.display thy_output_display
187 Thy_Output.quotes thy_output_quotes
188 Thy_Output.indent thy_output_indent
189 Thy_Output.source thy_output_source
190 Thy_Output.break thy_output_break
192 Note that corresponding "..._default" references in ML may only be
193 changed globally at the ROOT session setup, but *not* within a theory.
194 The option "show_abbrevs" supersedes the former print mode
195 "no_abbrevs" with inverted meaning.
197 * More systematic naming of some configuration options.
200 trace_simp ~> simp_trace
201 debug_simp ~> simp_debug
203 * Support for real valued configuration options, using simplistic
204 floating-point notation that coincides with the inner syntax for
207 * Support for real valued preferences (with approximative PGIP type):
208 front-ends need to accept "pgint" values in float notation.
211 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
214 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
219 * Command 'type_synonym' (with single argument) replaces somewhat
220 outdated 'types', which is still available as legacy feature for some
223 * Command 'nonterminal' (with 'and' separated list of arguments)
224 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
226 * Command 'notepad' replaces former 'example_proof' for
227 experimentation in Isar without any result. INCOMPATIBILITY.
229 * Locale interpretation commands 'interpret' and 'sublocale' accept
230 lists of equations to map definitions in a locale to appropriate
231 entities in the context of the interpretation. The 'interpretation'
232 command already provided this functionality.
234 * Diagnostic command 'print_dependencies' prints the locale instances
235 that would be activated if the specified expression was interpreted in
236 the current context. Variant "print_dependencies!" assumes a context
237 without interpretations.
239 * Diagnostic command 'print_interps' prints interpretations in proofs
240 in addition to interpretations in theories.
242 * Discontinued obsolete 'global' and 'local' commands to manipulate
243 the theory name space. Rare INCOMPATIBILITY. The ML functions
244 Sign.root_path and Sign.local_path may be applied directly where this
245 feature is still required for historical reasons.
247 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
248 'definition' instead.
250 * The "prems" fact, which refers to the accidental collection of
251 foundational premises in the context, is now explicitly marked as
252 legacy feature and will be discontinued soon. Consider using "assms"
253 of the head statement or reference facts by explicit names.
255 * Document antiquotations @{class} and @{type} print classes and type
258 * Document antiquotation @{file} checks file/directory entries within
259 the local file system.
264 * Coercive subtyping: functions can be declared as coercions and type
265 inference will add them as necessary upon input of a term. Theory
266 Complex_Main declares real :: nat => real and real :: int => real as
267 coercions. A coercion function f is declared like this:
269 declare [[coercion f]]
271 To lift coercions through type constructors (e.g. from nat => real to
272 nat list => real list), map functions can be declared, e.g.
274 declare [[coercion_map map]]
276 Currently coercion inference is activated only in theories including
277 real numbers, i.e. descendants of Complex_Main. This is controlled by
278 the configuration option "coercion_enabled", e.g. it can be enabled in
279 other theories like this:
281 declare [[coercion_enabled]]
283 * Command 'partial_function' provides basic support for recursive
284 function definitions over complete partial orders. Concrete instances
285 are provided for i) the option type, ii) tail recursion on arbitrary
286 types, and iii) the heap monad of Imperative_HOL. See
287 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
290 * Function package: f.psimps rules are no longer implicitly declared
291 as [simp]. INCOMPATIBILITY.
293 * Datatype package: theorems generated for executable equality (class
294 "eq") carry proper names and are treated as default code equations.
296 * Inductive package: now offers command 'inductive_simps' to
297 automatically derive instantiated and simplified equations for
298 inductive predicates, similar to 'inductive_cases'.
300 * Command 'enriched_type' allows to register properties of the
301 functorial structure of types.
303 * Improved infrastructure for term evaluation using code generator
304 techniques, in particular static evaluation conversions.
306 * Code generator: Scala (2.8 or higher) has been added to the target
309 * Code generator: globbing constant expressions "*" and "Theory.*"
310 have been replaced by the more idiomatic "_" and "Theory._".
313 * Code generator: export_code without explicit file declaration prints
314 to standard output. INCOMPATIBILITY.
316 * Code generator: do not print function definitions for case
317 combinators any longer.
319 * Code generator: simplification with rules determined with
320 src/Tools/Code/code_simp.ML and method "code_simp".
322 * Code generator for records: more idiomatic representation of record
323 types. Warning: records are not covered by ancient SML code
324 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
325 rep_datatype declaration helps to succeed then:
329 rep_datatype foo_ext ...
331 * Records: logical foundation type for records does not carry a
332 '_type' suffix any longer (obsolete due to authentic syntax).
335 * Quickcheck now by default uses exhaustive testing instead of random
336 testing. Random testing can be invoked by "quickcheck [random]",
337 exhaustive testing by "quickcheck [exhaustive]".
339 * Quickcheck instantiates polymorphic types with small finite
340 datatypes by default. This enables a simple execution mechanism to
341 handle quantifiers and function equality over the finite datatypes.
343 * Quickcheck random generator has been renamed from "code" to
344 "random". INCOMPATIBILITY.
346 * Quickcheck now has a configurable time limit which is set to 30
347 seconds by default. This can be changed by adding [timeout = n] to the
348 quickcheck command. The time limit for Auto Quickcheck is still set
351 * Quickcheck in locales considers interpretations of that locale for
352 counter example search.
355 - Added "smt" and "remote_smt" provers based on the "smt" proof
356 method. See the Sledgehammer manual for details ("isabelle doc
359 sledgehammer atp_info ~> sledgehammer running_provers
360 sledgehammer atp_kill ~> sledgehammer kill_provers
361 sledgehammer available_atps ~> sledgehammer available_provers
364 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
365 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
366 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
367 (and "ms" and "min" are no longer supported)
372 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
373 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
375 - Added support for partial quotient types.
376 - Added local versions of the "Nitpick.register_xxx" functions.
377 - Added "whack" option.
378 - Allow registration of quotient types as codatatypes.
379 - Improved "merge_type_vars" option to merge more types.
380 - Removed unsound "fast_descrs" option.
381 - Added custom symmetry breaking for datatypes, making it possible to reach
382 higher cardinalities.
383 - Prevent the expansion of too large definitions.
385 * Proof methods "metis" and "meson" now have configuration options
386 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
387 to diagnose these tools. E.g.
389 using [[metis_trace = true]]
391 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
392 manually as command 'solve_direct'.
394 * The default SMT solver Z3 must be enabled explicitly (due to
395 licensing issues) by setting the environment variable
396 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
397 commercial applications, the SMT solver CVC3 is provided as fall-back;
398 changing the SMT solver is done via the configuration option
401 * Remote SMT solvers need to be referred to by the "remote_" prefix,
402 i.e. "remote_cvc3" and "remote_z3".
404 * Added basic SMT support for datatypes, records, and typedefs using
405 the oracle mode (no proofs). Direct support of pairs has been dropped
406 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
407 support for a similar behavior). Minor INCOMPATIBILITY.
409 * Changed SMT configuration options:
411 z3_proofs ~> smt_oracle (with inverted meaning)
412 z3_trace_assms ~> smt_trace_used_facts
425 * Boogie output files (.b2i files) need to be declared in the theory
428 * Simplification procedure "list_to_set_comprehension" rewrites list
429 comprehensions applied to List.set to set comprehensions. Occasional
430 INCOMPATIBILITY, may be deactivated like this:
432 declare [[simproc del: list_to_set_comprehension]]
434 * Removed old version of primrec package. INCOMPATIBILITY.
436 * Removed simplifier congruence rule of "prod_case", as has for long
437 been the case with "split". INCOMPATIBILITY.
439 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
441 * Removed [split_format ... and ... and ...] version of
442 [split_format]. Potential INCOMPATIBILITY.
444 * Predicate "sorted" now defined inductively, with nice induction
445 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
447 * Constant "contents" renamed to "the_elem", to free the generic name
448 contents for other uses. INCOMPATIBILITY.
450 * Renamed class eq and constant eq (for code generation) to class
451 equal and constant equal, plus renaming of related facts and various
452 tuning. INCOMPATIBILITY.
454 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
456 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
459 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
460 avoid confusion with finite sets. INCOMPATIBILITY.
462 * Abandoned locales equiv, congruent and congruent2 for equivalence
463 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
466 * Some previously unqualified names have been qualified:
473 Trueprop ~> HOL.Trueprop
478 op --> ~> HOL.implies
490 Pair ~> Product_Type.Pair
491 fst ~> Product_Type.fst
492 snd ~> Product_Type.snd
493 curry ~> Product_Type.curry
495 Collect ~> Set.Collect
499 * More canonical naming convention for some fundamental definitions:
501 bot_bool_eq ~> bot_bool_def
502 top_bool_eq ~> top_bool_def
503 inf_bool_eq ~> inf_bool_def
504 sup_bool_eq ~> sup_bool_def
505 bot_fun_eq ~> bot_fun_def
506 top_fun_eq ~> top_fun_def
507 inf_fun_eq ~> inf_fun_def
508 sup_fun_eq ~> sup_fun_def
512 * More stylized fact names:
514 expand_fun_eq ~> fun_eq_iff
515 expand_set_eq ~> set_eq_iff
517 nat_number ~> eval_nat_numeral
521 * Refactoring of code-generation specific operations in theory List:
527 mem_iff ~> member_def
528 null_empty ~> null_def
530 INCOMPATIBILITY. Note that these were not supposed to be used
531 regularly unless for striking reasons; their main purpose was code
534 Various operations from the Haskell prelude are used for generating
537 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
538 "surj f" is now an abbreviation of "range f = UNIV". The theorems
539 bij_def and surj_def are unchanged. INCOMPATIBILITY.
541 * Abolished some non-alphabetic type names: "prod" and "sum" replace
542 "*" and "+" respectively. INCOMPATIBILITY.
544 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
545 "Sum_Type.Plus" instead.
547 * Constant "split" has been merged with constant "prod_case"; names of
548 ML functions, facts etc. involving split have been retained so far,
549 though. INCOMPATIBILITY.
551 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
552 instead. INCOMPATIBILITY.
554 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
557 * Former theory Library/Enum is now part of the HOL-Main image.
558 INCOMPATIBILITY: all constants of the Enum theory now have to be
559 referred to by its qualified name.
562 nlists ~> Enum.nlists
563 product ~> Enum.product
565 * Theory Library/Monad_Syntax provides do-syntax for monad types.
566 Syntax in Library/State_Monad has been changed to avoid ambiguities.
569 * Theory Library/SetsAndFunctions has been split into
570 Library/Function_Algebras and Library/Set_Algebras; canonical names
571 for instance definitions for functions; various improvements.
574 * Theory Library/Multiset provides stable quicksort implementation of
577 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
580 * Session Multivariate_Analysis: introduced a type class for euclidean
581 space. Most theorems are now stated in terms of euclidean spaces
582 instead of finite cartesian products.
585 real ^ 'n ~> 'a::real_vector
586 ~> 'a::euclidean_space
587 ~> 'a::ordered_euclidean_space
588 (depends on your needs)
592 \<chi> x. _ ~> \<chi>\<chi> x. _
595 Also note that the indices are now natural numbers and not from some
596 finite type. Finite cartesian products of euclidean spaces, products
597 of euclidean spaces the real and complex numbers are instantiated to
598 be euclidean_spaces. INCOMPATIBILITY.
600 * Session Probability: introduced pextreal as positive extended real
601 numbers. Use pextreal as value for measures. Introduce the
602 Radon-Nikodym derivative, product spaces and Fubini's theorem for
603 arbitrary sigma finite measures. Introduces Lebesgue measure based on
604 the integral in Multivariate Analysis. INCOMPATIBILITY.
606 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
609 * Session SPARK (with image HOL-SPARK) provides commands to load and
610 prove verification conditions generated by the SPARK Ada program
611 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
616 * Theorems for additive ring operations (locale abelian_monoid and
617 descendants) are generated by interpretation from their multiplicative
618 counterparts. Names (in particular theorem names) have the mandatory
619 qualifier 'add'. Previous theorem names are redeclared for
622 * Structure "int_ring" is now an abbreviation (previously a
623 definition). This fits more natural with advanced interpretations.
628 * The domain package now runs in definitional mode by default: The
629 former command 'new_domain' is now called 'domain'. To use the domain
630 package in its original axiomatic mode, use 'domain (unsafe)'.
633 * The new class "domain" is now the default sort. Class "predomain"
634 is an unpointed version of "domain". Theories can be updated by
635 replacing sort annotations as shown below. INCOMPATIBILITY.
637 'a::type ~> 'a::countable
638 'a::cpo ~> 'a::predomain
639 'a::pcpo ~> 'a::domain
641 * The old type class "rep" has been superseded by class "domain".
642 Accordingly, users of the definitional package must remove any
643 "default_sort rep" declarations. INCOMPATIBILITY.
645 * The domain package (definitional mode) now supports unpointed
646 predomain argument types, as long as they are marked 'lazy'. (Strict
647 arguments must be in class "domain".) For example, the following
648 domain definition now works:
650 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
652 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
653 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
654 'a option, and 'a list. Additionally, it configures fixrec and the
655 domain package to work with these types. For example:
657 fixrec isInl :: "('a + 'b) u -> tr"
658 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
660 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
662 * The "(permissive)" option of fixrec has been replaced with a
663 per-equation "(unchecked)" option. See
664 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
666 * The "bifinite" class no longer fixes a constant "approx"; the class
667 now just asserts that such a function exists. INCOMPATIBILITY.
669 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
670 defines an embedding of type 'a defl into udom by default; instances
671 of "bifinite" and "domain" classes are available in
672 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
674 * The syntax "REP('a)" has been replaced with "DEFL('a)".
676 * The predicate "directed" has been removed. INCOMPATIBILITY.
678 * The type class "finite_po" has been removed. INCOMPATIBILITY.
680 * The function "cprod_map" has been renamed to "prod_map".
683 * The monadic bind operator on each powerdomain has new binder syntax
684 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
685 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
687 * The infix syntax for binary union on each powerdomain has changed
688 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
689 syntax. INCOMPATIBILITY.
691 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
692 still supported as an input translation.
694 * Renamed some theorems (the original names are also still available).
696 expand_fun_below ~> fun_below_iff
697 below_fun_ext ~> fun_belowI
698 expand_cfun_eq ~> cfun_eq_iff
700 expand_cfun_below ~> cfun_below_iff
701 below_cfun_ext ~> cfun_belowI
702 cont2cont_Rep_CFun ~> cont2cont_APP
704 * The Abs and Rep functions for various types have changed names.
705 Related theorem names have also changed to match. INCOMPATIBILITY.
709 Rep_Sprod ~> Rep_sprod
710 Abs_Sprod ~> Abs_sprod
714 * Lemmas with names of the form *_defined_iff or *_strict_iff have
715 been renamed to *_bottom_iff. INCOMPATIBILITY.
717 * Various changes to bisimulation/coinduction with domain package:
719 - Definitions of "bisim" constants no longer mention definedness.
720 - With mutual recursion, "bisim" predicate is now curried.
721 - With mutual recursion, each type gets a separate coind theorem.
722 - Variable names in bisim_def and coinduct rules have changed.
726 * Case combinators generated by the domain package for type "foo" are
727 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
729 * Several theorems have been renamed to more accurately reflect the
730 names of constants and types involved. INCOMPATIBILITY.
732 thelub_const ~> lub_const
733 lub_const ~> is_lub_const
735 is_lub_lub ~> is_lubD2
737 unique_lub ~> is_lub_unique
738 is_ub_lub ~> is_lub_rangeD1
739 lub_bin_chain ~> is_lub_bin_chain
740 lub_fun ~> is_lub_fun
741 thelub_fun ~> lub_fun
742 thelub_cfun ~> lub_cfun
743 thelub_Pair ~> lub_Pair
744 lub_cprod ~> is_lub_prod
745 thelub_cprod ~> lub_prod
746 minimal_cprod ~> minimal_prod
747 inst_cprod_pcpo ~> inst_prod_pcpo
749 compact_UU ~> compact_bottom
750 deflation_UU ~> deflation_bottom
751 finite_deflation_UU ~> finite_deflation_bottom
753 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
755 sq_ord_less_eq_trans ~> below_eq_trans
756 sq_ord_eq_less_trans ~> eq_below_trans
757 refl_less ~> below_refl
758 trans_less ~> below_trans
759 antisym_less ~> below_antisym
760 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
761 box_less ~> box_below
762 rev_trans_less ~> rev_below_trans
763 not_less2not_eq ~> not_below2not_eq
764 less_UU_iff ~> below_UU_iff
765 flat_less_iff ~> flat_below_iff
766 adm_less ~> adm_below
767 adm_not_less ~> adm_not_below
768 adm_compact_not_less ~> adm_compact_not_below
769 less_fun_def ~> below_fun_def
770 expand_fun_less ~> fun_below_iff
771 less_fun_ext ~> fun_belowI
772 less_discr_def ~> below_discr_def
773 discr_less_eq ~> discr_below_eq
774 less_unit_def ~> below_unit_def
775 less_cprod_def ~> below_prod_def
776 prod_lessI ~> prod_belowI
777 Pair_less_iff ~> Pair_below_iff
778 fst_less_iff ~> fst_below_iff
779 snd_less_iff ~> snd_below_iff
780 expand_cfun_less ~> cfun_below_iff
781 less_cfun_ext ~> cfun_belowI
782 injection_less ~> injection_below
783 less_up_def ~> below_up_def
784 not_Iup_less ~> not_Iup_below
785 Iup_less ~> Iup_below
787 Def_inject_less_eq ~> Def_below_Def
788 Def_less_is_eq ~> Def_below_iff
789 spair_less_iff ~> spair_below_iff
790 less_sprod ~> below_sprod
791 spair_less ~> spair_below
792 sfst_less_iff ~> sfst_below_iff
793 ssnd_less_iff ~> ssnd_below_iff
794 fix_least_less ~> fix_least_below
795 dist_less_one ~> dist_below_one
796 less_ONE ~> below_ONE
797 ONE_less_iff ~> ONE_below_iff
798 less_sinlD ~> below_sinlD
799 less_sinrD ~> below_sinrD
804 * All constant names are now qualified internally and use proper
805 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
810 * Antiquotation @{assert} inlines a function bool -> unit that raises
811 Fail if the argument is false. Due to inlining the source position of
812 failed assertions is included in the error output.
814 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
815 text is in practice always evaluated with a stable theory checkpoint.
816 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
818 * Antiquotation @{theory A} refers to theory A from the ancestry of
819 the current context, not any accidental theory loader state as before.
820 Potential INCOMPATIBILITY, subtle change in semantics.
822 * Syntax.pretty_priority (default 0) configures the required priority
823 of pretty-printed output and thus affects insertion of parentheses.
825 * Syntax.default_root (default "any") configures the inner syntax
826 category (nonterminal symbol) for parsing of terms.
828 * Former exception Library.UnequalLengths now coincides with
829 ListPair.UnequalLengths.
831 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
832 main functionality is provided by structure Simplifier.
834 * Renamed raw "explode" function to "raw_explode" to emphasize its
835 meaning. Note that internally to Isabelle, Symbol.explode is used in
836 almost all situations.
838 * Discontinued obsolete function sys_error and exception SYS_ERROR.
839 See implementation manual for further details on exceptions in
842 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
845 * Renamed structure PureThy to Pure_Thy and moved most of its
846 operations to structure Global_Theory, to emphasize that this is
847 rarely-used global-only stuff.
849 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
850 instead (or tracing for high-volume output).
852 * Configuration option show_question_marks only affects regular pretty
853 printing of types and terms, not raw Term.string_of_vname.
855 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
856 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
857 @{thms} for most purposes.
859 * ML structure Unsynchronized is never opened, not even in Isar
860 interaction mode as before. Old Unsynchronized.set etc. have been
861 discontinued -- use plain := instead. This should be *rare* anyway,
862 since modern tools always work via official context data, notably
863 configuration options.
865 * Parallel and asynchronous execution requires special care concerning
866 interrupts. Structure Exn provides some convenience functions that
867 avoid working directly with raw Interrupt. User code must not absorb
868 interrupts -- intermediate handling (for cleanup etc.) needs to be
869 followed by re-raising of the original exception. Another common
870 source of mistakes are "handle _" patterns, which make the meaning of
871 the program subject to physical effects of the environment.
875 New in Isabelle2009-2 (June 2010)
876 ---------------------------------
880 * Authentic syntax for *all* logical entities (type classes, type
881 constructors, term constants): provides simple and robust
882 correspondence between formal entities and concrete syntax. Within
883 the parse tree / AST representations, "constants" are decorated by
884 their category (class, type, const) and spelled out explicitly with
885 their full internal name.
887 Substantial INCOMPATIBILITY concerning low-level syntax declarations
888 and translations (translation rules and translation functions in ML).
889 Some hints on upgrading:
891 - Many existing uses of 'syntax' and 'translations' can be replaced
892 by more modern 'type_notation', 'notation' and 'abbreviation',
893 which are independent of this issue.
895 - 'translations' require markup within the AST; the term syntax
896 provides the following special forms:
898 CONST c -- produces syntax version of constant c from context
899 XCONST c -- literally c, checked as constant from context
900 c -- literally c, if declared by 'syntax'
902 Plain identifiers are treated as AST variables -- occasionally the
903 system indicates accidental variables via the error "rhs contains
906 Type classes and type constructors are marked according to their
907 concrete syntax. Some old translations rules need to be written
908 for the "type" category, using type constructor application
909 instead of pseudo-term application of the default category
912 - 'parse_translation' etc. in ML may use the following
915 @{class_syntax c} -- type class c within parse tree / AST
916 @{term_syntax c} -- type constructor c within parse tree / AST
917 @{const_syntax c} -- ML version of "CONST c" above
918 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
920 - Literal types within 'typed_print_translations', i.e. those *not*
921 represented as pseudo-terms are represented verbatim. Use @{class
922 c} or @{type_name c} here instead of the above syntax
925 Note that old non-authentic syntax was based on unqualified base
926 names, so all of the above "constant" names would coincide. Recall
927 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
928 diagnose syntax problems.
930 * Type constructors admit general mixfix syntax, not just infix.
932 * Concrete syntax may be attached to local entities without a proof
933 body, too. This works via regular mixfix annotations for 'fix',
934 'def', 'obtain' etc. or via the explicit 'write' command, which is
935 similar to the 'notation' command in theory specifications.
937 * Discontinued unnamed infix syntax (legacy feature for many years) --
938 need to specify constant name and syntax separately. Internal ML
939 datatype constructors have been renamed from InfixName to Infix etc.
940 Minor INCOMPATIBILITY.
942 * Schematic theorem statements need to be explicitly markup as such,
943 via commands 'schematic_lemma', 'schematic_theorem',
944 'schematic_corollary'. Thus the relevance of the proof is made
945 syntactically clear, which impacts performance in a parallel or
946 asynchronous interactive environment. Minor INCOMPATIBILITY.
948 * Use of cumulative prems via "!" in some proof methods has been
949 discontinued (old legacy feature).
951 * References 'trace_simp' and 'debug_simp' have been replaced by
952 configuration options stored in the context. Enabling tracing (the
953 case of debugging is similar) in proofs works via
955 using [[trace_simp = true]]
957 Tracing is then active for all invocations of the simplifier in
958 subsequent goal refinement steps. Tracing may also still be enabled or
959 disabled via the ProofGeneral settings menu.
961 * Separate commands 'hide_class', 'hide_type', 'hide_const',
962 'hide_fact' replace the former 'hide' KIND command. Minor
965 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
966 more efficient than combinations with -q1 or -q2.
971 * Proofterms record type-class reasoning explicitly, using the
972 "unconstrain" operation internally. This eliminates all sort
973 constraints from a theorem and proof, introducing explicit
974 OFCLASS-premises. On the proof term level, this operation is
975 automatically applied at theorem boundaries, such that closed proofs
976 are always free of sort constraints. INCOMPATIBILITY for tools that
979 * Local theory specifications may depend on extra type variables that
980 are not present in the result type -- arguments TYPE('a) :: 'a itself
981 are added internally. For example:
983 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
985 * Predicates of locales introduced by classes carry a mandatory
986 "class" prefix. INCOMPATIBILITY.
988 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
990 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
993 * Command 'code_reflect' allows to incorporate generated ML code into
994 runtime environment; replaces immature code_datatype antiquotation.
997 * Code generator: simple concept for abstract datatypes obeying
1000 * Code generator: details of internal data cache have no impact on the
1001 user space functionality any longer.
1003 * Methods "unfold_locales" and "intro_locales" ignore non-locale
1004 subgoals. This is more appropriate for interpretations with 'where'.
1007 * Command 'example_proof' opens an empty proof body. This allows to
1008 experiment with Isar, without producing any persistent result.
1010 * Commands 'type_notation' and 'no_type_notation' declare type syntax
1011 within a local theory context, with explicit checking of the
1012 constructors involved (in contrast to the raw 'syntax' versions).
1014 * Commands 'types' and 'typedecl' now work within a local theory
1015 context -- without introducing dependencies on parameters or
1016 assumptions, which is not possible in Isabelle/Pure.
1018 * Command 'defaultsort' has been renamed to 'default_sort', it works
1019 within a local theory context. Minor INCOMPATIBILITY.
1024 * Command 'typedef' now works within a local theory context -- without
1025 introducing dependencies on parameters or assumptions, which is not
1026 possible in Isabelle/Pure/HOL. Note that the logical environment may
1027 contain multiple interpretations of local typedefs (with different
1028 non-emptiness proofs), even in a global theory context.
1030 * New package for quotient types. Commands 'quotient_type' and
1031 'quotient_definition' may be used for defining types and constants by
1032 quotient constructions. An example is the type of integers created by
1033 quotienting pairs of natural numbers:
1036 intrel :: "(nat * nat) => (nat * nat) => bool"
1038 "intrel (x, y) (u, v) = (x + v = u + y)"
1040 quotient_type int = "nat * nat" / intrel
1041 by (auto simp add: equivp_def expand_fun_eq)
1044 "0::int" is "(0::nat, 0::nat)"
1046 The method "lifting" can be used to lift of theorems from the
1047 underlying "raw" type to the quotient type. The example
1048 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
1049 construction and provides a reasoning infrastructure for finite sets.
1051 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
1052 clash with new theory Quotient in Main HOL.
1054 * Moved the SMT binding into the main HOL session, eliminating
1055 separate HOL-SMT session.
1057 * List membership infix mem operation is only an input abbreviation.
1060 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
1061 for future developements; former Library/Word.thy is still present in
1062 the AFP entry RSAPPS.
1064 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
1065 longer shadowed. INCOMPATIBILITY.
1067 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
1070 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
1073 * Dropped normalizing_semiring etc; use the facts in semiring classes
1074 instead. INCOMPATIBILITY.
1076 * Dropped several real-specific versions of lemmas about floor and
1077 ceiling; use the generic lemmas from theory "Archimedean_Field"
1078 instead. INCOMPATIBILITY.
1080 floor_number_of_eq ~> floor_number_of
1081 le_floor_eq_number_of ~> number_of_le_floor
1082 le_floor_eq_zero ~> zero_le_floor
1083 le_floor_eq_one ~> one_le_floor
1084 floor_less_eq_number_of ~> floor_less_number_of
1085 floor_less_eq_zero ~> floor_less_zero
1086 floor_less_eq_one ~> floor_less_one
1087 less_floor_eq_number_of ~> number_of_less_floor
1088 less_floor_eq_zero ~> zero_less_floor
1089 less_floor_eq_one ~> one_less_floor
1090 floor_le_eq_number_of ~> floor_le_number_of
1091 floor_le_eq_zero ~> floor_le_zero
1092 floor_le_eq_one ~> floor_le_one
1093 floor_subtract_number_of ~> floor_diff_number_of
1094 floor_subtract_one ~> floor_diff_one
1095 ceiling_number_of_eq ~> ceiling_number_of
1096 ceiling_le_eq_number_of ~> ceiling_le_number_of
1097 ceiling_le_zero_eq ~> ceiling_le_zero
1098 ceiling_le_eq_one ~> ceiling_le_one
1099 less_ceiling_eq_number_of ~> number_of_less_ceiling
1100 less_ceiling_eq_zero ~> zero_less_ceiling
1101 less_ceiling_eq_one ~> one_less_ceiling
1102 ceiling_less_eq_number_of ~> ceiling_less_number_of
1103 ceiling_less_eq_zero ~> ceiling_less_zero
1104 ceiling_less_eq_one ~> ceiling_less_one
1105 le_ceiling_eq_number_of ~> number_of_le_ceiling
1106 le_ceiling_eq_zero ~> zero_le_ceiling
1107 le_ceiling_eq_one ~> one_le_ceiling
1108 ceiling_subtract_number_of ~> ceiling_diff_number_of
1109 ceiling_subtract_one ~> ceiling_diff_one
1111 * Theory "Finite_Set": various folding_XXX locales facilitate the
1112 application of the various fold combinators on finite sets.
1114 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
1115 provides abstract red-black tree type which is backed by "RBT_Impl" as
1116 implementation. INCOMPATIBILTY.
1118 * Theory Library/Coinductive_List has been removed -- superseded by
1119 AFP/thys/Coinductive.
1121 * Theory PReal, including the type "preal" and related operations, has
1122 been removed. INCOMPATIBILITY.
1124 * Real: new development using Cauchy Sequences.
1126 * Split off theory "Big_Operators" containing setsum, setprod,
1127 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
1129 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
1130 "Int" etc. INCOMPATIBILITY.
1132 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
1134 * New set of rules "ac_simps" provides combined assoc / commute
1135 rewrites for all interpretations of the appropriate generic locales.
1137 * Renamed theory "OrderedGroup" to "Groups" and split theory
1138 "Ring_and_Field" into theories "Rings" and "Fields"; for more
1139 appropriate and more consistent names suitable for name prefixes
1140 within the HOL theories. INCOMPATIBILITY.
1142 * Some generic constants have been put to appropriate theories:
1143 - less_eq, less: Orderings
1144 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
1145 - inverse, divide: Rings
1148 * More consistent naming of type classes involving orderings (and
1151 lower_semilattice ~> semilattice_inf
1152 upper_semilattice ~> semilattice_sup
1154 dense_linear_order ~> dense_linorder
1156 pordered_ab_group_add ~> ordered_ab_group_add
1157 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
1158 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
1159 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
1160 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
1161 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
1162 pordered_cancel_semiring ~> ordered_cancel_semiring
1163 pordered_comm_monoid_add ~> ordered_comm_monoid_add
1164 pordered_comm_ring ~> ordered_comm_ring
1165 pordered_comm_semiring ~> ordered_comm_semiring
1166 pordered_ring ~> ordered_ring
1167 pordered_ring_abs ~> ordered_ring_abs
1168 pordered_semiring ~> ordered_semiring
1170 ordered_ab_group_add ~> linordered_ab_group_add
1171 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
1172 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
1173 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
1174 ordered_field ~> linordered_field
1175 ordered_field_no_lb ~> linordered_field_no_lb
1176 ordered_field_no_ub ~> linordered_field_no_ub
1177 ordered_field_dense_linear_order ~> dense_linordered_field
1178 ordered_idom ~> linordered_idom
1179 ordered_ring ~> linordered_ring
1180 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
1181 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
1182 ordered_ring_strict ~> linordered_ring_strict
1183 ordered_semidom ~> linordered_semidom
1184 ordered_semiring ~> linordered_semiring
1185 ordered_semiring_1 ~> linordered_semiring_1
1186 ordered_semiring_1_strict ~> linordered_semiring_1_strict
1187 ordered_semiring_strict ~> linordered_semiring_strict
1189 The following slightly odd type classes have been moved to a
1190 separate theory Library/Lattice_Algebras:
1192 lordered_ab_group_add ~> lattice_ab_group_add
1193 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
1194 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
1195 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
1196 lordered_ring ~> lattice_ring
1200 * Refined field classes:
1201 - classes division_ring_inverse_zero, field_inverse_zero,
1202 linordered_field_inverse_zero include rule inverse 0 = 0 --
1203 subsumes former division_by_zero class;
1204 - numerous lemmas have been ported from field to division_ring.
1207 * Refined algebra theorem collections:
1208 - dropped theorem group group_simps, use algebra_simps instead;
1209 - dropped theorem group ring_simps, use field_simps instead;
1210 - proper theorem collection field_simps subsumes former theorem
1211 groups field_eq_simps and field_simps;
1212 - dropped lemma eq_minus_self_iff which is a duplicate for
1216 * Theory Finite_Set and List: some lemmas have been generalized from
1219 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
1220 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
1221 inter_Inter_fold_inter ~> inf_Inf_fold_inf
1222 union_Union_fold_union ~> sup_Sup_fold_sup
1223 Inter_fold_inter ~> Inf_fold_inf
1224 Union_fold_union ~> Sup_fold_sup
1225 inter_INTER_fold_inter ~> inf_INFI_fold_inf
1226 union_UNION_fold_union ~> sup_SUPR_fold_sup
1227 INTER_fold_inter ~> INFI_fold_inf
1228 UNION_fold_union ~> SUPR_fold_sup
1230 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
1231 replaced by the more convenient lemmas Inf_empty and Sup_empty.
1232 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
1233 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
1234 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
1235 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
1237 * Reorganized theory Multiset: swapped notation of pointwise and
1240 - pointwise ordering is instance of class order with standard syntax
1242 - multiset ordering has syntax <=# and <#; partial order properties
1243 are provided by means of interpretation with prefix
1245 - less duplication, less historical organization of sections,
1246 conversion from associations lists to multisets, rudimentary code
1248 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
1253 multiset_eq_conv_count_eq ~> multiset_ext_iff
1254 multi_count_ext ~> multiset_ext
1255 diff_union_inverse2 ~> diff_union_cancelR
1259 * Theory Permutation: replaced local "remove" by List.remove1.
1261 * Code generation: ML and OCaml code is decorated with signatures.
1263 * Theory List: added transpose.
1265 * Library/Nat_Bijection.thy is a collection of bijective functions
1266 between nat and other types, which supersedes the older libraries
1267 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
1270 Nat_Int_Bij.nat2_to_nat ~> prod_encode
1271 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
1272 Nat_Int_Bij.int_to_nat_bij ~> int_encode
1273 Nat_Int_Bij.nat_to_int_bij ~> int_decode
1274 Countable.pair_encode ~> prod_encode
1275 NatIso.prod2nat ~> prod_encode
1276 NatIso.nat2prod ~> prod_decode
1277 NatIso.sum2nat ~> sum_encode
1278 NatIso.nat2sum ~> sum_decode
1279 NatIso.list2nat ~> list_encode
1280 NatIso.nat2list ~> list_decode
1281 NatIso.set2nat ~> set_encode
1282 NatIso.nat2set ~> set_decode
1285 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
1286 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
1287 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
1288 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
1289 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
1290 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
1291 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
1292 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
1293 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
1294 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
1295 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
1296 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
1297 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
1300 - Renamed ATP commands:
1301 atp_info ~> sledgehammer running_atps
1302 atp_kill ~> sledgehammer kill_atps
1303 atp_messages ~> sledgehammer messages
1304 atp_minimize ~> sledgehammer minimize
1305 print_atps ~> sledgehammer available_atps
1307 - Added user's manual ("isabelle doc sledgehammer").
1308 - Added option syntax and "sledgehammer_params" to customize
1309 Sledgehammer's behavior. See the manual for details.
1310 - Modified the Isar proof reconstruction code so that it produces
1311 direct proofs rather than proofs by contradiction. (This feature
1312 is still experimental.)
1313 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
1315 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
1318 - Added and implemented "binary_ints" and "bits" options.
1319 - Added "std" option and implemented support for nonstandard models.
1320 - Added and implemented "finitize" option to improve the precision
1321 of infinite datatypes based on a monotonicity analysis.
1322 - Added support for quotient types.
1323 - Added support for "specification" and "ax_specification"
1325 - Added support for local definitions (for "function" and
1326 "termination" proofs).
1327 - Added support for term postprocessors.
1328 - Optimized "Multiset.multiset" and "FinFun.finfun".
1329 - Improved efficiency of "destroy_constrs" optimization.
1330 - Fixed soundness bugs related to "destroy_constrs" optimization and
1332 - Fixed soundness bug related to higher-order constructors.
1333 - Fixed soundness bug when "full_descrs" is enabled.
1334 - Improved precision of set constructs.
1335 - Added "atoms" option.
1336 - Added cache to speed up repeated Kodkod invocations on the same
1338 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
1339 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
1340 "SAT4J_Light". INCOMPATIBILITY.
1341 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
1342 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
1343 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
1345 * Method "induct" now takes instantiations of the form t, where t is not
1346 a variable, as a shorthand for "x == t", where x is a fresh variable.
1347 If this is not intended, t has to be enclosed in parentheses.
1348 By default, the equalities generated by definitional instantiations
1349 are pre-simplified, which may cause parameters of inductive cases
1350 to disappear, or may even delete some of the inductive cases.
1351 Use "induct (no_simp)" instead of "induct" to restore the old
1352 behaviour. The (no_simp) option is also understood by the "cases"
1353 and "nominal_induct" methods, which now perform pre-simplification, too.
1359 * Variable names in lemmas generated by the domain package have
1360 changed; the naming scheme is now consistent with the HOL datatype
1361 package. Some proof scripts may be affected, INCOMPATIBILITY.
1363 * The domain package no longer defines the function "foo_copy" for
1364 recursive domain "foo". The reach lemma is now stated directly in
1365 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
1366 be reformulated in terms of "foo_take", INCOMPATIBILITY.
1368 * Most definedness lemmas generated by the domain package (previously
1369 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
1370 like "foo$x = UU <-> x = UU", which works better as a simp rule.
1371 Proofs that used definedness lemmas as intro rules may break,
1372 potential INCOMPATIBILITY.
1374 * Induction and casedist rules generated by the domain package now
1375 declare proper case_names (one called "bottom", and one named for each
1376 constructor). INCOMPATIBILITY.
1378 * For mutually-recursive domains, separate "reach" and "take_lemma"
1379 rules are generated for each domain, INCOMPATIBILITY.
1381 foo_bar.reach ~> foo.reach bar.reach
1382 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
1384 * Some lemmas generated by the domain package have been renamed for
1385 consistency with the datatype package, INCOMPATIBILITY.
1387 foo.ind ~> foo.induct
1388 foo.finite_ind ~> foo.finite_induct
1389 foo.coind ~> foo.coinduct
1390 foo.casedist ~> foo.exhaust
1391 foo.exhaust ~> foo.nchotomy
1393 * For consistency with other definition packages, the fixrec package
1394 now generates qualified theorem names, INCOMPATIBILITY.
1396 foo_simps ~> foo.simps
1397 foo_unfold ~> foo.unfold
1398 foo_induct ~> foo.induct
1400 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
1401 method and internal fixrec proofs now use the default simpset instead.
1404 * The "contlub" predicate has been removed. Proof scripts should use
1405 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
1407 * The "admw" predicate has been removed, INCOMPATIBILITY.
1409 * The constants cpair, cfst, and csnd have been removed in favor of
1410 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
1415 * Antiquotations for basic formal entities:
1417 @{class NAME} -- type class
1418 @{class_syntax NAME} -- syntax representation of the above
1420 @{type_name NAME} -- logical type
1421 @{type_abbrev NAME} -- type abbreviation
1422 @{nonterminal NAME} -- type of concrete syntactic category
1423 @{type_syntax NAME} -- syntax representation of any of the above
1425 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
1426 @{const_abbrev NAME} -- abbreviated constant
1427 @{const_syntax NAME} -- syntax representation of any of the above
1429 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
1430 syntax constant (cf. 'syntax' command).
1432 * Antiquotation @{make_string} inlines a function to print arbitrary
1433 values similar to the ML toplevel. The result is compiler dependent
1434 and may fall back on "?" in certain situations.
1436 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
1437 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
1438 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
1439 not work with the asynchronous Isar document model.
1441 * Configuration options now admit dynamic default values, depending on
1442 the context or even global references.
1444 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
1445 uses an efficient external library if available (for Poly/ML).
1447 * Renamed some important ML structures, while keeping the old names
1448 for some time as aliases within the structure Legacy:
1450 OuterKeyword ~> Keyword
1453 OuterSyntax ~> Outer_Syntax
1454 PrintMode ~> Print_Mode
1455 SpecParse ~> Parse_Spec
1458 ThyOutput ~> Thy_Output
1459 TypeInfer ~> Type_Infer
1461 Note that "open Legacy" simplifies porting of sources, but forgetting
1462 to remove it again will complicate porting again in the future.
1464 * Most operations that refer to a global context are named
1465 accordingly, e.g. Simplifier.global_context or
1466 ProofContext.init_global. There are some situations where a global
1467 context actually works, but under normal circumstances one needs to
1468 pass the proper local context through the code!
1470 * Discontinued old TheoryDataFun with its copy/init operation -- data
1471 needs to be pure. Functor Theory_Data_PP retains the traditional
1472 Pretty.pp argument to merge, which is absent in the standard
1473 Theory_Data version.
1475 * Sorts.certify_sort and derived "cert" operations for types and terms
1476 no longer minimize sorts. Thus certification at the boundary of the
1477 inference kernel becomes invariant under addition of class relations,
1478 which is an important monotonicity principle. Sorts are now minimized
1479 in the syntax layer only, at the boundary between the end-user and the
1480 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
1481 explicitly in rare situations.
1483 * Renamed old-style Drule.standard to Drule.export_without_context, to
1484 emphasize that this is in no way a standard operation.
1487 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
1488 usual for resolution. Rare INCOMPATIBILITY.
1490 * Renamed varify/unvarify operations to varify_global/unvarify_global
1491 to emphasize that these only work in a global situation (which is
1494 * Curried take and drop in library.ML; negative length is interpreted
1495 as infinity (as in chop). Subtle INCOMPATIBILITY.
1497 * Proof terms: type substitutions on proof constants now use canonical
1498 order of type variables. INCOMPATIBILITY for tools working with proof
1501 * Raw axioms/defs may no longer carry sort constraints, and raw defs
1502 may no longer carry premises. User-level specifications are
1503 transformed accordingly by Thm.add_axiom/add_def.
1508 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
1509 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
1510 proof terms are enabled unconditionally in the new HOL-Proofs image.
1512 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
1513 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
1516 * Old lib/scripts/polyml-platform is superseded by the
1517 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
1518 variant, even on a 64 bit machine. The following example setting
1519 prefers 64 bit if available:
1521 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
1523 * The preliminary Isabelle/jEdit application demonstrates the emerging
1524 Isabelle/Scala layer for advanced prover interaction and integration.
1525 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
1528 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
1529 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
1530 similar to the default assignment of the document preparation system
1531 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
1532 provides some operations for direct access to the font without asking
1533 the user for manual installation.
1537 New in Isabelle2009-1 (December 2009)
1538 -------------------------------------
1542 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
1543 one backslash should be used, even in ML sources.
1548 * Locale interpretation propagates mixins along the locale hierarchy.
1549 The currently only available mixins are the equations used to map
1550 local definitions to terms of the target domain of an interpretation.
1552 * Reactivated diagnostic command 'print_interps'. Use "print_interps
1553 loc" to print all interpretations of locale "loc" in the theory.
1554 Interpretations in proofs are not shown.
1556 * Thoroughly revised locales tutorial. New section on conditional
1559 * On instantiation of classes, remaining undefined class parameters
1560 are formally declared. INCOMPATIBILITY.
1563 *** Document preparation ***
1565 * New generalized style concept for printing terms: @{foo (style) ...}
1566 instead of @{foo_style style ...} (old form is still retained for
1567 backward compatibility). Styles can be also applied for
1568 antiquotations prop, term_type and typeof.
1573 * New proof method "smt" for a combination of first-order logic with
1574 equality, linear and nonlinear (natural/integer/real) arithmetic, and
1575 fixed-size bitvectors; there is also basic support for higher-order
1576 features (esp. lambda abstractions). It is an incomplete decision
1577 procedure based on external SMT solvers using the oracle mechanism;
1578 for the SMT solver Z3, this method is proof-producing. Certificates
1579 are provided to avoid calling the external solvers solely for
1580 re-checking proofs. Due to a remote SMT service there is no need for
1581 installing SMT solvers locally. See src/HOL/SMT.
1583 * New commands to load and prove verification conditions generated by
1584 the Boogie program verifier or derived systems (e.g. the Verifying C
1585 Compiler (VCC) or Spec#). See src/HOL/Boogie.
1587 * New counterexample generator tool 'nitpick' based on the Kodkod
1588 relational model finder. See src/HOL/Tools/Nitpick and
1589 src/HOL/Nitpick_Examples.
1591 * New commands 'code_pred' and 'values' to invoke the predicate
1592 compiler and to enumerate values of inductive predicates.
1594 * A tabled implementation of the reflexive transitive closure.
1596 * New implementation of quickcheck uses generic code generator;
1597 default generators are provided for all suitable HOL types, records
1598 and datatypes. Old quickcheck can be re-activated importing theory
1599 Library/SML_Quickcheck.
1601 * New testing tool Mirabelle for automated proof tools. Applies
1602 several tools and tactics like sledgehammer, metis, or quickcheck, to
1603 every proof step in a theory. To be used in batch mode via the
1604 "mirabelle" utility.
1606 * New proof method "sos" (sum of squares) for nonlinear real
1607 arithmetic (originally due to John Harison). It requires theory
1608 Library/Sum_Of_Squares. It is not a complete decision procedure but
1609 works well in practice on quantifier-free real arithmetic with +, -,
1610 *, ^, =, <= and <, i.e. boolean combinations of equalities and
1611 inequalities between polynomials. It makes use of external
1612 semidefinite programming solvers. Method "sos" generates a
1613 certificate that can be pasted into the proof thus avoiding the need
1614 to call an external tool every time the proof is checked. See
1615 src/HOL/Library/Sum_Of_Squares.
1617 * New method "linarith" invokes existing linear arithmetic decision
1620 * New command 'atp_minimal' reduces result produced by Sledgehammer.
1622 * New Sledgehammer option "Full Types" in Proof General settings menu.
1623 Causes full type information to be output to the ATPs. This slows
1624 ATPs down considerably but eliminates a source of unsound "proofs"
1627 * New method "metisFT": A version of metis that uses full type
1628 information in order to avoid failures of proof reconstruction.
1630 * New evaluator "approximate" approximates an real valued term using
1631 the same method as the approximation method.
1633 * Method "approximate" now supports arithmetic expressions as
1634 boundaries of intervals and implements interval splitting and Taylor
1637 * ML antiquotation @{code_datatype} inserts definition of a datatype
1638 generated by the code generator; e.g. see src/HOL/Predicate.thy.
1640 * New theory SupInf of the supremum and infimum operators for sets of
1643 * New theory Probability, which contains a development of measure
1644 theory, eventually leading to Lebesgue integration and probability.
1646 * Extended Multivariate Analysis to include derivation and Brouwer's
1649 * Reorganization of number theory, INCOMPATIBILITY:
1650 - new number theory development for nat and int, in theories Divides
1651 and GCD as well as in new session Number_Theory
1652 - some constants and facts now suffixed with _nat and _int
1654 - former session NumberTheory now named Old_Number_Theory, including
1655 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
1656 - moved theory Pocklington from src/HOL/Library to
1657 src/HOL/Old_Number_Theory
1659 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
1660 lcm of finite and infinite sets. It is shown that they form a complete
1663 * Class semiring_div requires superclass no_zero_divisors and proof of
1664 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
1665 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
1666 generalized to class semiring_div, subsuming former theorems
1667 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
1668 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
1671 * Refinements to lattice classes and sets:
1672 - less default intro/elim rules in locale variant, more default
1673 intro/elim rules in class variant: more uniformity
1674 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
1676 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
1678 - renamed ACI to inf_sup_aci
1679 - new class "boolean_algebra"
1680 - class "complete_lattice" moved to separate theory
1681 "Complete_Lattice"; corresponding constants (and abbreviations)
1682 renamed and with authentic syntax:
1683 Set.Inf ~> Complete_Lattice.Inf
1684 Set.Sup ~> Complete_Lattice.Sup
1685 Set.INFI ~> Complete_Lattice.INFI
1686 Set.SUPR ~> Complete_Lattice.SUPR
1687 Set.Inter ~> Complete_Lattice.Inter
1688 Set.Union ~> Complete_Lattice.Union
1689 Set.INTER ~> Complete_Lattice.INTER
1690 Set.UNION ~> Complete_Lattice.UNION
1691 - authentic syntax for
1694 - mere abbreviations:
1697 Set.inter (for inf, formerly Set.Int)
1698 Set.union (for sup, formerly Set.Un)
1699 Complete_Lattice.Inter (for Inf)
1700 Complete_Lattice.Union (for Sup)
1701 Complete_Lattice.INTER (for INFI)
1702 Complete_Lattice.UNION (for SUPR)
1703 - object-logic definitions as far as appropriate
1705 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
1706 Un_subset_iff are explicitly deleted as default simp rules; then also
1707 their lattice counterparts le_inf_iff and le_sup_iff have to be
1708 deleted to achieve the desired effect.
1710 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
1711 rules by default any longer; the same applies to min_max.inf_absorb1
1712 etc. INCOMPATIBILITY.
1714 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
1715 pred_set_conv by default. INCOMPATIBILITY.
1717 * Power operations on relations and functions are now one dedicated
1718 constant "compow" with infix syntax "^^". Power operation on
1719 multiplicative monoids retains syntax "^" and is now defined generic
1720 in class power. INCOMPATIBILITY.
1722 * Relation composition "R O S" now has a more standard argument order:
1723 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
1724 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
1725 break, since the O_assoc rule was not rewritten like this. Fix using
1726 O_assoc[symmetric]. The same applies to the curried version "R OO S".
1728 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
1729 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
1732 * Most rules produced by inductive and datatype package have mandatory
1733 prefixes. INCOMPATIBILITY.
1735 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
1736 the attribute of the same name. Each of the theorems in the list
1737 DERIV_intros assumes composition with an additional function and
1738 matches a variable to the derivative, which has to be solved by the
1739 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
1740 of most elementary terms. Former Maclauren.DERIV_tac and
1741 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
1744 * Code generator attributes follow the usual underscore convention:
1745 code_unfold replaces code unfold
1746 code_post replaces code post
1751 sizechange -> size_change
1752 induct_scheme -> induction_schema
1755 * Discontinued abbreviation "arbitrary" of constant "undefined".
1756 INCOMPATIBILITY, use "undefined" directly.
1759 Suc_eq_add_numeral_1 -> Suc_eq_plus1
1760 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
1761 Suc_plus1 -> Suc_eq_plus1
1762 *anti_sym -> *antisym*
1763 vector_less_eq_def -> vector_le_def
1766 * Added theorem List.map_map as [simp]. Removed List.map_compose.
1769 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1775 * Theory Representable defines a class "rep" of domains that are
1776 representable (via an ep-pair) in the universal domain type "udom".
1777 Instances are provided for all type constructors defined in HOLCF.
1779 * The 'new_domain' command is a purely definitional version of the
1780 domain package, for representable domains. Syntax is identical to the
1781 old domain package. The 'new_domain' package also supports indirect
1782 recursion using previously-defined type constructors. See
1783 src/HOLCF/ex/New_Domain.thy for examples.
1785 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1786 on the left-hand side of an equation, and then performs
1787 simplification. Rewriting is done using rules declared with the
1788 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1789 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1791 * The pattern-match compiler in 'fixrec' can now handle constructors
1792 with HOL function types. Pattern-match combinators for the Pair
1793 constructor are pre-configured.
1795 * The 'fixrec' package now produces better fixed-point induction rules
1796 for mutually-recursive definitions: Induction rules have conclusions
1797 of the form "P foo bar" instead of "P <foo, bar>".
1799 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1800 been renamed to "below". The name "below" now replaces "less" in many
1801 theorem names. (Legacy theorem names using "less" are still supported
1804 * The 'fixrec' package now supports "bottom patterns". Bottom
1805 patterns can be used to generate strictness rules, or to make
1806 functions more strict (much like the bang-patterns supported by the
1807 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1813 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1814 errors and run-time exceptions, including detailed source positions.
1816 * Structure Name_Space (formerly NameSpace) now manages uniquely
1817 identified entries, with some additional information such as source
1818 position, logical grouping etc.
1820 * Theory and context data is now introduced by the simplified and
1821 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1822 to be pure, but the old TheoryDataFun for mutable data (with explicit
1823 copy operation) is still available for some time.
1825 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1826 provides a high-level programming interface to synchronized state
1827 variables with atomic update. This works via pure function
1828 application within a critical section -- its runtime should be as
1829 short as possible; beware of deadlocks if critical code is nested,
1830 either directly or indirectly via other synchronized variables!
1832 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1833 wraps raw ML references, explicitly indicating their non-thread-safe
1834 behaviour. The Isar toplevel keeps this structure open, to
1835 accommodate Proof General as well as quick and dirty interactive
1836 experiments with references.
1838 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1839 parallel tactical reasoning.
1841 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1842 are similar to SUBPROOF, but are slightly more flexible: only the
1843 specified parts of the subgoal are imported into the context, and the
1844 body tactic may introduce new subgoals and schematic variables.
1846 * Old tactical METAHYPS, which does not observe the proof context, has
1847 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1848 or Subgoal.FOCUS etc.
1850 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1851 functors have their own ML name space there is no point to mark them
1852 separately.) Minor INCOMPATIBILITY.
1854 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1856 * Renamed several structures FooBar to Foo_Bar. Occasional,
1859 * Operations of structure Skip_Proof no longer require quick_and_dirty
1860 mode, which avoids critical setmp.
1862 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1863 combinators for "args". INCOMPATIBILITY, need to use simplified
1864 Attrib/Method.setup introduced in Isabelle2009.
1866 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1867 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1868 last resort. INCOMPATIBILITY.
1870 * Display.pretty_thm now requires a proper context (cf. former
1871 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1872 or even Display.pretty_thm_without_context as last resort.
1875 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1876 Syntax.pretty_typ/term directly, preferably with proper context
1877 instead of global theory.
1882 * Further fine tuning of parallel proof checking, scales up to 8 cores
1883 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1886 * Support for additional "Isabelle components" via etc/components, see
1887 also the system manual.
1889 * The isabelle makeall tool now operates on all components with
1890 IsaMakefile, not just hardwired "logics".
1892 * Removed "compress" option from isabelle-process and isabelle usedir;
1893 this is always enabled.
1895 * Discontinued support for Poly/ML 4.x versions.
1897 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1898 on a given logic image. This requires the lighttpd webserver and is
1899 currently supported on Linux only.
1903 New in Isabelle2009 (April 2009)
1904 --------------------------------
1908 * Simplified main Isabelle executables, with less surprises on
1909 case-insensitive file-systems (such as Mac OS).
1911 - The main Isabelle tool wrapper is now called "isabelle" instead of
1914 - The former "isabelle" alias for "isabelle-process" has been
1915 removed (should rarely occur to regular users).
1917 - The former "isabelle-interface" and its alias "Isabelle" have been
1918 removed (interfaces are now regular Isabelle tools).
1920 Within scripts and make files, the Isabelle environment variables
1921 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1922 respectively. (The latter are still available as legacy feature.)
1924 The old isabelle-interface wrapper could react in confusing ways if
1925 the interface was uninstalled or changed otherwise. Individual
1926 interface tool configuration is now more explicit, see also the
1927 Isabelle system manual. In particular, Proof General is now available
1928 via "isabelle emacs".
1930 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1931 purge installed copies of Isabelle executables and re-run "isabelle
1932 install -p ...", or use symlinks.
1934 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1935 old ~/isabelle, which was slightly non-standard and apt to cause
1936 surprises on case-insensitive file-systems (such as Mac OS).
1938 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1939 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1940 care is required when using older releases of Isabelle. Note that
1941 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1942 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1944 * Proofs of fully specified statements are run in parallel on
1945 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1946 a regular 4-core machine, if the initial heap space is made reasonably
1947 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1949 * The main reference manuals ("isar-ref", "implementation", and
1950 "system") have been updated and extended. Formally checked references
1951 as hyperlinks are now available uniformly.
1956 * Complete re-implementation of locales. INCOMPATIBILITY in several
1957 respects. The most important changes are listed below. See the
1958 Tutorial on Locales ("locales" manual) for details.
1960 - In locale expressions, instantiation replaces renaming. Parameters
1961 must be declared in a for clause. To aid compatibility with previous
1962 parameter inheritance, in locale declarations, parameters that are not
1963 'touched' (instantiation position "_" or omitted) are implicitly added
1964 with their syntax at the beginning of the for clause.
1966 - Syntax from abbreviations and definitions in locales is available in
1967 locale expressions and context elements. The latter is particularly
1968 useful in locale declarations.
1970 - More flexible mechanisms to qualify names generated by locale
1971 expressions. Qualifiers (prefixes) may be specified in locale
1972 expressions, and can be marked as mandatory (syntax: "name!:") or
1973 optional (syntax "name?:"). The default depends for plain "name:"
1974 depends on the situation where a locale expression is used: in
1975 commands 'locale' and 'sublocale' prefixes are optional, in
1976 'interpretation' and 'interpret' prefixes are mandatory. The old
1977 implicit qualifiers derived from the parameter names of a locale are
1978 no longer generated.
1980 - Command "sublocale l < e" replaces "interpretation l < e". The
1981 instantiation clause in "interpretation" and "interpret" (square
1982 brackets) is no longer available. Use locale expressions.
1984 - When converting proof scripts, mandatory qualifiers in
1985 'interpretation' and 'interpret' should be retained by default, even
1986 if this is an INCOMPATIBILITY compared to former behavior. In the
1987 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1988 in locale expressions range over a single locale instance only.
1990 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1991 In existing theorem specifications replace the includes element by the
1992 respective context elements of the included locale, omitting those
1993 that are already present in the theorem specification. Multiple
1994 assume elements of a locale should be replaced by a single one
1995 involving the locale predicate. In the proof body, declarations (most
1996 notably theorems) may be regained by interpreting the respective
1997 locales in the proof context as required (command "interpret").
1999 If using "includes" in replacement of a target solely because the
2000 parameter types in the theorem are not as general as in the target,
2001 consider declaring a new locale with additional type constraints on
2002 the parameters (context element "constrains").
2004 - Discontinued "locale (open)". INCOMPATIBILITY.
2006 - Locale interpretation commands no longer attempt to simplify goal.
2007 INCOMPATIBILITY: in rare situations the generated goal differs. Use
2008 methods intro_locales and unfold_locales to clarify.
2010 - Locale interpretation commands no longer accept interpretation
2011 attributes. INCOMPATIBILITY.
2013 * Class declaration: so-called "base sort" must not be given in import
2014 list any longer, but is inferred from the specification. Particularly
2021 class foo = type + ...
2023 * Class target: global versions of theorems stemming do not carry a
2024 parameter prefix any longer. INCOMPATIBILITY.
2026 * Class 'instance' command no longer accepts attached definitions.
2027 INCOMPATIBILITY, use proper 'instantiation' target instead.
2029 * Recovered hiding of consts, which was accidentally broken in
2030 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
2031 makes c inaccessible; consider using ``hide (open) const c'' instead.
2033 * Slightly more coherent Pure syntax, with updated documentation in
2034 isar-ref manual. Removed locales meta_term_syntax and
2035 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
2036 INCOMPATIBILITY in rare situations. Note that &&& should not be used
2037 directly in regular applications.
2039 * There is a new syntactic category "float_const" for signed decimal
2040 fractions (e.g. 123.45 or -123.45).
2042 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
2043 interface with 'setup' command instead.
2045 * Command 'local_setup' is similar to 'setup', but operates on a local
2048 * The 'axiomatization' command now only works within a global theory
2049 context. INCOMPATIBILITY.
2051 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
2052 hypotheses. Sorts required in the course of reasoning need to be
2053 covered by the constraints in the initial statement, completed by the
2054 type instance information of the background theory. Non-trivial sort
2055 hypotheses, which rarely occur in practice, may be specified via
2056 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
2058 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
2060 The result contains an implicit sort hypotheses as before --
2061 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
2064 * Generalized Isar history, with support for linear undo, direct state
2067 * Changed defaults for unify configuration options:
2069 unify_trace_bound = 50 (formerly 25)
2070 unify_search_bound = 60 (formerly 30)
2072 * Different bookkeeping for code equations (INCOMPATIBILITY):
2074 a) On theory merge, the last set of code equations for a particular
2075 constant is taken (in accordance with the policy applied by other
2076 parts of the code generator framework).
2078 b) Code equations stemming from explicit declarations (e.g. code
2079 attribute) gain priority over default code equations stemming
2080 from definition, primrec, fun etc.
2082 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
2084 * Unified theorem tables for both code generators. Thus [code
2085 func] has disappeared and only [code] remains. INCOMPATIBILITY.
2087 * Command 'find_consts' searches for constants based on type and name
2090 find_consts "_ => bool"
2092 By default, matching is against subtypes, but it may be restricted to
2093 the whole type. Searching by name is possible. Multiple queries are
2094 conjunctive and queries may be negated by prefixing them with a
2097 find_consts strict: "_ => bool" name: "Int" -"int => int"
2099 * New 'find_theorems' criterion "solves" matches theorems that
2100 directly solve the current goal (modulo higher-order unification).
2102 * Auto solve feature for main theorem statements: whenever a new goal
2103 is stated, "find_theorems solves" is called; any theorems that could
2104 solve the lemma directly are listed as part of the goal state.
2105 Cf. associated options in Proof General Isabelle settings menu,
2106 enabled by default, with reasonable timeout for pathological cases of
2107 higher-order unification.
2110 *** Document preparation ***
2112 * Antiquotation @{lemma} now imitates a regular terminal proof,
2113 demanding keyword 'by' and supporting the full method expression
2114 syntax just like the Isar command 'by'.
2119 * Integrated main parts of former image HOL-Complex with HOL. Entry
2120 points Main and Complex_Main remain as before.
2122 * Logic image HOL-Plain provides a minimal HOL with the most important
2123 tools available (inductive, datatype, primrec, ...). This facilitates
2124 experimentation and tool development. Note that user applications
2125 (and library theories) should never refer to anything below theory
2128 * Logic image HOL-Main stops at theory Main, and thus facilitates
2129 experimentation due to shorter build times.
2131 * Logic image HOL-NSA contains theories of nonstandard analysis which
2132 were previously part of former HOL-Complex. Entry point Hyperreal
2133 remains valid, but theories formerly using Complex_Main should now use
2134 new entry point Hypercomplex.
2136 * Generic ATP manager for Sledgehammer, based on ML threads instead of
2137 Posix processes. Avoids potentially expensive forking of the ML
2138 process. New thread-based implementation also works on non-Unix
2139 platforms (Cygwin). Provers are no longer hardwired, but defined
2140 within the theory via plain ML wrapper functions. Basic Sledgehammer
2141 commands are covered in the isar-ref manual.
2143 * Wrapper scripts for remote SystemOnTPTP service allows to use
2144 sledgehammer without local ATP installation (Vampire etc.). Other
2145 provers may be included via suitable ML wrappers, see also
2146 src/HOL/ATP_Linkup.thy.
2148 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
2151 * The metis method no longer fails because the theorem is too trivial
2152 (contains the empty clause).
2154 * The metis method now fails in the usual manner, rather than raising
2155 an exception, if it determines that it cannot prove the theorem.
2157 * Method "coherent" implements a prover for coherent logic (see also
2158 src/Tools/coherent.ML).
2160 * Constants "undefined" and "default" replace "arbitrary". Usually
2161 "undefined" is the right choice to replace "arbitrary", though
2162 logically there is no difference. INCOMPATIBILITY.
2164 * Command "value" now integrates different evaluation mechanisms. The
2165 result of the first successful evaluation mechanism is printed. In
2166 square brackets a particular named evaluation mechanisms may be
2167 specified (currently, [SML], [code] or [nbe]). See further
2168 src/HOL/ex/Eval_Examples.thy.
2170 * Normalization by evaluation now allows non-leftlinear equations.
2171 Declare with attribute [code nbe].
2173 * Methods "case_tac" and "induct_tac" now refer to the very same rules
2174 as the structured Isar versions "cases" and "induct", cf. the
2175 corresponding "cases" and "induct" attributes. Mutual induction rules
2176 are now presented as a list of individual projections
2177 (e.g. foo_bar.inducts for types foo and bar); the old format with
2178 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
2179 rare situations a different rule is selected --- notably nested tuple
2180 elimination instead of former prod.exhaust: use explicit (case_tac t
2181 rule: prod.exhaust) here.
2183 * Attributes "cases", "induct", "coinduct" support "del" option.
2185 * Removed fact "case_split_thm", which duplicates "case_split".
2187 * The option datatype has been moved to a new theory Option. Renamed
2188 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
2190 * New predicate "strict_mono" classifies strict functions on partial
2191 orders. With strict functions on linear orders, reasoning about
2192 (in)equalities is facilitated by theorems "strict_mono_eq",
2193 "strict_mono_less_eq" and "strict_mono_less".
2195 * Some set operations are now proper qualified constants with
2196 authentic syntax. INCOMPATIBILITY:
2207 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
2210 * Auxiliary class "itself" has disappeared -- classes without any
2211 parameter are treated as expected by the 'class' command.
2213 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
2215 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
2216 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
2218 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
2219 method "approximation". It proves formulas on real values by using
2220 interval arithmetic. In the formulas are also the transcendental
2221 functions sin, cos, tan, atan, ln, exp and the constant pi are
2222 allowed. For examples see
2223 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
2225 * Theory "Reflection" now resides in HOL/Library.
2227 * Entry point to Word library now simply named "Word".
2230 * Made source layout more coherent with logical distribution
2233 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
2234 src/HOL/Library/Code_Message.thy ~> src/HOL/
2235 src/HOL/Library/GCD.thy ~> src/HOL/
2236 src/HOL/Library/Order_Relation.thy ~> src/HOL/
2237 src/HOL/Library/Parity.thy ~> src/HOL/
2238 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
2239 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
2240 src/HOL/Real/Lubs.thy ~> src/HOL/
2241 src/HOL/Real/PReal.thy ~> src/HOL/
2242 src/HOL/Real/Rational.thy ~> src/HOL/
2243 src/HOL/Real/RComplete.thy ~> src/HOL/
2244 src/HOL/Real/RealDef.thy ~> src/HOL/
2245 src/HOL/Real/RealPow.thy ~> src/HOL/
2246 src/HOL/Real/Real.thy ~> src/HOL/
2247 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
2248 src/HOL/Complex/Complex.thy ~> src/HOL/
2249 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
2250 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
2251 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
2252 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
2253 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
2254 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
2255 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
2256 src/HOL/Hyperreal/Log.thy ~> src/HOL/
2257 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
2258 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
2259 src/HOL/Hyperreal/Series.thy ~> src/HOL/
2260 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
2261 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
2262 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
2263 src/HOL/Real/Float ~> src/HOL/Library/
2264 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
2265 src/HOL/Real/RealVector.thy ~> src/HOL/
2267 src/HOL/arith_data.ML ~> src/HOL/Tools
2268 src/HOL/hologic.ML ~> src/HOL/Tools
2269 src/HOL/simpdata.ML ~> src/HOL/Tools
2270 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
2271 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
2272 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
2273 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
2274 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
2275 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
2276 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
2278 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
2279 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
2280 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
2281 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
2282 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
2283 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
2285 * If methods "eval" and "evaluation" encounter a structured proof
2286 state with !!/==>, only the conclusion is evaluated to True (if
2287 possible), avoiding strange error messages.
2289 * Method "sizechange" automates termination proofs using (a
2290 modification of) the size-change principle. Requires SAT solver. See
2291 src/HOL/ex/Termination.thy for examples.
2293 * Simplifier: simproc for let expressions now unfolds if bound
2294 variable occurs at most once in let expression body. INCOMPATIBILITY.
2296 * Method "arith": Linear arithmetic now ignores all inequalities when
2297 fast_arith_neq_limit is exceeded, instead of giving up entirely.
2299 * New attribute "arith" for facts that should always be used
2300 automatically by arithmetic. It is intended to be used locally in
2303 assumes [arith]: "x > 0"
2305 Global usage is discouraged because of possible performance impact.
2307 * New classes "top" and "bot" with corresponding operations "top" and
2308 "bot" in theory Orderings; instantiation of class "complete_lattice"
2309 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
2311 * Changed definition lemma "less_fun_def" in order to provide an
2312 instance for preorders on functions; use lemma "less_le" instead.
2315 * Theory Orderings: class "wellorder" moved here, with explicit
2316 induction rule "less_induct" as assumption. For instantiation of
2317 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
2320 * Theory Orderings: added class "preorder" as superclass of "order".
2321 INCOMPATIBILITY: Instantiation proofs for order, linorder
2322 etc. slightly changed. Some theorems named order_class.* now named
2325 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
2328 * Theory Finite_Set: added a new fold combinator of type
2330 ('a => 'b => 'b) => 'b => 'a set => 'b
2332 Occasionally this is more convenient than the old fold combinator
2333 which is now defined in terms of the new one and renamed to
2336 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
2337 and "ring_simps" have been replaced by "algebra_simps" (which can be
2338 extended with further lemmas!). At the moment both still exist but
2339 the former will disappear at some point.
2341 * Theory Power: Lemma power_Suc is now declared as a simp rule in
2342 class recpower. Type-specific simp rules for various recpower types
2343 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
2345 rat_power_0 -> power_0
2346 rat_power_Suc -> power_Suc
2347 realpow_0 -> power_0
2348 realpow_Suc -> power_Suc
2349 complexpow_0 -> power_0
2350 complexpow_Suc -> power_Suc
2351 power_poly_0 -> power_0
2352 power_poly_Suc -> power_Suc
2354 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
2355 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
2356 dvd has been generalized to class comm_semiring_1. Likewise a bunch
2357 of lemmas from Divides has been generalized from nat to class
2358 semiring_div. INCOMPATIBILITY. This involves the following theorem
2359 renames resulting from duplicate elimination:
2361 dvd_def_mod ~> dvd_eq_mod_eq_0
2362 zero_dvd_iff ~> dvd_0_left_iff
2363 dvd_0 ~> dvd_0_right
2364 DIVISION_BY_ZERO_DIV ~> div_by_0
2365 DIVISION_BY_ZERO_MOD ~> mod_by_0
2366 mult_div ~> div_mult_self2_is_id
2367 mult_mod ~> mod_mult_self2_is_0
2369 * Theory IntDiv: removed many lemmas that are instances of class-based
2370 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
2371 rename old lemmas as follows:
2373 dvd_diff -> nat_dvd_diff
2374 dvd_zminus_iff -> dvd_minus_iff
2375 mod_add1_eq -> mod_add_eq
2376 mod_mult1_eq -> mod_mult_right_eq
2377 mod_mult1_eq' -> mod_mult_left_eq
2378 mod_mult_distrib_mod -> mod_mult_eq
2379 nat_mod_add_left_eq -> mod_add_left_eq
2380 nat_mod_add_right_eq -> mod_add_right_eq
2381 nat_mod_div_trivial -> mod_div_trivial
2382 nat_mod_mod_trivial -> mod_mod_trivial
2383 zdiv_zadd_self1 -> div_add_self1
2384 zdiv_zadd_self2 -> div_add_self2
2385 zdiv_zmult_self1 -> div_mult_self2_is_id
2386 zdiv_zmult_self2 -> div_mult_self1_is_id
2387 zdvd_triv_left -> dvd_triv_left
2388 zdvd_triv_right -> dvd_triv_right
2389 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
2390 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
2391 zmod_zadd_left_eq -> mod_add_left_eq
2392 zmod_zadd_right_eq -> mod_add_right_eq
2393 zmod_zadd_self1 -> mod_add_self1
2394 zmod_zadd_self2 -> mod_add_self2
2395 zmod_zadd1_eq -> mod_add_eq
2396 zmod_zdiff1_eq -> mod_diff_eq
2397 zmod_zdvd_zmod -> mod_mod_cancel
2398 zmod_zmod_cancel -> mod_mod_cancel
2399 zmod_zmult_self1 -> mod_mult_self2_is_0
2400 zmod_zmult_self2 -> mod_mult_self1_is_0
2403 zdvd_abs1 -> abs_dvd_iff
2404 zdvd_abs2 -> dvd_abs_iff
2405 zdvd_refl -> dvd_refl
2406 zdvd_trans -> dvd_trans
2407 zdvd_zadd -> dvd_add
2408 zdvd_zdiff -> dvd_diff
2409 zdvd_zminus_iff -> dvd_minus_iff
2410 zdvd_zminus2_iff -> minus_dvd_iff
2411 zdvd_zmultD -> dvd_mult_right
2412 zdvd_zmultD2 -> dvd_mult_left
2413 zdvd_zmult_mono -> mult_dvd_mono
2414 zdvd_0_right -> dvd_0_right
2415 zdvd_0_left -> dvd_0_left_iff
2416 zdvd_1_left -> one_dvd
2417 zminus_dvd_iff -> minus_dvd_iff
2419 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
2421 * The real numbers offer decimal input syntax: 12.34 is translated
2422 into 1234/10^2. This translation is not reversed upon output.
2424 * Theory Library/Polynomial defines an abstract type 'a poly of
2425 univariate polynomials with coefficients of type 'a. In addition to
2426 the standard ring operations, it also supports div and mod. Code
2427 generation is also supported, using list-style constructors.
2429 * Theory Library/Inner_Product defines a class of real_inner for real
2430 inner product spaces, with an overloaded operation inner :: 'a => 'a
2431 => real. Class real_inner is a subclass of real_normed_vector from
2434 * Theory Library/Product_Vector provides instances for the product
2435 type 'a * 'b of several classes from RealVector and Inner_Product.
2436 Definitions of addition, subtraction, scalar multiplication, norms,
2437 and inner products are included.
2439 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
2440 addition to the field operations, numerals and case syntax are also
2443 * Theory Library/Diagonalize provides constructive version of Cantor's
2444 first diagonalization argument.
2446 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
2447 zlcm (for int); carried together from various gcd/lcm developements in
2448 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
2449 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
2450 may recover tupled syntax as follows:
2452 hide (open) const gcd
2453 abbreviation gcd where
2454 "gcd == (%(a, b). GCD.gcd a b)"
2456 GCD.gcd ("gcd '(_, _')")
2458 The same works for lcm, zgcd, zlcm.
2460 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
2461 instantiations for algebraic structures. Removed some duplicate
2462 theorems. Changes in simp rules. INCOMPATIBILITY.
2464 * ML antiquotation @{code} takes a constant as argument and generates
2465 corresponding code in background and inserts name of the corresponding
2466 resulting ML value/function/datatype constructor binding in place.
2467 All occurrences of @{code} with a single ML block are generated
2468 simultaneously. Provides a generic and safe interface for
2469 instrumentalizing code generation. See
2470 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
2471 In future you ought to refrain from ad-hoc compiling generated SML
2472 code on the ML toplevel. Note that (for technical reasons) @{code}
2473 cannot refer to constants for which user-defined serializations are
2474 set. Refer to the corresponding ML counterpart directly in that
2477 * Command 'rep_datatype': instead of theorem names the command now
2478 takes a list of terms denoting the constructors of the type to be
2479 represented as datatype. The characteristic theorems have to be
2480 proven. INCOMPATIBILITY. Also observe that the following theorems
2481 have disappeared in favour of existing ones:
2483 unit_induct ~> unit.induct
2484 prod_induct ~> prod.induct
2485 sum_induct ~> sum.induct
2486 Suc_Suc_eq ~> nat.inject
2487 Suc_not_Zero Zero_not_Suc ~> nat.distinct
2492 * New locales for orders and lattices where the equivalence relation
2493 is not restricted to equality. INCOMPATIBILITY: all order and lattice
2494 locales use a record structure with field eq for the equivalence.
2496 * New theory of factorial domains.
2498 * Units_l_inv and Units_r_inv are now simp rules by default.
2499 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
2500 and/or r_inv will now also require deletion of these lemmas.
2502 * Renamed the following theorems, INCOMPATIBILITY:
2504 UpperD ~> Upper_memD
2505 LowerD ~> Lower_memD
2506 least_carrier ~> least_closed
2507 greatest_carrier ~> greatest_closed
2508 greatest_Lower_above ~> greatest_Lower_below
2509 one_zero ~> carrier_one_zero
2510 one_not_zero ~> carrier_one_not_zero (collision with assumption)
2515 * Nominal datatypes can now contain type-variables.
2517 * Commands 'nominal_inductive' and 'equivariance' work with local
2520 * Nominal primrec can now works with local theory targets and its
2521 specification syntax now conforms to the general format as seen in
2524 * Method "perm_simp" honours the standard simplifier attributes
2525 (no_asm), (no_asm_use) etc.
2527 * The new predicate #* is defined like freshness, except that on the
2528 left hand side can be a set or list of atoms.
2530 * Experimental command 'nominal_inductive2' derives strong induction
2531 principles for inductive definitions. In contrast to
2532 'nominal_inductive', which can only deal with a fixed number of
2533 binders, it can deal with arbitrary expressions standing for sets of
2534 atoms to be avoided. The only inductive definition we have at the
2535 moment that needs this generalisation is the typing rule for Lets in
2538 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
2539 -----------------------------------------------------------------
2540 Gamma |- Let x be t1 in t2 : T2
2542 In this rule one wants to avoid all the binders that are introduced by
2543 "close Gamma T1". We are looking for other examples where this
2544 feature might be useful. Please let us know.
2549 * Reimplemented the simplification procedure for proving continuity
2550 subgoals. The new simproc is extensible; users can declare additional
2551 continuity introduction rules with the attribute [cont2cont].
2553 * The continuity simproc now uses a different introduction rule for
2554 solving continuity subgoals on terms with lambda abstractions. In
2555 some rare cases the new simproc may fail to solve subgoals that the
2556 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
2557 Potential INCOMPATIBILITY.
2559 * Command 'fixrec': specification syntax now conforms to the general
2560 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
2561 examples. INCOMPATIBILITY.
2566 * Proof of Zorn's Lemma for partial orders.
2571 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
2572 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
2573 depends on multithreading, so timouts will not work before Poly/ML
2576 * High-level support for concurrent ML programming, see
2577 src/Pure/Cuncurrent. The data-oriented model of "future values" is
2578 particularly convenient to organize independent functional
2579 computations. The concept of "synchronized variables" provides a
2580 higher-order interface for components with shared state, avoiding the
2581 delicate details of mutexes and condition variables. (Requires
2582 Poly/ML 5.2.1 or later.)
2584 * ML bindings produced via Isar commands are stored within the Isar
2585 context (theory or proof). Consequently, commands like 'use' and 'ML'
2586 become thread-safe and work with undo as expected (concerning
2587 top-level bindings, not side-effects on global references).
2588 INCOMPATIBILITY, need to provide proper Isar context when invoking the
2589 compiler at runtime; really global bindings need to be given outside a
2590 theory. (Requires Poly/ML 5.2 or later.)
2592 * Command 'ML_prf' is analogous to 'ML' but works within a proof
2593 context. Top-level ML bindings are stored within the proof context in
2594 a purely sequential fashion, disregarding the nested proof structure.
2595 ML bindings introduced by 'ML_prf' are discarded at the end of the
2596 proof. (Requires Poly/ML 5.2 or later.)
2598 * Simplified ML attribute and method setup, cf. functions Attrib.setup
2599 and Method.setup, as well as Isar commands 'attribute_setup' and
2600 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
2601 existing code accordingly, or use plain 'setup' together with old
2604 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
2605 to 'a -> thm, while results are always tagged with an authentic oracle
2606 name. The Isar command 'oracle' is now polymorphic, no argument type
2607 is specified. INCOMPATIBILITY, need to simplify existing oracle code
2608 accordingly. Note that extra performance may be gained by producing
2609 the cterm carefully, avoiding slow Thm.cterm_of.
2611 * Simplified interface for defining document antiquotations via
2612 ThyOutput.antiquotation, ThyOutput.output, and optionally
2613 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
2614 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
2617 * More systematic treatment of long names, abstract name bindings, and
2618 name space operations. Basic operations on qualified names have been
2619 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
2620 Long_Name.append. Old type bstring has been mostly replaced by
2621 abstract type binding (see structure Binding), which supports precise
2622 qualification by packages and local theory targets, as well as proper
2623 tracking of source positions. INCOMPATIBILITY, need to wrap old
2624 bstring values into Binding.name, or better pass through abstract
2625 bindings everywhere. See further src/Pure/General/long_name.ML,
2626 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
2628 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
2629 LocalTheory.note etc.) now refer to the *full* internal name, not the
2630 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
2632 * Disposed old type and term read functions (Sign.read_def_typ,
2633 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
2634 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
2635 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
2636 Syntax.read_term_global etc.; see also OldGoals.read_term as last
2637 resort for legacy applications.
2639 * Disposed old declarations, tactics, tactic combinators that refer to
2640 the simpset or claset of an implicit theory (such as Addsimps,
2641 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
2642 embedded ML text, or local_simpset_of with a proper context passed as
2643 explicit runtime argument.
2645 * Rules and tactics that read instantiations (read_instantiate,
2646 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
2647 context, which is required for parsing and type-checking. Moreover,
2648 the variables are specified as plain indexnames, not string encodings
2649 thereof. INCOMPATIBILITY.
2651 * Generic Toplevel.add_hook interface allows to analyze the result of
2652 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
2653 for theorem dependency output of transactions resulting in a new
2656 * ML antiquotations: block-structured compilation context indicated by
2657 \<lbrace> ... \<rbrace>; additional antiquotation forms:
2659 @{binding name} - basic name binding
2660 @{let ?pat = term} - term abbreviation (HO matching)
2661 @{note name = fact} - fact abbreviation
2662 @{thm fact} - singleton fact (with attributes)
2663 @{thms fact} - general fact (with attributes)
2664 @{lemma prop by method} - singleton goal
2665 @{lemma prop by meth1 meth2} - singleton goal
2666 @{lemma prop1 ... propN by method} - general goal
2667 @{lemma prop1 ... propN by meth1 meth2} - general goal
2668 @{lemma (open) ...} - open derivation
2673 * The Isabelle "emacs" tool provides a specific interface to invoke
2674 Proof General / Emacs, with more explicit failure if that is not
2675 installed (the old isabelle-interface script silently falls back on
2676 isabelle-process). The PROOFGENERAL_HOME setting determines the
2677 installation location of the Proof General distribution.
2679 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
2680 the Isabelle process into a JVM/Scala application. See
2681 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
2682 process wrapper has been discontinued.)
2684 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
2686 * Various status messages (with exact source position information) are
2687 emitted, if proper markup print mode is enabled. This allows
2688 user-interface components to provide detailed feedback on internal
2693 New in Isabelle2008 (June 2008)
2694 -------------------------------
2698 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
2699 and updated, with formally checked references as hyperlinks.
2701 * Theory loader: use_thy (and similar operations) no longer set the
2702 implicit ML context, which was occasionally hard to predict and in
2703 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
2704 provides a proper context already.
2706 * Theory loader: old-style ML proof scripts being *attached* to a thy
2707 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
2708 'use' within a theory file will do the job.
2710 * Name space merge now observes canonical order, i.e. the second space
2711 is inserted into the first one, while existing entries in the first
2712 space take precedence. INCOMPATIBILITY in rare situations, may try to
2713 swap theory imports.
2715 * Syntax: symbol \<chi> is now considered a letter. Potential
2716 INCOMPATIBILITY in identifier syntax etc.
2718 * Outer syntax: string tokens no longer admit escaped white space,
2719 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
2720 white space without escapes.
2722 * Outer syntax: string tokens may contain arbitrary character codes
2723 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
2729 * Context-dependent token translations. Default setup reverts locally
2730 fixed variables, and adds hilite markup for undeclared frees.
2732 * Unused theorems can be found using the new command 'unused_thms'.
2733 There are three ways of invoking it:
2736 Only finds unused theorems in the current theory.
2738 (2) unused_thms thy_1 ... thy_n -
2739 Finds unused theorems in the current theory and all of its ancestors,
2740 excluding the theories thy_1 ... thy_n and all of their ancestors.
2742 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
2743 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
2744 their ancestors, excluding the theories thy_1 ... thy_n and all of
2747 In order to increase the readability of the list produced by
2748 unused_thms, theorems that have been created by a particular instance
2749 of a theory command such as 'inductive' or 'function' are considered
2750 to belong to the same "group", meaning that if at least one theorem in
2751 this group is used, the other theorems in the same group are no longer
2752 reported as unused. Moreover, if all theorems in the group are
2753 unused, only one theorem in the group is displayed.
2755 Note that proof objects have to be switched on in order for
2756 unused_thms to work properly (i.e. !proofs must be >= 1, which is
2757 usually the case when using Proof General with the default settings).
2759 * Authentic naming of facts disallows ad-hoc overwriting of previous
2760 theorems within the same name space. INCOMPATIBILITY, need to remove
2761 duplicate fact bindings, or even accidental fact duplications. Note
2762 that tools may maintain dynamically scoped facts systematically, using
2763 PureThy.add_thms_dynamic.
2765 * Command 'hide' now allows to hide from "fact" name space as well.
2767 * Eliminated destructive theorem database, simpset, claset, and
2768 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
2769 update of theories within ML code.
2771 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2772 INCOMPATIBILITY, object-logics depending on former Pure require
2773 additional setup PureThy.old_appl_syntax_setup; object-logics
2774 depending on former CPure need to refer to Pure.
2776 * Commands 'use' and 'ML' are now purely functional, operating on
2777 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2778 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2781 * Command 'setup': discontinued implicit version with ML reference.
2783 * Instantiation target allows for simultaneous specification of class
2784 instance operations together with an instantiation proof.
2785 Type-checking phase allows to refer to class operations uniformly.
2786 See src/HOL/Complex/Complex.thy for an Isar example and
2787 src/HOL/Library/Eval.thy for an ML example.
2789 * Indexing of literal facts: be more serious about including only
2790 facts from the visible specification/proof context, but not the
2791 background context (locale etc.). Affects `prop` notation and method
2792 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2795 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2796 "(open)" option, which used to expose internal bound variables to the
2799 * Isar statements: removed obsolete case "rule_context".
2800 INCOMPATIBILITY, better use explicit fixes/assumes.
2802 * Locale proofs: default proof step now includes 'unfold_locales';
2803 hence 'proof' without argument may be used to unfold locale
2807 *** Document preparation ***
2809 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2810 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2811 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2812 spot); renamed link color from "darkblue" to "linkcolor" (default
2813 value unchanged, can be redefined via \definecolor); no longer sets
2814 "a4paper" option (unnecessary or even intrusive).
2816 * Antiquotation @{lemma A method} proves proposition A by the given
2817 method (either a method name or a method name plus (optional) method
2818 arguments in parentheses) and prints A just like @{prop A}.
2823 * New primrec package. Specification syntax conforms in style to
2824 definition/function/.... No separate induction rule is provided. The
2825 "primrec" command distinguishes old-style and new-style specifications
2826 by syntax. The former primrec package is now named OldPrimrecPackage.
2827 When adjusting theories, beware: constants stemming from new-style
2828 primrec specifications have authentic syntax.
2830 * Metis prover is now an order of magnitude faster, and also works
2831 with multithreading.
2833 * Metis: the maximum number of clauses that can be produced from a
2834 theorem is now given by the attribute max_clauses. Theorems that
2835 exceed this number are ignored, with a warning printed.
2837 * Sledgehammer no longer produces structured proofs by default. To
2838 enable, declare [[sledgehammer_full = true]]. Attributes
2839 reconstruction_modulus, reconstruction_sorts renamed
2840 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2842 * Method "induct_scheme" derives user-specified induction rules
2843 from well-founded induction and completeness of patterns. This factors
2844 out some operations that are done internally by the function package
2845 and makes them available separately. See
2846 src/HOL/ex/Induction_Scheme.thy for examples.
2848 * More flexible generation of measure functions for termination
2849 proofs: Measure functions can be declared by proving a rule of the
2850 form "is_measure f" and giving it the [measure_function] attribute.
2851 The "is_measure" predicate is logically meaningless (always true), and
2852 just guides the heuristic. To find suitable measure functions, the
2853 termination prover sets up the goal "is_measure ?f" of the appropriate
2854 type and generates all solutions by prolog-style backwards proof using
2857 This setup also deals with rules like
2859 "is_measure f ==> is_measure (list_size f)"
2861 which accommodates nested datatypes that recurse through lists.
2862 Similar rules are predeclared for products and option types.
2864 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2868 - Definitions of overloaded constants on sets have to be replaced by
2869 definitions on => and bool.
2871 - Some definitions of overloaded operators on sets can now be proved
2872 using the definitions of the operators on => and bool. Therefore,
2873 the following theorems have been renamed:
2875 subset_def -> subset_eq
2876 psubset_def -> psubset_eq
2877 set_diff_def -> set_diff_eq
2878 Compl_def -> Compl_eq
2879 Sup_set_def -> Sup_set_eq
2880 Inf_set_def -> Inf_set_eq
2881 sup_set_def -> sup_set_eq
2882 inf_set_def -> inf_set_eq
2884 - Due to the incompleteness of the HO unification algorithm, some
2885 rules such as subst may require manual instantiation, if some of
2886 the unknowns in the rule is a set.
2888 - Higher order unification and forward proofs:
2891 have "P (S::'a set)" <...>
2892 then have "EX S. P S" ..
2894 no longer works (due to the incompleteness of the HO unification
2895 algorithm) and must be replaced by the pattern
2902 - Calculational reasoning with subst (or similar rules):
2905 have "P (S::'a set)" <...>
2906 also have "S = T" <...>
2907 finally have "P T" .
2909 no longer works (for similar reasons as the previous example) and
2910 must be replaced by something like
2912 have "P (S::'a set)" <...>
2913 moreover have "S = T" <...>
2914 ultimately have "P T" by simp
2916 - Tactics or packages written in ML code:
2917 Code performing pattern matching on types via
2919 Type ("set", [T]) => ...
2921 must be rewritten. Moreover, functions like strip_type or
2922 binder_types no longer return the right value when applied to a
2925 T1 => ... => Tn => U => bool
2929 T1 => ... => Tn => U set
2931 * Merged theories Wellfounded_Recursion, Accessible_Part and
2932 Wellfounded_Relations to theory Wellfounded.
2934 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2936 * Class finite no longer treats UNIV as class parameter. Use class
2937 enum from theory Library/Enum instead to achieve a similar effect.
2940 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2941 and "Cons". INCOMPATIBILITY.
2943 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2944 Potential INCOMPATIBILITY.
2946 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2947 injective_fst_snd removed, use split_eta and prod_eqI instead.
2948 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2950 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2951 the same name in theory Orderings:
2961 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2962 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2963 and different variable names.
2965 * Library/Option_ord.thy: Canonical order on option type.
2967 * Library/RBT.thy: Red-black trees, an efficient implementation of
2970 * Library/Countable.thy: Type class for countable types.
2972 * Theory Int: The representation of numerals has changed. The infix
2973 operator BIT and the bit datatype with constructors B0 and B1 have
2974 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2975 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2976 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2979 * Theory Nat: definition of <= and < on natural numbers no longer
2980 depend on well-founded relations. INCOMPATIBILITY. Definitions
2981 le_def and less_def have disappeared. Consider lemmas not_less
2982 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2984 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2985 (whose purpose mainly is for various fold_set functionals) have been
2986 abandoned in favor of the existing algebraic classes
2987 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2988 lower_semilattice (resp. upper_semilattice) and linorder.
2991 * Theory Transitive_Closure: induct and cases rules now declare proper
2992 case_names ("base" and "step"). INCOMPATIBILITY.
2994 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2995 lattices. The form set-specific version is available as
2996 Inductive.lfp_ordinal_induct_set.
2998 * Renamed theorems "power.simps" to "power_int.simps".
3001 * Class semiring_div provides basic abstract properties of semirings
3002 with division and modulo operations. Subsumes former class dvd_mod.
3004 * Merged theories IntDef, Numeral and IntArith into unified theory
3005 Int. INCOMPATIBILITY.
3007 * Theory Library/Code_Index: type "index" now represents natural
3008 numbers rather than integers. INCOMPATIBILITY.
3010 * New class "uminus" with operation "uminus" (split of from class
3011 "minus" which now only has operation "minus", binary).
3014 * Constants "card", "internal_split", "option_map" now with authentic
3015 syntax. INCOMPATIBILITY.
3017 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
3018 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
3019 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
3020 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
3021 Sup_set_def, le_def, less_def, option_map_def now with object
3022 equality. INCOMPATIBILITY.
3024 * Records. Removed K_record, and replaced it by pure lambda term
3025 %x. c. The simplifier setup is now more robust against eta expansion.
3026 INCOMPATIBILITY: in cases explicitly referring to K_record.
3028 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
3030 * Library/ListVector: new theory of arithmetic vector operations.
3032 * Library/Order_Relation: new theory of various orderings as sets of
3033 pairs. Defines preorders, partial orders, linear orders and
3034 well-orders on sets and on types.
3039 * Renamed some theories to allow to loading both ZF and HOL in the
3042 Datatype -> Datatype_ZF
3043 Inductive -> Inductive_ZF
3050 INCOMPATIBILITY: ZF theories that import individual theories below
3051 Main might need to be adapted. Regular theory Main is still
3052 available, as trivial extension of Main_ZF.
3057 * ML within Isar: antiquotation @{const name} or @{const
3058 name(typargs)} produces statically-checked Const term.
3060 * Functor NamedThmsFun: data is available to the user as dynamic fact
3061 (of the same name). Removed obsolete print command.
3063 * Removed obsolete "use_legacy_bindings" function.
3065 * The ``print mode'' is now a thread-local value derived from a global
3066 template (the former print_mode reference), thus access becomes
3067 non-critical. The global print_mode reference is for session
3068 management only; user-code should use print_mode_value,
3069 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
3071 * Functions system/system_out provide a robust way to invoke external
3072 shell commands, with propagation of interrupts (requires Poly/ML
3073 5.2.1). Do not use OS.Process.system etc. from the basis library!
3078 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
3079 in accordance with Proof General 3.7, which prefers GNU emacs.
3081 * isatool tty runs Isabelle process with plain tty interaction;
3082 optional line editor may be specified via ISABELLE_LINE_EDITOR
3083 setting, the default settings attempt to locate "ledit" and "rlwrap".
3085 * isatool browser now works with Cygwin as well, using general
3086 "javapath" function defined in Isabelle process environment.
3088 * YXML notation provides a simple and efficient alternative to
3089 standard XML transfer syntax. See src/Pure/General/yxml.ML and
3090 isatool yxml as described in the Isabelle system manual.
3092 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
3093 provides general wrapper for managing an Isabelle process in a robust
3094 fashion, with ``cooked'' output from stdin/stderr.
3096 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
3097 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
3099 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
3100 way of changing the user's settings is via
3101 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
3104 * Multithreading.max_threads := 0 refers to the number of actual CPU
3105 cores of the underlying machine, which is a good starting point for
3106 optimal performance tuning. The corresponding usedir option -M allows
3107 "max" as an alias for "0". WARNING: does not work on certain versions
3108 of Mac OS (with Poly/ML 5.1).
3110 * isabelle-process: non-ML sessions are run with "nice", to reduce the
3111 adverse effect of Isabelle flooding interactive front-ends (notably
3112 ProofGeneral / XEmacs).
3116 New in Isabelle2007 (November 2007)
3117 -----------------------------------
3121 * More uniform information about legacy features, notably a
3122 warning/error of "Legacy feature: ...", depending on the state of the
3123 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
3124 legacy features will disappear eventually.
3126 * Theory syntax: the header format ``theory A = B + C:'' has been
3127 discontinued in favour of ``theory A imports B C begin''. Use isatool
3128 fixheaders to convert existing theory files. INCOMPATIBILITY.
3130 * Theory syntax: the old non-Isar theory file format has been
3131 discontinued altogether. Note that ML proof scripts may still be used
3132 with Isar theories; migration is usually quite simple with the ML
3133 function use_legacy_bindings. INCOMPATIBILITY.
3135 * Theory syntax: some popular names (e.g. 'class', 'declaration',
3136 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
3139 * Theory loader: be more serious about observing the static theory
3140 header specifications (including optional directories), but not the
3141 accidental file locations of previously successful loads. The strict
3142 update policy of former update_thy is now already performed by
3143 use_thy, so the former has been removed; use_thys updates several
3144 theories simultaneously, just as 'imports' within a theory header
3145 specification, but without merging the results. Potential
3146 INCOMPATIBILITY: may need to refine theory headers and commands
3147 ROOT.ML which depend on load order.
3149 * Theory loader: optional support for content-based file
3150 identification, instead of the traditional scheme of full physical
3151 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
3152 (cf. the system manual). The new scheme allows to work with
3153 non-finished theories in persistent session images, such that source
3154 files may be moved later on without requiring reloads.
3156 * Theory loader: old-style ML proof scripts being *attached* to a thy
3157 file (with the same base name as the theory) are considered a legacy
3158 feature, which will disappear eventually. Even now, the theory loader
3159 no longer maintains dependencies on such files.
3161 * Syntax: the scope for resolving ambiguities via type-inference is
3162 now limited to individual terms, instead of whole simultaneous
3163 specifications as before. This greatly reduces the complexity of the
3164 syntax module and improves flexibility by separating parsing and
3165 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
3166 'fixes' etc.) are required in rare situations.
3168 * Syntax: constants introduced by new-style packages ('definition',
3169 'abbreviation' etc.) are passed through the syntax module in
3170 ``authentic mode''. This means that associated mixfix annotations
3171 really stick to such constants, independently of potential name space
3172 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
3173 trees are represented slightly differently, may need to adapt syntax
3174 translations accordingly. Use CONST marker in 'translations' and
3175 @{const_syntax} antiquotation in 'parse_translation' etc.
3177 * Legacy goal package: reduced interface to the bare minimum required
3178 to keep existing proof scripts running. Most other user-level
3179 functions are now part of the OldGoals structure, which is *not* open
3180 by default (consider isatool expandshort before open OldGoals).
3181 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
3182 these tend to cause confusion about the actual goal (!) context being
3183 used here, which is not necessarily the same as the_context().
3185 * Command 'find_theorems': supports "*" wild-card in "name:"
3186 criterion; "with_dups" option. Certain ProofGeneral versions might
3187 support a specific search form (see ProofGeneral/CHANGES).
3189 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
3190 by default, which means that "prems" (and also "fixed variables") are
3191 suppressed from proof state output. Note that the ProofGeneral
3192 settings mechanism allows to change and save options persistently, but
3193 older versions of Isabelle will fail to start up if a negative prems
3196 * Local theory targets may be specified by non-nested blocks of
3197 ``context/locale/class ... begin'' followed by ``end''. The body may
3198 contain definitions, theorems etc., including any derived mechanism
3199 that has been implemented on top of these primitives. This concept
3200 generalizes the existing ``theorem (in ...)'' towards more versatility
3203 * Proof General interface: proper undo of final 'end' command;
3204 discontinued Isabelle/classic mode (ML proof scripts).
3207 *** Document preparation ***
3209 * Added antiquotation @{theory name} which prints the given name,
3210 after checking that it refers to a valid ancestor theory in the
3213 * Added antiquotations @{ML_type text} and @{ML_struct text} which
3214 check the given source text as ML type/structure, printing verbatim.
3216 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
3217 "c args == rhs" given in the current context. (Any number of
3218 arguments may be given on the LHS.)
3223 * The 'class' package offers a combination of axclass and locale to
3224 achieve Haskell-like type classes in Isabelle. Definitions and
3225 theorems within a class context produce both relative results (with
3226 implicit parameters according to the locale context), and polymorphic
3227 constants with qualified polymorphism (according to the class
3228 context). Within the body context of a 'class' target, a separate
3229 syntax layer ("user space type system") takes care of converting
3230 between global polymorphic consts and internal locale representation.
3231 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
3232 "isatool doc classes" provides a tutorial.
3234 * Generic code generator framework allows to generate executable
3235 code for ML and Haskell (including Isabelle classes). A short usage
3238 internal compilation:
3239 export_code <list of constants (term syntax)> in SML
3240 writing SML code to a file:
3241 export_code <list of constants (term syntax)> in SML <filename>
3242 writing OCaml code to a file:
3243 export_code <list of constants (term syntax)> in OCaml <filename>
3244 writing Haskell code to a bunch of files:
3245 export_code <list of constants (term syntax)> in Haskell <filename>
3247 evaluating closed propositions to True/False using code generation:
3250 Reasonable default setup of framework in HOL.
3252 Theorem attributs for selecting and transforming function equations theorems:
3254 [code fun]: select a theorem as function equation for a specific constant
3255 [code fun del]: deselect a theorem as function equation for a specific constant
3256 [code inline]: select an equation theorem for unfolding (inlining) in place
3257 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
3259 User-defined serializations (target in {SML, OCaml, Haskell}):
3261 code_const <and-list of constants (term syntax)>
3262 {(target) <and-list of const target syntax>}+
3264 code_type <and-list of type constructors>
3265 {(target) <and-list of type target syntax>}+
3267 code_instance <and-list of instances>
3269 where instance ::= <type constructor> :: <class>
3271 code_class <and_list of classes>
3272 {(target) <and-list of class target syntax>}+
3273 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
3275 code_instance and code_class only are effective to target Haskell.
3277 For example usage see src/HOL/ex/Codegenerator.thy and
3278 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
3279 generation from Isabelle/HOL theories is available via "isatool doc
3282 * Code generator: consts in 'consts_code' Isar commands are now
3283 referred to by usual term syntax (including optional type
3286 * Command 'no_translations' removes translation rules from theory
3289 * Overloaded definitions are now actually checked for acyclic
3290 dependencies. The overloading scheme is slightly more general than
3291 that of Haskell98, although Isabelle does not demand an exact
3292 correspondence to type class and instance declarations.
3293 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
3294 exotic versions of overloading -- at the discretion of the user!
3296 Polymorphic constants are represented via type arguments, i.e. the
3297 instantiation that matches an instance against the most general
3298 declaration given in the signature. For example, with the declaration
3299 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
3300 as c(nat). Overloading is essentially simultaneous structural
3301 recursion over such type arguments. Incomplete specification patterns
3302 impose global constraints on all occurrences, e.g. c('a * 'a) on the
3303 LHS means that more general c('a * 'b) will be disallowed on any RHS.
3304 Command 'print_theory' outputs the normalized system of recursive
3305 equations, see section "definitions".
3307 * Configuration options are maintained within the theory or proof
3308 context (with name and type bool/int/string), providing a very simple
3309 interface to a poor-man's version of general context data. Tools may
3310 declare options in ML (e.g. using Attrib.config_int) and then refer to
3311 these values using Config.get etc. Users may change options via an
3312 associated attribute of the same name. This form of context
3313 declaration works particularly well with commands 'declare' or
3314 'using', for example ``declare [[foo = 42]]''. Thus it has become
3315 very easy to avoid global references, which would not observe Isar
3316 toplevel undo/redo and fail to work with multithreading.
3318 Various global ML references of Pure and HOL have been turned into
3319 configuration options:
3321 Unify.search_bound unify_search_bound
3322 Unify.trace_bound unify_trace_bound
3323 Unify.trace_simp unify_trace_simp
3324 Unify.trace_types unify_trace_types
3325 Simplifier.simp_depth_limit simp_depth_limit
3326 Blast.depth_limit blast_depth_limit
3327 DatatypeProp.dtK datatype_distinctness_limit
3328 fast_arith_neq_limit fast_arith_neq_limit
3329 fast_arith_split_limit fast_arith_split_limit
3331 * Named collections of theorems may be easily installed as context
3332 data using the functor NamedThmsFun (see also
3333 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
3334 attributes; there is also a toplevel print command. This facility is
3335 just a common case of general context data, which is the preferred way
3336 for anything more complex than just a list of facts in canonical
3339 * Isar: command 'declaration' augments a local theory by generic
3340 declaration functions written in ML. This enables arbitrary content
3341 being added to the context, depending on a morphism that tells the
3342 difference of the original declaration context wrt. the application
3343 context encountered later on.
3345 * Isar: proper interfaces for simplification procedures. Command
3346 'simproc_setup' declares named simprocs (with match patterns, and body
3347 text in ML). Attribute "simproc" adds/deletes simprocs in the current
3348 context. ML antiquotation @{simproc name} retrieves named simprocs.
3350 * Isar: an extra pair of brackets around attribute declarations
3351 abbreviates a theorem reference involving an internal dummy fact,
3352 which will be ignored later --- only the effect of the attribute on
3353 the background context will persist. This form of in-place
3354 declarations is particularly useful with commands like 'declare' and
3355 'using', for example ``have A using [[simproc a]] by simp''.
3357 * Isar: method "assumption" (and implicit closing of subproofs) now
3358 takes simple non-atomic goal assumptions into account: after applying
3359 an assumption as a rule the resulting subgoals are solved by atomic
3360 assumption steps. This is particularly useful to finish 'obtain'
3361 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
3362 without referring to the original premise "!!x. P x ==> thesis" in the
3363 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
3366 * Isar: implicit use of prems from the Isar proof context is
3367 considered a legacy feature. Common applications like ``have A .''
3368 may be replaced by ``have A by fact'' or ``note `A`''. In general,
3369 referencing facts explicitly here improves readability and
3370 maintainability of proof texts.
3372 * Isar: improper proof element 'guess' is like 'obtain', but derives
3373 the obtained context from the course of reasoning! For example:
3375 assume "EX x y. A x & B y" -- "any previous fact"
3376 then guess x and y by clarify
3378 This technique is potentially adventurous, depending on the facts and
3379 proof tools being involved here.
3381 * Isar: known facts from the proof context may be specified as literal
3382 propositions, using ASCII back-quote syntax. This works wherever
3383 named facts used to be allowed so far, in proof commands, proof
3384 methods, attributes etc. Literal facts are retrieved from the context
3385 according to unification of type and term parameters. For example,
3386 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
3387 theorems in the current context, then these are valid literal facts:
3388 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
3390 There is also a proof method "fact" which does the same composition
3391 for explicit goal states, e.g. the following proof texts coincide with
3392 certain special cases of literal facts:
3394 have "A" by fact == note `A`
3395 have "A ==> B" by fact == note `A ==> B`
3396 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
3397 have "P a ==> Q a" by fact == note `P a ==> Q a`
3399 * Isar: ":" (colon) is no longer a symbolic identifier character in
3400 outer syntax. Thus symbolic identifiers may be used without
3401 additional white space in declarations like this: ``assume *: A''.
3403 * Isar: 'print_facts' prints all local facts of the current context,
3404 both named and unnamed ones.
3406 * Isar: 'def' now admits simultaneous definitions, e.g.:
3408 def x == "t" and y == "u"
3410 * Isar: added command 'unfolding', which is structurally similar to
3411 'using', but affects both the goal state and facts by unfolding given
3412 rewrite rules. Thus many occurrences of the 'unfold' method or
3413 'unfolded' attribute may be replaced by first-class proof text.
3415 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
3416 and command 'unfolding' now all support object-level equalities
3417 (potentially conditional). The underlying notion of rewrite rule is
3418 analogous to the 'rule_format' attribute, but *not* that of the
3419 Simplifier (which is usually more generous).
3421 * Isar: the new attribute [rotated n] (default n = 1) rotates the
3422 premises of a theorem by n. Useful in conjunction with drule.
3424 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
3425 method expression within a sandbox consisting of the first N
3426 sub-goals, which need to exist. For example, ``simp_all [3]''
3427 simplifies the first three sub-goals, while (rule foo, simp_all)[]
3428 simplifies all new goals that emerge from applying rule foo to the
3429 originally first one.
3431 * Isar: schematic goals are no longer restricted to higher-order
3432 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
3435 * Isar: the conclusion of a long theorem statement is now either
3436 'shows' (a simultaneous conjunction, as before), or 'obtains'
3437 (essentially a disjunction of cases with local parameters and
3438 assumptions). The latter allows to express general elimination rules
3439 adequately; in this notation common elimination rules look like this:
3441 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
3443 obtains x where "P x"
3445 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
3449 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
3455 The subsequent classical rules even refer to the formal "thesis"
3458 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
3461 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
3462 obtains "thesis ==> something"
3464 The actual proof of an 'obtains' statement is analogous to that of the
3465 Isar proof element 'obtain', only that there may be several cases.
3466 Optional case names may be specified in parentheses; these will be
3467 available both in the present proof and as annotations in the
3468 resulting rule, for later use with the 'cases' method (cf. attribute
3471 * Isar: the assumptions of a long theorem statement are available as
3472 "assms" fact in the proof context. This is more appropriate than the
3473 (historical) "prems", which refers to all assumptions of the current
3474 context, including those from the target locale, proof body etc.
3476 * Isar: 'print_statement' prints theorems from the current theory or
3477 proof context in long statement form, according to the syntax of a
3480 * Isar: 'obtain' takes an optional case name for the local context
3481 introduction rule (default "that").
3483 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
3484 explicit (is "_ ==> ?foo") in the rare cases where this still happens
3487 * Pure: syntax "CONST name" produces a fully internalized constant
3488 according to the current context. This is particularly useful for
3489 syntax translations that should refer to internal constant
3490 representations independently of name spaces.
3492 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
3493 instead of "FOO ". This allows multiple binder declarations to coexist
3494 in the same context. INCOMPATIBILITY.
3496 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
3497 primitive that also works in a locale context (both for constants and
3498 fixed variables). Type declaration and internal syntactic representation
3499 of given constants retrieved from the context. Likewise, the
3500 'no_notation' command allows to remove given syntax annotations from the
3503 * Isar/locales: new derived specification elements 'axiomatization',
3504 'definition', 'abbreviation', which support type-inference, admit
3505 object-level specifications (equality, equivalence). See also the
3506 isar-ref manual. Examples:
3509 eq (infix "===" 50) where
3510 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
3512 definition "f x y = x + y + 1"
3513 definition g where "g x = f x x"
3516 neq (infix "=!=" 50) where
3517 "x =!= y == ~ (x === y)"
3519 These specifications may be also used in a locale context. Then the
3520 constants being introduced depend on certain fixed parameters, and the
3521 constant name is qualified by the locale base name. An internal
3522 abbreviation takes care for convenient input and output, making the
3523 parameters implicit and using the original short name. See also
3524 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
3525 entities from a monomorphic theory.
3527 Presently, abbreviations are only available 'in' a target locale, but
3528 not inherited by general import expressions. Also note that
3529 'abbreviation' may be used as a type-safe replacement for 'syntax' +
3530 'translations' in common applications. The "no_abbrevs" print mode
3531 prevents folding of abbreviations in term output.
3533 Concrete syntax is attached to specified constants in internal form,
3534 independently of name spaces. The parse tree representation is
3535 slightly different -- use 'notation' instead of raw 'syntax', and
3536 'translations' with explicit "CONST" markup to accommodate this.
3538 * Pure/Isar: unified syntax for new-style specification mechanisms
3539 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
3540 full type inference and dummy patterns ("_"). For example:
3542 definition "K x _ = x"
3544 inductive conj for A B
3545 where "A ==> B ==> conj A B"
3547 * Pure: command 'print_abbrevs' prints all constant abbreviations of
3548 the current context. Print mode "no_abbrevs" prevents inversion of
3549 abbreviations on output.
3551 * Isar/locales: improved parameter handling: use of locales "var" and
3552 "struct" no longer necessary; - parameter renamings are no longer
3553 required to be injective. For example, this allows to define
3554 endomorphisms as locale endom = homom mult mult h.
3556 * Isar/locales: changed the way locales with predicates are defined.
3557 Instead of accumulating the specification, the imported expression is
3558 now an interpretation. INCOMPATIBILITY: different normal form of
3559 locale expressions. In particular, in interpretations of locales with
3560 predicates, goals repesenting already interpreted fragments are not
3561 removed automatically. Use methods `intro_locales' and
3562 `unfold_locales'; see below.
3564 * Isar/locales: new methods `intro_locales' and `unfold_locales'
3565 provide backward reasoning on locales predicates. The methods are
3566 aware of interpretations and discharge corresponding goals.
3567 `intro_locales' is less aggressive then `unfold_locales' and does not
3568 unfold predicates to assumptions.
3570 * Isar/locales: the order in which locale fragments are accumulated
3571 has changed. This enables to override declarations from fragments due
3572 to interpretations -- for example, unwanted simp rules.
3574 * Isar/locales: interpretation in theories and proof contexts has been
3575 extended. One may now specify (and prove) equations, which are
3576 unfolded in interpreted theorems. This is useful for replacing
3577 defined concepts (constants depending on locale parameters) by
3578 concepts already existing in the target context. Example:
3580 interpretation partial_order ["op <= :: [int, int] => bool"]
3581 where "partial_order.less (op <=) (x::int) y = (x < y)"
3583 Typically, the constant `partial_order.less' is created by a
3584 definition specification element in the context of locale
3587 * Method "induct": improved internal context management to support
3588 local fixes and defines on-the-fly. Thus explicit meta-level
3589 connectives !! and ==> are rarely required anymore in inductive goals
3590 (using object-logic connectives for this purpose has been long
3591 obsolete anyway). Common proof patterns are explained in
3592 src/HOL/Induct/Common_Patterns.thy, see also
3593 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
3596 * Method "induct": improved handling of simultaneous goals. Instead of
3597 introducing object-level conjunction, the statement is now split into
3598 several conclusions, while the corresponding symbolic cases are nested
3599 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
3600 see src/HOL/Induct/Common_Patterns.thy, for example.
3602 * Method "induct": mutual induction rules are now specified as a list
3603 of rule sharing the same induction cases. HOL packages usually provide
3604 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
3605 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
3606 mutual induction rules differently, i.e. like this:
3608 (induct rule: foo_bar.inducts)
3609 (induct set: foo bar)
3610 (induct pred: foo bar)
3611 (induct type: foo bar)
3613 The ML function ProjectRule.projections turns old-style rules into the
3616 * Method "coinduct": dual of induction, see
3617 src/HOL/Library/Coinductive_List.thy for various examples.
3619 * Method "cases", "induct", "coinduct": the ``(open)'' option is
3620 considered a legacy feature.
3622 * Attribute "symmetric" produces result with standardized schematic
3623 variables (index 0). Potential INCOMPATIBILITY.
3625 * Simplifier: by default the simplifier trace only shows top level
3626 rewrites now. That is, trace_simp_depth_limit is set to 1 by
3627 default. Thus there is less danger of being flooded by the trace. The
3628 trace indicates where parts have been suppressed.
3630 * Provers/classical: removed obsolete classical version of elim_format
3631 attribute; classical elim/dest rules are now treated uniformly when
3632 manipulating the claset.
3634 * Provers/classical: stricter checks to ensure that supplied intro,
3635 dest and elim rules are well-formed; dest and elim rules must have at
3638 * Provers/classical: attributes dest/elim/intro take an optional
3639 weight argument for the rule (just as the Pure versions). Weights are
3640 ignored by automated tools, but determine the search order of single
3643 * Syntax: input syntax now supports dummy variable binding "%_. b",
3644 where the body does not mention the bound variable. Note that dummy
3645 patterns implicitly depend on their context of bounds, which makes
3646 "{_. _}" match any set comprehension as expected. Potential
3647 INCOMPATIBILITY -- parse translations need to cope with syntactic
3648 constant "_idtdummy" in the binding position.
3650 * Syntax: removed obsolete syntactic constant "_K" and its associated
3651 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
3652 for example "A -> B" => "Pi A (%_. B)".
3654 * Pure: 'class_deps' command visualizes the subclass relation, using
3655 the graph browser tool.
3657 * Pure: 'print_theory' now suppresses certain internal declarations by
3658 default; use '!' option for full details.
3663 * Method "metis" proves goals by applying the Metis general-purpose
3664 resolution prover (see also http://gilith.com/software/metis/).
3665 Examples are in the directory MetisExamples. WARNING: the
3666 Isabelle/HOL-Metis integration does not yet work properly with
3669 * Command 'sledgehammer' invokes external automatic theorem provers as
3670 background processes. It generates calls to the "metis" method if
3671 successful. These can be pasted into the proof. Users do not have to
3672 wait for the automatic provers to return. WARNING: does not really
3673 work with multi-threading.
3675 * New "auto_quickcheck" feature tests outermost goal statements for
3676 potential counter-examples. Controlled by ML references
3677 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
3678 5000 milliseconds). Fails silently if statements is outside of
3679 executable fragment, or any other codgenerator problem occurs.
3681 * New constant "undefined" with axiom "undefined x = undefined".
3683 * Added class "HOL.eq", allowing for code generation with polymorphic
3686 * Some renaming of class constants due to canonical name prefixing in
3687 the new 'class' package:
3689 HOL.abs ~> HOL.abs_class.abs
3690 HOL.divide ~> HOL.divide_class.divide
3691 0 ~> HOL.zero_class.zero
3692 1 ~> HOL.one_class.one
3693 op + ~> HOL.plus_class.plus
3694 op - ~> HOL.minus_class.minus
3695 uminus ~> HOL.minus_class.uminus
3696 op * ~> HOL.times_class.times
3697 op < ~> HOL.ord_class.less
3698 op <= > HOL.ord_class.less_eq
3699 Nat.power ~> Power.power_class.power
3700 Nat.size ~> Nat.size_class.size
3701 Numeral.number_of ~> Numeral.number_class.number_of
3702 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
3703 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
3704 Orderings.min ~> Orderings.ord_class.min
3705 Orderings.max ~> Orderings.ord_class.max
3706 Divides.op div ~> Divides.div_class.div
3707 Divides.op mod ~> Divides.div_class.mod
3708 Divides.op dvd ~> Divides.div_class.dvd
3710 INCOMPATIBILITY. Adaptions may be required in the following cases:
3712 a) User-defined constants using any of the names "plus", "minus",
3713 "times", "less" or "less_eq". The standard syntax translations for
3714 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
3717 b) Variables named "plus", "minus", "times", "less", "less_eq"
3718 INCOMPATIBILITY: use more specific names.
3720 c) Permutative equations (e.g. "a + b = b + a")
3721 Since the change of names also changes the order of terms, permutative
3722 rewrite rules may get applied in a different order. Experience shows
3723 that this is rarely the case (only two adaptions in the whole Isabelle
3724 distribution). INCOMPATIBILITY: rewrite proofs
3726 d) ML code directly refering to constant names
3727 This in general only affects hand-written proof tactics, simprocs and
3728 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
3729 Consider using @{const_name} antiquotation.
3731 * New class "default" with associated constant "default".
3733 * Function "sgn" is now overloaded and available on int, real, complex
3734 (and other numeric types), using class "sgn". Two possible defs of
3735 sgn are given as equational assumptions in the classes sgn_if and
3736 sgn_div_norm; ordered_idom now also inherits from sgn_if.
3739 * Locale "partial_order" now unified with class "order" (cf. theory
3740 Orderings), added parameter "less". INCOMPATIBILITY.
3742 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
3743 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
3744 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
3746 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
3747 changed order of proof goals in instance proofs.
3749 * The transitivity reasoner for partial and linear orders is set up
3750 for classes "order" and "linorder". Instances of the reasoner are available
3751 in all contexts importing or interpreting the corresponding locales.
3752 Method "order" invokes the reasoner separately; the reasoner
3753 is also integrated with the Simplifier as a solver. Diagnostic
3754 command 'print_orders' shows the available instances of the reasoner
3755 in the current context.
3757 * Localized monotonicity predicate in theory "Orderings"; integrated
3758 lemmas max_of_mono and min_of_mono with this predicate.
3761 * Formulation of theorem "dense" changed slightly due to integration
3762 with new class dense_linear_order.
3764 * Uniform lattice theory development in HOL.
3766 constants "meet" and "join" now named "inf" and "sup"
3767 constant "Meet" now named "Inf"
3769 classes "meet_semilorder" and "join_semilorder" now named
3770 "lower_semilattice" and "upper_semilattice"
3771 class "lorder" now named "lattice"
3772 class "comp_lat" now named "complete_lattice"
3774 Instantiation of lattice classes allows explicit definitions
3775 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3777 INCOMPATIBILITY. Theorem renames:
3779 meet_left_le ~> inf_le1
3780 meet_right_le ~> inf_le2
3781 join_left_le ~> sup_ge1
3782 join_right_le ~> sup_ge2
3783 meet_join_le ~> inf_sup_ord
3786 le_meet ~> le_inf_iff
3787 le_join ~> ge_sup_conv
3788 meet_idempotent ~> inf_idem
3789 join_idempotent ~> sup_idem
3790 meet_comm ~> inf_commute
3791 join_comm ~> sup_commute
3792 meet_leI1 ~> le_infI1
3793 meet_leI2 ~> le_infI2
3794 le_joinI1 ~> le_supI1
3795 le_joinI2 ~> le_supI2
3796 meet_assoc ~> inf_assoc
3797 join_assoc ~> sup_assoc
3798 meet_left_comm ~> inf_left_commute
3799 meet_left_idempotent ~> inf_left_idem
3800 join_left_comm ~> sup_left_commute
3801 join_left_idempotent ~> sup_left_idem
3804 le_def_meet ~> le_iff_inf
3805 le_def_join ~> le_iff_sup
3806 join_absorp2 ~> sup_absorb2
3807 join_absorp1 ~> sup_absorb1
3808 meet_absorp1 ~> inf_absorb1
3809 meet_absorp2 ~> inf_absorb2
3810 meet_join_absorp ~> inf_sup_absorb
3811 join_meet_absorp ~> sup_inf_absorb
3812 distrib_join_le ~> distrib_sup_le
3813 distrib_meet_le ~> distrib_inf_le
3815 add_meet_distrib_left ~> add_inf_distrib_left
3816 add_join_distrib_left ~> add_sup_distrib_left
3817 is_join_neg_meet ~> is_join_neg_inf
3818 is_meet_neg_join ~> is_meet_neg_sup
3819 add_meet_distrib_right ~> add_inf_distrib_right
3820 add_join_distrib_right ~> add_sup_distrib_right
3821 add_meet_join_distribs ~> add_sup_inf_distribs
3822 join_eq_neg_meet ~> sup_eq_neg_inf
3823 meet_eq_neg_join ~> inf_eq_neg_sup
3824 add_eq_meet_join ~> add_eq_inf_sup
3825 meet_0_imp_0 ~> inf_0_imp_0
3826 join_0_imp_0 ~> sup_0_imp_0
3827 meet_0_eq_0 ~> inf_0_eq_0
3828 join_0_eq_0 ~> sup_0_eq_0
3829 neg_meet_eq_join ~> neg_inf_eq_sup
3830 neg_join_eq_meet ~> neg_sup_eq_inf
3831 join_eq_if ~> sup_eq_if
3833 mono_meet ~> mono_inf
3834 mono_join ~> mono_sup
3835 meet_bool_eq ~> inf_bool_eq
3836 join_bool_eq ~> sup_bool_eq
3837 meet_fun_eq ~> inf_fun_eq
3838 join_fun_eq ~> sup_fun_eq
3839 meet_set_eq ~> inf_set_eq
3840 join_set_eq ~> sup_set_eq
3841 meet1_iff ~> inf1_iff
3842 meet2_iff ~> inf2_iff
3851 join1_iff ~> sup1_iff
3852 join2_iff ~> sup2_iff
3862 is_meet_Meet ~> is_meet_Inf
3863 Meet_bool_def ~> Inf_bool_def
3864 Meet_fun_def ~> Inf_fun_def
3865 Meet_greatest ~> Inf_greatest
3866 Meet_lower ~> Inf_lower
3867 Meet_set_def ~> Inf_set_def
3870 Sup_bool_eq ~> Sup_bool_def
3871 Sup_fun_eq ~> Sup_fun_def
3872 Sup_set_eq ~> Sup_set_def
3874 listsp_meetI ~> listsp_infI
3875 listsp_meet_eq ~> listsp_inf_eq
3880 * Added syntactic class "size"; overloaded constant "size" now has
3881 type "'a::size ==> bool"
3883 * Internal reorganisation of `size' of datatypes: size theorems
3884 "foo.size" are no longer subsumed by "foo.simps" (but are still
3885 simplification rules by default!); theorems "prod.size" now named
3888 * Class "div" now inherits from class "times" rather than "type".
3891 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3892 Linorder etc. have disappeared; operations defined in terms of
3893 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3895 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3897 * HOL-Word: New extensive library and type for generic, fixed size
3898 machine words, with arithemtic, bit-wise, shifting and rotating
3899 operations, reflection into int, nat, and bool lists, automation for
3900 linear arithmetic (by automatic reflection into nat or int), including
3901 lemmas on overflow and monotonicity. Instantiated to all appropriate
3902 arithmetic type classes, supporting automatic simplification of
3903 numerals on all operations.
3905 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3907 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3909 * Code generator library theories:
3910 - Code_Integer represents HOL integers by big integer literals in target
3912 - Code_Char represents HOL characters by character literals in target
3914 - Code_Char_chr like Code_Char, but also offers treatment of character
3915 codes; includes Code_Integer.
3916 - Executable_Set allows to generate code for finite sets using lists.
3917 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3919 - Executable_Real implements a subset of real numbers, namly those
3920 representable by rational numbers.
3921 - Efficient_Nat implements natural numbers by integers, which in general will
3922 result in higher efficency; pattern matching with 0/Suc is eliminated;
3923 includes Code_Integer.
3924 - Code_Index provides an additional datatype index which is mapped to
3925 target-language built-in integers.
3926 - Code_Message provides an additional datatype message_string which is isomorphic to
3927 strings; messages are mapped to target-language strings.
3929 * New package for inductive predicates
3931 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3934 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3935 for z_1 :: U_1 and ... and z_n :: U_m
3937 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3940 with full support for type-inference, rather than
3942 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3944 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3945 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3947 inductive "s z_1 ... z_m"
3949 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3952 For backward compatibility, there is a wrapper allowing inductive
3953 sets to be defined with the new package via
3956 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3957 for z_1 :: U_1 and ... and z_n :: U_m
3959 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3965 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3966 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3967 for z_1 :: U_1 and ... and z_n :: U_m
3969 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3970 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3973 if the additional syntax "p ..." is required.
3975 Numerous examples can be found in the subdirectories src/HOL/Auth,
3976 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3980 - Since declaration and definition of inductive sets or predicates
3981 is no longer separated, abbreviations involving the newly
3982 introduced sets or predicates must be specified together with the
3983 introduction rules after the 'where' keyword (see above), rather
3984 than before the actual inductive definition.
3986 - The variables in induction and elimination rules are now
3987 quantified in the order of their occurrence in the introduction
3988 rules, rather than in alphabetical order. Since this may break
3989 some proofs, these proofs either have to be repaired, e.g. by
3990 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3991 statements of the form
3993 case (rule_i a_i_1 ... a_i_{k_i})
3995 or the old order of quantification has to be restored by explicitly adding
3996 meta-level quantifiers in the introduction rules, i.e.
3998 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
4000 - The format of the elimination rules is now
4002 p z_1 ... z_m x_1 ... x_n ==>
4003 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4008 (x_1, ..., x_n) : s z_1 ... z_m ==>
4009 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4012 for sets rather than
4014 x : s z_1 ... z_m ==>
4015 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
4018 This may require terms in goals to be expanded to n-tuples
4019 (e.g. using case_tac or simplification with the split_paired_all
4020 rule) before the above elimination rule is applicable.
4022 - The elimination or case analysis rules for (mutually) inductive
4023 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
4024 list of rules "p_1_..._p_k.elims" is no longer available.
4026 * New package "function"/"fun" for general recursive functions,
4027 supporting mutual and nested recursion, definitions in local contexts,
4028 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
4029 for small examples, and the separate tutorial on the function
4030 package. The old recdef "package" is still available as before, but
4031 users are encouraged to use the new package.
4033 * Method "lexicographic_order" automatically synthesizes termination
4034 relations as lexicographic combinations of size measures.
4036 * Case-expressions allow arbitrary constructor-patterns (including
4037 "_") and take their order into account, like in functional
4038 programming. Internally, this is translated into nested
4039 case-expressions; missing cases are added and mapped to the predefined
4040 constant "undefined". In complicated cases printing may no longer show
4041 the original input but the internal form. Lambda-abstractions allow
4042 the same form of pattern matching: "% pat1 => e1 | ..." is an
4043 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
4046 * IntDef: The constant "int :: nat => int" has been removed; now "int"
4047 is an abbreviation for "of_nat :: nat => int". The simplification
4048 rules for "of_nat" have been changed to work like "int" did
4049 previously. Potential INCOMPATIBILITY:
4050 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
4051 - of_nat_diff and of_nat_mult are no longer default simp rules
4053 * Method "algebra" solves polynomial equations over (semi)rings using
4054 Groebner bases. The (semi)ring structure is defined by locales and the
4055 tool setup depends on that generic context. Installing the method for
4056 a specific type involves instantiating the locale and possibly adding
4057 declarations for computation on the coefficients. The method is
4058 already instantiated for natural numbers and for the axiomatic class
4059 of idoms with numerals. See also the paper by Chaieb and Wenzel at
4060 CALCULEMUS 2007 for the general principles underlying this
4061 architecture of context-aware proof-tools.
4063 * Method "ferrack" implements quantifier elimination over
4064 special-purpose dense linear orders using locales (analogous to
4065 "algebra"). The method is already installed for class
4066 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
4069 * Former constant "List.op @" now named "List.append". Use ML
4070 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
4071 circumvent possible incompatibilities when working on ML level.
4073 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
4075 * New function listsum :: 'a list => 'a for arbitrary monoids.
4076 Special syntax: "SUM x <- xs. f x" (and latex variants)
4078 * New syntax for Haskell-like list comprehension (input only), eg.
4079 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
4081 * The special syntax for function "filter" has changed from [x :
4082 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
4083 comprehension syntax, and for uniformity. INCOMPATIBILITY.
4085 * [a..b] is now defined for arbitrary linear orders. It used to be
4086 defined on nat only, as an abbreviation for [a..<Suc b]
4089 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
4091 * New functions "sorted" and "sort" in src/HOL/List.thy.
4093 * New lemma collection field_simps (an extension of ring_simps) for
4094 manipulating (in)equations involving division. Multiplies with all
4095 denominators that can be proved to be non-zero (in equations) or
4096 positive/negative (in inequations).
4098 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
4099 have been improved and renamed to ring_simps, group_simps and
4100 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
4101 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
4103 * Theory Library/Commutative_Ring: switched from recdef to function
4104 package; constants add, mul, pow now curried. Infix syntax for
4105 algebraic operations.
4107 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
4110 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
4113 * HOL/records: generalised field-update to take a function on the
4114 field rather than the new value: r(|A := x|) is translated to A_update
4115 (K x) r The K-combinator that is internally used is called K_record.
4116 INCOMPATIBILITY: Usage of the plain update functions has to be
4119 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
4120 * x = 0, which are required for a semiring. Richer structures do not
4121 inherit from semiring_0 anymore, because this property is a theorem
4122 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
4123 there is more to prove, but this is mostly trivial.
4125 * Class "recpower" is generalized to arbitrary monoids, not just
4126 commutative semirings. INCOMPATIBILITY: may need to incorporate
4127 commutativity or semiring properties additionally.
4129 * Constant "List.list_all2" in List.thy now uses authentic syntax.
4130 INCOMPATIBILITY: translations containing list_all2 may go wrong,
4131 better use 'abbreviation'.
4133 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
4135 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
4136 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
4137 significant changes for setting up numeral syntax for types:
4138 - New constants Numeral.pred and Numeral.succ instead
4139 of former Numeral.bin_pred and Numeral.bin_succ.
4140 - Use integer operations instead of bin_add, bin_mult and so on.
4141 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
4142 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
4144 See src/HOL/Integ/IntArith.thy for an example setup.
4146 * Command 'normal_form' computes the normal form of a term that may
4147 contain free variables. For example ``normal_form "rev [a, b, c]"''
4148 produces ``[b, c, a]'' (without proof). This command is suitable for
4149 heavy-duty computations because the functions are compiled to ML
4150 first. Correspondingly, a method "normalization" is provided. See
4151 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
4153 * Alternative iff syntax "A <-> B" for equality on bool (with priority
4154 25 like -->); output depends on the "iff" print_mode, the default is
4155 "A = B" (with priority 50).
4157 * Relations less (<) and less_eq (<=) are also available on type bool.
4158 Modified syntax to disallow nesting without explicit parentheses,
4159 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
4162 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
4164 * Relation composition operator "op O" now has precedence 75 and binds
4165 stronger than union and intersection. INCOMPATIBILITY.
4167 * The old set interval syntax "{m..n(}" (and relatives) has been
4168 removed. Use "{m..<n}" (and relatives) instead.
4170 * In the context of the assumption "~(s = t)" the Simplifier rewrites
4171 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
4172 ``declare [[simproc del: neq]]''.
4174 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
4177 * Theorem Cons_eq_map_conv no longer declared as "simp".
4179 * Theorem setsum_mult renamed to setsum_right_distrib.
4181 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
4184 * Reimplemented methods "sat" and "satx", with several improvements:
4185 goals no longer need to be stated as "<prems> ==> False", equivalences
4186 (i.e. "=" on type bool) are handled, variable names of the form
4187 "lit_<n>" are no longer reserved, significant speedup.
4189 * Methods "sat" and "satx" can now replay MiniSat proof traces.
4190 zChaff is still supported as well.
4192 * 'inductive' and 'datatype': provide projections of mutual rules,
4193 bundled as foo_bar.inducts;
4195 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
4198 * Library: moved theory Accessible_Part to main HOL.
4200 * Library: added theory Coinductive_List of potentially infinite lists
4201 as greatest fixed-point.
4203 * Library: added theory AssocList which implements (finite) maps as
4206 * Method "evaluation" solves goals (i.e. a boolean expression)
4207 efficiently by compiling it to ML. The goal is "proved" (via an
4208 oracle) if it evaluates to True.
4210 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
4211 also when invoked by the simplifier. This results in the Simplifier
4212 being more powerful on arithmetic goals. INCOMPATIBILITY.
4213 Configuration option fast_arith_split_limit=0 recovers the old
4216 * Support for hex (0x20) and binary (0b1001) numerals.
4218 * New method: reify eqs (t), where eqs are equations for an
4219 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
4220 parameter, computes a term s::'b and a list xs::'a list and proves the
4221 theorem I xs s = t. This is also known as reification or quoting. The
4222 resulting theorem is applied to the subgoal to substitute t with I xs
4223 s. If t is omitted, the subgoal itself is reified.
4225 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
4226 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
4227 where f is supposed to be a computable function (in the sense of code
4228 generattion). The method uses reify to compute s and xs as above then
4229 applies corr_thm and uses normalization by evaluation to "prove" f s =
4230 r and finally gets the theorem t = r, which is again applied to the
4231 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
4233 * Reflection: Automatic reification now handels binding, an example is
4234 available in src/HOL/ex/ReflectionEx.thy
4236 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
4237 command 'statespace' that is similar to 'record', but introduces an
4238 abstract specification based on the locale infrastructure instead of
4239 HOL types. This leads to extra flexibility in composing state spaces,
4240 in particular multiple inheritance and renaming of components.
4245 * Hyperreal: Functions root and sqrt are now defined on negative real
4246 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
4247 Nonnegativity side conditions have been removed from many lemmas, so
4248 that more subgoals may now be solved by simplification; potential
4251 * Real: new type classes formalize real normed vector spaces and
4252 algebras, using new overloaded constants scaleR :: real => 'a => 'a
4253 and norm :: 'a => real.
4255 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
4256 reals into other types. The overloaded constant Reals :: 'a set is now
4257 defined as range of_real; potential INCOMPATIBILITY.
4259 * Real: proper support for ML code generation, including 'quickcheck'.
4260 Reals are implemented as arbitrary precision rationals.
4262 * Hyperreal: Several constants that previously worked only for the
4263 reals have been generalized, so they now work over arbitrary vector
4264 spaces. Type annotations may need to be added in some cases; potential
4267 Infinitesimal :: ('a::real_normed_vector) star set
4268 HFinite :: ('a::real_normed_vector) star set
4269 HInfinite :: ('a::real_normed_vector) star set
4270 approx :: ('a::real_normed_vector) star => 'a star => bool
4271 monad :: ('a::real_normed_vector) star => 'a star set
4272 galaxy :: ('a::real_normed_vector) star => 'a star set
4273 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
4274 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
4275 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
4276 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
4277 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
4278 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
4279 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
4280 sgn :: 'a::real_normed_vector => 'a
4281 exp :: 'a::{recpower,real_normed_field,banach} => 'a
4283 * Complex: Some complex-specific constants are now abbreviations for
4284 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
4285 hnorm. Other constants have been entirely removed in favor of the
4286 polymorphic versions (INCOMPATIBILITY):
4290 HInfinite <-- CInfinite
4291 Infinitesimal <-- CInfinitesimal
4294 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
4295 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
4296 (ns)deriv <-- (ns)cderiv
4301 * Formalisation of ideals and the quotient construction over rings.
4303 * Order and lattice theory no longer based on records.
4306 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
4307 greatest_closed. INCOMPATIBILITY.
4309 * Method algebra is now set up via an attribute. For examples see
4310 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
4311 of algebraic structures.
4313 * Renamed theory CRing to Ring.
4318 * Substantial, yet incomplete support for nominal datatypes (binding
4319 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
4320 src/HOL/Nominal/Examples. Prospective users should consult
4321 http://isabelle.in.tum.de/nominal/
4326 * ML basics: just one true type int, which coincides with IntInf.int
4329 * ML within Isar: antiquotations allow to embed statically-checked
4330 formal entities in the source, referring to the context available at
4331 compile-time. For example:
4333 ML {* @{sort "{zero,one}"} *}
4334 ML {* @{typ "'a => 'b"} *}
4335 ML {* @{term "%x. x"} *}
4336 ML {* @{prop "x == y"} *}
4337 ML {* @{ctyp "'a => 'b"} *}
4338 ML {* @{cterm "%x. x"} *}
4339 ML {* @{cprop "x == y"} *}
4340 ML {* @{thm asm_rl} *}
4341 ML {* @{thms asm_rl} *}
4342 ML {* @{type_name c} *}
4343 ML {* @{type_syntax c} *}
4344 ML {* @{const_name c} *}
4345 ML {* @{const_syntax c} *}
4348 ML {* @{theory Pure} *}
4349 ML {* @{theory_ref} *}
4350 ML {* @{theory_ref Pure} *}
4353 ML {* @{clasimpset} *}
4355 The same works for sources being ``used'' within an Isar context.
4357 * ML in Isar: improved error reporting; extra verbosity with
4358 ML_Context.trace enabled.
4360 * Pure/General/table.ML: the join operations now works via exceptions
4361 DUP/SAME instead of type option. This is simpler in simple cases, and
4362 admits slightly more efficient complex applications.
4364 * Pure: 'advanced' translation functions (parse_translation etc.) now
4365 use Context.generic instead of just theory.
4367 * Pure: datatype Context.generic joins theory/Proof.context and
4368 provides some facilities for code that works in either kind of
4369 context, notably GenericDataFun for uniform theory and proof data.
4371 * Pure: simplified internal attribute type, which is now always
4372 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
4373 local (Proof.context) attributes have been discontinued, while
4374 minimizing code duplication. Thm.rule_attribute and
4375 Thm.declaration_attribute build canonical attributes; see also structure
4376 Context for further operations on Context.generic, notably
4377 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
4378 declarations and definitions.
4380 * Context data interfaces (Theory/Proof/GenericDataFun): removed
4381 name/print, uninitialized data defaults to ad-hoc copy of empty value,
4382 init only required for impure data. INCOMPATIBILITY: empty really need
4383 to be empty (no dependencies on theory content!)
4385 * Pure/kernel: consts certification ignores sort constraints given in
4386 signature declarations. (This information is not relevant to the
4387 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
4388 potential INCOMPATIBILITY.
4390 * Pure: axiomatic type classes are now purely definitional, with
4391 explicit proofs of class axioms and super class relations performed
4392 internally. See Pure/axclass.ML for the main internal interfaces --
4393 notably AxClass.define_class supercedes AxClass.add_axclass, and
4394 AxClass.axiomatize_class/classrel/arity supersede
4395 Sign.add_classes/classrel/arities.
4397 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
4398 global/local versions on theory vs. Proof.context have been
4399 discontinued; Attrib.syntax and Method.syntax have been adapted
4400 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
4401 attributes, methods, etc.
4403 * Pure: several functions of signature "... -> theory -> theory * ..."
4404 have been reoriented to "... -> theory -> ... * theory" in order to
4405 allow natural usage in combination with the ||>, ||>>, |-> and
4406 fold_map combinators.
4408 * Pure: official theorem names (closed derivations) and additional
4409 comments (tags) are now strictly separate. Name hints -- which are
4410 maintained as tags -- may be attached any time without affecting the
4413 * Pure: primitive rule lift_rule now takes goal cterm instead of an
4414 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
4415 achieve the old behaviour.
4417 * Pure: the "Goal" constant is now called "prop", supporting a
4418 slightly more general idea of ``protecting'' meta-level rule
4421 * Pure: Logic.(un)varify only works in a global context, which is now
4422 enforced instead of silently assumed. INCOMPATIBILITY, may use
4423 Logic.legacy_(un)varify as temporary workaround.
4425 * Pure: structure Name provides scalable operations for generating
4426 internal variable names, notably Name.variants etc. This replaces
4427 some popular functions from term.ML:
4429 Term.variant -> Name.variant
4430 Term.variantlist -> Name.variant_list
4431 Term.invent_names -> Name.invent_list
4433 Note that low-level renaming rarely occurs in new code -- operations
4434 from structure Variable are used instead (see below).
4436 * Pure: structure Variable provides fundamental operations for proper
4437 treatment of fixed/schematic variables in a context. For example,
4438 Variable.import introduces fixes for schematics of given facts and
4439 Variable.export reverses the effect (up to renaming) -- this replaces
4440 various freeze_thaw operations.
4442 * Pure: structure Goal provides simple interfaces for
4443 init/conclude/finish and tactical prove operations (replacing former
4444 Tactic.prove). Goal.prove is the canonical way to prove results
4445 within a given context; Goal.prove_global is a degraded version for
4446 theory level goals, including a global Drule.standard. Note that
4447 OldGoals.prove_goalw_cterm has long been obsolete, since it is
4448 ill-behaved in a local proof context (e.g. with local fixes/assumes or
4449 in a locale context).
4451 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
4452 and type checking (Syntax.check_term etc.), with common combinations
4453 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
4454 which are considered legacy and await removal.
4456 * Pure/Syntax: generic interfaces for type unchecking
4457 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
4458 with common combinations (Syntax.pretty_term, Syntax.string_of_term
4459 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
4460 available for convenience, but refer to the very same operations using
4461 a mere theory instead of a full context.
4463 * Isar: simplified treatment of user-level errors, using exception
4464 ERROR of string uniformly. Function error now merely raises ERROR,
4465 without any side effect on output channels. The Isar toplevel takes
4466 care of proper display of ERROR exceptions. ML code may use plain
4467 handle/can/try; cat_error may be used to concatenate errors like this:
4469 ... handle ERROR msg => cat_error msg "..."
4471 Toplevel ML code (run directly or through the Isar toplevel) may be
4472 embedded into the Isar toplevel with exception display/debug like
4475 Isar.toplevel (fn () => ...)
4477 INCOMPATIBILITY, removed special transform_error facilities, removed
4478 obsolete variants of user-level exceptions (ERROR_MESSAGE,
4479 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
4480 -- use plain ERROR instead.
4482 * Isar: theory setup now has type (theory -> theory), instead of a
4483 list. INCOMPATIBILITY, may use #> to compose setup functions.
4485 * Isar: ML toplevel pretty printer for type Proof.context, subject to
4486 ProofContext.debug/verbose flags.
4488 * Isar: Toplevel.theory_to_proof admits transactions that modify the
4489 theory before entering a proof state. Transactions now always see a
4490 quasi-functional intermediate checkpoint, both in interactive and
4493 * Isar: simplified interfaces for outer syntax. Renamed
4494 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
4495 OuterSyntax.add_parsers -- this functionality is now included in
4496 OuterSyntax.command etc. INCOMPATIBILITY.
4498 * Simplifier: the simpset of a running simplification process now
4499 contains a proof context (cf. Simplifier.the_context), which is the
4500 very context that the initial simpset has been retrieved from (by
4501 simpset_of/local_simpset_of). Consequently, all plug-in components
4502 (solver, looper etc.) may depend on arbitrary proof data.
4504 * Simplifier.inherit_context inherits the proof context (plus the
4505 local bounds) of the current simplification process; any simproc
4506 etc. that calls the Simplifier recursively should do this! Removed
4507 former Simplifier.inherit_bounds, which is already included here --
4508 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
4509 specify an explicit context using Simplifier.context/theory_context.
4511 * Simplifier/Classical Reasoner: more abstract interfaces
4512 change_simpset/claset for modifying the simpset/claset reference of a
4513 theory; raw versions simpset/claset_ref etc. have been discontinued --
4516 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
4522 * settings: the default heap location within ISABELLE_HOME_USER now
4523 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
4524 Isabelle installations.
4526 * isabelle-process: option -S (secure mode) disables some critical
4527 operations, notably runtime compilation and evaluation of ML source
4530 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
4532 * Support for parallel execution, using native multicore support of
4533 Poly/ML 5.1. The theory loader exploits parallelism when processing
4534 independent theories, according to the given theory header
4535 specifications. The maximum number of worker threads is specified via
4536 usedir option -M or the "max-threads" setting in Proof General. A
4537 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
4538 to 6 on a 8-core machine. User-code needs to observe certain
4539 guidelines for thread-safe programming, see appendix A in the Isar
4540 Implementation manual.
4544 New in Isabelle2005 (October 2005)
4545 ----------------------------------
4549 * Theory headers: the new header syntax for Isar theories is
4552 imports <theory1> ... <theoryN>
4553 uses <file1> ... <fileM>
4556 where the 'uses' part is optional. The previous syntax
4558 theory <name> = <theory1> + ... + <theoryN>:
4560 will disappear in the next release. Use isatool fixheaders to convert
4561 existing theory files. Note that there is no change in ancient
4562 non-Isar theories now, but these will disappear soon.
4564 * Theory loader: parent theories can now also be referred to via
4565 relative and absolute paths.
4567 * Command 'find_theorems' searches for a list of criteria instead of a
4568 list of constants. Known criteria are: intro, elim, dest, name:string,
4569 simp:term, and any term. Criteria can be preceded by '-' to select
4570 theorems that do not match. Intro, elim, dest select theorems that
4571 match the current goal, name:s selects theorems whose fully qualified
4572 name contain s, and simp:term selects all simplification rules whose
4573 lhs match term. Any other term is interpreted as pattern and selects
4574 all theorems matching the pattern. Available in ProofGeneral under
4575 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
4577 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
4579 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
4580 matching the current goal as introduction rule and not having "HOL."
4581 in their name (i.e. not being defined in theory HOL).
4583 * Command 'thms_containing' has been discontinued in favour of
4584 'find_theorems'; INCOMPATIBILITY.
4586 * Communication with Proof General is now 8bit clean, which means that
4587 Unicode text in UTF-8 encoding may be used within theory texts (both
4588 formal and informal parts). Cf. option -U of the Isabelle Proof
4589 General interface. Here are some simple examples (cf. src/HOL/ex):
4591 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
4592 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
4594 * Improved efficiency of the Simplifier and, to a lesser degree, the
4595 Classical Reasoner. Typical big applications run around 2 times
4599 *** Document preparation ***
4601 * Commands 'display_drafts' and 'print_drafts' perform simple output
4602 of raw sources. Only those symbols that do not require additional
4603 LaTeX packages (depending on comments in isabellesym.sty) are
4604 displayed properly, everything else is left verbatim. isatool display
4605 and isatool print are used as front ends (these are subject to the
4606 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
4608 * Command tags control specific markup of certain regions of text,
4609 notably folding and hiding. Predefined tags include "theory" (for
4610 theory begin and end), "proof" for proof commands, and "ML" for
4611 commands involving ML code; the additional tags "visible" and
4612 "invisible" are unused by default. Users may give explicit tag
4613 specifications in the text, e.g. ''by %invisible (auto)''. The
4614 interpretation of tags is determined by the LaTeX job during document
4615 preparation: see option -V of isatool usedir, or options -n and -t of
4616 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
4619 Several document versions may be produced at the same time via isatool
4620 usedir (the generated index.html will link all of them). Typical
4621 specifications include ''-V document=theory,proof,ML'' to present
4622 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
4623 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
4624 these parts without any formal replacement text. The Isabelle site
4625 default settings produce ''document'' and ''outline'' versions as
4628 * Several new antiquotations:
4630 @{term_type term} prints a term with its type annotated;
4632 @{typeof term} prints the type of a term;
4634 @{const const} is the same as @{term const}, but checks that the
4635 argument is a known logical constant;
4637 @{term_style style term} and @{thm_style style thm} print a term or
4638 theorem applying a "style" to it
4642 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
4643 definitions, equations, inequations etc., 'concl' printing only the
4644 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
4645 to print the specified premise. TermStyle.add_style provides an ML
4646 interface for introducing further styles. See also the "LaTeX Sugar"
4647 document practical applications. The ML antiquotation prints
4648 type-checked ML expressions verbatim.
4650 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
4651 and 'text' support optional locale specification '(in loc)', which
4652 specifies the default context for interpreting antiquotations. For
4653 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
4655 * Option 'locale=NAME' of antiquotations specifies an alternative
4656 context interpreting the subsequent argument. For example: @{thm
4657 [locale=lattice] inf_assoc}.
4659 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
4662 * Proper output of antiquotations for theory commands involving a
4663 proof context (such as 'locale' or 'theorem (in loc) ...').
4665 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
4666 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
4668 * isatool usedir: new option -C (default true) controls whether option
4669 -D should include a copy of the original document directory; -C false
4670 prevents unwanted effects such as copying of administrative CVS data.
4675 * Considerably improved version of 'constdefs' command. Now performs
4676 automatic type-inference of declared constants; additional support for
4677 local structure declarations (cf. locales and HOL records), see also
4678 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
4679 sequential dependencies of definitions within a single 'constdefs'
4680 section; moreover, the declared name needs to be an identifier. If
4681 all fails, consider to fall back on 'consts' and 'defs' separately.
4683 * Improved indexed syntax and implicit structures. First of all,
4684 indexed syntax provides a notational device for subscripted
4685 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
4686 expressions. Secondly, in a local context with structure
4687 declarations, number indexes \<^sub>n or the empty index (default
4688 number 1) refer to a certain fixed variable implicitly; option
4689 show_structs controls printing of implicit structures. Typical
4690 applications of these concepts involve record types and locales.
4692 * New command 'no_syntax' removes grammar declarations (and
4693 translations) resulting from the given syntax specification, which is
4694 interpreted in the same manner as for the 'syntax' command.
4696 * 'Advanced' translation functions (parse_translation etc.) may depend
4697 on the signature of the theory context being presently used for
4698 parsing/printing, see also isar-ref manual.
4700 * Improved 'oracle' command provides a type-safe interface to turn an
4701 ML expression of type theory -> T -> term into a primitive rule of
4702 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
4703 is already included here); see also FOL/ex/IffExample.thy;
4706 * axclass: name space prefix for class "c" is now "c_class" (was "c"
4707 before); "cI" is no longer bound, use "c.intro" instead.
4708 INCOMPATIBILITY. This change avoids clashes of fact bindings for
4709 axclasses vs. locales.
4711 * Improved internal renaming of symbolic identifiers -- attach primes
4712 instead of base 26 numbers.
4714 * New flag show_question_marks controls printing of leading question
4715 marks in schematic variable names.
4717 * In schematic variable names, *any* symbol following \<^isub> or
4718 \<^isup> is now treated as part of the base name. For example, the
4719 following works without printing of awkward ".0" indexes:
4721 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
4724 * Inner syntax includes (*(*nested*) comments*).
4726 * Pretty printer now supports unbreakable blocks, specified in mixfix
4727 annotations as "(00...)".
4729 * Clear separation of logical types and nonterminals, where the latter
4730 may only occur in 'syntax' specifications or type abbreviations.
4731 Before that distinction was only partially implemented via type class
4732 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
4733 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
4734 exotic syntax specifications may require further adaption
4735 (e.g. Cube/Cube.thy).
4737 * Removed obsolete type class "logic", use the top sort {} instead.
4738 Note that non-logical types should be declared as 'nonterminals'
4739 rather than 'types'. INCOMPATIBILITY for new object-logic
4742 * Attributes 'induct' and 'cases': type or set names may now be
4743 locally fixed variables as well.
4745 * Simplifier: can now control the depth to which conditional rewriting
4746 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
4749 * Simplifier: simplification procedures may now take the current
4750 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
4751 interface), which is very useful for calling the Simplifier
4752 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
4753 is gone -- use prems_of_ss on the simpset instead. Moreover, the
4754 low-level mk_simproc no longer applies Logic.varify internally, to
4755 allow for use in a context of fixed variables.
4757 * thin_tac now works even if the assumption being deleted contains !!
4758 or ==>. More generally, erule now works even if the major premise of
4759 the elimination rule contains !! or ==>.
4761 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
4763 * Reorganized bootstrapping of the Pure theories; CPure is now derived
4764 from Pure, which contains all common declarations already. Both
4765 theories are defined via plain Isabelle/Isar .thy files.
4766 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
4767 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
4768 use isatool fixcpure to adapt your theory and ML sources.
4770 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
4771 selections of theorems in named facts via index ranges.
4773 * 'print_theorems': in theory mode, really print the difference
4774 wrt. the last state (works for interactive theory development only),
4775 in proof mode print all local facts (cf. 'print_facts');
4777 * 'hide': option '(open)' hides only base names.
4779 * More efficient treatment of intermediate checkpoints in interactive
4782 * Code generator is now invoked via code_module (incremental code
4783 generation) and code_library (modular code generation, ML structures
4784 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4785 must be quoted when used as identifiers.
4787 * New 'value' command for reading, evaluating and printing terms using
4788 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4789 quoted when used as identifier.
4794 * New commands for the interpretation of locale expressions in
4795 theories (1), locales (2) and proof contexts (3). These generate
4796 proof obligations from the expression specification. After the
4797 obligations have been discharged, theorems of the expression are added
4798 to the theory, target locale or proof context. The synopsis of the
4799 commands is a follows:
4801 (1) interpretation expr inst
4802 (2) interpretation target < expr
4803 (3) interpret expr inst
4805 Interpretation in theories and proof contexts require a parameter
4806 instantiation of terms from the current context. This is applied to
4807 specifications and theorems of the interpreted expression.
4808 Interpretation in locales only permits parameter renaming through the
4809 locale expression. Interpretation is smart in that interpretations
4810 that are active already do not occur in proof obligations, neither are
4811 instantiated theorems stored in duplicate. Use 'print_interps' to
4812 inspect active interpretations of a particular locale. For details,
4813 see the Isar Reference manual. Examples can be found in
4814 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4816 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4817 'interpret' instead.
4819 * New context element 'constrains' for adding type constraints to
4822 * Context expressions: renaming of parameters with syntax
4825 * Locale declaration: 'includes' disallowed.
4827 * Proper static binding of attribute syntax -- i.e. types / terms /
4828 facts mentioned as arguments are always those of the locale definition
4829 context, independently of the context of later invocations. Moreover,
4830 locale operations (renaming and type / term instantiation) are applied
4831 to attribute arguments as expected.
4833 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4834 actual attributes; rare situations may require Attrib.attribute to
4835 embed those attributes into Attrib.src that lack concrete syntax.
4836 Attribute implementations need to cooperate properly with the static
4837 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4838 Attrib.XXX_thm etc. already do the right thing without further
4839 intervention. Only unusual applications -- such as "where" or "of"
4840 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4841 on the context and the facts involved -- may have to assign parsed
4842 values to argument tokens explicitly.
4844 * Changed parameter management in theorem generation for long goal
4845 statements with 'includes'. INCOMPATIBILITY: produces a different
4846 theorem statement in rare situations.
4848 * Locale inspection command 'print_locale' omits notes elements. Use
4849 'print_locale!' to have them included in the output.
4854 * Provers/hypsubst.ML: improved version of the subst method, for
4855 single-step rewriting: it now works in bound variable contexts. New is
4856 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4857 rewrite a different subterm than the original subst method, which is
4858 still available as 'simplesubst'.
4860 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4863 * Provers/trancl.ML: new transitivity reasoner for transitive and
4864 reflexive-transitive closure of relations.
4866 * Provers/blast.ML: new reference depth_limit to make blast's depth
4867 limit (previously hard-coded with a value of 20) user-definable.
4869 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4870 is peformed already. Object-logics merely need to finish their
4871 initial simpset configuration as before. INCOMPATIBILITY.
4876 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4879 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4881 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4882 and x-symbol; use option '-m epsilon' to get it actually printed.
4883 Moreover, the mathematically important symbolic identifier \<epsilon>
4884 becomes available as variable, constant etc. INCOMPATIBILITY,
4886 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4887 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4888 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4889 support corresponding Isar calculations.
4891 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4894 * theory SetInterval: changed the syntax for open intervals:
4903 The old syntax is still supported but will disappear in the next
4904 release. For conversion use the following Emacs search and replace
4905 patterns (these are not perfect but work quite well):
4907 {)\([^\.]*\)\.\. -> {\1<\.\.}
4908 \.\.\([^(}]*\)(} -> \.\.<\1}
4910 * Theory Commutative_Ring (in Library): method comm_ring for proving
4911 equalities in commutative rings; method 'algebra' provides a generic
4914 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4915 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4916 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4919 Some new syntax forms are available:
4921 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4922 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4923 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4924 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4926 The latter form "\<Sum>x < k. e" used to be based on a separate
4927 function "Summation", which has been discontinued.
4929 * theory Finite_Set: in structured induction proofs, the insert case
4930 is now 'case (insert x F)' instead of the old counterintuitive 'case
4933 * The 'refute' command has been extended to support a much larger
4934 fragment of HOL, including axiomatic type classes, constdefs and
4935 typedefs, inductive datatypes and recursion.
4937 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4938 Requires zChaff with proof generation to be installed. See
4939 HOL/ex/SAT_Examples.thy for examples.
4941 * Datatype induction via method 'induct' now preserves the name of the
4942 induction variable. For example, when proving P(xs::'a list) by
4943 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4944 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4945 in unstructured proof scripts.
4947 * Reworked implementation of records. Improved scalability for
4948 records with many fields, avoiding performance problems for type
4949 inference. Records are no longer composed of nested field types, but
4950 of nested extension types. Therefore the record type only grows linear
4951 in the number of extensions and not in the number of fields. The
4952 top-level (users) view on records is preserved. Potential
4953 INCOMPATIBILITY only in strange cases, where the theory depends on the
4954 old record representation. The type generated for a record is called
4955 <record_name>_ext_type.
4957 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4958 proofs triggered by a record definition or a simproc (if
4959 quick_and_dirty is enabled). Definitions of large records can take
4962 New simproc record_upd_simproc for simplification of multiple record
4963 updates enabled by default. Moreover, trivial updates are also
4964 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4965 occasionally, since simplification is more powerful by default.
4967 * typedef: proper support for polymorphic sets, which contain extra
4968 type-variables in the term.
4970 * Simplifier: automatically reasons about transitivity chains
4971 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4972 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4973 old proofs break occasionally as simplification may now solve more
4974 goals than previously.
4976 * Simplifier: converts x <= y into x = y if assumption y <= x is
4977 present. Works for all partial orders (class "order"), in particular
4978 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4981 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4982 bound variable or a constant then the let is unfolded. Otherwise
4983 first a is simplified to b, and then f b is simplified to g. If
4984 possible we abstract b from g arriving at "let x = b in h x",
4985 otherwise we unfold the let and arrive at g. The simproc can be
4986 enabled/disabled by the reference use_let_simproc. Potential
4987 INCOMPATIBILITY since simplification is more powerful by default.
4989 * Classical reasoning: the meson method now accepts theorems as arguments.
4991 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4992 jobs to provide advice on the provability of subgoals.
4994 * Theory OrderedGroup and Ring_and_Field: various additions and
4995 improvements to faciliate calculations involving equalities and
4998 The following theorems have been eliminated or modified
5001 abs_eq now named abs_of_nonneg
5002 abs_of_ge_0 now named abs_of_nonneg
5003 abs_minus_eq now named abs_of_nonpos
5004 imp_abs_id now named abs_of_nonneg
5005 imp_abs_neg_id now named abs_of_nonpos
5006 mult_pos now named mult_pos_pos
5007 mult_pos_le now named mult_nonneg_nonneg
5008 mult_pos_neg_le now named mult_nonneg_nonpos
5009 mult_pos_neg2_le now named mult_nonneg_nonpos2
5010 mult_neg now named mult_neg_neg
5011 mult_neg_le now named mult_nonpos_nonpos
5013 * The following lemmas in Ring_and_Field have been added to the simplifier:
5016 not_square_less_zero
5018 The following lemmas have been deleted from Real/RealPow:
5028 * Theory Parity: added rules for simplifying exponents.
5032 The following theorems have been eliminated or modified
5035 list_all_Nil now named list_all.simps(1)
5036 list_all_Cons now named list_all.simps(2)
5037 list_all_conv now named list_all_iff
5038 set_mem_eq now named mem_iff
5040 * Theories SetsAndFunctions and BigO (see HOL/Library) support
5041 asymptotic "big O" calculations. See the notes in BigO.thy.
5046 * Theory RealDef: better support for embedding natural numbers and
5047 integers in the reals.
5049 The following theorems have been eliminated or modified
5052 exp_ge_add_one_self now requires no hypotheses
5053 real_of_int_add reversed direction of equality (use [symmetric])
5054 real_of_int_minus reversed direction of equality (use [symmetric])
5055 real_of_int_diff reversed direction of equality (use [symmetric])
5056 real_of_int_mult reversed direction of equality (use [symmetric])
5058 * Theory RComplete: expanded support for floor and ceiling functions.
5060 * Theory Ln is new, with properties of the natural logarithm
5062 * Hyperreal: There is a new type constructor "star" for making
5063 nonstandard types. The old type names are now type synonyms:
5067 hcomplex = complex star
5069 * Hyperreal: Many groups of similarly-defined constants have been
5070 replaced by polymorphic versions (INCOMPATIBILITY):
5072 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
5074 starset <-- starsetNat, starsetC
5075 *s* <-- *sNat*, *sc*
5076 starset_n <-- starsetNat_n, starsetC_n
5077 *sn* <-- *sNatn*, *scn*
5078 InternalSets <-- InternalNatSets, InternalCSets
5080 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5081 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
5082 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
5083 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
5084 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
5086 * Hyperreal: Many type-specific theorems have been removed in favor of
5087 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
5089 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
5090 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
5091 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
5092 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
5093 right_minus <-- hypreal_add_minus
5094 left_minus <-- {hypreal,hcomplex}_add_minus_left
5095 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
5096 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
5097 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
5098 mult_1_right <-- hcomplex_mult_one_right
5099 mult_zero_left <-- hcomplex_mult_zero_left
5100 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
5101 right_distrib <-- hypnat_add_mult_distrib2
5102 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
5103 right_inverse <-- hypreal_mult_inverse
5104 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
5105 order_refl <-- {hypreal,hypnat}_le_refl
5106 order_trans <-- {hypreal,hypnat}_le_trans
5107 order_antisym <-- {hypreal,hypnat}_le_anti_sym
5108 order_less_le <-- {hypreal,hypnat}_less_le
5109 linorder_linear <-- {hypreal,hypnat}_le_linear
5110 add_left_mono <-- {hypreal,hypnat}_add_left_mono
5111 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
5112 add_nonneg_nonneg <-- hypreal_le_add_order
5114 * Hyperreal: Separate theorems having to do with type-specific
5115 versions of constants have been merged into theorems that apply to the
5116 new polymorphic constants (INCOMPATIBILITY):
5118 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
5119 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
5120 STAR_Un <-- {STAR,NatStar,STARC}_Un
5121 STAR_Int <-- {STAR,NatStar,STARC}_Int
5122 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
5123 STAR_subset <-- {STAR,NatStar,STARC}_subset
5124 STAR_mem <-- {STAR,NatStar,STARC}_mem
5125 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
5126 STAR_diff <-- {STAR,STARC}_diff
5127 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
5128 STARC_hcomplex_of_complex}_image_subset
5129 starset_n_Un <-- starset{Nat,C}_n_Un
5130 starset_n_Int <-- starset{Nat,C}_n_Int
5131 starset_n_Compl <-- starset{Nat,C}_n_Compl
5132 starset_n_diff <-- starset{Nat,C}_n_diff
5133 InternalSets_Un <-- Internal{Nat,C}Sets_Un
5134 InternalSets_Int <-- Internal{Nat,C}Sets_Int
5135 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
5136 InternalSets_diff <-- Internal{Nat,C}Sets_diff
5137 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
5138 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
5139 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
5140 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
5141 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
5142 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5143 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
5144 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
5145 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
5146 starfun_diff <-- starfun{C,RC,CR}_diff
5147 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
5148 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
5149 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
5150 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
5151 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
5152 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
5153 starfun_Id <-- starfunC_Id
5154 starfun_approx <-- starfun{Nat,CR}_approx
5155 starfun_capprox <-- starfun{C,RC}_capprox
5156 starfun_abs <-- starfunNat_rabs
5157 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
5158 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
5159 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
5160 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
5161 starfun_add_capprox <-- starfun{C,RC}_add_capprox
5162 starfun_add_approx <-- starfunCR_add_approx
5163 starfun_inverse_inverse <-- starfunC_inverse_inverse
5164 starfun_divide <-- starfun{C,CR,RC}_divide
5165 starfun_n <-- starfun{Nat,C}_n
5166 starfun_n_mult <-- starfun{Nat,C}_n_mult
5167 starfun_n_add <-- starfun{Nat,C}_n_add
5168 starfun_n_add_minus <-- starfunNat_n_add_minus
5169 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
5170 starfun_n_minus <-- starfun{Nat,C}_n_minus
5171 starfun_n_eq <-- starfun{Nat,C}_n_eq
5173 star_n_add <-- {hypreal,hypnat,hcomplex}_add
5174 star_n_minus <-- {hypreal,hcomplex}_minus
5175 star_n_diff <-- {hypreal,hcomplex}_diff
5176 star_n_mult <-- {hypreal,hcomplex}_mult
5177 star_n_inverse <-- {hypreal,hcomplex}_inverse
5178 star_n_le <-- {hypreal,hypnat}_le
5179 star_n_less <-- {hypreal,hypnat}_less
5180 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
5181 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
5182 star_n_abs <-- hypreal_hrabs
5183 star_n_divide <-- hcomplex_divide
5185 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
5186 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
5187 star_of_diff <-- hypreal_of_real_diff
5188 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
5189 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
5190 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
5191 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
5192 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
5193 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
5194 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
5195 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
5196 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
5197 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
5198 star_of_number_of <-- {hypreal,hcomplex}_number_of
5199 star_of_number_less <-- number_of_less_hypreal_of_real_iff
5200 star_of_number_le <-- number_of_le_hypreal_of_real_iff
5201 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
5202 star_of_less_number <-- hypreal_of_real_less_number_of_iff
5203 star_of_le_number <-- hypreal_of_real_le_number_of_iff
5204 star_of_power <-- hypreal_of_real_power
5205 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
5207 * Hyperreal: new method "transfer" that implements the transfer
5208 principle of nonstandard analysis. With a subgoal that mentions
5209 nonstandard types like "'a star", the command "apply transfer"
5210 replaces it with an equivalent one that mentions only standard types.
5211 To be successful, all free variables must have standard types; non-
5212 standard variables must have explicit universal quantifiers.
5214 * Hyperreal: A theory of Taylor series.
5219 * Discontinued special version of 'constdefs' (which used to support
5220 continuous functions) in favor of the general Pure one with full
5223 * New simplification procedure for solving continuity conditions; it
5224 is much faster on terms with many nested lambda abstractions (cubic
5225 instead of exponential time).
5227 * New syntax for domain package: selector names are now optional.
5228 Parentheses should be omitted unless argument is lazy, for example:
5230 domain 'a stream = cons "'a" (lazy "'a stream")
5232 * New command 'fixrec' for defining recursive functions with pattern
5233 matching; defining multiple functions with mutual recursion is also
5234 supported. Patterns may include the constants cpair, spair, up, sinl,
5235 sinr, or any data constructor defined by the domain package. The given
5236 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
5237 syntax and examples.
5239 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
5240 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
5241 but the proof obligation additionally includes an admissibility
5242 requirement. The packages generate instances of class cpo or pcpo,
5243 with continuity and strictness theorems for Rep and Abs.
5245 * HOLCF: Many theorems have been renamed according to a more standard naming
5246 scheme (INCOMPATIBILITY):
5248 foo_inject: "foo$x = foo$y ==> x = y"
5249 foo_eq: "(foo$x = foo$y) = (x = y)"
5250 foo_less: "(foo$x << foo$y) = (x << y)"
5251 foo_strict: "foo$UU = UU"
5252 foo_defined: "... ==> foo$x ~= UU"
5253 foo_defined_iff: "(foo$x = UU) = (x = UU)"
5258 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
5259 including the First Isomorphism Theorem (on quotienting by the kernel
5262 * ZF/Simplifier: install second copy of type solver that actually
5263 makes use of TC rules declared to Isar proof contexts (or locales);
5264 the old version is still required for ML proof scripts.
5269 * Converted to Isar theory format; use locales instead of axiomatic
5275 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
5278 * Pure/library.ML no longer defines its own option datatype, but uses
5279 that of the SML basis, which has constructors NONE and SOME instead of
5280 None and Some, as well as exception Option.Option instead of OPTION.
5281 The functions the, if_none, is_some, is_none have been adapted
5282 accordingly, while Option.map replaces apsome.
5284 * Pure/library.ML: the exception LIST has been given up in favour of
5285 the standard exceptions Empty and Subscript, as well as
5286 Library.UnequalLengths. Function like Library.hd and Library.tl are
5287 superceded by the standard hd and tl functions etc.
5289 A number of basic list functions are no longer exported to the ML
5290 toplevel, as they are variants of predefined functions. The following
5291 suggests how one can translate existing code:
5293 rev_append xs ys = List.revAppend (xs, ys)
5294 nth_elem (i, xs) = List.nth (xs, i)
5295 last_elem xs = List.last xs
5296 flat xss = List.concat xss
5297 seq fs = List.app fs
5298 partition P xs = List.partition P xs
5299 mapfilter f xs = List.mapPartial f xs
5301 * Pure/library.ML: several combinators for linear functional
5302 transformations, notably reverse application and composition:
5305 (x, y) |-> f f #-> g
5307 * Pure/library.ML: introduced/changed precedence of infix operators:
5309 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
5311 infix 3 o oo ooo oooo;
5312 infix 4 ~~ upto downto;
5314 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
5317 * Pure/library.ML: natural list combinators fold, fold_rev, and
5318 fold_map support linear functional transformations and nesting. For
5321 fold f [x1, ..., xN] y =
5322 y |> f x1 |> ... |> f xN
5324 (fold o fold) f [xs1, ..., xsN] y =
5325 y |> fold f xs1 |> ... |> fold f xsN
5327 fold f [x1, ..., xN] =
5330 (fold o fold) f [xs1, ..., xsN] =
5331 fold f xs1 #> ... #> fold f xsN
5333 * Pure/library.ML: the following selectors on type 'a option are
5336 the: 'a option -> 'a (*partial*)
5337 these: 'a option -> 'a where 'a = 'b list
5338 the_default: 'a -> 'a option -> 'a
5339 the_list: 'a option -> 'a list
5341 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5342 basic operations for association lists, following natural argument
5343 order; moreover the explicit equality predicate passed here avoids
5344 potentially expensive polymorphic runtime equality checks.
5345 The old functions may be expressed as follows:
5347 assoc = uncurry (AList.lookup (op =))
5348 assocs = these oo AList.lookup (op =)
5349 overwrite = uncurry (AList.update (op =)) o swap
5351 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5353 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
5354 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
5356 replacing make_keylist and keyfilter (occassionally used)
5359 make_keylist = AList.make
5360 keyfilter = AList.find (op =)
5362 * eq_fst and eq_snd now take explicit equality parameter, thus
5363 avoiding eqtypes. Naive rewrites:
5365 eq_fst = eq_fst (op =)
5366 eq_snd = eq_snd (op =)
5368 * Removed deprecated apl and apr (rarely used).
5371 apl (n, op) =>>= curry op n
5372 apr (op, m) =>>= fn n => op (n, m)
5374 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
5375 provides a reasonably efficient light-weight implementation of sets as
5378 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
5379 few new operations; existing lookup and update are now curried to
5380 follow natural argument order (for use with fold etc.);
5381 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
5383 * Pure/General: output via the Isabelle channels of
5384 writeln/warning/error etc. is now passed through Output.output, with a
5385 hook for arbitrary transformations depending on the print_mode
5386 (cf. Output.add_mode -- the first active mode that provides a output
5387 function wins). Already formatted output may be embedded into further
5388 text via Output.raw; the result of Pretty.string_of/str_of and derived
5389 functions (string_of_term/cterm/thm etc.) is already marked raw to
5390 accommodate easy composition of diagnostic messages etc. Programmers
5391 rarely need to care about Output.output or Output.raw at all, with
5392 some notable exceptions: Output.output is required when bypassing the
5393 standard channels (writeln etc.), or in token translations to produce
5394 properly formatted results; Output.raw is required when capturing
5395 already output material that will eventually be presented to the user
5396 a second time. For the default print mode, both Output.output and
5397 Output.raw have no effect.
5399 * Pure/General: Output.time_accumulator NAME creates an operator ('a
5400 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
5401 cumulative results are displayed at the end of a batch session.
5403 * Pure/General: File.sysify_path and File.quote_sysify path have been
5404 replaced by File.platform_path and File.shell_path (with appropriate
5405 hooks). This provides a clean interface for unusual systems where the
5406 internal and external process view of file names are different.
5408 * Pure: more efficient orders for basic syntactic entities: added
5409 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
5410 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
5411 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
5412 orders now -- potential INCOMPATIBILITY for code that depends on a
5413 particular order for Symtab.keys, Symtab.dest, etc. (consider using
5414 Library.sort_strings on result).
5416 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
5417 fold_types traverse types/terms from left to right, observing natural
5418 argument order. Supercedes previous foldl_XXX versions, add_frees,
5419 add_vars etc. have been adapted as well: INCOMPATIBILITY.
5421 * Pure: name spaces have been refined, with significant changes of the
5422 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
5423 to extern(_table). The plain name entry path is superceded by a
5424 general 'naming' context, which also includes the 'policy' to produce
5425 a fully qualified name and external accesses of a fully qualified
5426 name; NameSpace.extend is superceded by context dependent
5427 Sign.declare_name. Several theory and proof context operations modify
5428 the naming context. Especially note Theory.restore_naming and
5429 ProofContext.restore_naming to get back to a sane state; note that
5430 Theory.add_path is no longer sufficient to recover from
5431 Theory.absolute_path in particular.
5433 * Pure: new flags short_names (default false) and unique_names
5434 (default true) for controlling output of qualified names. If
5435 short_names is set, names are printed unqualified. If unique_names is
5436 reset, the name prefix is reduced to the minimum required to achieve
5437 the original result when interning again, even if there is an overlap
5438 with earlier declarations.
5440 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
5441 now 'extend', and 'merge' gets an additional Pretty.pp argument
5442 (useful for printing error messages). INCOMPATIBILITY.
5444 * Pure: major reorganization of the theory context. Type Sign.sg and
5445 Theory.theory are now identified, referring to the universal
5446 Context.theory (see Pure/context.ML). Actual signature and theory
5447 content is managed as theory data. The old code and interfaces were
5448 spread over many files and structures; the new arrangement introduces
5449 considerable INCOMPATIBILITY to gain more clarity:
5451 Context -- theory management operations (name, identity, inclusion,
5452 parents, ancestors, merge, etc.), plus generic theory data;
5454 Sign -- logical signature and syntax operations (declaring consts,
5455 types, etc.), plus certify/read for common entities;
5457 Theory -- logical theory operations (stating axioms, definitions,
5458 oracles), plus a copy of logical signature operations (consts,
5459 types, etc.); also a few basic management operations (Theory.copy,
5462 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
5463 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
5464 for convenience -- they merely return the theory.
5466 * Pure: type Type.tsig is superceded by theory in most interfaces.
5468 * Pure: the Isar proof context type is already defined early in Pure
5469 as Context.proof (note that ProofContext.context and Proof.context are
5470 aliases, where the latter is the preferred name). This enables other
5471 Isabelle components to refer to that type even before Isar is present.
5473 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
5474 typeK, constK, axiomK, oracleK), but provide explicit operations for
5475 any of these kinds. For example, Sign.intern typeK is now
5476 Sign.intern_type, Theory.hide_space Sign.typeK is now
5477 Theory.hide_types. Also note that former
5478 Theory.hide_classes/types/consts are now
5479 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
5480 internalize their arguments! INCOMPATIBILITY.
5482 * Pure: get_thm interface (of PureThy and ProofContext) expects
5483 datatype thmref (with constructors Name and NameSelection) instead of
5484 plain string -- INCOMPATIBILITY;
5486 * Pure: cases produced by proof methods specify options, where NONE
5487 means to remove case bindings -- INCOMPATIBILITY in
5490 * Pure: the following operations retrieve axioms or theorems from a
5491 theory node or theory hierarchy, respectively:
5493 Theory.axioms_of: theory -> (string * term) list
5494 Theory.all_axioms_of: theory -> (string * term) list
5495 PureThy.thms_of: theory -> (string * thm) list
5496 PureThy.all_thms_of: theory -> (string * thm) list
5498 * Pure: print_tac now outputs the goal through the trace channel.
5500 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
5501 Reference Toplevel.debug (default false) controls detailed printing
5502 and tracing of low-level exceptions; Toplevel.profiling (default 0)
5503 controls execution profiling -- set to 1 for time and 2 for space
5504 (both increase the runtime).
5506 * Isar session: The initial use of ROOT.ML is now always timed,
5507 i.e. the log will show the actual process times, in contrast to the
5508 elapsed wall-clock time that the outer shell wrapper produces.
5510 * Simplifier: improved handling of bound variables (nameless
5511 representation, avoid allocating new strings). Simprocs that invoke
5512 the Simplifier recursively should use Simplifier.inherit_bounds to
5513 avoid local name clashes. Failure to do so produces warnings
5514 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
5515 for further details.
5517 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
5518 bindings for all theorems stored within a given theory; this may help
5519 in porting non-Isar theories to Isar ones, while keeping ML proof
5520 scripts for the time being.
5522 * ML operator HTML.with_charset specifies the charset begin used for
5523 generated HTML files. For example:
5525 HTML.with_charset "utf-8" use_thy "Hebrew";
5526 HTML.with_charset "utf-8" use_thy "Chinese";
5531 * Allow symlinks to all proper Isabelle executables (Isabelle,
5532 isabelle, isatool etc.).
5534 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
5535 isatool doc, isatool mkdir, display_drafts etc.).
5537 * isatool usedir: option -f allows specification of the ML file to be
5538 used by Isabelle; default is ROOT.ML.
5540 * New isatool version outputs the version identifier of the Isabelle
5541 distribution being used.
5543 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
5544 (containing Boolean satisfiability problems) into Isabelle/HOL
5549 New in Isabelle2004 (April 2004)
5550 --------------------------------
5554 * Provers/order.ML: new efficient reasoner for partial and linear orders.
5555 Replaces linorder.ML.
5557 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
5558 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
5559 (\<a>...\<z>), are now considered normal letters, and can therefore
5560 be used anywhere where an ASCII letter (a...zA...Z) has until
5561 now. COMPATIBILITY: This obviously changes the parsing of some
5562 terms, especially where a symbol has been used as a binder, say
5563 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
5564 as an identifier. Fix it by inserting a space around former
5565 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
5566 existing theory and ML files.
5568 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
5570 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
5571 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
5572 a normal (but invisible) letter. For multiple letter subscripts repeat
5573 \<^isub> like this: x\<^isub>1\<^isub>2.
5575 * Pure: There are now sub-/superscripts that can span more than one
5576 character. Text between \<^bsub> and \<^esub> is set in subscript in
5577 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
5578 superscript. The new control characters are not identifier parts.
5580 * Pure: Control-symbols of the form \<^raw:...> will literally print the
5581 content of "..." to the latex file instead of \isacntrl... . The "..."
5582 may consist of any printable characters excluding the end bracket >.
5584 * Pure: Using new Isar command "finalconsts" (or the ML functions
5585 Theory.add_finals or Theory.add_finals_i) it is now possible to
5586 declare constants "final", which prevents their being given a definition
5587 later. It is useful for constants whose behaviour is fixed axiomatically
5588 rather than definitionally, such as the meta-logic connectives.
5590 * Pure: 'instance' now handles general arities with general sorts
5591 (i.e. intersections of classes),
5593 * Presentation: generated HTML now uses a CSS style sheet to make layout
5594 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
5595 It can be changed to alter the colors/layout of generated pages.
5600 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
5601 cut_tac, subgoal_tac and thin_tac:
5602 - Now understand static (Isar) contexts. As a consequence, users of Isar
5603 locales are no longer forced to write Isar proof scripts.
5604 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
5606 - INCOMPATIBILITY: names of variables to be instantiated may no
5607 longer be enclosed in quotes. Instead, precede variable name with `?'.
5608 This is consistent with the instantiation attribute "where".
5610 * Attributes "where" and "of":
5611 - Now take type variables of instantiated theorem into account when reading
5612 the instantiation string. This fixes a bug that caused instantiated
5613 theorems to have too special types in some circumstances.
5614 - "where" permits explicit instantiations of type variables.
5616 * Calculation commands "moreover" and "also" no longer interfere with
5617 current facts ("this"), admitting arbitrary combinations with "then"
5621 - Goal statements involving the context element "includes" no longer
5622 generate theorems with internal delta predicates (those ending on
5623 "_axioms") in the premise.
5624 Resolve particular premise with <locale>.intro to obtain old form.
5625 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
5626 specification and "includes" elements in goal statement.
5627 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
5628 [intro?] and [elim?] (respectively) by default.
5629 - Experimental command for instantiation of locales in proof contexts:
5630 instantiate <label>[<attrs>]: <loc>
5631 Instantiates locale <loc> and adds all its theorems to the current context
5632 taking into account their attributes. Label and attrs are optional
5633 modifiers, like in theorem declarations. If present, names of
5634 instantiated theorems are qualified with <label>, and the attributes
5635 <attrs> are applied after any attributes these theorems might have already.
5636 If the locale has assumptions, a chained fact of the form
5637 "<loc> t1 ... tn" is expected from which instantiations of the parameters
5638 are derived. The command does not support old-style locales declared
5639 with "locale (open)".
5640 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
5642 * HOL: Tactic emulation methods induct_tac and case_tac understand static
5648 * Proof import: new image HOL4 contains the imported library from
5649 the HOL4 system with about 2500 theorems. It is imported by
5650 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
5651 can be used like any other Isabelle image. See
5652 HOL/Import/HOL/README for more information.
5655 - Much improved handling of linear and partial orders.
5656 Reasoners for linear and partial orders are set up for type classes
5657 "linorder" and "order" respectively, and are added to the default simpset
5658 as solvers. This means that the simplifier can build transitivity chains
5659 to solve goals from the assumptions.
5660 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
5661 of blast or auto after simplification become unnecessary because the goal
5662 is solved by simplification already.
5664 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
5665 all proved in axiomatic type classes for semirings, rings and fields.
5668 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
5669 now formalized using the Ring_and_Field theory mentioned above.
5670 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
5671 than before, because now they are set up once in a generic manner.
5672 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
5673 Look for the general versions in Ring_and_Field (and Power if they concern
5676 * Type "rat" of the rational numbers is now available in HOL-Complex.
5679 - Record types are now by default printed with their type abbreviation
5680 instead of the list of all field types. This can be configured via
5681 the reference "print_record_type_abbr".
5682 - Simproc "record_upd_simproc" for simplification of multiple updates added
5683 (not enabled by default).
5684 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
5685 EX x. x = sel r to True (not enabled by default).
5686 - Tactic "record_split_simp_tac" to split and simplify records added.
5688 * 'specification' command added, allowing for definition by
5689 specification. There is also an 'ax_specification' command that
5690 introduces the new constants axiomatically.
5692 * arith(_tac) is now able to generate counterexamples for reals as well.
5694 * HOL-Algebra: new locale "ring" for non-commutative rings.
5696 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
5697 definitions, thanks to Sava Krsti\'{c} and John Matthews.
5699 * HOL-Matrix: a first theory for matrices in HOL with an application of
5700 matrix theory to linear programming.
5702 * Unions and Intersections:
5703 The latex output syntax of UN and INT has been changed
5704 from "\Union x \in A. B" to "\Union_{x \in A} B"
5705 i.e. the index formulae has become a subscript.
5706 Similarly for "\Union x. B", and for \Inter instead of \Union.
5708 * Unions and Intersections over Intervals:
5709 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
5710 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
5711 like in normal math, and corresponding versions for < and for intersection.
5713 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
5714 lexicographic dictonary ordering has been added as "lexord".
5716 * ML: the legacy theory structures Int and List have been removed. They had
5717 conflicted with ML Basis Library structures having the same names.
5719 * 'refute' command added to search for (finite) countermodels. Only works
5720 for a fragment of HOL. The installation of an external SAT solver is
5721 highly recommended. See "HOL/Refute.thy" for details.
5723 * 'quickcheck' command: Allows to find counterexamples by evaluating
5724 formulae under an assignment of free variables to random values.
5725 In contrast to 'refute', it can deal with inductive datatypes,
5726 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
5732 * Streams now come with concatenation and are part of the HOLCF image
5736 New in Isabelle2003 (May 2003)
5737 ------------------------------
5741 * Provers/simplifier:
5743 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
5744 Assumptions are now subject to complete mutual simplification,
5745 not just from left to right. The simplifier now preserves
5746 the order of assumptions.
5748 Potential INCOMPATIBILITY:
5750 -- simp sometimes diverges where the old version did
5751 not, e.g. invoking simp on the goal
5753 [| P (f x); y = x; f x = f y |] ==> Q
5755 now gives rise to the infinite reduction sequence
5757 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
5759 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
5762 -- Tactics combining classical reasoner and simplification (such as auto)
5763 are also affected by this change, because many of them rely on
5764 simp. They may sometimes diverge as well or yield a different numbers
5765 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
5766 in case of problems. Sometimes subsequent calls to the classical
5767 reasoner will fail because a preceeding call to the simplifier too
5768 eagerly simplified the goal, e.g. deleted redundant premises.
5770 - The simplifier trace now shows the names of the applied rewrite rules
5772 - You can limit the number of recursive invocations of the simplifier
5773 during conditional rewriting (where the simplifie tries to solve the
5774 conditions before applying the rewrite rule):
5775 ML "simp_depth_limit := n"
5776 where n is an integer. Thus you can force termination where previously
5777 the simplifier would diverge.
5779 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5781 - No longer aborts on failed congruence proof. Instead, the
5782 congruence is ignored.
5784 * Pure: New generic framework for extracting programs from constructive
5785 proofs. See HOL/Extraction.thy for an example instantiation, as well
5786 as HOL/Extraction for some case studies.
5788 * Pure: The main goal of the proof state is no longer shown by default, only
5789 the subgoals. This behaviour is controlled by a new flag.
5790 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5791 (ML: Proof.show_main_goal).
5793 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5794 rules whose conclusion matches subgoal 1:
5795 PG menu: Isabelle/Isar -> Show me -> matching rules
5796 The rules are ordered by how closely they match the subgoal.
5797 In particular, rules that solve a subgoal outright are displayed first
5798 (or rather last, the way they are printed).
5799 (ML: ProofGeneral.print_intros())
5801 * Pure: New flag trace_unify_fail causes unification to print
5802 diagnostic information (PG: in trace buffer) when it fails. This is
5803 useful for figuring out why single step proofs like rule, erule or
5806 * Pure: Locale specifications now produce predicate definitions
5807 according to the body of text (covering assumptions modulo local
5808 definitions); predicate "loc_axioms" covers newly introduced text,
5809 while "loc" is cumulative wrt. all included locale expressions; the
5810 latter view is presented only on export into the global theory
5811 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5812 on the old view without predicates;
5814 * Pure: predefined locales "var" and "struct" are useful for sharing
5815 parameters (as in CASL, for example); just specify something like
5816 ``var x + var y + struct M'' as import;
5818 * Pure: improved thms_containing: proper indexing of facts instead of
5819 raw theorems; check validity of results wrt. current name space;
5820 include local facts of proof configuration (also covers active
5821 locales), cover fixed variables in index; may use "_" in term
5822 specification; an optional limit for the number of printed facts may
5823 be given (the default is 40);
5825 * Pure: disallow duplicate fact bindings within new-style theory files
5828 * Provers: improved induct method: assumptions introduced by case
5829 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5830 the goal statement); "foo" still refers to all facts collectively;
5832 * Provers: the function blast.overloaded has been removed: all constants
5833 are regarded as potentially overloaded, which improves robustness in exchange
5834 for slight decrease in efficiency;
5836 * Provers/linorder: New generic prover for transitivity reasoning over
5837 linear orders. Note: this prover is not efficient!
5839 * Isar: preview of problems to finish 'show' now produce an error
5840 rather than just a warning (in interactive mode);
5847 - Produces a counter example if it cannot prove a goal.
5848 Note that the counter example may be spurious if the goal is not a formula
5849 of quantifier-free linear arithmetic.
5850 In ProofGeneral the counter example appears in the trace buffer.
5852 - Knows about div k and mod k where k is a numeral of type nat or int.
5854 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5855 linear arithmetic fails. This takes account of quantifiers and divisibility.
5856 Presburger arithmetic can also be called explicitly via presburger(_tac).
5858 * simp's arithmetic capabilities have been enhanced a bit: it now
5859 takes ~= in premises into account (by performing a case split);
5861 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5862 are distributed over a sum of terms;
5864 * New tactic "trans_tac" and method "trans" instantiate
5865 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5868 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5869 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5871 * 'typedef' command has new option "open" to suppress the set
5874 * functions Min and Max on finite sets have been introduced (theory
5877 * attribute [symmetric] now works for relations as well; it turns
5878 (x,y) : R^-1 into (y,x) : R, and vice versa;
5880 * induct over a !!-quantified statement (say !!x1..xn):
5881 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5883 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5884 %x. None. Warning: empty_def now refers to the previously hidden definition
5887 * Algebra: formalization of classical algebra. Intended as base for
5888 any algebraic development in Isabelle. Currently covers group theory
5889 (up to Sylow's theorem) and ring theory (Universal Property of
5890 Univariate Polynomials). Contributions welcome;
5892 * GroupTheory: deleted, since its material has been moved to Algebra;
5894 * Complex: new directory of the complex numbers with numeric constants,
5895 nonstandard complex numbers, and some complex analysis, standard and
5896 nonstandard (Jacques Fleuriot);
5898 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5900 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5903 * Real/HahnBanach: updated and adapted to locales;
5905 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5908 * UNITY: added the Meier-Sanders theory of progress sets;
5910 * MicroJava: bytecode verifier and lightweight bytecode verifier
5911 as abstract algorithms, instantiated to the JVM;
5913 * Bali: Java source language formalization. Type system, operational
5914 semantics, axiomatic semantics. Supported language features:
5915 classes, interfaces, objects,virtual methods, static methods,
5916 static/instance fields, arrays, access modifiers, definite
5917 assignment, exceptions.
5922 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5925 * Main ZF: virtually all theories converted to new-style format;
5930 * Pure: Tactic.prove provides sane interface for internal proofs;
5931 omits the infamous "standard" operation, so this is more appropriate
5932 than prove_goalw_cterm in many situations (e.g. in simprocs);
5934 * Pure: improved error reporting of simprocs;
5936 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5940 *** Document preparation ***
5942 * uses \par instead of \\ for line breaks in theory text. This may
5943 shift some page breaks in large documents. To get the old behaviour
5944 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5946 * minimized dependencies of isabelle.sty and isabellesym.sty on
5949 * \<euro> now needs package babel/greek instead of marvosym (which
5952 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5957 New in Isabelle2002 (March 2002)
5958 --------------------------------
5960 *** Document preparation ***
5962 * greatly simplified document preparation setup, including more
5963 graceful interpretation of isatool usedir -i/-d/-D options, and more
5964 instructive isatool mkdir; users should basically be able to get
5965 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5966 users may run a separate document processing stage manually like this:
5967 "isatool usedir -D output HOL Test && isatool document Test/output";
5969 * theory dependency graph may now be incorporated into documents;
5970 isatool usedir -g true will produce session_graph.eps/.pdf for use
5971 with \includegraphics of LaTeX;
5973 * proper spacing of consecutive markup elements, especially text
5974 blocks after section headings;
5976 * support bold style (for single symbols only), input syntax is like
5977 this: "\<^bold>\<alpha>" or "\<^bold>A";
5979 * \<bullet> is now output as bold \cdot by default, which looks much
5980 better in printed text;
5982 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5983 note that these symbols are currently unavailable in Proof General /
5984 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5986 * isatool latex no longer depends on changed TEXINPUTS, instead
5987 isatool document copies the Isabelle style files to the target
5993 * Pure/Provers: improved proof by cases and induction;
5994 - 'case' command admits impromptu naming of parameters (such as
5996 - 'induct' method divinates rule instantiation from the inductive
5997 claim; no longer requires excessive ?P bindings for proper
5998 instantiation of cases;
5999 - 'induct' method properly enumerates all possibilities of set/type
6000 rules; as a consequence facts may be also passed through *type*
6001 rules without further ado;
6002 - 'induct' method now derives symbolic cases from the *rulified*
6003 rule (before it used to rulify cases stemming from the internal
6004 atomized version); this means that the context of a non-atomic
6005 statement becomes is included in the hypothesis, avoiding the
6006 slightly cumbersome show "PROP ?case" form;
6007 - 'induct' may now use elim-style induction rules without chaining
6008 facts, using ``missing'' premises from the goal state; this allows
6009 rules stemming from inductive sets to be applied in unstructured
6010 scripts, while still benefitting from proper handling of non-atomic
6011 statements; NB: major inductive premises need to be put first, all
6012 the rest of the goal is passed through the induction;
6013 - 'induct' proper support for mutual induction involving non-atomic
6014 rule statements (uses the new concept of simultaneous goals, see
6016 - append all possible rule selections, but only use the first
6017 success (no backtracking);
6018 - removed obsolete "(simplified)" and "(stripped)" options of methods;
6019 - undeclared rule case names default to numbers 1, 2, 3, ...;
6020 - added 'print_induct_rules' (covered by help item in recent Proof
6022 - moved induct/cases attributes to Pure, methods to Provers;
6023 - generic method setup instantiated for FOL and HOL;
6025 * Pure: support multiple simultaneous goal statements, for example
6026 "have a: A and b: B" (same for 'theorem' etc.); being a pure
6027 meta-level mechanism, this acts as if several individual goals had
6028 been stated separately; in particular common proof methods need to be
6029 repeated in order to cover all claims; note that a single elimination
6030 step is *not* sufficient to establish the two conjunctions, so this
6033 assume "A & B" then have A and B .. (*".." fails*)
6035 better use "obtain" in situations as above; alternative refer to
6036 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
6038 * Pure: proper integration with ``locales''; unlike the original
6039 version by Florian Kammller, Isar locales package high-level proof
6040 contexts rather than raw logical ones (e.g. we admit to include
6041 attributes everywhere); operations on locales include merge and
6042 rename; support for implicit arguments (``structures''); simultaneous
6043 type-inference over imports and text; see also HOL/ex/Locales.thy for
6046 * Pure: the following commands have been ``localized'', supporting a
6047 target locale specification "(in name)": 'lemma', 'theorem',
6048 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
6049 stored both within the locale and at the theory level (exported and
6050 qualified by the locale name);
6052 * Pure: theory goals may now be specified in ``long'' form, with
6053 ad-hoc contexts consisting of arbitrary locale elements. for example
6054 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
6055 definitions may be given, too); the result is a meta-level rule with
6056 the context elements being discharged in the obvious way;
6058 * Pure: new proof command 'using' allows to augment currently used
6059 facts after a goal statement ('using' is syntactically analogous to
6060 'apply', but acts on the goal's facts only); this allows chained facts
6061 to be separated into parts given before and after a claim, as in
6062 ``from a and b have C using d and e <proof>'';
6064 * Pure: renamed "antecedent" case to "rule_context";
6066 * Pure: new 'judgment' command records explicit information about the
6067 object-logic embedding (used by several tools internally); no longer
6068 use hard-wired "Trueprop";
6070 * Pure: added 'corollary' command;
6072 * Pure: fixed 'token_translation' command;
6074 * Pure: removed obsolete 'exported' attribute;
6076 * Pure: dummy pattern "_" in is/let is now automatically lifted over
6077 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
6078 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
6080 * Pure: method 'atomize' presents local goal premises as object-level
6081 statements (atomic meta-level propositions); setup controlled via
6082 rewrite rules declarations of 'atomize' attribute; example
6083 application: 'induct' method with proper rule statements in improper
6086 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
6087 now consider the syntactic context of assumptions, giving a better
6088 chance to get type-inference of the arguments right (this is
6089 especially important for locales);
6091 * Pure: "sorry" no longer requires quick_and_dirty in interactive
6094 * Pure/obtain: the formal conclusion "thesis", being marked as
6095 ``internal'', may no longer be reference directly in the text;
6096 potential INCOMPATIBILITY, may need to use "?thesis" in rare
6099 * Pure: generic 'sym' attribute which declares a rule both as pure
6100 'elim?' and for the 'symmetric' operation;
6102 * Pure: marginal comments ``--'' may now occur just anywhere in the
6103 text; the fixed correlation with particular command syntax has been
6106 * Pure: new method 'rules' is particularly well-suited for proof
6107 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
6108 but often produces more compact proof terms with less detours;
6110 * Pure/Provers/classical: simplified integration with pure rule
6111 attributes and methods; the classical "intro?/elim?/dest?"
6112 declarations coincide with the pure ones; the "rule" method no longer
6113 includes classically swapped intros; "intro" and "elim" methods no
6114 longer pick rules from the context; also got rid of ML declarations
6115 AddXIs/AddXEs/AddXDs; all of this has some potential for
6118 * Provers/classical: attribute 'swapped' produces classical inversions
6119 of introduction rules;
6121 * Provers/simplifier: 'simplified' attribute may refer to explicit
6122 rules instead of full simplifier context; 'iff' attribute handles
6125 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
6127 * HOL: 'recdef' now fails on unfinished automated proofs, use
6128 "(permissive)" option to recover old behavior;
6130 * HOL: 'inductive' no longer features separate (collective) attributes
6131 for 'intros' (was found too confusing);
6133 * HOL: properly declared induction rules less_induct and
6139 * HOL: moved over to sane numeral syntax; the new policy is as
6142 - 0 and 1 are polymorphic constants, which are defined on any
6143 numeric type (nat, int, real etc.);
6145 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
6146 binary representation internally;
6148 - type nat has special constructor Suc, and generally prefers Suc 0
6149 over 1::nat and Suc (Suc 0) over 2::nat;
6151 This change may cause significant problems of INCOMPATIBILITY; here
6152 are some hints on converting existing sources:
6154 - due to the new "num" token, "-0" and "-1" etc. are now atomic
6155 entities, so expressions involving "-" (unary or binary minus) need
6156 to be spaced properly;
6158 - existing occurrences of "1" may need to be constraint "1::nat" or
6159 even replaced by Suc 0; similar for old "2";
6161 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
6163 - remove all special provisions on numerals in proofs;
6165 * HOL: simp rules nat_number expand numerals on nat to Suc/0
6166 representation (depends on bin_arith_simps in the default context);
6168 * HOL: symbolic syntax for x^2 (numeral 2);
6170 * HOL: the class of all HOL types is now called "type" rather than
6171 "term"; INCOMPATIBILITY, need to adapt references to this type class
6172 in axclass/classes, instance/arities, and (usually rare) occurrences
6173 in typings (of consts etc.); internally the class is called
6174 "HOL.type", ML programs should refer to HOLogic.typeS;
6176 * HOL/record package improvements:
6177 - new derived operations "fields" to build a partial record section,
6178 "extend" to promote a fixed record to a record scheme, and
6179 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
6180 declared as simp by default;
6181 - shared operations ("more", "fields", etc.) now need to be always
6182 qualified) --- potential INCOMPATIBILITY;
6183 - removed "make_scheme" operations (use "make" with "extend") --
6185 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
6186 - provides cases/induct rules for use with corresponding Isar
6187 methods (for concrete records, record schemes, concrete more
6188 parts, and schematic more parts -- in that order);
6189 - internal definitions directly based on a light-weight abstract
6190 theory of product types over typedef rather than datatype;
6192 * HOL: generic code generator for generating executable ML code from
6193 specifications; specific support for HOL constructs such as inductive
6194 datatypes and sets, as well as recursive functions; can be invoked
6195 via 'generate_code' theory section;
6197 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
6199 * HOL: consolidated and renamed several theories. In particular:
6200 Ord.thy has been absorbed into HOL.thy
6201 String.thy has been absorbed into List.thy
6203 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
6204 (beware of argument permutation!);
6206 * HOL: linorder_less_split superseded by linorder_cases;
6208 * HOL/List: "nodups" renamed to "distinct";
6210 * HOL: added "The" definite description operator; move Hilbert's "Eps"
6211 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
6212 - Ex_def has changed, now need to use some_eq_ex
6214 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
6215 in this (rare) case use:
6217 delSWrapper "split_all_tac"
6218 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
6220 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
6223 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
6224 Isabelle's type classes, ^ on functions and relations has too general
6225 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
6226 necessary to attach explicit type constraints;
6228 * HOL/Relation: the prefix name of the infix "O" has been changed from
6229 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
6230 renamed accordingly (eg "compI" -> "rel_compI").
6232 * HOL: syntax translations now work properly with numerals and records
6235 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
6236 of "lam" -- INCOMPATIBILITY;
6238 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
6239 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
6240 renamed "Product_Type.unit";
6242 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
6244 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
6245 the "cases" method);
6247 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
6250 * HOL/IMP: updated and converted to new-style theory format; several
6251 parts turned into readable document, with proper Isar proof texts and
6252 some explanations (by Gerwin Klein);
6254 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
6256 * HOL-Hyperreal is now a logic image;
6261 * Isar: consts/constdefs supports mixfix syntax for continuous
6264 * Isar: domain package adapted to new-style theory format, e.g. see
6267 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
6268 potential INCOMPATIBILITY; now use plain induct_tac instead of former
6269 lift.induct_tac, always use UU instead of Undef;
6271 * HOLCF/IMP: updated and converted to new-style theory;
6276 * Isar: proper integration of logic-specific tools and packages,
6277 including theory commands '(co)inductive', '(co)datatype',
6278 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
6279 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
6281 * theory Main no longer includes AC; for the Axiom of Choice, base
6282 your theory on Main_ZFC;
6284 * the integer library now covers quotients and remainders, with many
6285 laws relating division to addition, multiplication, etc.;
6287 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
6288 typeless version of the formalism;
6290 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
6293 * ZF/Induct: new directory for examples of inductive definitions,
6294 including theory Multiset for multiset orderings; converted to
6295 new-style theory format;
6297 * ZF: many new theorems about lists, ordinals, etc.;
6302 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
6303 variable proof controls level of detail: 0 = no proofs (only oracle
6304 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
6305 also ref manual for further ML interfaces;
6307 * Pure/axclass: removed obsolete ML interface
6308 goal_subclass/goal_arity;
6310 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
6311 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
6312 separate tokens, so expressions involving minus need to be spaced
6315 * Pure/syntax: support non-oriented infixes, using keyword "infix"
6316 rather than "infixl" or "infixr";
6318 * Pure/syntax: concrete syntax for dummy type variables admits genuine
6319 sort constraint specifications in type inference; e.g. "x::_::foo"
6320 ensures that the type of "x" is of sort "foo" (but not necessarily a
6323 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
6324 control output of nested => (types); the default behavior is
6327 * Pure/syntax: builtin parse translation for "_constify" turns valued
6328 tokens into AST constants;
6330 * Pure/syntax: prefer later declarations of translations and print
6331 translation functions; potential INCOMPATIBILITY: need to reverse
6332 multiple declarations for same syntax element constant;
6334 * Pure/show_hyps reset by default (in accordance to existing Isar
6337 * Provers/classical: renamed addaltern to addafter, addSaltern to
6340 * Provers/clasimp: ``iff'' declarations now handle conditional rules
6343 * system: tested support for MacOS X; should be able to get Isabelle +
6344 Proof General to work in a plain Terminal after installing Poly/ML
6345 (e.g. from the Isabelle distribution area) and GNU bash alone
6346 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
6347 support requires further installations, e.g. from
6348 http://fink.sourceforge.net/);
6350 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
6352 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
6353 of 40 MB), cf. ML_OPTIONS;
6355 * system: Proof General keywords specification is now part of the
6356 Isabelle distribution (see etc/isar-keywords.el);
6358 * system: support for persistent Proof General sessions (refrain from
6359 outdating all loaded theories on startup); user may create writable
6360 logic images like this: ``isabelle -q HOL Test'';
6362 * system: smart selection of Isabelle process versus Isabelle
6363 interface, accommodates case-insensitive file systems (e.g. HFS+); may
6364 run both "isabelle" and "Isabelle" even if file names are badly
6365 damaged (executable inspects the case of the first letter of its own
6366 name); added separate "isabelle-process" and "isabelle-interface";
6368 * system: refrain from any attempt at filtering input streams; no
6369 longer support ``8bit'' encoding of old isabelle font, instead proper
6370 iso-latin characters may now be used; the related isatools
6371 "symbolinput" and "nonascii" have disappeared as well;
6373 * system: removed old "xterm" interface (the print modes "xterm" and
6374 "xterm_color" are still available for direct use in a suitable
6379 New in Isabelle99-2 (February 2001)
6380 -----------------------------------
6382 *** Overview of INCOMPATIBILITIES ***
6384 * HOL: please note that theories in the Library and elsewhere often use the
6385 new-style (Isar) format; to refer to their theorems in an ML script you must
6386 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
6388 * HOL: inductive package no longer splits induction rule aggressively,
6389 but only as far as specified by the introductions given; the old
6390 format may be recovered via ML function complete_split_rule or attribute
6391 'split_rule (complete)';
6393 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
6394 gfp_Tarski to gfp_unfold;
6396 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
6398 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
6399 relation); infix "^^" has been renamed "``"; infix "``" has been
6400 renamed "`"; "univalent" has been renamed "single_valued";
6402 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
6405 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
6407 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
6409 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
6410 consequence, it is no longer monotonic wrt. the local goal context
6411 (which is now passed through the inductive cases);
6413 * Document preparation: renamed standard symbols \<ll> to \<lless> and
6414 \<gg> to \<ggreater>;
6417 *** Document preparation ***
6419 * \isabellestyle{NAME} selects version of Isabelle output (currently
6420 available: are "it" for near math-mode best-style output, "sl" for
6421 slanted text style, and "tt" for plain type-writer; if no
6422 \isabellestyle command is given, output is according to slanted
6425 * support sub/super scripts (for single symbols only), input syntax is
6426 like this: "A\<^sup>*" or "A\<^sup>\<star>";
6428 * some more standard symbols; see Appendix A of the system manual for
6429 the complete list of symbols defined in isabellesym.sty;
6431 * improved isabelle style files; more abstract symbol implementation
6432 (should now use \isamath{...} and \isatext{...} in custom symbol
6435 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
6436 state; Note that presentation of goal states does not conform to
6437 actual human-readable proof documents. Please do not include goal
6438 states into document output unless you really know what you are doing!
6440 * proper indentation of antiquoted output with proportional LaTeX
6443 * no_document ML operator temporarily disables LaTeX document
6446 * isatool unsymbolize tunes sources for plain ASCII communication;
6451 * Pure: Isar now suffers initial goal statements to contain unbound
6452 schematic variables (this does not conform to actual readable proof
6453 documents, due to unpredictable outcome and non-compositional proof
6454 checking); users who know what they are doing may use schematic goals
6455 for Prolog-style synthesis of proven results;
6457 * Pure: assumption method (an implicit finishing) now handles actual
6460 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
6461 initial goal, declare "that" only as Pure intro (only for single
6462 steps); the "that" rule assumption may now be involved in implicit
6463 finishing, thus ".." becomes a feasible for trivial obtains;
6465 * Pure: default proof step now includes 'intro_classes'; thus trivial
6466 instance proofs may be performed by "..";
6468 * Pure: ?thesis / ?this / "..." now work for pure meta-level
6471 * Pure: more robust selection of calculational rules;
6473 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
6474 rule (as well as the assumption rule);
6476 * Pure: 'thm_deps' command visualizes dependencies of theorems and
6477 lemmas, using the graph browser tool;
6479 * Pure: predict failure of "show" in interactive mode;
6481 * Pure: 'thms_containing' now takes actual terms as arguments;
6483 * HOL: improved method 'induct' --- now handles non-atomic goals
6484 (potential INCOMPATIBILITY); tuned error handling;
6486 * HOL: cases and induct rules now provide explicit hints about the
6487 number of facts to be consumed (0 for "type" and 1 for "set" rules);
6488 any remaining facts are inserted into the goal verbatim;
6490 * HOL: local contexts (aka cases) may now contain term bindings as
6491 well; the 'cases' and 'induct' methods new provide a ?case binding for
6492 the result to be shown in each case;
6494 * HOL: added 'recdef_tc' command;
6496 * isatool convert assists in eliminating legacy ML scripts;
6501 * HOL/Library: a collection of generic theories to be used together
6502 with main HOL; the theory loader path already includes this directory
6503 by default; the following existing theories have been moved here:
6504 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
6505 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
6507 * HOL/Unix: "Some aspects of Unix file-system security", a typical
6508 modelling and verification task performed in Isabelle/HOL +
6509 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
6511 * HOL/Algebra: special summation operator SUM no longer exists, it has
6512 been replaced by setsum; infix 'assoc' now has priority 50 (like
6513 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
6514 'domain', this makes the theory consistent with mathematical
6517 * HOL basics: added overloaded operations "inverse" and "divide"
6518 (infix "/"), syntax for generic "abs" operation, generic summation
6521 * HOL/typedef: simplified package, provide more useful rules (see also
6524 * HOL/datatype: induction rule for arbitrarily branching datatypes is
6525 now expressed as a proper nested rule (old-style tactic scripts may
6526 require atomize_strip_tac to cope with non-atomic premises);
6528 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
6529 to "split_conv" (old name still available for compatibility);
6531 * HOL: improved concrete syntax for strings (e.g. allows translation
6532 rules with string literals);
6534 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
6535 and Fleuriot's mechanization of analysis, including the transcendental
6536 functions for the reals;
6538 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
6543 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
6544 "lam" is displayed as TWO lambda-symbols
6546 * CTT: theory Main now available, containing everything (that is, Bool
6552 * Pure: the Simplifier has been implemented properly as a derived rule
6553 outside of the actual kernel (at last!); the overall performance
6554 penalty in practical applications is about 50%, while reliability of
6555 the Isabelle inference kernel has been greatly improved;
6557 * print modes "brackets" and "no_brackets" control output of nested =>
6558 (types) and ==> (props); the default behaviour is "brackets";
6560 * Provers: fast_tac (and friends) now handle actual object-logic rules
6561 as assumptions as well;
6563 * system: support Poly/ML 4.0;
6565 * system: isatool install handles KDE version 1 or 2;
6569 New in Isabelle99-1 (October 2000)
6570 ----------------------------------
6572 *** Overview of INCOMPATIBILITIES ***
6574 * HOL: simplification of natural numbers is much changed; to partly
6575 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
6576 issue the following ML commands:
6578 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
6579 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
6581 * HOL: simplification no longer dives into case-expressions; this is
6582 controlled by "t.weak_case_cong" for each datatype t;
6584 * HOL: nat_less_induct renamed to less_induct;
6586 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
6587 fixsome to patch .thy and .ML sources automatically;
6589 select_equality -> some_equality
6590 select_eq_Ex -> some_eq_ex
6591 selectI2EX -> someI2_ex
6594 select1_equality -> some1_equality
6595 Eps_sym_eq -> some_sym_eq_trivial
6596 Eps_eq -> some_eq_trivial
6598 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
6600 * HOL: removed obsolete theorem binding expand_if (refer to split_if
6603 * HOL: the recursion equations generated by 'recdef' are now called
6604 f.simps instead of f.rules;
6606 * HOL: qed_spec_mp now also handles bounded ALL as well;
6608 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
6609 sometimes be needed;
6611 * HOL: the constant for "f``x" is now "image" rather than "op ``";
6613 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
6615 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
6616 product is now "<*>" instead of "Times"; the lexicographic product is
6617 now "<*lex*>" instead of "**";
6619 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
6620 of main HOL, but was unused); better use HOL's datatype package;
6622 * HOL: removed "symbols" syntax for constant "override" of theory Map;
6623 the old syntax may be recovered as follows:
6626 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
6627 (infixl "\\<oplus>" 100)
6629 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6631 * HOL/ML: even fewer consts are declared as global (see theories Ord,
6632 Lfp, Gfp, WF); this only affects ML packages that refer to const names
6635 * HOL and ZF: syntax for quotienting wrt an equivalence relation
6636 changed from A/r to A//r;
6638 * ZF: new treatment of arithmetic (nat & int) may break some old
6641 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
6642 rulify -> rule_format, elimify -> elim_format, ...);
6644 * Isar/Provers: intro/elim/dest attributes changed; renamed
6645 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
6646 should have to change intro!! to intro? only); replaced "delrule" by
6649 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
6651 * Provers: strengthened force_tac by using new first_best_tac;
6653 * LaTeX document preparation: several changes of isabelle.sty (see
6657 *** Document preparation ***
6659 * formal comments (text blocks etc.) in new-style theories may now
6660 contain antiquotations of thm/prop/term/typ/text to be presented
6661 according to latex print mode; concrete syntax is like this:
6662 @{term[show_types] "f(x) = a + x"};
6664 * isatool mkdir provides easy setup of Isabelle session directories,
6665 including proper document sources;
6667 * generated LaTeX sources are now deleted after successful run
6668 (isatool document -c); may retain a copy somewhere else via -D option
6671 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
6672 style files, achieving self-contained LaTeX sources and simplifying
6675 * old-style theories now produce (crude) LaTeX output as well;
6677 * browser info session directories are now self-contained (may be put
6678 on WWW server seperately); improved graphs of nested sessions; removed
6679 graph for 'all sessions';
6681 * several improvements in isabelle style files; \isabellestyle{it}
6682 produces fake math mode output; \isamarkupheader is now \section by
6683 default; see lib/texinputs/isabelle.sty etc.;
6688 * Isar/Pure: local results and corresponding term bindings are now
6689 subject to Hindley-Milner polymorphism (similar to ML); this
6690 accommodates incremental type-inference very nicely;
6692 * Isar/Pure: new derived language element 'obtain' supports
6693 generalized existence reasoning;
6695 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
6696 support accumulation of results, without applying any rules yet;
6697 useful to collect intermediate results without explicit name
6698 references, and for use with transitivity rules with more than 2
6701 * Isar/Pure: scalable support for case-analysis type proofs: new
6702 'case' language element refers to local contexts symbolically, as
6703 produced by certain proof methods; internally, case names are attached
6704 to theorems as "tags";
6706 * Isar/Pure: theory command 'hide' removes declarations from
6707 class/type/const name spaces;
6709 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
6710 indicate potential overloading;
6712 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
6714 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
6715 "{a,b,c}" instead of {a,b,c};
6717 * Isar/Pure now provides its own version of intro/elim/dest
6718 attributes; useful for building new logics, but beware of confusion
6719 with the version in Provers/classical;
6721 * Isar/Pure: the local context of (non-atomic) goals is provided via
6722 case name 'antecedent';
6724 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
6725 to the current context is now done automatically);
6727 * Isar/Pure: theory command 'method_setup' provides a simple interface
6728 for definining proof methods in ML;
6730 * Isar/Provers: intro/elim/dest attributes changed; renamed
6731 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
6732 most cases, one should have to change intro!! to intro? only);
6733 replaced "delrule" by "rule del";
6735 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
6736 'symmetric' attribute (the latter supercedes [RS sym]);
6738 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
6739 method modifier); 'simp' method: 'only:' modifier removes loopers as
6740 well (including splits);
6742 * Isar/Provers: Simplifier and Classical methods now support all kind
6743 of modifiers used in the past, including 'cong', 'iff', etc.
6745 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
6746 of Simplifier and Classical reasoner);
6748 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
6749 now support named cases; major packages (inductive, datatype, primrec,
6750 recdef) support case names and properly name parameters;
6752 * Isar/HOL: new transitivity rules for substitution in inequalities --
6753 monotonicity conditions are extracted to be proven at end of
6756 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
6759 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
6760 split_if split_if_asm; datatype package provides theorems foo.splits =
6761 foo.split foo.split_asm for each datatype;
6763 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
6764 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
6765 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
6766 use "(cases (simplified))" method in proper proof texts);
6768 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
6770 * Isar: names of theorems etc. may be natural numbers as well;
6772 * Isar: 'pr' command: optional arguments for goals_limit and
6773 ProofContext.prems_limit; no longer prints theory contexts, but only
6776 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6777 additional print modes to be specified; e.g. "pr(latex)" will print
6778 proof state according to the Isabelle LaTeX style;
6780 * Isar: improved support for emulating tactic scripts, including proof
6781 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6782 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6783 (for HOL datatypes);
6785 * Isar: simplified (more robust) goal selection of proof methods: 1st
6786 goal, all goals, or explicit goal specifier (tactic emulation); thus
6787 'proof method scripts' have to be in depth-first order;
6789 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6791 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6792 should instead use individual commands for printing items
6793 (print_commands, print_methods etc.);
6795 * Isar: added 'nothing' --- the empty list of theorems;
6800 * HOL/MicroJava: formalization of a fragment of Java, together with a
6801 corresponding virtual machine and a specification of its bytecode
6802 verifier and a lightweight bytecode verifier, including proofs of
6803 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6804 Cornelia Pusch (see also the homepage of project Bali at
6805 http://isabelle.in.tum.de/Bali/);
6807 * HOL/Algebra: new theory of rings and univariate polynomials, by
6810 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6811 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6814 * HOL/Lattice: fundamental concepts of lattice theory and order
6815 structures, including duals, properties of bounds versus algebraic
6816 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6817 Theorem for complete lattices etc.; may also serve as a demonstration
6818 for abstract algebraic reasoning using axiomatic type classes, and
6819 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6821 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6824 * HOL/IMPP: extension of IMP with local variables and mutually
6825 recursive procedures, by David von Oheimb;
6827 * HOL/Lambda: converted into new-style theory and document;
6829 * HOL/ex/Multiquote: example of multiple nested quotations and
6830 anti-quotations -- basically a generalized version of de-Bruijn
6831 representation; very useful in avoiding lifting of operations;
6833 * HOL/record: added general record equality rule to simpset; fixed
6834 select-update simplification procedure to handle extended records as
6835 well; admit "r" as field name;
6837 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6838 other numeric types and also as the identity of groups, rings, etc.;
6840 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6841 Types nat and int belong to this axclass;
6843 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6844 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6845 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6846 two terms #m*u and #n*u are replaced by #(m+n)*u
6847 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6848 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6849 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6851 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6852 powerful prover for predicate logic but knows nothing of clasets; see
6853 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6855 * HOL: new version of "case_tac" subsumes both boolean case split and
6856 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6857 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6859 * HOL: simplification no longer dives into case-expressions: only the
6860 selector expression is simplified, but not the remaining arms; to
6861 enable full simplification of case-expressions for datatype t, you may
6862 remove t.weak_case_cong from the simpset, either globally (Delcongs
6863 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6865 * HOL/recdef: the recursion equations generated by 'recdef' for
6866 function 'f' are now called f.simps instead of f.rules; if all
6867 termination conditions are proved automatically, these simplification
6868 rules are added to the simpset, as in primrec; rules may be named
6869 individually as well, resulting in a separate list of theorems for
6872 * HOL/While is a new theory that provides a while-combinator. It
6873 permits the definition of tail-recursive functions without the
6874 provision of a termination measure. The latter is necessary once the
6875 invariant proof rule for while is applied.
6877 * HOL: new (overloaded) notation for the set of elements below/above
6878 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6880 * HOL: theorems impI, allI, ballI bound as "strip";
6882 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6883 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6884 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6886 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6888 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6889 main HOL, but was unused);
6891 * HOL: fewer consts declared as global (e.g. have to refer to
6892 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6894 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6895 in case of overlap with user translations (e.g. judgements over
6896 tuples); (note that the underlying logical represenation is still
6902 * ZF: simplification automatically cancels common terms in arithmetic
6903 expressions over nat and int;
6905 * ZF: new treatment of nat to minimize type-checking: all operators
6906 coerce their operands to a natural number using the function natify,
6907 making the algebraic laws unconditional;
6909 * ZF: as above, for int: operators coerce their operands to an integer
6910 using the function intify;
6912 * ZF: the integer library now contains many of the usual laws for the
6913 orderings, including $<=, and monotonicity laws for $+ and $*;
6915 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6918 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6919 to the simplifier and classical reasoner simultaneously;
6924 * Provers: blast_tac now handles actual object-logic rules as
6925 assumptions; note that auto_tac uses blast_tac internally as well;
6927 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6928 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6930 * Provers: delrules now handles destruct rules as well (no longer need
6931 explicit make_elim);
6933 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6934 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6935 use instead the strong form,
6936 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6937 in HOL, FOL and ZF the function cla_make_elim will create such rules
6938 from destruct-rules;
6940 * Provers: Simplifier.easy_setup provides a fast path to basic
6941 Simplifier setup for new object-logics;
6943 * Pure: AST translation rules no longer require constant head on LHS;
6945 * Pure: improved name spaces: ambiguous output is qualified; support
6946 for hiding of names;
6948 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6949 XSYMBOL_HOME; no longer need to do manual configuration in most
6952 * system: compression of ML heaps images may now be controlled via -c
6953 option of isabelle and isatool usedir (currently only observed by
6956 * system: isatool installfonts may handle X-Symbol fonts as well (very
6957 useful for remote X11);
6959 * system: provide TAGS file for Isabelle sources;
6961 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6964 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6965 timing flag supersedes proof_timing and Toplevel.trace;
6967 * ML: new combinators |>> and |>>> for incremental transformations
6968 with secondary results (e.g. certain theory extensions):
6970 * ML: PureThy.add_defs gets additional argument to indicate potential
6971 overloading (usually false);
6973 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6978 New in Isabelle99 (October 1999)
6979 --------------------------------
6981 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6983 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6984 are no longer simplified. (This allows the simplifier to unfold recursive
6985 functional programs.) To restore the old behaviour, declare
6987 Delcongs [if_weak_cong];
6989 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6992 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6994 * HOL/datatype: mutual_induct_tac no longer exists --
6995 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6997 * HOL/typedef: fixed type inference for representing set; type
6998 arguments now have to occur explicitly on the rhs as type constraints;
7000 * ZF: The con_defs part of an inductive definition may no longer refer
7001 to constants declared in the same theory;
7003 * HOL, ZF: the function mk_cases, generated by the inductive
7004 definition package, has lost an argument. To simplify its result, it
7005 uses the default simpset instead of a supplied list of theorems.
7007 * HOL/List: the constructors of type list are now Nil and Cons;
7009 * Simplifier: the type of the infix ML functions
7010 setSSolver addSSolver setSolver addSolver
7011 is now simpset * solver -> simpset where `solver' is a new abstract type
7012 for packaging solvers. A solver is created via
7013 mk_solver: string -> (thm list -> int -> tactic) -> solver
7014 where the string argument is only a comment.
7019 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
7020 decision procedure for linear arithmetic. Currently it is used for
7021 types `nat', `int', and `real' in HOL (see below); it can, should and
7022 will be instantiated for other types and logics as well.
7024 * The simplifier now accepts rewrite rules with flexible heads, eg
7025 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
7026 They are applied like any rule with a non-pattern lhs, i.e. by first-order
7032 * New Isabelle/Isar subsystem provides an alternative to traditional
7033 tactical theorem proving; together with the ProofGeneral/isar user
7034 interface it offers an interactive environment for developing human
7035 readable proof documents (Isar == Intelligible semi-automated
7036 reasoning); for further information see isatool doc isar-ref,
7037 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
7039 * improved and simplified presentation of theories: better HTML markup
7040 (including colors), graph views in several sizes; isatool usedir now
7041 provides a proper interface for user theories (via -P option); actual
7042 document preparation based on (PDF)LaTeX is available as well (for
7043 new-style theories only); see isatool doc system for more information;
7045 * native support for Proof General, both for classic Isabelle and
7048 * ML function thm_deps visualizes dependencies of theorems and lemmas,
7049 using the graph browser tool;
7051 * Isabelle manuals now also available as PDF;
7053 * theory loader rewritten from scratch (may not be fully
7054 bug-compatible); old loadpath variable has been replaced by show_path,
7055 add_path, del_path, reset_path functions; new operations such as
7056 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
7059 * improved isatool install: option -k creates KDE application icon,
7060 option -p DIR installs standalone binaries;
7062 * added ML_PLATFORM setting (useful for cross-platform installations);
7063 more robust handling of platform specific ML images for SML/NJ;
7065 * the settings environment is now statically scoped, i.e. it is never
7066 created again in sub-processes invoked from isabelle, isatool, or
7069 * path element specification '~~' refers to '$ISABELLE_HOME';
7071 * in locales, the "assumes" and "defines" parts may be omitted if
7074 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
7077 * new print_mode "HTML";
7079 * new flag show_tags controls display of tags of theorems (which are
7080 basically just comments that may be attached by some tools);
7082 * Isamode 2.6 requires patch to accomodate change of Isabelle font
7083 mode and goal output format:
7085 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
7087 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
7089 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
7090 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
7092 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
7094 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
7096 * function bind_thms stores lists of theorems (cf. bind_thm);
7098 * new shorthand tactics ftac, eatac, datac, fatac;
7100 * qed (and friends) now accept "" as result name; in that case the
7101 theorem is not stored, but proper checks and presentation of the
7104 * theorem database now also indexes constants "Trueprop", "all",
7105 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
7110 ** HOL arithmetic **
7112 * There are now decision procedures for linear arithmetic over nat and
7115 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
7116 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
7117 are treated as atomic; subformulae not involving type `nat' or `int'
7118 are ignored; quantified subformulae are ignored unless they are
7119 positive universal or negative existential. The tactic has to be
7120 invoked by hand and can be a little bit slow. In particular, the
7121 running time is exponential in the number of occurrences of `min' and
7122 `max', and `-' on `nat'.
7124 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
7125 (negated) (in)equalities among the premises and the conclusion into
7126 account (i.e. no compound formulae) and does not know about `min' and
7127 `max', and `-' on `nat'. It is fast and is used automatically by the
7130 NB: At the moment, these decision procedures do not cope with mixed
7131 nat/int formulae where the two parts interact, such as `m < n ==>
7134 * HOL/Numeral provides a generic theory of numerals (encoded
7135 efficiently as bit strings); setup for types nat/int/real is in place;
7136 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
7137 int, existing theories and proof scripts may require a few additional
7140 * integer division and remainder can now be performed on constant
7143 * many properties of integer multiplication, division and remainder
7146 * An interface to the Stanford Validity Checker (SVC) is available through the
7147 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
7148 are proved automatically. SVC must be installed separately, and its results
7149 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
7150 invocation of the underlying oracle). For SVC see
7151 http://verify.stanford.edu/SVC
7153 * IsaMakefile: the HOL-Real target now builds an actual image;
7158 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
7159 (in Isabelle/Isar) -- by Gertrud Bauer;
7161 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
7162 analysis for assembly languages with subtypes;
7164 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
7165 -- avoids syntactic ambiguities and treats state, transition, and
7166 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
7167 changed syntax and (many) tactics;
7169 * HOL/inductive: Now also handles more general introduction rules such
7170 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
7171 theorems are now maintained within the theory (maintained via the
7174 * HOL/datatype: Now also handles arbitrarily branching datatypes
7175 (using function types) such as
7177 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
7179 * HOL/record: record_simproc (part of the default simpset) takes care
7180 of selectors applied to updated records; record_split_tac is no longer
7181 part of the default claset; update_defs may now be removed from the
7182 simpset in many cases; COMPATIBILITY: old behavior achieved by
7184 claset_ref () := claset() addSWrapper record_split_wrapper;
7185 Delsimprocs [record_simproc]
7187 * HOL/typedef: fixed type inference for representing set; type
7188 arguments now have to occur explicitly on the rhs as type constraints;
7190 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
7191 names rather than an ML expression;
7193 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
7194 supplied later. Program schemes can be defined, such as
7195 "While B C s = (if B s then While B C (C s) else s)"
7196 where the well-founded relation can be chosen after B and C have been given.
7198 * HOL/List: the constructors of type list are now Nil and Cons;
7199 INCOMPATIBILITY: while [] and infix # syntax is still there, of
7200 course, ML tools referring to List.list.op # etc. have to be adapted;
7202 * HOL_quantifiers flag superseded by "HOL" print mode, which is
7203 disabled by default; run isabelle with option -m HOL to get back to
7204 the original Gordon/HOL-style output;
7206 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
7207 ALL x<=y. P, EX x<y. P, EX x<=y. P;
7209 * HOL basic syntax simplified (more orthogonal): all variants of
7210 All/Ex now support plain / symbolic / HOL notation; plain syntax for
7211 Eps operator is provided as well: "SOME x. P[x]";
7213 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
7215 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
7216 thus available for user theories;
7218 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
7219 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
7222 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
7223 several times and then mp;
7228 * the notation <<...>> is now available as a notation for sequences of
7231 * the simplifier is now installed
7233 * the axiom system has been generalized (thanks to Soren Heilmann)
7235 * the classical reasoner now has a default rule database
7240 * new primrec section allows primitive recursive functions to be given
7241 directly (as in HOL) over datatypes and the natural numbers;
7243 * new tactics induct_tac and exhaust_tac for induction (or case
7244 analysis) over datatypes and the natural numbers;
7246 * the datatype declaration of type T now defines the recursor T_rec;
7248 * simplification automatically does freeness reasoning for datatype
7251 * automatic type-inference, with AddTCs command to insert new
7252 type-checking rules;
7254 * datatype introduction rules are now added as Safe Introduction rules
7257 * the syntax "if P then x else y" is now available in addition to
7261 *** Internal programming interfaces ***
7263 * tuned simplifier trace output; new flag debug_simp;
7265 * structures Vartab / Termtab (instances of TableFun) offer efficient
7266 tables indexed by indexname_ord / term_ord (compatible with aconv);
7268 * AxClass.axclass_tac lost the theory argument;
7270 * tuned current_goals_markers semantics: begin / end goal avoids
7271 printing empty lines;
7273 * removed prs and prs_fn hook, which was broken because it did not
7274 include \n in its semantics, forcing writeln to add one
7275 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
7276 string -> unit if you really want to output text without newline;
7278 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
7279 plain output, interface builders may have to enable 'isabelle_font'
7280 mode to get Isabelle font glyphs as before;
7282 * refined token_translation interface; INCOMPATIBILITY: output length
7283 now of type real instead of int;
7285 * theory loader actions may be traced via new ThyInfo.add_hook
7286 interface (see src/Pure/Thy/thy_info.ML); example application: keep
7287 your own database of information attached to *whole* theories -- as
7288 opposed to intra-theory data slots offered via TheoryDataFun;
7290 * proper handling of dangling sort hypotheses (at last!);
7291 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
7292 extra sort hypotheses that can be witnessed from the type signature;
7293 the force_strip_shyps flag is gone, any remaining shyps are simply
7294 left in the theorem (with a warning issued by strip_shyps_warning);
7298 New in Isabelle98-1 (October 1998)
7299 ----------------------------------
7301 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7303 * several changes of automated proof tools;
7305 * HOL: major changes to the inductive and datatype packages, including
7306 some minor incompatibilities of theory syntax;
7308 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
7311 * HOL: removed duplicate thms in Arith:
7312 less_imp_add_less should be replaced by trans_less_add1
7313 le_imp_add_le should be replaced by trans_le_add1
7315 * HOL: unary minus is now overloaded (new type constraints may be
7318 * HOL and ZF: unary minus for integers is now #- instead of #~. In
7319 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
7320 now taken as an integer constant.
7322 * Pure: ML function 'theory_of' renamed to 'theory';
7328 1. Asm_full_simp_tac is now more aggressive.
7329 1. It will sometimes reorient premises if that increases their power to
7331 2. It does no longer proceed strictly from left to right but may also
7332 rotate premises to achieve further simplification.
7333 For compatibility reasons there is now Asm_lr_simp_tac which is like the
7334 old Asm_full_simp_tac in that it does not rotate premises.
7335 2. The simplifier now knows a little bit about nat-arithmetic.
7337 * Classical reasoner: wrapper mechanism for the classical reasoner now
7338 allows for selected deletion of wrappers, by introduction of names for
7339 wrapper functionals. This implies that addbefore, addSbefore,
7340 addaltern, and addSaltern now take a pair (name, tactic) as argument,
7341 and that adding two tactics with the same name overwrites the first
7342 one (emitting a warning).
7343 type wrapper = (int -> tactic) -> (int -> tactic)
7344 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
7345 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
7346 delWrapper, delSWrapper: claset * string -> claset
7347 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
7349 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
7350 semantics; addbefore now affects only the unsafe part of step_tac
7351 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
7352 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
7355 * Classical reasoner: setwrapper to setWrapper and compwrapper to
7356 compWrapper; added safe wrapper (and access functions for it);
7358 * HOL/split_all_tac is now much faster and fails if there is nothing
7359 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
7360 and the names of the automatically generated variables have changed.
7361 split_all_tac has moved within claset() from unsafe wrappers to safe
7362 wrappers, which means that !!-bound variables are split much more
7363 aggressively, and safe_tac and clarify_tac now split such variables.
7364 If this splitting is not appropriate, use delSWrapper "split_all_tac".
7365 Note: the same holds for record_split_tac, which does the job of
7366 split_all_tac for record fields.
7368 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
7369 permanently to the default simpset using Addsplits just like
7370 Addsimps. They can be removed via Delsplits just like
7371 Delsimps. Lower-case versions are also available.
7373 * HOL/Simplifier: The rule split_if is now part of the default
7374 simpset. This means that the simplifier will eliminate all occurrences
7375 of if-then-else in the conclusion of a goal. To prevent this, you can
7376 either remove split_if completely from the default simpset by
7377 `Delsplits [split_if]' or remove it in a specific call of the
7378 simplifier using `... delsplits [split_if]'. You can also add/delete
7379 other case splitting rules to/from the default simpset: every datatype
7380 generates suitable rules `split_t_case' and `split_t_case_asm' (where
7381 t is the name of the datatype).
7383 * Classical reasoner / Simplifier combination: new force_tac (and
7384 derivatives Force_tac, force) combines rewriting and classical
7385 reasoning (and whatever other tools) similarly to auto_tac, but is
7386 aimed to solve the given subgoal completely.
7391 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
7392 and `goalw': the theory is no longer needed as an explicit argument -
7393 the current theory context is used; assumptions are no longer returned
7394 at the ML-level unless one of them starts with ==> or !!; it is
7395 recommended to convert to these new commands using isatool fixgoal
7396 (backup your sources first!);
7398 * new top-level commands 'thm' and 'thms' for retrieving theorems from
7399 the current theory context, and 'theory' to lookup stored theories;
7401 * new theory section 'locale' for declaring constants, assumptions and
7402 definitions that have local scope;
7404 * new theory section 'nonterminals' for purely syntactic types;
7406 * new theory section 'setup' for generic ML setup functions
7407 (e.g. package initialization);
7409 * the distribution now includes Isabelle icons: see
7410 lib/logo/isabelle-{small,tiny}.xpm;
7412 * isatool install - install binaries with absolute references to
7415 * isatool logo -- create instances of the Isabelle logo (as EPS);
7417 * print mode 'emacs' reserved for Isamode;
7419 * support multiple print (ast) translations per constant name;
7421 * theorems involving oracles are now printed with a suffixed [!];
7426 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
7428 * HOL/inductive package reorganized and improved: now supports mutual
7434 oddI "n : EVEN ==> Suc n : ODD"
7435 evenI "n : ODD ==> Suc n : EVEN"
7437 new theorem list "elims" contains an elimination rule for each of the
7438 recursive sets; inductive definitions now handle disjunctive premises
7439 correctly (also ZF);
7441 INCOMPATIBILITIES: requires Inductive as an ancestor; component
7442 "mutual_induct" no longer exists - the induction rule is always
7443 contained in "induct";
7446 * HOL/datatype package re-implemented and greatly improved: now
7447 supports mutually recursive datatypes such as
7450 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
7451 | SUM ('a aexp) ('a aexp)
7452 | DIFF ('a aexp) ('a aexp)
7455 'a bexp = LESS ('a aexp) ('a aexp)
7456 | AND ('a bexp) ('a bexp)
7457 | OR ('a bexp) ('a bexp)
7459 as well as indirectly recursive datatypes such as
7462 ('a, 'b) term = Var 'a
7463 | App 'b ((('a, 'b) term) list)
7465 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
7466 induction on mutually / indirectly recursive datatypes.
7468 Primrec equations are now stored in theory and can be accessed via
7469 <function_name>.simps.
7473 - Theories using datatypes must now have theory Datatype as an
7475 - The specific <typename>.induct_tac no longer exists - use the
7476 generic induct_tac instead.
7477 - natE has been renamed to nat.exhaust - use exhaust_tac
7478 instead of res_inst_tac ... natE. Note that the variable
7479 names in nat.exhaust differ from the names in natE, this
7480 may cause some "fragile" proofs to fail.
7481 - The theorems split_<typename>_case and split_<typename>_case_asm
7482 have been renamed to <typename>.split and <typename>.split_asm.
7483 - Since default sorts of type variables are now handled correctly,
7484 some datatype definitions may have to be annotated with explicit
7486 - Primrec definitions no longer require function name and type
7487 of recursive argument.
7489 Consider using isatool fixdatatype to adapt your theories and proof
7490 scripts to the new package (backup your sources first!).
7493 * HOL/record package: considerably improved implementation; now
7494 includes concrete syntax for record types, terms, updates; theorems
7495 for surjective pairing and splitting !!-bound record variables; proof
7496 support is as follows:
7498 1) standard conversions (selectors or updates applied to record
7499 constructor terms) are part of the standard simpset;
7501 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
7502 made part of standard simpset and claset via addIffs;
7504 3) a tactic for record field splitting (record_split_tac) is part of
7505 the standard claset (addSWrapper);
7507 To get a better idea about these rules you may retrieve them via
7508 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
7509 the name of your record type.
7511 The split tactic 3) conceptually simplifies by the following rule:
7513 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
7515 Thus any record variable that is bound by meta-all will automatically
7516 blow up into some record constructor term, consequently the
7517 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
7518 solve record problems automatically.
7521 * reorganized the main HOL image: HOL/Integ and String loaded by
7522 default; theory Main includes everything;
7524 * automatic simplification of integer sums and comparisons, using cancellation;
7526 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
7528 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
7530 * many new identities for unions, intersections, set difference, etc.;
7532 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
7533 called split_if, split_split, split_sum_case and split_nat_case (to go
7534 with add/delsplits);
7536 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
7537 (?x::unit) = (); this is made part of the default simpset, which COULD
7538 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
7539 'Delsimprocs [unit_eq_proc];' as last resort); also note that
7540 unit_abs_eta_conv is added in order to counter the effect of
7541 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
7544 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
7547 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
7548 It and 'sym RS equals0D' are now in the default claset, giving automatic
7549 disjointness reasoning but breaking a few old proofs.
7551 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
7552 to 'converse' from 'inverse' (for compatibility with ZF and some
7555 * HOL/recdef can now declare non-recursive functions, with {} supplied as
7556 the well-founded relation;
7558 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
7559 Compl A. The "Compl" syntax remains available as input syntax for this
7562 * HOL/Update: new theory of function updates:
7563 f(a:=b) == %x. if x=a then b else f x
7564 may also be iterated as in f(a:=b,c:=d,...);
7566 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
7569 - new function list_update written xs[i:=v] that updates the i-th
7570 list position. May also be iterated as in xs[i:=a,j:=b,...].
7571 - new function `upt' written [i..j(] which generates the list
7572 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
7573 bound write [i..j], which is a shorthand for [i..j+1(].
7574 - new lexicographic orderings and corresponding wellfoundedness theorems.
7577 - removed 'pred' (predecessor) function;
7578 - generalized some theorems about n-1;
7579 - many new laws about "div" and "mod";
7580 - new laws about greatest common divisors (see theory ex/Primes);
7582 * HOL/Relation: renamed the relational operator r^-1 "converse"
7583 instead of "inverse";
7585 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
7586 of the multiset ordering;
7588 * directory HOL/Real: a construction of the reals using Dedekind cuts
7589 (not included by default);
7591 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
7593 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
7594 programs, i.e. different program variables may have different types.
7596 * calling (stac rew i) now fails if "rew" has no effect on the goal
7597 [previously, this check worked only if the rewrite rule was unconditional]
7598 Now rew can involve either definitions or equalities (either == or =).
7603 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
7604 only the theorems proved on ZF.ML;
7606 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
7607 It and 'sym RS equals0D' are now in the default claset, giving automatic
7608 disjointness reasoning but breaking a few old proofs.
7610 * ZF/Update: new theory of function updates
7611 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
7612 may also be iterated as in f(a:=b,c:=d,...);
7614 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
7616 * calling (stac rew i) now fails if "rew" has no effect on the goal
7617 [previously, this check worked only if the rewrite rule was unconditional]
7618 Now rew can involve either definitions or equalities (either == or =).
7620 * case_tac provided for compatibility with HOL
7621 (like the old excluded_middle_tac, but with subgoals swapped)
7624 *** Internal programming interfaces ***
7626 * Pure: several new basic modules made available for general use, see
7627 also src/Pure/README;
7629 * improved the theory data mechanism to support encapsulation (data
7630 kind name replaced by private Object.kind, acting as authorization
7631 key); new type-safe user interface via functor TheoryDataFun; generic
7632 print_data function becomes basically useless;
7634 * removed global_names compatibility flag -- all theory declarations
7635 are qualified by default;
7637 * module Pure/Syntax now offers quote / antiquote translation
7638 functions (useful for Hoare logic etc. with implicit dependencies);
7639 see HOL/ex/Antiquote for an example use;
7641 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
7644 * new tactical CHANGED_GOAL for checking that a tactic modifies a
7647 * Display.print_goals function moved to Locale.print_goals;
7649 * standard print function for goals supports current_goals_markers
7650 variable for marking begin of proof, end of proof, start of goal; the
7651 default is ("", "", ""); setting current_goals_markers := ("<proof>",
7652 "</proof>", "<goal>") causes SGML like tagged proof state printing,
7657 New in Isabelle98 (January 1998)
7658 --------------------------------
7660 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7662 * changed lexical syntax of terms / types: dots made part of long
7663 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
7665 * simpset (and claset) reference variable replaced by functions
7666 simpset / simpset_ref;
7668 * no longer supports theory aliases (via merge) and non-trivial
7669 implicit merge of thms' signatures;
7671 * most internal names of constants changed due to qualified names;
7673 * changed Pure/Sequence interface (see Pure/seq.ML);
7676 *** General Changes ***
7678 * hierachically structured name spaces (for consts, types, axms, thms
7679 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
7680 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
7681 isatool fixdots ensures space after dots (e.g. "%x. x"); set
7682 long_names for fully qualified output names; NOTE: ML programs
7683 (special tactics, packages etc.) referring to internal names may have
7684 to be adapted to cope with fully qualified names; in case of severe
7685 backward campatibility problems try setting 'global_names' at compile
7686 time to have enrything declared within a flat name space; one may also
7687 fine tune name declarations in theories via the 'global' and 'local'
7690 * reimplemented the implicit simpset and claset using the new anytype
7691 data filed in signatures; references simpset:simpset ref etc. are
7692 replaced by functions simpset:unit->simpset and
7693 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
7694 to patch your ML files accordingly;
7696 * HTML output now includes theory graph data for display with Java
7697 applet or isatool browser; data generated automatically via isatool
7698 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
7700 * defs may now be conditional; improved rewrite_goals_tac to handle
7701 conditional equations;
7703 * defs now admits additional type arguments, using TYPE('a) syntax;
7705 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
7706 creates a new theory node; implicit merge of thms' signatures is
7707 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
7708 transfer:theory->thm->thm in (rare) cases;
7710 * improved handling of draft signatures / theories; draft thms (and
7711 ctyps, cterms) are automatically promoted to real ones;
7713 * slightly changed interfaces for oracles: admit many per theory, named
7714 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
7716 * print_goals: optional output of const types (set show_consts and
7719 * improved output of warnings (###) and errors (***);
7721 * subgoal_tac displays a warning if the new subgoal has type variables;
7723 * removed old README and Makefiles;
7725 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
7727 * removed obsolete init_pps and init_database;
7729 * deleted the obsolete tactical STATE, which was declared by
7730 fun STATE tacfun st = tacfun st st;
7732 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
7733 (which abbreviates $HOME);
7735 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
7736 use isatool fixseq to adapt your ML programs (this works for fully
7737 qualified references to the Sequence structure only!);
7739 * use_thy no longer requires writable current directory; it always
7740 reloads .ML *and* .thy file, if either one is out of date;
7743 *** Classical Reasoner ***
7745 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
7746 tactics that use classical reasoning to simplify a subgoal without
7747 splitting it into several subgoals;
7749 * Safe_tac: like safe_tac but uses the default claset;
7754 * added simplification meta rules:
7755 (asm_)(full_)simplify: simpset -> thm -> thm;
7757 * simplifier.ML no longer part of Pure -- has to be loaded by object
7760 * added prems argument to simplification procedures;
7762 * HOL, FOL, ZF: added infix function `addsplits':
7763 instead of `<simpset> setloop (split_tac <thms>)'
7764 you can simply write `<simpset> addsplits <thms>'
7769 * TYPE('a) syntax for type reflection terms;
7771 * no longer handles consts with name "" -- declare as 'syntax' instead;
7773 * pretty printer: changed order of mixfix annotation preference (again!);
7775 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7780 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7781 with `addloop' of the simplifier to faciliate case splitting in premises.
7783 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7785 * HOL/Auth: new protocol proofs including some for the Internet
7788 * HOL/Map: new theory of `maps' a la VDM;
7790 * HOL/simplifier: simplification procedures nat_cancel_sums for
7791 cancelling out common nat summands from =, <, <= (in)equalities, or
7792 differences; simplification procedures nat_cancel_factor for
7793 cancelling common factor from =, <, <= (in)equalities over natural
7794 sums; nat_cancel contains both kinds of procedures, it is installed by
7795 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7797 * HOL/simplifier: terms of the form
7798 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7800 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7801 and those of the form
7802 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7804 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7807 Each datatype `t' now comes with a theorem `split_t_case' of the form
7809 P(t_case f1 ... fn x) =
7810 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7812 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7815 and a theorem `split_t_case_asm' of the form
7817 P(t_case f1 ... fn x) =
7818 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7820 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7822 which can be added to a simpset via `addsplits'. The existing theorems
7823 expand_list_case and expand_option_case have been renamed to
7824 split_list_case and split_option_case.
7827 - `pred n' is automatically converted to `n-1'.
7828 Users are strongly encouraged not to use `pred' any longer,
7829 because it will disappear altogether at some point.
7830 - Users are strongly encouraged to write "0 < n" rather than
7831 "n ~= 0". Theorems and proof tools have been modified towards this
7835 the function "set_of_list" has been renamed "set" (and its theorems too);
7836 the function "nth" now takes its arguments in the reverse order and
7837 has acquired the infix notation "!" as in "xs!n".
7839 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7841 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7842 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7844 * HOL/record: extensible records with schematic structural subtyping
7845 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7846 still lacks various theorems and concrete record syntax;
7851 * removed "axioms" and "generated by" sections;
7853 * replaced "ops" section by extended "consts" section, which is capable of
7854 handling the continuous function space "->" directly;
7857 . proves theorems immediately and stores them in the theory,
7858 . creates hierachical name space,
7859 . now uses normal mixfix annotations (instead of cinfix...),
7860 . minor changes to some names and values (for consistency),
7861 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7862 . separator between mutual domain defs: changed "," to "and",
7863 . improved handling of sort constraints; now they have to
7864 appear on the left-hand side of the equations only;
7866 * fixed LAM <x,y,zs>.b syntax;
7868 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7869 adm (%x. P (t x)), where P is chainfinite and t continuous;
7874 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7875 with `addloop' of the simplifier to faciliate case splitting in premises.
7877 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7878 in HOL, they strip ALL and --> from proved theorems;
7882 New in Isabelle94-8 (May 1997)
7883 ------------------------------
7885 *** General Changes ***
7887 * new utilities to build / run / maintain Isabelle etc. (in parts
7888 still somewhat experimental); old Makefiles etc. still functional;
7890 * new 'Isabelle System Manual';
7892 * INSTALL text, together with ./configure and ./build scripts;
7894 * reimplemented type inference for greater efficiency, better error
7895 messages and clean internal interface;
7897 * prlim command for dealing with lots of subgoals (an easier way of
7898 setting goals_limit);
7903 * supports alternative (named) syntax tables (parser and pretty
7904 printer); internal interface is provided by add_modesyntax(_i);
7906 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7907 be used in conjunction with the Isabelle symbol font; uses the
7908 "symbols" syntax table;
7910 * added token_translation interface (may translate name tokens in
7911 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7912 the current print_mode); IMPORTANT: user print translation functions
7913 are responsible for marking newly introduced bounds
7914 (Syntax.mark_boundT);
7916 * token translations for modes "xterm" and "xterm_color" that display
7917 names in bold, underline etc. or colors (which requires a color
7920 * infixes may now be declared with names independent of their syntax;
7922 * added typed_print_translation (like print_translation, but may
7923 access type of constant);
7926 *** Classical Reasoner ***
7928 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7929 some limitations. Blast_tac...
7930 + ignores addss, addbefore, addafter; this restriction is intrinsic
7931 + ignores elimination rules that don't have the correct format
7932 (the conclusion MUST be a formula variable)
7933 + ignores types, which can make HOL proofs fail
7934 + rules must not require higher-order unification, e.g. apply_type in ZF
7935 [message "Function Var's argument not a bound variable" relates to this]
7936 + its proof strategy is more general but can actually be slower
7938 * substitution with equality assumptions no longer permutes other
7941 * minor changes in semantics of addafter (now called addaltern); renamed
7942 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7943 (and access functions for it);
7945 * improved combination of classical reasoner and simplifier:
7946 + functions for handling clasimpsets
7947 + improvement of addss: now the simplifier is called _after_ the
7949 + safe variant of addss called addSss: uses safe simplifications
7950 _during_ the safe steps. It is more complete as it allows multiple
7951 instantiations of unknowns (e.g. with slow_tac).
7955 * added interface for simplification procedures (functions that
7956 produce *proven* rewrite rules on the fly, depending on current
7959 * ordering on terms as parameter (used for ordered rewriting);
7961 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7963 * the solver is now split into a safe and an unsafe part.
7964 This should be invisible for the normal user, except that the
7965 functions setsolver and addsolver have been renamed to setSolver and
7966 addSolver; added safe_asm_full_simp_tac;
7971 * a generic induction tactic `induct_tac' which works for all datatypes and
7972 also for type `nat';
7974 * a generic case distinction tactic `exhaust_tac' which works for all
7975 datatypes and also for type `nat';
7977 * each datatype comes with a function `size';
7979 * patterns in case expressions allow tuple patterns as arguments to
7980 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7982 * primrec now also works with type nat;
7984 * recdef: a new declaration form, allows general recursive functions to be
7985 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7987 * the constant for negation has been renamed from "not" to "Not" to
7988 harmonize with FOL, ZF, LK, etc.;
7990 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7993 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7995 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7996 problems in commutative rings, using axiomatic type classes for + and *;
7998 * more examples in HOL/MiniML and HOL/Auth;
8000 * more default rewrite rules for quantifiers, union/intersection;
8002 * a new constant `arbitrary == @x.False';
8004 * HOLCF/IOA replaces old HOL/IOA;
8006 * HOLCF changes: derived all rules and arities
8007 + axiomatic type classes instead of classes
8008 + typedef instead of faking type definitions
8009 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
8010 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
8011 + eliminated the types void, one, tr
8012 + use unit lift and bool lift (with translations) instead of one and tr
8013 + eliminated blift from Lift3.thy (use Def instead of blift)
8014 all eliminated rules are derived as theorems --> no visible changes ;
8019 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
8020 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
8021 as ZF_cs addSIs [equalityI];
8025 New in Isabelle94-7 (November 96)
8026 ---------------------------------
8028 * allowing negative levels (as offsets) in prlev and choplev;
8030 * super-linear speedup for large simplifications;
8032 * FOL, ZF and HOL now use miniscoping: rewriting pushes
8033 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
8034 FAIL); can suppress it using the command Delsimps (ex_simps @
8035 all_simps); De Morgan laws are also now included, by default;
8037 * improved printing of ==> : ~:
8039 * new object-logic "Sequents" adds linear logic, while replacing LK
8040 and Modal (thanks to Sara Kalvala);
8042 * HOL/Auth: correctness proofs for authentication protocols;
8044 * HOL: new auto_tac combines rewriting and classical reasoning (many
8045 examples on HOL/Auth);
8047 * HOL: new command AddIffs for declaring theorems of the form P=Q to
8048 the rewriter and classical reasoner simultaneously;
8050 * function uresult no longer returns theorems in "standard" format;
8051 regain previous version by: val uresult = standard o uresult;
8058 * oracles -- these establish an interface between Isabelle and trusted
8059 external reasoners, which may deliver results as theorems;
8061 * proof objects (in particular record all uses of oracles);
8063 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
8065 * "constdefs" section in theory files;
8067 * "primrec" section (HOL) no longer requires names;
8069 * internal type "tactic" now simply "thm -> thm Sequence.seq";
8076 * reduced space requirements;
8078 * automatic HTML generation from theories;
8080 * theory files no longer require "..." (quotes) around most types;
8082 * new examples, including two proofs of the Church-Rosser theorem;
8084 * non-curried (1994) version of HOL is no longer distributed;
8091 * greatly reduced space requirements;
8093 * theory files (.thy) no longer require \...\ escapes at line breaks;
8095 * searchable theorem database (see the section "Retrieving theorems" on
8096 page 8 of the Reference Manual);
8098 * new examples, including Grabczewski's monumental case study of the
8101 * The previous version of HOL renamed to Old_HOL;
8103 * The new version of HOL (previously called CHOL) uses a curried syntax
8104 for functions. Application looks like f a b instead of f(a,b);
8106 * Mutually recursive inductive definitions finally work in HOL;
8108 * In ZF, pattern-matching on tuples is now available in all abstractions and
8109 translates to the operator "split";
8116 * new infix operator, addss, allowing the classical reasoner to
8117 perform simplification at each step of its search. Example:
8118 fast_tac (cs addss ss)
8120 * a new logic, CHOL, the same as HOL, but with a curried syntax
8121 for functions. Application looks like f a b instead of f(a,b). Also pairs
8122 look like (a,b) instead of <a,b>;
8124 * PLEASE NOTE: CHOL will eventually replace HOL!
8126 * In CHOL, pattern-matching on tuples is now available in all abstractions.
8127 It translates to the operator "split". A new theory of integers is available;
8129 * In ZF, integer numerals now denote two's-complement binary integers.
8130 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
8132 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
8133 of the Axiom of Choice;
8140 * Significantly faster resolution;
8142 * the different sections in a .thy file can now be mixed and repeated
8145 * Database of theorems for FOL, HOL and ZF. New
8146 commands including qed, qed_goal and bind_thm store theorems in the database.
8148 * Simple database queries: return a named theorem (get_thm) or all theorems of
8149 a given theory (thms_of), or find out what theory a theorem was proved in
8152 * Bugs fixed in the inductive definition and datatype packages;
8154 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
8155 and HOL_dup_cs obsolete;
8157 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
8160 * Simpler definition of function space in ZF;
8162 * new results about cardinal and ordinal arithmetic in ZF;
8164 * 'subtype' facility in HOL for introducing new types as subsets of existing
8167 :mode=text:wrap=hard:maxLineLen=72: