1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Generalized Isar history, with support for linear undo, direct state
12 * Recovered hiding of consts, which was accidentally broken in
13 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
14 makes c inaccessible; consider using ``hide (open) const c'' instead.
16 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
22 * Dropped "locale (open)". INCOMPATBILITY.
24 * Command 'interpretation' no longer attempts to simplify goal.
25 INCOMPATIBILITY: in rare situations the generated goal differs. Use
26 methods intro_locales and unfold_locales to clarify.
28 * Command 'instance': attached definitions no longer accepted.
29 INCOMPATIBILITY, use proper 'instantiation' target.
31 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
34 *** Document preparation ***
36 * Antiquotation @{lemma} now imitates a regular terminal proof,
37 demanding keyword 'by' and supporting the full method expression
38 syntax just like the Isar command 'by'.
43 * HOL/Orderings: class "wellorder" moved here, with explicit induction rule
44 "less_induct" as assumption. For instantiation of "wellorder" by means
45 of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY.
47 * HOL/Orderings: added class "preorder" as superclass of "order".
48 INCOMPATIBILITY: Instantiation proofs for order, linorder
49 etc. slightly changed. Some theorems named order_class.* now named
52 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been
53 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
54 dvd has been generalized to class comm_semiring_1. Likewise a bunch
55 of lemmas from Divides has been generalized from nat to class
56 semiring_div. INCOMPATIBILITY. This involves the following theorem
57 renames resulting from duplicate elimination:
59 dvd_def_mod ~> dvd_eq_mod_eq_0
60 zero_dvd_iff ~> dvd_0_left_iff
61 DIVISION_BY_ZERO_DIV ~> div_by_0
62 DIVISION_BY_ZERO_MOD ~> mod_by_0
63 mult_div ~> div_mult_self2_is_id
64 mult_mod ~> mod_mult_self2_is_0
66 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
67 zlcm (for int); carried together from various gcd/lcm developements in
68 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
69 corresponding theorems renamed accordingly. INCOMPATIBILY. To
70 recover tupled syntax, use syntax declarations like:
73 abbreviation gcd where
74 "gcd == (%(a, b). GCD.gcd a b)"
76 GCD.gcd ("gcd '(_, _')")
78 (analogously for lcm, zgcd, zlcm).
80 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
82 * New ML antiquotation @{code}: takes constant as argument, generates
83 corresponding code in background and inserts name of the corresponding
84 resulting ML value/function/datatype constructor binding in place.
85 All occurrences of @{code} with a single ML block are generated
86 simultaneously. Provides a generic and safe interface for
87 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
88 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
89 application. In future you ought refrain from ad-hoc compiling
90 generated SML code on the ML toplevel. Note that (for technical
91 reasons) @{code} cannot refer to constants for which user-defined
92 serializations are set. Refer to the corresponding ML counterpart
93 directly in that cases.
95 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
96 Complex_Main.thy remain as they are.
98 * New image HOL-Plain provides a minimal HOL with the most important
99 tools available (inductive, datatype, primrec, ...). By convention
100 the corresponding theory Plain should be ancestor of every further
101 (library) theory. Some library theories now have ancestor Plain
102 (instead of Main), thus theory Main occasionally has to be imported
105 * Methods "case_tac" and "induct_tac" now refer to the very same rules
106 as the structured Isar versions "cases" and "induct", cf. the
107 corresponding "cases" and "induct" attributes. Mutual induction rules
108 are now presented as a list of individual projections
109 (e.g. foo_bar.inducts for types foo and bar); the old format with
110 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
111 rare situations a different rule is selected --- notably nested tuple
112 elimination instead of former prod.exhaust: use explicit (case_tac t
113 rule: prod.exhaust) here.
115 * Attributes "cases", "induct", "coinduct" support "del" option.
117 * Removed fact "case_split_thm", which duplicates "case_split".
119 * Command 'rep_datatype': instead of theorem names the command now
120 takes a list of terms denoting the constructors of the type to be
121 represented as datatype. The characteristic theorems have to be
122 proven. INCOMPATIBILITY. Also observe that the following theorems
123 have disappeared in favour of existing ones:
125 unit_induct ~> unit.induct
126 prod_induct ~> prod.induct
127 sum_induct ~> sum.induct
128 Suc_Suc_eq ~> nat.inject
129 Suc_not_Zero Zero_not_Suc ~> nat.distinct
131 * Library/Nat_Infinity: added addition, numeral syntax and more
132 instantiations for algebraic structures. Removed some duplicate
133 theorems. Changes in simp rules. INCOMPATIBILITY.
138 * New locales for orders and lattices where the equivalence relation
139 is not restricted to equality. INCOMPATIBILITY: all order and
140 lattice locales use a record structure with field eq for the
143 * New theory of factorial domains.
145 * Units_l_inv and Units_r_inv are now simprules by default.
146 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
147 and/or r_inv will now also require deletion of these lemmas.
149 * Renamed the following theorems. INCOMPATIBILITY.
152 least_carrier ~> least_closed
153 greatest_carrier ~> greatest_closed
154 greatest_Lower_above ~> greatest_Lower_below
155 one_zero ~> carrier_one_zero
156 one_not_zero ~> carrier_one_not_zero (collision with assumption)
161 * Created new image HOL-NSA, containing theories of nonstandard
162 analysis which were previously part of HOL-Complex. Entry point
163 Hyperreal.thy remains valid, but theories formerly using
164 Complex_Main.thy should now use new entry point Hypercomplex.thy.
169 * Proof of Zorn's Lemma for partial orders.
174 * Rules and tactics that read instantiations (read_instantiate,
175 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
176 context, which is required for parsing and type-checking. Moreover,
177 the variables are specified as plain indexnames, not string encodings
178 thereof. INCOMPATIBILITY.
180 * Disposed old type and term read functions (Sign.read_def_typ,
181 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
182 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
183 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
184 Syntax.read_term_global etc.; see also OldGoals.read_term as last
185 resort for legacy applications.
187 * Antiquotations: block-structured compilation context indicated by
188 \<lbrace> ... \<rbrace>; additional antiquotation forms:
190 @{let ?pat = term} - term abbreviation (HO matching)
191 @{note name = fact} - fact abbreviation
192 @{thm fact} - singleton fact (with attributes)
193 @{thms fact} - general fact (with attributes)
194 @{lemma prop by method} - singleton goal
195 @{lemma prop by meth1 meth2} - singleton goal
196 @{lemma prop1 ... propN by method} - general goal
197 @{lemma prop1 ... propN by meth1 meth2} - general goal
198 @{lemma (open) ...} - open derivation
203 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
204 the Isabelle process into a JVM/Scala application. See
205 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
206 process wrapper has been discontinued.)
208 * Status messages (with exact source position information) are
209 emitted, if proper markup print mode is enabled. This allows
210 user-interface components to provide detailed feedback on internal
213 * Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts.
217 New in Isabelle2008 (June 2008)
218 -------------------------------
222 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
223 and updated, with formally checked references as hyperlinks.
225 * Theory loader: use_thy (and similar operations) no longer set the
226 implicit ML context, which was occasionally hard to predict and in
227 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
228 provides a proper context already.
230 * Theory loader: old-style ML proof scripts being *attached* to a thy
231 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
232 'use' within a theory file will do the job.
234 * Name space merge now observes canonical order, i.e. the second space
235 is inserted into the first one, while existing entries in the first
236 space take precedence. INCOMPATIBILITY in rare situations, may try to
239 * Syntax: symbol \<chi> is now considered a letter. Potential
240 INCOMPATIBILITY in identifier syntax etc.
242 * Outer syntax: string tokens no longer admit escaped white space,
243 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
244 white space without escapes.
246 * Outer syntax: string tokens may contain arbitrary character codes
247 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
253 * Context-dependent token translations. Default setup reverts locally
254 fixed variables, and adds hilite markup for undeclared frees.
256 * Unused theorems can be found using the new command 'unused_thms'.
257 There are three ways of invoking it:
260 Only finds unused theorems in the current theory.
262 (2) unused_thms thy_1 ... thy_n -
263 Finds unused theorems in the current theory and all of its ancestors,
264 excluding the theories thy_1 ... thy_n and all of their ancestors.
266 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
267 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
268 their ancestors, excluding the theories thy_1 ... thy_n and all of
271 In order to increase the readability of the list produced by
272 unused_thms, theorems that have been created by a particular instance
273 of a theory command such as 'inductive' or 'function' are considered
274 to belong to the same "group", meaning that if at least one theorem in
275 this group is used, the other theorems in the same group are no longer
276 reported as unused. Moreover, if all theorems in the group are
277 unused, only one theorem in the group is displayed.
279 Note that proof objects have to be switched on in order for
280 unused_thms to work properly (i.e. !proofs must be >= 1, which is
281 usually the case when using Proof General with the default settings).
283 * Authentic naming of facts disallows ad-hoc overwriting of previous
284 theorems within the same name space. INCOMPATIBILITY, need to remove
285 duplicate fact bindings, or even accidental fact duplications. Note
286 that tools may maintain dynamically scoped facts systematically, using
287 PureThy.add_thms_dynamic.
289 * Command 'hide' now allows to hide from "fact" name space as well.
291 * Eliminated destructive theorem database, simpset, claset, and
292 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
293 update of theories within ML code.
295 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
296 INCOMPATIBILITY, object-logics depending on former Pure require
297 additional setup PureThy.old_appl_syntax_setup; object-logics
298 depending on former CPure need to refer to Pure.
300 * Commands 'use' and 'ML' are now purely functional, operating on
301 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
302 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
305 * Command 'setup': discontinued implicit version with ML reference.
307 * Instantiation target allows for simultaneous specification of class
308 instance operations together with an instantiation proof.
309 Type-checking phase allows to refer to class operations uniformly.
310 See src/HOL/Complex/Complex.thy for an Isar example and
311 src/HOL/Library/Eval.thy for an ML example.
313 * Indexing of literal facts: be more serious about including only
314 facts from the visible specification/proof context, but not the
315 background context (locale etc.). Affects `prop` notation and method
316 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
319 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
320 "(open)" option, which used to expose internal bound variables to the
323 * Isar statements: removed obsolete case "rule_context".
324 INCOMPATIBILITY, better use explicit fixes/assumes.
326 * Locale proofs: default proof step now includes 'unfold_locales';
327 hence 'proof' without argument may be used to unfold locale
331 *** Document preparation ***
333 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
334 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
335 obsolete thumbpdf setup (contemporary PDF viewers do this on the
336 spot); renamed link color from "darkblue" to "linkcolor" (default
337 value unchanged, can be redefined via \definecolor); no longer sets
338 "a4paper" option (unnecessary or even intrusive).
340 * Antiquotation @{lemma A method} proves proposition A by the given
341 method (either a method name or a method name plus (optional) method
342 arguments in parentheses) and prints A just like @{prop A}.
347 * New primrec package. Specification syntax conforms in style to
348 definition/function/.... No separate induction rule is provided. The
349 "primrec" command distinguishes old-style and new-style specifications
350 by syntax. The former primrec package is now named OldPrimrecPackage.
351 When adjusting theories, beware: constants stemming from new-style
352 primrec specifications have authentic syntax.
354 * Metis prover is now an order of magnitude faster, and also works
357 * Metis: the maximum number of clauses that can be produced from a
358 theorem is now given by the attribute max_clauses. Theorems that
359 exceed this number are ignored, with a warning printed.
361 * Sledgehammer no longer produces structured proofs by default. To
362 enable, declare [[sledgehammer_full = true]]. Attributes
363 reconstruction_modulus, reconstruction_sorts renamed
364 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
366 * Method "induct_scheme" derives user-specified induction rules
367 from well-founded induction and completeness of patterns. This factors
368 out some operations that are done internally by the function package
369 and makes them available separately. See
370 src/HOL/ex/Induction_Scheme.thy for examples.
372 * More flexible generation of measure functions for termination
373 proofs: Measure functions can be declared by proving a rule of the
374 form "is_measure f" and giving it the [measure_function] attribute.
375 The "is_measure" predicate is logically meaningless (always true), and
376 just guides the heuristic. To find suitable measure functions, the
377 termination prover sets up the goal "is_measure ?f" of the appropriate
378 type and generates all solutions by prolog-style backwards proof using
381 This setup also deals with rules like
383 "is_measure f ==> is_measure (list_size f)"
385 which accommodates nested datatypes that recurse through lists.
386 Similar rules are predeclared for products and option types.
388 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
392 - Definitions of overloaded constants on sets have to be replaced by
393 definitions on => and bool.
395 - Some definitions of overloaded operators on sets can now be proved
396 using the definitions of the operators on => and bool. Therefore,
397 the following theorems have been renamed:
399 subset_def -> subset_eq
400 psubset_def -> psubset_eq
401 set_diff_def -> set_diff_eq
402 Compl_def -> Compl_eq
403 Sup_set_def -> Sup_set_eq
404 Inf_set_def -> Inf_set_eq
405 sup_set_def -> sup_set_eq
406 inf_set_def -> inf_set_eq
408 - Due to the incompleteness of the HO unification algorithm, some
409 rules such as subst may require manual instantiation, if some of
410 the unknowns in the rule is a set.
412 - Higher order unification and forward proofs:
415 have "P (S::'a set)" <...>
416 then have "EX S. P S" ..
418 no longer works (due to the incompleteness of the HO unification
419 algorithm) and must be replaced by the pattern
426 - Calculational reasoning with subst (or similar rules):
429 have "P (S::'a set)" <...>
430 also have "S = T" <...>
433 no longer works (for similar reasons as the previous example) and
434 must be replaced by something like
436 have "P (S::'a set)" <...>
437 moreover have "S = T" <...>
438 ultimately have "P T" by simp
440 - Tactics or packages written in ML code:
441 Code performing pattern matching on types via
443 Type ("set", [T]) => ...
445 must be rewritten. Moreover, functions like strip_type or
446 binder_types no longer return the right value when applied to a
449 T1 => ... => Tn => U => bool
453 T1 => ... => Tn => U set
455 * Merged theories Wellfounded_Recursion, Accessible_Part and
456 Wellfounded_Relations to theory Wellfounded.
458 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
460 * Class finite no longer treats UNIV as class parameter. Use class
461 enum from theory Library/Enum instead to achieve a similar effect.
464 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
465 and "Cons". INCOMPATIBILITY.
467 * HOL (and FOL): renamed variables in rules imp_elim and swap.
468 Potential INCOMPATIBILITY.
470 * Theory Product_Type: duplicated lemmas split_Pair_apply and
471 injective_fst_snd removed, use split_eta and prod_eqI instead.
472 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
474 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
475 the same name in theory Orderings:
485 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
486 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
487 and different variable names.
489 * Library/Option_ord.thy: Canonical order on option type.
491 * Library/RBT.thy: Red-black trees, an efficient implementation of
494 * Library/Countable.thy: Type class for countable types.
496 * Theory Int: The representation of numerals has changed. The infix
497 operator BIT and the bit datatype with constructors B0 and B1 have
498 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
499 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
500 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
503 * Theory Nat: definition of <= and < on natural numbers no longer
504 depend on well-founded relations. INCOMPATIBILITY. Definitions
505 le_def and less_def have disappeared. Consider lemmas not_less
506 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
508 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
509 (whose purpose mainly is for various fold_set functionals) have been
510 abandoned in favor of the existing algebraic classes
511 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
512 lower_semilattice (resp. upper_semilattice) and linorder.
515 * Theory Transitive_Closure: induct and cases rules now declare proper
516 case_names ("base" and "step"). INCOMPATIBILITY.
518 * Theorem Inductive.lfp_ordinal_induct generalized to complete
519 lattices. The form set-specific version is available as
520 Inductive.lfp_ordinal_induct_set.
522 * Renamed theorems "power.simps" to "power_int.simps".
525 * Class semiring_div provides basic abstract properties of semirings
526 with division and modulo operations. Subsumes former class dvd_mod.
528 * Merged theories IntDef, Numeral and IntArith into unified theory
529 Int. INCOMPATIBILITY.
531 * Theory Library/Code_Index: type "index" now represents natural
532 numbers rather than integers. INCOMPATIBILITY.
534 * New class "uminus" with operation "uminus" (split of from class
535 "minus" which now only has operation "minus", binary).
538 * Constants "card", "internal_split", "option_map" now with authentic
539 syntax. INCOMPATIBILITY.
541 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
542 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
543 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
544 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
545 Sup_set_def, le_def, less_def, option_map_def now with object
546 equality. INCOMPATIBILITY.
548 * Records. Removed K_record, and replaced it by pure lambda term
549 %x. c. The simplifier setup is now more robust against eta expansion.
550 INCOMPATIBILITY: in cases explicitly referring to K_record.
552 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
554 * Library/ListVector: new theory of arithmetic vector operations.
556 * Library/Order_Relation: new theory of various orderings as sets of
557 pairs. Defines preorders, partial orders, linear orders and
558 well-orders on sets and on types.
563 * Renamed some theories to allow to loading both ZF and HOL in the
566 Datatype -> Datatype_ZF
567 Inductive -> Inductive_ZF
574 INCOMPATIBILITY: ZF theories that import individual theories below
575 Main might need to be adapted. Regular theory Main is still
576 available, as trivial extension of Main_ZF.
581 * ML within Isar: antiquotation @{const name} or @{const
582 name(typargs)} produces statically-checked Const term.
584 * Functor NamedThmsFun: data is available to the user as dynamic fact
585 (of the same name). Removed obsolete print command.
587 * Removed obsolete "use_legacy_bindings" function.
589 * The ``print mode'' is now a thread-local value derived from a global
590 template (the former print_mode reference), thus access becomes
591 non-critical. The global print_mode reference is for session
592 management only; user-code should use print_mode_value,
593 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
595 * Functions system/system_out provide a robust way to invoke external
596 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
597 Do not use OS.Process.system etc. from the basis library!
602 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
603 in accordance with Proof General 3.7, which prefers GNU emacs.
605 * isatool tty runs Isabelle process with plain tty interaction;
606 optional line editor may be specified via ISABELLE_LINE_EDITOR
607 setting, the default settings attempt to locate "ledit" and "rlwrap".
609 * isatool browser now works with Cygwin as well, using general
610 "javapath" function defined in Isabelle process environment.
612 * YXML notation provides a simple and efficient alternative to
613 standard XML transfer syntax. See src/Pure/General/yxml.ML and
614 isatool yxml as described in the Isabelle system manual.
616 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
617 provides general wrapper for managing an Isabelle process in a robust
618 fashion, with ``cooked'' output from stdin/stderr.
620 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
621 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
623 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
624 way of changing the user's settings is via
625 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
628 * Multithreading.max_threads := 0 refers to the number of actual CPU
629 cores of the underlying machine, which is a good starting point for
630 optimal performance tuning. The corresponding usedir option -M allows
631 "max" as an alias for "0". WARNING: does not work on certain versions
632 of Mac OS (with Poly/ML 5.1).
634 * isabelle-process: non-ML sessions are run with "nice", to reduce the
635 adverse effect of Isabelle flooding interactive front-ends (notably
636 ProofGeneral / XEmacs).
640 New in Isabelle2007 (November 2007)
641 -----------------------------------
645 * More uniform information about legacy features, notably a
646 warning/error of "Legacy feature: ...", depending on the state of the
647 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
648 legacy features will disappear eventually.
650 * Theory syntax: the header format ``theory A = B + C:'' has been
651 discontinued in favour of ``theory A imports B C begin''. Use isatool
652 fixheaders to convert existing theory files. INCOMPATIBILITY.
654 * Theory syntax: the old non-Isar theory file format has been
655 discontinued altogether. Note that ML proof scripts may still be used
656 with Isar theories; migration is usually quite simple with the ML
657 function use_legacy_bindings. INCOMPATIBILITY.
659 * Theory syntax: some popular names (e.g. 'class', 'declaration',
660 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
663 * Theory loader: be more serious about observing the static theory
664 header specifications (including optional directories), but not the
665 accidental file locations of previously successful loads. The strict
666 update policy of former update_thy is now already performed by
667 use_thy, so the former has been removed; use_thys updates several
668 theories simultaneously, just as 'imports' within a theory header
669 specification, but without merging the results. Potential
670 INCOMPATIBILITY: may need to refine theory headers and commands
671 ROOT.ML which depend on load order.
673 * Theory loader: optional support for content-based file
674 identification, instead of the traditional scheme of full physical
675 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
676 (cf. the system manual). The new scheme allows to work with
677 non-finished theories in persistent session images, such that source
678 files may be moved later on without requiring reloads.
680 * Theory loader: old-style ML proof scripts being *attached* to a thy
681 file (with the same base name as the theory) are considered a legacy
682 feature, which will disappear eventually. Even now, the theory loader
683 no longer maintains dependencies on such files.
685 * Syntax: the scope for resolving ambiguities via type-inference is
686 now limited to individual terms, instead of whole simultaneous
687 specifications as before. This greatly reduces the complexity of the
688 syntax module and improves flexibility by separating parsing and
689 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
690 'fixes' etc.) are required in rare situations.
692 * Syntax: constants introduced by new-style packages ('definition',
693 'abbreviation' etc.) are passed through the syntax module in
694 ``authentic mode''. This means that associated mixfix annotations
695 really stick to such constants, independently of potential name space
696 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
697 trees are represented slightly differently, may need to adapt syntax
698 translations accordingly. Use CONST marker in 'translations' and
699 @{const_syntax} antiquotation in 'parse_translation' etc.
701 * Legacy goal package: reduced interface to the bare minimum required
702 to keep existing proof scripts running. Most other user-level
703 functions are now part of the OldGoals structure, which is *not* open
704 by default (consider isatool expandshort before open OldGoals).
705 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
706 these tend to cause confusion about the actual goal (!) context being
707 used here, which is not necessarily the same as the_context().
709 * Command 'find_theorems': supports "*" wild-card in "name:"
710 criterion; "with_dups" option. Certain ProofGeneral versions might
711 support a specific search form (see ProofGeneral/CHANGES).
713 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
714 by default, which means that "prems" (and also "fixed variables") are
715 suppressed from proof state output. Note that the ProofGeneral
716 settings mechanism allows to change and save options persistently, but
717 older versions of Isabelle will fail to start up if a negative prems
720 * Local theory targets may be specified by non-nested blocks of
721 ``context/locale/class ... begin'' followed by ``end''. The body may
722 contain definitions, theorems etc., including any derived mechanism
723 that has been implemented on top of these primitives. This concept
724 generalizes the existing ``theorem (in ...)'' towards more versatility
727 * Proof General interface: proper undo of final 'end' command;
728 discontinued Isabelle/classic mode (ML proof scripts).
731 *** Document preparation ***
733 * Added antiquotation @{theory name} which prints the given name,
734 after checking that it refers to a valid ancestor theory in the
737 * Added antiquotations @{ML_type text} and @{ML_struct text} which
738 check the given source text as ML type/structure, printing verbatim.
740 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
741 "c args == rhs" given in the current context. (Any number of
742 arguments may be given on the LHS.)
747 * The 'class' package offers a combination of axclass and locale to
748 achieve Haskell-like type classes in Isabelle. Definitions and
749 theorems within a class context produce both relative results (with
750 implicit parameters according to the locale context), and polymorphic
751 constants with qualified polymorphism (according to the class
752 context). Within the body context of a 'class' target, a separate
753 syntax layer ("user space type system") takes care of converting
754 between global polymorphic consts and internal locale representation.
755 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
756 "isatool doc classes" provides a tutorial.
758 * Generic code generator framework allows to generate executable
759 code for ML and Haskell (including Isabelle classes). A short usage
762 internal compilation:
763 export_code <list of constants (term syntax)> in SML
764 writing SML code to a file:
765 export_code <list of constants (term syntax)> in SML <filename>
766 writing OCaml code to a file:
767 export_code <list of constants (term syntax)> in OCaml <filename>
768 writing Haskell code to a bunch of files:
769 export_code <list of constants (term syntax)> in Haskell <filename>
771 evaluating closed propositions to True/False using code generation:
774 Reasonable default setup of framework in HOL.
776 Theorem attributs for selecting and transforming function equations theorems:
778 [code fun]: select a theorem as function equation for a specific constant
779 [code fun del]: deselect a theorem as function equation for a specific constant
780 [code inline]: select an equation theorem for unfolding (inlining) in place
781 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
783 User-defined serializations (target in {SML, OCaml, Haskell}):
785 code_const <and-list of constants (term syntax)>
786 {(target) <and-list of const target syntax>}+
788 code_type <and-list of type constructors>
789 {(target) <and-list of type target syntax>}+
791 code_instance <and-list of instances>
793 where instance ::= <type constructor> :: <class>
795 code_class <and_list of classes>
796 {(target) <and-list of class target syntax>}+
797 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
799 code_instance and code_class only are effective to target Haskell.
801 For example usage see src/HOL/ex/Codegenerator.thy and
802 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
803 generation from Isabelle/HOL theories is available via "isatool doc
806 * Code generator: consts in 'consts_code' Isar commands are now
807 referred to by usual term syntax (including optional type
810 * Command 'no_translations' removes translation rules from theory
813 * Overloaded definitions are now actually checked for acyclic
814 dependencies. The overloading scheme is slightly more general than
815 that of Haskell98, although Isabelle does not demand an exact
816 correspondence to type class and instance declarations.
817 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
818 exotic versions of overloading -- at the discretion of the user!
820 Polymorphic constants are represented via type arguments, i.e. the
821 instantiation that matches an instance against the most general
822 declaration given in the signature. For example, with the declaration
823 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
824 as c(nat). Overloading is essentially simultaneous structural
825 recursion over such type arguments. Incomplete specification patterns
826 impose global constraints on all occurrences, e.g. c('a * 'a) on the
827 LHS means that more general c('a * 'b) will be disallowed on any RHS.
828 Command 'print_theory' outputs the normalized system of recursive
829 equations, see section "definitions".
831 * Configuration options are maintained within the theory or proof
832 context (with name and type bool/int/string), providing a very simple
833 interface to a poor-man's version of general context data. Tools may
834 declare options in ML (e.g. using Attrib.config_int) and then refer to
835 these values using Config.get etc. Users may change options via an
836 associated attribute of the same name. This form of context
837 declaration works particularly well with commands 'declare' or
838 'using', for example ``declare [[foo = 42]]''. Thus it has become
839 very easy to avoid global references, which would not observe Isar
840 toplevel undo/redo and fail to work with multithreading.
842 Various global ML references of Pure and HOL have been turned into
843 configuration options:
845 Unify.search_bound unify_search_bound
846 Unify.trace_bound unify_trace_bound
847 Unify.trace_simp unify_trace_simp
848 Unify.trace_types unify_trace_types
849 Simplifier.simp_depth_limit simp_depth_limit
850 Blast.depth_limit blast_depth_limit
851 DatatypeProp.dtK datatype_distinctness_limit
852 fast_arith_neq_limit fast_arith_neq_limit
853 fast_arith_split_limit fast_arith_split_limit
855 * Named collections of theorems may be easily installed as context
856 data using the functor NamedThmsFun (see also
857 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
858 attributes; there is also a toplevel print command. This facility is
859 just a common case of general context data, which is the preferred way
860 for anything more complex than just a list of facts in canonical
863 * Isar: command 'declaration' augments a local theory by generic
864 declaration functions written in ML. This enables arbitrary content
865 being added to the context, depending on a morphism that tells the
866 difference of the original declaration context wrt. the application
867 context encountered later on.
869 * Isar: proper interfaces for simplification procedures. Command
870 'simproc_setup' declares named simprocs (with match patterns, and body
871 text in ML). Attribute "simproc" adds/deletes simprocs in the current
872 context. ML antiquotation @{simproc name} retrieves named simprocs.
874 * Isar: an extra pair of brackets around attribute declarations
875 abbreviates a theorem reference involving an internal dummy fact,
876 which will be ignored later --- only the effect of the attribute on
877 the background context will persist. This form of in-place
878 declarations is particularly useful with commands like 'declare' and
879 'using', for example ``have A using [[simproc a]] by simp''.
881 * Isar: method "assumption" (and implicit closing of subproofs) now
882 takes simple non-atomic goal assumptions into account: after applying
883 an assumption as a rule the resulting subgoals are solved by atomic
884 assumption steps. This is particularly useful to finish 'obtain'
885 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
886 without referring to the original premise "!!x. P x ==> thesis" in the
887 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
890 * Isar: implicit use of prems from the Isar proof context is
891 considered a legacy feature. Common applications like ``have A .''
892 may be replaced by ``have A by fact'' or ``note `A`''. In general,
893 referencing facts explicitly here improves readability and
894 maintainability of proof texts.
896 * Isar: improper proof element 'guess' is like 'obtain', but derives
897 the obtained context from the course of reasoning! For example:
899 assume "EX x y. A x & B y" -- "any previous fact"
900 then guess x and y by clarify
902 This technique is potentially adventurous, depending on the facts and
903 proof tools being involved here.
905 * Isar: known facts from the proof context may be specified as literal
906 propositions, using ASCII back-quote syntax. This works wherever
907 named facts used to be allowed so far, in proof commands, proof
908 methods, attributes etc. Literal facts are retrieved from the context
909 according to unification of type and term parameters. For example,
910 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
911 theorems in the current context, then these are valid literal facts:
912 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
914 There is also a proof method "fact" which does the same composition
915 for explicit goal states, e.g. the following proof texts coincide with
916 certain special cases of literal facts:
918 have "A" by fact == note `A`
919 have "A ==> B" by fact == note `A ==> B`
920 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
921 have "P a ==> Q a" by fact == note `P a ==> Q a`
923 * Isar: ":" (colon) is no longer a symbolic identifier character in
924 outer syntax. Thus symbolic identifiers may be used without
925 additional white space in declarations like this: ``assume *: A''.
927 * Isar: 'print_facts' prints all local facts of the current context,
928 both named and unnamed ones.
930 * Isar: 'def' now admits simultaneous definitions, e.g.:
932 def x == "t" and y == "u"
934 * Isar: added command 'unfolding', which is structurally similar to
935 'using', but affects both the goal state and facts by unfolding given
936 rewrite rules. Thus many occurrences of the 'unfold' method or
937 'unfolded' attribute may be replaced by first-class proof text.
939 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
940 and command 'unfolding' now all support object-level equalities
941 (potentially conditional). The underlying notion of rewrite rule is
942 analogous to the 'rule_format' attribute, but *not* that of the
943 Simplifier (which is usually more generous).
945 * Isar: the new attribute [rotated n] (default n = 1) rotates the
946 premises of a theorem by n. Useful in conjunction with drule.
948 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
949 method expression within a sandbox consisting of the first N
950 sub-goals, which need to exist. For example, ``simp_all [3]''
951 simplifies the first three sub-goals, while (rule foo, simp_all)[]
952 simplifies all new goals that emerge from applying rule foo to the
953 originally first one.
955 * Isar: schematic goals are no longer restricted to higher-order
956 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
959 * Isar: the conclusion of a long theorem statement is now either
960 'shows' (a simultaneous conjunction, as before), or 'obtains'
961 (essentially a disjunction of cases with local parameters and
962 assumptions). The latter allows to express general elimination rules
963 adequately; in this notation common elimination rules look like this:
965 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
967 obtains x where "P x"
969 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
973 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
979 The subsequent classical rules even refer to the formal "thesis"
982 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
985 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
986 obtains "thesis ==> something"
988 The actual proof of an 'obtains' statement is analogous to that of the
989 Isar proof element 'obtain', only that there may be several cases.
990 Optional case names may be specified in parentheses; these will be
991 available both in the present proof and as annotations in the
992 resulting rule, for later use with the 'cases' method (cf. attribute
995 * Isar: the assumptions of a long theorem statement are available as
996 "assms" fact in the proof context. This is more appropriate than the
997 (historical) "prems", which refers to all assumptions of the current
998 context, including those from the target locale, proof body etc.
1000 * Isar: 'print_statement' prints theorems from the current theory or
1001 proof context in long statement form, according to the syntax of a
1004 * Isar: 'obtain' takes an optional case name for the local context
1005 introduction rule (default "that").
1007 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1008 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1011 * Pure: syntax "CONST name" produces a fully internalized constant
1012 according to the current context. This is particularly useful for
1013 syntax translations that should refer to internal constant
1014 representations independently of name spaces.
1016 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1017 instead of "FOO ". This allows multiple binder declarations to coexist
1018 in the same context. INCOMPATIBILITY.
1020 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1021 primitive that also works in a locale context (both for constants and
1022 fixed variables). Type declaration and internal syntactic representation
1023 of given constants retrieved from the context. Likewise, the
1024 'no_notation' command allows to remove given syntax annotations from the
1027 * Isar/locales: new derived specification elements 'axiomatization',
1028 'definition', 'abbreviation', which support type-inference, admit
1029 object-level specifications (equality, equivalence). See also the
1030 isar-ref manual. Examples:
1033 eq (infix "===" 50) where
1034 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1036 definition "f x y = x + y + 1"
1037 definition g where "g x = f x x"
1040 neq (infix "=!=" 50) where
1041 "x =!= y == ~ (x === y)"
1043 These specifications may be also used in a locale context. Then the
1044 constants being introduced depend on certain fixed parameters, and the
1045 constant name is qualified by the locale base name. An internal
1046 abbreviation takes care for convenient input and output, making the
1047 parameters implicit and using the original short name. See also
1048 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1049 entities from a monomorphic theory.
1051 Presently, abbreviations are only available 'in' a target locale, but
1052 not inherited by general import expressions. Also note that
1053 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1054 'translations' in common applications. The "no_abbrevs" print mode
1055 prevents folding of abbreviations in term output.
1057 Concrete syntax is attached to specified constants in internal form,
1058 independently of name spaces. The parse tree representation is
1059 slightly different -- use 'notation' instead of raw 'syntax', and
1060 'translations' with explicit "CONST" markup to accommodate this.
1062 * Pure/Isar: unified syntax for new-style specification mechanisms
1063 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1064 full type inference and dummy patterns ("_"). For example:
1066 definition "K x _ = x"
1068 inductive conj for A B
1069 where "A ==> B ==> conj A B"
1071 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1072 the current context. Print mode "no_abbrevs" prevents inversion of
1073 abbreviations on output.
1075 * Isar/locales: improved parameter handling: use of locales "var" and
1076 "struct" no longer necessary; - parameter renamings are no longer
1077 required to be injective. For example, this allows to define
1078 endomorphisms as locale endom = homom mult mult h.
1080 * Isar/locales: changed the way locales with predicates are defined.
1081 Instead of accumulating the specification, the imported expression is
1082 now an interpretation. INCOMPATIBILITY: different normal form of
1083 locale expressions. In particular, in interpretations of locales with
1084 predicates, goals repesenting already interpreted fragments are not
1085 removed automatically. Use methods `intro_locales' and
1086 `unfold_locales'; see below.
1088 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1089 provide backward reasoning on locales predicates. The methods are
1090 aware of interpretations and discharge corresponding goals.
1091 `intro_locales' is less aggressive then `unfold_locales' and does not
1092 unfold predicates to assumptions.
1094 * Isar/locales: the order in which locale fragments are accumulated
1095 has changed. This enables to override declarations from fragments due
1096 to interpretations -- for example, unwanted simp rules.
1098 * Isar/locales: interpretation in theories and proof contexts has been
1099 extended. One may now specify (and prove) equations, which are
1100 unfolded in interpreted theorems. This is useful for replacing
1101 defined concepts (constants depending on locale parameters) by
1102 concepts already existing in the target context. Example:
1104 interpretation partial_order ["op <= :: [int, int] => bool"]
1105 where "partial_order.less (op <=) (x::int) y = (x < y)"
1107 Typically, the constant `partial_order.less' is created by a
1108 definition specification element in the context of locale
1111 * Method "induct": improved internal context management to support
1112 local fixes and defines on-the-fly. Thus explicit meta-level
1113 connectives !! and ==> are rarely required anymore in inductive goals
1114 (using object-logic connectives for this purpose has been long
1115 obsolete anyway). Common proof patterns are explained in
1116 src/HOL/Induct/Common_Patterns.thy, see also
1117 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1120 * Method "induct": improved handling of simultaneous goals. Instead of
1121 introducing object-level conjunction, the statement is now split into
1122 several conclusions, while the corresponding symbolic cases are nested
1123 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1124 see src/HOL/Induct/Common_Patterns.thy, for example.
1126 * Method "induct": mutual induction rules are now specified as a list
1127 of rule sharing the same induction cases. HOL packages usually provide
1128 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1129 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1130 mutual induction rules differently, i.e. like this:
1132 (induct rule: foo_bar.inducts)
1133 (induct set: foo bar)
1134 (induct pred: foo bar)
1135 (induct type: foo bar)
1137 The ML function ProjectRule.projections turns old-style rules into the
1140 * Method "coinduct": dual of induction, see
1141 src/HOL/Library/Coinductive_List.thy for various examples.
1143 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1144 considered a legacy feature.
1146 * Attribute "symmetric" produces result with standardized schematic
1147 variables (index 0). Potential INCOMPATIBILITY.
1149 * Simplifier: by default the simplifier trace only shows top level
1150 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1151 default. Thus there is less danger of being flooded by the trace. The
1152 trace indicates where parts have been suppressed.
1154 * Provers/classical: removed obsolete classical version of elim_format
1155 attribute; classical elim/dest rules are now treated uniformly when
1156 manipulating the claset.
1158 * Provers/classical: stricter checks to ensure that supplied intro,
1159 dest and elim rules are well-formed; dest and elim rules must have at
1162 * Provers/classical: attributes dest/elim/intro take an optional
1163 weight argument for the rule (just as the Pure versions). Weights are
1164 ignored by automated tools, but determine the search order of single
1167 * Syntax: input syntax now supports dummy variable binding "%_. b",
1168 where the body does not mention the bound variable. Note that dummy
1169 patterns implicitly depend on their context of bounds, which makes
1170 "{_. _}" match any set comprehension as expected. Potential
1171 INCOMPATIBILITY -- parse translations need to cope with syntactic
1172 constant "_idtdummy" in the binding position.
1174 * Syntax: removed obsolete syntactic constant "_K" and its associated
1175 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1176 for example "A -> B" => "Pi A (%_. B)".
1178 * Pure: 'class_deps' command visualizes the subclass relation, using
1179 the graph browser tool.
1181 * Pure: 'print_theory' now suppresses certain internal declarations by
1182 default; use '!' option for full details.
1187 * Method "metis" proves goals by applying the Metis general-purpose
1188 resolution prover (see also http://gilith.com/software/metis/).
1189 Examples are in the directory MetisExamples. WARNING: the
1190 Isabelle/HOL-Metis integration does not yet work properly with
1193 * Command 'sledgehammer' invokes external automatic theorem provers as
1194 background processes. It generates calls to the "metis" method if
1195 successful. These can be pasted into the proof. Users do not have to
1196 wait for the automatic provers to return. WARNING: does not really
1197 work with multi-threading.
1199 * New "auto_quickcheck" feature tests outermost goal statements for
1200 potential counter-examples. Controlled by ML references
1201 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1202 5000 milliseconds). Fails silently if statements is outside of
1203 executable fragment, or any other codgenerator problem occurs.
1205 * New constant "undefined" with axiom "undefined x = undefined".
1207 * Added class "HOL.eq", allowing for code generation with polymorphic
1210 * Some renaming of class constants due to canonical name prefixing in
1211 the new 'class' package:
1213 HOL.abs ~> HOL.abs_class.abs
1214 HOL.divide ~> HOL.divide_class.divide
1215 0 ~> HOL.zero_class.zero
1216 1 ~> HOL.one_class.one
1217 op + ~> HOL.plus_class.plus
1218 op - ~> HOL.minus_class.minus
1219 uminus ~> HOL.minus_class.uminus
1220 op * ~> HOL.times_class.times
1221 op < ~> HOL.ord_class.less
1222 op <= > HOL.ord_class.less_eq
1223 Nat.power ~> Power.power_class.power
1224 Nat.size ~> Nat.size_class.size
1225 Numeral.number_of ~> Numeral.number_class.number_of
1226 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1227 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1228 Orderings.min ~> Orderings.ord_class.min
1229 Orderings.max ~> Orderings.ord_class.max
1230 Divides.op div ~> Divides.div_class.div
1231 Divides.op mod ~> Divides.div_class.mod
1232 Divides.op dvd ~> Divides.div_class.dvd
1234 INCOMPATIBILITY. Adaptions may be required in the following cases:
1236 a) User-defined constants using any of the names "plus", "minus",
1237 "times", "less" or "less_eq". The standard syntax translations for
1238 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1241 b) Variables named "plus", "minus", "times", "less", "less_eq"
1242 INCOMPATIBILITY: use more specific names.
1244 c) Permutative equations (e.g. "a + b = b + a")
1245 Since the change of names also changes the order of terms, permutative
1246 rewrite rules may get applied in a different order. Experience shows
1247 that this is rarely the case (only two adaptions in the whole Isabelle
1248 distribution). INCOMPATIBILITY: rewrite proofs
1250 d) ML code directly refering to constant names
1251 This in general only affects hand-written proof tactics, simprocs and
1252 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1253 Consider using @{const_name} antiquotation.
1255 * New class "default" with associated constant "default".
1257 * Function "sgn" is now overloaded and available on int, real, complex
1258 (and other numeric types), using class "sgn". Two possible defs of
1259 sgn are given as equational assumptions in the classes sgn_if and
1260 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1263 * Locale "partial_order" now unified with class "order" (cf. theory
1264 Orderings), added parameter "less". INCOMPATIBILITY.
1266 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1267 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1268 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1270 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1271 changed order of proof goals in instance proofs.
1273 * The transitivity reasoner for partial and linear orders is set up
1274 for classes "order" and "linorder". Instances of the reasoner are available
1275 in all contexts importing or interpreting the corresponding locales.
1276 Method "order" invokes the reasoner separately; the reasoner
1277 is also integrated with the Simplifier as a solver. Diagnostic
1278 command 'print_orders' shows the available instances of the reasoner
1279 in the current context.
1281 * Localized monotonicity predicate in theory "Orderings"; integrated
1282 lemmas max_of_mono and min_of_mono with this predicate.
1285 * Formulation of theorem "dense" changed slightly due to integration
1286 with new class dense_linear_order.
1288 * Uniform lattice theory development in HOL.
1290 constants "meet" and "join" now named "inf" and "sup"
1291 constant "Meet" now named "Inf"
1293 classes "meet_semilorder" and "join_semilorder" now named
1294 "lower_semilattice" and "upper_semilattice"
1295 class "lorder" now named "lattice"
1296 class "comp_lat" now named "complete_lattice"
1298 Instantiation of lattice classes allows explicit definitions
1299 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1301 INCOMPATIBILITY. Theorem renames:
1303 meet_left_le ~> inf_le1
1304 meet_right_le ~> inf_le2
1305 join_left_le ~> sup_ge1
1306 join_right_le ~> sup_ge2
1307 meet_join_le ~> inf_sup_ord
1310 le_meet ~> le_inf_iff
1311 le_join ~> ge_sup_conv
1312 meet_idempotent ~> inf_idem
1313 join_idempotent ~> sup_idem
1314 meet_comm ~> inf_commute
1315 join_comm ~> sup_commute
1316 meet_leI1 ~> le_infI1
1317 meet_leI2 ~> le_infI2
1318 le_joinI1 ~> le_supI1
1319 le_joinI2 ~> le_supI2
1320 meet_assoc ~> inf_assoc
1321 join_assoc ~> sup_assoc
1322 meet_left_comm ~> inf_left_commute
1323 meet_left_idempotent ~> inf_left_idem
1324 join_left_comm ~> sup_left_commute
1325 join_left_idempotent ~> sup_left_idem
1328 le_def_meet ~> le_iff_inf
1329 le_def_join ~> le_iff_sup
1330 join_absorp2 ~> sup_absorb2
1331 join_absorp1 ~> sup_absorb1
1332 meet_absorp1 ~> inf_absorb1
1333 meet_absorp2 ~> inf_absorb2
1334 meet_join_absorp ~> inf_sup_absorb
1335 join_meet_absorp ~> sup_inf_absorb
1336 distrib_join_le ~> distrib_sup_le
1337 distrib_meet_le ~> distrib_inf_le
1339 add_meet_distrib_left ~> add_inf_distrib_left
1340 add_join_distrib_left ~> add_sup_distrib_left
1341 is_join_neg_meet ~> is_join_neg_inf
1342 is_meet_neg_join ~> is_meet_neg_sup
1343 add_meet_distrib_right ~> add_inf_distrib_right
1344 add_join_distrib_right ~> add_sup_distrib_right
1345 add_meet_join_distribs ~> add_sup_inf_distribs
1346 join_eq_neg_meet ~> sup_eq_neg_inf
1347 meet_eq_neg_join ~> inf_eq_neg_sup
1348 add_eq_meet_join ~> add_eq_inf_sup
1349 meet_0_imp_0 ~> inf_0_imp_0
1350 join_0_imp_0 ~> sup_0_imp_0
1351 meet_0_eq_0 ~> inf_0_eq_0
1352 join_0_eq_0 ~> sup_0_eq_0
1353 neg_meet_eq_join ~> neg_inf_eq_sup
1354 neg_join_eq_meet ~> neg_sup_eq_inf
1355 join_eq_if ~> sup_eq_if
1357 mono_meet ~> mono_inf
1358 mono_join ~> mono_sup
1359 meet_bool_eq ~> inf_bool_eq
1360 join_bool_eq ~> sup_bool_eq
1361 meet_fun_eq ~> inf_fun_eq
1362 join_fun_eq ~> sup_fun_eq
1363 meet_set_eq ~> inf_set_eq
1364 join_set_eq ~> sup_set_eq
1365 meet1_iff ~> inf1_iff
1366 meet2_iff ~> inf2_iff
1375 join1_iff ~> sup1_iff
1376 join2_iff ~> sup2_iff
1386 is_meet_Meet ~> is_meet_Inf
1387 Meet_bool_def ~> Inf_bool_def
1388 Meet_fun_def ~> Inf_fun_def
1389 Meet_greatest ~> Inf_greatest
1390 Meet_lower ~> Inf_lower
1391 Meet_set_def ~> Inf_set_def
1394 Sup_bool_eq ~> Sup_bool_def
1395 Sup_fun_eq ~> Sup_fun_def
1396 Sup_set_eq ~> Sup_set_def
1398 listsp_meetI ~> listsp_infI
1399 listsp_meet_eq ~> listsp_inf_eq
1404 * Added syntactic class "size"; overloaded constant "size" now has
1405 type "'a::size ==> bool"
1407 * Internal reorganisation of `size' of datatypes: size theorems
1408 "foo.size" are no longer subsumed by "foo.simps" (but are still
1409 simplification rules by default!); theorems "prod.size" now named
1412 * Class "div" now inherits from class "times" rather than "type".
1415 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1416 Linorder etc. have disappeared; operations defined in terms of
1417 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1419 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1421 * HOL-Word: New extensive library and type for generic, fixed size
1422 machine words, with arithemtic, bit-wise, shifting and rotating
1423 operations, reflection into int, nat, and bool lists, automation for
1424 linear arithmetic (by automatic reflection into nat or int), including
1425 lemmas on overflow and monotonicity. Instantiated to all appropriate
1426 arithmetic type classes, supporting automatic simplification of
1427 numerals on all operations.
1429 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1431 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1433 * Code generator library theories:
1434 - Code_Integer represents HOL integers by big integer literals in target
1436 - Code_Char represents HOL characters by character literals in target
1438 - Code_Char_chr like Code_Char, but also offers treatment of character
1439 codes; includes Code_Integer.
1440 - Executable_Set allows to generate code for finite sets using lists.
1441 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1443 - Executable_Real implements a subset of real numbers, namly those
1444 representable by rational numbers.
1445 - Efficient_Nat implements natural numbers by integers, which in general will
1446 result in higher efficency; pattern matching with 0/Suc is eliminated;
1447 includes Code_Integer.
1448 - Code_Index provides an additional datatype index which is mapped to
1449 target-language built-in integers.
1450 - Code_Message provides an additional datatype message_string which is isomorphic to
1451 strings; messages are mapped to target-language strings.
1453 * New package for inductive predicates
1455 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1458 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1459 for z_1 :: U_1 and ... and z_n :: U_m
1461 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1464 with full support for type-inference, rather than
1466 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1468 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1469 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1471 inductive "s z_1 ... z_m"
1473 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1476 For backward compatibility, there is a wrapper allowing inductive
1477 sets to be defined with the new package via
1480 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1481 for z_1 :: U_1 and ... and z_n :: U_m
1483 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1489 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1490 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1491 for z_1 :: U_1 and ... and z_n :: U_m
1493 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1494 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1497 if the additional syntax "p ..." is required.
1499 Numerous examples can be found in the subdirectories src/HOL/Auth,
1500 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1504 - Since declaration and definition of inductive sets or predicates
1505 is no longer separated, abbreviations involving the newly
1506 introduced sets or predicates must be specified together with the
1507 introduction rules after the 'where' keyword (see above), rather
1508 than before the actual inductive definition.
1510 - The variables in induction and elimination rules are now
1511 quantified in the order of their occurrence in the introduction
1512 rules, rather than in alphabetical order. Since this may break
1513 some proofs, these proofs either have to be repaired, e.g. by
1514 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1515 statements of the form
1517 case (rule_i a_i_1 ... a_i_{k_i})
1519 or the old order of quantification has to be restored by explicitly adding
1520 meta-level quantifiers in the introduction rules, i.e.
1522 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1524 - The format of the elimination rules is now
1526 p z_1 ... z_m x_1 ... x_n ==>
1527 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1532 (x_1, ..., x_n) : s z_1 ... z_m ==>
1533 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1536 for sets rather than
1538 x : s z_1 ... z_m ==>
1539 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1542 This may require terms in goals to be expanded to n-tuples
1543 (e.g. using case_tac or simplification with the split_paired_all
1544 rule) before the above elimination rule is applicable.
1546 - The elimination or case analysis rules for (mutually) inductive
1547 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1548 list of rules "p_1_..._p_k.elims" is no longer available.
1550 * New package "function"/"fun" for general recursive functions,
1551 supporting mutual and nested recursion, definitions in local contexts,
1552 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1553 for small examples, and the separate tutorial on the function
1554 package. The old recdef "package" is still available as before, but
1555 users are encouraged to use the new package.
1557 * Method "lexicographic_order" automatically synthesizes termination
1558 relations as lexicographic combinations of size measures.
1560 * Case-expressions allow arbitrary constructor-patterns (including
1561 "_") and take their order into account, like in functional
1562 programming. Internally, this is translated into nested
1563 case-expressions; missing cases are added and mapped to the predefined
1564 constant "undefined". In complicated cases printing may no longer show
1565 the original input but the internal form. Lambda-abstractions allow
1566 the same form of pattern matching: "% pat1 => e1 | ..." is an
1567 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1570 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1571 is an abbreviation for "of_nat :: nat => int". The simplification
1572 rules for "of_nat" have been changed to work like "int" did
1573 previously. Potential INCOMPATIBILITY:
1574 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1575 - of_nat_diff and of_nat_mult are no longer default simp rules
1577 * Method "algebra" solves polynomial equations over (semi)rings using
1578 Groebner bases. The (semi)ring structure is defined by locales and the
1579 tool setup depends on that generic context. Installing the method for
1580 a specific type involves instantiating the locale and possibly adding
1581 declarations for computation on the coefficients. The method is
1582 already instantiated for natural numbers and for the axiomatic class
1583 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1584 CALCULEMUS 2007 for the general principles underlying this
1585 architecture of context-aware proof-tools.
1587 * Method "ferrack" implements quantifier elimination over
1588 special-purpose dense linear orders using locales (analogous to
1589 "algebra"). The method is already installed for class
1590 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1593 * Former constant "List.op @" now named "List.append". Use ML
1594 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1595 circumvent possible incompatibilities when working on ML level.
1597 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1599 * New function listsum :: 'a list => 'a for arbitrary monoids.
1600 Special syntax: "SUM x <- xs. f x" (and latex variants)
1602 * New syntax for Haskell-like list comprehension (input only), eg.
1603 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1605 * The special syntax for function "filter" has changed from [x :
1606 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1607 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1609 * [a..b] is now defined for arbitrary linear orders. It used to be
1610 defined on nat only, as an abbreviation for [a..<Suc b]
1613 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1615 * New functions "sorted" and "sort" in src/HOL/List.thy.
1617 * New lemma collection field_simps (an extension of ring_simps) for
1618 manipulating (in)equations involving division. Multiplies with all
1619 denominators that can be proved to be non-zero (in equations) or
1620 positive/negative (in inequations).
1622 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1623 have been improved and renamed to ring_simps, group_simps and
1624 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1625 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1627 * Theory Library/Commutative_Ring: switched from recdef to function
1628 package; constants add, mul, pow now curried. Infix syntax for
1629 algebraic operations.
1631 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1634 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1637 * HOL/records: generalised field-update to take a function on the
1638 field rather than the new value: r(|A := x|) is translated to A_update
1639 (K x) r The K-combinator that is internally used is called K_record.
1640 INCOMPATIBILITY: Usage of the plain update functions has to be
1643 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1644 * x = 0, which are required for a semiring. Richer structures do not
1645 inherit from semiring_0 anymore, because this property is a theorem
1646 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1647 there is more to prove, but this is mostly trivial.
1649 * Class "recpower" is generalized to arbitrary monoids, not just
1650 commutative semirings. INCOMPATIBILITY: may need to incorporate
1651 commutativity or semiring properties additionally.
1653 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1654 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1655 better use 'abbreviation'.
1657 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1659 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1660 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1661 significant changes for setting up numeral syntax for types:
1662 - New constants Numeral.pred and Numeral.succ instead
1663 of former Numeral.bin_pred and Numeral.bin_succ.
1664 - Use integer operations instead of bin_add, bin_mult and so on.
1665 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1666 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1668 See src/HOL/Integ/IntArith.thy for an example setup.
1670 * Command 'normal_form' computes the normal form of a term that may
1671 contain free variables. For example ``normal_form "rev [a, b, c]"''
1672 produces ``[b, c, a]'' (without proof). This command is suitable for
1673 heavy-duty computations because the functions are compiled to ML
1674 first. Correspondingly, a method "normalization" is provided. See
1675 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1677 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1678 25 like -->); output depends on the "iff" print_mode, the default is
1679 "A = B" (with priority 50).
1681 * Relations less (<) and less_eq (<=) are also available on type bool.
1682 Modified syntax to disallow nesting without explicit parentheses,
1683 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1686 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1688 * Relation composition operator "op O" now has precedence 75 and binds
1689 stronger than union and intersection. INCOMPATIBILITY.
1691 * The old set interval syntax "{m..n(}" (and relatives) has been
1692 removed. Use "{m..<n}" (and relatives) instead.
1694 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1695 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1696 ``declare [[simproc del: neq]]''.
1698 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1701 * Theorem Cons_eq_map_conv no longer declared as "simp".
1703 * Theorem setsum_mult renamed to setsum_right_distrib.
1705 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1708 * Reimplemented methods "sat" and "satx", with several improvements:
1709 goals no longer need to be stated as "<prems> ==> False", equivalences
1710 (i.e. "=" on type bool) are handled, variable names of the form
1711 "lit_<n>" are no longer reserved, significant speedup.
1713 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1714 zChaff is still supported as well.
1716 * 'inductive' and 'datatype': provide projections of mutual rules,
1717 bundled as foo_bar.inducts;
1719 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1722 * Library: moved theory Accessible_Part to main HOL.
1724 * Library: added theory Coinductive_List of potentially infinite lists
1725 as greatest fixed-point.
1727 * Library: added theory AssocList which implements (finite) maps as
1730 * Method "evaluation" solves goals (i.e. a boolean expression)
1731 efficiently by compiling it to ML. The goal is "proved" (via an
1732 oracle) if it evaluates to True.
1734 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1735 also when invoked by the simplifier. This results in the Simplifier
1736 being more powerful on arithmetic goals. INCOMPATIBILITY.
1737 Configuration option fast_arith_split_limit=0 recovers the old
1740 * Support for hex (0x20) and binary (0b1001) numerals.
1742 * New method: reify eqs (t), where eqs are equations for an
1743 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1744 parameter, computes a term s::'b and a list xs::'a list and proves the
1745 theorem I xs s = t. This is also known as reification or quoting. The
1746 resulting theorem is applied to the subgoal to substitute t with I xs
1747 s. If t is omitted, the subgoal itself is reified.
1749 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1750 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1751 where f is supposed to be a computable function (in the sense of code
1752 generattion). The method uses reify to compute s and xs as above then
1753 applies corr_thm and uses normalization by evaluation to "prove" f s =
1754 r and finally gets the theorem t = r, which is again applied to the
1755 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1757 * Reflection: Automatic reification now handels binding, an example is
1758 available in src/HOL/ex/ReflectionEx.thy
1760 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1761 command 'statespace' that is similar to 'record', but introduces an
1762 abstract specification based on the locale infrastructure instead of
1763 HOL types. This leads to extra flexibility in composing state spaces,
1764 in particular multiple inheritance and renaming of components.
1769 * Hyperreal: Functions root and sqrt are now defined on negative real
1770 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1771 Nonnegativity side conditions have been removed from many lemmas, so
1772 that more subgoals may now be solved by simplification; potential
1775 * Real: new type classes formalize real normed vector spaces and
1776 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1777 and norm :: 'a => real.
1779 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1780 reals into other types. The overloaded constant Reals :: 'a set is now
1781 defined as range of_real; potential INCOMPATIBILITY.
1783 * Real: proper support for ML code generation, including 'quickcheck'.
1784 Reals are implemented as arbitrary precision rationals.
1786 * Hyperreal: Several constants that previously worked only for the
1787 reals have been generalized, so they now work over arbitrary vector
1788 spaces. Type annotations may need to be added in some cases; potential
1791 Infinitesimal :: ('a::real_normed_vector) star set
1792 HFinite :: ('a::real_normed_vector) star set
1793 HInfinite :: ('a::real_normed_vector) star set
1794 approx :: ('a::real_normed_vector) star => 'a star => bool
1795 monad :: ('a::real_normed_vector) star => 'a star set
1796 galaxy :: ('a::real_normed_vector) star => 'a star set
1797 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1798 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1799 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1800 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1801 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
1802 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
1803 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
1804 sgn :: 'a::real_normed_vector => 'a
1805 exp :: 'a::{recpower,real_normed_field,banach} => 'a
1807 * Complex: Some complex-specific constants are now abbreviations for
1808 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
1809 hnorm. Other constants have been entirely removed in favor of the
1810 polymorphic versions (INCOMPATIBILITY):
1814 HInfinite <-- CInfinite
1815 Infinitesimal <-- CInfinitesimal
1818 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
1819 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
1820 (ns)deriv <-- (ns)cderiv
1825 * Formalisation of ideals and the quotient construction over rings.
1827 * Order and lattice theory no longer based on records.
1830 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
1831 greatest_closed. INCOMPATIBILITY.
1833 * Method algebra is now set up via an attribute. For examples see
1834 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
1835 of algebraic structures.
1837 * Renamed theory CRing to Ring.
1842 * Substantial, yet incomplete support for nominal datatypes (binding
1843 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
1844 src/HOL/Nominal/Examples. Prospective users should consult
1845 http://isabelle.in.tum.de/nominal/
1850 * ML basics: just one true type int, which coincides with IntInf.int
1853 * ML within Isar: antiquotations allow to embed statically-checked
1854 formal entities in the source, referring to the context available at
1855 compile-time. For example:
1857 ML {* @{sort "{zero,one}"} *}
1858 ML {* @{typ "'a => 'b"} *}
1859 ML {* @{term "%x. x"} *}
1860 ML {* @{prop "x == y"} *}
1861 ML {* @{ctyp "'a => 'b"} *}
1862 ML {* @{cterm "%x. x"} *}
1863 ML {* @{cprop "x == y"} *}
1864 ML {* @{thm asm_rl} *}
1865 ML {* @{thms asm_rl} *}
1866 ML {* @{type_name c} *}
1867 ML {* @{type_syntax c} *}
1868 ML {* @{const_name c} *}
1869 ML {* @{const_syntax c} *}
1872 ML {* @{theory Pure} *}
1873 ML {* @{theory_ref} *}
1874 ML {* @{theory_ref Pure} *}
1877 ML {* @{clasimpset} *}
1879 The same works for sources being ``used'' within an Isar context.
1881 * ML in Isar: improved error reporting; extra verbosity with
1882 ML_Context.trace enabled.
1884 * Pure/General/table.ML: the join operations now works via exceptions
1885 DUP/SAME instead of type option. This is simpler in simple cases, and
1886 admits slightly more efficient complex applications.
1888 * Pure: 'advanced' translation functions (parse_translation etc.) now
1889 use Context.generic instead of just theory.
1891 * Pure: datatype Context.generic joins theory/Proof.context and
1892 provides some facilities for code that works in either kind of
1893 context, notably GenericDataFun for uniform theory and proof data.
1895 * Pure: simplified internal attribute type, which is now always
1896 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
1897 local (Proof.context) attributes have been discontinued, while
1898 minimizing code duplication. Thm.rule_attribute and
1899 Thm.declaration_attribute build canonical attributes; see also structure
1900 Context for further operations on Context.generic, notably
1901 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
1902 declarations and definitions.
1904 * Context data interfaces (Theory/Proof/GenericDataFun): removed
1905 name/print, uninitialized data defaults to ad-hoc copy of empty value,
1906 init only required for impure data. INCOMPATIBILITY: empty really need
1907 to be empty (no dependencies on theory content!)
1909 * Pure/kernel: consts certification ignores sort constraints given in
1910 signature declarations. (This information is not relevant to the
1911 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
1912 potential INCOMPATIBILITY.
1914 * Pure: axiomatic type classes are now purely definitional, with
1915 explicit proofs of class axioms and super class relations performed
1916 internally. See Pure/axclass.ML for the main internal interfaces --
1917 notably AxClass.define_class supercedes AxClass.add_axclass, and
1918 AxClass.axiomatize_class/classrel/arity supersede
1919 Sign.add_classes/classrel/arities.
1921 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
1922 global/local versions on theory vs. Proof.context have been
1923 discontinued; Attrib.syntax and Method.syntax have been adapted
1924 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
1925 attributes, methods, etc.
1927 * Pure: several functions of signature "... -> theory -> theory * ..."
1928 have been reoriented to "... -> theory -> ... * theory" in order to
1929 allow natural usage in combination with the ||>, ||>>, |-> and
1930 fold_map combinators.
1932 * Pure: official theorem names (closed derivations) and additional
1933 comments (tags) are now strictly separate. Name hints -- which are
1934 maintained as tags -- may be attached any time without affecting the
1937 * Pure: primitive rule lift_rule now takes goal cterm instead of an
1938 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
1939 achieve the old behaviour.
1941 * Pure: the "Goal" constant is now called "prop", supporting a
1942 slightly more general idea of ``protecting'' meta-level rule
1945 * Pure: Logic.(un)varify only works in a global context, which is now
1946 enforced instead of silently assumed. INCOMPATIBILITY, may use
1947 Logic.legacy_(un)varify as temporary workaround.
1949 * Pure: structure Name provides scalable operations for generating
1950 internal variable names, notably Name.variants etc. This replaces
1951 some popular functions from term.ML:
1953 Term.variant -> Name.variant
1954 Term.variantlist -> Name.variant_list
1955 Term.invent_names -> Name.invent_list
1957 Note that low-level renaming rarely occurs in new code -- operations
1958 from structure Variable are used instead (see below).
1960 * Pure: structure Variable provides fundamental operations for proper
1961 treatment of fixed/schematic variables in a context. For example,
1962 Variable.import introduces fixes for schematics of given facts and
1963 Variable.export reverses the effect (up to renaming) -- this replaces
1964 various freeze_thaw operations.
1966 * Pure: structure Goal provides simple interfaces for
1967 init/conclude/finish and tactical prove operations (replacing former
1968 Tactic.prove). Goal.prove is the canonical way to prove results
1969 within a given context; Goal.prove_global is a degraded version for
1970 theory level goals, including a global Drule.standard. Note that
1971 OldGoals.prove_goalw_cterm has long been obsolete, since it is
1972 ill-behaved in a local proof context (e.g. with local fixes/assumes or
1973 in a locale context).
1975 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
1976 and type checking (Syntax.check_term etc.), with common combinations
1977 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
1978 which are considered legacy and await removal.
1980 * Pure/Syntax: generic interfaces for type unchecking
1981 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
1982 with common combinations (Syntax.pretty_term, Syntax.string_of_term
1983 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
1984 available for convenience, but refer to the very same operations using
1985 a mere theory instead of a full context.
1987 * Isar: simplified treatment of user-level errors, using exception
1988 ERROR of string uniformly. Function error now merely raises ERROR,
1989 without any side effect on output channels. The Isar toplevel takes
1990 care of proper display of ERROR exceptions. ML code may use plain
1991 handle/can/try; cat_error may be used to concatenate errors like this:
1993 ... handle ERROR msg => cat_error msg "..."
1995 Toplevel ML code (run directly or through the Isar toplevel) may be
1996 embedded into the Isar toplevel with exception display/debug like
1999 Isar.toplevel (fn () => ...)
2001 INCOMPATIBILITY, removed special transform_error facilities, removed
2002 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2003 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2004 -- use plain ERROR instead.
2006 * Isar: theory setup now has type (theory -> theory), instead of a
2007 list. INCOMPATIBILITY, may use #> to compose setup functions.
2009 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2010 ProofContext.debug/verbose flags.
2012 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2013 theory before entering a proof state. Transactions now always see a
2014 quasi-functional intermediate checkpoint, both in interactive and
2017 * Isar: simplified interfaces for outer syntax. Renamed
2018 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2019 OuterSyntax.add_parsers -- this functionality is now included in
2020 OuterSyntax.command etc. INCOMPATIBILITY.
2022 * Simplifier: the simpset of a running simplification process now
2023 contains a proof context (cf. Simplifier.the_context), which is the
2024 very context that the initial simpset has been retrieved from (by
2025 simpset_of/local_simpset_of). Consequently, all plug-in components
2026 (solver, looper etc.) may depend on arbitrary proof data.
2028 * Simplifier.inherit_context inherits the proof context (plus the
2029 local bounds) of the current simplification process; any simproc
2030 etc. that calls the Simplifier recursively should do this! Removed
2031 former Simplifier.inherit_bounds, which is already included here --
2032 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2033 specify an explicit context using Simplifier.context/theory_context.
2035 * Simplifier/Classical Reasoner: more abstract interfaces
2036 change_simpset/claset for modifying the simpset/claset reference of a
2037 theory; raw versions simpset/claset_ref etc. have been discontinued --
2040 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2046 * settings: the default heap location within ISABELLE_HOME_USER now
2047 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2048 Isabelle installations.
2050 * isabelle-process: option -S (secure mode) disables some critical
2051 operations, notably runtime compilation and evaluation of ML source
2054 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2056 * Support for parallel execution, using native multicore support of
2057 Poly/ML 5.1. The theory loader exploits parallelism when processing
2058 independent theories, according to the given theory header
2059 specifications. The maximum number of worker threads is specified via
2060 usedir option -M or the "max-threads" setting in Proof General. A
2061 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2062 to 6 on a 8-core machine. User-code needs to observe certain
2063 guidelines for thread-safe programming, see appendix A in the Isar
2064 Implementation manual.
2068 New in Isabelle2005 (October 2005)
2069 ----------------------------------
2073 * Theory headers: the new header syntax for Isar theories is
2076 imports <theory1> ... <theoryN>
2077 uses <file1> ... <fileM>
2080 where the 'uses' part is optional. The previous syntax
2082 theory <name> = <theory1> + ... + <theoryN>:
2084 will disappear in the next release. Use isatool fixheaders to convert
2085 existing theory files. Note that there is no change in ancient
2086 non-Isar theories now, but these will disappear soon.
2088 * Theory loader: parent theories can now also be referred to via
2089 relative and absolute paths.
2091 * Command 'find_theorems' searches for a list of criteria instead of a
2092 list of constants. Known criteria are: intro, elim, dest, name:string,
2093 simp:term, and any term. Criteria can be preceded by '-' to select
2094 theorems that do not match. Intro, elim, dest select theorems that
2095 match the current goal, name:s selects theorems whose fully qualified
2096 name contain s, and simp:term selects all simplification rules whose
2097 lhs match term. Any other term is interpreted as pattern and selects
2098 all theorems matching the pattern. Available in ProofGeneral under
2099 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2101 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2103 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2104 matching the current goal as introduction rule and not having "HOL."
2105 in their name (i.e. not being defined in theory HOL).
2107 * Command 'thms_containing' has been discontinued in favour of
2108 'find_theorems'; INCOMPATIBILITY.
2110 * Communication with Proof General is now 8bit clean, which means that
2111 Unicode text in UTF-8 encoding may be used within theory texts (both
2112 formal and informal parts). Cf. option -U of the Isabelle Proof
2113 General interface. Here are some simple examples (cf. src/HOL/ex):
2115 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2116 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2118 * Improved efficiency of the Simplifier and, to a lesser degree, the
2119 Classical Reasoner. Typical big applications run around 2 times
2123 *** Document preparation ***
2125 * Commands 'display_drafts' and 'print_drafts' perform simple output
2126 of raw sources. Only those symbols that do not require additional
2127 LaTeX packages (depending on comments in isabellesym.sty) are
2128 displayed properly, everything else is left verbatim. isatool display
2129 and isatool print are used as front ends (these are subject to the
2130 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2132 * Command tags control specific markup of certain regions of text,
2133 notably folding and hiding. Predefined tags include "theory" (for
2134 theory begin and end), "proof" for proof commands, and "ML" for
2135 commands involving ML code; the additional tags "visible" and
2136 "invisible" are unused by default. Users may give explicit tag
2137 specifications in the text, e.g. ''by %invisible (auto)''. The
2138 interpretation of tags is determined by the LaTeX job during document
2139 preparation: see option -V of isatool usedir, or options -n and -t of
2140 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2143 Several document versions may be produced at the same time via isatool
2144 usedir (the generated index.html will link all of them). Typical
2145 specifications include ''-V document=theory,proof,ML'' to present
2146 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2147 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2148 these parts without any formal replacement text. The Isabelle site
2149 default settings produce ''document'' and ''outline'' versions as
2152 * Several new antiquotations:
2154 @{term_type term} prints a term with its type annotated;
2156 @{typeof term} prints the type of a term;
2158 @{const const} is the same as @{term const}, but checks that the
2159 argument is a known logical constant;
2161 @{term_style style term} and @{thm_style style thm} print a term or
2162 theorem applying a "style" to it
2166 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2167 definitions, equations, inequations etc., 'concl' printing only the
2168 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2169 to print the specified premise. TermStyle.add_style provides an ML
2170 interface for introducing further styles. See also the "LaTeX Sugar"
2171 document practical applications. The ML antiquotation prints
2172 type-checked ML expressions verbatim.
2174 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2175 and 'text' support optional locale specification '(in loc)', which
2176 specifies the default context for interpreting antiquotations. For
2177 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2179 * Option 'locale=NAME' of antiquotations specifies an alternative
2180 context interpreting the subsequent argument. For example: @{thm
2181 [locale=lattice] inf_assoc}.
2183 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2186 * Proper output of antiquotations for theory commands involving a
2187 proof context (such as 'locale' or 'theorem (in loc) ...').
2189 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2190 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2192 * isatool usedir: new option -C (default true) controls whether option
2193 -D should include a copy of the original document directory; -C false
2194 prevents unwanted effects such as copying of administrative CVS data.
2199 * Considerably improved version of 'constdefs' command. Now performs
2200 automatic type-inference of declared constants; additional support for
2201 local structure declarations (cf. locales and HOL records), see also
2202 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2203 sequential dependencies of definitions within a single 'constdefs'
2204 section; moreover, the declared name needs to be an identifier. If
2205 all fails, consider to fall back on 'consts' and 'defs' separately.
2207 * Improved indexed syntax and implicit structures. First of all,
2208 indexed syntax provides a notational device for subscripted
2209 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2210 expressions. Secondly, in a local context with structure
2211 declarations, number indexes \<^sub>n or the empty index (default
2212 number 1) refer to a certain fixed variable implicitly; option
2213 show_structs controls printing of implicit structures. Typical
2214 applications of these concepts involve record types and locales.
2216 * New command 'no_syntax' removes grammar declarations (and
2217 translations) resulting from the given syntax specification, which is
2218 interpreted in the same manner as for the 'syntax' command.
2220 * 'Advanced' translation functions (parse_translation etc.) may depend
2221 on the signature of the theory context being presently used for
2222 parsing/printing, see also isar-ref manual.
2224 * Improved 'oracle' command provides a type-safe interface to turn an
2225 ML expression of type theory -> T -> term into a primitive rule of
2226 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2227 is already included here); see also FOL/ex/IffExample.thy;
2230 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2231 before); "cI" is no longer bound, use "c.intro" instead.
2232 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2233 axclasses vs. locales.
2235 * Improved internal renaming of symbolic identifiers -- attach primes
2236 instead of base 26 numbers.
2238 * New flag show_question_marks controls printing of leading question
2239 marks in schematic variable names.
2241 * In schematic variable names, *any* symbol following \<^isub> or
2242 \<^isup> is now treated as part of the base name. For example, the
2243 following works without printing of awkward ".0" indexes:
2245 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2248 * Inner syntax includes (*(*nested*) comments*).
2250 * Pretty printer now supports unbreakable blocks, specified in mixfix
2251 annotations as "(00...)".
2253 * Clear separation of logical types and nonterminals, where the latter
2254 may only occur in 'syntax' specifications or type abbreviations.
2255 Before that distinction was only partially implemented via type class
2256 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2257 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2258 exotic syntax specifications may require further adaption
2259 (e.g. Cube/Cube.thy).
2261 * Removed obsolete type class "logic", use the top sort {} instead.
2262 Note that non-logical types should be declared as 'nonterminals'
2263 rather than 'types'. INCOMPATIBILITY for new object-logic
2266 * Attributes 'induct' and 'cases': type or set names may now be
2267 locally fixed variables as well.
2269 * Simplifier: can now control the depth to which conditional rewriting
2270 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2273 * Simplifier: simplification procedures may now take the current
2274 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2275 interface), which is very useful for calling the Simplifier
2276 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2277 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2278 low-level mk_simproc no longer applies Logic.varify internally, to
2279 allow for use in a context of fixed variables.
2281 * thin_tac now works even if the assumption being deleted contains !!
2282 or ==>. More generally, erule now works even if the major premise of
2283 the elimination rule contains !! or ==>.
2285 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2287 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2288 from Pure, which contains all common declarations already. Both
2289 theories are defined via plain Isabelle/Isar .thy files.
2290 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2291 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2292 use isatool fixcpure to adapt your theory and ML sources.
2294 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2295 selections of theorems in named facts via index ranges.
2297 * 'print_theorems': in theory mode, really print the difference
2298 wrt. the last state (works for interactive theory development only),
2299 in proof mode print all local facts (cf. 'print_facts');
2301 * 'hide': option '(open)' hides only base names.
2303 * More efficient treatment of intermediate checkpoints in interactive
2306 * Code generator is now invoked via code_module (incremental code
2307 generation) and code_library (modular code generation, ML structures
2308 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2309 must be quoted when used as identifiers.
2311 * New 'value' command for reading, evaluating and printing terms using
2312 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2313 quoted when used as identifier.
2318 * New commands for the interpretation of locale expressions in
2319 theories (1), locales (2) and proof contexts (3). These generate
2320 proof obligations from the expression specification. After the
2321 obligations have been discharged, theorems of the expression are added
2322 to the theory, target locale or proof context. The synopsis of the
2323 commands is a follows:
2325 (1) interpretation expr inst
2326 (2) interpretation target < expr
2327 (3) interpret expr inst
2329 Interpretation in theories and proof contexts require a parameter
2330 instantiation of terms from the current context. This is applied to
2331 specifications and theorems of the interpreted expression.
2332 Interpretation in locales only permits parameter renaming through the
2333 locale expression. Interpretation is smart in that interpretations
2334 that are active already do not occur in proof obligations, neither are
2335 instantiated theorems stored in duplicate. Use 'print_interps' to
2336 inspect active interpretations of a particular locale. For details,
2337 see the Isar Reference manual. Examples can be found in
2338 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2340 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2341 'interpret' instead.
2343 * New context element 'constrains' for adding type constraints to
2346 * Context expressions: renaming of parameters with syntax
2349 * Locale declaration: 'includes' disallowed.
2351 * Proper static binding of attribute syntax -- i.e. types / terms /
2352 facts mentioned as arguments are always those of the locale definition
2353 context, independently of the context of later invocations. Moreover,
2354 locale operations (renaming and type / term instantiation) are applied
2355 to attribute arguments as expected.
2357 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2358 actual attributes; rare situations may require Attrib.attribute to
2359 embed those attributes into Attrib.src that lack concrete syntax.
2360 Attribute implementations need to cooperate properly with the static
2361 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2362 Attrib.XXX_thm etc. already do the right thing without further
2363 intervention. Only unusual applications -- such as "where" or "of"
2364 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2365 on the context and the facts involved -- may have to assign parsed
2366 values to argument tokens explicitly.
2368 * Changed parameter management in theorem generation for long goal
2369 statements with 'includes'. INCOMPATIBILITY: produces a different
2370 theorem statement in rare situations.
2372 * Locale inspection command 'print_locale' omits notes elements. Use
2373 'print_locale!' to have them included in the output.
2378 * Provers/hypsubst.ML: improved version of the subst method, for
2379 single-step rewriting: it now works in bound variable contexts. New is
2380 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2381 rewrite a different subterm than the original subst method, which is
2382 still available as 'simplesubst'.
2384 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2387 * Provers/trancl.ML: new transitivity reasoner for transitive and
2388 reflexive-transitive closure of relations.
2390 * Provers/blast.ML: new reference depth_limit to make blast's depth
2391 limit (previously hard-coded with a value of 20) user-definable.
2393 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2394 is peformed already. Object-logics merely need to finish their
2395 initial simpset configuration as before. INCOMPATIBILITY.
2400 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2403 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2405 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2406 and x-symbol; use option '-m epsilon' to get it actually printed.
2407 Moreover, the mathematically important symbolic identifier \<epsilon>
2408 becomes available as variable, constant etc. INCOMPATIBILITY,
2410 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2411 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2412 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2413 support corresponding Isar calculations.
2415 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2418 * theory SetInterval: changed the syntax for open intervals:
2427 The old syntax is still supported but will disappear in the next
2428 release. For conversion use the following Emacs search and replace
2429 patterns (these are not perfect but work quite well):
2431 {)\([^\.]*\)\.\. -> {\1<\.\.}
2432 \.\.\([^(}]*\)(} -> \.\.<\1}
2434 * Theory Commutative_Ring (in Library): method comm_ring for proving
2435 equalities in commutative rings; method 'algebra' provides a generic
2438 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2439 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2440 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2443 Some new syntax forms are available:
2445 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2446 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2447 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2448 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2450 The latter form "\<Sum>x < k. e" used to be based on a separate
2451 function "Summation", which has been discontinued.
2453 * theory Finite_Set: in structured induction proofs, the insert case
2454 is now 'case (insert x F)' instead of the old counterintuitive 'case
2457 * The 'refute' command has been extended to support a much larger
2458 fragment of HOL, including axiomatic type classes, constdefs and
2459 typedefs, inductive datatypes and recursion.
2461 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2462 Requires zChaff with proof generation to be installed. See
2463 HOL/ex/SAT_Examples.thy for examples.
2465 * Datatype induction via method 'induct' now preserves the name of the
2466 induction variable. For example, when proving P(xs::'a list) by
2467 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2468 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2469 in unstructured proof scripts.
2471 * Reworked implementation of records. Improved scalability for
2472 records with many fields, avoiding performance problems for type
2473 inference. Records are no longer composed of nested field types, but
2474 of nested extension types. Therefore the record type only grows linear
2475 in the number of extensions and not in the number of fields. The
2476 top-level (users) view on records is preserved. Potential
2477 INCOMPATIBILITY only in strange cases, where the theory depends on the
2478 old record representation. The type generated for a record is called
2479 <record_name>_ext_type.
2481 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2482 proofs triggered by a record definition or a simproc (if
2483 quick_and_dirty is enabled). Definitions of large records can take
2486 New simproc record_upd_simproc for simplification of multiple record
2487 updates enabled by default. Moreover, trivial updates are also
2488 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2489 occasionally, since simplification is more powerful by default.
2491 * typedef: proper support for polymorphic sets, which contain extra
2492 type-variables in the term.
2494 * Simplifier: automatically reasons about transitivity chains
2495 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2496 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2497 old proofs break occasionally as simplification may now solve more
2498 goals than previously.
2500 * Simplifier: converts x <= y into x = y if assumption y <= x is
2501 present. Works for all partial orders (class "order"), in particular
2502 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2505 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2506 bound variable or a constant then the let is unfolded. Otherwise
2507 first a is simplified to b, and then f b is simplified to g. If
2508 possible we abstract b from g arriving at "let x = b in h x",
2509 otherwise we unfold the let and arrive at g. The simproc can be
2510 enabled/disabled by the reference use_let_simproc. Potential
2511 INCOMPATIBILITY since simplification is more powerful by default.
2513 * Classical reasoning: the meson method now accepts theorems as arguments.
2515 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2516 jobs to provide advice on the provability of subgoals.
2518 * Theory OrderedGroup and Ring_and_Field: various additions and
2519 improvements to faciliate calculations involving equalities and
2522 The following theorems have been eliminated or modified
2525 abs_eq now named abs_of_nonneg
2526 abs_of_ge_0 now named abs_of_nonneg
2527 abs_minus_eq now named abs_of_nonpos
2528 imp_abs_id now named abs_of_nonneg
2529 imp_abs_neg_id now named abs_of_nonpos
2530 mult_pos now named mult_pos_pos
2531 mult_pos_le now named mult_nonneg_nonneg
2532 mult_pos_neg_le now named mult_nonneg_nonpos
2533 mult_pos_neg2_le now named mult_nonneg_nonpos2
2534 mult_neg now named mult_neg_neg
2535 mult_neg_le now named mult_nonpos_nonpos
2537 * The following lemmas in Ring_and_Field have been added to the simplifier:
2540 not_square_less_zero
2542 The following lemmas have been deleted from Real/RealPow:
2552 * Theory Parity: added rules for simplifying exponents.
2556 The following theorems have been eliminated or modified
2559 list_all_Nil now named list_all.simps(1)
2560 list_all_Cons now named list_all.simps(2)
2561 list_all_conv now named list_all_iff
2562 set_mem_eq now named mem_iff
2564 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2565 asymptotic "big O" calculations. See the notes in BigO.thy.
2570 * Theory RealDef: better support for embedding natural numbers and
2571 integers in the reals.
2573 The following theorems have been eliminated or modified
2576 exp_ge_add_one_self now requires no hypotheses
2577 real_of_int_add reversed direction of equality (use [symmetric])
2578 real_of_int_minus reversed direction of equality (use [symmetric])
2579 real_of_int_diff reversed direction of equality (use [symmetric])
2580 real_of_int_mult reversed direction of equality (use [symmetric])
2582 * Theory RComplete: expanded support for floor and ceiling functions.
2584 * Theory Ln is new, with properties of the natural logarithm
2586 * Hyperreal: There is a new type constructor "star" for making
2587 nonstandard types. The old type names are now type synonyms:
2591 hcomplex = complex star
2593 * Hyperreal: Many groups of similarly-defined constants have been
2594 replaced by polymorphic versions (INCOMPATIBILITY):
2596 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2598 starset <-- starsetNat, starsetC
2599 *s* <-- *sNat*, *sc*
2600 starset_n <-- starsetNat_n, starsetC_n
2601 *sn* <-- *sNatn*, *scn*
2602 InternalSets <-- InternalNatSets, InternalCSets
2604 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2605 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2606 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2607 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2608 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2610 * Hyperreal: Many type-specific theorems have been removed in favor of
2611 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2613 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2614 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2615 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2616 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2617 right_minus <-- hypreal_add_minus
2618 left_minus <-- {hypreal,hcomplex}_add_minus_left
2619 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2620 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2621 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2622 mult_1_right <-- hcomplex_mult_one_right
2623 mult_zero_left <-- hcomplex_mult_zero_left
2624 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2625 right_distrib <-- hypnat_add_mult_distrib2
2626 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2627 right_inverse <-- hypreal_mult_inverse
2628 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2629 order_refl <-- {hypreal,hypnat}_le_refl
2630 order_trans <-- {hypreal,hypnat}_le_trans
2631 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2632 order_less_le <-- {hypreal,hypnat}_less_le
2633 linorder_linear <-- {hypreal,hypnat}_le_linear
2634 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2635 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2636 add_nonneg_nonneg <-- hypreal_le_add_order
2638 * Hyperreal: Separate theorems having to do with type-specific
2639 versions of constants have been merged into theorems that apply to the
2640 new polymorphic constants (INCOMPATIBILITY):
2642 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2643 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2644 STAR_Un <-- {STAR,NatStar,STARC}_Un
2645 STAR_Int <-- {STAR,NatStar,STARC}_Int
2646 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2647 STAR_subset <-- {STAR,NatStar,STARC}_subset
2648 STAR_mem <-- {STAR,NatStar,STARC}_mem
2649 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2650 STAR_diff <-- {STAR,STARC}_diff
2651 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2652 STARC_hcomplex_of_complex}_image_subset
2653 starset_n_Un <-- starset{Nat,C}_n_Un
2654 starset_n_Int <-- starset{Nat,C}_n_Int
2655 starset_n_Compl <-- starset{Nat,C}_n_Compl
2656 starset_n_diff <-- starset{Nat,C}_n_diff
2657 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2658 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2659 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2660 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2661 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2662 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2663 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2664 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2665 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2666 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2667 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2668 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2669 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2670 starfun_diff <-- starfun{C,RC,CR}_diff
2671 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2672 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2673 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2674 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2675 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2676 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2677 starfun_Id <-- starfunC_Id
2678 starfun_approx <-- starfun{Nat,CR}_approx
2679 starfun_capprox <-- starfun{C,RC}_capprox
2680 starfun_abs <-- starfunNat_rabs
2681 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2682 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2683 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2684 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2685 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2686 starfun_add_approx <-- starfunCR_add_approx
2687 starfun_inverse_inverse <-- starfunC_inverse_inverse
2688 starfun_divide <-- starfun{C,CR,RC}_divide
2689 starfun_n <-- starfun{Nat,C}_n
2690 starfun_n_mult <-- starfun{Nat,C}_n_mult
2691 starfun_n_add <-- starfun{Nat,C}_n_add
2692 starfun_n_add_minus <-- starfunNat_n_add_minus
2693 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2694 starfun_n_minus <-- starfun{Nat,C}_n_minus
2695 starfun_n_eq <-- starfun{Nat,C}_n_eq
2697 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2698 star_n_minus <-- {hypreal,hcomplex}_minus
2699 star_n_diff <-- {hypreal,hcomplex}_diff
2700 star_n_mult <-- {hypreal,hcomplex}_mult
2701 star_n_inverse <-- {hypreal,hcomplex}_inverse
2702 star_n_le <-- {hypreal,hypnat}_le
2703 star_n_less <-- {hypreal,hypnat}_less
2704 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2705 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2706 star_n_abs <-- hypreal_hrabs
2707 star_n_divide <-- hcomplex_divide
2709 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2710 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2711 star_of_diff <-- hypreal_of_real_diff
2712 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2713 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2714 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2715 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2716 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2717 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2718 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2719 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2720 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2721 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2722 star_of_number_of <-- {hypreal,hcomplex}_number_of
2723 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2724 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2725 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2726 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2727 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2728 star_of_power <-- hypreal_of_real_power
2729 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2731 * Hyperreal: new method "transfer" that implements the transfer
2732 principle of nonstandard analysis. With a subgoal that mentions
2733 nonstandard types like "'a star", the command "apply transfer"
2734 replaces it with an equivalent one that mentions only standard types.
2735 To be successful, all free variables must have standard types; non-
2736 standard variables must have explicit universal quantifiers.
2738 * Hyperreal: A theory of Taylor series.
2743 * Discontinued special version of 'constdefs' (which used to support
2744 continuous functions) in favor of the general Pure one with full
2747 * New simplification procedure for solving continuity conditions; it
2748 is much faster on terms with many nested lambda abstractions (cubic
2749 instead of exponential time).
2751 * New syntax for domain package: selector names are now optional.
2752 Parentheses should be omitted unless argument is lazy, for example:
2754 domain 'a stream = cons "'a" (lazy "'a stream")
2756 * New command 'fixrec' for defining recursive functions with pattern
2757 matching; defining multiple functions with mutual recursion is also
2758 supported. Patterns may include the constants cpair, spair, up, sinl,
2759 sinr, or any data constructor defined by the domain package. The given
2760 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2761 syntax and examples.
2763 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2764 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2765 but the proof obligation additionally includes an admissibility
2766 requirement. The packages generate instances of class cpo or pcpo,
2767 with continuity and strictness theorems for Rep and Abs.
2769 * HOLCF: Many theorems have been renamed according to a more standard naming
2770 scheme (INCOMPATIBILITY):
2772 foo_inject: "foo$x = foo$y ==> x = y"
2773 foo_eq: "(foo$x = foo$y) = (x = y)"
2774 foo_less: "(foo$x << foo$y) = (x << y)"
2775 foo_strict: "foo$UU = UU"
2776 foo_defined: "... ==> foo$x ~= UU"
2777 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2782 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2783 including the First Isomorphism Theorem (on quotienting by the kernel
2786 * ZF/Simplifier: install second copy of type solver that actually
2787 makes use of TC rules declared to Isar proof contexts (or locales);
2788 the old version is still required for ML proof scripts.
2793 * Converted to Isar theory format; use locales instead of axiomatic
2799 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
2802 * Pure/library.ML no longer defines its own option datatype, but uses
2803 that of the SML basis, which has constructors NONE and SOME instead of
2804 None and Some, as well as exception Option.Option instead of OPTION.
2805 The functions the, if_none, is_some, is_none have been adapted
2806 accordingly, while Option.map replaces apsome.
2808 * Pure/library.ML: the exception LIST has been given up in favour of
2809 the standard exceptions Empty and Subscript, as well as
2810 Library.UnequalLengths. Function like Library.hd and Library.tl are
2811 superceded by the standard hd and tl functions etc.
2813 A number of basic list functions are no longer exported to the ML
2814 toplevel, as they are variants of predefined functions. The following
2815 suggests how one can translate existing code:
2817 rev_append xs ys = List.revAppend (xs, ys)
2818 nth_elem (i, xs) = List.nth (xs, i)
2819 last_elem xs = List.last xs
2820 flat xss = List.concat xss
2821 seq fs = List.app fs
2822 partition P xs = List.partition P xs
2823 mapfilter f xs = List.mapPartial f xs
2825 * Pure/library.ML: several combinators for linear functional
2826 transformations, notably reverse application and composition:
2829 (x, y) |-> f f #-> g
2831 * Pure/library.ML: introduced/changed precedence of infix operators:
2833 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
2835 infix 3 o oo ooo oooo;
2836 infix 4 ~~ upto downto;
2838 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
2841 * Pure/library.ML: natural list combinators fold, fold_rev, and
2842 fold_map support linear functional transformations and nesting. For
2845 fold f [x1, ..., xN] y =
2846 y |> f x1 |> ... |> f xN
2848 (fold o fold) f [xs1, ..., xsN] y =
2849 y |> fold f xs1 |> ... |> fold f xsN
2851 fold f [x1, ..., xN] =
2854 (fold o fold) f [xs1, ..., xsN] =
2855 fold f xs1 #> ... #> fold f xsN
2857 * Pure/library.ML: the following selectors on type 'a option are
2860 the: 'a option -> 'a (*partial*)
2861 these: 'a option -> 'a where 'a = 'b list
2862 the_default: 'a -> 'a option -> 'a
2863 the_list: 'a option -> 'a list
2865 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2866 basic operations for association lists, following natural argument
2867 order; moreover the explicit equality predicate passed here avoids
2868 potentially expensive polymorphic runtime equality checks.
2869 The old functions may be expressed as follows:
2871 assoc = uncurry (AList.lookup (op =))
2872 assocs = these oo AList.lookup (op =)
2873 overwrite = uncurry (AList.update (op =)) o swap
2875 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2877 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
2878 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
2880 replacing make_keylist and keyfilter (occassionally used)
2883 make_keylist = AList.make
2884 keyfilter = AList.find (op =)
2886 * eq_fst and eq_snd now take explicit equality parameter, thus
2887 avoiding eqtypes. Naive rewrites:
2889 eq_fst = eq_fst (op =)
2890 eq_snd = eq_snd (op =)
2892 * Removed deprecated apl and apr (rarely used).
2895 apl (n, op) =>>= curry op n
2896 apr (op, m) =>>= fn n => op (n, m)
2898 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
2899 provides a reasonably efficient light-weight implementation of sets as
2902 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
2903 few new operations; existing lookup and update are now curried to
2904 follow natural argument order (for use with fold etc.);
2905 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
2907 * Pure/General: output via the Isabelle channels of
2908 writeln/warning/error etc. is now passed through Output.output, with a
2909 hook for arbitrary transformations depending on the print_mode
2910 (cf. Output.add_mode -- the first active mode that provides a output
2911 function wins). Already formatted output may be embedded into further
2912 text via Output.raw; the result of Pretty.string_of/str_of and derived
2913 functions (string_of_term/cterm/thm etc.) is already marked raw to
2914 accommodate easy composition of diagnostic messages etc. Programmers
2915 rarely need to care about Output.output or Output.raw at all, with
2916 some notable exceptions: Output.output is required when bypassing the
2917 standard channels (writeln etc.), or in token translations to produce
2918 properly formatted results; Output.raw is required when capturing
2919 already output material that will eventually be presented to the user
2920 a second time. For the default print mode, both Output.output and
2921 Output.raw have no effect.
2923 * Pure/General: Output.time_accumulator NAME creates an operator ('a
2924 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
2925 cumulative results are displayed at the end of a batch session.
2927 * Pure/General: File.sysify_path and File.quote_sysify path have been
2928 replaced by File.platform_path and File.shell_path (with appropriate
2929 hooks). This provides a clean interface for unusual systems where the
2930 internal and external process view of file names are different.
2932 * Pure: more efficient orders for basic syntactic entities: added
2933 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
2934 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
2935 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
2936 orders now -- potential INCOMPATIBILITY for code that depends on a
2937 particular order for Symtab.keys, Symtab.dest, etc. (consider using
2938 Library.sort_strings on result).
2940 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
2941 fold_types traverse types/terms from left to right, observing natural
2942 argument order. Supercedes previous foldl_XXX versions, add_frees,
2943 add_vars etc. have been adapted as well: INCOMPATIBILITY.
2945 * Pure: name spaces have been refined, with significant changes of the
2946 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
2947 to extern(_table). The plain name entry path is superceded by a
2948 general 'naming' context, which also includes the 'policy' to produce
2949 a fully qualified name and external accesses of a fully qualified
2950 name; NameSpace.extend is superceded by context dependent
2951 Sign.declare_name. Several theory and proof context operations modify
2952 the naming context. Especially note Theory.restore_naming and
2953 ProofContext.restore_naming to get back to a sane state; note that
2954 Theory.add_path is no longer sufficient to recover from
2955 Theory.absolute_path in particular.
2957 * Pure: new flags short_names (default false) and unique_names
2958 (default true) for controlling output of qualified names. If
2959 short_names is set, names are printed unqualified. If unique_names is
2960 reset, the name prefix is reduced to the minimum required to achieve
2961 the original result when interning again, even if there is an overlap
2962 with earlier declarations.
2964 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
2965 now 'extend', and 'merge' gets an additional Pretty.pp argument
2966 (useful for printing error messages). INCOMPATIBILITY.
2968 * Pure: major reorganization of the theory context. Type Sign.sg and
2969 Theory.theory are now identified, referring to the universal
2970 Context.theory (see Pure/context.ML). Actual signature and theory
2971 content is managed as theory data. The old code and interfaces were
2972 spread over many files and structures; the new arrangement introduces
2973 considerable INCOMPATIBILITY to gain more clarity:
2975 Context -- theory management operations (name, identity, inclusion,
2976 parents, ancestors, merge, etc.), plus generic theory data;
2978 Sign -- logical signature and syntax operations (declaring consts,
2979 types, etc.), plus certify/read for common entities;
2981 Theory -- logical theory operations (stating axioms, definitions,
2982 oracles), plus a copy of logical signature operations (consts,
2983 types, etc.); also a few basic management operations (Theory.copy,
2986 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
2987 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
2988 for convenience -- they merely return the theory.
2990 * Pure: type Type.tsig is superceded by theory in most interfaces.
2992 * Pure: the Isar proof context type is already defined early in Pure
2993 as Context.proof (note that ProofContext.context and Proof.context are
2994 aliases, where the latter is the preferred name). This enables other
2995 Isabelle components to refer to that type even before Isar is present.
2997 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
2998 typeK, constK, axiomK, oracleK), but provide explicit operations for
2999 any of these kinds. For example, Sign.intern typeK is now
3000 Sign.intern_type, Theory.hide_space Sign.typeK is now
3001 Theory.hide_types. Also note that former
3002 Theory.hide_classes/types/consts are now
3003 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3004 internalize their arguments! INCOMPATIBILITY.
3006 * Pure: get_thm interface (of PureThy and ProofContext) expects
3007 datatype thmref (with constructors Name and NameSelection) instead of
3008 plain string -- INCOMPATIBILITY;
3010 * Pure: cases produced by proof methods specify options, where NONE
3011 means to remove case bindings -- INCOMPATIBILITY in
3014 * Pure: the following operations retrieve axioms or theorems from a
3015 theory node or theory hierarchy, respectively:
3017 Theory.axioms_of: theory -> (string * term) list
3018 Theory.all_axioms_of: theory -> (string * term) list
3019 PureThy.thms_of: theory -> (string * thm) list
3020 PureThy.all_thms_of: theory -> (string * thm) list
3022 * Pure: print_tac now outputs the goal through the trace channel.
3024 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3025 Reference Toplevel.debug (default false) controls detailed printing
3026 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3027 controls execution profiling -- set to 1 for time and 2 for space
3028 (both increase the runtime).
3030 * Isar session: The initial use of ROOT.ML is now always timed,
3031 i.e. the log will show the actual process times, in contrast to the
3032 elapsed wall-clock time that the outer shell wrapper produces.
3034 * Simplifier: improved handling of bound variables (nameless
3035 representation, avoid allocating new strings). Simprocs that invoke
3036 the Simplifier recursively should use Simplifier.inherit_bounds to
3037 avoid local name clashes. Failure to do so produces warnings
3038 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3039 for further details.
3041 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3042 bindings for all theorems stored within a given theory; this may help
3043 in porting non-Isar theories to Isar ones, while keeping ML proof
3044 scripts for the time being.
3046 * ML operator HTML.with_charset specifies the charset begin used for
3047 generated HTML files. For example:
3049 HTML.with_charset "utf-8" use_thy "Hebrew";
3050 HTML.with_charset "utf-8" use_thy "Chinese";
3055 * Allow symlinks to all proper Isabelle executables (Isabelle,
3056 isabelle, isatool etc.).
3058 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3059 isatool doc, isatool mkdir, display_drafts etc.).
3061 * isatool usedir: option -f allows specification of the ML file to be
3062 used by Isabelle; default is ROOT.ML.
3064 * New isatool version outputs the version identifier of the Isabelle
3065 distribution being used.
3067 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3068 (containing Boolean satisfiability problems) into Isabelle/HOL
3073 New in Isabelle2004 (April 2004)
3074 --------------------------------
3078 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3079 Replaces linorder.ML.
3081 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3082 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3083 (\<a>...\<z>), are now considered normal letters, and can therefore
3084 be used anywhere where an ASCII letter (a...zA...Z) has until
3085 now. COMPATIBILITY: This obviously changes the parsing of some
3086 terms, especially where a symbol has been used as a binder, say
3087 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3088 as an identifier. Fix it by inserting a space around former
3089 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3090 existing theory and ML files.
3092 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3094 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3095 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3096 a normal (but invisible) letter. For multiple letter subscripts repeat
3097 \<^isub> like this: x\<^isub>1\<^isub>2.
3099 * Pure: There are now sub-/superscripts that can span more than one
3100 character. Text between \<^bsub> and \<^esub> is set in subscript in
3101 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3102 superscript. The new control characters are not identifier parts.
3104 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3105 content of "..." to the latex file instead of \isacntrl... . The "..."
3106 may consist of any printable characters excluding the end bracket >.
3108 * Pure: Using new Isar command "finalconsts" (or the ML functions
3109 Theory.add_finals or Theory.add_finals_i) it is now possible to
3110 declare constants "final", which prevents their being given a definition
3111 later. It is useful for constants whose behaviour is fixed axiomatically
3112 rather than definitionally, such as the meta-logic connectives.
3114 * Pure: 'instance' now handles general arities with general sorts
3115 (i.e. intersections of classes),
3117 * Presentation: generated HTML now uses a CSS style sheet to make layout
3118 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3119 It can be changed to alter the colors/layout of generated pages.
3124 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3125 cut_tac, subgoal_tac and thin_tac:
3126 - Now understand static (Isar) contexts. As a consequence, users of Isar
3127 locales are no longer forced to write Isar proof scripts.
3128 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3130 - INCOMPATIBILITY: names of variables to be instantiated may no
3131 longer be enclosed in quotes. Instead, precede variable name with `?'.
3132 This is consistent with the instantiation attribute "where".
3134 * Attributes "where" and "of":
3135 - Now take type variables of instantiated theorem into account when reading
3136 the instantiation string. This fixes a bug that caused instantiated
3137 theorems to have too special types in some circumstances.
3138 - "where" permits explicit instantiations of type variables.
3140 * Calculation commands "moreover" and "also" no longer interfere with
3141 current facts ("this"), admitting arbitrary combinations with "then"
3145 - Goal statements involving the context element "includes" no longer
3146 generate theorems with internal delta predicates (those ending on
3147 "_axioms") in the premise.
3148 Resolve particular premise with <locale>.intro to obtain old form.
3149 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3150 specification and "includes" elements in goal statement.
3151 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3152 [intro?] and [elim?] (respectively) by default.
3153 - Experimental command for instantiation of locales in proof contexts:
3154 instantiate <label>[<attrs>]: <loc>
3155 Instantiates locale <loc> and adds all its theorems to the current context
3156 taking into account their attributes. Label and attrs are optional
3157 modifiers, like in theorem declarations. If present, names of
3158 instantiated theorems are qualified with <label>, and the attributes
3159 <attrs> are applied after any attributes these theorems might have already.
3160 If the locale has assumptions, a chained fact of the form
3161 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3162 are derived. The command does not support old-style locales declared
3163 with "locale (open)".
3164 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3166 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3172 * Proof import: new image HOL4 contains the imported library from
3173 the HOL4 system with about 2500 theorems. It is imported by
3174 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3175 can be used like any other Isabelle image. See
3176 HOL/Import/HOL/README for more information.
3179 - Much improved handling of linear and partial orders.
3180 Reasoners for linear and partial orders are set up for type classes
3181 "linorder" and "order" respectively, and are added to the default simpset
3182 as solvers. This means that the simplifier can build transitivity chains
3183 to solve goals from the assumptions.
3184 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3185 of blast or auto after simplification become unnecessary because the goal
3186 is solved by simplification already.
3188 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3189 all proved in axiomatic type classes for semirings, rings and fields.
3192 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3193 now formalized using the Ring_and_Field theory mentioned above.
3194 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3195 than before, because now they are set up once in a generic manner.
3196 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3197 Look for the general versions in Ring_and_Field (and Power if they concern
3200 * Type "rat" of the rational numbers is now available in HOL-Complex.
3203 - Record types are now by default printed with their type abbreviation
3204 instead of the list of all field types. This can be configured via
3205 the reference "print_record_type_abbr".
3206 - Simproc "record_upd_simproc" for simplification of multiple updates added
3207 (not enabled by default).
3208 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3209 EX x. x = sel r to True (not enabled by default).
3210 - Tactic "record_split_simp_tac" to split and simplify records added.
3212 * 'specification' command added, allowing for definition by
3213 specification. There is also an 'ax_specification' command that
3214 introduces the new constants axiomatically.
3216 * arith(_tac) is now able to generate counterexamples for reals as well.
3218 * HOL-Algebra: new locale "ring" for non-commutative rings.
3220 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3221 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3223 * HOL-Matrix: a first theory for matrices in HOL with an application of
3224 matrix theory to linear programming.
3226 * Unions and Intersections:
3227 The latex output syntax of UN and INT has been changed
3228 from "\Union x \in A. B" to "\Union_{x \in A} B"
3229 i.e. the index formulae has become a subscript.
3230 Similarly for "\Union x. B", and for \Inter instead of \Union.
3232 * Unions and Intersections over Intervals:
3233 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3234 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3235 like in normal math, and corresponding versions for < and for intersection.
3237 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3238 lexicographic dictonary ordering has been added as "lexord".
3240 * ML: the legacy theory structures Int and List have been removed. They had
3241 conflicted with ML Basis Library structures having the same names.
3243 * 'refute' command added to search for (finite) countermodels. Only works
3244 for a fragment of HOL. The installation of an external SAT solver is
3245 highly recommended. See "HOL/Refute.thy" for details.
3247 * 'quickcheck' command: Allows to find counterexamples by evaluating
3248 formulae under an assignment of free variables to random values.
3249 In contrast to 'refute', it can deal with inductive datatypes,
3250 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3256 * Streams now come with concatenation and are part of the HOLCF image
3260 New in Isabelle2003 (May 2003)
3261 ------------------------------
3265 * Provers/simplifier:
3267 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3268 Assumptions are now subject to complete mutual simplification,
3269 not just from left to right. The simplifier now preserves
3270 the order of assumptions.
3272 Potential INCOMPATIBILITY:
3274 -- simp sometimes diverges where the old version did
3275 not, e.g. invoking simp on the goal
3277 [| P (f x); y = x; f x = f y |] ==> Q
3279 now gives rise to the infinite reduction sequence
3281 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3283 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3286 -- Tactics combining classical reasoner and simplification (such as auto)
3287 are also affected by this change, because many of them rely on
3288 simp. They may sometimes diverge as well or yield a different numbers
3289 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3290 in case of problems. Sometimes subsequent calls to the classical
3291 reasoner will fail because a preceeding call to the simplifier too
3292 eagerly simplified the goal, e.g. deleted redundant premises.
3294 - The simplifier trace now shows the names of the applied rewrite rules
3296 - You can limit the number of recursive invocations of the simplifier
3297 during conditional rewriting (where the simplifie tries to solve the
3298 conditions before applying the rewrite rule):
3299 ML "simp_depth_limit := n"
3300 where n is an integer. Thus you can force termination where previously
3301 the simplifier would diverge.
3303 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3305 - No longer aborts on failed congruence proof. Instead, the
3306 congruence is ignored.
3308 * Pure: New generic framework for extracting programs from constructive
3309 proofs. See HOL/Extraction.thy for an example instantiation, as well
3310 as HOL/Extraction for some case studies.
3312 * Pure: The main goal of the proof state is no longer shown by default, only
3313 the subgoals. This behaviour is controlled by a new flag.
3314 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3315 (ML: Proof.show_main_goal).
3317 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3318 rules whose conclusion matches subgoal 1:
3319 PG menu: Isabelle/Isar -> Show me -> matching rules
3320 The rules are ordered by how closely they match the subgoal.
3321 In particular, rules that solve a subgoal outright are displayed first
3322 (or rather last, the way they are printed).
3323 (ML: ProofGeneral.print_intros())
3325 * Pure: New flag trace_unify_fail causes unification to print
3326 diagnostic information (PG: in trace buffer) when it fails. This is
3327 useful for figuring out why single step proofs like rule, erule or
3330 * Pure: Locale specifications now produce predicate definitions
3331 according to the body of text (covering assumptions modulo local
3332 definitions); predicate "loc_axioms" covers newly introduced text,
3333 while "loc" is cumulative wrt. all included locale expressions; the
3334 latter view is presented only on export into the global theory
3335 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3336 on the old view without predicates;
3338 * Pure: predefined locales "var" and "struct" are useful for sharing
3339 parameters (as in CASL, for example); just specify something like
3340 ``var x + var y + struct M'' as import;
3342 * Pure: improved thms_containing: proper indexing of facts instead of
3343 raw theorems; check validity of results wrt. current name space;
3344 include local facts of proof configuration (also covers active
3345 locales), cover fixed variables in index; may use "_" in term
3346 specification; an optional limit for the number of printed facts may
3347 be given (the default is 40);
3349 * Pure: disallow duplicate fact bindings within new-style theory files
3352 * Provers: improved induct method: assumptions introduced by case
3353 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3354 the goal statement); "foo" still refers to all facts collectively;
3356 * Provers: the function blast.overloaded has been removed: all constants
3357 are regarded as potentially overloaded, which improves robustness in exchange
3358 for slight decrease in efficiency;
3360 * Provers/linorder: New generic prover for transitivity reasoning over
3361 linear orders. Note: this prover is not efficient!
3363 * Isar: preview of problems to finish 'show' now produce an error
3364 rather than just a warning (in interactive mode);
3371 - Produces a counter example if it cannot prove a goal.
3372 Note that the counter example may be spurious if the goal is not a formula
3373 of quantifier-free linear arithmetic.
3374 In ProofGeneral the counter example appears in the trace buffer.
3376 - Knows about div k and mod k where k is a numeral of type nat or int.
3378 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3379 linear arithmetic fails. This takes account of quantifiers and divisibility.
3380 Presburger arithmetic can also be called explicitly via presburger(_tac).
3382 * simp's arithmetic capabilities have been enhanced a bit: it now
3383 takes ~= in premises into account (by performing a case split);
3385 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3386 are distributed over a sum of terms;
3388 * New tactic "trans_tac" and method "trans" instantiate
3389 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3392 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3393 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3395 * 'typedef' command has new option "open" to suppress the set
3398 * functions Min and Max on finite sets have been introduced (theory
3401 * attribute [symmetric] now works for relations as well; it turns
3402 (x,y) : R^-1 into (y,x) : R, and vice versa;
3404 * induct over a !!-quantified statement (say !!x1..xn):
3405 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3407 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3408 %x. None. Warning: empty_def now refers to the previously hidden definition
3411 * Algebra: formalization of classical algebra. Intended as base for
3412 any algebraic development in Isabelle. Currently covers group theory
3413 (up to Sylow's theorem) and ring theory (Universal Property of
3414 Univariate Polynomials). Contributions welcome;
3416 * GroupTheory: deleted, since its material has been moved to Algebra;
3418 * Complex: new directory of the complex numbers with numeric constants,
3419 nonstandard complex numbers, and some complex analysis, standard and
3420 nonstandard (Jacques Fleuriot);
3422 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3424 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3427 * Real/HahnBanach: updated and adapted to locales;
3429 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3432 * UNITY: added the Meier-Sanders theory of progress sets;
3434 * MicroJava: bytecode verifier and lightweight bytecode verifier
3435 as abstract algorithms, instantiated to the JVM;
3437 * Bali: Java source language formalization. Type system, operational
3438 semantics, axiomatic semantics. Supported language features:
3439 classes, interfaces, objects,virtual methods, static methods,
3440 static/instance fields, arrays, access modifiers, definite
3441 assignment, exceptions.
3446 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3449 * Main ZF: virtually all theories converted to new-style format;
3454 * Pure: Tactic.prove provides sane interface for internal proofs;
3455 omits the infamous "standard" operation, so this is more appropriate
3456 than prove_goalw_cterm in many situations (e.g. in simprocs);
3458 * Pure: improved error reporting of simprocs;
3460 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3464 *** Document preparation ***
3466 * uses \par instead of \\ for line breaks in theory text. This may
3467 shift some page breaks in large documents. To get the old behaviour
3468 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3470 * minimized dependencies of isabelle.sty and isabellesym.sty on
3473 * \<euro> now needs package babel/greek instead of marvosym (which
3476 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3481 New in Isabelle2002 (March 2002)
3482 --------------------------------
3484 *** Document preparation ***
3486 * greatly simplified document preparation setup, including more
3487 graceful interpretation of isatool usedir -i/-d/-D options, and more
3488 instructive isatool mkdir; users should basically be able to get
3489 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3490 users may run a separate document processing stage manually like this:
3491 "isatool usedir -D output HOL Test && isatool document Test/output";
3493 * theory dependency graph may now be incorporated into documents;
3494 isatool usedir -g true will produce session_graph.eps/.pdf for use
3495 with \includegraphics of LaTeX;
3497 * proper spacing of consecutive markup elements, especially text
3498 blocks after section headings;
3500 * support bold style (for single symbols only), input syntax is like
3501 this: "\<^bold>\<alpha>" or "\<^bold>A";
3503 * \<bullet> is now output as bold \cdot by default, which looks much
3504 better in printed text;
3506 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3507 note that these symbols are currently unavailable in Proof General /
3508 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3510 * isatool latex no longer depends on changed TEXINPUTS, instead
3511 isatool document copies the Isabelle style files to the target
3517 * Pure/Provers: improved proof by cases and induction;
3518 - 'case' command admits impromptu naming of parameters (such as
3520 - 'induct' method divinates rule instantiation from the inductive
3521 claim; no longer requires excessive ?P bindings for proper
3522 instantiation of cases;
3523 - 'induct' method properly enumerates all possibilities of set/type
3524 rules; as a consequence facts may be also passed through *type*
3525 rules without further ado;
3526 - 'induct' method now derives symbolic cases from the *rulified*
3527 rule (before it used to rulify cases stemming from the internal
3528 atomized version); this means that the context of a non-atomic
3529 statement becomes is included in the hypothesis, avoiding the
3530 slightly cumbersome show "PROP ?case" form;
3531 - 'induct' may now use elim-style induction rules without chaining
3532 facts, using ``missing'' premises from the goal state; this allows
3533 rules stemming from inductive sets to be applied in unstructured
3534 scripts, while still benefitting from proper handling of non-atomic
3535 statements; NB: major inductive premises need to be put first, all
3536 the rest of the goal is passed through the induction;
3537 - 'induct' proper support for mutual induction involving non-atomic
3538 rule statements (uses the new concept of simultaneous goals, see
3540 - append all possible rule selections, but only use the first
3541 success (no backtracking);
3542 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3543 - undeclared rule case names default to numbers 1, 2, 3, ...;
3544 - added 'print_induct_rules' (covered by help item in recent Proof
3546 - moved induct/cases attributes to Pure, methods to Provers;
3547 - generic method setup instantiated for FOL and HOL;
3549 * Pure: support multiple simultaneous goal statements, for example
3550 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3551 meta-level mechanism, this acts as if several individual goals had
3552 been stated separately; in particular common proof methods need to be
3553 repeated in order to cover all claims; note that a single elimination
3554 step is *not* sufficient to establish the two conjunctions, so this
3557 assume "A & B" then have A and B .. (*".." fails*)
3559 better use "obtain" in situations as above; alternative refer to
3560 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3562 * Pure: proper integration with ``locales''; unlike the original
3563 version by Florian Kammller, Isar locales package high-level proof
3564 contexts rather than raw logical ones (e.g. we admit to include
3565 attributes everywhere); operations on locales include merge and
3566 rename; support for implicit arguments (``structures''); simultaneous
3567 type-inference over imports and text; see also HOL/ex/Locales.thy for
3570 * Pure: the following commands have been ``localized'', supporting a
3571 target locale specification "(in name)": 'lemma', 'theorem',
3572 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3573 stored both within the locale and at the theory level (exported and
3574 qualified by the locale name);
3576 * Pure: theory goals may now be specified in ``long'' form, with
3577 ad-hoc contexts consisting of arbitrary locale elements. for example
3578 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3579 definitions may be given, too); the result is a meta-level rule with
3580 the context elements being discharged in the obvious way;
3582 * Pure: new proof command 'using' allows to augment currently used
3583 facts after a goal statement ('using' is syntactically analogous to
3584 'apply', but acts on the goal's facts only); this allows chained facts
3585 to be separated into parts given before and after a claim, as in
3586 ``from a and b have C using d and e <proof>'';
3588 * Pure: renamed "antecedent" case to "rule_context";
3590 * Pure: new 'judgment' command records explicit information about the
3591 object-logic embedding (used by several tools internally); no longer
3592 use hard-wired "Trueprop";
3594 * Pure: added 'corollary' command;
3596 * Pure: fixed 'token_translation' command;
3598 * Pure: removed obsolete 'exported' attribute;
3600 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3601 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3602 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3604 * Pure: method 'atomize' presents local goal premises as object-level
3605 statements (atomic meta-level propositions); setup controlled via
3606 rewrite rules declarations of 'atomize' attribute; example
3607 application: 'induct' method with proper rule statements in improper
3610 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3611 now consider the syntactic context of assumptions, giving a better
3612 chance to get type-inference of the arguments right (this is
3613 especially important for locales);
3615 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3618 * Pure/obtain: the formal conclusion "thesis", being marked as
3619 ``internal'', may no longer be reference directly in the text;
3620 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3623 * Pure: generic 'sym' attribute which declares a rule both as pure
3624 'elim?' and for the 'symmetric' operation;
3626 * Pure: marginal comments ``--'' may now occur just anywhere in the
3627 text; the fixed correlation with particular command syntax has been
3630 * Pure: new method 'rules' is particularly well-suited for proof
3631 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3632 but often produces more compact proof terms with less detours;
3634 * Pure/Provers/classical: simplified integration with pure rule
3635 attributes and methods; the classical "intro?/elim?/dest?"
3636 declarations coincide with the pure ones; the "rule" method no longer
3637 includes classically swapped intros; "intro" and "elim" methods no
3638 longer pick rules from the context; also got rid of ML declarations
3639 AddXIs/AddXEs/AddXDs; all of this has some potential for
3642 * Provers/classical: attribute 'swapped' produces classical inversions
3643 of introduction rules;
3645 * Provers/simplifier: 'simplified' attribute may refer to explicit
3646 rules instead of full simplifier context; 'iff' attribute handles
3649 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3651 * HOL: 'recdef' now fails on unfinished automated proofs, use
3652 "(permissive)" option to recover old behavior;
3654 * HOL: 'inductive' no longer features separate (collective) attributes
3655 for 'intros' (was found too confusing);
3657 * HOL: properly declared induction rules less_induct and
3663 * HOL: moved over to sane numeral syntax; the new policy is as
3666 - 0 and 1 are polymorphic constants, which are defined on any
3667 numeric type (nat, int, real etc.);
3669 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3670 binary representation internally;
3672 - type nat has special constructor Suc, and generally prefers Suc 0
3673 over 1::nat and Suc (Suc 0) over 2::nat;
3675 This change may cause significant problems of INCOMPATIBILITY; here
3676 are some hints on converting existing sources:
3678 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3679 entities, so expressions involving "-" (unary or binary minus) need
3680 to be spaced properly;
3682 - existing occurrences of "1" may need to be constraint "1::nat" or
3683 even replaced by Suc 0; similar for old "2";
3685 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3687 - remove all special provisions on numerals in proofs;
3689 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3690 representation (depends on bin_arith_simps in the default context);
3692 * HOL: symbolic syntax for x^2 (numeral 2);
3694 * HOL: the class of all HOL types is now called "type" rather than
3695 "term"; INCOMPATIBILITY, need to adapt references to this type class
3696 in axclass/classes, instance/arities, and (usually rare) occurrences
3697 in typings (of consts etc.); internally the class is called
3698 "HOL.type", ML programs should refer to HOLogic.typeS;
3700 * HOL/record package improvements:
3701 - new derived operations "fields" to build a partial record section,
3702 "extend" to promote a fixed record to a record scheme, and
3703 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3704 declared as simp by default;
3705 - shared operations ("more", "fields", etc.) now need to be always
3706 qualified) --- potential INCOMPATIBILITY;
3707 - removed "make_scheme" operations (use "make" with "extend") --
3709 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3710 - provides cases/induct rules for use with corresponding Isar
3711 methods (for concrete records, record schemes, concrete more
3712 parts, and schematic more parts -- in that order);
3713 - internal definitions directly based on a light-weight abstract
3714 theory of product types over typedef rather than datatype;
3716 * HOL: generic code generator for generating executable ML code from
3717 specifications; specific support for HOL constructs such as inductive
3718 datatypes and sets, as well as recursive functions; can be invoked
3719 via 'generate_code' theory section;
3721 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3723 * HOL: consolidated and renamed several theories. In particular:
3724 Ord.thy has been absorbed into HOL.thy
3725 String.thy has been absorbed into List.thy
3727 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3728 (beware of argument permutation!);
3730 * HOL: linorder_less_split superseded by linorder_cases;
3732 * HOL/List: "nodups" renamed to "distinct";
3734 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3735 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3736 - Ex_def has changed, now need to use some_eq_ex
3738 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3739 in this (rare) case use:
3741 delSWrapper "split_all_tac"
3742 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3744 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3747 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3748 Isabelle's type classes, ^ on functions and relations has too general
3749 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3750 necessary to attach explicit type constraints;
3752 * HOL/Relation: the prefix name of the infix "O" has been changed from
3753 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3754 renamed accordingly (eg "compI" -> "rel_compI").
3756 * HOL: syntax translations now work properly with numerals and records
3759 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3760 of "lam" -- INCOMPATIBILITY;
3762 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3763 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3764 renamed "Product_Type.unit";
3766 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3768 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3769 the "cases" method);
3771 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3774 * HOL/IMP: updated and converted to new-style theory format; several
3775 parts turned into readable document, with proper Isar proof texts and
3776 some explanations (by Gerwin Klein);
3778 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3780 * HOL-Hyperreal is now a logic image;
3785 * Isar: consts/constdefs supports mixfix syntax for continuous
3788 * Isar: domain package adapted to new-style theory format, e.g. see
3791 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3792 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3793 lift.induct_tac, always use UU instead of Undef;
3795 * HOLCF/IMP: updated and converted to new-style theory;
3800 * Isar: proper integration of logic-specific tools and packages,
3801 including theory commands '(co)inductive', '(co)datatype',
3802 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
3803 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
3805 * theory Main no longer includes AC; for the Axiom of Choice, base
3806 your theory on Main_ZFC;
3808 * the integer library now covers quotients and remainders, with many
3809 laws relating division to addition, multiplication, etc.;
3811 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
3812 typeless version of the formalism;
3814 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
3817 * ZF/Induct: new directory for examples of inductive definitions,
3818 including theory Multiset for multiset orderings; converted to
3819 new-style theory format;
3821 * ZF: many new theorems about lists, ordinals, etc.;
3826 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
3827 variable proof controls level of detail: 0 = no proofs (only oracle
3828 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
3829 also ref manual for further ML interfaces;
3831 * Pure/axclass: removed obsolete ML interface
3832 goal_subclass/goal_arity;
3834 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
3835 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
3836 separate tokens, so expressions involving minus need to be spaced
3839 * Pure/syntax: support non-oriented infixes, using keyword "infix"
3840 rather than "infixl" or "infixr";
3842 * Pure/syntax: concrete syntax for dummy type variables admits genuine
3843 sort constraint specifications in type inference; e.g. "x::_::foo"
3844 ensures that the type of "x" is of sort "foo" (but not necessarily a
3847 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
3848 control output of nested => (types); the default behavior is
3851 * Pure/syntax: builtin parse translation for "_constify" turns valued
3852 tokens into AST constants;
3854 * Pure/syntax: prefer later declarations of translations and print
3855 translation functions; potential INCOMPATIBILITY: need to reverse
3856 multiple declarations for same syntax element constant;
3858 * Pure/show_hyps reset by default (in accordance to existing Isar
3861 * Provers/classical: renamed addaltern to addafter, addSaltern to
3864 * Provers/clasimp: ``iff'' declarations now handle conditional rules
3867 * system: tested support for MacOS X; should be able to get Isabelle +
3868 Proof General to work in a plain Terminal after installing Poly/ML
3869 (e.g. from the Isabelle distribution area) and GNU bash alone
3870 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
3871 support requires further installations, e.g. from
3872 http://fink.sourceforge.net/);
3874 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
3876 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
3877 of 40 MB), cf. ML_OPTIONS;
3879 * system: Proof General keywords specification is now part of the
3880 Isabelle distribution (see etc/isar-keywords.el);
3882 * system: support for persistent Proof General sessions (refrain from
3883 outdating all loaded theories on startup); user may create writable
3884 logic images like this: ``isabelle -q HOL Test'';
3886 * system: smart selection of Isabelle process versus Isabelle
3887 interface, accommodates case-insensitive file systems (e.g. HFS+); may
3888 run both "isabelle" and "Isabelle" even if file names are badly
3889 damaged (executable inspects the case of the first letter of its own
3890 name); added separate "isabelle-process" and "isabelle-interface";
3892 * system: refrain from any attempt at filtering input streams; no
3893 longer support ``8bit'' encoding of old isabelle font, instead proper
3894 iso-latin characters may now be used; the related isatools
3895 "symbolinput" and "nonascii" have disappeared as well;
3897 * system: removed old "xterm" interface (the print modes "xterm" and
3898 "xterm_color" are still available for direct use in a suitable
3903 New in Isabelle99-2 (February 2001)
3904 -----------------------------------
3906 *** Overview of INCOMPATIBILITIES ***
3908 * HOL: please note that theories in the Library and elsewhere often use the
3909 new-style (Isar) format; to refer to their theorems in an ML script you must
3910 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
3912 * HOL: inductive package no longer splits induction rule aggressively,
3913 but only as far as specified by the introductions given; the old
3914 format may be recovered via ML function complete_split_rule or attribute
3915 'split_rule (complete)';
3917 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
3918 gfp_Tarski to gfp_unfold;
3920 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
3922 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
3923 relation); infix "^^" has been renamed "``"; infix "``" has been
3924 renamed "`"; "univalent" has been renamed "single_valued";
3926 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
3929 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
3931 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
3933 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
3934 consequence, it is no longer monotonic wrt. the local goal context
3935 (which is now passed through the inductive cases);
3937 * Document preparation: renamed standard symbols \<ll> to \<lless> and
3938 \<gg> to \<ggreater>;
3941 *** Document preparation ***
3943 * \isabellestyle{NAME} selects version of Isabelle output (currently
3944 available: are "it" for near math-mode best-style output, "sl" for
3945 slanted text style, and "tt" for plain type-writer; if no
3946 \isabellestyle command is given, output is according to slanted
3949 * support sub/super scripts (for single symbols only), input syntax is
3950 like this: "A\<^sup>*" or "A\<^sup>\<star>";
3952 * some more standard symbols; see Appendix A of the system manual for
3953 the complete list of symbols defined in isabellesym.sty;
3955 * improved isabelle style files; more abstract symbol implementation
3956 (should now use \isamath{...} and \isatext{...} in custom symbol
3959 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
3960 state; Note that presentation of goal states does not conform to
3961 actual human-readable proof documents. Please do not include goal
3962 states into document output unless you really know what you are doing!
3964 * proper indentation of antiquoted output with proportional LaTeX
3967 * no_document ML operator temporarily disables LaTeX document
3970 * isatool unsymbolize tunes sources for plain ASCII communication;
3975 * Pure: Isar now suffers initial goal statements to contain unbound
3976 schematic variables (this does not conform to actual readable proof
3977 documents, due to unpredictable outcome and non-compositional proof
3978 checking); users who know what they are doing may use schematic goals
3979 for Prolog-style synthesis of proven results;
3981 * Pure: assumption method (an implicit finishing) now handles actual
3984 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
3985 initial goal, declare "that" only as Pure intro (only for single
3986 steps); the "that" rule assumption may now be involved in implicit
3987 finishing, thus ".." becomes a feasible for trivial obtains;
3989 * Pure: default proof step now includes 'intro_classes'; thus trivial
3990 instance proofs may be performed by "..";
3992 * Pure: ?thesis / ?this / "..." now work for pure meta-level
3995 * Pure: more robust selection of calculational rules;
3997 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
3998 rule (as well as the assumption rule);
4000 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4001 lemmas, using the graph browser tool;
4003 * Pure: predict failure of "show" in interactive mode;
4005 * Pure: 'thms_containing' now takes actual terms as arguments;
4007 * HOL: improved method 'induct' --- now handles non-atomic goals
4008 (potential INCOMPATIBILITY); tuned error handling;
4010 * HOL: cases and induct rules now provide explicit hints about the
4011 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4012 any remaining facts are inserted into the goal verbatim;
4014 * HOL: local contexts (aka cases) may now contain term bindings as
4015 well; the 'cases' and 'induct' methods new provide a ?case binding for
4016 the result to be shown in each case;
4018 * HOL: added 'recdef_tc' command;
4020 * isatool convert assists in eliminating legacy ML scripts;
4025 * HOL/Library: a collection of generic theories to be used together
4026 with main HOL; the theory loader path already includes this directory
4027 by default; the following existing theories have been moved here:
4028 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4029 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4031 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4032 modelling and verification task performed in Isabelle/HOL +
4033 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4035 * HOL/Algebra: special summation operator SUM no longer exists, it has
4036 been replaced by setsum; infix 'assoc' now has priority 50 (like
4037 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4038 'domain', this makes the theory consistent with mathematical
4041 * HOL basics: added overloaded operations "inverse" and "divide"
4042 (infix "/"), syntax for generic "abs" operation, generic summation
4045 * HOL/typedef: simplified package, provide more useful rules (see also
4048 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4049 now expressed as a proper nested rule (old-style tactic scripts may
4050 require atomize_strip_tac to cope with non-atomic premises);
4052 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4053 to "split_conv" (old name still available for compatibility);
4055 * HOL: improved concrete syntax for strings (e.g. allows translation
4056 rules with string literals);
4058 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4059 and Fleuriot's mechanization of analysis, including the transcendental
4060 functions for the reals;
4062 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4067 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4068 "lam" is displayed as TWO lambda-symbols
4070 * CTT: theory Main now available, containing everything (that is, Bool
4076 * Pure: the Simplifier has been implemented properly as a derived rule
4077 outside of the actual kernel (at last!); the overall performance
4078 penalty in practical applications is about 50%, while reliability of
4079 the Isabelle inference kernel has been greatly improved;
4081 * print modes "brackets" and "no_brackets" control output of nested =>
4082 (types) and ==> (props); the default behaviour is "brackets";
4084 * Provers: fast_tac (and friends) now handle actual object-logic rules
4085 as assumptions as well;
4087 * system: support Poly/ML 4.0;
4089 * system: isatool install handles KDE version 1 or 2;
4093 New in Isabelle99-1 (October 2000)
4094 ----------------------------------
4096 *** Overview of INCOMPATIBILITIES ***
4098 * HOL: simplification of natural numbers is much changed; to partly
4099 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4100 issue the following ML commands:
4102 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4103 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4105 * HOL: simplification no longer dives into case-expressions; this is
4106 controlled by "t.weak_case_cong" for each datatype t;
4108 * HOL: nat_less_induct renamed to less_induct;
4110 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4111 fixsome to patch .thy and .ML sources automatically;
4113 select_equality -> some_equality
4114 select_eq_Ex -> some_eq_ex
4115 selectI2EX -> someI2_ex
4118 select1_equality -> some1_equality
4119 Eps_sym_eq -> some_sym_eq_trivial
4120 Eps_eq -> some_eq_trivial
4122 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4124 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4127 * HOL: the recursion equations generated by 'recdef' are now called
4128 f.simps instead of f.rules;
4130 * HOL: qed_spec_mp now also handles bounded ALL as well;
4132 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4133 sometimes be needed;
4135 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4137 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4139 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4140 product is now "<*>" instead of "Times"; the lexicographic product is
4141 now "<*lex*>" instead of "**";
4143 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4144 of main HOL, but was unused); better use HOL's datatype package;
4146 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4147 the old syntax may be recovered as follows:
4150 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4151 (infixl "\\<oplus>" 100)
4153 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4155 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4156 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4159 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4160 changed from A/r to A//r;
4162 * ZF: new treatment of arithmetic (nat & int) may break some old
4165 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4166 rulify -> rule_format, elimify -> elim_format, ...);
4168 * Isar/Provers: intro/elim/dest attributes changed; renamed
4169 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4170 should have to change intro!! to intro? only); replaced "delrule" by
4173 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4175 * Provers: strengthened force_tac by using new first_best_tac;
4177 * LaTeX document preparation: several changes of isabelle.sty (see
4181 *** Document preparation ***
4183 * formal comments (text blocks etc.) in new-style theories may now
4184 contain antiquotations of thm/prop/term/typ/text to be presented
4185 according to latex print mode; concrete syntax is like this:
4186 @{term[show_types] "f(x) = a + x"};
4188 * isatool mkdir provides easy setup of Isabelle session directories,
4189 including proper document sources;
4191 * generated LaTeX sources are now deleted after successful run
4192 (isatool document -c); may retain a copy somewhere else via -D option
4195 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4196 style files, achieving self-contained LaTeX sources and simplifying
4199 * old-style theories now produce (crude) LaTeX output as well;
4201 * browser info session directories are now self-contained (may be put
4202 on WWW server seperately); improved graphs of nested sessions; removed
4203 graph for 'all sessions';
4205 * several improvements in isabelle style files; \isabellestyle{it}
4206 produces fake math mode output; \isamarkupheader is now \section by
4207 default; see lib/texinputs/isabelle.sty etc.;
4212 * Isar/Pure: local results and corresponding term bindings are now
4213 subject to Hindley-Milner polymorphism (similar to ML); this
4214 accommodates incremental type-inference very nicely;
4216 * Isar/Pure: new derived language element 'obtain' supports
4217 generalized existence reasoning;
4219 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4220 support accumulation of results, without applying any rules yet;
4221 useful to collect intermediate results without explicit name
4222 references, and for use with transitivity rules with more than 2
4225 * Isar/Pure: scalable support for case-analysis type proofs: new
4226 'case' language element refers to local contexts symbolically, as
4227 produced by certain proof methods; internally, case names are attached
4228 to theorems as "tags";
4230 * Isar/Pure: theory command 'hide' removes declarations from
4231 class/type/const name spaces;
4233 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4234 indicate potential overloading;
4236 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4238 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4239 "{a,b,c}" instead of {a,b,c};
4241 * Isar/Pure now provides its own version of intro/elim/dest
4242 attributes; useful for building new logics, but beware of confusion
4243 with the version in Provers/classical;
4245 * Isar/Pure: the local context of (non-atomic) goals is provided via
4246 case name 'antecedent';
4248 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4249 to the current context is now done automatically);
4251 * Isar/Pure: theory command 'method_setup' provides a simple interface
4252 for definining proof methods in ML;
4254 * Isar/Provers: intro/elim/dest attributes changed; renamed
4255 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4256 most cases, one should have to change intro!! to intro? only);
4257 replaced "delrule" by "rule del";
4259 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4260 'symmetric' attribute (the latter supercedes [RS sym]);
4262 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4263 method modifier); 'simp' method: 'only:' modifier removes loopers as
4264 well (including splits);
4266 * Isar/Provers: Simplifier and Classical methods now support all kind
4267 of modifiers used in the past, including 'cong', 'iff', etc.
4269 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4270 of Simplifier and Classical reasoner);
4272 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4273 now support named cases; major packages (inductive, datatype, primrec,
4274 recdef) support case names and properly name parameters;
4276 * Isar/HOL: new transitivity rules for substitution in inequalities --
4277 monotonicity conditions are extracted to be proven at end of
4280 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4283 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4284 split_if split_if_asm; datatype package provides theorems foo.splits =
4285 foo.split foo.split_asm for each datatype;
4287 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4288 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4289 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4290 use "(cases (simplified))" method in proper proof texts);
4292 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4294 * Isar: names of theorems etc. may be natural numbers as well;
4296 * Isar: 'pr' command: optional arguments for goals_limit and
4297 ProofContext.prems_limit; no longer prints theory contexts, but only
4300 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4301 additional print modes to be specified; e.g. "pr(latex)" will print
4302 proof state according to the Isabelle LaTeX style;
4304 * Isar: improved support for emulating tactic scripts, including proof
4305 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4306 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4307 (for HOL datatypes);
4309 * Isar: simplified (more robust) goal selection of proof methods: 1st
4310 goal, all goals, or explicit goal specifier (tactic emulation); thus
4311 'proof method scripts' have to be in depth-first order;
4313 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4315 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4316 should instead use individual commands for printing items
4317 (print_commands, print_methods etc.);
4319 * Isar: added 'nothing' --- the empty list of theorems;
4324 * HOL/MicroJava: formalization of a fragment of Java, together with a
4325 corresponding virtual machine and a specification of its bytecode
4326 verifier and a lightweight bytecode verifier, including proofs of
4327 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4328 Cornelia Pusch (see also the homepage of project Bali at
4329 http://isabelle.in.tum.de/Bali/);
4331 * HOL/Algebra: new theory of rings and univariate polynomials, by
4334 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4335 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4338 * HOL/Lattice: fundamental concepts of lattice theory and order
4339 structures, including duals, properties of bounds versus algebraic
4340 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4341 Theorem for complete lattices etc.; may also serve as a demonstration
4342 for abstract algebraic reasoning using axiomatic type classes, and
4343 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4345 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4348 * HOL/IMPP: extension of IMP with local variables and mutually
4349 recursive procedures, by David von Oheimb;
4351 * HOL/Lambda: converted into new-style theory and document;
4353 * HOL/ex/Multiquote: example of multiple nested quotations and
4354 anti-quotations -- basically a generalized version of de-Bruijn
4355 representation; very useful in avoiding lifting of operations;
4357 * HOL/record: added general record equality rule to simpset; fixed
4358 select-update simplification procedure to handle extended records as
4359 well; admit "r" as field name;
4361 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4362 other numeric types and also as the identity of groups, rings, etc.;
4364 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4365 Types nat and int belong to this axclass;
4367 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4368 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4369 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4370 two terms #m*u and #n*u are replaced by #(m+n)*u
4371 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4372 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4373 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4375 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4376 powerful prover for predicate logic but knows nothing of clasets; see
4377 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4379 * HOL: new version of "case_tac" subsumes both boolean case split and
4380 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4381 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4383 * HOL: simplification no longer dives into case-expressions: only the
4384 selector expression is simplified, but not the remaining arms; to
4385 enable full simplification of case-expressions for datatype t, you may
4386 remove t.weak_case_cong from the simpset, either globally (Delcongs
4387 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4389 * HOL/recdef: the recursion equations generated by 'recdef' for
4390 function 'f' are now called f.simps instead of f.rules; if all
4391 termination conditions are proved automatically, these simplification
4392 rules are added to the simpset, as in primrec; rules may be named
4393 individually as well, resulting in a separate list of theorems for
4396 * HOL/While is a new theory that provides a while-combinator. It
4397 permits the definition of tail-recursive functions without the
4398 provision of a termination measure. The latter is necessary once the
4399 invariant proof rule for while is applied.
4401 * HOL: new (overloaded) notation for the set of elements below/above
4402 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4404 * HOL: theorems impI, allI, ballI bound as "strip";
4406 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4407 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4408 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4410 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4412 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4413 main HOL, but was unused);
4415 * HOL: fewer consts declared as global (e.g. have to refer to
4416 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4418 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4419 in case of overlap with user translations (e.g. judgements over
4420 tuples); (note that the underlying logical represenation is still
4426 * ZF: simplification automatically cancels common terms in arithmetic
4427 expressions over nat and int;
4429 * ZF: new treatment of nat to minimize type-checking: all operators
4430 coerce their operands to a natural number using the function natify,
4431 making the algebraic laws unconditional;
4433 * ZF: as above, for int: operators coerce their operands to an integer
4434 using the function intify;
4436 * ZF: the integer library now contains many of the usual laws for the
4437 orderings, including $<=, and monotonicity laws for $+ and $*;
4439 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4442 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4443 to the simplifier and classical reasoner simultaneously;
4448 * Provers: blast_tac now handles actual object-logic rules as
4449 assumptions; note that auto_tac uses blast_tac internally as well;
4451 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4452 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4454 * Provers: delrules now handles destruct rules as well (no longer need
4455 explicit make_elim);
4457 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4458 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4459 use instead the strong form,
4460 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4461 in HOL, FOL and ZF the function cla_make_elim will create such rules
4462 from destruct-rules;
4464 * Provers: Simplifier.easy_setup provides a fast path to basic
4465 Simplifier setup for new object-logics;
4467 * Pure: AST translation rules no longer require constant head on LHS;
4469 * Pure: improved name spaces: ambiguous output is qualified; support
4470 for hiding of names;
4472 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4473 XSYMBOL_HOME; no longer need to do manual configuration in most
4476 * system: compression of ML heaps images may now be controlled via -c
4477 option of isabelle and isatool usedir (currently only observed by
4480 * system: isatool installfonts may handle X-Symbol fonts as well (very
4481 useful for remote X11);
4483 * system: provide TAGS file for Isabelle sources;
4485 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4488 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4489 timing flag supersedes proof_timing and Toplevel.trace;
4491 * ML: new combinators |>> and |>>> for incremental transformations
4492 with secondary results (e.g. certain theory extensions):
4494 * ML: PureThy.add_defs gets additional argument to indicate potential
4495 overloading (usually false);
4497 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4502 New in Isabelle99 (October 1999)
4503 --------------------------------
4505 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4507 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4508 are no longer simplified. (This allows the simplifier to unfold recursive
4509 functional programs.) To restore the old behaviour, declare
4511 Delcongs [if_weak_cong];
4513 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4516 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4518 * HOL/datatype: mutual_induct_tac no longer exists --
4519 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4521 * HOL/typedef: fixed type inference for representing set; type
4522 arguments now have to occur explicitly on the rhs as type constraints;
4524 * ZF: The con_defs part of an inductive definition may no longer refer
4525 to constants declared in the same theory;
4527 * HOL, ZF: the function mk_cases, generated by the inductive
4528 definition package, has lost an argument. To simplify its result, it
4529 uses the default simpset instead of a supplied list of theorems.
4531 * HOL/List: the constructors of type list are now Nil and Cons;
4533 * Simplifier: the type of the infix ML functions
4534 setSSolver addSSolver setSolver addSolver
4535 is now simpset * solver -> simpset where `solver' is a new abstract type
4536 for packaging solvers. A solver is created via
4537 mk_solver: string -> (thm list -> int -> tactic) -> solver
4538 where the string argument is only a comment.
4543 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4544 decision procedure for linear arithmetic. Currently it is used for
4545 types `nat', `int', and `real' in HOL (see below); it can, should and
4546 will be instantiated for other types and logics as well.
4548 * The simplifier now accepts rewrite rules with flexible heads, eg
4549 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4550 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4556 * New Isabelle/Isar subsystem provides an alternative to traditional
4557 tactical theorem proving; together with the ProofGeneral/isar user
4558 interface it offers an interactive environment for developing human
4559 readable proof documents (Isar == Intelligible semi-automated
4560 reasoning); for further information see isatool doc isar-ref,
4561 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4563 * improved and simplified presentation of theories: better HTML markup
4564 (including colors), graph views in several sizes; isatool usedir now
4565 provides a proper interface for user theories (via -P option); actual
4566 document preparation based on (PDF)LaTeX is available as well (for
4567 new-style theories only); see isatool doc system for more information;
4569 * native support for Proof General, both for classic Isabelle and
4572 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4573 using the graph browser tool;
4575 * Isabelle manuals now also available as PDF;
4577 * theory loader rewritten from scratch (may not be fully
4578 bug-compatible); old loadpath variable has been replaced by show_path,
4579 add_path, del_path, reset_path functions; new operations such as
4580 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4583 * improved isatool install: option -k creates KDE application icon,
4584 option -p DIR installs standalone binaries;
4586 * added ML_PLATFORM setting (useful for cross-platform installations);
4587 more robust handling of platform specific ML images for SML/NJ;
4589 * the settings environment is now statically scoped, i.e. it is never
4590 created again in sub-processes invoked from isabelle, isatool, or
4593 * path element specification '~~' refers to '$ISABELLE_HOME';
4595 * in locales, the "assumes" and "defines" parts may be omitted if
4598 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4601 * new print_mode "HTML";
4603 * new flag show_tags controls display of tags of theorems (which are
4604 basically just comments that may be attached by some tools);
4606 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4607 mode and goal output format:
4609 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4611 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4613 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4614 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4616 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4618 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4620 * function bind_thms stores lists of theorems (cf. bind_thm);
4622 * new shorthand tactics ftac, eatac, datac, fatac;
4624 * qed (and friends) now accept "" as result name; in that case the
4625 theorem is not stored, but proper checks and presentation of the
4628 * theorem database now also indexes constants "Trueprop", "all",
4629 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4634 ** HOL arithmetic **
4636 * There are now decision procedures for linear arithmetic over nat and
4639 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4640 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4641 are treated as atomic; subformulae not involving type `nat' or `int'
4642 are ignored; quantified subformulae are ignored unless they are
4643 positive universal or negative existential. The tactic has to be
4644 invoked by hand and can be a little bit slow. In particular, the
4645 running time is exponential in the number of occurrences of `min' and
4646 `max', and `-' on `nat'.
4648 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4649 (negated) (in)equalities among the premises and the conclusion into
4650 account (i.e. no compound formulae) and does not know about `min' and
4651 `max', and `-' on `nat'. It is fast and is used automatically by the
4654 NB: At the moment, these decision procedures do not cope with mixed
4655 nat/int formulae where the two parts interact, such as `m < n ==>
4658 * HOL/Numeral provides a generic theory of numerals (encoded
4659 efficiently as bit strings); setup for types nat/int/real is in place;
4660 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4661 int, existing theories and proof scripts may require a few additional
4664 * integer division and remainder can now be performed on constant
4667 * many properties of integer multiplication, division and remainder
4670 * An interface to the Stanford Validity Checker (SVC) is available through the
4671 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4672 are proved automatically. SVC must be installed separately, and its results
4673 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4674 invocation of the underlying oracle). For SVC see
4675 http://verify.stanford.edu/SVC
4677 * IsaMakefile: the HOL-Real target now builds an actual image;
4682 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4683 (in Isabelle/Isar) -- by Gertrud Bauer;
4685 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4686 analysis for assembly languages with subtypes;
4688 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4689 -- avoids syntactic ambiguities and treats state, transition, and
4690 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4691 changed syntax and (many) tactics;
4693 * HOL/inductive: Now also handles more general introduction rules such
4694 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4695 theorems are now maintained within the theory (maintained via the
4698 * HOL/datatype: Now also handles arbitrarily branching datatypes
4699 (using function types) such as
4701 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4703 * HOL/record: record_simproc (part of the default simpset) takes care
4704 of selectors applied to updated records; record_split_tac is no longer
4705 part of the default claset; update_defs may now be removed from the
4706 simpset in many cases; COMPATIBILITY: old behavior achieved by
4708 claset_ref () := claset() addSWrapper record_split_wrapper;
4709 Delsimprocs [record_simproc]
4711 * HOL/typedef: fixed type inference for representing set; type
4712 arguments now have to occur explicitly on the rhs as type constraints;
4714 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4715 names rather than an ML expression;
4717 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4718 supplied later. Program schemes can be defined, such as
4719 "While B C s = (if B s then While B C (C s) else s)"
4720 where the well-founded relation can be chosen after B and C have been given.
4722 * HOL/List: the constructors of type list are now Nil and Cons;
4723 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4724 course, ML tools referring to List.list.op # etc. have to be adapted;
4726 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4727 disabled by default; run isabelle with option -m HOL to get back to
4728 the original Gordon/HOL-style output;
4730 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4731 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4733 * HOL basic syntax simplified (more orthogonal): all variants of
4734 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4735 Eps operator is provided as well: "SOME x. P[x]";
4737 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4739 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4740 thus available for user theories;
4742 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4743 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4746 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4747 several times and then mp;
4752 * the notation <<...>> is now available as a notation for sequences of
4755 * the simplifier is now installed
4757 * the axiom system has been generalized (thanks to Soren Heilmann)
4759 * the classical reasoner now has a default rule database
4764 * new primrec section allows primitive recursive functions to be given
4765 directly (as in HOL) over datatypes and the natural numbers;
4767 * new tactics induct_tac and exhaust_tac for induction (or case
4768 analysis) over datatypes and the natural numbers;
4770 * the datatype declaration of type T now defines the recursor T_rec;
4772 * simplification automatically does freeness reasoning for datatype
4775 * automatic type-inference, with AddTCs command to insert new
4776 type-checking rules;
4778 * datatype introduction rules are now added as Safe Introduction rules
4781 * the syntax "if P then x else y" is now available in addition to
4785 *** Internal programming interfaces ***
4787 * tuned simplifier trace output; new flag debug_simp;
4789 * structures Vartab / Termtab (instances of TableFun) offer efficient
4790 tables indexed by indexname_ord / term_ord (compatible with aconv);
4792 * AxClass.axclass_tac lost the theory argument;
4794 * tuned current_goals_markers semantics: begin / end goal avoids
4795 printing empty lines;
4797 * removed prs and prs_fn hook, which was broken because it did not
4798 include \n in its semantics, forcing writeln to add one
4799 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4800 string -> unit if you really want to output text without newline;
4802 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
4803 plain output, interface builders may have to enable 'isabelle_font'
4804 mode to get Isabelle font glyphs as before;
4806 * refined token_translation interface; INCOMPATIBILITY: output length
4807 now of type real instead of int;
4809 * theory loader actions may be traced via new ThyInfo.add_hook
4810 interface (see src/Pure/Thy/thy_info.ML); example application: keep
4811 your own database of information attached to *whole* theories -- as
4812 opposed to intra-theory data slots offered via TheoryDataFun;
4814 * proper handling of dangling sort hypotheses (at last!);
4815 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
4816 extra sort hypotheses that can be witnessed from the type signature;
4817 the force_strip_shyps flag is gone, any remaining shyps are simply
4818 left in the theorem (with a warning issued by strip_shyps_warning);
4822 New in Isabelle98-1 (October 1998)
4823 ----------------------------------
4825 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4827 * several changes of automated proof tools;
4829 * HOL: major changes to the inductive and datatype packages, including
4830 some minor incompatibilities of theory syntax;
4832 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
4835 * HOL: removed duplicate thms in Arith:
4836 less_imp_add_less should be replaced by trans_less_add1
4837 le_imp_add_le should be replaced by trans_le_add1
4839 * HOL: unary minus is now overloaded (new type constraints may be
4842 * HOL and ZF: unary minus for integers is now #- instead of #~. In
4843 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
4844 now taken as an integer constant.
4846 * Pure: ML function 'theory_of' renamed to 'theory';
4852 1. Asm_full_simp_tac is now more aggressive.
4853 1. It will sometimes reorient premises if that increases their power to
4855 2. It does no longer proceed strictly from left to right but may also
4856 rotate premises to achieve further simplification.
4857 For compatibility reasons there is now Asm_lr_simp_tac which is like the
4858 old Asm_full_simp_tac in that it does not rotate premises.
4859 2. The simplifier now knows a little bit about nat-arithmetic.
4861 * Classical reasoner: wrapper mechanism for the classical reasoner now
4862 allows for selected deletion of wrappers, by introduction of names for
4863 wrapper functionals. This implies that addbefore, addSbefore,
4864 addaltern, and addSaltern now take a pair (name, tactic) as argument,
4865 and that adding two tactics with the same name overwrites the first
4866 one (emitting a warning).
4867 type wrapper = (int -> tactic) -> (int -> tactic)
4868 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
4869 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
4870 delWrapper, delSWrapper: claset * string -> claset
4871 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
4873 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
4874 semantics; addbefore now affects only the unsafe part of step_tac
4875 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
4876 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
4879 * Classical reasoner: setwrapper to setWrapper and compwrapper to
4880 compWrapper; added safe wrapper (and access functions for it);
4882 * HOL/split_all_tac is now much faster and fails if there is nothing
4883 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
4884 and the names of the automatically generated variables have changed.
4885 split_all_tac has moved within claset() from unsafe wrappers to safe
4886 wrappers, which means that !!-bound variables are split much more
4887 aggressively, and safe_tac and clarify_tac now split such variables.
4888 If this splitting is not appropriate, use delSWrapper "split_all_tac".
4889 Note: the same holds for record_split_tac, which does the job of
4890 split_all_tac for record fields.
4892 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
4893 permanently to the default simpset using Addsplits just like
4894 Addsimps. They can be removed via Delsplits just like
4895 Delsimps. Lower-case versions are also available.
4897 * HOL/Simplifier: The rule split_if is now part of the default
4898 simpset. This means that the simplifier will eliminate all occurrences
4899 of if-then-else in the conclusion of a goal. To prevent this, you can
4900 either remove split_if completely from the default simpset by
4901 `Delsplits [split_if]' or remove it in a specific call of the
4902 simplifier using `... delsplits [split_if]'. You can also add/delete
4903 other case splitting rules to/from the default simpset: every datatype
4904 generates suitable rules `split_t_case' and `split_t_case_asm' (where
4905 t is the name of the datatype).
4907 * Classical reasoner / Simplifier combination: new force_tac (and
4908 derivatives Force_tac, force) combines rewriting and classical
4909 reasoning (and whatever other tools) similarly to auto_tac, but is
4910 aimed to solve the given subgoal completely.
4915 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
4916 and `goalw': the theory is no longer needed as an explicit argument -
4917 the current theory context is used; assumptions are no longer returned
4918 at the ML-level unless one of them starts with ==> or !!; it is
4919 recommended to convert to these new commands using isatool fixgoal
4920 (backup your sources first!);
4922 * new top-level commands 'thm' and 'thms' for retrieving theorems from
4923 the current theory context, and 'theory' to lookup stored theories;
4925 * new theory section 'locale' for declaring constants, assumptions and
4926 definitions that have local scope;
4928 * new theory section 'nonterminals' for purely syntactic types;
4930 * new theory section 'setup' for generic ML setup functions
4931 (e.g. package initialization);
4933 * the distribution now includes Isabelle icons: see
4934 lib/logo/isabelle-{small,tiny}.xpm;
4936 * isatool install - install binaries with absolute references to
4939 * isatool logo -- create instances of the Isabelle logo (as EPS);
4941 * print mode 'emacs' reserved for Isamode;
4943 * support multiple print (ast) translations per constant name;
4945 * theorems involving oracles are now printed with a suffixed [!];
4950 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
4952 * HOL/inductive package reorganized and improved: now supports mutual
4958 oddI "n : EVEN ==> Suc n : ODD"
4959 evenI "n : ODD ==> Suc n : EVEN"
4961 new theorem list "elims" contains an elimination rule for each of the
4962 recursive sets; inductive definitions now handle disjunctive premises
4963 correctly (also ZF);
4965 INCOMPATIBILITIES: requires Inductive as an ancestor; component
4966 "mutual_induct" no longer exists - the induction rule is always
4967 contained in "induct";
4970 * HOL/datatype package re-implemented and greatly improved: now
4971 supports mutually recursive datatypes such as
4974 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
4975 | SUM ('a aexp) ('a aexp)
4976 | DIFF ('a aexp) ('a aexp)
4979 'a bexp = LESS ('a aexp) ('a aexp)
4980 | AND ('a bexp) ('a bexp)
4981 | OR ('a bexp) ('a bexp)
4983 as well as indirectly recursive datatypes such as
4986 ('a, 'b) term = Var 'a
4987 | App 'b ((('a, 'b) term) list)
4989 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
4990 induction on mutually / indirectly recursive datatypes.
4992 Primrec equations are now stored in theory and can be accessed via
4993 <function_name>.simps.
4997 - Theories using datatypes must now have theory Datatype as an
4999 - The specific <typename>.induct_tac no longer exists - use the
5000 generic induct_tac instead.
5001 - natE has been renamed to nat.exhaust - use exhaust_tac
5002 instead of res_inst_tac ... natE. Note that the variable
5003 names in nat.exhaust differ from the names in natE, this
5004 may cause some "fragile" proofs to fail.
5005 - The theorems split_<typename>_case and split_<typename>_case_asm
5006 have been renamed to <typename>.split and <typename>.split_asm.
5007 - Since default sorts of type variables are now handled correctly,
5008 some datatype definitions may have to be annotated with explicit
5010 - Primrec definitions no longer require function name and type
5011 of recursive argument.
5013 Consider using isatool fixdatatype to adapt your theories and proof
5014 scripts to the new package (backup your sources first!).
5017 * HOL/record package: considerably improved implementation; now
5018 includes concrete syntax for record types, terms, updates; theorems
5019 for surjective pairing and splitting !!-bound record variables; proof
5020 support is as follows:
5022 1) standard conversions (selectors or updates applied to record
5023 constructor terms) are part of the standard simpset;
5025 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5026 made part of standard simpset and claset via addIffs;
5028 3) a tactic for record field splitting (record_split_tac) is part of
5029 the standard claset (addSWrapper);
5031 To get a better idea about these rules you may retrieve them via
5032 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5033 the name of your record type.
5035 The split tactic 3) conceptually simplifies by the following rule:
5037 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5039 Thus any record variable that is bound by meta-all will automatically
5040 blow up into some record constructor term, consequently the
5041 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5042 solve record problems automatically.
5045 * reorganized the main HOL image: HOL/Integ and String loaded by
5046 default; theory Main includes everything;
5048 * automatic simplification of integer sums and comparisons, using cancellation;
5050 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5052 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5054 * many new identities for unions, intersections, set difference, etc.;
5056 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5057 called split_if, split_split, split_sum_case and split_nat_case (to go
5058 with add/delsplits);
5060 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5061 (?x::unit) = (); this is made part of the default simpset, which COULD
5062 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5063 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5064 unit_abs_eta_conv is added in order to counter the effect of
5065 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5068 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5071 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5072 It and 'sym RS equals0D' are now in the default claset, giving automatic
5073 disjointness reasoning but breaking a few old proofs.
5075 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5076 to 'converse' from 'inverse' (for compatibility with ZF and some
5079 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5080 the well-founded relation;
5082 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5083 Compl A. The "Compl" syntax remains available as input syntax for this
5086 * HOL/Update: new theory of function updates:
5087 f(a:=b) == %x. if x=a then b else f x
5088 may also be iterated as in f(a:=b,c:=d,...);
5090 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5093 - new function list_update written xs[i:=v] that updates the i-th
5094 list position. May also be iterated as in xs[i:=a,j:=b,...].
5095 - new function `upt' written [i..j(] which generates the list
5096 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5097 bound write [i..j], which is a shorthand for [i..j+1(].
5098 - new lexicographic orderings and corresponding wellfoundedness theorems.
5101 - removed 'pred' (predecessor) function;
5102 - generalized some theorems about n-1;
5103 - many new laws about "div" and "mod";
5104 - new laws about greatest common divisors (see theory ex/Primes);
5106 * HOL/Relation: renamed the relational operator r^-1 "converse"
5107 instead of "inverse";
5109 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5110 of the multiset ordering;
5112 * directory HOL/Real: a construction of the reals using Dedekind cuts
5113 (not included by default);
5115 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5117 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5118 programs, i.e. different program variables may have different types.
5120 * calling (stac rew i) now fails if "rew" has no effect on the goal
5121 [previously, this check worked only if the rewrite rule was unconditional]
5122 Now rew can involve either definitions or equalities (either == or =).
5127 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5128 only the theorems proved on ZF.ML;
5130 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5131 It and 'sym RS equals0D' are now in the default claset, giving automatic
5132 disjointness reasoning but breaking a few old proofs.
5134 * ZF/Update: new theory of function updates
5135 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5136 may also be iterated as in f(a:=b,c:=d,...);
5138 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5140 * calling (stac rew i) now fails if "rew" has no effect on the goal
5141 [previously, this check worked only if the rewrite rule was unconditional]
5142 Now rew can involve either definitions or equalities (either == or =).
5144 * case_tac provided for compatibility with HOL
5145 (like the old excluded_middle_tac, but with subgoals swapped)
5148 *** Internal programming interfaces ***
5150 * Pure: several new basic modules made available for general use, see
5151 also src/Pure/README;
5153 * improved the theory data mechanism to support encapsulation (data
5154 kind name replaced by private Object.kind, acting as authorization
5155 key); new type-safe user interface via functor TheoryDataFun; generic
5156 print_data function becomes basically useless;
5158 * removed global_names compatibility flag -- all theory declarations
5159 are qualified by default;
5161 * module Pure/Syntax now offers quote / antiquote translation
5162 functions (useful for Hoare logic etc. with implicit dependencies);
5163 see HOL/ex/Antiquote for an example use;
5165 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5168 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5171 * Display.print_goals function moved to Locale.print_goals;
5173 * standard print function for goals supports current_goals_markers
5174 variable for marking begin of proof, end of proof, start of goal; the
5175 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5176 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5181 New in Isabelle98 (January 1998)
5182 --------------------------------
5184 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5186 * changed lexical syntax of terms / types: dots made part of long
5187 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5189 * simpset (and claset) reference variable replaced by functions
5190 simpset / simpset_ref;
5192 * no longer supports theory aliases (via merge) and non-trivial
5193 implicit merge of thms' signatures;
5195 * most internal names of constants changed due to qualified names;
5197 * changed Pure/Sequence interface (see Pure/seq.ML);
5200 *** General Changes ***
5202 * hierachically structured name spaces (for consts, types, axms, thms
5203 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5204 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5205 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5206 long_names for fully qualified output names; NOTE: ML programs
5207 (special tactics, packages etc.) referring to internal names may have
5208 to be adapted to cope with fully qualified names; in case of severe
5209 backward campatibility problems try setting 'global_names' at compile
5210 time to have enrything declared within a flat name space; one may also
5211 fine tune name declarations in theories via the 'global' and 'local'
5214 * reimplemented the implicit simpset and claset using the new anytype
5215 data filed in signatures; references simpset:simpset ref etc. are
5216 replaced by functions simpset:unit->simpset and
5217 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5218 to patch your ML files accordingly;
5220 * HTML output now includes theory graph data for display with Java
5221 applet or isatool browser; data generated automatically via isatool
5222 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5224 * defs may now be conditional; improved rewrite_goals_tac to handle
5225 conditional equations;
5227 * defs now admits additional type arguments, using TYPE('a) syntax;
5229 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5230 creates a new theory node; implicit merge of thms' signatures is
5231 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5232 transfer:theory->thm->thm in (rare) cases;
5234 * improved handling of draft signatures / theories; draft thms (and
5235 ctyps, cterms) are automatically promoted to real ones;
5237 * slightly changed interfaces for oracles: admit many per theory, named
5238 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5240 * print_goals: optional output of const types (set show_consts and
5243 * improved output of warnings (###) and errors (***);
5245 * subgoal_tac displays a warning if the new subgoal has type variables;
5247 * removed old README and Makefiles;
5249 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5251 * removed obsolete init_pps and init_database;
5253 * deleted the obsolete tactical STATE, which was declared by
5254 fun STATE tacfun st = tacfun st st;
5256 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5257 (which abbreviates $HOME);
5259 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5260 use isatool fixseq to adapt your ML programs (this works for fully
5261 qualified references to the Sequence structure only!);
5263 * use_thy no longer requires writable current directory; it always
5264 reloads .ML *and* .thy file, if either one is out of date;
5267 *** Classical Reasoner ***
5269 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5270 tactics that use classical reasoning to simplify a subgoal without
5271 splitting it into several subgoals;
5273 * Safe_tac: like safe_tac but uses the default claset;
5278 * added simplification meta rules:
5279 (asm_)(full_)simplify: simpset -> thm -> thm;
5281 * simplifier.ML no longer part of Pure -- has to be loaded by object
5284 * added prems argument to simplification procedures;
5286 * HOL, FOL, ZF: added infix function `addsplits':
5287 instead of `<simpset> setloop (split_tac <thms>)'
5288 you can simply write `<simpset> addsplits <thms>'
5293 * TYPE('a) syntax for type reflection terms;
5295 * no longer handles consts with name "" -- declare as 'syntax' instead;
5297 * pretty printer: changed order of mixfix annotation preference (again!);
5299 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5304 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5305 with `addloop' of the simplifier to faciliate case splitting in premises.
5307 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5309 * HOL/Auth: new protocol proofs including some for the Internet
5312 * HOL/Map: new theory of `maps' a la VDM;
5314 * HOL/simplifier: simplification procedures nat_cancel_sums for
5315 cancelling out common nat summands from =, <, <= (in)equalities, or
5316 differences; simplification procedures nat_cancel_factor for
5317 cancelling common factor from =, <, <= (in)equalities over natural
5318 sums; nat_cancel contains both kinds of procedures, it is installed by
5319 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5321 * HOL/simplifier: terms of the form
5322 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5324 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5325 and those of the form
5326 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5328 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5331 Each datatype `t' now comes with a theorem `split_t_case' of the form
5333 P(t_case f1 ... fn x) =
5334 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5336 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5339 and a theorem `split_t_case_asm' of the form
5341 P(t_case f1 ... fn x) =
5342 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5344 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5346 which can be added to a simpset via `addsplits'. The existing theorems
5347 expand_list_case and expand_option_case have been renamed to
5348 split_list_case and split_option_case.
5351 - `pred n' is automatically converted to `n-1'.
5352 Users are strongly encouraged not to use `pred' any longer,
5353 because it will disappear altogether at some point.
5354 - Users are strongly encouraged to write "0 < n" rather than
5355 "n ~= 0". Theorems and proof tools have been modified towards this
5359 the function "set_of_list" has been renamed "set" (and its theorems too);
5360 the function "nth" now takes its arguments in the reverse order and
5361 has acquired the infix notation "!" as in "xs!n".
5363 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5365 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5366 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5368 * HOL/record: extensible records with schematic structural subtyping
5369 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5370 still lacks various theorems and concrete record syntax;
5375 * removed "axioms" and "generated by" sections;
5377 * replaced "ops" section by extended "consts" section, which is capable of
5378 handling the continuous function space "->" directly;
5381 . proves theorems immediately and stores them in the theory,
5382 . creates hierachical name space,
5383 . now uses normal mixfix annotations (instead of cinfix...),
5384 . minor changes to some names and values (for consistency),
5385 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5386 . separator between mutual domain defs: changed "," to "and",
5387 . improved handling of sort constraints; now they have to
5388 appear on the left-hand side of the equations only;
5390 * fixed LAM <x,y,zs>.b syntax;
5392 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5393 adm (%x. P (t x)), where P is chainfinite and t continuous;
5398 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5399 with `addloop' of the simplifier to faciliate case splitting in premises.
5401 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5402 in HOL, they strip ALL and --> from proved theorems;
5406 New in Isabelle94-8 (May 1997)
5407 ------------------------------
5409 *** General Changes ***
5411 * new utilities to build / run / maintain Isabelle etc. (in parts
5412 still somewhat experimental); old Makefiles etc. still functional;
5414 * new 'Isabelle System Manual';
5416 * INSTALL text, together with ./configure and ./build scripts;
5418 * reimplemented type inference for greater efficiency, better error
5419 messages and clean internal interface;
5421 * prlim command for dealing with lots of subgoals (an easier way of
5422 setting goals_limit);
5427 * supports alternative (named) syntax tables (parser and pretty
5428 printer); internal interface is provided by add_modesyntax(_i);
5430 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5431 be used in conjunction with the Isabelle symbol font; uses the
5432 "symbols" syntax table;
5434 * added token_translation interface (may translate name tokens in
5435 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5436 the current print_mode); IMPORTANT: user print translation functions
5437 are responsible for marking newly introduced bounds
5438 (Syntax.mark_boundT);
5440 * token translations for modes "xterm" and "xterm_color" that display
5441 names in bold, underline etc. or colors (which requires a color
5444 * infixes may now be declared with names independent of their syntax;
5446 * added typed_print_translation (like print_translation, but may
5447 access type of constant);
5450 *** Classical Reasoner ***
5452 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5453 some limitations. Blast_tac...
5454 + ignores addss, addbefore, addafter; this restriction is intrinsic
5455 + ignores elimination rules that don't have the correct format
5456 (the conclusion MUST be a formula variable)
5457 + ignores types, which can make HOL proofs fail
5458 + rules must not require higher-order unification, e.g. apply_type in ZF
5459 [message "Function Var's argument not a bound variable" relates to this]
5460 + its proof strategy is more general but can actually be slower
5462 * substitution with equality assumptions no longer permutes other
5465 * minor changes in semantics of addafter (now called addaltern); renamed
5466 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5467 (and access functions for it);
5469 * improved combination of classical reasoner and simplifier:
5470 + functions for handling clasimpsets
5471 + improvement of addss: now the simplifier is called _after_ the
5473 + safe variant of addss called addSss: uses safe simplifications
5474 _during_ the safe steps. It is more complete as it allows multiple
5475 instantiations of unknowns (e.g. with slow_tac).
5479 * added interface for simplification procedures (functions that
5480 produce *proven* rewrite rules on the fly, depending on current
5483 * ordering on terms as parameter (used for ordered rewriting);
5485 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5487 * the solver is now split into a safe and an unsafe part.
5488 This should be invisible for the normal user, except that the
5489 functions setsolver and addsolver have been renamed to setSolver and
5490 addSolver; added safe_asm_full_simp_tac;
5495 * a generic induction tactic `induct_tac' which works for all datatypes and
5496 also for type `nat';
5498 * a generic case distinction tactic `exhaust_tac' which works for all
5499 datatypes and also for type `nat';
5501 * each datatype comes with a function `size';
5503 * patterns in case expressions allow tuple patterns as arguments to
5504 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5506 * primrec now also works with type nat;
5508 * recdef: a new declaration form, allows general recursive functions to be
5509 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5511 * the constant for negation has been renamed from "not" to "Not" to
5512 harmonize with FOL, ZF, LK, etc.;
5514 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5517 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5519 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5520 problems in commutative rings, using axiomatic type classes for + and *;
5522 * more examples in HOL/MiniML and HOL/Auth;
5524 * more default rewrite rules for quantifiers, union/intersection;
5526 * a new constant `arbitrary == @x.False';
5528 * HOLCF/IOA replaces old HOL/IOA;
5530 * HOLCF changes: derived all rules and arities
5531 + axiomatic type classes instead of classes
5532 + typedef instead of faking type definitions
5533 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5534 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5535 + eliminated the types void, one, tr
5536 + use unit lift and bool lift (with translations) instead of one and tr
5537 + eliminated blift from Lift3.thy (use Def instead of blift)
5538 all eliminated rules are derived as theorems --> no visible changes ;
5543 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5544 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5545 as ZF_cs addSIs [equalityI];
5549 New in Isabelle94-7 (November 96)
5550 ---------------------------------
5552 * allowing negative levels (as offsets) in prlev and choplev;
5554 * super-linear speedup for large simplifications;
5556 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5557 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5558 FAIL); can suppress it using the command Delsimps (ex_simps @
5559 all_simps); De Morgan laws are also now included, by default;
5561 * improved printing of ==> : ~:
5563 * new object-logic "Sequents" adds linear logic, while replacing LK
5564 and Modal (thanks to Sara Kalvala);
5566 * HOL/Auth: correctness proofs for authentication protocols;
5568 * HOL: new auto_tac combines rewriting and classical reasoning (many
5569 examples on HOL/Auth);
5571 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5572 the rewriter and classical reasoner simultaneously;
5574 * function uresult no longer returns theorems in "standard" format;
5575 regain previous version by: val uresult = standard o uresult;
5582 * oracles -- these establish an interface between Isabelle and trusted
5583 external reasoners, which may deliver results as theorems;
5585 * proof objects (in particular record all uses of oracles);
5587 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5589 * "constdefs" section in theory files;
5591 * "primrec" section (HOL) no longer requires names;
5593 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5600 * reduced space requirements;
5602 * automatic HTML generation from theories;
5604 * theory files no longer require "..." (quotes) around most types;
5606 * new examples, including two proofs of the Church-Rosser theorem;
5608 * non-curried (1994) version of HOL is no longer distributed;
5615 * greatly reduced space requirements;
5617 * theory files (.thy) no longer require \...\ escapes at line breaks;
5619 * searchable theorem database (see the section "Retrieving theorems" on
5620 page 8 of the Reference Manual);
5622 * new examples, including Grabczewski's monumental case study of the
5625 * The previous version of HOL renamed to Old_HOL;
5627 * The new version of HOL (previously called CHOL) uses a curried syntax
5628 for functions. Application looks like f a b instead of f(a,b);
5630 * Mutually recursive inductive definitions finally work in HOL;
5632 * In ZF, pattern-matching on tuples is now available in all abstractions and
5633 translates to the operator "split";
5640 * new infix operator, addss, allowing the classical reasoner to
5641 perform simplification at each step of its search. Example:
5642 fast_tac (cs addss ss)
5644 * a new logic, CHOL, the same as HOL, but with a curried syntax
5645 for functions. Application looks like f a b instead of f(a,b). Also pairs
5646 look like (a,b) instead of <a,b>;
5648 * PLEASE NOTE: CHOL will eventually replace HOL!
5650 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5651 It translates to the operator "split". A new theory of integers is available;
5653 * In ZF, integer numerals now denote two's-complement binary integers.
5654 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5656 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5657 of the Axiom of Choice;
5664 * Significantly faster resolution;
5666 * the different sections in a .thy file can now be mixed and repeated
5669 * Database of theorems for FOL, HOL and ZF. New
5670 commands including qed, qed_goal and bind_thm store theorems in the database.
5672 * Simple database queries: return a named theorem (get_thm) or all theorems of
5673 a given theory (thms_of), or find out what theory a theorem was proved in
5676 * Bugs fixed in the inductive definition and datatype packages;
5678 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5679 and HOL_dup_cs obsolete;
5681 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5684 * Simpler definition of function space in ZF;
5686 * new results about cardinal and ordinal arithmetic in ZF;
5688 * 'subtype' facility in HOL for introducing new types as subsets of existing
5691 :mode=text:wrap=hard:maxLineLen=72: