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 * Global versions of theorems stemming from classes do not carry
23 a parameter prefix any longer. INCOMPATIBILITY.
25 * Dropped "locale (open)". INCOMPATBILITY.
27 * Command 'interpretation' no longer attempts to simplify goal.
28 INCOMPATIBILITY: in rare situations the generated goal differs. Use
29 methods intro_locales and unfold_locales to clarify.
31 * Command 'instance': attached definitions no longer accepted.
32 INCOMPATIBILITY, use proper 'instantiation' target.
34 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
37 *** Document preparation ***
39 * Antiquotation @{lemma} now imitates a regular terminal proof,
40 demanding keyword 'by' and supporting the full method expression
41 syntax just like the Isar command 'by'.
46 * HOL/Orderings: class "wellorder" moved here, with explicit induction rule
47 "less_induct" as assumption. For instantiation of "wellorder" by means
48 of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY.
50 * HOL/Orderings: added class "preorder" as superclass of "order".
51 INCOMPATIBILITY: Instantiation proofs for order, linorder
52 etc. slightly changed. Some theorems named order_class.* now named
55 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been
56 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
57 dvd has been generalized to class comm_semiring_1. Likewise a bunch
58 of lemmas from Divides has been generalized from nat to class
59 semiring_div. INCOMPATIBILITY. This involves the following theorem
60 renames resulting from duplicate elimination:
62 dvd_def_mod ~> dvd_eq_mod_eq_0
63 zero_dvd_iff ~> dvd_0_left_iff
64 DIVISION_BY_ZERO_DIV ~> div_by_0
65 DIVISION_BY_ZERO_MOD ~> mod_by_0
66 mult_div ~> div_mult_self2_is_id
67 mult_mod ~> mod_mult_self2_is_0
69 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
70 zlcm (for int); carried together from various gcd/lcm developements in
71 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
72 corresponding theorems renamed accordingly. INCOMPATIBILY. To
73 recover tupled syntax, use syntax declarations like:
76 abbreviation gcd where
77 "gcd == (%(a, b). GCD.gcd a b)"
79 GCD.gcd ("gcd '(_, _')")
81 (analogously for lcm, zgcd, zlcm).
83 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
85 * New ML antiquotation @{code}: takes constant as argument, generates
86 corresponding code in background and inserts name of the corresponding
87 resulting ML value/function/datatype constructor binding in place.
88 All occurrences of @{code} with a single ML block are generated
89 simultaneously. Provides a generic and safe interface for
90 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
91 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
92 application. In future you ought refrain from ad-hoc compiling
93 generated SML code on the ML toplevel. Note that (for technical
94 reasons) @{code} cannot refer to constants for which user-defined
95 serializations are set. Refer to the corresponding ML counterpart
96 directly in that cases.
98 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
99 Complex_Main.thy remain as they are.
101 * New image HOL-Plain provides a minimal HOL with the most important
102 tools available (inductive, datatype, primrec, ...). By convention
103 the corresponding theory Plain should be ancestor of every further
104 (library) theory. Some library theories now have ancestor Plain
105 (instead of Main), thus theory Main occasionally has to be imported
108 * Methods "case_tac" and "induct_tac" now refer to the very same rules
109 as the structured Isar versions "cases" and "induct", cf. the
110 corresponding "cases" and "induct" attributes. Mutual induction rules
111 are now presented as a list of individual projections
112 (e.g. foo_bar.inducts for types foo and bar); the old format with
113 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
114 rare situations a different rule is selected --- notably nested tuple
115 elimination instead of former prod.exhaust: use explicit (case_tac t
116 rule: prod.exhaust) here.
118 * Attributes "cases", "induct", "coinduct" support "del" option.
120 * Removed fact "case_split_thm", which duplicates "case_split".
122 * Command 'rep_datatype': instead of theorem names the command now
123 takes a list of terms denoting the constructors of the type to be
124 represented as datatype. The characteristic theorems have to be
125 proven. INCOMPATIBILITY. Also observe that the following theorems
126 have disappeared in favour of existing ones:
128 unit_induct ~> unit.induct
129 prod_induct ~> prod.induct
130 sum_induct ~> sum.induct
131 Suc_Suc_eq ~> nat.inject
132 Suc_not_Zero Zero_not_Suc ~> nat.distinct
134 * Library/Nat_Infinity: added addition, numeral syntax and more
135 instantiations for algebraic structures. Removed some duplicate
136 theorems. Changes in simp rules. INCOMPATIBILITY.
141 * New locales for orders and lattices where the equivalence relation
142 is not restricted to equality. INCOMPATIBILITY: all order and
143 lattice locales use a record structure with field eq for the
146 * New theory of factorial domains.
148 * Units_l_inv and Units_r_inv are now simprules by default.
149 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
150 and/or r_inv will now also require deletion of these lemmas.
152 * Renamed the following theorems. INCOMPATIBILITY.
155 least_carrier ~> least_closed
156 greatest_carrier ~> greatest_closed
157 greatest_Lower_above ~> greatest_Lower_below
158 one_zero ~> carrier_one_zero
159 one_not_zero ~> carrier_one_not_zero (collision with assumption)
164 * Created new image HOL-NSA, containing theories of nonstandard
165 analysis which were previously part of HOL-Complex. Entry point
166 Hyperreal.thy remains valid, but theories formerly using
167 Complex_Main.thy should now use new entry point Hypercomplex.thy.
172 * Proof of Zorn's Lemma for partial orders.
177 * Rules and tactics that read instantiations (read_instantiate,
178 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
179 context, which is required for parsing and type-checking. Moreover,
180 the variables are specified as plain indexnames, not string encodings
181 thereof. INCOMPATIBILITY.
183 * Disposed old type and term read functions (Sign.read_def_typ,
184 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
185 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
186 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
187 Syntax.read_term_global etc.; see also OldGoals.read_term as last
188 resort for legacy applications.
190 * Antiquotations: block-structured compilation context indicated by
191 \<lbrace> ... \<rbrace>; additional antiquotation forms:
193 @{let ?pat = term} - term abbreviation (HO matching)
194 @{note name = fact} - fact abbreviation
195 @{thm fact} - singleton fact (with attributes)
196 @{thms fact} - general fact (with attributes)
197 @{lemma prop by method} - singleton goal
198 @{lemma prop by meth1 meth2} - singleton goal
199 @{lemma prop1 ... propN by method} - general goal
200 @{lemma prop1 ... propN by meth1 meth2} - general goal
201 @{lemma (open) ...} - open derivation
206 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
207 the Isabelle process into a JVM/Scala application. See
208 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
209 process wrapper has been discontinued.)
211 * Status messages (with exact source position information) are
212 emitted, if proper markup print mode is enabled. This allows
213 user-interface components to provide detailed feedback on internal
216 * Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts.
220 New in Isabelle2008 (June 2008)
221 -------------------------------
225 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
226 and updated, with formally checked references as hyperlinks.
228 * Theory loader: use_thy (and similar operations) no longer set the
229 implicit ML context, which was occasionally hard to predict and in
230 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
231 provides a proper context already.
233 * Theory loader: old-style ML proof scripts being *attached* to a thy
234 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
235 'use' within a theory file will do the job.
237 * Name space merge now observes canonical order, i.e. the second space
238 is inserted into the first one, while existing entries in the first
239 space take precedence. INCOMPATIBILITY in rare situations, may try to
242 * Syntax: symbol \<chi> is now considered a letter. Potential
243 INCOMPATIBILITY in identifier syntax etc.
245 * Outer syntax: string tokens no longer admit escaped white space,
246 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
247 white space without escapes.
249 * Outer syntax: string tokens may contain arbitrary character codes
250 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
256 * Context-dependent token translations. Default setup reverts locally
257 fixed variables, and adds hilite markup for undeclared frees.
259 * Unused theorems can be found using the new command 'unused_thms'.
260 There are three ways of invoking it:
263 Only finds unused theorems in the current theory.
265 (2) unused_thms thy_1 ... thy_n -
266 Finds unused theorems in the current theory and all of its ancestors,
267 excluding the theories thy_1 ... thy_n and all of their ancestors.
269 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
270 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
271 their ancestors, excluding the theories thy_1 ... thy_n and all of
274 In order to increase the readability of the list produced by
275 unused_thms, theorems that have been created by a particular instance
276 of a theory command such as 'inductive' or 'function' are considered
277 to belong to the same "group", meaning that if at least one theorem in
278 this group is used, the other theorems in the same group are no longer
279 reported as unused. Moreover, if all theorems in the group are
280 unused, only one theorem in the group is displayed.
282 Note that proof objects have to be switched on in order for
283 unused_thms to work properly (i.e. !proofs must be >= 1, which is
284 usually the case when using Proof General with the default settings).
286 * Authentic naming of facts disallows ad-hoc overwriting of previous
287 theorems within the same name space. INCOMPATIBILITY, need to remove
288 duplicate fact bindings, or even accidental fact duplications. Note
289 that tools may maintain dynamically scoped facts systematically, using
290 PureThy.add_thms_dynamic.
292 * Command 'hide' now allows to hide from "fact" name space as well.
294 * Eliminated destructive theorem database, simpset, claset, and
295 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
296 update of theories within ML code.
298 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
299 INCOMPATIBILITY, object-logics depending on former Pure require
300 additional setup PureThy.old_appl_syntax_setup; object-logics
301 depending on former CPure need to refer to Pure.
303 * Commands 'use' and 'ML' are now purely functional, operating on
304 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
305 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
308 * Command 'setup': discontinued implicit version with ML reference.
310 * Instantiation target allows for simultaneous specification of class
311 instance operations together with an instantiation proof.
312 Type-checking phase allows to refer to class operations uniformly.
313 See src/HOL/Complex/Complex.thy for an Isar example and
314 src/HOL/Library/Eval.thy for an ML example.
316 * Indexing of literal facts: be more serious about including only
317 facts from the visible specification/proof context, but not the
318 background context (locale etc.). Affects `prop` notation and method
319 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
322 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
323 "(open)" option, which used to expose internal bound variables to the
326 * Isar statements: removed obsolete case "rule_context".
327 INCOMPATIBILITY, better use explicit fixes/assumes.
329 * Locale proofs: default proof step now includes 'unfold_locales';
330 hence 'proof' without argument may be used to unfold locale
334 *** Document preparation ***
336 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
337 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
338 obsolete thumbpdf setup (contemporary PDF viewers do this on the
339 spot); renamed link color from "darkblue" to "linkcolor" (default
340 value unchanged, can be redefined via \definecolor); no longer sets
341 "a4paper" option (unnecessary or even intrusive).
343 * Antiquotation @{lemma A method} proves proposition A by the given
344 method (either a method name or a method name plus (optional) method
345 arguments in parentheses) and prints A just like @{prop A}.
350 * New primrec package. Specification syntax conforms in style to
351 definition/function/.... No separate induction rule is provided. The
352 "primrec" command distinguishes old-style and new-style specifications
353 by syntax. The former primrec package is now named OldPrimrecPackage.
354 When adjusting theories, beware: constants stemming from new-style
355 primrec specifications have authentic syntax.
357 * Metis prover is now an order of magnitude faster, and also works
360 * Metis: the maximum number of clauses that can be produced from a
361 theorem is now given by the attribute max_clauses. Theorems that
362 exceed this number are ignored, with a warning printed.
364 * Sledgehammer no longer produces structured proofs by default. To
365 enable, declare [[sledgehammer_full = true]]. Attributes
366 reconstruction_modulus, reconstruction_sorts renamed
367 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
369 * Method "induct_scheme" derives user-specified induction rules
370 from well-founded induction and completeness of patterns. This factors
371 out some operations that are done internally by the function package
372 and makes them available separately. See
373 src/HOL/ex/Induction_Scheme.thy for examples.
375 * More flexible generation of measure functions for termination
376 proofs: Measure functions can be declared by proving a rule of the
377 form "is_measure f" and giving it the [measure_function] attribute.
378 The "is_measure" predicate is logically meaningless (always true), and
379 just guides the heuristic. To find suitable measure functions, the
380 termination prover sets up the goal "is_measure ?f" of the appropriate
381 type and generates all solutions by prolog-style backwards proof using
384 This setup also deals with rules like
386 "is_measure f ==> is_measure (list_size f)"
388 which accommodates nested datatypes that recurse through lists.
389 Similar rules are predeclared for products and option types.
391 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
395 - Definitions of overloaded constants on sets have to be replaced by
396 definitions on => and bool.
398 - Some definitions of overloaded operators on sets can now be proved
399 using the definitions of the operators on => and bool. Therefore,
400 the following theorems have been renamed:
402 subset_def -> subset_eq
403 psubset_def -> psubset_eq
404 set_diff_def -> set_diff_eq
405 Compl_def -> Compl_eq
406 Sup_set_def -> Sup_set_eq
407 Inf_set_def -> Inf_set_eq
408 sup_set_def -> sup_set_eq
409 inf_set_def -> inf_set_eq
411 - Due to the incompleteness of the HO unification algorithm, some
412 rules such as subst may require manual instantiation, if some of
413 the unknowns in the rule is a set.
415 - Higher order unification and forward proofs:
418 have "P (S::'a set)" <...>
419 then have "EX S. P S" ..
421 no longer works (due to the incompleteness of the HO unification
422 algorithm) and must be replaced by the pattern
429 - Calculational reasoning with subst (or similar rules):
432 have "P (S::'a set)" <...>
433 also have "S = T" <...>
436 no longer works (for similar reasons as the previous example) and
437 must be replaced by something like
439 have "P (S::'a set)" <...>
440 moreover have "S = T" <...>
441 ultimately have "P T" by simp
443 - Tactics or packages written in ML code:
444 Code performing pattern matching on types via
446 Type ("set", [T]) => ...
448 must be rewritten. Moreover, functions like strip_type or
449 binder_types no longer return the right value when applied to a
452 T1 => ... => Tn => U => bool
456 T1 => ... => Tn => U set
458 * Merged theories Wellfounded_Recursion, Accessible_Part and
459 Wellfounded_Relations to theory Wellfounded.
461 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
463 * Class finite no longer treats UNIV as class parameter. Use class
464 enum from theory Library/Enum instead to achieve a similar effect.
467 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
468 and "Cons". INCOMPATIBILITY.
470 * HOL (and FOL): renamed variables in rules imp_elim and swap.
471 Potential INCOMPATIBILITY.
473 * Theory Product_Type: duplicated lemmas split_Pair_apply and
474 injective_fst_snd removed, use split_eta and prod_eqI instead.
475 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
477 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
478 the same name in theory Orderings:
488 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
489 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
490 and different variable names.
492 * Library/Option_ord.thy: Canonical order on option type.
494 * Library/RBT.thy: Red-black trees, an efficient implementation of
497 * Library/Countable.thy: Type class for countable types.
499 * Theory Int: The representation of numerals has changed. The infix
500 operator BIT and the bit datatype with constructors B0 and B1 have
501 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
502 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
503 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
506 * Theory Nat: definition of <= and < on natural numbers no longer
507 depend on well-founded relations. INCOMPATIBILITY. Definitions
508 le_def and less_def have disappeared. Consider lemmas not_less
509 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
511 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
512 (whose purpose mainly is for various fold_set functionals) have been
513 abandoned in favor of the existing algebraic classes
514 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
515 lower_semilattice (resp. upper_semilattice) and linorder.
518 * Theory Transitive_Closure: induct and cases rules now declare proper
519 case_names ("base" and "step"). INCOMPATIBILITY.
521 * Theorem Inductive.lfp_ordinal_induct generalized to complete
522 lattices. The form set-specific version is available as
523 Inductive.lfp_ordinal_induct_set.
525 * Renamed theorems "power.simps" to "power_int.simps".
528 * Class semiring_div provides basic abstract properties of semirings
529 with division and modulo operations. Subsumes former class dvd_mod.
531 * Merged theories IntDef, Numeral and IntArith into unified theory
532 Int. INCOMPATIBILITY.
534 * Theory Library/Code_Index: type "index" now represents natural
535 numbers rather than integers. INCOMPATIBILITY.
537 * New class "uminus" with operation "uminus" (split of from class
538 "minus" which now only has operation "minus", binary).
541 * Constants "card", "internal_split", "option_map" now with authentic
542 syntax. INCOMPATIBILITY.
544 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
545 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
546 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
547 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
548 Sup_set_def, le_def, less_def, option_map_def now with object
549 equality. INCOMPATIBILITY.
551 * Records. Removed K_record, and replaced it by pure lambda term
552 %x. c. The simplifier setup is now more robust against eta expansion.
553 INCOMPATIBILITY: in cases explicitly referring to K_record.
555 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
557 * Library/ListVector: new theory of arithmetic vector operations.
559 * Library/Order_Relation: new theory of various orderings as sets of
560 pairs. Defines preorders, partial orders, linear orders and
561 well-orders on sets and on types.
566 * Renamed some theories to allow to loading both ZF and HOL in the
569 Datatype -> Datatype_ZF
570 Inductive -> Inductive_ZF
577 INCOMPATIBILITY: ZF theories that import individual theories below
578 Main might need to be adapted. Regular theory Main is still
579 available, as trivial extension of Main_ZF.
584 * ML within Isar: antiquotation @{const name} or @{const
585 name(typargs)} produces statically-checked Const term.
587 * Functor NamedThmsFun: data is available to the user as dynamic fact
588 (of the same name). Removed obsolete print command.
590 * Removed obsolete "use_legacy_bindings" function.
592 * The ``print mode'' is now a thread-local value derived from a global
593 template (the former print_mode reference), thus access becomes
594 non-critical. The global print_mode reference is for session
595 management only; user-code should use print_mode_value,
596 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
598 * Functions system/system_out provide a robust way to invoke external
599 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
600 Do not use OS.Process.system etc. from the basis library!
605 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
606 in accordance with Proof General 3.7, which prefers GNU emacs.
608 * isatool tty runs Isabelle process with plain tty interaction;
609 optional line editor may be specified via ISABELLE_LINE_EDITOR
610 setting, the default settings attempt to locate "ledit" and "rlwrap".
612 * isatool browser now works with Cygwin as well, using general
613 "javapath" function defined in Isabelle process environment.
615 * YXML notation provides a simple and efficient alternative to
616 standard XML transfer syntax. See src/Pure/General/yxml.ML and
617 isatool yxml as described in the Isabelle system manual.
619 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
620 provides general wrapper for managing an Isabelle process in a robust
621 fashion, with ``cooked'' output from stdin/stderr.
623 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
624 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
626 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
627 way of changing the user's settings is via
628 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
631 * Multithreading.max_threads := 0 refers to the number of actual CPU
632 cores of the underlying machine, which is a good starting point for
633 optimal performance tuning. The corresponding usedir option -M allows
634 "max" as an alias for "0". WARNING: does not work on certain versions
635 of Mac OS (with Poly/ML 5.1).
637 * isabelle-process: non-ML sessions are run with "nice", to reduce the
638 adverse effect of Isabelle flooding interactive front-ends (notably
639 ProofGeneral / XEmacs).
643 New in Isabelle2007 (November 2007)
644 -----------------------------------
648 * More uniform information about legacy features, notably a
649 warning/error of "Legacy feature: ...", depending on the state of the
650 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
651 legacy features will disappear eventually.
653 * Theory syntax: the header format ``theory A = B + C:'' has been
654 discontinued in favour of ``theory A imports B C begin''. Use isatool
655 fixheaders to convert existing theory files. INCOMPATIBILITY.
657 * Theory syntax: the old non-Isar theory file format has been
658 discontinued altogether. Note that ML proof scripts may still be used
659 with Isar theories; migration is usually quite simple with the ML
660 function use_legacy_bindings. INCOMPATIBILITY.
662 * Theory syntax: some popular names (e.g. 'class', 'declaration',
663 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
666 * Theory loader: be more serious about observing the static theory
667 header specifications (including optional directories), but not the
668 accidental file locations of previously successful loads. The strict
669 update policy of former update_thy is now already performed by
670 use_thy, so the former has been removed; use_thys updates several
671 theories simultaneously, just as 'imports' within a theory header
672 specification, but without merging the results. Potential
673 INCOMPATIBILITY: may need to refine theory headers and commands
674 ROOT.ML which depend on load order.
676 * Theory loader: optional support for content-based file
677 identification, instead of the traditional scheme of full physical
678 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
679 (cf. the system manual). The new scheme allows to work with
680 non-finished theories in persistent session images, such that source
681 files may be moved later on without requiring reloads.
683 * Theory loader: old-style ML proof scripts being *attached* to a thy
684 file (with the same base name as the theory) are considered a legacy
685 feature, which will disappear eventually. Even now, the theory loader
686 no longer maintains dependencies on such files.
688 * Syntax: the scope for resolving ambiguities via type-inference is
689 now limited to individual terms, instead of whole simultaneous
690 specifications as before. This greatly reduces the complexity of the
691 syntax module and improves flexibility by separating parsing and
692 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
693 'fixes' etc.) are required in rare situations.
695 * Syntax: constants introduced by new-style packages ('definition',
696 'abbreviation' etc.) are passed through the syntax module in
697 ``authentic mode''. This means that associated mixfix annotations
698 really stick to such constants, independently of potential name space
699 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
700 trees are represented slightly differently, may need to adapt syntax
701 translations accordingly. Use CONST marker in 'translations' and
702 @{const_syntax} antiquotation in 'parse_translation' etc.
704 * Legacy goal package: reduced interface to the bare minimum required
705 to keep existing proof scripts running. Most other user-level
706 functions are now part of the OldGoals structure, which is *not* open
707 by default (consider isatool expandshort before open OldGoals).
708 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
709 these tend to cause confusion about the actual goal (!) context being
710 used here, which is not necessarily the same as the_context().
712 * Command 'find_theorems': supports "*" wild-card in "name:"
713 criterion; "with_dups" option. Certain ProofGeneral versions might
714 support a specific search form (see ProofGeneral/CHANGES).
716 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
717 by default, which means that "prems" (and also "fixed variables") are
718 suppressed from proof state output. Note that the ProofGeneral
719 settings mechanism allows to change and save options persistently, but
720 older versions of Isabelle will fail to start up if a negative prems
723 * Local theory targets may be specified by non-nested blocks of
724 ``context/locale/class ... begin'' followed by ``end''. The body may
725 contain definitions, theorems etc., including any derived mechanism
726 that has been implemented on top of these primitives. This concept
727 generalizes the existing ``theorem (in ...)'' towards more versatility
730 * Proof General interface: proper undo of final 'end' command;
731 discontinued Isabelle/classic mode (ML proof scripts).
734 *** Document preparation ***
736 * Added antiquotation @{theory name} which prints the given name,
737 after checking that it refers to a valid ancestor theory in the
740 * Added antiquotations @{ML_type text} and @{ML_struct text} which
741 check the given source text as ML type/structure, printing verbatim.
743 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
744 "c args == rhs" given in the current context. (Any number of
745 arguments may be given on the LHS.)
750 * The 'class' package offers a combination of axclass and locale to
751 achieve Haskell-like type classes in Isabelle. Definitions and
752 theorems within a class context produce both relative results (with
753 implicit parameters according to the locale context), and polymorphic
754 constants with qualified polymorphism (according to the class
755 context). Within the body context of a 'class' target, a separate
756 syntax layer ("user space type system") takes care of converting
757 between global polymorphic consts and internal locale representation.
758 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
759 "isatool doc classes" provides a tutorial.
761 * Generic code generator framework allows to generate executable
762 code for ML and Haskell (including Isabelle classes). A short usage
765 internal compilation:
766 export_code <list of constants (term syntax)> in SML
767 writing SML code to a file:
768 export_code <list of constants (term syntax)> in SML <filename>
769 writing OCaml code to a file:
770 export_code <list of constants (term syntax)> in OCaml <filename>
771 writing Haskell code to a bunch of files:
772 export_code <list of constants (term syntax)> in Haskell <filename>
774 evaluating closed propositions to True/False using code generation:
777 Reasonable default setup of framework in HOL.
779 Theorem attributs for selecting and transforming function equations theorems:
781 [code fun]: select a theorem as function equation for a specific constant
782 [code fun del]: deselect a theorem as function equation for a specific constant
783 [code inline]: select an equation theorem for unfolding (inlining) in place
784 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
786 User-defined serializations (target in {SML, OCaml, Haskell}):
788 code_const <and-list of constants (term syntax)>
789 {(target) <and-list of const target syntax>}+
791 code_type <and-list of type constructors>
792 {(target) <and-list of type target syntax>}+
794 code_instance <and-list of instances>
796 where instance ::= <type constructor> :: <class>
798 code_class <and_list of classes>
799 {(target) <and-list of class target syntax>}+
800 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
802 code_instance and code_class only are effective to target Haskell.
804 For example usage see src/HOL/ex/Codegenerator.thy and
805 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
806 generation from Isabelle/HOL theories is available via "isatool doc
809 * Code generator: consts in 'consts_code' Isar commands are now
810 referred to by usual term syntax (including optional type
813 * Command 'no_translations' removes translation rules from theory
816 * Overloaded definitions are now actually checked for acyclic
817 dependencies. The overloading scheme is slightly more general than
818 that of Haskell98, although Isabelle does not demand an exact
819 correspondence to type class and instance declarations.
820 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
821 exotic versions of overloading -- at the discretion of the user!
823 Polymorphic constants are represented via type arguments, i.e. the
824 instantiation that matches an instance against the most general
825 declaration given in the signature. For example, with the declaration
826 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
827 as c(nat). Overloading is essentially simultaneous structural
828 recursion over such type arguments. Incomplete specification patterns
829 impose global constraints on all occurrences, e.g. c('a * 'a) on the
830 LHS means that more general c('a * 'b) will be disallowed on any RHS.
831 Command 'print_theory' outputs the normalized system of recursive
832 equations, see section "definitions".
834 * Configuration options are maintained within the theory or proof
835 context (with name and type bool/int/string), providing a very simple
836 interface to a poor-man's version of general context data. Tools may
837 declare options in ML (e.g. using Attrib.config_int) and then refer to
838 these values using Config.get etc. Users may change options via an
839 associated attribute of the same name. This form of context
840 declaration works particularly well with commands 'declare' or
841 'using', for example ``declare [[foo = 42]]''. Thus it has become
842 very easy to avoid global references, which would not observe Isar
843 toplevel undo/redo and fail to work with multithreading.
845 Various global ML references of Pure and HOL have been turned into
846 configuration options:
848 Unify.search_bound unify_search_bound
849 Unify.trace_bound unify_trace_bound
850 Unify.trace_simp unify_trace_simp
851 Unify.trace_types unify_trace_types
852 Simplifier.simp_depth_limit simp_depth_limit
853 Blast.depth_limit blast_depth_limit
854 DatatypeProp.dtK datatype_distinctness_limit
855 fast_arith_neq_limit fast_arith_neq_limit
856 fast_arith_split_limit fast_arith_split_limit
858 * Named collections of theorems may be easily installed as context
859 data using the functor NamedThmsFun (see also
860 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
861 attributes; there is also a toplevel print command. This facility is
862 just a common case of general context data, which is the preferred way
863 for anything more complex than just a list of facts in canonical
866 * Isar: command 'declaration' augments a local theory by generic
867 declaration functions written in ML. This enables arbitrary content
868 being added to the context, depending on a morphism that tells the
869 difference of the original declaration context wrt. the application
870 context encountered later on.
872 * Isar: proper interfaces for simplification procedures. Command
873 'simproc_setup' declares named simprocs (with match patterns, and body
874 text in ML). Attribute "simproc" adds/deletes simprocs in the current
875 context. ML antiquotation @{simproc name} retrieves named simprocs.
877 * Isar: an extra pair of brackets around attribute declarations
878 abbreviates a theorem reference involving an internal dummy fact,
879 which will be ignored later --- only the effect of the attribute on
880 the background context will persist. This form of in-place
881 declarations is particularly useful with commands like 'declare' and
882 'using', for example ``have A using [[simproc a]] by simp''.
884 * Isar: method "assumption" (and implicit closing of subproofs) now
885 takes simple non-atomic goal assumptions into account: after applying
886 an assumption as a rule the resulting subgoals are solved by atomic
887 assumption steps. This is particularly useful to finish 'obtain'
888 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
889 without referring to the original premise "!!x. P x ==> thesis" in the
890 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
893 * Isar: implicit use of prems from the Isar proof context is
894 considered a legacy feature. Common applications like ``have A .''
895 may be replaced by ``have A by fact'' or ``note `A`''. In general,
896 referencing facts explicitly here improves readability and
897 maintainability of proof texts.
899 * Isar: improper proof element 'guess' is like 'obtain', but derives
900 the obtained context from the course of reasoning! For example:
902 assume "EX x y. A x & B y" -- "any previous fact"
903 then guess x and y by clarify
905 This technique is potentially adventurous, depending on the facts and
906 proof tools being involved here.
908 * Isar: known facts from the proof context may be specified as literal
909 propositions, using ASCII back-quote syntax. This works wherever
910 named facts used to be allowed so far, in proof commands, proof
911 methods, attributes etc. Literal facts are retrieved from the context
912 according to unification of type and term parameters. For example,
913 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
914 theorems in the current context, then these are valid literal facts:
915 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
917 There is also a proof method "fact" which does the same composition
918 for explicit goal states, e.g. the following proof texts coincide with
919 certain special cases of literal facts:
921 have "A" by fact == note `A`
922 have "A ==> B" by fact == note `A ==> B`
923 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
924 have "P a ==> Q a" by fact == note `P a ==> Q a`
926 * Isar: ":" (colon) is no longer a symbolic identifier character in
927 outer syntax. Thus symbolic identifiers may be used without
928 additional white space in declarations like this: ``assume *: A''.
930 * Isar: 'print_facts' prints all local facts of the current context,
931 both named and unnamed ones.
933 * Isar: 'def' now admits simultaneous definitions, e.g.:
935 def x == "t" and y == "u"
937 * Isar: added command 'unfolding', which is structurally similar to
938 'using', but affects both the goal state and facts by unfolding given
939 rewrite rules. Thus many occurrences of the 'unfold' method or
940 'unfolded' attribute may be replaced by first-class proof text.
942 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
943 and command 'unfolding' now all support object-level equalities
944 (potentially conditional). The underlying notion of rewrite rule is
945 analogous to the 'rule_format' attribute, but *not* that of the
946 Simplifier (which is usually more generous).
948 * Isar: the new attribute [rotated n] (default n = 1) rotates the
949 premises of a theorem by n. Useful in conjunction with drule.
951 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
952 method expression within a sandbox consisting of the first N
953 sub-goals, which need to exist. For example, ``simp_all [3]''
954 simplifies the first three sub-goals, while (rule foo, simp_all)[]
955 simplifies all new goals that emerge from applying rule foo to the
956 originally first one.
958 * Isar: schematic goals are no longer restricted to higher-order
959 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
962 * Isar: the conclusion of a long theorem statement is now either
963 'shows' (a simultaneous conjunction, as before), or 'obtains'
964 (essentially a disjunction of cases with local parameters and
965 assumptions). The latter allows to express general elimination rules
966 adequately; in this notation common elimination rules look like this:
968 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
970 obtains x where "P x"
972 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
976 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
982 The subsequent classical rules even refer to the formal "thesis"
985 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
988 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
989 obtains "thesis ==> something"
991 The actual proof of an 'obtains' statement is analogous to that of the
992 Isar proof element 'obtain', only that there may be several cases.
993 Optional case names may be specified in parentheses; these will be
994 available both in the present proof and as annotations in the
995 resulting rule, for later use with the 'cases' method (cf. attribute
998 * Isar: the assumptions of a long theorem statement are available as
999 "assms" fact in the proof context. This is more appropriate than the
1000 (historical) "prems", which refers to all assumptions of the current
1001 context, including those from the target locale, proof body etc.
1003 * Isar: 'print_statement' prints theorems from the current theory or
1004 proof context in long statement form, according to the syntax of a
1007 * Isar: 'obtain' takes an optional case name for the local context
1008 introduction rule (default "that").
1010 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1011 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1014 * Pure: syntax "CONST name" produces a fully internalized constant
1015 according to the current context. This is particularly useful for
1016 syntax translations that should refer to internal constant
1017 representations independently of name spaces.
1019 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1020 instead of "FOO ". This allows multiple binder declarations to coexist
1021 in the same context. INCOMPATIBILITY.
1023 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1024 primitive that also works in a locale context (both for constants and
1025 fixed variables). Type declaration and internal syntactic representation
1026 of given constants retrieved from the context. Likewise, the
1027 'no_notation' command allows to remove given syntax annotations from the
1030 * Isar/locales: new derived specification elements 'axiomatization',
1031 'definition', 'abbreviation', which support type-inference, admit
1032 object-level specifications (equality, equivalence). See also the
1033 isar-ref manual. Examples:
1036 eq (infix "===" 50) where
1037 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1039 definition "f x y = x + y + 1"
1040 definition g where "g x = f x x"
1043 neq (infix "=!=" 50) where
1044 "x =!= y == ~ (x === y)"
1046 These specifications may be also used in a locale context. Then the
1047 constants being introduced depend on certain fixed parameters, and the
1048 constant name is qualified by the locale base name. An internal
1049 abbreviation takes care for convenient input and output, making the
1050 parameters implicit and using the original short name. See also
1051 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1052 entities from a monomorphic theory.
1054 Presently, abbreviations are only available 'in' a target locale, but
1055 not inherited by general import expressions. Also note that
1056 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1057 'translations' in common applications. The "no_abbrevs" print mode
1058 prevents folding of abbreviations in term output.
1060 Concrete syntax is attached to specified constants in internal form,
1061 independently of name spaces. The parse tree representation is
1062 slightly different -- use 'notation' instead of raw 'syntax', and
1063 'translations' with explicit "CONST" markup to accommodate this.
1065 * Pure/Isar: unified syntax for new-style specification mechanisms
1066 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1067 full type inference and dummy patterns ("_"). For example:
1069 definition "K x _ = x"
1071 inductive conj for A B
1072 where "A ==> B ==> conj A B"
1074 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1075 the current context. Print mode "no_abbrevs" prevents inversion of
1076 abbreviations on output.
1078 * Isar/locales: improved parameter handling: use of locales "var" and
1079 "struct" no longer necessary; - parameter renamings are no longer
1080 required to be injective. For example, this allows to define
1081 endomorphisms as locale endom = homom mult mult h.
1083 * Isar/locales: changed the way locales with predicates are defined.
1084 Instead of accumulating the specification, the imported expression is
1085 now an interpretation. INCOMPATIBILITY: different normal form of
1086 locale expressions. In particular, in interpretations of locales with
1087 predicates, goals repesenting already interpreted fragments are not
1088 removed automatically. Use methods `intro_locales' and
1089 `unfold_locales'; see below.
1091 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1092 provide backward reasoning on locales predicates. The methods are
1093 aware of interpretations and discharge corresponding goals.
1094 `intro_locales' is less aggressive then `unfold_locales' and does not
1095 unfold predicates to assumptions.
1097 * Isar/locales: the order in which locale fragments are accumulated
1098 has changed. This enables to override declarations from fragments due
1099 to interpretations -- for example, unwanted simp rules.
1101 * Isar/locales: interpretation in theories and proof contexts has been
1102 extended. One may now specify (and prove) equations, which are
1103 unfolded in interpreted theorems. This is useful for replacing
1104 defined concepts (constants depending on locale parameters) by
1105 concepts already existing in the target context. Example:
1107 interpretation partial_order ["op <= :: [int, int] => bool"]
1108 where "partial_order.less (op <=) (x::int) y = (x < y)"
1110 Typically, the constant `partial_order.less' is created by a
1111 definition specification element in the context of locale
1114 * Method "induct": improved internal context management to support
1115 local fixes and defines on-the-fly. Thus explicit meta-level
1116 connectives !! and ==> are rarely required anymore in inductive goals
1117 (using object-logic connectives for this purpose has been long
1118 obsolete anyway). Common proof patterns are explained in
1119 src/HOL/Induct/Common_Patterns.thy, see also
1120 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1123 * Method "induct": improved handling of simultaneous goals. Instead of
1124 introducing object-level conjunction, the statement is now split into
1125 several conclusions, while the corresponding symbolic cases are nested
1126 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1127 see src/HOL/Induct/Common_Patterns.thy, for example.
1129 * Method "induct": mutual induction rules are now specified as a list
1130 of rule sharing the same induction cases. HOL packages usually provide
1131 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1132 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1133 mutual induction rules differently, i.e. like this:
1135 (induct rule: foo_bar.inducts)
1136 (induct set: foo bar)
1137 (induct pred: foo bar)
1138 (induct type: foo bar)
1140 The ML function ProjectRule.projections turns old-style rules into the
1143 * Method "coinduct": dual of induction, see
1144 src/HOL/Library/Coinductive_List.thy for various examples.
1146 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1147 considered a legacy feature.
1149 * Attribute "symmetric" produces result with standardized schematic
1150 variables (index 0). Potential INCOMPATIBILITY.
1152 * Simplifier: by default the simplifier trace only shows top level
1153 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1154 default. Thus there is less danger of being flooded by the trace. The
1155 trace indicates where parts have been suppressed.
1157 * Provers/classical: removed obsolete classical version of elim_format
1158 attribute; classical elim/dest rules are now treated uniformly when
1159 manipulating the claset.
1161 * Provers/classical: stricter checks to ensure that supplied intro,
1162 dest and elim rules are well-formed; dest and elim rules must have at
1165 * Provers/classical: attributes dest/elim/intro take an optional
1166 weight argument for the rule (just as the Pure versions). Weights are
1167 ignored by automated tools, but determine the search order of single
1170 * Syntax: input syntax now supports dummy variable binding "%_. b",
1171 where the body does not mention the bound variable. Note that dummy
1172 patterns implicitly depend on their context of bounds, which makes
1173 "{_. _}" match any set comprehension as expected. Potential
1174 INCOMPATIBILITY -- parse translations need to cope with syntactic
1175 constant "_idtdummy" in the binding position.
1177 * Syntax: removed obsolete syntactic constant "_K" and its associated
1178 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1179 for example "A -> B" => "Pi A (%_. B)".
1181 * Pure: 'class_deps' command visualizes the subclass relation, using
1182 the graph browser tool.
1184 * Pure: 'print_theory' now suppresses certain internal declarations by
1185 default; use '!' option for full details.
1190 * Method "metis" proves goals by applying the Metis general-purpose
1191 resolution prover (see also http://gilith.com/software/metis/).
1192 Examples are in the directory MetisExamples. WARNING: the
1193 Isabelle/HOL-Metis integration does not yet work properly with
1196 * Command 'sledgehammer' invokes external automatic theorem provers as
1197 background processes. It generates calls to the "metis" method if
1198 successful. These can be pasted into the proof. Users do not have to
1199 wait for the automatic provers to return. WARNING: does not really
1200 work with multi-threading.
1202 * New "auto_quickcheck" feature tests outermost goal statements for
1203 potential counter-examples. Controlled by ML references
1204 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1205 5000 milliseconds). Fails silently if statements is outside of
1206 executable fragment, or any other codgenerator problem occurs.
1208 * New constant "undefined" with axiom "undefined x = undefined".
1210 * Added class "HOL.eq", allowing for code generation with polymorphic
1213 * Some renaming of class constants due to canonical name prefixing in
1214 the new 'class' package:
1216 HOL.abs ~> HOL.abs_class.abs
1217 HOL.divide ~> HOL.divide_class.divide
1218 0 ~> HOL.zero_class.zero
1219 1 ~> HOL.one_class.one
1220 op + ~> HOL.plus_class.plus
1221 op - ~> HOL.minus_class.minus
1222 uminus ~> HOL.minus_class.uminus
1223 op * ~> HOL.times_class.times
1224 op < ~> HOL.ord_class.less
1225 op <= > HOL.ord_class.less_eq
1226 Nat.power ~> Power.power_class.power
1227 Nat.size ~> Nat.size_class.size
1228 Numeral.number_of ~> Numeral.number_class.number_of
1229 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1230 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1231 Orderings.min ~> Orderings.ord_class.min
1232 Orderings.max ~> Orderings.ord_class.max
1233 Divides.op div ~> Divides.div_class.div
1234 Divides.op mod ~> Divides.div_class.mod
1235 Divides.op dvd ~> Divides.div_class.dvd
1237 INCOMPATIBILITY. Adaptions may be required in the following cases:
1239 a) User-defined constants using any of the names "plus", "minus",
1240 "times", "less" or "less_eq". The standard syntax translations for
1241 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1244 b) Variables named "plus", "minus", "times", "less", "less_eq"
1245 INCOMPATIBILITY: use more specific names.
1247 c) Permutative equations (e.g. "a + b = b + a")
1248 Since the change of names also changes the order of terms, permutative
1249 rewrite rules may get applied in a different order. Experience shows
1250 that this is rarely the case (only two adaptions in the whole Isabelle
1251 distribution). INCOMPATIBILITY: rewrite proofs
1253 d) ML code directly refering to constant names
1254 This in general only affects hand-written proof tactics, simprocs and
1255 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1256 Consider using @{const_name} antiquotation.
1258 * New class "default" with associated constant "default".
1260 * Function "sgn" is now overloaded and available on int, real, complex
1261 (and other numeric types), using class "sgn". Two possible defs of
1262 sgn are given as equational assumptions in the classes sgn_if and
1263 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1266 * Locale "partial_order" now unified with class "order" (cf. theory
1267 Orderings), added parameter "less". INCOMPATIBILITY.
1269 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1270 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1271 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1273 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1274 changed order of proof goals in instance proofs.
1276 * The transitivity reasoner for partial and linear orders is set up
1277 for classes "order" and "linorder". Instances of the reasoner are available
1278 in all contexts importing or interpreting the corresponding locales.
1279 Method "order" invokes the reasoner separately; the reasoner
1280 is also integrated with the Simplifier as a solver. Diagnostic
1281 command 'print_orders' shows the available instances of the reasoner
1282 in the current context.
1284 * Localized monotonicity predicate in theory "Orderings"; integrated
1285 lemmas max_of_mono and min_of_mono with this predicate.
1288 * Formulation of theorem "dense" changed slightly due to integration
1289 with new class dense_linear_order.
1291 * Uniform lattice theory development in HOL.
1293 constants "meet" and "join" now named "inf" and "sup"
1294 constant "Meet" now named "Inf"
1296 classes "meet_semilorder" and "join_semilorder" now named
1297 "lower_semilattice" and "upper_semilattice"
1298 class "lorder" now named "lattice"
1299 class "comp_lat" now named "complete_lattice"
1301 Instantiation of lattice classes allows explicit definitions
1302 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1304 INCOMPATIBILITY. Theorem renames:
1306 meet_left_le ~> inf_le1
1307 meet_right_le ~> inf_le2
1308 join_left_le ~> sup_ge1
1309 join_right_le ~> sup_ge2
1310 meet_join_le ~> inf_sup_ord
1313 le_meet ~> le_inf_iff
1314 le_join ~> ge_sup_conv
1315 meet_idempotent ~> inf_idem
1316 join_idempotent ~> sup_idem
1317 meet_comm ~> inf_commute
1318 join_comm ~> sup_commute
1319 meet_leI1 ~> le_infI1
1320 meet_leI2 ~> le_infI2
1321 le_joinI1 ~> le_supI1
1322 le_joinI2 ~> le_supI2
1323 meet_assoc ~> inf_assoc
1324 join_assoc ~> sup_assoc
1325 meet_left_comm ~> inf_left_commute
1326 meet_left_idempotent ~> inf_left_idem
1327 join_left_comm ~> sup_left_commute
1328 join_left_idempotent ~> sup_left_idem
1331 le_def_meet ~> le_iff_inf
1332 le_def_join ~> le_iff_sup
1333 join_absorp2 ~> sup_absorb2
1334 join_absorp1 ~> sup_absorb1
1335 meet_absorp1 ~> inf_absorb1
1336 meet_absorp2 ~> inf_absorb2
1337 meet_join_absorp ~> inf_sup_absorb
1338 join_meet_absorp ~> sup_inf_absorb
1339 distrib_join_le ~> distrib_sup_le
1340 distrib_meet_le ~> distrib_inf_le
1342 add_meet_distrib_left ~> add_inf_distrib_left
1343 add_join_distrib_left ~> add_sup_distrib_left
1344 is_join_neg_meet ~> is_join_neg_inf
1345 is_meet_neg_join ~> is_meet_neg_sup
1346 add_meet_distrib_right ~> add_inf_distrib_right
1347 add_join_distrib_right ~> add_sup_distrib_right
1348 add_meet_join_distribs ~> add_sup_inf_distribs
1349 join_eq_neg_meet ~> sup_eq_neg_inf
1350 meet_eq_neg_join ~> inf_eq_neg_sup
1351 add_eq_meet_join ~> add_eq_inf_sup
1352 meet_0_imp_0 ~> inf_0_imp_0
1353 join_0_imp_0 ~> sup_0_imp_0
1354 meet_0_eq_0 ~> inf_0_eq_0
1355 join_0_eq_0 ~> sup_0_eq_0
1356 neg_meet_eq_join ~> neg_inf_eq_sup
1357 neg_join_eq_meet ~> neg_sup_eq_inf
1358 join_eq_if ~> sup_eq_if
1360 mono_meet ~> mono_inf
1361 mono_join ~> mono_sup
1362 meet_bool_eq ~> inf_bool_eq
1363 join_bool_eq ~> sup_bool_eq
1364 meet_fun_eq ~> inf_fun_eq
1365 join_fun_eq ~> sup_fun_eq
1366 meet_set_eq ~> inf_set_eq
1367 join_set_eq ~> sup_set_eq
1368 meet1_iff ~> inf1_iff
1369 meet2_iff ~> inf2_iff
1378 join1_iff ~> sup1_iff
1379 join2_iff ~> sup2_iff
1389 is_meet_Meet ~> is_meet_Inf
1390 Meet_bool_def ~> Inf_bool_def
1391 Meet_fun_def ~> Inf_fun_def
1392 Meet_greatest ~> Inf_greatest
1393 Meet_lower ~> Inf_lower
1394 Meet_set_def ~> Inf_set_def
1397 Sup_bool_eq ~> Sup_bool_def
1398 Sup_fun_eq ~> Sup_fun_def
1399 Sup_set_eq ~> Sup_set_def
1401 listsp_meetI ~> listsp_infI
1402 listsp_meet_eq ~> listsp_inf_eq
1407 * Added syntactic class "size"; overloaded constant "size" now has
1408 type "'a::size ==> bool"
1410 * Internal reorganisation of `size' of datatypes: size theorems
1411 "foo.size" are no longer subsumed by "foo.simps" (but are still
1412 simplification rules by default!); theorems "prod.size" now named
1415 * Class "div" now inherits from class "times" rather than "type".
1418 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1419 Linorder etc. have disappeared; operations defined in terms of
1420 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1422 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1424 * HOL-Word: New extensive library and type for generic, fixed size
1425 machine words, with arithemtic, bit-wise, shifting and rotating
1426 operations, reflection into int, nat, and bool lists, automation for
1427 linear arithmetic (by automatic reflection into nat or int), including
1428 lemmas on overflow and monotonicity. Instantiated to all appropriate
1429 arithmetic type classes, supporting automatic simplification of
1430 numerals on all operations.
1432 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1434 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1436 * Code generator library theories:
1437 - Code_Integer represents HOL integers by big integer literals in target
1439 - Code_Char represents HOL characters by character literals in target
1441 - Code_Char_chr like Code_Char, but also offers treatment of character
1442 codes; includes Code_Integer.
1443 - Executable_Set allows to generate code for finite sets using lists.
1444 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1446 - Executable_Real implements a subset of real numbers, namly those
1447 representable by rational numbers.
1448 - Efficient_Nat implements natural numbers by integers, which in general will
1449 result in higher efficency; pattern matching with 0/Suc is eliminated;
1450 includes Code_Integer.
1451 - Code_Index provides an additional datatype index which is mapped to
1452 target-language built-in integers.
1453 - Code_Message provides an additional datatype message_string which is isomorphic to
1454 strings; messages are mapped to target-language strings.
1456 * New package for inductive predicates
1458 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1461 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1462 for z_1 :: U_1 and ... and z_n :: U_m
1464 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1467 with full support for type-inference, rather than
1469 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1471 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1472 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1474 inductive "s z_1 ... z_m"
1476 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1479 For backward compatibility, there is a wrapper allowing inductive
1480 sets to be defined with the new package via
1483 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1484 for z_1 :: U_1 and ... and z_n :: U_m
1486 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1492 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1493 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1494 for z_1 :: U_1 and ... and z_n :: U_m
1496 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1497 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1500 if the additional syntax "p ..." is required.
1502 Numerous examples can be found in the subdirectories src/HOL/Auth,
1503 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1507 - Since declaration and definition of inductive sets or predicates
1508 is no longer separated, abbreviations involving the newly
1509 introduced sets or predicates must be specified together with the
1510 introduction rules after the 'where' keyword (see above), rather
1511 than before the actual inductive definition.
1513 - The variables in induction and elimination rules are now
1514 quantified in the order of their occurrence in the introduction
1515 rules, rather than in alphabetical order. Since this may break
1516 some proofs, these proofs either have to be repaired, e.g. by
1517 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1518 statements of the form
1520 case (rule_i a_i_1 ... a_i_{k_i})
1522 or the old order of quantification has to be restored by explicitly adding
1523 meta-level quantifiers in the introduction rules, i.e.
1525 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1527 - The format of the elimination rules is now
1529 p z_1 ... z_m x_1 ... x_n ==>
1530 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1535 (x_1, ..., x_n) : s z_1 ... z_m ==>
1536 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1539 for sets rather than
1541 x : s z_1 ... z_m ==>
1542 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1545 This may require terms in goals to be expanded to n-tuples
1546 (e.g. using case_tac or simplification with the split_paired_all
1547 rule) before the above elimination rule is applicable.
1549 - The elimination or case analysis rules for (mutually) inductive
1550 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1551 list of rules "p_1_..._p_k.elims" is no longer available.
1553 * New package "function"/"fun" for general recursive functions,
1554 supporting mutual and nested recursion, definitions in local contexts,
1555 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1556 for small examples, and the separate tutorial on the function
1557 package. The old recdef "package" is still available as before, but
1558 users are encouraged to use the new package.
1560 * Method "lexicographic_order" automatically synthesizes termination
1561 relations as lexicographic combinations of size measures.
1563 * Case-expressions allow arbitrary constructor-patterns (including
1564 "_") and take their order into account, like in functional
1565 programming. Internally, this is translated into nested
1566 case-expressions; missing cases are added and mapped to the predefined
1567 constant "undefined". In complicated cases printing may no longer show
1568 the original input but the internal form. Lambda-abstractions allow
1569 the same form of pattern matching: "% pat1 => e1 | ..." is an
1570 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1573 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1574 is an abbreviation for "of_nat :: nat => int". The simplification
1575 rules for "of_nat" have been changed to work like "int" did
1576 previously. Potential INCOMPATIBILITY:
1577 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1578 - of_nat_diff and of_nat_mult are no longer default simp rules
1580 * Method "algebra" solves polynomial equations over (semi)rings using
1581 Groebner bases. The (semi)ring structure is defined by locales and the
1582 tool setup depends on that generic context. Installing the method for
1583 a specific type involves instantiating the locale and possibly adding
1584 declarations for computation on the coefficients. The method is
1585 already instantiated for natural numbers and for the axiomatic class
1586 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1587 CALCULEMUS 2007 for the general principles underlying this
1588 architecture of context-aware proof-tools.
1590 * Method "ferrack" implements quantifier elimination over
1591 special-purpose dense linear orders using locales (analogous to
1592 "algebra"). The method is already installed for class
1593 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1596 * Former constant "List.op @" now named "List.append". Use ML
1597 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1598 circumvent possible incompatibilities when working on ML level.
1600 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1602 * New function listsum :: 'a list => 'a for arbitrary monoids.
1603 Special syntax: "SUM x <- xs. f x" (and latex variants)
1605 * New syntax for Haskell-like list comprehension (input only), eg.
1606 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1608 * The special syntax for function "filter" has changed from [x :
1609 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1610 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1612 * [a..b] is now defined for arbitrary linear orders. It used to be
1613 defined on nat only, as an abbreviation for [a..<Suc b]
1616 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1618 * New functions "sorted" and "sort" in src/HOL/List.thy.
1620 * New lemma collection field_simps (an extension of ring_simps) for
1621 manipulating (in)equations involving division. Multiplies with all
1622 denominators that can be proved to be non-zero (in equations) or
1623 positive/negative (in inequations).
1625 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1626 have been improved and renamed to ring_simps, group_simps and
1627 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1628 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1630 * Theory Library/Commutative_Ring: switched from recdef to function
1631 package; constants add, mul, pow now curried. Infix syntax for
1632 algebraic operations.
1634 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1637 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1640 * HOL/records: generalised field-update to take a function on the
1641 field rather than the new value: r(|A := x|) is translated to A_update
1642 (K x) r The K-combinator that is internally used is called K_record.
1643 INCOMPATIBILITY: Usage of the plain update functions has to be
1646 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1647 * x = 0, which are required for a semiring. Richer structures do not
1648 inherit from semiring_0 anymore, because this property is a theorem
1649 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1650 there is more to prove, but this is mostly trivial.
1652 * Class "recpower" is generalized to arbitrary monoids, not just
1653 commutative semirings. INCOMPATIBILITY: may need to incorporate
1654 commutativity or semiring properties additionally.
1656 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1657 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1658 better use 'abbreviation'.
1660 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1662 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1663 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1664 significant changes for setting up numeral syntax for types:
1665 - New constants Numeral.pred and Numeral.succ instead
1666 of former Numeral.bin_pred and Numeral.bin_succ.
1667 - Use integer operations instead of bin_add, bin_mult and so on.
1668 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1669 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1671 See src/HOL/Integ/IntArith.thy for an example setup.
1673 * Command 'normal_form' computes the normal form of a term that may
1674 contain free variables. For example ``normal_form "rev [a, b, c]"''
1675 produces ``[b, c, a]'' (without proof). This command is suitable for
1676 heavy-duty computations because the functions are compiled to ML
1677 first. Correspondingly, a method "normalization" is provided. See
1678 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1680 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1681 25 like -->); output depends on the "iff" print_mode, the default is
1682 "A = B" (with priority 50).
1684 * Relations less (<) and less_eq (<=) are also available on type bool.
1685 Modified syntax to disallow nesting without explicit parentheses,
1686 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1689 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1691 * Relation composition operator "op O" now has precedence 75 and binds
1692 stronger than union and intersection. INCOMPATIBILITY.
1694 * The old set interval syntax "{m..n(}" (and relatives) has been
1695 removed. Use "{m..<n}" (and relatives) instead.
1697 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1698 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1699 ``declare [[simproc del: neq]]''.
1701 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1704 * Theorem Cons_eq_map_conv no longer declared as "simp".
1706 * Theorem setsum_mult renamed to setsum_right_distrib.
1708 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1711 * Reimplemented methods "sat" and "satx", with several improvements:
1712 goals no longer need to be stated as "<prems> ==> False", equivalences
1713 (i.e. "=" on type bool) are handled, variable names of the form
1714 "lit_<n>" are no longer reserved, significant speedup.
1716 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1717 zChaff is still supported as well.
1719 * 'inductive' and 'datatype': provide projections of mutual rules,
1720 bundled as foo_bar.inducts;
1722 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1725 * Library: moved theory Accessible_Part to main HOL.
1727 * Library: added theory Coinductive_List of potentially infinite lists
1728 as greatest fixed-point.
1730 * Library: added theory AssocList which implements (finite) maps as
1733 * Method "evaluation" solves goals (i.e. a boolean expression)
1734 efficiently by compiling it to ML. The goal is "proved" (via an
1735 oracle) if it evaluates to True.
1737 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1738 also when invoked by the simplifier. This results in the Simplifier
1739 being more powerful on arithmetic goals. INCOMPATIBILITY.
1740 Configuration option fast_arith_split_limit=0 recovers the old
1743 * Support for hex (0x20) and binary (0b1001) numerals.
1745 * New method: reify eqs (t), where eqs are equations for an
1746 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1747 parameter, computes a term s::'b and a list xs::'a list and proves the
1748 theorem I xs s = t. This is also known as reification or quoting. The
1749 resulting theorem is applied to the subgoal to substitute t with I xs
1750 s. If t is omitted, the subgoal itself is reified.
1752 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1753 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1754 where f is supposed to be a computable function (in the sense of code
1755 generattion). The method uses reify to compute s and xs as above then
1756 applies corr_thm and uses normalization by evaluation to "prove" f s =
1757 r and finally gets the theorem t = r, which is again applied to the
1758 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1760 * Reflection: Automatic reification now handels binding, an example is
1761 available in src/HOL/ex/ReflectionEx.thy
1763 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1764 command 'statespace' that is similar to 'record', but introduces an
1765 abstract specification based on the locale infrastructure instead of
1766 HOL types. This leads to extra flexibility in composing state spaces,
1767 in particular multiple inheritance and renaming of components.
1772 * Hyperreal: Functions root and sqrt are now defined on negative real
1773 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1774 Nonnegativity side conditions have been removed from many lemmas, so
1775 that more subgoals may now be solved by simplification; potential
1778 * Real: new type classes formalize real normed vector spaces and
1779 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1780 and norm :: 'a => real.
1782 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1783 reals into other types. The overloaded constant Reals :: 'a set is now
1784 defined as range of_real; potential INCOMPATIBILITY.
1786 * Real: proper support for ML code generation, including 'quickcheck'.
1787 Reals are implemented as arbitrary precision rationals.
1789 * Hyperreal: Several constants that previously worked only for the
1790 reals have been generalized, so they now work over arbitrary vector
1791 spaces. Type annotations may need to be added in some cases; potential
1794 Infinitesimal :: ('a::real_normed_vector) star set
1795 HFinite :: ('a::real_normed_vector) star set
1796 HInfinite :: ('a::real_normed_vector) star set
1797 approx :: ('a::real_normed_vector) star => 'a star => bool
1798 monad :: ('a::real_normed_vector) star => 'a star set
1799 galaxy :: ('a::real_normed_vector) star => 'a star set
1800 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1801 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1802 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1803 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1804 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
1805 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
1806 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
1807 sgn :: 'a::real_normed_vector => 'a
1808 exp :: 'a::{recpower,real_normed_field,banach} => 'a
1810 * Complex: Some complex-specific constants are now abbreviations for
1811 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
1812 hnorm. Other constants have been entirely removed in favor of the
1813 polymorphic versions (INCOMPATIBILITY):
1817 HInfinite <-- CInfinite
1818 Infinitesimal <-- CInfinitesimal
1821 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
1822 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
1823 (ns)deriv <-- (ns)cderiv
1828 * Formalisation of ideals and the quotient construction over rings.
1830 * Order and lattice theory no longer based on records.
1833 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
1834 greatest_closed. INCOMPATIBILITY.
1836 * Method algebra is now set up via an attribute. For examples see
1837 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
1838 of algebraic structures.
1840 * Renamed theory CRing to Ring.
1845 * Substantial, yet incomplete support for nominal datatypes (binding
1846 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
1847 src/HOL/Nominal/Examples. Prospective users should consult
1848 http://isabelle.in.tum.de/nominal/
1853 * ML basics: just one true type int, which coincides with IntInf.int
1856 * ML within Isar: antiquotations allow to embed statically-checked
1857 formal entities in the source, referring to the context available at
1858 compile-time. For example:
1860 ML {* @{sort "{zero,one}"} *}
1861 ML {* @{typ "'a => 'b"} *}
1862 ML {* @{term "%x. x"} *}
1863 ML {* @{prop "x == y"} *}
1864 ML {* @{ctyp "'a => 'b"} *}
1865 ML {* @{cterm "%x. x"} *}
1866 ML {* @{cprop "x == y"} *}
1867 ML {* @{thm asm_rl} *}
1868 ML {* @{thms asm_rl} *}
1869 ML {* @{type_name c} *}
1870 ML {* @{type_syntax c} *}
1871 ML {* @{const_name c} *}
1872 ML {* @{const_syntax c} *}
1875 ML {* @{theory Pure} *}
1876 ML {* @{theory_ref} *}
1877 ML {* @{theory_ref Pure} *}
1880 ML {* @{clasimpset} *}
1882 The same works for sources being ``used'' within an Isar context.
1884 * ML in Isar: improved error reporting; extra verbosity with
1885 ML_Context.trace enabled.
1887 * Pure/General/table.ML: the join operations now works via exceptions
1888 DUP/SAME instead of type option. This is simpler in simple cases, and
1889 admits slightly more efficient complex applications.
1891 * Pure: 'advanced' translation functions (parse_translation etc.) now
1892 use Context.generic instead of just theory.
1894 * Pure: datatype Context.generic joins theory/Proof.context and
1895 provides some facilities for code that works in either kind of
1896 context, notably GenericDataFun for uniform theory and proof data.
1898 * Pure: simplified internal attribute type, which is now always
1899 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
1900 local (Proof.context) attributes have been discontinued, while
1901 minimizing code duplication. Thm.rule_attribute and
1902 Thm.declaration_attribute build canonical attributes; see also structure
1903 Context for further operations on Context.generic, notably
1904 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
1905 declarations and definitions.
1907 * Context data interfaces (Theory/Proof/GenericDataFun): removed
1908 name/print, uninitialized data defaults to ad-hoc copy of empty value,
1909 init only required for impure data. INCOMPATIBILITY: empty really need
1910 to be empty (no dependencies on theory content!)
1912 * Pure/kernel: consts certification ignores sort constraints given in
1913 signature declarations. (This information is not relevant to the
1914 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
1915 potential INCOMPATIBILITY.
1917 * Pure: axiomatic type classes are now purely definitional, with
1918 explicit proofs of class axioms and super class relations performed
1919 internally. See Pure/axclass.ML for the main internal interfaces --
1920 notably AxClass.define_class supercedes AxClass.add_axclass, and
1921 AxClass.axiomatize_class/classrel/arity supersede
1922 Sign.add_classes/classrel/arities.
1924 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
1925 global/local versions on theory vs. Proof.context have been
1926 discontinued; Attrib.syntax and Method.syntax have been adapted
1927 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
1928 attributes, methods, etc.
1930 * Pure: several functions of signature "... -> theory -> theory * ..."
1931 have been reoriented to "... -> theory -> ... * theory" in order to
1932 allow natural usage in combination with the ||>, ||>>, |-> and
1933 fold_map combinators.
1935 * Pure: official theorem names (closed derivations) and additional
1936 comments (tags) are now strictly separate. Name hints -- which are
1937 maintained as tags -- may be attached any time without affecting the
1940 * Pure: primitive rule lift_rule now takes goal cterm instead of an
1941 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
1942 achieve the old behaviour.
1944 * Pure: the "Goal" constant is now called "prop", supporting a
1945 slightly more general idea of ``protecting'' meta-level rule
1948 * Pure: Logic.(un)varify only works in a global context, which is now
1949 enforced instead of silently assumed. INCOMPATIBILITY, may use
1950 Logic.legacy_(un)varify as temporary workaround.
1952 * Pure: structure Name provides scalable operations for generating
1953 internal variable names, notably Name.variants etc. This replaces
1954 some popular functions from term.ML:
1956 Term.variant -> Name.variant
1957 Term.variantlist -> Name.variant_list
1958 Term.invent_names -> Name.invent_list
1960 Note that low-level renaming rarely occurs in new code -- operations
1961 from structure Variable are used instead (see below).
1963 * Pure: structure Variable provides fundamental operations for proper
1964 treatment of fixed/schematic variables in a context. For example,
1965 Variable.import introduces fixes for schematics of given facts and
1966 Variable.export reverses the effect (up to renaming) -- this replaces
1967 various freeze_thaw operations.
1969 * Pure: structure Goal provides simple interfaces for
1970 init/conclude/finish and tactical prove operations (replacing former
1971 Tactic.prove). Goal.prove is the canonical way to prove results
1972 within a given context; Goal.prove_global is a degraded version for
1973 theory level goals, including a global Drule.standard. Note that
1974 OldGoals.prove_goalw_cterm has long been obsolete, since it is
1975 ill-behaved in a local proof context (e.g. with local fixes/assumes or
1976 in a locale context).
1978 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
1979 and type checking (Syntax.check_term etc.), with common combinations
1980 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
1981 which are considered legacy and await removal.
1983 * Pure/Syntax: generic interfaces for type unchecking
1984 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
1985 with common combinations (Syntax.pretty_term, Syntax.string_of_term
1986 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
1987 available for convenience, but refer to the very same operations using
1988 a mere theory instead of a full context.
1990 * Isar: simplified treatment of user-level errors, using exception
1991 ERROR of string uniformly. Function error now merely raises ERROR,
1992 without any side effect on output channels. The Isar toplevel takes
1993 care of proper display of ERROR exceptions. ML code may use plain
1994 handle/can/try; cat_error may be used to concatenate errors like this:
1996 ... handle ERROR msg => cat_error msg "..."
1998 Toplevel ML code (run directly or through the Isar toplevel) may be
1999 embedded into the Isar toplevel with exception display/debug like
2002 Isar.toplevel (fn () => ...)
2004 INCOMPATIBILITY, removed special transform_error facilities, removed
2005 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2006 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2007 -- use plain ERROR instead.
2009 * Isar: theory setup now has type (theory -> theory), instead of a
2010 list. INCOMPATIBILITY, may use #> to compose setup functions.
2012 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2013 ProofContext.debug/verbose flags.
2015 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2016 theory before entering a proof state. Transactions now always see a
2017 quasi-functional intermediate checkpoint, both in interactive and
2020 * Isar: simplified interfaces for outer syntax. Renamed
2021 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2022 OuterSyntax.add_parsers -- this functionality is now included in
2023 OuterSyntax.command etc. INCOMPATIBILITY.
2025 * Simplifier: the simpset of a running simplification process now
2026 contains a proof context (cf. Simplifier.the_context), which is the
2027 very context that the initial simpset has been retrieved from (by
2028 simpset_of/local_simpset_of). Consequently, all plug-in components
2029 (solver, looper etc.) may depend on arbitrary proof data.
2031 * Simplifier.inherit_context inherits the proof context (plus the
2032 local bounds) of the current simplification process; any simproc
2033 etc. that calls the Simplifier recursively should do this! Removed
2034 former Simplifier.inherit_bounds, which is already included here --
2035 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2036 specify an explicit context using Simplifier.context/theory_context.
2038 * Simplifier/Classical Reasoner: more abstract interfaces
2039 change_simpset/claset for modifying the simpset/claset reference of a
2040 theory; raw versions simpset/claset_ref etc. have been discontinued --
2043 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2049 * settings: the default heap location within ISABELLE_HOME_USER now
2050 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2051 Isabelle installations.
2053 * isabelle-process: option -S (secure mode) disables some critical
2054 operations, notably runtime compilation and evaluation of ML source
2057 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2059 * Support for parallel execution, using native multicore support of
2060 Poly/ML 5.1. The theory loader exploits parallelism when processing
2061 independent theories, according to the given theory header
2062 specifications. The maximum number of worker threads is specified via
2063 usedir option -M or the "max-threads" setting in Proof General. A
2064 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2065 to 6 on a 8-core machine. User-code needs to observe certain
2066 guidelines for thread-safe programming, see appendix A in the Isar
2067 Implementation manual.
2071 New in Isabelle2005 (October 2005)
2072 ----------------------------------
2076 * Theory headers: the new header syntax for Isar theories is
2079 imports <theory1> ... <theoryN>
2080 uses <file1> ... <fileM>
2083 where the 'uses' part is optional. The previous syntax
2085 theory <name> = <theory1> + ... + <theoryN>:
2087 will disappear in the next release. Use isatool fixheaders to convert
2088 existing theory files. Note that there is no change in ancient
2089 non-Isar theories now, but these will disappear soon.
2091 * Theory loader: parent theories can now also be referred to via
2092 relative and absolute paths.
2094 * Command 'find_theorems' searches for a list of criteria instead of a
2095 list of constants. Known criteria are: intro, elim, dest, name:string,
2096 simp:term, and any term. Criteria can be preceded by '-' to select
2097 theorems that do not match. Intro, elim, dest select theorems that
2098 match the current goal, name:s selects theorems whose fully qualified
2099 name contain s, and simp:term selects all simplification rules whose
2100 lhs match term. Any other term is interpreted as pattern and selects
2101 all theorems matching the pattern. Available in ProofGeneral under
2102 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2104 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2106 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2107 matching the current goal as introduction rule and not having "HOL."
2108 in their name (i.e. not being defined in theory HOL).
2110 * Command 'thms_containing' has been discontinued in favour of
2111 'find_theorems'; INCOMPATIBILITY.
2113 * Communication with Proof General is now 8bit clean, which means that
2114 Unicode text in UTF-8 encoding may be used within theory texts (both
2115 formal and informal parts). Cf. option -U of the Isabelle Proof
2116 General interface. Here are some simple examples (cf. src/HOL/ex):
2118 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2119 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2121 * Improved efficiency of the Simplifier and, to a lesser degree, the
2122 Classical Reasoner. Typical big applications run around 2 times
2126 *** Document preparation ***
2128 * Commands 'display_drafts' and 'print_drafts' perform simple output
2129 of raw sources. Only those symbols that do not require additional
2130 LaTeX packages (depending on comments in isabellesym.sty) are
2131 displayed properly, everything else is left verbatim. isatool display
2132 and isatool print are used as front ends (these are subject to the
2133 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2135 * Command tags control specific markup of certain regions of text,
2136 notably folding and hiding. Predefined tags include "theory" (for
2137 theory begin and end), "proof" for proof commands, and "ML" for
2138 commands involving ML code; the additional tags "visible" and
2139 "invisible" are unused by default. Users may give explicit tag
2140 specifications in the text, e.g. ''by %invisible (auto)''. The
2141 interpretation of tags is determined by the LaTeX job during document
2142 preparation: see option -V of isatool usedir, or options -n and -t of
2143 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2146 Several document versions may be produced at the same time via isatool
2147 usedir (the generated index.html will link all of them). Typical
2148 specifications include ''-V document=theory,proof,ML'' to present
2149 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2150 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2151 these parts without any formal replacement text. The Isabelle site
2152 default settings produce ''document'' and ''outline'' versions as
2155 * Several new antiquotations:
2157 @{term_type term} prints a term with its type annotated;
2159 @{typeof term} prints the type of a term;
2161 @{const const} is the same as @{term const}, but checks that the
2162 argument is a known logical constant;
2164 @{term_style style term} and @{thm_style style thm} print a term or
2165 theorem applying a "style" to it
2169 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2170 definitions, equations, inequations etc., 'concl' printing only the
2171 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2172 to print the specified premise. TermStyle.add_style provides an ML
2173 interface for introducing further styles. See also the "LaTeX Sugar"
2174 document practical applications. The ML antiquotation prints
2175 type-checked ML expressions verbatim.
2177 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2178 and 'text' support optional locale specification '(in loc)', which
2179 specifies the default context for interpreting antiquotations. For
2180 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2182 * Option 'locale=NAME' of antiquotations specifies an alternative
2183 context interpreting the subsequent argument. For example: @{thm
2184 [locale=lattice] inf_assoc}.
2186 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2189 * Proper output of antiquotations for theory commands involving a
2190 proof context (such as 'locale' or 'theorem (in loc) ...').
2192 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2193 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2195 * isatool usedir: new option -C (default true) controls whether option
2196 -D should include a copy of the original document directory; -C false
2197 prevents unwanted effects such as copying of administrative CVS data.
2202 * Considerably improved version of 'constdefs' command. Now performs
2203 automatic type-inference of declared constants; additional support for
2204 local structure declarations (cf. locales and HOL records), see also
2205 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2206 sequential dependencies of definitions within a single 'constdefs'
2207 section; moreover, the declared name needs to be an identifier. If
2208 all fails, consider to fall back on 'consts' and 'defs' separately.
2210 * Improved indexed syntax and implicit structures. First of all,
2211 indexed syntax provides a notational device for subscripted
2212 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2213 expressions. Secondly, in a local context with structure
2214 declarations, number indexes \<^sub>n or the empty index (default
2215 number 1) refer to a certain fixed variable implicitly; option
2216 show_structs controls printing of implicit structures. Typical
2217 applications of these concepts involve record types and locales.
2219 * New command 'no_syntax' removes grammar declarations (and
2220 translations) resulting from the given syntax specification, which is
2221 interpreted in the same manner as for the 'syntax' command.
2223 * 'Advanced' translation functions (parse_translation etc.) may depend
2224 on the signature of the theory context being presently used for
2225 parsing/printing, see also isar-ref manual.
2227 * Improved 'oracle' command provides a type-safe interface to turn an
2228 ML expression of type theory -> T -> term into a primitive rule of
2229 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2230 is already included here); see also FOL/ex/IffExample.thy;
2233 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2234 before); "cI" is no longer bound, use "c.intro" instead.
2235 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2236 axclasses vs. locales.
2238 * Improved internal renaming of symbolic identifiers -- attach primes
2239 instead of base 26 numbers.
2241 * New flag show_question_marks controls printing of leading question
2242 marks in schematic variable names.
2244 * In schematic variable names, *any* symbol following \<^isub> or
2245 \<^isup> is now treated as part of the base name. For example, the
2246 following works without printing of awkward ".0" indexes:
2248 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2251 * Inner syntax includes (*(*nested*) comments*).
2253 * Pretty printer now supports unbreakable blocks, specified in mixfix
2254 annotations as "(00...)".
2256 * Clear separation of logical types and nonterminals, where the latter
2257 may only occur in 'syntax' specifications or type abbreviations.
2258 Before that distinction was only partially implemented via type class
2259 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2260 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2261 exotic syntax specifications may require further adaption
2262 (e.g. Cube/Cube.thy).
2264 * Removed obsolete type class "logic", use the top sort {} instead.
2265 Note that non-logical types should be declared as 'nonterminals'
2266 rather than 'types'. INCOMPATIBILITY for new object-logic
2269 * Attributes 'induct' and 'cases': type or set names may now be
2270 locally fixed variables as well.
2272 * Simplifier: can now control the depth to which conditional rewriting
2273 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2276 * Simplifier: simplification procedures may now take the current
2277 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2278 interface), which is very useful for calling the Simplifier
2279 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2280 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2281 low-level mk_simproc no longer applies Logic.varify internally, to
2282 allow for use in a context of fixed variables.
2284 * thin_tac now works even if the assumption being deleted contains !!
2285 or ==>. More generally, erule now works even if the major premise of
2286 the elimination rule contains !! or ==>.
2288 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2290 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2291 from Pure, which contains all common declarations already. Both
2292 theories are defined via plain Isabelle/Isar .thy files.
2293 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2294 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2295 use isatool fixcpure to adapt your theory and ML sources.
2297 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2298 selections of theorems in named facts via index ranges.
2300 * 'print_theorems': in theory mode, really print the difference
2301 wrt. the last state (works for interactive theory development only),
2302 in proof mode print all local facts (cf. 'print_facts');
2304 * 'hide': option '(open)' hides only base names.
2306 * More efficient treatment of intermediate checkpoints in interactive
2309 * Code generator is now invoked via code_module (incremental code
2310 generation) and code_library (modular code generation, ML structures
2311 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2312 must be quoted when used as identifiers.
2314 * New 'value' command for reading, evaluating and printing terms using
2315 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2316 quoted when used as identifier.
2321 * New commands for the interpretation of locale expressions in
2322 theories (1), locales (2) and proof contexts (3). These generate
2323 proof obligations from the expression specification. After the
2324 obligations have been discharged, theorems of the expression are added
2325 to the theory, target locale or proof context. The synopsis of the
2326 commands is a follows:
2328 (1) interpretation expr inst
2329 (2) interpretation target < expr
2330 (3) interpret expr inst
2332 Interpretation in theories and proof contexts require a parameter
2333 instantiation of terms from the current context. This is applied to
2334 specifications and theorems of the interpreted expression.
2335 Interpretation in locales only permits parameter renaming through the
2336 locale expression. Interpretation is smart in that interpretations
2337 that are active already do not occur in proof obligations, neither are
2338 instantiated theorems stored in duplicate. Use 'print_interps' to
2339 inspect active interpretations of a particular locale. For details,
2340 see the Isar Reference manual. Examples can be found in
2341 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2343 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2344 'interpret' instead.
2346 * New context element 'constrains' for adding type constraints to
2349 * Context expressions: renaming of parameters with syntax
2352 * Locale declaration: 'includes' disallowed.
2354 * Proper static binding of attribute syntax -- i.e. types / terms /
2355 facts mentioned as arguments are always those of the locale definition
2356 context, independently of the context of later invocations. Moreover,
2357 locale operations (renaming and type / term instantiation) are applied
2358 to attribute arguments as expected.
2360 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2361 actual attributes; rare situations may require Attrib.attribute to
2362 embed those attributes into Attrib.src that lack concrete syntax.
2363 Attribute implementations need to cooperate properly with the static
2364 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2365 Attrib.XXX_thm etc. already do the right thing without further
2366 intervention. Only unusual applications -- such as "where" or "of"
2367 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2368 on the context and the facts involved -- may have to assign parsed
2369 values to argument tokens explicitly.
2371 * Changed parameter management in theorem generation for long goal
2372 statements with 'includes'. INCOMPATIBILITY: produces a different
2373 theorem statement in rare situations.
2375 * Locale inspection command 'print_locale' omits notes elements. Use
2376 'print_locale!' to have them included in the output.
2381 * Provers/hypsubst.ML: improved version of the subst method, for
2382 single-step rewriting: it now works in bound variable contexts. New is
2383 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2384 rewrite a different subterm than the original subst method, which is
2385 still available as 'simplesubst'.
2387 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2390 * Provers/trancl.ML: new transitivity reasoner for transitive and
2391 reflexive-transitive closure of relations.
2393 * Provers/blast.ML: new reference depth_limit to make blast's depth
2394 limit (previously hard-coded with a value of 20) user-definable.
2396 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2397 is peformed already. Object-logics merely need to finish their
2398 initial simpset configuration as before. INCOMPATIBILITY.
2403 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2406 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2408 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2409 and x-symbol; use option '-m epsilon' to get it actually printed.
2410 Moreover, the mathematically important symbolic identifier \<epsilon>
2411 becomes available as variable, constant etc. INCOMPATIBILITY,
2413 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2414 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2415 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2416 support corresponding Isar calculations.
2418 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2421 * theory SetInterval: changed the syntax for open intervals:
2430 The old syntax is still supported but will disappear in the next
2431 release. For conversion use the following Emacs search and replace
2432 patterns (these are not perfect but work quite well):
2434 {)\([^\.]*\)\.\. -> {\1<\.\.}
2435 \.\.\([^(}]*\)(} -> \.\.<\1}
2437 * Theory Commutative_Ring (in Library): method comm_ring for proving
2438 equalities in commutative rings; method 'algebra' provides a generic
2441 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2442 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2443 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2446 Some new syntax forms are available:
2448 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2449 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2450 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2451 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2453 The latter form "\<Sum>x < k. e" used to be based on a separate
2454 function "Summation", which has been discontinued.
2456 * theory Finite_Set: in structured induction proofs, the insert case
2457 is now 'case (insert x F)' instead of the old counterintuitive 'case
2460 * The 'refute' command has been extended to support a much larger
2461 fragment of HOL, including axiomatic type classes, constdefs and
2462 typedefs, inductive datatypes and recursion.
2464 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2465 Requires zChaff with proof generation to be installed. See
2466 HOL/ex/SAT_Examples.thy for examples.
2468 * Datatype induction via method 'induct' now preserves the name of the
2469 induction variable. For example, when proving P(xs::'a list) by
2470 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2471 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2472 in unstructured proof scripts.
2474 * Reworked implementation of records. Improved scalability for
2475 records with many fields, avoiding performance problems for type
2476 inference. Records are no longer composed of nested field types, but
2477 of nested extension types. Therefore the record type only grows linear
2478 in the number of extensions and not in the number of fields. The
2479 top-level (users) view on records is preserved. Potential
2480 INCOMPATIBILITY only in strange cases, where the theory depends on the
2481 old record representation. The type generated for a record is called
2482 <record_name>_ext_type.
2484 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2485 proofs triggered by a record definition or a simproc (if
2486 quick_and_dirty is enabled). Definitions of large records can take
2489 New simproc record_upd_simproc for simplification of multiple record
2490 updates enabled by default. Moreover, trivial updates are also
2491 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2492 occasionally, since simplification is more powerful by default.
2494 * typedef: proper support for polymorphic sets, which contain extra
2495 type-variables in the term.
2497 * Simplifier: automatically reasons about transitivity chains
2498 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2499 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2500 old proofs break occasionally as simplification may now solve more
2501 goals than previously.
2503 * Simplifier: converts x <= y into x = y if assumption y <= x is
2504 present. Works for all partial orders (class "order"), in particular
2505 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2508 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2509 bound variable or a constant then the let is unfolded. Otherwise
2510 first a is simplified to b, and then f b is simplified to g. If
2511 possible we abstract b from g arriving at "let x = b in h x",
2512 otherwise we unfold the let and arrive at g. The simproc can be
2513 enabled/disabled by the reference use_let_simproc. Potential
2514 INCOMPATIBILITY since simplification is more powerful by default.
2516 * Classical reasoning: the meson method now accepts theorems as arguments.
2518 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2519 jobs to provide advice on the provability of subgoals.
2521 * Theory OrderedGroup and Ring_and_Field: various additions and
2522 improvements to faciliate calculations involving equalities and
2525 The following theorems have been eliminated or modified
2528 abs_eq now named abs_of_nonneg
2529 abs_of_ge_0 now named abs_of_nonneg
2530 abs_minus_eq now named abs_of_nonpos
2531 imp_abs_id now named abs_of_nonneg
2532 imp_abs_neg_id now named abs_of_nonpos
2533 mult_pos now named mult_pos_pos
2534 mult_pos_le now named mult_nonneg_nonneg
2535 mult_pos_neg_le now named mult_nonneg_nonpos
2536 mult_pos_neg2_le now named mult_nonneg_nonpos2
2537 mult_neg now named mult_neg_neg
2538 mult_neg_le now named mult_nonpos_nonpos
2540 * The following lemmas in Ring_and_Field have been added to the simplifier:
2543 not_square_less_zero
2545 The following lemmas have been deleted from Real/RealPow:
2555 * Theory Parity: added rules for simplifying exponents.
2559 The following theorems have been eliminated or modified
2562 list_all_Nil now named list_all.simps(1)
2563 list_all_Cons now named list_all.simps(2)
2564 list_all_conv now named list_all_iff
2565 set_mem_eq now named mem_iff
2567 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2568 asymptotic "big O" calculations. See the notes in BigO.thy.
2573 * Theory RealDef: better support for embedding natural numbers and
2574 integers in the reals.
2576 The following theorems have been eliminated or modified
2579 exp_ge_add_one_self now requires no hypotheses
2580 real_of_int_add reversed direction of equality (use [symmetric])
2581 real_of_int_minus reversed direction of equality (use [symmetric])
2582 real_of_int_diff reversed direction of equality (use [symmetric])
2583 real_of_int_mult reversed direction of equality (use [symmetric])
2585 * Theory RComplete: expanded support for floor and ceiling functions.
2587 * Theory Ln is new, with properties of the natural logarithm
2589 * Hyperreal: There is a new type constructor "star" for making
2590 nonstandard types. The old type names are now type synonyms:
2594 hcomplex = complex star
2596 * Hyperreal: Many groups of similarly-defined constants have been
2597 replaced by polymorphic versions (INCOMPATIBILITY):
2599 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2601 starset <-- starsetNat, starsetC
2602 *s* <-- *sNat*, *sc*
2603 starset_n <-- starsetNat_n, starsetC_n
2604 *sn* <-- *sNatn*, *scn*
2605 InternalSets <-- InternalNatSets, InternalCSets
2607 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2608 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2609 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2610 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2611 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2613 * Hyperreal: Many type-specific theorems have been removed in favor of
2614 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2616 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2617 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2618 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2619 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2620 right_minus <-- hypreal_add_minus
2621 left_minus <-- {hypreal,hcomplex}_add_minus_left
2622 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2623 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2624 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2625 mult_1_right <-- hcomplex_mult_one_right
2626 mult_zero_left <-- hcomplex_mult_zero_left
2627 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2628 right_distrib <-- hypnat_add_mult_distrib2
2629 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2630 right_inverse <-- hypreal_mult_inverse
2631 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2632 order_refl <-- {hypreal,hypnat}_le_refl
2633 order_trans <-- {hypreal,hypnat}_le_trans
2634 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2635 order_less_le <-- {hypreal,hypnat}_less_le
2636 linorder_linear <-- {hypreal,hypnat}_le_linear
2637 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2638 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2639 add_nonneg_nonneg <-- hypreal_le_add_order
2641 * Hyperreal: Separate theorems having to do with type-specific
2642 versions of constants have been merged into theorems that apply to the
2643 new polymorphic constants (INCOMPATIBILITY):
2645 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2646 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2647 STAR_Un <-- {STAR,NatStar,STARC}_Un
2648 STAR_Int <-- {STAR,NatStar,STARC}_Int
2649 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2650 STAR_subset <-- {STAR,NatStar,STARC}_subset
2651 STAR_mem <-- {STAR,NatStar,STARC}_mem
2652 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2653 STAR_diff <-- {STAR,STARC}_diff
2654 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2655 STARC_hcomplex_of_complex}_image_subset
2656 starset_n_Un <-- starset{Nat,C}_n_Un
2657 starset_n_Int <-- starset{Nat,C}_n_Int
2658 starset_n_Compl <-- starset{Nat,C}_n_Compl
2659 starset_n_diff <-- starset{Nat,C}_n_diff
2660 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2661 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2662 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2663 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2664 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2665 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2666 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2667 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2668 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2669 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2670 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2671 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2672 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2673 starfun_diff <-- starfun{C,RC,CR}_diff
2674 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2675 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2676 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2677 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2678 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2679 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2680 starfun_Id <-- starfunC_Id
2681 starfun_approx <-- starfun{Nat,CR}_approx
2682 starfun_capprox <-- starfun{C,RC}_capprox
2683 starfun_abs <-- starfunNat_rabs
2684 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2685 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2686 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2687 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2688 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2689 starfun_add_approx <-- starfunCR_add_approx
2690 starfun_inverse_inverse <-- starfunC_inverse_inverse
2691 starfun_divide <-- starfun{C,CR,RC}_divide
2692 starfun_n <-- starfun{Nat,C}_n
2693 starfun_n_mult <-- starfun{Nat,C}_n_mult
2694 starfun_n_add <-- starfun{Nat,C}_n_add
2695 starfun_n_add_minus <-- starfunNat_n_add_minus
2696 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2697 starfun_n_minus <-- starfun{Nat,C}_n_minus
2698 starfun_n_eq <-- starfun{Nat,C}_n_eq
2700 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2701 star_n_minus <-- {hypreal,hcomplex}_minus
2702 star_n_diff <-- {hypreal,hcomplex}_diff
2703 star_n_mult <-- {hypreal,hcomplex}_mult
2704 star_n_inverse <-- {hypreal,hcomplex}_inverse
2705 star_n_le <-- {hypreal,hypnat}_le
2706 star_n_less <-- {hypreal,hypnat}_less
2707 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2708 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2709 star_n_abs <-- hypreal_hrabs
2710 star_n_divide <-- hcomplex_divide
2712 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2713 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2714 star_of_diff <-- hypreal_of_real_diff
2715 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2716 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2717 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2718 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2719 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2720 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2721 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2722 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2723 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2724 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2725 star_of_number_of <-- {hypreal,hcomplex}_number_of
2726 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2727 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2728 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2729 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2730 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2731 star_of_power <-- hypreal_of_real_power
2732 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2734 * Hyperreal: new method "transfer" that implements the transfer
2735 principle of nonstandard analysis. With a subgoal that mentions
2736 nonstandard types like "'a star", the command "apply transfer"
2737 replaces it with an equivalent one that mentions only standard types.
2738 To be successful, all free variables must have standard types; non-
2739 standard variables must have explicit universal quantifiers.
2741 * Hyperreal: A theory of Taylor series.
2746 * Discontinued special version of 'constdefs' (which used to support
2747 continuous functions) in favor of the general Pure one with full
2750 * New simplification procedure for solving continuity conditions; it
2751 is much faster on terms with many nested lambda abstractions (cubic
2752 instead of exponential time).
2754 * New syntax for domain package: selector names are now optional.
2755 Parentheses should be omitted unless argument is lazy, for example:
2757 domain 'a stream = cons "'a" (lazy "'a stream")
2759 * New command 'fixrec' for defining recursive functions with pattern
2760 matching; defining multiple functions with mutual recursion is also
2761 supported. Patterns may include the constants cpair, spair, up, sinl,
2762 sinr, or any data constructor defined by the domain package. The given
2763 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2764 syntax and examples.
2766 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2767 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2768 but the proof obligation additionally includes an admissibility
2769 requirement. The packages generate instances of class cpo or pcpo,
2770 with continuity and strictness theorems for Rep and Abs.
2772 * HOLCF: Many theorems have been renamed according to a more standard naming
2773 scheme (INCOMPATIBILITY):
2775 foo_inject: "foo$x = foo$y ==> x = y"
2776 foo_eq: "(foo$x = foo$y) = (x = y)"
2777 foo_less: "(foo$x << foo$y) = (x << y)"
2778 foo_strict: "foo$UU = UU"
2779 foo_defined: "... ==> foo$x ~= UU"
2780 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2785 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2786 including the First Isomorphism Theorem (on quotienting by the kernel
2789 * ZF/Simplifier: install second copy of type solver that actually
2790 makes use of TC rules declared to Isar proof contexts (or locales);
2791 the old version is still required for ML proof scripts.
2796 * Converted to Isar theory format; use locales instead of axiomatic
2802 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
2805 * Pure/library.ML no longer defines its own option datatype, but uses
2806 that of the SML basis, which has constructors NONE and SOME instead of
2807 None and Some, as well as exception Option.Option instead of OPTION.
2808 The functions the, if_none, is_some, is_none have been adapted
2809 accordingly, while Option.map replaces apsome.
2811 * Pure/library.ML: the exception LIST has been given up in favour of
2812 the standard exceptions Empty and Subscript, as well as
2813 Library.UnequalLengths. Function like Library.hd and Library.tl are
2814 superceded by the standard hd and tl functions etc.
2816 A number of basic list functions are no longer exported to the ML
2817 toplevel, as they are variants of predefined functions. The following
2818 suggests how one can translate existing code:
2820 rev_append xs ys = List.revAppend (xs, ys)
2821 nth_elem (i, xs) = List.nth (xs, i)
2822 last_elem xs = List.last xs
2823 flat xss = List.concat xss
2824 seq fs = List.app fs
2825 partition P xs = List.partition P xs
2826 mapfilter f xs = List.mapPartial f xs
2828 * Pure/library.ML: several combinators for linear functional
2829 transformations, notably reverse application and composition:
2832 (x, y) |-> f f #-> g
2834 * Pure/library.ML: introduced/changed precedence of infix operators:
2836 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
2838 infix 3 o oo ooo oooo;
2839 infix 4 ~~ upto downto;
2841 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
2844 * Pure/library.ML: natural list combinators fold, fold_rev, and
2845 fold_map support linear functional transformations and nesting. For
2848 fold f [x1, ..., xN] y =
2849 y |> f x1 |> ... |> f xN
2851 (fold o fold) f [xs1, ..., xsN] y =
2852 y |> fold f xs1 |> ... |> fold f xsN
2854 fold f [x1, ..., xN] =
2857 (fold o fold) f [xs1, ..., xsN] =
2858 fold f xs1 #> ... #> fold f xsN
2860 * Pure/library.ML: the following selectors on type 'a option are
2863 the: 'a option -> 'a (*partial*)
2864 these: 'a option -> 'a where 'a = 'b list
2865 the_default: 'a -> 'a option -> 'a
2866 the_list: 'a option -> 'a list
2868 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2869 basic operations for association lists, following natural argument
2870 order; moreover the explicit equality predicate passed here avoids
2871 potentially expensive polymorphic runtime equality checks.
2872 The old functions may be expressed as follows:
2874 assoc = uncurry (AList.lookup (op =))
2875 assocs = these oo AList.lookup (op =)
2876 overwrite = uncurry (AList.update (op =)) o swap
2878 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2880 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
2881 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
2883 replacing make_keylist and keyfilter (occassionally used)
2886 make_keylist = AList.make
2887 keyfilter = AList.find (op =)
2889 * eq_fst and eq_snd now take explicit equality parameter, thus
2890 avoiding eqtypes. Naive rewrites:
2892 eq_fst = eq_fst (op =)
2893 eq_snd = eq_snd (op =)
2895 * Removed deprecated apl and apr (rarely used).
2898 apl (n, op) =>>= curry op n
2899 apr (op, m) =>>= fn n => op (n, m)
2901 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
2902 provides a reasonably efficient light-weight implementation of sets as
2905 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
2906 few new operations; existing lookup and update are now curried to
2907 follow natural argument order (for use with fold etc.);
2908 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
2910 * Pure/General: output via the Isabelle channels of
2911 writeln/warning/error etc. is now passed through Output.output, with a
2912 hook for arbitrary transformations depending on the print_mode
2913 (cf. Output.add_mode -- the first active mode that provides a output
2914 function wins). Already formatted output may be embedded into further
2915 text via Output.raw; the result of Pretty.string_of/str_of and derived
2916 functions (string_of_term/cterm/thm etc.) is already marked raw to
2917 accommodate easy composition of diagnostic messages etc. Programmers
2918 rarely need to care about Output.output or Output.raw at all, with
2919 some notable exceptions: Output.output is required when bypassing the
2920 standard channels (writeln etc.), or in token translations to produce
2921 properly formatted results; Output.raw is required when capturing
2922 already output material that will eventually be presented to the user
2923 a second time. For the default print mode, both Output.output and
2924 Output.raw have no effect.
2926 * Pure/General: Output.time_accumulator NAME creates an operator ('a
2927 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
2928 cumulative results are displayed at the end of a batch session.
2930 * Pure/General: File.sysify_path and File.quote_sysify path have been
2931 replaced by File.platform_path and File.shell_path (with appropriate
2932 hooks). This provides a clean interface for unusual systems where the
2933 internal and external process view of file names are different.
2935 * Pure: more efficient orders for basic syntactic entities: added
2936 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
2937 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
2938 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
2939 orders now -- potential INCOMPATIBILITY for code that depends on a
2940 particular order for Symtab.keys, Symtab.dest, etc. (consider using
2941 Library.sort_strings on result).
2943 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
2944 fold_types traverse types/terms from left to right, observing natural
2945 argument order. Supercedes previous foldl_XXX versions, add_frees,
2946 add_vars etc. have been adapted as well: INCOMPATIBILITY.
2948 * Pure: name spaces have been refined, with significant changes of the
2949 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
2950 to extern(_table). The plain name entry path is superceded by a
2951 general 'naming' context, which also includes the 'policy' to produce
2952 a fully qualified name and external accesses of a fully qualified
2953 name; NameSpace.extend is superceded by context dependent
2954 Sign.declare_name. Several theory and proof context operations modify
2955 the naming context. Especially note Theory.restore_naming and
2956 ProofContext.restore_naming to get back to a sane state; note that
2957 Theory.add_path is no longer sufficient to recover from
2958 Theory.absolute_path in particular.
2960 * Pure: new flags short_names (default false) and unique_names
2961 (default true) for controlling output of qualified names. If
2962 short_names is set, names are printed unqualified. If unique_names is
2963 reset, the name prefix is reduced to the minimum required to achieve
2964 the original result when interning again, even if there is an overlap
2965 with earlier declarations.
2967 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
2968 now 'extend', and 'merge' gets an additional Pretty.pp argument
2969 (useful for printing error messages). INCOMPATIBILITY.
2971 * Pure: major reorganization of the theory context. Type Sign.sg and
2972 Theory.theory are now identified, referring to the universal
2973 Context.theory (see Pure/context.ML). Actual signature and theory
2974 content is managed as theory data. The old code and interfaces were
2975 spread over many files and structures; the new arrangement introduces
2976 considerable INCOMPATIBILITY to gain more clarity:
2978 Context -- theory management operations (name, identity, inclusion,
2979 parents, ancestors, merge, etc.), plus generic theory data;
2981 Sign -- logical signature and syntax operations (declaring consts,
2982 types, etc.), plus certify/read for common entities;
2984 Theory -- logical theory operations (stating axioms, definitions,
2985 oracles), plus a copy of logical signature operations (consts,
2986 types, etc.); also a few basic management operations (Theory.copy,
2989 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
2990 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
2991 for convenience -- they merely return the theory.
2993 * Pure: type Type.tsig is superceded by theory in most interfaces.
2995 * Pure: the Isar proof context type is already defined early in Pure
2996 as Context.proof (note that ProofContext.context and Proof.context are
2997 aliases, where the latter is the preferred name). This enables other
2998 Isabelle components to refer to that type even before Isar is present.
3000 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3001 typeK, constK, axiomK, oracleK), but provide explicit operations for
3002 any of these kinds. For example, Sign.intern typeK is now
3003 Sign.intern_type, Theory.hide_space Sign.typeK is now
3004 Theory.hide_types. Also note that former
3005 Theory.hide_classes/types/consts are now
3006 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3007 internalize their arguments! INCOMPATIBILITY.
3009 * Pure: get_thm interface (of PureThy and ProofContext) expects
3010 datatype thmref (with constructors Name and NameSelection) instead of
3011 plain string -- INCOMPATIBILITY;
3013 * Pure: cases produced by proof methods specify options, where NONE
3014 means to remove case bindings -- INCOMPATIBILITY in
3017 * Pure: the following operations retrieve axioms or theorems from a
3018 theory node or theory hierarchy, respectively:
3020 Theory.axioms_of: theory -> (string * term) list
3021 Theory.all_axioms_of: theory -> (string * term) list
3022 PureThy.thms_of: theory -> (string * thm) list
3023 PureThy.all_thms_of: theory -> (string * thm) list
3025 * Pure: print_tac now outputs the goal through the trace channel.
3027 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3028 Reference Toplevel.debug (default false) controls detailed printing
3029 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3030 controls execution profiling -- set to 1 for time and 2 for space
3031 (both increase the runtime).
3033 * Isar session: The initial use of ROOT.ML is now always timed,
3034 i.e. the log will show the actual process times, in contrast to the
3035 elapsed wall-clock time that the outer shell wrapper produces.
3037 * Simplifier: improved handling of bound variables (nameless
3038 representation, avoid allocating new strings). Simprocs that invoke
3039 the Simplifier recursively should use Simplifier.inherit_bounds to
3040 avoid local name clashes. Failure to do so produces warnings
3041 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3042 for further details.
3044 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3045 bindings for all theorems stored within a given theory; this may help
3046 in porting non-Isar theories to Isar ones, while keeping ML proof
3047 scripts for the time being.
3049 * ML operator HTML.with_charset specifies the charset begin used for
3050 generated HTML files. For example:
3052 HTML.with_charset "utf-8" use_thy "Hebrew";
3053 HTML.with_charset "utf-8" use_thy "Chinese";
3058 * Allow symlinks to all proper Isabelle executables (Isabelle,
3059 isabelle, isatool etc.).
3061 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3062 isatool doc, isatool mkdir, display_drafts etc.).
3064 * isatool usedir: option -f allows specification of the ML file to be
3065 used by Isabelle; default is ROOT.ML.
3067 * New isatool version outputs the version identifier of the Isabelle
3068 distribution being used.
3070 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3071 (containing Boolean satisfiability problems) into Isabelle/HOL
3076 New in Isabelle2004 (April 2004)
3077 --------------------------------
3081 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3082 Replaces linorder.ML.
3084 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3085 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3086 (\<a>...\<z>), are now considered normal letters, and can therefore
3087 be used anywhere where an ASCII letter (a...zA...Z) has until
3088 now. COMPATIBILITY: This obviously changes the parsing of some
3089 terms, especially where a symbol has been used as a binder, say
3090 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3091 as an identifier. Fix it by inserting a space around former
3092 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3093 existing theory and ML files.
3095 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3097 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3098 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3099 a normal (but invisible) letter. For multiple letter subscripts repeat
3100 \<^isub> like this: x\<^isub>1\<^isub>2.
3102 * Pure: There are now sub-/superscripts that can span more than one
3103 character. Text between \<^bsub> and \<^esub> is set in subscript in
3104 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3105 superscript. The new control characters are not identifier parts.
3107 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3108 content of "..." to the latex file instead of \isacntrl... . The "..."
3109 may consist of any printable characters excluding the end bracket >.
3111 * Pure: Using new Isar command "finalconsts" (or the ML functions
3112 Theory.add_finals or Theory.add_finals_i) it is now possible to
3113 declare constants "final", which prevents their being given a definition
3114 later. It is useful for constants whose behaviour is fixed axiomatically
3115 rather than definitionally, such as the meta-logic connectives.
3117 * Pure: 'instance' now handles general arities with general sorts
3118 (i.e. intersections of classes),
3120 * Presentation: generated HTML now uses a CSS style sheet to make layout
3121 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3122 It can be changed to alter the colors/layout of generated pages.
3127 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3128 cut_tac, subgoal_tac and thin_tac:
3129 - Now understand static (Isar) contexts. As a consequence, users of Isar
3130 locales are no longer forced to write Isar proof scripts.
3131 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3133 - INCOMPATIBILITY: names of variables to be instantiated may no
3134 longer be enclosed in quotes. Instead, precede variable name with `?'.
3135 This is consistent with the instantiation attribute "where".
3137 * Attributes "where" and "of":
3138 - Now take type variables of instantiated theorem into account when reading
3139 the instantiation string. This fixes a bug that caused instantiated
3140 theorems to have too special types in some circumstances.
3141 - "where" permits explicit instantiations of type variables.
3143 * Calculation commands "moreover" and "also" no longer interfere with
3144 current facts ("this"), admitting arbitrary combinations with "then"
3148 - Goal statements involving the context element "includes" no longer
3149 generate theorems with internal delta predicates (those ending on
3150 "_axioms") in the premise.
3151 Resolve particular premise with <locale>.intro to obtain old form.
3152 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3153 specification and "includes" elements in goal statement.
3154 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3155 [intro?] and [elim?] (respectively) by default.
3156 - Experimental command for instantiation of locales in proof contexts:
3157 instantiate <label>[<attrs>]: <loc>
3158 Instantiates locale <loc> and adds all its theorems to the current context
3159 taking into account their attributes. Label and attrs are optional
3160 modifiers, like in theorem declarations. If present, names of
3161 instantiated theorems are qualified with <label>, and the attributes
3162 <attrs> are applied after any attributes these theorems might have already.
3163 If the locale has assumptions, a chained fact of the form
3164 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3165 are derived. The command does not support old-style locales declared
3166 with "locale (open)".
3167 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3169 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3175 * Proof import: new image HOL4 contains the imported library from
3176 the HOL4 system with about 2500 theorems. It is imported by
3177 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3178 can be used like any other Isabelle image. See
3179 HOL/Import/HOL/README for more information.
3182 - Much improved handling of linear and partial orders.
3183 Reasoners for linear and partial orders are set up for type classes
3184 "linorder" and "order" respectively, and are added to the default simpset
3185 as solvers. This means that the simplifier can build transitivity chains
3186 to solve goals from the assumptions.
3187 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3188 of blast or auto after simplification become unnecessary because the goal
3189 is solved by simplification already.
3191 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3192 all proved in axiomatic type classes for semirings, rings and fields.
3195 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3196 now formalized using the Ring_and_Field theory mentioned above.
3197 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3198 than before, because now they are set up once in a generic manner.
3199 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3200 Look for the general versions in Ring_and_Field (and Power if they concern
3203 * Type "rat" of the rational numbers is now available in HOL-Complex.
3206 - Record types are now by default printed with their type abbreviation
3207 instead of the list of all field types. This can be configured via
3208 the reference "print_record_type_abbr".
3209 - Simproc "record_upd_simproc" for simplification of multiple updates added
3210 (not enabled by default).
3211 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3212 EX x. x = sel r to True (not enabled by default).
3213 - Tactic "record_split_simp_tac" to split and simplify records added.
3215 * 'specification' command added, allowing for definition by
3216 specification. There is also an 'ax_specification' command that
3217 introduces the new constants axiomatically.
3219 * arith(_tac) is now able to generate counterexamples for reals as well.
3221 * HOL-Algebra: new locale "ring" for non-commutative rings.
3223 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3224 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3226 * HOL-Matrix: a first theory for matrices in HOL with an application of
3227 matrix theory to linear programming.
3229 * Unions and Intersections:
3230 The latex output syntax of UN and INT has been changed
3231 from "\Union x \in A. B" to "\Union_{x \in A} B"
3232 i.e. the index formulae has become a subscript.
3233 Similarly for "\Union x. B", and for \Inter instead of \Union.
3235 * Unions and Intersections over Intervals:
3236 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3237 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3238 like in normal math, and corresponding versions for < and for intersection.
3240 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3241 lexicographic dictonary ordering has been added as "lexord".
3243 * ML: the legacy theory structures Int and List have been removed. They had
3244 conflicted with ML Basis Library structures having the same names.
3246 * 'refute' command added to search for (finite) countermodels. Only works
3247 for a fragment of HOL. The installation of an external SAT solver is
3248 highly recommended. See "HOL/Refute.thy" for details.
3250 * 'quickcheck' command: Allows to find counterexamples by evaluating
3251 formulae under an assignment of free variables to random values.
3252 In contrast to 'refute', it can deal with inductive datatypes,
3253 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3259 * Streams now come with concatenation and are part of the HOLCF image
3263 New in Isabelle2003 (May 2003)
3264 ------------------------------
3268 * Provers/simplifier:
3270 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3271 Assumptions are now subject to complete mutual simplification,
3272 not just from left to right. The simplifier now preserves
3273 the order of assumptions.
3275 Potential INCOMPATIBILITY:
3277 -- simp sometimes diverges where the old version did
3278 not, e.g. invoking simp on the goal
3280 [| P (f x); y = x; f x = f y |] ==> Q
3282 now gives rise to the infinite reduction sequence
3284 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3286 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3289 -- Tactics combining classical reasoner and simplification (such as auto)
3290 are also affected by this change, because many of them rely on
3291 simp. They may sometimes diverge as well or yield a different numbers
3292 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3293 in case of problems. Sometimes subsequent calls to the classical
3294 reasoner will fail because a preceeding call to the simplifier too
3295 eagerly simplified the goal, e.g. deleted redundant premises.
3297 - The simplifier trace now shows the names of the applied rewrite rules
3299 - You can limit the number of recursive invocations of the simplifier
3300 during conditional rewriting (where the simplifie tries to solve the
3301 conditions before applying the rewrite rule):
3302 ML "simp_depth_limit := n"
3303 where n is an integer. Thus you can force termination where previously
3304 the simplifier would diverge.
3306 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3308 - No longer aborts on failed congruence proof. Instead, the
3309 congruence is ignored.
3311 * Pure: New generic framework for extracting programs from constructive
3312 proofs. See HOL/Extraction.thy for an example instantiation, as well
3313 as HOL/Extraction for some case studies.
3315 * Pure: The main goal of the proof state is no longer shown by default, only
3316 the subgoals. This behaviour is controlled by a new flag.
3317 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3318 (ML: Proof.show_main_goal).
3320 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3321 rules whose conclusion matches subgoal 1:
3322 PG menu: Isabelle/Isar -> Show me -> matching rules
3323 The rules are ordered by how closely they match the subgoal.
3324 In particular, rules that solve a subgoal outright are displayed first
3325 (or rather last, the way they are printed).
3326 (ML: ProofGeneral.print_intros())
3328 * Pure: New flag trace_unify_fail causes unification to print
3329 diagnostic information (PG: in trace buffer) when it fails. This is
3330 useful for figuring out why single step proofs like rule, erule or
3333 * Pure: Locale specifications now produce predicate definitions
3334 according to the body of text (covering assumptions modulo local
3335 definitions); predicate "loc_axioms" covers newly introduced text,
3336 while "loc" is cumulative wrt. all included locale expressions; the
3337 latter view is presented only on export into the global theory
3338 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3339 on the old view without predicates;
3341 * Pure: predefined locales "var" and "struct" are useful for sharing
3342 parameters (as in CASL, for example); just specify something like
3343 ``var x + var y + struct M'' as import;
3345 * Pure: improved thms_containing: proper indexing of facts instead of
3346 raw theorems; check validity of results wrt. current name space;
3347 include local facts of proof configuration (also covers active
3348 locales), cover fixed variables in index; may use "_" in term
3349 specification; an optional limit for the number of printed facts may
3350 be given (the default is 40);
3352 * Pure: disallow duplicate fact bindings within new-style theory files
3355 * Provers: improved induct method: assumptions introduced by case
3356 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3357 the goal statement); "foo" still refers to all facts collectively;
3359 * Provers: the function blast.overloaded has been removed: all constants
3360 are regarded as potentially overloaded, which improves robustness in exchange
3361 for slight decrease in efficiency;
3363 * Provers/linorder: New generic prover for transitivity reasoning over
3364 linear orders. Note: this prover is not efficient!
3366 * Isar: preview of problems to finish 'show' now produce an error
3367 rather than just a warning (in interactive mode);
3374 - Produces a counter example if it cannot prove a goal.
3375 Note that the counter example may be spurious if the goal is not a formula
3376 of quantifier-free linear arithmetic.
3377 In ProofGeneral the counter example appears in the trace buffer.
3379 - Knows about div k and mod k where k is a numeral of type nat or int.
3381 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3382 linear arithmetic fails. This takes account of quantifiers and divisibility.
3383 Presburger arithmetic can also be called explicitly via presburger(_tac).
3385 * simp's arithmetic capabilities have been enhanced a bit: it now
3386 takes ~= in premises into account (by performing a case split);
3388 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3389 are distributed over a sum of terms;
3391 * New tactic "trans_tac" and method "trans" instantiate
3392 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3395 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3396 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3398 * 'typedef' command has new option "open" to suppress the set
3401 * functions Min and Max on finite sets have been introduced (theory
3404 * attribute [symmetric] now works for relations as well; it turns
3405 (x,y) : R^-1 into (y,x) : R, and vice versa;
3407 * induct over a !!-quantified statement (say !!x1..xn):
3408 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3410 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3411 %x. None. Warning: empty_def now refers to the previously hidden definition
3414 * Algebra: formalization of classical algebra. Intended as base for
3415 any algebraic development in Isabelle. Currently covers group theory
3416 (up to Sylow's theorem) and ring theory (Universal Property of
3417 Univariate Polynomials). Contributions welcome;
3419 * GroupTheory: deleted, since its material has been moved to Algebra;
3421 * Complex: new directory of the complex numbers with numeric constants,
3422 nonstandard complex numbers, and some complex analysis, standard and
3423 nonstandard (Jacques Fleuriot);
3425 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3427 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3430 * Real/HahnBanach: updated and adapted to locales;
3432 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3435 * UNITY: added the Meier-Sanders theory of progress sets;
3437 * MicroJava: bytecode verifier and lightweight bytecode verifier
3438 as abstract algorithms, instantiated to the JVM;
3440 * Bali: Java source language formalization. Type system, operational
3441 semantics, axiomatic semantics. Supported language features:
3442 classes, interfaces, objects,virtual methods, static methods,
3443 static/instance fields, arrays, access modifiers, definite
3444 assignment, exceptions.
3449 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3452 * Main ZF: virtually all theories converted to new-style format;
3457 * Pure: Tactic.prove provides sane interface for internal proofs;
3458 omits the infamous "standard" operation, so this is more appropriate
3459 than prove_goalw_cterm in many situations (e.g. in simprocs);
3461 * Pure: improved error reporting of simprocs;
3463 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3467 *** Document preparation ***
3469 * uses \par instead of \\ for line breaks in theory text. This may
3470 shift some page breaks in large documents. To get the old behaviour
3471 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3473 * minimized dependencies of isabelle.sty and isabellesym.sty on
3476 * \<euro> now needs package babel/greek instead of marvosym (which
3479 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3484 New in Isabelle2002 (March 2002)
3485 --------------------------------
3487 *** Document preparation ***
3489 * greatly simplified document preparation setup, including more
3490 graceful interpretation of isatool usedir -i/-d/-D options, and more
3491 instructive isatool mkdir; users should basically be able to get
3492 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3493 users may run a separate document processing stage manually like this:
3494 "isatool usedir -D output HOL Test && isatool document Test/output";
3496 * theory dependency graph may now be incorporated into documents;
3497 isatool usedir -g true will produce session_graph.eps/.pdf for use
3498 with \includegraphics of LaTeX;
3500 * proper spacing of consecutive markup elements, especially text
3501 blocks after section headings;
3503 * support bold style (for single symbols only), input syntax is like
3504 this: "\<^bold>\<alpha>" or "\<^bold>A";
3506 * \<bullet> is now output as bold \cdot by default, which looks much
3507 better in printed text;
3509 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3510 note that these symbols are currently unavailable in Proof General /
3511 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3513 * isatool latex no longer depends on changed TEXINPUTS, instead
3514 isatool document copies the Isabelle style files to the target
3520 * Pure/Provers: improved proof by cases and induction;
3521 - 'case' command admits impromptu naming of parameters (such as
3523 - 'induct' method divinates rule instantiation from the inductive
3524 claim; no longer requires excessive ?P bindings for proper
3525 instantiation of cases;
3526 - 'induct' method properly enumerates all possibilities of set/type
3527 rules; as a consequence facts may be also passed through *type*
3528 rules without further ado;
3529 - 'induct' method now derives symbolic cases from the *rulified*
3530 rule (before it used to rulify cases stemming from the internal
3531 atomized version); this means that the context of a non-atomic
3532 statement becomes is included in the hypothesis, avoiding the
3533 slightly cumbersome show "PROP ?case" form;
3534 - 'induct' may now use elim-style induction rules without chaining
3535 facts, using ``missing'' premises from the goal state; this allows
3536 rules stemming from inductive sets to be applied in unstructured
3537 scripts, while still benefitting from proper handling of non-atomic
3538 statements; NB: major inductive premises need to be put first, all
3539 the rest of the goal is passed through the induction;
3540 - 'induct' proper support for mutual induction involving non-atomic
3541 rule statements (uses the new concept of simultaneous goals, see
3543 - append all possible rule selections, but only use the first
3544 success (no backtracking);
3545 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3546 - undeclared rule case names default to numbers 1, 2, 3, ...;
3547 - added 'print_induct_rules' (covered by help item in recent Proof
3549 - moved induct/cases attributes to Pure, methods to Provers;
3550 - generic method setup instantiated for FOL and HOL;
3552 * Pure: support multiple simultaneous goal statements, for example
3553 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3554 meta-level mechanism, this acts as if several individual goals had
3555 been stated separately; in particular common proof methods need to be
3556 repeated in order to cover all claims; note that a single elimination
3557 step is *not* sufficient to establish the two conjunctions, so this
3560 assume "A & B" then have A and B .. (*".." fails*)
3562 better use "obtain" in situations as above; alternative refer to
3563 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3565 * Pure: proper integration with ``locales''; unlike the original
3566 version by Florian Kammller, Isar locales package high-level proof
3567 contexts rather than raw logical ones (e.g. we admit to include
3568 attributes everywhere); operations on locales include merge and
3569 rename; support for implicit arguments (``structures''); simultaneous
3570 type-inference over imports and text; see also HOL/ex/Locales.thy for
3573 * Pure: the following commands have been ``localized'', supporting a
3574 target locale specification "(in name)": 'lemma', 'theorem',
3575 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3576 stored both within the locale and at the theory level (exported and
3577 qualified by the locale name);
3579 * Pure: theory goals may now be specified in ``long'' form, with
3580 ad-hoc contexts consisting of arbitrary locale elements. for example
3581 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3582 definitions may be given, too); the result is a meta-level rule with
3583 the context elements being discharged in the obvious way;
3585 * Pure: new proof command 'using' allows to augment currently used
3586 facts after a goal statement ('using' is syntactically analogous to
3587 'apply', but acts on the goal's facts only); this allows chained facts
3588 to be separated into parts given before and after a claim, as in
3589 ``from a and b have C using d and e <proof>'';
3591 * Pure: renamed "antecedent" case to "rule_context";
3593 * Pure: new 'judgment' command records explicit information about the
3594 object-logic embedding (used by several tools internally); no longer
3595 use hard-wired "Trueprop";
3597 * Pure: added 'corollary' command;
3599 * Pure: fixed 'token_translation' command;
3601 * Pure: removed obsolete 'exported' attribute;
3603 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3604 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3605 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3607 * Pure: method 'atomize' presents local goal premises as object-level
3608 statements (atomic meta-level propositions); setup controlled via
3609 rewrite rules declarations of 'atomize' attribute; example
3610 application: 'induct' method with proper rule statements in improper
3613 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3614 now consider the syntactic context of assumptions, giving a better
3615 chance to get type-inference of the arguments right (this is
3616 especially important for locales);
3618 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3621 * Pure/obtain: the formal conclusion "thesis", being marked as
3622 ``internal'', may no longer be reference directly in the text;
3623 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3626 * Pure: generic 'sym' attribute which declares a rule both as pure
3627 'elim?' and for the 'symmetric' operation;
3629 * Pure: marginal comments ``--'' may now occur just anywhere in the
3630 text; the fixed correlation with particular command syntax has been
3633 * Pure: new method 'rules' is particularly well-suited for proof
3634 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3635 but often produces more compact proof terms with less detours;
3637 * Pure/Provers/classical: simplified integration with pure rule
3638 attributes and methods; the classical "intro?/elim?/dest?"
3639 declarations coincide with the pure ones; the "rule" method no longer
3640 includes classically swapped intros; "intro" and "elim" methods no
3641 longer pick rules from the context; also got rid of ML declarations
3642 AddXIs/AddXEs/AddXDs; all of this has some potential for
3645 * Provers/classical: attribute 'swapped' produces classical inversions
3646 of introduction rules;
3648 * Provers/simplifier: 'simplified' attribute may refer to explicit
3649 rules instead of full simplifier context; 'iff' attribute handles
3652 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3654 * HOL: 'recdef' now fails on unfinished automated proofs, use
3655 "(permissive)" option to recover old behavior;
3657 * HOL: 'inductive' no longer features separate (collective) attributes
3658 for 'intros' (was found too confusing);
3660 * HOL: properly declared induction rules less_induct and
3666 * HOL: moved over to sane numeral syntax; the new policy is as
3669 - 0 and 1 are polymorphic constants, which are defined on any
3670 numeric type (nat, int, real etc.);
3672 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3673 binary representation internally;
3675 - type nat has special constructor Suc, and generally prefers Suc 0
3676 over 1::nat and Suc (Suc 0) over 2::nat;
3678 This change may cause significant problems of INCOMPATIBILITY; here
3679 are some hints on converting existing sources:
3681 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3682 entities, so expressions involving "-" (unary or binary minus) need
3683 to be spaced properly;
3685 - existing occurrences of "1" may need to be constraint "1::nat" or
3686 even replaced by Suc 0; similar for old "2";
3688 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3690 - remove all special provisions on numerals in proofs;
3692 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3693 representation (depends on bin_arith_simps in the default context);
3695 * HOL: symbolic syntax for x^2 (numeral 2);
3697 * HOL: the class of all HOL types is now called "type" rather than
3698 "term"; INCOMPATIBILITY, need to adapt references to this type class
3699 in axclass/classes, instance/arities, and (usually rare) occurrences
3700 in typings (of consts etc.); internally the class is called
3701 "HOL.type", ML programs should refer to HOLogic.typeS;
3703 * HOL/record package improvements:
3704 - new derived operations "fields" to build a partial record section,
3705 "extend" to promote a fixed record to a record scheme, and
3706 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3707 declared as simp by default;
3708 - shared operations ("more", "fields", etc.) now need to be always
3709 qualified) --- potential INCOMPATIBILITY;
3710 - removed "make_scheme" operations (use "make" with "extend") --
3712 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3713 - provides cases/induct rules for use with corresponding Isar
3714 methods (for concrete records, record schemes, concrete more
3715 parts, and schematic more parts -- in that order);
3716 - internal definitions directly based on a light-weight abstract
3717 theory of product types over typedef rather than datatype;
3719 * HOL: generic code generator for generating executable ML code from
3720 specifications; specific support for HOL constructs such as inductive
3721 datatypes and sets, as well as recursive functions; can be invoked
3722 via 'generate_code' theory section;
3724 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3726 * HOL: consolidated and renamed several theories. In particular:
3727 Ord.thy has been absorbed into HOL.thy
3728 String.thy has been absorbed into List.thy
3730 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3731 (beware of argument permutation!);
3733 * HOL: linorder_less_split superseded by linorder_cases;
3735 * HOL/List: "nodups" renamed to "distinct";
3737 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3738 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3739 - Ex_def has changed, now need to use some_eq_ex
3741 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3742 in this (rare) case use:
3744 delSWrapper "split_all_tac"
3745 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3747 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3750 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3751 Isabelle's type classes, ^ on functions and relations has too general
3752 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3753 necessary to attach explicit type constraints;
3755 * HOL/Relation: the prefix name of the infix "O" has been changed from
3756 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3757 renamed accordingly (eg "compI" -> "rel_compI").
3759 * HOL: syntax translations now work properly with numerals and records
3762 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3763 of "lam" -- INCOMPATIBILITY;
3765 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3766 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3767 renamed "Product_Type.unit";
3769 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3771 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3772 the "cases" method);
3774 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3777 * HOL/IMP: updated and converted to new-style theory format; several
3778 parts turned into readable document, with proper Isar proof texts and
3779 some explanations (by Gerwin Klein);
3781 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3783 * HOL-Hyperreal is now a logic image;
3788 * Isar: consts/constdefs supports mixfix syntax for continuous
3791 * Isar: domain package adapted to new-style theory format, e.g. see
3794 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3795 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3796 lift.induct_tac, always use UU instead of Undef;
3798 * HOLCF/IMP: updated and converted to new-style theory;
3803 * Isar: proper integration of logic-specific tools and packages,
3804 including theory commands '(co)inductive', '(co)datatype',
3805 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
3806 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
3808 * theory Main no longer includes AC; for the Axiom of Choice, base
3809 your theory on Main_ZFC;
3811 * the integer library now covers quotients and remainders, with many
3812 laws relating division to addition, multiplication, etc.;
3814 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
3815 typeless version of the formalism;
3817 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
3820 * ZF/Induct: new directory for examples of inductive definitions,
3821 including theory Multiset for multiset orderings; converted to
3822 new-style theory format;
3824 * ZF: many new theorems about lists, ordinals, etc.;
3829 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
3830 variable proof controls level of detail: 0 = no proofs (only oracle
3831 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
3832 also ref manual for further ML interfaces;
3834 * Pure/axclass: removed obsolete ML interface
3835 goal_subclass/goal_arity;
3837 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
3838 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
3839 separate tokens, so expressions involving minus need to be spaced
3842 * Pure/syntax: support non-oriented infixes, using keyword "infix"
3843 rather than "infixl" or "infixr";
3845 * Pure/syntax: concrete syntax for dummy type variables admits genuine
3846 sort constraint specifications in type inference; e.g. "x::_::foo"
3847 ensures that the type of "x" is of sort "foo" (but not necessarily a
3850 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
3851 control output of nested => (types); the default behavior is
3854 * Pure/syntax: builtin parse translation for "_constify" turns valued
3855 tokens into AST constants;
3857 * Pure/syntax: prefer later declarations of translations and print
3858 translation functions; potential INCOMPATIBILITY: need to reverse
3859 multiple declarations for same syntax element constant;
3861 * Pure/show_hyps reset by default (in accordance to existing Isar
3864 * Provers/classical: renamed addaltern to addafter, addSaltern to
3867 * Provers/clasimp: ``iff'' declarations now handle conditional rules
3870 * system: tested support for MacOS X; should be able to get Isabelle +
3871 Proof General to work in a plain Terminal after installing Poly/ML
3872 (e.g. from the Isabelle distribution area) and GNU bash alone
3873 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
3874 support requires further installations, e.g. from
3875 http://fink.sourceforge.net/);
3877 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
3879 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
3880 of 40 MB), cf. ML_OPTIONS;
3882 * system: Proof General keywords specification is now part of the
3883 Isabelle distribution (see etc/isar-keywords.el);
3885 * system: support for persistent Proof General sessions (refrain from
3886 outdating all loaded theories on startup); user may create writable
3887 logic images like this: ``isabelle -q HOL Test'';
3889 * system: smart selection of Isabelle process versus Isabelle
3890 interface, accommodates case-insensitive file systems (e.g. HFS+); may
3891 run both "isabelle" and "Isabelle" even if file names are badly
3892 damaged (executable inspects the case of the first letter of its own
3893 name); added separate "isabelle-process" and "isabelle-interface";
3895 * system: refrain from any attempt at filtering input streams; no
3896 longer support ``8bit'' encoding of old isabelle font, instead proper
3897 iso-latin characters may now be used; the related isatools
3898 "symbolinput" and "nonascii" have disappeared as well;
3900 * system: removed old "xterm" interface (the print modes "xterm" and
3901 "xterm_color" are still available for direct use in a suitable
3906 New in Isabelle99-2 (February 2001)
3907 -----------------------------------
3909 *** Overview of INCOMPATIBILITIES ***
3911 * HOL: please note that theories in the Library and elsewhere often use the
3912 new-style (Isar) format; to refer to their theorems in an ML script you must
3913 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
3915 * HOL: inductive package no longer splits induction rule aggressively,
3916 but only as far as specified by the introductions given; the old
3917 format may be recovered via ML function complete_split_rule or attribute
3918 'split_rule (complete)';
3920 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
3921 gfp_Tarski to gfp_unfold;
3923 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
3925 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
3926 relation); infix "^^" has been renamed "``"; infix "``" has been
3927 renamed "`"; "univalent" has been renamed "single_valued";
3929 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
3932 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
3934 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
3936 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
3937 consequence, it is no longer monotonic wrt. the local goal context
3938 (which is now passed through the inductive cases);
3940 * Document preparation: renamed standard symbols \<ll> to \<lless> and
3941 \<gg> to \<ggreater>;
3944 *** Document preparation ***
3946 * \isabellestyle{NAME} selects version of Isabelle output (currently
3947 available: are "it" for near math-mode best-style output, "sl" for
3948 slanted text style, and "tt" for plain type-writer; if no
3949 \isabellestyle command is given, output is according to slanted
3952 * support sub/super scripts (for single symbols only), input syntax is
3953 like this: "A\<^sup>*" or "A\<^sup>\<star>";
3955 * some more standard symbols; see Appendix A of the system manual for
3956 the complete list of symbols defined in isabellesym.sty;
3958 * improved isabelle style files; more abstract symbol implementation
3959 (should now use \isamath{...} and \isatext{...} in custom symbol
3962 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
3963 state; Note that presentation of goal states does not conform to
3964 actual human-readable proof documents. Please do not include goal
3965 states into document output unless you really know what you are doing!
3967 * proper indentation of antiquoted output with proportional LaTeX
3970 * no_document ML operator temporarily disables LaTeX document
3973 * isatool unsymbolize tunes sources for plain ASCII communication;
3978 * Pure: Isar now suffers initial goal statements to contain unbound
3979 schematic variables (this does not conform to actual readable proof
3980 documents, due to unpredictable outcome and non-compositional proof
3981 checking); users who know what they are doing may use schematic goals
3982 for Prolog-style synthesis of proven results;
3984 * Pure: assumption method (an implicit finishing) now handles actual
3987 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
3988 initial goal, declare "that" only as Pure intro (only for single
3989 steps); the "that" rule assumption may now be involved in implicit
3990 finishing, thus ".." becomes a feasible for trivial obtains;
3992 * Pure: default proof step now includes 'intro_classes'; thus trivial
3993 instance proofs may be performed by "..";
3995 * Pure: ?thesis / ?this / "..." now work for pure meta-level
3998 * Pure: more robust selection of calculational rules;
4000 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4001 rule (as well as the assumption rule);
4003 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4004 lemmas, using the graph browser tool;
4006 * Pure: predict failure of "show" in interactive mode;
4008 * Pure: 'thms_containing' now takes actual terms as arguments;
4010 * HOL: improved method 'induct' --- now handles non-atomic goals
4011 (potential INCOMPATIBILITY); tuned error handling;
4013 * HOL: cases and induct rules now provide explicit hints about the
4014 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4015 any remaining facts are inserted into the goal verbatim;
4017 * HOL: local contexts (aka cases) may now contain term bindings as
4018 well; the 'cases' and 'induct' methods new provide a ?case binding for
4019 the result to be shown in each case;
4021 * HOL: added 'recdef_tc' command;
4023 * isatool convert assists in eliminating legacy ML scripts;
4028 * HOL/Library: a collection of generic theories to be used together
4029 with main HOL; the theory loader path already includes this directory
4030 by default; the following existing theories have been moved here:
4031 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4032 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4034 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4035 modelling and verification task performed in Isabelle/HOL +
4036 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4038 * HOL/Algebra: special summation operator SUM no longer exists, it has
4039 been replaced by setsum; infix 'assoc' now has priority 50 (like
4040 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4041 'domain', this makes the theory consistent with mathematical
4044 * HOL basics: added overloaded operations "inverse" and "divide"
4045 (infix "/"), syntax for generic "abs" operation, generic summation
4048 * HOL/typedef: simplified package, provide more useful rules (see also
4051 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4052 now expressed as a proper nested rule (old-style tactic scripts may
4053 require atomize_strip_tac to cope with non-atomic premises);
4055 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4056 to "split_conv" (old name still available for compatibility);
4058 * HOL: improved concrete syntax for strings (e.g. allows translation
4059 rules with string literals);
4061 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4062 and Fleuriot's mechanization of analysis, including the transcendental
4063 functions for the reals;
4065 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4070 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4071 "lam" is displayed as TWO lambda-symbols
4073 * CTT: theory Main now available, containing everything (that is, Bool
4079 * Pure: the Simplifier has been implemented properly as a derived rule
4080 outside of the actual kernel (at last!); the overall performance
4081 penalty in practical applications is about 50%, while reliability of
4082 the Isabelle inference kernel has been greatly improved;
4084 * print modes "brackets" and "no_brackets" control output of nested =>
4085 (types) and ==> (props); the default behaviour is "brackets";
4087 * Provers: fast_tac (and friends) now handle actual object-logic rules
4088 as assumptions as well;
4090 * system: support Poly/ML 4.0;
4092 * system: isatool install handles KDE version 1 or 2;
4096 New in Isabelle99-1 (October 2000)
4097 ----------------------------------
4099 *** Overview of INCOMPATIBILITIES ***
4101 * HOL: simplification of natural numbers is much changed; to partly
4102 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4103 issue the following ML commands:
4105 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4106 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4108 * HOL: simplification no longer dives into case-expressions; this is
4109 controlled by "t.weak_case_cong" for each datatype t;
4111 * HOL: nat_less_induct renamed to less_induct;
4113 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4114 fixsome to patch .thy and .ML sources automatically;
4116 select_equality -> some_equality
4117 select_eq_Ex -> some_eq_ex
4118 selectI2EX -> someI2_ex
4121 select1_equality -> some1_equality
4122 Eps_sym_eq -> some_sym_eq_trivial
4123 Eps_eq -> some_eq_trivial
4125 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4127 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4130 * HOL: the recursion equations generated by 'recdef' are now called
4131 f.simps instead of f.rules;
4133 * HOL: qed_spec_mp now also handles bounded ALL as well;
4135 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4136 sometimes be needed;
4138 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4140 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4142 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4143 product is now "<*>" instead of "Times"; the lexicographic product is
4144 now "<*lex*>" instead of "**";
4146 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4147 of main HOL, but was unused); better use HOL's datatype package;
4149 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4150 the old syntax may be recovered as follows:
4153 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4154 (infixl "\\<oplus>" 100)
4156 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4158 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4159 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4162 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4163 changed from A/r to A//r;
4165 * ZF: new treatment of arithmetic (nat & int) may break some old
4168 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4169 rulify -> rule_format, elimify -> elim_format, ...);
4171 * Isar/Provers: intro/elim/dest attributes changed; renamed
4172 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4173 should have to change intro!! to intro? only); replaced "delrule" by
4176 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4178 * Provers: strengthened force_tac by using new first_best_tac;
4180 * LaTeX document preparation: several changes of isabelle.sty (see
4184 *** Document preparation ***
4186 * formal comments (text blocks etc.) in new-style theories may now
4187 contain antiquotations of thm/prop/term/typ/text to be presented
4188 according to latex print mode; concrete syntax is like this:
4189 @{term[show_types] "f(x) = a + x"};
4191 * isatool mkdir provides easy setup of Isabelle session directories,
4192 including proper document sources;
4194 * generated LaTeX sources are now deleted after successful run
4195 (isatool document -c); may retain a copy somewhere else via -D option
4198 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4199 style files, achieving self-contained LaTeX sources and simplifying
4202 * old-style theories now produce (crude) LaTeX output as well;
4204 * browser info session directories are now self-contained (may be put
4205 on WWW server seperately); improved graphs of nested sessions; removed
4206 graph for 'all sessions';
4208 * several improvements in isabelle style files; \isabellestyle{it}
4209 produces fake math mode output; \isamarkupheader is now \section by
4210 default; see lib/texinputs/isabelle.sty etc.;
4215 * Isar/Pure: local results and corresponding term bindings are now
4216 subject to Hindley-Milner polymorphism (similar to ML); this
4217 accommodates incremental type-inference very nicely;
4219 * Isar/Pure: new derived language element 'obtain' supports
4220 generalized existence reasoning;
4222 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4223 support accumulation of results, without applying any rules yet;
4224 useful to collect intermediate results without explicit name
4225 references, and for use with transitivity rules with more than 2
4228 * Isar/Pure: scalable support for case-analysis type proofs: new
4229 'case' language element refers to local contexts symbolically, as
4230 produced by certain proof methods; internally, case names are attached
4231 to theorems as "tags";
4233 * Isar/Pure: theory command 'hide' removes declarations from
4234 class/type/const name spaces;
4236 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4237 indicate potential overloading;
4239 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4241 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4242 "{a,b,c}" instead of {a,b,c};
4244 * Isar/Pure now provides its own version of intro/elim/dest
4245 attributes; useful for building new logics, but beware of confusion
4246 with the version in Provers/classical;
4248 * Isar/Pure: the local context of (non-atomic) goals is provided via
4249 case name 'antecedent';
4251 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4252 to the current context is now done automatically);
4254 * Isar/Pure: theory command 'method_setup' provides a simple interface
4255 for definining proof methods in ML;
4257 * Isar/Provers: intro/elim/dest attributes changed; renamed
4258 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4259 most cases, one should have to change intro!! to intro? only);
4260 replaced "delrule" by "rule del";
4262 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4263 'symmetric' attribute (the latter supercedes [RS sym]);
4265 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4266 method modifier); 'simp' method: 'only:' modifier removes loopers as
4267 well (including splits);
4269 * Isar/Provers: Simplifier and Classical methods now support all kind
4270 of modifiers used in the past, including 'cong', 'iff', etc.
4272 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4273 of Simplifier and Classical reasoner);
4275 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4276 now support named cases; major packages (inductive, datatype, primrec,
4277 recdef) support case names and properly name parameters;
4279 * Isar/HOL: new transitivity rules for substitution in inequalities --
4280 monotonicity conditions are extracted to be proven at end of
4283 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4286 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4287 split_if split_if_asm; datatype package provides theorems foo.splits =
4288 foo.split foo.split_asm for each datatype;
4290 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4291 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4292 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4293 use "(cases (simplified))" method in proper proof texts);
4295 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4297 * Isar: names of theorems etc. may be natural numbers as well;
4299 * Isar: 'pr' command: optional arguments for goals_limit and
4300 ProofContext.prems_limit; no longer prints theory contexts, but only
4303 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4304 additional print modes to be specified; e.g. "pr(latex)" will print
4305 proof state according to the Isabelle LaTeX style;
4307 * Isar: improved support for emulating tactic scripts, including proof
4308 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4309 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4310 (for HOL datatypes);
4312 * Isar: simplified (more robust) goal selection of proof methods: 1st
4313 goal, all goals, or explicit goal specifier (tactic emulation); thus
4314 'proof method scripts' have to be in depth-first order;
4316 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4318 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4319 should instead use individual commands for printing items
4320 (print_commands, print_methods etc.);
4322 * Isar: added 'nothing' --- the empty list of theorems;
4327 * HOL/MicroJava: formalization of a fragment of Java, together with a
4328 corresponding virtual machine and a specification of its bytecode
4329 verifier and a lightweight bytecode verifier, including proofs of
4330 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4331 Cornelia Pusch (see also the homepage of project Bali at
4332 http://isabelle.in.tum.de/Bali/);
4334 * HOL/Algebra: new theory of rings and univariate polynomials, by
4337 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4338 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4341 * HOL/Lattice: fundamental concepts of lattice theory and order
4342 structures, including duals, properties of bounds versus algebraic
4343 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4344 Theorem for complete lattices etc.; may also serve as a demonstration
4345 for abstract algebraic reasoning using axiomatic type classes, and
4346 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4348 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4351 * HOL/IMPP: extension of IMP with local variables and mutually
4352 recursive procedures, by David von Oheimb;
4354 * HOL/Lambda: converted into new-style theory and document;
4356 * HOL/ex/Multiquote: example of multiple nested quotations and
4357 anti-quotations -- basically a generalized version of de-Bruijn
4358 representation; very useful in avoiding lifting of operations;
4360 * HOL/record: added general record equality rule to simpset; fixed
4361 select-update simplification procedure to handle extended records as
4362 well; admit "r" as field name;
4364 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4365 other numeric types and also as the identity of groups, rings, etc.;
4367 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4368 Types nat and int belong to this axclass;
4370 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4371 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4372 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4373 two terms #m*u and #n*u are replaced by #(m+n)*u
4374 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4375 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4376 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4378 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4379 powerful prover for predicate logic but knows nothing of clasets; see
4380 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4382 * HOL: new version of "case_tac" subsumes both boolean case split and
4383 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4384 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4386 * HOL: simplification no longer dives into case-expressions: only the
4387 selector expression is simplified, but not the remaining arms; to
4388 enable full simplification of case-expressions for datatype t, you may
4389 remove t.weak_case_cong from the simpset, either globally (Delcongs
4390 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4392 * HOL/recdef: the recursion equations generated by 'recdef' for
4393 function 'f' are now called f.simps instead of f.rules; if all
4394 termination conditions are proved automatically, these simplification
4395 rules are added to the simpset, as in primrec; rules may be named
4396 individually as well, resulting in a separate list of theorems for
4399 * HOL/While is a new theory that provides a while-combinator. It
4400 permits the definition of tail-recursive functions without the
4401 provision of a termination measure. The latter is necessary once the
4402 invariant proof rule for while is applied.
4404 * HOL: new (overloaded) notation for the set of elements below/above
4405 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4407 * HOL: theorems impI, allI, ballI bound as "strip";
4409 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4410 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4411 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4413 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4415 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4416 main HOL, but was unused);
4418 * HOL: fewer consts declared as global (e.g. have to refer to
4419 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4421 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4422 in case of overlap with user translations (e.g. judgements over
4423 tuples); (note that the underlying logical represenation is still
4429 * ZF: simplification automatically cancels common terms in arithmetic
4430 expressions over nat and int;
4432 * ZF: new treatment of nat to minimize type-checking: all operators
4433 coerce their operands to a natural number using the function natify,
4434 making the algebraic laws unconditional;
4436 * ZF: as above, for int: operators coerce their operands to an integer
4437 using the function intify;
4439 * ZF: the integer library now contains many of the usual laws for the
4440 orderings, including $<=, and monotonicity laws for $+ and $*;
4442 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4445 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4446 to the simplifier and classical reasoner simultaneously;
4451 * Provers: blast_tac now handles actual object-logic rules as
4452 assumptions; note that auto_tac uses blast_tac internally as well;
4454 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4455 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4457 * Provers: delrules now handles destruct rules as well (no longer need
4458 explicit make_elim);
4460 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4461 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4462 use instead the strong form,
4463 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4464 in HOL, FOL and ZF the function cla_make_elim will create such rules
4465 from destruct-rules;
4467 * Provers: Simplifier.easy_setup provides a fast path to basic
4468 Simplifier setup for new object-logics;
4470 * Pure: AST translation rules no longer require constant head on LHS;
4472 * Pure: improved name spaces: ambiguous output is qualified; support
4473 for hiding of names;
4475 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4476 XSYMBOL_HOME; no longer need to do manual configuration in most
4479 * system: compression of ML heaps images may now be controlled via -c
4480 option of isabelle and isatool usedir (currently only observed by
4483 * system: isatool installfonts may handle X-Symbol fonts as well (very
4484 useful for remote X11);
4486 * system: provide TAGS file for Isabelle sources;
4488 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4491 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4492 timing flag supersedes proof_timing and Toplevel.trace;
4494 * ML: new combinators |>> and |>>> for incremental transformations
4495 with secondary results (e.g. certain theory extensions):
4497 * ML: PureThy.add_defs gets additional argument to indicate potential
4498 overloading (usually false);
4500 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4505 New in Isabelle99 (October 1999)
4506 --------------------------------
4508 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4510 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4511 are no longer simplified. (This allows the simplifier to unfold recursive
4512 functional programs.) To restore the old behaviour, declare
4514 Delcongs [if_weak_cong];
4516 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4519 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4521 * HOL/datatype: mutual_induct_tac no longer exists --
4522 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4524 * HOL/typedef: fixed type inference for representing set; type
4525 arguments now have to occur explicitly on the rhs as type constraints;
4527 * ZF: The con_defs part of an inductive definition may no longer refer
4528 to constants declared in the same theory;
4530 * HOL, ZF: the function mk_cases, generated by the inductive
4531 definition package, has lost an argument. To simplify its result, it
4532 uses the default simpset instead of a supplied list of theorems.
4534 * HOL/List: the constructors of type list are now Nil and Cons;
4536 * Simplifier: the type of the infix ML functions
4537 setSSolver addSSolver setSolver addSolver
4538 is now simpset * solver -> simpset where `solver' is a new abstract type
4539 for packaging solvers. A solver is created via
4540 mk_solver: string -> (thm list -> int -> tactic) -> solver
4541 where the string argument is only a comment.
4546 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4547 decision procedure for linear arithmetic. Currently it is used for
4548 types `nat', `int', and `real' in HOL (see below); it can, should and
4549 will be instantiated for other types and logics as well.
4551 * The simplifier now accepts rewrite rules with flexible heads, eg
4552 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4553 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4559 * New Isabelle/Isar subsystem provides an alternative to traditional
4560 tactical theorem proving; together with the ProofGeneral/isar user
4561 interface it offers an interactive environment for developing human
4562 readable proof documents (Isar == Intelligible semi-automated
4563 reasoning); for further information see isatool doc isar-ref,
4564 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4566 * improved and simplified presentation of theories: better HTML markup
4567 (including colors), graph views in several sizes; isatool usedir now
4568 provides a proper interface for user theories (via -P option); actual
4569 document preparation based on (PDF)LaTeX is available as well (for
4570 new-style theories only); see isatool doc system for more information;
4572 * native support for Proof General, both for classic Isabelle and
4575 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4576 using the graph browser tool;
4578 * Isabelle manuals now also available as PDF;
4580 * theory loader rewritten from scratch (may not be fully
4581 bug-compatible); old loadpath variable has been replaced by show_path,
4582 add_path, del_path, reset_path functions; new operations such as
4583 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4586 * improved isatool install: option -k creates KDE application icon,
4587 option -p DIR installs standalone binaries;
4589 * added ML_PLATFORM setting (useful for cross-platform installations);
4590 more robust handling of platform specific ML images for SML/NJ;
4592 * the settings environment is now statically scoped, i.e. it is never
4593 created again in sub-processes invoked from isabelle, isatool, or
4596 * path element specification '~~' refers to '$ISABELLE_HOME';
4598 * in locales, the "assumes" and "defines" parts may be omitted if
4601 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4604 * new print_mode "HTML";
4606 * new flag show_tags controls display of tags of theorems (which are
4607 basically just comments that may be attached by some tools);
4609 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4610 mode and goal output format:
4612 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4614 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4616 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4617 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4619 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4621 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4623 * function bind_thms stores lists of theorems (cf. bind_thm);
4625 * new shorthand tactics ftac, eatac, datac, fatac;
4627 * qed (and friends) now accept "" as result name; in that case the
4628 theorem is not stored, but proper checks and presentation of the
4631 * theorem database now also indexes constants "Trueprop", "all",
4632 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4637 ** HOL arithmetic **
4639 * There are now decision procedures for linear arithmetic over nat and
4642 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4643 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4644 are treated as atomic; subformulae not involving type `nat' or `int'
4645 are ignored; quantified subformulae are ignored unless they are
4646 positive universal or negative existential. The tactic has to be
4647 invoked by hand and can be a little bit slow. In particular, the
4648 running time is exponential in the number of occurrences of `min' and
4649 `max', and `-' on `nat'.
4651 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4652 (negated) (in)equalities among the premises and the conclusion into
4653 account (i.e. no compound formulae) and does not know about `min' and
4654 `max', and `-' on `nat'. It is fast and is used automatically by the
4657 NB: At the moment, these decision procedures do not cope with mixed
4658 nat/int formulae where the two parts interact, such as `m < n ==>
4661 * HOL/Numeral provides a generic theory of numerals (encoded
4662 efficiently as bit strings); setup for types nat/int/real is in place;
4663 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4664 int, existing theories and proof scripts may require a few additional
4667 * integer division and remainder can now be performed on constant
4670 * many properties of integer multiplication, division and remainder
4673 * An interface to the Stanford Validity Checker (SVC) is available through the
4674 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4675 are proved automatically. SVC must be installed separately, and its results
4676 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4677 invocation of the underlying oracle). For SVC see
4678 http://verify.stanford.edu/SVC
4680 * IsaMakefile: the HOL-Real target now builds an actual image;
4685 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4686 (in Isabelle/Isar) -- by Gertrud Bauer;
4688 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4689 analysis for assembly languages with subtypes;
4691 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4692 -- avoids syntactic ambiguities and treats state, transition, and
4693 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4694 changed syntax and (many) tactics;
4696 * HOL/inductive: Now also handles more general introduction rules such
4697 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4698 theorems are now maintained within the theory (maintained via the
4701 * HOL/datatype: Now also handles arbitrarily branching datatypes
4702 (using function types) such as
4704 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4706 * HOL/record: record_simproc (part of the default simpset) takes care
4707 of selectors applied to updated records; record_split_tac is no longer
4708 part of the default claset; update_defs may now be removed from the
4709 simpset in many cases; COMPATIBILITY: old behavior achieved by
4711 claset_ref () := claset() addSWrapper record_split_wrapper;
4712 Delsimprocs [record_simproc]
4714 * HOL/typedef: fixed type inference for representing set; type
4715 arguments now have to occur explicitly on the rhs as type constraints;
4717 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4718 names rather than an ML expression;
4720 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4721 supplied later. Program schemes can be defined, such as
4722 "While B C s = (if B s then While B C (C s) else s)"
4723 where the well-founded relation can be chosen after B and C have been given.
4725 * HOL/List: the constructors of type list are now Nil and Cons;
4726 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4727 course, ML tools referring to List.list.op # etc. have to be adapted;
4729 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4730 disabled by default; run isabelle with option -m HOL to get back to
4731 the original Gordon/HOL-style output;
4733 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4734 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4736 * HOL basic syntax simplified (more orthogonal): all variants of
4737 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4738 Eps operator is provided as well: "SOME x. P[x]";
4740 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4742 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4743 thus available for user theories;
4745 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4746 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4749 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4750 several times and then mp;
4755 * the notation <<...>> is now available as a notation for sequences of
4758 * the simplifier is now installed
4760 * the axiom system has been generalized (thanks to Soren Heilmann)
4762 * the classical reasoner now has a default rule database
4767 * new primrec section allows primitive recursive functions to be given
4768 directly (as in HOL) over datatypes and the natural numbers;
4770 * new tactics induct_tac and exhaust_tac for induction (or case
4771 analysis) over datatypes and the natural numbers;
4773 * the datatype declaration of type T now defines the recursor T_rec;
4775 * simplification automatically does freeness reasoning for datatype
4778 * automatic type-inference, with AddTCs command to insert new
4779 type-checking rules;
4781 * datatype introduction rules are now added as Safe Introduction rules
4784 * the syntax "if P then x else y" is now available in addition to
4788 *** Internal programming interfaces ***
4790 * tuned simplifier trace output; new flag debug_simp;
4792 * structures Vartab / Termtab (instances of TableFun) offer efficient
4793 tables indexed by indexname_ord / term_ord (compatible with aconv);
4795 * AxClass.axclass_tac lost the theory argument;
4797 * tuned current_goals_markers semantics: begin / end goal avoids
4798 printing empty lines;
4800 * removed prs and prs_fn hook, which was broken because it did not
4801 include \n in its semantics, forcing writeln to add one
4802 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4803 string -> unit if you really want to output text without newline;
4805 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
4806 plain output, interface builders may have to enable 'isabelle_font'
4807 mode to get Isabelle font glyphs as before;
4809 * refined token_translation interface; INCOMPATIBILITY: output length
4810 now of type real instead of int;
4812 * theory loader actions may be traced via new ThyInfo.add_hook
4813 interface (see src/Pure/Thy/thy_info.ML); example application: keep
4814 your own database of information attached to *whole* theories -- as
4815 opposed to intra-theory data slots offered via TheoryDataFun;
4817 * proper handling of dangling sort hypotheses (at last!);
4818 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
4819 extra sort hypotheses that can be witnessed from the type signature;
4820 the force_strip_shyps flag is gone, any remaining shyps are simply
4821 left in the theorem (with a warning issued by strip_shyps_warning);
4825 New in Isabelle98-1 (October 1998)
4826 ----------------------------------
4828 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4830 * several changes of automated proof tools;
4832 * HOL: major changes to the inductive and datatype packages, including
4833 some minor incompatibilities of theory syntax;
4835 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
4838 * HOL: removed duplicate thms in Arith:
4839 less_imp_add_less should be replaced by trans_less_add1
4840 le_imp_add_le should be replaced by trans_le_add1
4842 * HOL: unary minus is now overloaded (new type constraints may be
4845 * HOL and ZF: unary minus for integers is now #- instead of #~. In
4846 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
4847 now taken as an integer constant.
4849 * Pure: ML function 'theory_of' renamed to 'theory';
4855 1. Asm_full_simp_tac is now more aggressive.
4856 1. It will sometimes reorient premises if that increases their power to
4858 2. It does no longer proceed strictly from left to right but may also
4859 rotate premises to achieve further simplification.
4860 For compatibility reasons there is now Asm_lr_simp_tac which is like the
4861 old Asm_full_simp_tac in that it does not rotate premises.
4862 2. The simplifier now knows a little bit about nat-arithmetic.
4864 * Classical reasoner: wrapper mechanism for the classical reasoner now
4865 allows for selected deletion of wrappers, by introduction of names for
4866 wrapper functionals. This implies that addbefore, addSbefore,
4867 addaltern, and addSaltern now take a pair (name, tactic) as argument,
4868 and that adding two tactics with the same name overwrites the first
4869 one (emitting a warning).
4870 type wrapper = (int -> tactic) -> (int -> tactic)
4871 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
4872 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
4873 delWrapper, delSWrapper: claset * string -> claset
4874 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
4876 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
4877 semantics; addbefore now affects only the unsafe part of step_tac
4878 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
4879 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
4882 * Classical reasoner: setwrapper to setWrapper and compwrapper to
4883 compWrapper; added safe wrapper (and access functions for it);
4885 * HOL/split_all_tac is now much faster and fails if there is nothing
4886 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
4887 and the names of the automatically generated variables have changed.
4888 split_all_tac has moved within claset() from unsafe wrappers to safe
4889 wrappers, which means that !!-bound variables are split much more
4890 aggressively, and safe_tac and clarify_tac now split such variables.
4891 If this splitting is not appropriate, use delSWrapper "split_all_tac".
4892 Note: the same holds for record_split_tac, which does the job of
4893 split_all_tac for record fields.
4895 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
4896 permanently to the default simpset using Addsplits just like
4897 Addsimps. They can be removed via Delsplits just like
4898 Delsimps. Lower-case versions are also available.
4900 * HOL/Simplifier: The rule split_if is now part of the default
4901 simpset. This means that the simplifier will eliminate all occurrences
4902 of if-then-else in the conclusion of a goal. To prevent this, you can
4903 either remove split_if completely from the default simpset by
4904 `Delsplits [split_if]' or remove it in a specific call of the
4905 simplifier using `... delsplits [split_if]'. You can also add/delete
4906 other case splitting rules to/from the default simpset: every datatype
4907 generates suitable rules `split_t_case' and `split_t_case_asm' (where
4908 t is the name of the datatype).
4910 * Classical reasoner / Simplifier combination: new force_tac (and
4911 derivatives Force_tac, force) combines rewriting and classical
4912 reasoning (and whatever other tools) similarly to auto_tac, but is
4913 aimed to solve the given subgoal completely.
4918 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
4919 and `goalw': the theory is no longer needed as an explicit argument -
4920 the current theory context is used; assumptions are no longer returned
4921 at the ML-level unless one of them starts with ==> or !!; it is
4922 recommended to convert to these new commands using isatool fixgoal
4923 (backup your sources first!);
4925 * new top-level commands 'thm' and 'thms' for retrieving theorems from
4926 the current theory context, and 'theory' to lookup stored theories;
4928 * new theory section 'locale' for declaring constants, assumptions and
4929 definitions that have local scope;
4931 * new theory section 'nonterminals' for purely syntactic types;
4933 * new theory section 'setup' for generic ML setup functions
4934 (e.g. package initialization);
4936 * the distribution now includes Isabelle icons: see
4937 lib/logo/isabelle-{small,tiny}.xpm;
4939 * isatool install - install binaries with absolute references to
4942 * isatool logo -- create instances of the Isabelle logo (as EPS);
4944 * print mode 'emacs' reserved for Isamode;
4946 * support multiple print (ast) translations per constant name;
4948 * theorems involving oracles are now printed with a suffixed [!];
4953 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
4955 * HOL/inductive package reorganized and improved: now supports mutual
4961 oddI "n : EVEN ==> Suc n : ODD"
4962 evenI "n : ODD ==> Suc n : EVEN"
4964 new theorem list "elims" contains an elimination rule for each of the
4965 recursive sets; inductive definitions now handle disjunctive premises
4966 correctly (also ZF);
4968 INCOMPATIBILITIES: requires Inductive as an ancestor; component
4969 "mutual_induct" no longer exists - the induction rule is always
4970 contained in "induct";
4973 * HOL/datatype package re-implemented and greatly improved: now
4974 supports mutually recursive datatypes such as
4977 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
4978 | SUM ('a aexp) ('a aexp)
4979 | DIFF ('a aexp) ('a aexp)
4982 'a bexp = LESS ('a aexp) ('a aexp)
4983 | AND ('a bexp) ('a bexp)
4984 | OR ('a bexp) ('a bexp)
4986 as well as indirectly recursive datatypes such as
4989 ('a, 'b) term = Var 'a
4990 | App 'b ((('a, 'b) term) list)
4992 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
4993 induction on mutually / indirectly recursive datatypes.
4995 Primrec equations are now stored in theory and can be accessed via
4996 <function_name>.simps.
5000 - Theories using datatypes must now have theory Datatype as an
5002 - The specific <typename>.induct_tac no longer exists - use the
5003 generic induct_tac instead.
5004 - natE has been renamed to nat.exhaust - use exhaust_tac
5005 instead of res_inst_tac ... natE. Note that the variable
5006 names in nat.exhaust differ from the names in natE, this
5007 may cause some "fragile" proofs to fail.
5008 - The theorems split_<typename>_case and split_<typename>_case_asm
5009 have been renamed to <typename>.split and <typename>.split_asm.
5010 - Since default sorts of type variables are now handled correctly,
5011 some datatype definitions may have to be annotated with explicit
5013 - Primrec definitions no longer require function name and type
5014 of recursive argument.
5016 Consider using isatool fixdatatype to adapt your theories and proof
5017 scripts to the new package (backup your sources first!).
5020 * HOL/record package: considerably improved implementation; now
5021 includes concrete syntax for record types, terms, updates; theorems
5022 for surjective pairing and splitting !!-bound record variables; proof
5023 support is as follows:
5025 1) standard conversions (selectors or updates applied to record
5026 constructor terms) are part of the standard simpset;
5028 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5029 made part of standard simpset and claset via addIffs;
5031 3) a tactic for record field splitting (record_split_tac) is part of
5032 the standard claset (addSWrapper);
5034 To get a better idea about these rules you may retrieve them via
5035 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5036 the name of your record type.
5038 The split tactic 3) conceptually simplifies by the following rule:
5040 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5042 Thus any record variable that is bound by meta-all will automatically
5043 blow up into some record constructor term, consequently the
5044 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5045 solve record problems automatically.
5048 * reorganized the main HOL image: HOL/Integ and String loaded by
5049 default; theory Main includes everything;
5051 * automatic simplification of integer sums and comparisons, using cancellation;
5053 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5055 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5057 * many new identities for unions, intersections, set difference, etc.;
5059 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5060 called split_if, split_split, split_sum_case and split_nat_case (to go
5061 with add/delsplits);
5063 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5064 (?x::unit) = (); this is made part of the default simpset, which COULD
5065 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5066 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5067 unit_abs_eta_conv is added in order to counter the effect of
5068 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5071 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5074 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5075 It and 'sym RS equals0D' are now in the default claset, giving automatic
5076 disjointness reasoning but breaking a few old proofs.
5078 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5079 to 'converse' from 'inverse' (for compatibility with ZF and some
5082 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5083 the well-founded relation;
5085 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5086 Compl A. The "Compl" syntax remains available as input syntax for this
5089 * HOL/Update: new theory of function updates:
5090 f(a:=b) == %x. if x=a then b else f x
5091 may also be iterated as in f(a:=b,c:=d,...);
5093 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5096 - new function list_update written xs[i:=v] that updates the i-th
5097 list position. May also be iterated as in xs[i:=a,j:=b,...].
5098 - new function `upt' written [i..j(] which generates the list
5099 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5100 bound write [i..j], which is a shorthand for [i..j+1(].
5101 - new lexicographic orderings and corresponding wellfoundedness theorems.
5104 - removed 'pred' (predecessor) function;
5105 - generalized some theorems about n-1;
5106 - many new laws about "div" and "mod";
5107 - new laws about greatest common divisors (see theory ex/Primes);
5109 * HOL/Relation: renamed the relational operator r^-1 "converse"
5110 instead of "inverse";
5112 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5113 of the multiset ordering;
5115 * directory HOL/Real: a construction of the reals using Dedekind cuts
5116 (not included by default);
5118 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5120 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5121 programs, i.e. different program variables may have different types.
5123 * calling (stac rew i) now fails if "rew" has no effect on the goal
5124 [previously, this check worked only if the rewrite rule was unconditional]
5125 Now rew can involve either definitions or equalities (either == or =).
5130 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5131 only the theorems proved on ZF.ML;
5133 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5134 It and 'sym RS equals0D' are now in the default claset, giving automatic
5135 disjointness reasoning but breaking a few old proofs.
5137 * ZF/Update: new theory of function updates
5138 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5139 may also be iterated as in f(a:=b,c:=d,...);
5141 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5143 * calling (stac rew i) now fails if "rew" has no effect on the goal
5144 [previously, this check worked only if the rewrite rule was unconditional]
5145 Now rew can involve either definitions or equalities (either == or =).
5147 * case_tac provided for compatibility with HOL
5148 (like the old excluded_middle_tac, but with subgoals swapped)
5151 *** Internal programming interfaces ***
5153 * Pure: several new basic modules made available for general use, see
5154 also src/Pure/README;
5156 * improved the theory data mechanism to support encapsulation (data
5157 kind name replaced by private Object.kind, acting as authorization
5158 key); new type-safe user interface via functor TheoryDataFun; generic
5159 print_data function becomes basically useless;
5161 * removed global_names compatibility flag -- all theory declarations
5162 are qualified by default;
5164 * module Pure/Syntax now offers quote / antiquote translation
5165 functions (useful for Hoare logic etc. with implicit dependencies);
5166 see HOL/ex/Antiquote for an example use;
5168 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5171 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5174 * Display.print_goals function moved to Locale.print_goals;
5176 * standard print function for goals supports current_goals_markers
5177 variable for marking begin of proof, end of proof, start of goal; the
5178 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5179 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5184 New in Isabelle98 (January 1998)
5185 --------------------------------
5187 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5189 * changed lexical syntax of terms / types: dots made part of long
5190 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5192 * simpset (and claset) reference variable replaced by functions
5193 simpset / simpset_ref;
5195 * no longer supports theory aliases (via merge) and non-trivial
5196 implicit merge of thms' signatures;
5198 * most internal names of constants changed due to qualified names;
5200 * changed Pure/Sequence interface (see Pure/seq.ML);
5203 *** General Changes ***
5205 * hierachically structured name spaces (for consts, types, axms, thms
5206 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5207 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5208 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5209 long_names for fully qualified output names; NOTE: ML programs
5210 (special tactics, packages etc.) referring to internal names may have
5211 to be adapted to cope with fully qualified names; in case of severe
5212 backward campatibility problems try setting 'global_names' at compile
5213 time to have enrything declared within a flat name space; one may also
5214 fine tune name declarations in theories via the 'global' and 'local'
5217 * reimplemented the implicit simpset and claset using the new anytype
5218 data filed in signatures; references simpset:simpset ref etc. are
5219 replaced by functions simpset:unit->simpset and
5220 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5221 to patch your ML files accordingly;
5223 * HTML output now includes theory graph data for display with Java
5224 applet or isatool browser; data generated automatically via isatool
5225 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5227 * defs may now be conditional; improved rewrite_goals_tac to handle
5228 conditional equations;
5230 * defs now admits additional type arguments, using TYPE('a) syntax;
5232 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5233 creates a new theory node; implicit merge of thms' signatures is
5234 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5235 transfer:theory->thm->thm in (rare) cases;
5237 * improved handling of draft signatures / theories; draft thms (and
5238 ctyps, cterms) are automatically promoted to real ones;
5240 * slightly changed interfaces for oracles: admit many per theory, named
5241 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5243 * print_goals: optional output of const types (set show_consts and
5246 * improved output of warnings (###) and errors (***);
5248 * subgoal_tac displays a warning if the new subgoal has type variables;
5250 * removed old README and Makefiles;
5252 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5254 * removed obsolete init_pps and init_database;
5256 * deleted the obsolete tactical STATE, which was declared by
5257 fun STATE tacfun st = tacfun st st;
5259 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5260 (which abbreviates $HOME);
5262 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5263 use isatool fixseq to adapt your ML programs (this works for fully
5264 qualified references to the Sequence structure only!);
5266 * use_thy no longer requires writable current directory; it always
5267 reloads .ML *and* .thy file, if either one is out of date;
5270 *** Classical Reasoner ***
5272 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5273 tactics that use classical reasoning to simplify a subgoal without
5274 splitting it into several subgoals;
5276 * Safe_tac: like safe_tac but uses the default claset;
5281 * added simplification meta rules:
5282 (asm_)(full_)simplify: simpset -> thm -> thm;
5284 * simplifier.ML no longer part of Pure -- has to be loaded by object
5287 * added prems argument to simplification procedures;
5289 * HOL, FOL, ZF: added infix function `addsplits':
5290 instead of `<simpset> setloop (split_tac <thms>)'
5291 you can simply write `<simpset> addsplits <thms>'
5296 * TYPE('a) syntax for type reflection terms;
5298 * no longer handles consts with name "" -- declare as 'syntax' instead;
5300 * pretty printer: changed order of mixfix annotation preference (again!);
5302 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5307 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5308 with `addloop' of the simplifier to faciliate case splitting in premises.
5310 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5312 * HOL/Auth: new protocol proofs including some for the Internet
5315 * HOL/Map: new theory of `maps' a la VDM;
5317 * HOL/simplifier: simplification procedures nat_cancel_sums for
5318 cancelling out common nat summands from =, <, <= (in)equalities, or
5319 differences; simplification procedures nat_cancel_factor for
5320 cancelling common factor from =, <, <= (in)equalities over natural
5321 sums; nat_cancel contains both kinds of procedures, it is installed by
5322 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5324 * HOL/simplifier: terms of the form
5325 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5327 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5328 and those of the form
5329 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5331 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5334 Each datatype `t' now comes with a theorem `split_t_case' of the form
5336 P(t_case f1 ... fn x) =
5337 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5339 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5342 and a theorem `split_t_case_asm' of the form
5344 P(t_case f1 ... fn x) =
5345 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5347 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5349 which can be added to a simpset via `addsplits'. The existing theorems
5350 expand_list_case and expand_option_case have been renamed to
5351 split_list_case and split_option_case.
5354 - `pred n' is automatically converted to `n-1'.
5355 Users are strongly encouraged not to use `pred' any longer,
5356 because it will disappear altogether at some point.
5357 - Users are strongly encouraged to write "0 < n" rather than
5358 "n ~= 0". Theorems and proof tools have been modified towards this
5362 the function "set_of_list" has been renamed "set" (and its theorems too);
5363 the function "nth" now takes its arguments in the reverse order and
5364 has acquired the infix notation "!" as in "xs!n".
5366 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5368 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5369 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5371 * HOL/record: extensible records with schematic structural subtyping
5372 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5373 still lacks various theorems and concrete record syntax;
5378 * removed "axioms" and "generated by" sections;
5380 * replaced "ops" section by extended "consts" section, which is capable of
5381 handling the continuous function space "->" directly;
5384 . proves theorems immediately and stores them in the theory,
5385 . creates hierachical name space,
5386 . now uses normal mixfix annotations (instead of cinfix...),
5387 . minor changes to some names and values (for consistency),
5388 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5389 . separator between mutual domain defs: changed "," to "and",
5390 . improved handling of sort constraints; now they have to
5391 appear on the left-hand side of the equations only;
5393 * fixed LAM <x,y,zs>.b syntax;
5395 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5396 adm (%x. P (t x)), where P is chainfinite and t continuous;
5401 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5402 with `addloop' of the simplifier to faciliate case splitting in premises.
5404 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5405 in HOL, they strip ALL and --> from proved theorems;
5409 New in Isabelle94-8 (May 1997)
5410 ------------------------------
5412 *** General Changes ***
5414 * new utilities to build / run / maintain Isabelle etc. (in parts
5415 still somewhat experimental); old Makefiles etc. still functional;
5417 * new 'Isabelle System Manual';
5419 * INSTALL text, together with ./configure and ./build scripts;
5421 * reimplemented type inference for greater efficiency, better error
5422 messages and clean internal interface;
5424 * prlim command for dealing with lots of subgoals (an easier way of
5425 setting goals_limit);
5430 * supports alternative (named) syntax tables (parser and pretty
5431 printer); internal interface is provided by add_modesyntax(_i);
5433 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5434 be used in conjunction with the Isabelle symbol font; uses the
5435 "symbols" syntax table;
5437 * added token_translation interface (may translate name tokens in
5438 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5439 the current print_mode); IMPORTANT: user print translation functions
5440 are responsible for marking newly introduced bounds
5441 (Syntax.mark_boundT);
5443 * token translations for modes "xterm" and "xterm_color" that display
5444 names in bold, underline etc. or colors (which requires a color
5447 * infixes may now be declared with names independent of their syntax;
5449 * added typed_print_translation (like print_translation, but may
5450 access type of constant);
5453 *** Classical Reasoner ***
5455 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5456 some limitations. Blast_tac...
5457 + ignores addss, addbefore, addafter; this restriction is intrinsic
5458 + ignores elimination rules that don't have the correct format
5459 (the conclusion MUST be a formula variable)
5460 + ignores types, which can make HOL proofs fail
5461 + rules must not require higher-order unification, e.g. apply_type in ZF
5462 [message "Function Var's argument not a bound variable" relates to this]
5463 + its proof strategy is more general but can actually be slower
5465 * substitution with equality assumptions no longer permutes other
5468 * minor changes in semantics of addafter (now called addaltern); renamed
5469 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5470 (and access functions for it);
5472 * improved combination of classical reasoner and simplifier:
5473 + functions for handling clasimpsets
5474 + improvement of addss: now the simplifier is called _after_ the
5476 + safe variant of addss called addSss: uses safe simplifications
5477 _during_ the safe steps. It is more complete as it allows multiple
5478 instantiations of unknowns (e.g. with slow_tac).
5482 * added interface for simplification procedures (functions that
5483 produce *proven* rewrite rules on the fly, depending on current
5486 * ordering on terms as parameter (used for ordered rewriting);
5488 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5490 * the solver is now split into a safe and an unsafe part.
5491 This should be invisible for the normal user, except that the
5492 functions setsolver and addsolver have been renamed to setSolver and
5493 addSolver; added safe_asm_full_simp_tac;
5498 * a generic induction tactic `induct_tac' which works for all datatypes and
5499 also for type `nat';
5501 * a generic case distinction tactic `exhaust_tac' which works for all
5502 datatypes and also for type `nat';
5504 * each datatype comes with a function `size';
5506 * patterns in case expressions allow tuple patterns as arguments to
5507 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5509 * primrec now also works with type nat;
5511 * recdef: a new declaration form, allows general recursive functions to be
5512 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5514 * the constant for negation has been renamed from "not" to "Not" to
5515 harmonize with FOL, ZF, LK, etc.;
5517 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5520 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5522 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5523 problems in commutative rings, using axiomatic type classes for + and *;
5525 * more examples in HOL/MiniML and HOL/Auth;
5527 * more default rewrite rules for quantifiers, union/intersection;
5529 * a new constant `arbitrary == @x.False';
5531 * HOLCF/IOA replaces old HOL/IOA;
5533 * HOLCF changes: derived all rules and arities
5534 + axiomatic type classes instead of classes
5535 + typedef instead of faking type definitions
5536 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5537 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5538 + eliminated the types void, one, tr
5539 + use unit lift and bool lift (with translations) instead of one and tr
5540 + eliminated blift from Lift3.thy (use Def instead of blift)
5541 all eliminated rules are derived as theorems --> no visible changes ;
5546 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5547 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5548 as ZF_cs addSIs [equalityI];
5552 New in Isabelle94-7 (November 96)
5553 ---------------------------------
5555 * allowing negative levels (as offsets) in prlev and choplev;
5557 * super-linear speedup for large simplifications;
5559 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5560 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5561 FAIL); can suppress it using the command Delsimps (ex_simps @
5562 all_simps); De Morgan laws are also now included, by default;
5564 * improved printing of ==> : ~:
5566 * new object-logic "Sequents" adds linear logic, while replacing LK
5567 and Modal (thanks to Sara Kalvala);
5569 * HOL/Auth: correctness proofs for authentication protocols;
5571 * HOL: new auto_tac combines rewriting and classical reasoning (many
5572 examples on HOL/Auth);
5574 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5575 the rewriter and classical reasoner simultaneously;
5577 * function uresult no longer returns theorems in "standard" format;
5578 regain previous version by: val uresult = standard o uresult;
5585 * oracles -- these establish an interface between Isabelle and trusted
5586 external reasoners, which may deliver results as theorems;
5588 * proof objects (in particular record all uses of oracles);
5590 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5592 * "constdefs" section in theory files;
5594 * "primrec" section (HOL) no longer requires names;
5596 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5603 * reduced space requirements;
5605 * automatic HTML generation from theories;
5607 * theory files no longer require "..." (quotes) around most types;
5609 * new examples, including two proofs of the Church-Rosser theorem;
5611 * non-curried (1994) version of HOL is no longer distributed;
5618 * greatly reduced space requirements;
5620 * theory files (.thy) no longer require \...\ escapes at line breaks;
5622 * searchable theorem database (see the section "Retrieving theorems" on
5623 page 8 of the Reference Manual);
5625 * new examples, including Grabczewski's monumental case study of the
5628 * The previous version of HOL renamed to Old_HOL;
5630 * The new version of HOL (previously called CHOL) uses a curried syntax
5631 for functions. Application looks like f a b instead of f(a,b);
5633 * Mutually recursive inductive definitions finally work in HOL;
5635 * In ZF, pattern-matching on tuples is now available in all abstractions and
5636 translates to the operator "split";
5643 * new infix operator, addss, allowing the classical reasoner to
5644 perform simplification at each step of its search. Example:
5645 fast_tac (cs addss ss)
5647 * a new logic, CHOL, the same as HOL, but with a curried syntax
5648 for functions. Application looks like f a b instead of f(a,b). Also pairs
5649 look like (a,b) instead of <a,b>;
5651 * PLEASE NOTE: CHOL will eventually replace HOL!
5653 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5654 It translates to the operator "split". A new theory of integers is available;
5656 * In ZF, integer numerals now denote two's-complement binary integers.
5657 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5659 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5660 of the Axiom of Choice;
5667 * Significantly faster resolution;
5669 * the different sections in a .thy file can now be mixed and repeated
5672 * Database of theorems for FOL, HOL and ZF. New
5673 commands including qed, qed_goal and bind_thm store theorems in the database.
5675 * Simple database queries: return a named theorem (get_thm) or all theorems of
5676 a given theory (thms_of), or find out what theory a theorem was proved in
5679 * Bugs fixed in the inductive definition and datatype packages;
5681 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5682 and HOL_dup_cs obsolete;
5684 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5687 * Simpler definition of function space in ZF;
5689 * new results about cardinal and ordinal arithmetic in ZF;
5691 * 'subtype' facility in HOL for introducing new types as subsets of existing
5694 :mode=text:wrap=hard:maxLineLen=72: