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 * Interpretation commands no longer attempt to simplify goal.
28 INCOMPATIBILITY: in rare situations the generated goal differs. Use
29 methods intro_locales and unfold_locales to clarify.
31 * Interpretation commands no longer accept interpretation attributes.
34 * Command 'instance': attached definitions no longer accepted.
35 INCOMPATIBILITY, use proper 'instantiation' target.
37 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
40 *** Document preparation ***
42 * Antiquotation @{lemma} now imitates a regular terminal proof,
43 demanding keyword 'by' and supporting the full method expression
44 syntax just like the Isar command 'by'.
49 * HOL/Orderings: class "wellorder" moved here, with explicit induction
50 rule "less_induct" as assumption. For instantiation of "wellorder" by
51 means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY.
53 * HOL/Orderings: added class "preorder" as superclass of "order".
54 INCOMPATIBILITY: Instantiation proofs for order, linorder
55 etc. slightly changed. Some theorems named order_class.* now named
58 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been
59 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
60 dvd has been generalized to class comm_semiring_1. Likewise a bunch
61 of lemmas from Divides has been generalized from nat to class
62 semiring_div. INCOMPATIBILITY. This involves the following theorem
63 renames resulting from duplicate elimination:
65 dvd_def_mod ~> dvd_eq_mod_eq_0
66 zero_dvd_iff ~> dvd_0_left_iff
67 DIVISION_BY_ZERO_DIV ~> div_by_0
68 DIVISION_BY_ZERO_MOD ~> mod_by_0
69 mult_div ~> div_mult_self2_is_id
70 mult_mod ~> mod_mult_self2_is_0
72 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
73 zlcm (for int); carried together from various gcd/lcm developements in
74 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
75 corresponding theorems renamed accordingly. INCOMPATIBILY. To
76 recover tupled syntax, use syntax declarations like:
79 abbreviation gcd where
80 "gcd == (%(a, b). GCD.gcd a b)"
82 GCD.gcd ("gcd '(_, _')")
84 (analogously for lcm, zgcd, zlcm).
86 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
88 * New ML antiquotation @{code}: takes constant as argument, generates
89 corresponding code in background and inserts name of the corresponding
90 resulting ML value/function/datatype constructor binding in place.
91 All occurrences of @{code} with a single ML block are generated
92 simultaneously. Provides a generic and safe interface for
93 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
94 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
95 application. In future you ought refrain from ad-hoc compiling
96 generated SML code on the ML toplevel. Note that (for technical
97 reasons) @{code} cannot refer to constants for which user-defined
98 serializations are set. Refer to the corresponding ML counterpart
99 directly in that cases.
101 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
102 Complex_Main.thy remain as they are.
104 * New image HOL-Plain provides a minimal HOL with the most important
105 tools available (inductive, datatype, primrec, ...). By convention
106 the corresponding theory Plain should be ancestor of every further
107 (library) theory. Some library theories now have ancestor Plain
108 (instead of Main), thus theory Main occasionally has to be imported
111 * Methods "case_tac" and "induct_tac" now refer to the very same rules
112 as the structured Isar versions "cases" and "induct", cf. the
113 corresponding "cases" and "induct" attributes. Mutual induction rules
114 are now presented as a list of individual projections
115 (e.g. foo_bar.inducts for types foo and bar); the old format with
116 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
117 rare situations a different rule is selected --- notably nested tuple
118 elimination instead of former prod.exhaust: use explicit (case_tac t
119 rule: prod.exhaust) here.
121 * Attributes "cases", "induct", "coinduct" support "del" option.
123 * Removed fact "case_split_thm", which duplicates "case_split".
125 * Command 'rep_datatype': instead of theorem names the command now
126 takes a list of terms denoting the constructors of the type to be
127 represented as datatype. The characteristic theorems have to be
128 proven. INCOMPATIBILITY. Also observe that the following theorems
129 have disappeared in favour of existing ones:
131 unit_induct ~> unit.induct
132 prod_induct ~> prod.induct
133 sum_induct ~> sum.induct
134 Suc_Suc_eq ~> nat.inject
135 Suc_not_Zero Zero_not_Suc ~> nat.distinct
137 * Library/Nat_Infinity: added addition, numeral syntax and more
138 instantiations for algebraic structures. Removed some duplicate
139 theorems. Changes in simp rules. INCOMPATIBILITY.
141 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
147 * New locales for orders and lattices where the equivalence relation
148 is not restricted to equality. INCOMPATIBILITY: all order and
149 lattice locales use a record structure with field eq for the
152 * New theory of factorial domains.
154 * Units_l_inv and Units_r_inv are now simprules by default.
155 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
156 and/or r_inv will now also require deletion of these lemmas.
158 * Renamed the following theorems. INCOMPATIBILITY.
161 least_carrier ~> least_closed
162 greatest_carrier ~> greatest_closed
163 greatest_Lower_above ~> greatest_Lower_below
164 one_zero ~> carrier_one_zero
165 one_not_zero ~> carrier_one_not_zero (collision with assumption)
170 * Created new image HOL-NSA, containing theories of nonstandard
171 analysis which were previously part of HOL-Complex. Entry point
172 Hyperreal.thy remains valid, but theories formerly using
173 Complex_Main.thy should now use new entry point Hypercomplex.thy.
178 * Proof of Zorn's Lemma for partial orders.
183 * Name bindings in higher specification mechanisms (notably
184 LocalTheory.define, LocalTheory.note, and derived packages) are now
185 formalized as type Name.binding, replacing old bstring.
186 INCOMPATIBILITY, need to wrap strings via Name.binding function, see
187 also Name.name_of. Packages should pass name bindings given by the
188 user to underlying specification mechanisms; this enables precise
189 tracking of source positions, for example.
191 * Rules and tactics that read instantiations (read_instantiate,
192 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
193 context, which is required for parsing and type-checking. Moreover,
194 the variables are specified as plain indexnames, not string encodings
195 thereof. INCOMPATIBILITY.
197 * Disposed old type and term read functions (Sign.read_def_typ,
198 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
199 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
200 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
201 Syntax.read_term_global etc.; see also OldGoals.read_term as last
202 resort for legacy applications.
204 * Antiquotations: block-structured compilation context indicated by
205 \<lbrace> ... \<rbrace>; additional antiquotation forms:
207 @{let ?pat = term} - term abbreviation (HO matching)
208 @{note name = fact} - fact abbreviation
209 @{thm fact} - singleton fact (with attributes)
210 @{thms fact} - general fact (with attributes)
211 @{lemma prop by method} - singleton goal
212 @{lemma prop by meth1 meth2} - singleton goal
213 @{lemma prop1 ... propN by method} - general goal
214 @{lemma prop1 ... propN by meth1 meth2} - general goal
215 @{lemma (open) ...} - open derivation
220 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
221 the Isabelle process into a JVM/Scala application. See
222 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
223 process wrapper has been discontinued.)
225 * Status messages (with exact source position information) are
226 emitted, if proper markup print mode is enabled. This allows
227 user-interface components to provide detailed feedback on internal
230 * Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts.
234 New in Isabelle2008 (June 2008)
235 -------------------------------
239 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
240 and updated, with formally checked references as hyperlinks.
242 * Theory loader: use_thy (and similar operations) no longer set the
243 implicit ML context, which was occasionally hard to predict and in
244 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
245 provides a proper context already.
247 * Theory loader: old-style ML proof scripts being *attached* to a thy
248 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
249 'use' within a theory file will do the job.
251 * Name space merge now observes canonical order, i.e. the second space
252 is inserted into the first one, while existing entries in the first
253 space take precedence. INCOMPATIBILITY in rare situations, may try to
256 * Syntax: symbol \<chi> is now considered a letter. Potential
257 INCOMPATIBILITY in identifier syntax etc.
259 * Outer syntax: string tokens no longer admit escaped white space,
260 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
261 white space without escapes.
263 * Outer syntax: string tokens may contain arbitrary character codes
264 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
270 * Context-dependent token translations. Default setup reverts locally
271 fixed variables, and adds hilite markup for undeclared frees.
273 * Unused theorems can be found using the new command 'unused_thms'.
274 There are three ways of invoking it:
277 Only finds unused theorems in the current theory.
279 (2) unused_thms thy_1 ... thy_n -
280 Finds unused theorems in the current theory and all of its ancestors,
281 excluding the theories thy_1 ... thy_n and all of their ancestors.
283 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
284 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
285 their ancestors, excluding the theories thy_1 ... thy_n and all of
288 In order to increase the readability of the list produced by
289 unused_thms, theorems that have been created by a particular instance
290 of a theory command such as 'inductive' or 'function' are considered
291 to belong to the same "group", meaning that if at least one theorem in
292 this group is used, the other theorems in the same group are no longer
293 reported as unused. Moreover, if all theorems in the group are
294 unused, only one theorem in the group is displayed.
296 Note that proof objects have to be switched on in order for
297 unused_thms to work properly (i.e. !proofs must be >= 1, which is
298 usually the case when using Proof General with the default settings).
300 * Authentic naming of facts disallows ad-hoc overwriting of previous
301 theorems within the same name space. INCOMPATIBILITY, need to remove
302 duplicate fact bindings, or even accidental fact duplications. Note
303 that tools may maintain dynamically scoped facts systematically, using
304 PureThy.add_thms_dynamic.
306 * Command 'hide' now allows to hide from "fact" name space as well.
308 * Eliminated destructive theorem database, simpset, claset, and
309 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
310 update of theories within ML code.
312 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
313 INCOMPATIBILITY, object-logics depending on former Pure require
314 additional setup PureThy.old_appl_syntax_setup; object-logics
315 depending on former CPure need to refer to Pure.
317 * Commands 'use' and 'ML' are now purely functional, operating on
318 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
319 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
322 * Command 'setup': discontinued implicit version with ML reference.
324 * Instantiation target allows for simultaneous specification of class
325 instance operations together with an instantiation proof.
326 Type-checking phase allows to refer to class operations uniformly.
327 See src/HOL/Complex/Complex.thy for an Isar example and
328 src/HOL/Library/Eval.thy for an ML example.
330 * Indexing of literal facts: be more serious about including only
331 facts from the visible specification/proof context, but not the
332 background context (locale etc.). Affects `prop` notation and method
333 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
336 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
337 "(open)" option, which used to expose internal bound variables to the
340 * Isar statements: removed obsolete case "rule_context".
341 INCOMPATIBILITY, better use explicit fixes/assumes.
343 * Locale proofs: default proof step now includes 'unfold_locales';
344 hence 'proof' without argument may be used to unfold locale
348 *** Document preparation ***
350 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
351 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
352 obsolete thumbpdf setup (contemporary PDF viewers do this on the
353 spot); renamed link color from "darkblue" to "linkcolor" (default
354 value unchanged, can be redefined via \definecolor); no longer sets
355 "a4paper" option (unnecessary or even intrusive).
357 * Antiquotation @{lemma A method} proves proposition A by the given
358 method (either a method name or a method name plus (optional) method
359 arguments in parentheses) and prints A just like @{prop A}.
364 * New primrec package. Specification syntax conforms in style to
365 definition/function/.... No separate induction rule is provided. The
366 "primrec" command distinguishes old-style and new-style specifications
367 by syntax. The former primrec package is now named OldPrimrecPackage.
368 When adjusting theories, beware: constants stemming from new-style
369 primrec specifications have authentic syntax.
371 * Metis prover is now an order of magnitude faster, and also works
374 * Metis: the maximum number of clauses that can be produced from a
375 theorem is now given by the attribute max_clauses. Theorems that
376 exceed this number are ignored, with a warning printed.
378 * Sledgehammer no longer produces structured proofs by default. To
379 enable, declare [[sledgehammer_full = true]]. Attributes
380 reconstruction_modulus, reconstruction_sorts renamed
381 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
383 * Method "induct_scheme" derives user-specified induction rules
384 from well-founded induction and completeness of patterns. This factors
385 out some operations that are done internally by the function package
386 and makes them available separately. See
387 src/HOL/ex/Induction_Scheme.thy for examples.
389 * More flexible generation of measure functions for termination
390 proofs: Measure functions can be declared by proving a rule of the
391 form "is_measure f" and giving it the [measure_function] attribute.
392 The "is_measure" predicate is logically meaningless (always true), and
393 just guides the heuristic. To find suitable measure functions, the
394 termination prover sets up the goal "is_measure ?f" of the appropriate
395 type and generates all solutions by prolog-style backwards proof using
398 This setup also deals with rules like
400 "is_measure f ==> is_measure (list_size f)"
402 which accommodates nested datatypes that recurse through lists.
403 Similar rules are predeclared for products and option types.
405 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
409 - Definitions of overloaded constants on sets have to be replaced by
410 definitions on => and bool.
412 - Some definitions of overloaded operators on sets can now be proved
413 using the definitions of the operators on => and bool. Therefore,
414 the following theorems have been renamed:
416 subset_def -> subset_eq
417 psubset_def -> psubset_eq
418 set_diff_def -> set_diff_eq
419 Compl_def -> Compl_eq
420 Sup_set_def -> Sup_set_eq
421 Inf_set_def -> Inf_set_eq
422 sup_set_def -> sup_set_eq
423 inf_set_def -> inf_set_eq
425 - Due to the incompleteness of the HO unification algorithm, some
426 rules such as subst may require manual instantiation, if some of
427 the unknowns in the rule is a set.
429 - Higher order unification and forward proofs:
432 have "P (S::'a set)" <...>
433 then have "EX S. P S" ..
435 no longer works (due to the incompleteness of the HO unification
436 algorithm) and must be replaced by the pattern
443 - Calculational reasoning with subst (or similar rules):
446 have "P (S::'a set)" <...>
447 also have "S = T" <...>
450 no longer works (for similar reasons as the previous example) and
451 must be replaced by something like
453 have "P (S::'a set)" <...>
454 moreover have "S = T" <...>
455 ultimately have "P T" by simp
457 - Tactics or packages written in ML code:
458 Code performing pattern matching on types via
460 Type ("set", [T]) => ...
462 must be rewritten. Moreover, functions like strip_type or
463 binder_types no longer return the right value when applied to a
466 T1 => ... => Tn => U => bool
470 T1 => ... => Tn => U set
472 * Merged theories Wellfounded_Recursion, Accessible_Part and
473 Wellfounded_Relations to theory Wellfounded.
475 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
477 * Class finite no longer treats UNIV as class parameter. Use class
478 enum from theory Library/Enum instead to achieve a similar effect.
481 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
482 and "Cons". INCOMPATIBILITY.
484 * HOL (and FOL): renamed variables in rules imp_elim and swap.
485 Potential INCOMPATIBILITY.
487 * Theory Product_Type: duplicated lemmas split_Pair_apply and
488 injective_fst_snd removed, use split_eta and prod_eqI instead.
489 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
491 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
492 the same name in theory Orderings:
502 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
503 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
504 and different variable names.
506 * Library/Option_ord.thy: Canonical order on option type.
508 * Library/RBT.thy: Red-black trees, an efficient implementation of
511 * Library/Countable.thy: Type class for countable types.
513 * Theory Int: The representation of numerals has changed. The infix
514 operator BIT and the bit datatype with constructors B0 and B1 have
515 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
516 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
517 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
520 * Theory Nat: definition of <= and < on natural numbers no longer
521 depend on well-founded relations. INCOMPATIBILITY. Definitions
522 le_def and less_def have disappeared. Consider lemmas not_less
523 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
525 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
526 (whose purpose mainly is for various fold_set functionals) have been
527 abandoned in favor of the existing algebraic classes
528 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
529 lower_semilattice (resp. upper_semilattice) and linorder.
532 * Theory Transitive_Closure: induct and cases rules now declare proper
533 case_names ("base" and "step"). INCOMPATIBILITY.
535 * Theorem Inductive.lfp_ordinal_induct generalized to complete
536 lattices. The form set-specific version is available as
537 Inductive.lfp_ordinal_induct_set.
539 * Renamed theorems "power.simps" to "power_int.simps".
542 * Class semiring_div provides basic abstract properties of semirings
543 with division and modulo operations. Subsumes former class dvd_mod.
545 * Merged theories IntDef, Numeral and IntArith into unified theory
546 Int. INCOMPATIBILITY.
548 * Theory Library/Code_Index: type "index" now represents natural
549 numbers rather than integers. INCOMPATIBILITY.
551 * New class "uminus" with operation "uminus" (split of from class
552 "minus" which now only has operation "minus", binary).
555 * Constants "card", "internal_split", "option_map" now with authentic
556 syntax. INCOMPATIBILITY.
558 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
559 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
560 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
561 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
562 Sup_set_def, le_def, less_def, option_map_def now with object
563 equality. INCOMPATIBILITY.
565 * Records. Removed K_record, and replaced it by pure lambda term
566 %x. c. The simplifier setup is now more robust against eta expansion.
567 INCOMPATIBILITY: in cases explicitly referring to K_record.
569 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
571 * Library/ListVector: new theory of arithmetic vector operations.
573 * Library/Order_Relation: new theory of various orderings as sets of
574 pairs. Defines preorders, partial orders, linear orders and
575 well-orders on sets and on types.
580 * Renamed some theories to allow to loading both ZF and HOL in the
583 Datatype -> Datatype_ZF
584 Inductive -> Inductive_ZF
591 INCOMPATIBILITY: ZF theories that import individual theories below
592 Main might need to be adapted. Regular theory Main is still
593 available, as trivial extension of Main_ZF.
598 * ML within Isar: antiquotation @{const name} or @{const
599 name(typargs)} produces statically-checked Const term.
601 * Functor NamedThmsFun: data is available to the user as dynamic fact
602 (of the same name). Removed obsolete print command.
604 * Removed obsolete "use_legacy_bindings" function.
606 * The ``print mode'' is now a thread-local value derived from a global
607 template (the former print_mode reference), thus access becomes
608 non-critical. The global print_mode reference is for session
609 management only; user-code should use print_mode_value,
610 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
612 * Functions system/system_out provide a robust way to invoke external
613 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
614 Do not use OS.Process.system etc. from the basis library!
619 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
620 in accordance with Proof General 3.7, which prefers GNU emacs.
622 * isatool tty runs Isabelle process with plain tty interaction;
623 optional line editor may be specified via ISABELLE_LINE_EDITOR
624 setting, the default settings attempt to locate "ledit" and "rlwrap".
626 * isatool browser now works with Cygwin as well, using general
627 "javapath" function defined in Isabelle process environment.
629 * YXML notation provides a simple and efficient alternative to
630 standard XML transfer syntax. See src/Pure/General/yxml.ML and
631 isatool yxml as described in the Isabelle system manual.
633 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
634 provides general wrapper for managing an Isabelle process in a robust
635 fashion, with ``cooked'' output from stdin/stderr.
637 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
638 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
640 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
641 way of changing the user's settings is via
642 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
645 * Multithreading.max_threads := 0 refers to the number of actual CPU
646 cores of the underlying machine, which is a good starting point for
647 optimal performance tuning. The corresponding usedir option -M allows
648 "max" as an alias for "0". WARNING: does not work on certain versions
649 of Mac OS (with Poly/ML 5.1).
651 * isabelle-process: non-ML sessions are run with "nice", to reduce the
652 adverse effect of Isabelle flooding interactive front-ends (notably
653 ProofGeneral / XEmacs).
657 New in Isabelle2007 (November 2007)
658 -----------------------------------
662 * More uniform information about legacy features, notably a
663 warning/error of "Legacy feature: ...", depending on the state of the
664 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
665 legacy features will disappear eventually.
667 * Theory syntax: the header format ``theory A = B + C:'' has been
668 discontinued in favour of ``theory A imports B C begin''. Use isatool
669 fixheaders to convert existing theory files. INCOMPATIBILITY.
671 * Theory syntax: the old non-Isar theory file format has been
672 discontinued altogether. Note that ML proof scripts may still be used
673 with Isar theories; migration is usually quite simple with the ML
674 function use_legacy_bindings. INCOMPATIBILITY.
676 * Theory syntax: some popular names (e.g. 'class', 'declaration',
677 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
680 * Theory loader: be more serious about observing the static theory
681 header specifications (including optional directories), but not the
682 accidental file locations of previously successful loads. The strict
683 update policy of former update_thy is now already performed by
684 use_thy, so the former has been removed; use_thys updates several
685 theories simultaneously, just as 'imports' within a theory header
686 specification, but without merging the results. Potential
687 INCOMPATIBILITY: may need to refine theory headers and commands
688 ROOT.ML which depend on load order.
690 * Theory loader: optional support for content-based file
691 identification, instead of the traditional scheme of full physical
692 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
693 (cf. the system manual). The new scheme allows to work with
694 non-finished theories in persistent session images, such that source
695 files may be moved later on without requiring reloads.
697 * Theory loader: old-style ML proof scripts being *attached* to a thy
698 file (with the same base name as the theory) are considered a legacy
699 feature, which will disappear eventually. Even now, the theory loader
700 no longer maintains dependencies on such files.
702 * Syntax: the scope for resolving ambiguities via type-inference is
703 now limited to individual terms, instead of whole simultaneous
704 specifications as before. This greatly reduces the complexity of the
705 syntax module and improves flexibility by separating parsing and
706 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
707 'fixes' etc.) are required in rare situations.
709 * Syntax: constants introduced by new-style packages ('definition',
710 'abbreviation' etc.) are passed through the syntax module in
711 ``authentic mode''. This means that associated mixfix annotations
712 really stick to such constants, independently of potential name space
713 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
714 trees are represented slightly differently, may need to adapt syntax
715 translations accordingly. Use CONST marker in 'translations' and
716 @{const_syntax} antiquotation in 'parse_translation' etc.
718 * Legacy goal package: reduced interface to the bare minimum required
719 to keep existing proof scripts running. Most other user-level
720 functions are now part of the OldGoals structure, which is *not* open
721 by default (consider isatool expandshort before open OldGoals).
722 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
723 these tend to cause confusion about the actual goal (!) context being
724 used here, which is not necessarily the same as the_context().
726 * Command 'find_theorems': supports "*" wild-card in "name:"
727 criterion; "with_dups" option. Certain ProofGeneral versions might
728 support a specific search form (see ProofGeneral/CHANGES).
730 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
731 by default, which means that "prems" (and also "fixed variables") are
732 suppressed from proof state output. Note that the ProofGeneral
733 settings mechanism allows to change and save options persistently, but
734 older versions of Isabelle will fail to start up if a negative prems
737 * Local theory targets may be specified by non-nested blocks of
738 ``context/locale/class ... begin'' followed by ``end''. The body may
739 contain definitions, theorems etc., including any derived mechanism
740 that has been implemented on top of these primitives. This concept
741 generalizes the existing ``theorem (in ...)'' towards more versatility
744 * Proof General interface: proper undo of final 'end' command;
745 discontinued Isabelle/classic mode (ML proof scripts).
748 *** Document preparation ***
750 * Added antiquotation @{theory name} which prints the given name,
751 after checking that it refers to a valid ancestor theory in the
754 * Added antiquotations @{ML_type text} and @{ML_struct text} which
755 check the given source text as ML type/structure, printing verbatim.
757 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
758 "c args == rhs" given in the current context. (Any number of
759 arguments may be given on the LHS.)
764 * The 'class' package offers a combination of axclass and locale to
765 achieve Haskell-like type classes in Isabelle. Definitions and
766 theorems within a class context produce both relative results (with
767 implicit parameters according to the locale context), and polymorphic
768 constants with qualified polymorphism (according to the class
769 context). Within the body context of a 'class' target, a separate
770 syntax layer ("user space type system") takes care of converting
771 between global polymorphic consts and internal locale representation.
772 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
773 "isatool doc classes" provides a tutorial.
775 * Generic code generator framework allows to generate executable
776 code for ML and Haskell (including Isabelle classes). A short usage
779 internal compilation:
780 export_code <list of constants (term syntax)> in SML
781 writing SML code to a file:
782 export_code <list of constants (term syntax)> in SML <filename>
783 writing OCaml code to a file:
784 export_code <list of constants (term syntax)> in OCaml <filename>
785 writing Haskell code to a bunch of files:
786 export_code <list of constants (term syntax)> in Haskell <filename>
788 evaluating closed propositions to True/False using code generation:
791 Reasonable default setup of framework in HOL.
793 Theorem attributs for selecting and transforming function equations theorems:
795 [code fun]: select a theorem as function equation for a specific constant
796 [code fun del]: deselect a theorem as function equation for a specific constant
797 [code inline]: select an equation theorem for unfolding (inlining) in place
798 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
800 User-defined serializations (target in {SML, OCaml, Haskell}):
802 code_const <and-list of constants (term syntax)>
803 {(target) <and-list of const target syntax>}+
805 code_type <and-list of type constructors>
806 {(target) <and-list of type target syntax>}+
808 code_instance <and-list of instances>
810 where instance ::= <type constructor> :: <class>
812 code_class <and_list of classes>
813 {(target) <and-list of class target syntax>}+
814 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
816 code_instance and code_class only are effective to target Haskell.
818 For example usage see src/HOL/ex/Codegenerator.thy and
819 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
820 generation from Isabelle/HOL theories is available via "isatool doc
823 * Code generator: consts in 'consts_code' Isar commands are now
824 referred to by usual term syntax (including optional type
827 * Command 'no_translations' removes translation rules from theory
830 * Overloaded definitions are now actually checked for acyclic
831 dependencies. The overloading scheme is slightly more general than
832 that of Haskell98, although Isabelle does not demand an exact
833 correspondence to type class and instance declarations.
834 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
835 exotic versions of overloading -- at the discretion of the user!
837 Polymorphic constants are represented via type arguments, i.e. the
838 instantiation that matches an instance against the most general
839 declaration given in the signature. For example, with the declaration
840 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
841 as c(nat). Overloading is essentially simultaneous structural
842 recursion over such type arguments. Incomplete specification patterns
843 impose global constraints on all occurrences, e.g. c('a * 'a) on the
844 LHS means that more general c('a * 'b) will be disallowed on any RHS.
845 Command 'print_theory' outputs the normalized system of recursive
846 equations, see section "definitions".
848 * Configuration options are maintained within the theory or proof
849 context (with name and type bool/int/string), providing a very simple
850 interface to a poor-man's version of general context data. Tools may
851 declare options in ML (e.g. using Attrib.config_int) and then refer to
852 these values using Config.get etc. Users may change options via an
853 associated attribute of the same name. This form of context
854 declaration works particularly well with commands 'declare' or
855 'using', for example ``declare [[foo = 42]]''. Thus it has become
856 very easy to avoid global references, which would not observe Isar
857 toplevel undo/redo and fail to work with multithreading.
859 Various global ML references of Pure and HOL have been turned into
860 configuration options:
862 Unify.search_bound unify_search_bound
863 Unify.trace_bound unify_trace_bound
864 Unify.trace_simp unify_trace_simp
865 Unify.trace_types unify_trace_types
866 Simplifier.simp_depth_limit simp_depth_limit
867 Blast.depth_limit blast_depth_limit
868 DatatypeProp.dtK datatype_distinctness_limit
869 fast_arith_neq_limit fast_arith_neq_limit
870 fast_arith_split_limit fast_arith_split_limit
872 * Named collections of theorems may be easily installed as context
873 data using the functor NamedThmsFun (see also
874 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
875 attributes; there is also a toplevel print command. This facility is
876 just a common case of general context data, which is the preferred way
877 for anything more complex than just a list of facts in canonical
880 * Isar: command 'declaration' augments a local theory by generic
881 declaration functions written in ML. This enables arbitrary content
882 being added to the context, depending on a morphism that tells the
883 difference of the original declaration context wrt. the application
884 context encountered later on.
886 * Isar: proper interfaces for simplification procedures. Command
887 'simproc_setup' declares named simprocs (with match patterns, and body
888 text in ML). Attribute "simproc" adds/deletes simprocs in the current
889 context. ML antiquotation @{simproc name} retrieves named simprocs.
891 * Isar: an extra pair of brackets around attribute declarations
892 abbreviates a theorem reference involving an internal dummy fact,
893 which will be ignored later --- only the effect of the attribute on
894 the background context will persist. This form of in-place
895 declarations is particularly useful with commands like 'declare' and
896 'using', for example ``have A using [[simproc a]] by simp''.
898 * Isar: method "assumption" (and implicit closing of subproofs) now
899 takes simple non-atomic goal assumptions into account: after applying
900 an assumption as a rule the resulting subgoals are solved by atomic
901 assumption steps. This is particularly useful to finish 'obtain'
902 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
903 without referring to the original premise "!!x. P x ==> thesis" in the
904 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
907 * Isar: implicit use of prems from the Isar proof context is
908 considered a legacy feature. Common applications like ``have A .''
909 may be replaced by ``have A by fact'' or ``note `A`''. In general,
910 referencing facts explicitly here improves readability and
911 maintainability of proof texts.
913 * Isar: improper proof element 'guess' is like 'obtain', but derives
914 the obtained context from the course of reasoning! For example:
916 assume "EX x y. A x & B y" -- "any previous fact"
917 then guess x and y by clarify
919 This technique is potentially adventurous, depending on the facts and
920 proof tools being involved here.
922 * Isar: known facts from the proof context may be specified as literal
923 propositions, using ASCII back-quote syntax. This works wherever
924 named facts used to be allowed so far, in proof commands, proof
925 methods, attributes etc. Literal facts are retrieved from the context
926 according to unification of type and term parameters. For example,
927 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
928 theorems in the current context, then these are valid literal facts:
929 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
931 There is also a proof method "fact" which does the same composition
932 for explicit goal states, e.g. the following proof texts coincide with
933 certain special cases of literal facts:
935 have "A" by fact == note `A`
936 have "A ==> B" by fact == note `A ==> B`
937 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
938 have "P a ==> Q a" by fact == note `P a ==> Q a`
940 * Isar: ":" (colon) is no longer a symbolic identifier character in
941 outer syntax. Thus symbolic identifiers may be used without
942 additional white space in declarations like this: ``assume *: A''.
944 * Isar: 'print_facts' prints all local facts of the current context,
945 both named and unnamed ones.
947 * Isar: 'def' now admits simultaneous definitions, e.g.:
949 def x == "t" and y == "u"
951 * Isar: added command 'unfolding', which is structurally similar to
952 'using', but affects both the goal state and facts by unfolding given
953 rewrite rules. Thus many occurrences of the 'unfold' method or
954 'unfolded' attribute may be replaced by first-class proof text.
956 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
957 and command 'unfolding' now all support object-level equalities
958 (potentially conditional). The underlying notion of rewrite rule is
959 analogous to the 'rule_format' attribute, but *not* that of the
960 Simplifier (which is usually more generous).
962 * Isar: the new attribute [rotated n] (default n = 1) rotates the
963 premises of a theorem by n. Useful in conjunction with drule.
965 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
966 method expression within a sandbox consisting of the first N
967 sub-goals, which need to exist. For example, ``simp_all [3]''
968 simplifies the first three sub-goals, while (rule foo, simp_all)[]
969 simplifies all new goals that emerge from applying rule foo to the
970 originally first one.
972 * Isar: schematic goals are no longer restricted to higher-order
973 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
976 * Isar: the conclusion of a long theorem statement is now either
977 'shows' (a simultaneous conjunction, as before), or 'obtains'
978 (essentially a disjunction of cases with local parameters and
979 assumptions). The latter allows to express general elimination rules
980 adequately; in this notation common elimination rules look like this:
982 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
984 obtains x where "P x"
986 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
990 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
996 The subsequent classical rules even refer to the formal "thesis"
999 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
1002 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
1003 obtains "thesis ==> something"
1005 The actual proof of an 'obtains' statement is analogous to that of the
1006 Isar proof element 'obtain', only that there may be several cases.
1007 Optional case names may be specified in parentheses; these will be
1008 available both in the present proof and as annotations in the
1009 resulting rule, for later use with the 'cases' method (cf. attribute
1012 * Isar: the assumptions of a long theorem statement are available as
1013 "assms" fact in the proof context. This is more appropriate than the
1014 (historical) "prems", which refers to all assumptions of the current
1015 context, including those from the target locale, proof body etc.
1017 * Isar: 'print_statement' prints theorems from the current theory or
1018 proof context in long statement form, according to the syntax of a
1021 * Isar: 'obtain' takes an optional case name for the local context
1022 introduction rule (default "that").
1024 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1025 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1028 * Pure: syntax "CONST name" produces a fully internalized constant
1029 according to the current context. This is particularly useful for
1030 syntax translations that should refer to internal constant
1031 representations independently of name spaces.
1033 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1034 instead of "FOO ". This allows multiple binder declarations to coexist
1035 in the same context. INCOMPATIBILITY.
1037 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1038 primitive that also works in a locale context (both for constants and
1039 fixed variables). Type declaration and internal syntactic representation
1040 of given constants retrieved from the context. Likewise, the
1041 'no_notation' command allows to remove given syntax annotations from the
1044 * Isar/locales: new derived specification elements 'axiomatization',
1045 'definition', 'abbreviation', which support type-inference, admit
1046 object-level specifications (equality, equivalence). See also the
1047 isar-ref manual. Examples:
1050 eq (infix "===" 50) where
1051 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1053 definition "f x y = x + y + 1"
1054 definition g where "g x = f x x"
1057 neq (infix "=!=" 50) where
1058 "x =!= y == ~ (x === y)"
1060 These specifications may be also used in a locale context. Then the
1061 constants being introduced depend on certain fixed parameters, and the
1062 constant name is qualified by the locale base name. An internal
1063 abbreviation takes care for convenient input and output, making the
1064 parameters implicit and using the original short name. See also
1065 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1066 entities from a monomorphic theory.
1068 Presently, abbreviations are only available 'in' a target locale, but
1069 not inherited by general import expressions. Also note that
1070 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1071 'translations' in common applications. The "no_abbrevs" print mode
1072 prevents folding of abbreviations in term output.
1074 Concrete syntax is attached to specified constants in internal form,
1075 independently of name spaces. The parse tree representation is
1076 slightly different -- use 'notation' instead of raw 'syntax', and
1077 'translations' with explicit "CONST" markup to accommodate this.
1079 * Pure/Isar: unified syntax for new-style specification mechanisms
1080 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1081 full type inference and dummy patterns ("_"). For example:
1083 definition "K x _ = x"
1085 inductive conj for A B
1086 where "A ==> B ==> conj A B"
1088 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1089 the current context. Print mode "no_abbrevs" prevents inversion of
1090 abbreviations on output.
1092 * Isar/locales: improved parameter handling: use of locales "var" and
1093 "struct" no longer necessary; - parameter renamings are no longer
1094 required to be injective. For example, this allows to define
1095 endomorphisms as locale endom = homom mult mult h.
1097 * Isar/locales: changed the way locales with predicates are defined.
1098 Instead of accumulating the specification, the imported expression is
1099 now an interpretation. INCOMPATIBILITY: different normal form of
1100 locale expressions. In particular, in interpretations of locales with
1101 predicates, goals repesenting already interpreted fragments are not
1102 removed automatically. Use methods `intro_locales' and
1103 `unfold_locales'; see below.
1105 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1106 provide backward reasoning on locales predicates. The methods are
1107 aware of interpretations and discharge corresponding goals.
1108 `intro_locales' is less aggressive then `unfold_locales' and does not
1109 unfold predicates to assumptions.
1111 * Isar/locales: the order in which locale fragments are accumulated
1112 has changed. This enables to override declarations from fragments due
1113 to interpretations -- for example, unwanted simp rules.
1115 * Isar/locales: interpretation in theories and proof contexts has been
1116 extended. One may now specify (and prove) equations, which are
1117 unfolded in interpreted theorems. This is useful for replacing
1118 defined concepts (constants depending on locale parameters) by
1119 concepts already existing in the target context. Example:
1121 interpretation partial_order ["op <= :: [int, int] => bool"]
1122 where "partial_order.less (op <=) (x::int) y = (x < y)"
1124 Typically, the constant `partial_order.less' is created by a
1125 definition specification element in the context of locale
1128 * Method "induct": improved internal context management to support
1129 local fixes and defines on-the-fly. Thus explicit meta-level
1130 connectives !! and ==> are rarely required anymore in inductive goals
1131 (using object-logic connectives for this purpose has been long
1132 obsolete anyway). Common proof patterns are explained in
1133 src/HOL/Induct/Common_Patterns.thy, see also
1134 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1137 * Method "induct": improved handling of simultaneous goals. Instead of
1138 introducing object-level conjunction, the statement is now split into
1139 several conclusions, while the corresponding symbolic cases are nested
1140 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1141 see src/HOL/Induct/Common_Patterns.thy, for example.
1143 * Method "induct": mutual induction rules are now specified as a list
1144 of rule sharing the same induction cases. HOL packages usually provide
1145 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1146 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1147 mutual induction rules differently, i.e. like this:
1149 (induct rule: foo_bar.inducts)
1150 (induct set: foo bar)
1151 (induct pred: foo bar)
1152 (induct type: foo bar)
1154 The ML function ProjectRule.projections turns old-style rules into the
1157 * Method "coinduct": dual of induction, see
1158 src/HOL/Library/Coinductive_List.thy for various examples.
1160 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1161 considered a legacy feature.
1163 * Attribute "symmetric" produces result with standardized schematic
1164 variables (index 0). Potential INCOMPATIBILITY.
1166 * Simplifier: by default the simplifier trace only shows top level
1167 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1168 default. Thus there is less danger of being flooded by the trace. The
1169 trace indicates where parts have been suppressed.
1171 * Provers/classical: removed obsolete classical version of elim_format
1172 attribute; classical elim/dest rules are now treated uniformly when
1173 manipulating the claset.
1175 * Provers/classical: stricter checks to ensure that supplied intro,
1176 dest and elim rules are well-formed; dest and elim rules must have at
1179 * Provers/classical: attributes dest/elim/intro take an optional
1180 weight argument for the rule (just as the Pure versions). Weights are
1181 ignored by automated tools, but determine the search order of single
1184 * Syntax: input syntax now supports dummy variable binding "%_. b",
1185 where the body does not mention the bound variable. Note that dummy
1186 patterns implicitly depend on their context of bounds, which makes
1187 "{_. _}" match any set comprehension as expected. Potential
1188 INCOMPATIBILITY -- parse translations need to cope with syntactic
1189 constant "_idtdummy" in the binding position.
1191 * Syntax: removed obsolete syntactic constant "_K" and its associated
1192 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1193 for example "A -> B" => "Pi A (%_. B)".
1195 * Pure: 'class_deps' command visualizes the subclass relation, using
1196 the graph browser tool.
1198 * Pure: 'print_theory' now suppresses certain internal declarations by
1199 default; use '!' option for full details.
1204 * Method "metis" proves goals by applying the Metis general-purpose
1205 resolution prover (see also http://gilith.com/software/metis/).
1206 Examples are in the directory MetisExamples. WARNING: the
1207 Isabelle/HOL-Metis integration does not yet work properly with
1210 * Command 'sledgehammer' invokes external automatic theorem provers as
1211 background processes. It generates calls to the "metis" method if
1212 successful. These can be pasted into the proof. Users do not have to
1213 wait for the automatic provers to return. WARNING: does not really
1214 work with multi-threading.
1216 * New "auto_quickcheck" feature tests outermost goal statements for
1217 potential counter-examples. Controlled by ML references
1218 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1219 5000 milliseconds). Fails silently if statements is outside of
1220 executable fragment, or any other codgenerator problem occurs.
1222 * New constant "undefined" with axiom "undefined x = undefined".
1224 * Added class "HOL.eq", allowing for code generation with polymorphic
1227 * Some renaming of class constants due to canonical name prefixing in
1228 the new 'class' package:
1230 HOL.abs ~> HOL.abs_class.abs
1231 HOL.divide ~> HOL.divide_class.divide
1232 0 ~> HOL.zero_class.zero
1233 1 ~> HOL.one_class.one
1234 op + ~> HOL.plus_class.plus
1235 op - ~> HOL.minus_class.minus
1236 uminus ~> HOL.minus_class.uminus
1237 op * ~> HOL.times_class.times
1238 op < ~> HOL.ord_class.less
1239 op <= > HOL.ord_class.less_eq
1240 Nat.power ~> Power.power_class.power
1241 Nat.size ~> Nat.size_class.size
1242 Numeral.number_of ~> Numeral.number_class.number_of
1243 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1244 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1245 Orderings.min ~> Orderings.ord_class.min
1246 Orderings.max ~> Orderings.ord_class.max
1247 Divides.op div ~> Divides.div_class.div
1248 Divides.op mod ~> Divides.div_class.mod
1249 Divides.op dvd ~> Divides.div_class.dvd
1251 INCOMPATIBILITY. Adaptions may be required in the following cases:
1253 a) User-defined constants using any of the names "plus", "minus",
1254 "times", "less" or "less_eq". The standard syntax translations for
1255 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1258 b) Variables named "plus", "minus", "times", "less", "less_eq"
1259 INCOMPATIBILITY: use more specific names.
1261 c) Permutative equations (e.g. "a + b = b + a")
1262 Since the change of names also changes the order of terms, permutative
1263 rewrite rules may get applied in a different order. Experience shows
1264 that this is rarely the case (only two adaptions in the whole Isabelle
1265 distribution). INCOMPATIBILITY: rewrite proofs
1267 d) ML code directly refering to constant names
1268 This in general only affects hand-written proof tactics, simprocs and
1269 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1270 Consider using @{const_name} antiquotation.
1272 * New class "default" with associated constant "default".
1274 * Function "sgn" is now overloaded and available on int, real, complex
1275 (and other numeric types), using class "sgn". Two possible defs of
1276 sgn are given as equational assumptions in the classes sgn_if and
1277 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1280 * Locale "partial_order" now unified with class "order" (cf. theory
1281 Orderings), added parameter "less". INCOMPATIBILITY.
1283 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1284 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1285 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1287 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1288 changed order of proof goals in instance proofs.
1290 * The transitivity reasoner for partial and linear orders is set up
1291 for classes "order" and "linorder". Instances of the reasoner are available
1292 in all contexts importing or interpreting the corresponding locales.
1293 Method "order" invokes the reasoner separately; the reasoner
1294 is also integrated with the Simplifier as a solver. Diagnostic
1295 command 'print_orders' shows the available instances of the reasoner
1296 in the current context.
1298 * Localized monotonicity predicate in theory "Orderings"; integrated
1299 lemmas max_of_mono and min_of_mono with this predicate.
1302 * Formulation of theorem "dense" changed slightly due to integration
1303 with new class dense_linear_order.
1305 * Uniform lattice theory development in HOL.
1307 constants "meet" and "join" now named "inf" and "sup"
1308 constant "Meet" now named "Inf"
1310 classes "meet_semilorder" and "join_semilorder" now named
1311 "lower_semilattice" and "upper_semilattice"
1312 class "lorder" now named "lattice"
1313 class "comp_lat" now named "complete_lattice"
1315 Instantiation of lattice classes allows explicit definitions
1316 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1318 INCOMPATIBILITY. Theorem renames:
1320 meet_left_le ~> inf_le1
1321 meet_right_le ~> inf_le2
1322 join_left_le ~> sup_ge1
1323 join_right_le ~> sup_ge2
1324 meet_join_le ~> inf_sup_ord
1327 le_meet ~> le_inf_iff
1328 le_join ~> ge_sup_conv
1329 meet_idempotent ~> inf_idem
1330 join_idempotent ~> sup_idem
1331 meet_comm ~> inf_commute
1332 join_comm ~> sup_commute
1333 meet_leI1 ~> le_infI1
1334 meet_leI2 ~> le_infI2
1335 le_joinI1 ~> le_supI1
1336 le_joinI2 ~> le_supI2
1337 meet_assoc ~> inf_assoc
1338 join_assoc ~> sup_assoc
1339 meet_left_comm ~> inf_left_commute
1340 meet_left_idempotent ~> inf_left_idem
1341 join_left_comm ~> sup_left_commute
1342 join_left_idempotent ~> sup_left_idem
1345 le_def_meet ~> le_iff_inf
1346 le_def_join ~> le_iff_sup
1347 join_absorp2 ~> sup_absorb2
1348 join_absorp1 ~> sup_absorb1
1349 meet_absorp1 ~> inf_absorb1
1350 meet_absorp2 ~> inf_absorb2
1351 meet_join_absorp ~> inf_sup_absorb
1352 join_meet_absorp ~> sup_inf_absorb
1353 distrib_join_le ~> distrib_sup_le
1354 distrib_meet_le ~> distrib_inf_le
1356 add_meet_distrib_left ~> add_inf_distrib_left
1357 add_join_distrib_left ~> add_sup_distrib_left
1358 is_join_neg_meet ~> is_join_neg_inf
1359 is_meet_neg_join ~> is_meet_neg_sup
1360 add_meet_distrib_right ~> add_inf_distrib_right
1361 add_join_distrib_right ~> add_sup_distrib_right
1362 add_meet_join_distribs ~> add_sup_inf_distribs
1363 join_eq_neg_meet ~> sup_eq_neg_inf
1364 meet_eq_neg_join ~> inf_eq_neg_sup
1365 add_eq_meet_join ~> add_eq_inf_sup
1366 meet_0_imp_0 ~> inf_0_imp_0
1367 join_0_imp_0 ~> sup_0_imp_0
1368 meet_0_eq_0 ~> inf_0_eq_0
1369 join_0_eq_0 ~> sup_0_eq_0
1370 neg_meet_eq_join ~> neg_inf_eq_sup
1371 neg_join_eq_meet ~> neg_sup_eq_inf
1372 join_eq_if ~> sup_eq_if
1374 mono_meet ~> mono_inf
1375 mono_join ~> mono_sup
1376 meet_bool_eq ~> inf_bool_eq
1377 join_bool_eq ~> sup_bool_eq
1378 meet_fun_eq ~> inf_fun_eq
1379 join_fun_eq ~> sup_fun_eq
1380 meet_set_eq ~> inf_set_eq
1381 join_set_eq ~> sup_set_eq
1382 meet1_iff ~> inf1_iff
1383 meet2_iff ~> inf2_iff
1392 join1_iff ~> sup1_iff
1393 join2_iff ~> sup2_iff
1403 is_meet_Meet ~> is_meet_Inf
1404 Meet_bool_def ~> Inf_bool_def
1405 Meet_fun_def ~> Inf_fun_def
1406 Meet_greatest ~> Inf_greatest
1407 Meet_lower ~> Inf_lower
1408 Meet_set_def ~> Inf_set_def
1411 Sup_bool_eq ~> Sup_bool_def
1412 Sup_fun_eq ~> Sup_fun_def
1413 Sup_set_eq ~> Sup_set_def
1415 listsp_meetI ~> listsp_infI
1416 listsp_meet_eq ~> listsp_inf_eq
1421 * Added syntactic class "size"; overloaded constant "size" now has
1422 type "'a::size ==> bool"
1424 * Internal reorganisation of `size' of datatypes: size theorems
1425 "foo.size" are no longer subsumed by "foo.simps" (but are still
1426 simplification rules by default!); theorems "prod.size" now named
1429 * Class "div" now inherits from class "times" rather than "type".
1432 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1433 Linorder etc. have disappeared; operations defined in terms of
1434 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1436 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1438 * HOL-Word: New extensive library and type for generic, fixed size
1439 machine words, with arithemtic, bit-wise, shifting and rotating
1440 operations, reflection into int, nat, and bool lists, automation for
1441 linear arithmetic (by automatic reflection into nat or int), including
1442 lemmas on overflow and monotonicity. Instantiated to all appropriate
1443 arithmetic type classes, supporting automatic simplification of
1444 numerals on all operations.
1446 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1448 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1450 * Code generator library theories:
1451 - Code_Integer represents HOL integers by big integer literals in target
1453 - Code_Char represents HOL characters by character literals in target
1455 - Code_Char_chr like Code_Char, but also offers treatment of character
1456 codes; includes Code_Integer.
1457 - Executable_Set allows to generate code for finite sets using lists.
1458 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1460 - Executable_Real implements a subset of real numbers, namly those
1461 representable by rational numbers.
1462 - Efficient_Nat implements natural numbers by integers, which in general will
1463 result in higher efficency; pattern matching with 0/Suc is eliminated;
1464 includes Code_Integer.
1465 - Code_Index provides an additional datatype index which is mapped to
1466 target-language built-in integers.
1467 - Code_Message provides an additional datatype message_string which is isomorphic to
1468 strings; messages are mapped to target-language strings.
1470 * New package for inductive predicates
1472 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1475 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1476 for z_1 :: U_1 and ... and z_n :: U_m
1478 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1481 with full support for type-inference, rather than
1483 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1485 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1486 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1488 inductive "s z_1 ... z_m"
1490 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1493 For backward compatibility, there is a wrapper allowing inductive
1494 sets to be defined with the new package via
1497 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1498 for z_1 :: U_1 and ... and z_n :: U_m
1500 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1506 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1507 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1508 for z_1 :: U_1 and ... and z_n :: U_m
1510 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1511 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1514 if the additional syntax "p ..." is required.
1516 Numerous examples can be found in the subdirectories src/HOL/Auth,
1517 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1521 - Since declaration and definition of inductive sets or predicates
1522 is no longer separated, abbreviations involving the newly
1523 introduced sets or predicates must be specified together with the
1524 introduction rules after the 'where' keyword (see above), rather
1525 than before the actual inductive definition.
1527 - The variables in induction and elimination rules are now
1528 quantified in the order of their occurrence in the introduction
1529 rules, rather than in alphabetical order. Since this may break
1530 some proofs, these proofs either have to be repaired, e.g. by
1531 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1532 statements of the form
1534 case (rule_i a_i_1 ... a_i_{k_i})
1536 or the old order of quantification has to be restored by explicitly adding
1537 meta-level quantifiers in the introduction rules, i.e.
1539 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1541 - The format of the elimination rules is now
1543 p z_1 ... z_m x_1 ... x_n ==>
1544 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1549 (x_1, ..., x_n) : s z_1 ... z_m ==>
1550 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1553 for sets rather than
1555 x : s z_1 ... z_m ==>
1556 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1559 This may require terms in goals to be expanded to n-tuples
1560 (e.g. using case_tac or simplification with the split_paired_all
1561 rule) before the above elimination rule is applicable.
1563 - The elimination or case analysis rules for (mutually) inductive
1564 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1565 list of rules "p_1_..._p_k.elims" is no longer available.
1567 * New package "function"/"fun" for general recursive functions,
1568 supporting mutual and nested recursion, definitions in local contexts,
1569 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1570 for small examples, and the separate tutorial on the function
1571 package. The old recdef "package" is still available as before, but
1572 users are encouraged to use the new package.
1574 * Method "lexicographic_order" automatically synthesizes termination
1575 relations as lexicographic combinations of size measures.
1577 * Case-expressions allow arbitrary constructor-patterns (including
1578 "_") and take their order into account, like in functional
1579 programming. Internally, this is translated into nested
1580 case-expressions; missing cases are added and mapped to the predefined
1581 constant "undefined". In complicated cases printing may no longer show
1582 the original input but the internal form. Lambda-abstractions allow
1583 the same form of pattern matching: "% pat1 => e1 | ..." is an
1584 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1587 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1588 is an abbreviation for "of_nat :: nat => int". The simplification
1589 rules for "of_nat" have been changed to work like "int" did
1590 previously. Potential INCOMPATIBILITY:
1591 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1592 - of_nat_diff and of_nat_mult are no longer default simp rules
1594 * Method "algebra" solves polynomial equations over (semi)rings using
1595 Groebner bases. The (semi)ring structure is defined by locales and the
1596 tool setup depends on that generic context. Installing the method for
1597 a specific type involves instantiating the locale and possibly adding
1598 declarations for computation on the coefficients. The method is
1599 already instantiated for natural numbers and for the axiomatic class
1600 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1601 CALCULEMUS 2007 for the general principles underlying this
1602 architecture of context-aware proof-tools.
1604 * Method "ferrack" implements quantifier elimination over
1605 special-purpose dense linear orders using locales (analogous to
1606 "algebra"). The method is already installed for class
1607 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1610 * Former constant "List.op @" now named "List.append". Use ML
1611 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1612 circumvent possible incompatibilities when working on ML level.
1614 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1616 * New function listsum :: 'a list => 'a for arbitrary monoids.
1617 Special syntax: "SUM x <- xs. f x" (and latex variants)
1619 * New syntax for Haskell-like list comprehension (input only), eg.
1620 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1622 * The special syntax for function "filter" has changed from [x :
1623 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1624 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1626 * [a..b] is now defined for arbitrary linear orders. It used to be
1627 defined on nat only, as an abbreviation for [a..<Suc b]
1630 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1632 * New functions "sorted" and "sort" in src/HOL/List.thy.
1634 * New lemma collection field_simps (an extension of ring_simps) for
1635 manipulating (in)equations involving division. Multiplies with all
1636 denominators that can be proved to be non-zero (in equations) or
1637 positive/negative (in inequations).
1639 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1640 have been improved and renamed to ring_simps, group_simps and
1641 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1642 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1644 * Theory Library/Commutative_Ring: switched from recdef to function
1645 package; constants add, mul, pow now curried. Infix syntax for
1646 algebraic operations.
1648 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1651 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1654 * HOL/records: generalised field-update to take a function on the
1655 field rather than the new value: r(|A := x|) is translated to A_update
1656 (K x) r The K-combinator that is internally used is called K_record.
1657 INCOMPATIBILITY: Usage of the plain update functions has to be
1660 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1661 * x = 0, which are required for a semiring. Richer structures do not
1662 inherit from semiring_0 anymore, because this property is a theorem
1663 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1664 there is more to prove, but this is mostly trivial.
1666 * Class "recpower" is generalized to arbitrary monoids, not just
1667 commutative semirings. INCOMPATIBILITY: may need to incorporate
1668 commutativity or semiring properties additionally.
1670 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1671 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1672 better use 'abbreviation'.
1674 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1676 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1677 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1678 significant changes for setting up numeral syntax for types:
1679 - New constants Numeral.pred and Numeral.succ instead
1680 of former Numeral.bin_pred and Numeral.bin_succ.
1681 - Use integer operations instead of bin_add, bin_mult and so on.
1682 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1683 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1685 See src/HOL/Integ/IntArith.thy for an example setup.
1687 * Command 'normal_form' computes the normal form of a term that may
1688 contain free variables. For example ``normal_form "rev [a, b, c]"''
1689 produces ``[b, c, a]'' (without proof). This command is suitable for
1690 heavy-duty computations because the functions are compiled to ML
1691 first. Correspondingly, a method "normalization" is provided. See
1692 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1694 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1695 25 like -->); output depends on the "iff" print_mode, the default is
1696 "A = B" (with priority 50).
1698 * Relations less (<) and less_eq (<=) are also available on type bool.
1699 Modified syntax to disallow nesting without explicit parentheses,
1700 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1703 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1705 * Relation composition operator "op O" now has precedence 75 and binds
1706 stronger than union and intersection. INCOMPATIBILITY.
1708 * The old set interval syntax "{m..n(}" (and relatives) has been
1709 removed. Use "{m..<n}" (and relatives) instead.
1711 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1712 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1713 ``declare [[simproc del: neq]]''.
1715 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1718 * Theorem Cons_eq_map_conv no longer declared as "simp".
1720 * Theorem setsum_mult renamed to setsum_right_distrib.
1722 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1725 * Reimplemented methods "sat" and "satx", with several improvements:
1726 goals no longer need to be stated as "<prems> ==> False", equivalences
1727 (i.e. "=" on type bool) are handled, variable names of the form
1728 "lit_<n>" are no longer reserved, significant speedup.
1730 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1731 zChaff is still supported as well.
1733 * 'inductive' and 'datatype': provide projections of mutual rules,
1734 bundled as foo_bar.inducts;
1736 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1739 * Library: moved theory Accessible_Part to main HOL.
1741 * Library: added theory Coinductive_List of potentially infinite lists
1742 as greatest fixed-point.
1744 * Library: added theory AssocList which implements (finite) maps as
1747 * Method "evaluation" solves goals (i.e. a boolean expression)
1748 efficiently by compiling it to ML. The goal is "proved" (via an
1749 oracle) if it evaluates to True.
1751 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1752 also when invoked by the simplifier. This results in the Simplifier
1753 being more powerful on arithmetic goals. INCOMPATIBILITY.
1754 Configuration option fast_arith_split_limit=0 recovers the old
1757 * Support for hex (0x20) and binary (0b1001) numerals.
1759 * New method: reify eqs (t), where eqs are equations for an
1760 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1761 parameter, computes a term s::'b and a list xs::'a list and proves the
1762 theorem I xs s = t. This is also known as reification or quoting. The
1763 resulting theorem is applied to the subgoal to substitute t with I xs
1764 s. If t is omitted, the subgoal itself is reified.
1766 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1767 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1768 where f is supposed to be a computable function (in the sense of code
1769 generattion). The method uses reify to compute s and xs as above then
1770 applies corr_thm and uses normalization by evaluation to "prove" f s =
1771 r and finally gets the theorem t = r, which is again applied to the
1772 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1774 * Reflection: Automatic reification now handels binding, an example is
1775 available in src/HOL/ex/ReflectionEx.thy
1777 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1778 command 'statespace' that is similar to 'record', but introduces an
1779 abstract specification based on the locale infrastructure instead of
1780 HOL types. This leads to extra flexibility in composing state spaces,
1781 in particular multiple inheritance and renaming of components.
1786 * Hyperreal: Functions root and sqrt are now defined on negative real
1787 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1788 Nonnegativity side conditions have been removed from many lemmas, so
1789 that more subgoals may now be solved by simplification; potential
1792 * Real: new type classes formalize real normed vector spaces and
1793 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1794 and norm :: 'a => real.
1796 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1797 reals into other types. The overloaded constant Reals :: 'a set is now
1798 defined as range of_real; potential INCOMPATIBILITY.
1800 * Real: proper support for ML code generation, including 'quickcheck'.
1801 Reals are implemented as arbitrary precision rationals.
1803 * Hyperreal: Several constants that previously worked only for the
1804 reals have been generalized, so they now work over arbitrary vector
1805 spaces. Type annotations may need to be added in some cases; potential
1808 Infinitesimal :: ('a::real_normed_vector) star set
1809 HFinite :: ('a::real_normed_vector) star set
1810 HInfinite :: ('a::real_normed_vector) star set
1811 approx :: ('a::real_normed_vector) star => 'a star => bool
1812 monad :: ('a::real_normed_vector) star => 'a star set
1813 galaxy :: ('a::real_normed_vector) star => 'a star set
1814 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1815 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1816 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1817 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1818 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
1819 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
1820 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
1821 sgn :: 'a::real_normed_vector => 'a
1822 exp :: 'a::{recpower,real_normed_field,banach} => 'a
1824 * Complex: Some complex-specific constants are now abbreviations for
1825 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
1826 hnorm. Other constants have been entirely removed in favor of the
1827 polymorphic versions (INCOMPATIBILITY):
1831 HInfinite <-- CInfinite
1832 Infinitesimal <-- CInfinitesimal
1835 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
1836 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
1837 (ns)deriv <-- (ns)cderiv
1842 * Formalisation of ideals and the quotient construction over rings.
1844 * Order and lattice theory no longer based on records.
1847 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
1848 greatest_closed. INCOMPATIBILITY.
1850 * Method algebra is now set up via an attribute. For examples see
1851 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
1852 of algebraic structures.
1854 * Renamed theory CRing to Ring.
1859 * Substantial, yet incomplete support for nominal datatypes (binding
1860 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
1861 src/HOL/Nominal/Examples. Prospective users should consult
1862 http://isabelle.in.tum.de/nominal/
1867 * ML basics: just one true type int, which coincides with IntInf.int
1870 * ML within Isar: antiquotations allow to embed statically-checked
1871 formal entities in the source, referring to the context available at
1872 compile-time. For example:
1874 ML {* @{sort "{zero,one}"} *}
1875 ML {* @{typ "'a => 'b"} *}
1876 ML {* @{term "%x. x"} *}
1877 ML {* @{prop "x == y"} *}
1878 ML {* @{ctyp "'a => 'b"} *}
1879 ML {* @{cterm "%x. x"} *}
1880 ML {* @{cprop "x == y"} *}
1881 ML {* @{thm asm_rl} *}
1882 ML {* @{thms asm_rl} *}
1883 ML {* @{type_name c} *}
1884 ML {* @{type_syntax c} *}
1885 ML {* @{const_name c} *}
1886 ML {* @{const_syntax c} *}
1889 ML {* @{theory Pure} *}
1890 ML {* @{theory_ref} *}
1891 ML {* @{theory_ref Pure} *}
1894 ML {* @{clasimpset} *}
1896 The same works for sources being ``used'' within an Isar context.
1898 * ML in Isar: improved error reporting; extra verbosity with
1899 ML_Context.trace enabled.
1901 * Pure/General/table.ML: the join operations now works via exceptions
1902 DUP/SAME instead of type option. This is simpler in simple cases, and
1903 admits slightly more efficient complex applications.
1905 * Pure: 'advanced' translation functions (parse_translation etc.) now
1906 use Context.generic instead of just theory.
1908 * Pure: datatype Context.generic joins theory/Proof.context and
1909 provides some facilities for code that works in either kind of
1910 context, notably GenericDataFun for uniform theory and proof data.
1912 * Pure: simplified internal attribute type, which is now always
1913 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
1914 local (Proof.context) attributes have been discontinued, while
1915 minimizing code duplication. Thm.rule_attribute and
1916 Thm.declaration_attribute build canonical attributes; see also structure
1917 Context for further operations on Context.generic, notably
1918 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
1919 declarations and definitions.
1921 * Context data interfaces (Theory/Proof/GenericDataFun): removed
1922 name/print, uninitialized data defaults to ad-hoc copy of empty value,
1923 init only required for impure data. INCOMPATIBILITY: empty really need
1924 to be empty (no dependencies on theory content!)
1926 * Pure/kernel: consts certification ignores sort constraints given in
1927 signature declarations. (This information is not relevant to the
1928 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
1929 potential INCOMPATIBILITY.
1931 * Pure: axiomatic type classes are now purely definitional, with
1932 explicit proofs of class axioms and super class relations performed
1933 internally. See Pure/axclass.ML for the main internal interfaces --
1934 notably AxClass.define_class supercedes AxClass.add_axclass, and
1935 AxClass.axiomatize_class/classrel/arity supersede
1936 Sign.add_classes/classrel/arities.
1938 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
1939 global/local versions on theory vs. Proof.context have been
1940 discontinued; Attrib.syntax and Method.syntax have been adapted
1941 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
1942 attributes, methods, etc.
1944 * Pure: several functions of signature "... -> theory -> theory * ..."
1945 have been reoriented to "... -> theory -> ... * theory" in order to
1946 allow natural usage in combination with the ||>, ||>>, |-> and
1947 fold_map combinators.
1949 * Pure: official theorem names (closed derivations) and additional
1950 comments (tags) are now strictly separate. Name hints -- which are
1951 maintained as tags -- may be attached any time without affecting the
1954 * Pure: primitive rule lift_rule now takes goal cterm instead of an
1955 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
1956 achieve the old behaviour.
1958 * Pure: the "Goal" constant is now called "prop", supporting a
1959 slightly more general idea of ``protecting'' meta-level rule
1962 * Pure: Logic.(un)varify only works in a global context, which is now
1963 enforced instead of silently assumed. INCOMPATIBILITY, may use
1964 Logic.legacy_(un)varify as temporary workaround.
1966 * Pure: structure Name provides scalable operations for generating
1967 internal variable names, notably Name.variants etc. This replaces
1968 some popular functions from term.ML:
1970 Term.variant -> Name.variant
1971 Term.variantlist -> Name.variant_list
1972 Term.invent_names -> Name.invent_list
1974 Note that low-level renaming rarely occurs in new code -- operations
1975 from structure Variable are used instead (see below).
1977 * Pure: structure Variable provides fundamental operations for proper
1978 treatment of fixed/schematic variables in a context. For example,
1979 Variable.import introduces fixes for schematics of given facts and
1980 Variable.export reverses the effect (up to renaming) -- this replaces
1981 various freeze_thaw operations.
1983 * Pure: structure Goal provides simple interfaces for
1984 init/conclude/finish and tactical prove operations (replacing former
1985 Tactic.prove). Goal.prove is the canonical way to prove results
1986 within a given context; Goal.prove_global is a degraded version for
1987 theory level goals, including a global Drule.standard. Note that
1988 OldGoals.prove_goalw_cterm has long been obsolete, since it is
1989 ill-behaved in a local proof context (e.g. with local fixes/assumes or
1990 in a locale context).
1992 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
1993 and type checking (Syntax.check_term etc.), with common combinations
1994 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
1995 which are considered legacy and await removal.
1997 * Pure/Syntax: generic interfaces for type unchecking
1998 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
1999 with common combinations (Syntax.pretty_term, Syntax.string_of_term
2000 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
2001 available for convenience, but refer to the very same operations using
2002 a mere theory instead of a full context.
2004 * Isar: simplified treatment of user-level errors, using exception
2005 ERROR of string uniformly. Function error now merely raises ERROR,
2006 without any side effect on output channels. The Isar toplevel takes
2007 care of proper display of ERROR exceptions. ML code may use plain
2008 handle/can/try; cat_error may be used to concatenate errors like this:
2010 ... handle ERROR msg => cat_error msg "..."
2012 Toplevel ML code (run directly or through the Isar toplevel) may be
2013 embedded into the Isar toplevel with exception display/debug like
2016 Isar.toplevel (fn () => ...)
2018 INCOMPATIBILITY, removed special transform_error facilities, removed
2019 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2020 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2021 -- use plain ERROR instead.
2023 * Isar: theory setup now has type (theory -> theory), instead of a
2024 list. INCOMPATIBILITY, may use #> to compose setup functions.
2026 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2027 ProofContext.debug/verbose flags.
2029 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2030 theory before entering a proof state. Transactions now always see a
2031 quasi-functional intermediate checkpoint, both in interactive and
2034 * Isar: simplified interfaces for outer syntax. Renamed
2035 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2036 OuterSyntax.add_parsers -- this functionality is now included in
2037 OuterSyntax.command etc. INCOMPATIBILITY.
2039 * Simplifier: the simpset of a running simplification process now
2040 contains a proof context (cf. Simplifier.the_context), which is the
2041 very context that the initial simpset has been retrieved from (by
2042 simpset_of/local_simpset_of). Consequently, all plug-in components
2043 (solver, looper etc.) may depend on arbitrary proof data.
2045 * Simplifier.inherit_context inherits the proof context (plus the
2046 local bounds) of the current simplification process; any simproc
2047 etc. that calls the Simplifier recursively should do this! Removed
2048 former Simplifier.inherit_bounds, which is already included here --
2049 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2050 specify an explicit context using Simplifier.context/theory_context.
2052 * Simplifier/Classical Reasoner: more abstract interfaces
2053 change_simpset/claset for modifying the simpset/claset reference of a
2054 theory; raw versions simpset/claset_ref etc. have been discontinued --
2057 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2063 * settings: the default heap location within ISABELLE_HOME_USER now
2064 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2065 Isabelle installations.
2067 * isabelle-process: option -S (secure mode) disables some critical
2068 operations, notably runtime compilation and evaluation of ML source
2071 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2073 * Support for parallel execution, using native multicore support of
2074 Poly/ML 5.1. The theory loader exploits parallelism when processing
2075 independent theories, according to the given theory header
2076 specifications. The maximum number of worker threads is specified via
2077 usedir option -M or the "max-threads" setting in Proof General. A
2078 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2079 to 6 on a 8-core machine. User-code needs to observe certain
2080 guidelines for thread-safe programming, see appendix A in the Isar
2081 Implementation manual.
2085 New in Isabelle2005 (October 2005)
2086 ----------------------------------
2090 * Theory headers: the new header syntax for Isar theories is
2093 imports <theory1> ... <theoryN>
2094 uses <file1> ... <fileM>
2097 where the 'uses' part is optional. The previous syntax
2099 theory <name> = <theory1> + ... + <theoryN>:
2101 will disappear in the next release. Use isatool fixheaders to convert
2102 existing theory files. Note that there is no change in ancient
2103 non-Isar theories now, but these will disappear soon.
2105 * Theory loader: parent theories can now also be referred to via
2106 relative and absolute paths.
2108 * Command 'find_theorems' searches for a list of criteria instead of a
2109 list of constants. Known criteria are: intro, elim, dest, name:string,
2110 simp:term, and any term. Criteria can be preceded by '-' to select
2111 theorems that do not match. Intro, elim, dest select theorems that
2112 match the current goal, name:s selects theorems whose fully qualified
2113 name contain s, and simp:term selects all simplification rules whose
2114 lhs match term. Any other term is interpreted as pattern and selects
2115 all theorems matching the pattern. Available in ProofGeneral under
2116 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2118 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2120 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2121 matching the current goal as introduction rule and not having "HOL."
2122 in their name (i.e. not being defined in theory HOL).
2124 * Command 'thms_containing' has been discontinued in favour of
2125 'find_theorems'; INCOMPATIBILITY.
2127 * Communication with Proof General is now 8bit clean, which means that
2128 Unicode text in UTF-8 encoding may be used within theory texts (both
2129 formal and informal parts). Cf. option -U of the Isabelle Proof
2130 General interface. Here are some simple examples (cf. src/HOL/ex):
2132 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2133 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2135 * Improved efficiency of the Simplifier and, to a lesser degree, the
2136 Classical Reasoner. Typical big applications run around 2 times
2140 *** Document preparation ***
2142 * Commands 'display_drafts' and 'print_drafts' perform simple output
2143 of raw sources. Only those symbols that do not require additional
2144 LaTeX packages (depending on comments in isabellesym.sty) are
2145 displayed properly, everything else is left verbatim. isatool display
2146 and isatool print are used as front ends (these are subject to the
2147 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2149 * Command tags control specific markup of certain regions of text,
2150 notably folding and hiding. Predefined tags include "theory" (for
2151 theory begin and end), "proof" for proof commands, and "ML" for
2152 commands involving ML code; the additional tags "visible" and
2153 "invisible" are unused by default. Users may give explicit tag
2154 specifications in the text, e.g. ''by %invisible (auto)''. The
2155 interpretation of tags is determined by the LaTeX job during document
2156 preparation: see option -V of isatool usedir, or options -n and -t of
2157 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2160 Several document versions may be produced at the same time via isatool
2161 usedir (the generated index.html will link all of them). Typical
2162 specifications include ''-V document=theory,proof,ML'' to present
2163 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2164 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2165 these parts without any formal replacement text. The Isabelle site
2166 default settings produce ''document'' and ''outline'' versions as
2169 * Several new antiquotations:
2171 @{term_type term} prints a term with its type annotated;
2173 @{typeof term} prints the type of a term;
2175 @{const const} is the same as @{term const}, but checks that the
2176 argument is a known logical constant;
2178 @{term_style style term} and @{thm_style style thm} print a term or
2179 theorem applying a "style" to it
2183 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2184 definitions, equations, inequations etc., 'concl' printing only the
2185 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2186 to print the specified premise. TermStyle.add_style provides an ML
2187 interface for introducing further styles. See also the "LaTeX Sugar"
2188 document practical applications. The ML antiquotation prints
2189 type-checked ML expressions verbatim.
2191 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2192 and 'text' support optional locale specification '(in loc)', which
2193 specifies the default context for interpreting antiquotations. For
2194 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2196 * Option 'locale=NAME' of antiquotations specifies an alternative
2197 context interpreting the subsequent argument. For example: @{thm
2198 [locale=lattice] inf_assoc}.
2200 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2203 * Proper output of antiquotations for theory commands involving a
2204 proof context (such as 'locale' or 'theorem (in loc) ...').
2206 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2207 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2209 * isatool usedir: new option -C (default true) controls whether option
2210 -D should include a copy of the original document directory; -C false
2211 prevents unwanted effects such as copying of administrative CVS data.
2216 * Considerably improved version of 'constdefs' command. Now performs
2217 automatic type-inference of declared constants; additional support for
2218 local structure declarations (cf. locales and HOL records), see also
2219 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2220 sequential dependencies of definitions within a single 'constdefs'
2221 section; moreover, the declared name needs to be an identifier. If
2222 all fails, consider to fall back on 'consts' and 'defs' separately.
2224 * Improved indexed syntax and implicit structures. First of all,
2225 indexed syntax provides a notational device for subscripted
2226 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2227 expressions. Secondly, in a local context with structure
2228 declarations, number indexes \<^sub>n or the empty index (default
2229 number 1) refer to a certain fixed variable implicitly; option
2230 show_structs controls printing of implicit structures. Typical
2231 applications of these concepts involve record types and locales.
2233 * New command 'no_syntax' removes grammar declarations (and
2234 translations) resulting from the given syntax specification, which is
2235 interpreted in the same manner as for the 'syntax' command.
2237 * 'Advanced' translation functions (parse_translation etc.) may depend
2238 on the signature of the theory context being presently used for
2239 parsing/printing, see also isar-ref manual.
2241 * Improved 'oracle' command provides a type-safe interface to turn an
2242 ML expression of type theory -> T -> term into a primitive rule of
2243 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2244 is already included here); see also FOL/ex/IffExample.thy;
2247 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2248 before); "cI" is no longer bound, use "c.intro" instead.
2249 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2250 axclasses vs. locales.
2252 * Improved internal renaming of symbolic identifiers -- attach primes
2253 instead of base 26 numbers.
2255 * New flag show_question_marks controls printing of leading question
2256 marks in schematic variable names.
2258 * In schematic variable names, *any* symbol following \<^isub> or
2259 \<^isup> is now treated as part of the base name. For example, the
2260 following works without printing of awkward ".0" indexes:
2262 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2265 * Inner syntax includes (*(*nested*) comments*).
2267 * Pretty printer now supports unbreakable blocks, specified in mixfix
2268 annotations as "(00...)".
2270 * Clear separation of logical types and nonterminals, where the latter
2271 may only occur in 'syntax' specifications or type abbreviations.
2272 Before that distinction was only partially implemented via type class
2273 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2274 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2275 exotic syntax specifications may require further adaption
2276 (e.g. Cube/Cube.thy).
2278 * Removed obsolete type class "logic", use the top sort {} instead.
2279 Note that non-logical types should be declared as 'nonterminals'
2280 rather than 'types'. INCOMPATIBILITY for new object-logic
2283 * Attributes 'induct' and 'cases': type or set names may now be
2284 locally fixed variables as well.
2286 * Simplifier: can now control the depth to which conditional rewriting
2287 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2290 * Simplifier: simplification procedures may now take the current
2291 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2292 interface), which is very useful for calling the Simplifier
2293 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2294 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2295 low-level mk_simproc no longer applies Logic.varify internally, to
2296 allow for use in a context of fixed variables.
2298 * thin_tac now works even if the assumption being deleted contains !!
2299 or ==>. More generally, erule now works even if the major premise of
2300 the elimination rule contains !! or ==>.
2302 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2304 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2305 from Pure, which contains all common declarations already. Both
2306 theories are defined via plain Isabelle/Isar .thy files.
2307 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2308 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2309 use isatool fixcpure to adapt your theory and ML sources.
2311 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2312 selections of theorems in named facts via index ranges.
2314 * 'print_theorems': in theory mode, really print the difference
2315 wrt. the last state (works for interactive theory development only),
2316 in proof mode print all local facts (cf. 'print_facts');
2318 * 'hide': option '(open)' hides only base names.
2320 * More efficient treatment of intermediate checkpoints in interactive
2323 * Code generator is now invoked via code_module (incremental code
2324 generation) and code_library (modular code generation, ML structures
2325 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2326 must be quoted when used as identifiers.
2328 * New 'value' command for reading, evaluating and printing terms using
2329 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2330 quoted when used as identifier.
2335 * New commands for the interpretation of locale expressions in
2336 theories (1), locales (2) and proof contexts (3). These generate
2337 proof obligations from the expression specification. After the
2338 obligations have been discharged, theorems of the expression are added
2339 to the theory, target locale or proof context. The synopsis of the
2340 commands is a follows:
2342 (1) interpretation expr inst
2343 (2) interpretation target < expr
2344 (3) interpret expr inst
2346 Interpretation in theories and proof contexts require a parameter
2347 instantiation of terms from the current context. This is applied to
2348 specifications and theorems of the interpreted expression.
2349 Interpretation in locales only permits parameter renaming through the
2350 locale expression. Interpretation is smart in that interpretations
2351 that are active already do not occur in proof obligations, neither are
2352 instantiated theorems stored in duplicate. Use 'print_interps' to
2353 inspect active interpretations of a particular locale. For details,
2354 see the Isar Reference manual. Examples can be found in
2355 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2357 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2358 'interpret' instead.
2360 * New context element 'constrains' for adding type constraints to
2363 * Context expressions: renaming of parameters with syntax
2366 * Locale declaration: 'includes' disallowed.
2368 * Proper static binding of attribute syntax -- i.e. types / terms /
2369 facts mentioned as arguments are always those of the locale definition
2370 context, independently of the context of later invocations. Moreover,
2371 locale operations (renaming and type / term instantiation) are applied
2372 to attribute arguments as expected.
2374 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2375 actual attributes; rare situations may require Attrib.attribute to
2376 embed those attributes into Attrib.src that lack concrete syntax.
2377 Attribute implementations need to cooperate properly with the static
2378 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2379 Attrib.XXX_thm etc. already do the right thing without further
2380 intervention. Only unusual applications -- such as "where" or "of"
2381 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2382 on the context and the facts involved -- may have to assign parsed
2383 values to argument tokens explicitly.
2385 * Changed parameter management in theorem generation for long goal
2386 statements with 'includes'. INCOMPATIBILITY: produces a different
2387 theorem statement in rare situations.
2389 * Locale inspection command 'print_locale' omits notes elements. Use
2390 'print_locale!' to have them included in the output.
2395 * Provers/hypsubst.ML: improved version of the subst method, for
2396 single-step rewriting: it now works in bound variable contexts. New is
2397 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2398 rewrite a different subterm than the original subst method, which is
2399 still available as 'simplesubst'.
2401 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2404 * Provers/trancl.ML: new transitivity reasoner for transitive and
2405 reflexive-transitive closure of relations.
2407 * Provers/blast.ML: new reference depth_limit to make blast's depth
2408 limit (previously hard-coded with a value of 20) user-definable.
2410 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2411 is peformed already. Object-logics merely need to finish their
2412 initial simpset configuration as before. INCOMPATIBILITY.
2417 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2420 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2422 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2423 and x-symbol; use option '-m epsilon' to get it actually printed.
2424 Moreover, the mathematically important symbolic identifier \<epsilon>
2425 becomes available as variable, constant etc. INCOMPATIBILITY,
2427 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2428 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2429 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2430 support corresponding Isar calculations.
2432 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2435 * theory SetInterval: changed the syntax for open intervals:
2444 The old syntax is still supported but will disappear in the next
2445 release. For conversion use the following Emacs search and replace
2446 patterns (these are not perfect but work quite well):
2448 {)\([^\.]*\)\.\. -> {\1<\.\.}
2449 \.\.\([^(}]*\)(} -> \.\.<\1}
2451 * Theory Commutative_Ring (in Library): method comm_ring for proving
2452 equalities in commutative rings; method 'algebra' provides a generic
2455 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2456 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2457 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2460 Some new syntax forms are available:
2462 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2463 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2464 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2465 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2467 The latter form "\<Sum>x < k. e" used to be based on a separate
2468 function "Summation", which has been discontinued.
2470 * theory Finite_Set: in structured induction proofs, the insert case
2471 is now 'case (insert x F)' instead of the old counterintuitive 'case
2474 * The 'refute' command has been extended to support a much larger
2475 fragment of HOL, including axiomatic type classes, constdefs and
2476 typedefs, inductive datatypes and recursion.
2478 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2479 Requires zChaff with proof generation to be installed. See
2480 HOL/ex/SAT_Examples.thy for examples.
2482 * Datatype induction via method 'induct' now preserves the name of the
2483 induction variable. For example, when proving P(xs::'a list) by
2484 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2485 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2486 in unstructured proof scripts.
2488 * Reworked implementation of records. Improved scalability for
2489 records with many fields, avoiding performance problems for type
2490 inference. Records are no longer composed of nested field types, but
2491 of nested extension types. Therefore the record type only grows linear
2492 in the number of extensions and not in the number of fields. The
2493 top-level (users) view on records is preserved. Potential
2494 INCOMPATIBILITY only in strange cases, where the theory depends on the
2495 old record representation. The type generated for a record is called
2496 <record_name>_ext_type.
2498 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2499 proofs triggered by a record definition or a simproc (if
2500 quick_and_dirty is enabled). Definitions of large records can take
2503 New simproc record_upd_simproc for simplification of multiple record
2504 updates enabled by default. Moreover, trivial updates are also
2505 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2506 occasionally, since simplification is more powerful by default.
2508 * typedef: proper support for polymorphic sets, which contain extra
2509 type-variables in the term.
2511 * Simplifier: automatically reasons about transitivity chains
2512 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2513 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2514 old proofs break occasionally as simplification may now solve more
2515 goals than previously.
2517 * Simplifier: converts x <= y into x = y if assumption y <= x is
2518 present. Works for all partial orders (class "order"), in particular
2519 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2522 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2523 bound variable or a constant then the let is unfolded. Otherwise
2524 first a is simplified to b, and then f b is simplified to g. If
2525 possible we abstract b from g arriving at "let x = b in h x",
2526 otherwise we unfold the let and arrive at g. The simproc can be
2527 enabled/disabled by the reference use_let_simproc. Potential
2528 INCOMPATIBILITY since simplification is more powerful by default.
2530 * Classical reasoning: the meson method now accepts theorems as arguments.
2532 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2533 jobs to provide advice on the provability of subgoals.
2535 * Theory OrderedGroup and Ring_and_Field: various additions and
2536 improvements to faciliate calculations involving equalities and
2539 The following theorems have been eliminated or modified
2542 abs_eq now named abs_of_nonneg
2543 abs_of_ge_0 now named abs_of_nonneg
2544 abs_minus_eq now named abs_of_nonpos
2545 imp_abs_id now named abs_of_nonneg
2546 imp_abs_neg_id now named abs_of_nonpos
2547 mult_pos now named mult_pos_pos
2548 mult_pos_le now named mult_nonneg_nonneg
2549 mult_pos_neg_le now named mult_nonneg_nonpos
2550 mult_pos_neg2_le now named mult_nonneg_nonpos2
2551 mult_neg now named mult_neg_neg
2552 mult_neg_le now named mult_nonpos_nonpos
2554 * The following lemmas in Ring_and_Field have been added to the simplifier:
2557 not_square_less_zero
2559 The following lemmas have been deleted from Real/RealPow:
2569 * Theory Parity: added rules for simplifying exponents.
2573 The following theorems have been eliminated or modified
2576 list_all_Nil now named list_all.simps(1)
2577 list_all_Cons now named list_all.simps(2)
2578 list_all_conv now named list_all_iff
2579 set_mem_eq now named mem_iff
2581 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2582 asymptotic "big O" calculations. See the notes in BigO.thy.
2587 * Theory RealDef: better support for embedding natural numbers and
2588 integers in the reals.
2590 The following theorems have been eliminated or modified
2593 exp_ge_add_one_self now requires no hypotheses
2594 real_of_int_add reversed direction of equality (use [symmetric])
2595 real_of_int_minus reversed direction of equality (use [symmetric])
2596 real_of_int_diff reversed direction of equality (use [symmetric])
2597 real_of_int_mult reversed direction of equality (use [symmetric])
2599 * Theory RComplete: expanded support for floor and ceiling functions.
2601 * Theory Ln is new, with properties of the natural logarithm
2603 * Hyperreal: There is a new type constructor "star" for making
2604 nonstandard types. The old type names are now type synonyms:
2608 hcomplex = complex star
2610 * Hyperreal: Many groups of similarly-defined constants have been
2611 replaced by polymorphic versions (INCOMPATIBILITY):
2613 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2615 starset <-- starsetNat, starsetC
2616 *s* <-- *sNat*, *sc*
2617 starset_n <-- starsetNat_n, starsetC_n
2618 *sn* <-- *sNatn*, *scn*
2619 InternalSets <-- InternalNatSets, InternalCSets
2621 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2622 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2623 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2624 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2625 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2627 * Hyperreal: Many type-specific theorems have been removed in favor of
2628 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2630 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2631 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2632 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2633 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2634 right_minus <-- hypreal_add_minus
2635 left_minus <-- {hypreal,hcomplex}_add_minus_left
2636 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2637 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2638 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2639 mult_1_right <-- hcomplex_mult_one_right
2640 mult_zero_left <-- hcomplex_mult_zero_left
2641 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2642 right_distrib <-- hypnat_add_mult_distrib2
2643 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2644 right_inverse <-- hypreal_mult_inverse
2645 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2646 order_refl <-- {hypreal,hypnat}_le_refl
2647 order_trans <-- {hypreal,hypnat}_le_trans
2648 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2649 order_less_le <-- {hypreal,hypnat}_less_le
2650 linorder_linear <-- {hypreal,hypnat}_le_linear
2651 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2652 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2653 add_nonneg_nonneg <-- hypreal_le_add_order
2655 * Hyperreal: Separate theorems having to do with type-specific
2656 versions of constants have been merged into theorems that apply to the
2657 new polymorphic constants (INCOMPATIBILITY):
2659 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2660 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2661 STAR_Un <-- {STAR,NatStar,STARC}_Un
2662 STAR_Int <-- {STAR,NatStar,STARC}_Int
2663 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2664 STAR_subset <-- {STAR,NatStar,STARC}_subset
2665 STAR_mem <-- {STAR,NatStar,STARC}_mem
2666 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2667 STAR_diff <-- {STAR,STARC}_diff
2668 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2669 STARC_hcomplex_of_complex}_image_subset
2670 starset_n_Un <-- starset{Nat,C}_n_Un
2671 starset_n_Int <-- starset{Nat,C}_n_Int
2672 starset_n_Compl <-- starset{Nat,C}_n_Compl
2673 starset_n_diff <-- starset{Nat,C}_n_diff
2674 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2675 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2676 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2677 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2678 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2679 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2680 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2681 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2682 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2683 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2684 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2685 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2686 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2687 starfun_diff <-- starfun{C,RC,CR}_diff
2688 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2689 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2690 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2691 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2692 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2693 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2694 starfun_Id <-- starfunC_Id
2695 starfun_approx <-- starfun{Nat,CR}_approx
2696 starfun_capprox <-- starfun{C,RC}_capprox
2697 starfun_abs <-- starfunNat_rabs
2698 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2699 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2700 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2701 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2702 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2703 starfun_add_approx <-- starfunCR_add_approx
2704 starfun_inverse_inverse <-- starfunC_inverse_inverse
2705 starfun_divide <-- starfun{C,CR,RC}_divide
2706 starfun_n <-- starfun{Nat,C}_n
2707 starfun_n_mult <-- starfun{Nat,C}_n_mult
2708 starfun_n_add <-- starfun{Nat,C}_n_add
2709 starfun_n_add_minus <-- starfunNat_n_add_minus
2710 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2711 starfun_n_minus <-- starfun{Nat,C}_n_minus
2712 starfun_n_eq <-- starfun{Nat,C}_n_eq
2714 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2715 star_n_minus <-- {hypreal,hcomplex}_minus
2716 star_n_diff <-- {hypreal,hcomplex}_diff
2717 star_n_mult <-- {hypreal,hcomplex}_mult
2718 star_n_inverse <-- {hypreal,hcomplex}_inverse
2719 star_n_le <-- {hypreal,hypnat}_le
2720 star_n_less <-- {hypreal,hypnat}_less
2721 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2722 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2723 star_n_abs <-- hypreal_hrabs
2724 star_n_divide <-- hcomplex_divide
2726 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2727 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2728 star_of_diff <-- hypreal_of_real_diff
2729 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2730 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2731 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2732 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2733 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2734 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2735 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2736 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2737 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2738 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2739 star_of_number_of <-- {hypreal,hcomplex}_number_of
2740 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2741 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2742 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2743 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2744 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2745 star_of_power <-- hypreal_of_real_power
2746 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2748 * Hyperreal: new method "transfer" that implements the transfer
2749 principle of nonstandard analysis. With a subgoal that mentions
2750 nonstandard types like "'a star", the command "apply transfer"
2751 replaces it with an equivalent one that mentions only standard types.
2752 To be successful, all free variables must have standard types; non-
2753 standard variables must have explicit universal quantifiers.
2755 * Hyperreal: A theory of Taylor series.
2760 * Discontinued special version of 'constdefs' (which used to support
2761 continuous functions) in favor of the general Pure one with full
2764 * New simplification procedure for solving continuity conditions; it
2765 is much faster on terms with many nested lambda abstractions (cubic
2766 instead of exponential time).
2768 * New syntax for domain package: selector names are now optional.
2769 Parentheses should be omitted unless argument is lazy, for example:
2771 domain 'a stream = cons "'a" (lazy "'a stream")
2773 * New command 'fixrec' for defining recursive functions with pattern
2774 matching; defining multiple functions with mutual recursion is also
2775 supported. Patterns may include the constants cpair, spair, up, sinl,
2776 sinr, or any data constructor defined by the domain package. The given
2777 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2778 syntax and examples.
2780 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2781 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2782 but the proof obligation additionally includes an admissibility
2783 requirement. The packages generate instances of class cpo or pcpo,
2784 with continuity and strictness theorems for Rep and Abs.
2786 * HOLCF: Many theorems have been renamed according to a more standard naming
2787 scheme (INCOMPATIBILITY):
2789 foo_inject: "foo$x = foo$y ==> x = y"
2790 foo_eq: "(foo$x = foo$y) = (x = y)"
2791 foo_less: "(foo$x << foo$y) = (x << y)"
2792 foo_strict: "foo$UU = UU"
2793 foo_defined: "... ==> foo$x ~= UU"
2794 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2799 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2800 including the First Isomorphism Theorem (on quotienting by the kernel
2803 * ZF/Simplifier: install second copy of type solver that actually
2804 makes use of TC rules declared to Isar proof contexts (or locales);
2805 the old version is still required for ML proof scripts.
2810 * Converted to Isar theory format; use locales instead of axiomatic
2816 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
2819 * Pure/library.ML no longer defines its own option datatype, but uses
2820 that of the SML basis, which has constructors NONE and SOME instead of
2821 None and Some, as well as exception Option.Option instead of OPTION.
2822 The functions the, if_none, is_some, is_none have been adapted
2823 accordingly, while Option.map replaces apsome.
2825 * Pure/library.ML: the exception LIST has been given up in favour of
2826 the standard exceptions Empty and Subscript, as well as
2827 Library.UnequalLengths. Function like Library.hd and Library.tl are
2828 superceded by the standard hd and tl functions etc.
2830 A number of basic list functions are no longer exported to the ML
2831 toplevel, as they are variants of predefined functions. The following
2832 suggests how one can translate existing code:
2834 rev_append xs ys = List.revAppend (xs, ys)
2835 nth_elem (i, xs) = List.nth (xs, i)
2836 last_elem xs = List.last xs
2837 flat xss = List.concat xss
2838 seq fs = List.app fs
2839 partition P xs = List.partition P xs
2840 mapfilter f xs = List.mapPartial f xs
2842 * Pure/library.ML: several combinators for linear functional
2843 transformations, notably reverse application and composition:
2846 (x, y) |-> f f #-> g
2848 * Pure/library.ML: introduced/changed precedence of infix operators:
2850 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
2852 infix 3 o oo ooo oooo;
2853 infix 4 ~~ upto downto;
2855 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
2858 * Pure/library.ML: natural list combinators fold, fold_rev, and
2859 fold_map support linear functional transformations and nesting. For
2862 fold f [x1, ..., xN] y =
2863 y |> f x1 |> ... |> f xN
2865 (fold o fold) f [xs1, ..., xsN] y =
2866 y |> fold f xs1 |> ... |> fold f xsN
2868 fold f [x1, ..., xN] =
2871 (fold o fold) f [xs1, ..., xsN] =
2872 fold f xs1 #> ... #> fold f xsN
2874 * Pure/library.ML: the following selectors on type 'a option are
2877 the: 'a option -> 'a (*partial*)
2878 these: 'a option -> 'a where 'a = 'b list
2879 the_default: 'a -> 'a option -> 'a
2880 the_list: 'a option -> 'a list
2882 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2883 basic operations for association lists, following natural argument
2884 order; moreover the explicit equality predicate passed here avoids
2885 potentially expensive polymorphic runtime equality checks.
2886 The old functions may be expressed as follows:
2888 assoc = uncurry (AList.lookup (op =))
2889 assocs = these oo AList.lookup (op =)
2890 overwrite = uncurry (AList.update (op =)) o swap
2892 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2894 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
2895 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
2897 replacing make_keylist and keyfilter (occassionally used)
2900 make_keylist = AList.make
2901 keyfilter = AList.find (op =)
2903 * eq_fst and eq_snd now take explicit equality parameter, thus
2904 avoiding eqtypes. Naive rewrites:
2906 eq_fst = eq_fst (op =)
2907 eq_snd = eq_snd (op =)
2909 * Removed deprecated apl and apr (rarely used).
2912 apl (n, op) =>>= curry op n
2913 apr (op, m) =>>= fn n => op (n, m)
2915 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
2916 provides a reasonably efficient light-weight implementation of sets as
2919 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
2920 few new operations; existing lookup and update are now curried to
2921 follow natural argument order (for use with fold etc.);
2922 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
2924 * Pure/General: output via the Isabelle channels of
2925 writeln/warning/error etc. is now passed through Output.output, with a
2926 hook for arbitrary transformations depending on the print_mode
2927 (cf. Output.add_mode -- the first active mode that provides a output
2928 function wins). Already formatted output may be embedded into further
2929 text via Output.raw; the result of Pretty.string_of/str_of and derived
2930 functions (string_of_term/cterm/thm etc.) is already marked raw to
2931 accommodate easy composition of diagnostic messages etc. Programmers
2932 rarely need to care about Output.output or Output.raw at all, with
2933 some notable exceptions: Output.output is required when bypassing the
2934 standard channels (writeln etc.), or in token translations to produce
2935 properly formatted results; Output.raw is required when capturing
2936 already output material that will eventually be presented to the user
2937 a second time. For the default print mode, both Output.output and
2938 Output.raw have no effect.
2940 * Pure/General: Output.time_accumulator NAME creates an operator ('a
2941 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
2942 cumulative results are displayed at the end of a batch session.
2944 * Pure/General: File.sysify_path and File.quote_sysify path have been
2945 replaced by File.platform_path and File.shell_path (with appropriate
2946 hooks). This provides a clean interface for unusual systems where the
2947 internal and external process view of file names are different.
2949 * Pure: more efficient orders for basic syntactic entities: added
2950 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
2951 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
2952 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
2953 orders now -- potential INCOMPATIBILITY for code that depends on a
2954 particular order for Symtab.keys, Symtab.dest, etc. (consider using
2955 Library.sort_strings on result).
2957 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
2958 fold_types traverse types/terms from left to right, observing natural
2959 argument order. Supercedes previous foldl_XXX versions, add_frees,
2960 add_vars etc. have been adapted as well: INCOMPATIBILITY.
2962 * Pure: name spaces have been refined, with significant changes of the
2963 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
2964 to extern(_table). The plain name entry path is superceded by a
2965 general 'naming' context, which also includes the 'policy' to produce
2966 a fully qualified name and external accesses of a fully qualified
2967 name; NameSpace.extend is superceded by context dependent
2968 Sign.declare_name. Several theory and proof context operations modify
2969 the naming context. Especially note Theory.restore_naming and
2970 ProofContext.restore_naming to get back to a sane state; note that
2971 Theory.add_path is no longer sufficient to recover from
2972 Theory.absolute_path in particular.
2974 * Pure: new flags short_names (default false) and unique_names
2975 (default true) for controlling output of qualified names. If
2976 short_names is set, names are printed unqualified. If unique_names is
2977 reset, the name prefix is reduced to the minimum required to achieve
2978 the original result when interning again, even if there is an overlap
2979 with earlier declarations.
2981 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
2982 now 'extend', and 'merge' gets an additional Pretty.pp argument
2983 (useful for printing error messages). INCOMPATIBILITY.
2985 * Pure: major reorganization of the theory context. Type Sign.sg and
2986 Theory.theory are now identified, referring to the universal
2987 Context.theory (see Pure/context.ML). Actual signature and theory
2988 content is managed as theory data. The old code and interfaces were
2989 spread over many files and structures; the new arrangement introduces
2990 considerable INCOMPATIBILITY to gain more clarity:
2992 Context -- theory management operations (name, identity, inclusion,
2993 parents, ancestors, merge, etc.), plus generic theory data;
2995 Sign -- logical signature and syntax operations (declaring consts,
2996 types, etc.), plus certify/read for common entities;
2998 Theory -- logical theory operations (stating axioms, definitions,
2999 oracles), plus a copy of logical signature operations (consts,
3000 types, etc.); also a few basic management operations (Theory.copy,
3003 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
3004 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
3005 for convenience -- they merely return the theory.
3007 * Pure: type Type.tsig is superceded by theory in most interfaces.
3009 * Pure: the Isar proof context type is already defined early in Pure
3010 as Context.proof (note that ProofContext.context and Proof.context are
3011 aliases, where the latter is the preferred name). This enables other
3012 Isabelle components to refer to that type even before Isar is present.
3014 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3015 typeK, constK, axiomK, oracleK), but provide explicit operations for
3016 any of these kinds. For example, Sign.intern typeK is now
3017 Sign.intern_type, Theory.hide_space Sign.typeK is now
3018 Theory.hide_types. Also note that former
3019 Theory.hide_classes/types/consts are now
3020 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3021 internalize their arguments! INCOMPATIBILITY.
3023 * Pure: get_thm interface (of PureThy and ProofContext) expects
3024 datatype thmref (with constructors Name and NameSelection) instead of
3025 plain string -- INCOMPATIBILITY;
3027 * Pure: cases produced by proof methods specify options, where NONE
3028 means to remove case bindings -- INCOMPATIBILITY in
3031 * Pure: the following operations retrieve axioms or theorems from a
3032 theory node or theory hierarchy, respectively:
3034 Theory.axioms_of: theory -> (string * term) list
3035 Theory.all_axioms_of: theory -> (string * term) list
3036 PureThy.thms_of: theory -> (string * thm) list
3037 PureThy.all_thms_of: theory -> (string * thm) list
3039 * Pure: print_tac now outputs the goal through the trace channel.
3041 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3042 Reference Toplevel.debug (default false) controls detailed printing
3043 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3044 controls execution profiling -- set to 1 for time and 2 for space
3045 (both increase the runtime).
3047 * Isar session: The initial use of ROOT.ML is now always timed,
3048 i.e. the log will show the actual process times, in contrast to the
3049 elapsed wall-clock time that the outer shell wrapper produces.
3051 * Simplifier: improved handling of bound variables (nameless
3052 representation, avoid allocating new strings). Simprocs that invoke
3053 the Simplifier recursively should use Simplifier.inherit_bounds to
3054 avoid local name clashes. Failure to do so produces warnings
3055 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3056 for further details.
3058 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3059 bindings for all theorems stored within a given theory; this may help
3060 in porting non-Isar theories to Isar ones, while keeping ML proof
3061 scripts for the time being.
3063 * ML operator HTML.with_charset specifies the charset begin used for
3064 generated HTML files. For example:
3066 HTML.with_charset "utf-8" use_thy "Hebrew";
3067 HTML.with_charset "utf-8" use_thy "Chinese";
3072 * Allow symlinks to all proper Isabelle executables (Isabelle,
3073 isabelle, isatool etc.).
3075 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3076 isatool doc, isatool mkdir, display_drafts etc.).
3078 * isatool usedir: option -f allows specification of the ML file to be
3079 used by Isabelle; default is ROOT.ML.
3081 * New isatool version outputs the version identifier of the Isabelle
3082 distribution being used.
3084 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3085 (containing Boolean satisfiability problems) into Isabelle/HOL
3090 New in Isabelle2004 (April 2004)
3091 --------------------------------
3095 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3096 Replaces linorder.ML.
3098 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3099 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3100 (\<a>...\<z>), are now considered normal letters, and can therefore
3101 be used anywhere where an ASCII letter (a...zA...Z) has until
3102 now. COMPATIBILITY: This obviously changes the parsing of some
3103 terms, especially where a symbol has been used as a binder, say
3104 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3105 as an identifier. Fix it by inserting a space around former
3106 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3107 existing theory and ML files.
3109 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3111 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3112 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3113 a normal (but invisible) letter. For multiple letter subscripts repeat
3114 \<^isub> like this: x\<^isub>1\<^isub>2.
3116 * Pure: There are now sub-/superscripts that can span more than one
3117 character. Text between \<^bsub> and \<^esub> is set in subscript in
3118 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3119 superscript. The new control characters are not identifier parts.
3121 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3122 content of "..." to the latex file instead of \isacntrl... . The "..."
3123 may consist of any printable characters excluding the end bracket >.
3125 * Pure: Using new Isar command "finalconsts" (or the ML functions
3126 Theory.add_finals or Theory.add_finals_i) it is now possible to
3127 declare constants "final", which prevents their being given a definition
3128 later. It is useful for constants whose behaviour is fixed axiomatically
3129 rather than definitionally, such as the meta-logic connectives.
3131 * Pure: 'instance' now handles general arities with general sorts
3132 (i.e. intersections of classes),
3134 * Presentation: generated HTML now uses a CSS style sheet to make layout
3135 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3136 It can be changed to alter the colors/layout of generated pages.
3141 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3142 cut_tac, subgoal_tac and thin_tac:
3143 - Now understand static (Isar) contexts. As a consequence, users of Isar
3144 locales are no longer forced to write Isar proof scripts.
3145 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3147 - INCOMPATIBILITY: names of variables to be instantiated may no
3148 longer be enclosed in quotes. Instead, precede variable name with `?'.
3149 This is consistent with the instantiation attribute "where".
3151 * Attributes "where" and "of":
3152 - Now take type variables of instantiated theorem into account when reading
3153 the instantiation string. This fixes a bug that caused instantiated
3154 theorems to have too special types in some circumstances.
3155 - "where" permits explicit instantiations of type variables.
3157 * Calculation commands "moreover" and "also" no longer interfere with
3158 current facts ("this"), admitting arbitrary combinations with "then"
3162 - Goal statements involving the context element "includes" no longer
3163 generate theorems with internal delta predicates (those ending on
3164 "_axioms") in the premise.
3165 Resolve particular premise with <locale>.intro to obtain old form.
3166 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3167 specification and "includes" elements in goal statement.
3168 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3169 [intro?] and [elim?] (respectively) by default.
3170 - Experimental command for instantiation of locales in proof contexts:
3171 instantiate <label>[<attrs>]: <loc>
3172 Instantiates locale <loc> and adds all its theorems to the current context
3173 taking into account their attributes. Label and attrs are optional
3174 modifiers, like in theorem declarations. If present, names of
3175 instantiated theorems are qualified with <label>, and the attributes
3176 <attrs> are applied after any attributes these theorems might have already.
3177 If the locale has assumptions, a chained fact of the form
3178 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3179 are derived. The command does not support old-style locales declared
3180 with "locale (open)".
3181 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3183 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3189 * Proof import: new image HOL4 contains the imported library from
3190 the HOL4 system with about 2500 theorems. It is imported by
3191 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3192 can be used like any other Isabelle image. See
3193 HOL/Import/HOL/README for more information.
3196 - Much improved handling of linear and partial orders.
3197 Reasoners for linear and partial orders are set up for type classes
3198 "linorder" and "order" respectively, and are added to the default simpset
3199 as solvers. This means that the simplifier can build transitivity chains
3200 to solve goals from the assumptions.
3201 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3202 of blast or auto after simplification become unnecessary because the goal
3203 is solved by simplification already.
3205 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3206 all proved in axiomatic type classes for semirings, rings and fields.
3209 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3210 now formalized using the Ring_and_Field theory mentioned above.
3211 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3212 than before, because now they are set up once in a generic manner.
3213 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3214 Look for the general versions in Ring_and_Field (and Power if they concern
3217 * Type "rat" of the rational numbers is now available in HOL-Complex.
3220 - Record types are now by default printed with their type abbreviation
3221 instead of the list of all field types. This can be configured via
3222 the reference "print_record_type_abbr".
3223 - Simproc "record_upd_simproc" for simplification of multiple updates added
3224 (not enabled by default).
3225 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3226 EX x. x = sel r to True (not enabled by default).
3227 - Tactic "record_split_simp_tac" to split and simplify records added.
3229 * 'specification' command added, allowing for definition by
3230 specification. There is also an 'ax_specification' command that
3231 introduces the new constants axiomatically.
3233 * arith(_tac) is now able to generate counterexamples for reals as well.
3235 * HOL-Algebra: new locale "ring" for non-commutative rings.
3237 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3238 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3240 * HOL-Matrix: a first theory for matrices in HOL with an application of
3241 matrix theory to linear programming.
3243 * Unions and Intersections:
3244 The latex output syntax of UN and INT has been changed
3245 from "\Union x \in A. B" to "\Union_{x \in A} B"
3246 i.e. the index formulae has become a subscript.
3247 Similarly for "\Union x. B", and for \Inter instead of \Union.
3249 * Unions and Intersections over Intervals:
3250 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3251 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3252 like in normal math, and corresponding versions for < and for intersection.
3254 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3255 lexicographic dictonary ordering has been added as "lexord".
3257 * ML: the legacy theory structures Int and List have been removed. They had
3258 conflicted with ML Basis Library structures having the same names.
3260 * 'refute' command added to search for (finite) countermodels. Only works
3261 for a fragment of HOL. The installation of an external SAT solver is
3262 highly recommended. See "HOL/Refute.thy" for details.
3264 * 'quickcheck' command: Allows to find counterexamples by evaluating
3265 formulae under an assignment of free variables to random values.
3266 In contrast to 'refute', it can deal with inductive datatypes,
3267 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3273 * Streams now come with concatenation and are part of the HOLCF image
3277 New in Isabelle2003 (May 2003)
3278 ------------------------------
3282 * Provers/simplifier:
3284 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3285 Assumptions are now subject to complete mutual simplification,
3286 not just from left to right. The simplifier now preserves
3287 the order of assumptions.
3289 Potential INCOMPATIBILITY:
3291 -- simp sometimes diverges where the old version did
3292 not, e.g. invoking simp on the goal
3294 [| P (f x); y = x; f x = f y |] ==> Q
3296 now gives rise to the infinite reduction sequence
3298 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3300 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3303 -- Tactics combining classical reasoner and simplification (such as auto)
3304 are also affected by this change, because many of them rely on
3305 simp. They may sometimes diverge as well or yield a different numbers
3306 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3307 in case of problems. Sometimes subsequent calls to the classical
3308 reasoner will fail because a preceeding call to the simplifier too
3309 eagerly simplified the goal, e.g. deleted redundant premises.
3311 - The simplifier trace now shows the names of the applied rewrite rules
3313 - You can limit the number of recursive invocations of the simplifier
3314 during conditional rewriting (where the simplifie tries to solve the
3315 conditions before applying the rewrite rule):
3316 ML "simp_depth_limit := n"
3317 where n is an integer. Thus you can force termination where previously
3318 the simplifier would diverge.
3320 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3322 - No longer aborts on failed congruence proof. Instead, the
3323 congruence is ignored.
3325 * Pure: New generic framework for extracting programs from constructive
3326 proofs. See HOL/Extraction.thy for an example instantiation, as well
3327 as HOL/Extraction for some case studies.
3329 * Pure: The main goal of the proof state is no longer shown by default, only
3330 the subgoals. This behaviour is controlled by a new flag.
3331 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3332 (ML: Proof.show_main_goal).
3334 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3335 rules whose conclusion matches subgoal 1:
3336 PG menu: Isabelle/Isar -> Show me -> matching rules
3337 The rules are ordered by how closely they match the subgoal.
3338 In particular, rules that solve a subgoal outright are displayed first
3339 (or rather last, the way they are printed).
3340 (ML: ProofGeneral.print_intros())
3342 * Pure: New flag trace_unify_fail causes unification to print
3343 diagnostic information (PG: in trace buffer) when it fails. This is
3344 useful for figuring out why single step proofs like rule, erule or
3347 * Pure: Locale specifications now produce predicate definitions
3348 according to the body of text (covering assumptions modulo local
3349 definitions); predicate "loc_axioms" covers newly introduced text,
3350 while "loc" is cumulative wrt. all included locale expressions; the
3351 latter view is presented only on export into the global theory
3352 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3353 on the old view without predicates;
3355 * Pure: predefined locales "var" and "struct" are useful for sharing
3356 parameters (as in CASL, for example); just specify something like
3357 ``var x + var y + struct M'' as import;
3359 * Pure: improved thms_containing: proper indexing of facts instead of
3360 raw theorems; check validity of results wrt. current name space;
3361 include local facts of proof configuration (also covers active
3362 locales), cover fixed variables in index; may use "_" in term
3363 specification; an optional limit for the number of printed facts may
3364 be given (the default is 40);
3366 * Pure: disallow duplicate fact bindings within new-style theory files
3369 * Provers: improved induct method: assumptions introduced by case
3370 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3371 the goal statement); "foo" still refers to all facts collectively;
3373 * Provers: the function blast.overloaded has been removed: all constants
3374 are regarded as potentially overloaded, which improves robustness in exchange
3375 for slight decrease in efficiency;
3377 * Provers/linorder: New generic prover for transitivity reasoning over
3378 linear orders. Note: this prover is not efficient!
3380 * Isar: preview of problems to finish 'show' now produce an error
3381 rather than just a warning (in interactive mode);
3388 - Produces a counter example if it cannot prove a goal.
3389 Note that the counter example may be spurious if the goal is not a formula
3390 of quantifier-free linear arithmetic.
3391 In ProofGeneral the counter example appears in the trace buffer.
3393 - Knows about div k and mod k where k is a numeral of type nat or int.
3395 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3396 linear arithmetic fails. This takes account of quantifiers and divisibility.
3397 Presburger arithmetic can also be called explicitly via presburger(_tac).
3399 * simp's arithmetic capabilities have been enhanced a bit: it now
3400 takes ~= in premises into account (by performing a case split);
3402 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3403 are distributed over a sum of terms;
3405 * New tactic "trans_tac" and method "trans" instantiate
3406 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3409 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3410 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3412 * 'typedef' command has new option "open" to suppress the set
3415 * functions Min and Max on finite sets have been introduced (theory
3418 * attribute [symmetric] now works for relations as well; it turns
3419 (x,y) : R^-1 into (y,x) : R, and vice versa;
3421 * induct over a !!-quantified statement (say !!x1..xn):
3422 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3424 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3425 %x. None. Warning: empty_def now refers to the previously hidden definition
3428 * Algebra: formalization of classical algebra. Intended as base for
3429 any algebraic development in Isabelle. Currently covers group theory
3430 (up to Sylow's theorem) and ring theory (Universal Property of
3431 Univariate Polynomials). Contributions welcome;
3433 * GroupTheory: deleted, since its material has been moved to Algebra;
3435 * Complex: new directory of the complex numbers with numeric constants,
3436 nonstandard complex numbers, and some complex analysis, standard and
3437 nonstandard (Jacques Fleuriot);
3439 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3441 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3444 * Real/HahnBanach: updated and adapted to locales;
3446 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3449 * UNITY: added the Meier-Sanders theory of progress sets;
3451 * MicroJava: bytecode verifier and lightweight bytecode verifier
3452 as abstract algorithms, instantiated to the JVM;
3454 * Bali: Java source language formalization. Type system, operational
3455 semantics, axiomatic semantics. Supported language features:
3456 classes, interfaces, objects,virtual methods, static methods,
3457 static/instance fields, arrays, access modifiers, definite
3458 assignment, exceptions.
3463 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3466 * Main ZF: virtually all theories converted to new-style format;
3471 * Pure: Tactic.prove provides sane interface for internal proofs;
3472 omits the infamous "standard" operation, so this is more appropriate
3473 than prove_goalw_cterm in many situations (e.g. in simprocs);
3475 * Pure: improved error reporting of simprocs;
3477 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3481 *** Document preparation ***
3483 * uses \par instead of \\ for line breaks in theory text. This may
3484 shift some page breaks in large documents. To get the old behaviour
3485 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3487 * minimized dependencies of isabelle.sty and isabellesym.sty on
3490 * \<euro> now needs package babel/greek instead of marvosym (which
3493 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3498 New in Isabelle2002 (March 2002)
3499 --------------------------------
3501 *** Document preparation ***
3503 * greatly simplified document preparation setup, including more
3504 graceful interpretation of isatool usedir -i/-d/-D options, and more
3505 instructive isatool mkdir; users should basically be able to get
3506 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3507 users may run a separate document processing stage manually like this:
3508 "isatool usedir -D output HOL Test && isatool document Test/output";
3510 * theory dependency graph may now be incorporated into documents;
3511 isatool usedir -g true will produce session_graph.eps/.pdf for use
3512 with \includegraphics of LaTeX;
3514 * proper spacing of consecutive markup elements, especially text
3515 blocks after section headings;
3517 * support bold style (for single symbols only), input syntax is like
3518 this: "\<^bold>\<alpha>" or "\<^bold>A";
3520 * \<bullet> is now output as bold \cdot by default, which looks much
3521 better in printed text;
3523 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3524 note that these symbols are currently unavailable in Proof General /
3525 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3527 * isatool latex no longer depends on changed TEXINPUTS, instead
3528 isatool document copies the Isabelle style files to the target
3534 * Pure/Provers: improved proof by cases and induction;
3535 - 'case' command admits impromptu naming of parameters (such as
3537 - 'induct' method divinates rule instantiation from the inductive
3538 claim; no longer requires excessive ?P bindings for proper
3539 instantiation of cases;
3540 - 'induct' method properly enumerates all possibilities of set/type
3541 rules; as a consequence facts may be also passed through *type*
3542 rules without further ado;
3543 - 'induct' method now derives symbolic cases from the *rulified*
3544 rule (before it used to rulify cases stemming from the internal
3545 atomized version); this means that the context of a non-atomic
3546 statement becomes is included in the hypothesis, avoiding the
3547 slightly cumbersome show "PROP ?case" form;
3548 - 'induct' may now use elim-style induction rules without chaining
3549 facts, using ``missing'' premises from the goal state; this allows
3550 rules stemming from inductive sets to be applied in unstructured
3551 scripts, while still benefitting from proper handling of non-atomic
3552 statements; NB: major inductive premises need to be put first, all
3553 the rest of the goal is passed through the induction;
3554 - 'induct' proper support for mutual induction involving non-atomic
3555 rule statements (uses the new concept of simultaneous goals, see
3557 - append all possible rule selections, but only use the first
3558 success (no backtracking);
3559 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3560 - undeclared rule case names default to numbers 1, 2, 3, ...;
3561 - added 'print_induct_rules' (covered by help item in recent Proof
3563 - moved induct/cases attributes to Pure, methods to Provers;
3564 - generic method setup instantiated for FOL and HOL;
3566 * Pure: support multiple simultaneous goal statements, for example
3567 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3568 meta-level mechanism, this acts as if several individual goals had
3569 been stated separately; in particular common proof methods need to be
3570 repeated in order to cover all claims; note that a single elimination
3571 step is *not* sufficient to establish the two conjunctions, so this
3574 assume "A & B" then have A and B .. (*".." fails*)
3576 better use "obtain" in situations as above; alternative refer to
3577 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3579 * Pure: proper integration with ``locales''; unlike the original
3580 version by Florian Kammller, Isar locales package high-level proof
3581 contexts rather than raw logical ones (e.g. we admit to include
3582 attributes everywhere); operations on locales include merge and
3583 rename; support for implicit arguments (``structures''); simultaneous
3584 type-inference over imports and text; see also HOL/ex/Locales.thy for
3587 * Pure: the following commands have been ``localized'', supporting a
3588 target locale specification "(in name)": 'lemma', 'theorem',
3589 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3590 stored both within the locale and at the theory level (exported and
3591 qualified by the locale name);
3593 * Pure: theory goals may now be specified in ``long'' form, with
3594 ad-hoc contexts consisting of arbitrary locale elements. for example
3595 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3596 definitions may be given, too); the result is a meta-level rule with
3597 the context elements being discharged in the obvious way;
3599 * Pure: new proof command 'using' allows to augment currently used
3600 facts after a goal statement ('using' is syntactically analogous to
3601 'apply', but acts on the goal's facts only); this allows chained facts
3602 to be separated into parts given before and after a claim, as in
3603 ``from a and b have C using d and e <proof>'';
3605 * Pure: renamed "antecedent" case to "rule_context";
3607 * Pure: new 'judgment' command records explicit information about the
3608 object-logic embedding (used by several tools internally); no longer
3609 use hard-wired "Trueprop";
3611 * Pure: added 'corollary' command;
3613 * Pure: fixed 'token_translation' command;
3615 * Pure: removed obsolete 'exported' attribute;
3617 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3618 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3619 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3621 * Pure: method 'atomize' presents local goal premises as object-level
3622 statements (atomic meta-level propositions); setup controlled via
3623 rewrite rules declarations of 'atomize' attribute; example
3624 application: 'induct' method with proper rule statements in improper
3627 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3628 now consider the syntactic context of assumptions, giving a better
3629 chance to get type-inference of the arguments right (this is
3630 especially important for locales);
3632 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3635 * Pure/obtain: the formal conclusion "thesis", being marked as
3636 ``internal'', may no longer be reference directly in the text;
3637 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3640 * Pure: generic 'sym' attribute which declares a rule both as pure
3641 'elim?' and for the 'symmetric' operation;
3643 * Pure: marginal comments ``--'' may now occur just anywhere in the
3644 text; the fixed correlation with particular command syntax has been
3647 * Pure: new method 'rules' is particularly well-suited for proof
3648 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3649 but often produces more compact proof terms with less detours;
3651 * Pure/Provers/classical: simplified integration with pure rule
3652 attributes and methods; the classical "intro?/elim?/dest?"
3653 declarations coincide with the pure ones; the "rule" method no longer
3654 includes classically swapped intros; "intro" and "elim" methods no
3655 longer pick rules from the context; also got rid of ML declarations
3656 AddXIs/AddXEs/AddXDs; all of this has some potential for
3659 * Provers/classical: attribute 'swapped' produces classical inversions
3660 of introduction rules;
3662 * Provers/simplifier: 'simplified' attribute may refer to explicit
3663 rules instead of full simplifier context; 'iff' attribute handles
3666 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3668 * HOL: 'recdef' now fails on unfinished automated proofs, use
3669 "(permissive)" option to recover old behavior;
3671 * HOL: 'inductive' no longer features separate (collective) attributes
3672 for 'intros' (was found too confusing);
3674 * HOL: properly declared induction rules less_induct and
3680 * HOL: moved over to sane numeral syntax; the new policy is as
3683 - 0 and 1 are polymorphic constants, which are defined on any
3684 numeric type (nat, int, real etc.);
3686 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3687 binary representation internally;
3689 - type nat has special constructor Suc, and generally prefers Suc 0
3690 over 1::nat and Suc (Suc 0) over 2::nat;
3692 This change may cause significant problems of INCOMPATIBILITY; here
3693 are some hints on converting existing sources:
3695 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3696 entities, so expressions involving "-" (unary or binary minus) need
3697 to be spaced properly;
3699 - existing occurrences of "1" may need to be constraint "1::nat" or
3700 even replaced by Suc 0; similar for old "2";
3702 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3704 - remove all special provisions on numerals in proofs;
3706 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3707 representation (depends on bin_arith_simps in the default context);
3709 * HOL: symbolic syntax for x^2 (numeral 2);
3711 * HOL: the class of all HOL types is now called "type" rather than
3712 "term"; INCOMPATIBILITY, need to adapt references to this type class
3713 in axclass/classes, instance/arities, and (usually rare) occurrences
3714 in typings (of consts etc.); internally the class is called
3715 "HOL.type", ML programs should refer to HOLogic.typeS;
3717 * HOL/record package improvements:
3718 - new derived operations "fields" to build a partial record section,
3719 "extend" to promote a fixed record to a record scheme, and
3720 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3721 declared as simp by default;
3722 - shared operations ("more", "fields", etc.) now need to be always
3723 qualified) --- potential INCOMPATIBILITY;
3724 - removed "make_scheme" operations (use "make" with "extend") --
3726 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3727 - provides cases/induct rules for use with corresponding Isar
3728 methods (for concrete records, record schemes, concrete more
3729 parts, and schematic more parts -- in that order);
3730 - internal definitions directly based on a light-weight abstract
3731 theory of product types over typedef rather than datatype;
3733 * HOL: generic code generator for generating executable ML code from
3734 specifications; specific support for HOL constructs such as inductive
3735 datatypes and sets, as well as recursive functions; can be invoked
3736 via 'generate_code' theory section;
3738 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3740 * HOL: consolidated and renamed several theories. In particular:
3741 Ord.thy has been absorbed into HOL.thy
3742 String.thy has been absorbed into List.thy
3744 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3745 (beware of argument permutation!);
3747 * HOL: linorder_less_split superseded by linorder_cases;
3749 * HOL/List: "nodups" renamed to "distinct";
3751 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3752 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3753 - Ex_def has changed, now need to use some_eq_ex
3755 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3756 in this (rare) case use:
3758 delSWrapper "split_all_tac"
3759 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3761 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3764 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3765 Isabelle's type classes, ^ on functions and relations has too general
3766 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3767 necessary to attach explicit type constraints;
3769 * HOL/Relation: the prefix name of the infix "O" has been changed from
3770 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3771 renamed accordingly (eg "compI" -> "rel_compI").
3773 * HOL: syntax translations now work properly with numerals and records
3776 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3777 of "lam" -- INCOMPATIBILITY;
3779 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3780 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3781 renamed "Product_Type.unit";
3783 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3785 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3786 the "cases" method);
3788 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3791 * HOL/IMP: updated and converted to new-style theory format; several
3792 parts turned into readable document, with proper Isar proof texts and
3793 some explanations (by Gerwin Klein);
3795 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3797 * HOL-Hyperreal is now a logic image;
3802 * Isar: consts/constdefs supports mixfix syntax for continuous
3805 * Isar: domain package adapted to new-style theory format, e.g. see
3808 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3809 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3810 lift.induct_tac, always use UU instead of Undef;
3812 * HOLCF/IMP: updated and converted to new-style theory;
3817 * Isar: proper integration of logic-specific tools and packages,
3818 including theory commands '(co)inductive', '(co)datatype',
3819 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
3820 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
3822 * theory Main no longer includes AC; for the Axiom of Choice, base
3823 your theory on Main_ZFC;
3825 * the integer library now covers quotients and remainders, with many
3826 laws relating division to addition, multiplication, etc.;
3828 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
3829 typeless version of the formalism;
3831 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
3834 * ZF/Induct: new directory for examples of inductive definitions,
3835 including theory Multiset for multiset orderings; converted to
3836 new-style theory format;
3838 * ZF: many new theorems about lists, ordinals, etc.;
3843 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
3844 variable proof controls level of detail: 0 = no proofs (only oracle
3845 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
3846 also ref manual for further ML interfaces;
3848 * Pure/axclass: removed obsolete ML interface
3849 goal_subclass/goal_arity;
3851 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
3852 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
3853 separate tokens, so expressions involving minus need to be spaced
3856 * Pure/syntax: support non-oriented infixes, using keyword "infix"
3857 rather than "infixl" or "infixr";
3859 * Pure/syntax: concrete syntax for dummy type variables admits genuine
3860 sort constraint specifications in type inference; e.g. "x::_::foo"
3861 ensures that the type of "x" is of sort "foo" (but not necessarily a
3864 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
3865 control output of nested => (types); the default behavior is
3868 * Pure/syntax: builtin parse translation for "_constify" turns valued
3869 tokens into AST constants;
3871 * Pure/syntax: prefer later declarations of translations and print
3872 translation functions; potential INCOMPATIBILITY: need to reverse
3873 multiple declarations for same syntax element constant;
3875 * Pure/show_hyps reset by default (in accordance to existing Isar
3878 * Provers/classical: renamed addaltern to addafter, addSaltern to
3881 * Provers/clasimp: ``iff'' declarations now handle conditional rules
3884 * system: tested support for MacOS X; should be able to get Isabelle +
3885 Proof General to work in a plain Terminal after installing Poly/ML
3886 (e.g. from the Isabelle distribution area) and GNU bash alone
3887 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
3888 support requires further installations, e.g. from
3889 http://fink.sourceforge.net/);
3891 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
3893 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
3894 of 40 MB), cf. ML_OPTIONS;
3896 * system: Proof General keywords specification is now part of the
3897 Isabelle distribution (see etc/isar-keywords.el);
3899 * system: support for persistent Proof General sessions (refrain from
3900 outdating all loaded theories on startup); user may create writable
3901 logic images like this: ``isabelle -q HOL Test'';
3903 * system: smart selection of Isabelle process versus Isabelle
3904 interface, accommodates case-insensitive file systems (e.g. HFS+); may
3905 run both "isabelle" and "Isabelle" even if file names are badly
3906 damaged (executable inspects the case of the first letter of its own
3907 name); added separate "isabelle-process" and "isabelle-interface";
3909 * system: refrain from any attempt at filtering input streams; no
3910 longer support ``8bit'' encoding of old isabelle font, instead proper
3911 iso-latin characters may now be used; the related isatools
3912 "symbolinput" and "nonascii" have disappeared as well;
3914 * system: removed old "xterm" interface (the print modes "xterm" and
3915 "xterm_color" are still available for direct use in a suitable
3920 New in Isabelle99-2 (February 2001)
3921 -----------------------------------
3923 *** Overview of INCOMPATIBILITIES ***
3925 * HOL: please note that theories in the Library and elsewhere often use the
3926 new-style (Isar) format; to refer to their theorems in an ML script you must
3927 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
3929 * HOL: inductive package no longer splits induction rule aggressively,
3930 but only as far as specified by the introductions given; the old
3931 format may be recovered via ML function complete_split_rule or attribute
3932 'split_rule (complete)';
3934 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
3935 gfp_Tarski to gfp_unfold;
3937 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
3939 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
3940 relation); infix "^^" has been renamed "``"; infix "``" has been
3941 renamed "`"; "univalent" has been renamed "single_valued";
3943 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
3946 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
3948 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
3950 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
3951 consequence, it is no longer monotonic wrt. the local goal context
3952 (which is now passed through the inductive cases);
3954 * Document preparation: renamed standard symbols \<ll> to \<lless> and
3955 \<gg> to \<ggreater>;
3958 *** Document preparation ***
3960 * \isabellestyle{NAME} selects version of Isabelle output (currently
3961 available: are "it" for near math-mode best-style output, "sl" for
3962 slanted text style, and "tt" for plain type-writer; if no
3963 \isabellestyle command is given, output is according to slanted
3966 * support sub/super scripts (for single symbols only), input syntax is
3967 like this: "A\<^sup>*" or "A\<^sup>\<star>";
3969 * some more standard symbols; see Appendix A of the system manual for
3970 the complete list of symbols defined in isabellesym.sty;
3972 * improved isabelle style files; more abstract symbol implementation
3973 (should now use \isamath{...} and \isatext{...} in custom symbol
3976 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
3977 state; Note that presentation of goal states does not conform to
3978 actual human-readable proof documents. Please do not include goal
3979 states into document output unless you really know what you are doing!
3981 * proper indentation of antiquoted output with proportional LaTeX
3984 * no_document ML operator temporarily disables LaTeX document
3987 * isatool unsymbolize tunes sources for plain ASCII communication;
3992 * Pure: Isar now suffers initial goal statements to contain unbound
3993 schematic variables (this does not conform to actual readable proof
3994 documents, due to unpredictable outcome and non-compositional proof
3995 checking); users who know what they are doing may use schematic goals
3996 for Prolog-style synthesis of proven results;
3998 * Pure: assumption method (an implicit finishing) now handles actual
4001 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
4002 initial goal, declare "that" only as Pure intro (only for single
4003 steps); the "that" rule assumption may now be involved in implicit
4004 finishing, thus ".." becomes a feasible for trivial obtains;
4006 * Pure: default proof step now includes 'intro_classes'; thus trivial
4007 instance proofs may be performed by "..";
4009 * Pure: ?thesis / ?this / "..." now work for pure meta-level
4012 * Pure: more robust selection of calculational rules;
4014 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4015 rule (as well as the assumption rule);
4017 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4018 lemmas, using the graph browser tool;
4020 * Pure: predict failure of "show" in interactive mode;
4022 * Pure: 'thms_containing' now takes actual terms as arguments;
4024 * HOL: improved method 'induct' --- now handles non-atomic goals
4025 (potential INCOMPATIBILITY); tuned error handling;
4027 * HOL: cases and induct rules now provide explicit hints about the
4028 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4029 any remaining facts are inserted into the goal verbatim;
4031 * HOL: local contexts (aka cases) may now contain term bindings as
4032 well; the 'cases' and 'induct' methods new provide a ?case binding for
4033 the result to be shown in each case;
4035 * HOL: added 'recdef_tc' command;
4037 * isatool convert assists in eliminating legacy ML scripts;
4042 * HOL/Library: a collection of generic theories to be used together
4043 with main HOL; the theory loader path already includes this directory
4044 by default; the following existing theories have been moved here:
4045 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4046 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4048 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4049 modelling and verification task performed in Isabelle/HOL +
4050 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4052 * HOL/Algebra: special summation operator SUM no longer exists, it has
4053 been replaced by setsum; infix 'assoc' now has priority 50 (like
4054 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4055 'domain', this makes the theory consistent with mathematical
4058 * HOL basics: added overloaded operations "inverse" and "divide"
4059 (infix "/"), syntax for generic "abs" operation, generic summation
4062 * HOL/typedef: simplified package, provide more useful rules (see also
4065 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4066 now expressed as a proper nested rule (old-style tactic scripts may
4067 require atomize_strip_tac to cope with non-atomic premises);
4069 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4070 to "split_conv" (old name still available for compatibility);
4072 * HOL: improved concrete syntax for strings (e.g. allows translation
4073 rules with string literals);
4075 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4076 and Fleuriot's mechanization of analysis, including the transcendental
4077 functions for the reals;
4079 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4084 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4085 "lam" is displayed as TWO lambda-symbols
4087 * CTT: theory Main now available, containing everything (that is, Bool
4093 * Pure: the Simplifier has been implemented properly as a derived rule
4094 outside of the actual kernel (at last!); the overall performance
4095 penalty in practical applications is about 50%, while reliability of
4096 the Isabelle inference kernel has been greatly improved;
4098 * print modes "brackets" and "no_brackets" control output of nested =>
4099 (types) and ==> (props); the default behaviour is "brackets";
4101 * Provers: fast_tac (and friends) now handle actual object-logic rules
4102 as assumptions as well;
4104 * system: support Poly/ML 4.0;
4106 * system: isatool install handles KDE version 1 or 2;
4110 New in Isabelle99-1 (October 2000)
4111 ----------------------------------
4113 *** Overview of INCOMPATIBILITIES ***
4115 * HOL: simplification of natural numbers is much changed; to partly
4116 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4117 issue the following ML commands:
4119 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4120 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4122 * HOL: simplification no longer dives into case-expressions; this is
4123 controlled by "t.weak_case_cong" for each datatype t;
4125 * HOL: nat_less_induct renamed to less_induct;
4127 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4128 fixsome to patch .thy and .ML sources automatically;
4130 select_equality -> some_equality
4131 select_eq_Ex -> some_eq_ex
4132 selectI2EX -> someI2_ex
4135 select1_equality -> some1_equality
4136 Eps_sym_eq -> some_sym_eq_trivial
4137 Eps_eq -> some_eq_trivial
4139 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4141 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4144 * HOL: the recursion equations generated by 'recdef' are now called
4145 f.simps instead of f.rules;
4147 * HOL: qed_spec_mp now also handles bounded ALL as well;
4149 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4150 sometimes be needed;
4152 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4154 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4156 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4157 product is now "<*>" instead of "Times"; the lexicographic product is
4158 now "<*lex*>" instead of "**";
4160 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4161 of main HOL, but was unused); better use HOL's datatype package;
4163 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4164 the old syntax may be recovered as follows:
4167 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4168 (infixl "\\<oplus>" 100)
4170 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4172 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4173 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4176 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4177 changed from A/r to A//r;
4179 * ZF: new treatment of arithmetic (nat & int) may break some old
4182 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4183 rulify -> rule_format, elimify -> elim_format, ...);
4185 * Isar/Provers: intro/elim/dest attributes changed; renamed
4186 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4187 should have to change intro!! to intro? only); replaced "delrule" by
4190 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4192 * Provers: strengthened force_tac by using new first_best_tac;
4194 * LaTeX document preparation: several changes of isabelle.sty (see
4198 *** Document preparation ***
4200 * formal comments (text blocks etc.) in new-style theories may now
4201 contain antiquotations of thm/prop/term/typ/text to be presented
4202 according to latex print mode; concrete syntax is like this:
4203 @{term[show_types] "f(x) = a + x"};
4205 * isatool mkdir provides easy setup of Isabelle session directories,
4206 including proper document sources;
4208 * generated LaTeX sources are now deleted after successful run
4209 (isatool document -c); may retain a copy somewhere else via -D option
4212 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4213 style files, achieving self-contained LaTeX sources and simplifying
4216 * old-style theories now produce (crude) LaTeX output as well;
4218 * browser info session directories are now self-contained (may be put
4219 on WWW server seperately); improved graphs of nested sessions; removed
4220 graph for 'all sessions';
4222 * several improvements in isabelle style files; \isabellestyle{it}
4223 produces fake math mode output; \isamarkupheader is now \section by
4224 default; see lib/texinputs/isabelle.sty etc.;
4229 * Isar/Pure: local results and corresponding term bindings are now
4230 subject to Hindley-Milner polymorphism (similar to ML); this
4231 accommodates incremental type-inference very nicely;
4233 * Isar/Pure: new derived language element 'obtain' supports
4234 generalized existence reasoning;
4236 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4237 support accumulation of results, without applying any rules yet;
4238 useful to collect intermediate results without explicit name
4239 references, and for use with transitivity rules with more than 2
4242 * Isar/Pure: scalable support for case-analysis type proofs: new
4243 'case' language element refers to local contexts symbolically, as
4244 produced by certain proof methods; internally, case names are attached
4245 to theorems as "tags";
4247 * Isar/Pure: theory command 'hide' removes declarations from
4248 class/type/const name spaces;
4250 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4251 indicate potential overloading;
4253 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4255 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4256 "{a,b,c}" instead of {a,b,c};
4258 * Isar/Pure now provides its own version of intro/elim/dest
4259 attributes; useful for building new logics, but beware of confusion
4260 with the version in Provers/classical;
4262 * Isar/Pure: the local context of (non-atomic) goals is provided via
4263 case name 'antecedent';
4265 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4266 to the current context is now done automatically);
4268 * Isar/Pure: theory command 'method_setup' provides a simple interface
4269 for definining proof methods in ML;
4271 * Isar/Provers: intro/elim/dest attributes changed; renamed
4272 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4273 most cases, one should have to change intro!! to intro? only);
4274 replaced "delrule" by "rule del";
4276 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4277 'symmetric' attribute (the latter supercedes [RS sym]);
4279 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4280 method modifier); 'simp' method: 'only:' modifier removes loopers as
4281 well (including splits);
4283 * Isar/Provers: Simplifier and Classical methods now support all kind
4284 of modifiers used in the past, including 'cong', 'iff', etc.
4286 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4287 of Simplifier and Classical reasoner);
4289 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4290 now support named cases; major packages (inductive, datatype, primrec,
4291 recdef) support case names and properly name parameters;
4293 * Isar/HOL: new transitivity rules for substitution in inequalities --
4294 monotonicity conditions are extracted to be proven at end of
4297 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4300 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4301 split_if split_if_asm; datatype package provides theorems foo.splits =
4302 foo.split foo.split_asm for each datatype;
4304 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4305 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4306 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4307 use "(cases (simplified))" method in proper proof texts);
4309 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4311 * Isar: names of theorems etc. may be natural numbers as well;
4313 * Isar: 'pr' command: optional arguments for goals_limit and
4314 ProofContext.prems_limit; no longer prints theory contexts, but only
4317 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4318 additional print modes to be specified; e.g. "pr(latex)" will print
4319 proof state according to the Isabelle LaTeX style;
4321 * Isar: improved support for emulating tactic scripts, including proof
4322 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4323 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4324 (for HOL datatypes);
4326 * Isar: simplified (more robust) goal selection of proof methods: 1st
4327 goal, all goals, or explicit goal specifier (tactic emulation); thus
4328 'proof method scripts' have to be in depth-first order;
4330 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4332 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4333 should instead use individual commands for printing items
4334 (print_commands, print_methods etc.);
4336 * Isar: added 'nothing' --- the empty list of theorems;
4341 * HOL/MicroJava: formalization of a fragment of Java, together with a
4342 corresponding virtual machine and a specification of its bytecode
4343 verifier and a lightweight bytecode verifier, including proofs of
4344 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4345 Cornelia Pusch (see also the homepage of project Bali at
4346 http://isabelle.in.tum.de/Bali/);
4348 * HOL/Algebra: new theory of rings and univariate polynomials, by
4351 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4352 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4355 * HOL/Lattice: fundamental concepts of lattice theory and order
4356 structures, including duals, properties of bounds versus algebraic
4357 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4358 Theorem for complete lattices etc.; may also serve as a demonstration
4359 for abstract algebraic reasoning using axiomatic type classes, and
4360 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4362 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4365 * HOL/IMPP: extension of IMP with local variables and mutually
4366 recursive procedures, by David von Oheimb;
4368 * HOL/Lambda: converted into new-style theory and document;
4370 * HOL/ex/Multiquote: example of multiple nested quotations and
4371 anti-quotations -- basically a generalized version of de-Bruijn
4372 representation; very useful in avoiding lifting of operations;
4374 * HOL/record: added general record equality rule to simpset; fixed
4375 select-update simplification procedure to handle extended records as
4376 well; admit "r" as field name;
4378 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4379 other numeric types and also as the identity of groups, rings, etc.;
4381 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4382 Types nat and int belong to this axclass;
4384 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4385 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4386 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4387 two terms #m*u and #n*u are replaced by #(m+n)*u
4388 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4389 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4390 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4392 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4393 powerful prover for predicate logic but knows nothing of clasets; see
4394 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4396 * HOL: new version of "case_tac" subsumes both boolean case split and
4397 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4398 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4400 * HOL: simplification no longer dives into case-expressions: only the
4401 selector expression is simplified, but not the remaining arms; to
4402 enable full simplification of case-expressions for datatype t, you may
4403 remove t.weak_case_cong from the simpset, either globally (Delcongs
4404 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4406 * HOL/recdef: the recursion equations generated by 'recdef' for
4407 function 'f' are now called f.simps instead of f.rules; if all
4408 termination conditions are proved automatically, these simplification
4409 rules are added to the simpset, as in primrec; rules may be named
4410 individually as well, resulting in a separate list of theorems for
4413 * HOL/While is a new theory that provides a while-combinator. It
4414 permits the definition of tail-recursive functions without the
4415 provision of a termination measure. The latter is necessary once the
4416 invariant proof rule for while is applied.
4418 * HOL: new (overloaded) notation for the set of elements below/above
4419 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4421 * HOL: theorems impI, allI, ballI bound as "strip";
4423 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4424 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4425 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4427 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4429 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4430 main HOL, but was unused);
4432 * HOL: fewer consts declared as global (e.g. have to refer to
4433 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4435 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4436 in case of overlap with user translations (e.g. judgements over
4437 tuples); (note that the underlying logical represenation is still
4443 * ZF: simplification automatically cancels common terms in arithmetic
4444 expressions over nat and int;
4446 * ZF: new treatment of nat to minimize type-checking: all operators
4447 coerce their operands to a natural number using the function natify,
4448 making the algebraic laws unconditional;
4450 * ZF: as above, for int: operators coerce their operands to an integer
4451 using the function intify;
4453 * ZF: the integer library now contains many of the usual laws for the
4454 orderings, including $<=, and monotonicity laws for $+ and $*;
4456 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4459 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4460 to the simplifier and classical reasoner simultaneously;
4465 * Provers: blast_tac now handles actual object-logic rules as
4466 assumptions; note that auto_tac uses blast_tac internally as well;
4468 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4469 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4471 * Provers: delrules now handles destruct rules as well (no longer need
4472 explicit make_elim);
4474 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4475 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4476 use instead the strong form,
4477 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4478 in HOL, FOL and ZF the function cla_make_elim will create such rules
4479 from destruct-rules;
4481 * Provers: Simplifier.easy_setup provides a fast path to basic
4482 Simplifier setup for new object-logics;
4484 * Pure: AST translation rules no longer require constant head on LHS;
4486 * Pure: improved name spaces: ambiguous output is qualified; support
4487 for hiding of names;
4489 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4490 XSYMBOL_HOME; no longer need to do manual configuration in most
4493 * system: compression of ML heaps images may now be controlled via -c
4494 option of isabelle and isatool usedir (currently only observed by
4497 * system: isatool installfonts may handle X-Symbol fonts as well (very
4498 useful for remote X11);
4500 * system: provide TAGS file for Isabelle sources;
4502 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4505 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4506 timing flag supersedes proof_timing and Toplevel.trace;
4508 * ML: new combinators |>> and |>>> for incremental transformations
4509 with secondary results (e.g. certain theory extensions):
4511 * ML: PureThy.add_defs gets additional argument to indicate potential
4512 overloading (usually false);
4514 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4519 New in Isabelle99 (October 1999)
4520 --------------------------------
4522 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4524 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4525 are no longer simplified. (This allows the simplifier to unfold recursive
4526 functional programs.) To restore the old behaviour, declare
4528 Delcongs [if_weak_cong];
4530 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4533 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4535 * HOL/datatype: mutual_induct_tac no longer exists --
4536 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4538 * HOL/typedef: fixed type inference for representing set; type
4539 arguments now have to occur explicitly on the rhs as type constraints;
4541 * ZF: The con_defs part of an inductive definition may no longer refer
4542 to constants declared in the same theory;
4544 * HOL, ZF: the function mk_cases, generated by the inductive
4545 definition package, has lost an argument. To simplify its result, it
4546 uses the default simpset instead of a supplied list of theorems.
4548 * HOL/List: the constructors of type list are now Nil and Cons;
4550 * Simplifier: the type of the infix ML functions
4551 setSSolver addSSolver setSolver addSolver
4552 is now simpset * solver -> simpset where `solver' is a new abstract type
4553 for packaging solvers. A solver is created via
4554 mk_solver: string -> (thm list -> int -> tactic) -> solver
4555 where the string argument is only a comment.
4560 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4561 decision procedure for linear arithmetic. Currently it is used for
4562 types `nat', `int', and `real' in HOL (see below); it can, should and
4563 will be instantiated for other types and logics as well.
4565 * The simplifier now accepts rewrite rules with flexible heads, eg
4566 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4567 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4573 * New Isabelle/Isar subsystem provides an alternative to traditional
4574 tactical theorem proving; together with the ProofGeneral/isar user
4575 interface it offers an interactive environment for developing human
4576 readable proof documents (Isar == Intelligible semi-automated
4577 reasoning); for further information see isatool doc isar-ref,
4578 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4580 * improved and simplified presentation of theories: better HTML markup
4581 (including colors), graph views in several sizes; isatool usedir now
4582 provides a proper interface for user theories (via -P option); actual
4583 document preparation based on (PDF)LaTeX is available as well (for
4584 new-style theories only); see isatool doc system for more information;
4586 * native support for Proof General, both for classic Isabelle and
4589 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4590 using the graph browser tool;
4592 * Isabelle manuals now also available as PDF;
4594 * theory loader rewritten from scratch (may not be fully
4595 bug-compatible); old loadpath variable has been replaced by show_path,
4596 add_path, del_path, reset_path functions; new operations such as
4597 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4600 * improved isatool install: option -k creates KDE application icon,
4601 option -p DIR installs standalone binaries;
4603 * added ML_PLATFORM setting (useful for cross-platform installations);
4604 more robust handling of platform specific ML images for SML/NJ;
4606 * the settings environment is now statically scoped, i.e. it is never
4607 created again in sub-processes invoked from isabelle, isatool, or
4610 * path element specification '~~' refers to '$ISABELLE_HOME';
4612 * in locales, the "assumes" and "defines" parts may be omitted if
4615 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4618 * new print_mode "HTML";
4620 * new flag show_tags controls display of tags of theorems (which are
4621 basically just comments that may be attached by some tools);
4623 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4624 mode and goal output format:
4626 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4628 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4630 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4631 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4633 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4635 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4637 * function bind_thms stores lists of theorems (cf. bind_thm);
4639 * new shorthand tactics ftac, eatac, datac, fatac;
4641 * qed (and friends) now accept "" as result name; in that case the
4642 theorem is not stored, but proper checks and presentation of the
4645 * theorem database now also indexes constants "Trueprop", "all",
4646 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4651 ** HOL arithmetic **
4653 * There are now decision procedures for linear arithmetic over nat and
4656 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4657 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4658 are treated as atomic; subformulae not involving type `nat' or `int'
4659 are ignored; quantified subformulae are ignored unless they are
4660 positive universal or negative existential. The tactic has to be
4661 invoked by hand and can be a little bit slow. In particular, the
4662 running time is exponential in the number of occurrences of `min' and
4663 `max', and `-' on `nat'.
4665 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4666 (negated) (in)equalities among the premises and the conclusion into
4667 account (i.e. no compound formulae) and does not know about `min' and
4668 `max', and `-' on `nat'. It is fast and is used automatically by the
4671 NB: At the moment, these decision procedures do not cope with mixed
4672 nat/int formulae where the two parts interact, such as `m < n ==>
4675 * HOL/Numeral provides a generic theory of numerals (encoded
4676 efficiently as bit strings); setup for types nat/int/real is in place;
4677 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4678 int, existing theories and proof scripts may require a few additional
4681 * integer division and remainder can now be performed on constant
4684 * many properties of integer multiplication, division and remainder
4687 * An interface to the Stanford Validity Checker (SVC) is available through the
4688 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4689 are proved automatically. SVC must be installed separately, and its results
4690 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4691 invocation of the underlying oracle). For SVC see
4692 http://verify.stanford.edu/SVC
4694 * IsaMakefile: the HOL-Real target now builds an actual image;
4699 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4700 (in Isabelle/Isar) -- by Gertrud Bauer;
4702 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4703 analysis for assembly languages with subtypes;
4705 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4706 -- avoids syntactic ambiguities and treats state, transition, and
4707 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4708 changed syntax and (many) tactics;
4710 * HOL/inductive: Now also handles more general introduction rules such
4711 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4712 theorems are now maintained within the theory (maintained via the
4715 * HOL/datatype: Now also handles arbitrarily branching datatypes
4716 (using function types) such as
4718 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4720 * HOL/record: record_simproc (part of the default simpset) takes care
4721 of selectors applied to updated records; record_split_tac is no longer
4722 part of the default claset; update_defs may now be removed from the
4723 simpset in many cases; COMPATIBILITY: old behavior achieved by
4725 claset_ref () := claset() addSWrapper record_split_wrapper;
4726 Delsimprocs [record_simproc]
4728 * HOL/typedef: fixed type inference for representing set; type
4729 arguments now have to occur explicitly on the rhs as type constraints;
4731 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4732 names rather than an ML expression;
4734 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4735 supplied later. Program schemes can be defined, such as
4736 "While B C s = (if B s then While B C (C s) else s)"
4737 where the well-founded relation can be chosen after B and C have been given.
4739 * HOL/List: the constructors of type list are now Nil and Cons;
4740 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4741 course, ML tools referring to List.list.op # etc. have to be adapted;
4743 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4744 disabled by default; run isabelle with option -m HOL to get back to
4745 the original Gordon/HOL-style output;
4747 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4748 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4750 * HOL basic syntax simplified (more orthogonal): all variants of
4751 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4752 Eps operator is provided as well: "SOME x. P[x]";
4754 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4756 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4757 thus available for user theories;
4759 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4760 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4763 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4764 several times and then mp;
4769 * the notation <<...>> is now available as a notation for sequences of
4772 * the simplifier is now installed
4774 * the axiom system has been generalized (thanks to Soren Heilmann)
4776 * the classical reasoner now has a default rule database
4781 * new primrec section allows primitive recursive functions to be given
4782 directly (as in HOL) over datatypes and the natural numbers;
4784 * new tactics induct_tac and exhaust_tac for induction (or case
4785 analysis) over datatypes and the natural numbers;
4787 * the datatype declaration of type T now defines the recursor T_rec;
4789 * simplification automatically does freeness reasoning for datatype
4792 * automatic type-inference, with AddTCs command to insert new
4793 type-checking rules;
4795 * datatype introduction rules are now added as Safe Introduction rules
4798 * the syntax "if P then x else y" is now available in addition to
4802 *** Internal programming interfaces ***
4804 * tuned simplifier trace output; new flag debug_simp;
4806 * structures Vartab / Termtab (instances of TableFun) offer efficient
4807 tables indexed by indexname_ord / term_ord (compatible with aconv);
4809 * AxClass.axclass_tac lost the theory argument;
4811 * tuned current_goals_markers semantics: begin / end goal avoids
4812 printing empty lines;
4814 * removed prs and prs_fn hook, which was broken because it did not
4815 include \n in its semantics, forcing writeln to add one
4816 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4817 string -> unit if you really want to output text without newline;
4819 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
4820 plain output, interface builders may have to enable 'isabelle_font'
4821 mode to get Isabelle font glyphs as before;
4823 * refined token_translation interface; INCOMPATIBILITY: output length
4824 now of type real instead of int;
4826 * theory loader actions may be traced via new ThyInfo.add_hook
4827 interface (see src/Pure/Thy/thy_info.ML); example application: keep
4828 your own database of information attached to *whole* theories -- as
4829 opposed to intra-theory data slots offered via TheoryDataFun;
4831 * proper handling of dangling sort hypotheses (at last!);
4832 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
4833 extra sort hypotheses that can be witnessed from the type signature;
4834 the force_strip_shyps flag is gone, any remaining shyps are simply
4835 left in the theorem (with a warning issued by strip_shyps_warning);
4839 New in Isabelle98-1 (October 1998)
4840 ----------------------------------
4842 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4844 * several changes of automated proof tools;
4846 * HOL: major changes to the inductive and datatype packages, including
4847 some minor incompatibilities of theory syntax;
4849 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
4852 * HOL: removed duplicate thms in Arith:
4853 less_imp_add_less should be replaced by trans_less_add1
4854 le_imp_add_le should be replaced by trans_le_add1
4856 * HOL: unary minus is now overloaded (new type constraints may be
4859 * HOL and ZF: unary minus for integers is now #- instead of #~. In
4860 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
4861 now taken as an integer constant.
4863 * Pure: ML function 'theory_of' renamed to 'theory';
4869 1. Asm_full_simp_tac is now more aggressive.
4870 1. It will sometimes reorient premises if that increases their power to
4872 2. It does no longer proceed strictly from left to right but may also
4873 rotate premises to achieve further simplification.
4874 For compatibility reasons there is now Asm_lr_simp_tac which is like the
4875 old Asm_full_simp_tac in that it does not rotate premises.
4876 2. The simplifier now knows a little bit about nat-arithmetic.
4878 * Classical reasoner: wrapper mechanism for the classical reasoner now
4879 allows for selected deletion of wrappers, by introduction of names for
4880 wrapper functionals. This implies that addbefore, addSbefore,
4881 addaltern, and addSaltern now take a pair (name, tactic) as argument,
4882 and that adding two tactics with the same name overwrites the first
4883 one (emitting a warning).
4884 type wrapper = (int -> tactic) -> (int -> tactic)
4885 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
4886 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
4887 delWrapper, delSWrapper: claset * string -> claset
4888 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
4890 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
4891 semantics; addbefore now affects only the unsafe part of step_tac
4892 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
4893 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
4896 * Classical reasoner: setwrapper to setWrapper and compwrapper to
4897 compWrapper; added safe wrapper (and access functions for it);
4899 * HOL/split_all_tac is now much faster and fails if there is nothing
4900 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
4901 and the names of the automatically generated variables have changed.
4902 split_all_tac has moved within claset() from unsafe wrappers to safe
4903 wrappers, which means that !!-bound variables are split much more
4904 aggressively, and safe_tac and clarify_tac now split such variables.
4905 If this splitting is not appropriate, use delSWrapper "split_all_tac".
4906 Note: the same holds for record_split_tac, which does the job of
4907 split_all_tac for record fields.
4909 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
4910 permanently to the default simpset using Addsplits just like
4911 Addsimps. They can be removed via Delsplits just like
4912 Delsimps. Lower-case versions are also available.
4914 * HOL/Simplifier: The rule split_if is now part of the default
4915 simpset. This means that the simplifier will eliminate all occurrences
4916 of if-then-else in the conclusion of a goal. To prevent this, you can
4917 either remove split_if completely from the default simpset by
4918 `Delsplits [split_if]' or remove it in a specific call of the
4919 simplifier using `... delsplits [split_if]'. You can also add/delete
4920 other case splitting rules to/from the default simpset: every datatype
4921 generates suitable rules `split_t_case' and `split_t_case_asm' (where
4922 t is the name of the datatype).
4924 * Classical reasoner / Simplifier combination: new force_tac (and
4925 derivatives Force_tac, force) combines rewriting and classical
4926 reasoning (and whatever other tools) similarly to auto_tac, but is
4927 aimed to solve the given subgoal completely.
4932 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
4933 and `goalw': the theory is no longer needed as an explicit argument -
4934 the current theory context is used; assumptions are no longer returned
4935 at the ML-level unless one of them starts with ==> or !!; it is
4936 recommended to convert to these new commands using isatool fixgoal
4937 (backup your sources first!);
4939 * new top-level commands 'thm' and 'thms' for retrieving theorems from
4940 the current theory context, and 'theory' to lookup stored theories;
4942 * new theory section 'locale' for declaring constants, assumptions and
4943 definitions that have local scope;
4945 * new theory section 'nonterminals' for purely syntactic types;
4947 * new theory section 'setup' for generic ML setup functions
4948 (e.g. package initialization);
4950 * the distribution now includes Isabelle icons: see
4951 lib/logo/isabelle-{small,tiny}.xpm;
4953 * isatool install - install binaries with absolute references to
4956 * isatool logo -- create instances of the Isabelle logo (as EPS);
4958 * print mode 'emacs' reserved for Isamode;
4960 * support multiple print (ast) translations per constant name;
4962 * theorems involving oracles are now printed with a suffixed [!];
4967 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
4969 * HOL/inductive package reorganized and improved: now supports mutual
4975 oddI "n : EVEN ==> Suc n : ODD"
4976 evenI "n : ODD ==> Suc n : EVEN"
4978 new theorem list "elims" contains an elimination rule for each of the
4979 recursive sets; inductive definitions now handle disjunctive premises
4980 correctly (also ZF);
4982 INCOMPATIBILITIES: requires Inductive as an ancestor; component
4983 "mutual_induct" no longer exists - the induction rule is always
4984 contained in "induct";
4987 * HOL/datatype package re-implemented and greatly improved: now
4988 supports mutually recursive datatypes such as
4991 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
4992 | SUM ('a aexp) ('a aexp)
4993 | DIFF ('a aexp) ('a aexp)
4996 'a bexp = LESS ('a aexp) ('a aexp)
4997 | AND ('a bexp) ('a bexp)
4998 | OR ('a bexp) ('a bexp)
5000 as well as indirectly recursive datatypes such as
5003 ('a, 'b) term = Var 'a
5004 | App 'b ((('a, 'b) term) list)
5006 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
5007 induction on mutually / indirectly recursive datatypes.
5009 Primrec equations are now stored in theory and can be accessed via
5010 <function_name>.simps.
5014 - Theories using datatypes must now have theory Datatype as an
5016 - The specific <typename>.induct_tac no longer exists - use the
5017 generic induct_tac instead.
5018 - natE has been renamed to nat.exhaust - use exhaust_tac
5019 instead of res_inst_tac ... natE. Note that the variable
5020 names in nat.exhaust differ from the names in natE, this
5021 may cause some "fragile" proofs to fail.
5022 - The theorems split_<typename>_case and split_<typename>_case_asm
5023 have been renamed to <typename>.split and <typename>.split_asm.
5024 - Since default sorts of type variables are now handled correctly,
5025 some datatype definitions may have to be annotated with explicit
5027 - Primrec definitions no longer require function name and type
5028 of recursive argument.
5030 Consider using isatool fixdatatype to adapt your theories and proof
5031 scripts to the new package (backup your sources first!).
5034 * HOL/record package: considerably improved implementation; now
5035 includes concrete syntax for record types, terms, updates; theorems
5036 for surjective pairing and splitting !!-bound record variables; proof
5037 support is as follows:
5039 1) standard conversions (selectors or updates applied to record
5040 constructor terms) are part of the standard simpset;
5042 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5043 made part of standard simpset and claset via addIffs;
5045 3) a tactic for record field splitting (record_split_tac) is part of
5046 the standard claset (addSWrapper);
5048 To get a better idea about these rules you may retrieve them via
5049 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5050 the name of your record type.
5052 The split tactic 3) conceptually simplifies by the following rule:
5054 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5056 Thus any record variable that is bound by meta-all will automatically
5057 blow up into some record constructor term, consequently the
5058 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5059 solve record problems automatically.
5062 * reorganized the main HOL image: HOL/Integ and String loaded by
5063 default; theory Main includes everything;
5065 * automatic simplification of integer sums and comparisons, using cancellation;
5067 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5069 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5071 * many new identities for unions, intersections, set difference, etc.;
5073 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5074 called split_if, split_split, split_sum_case and split_nat_case (to go
5075 with add/delsplits);
5077 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5078 (?x::unit) = (); this is made part of the default simpset, which COULD
5079 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5080 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5081 unit_abs_eta_conv is added in order to counter the effect of
5082 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5085 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5088 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5089 It and 'sym RS equals0D' are now in the default claset, giving automatic
5090 disjointness reasoning but breaking a few old proofs.
5092 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5093 to 'converse' from 'inverse' (for compatibility with ZF and some
5096 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5097 the well-founded relation;
5099 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5100 Compl A. The "Compl" syntax remains available as input syntax for this
5103 * HOL/Update: new theory of function updates:
5104 f(a:=b) == %x. if x=a then b else f x
5105 may also be iterated as in f(a:=b,c:=d,...);
5107 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5110 - new function list_update written xs[i:=v] that updates the i-th
5111 list position. May also be iterated as in xs[i:=a,j:=b,...].
5112 - new function `upt' written [i..j(] which generates the list
5113 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5114 bound write [i..j], which is a shorthand for [i..j+1(].
5115 - new lexicographic orderings and corresponding wellfoundedness theorems.
5118 - removed 'pred' (predecessor) function;
5119 - generalized some theorems about n-1;
5120 - many new laws about "div" and "mod";
5121 - new laws about greatest common divisors (see theory ex/Primes);
5123 * HOL/Relation: renamed the relational operator r^-1 "converse"
5124 instead of "inverse";
5126 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5127 of the multiset ordering;
5129 * directory HOL/Real: a construction of the reals using Dedekind cuts
5130 (not included by default);
5132 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5134 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5135 programs, i.e. different program variables may have different types.
5137 * calling (stac rew i) now fails if "rew" has no effect on the goal
5138 [previously, this check worked only if the rewrite rule was unconditional]
5139 Now rew can involve either definitions or equalities (either == or =).
5144 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5145 only the theorems proved on ZF.ML;
5147 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5148 It and 'sym RS equals0D' are now in the default claset, giving automatic
5149 disjointness reasoning but breaking a few old proofs.
5151 * ZF/Update: new theory of function updates
5152 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5153 may also be iterated as in f(a:=b,c:=d,...);
5155 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5157 * calling (stac rew i) now fails if "rew" has no effect on the goal
5158 [previously, this check worked only if the rewrite rule was unconditional]
5159 Now rew can involve either definitions or equalities (either == or =).
5161 * case_tac provided for compatibility with HOL
5162 (like the old excluded_middle_tac, but with subgoals swapped)
5165 *** Internal programming interfaces ***
5167 * Pure: several new basic modules made available for general use, see
5168 also src/Pure/README;
5170 * improved the theory data mechanism to support encapsulation (data
5171 kind name replaced by private Object.kind, acting as authorization
5172 key); new type-safe user interface via functor TheoryDataFun; generic
5173 print_data function becomes basically useless;
5175 * removed global_names compatibility flag -- all theory declarations
5176 are qualified by default;
5178 * module Pure/Syntax now offers quote / antiquote translation
5179 functions (useful for Hoare logic etc. with implicit dependencies);
5180 see HOL/ex/Antiquote for an example use;
5182 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5185 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5188 * Display.print_goals function moved to Locale.print_goals;
5190 * standard print function for goals supports current_goals_markers
5191 variable for marking begin of proof, end of proof, start of goal; the
5192 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5193 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5198 New in Isabelle98 (January 1998)
5199 --------------------------------
5201 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5203 * changed lexical syntax of terms / types: dots made part of long
5204 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5206 * simpset (and claset) reference variable replaced by functions
5207 simpset / simpset_ref;
5209 * no longer supports theory aliases (via merge) and non-trivial
5210 implicit merge of thms' signatures;
5212 * most internal names of constants changed due to qualified names;
5214 * changed Pure/Sequence interface (see Pure/seq.ML);
5217 *** General Changes ***
5219 * hierachically structured name spaces (for consts, types, axms, thms
5220 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5221 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5222 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5223 long_names for fully qualified output names; NOTE: ML programs
5224 (special tactics, packages etc.) referring to internal names may have
5225 to be adapted to cope with fully qualified names; in case of severe
5226 backward campatibility problems try setting 'global_names' at compile
5227 time to have enrything declared within a flat name space; one may also
5228 fine tune name declarations in theories via the 'global' and 'local'
5231 * reimplemented the implicit simpset and claset using the new anytype
5232 data filed in signatures; references simpset:simpset ref etc. are
5233 replaced by functions simpset:unit->simpset and
5234 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5235 to patch your ML files accordingly;
5237 * HTML output now includes theory graph data for display with Java
5238 applet or isatool browser; data generated automatically via isatool
5239 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5241 * defs may now be conditional; improved rewrite_goals_tac to handle
5242 conditional equations;
5244 * defs now admits additional type arguments, using TYPE('a) syntax;
5246 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5247 creates a new theory node; implicit merge of thms' signatures is
5248 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5249 transfer:theory->thm->thm in (rare) cases;
5251 * improved handling of draft signatures / theories; draft thms (and
5252 ctyps, cterms) are automatically promoted to real ones;
5254 * slightly changed interfaces for oracles: admit many per theory, named
5255 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5257 * print_goals: optional output of const types (set show_consts and
5260 * improved output of warnings (###) and errors (***);
5262 * subgoal_tac displays a warning if the new subgoal has type variables;
5264 * removed old README and Makefiles;
5266 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5268 * removed obsolete init_pps and init_database;
5270 * deleted the obsolete tactical STATE, which was declared by
5271 fun STATE tacfun st = tacfun st st;
5273 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5274 (which abbreviates $HOME);
5276 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5277 use isatool fixseq to adapt your ML programs (this works for fully
5278 qualified references to the Sequence structure only!);
5280 * use_thy no longer requires writable current directory; it always
5281 reloads .ML *and* .thy file, if either one is out of date;
5284 *** Classical Reasoner ***
5286 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5287 tactics that use classical reasoning to simplify a subgoal without
5288 splitting it into several subgoals;
5290 * Safe_tac: like safe_tac but uses the default claset;
5295 * added simplification meta rules:
5296 (asm_)(full_)simplify: simpset -> thm -> thm;
5298 * simplifier.ML no longer part of Pure -- has to be loaded by object
5301 * added prems argument to simplification procedures;
5303 * HOL, FOL, ZF: added infix function `addsplits':
5304 instead of `<simpset> setloop (split_tac <thms>)'
5305 you can simply write `<simpset> addsplits <thms>'
5310 * TYPE('a) syntax for type reflection terms;
5312 * no longer handles consts with name "" -- declare as 'syntax' instead;
5314 * pretty printer: changed order of mixfix annotation preference (again!);
5316 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5321 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5322 with `addloop' of the simplifier to faciliate case splitting in premises.
5324 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5326 * HOL/Auth: new protocol proofs including some for the Internet
5329 * HOL/Map: new theory of `maps' a la VDM;
5331 * HOL/simplifier: simplification procedures nat_cancel_sums for
5332 cancelling out common nat summands from =, <, <= (in)equalities, or
5333 differences; simplification procedures nat_cancel_factor for
5334 cancelling common factor from =, <, <= (in)equalities over natural
5335 sums; nat_cancel contains both kinds of procedures, it is installed by
5336 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5338 * HOL/simplifier: terms of the form
5339 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5341 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5342 and those of the form
5343 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5345 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5348 Each datatype `t' now comes with a theorem `split_t_case' of the form
5350 P(t_case f1 ... fn x) =
5351 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5353 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5356 and a theorem `split_t_case_asm' of the form
5358 P(t_case f1 ... fn x) =
5359 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5361 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5363 which can be added to a simpset via `addsplits'. The existing theorems
5364 expand_list_case and expand_option_case have been renamed to
5365 split_list_case and split_option_case.
5368 - `pred n' is automatically converted to `n-1'.
5369 Users are strongly encouraged not to use `pred' any longer,
5370 because it will disappear altogether at some point.
5371 - Users are strongly encouraged to write "0 < n" rather than
5372 "n ~= 0". Theorems and proof tools have been modified towards this
5376 the function "set_of_list" has been renamed "set" (and its theorems too);
5377 the function "nth" now takes its arguments in the reverse order and
5378 has acquired the infix notation "!" as in "xs!n".
5380 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5382 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5383 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5385 * HOL/record: extensible records with schematic structural subtyping
5386 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5387 still lacks various theorems and concrete record syntax;
5392 * removed "axioms" and "generated by" sections;
5394 * replaced "ops" section by extended "consts" section, which is capable of
5395 handling the continuous function space "->" directly;
5398 . proves theorems immediately and stores them in the theory,
5399 . creates hierachical name space,
5400 . now uses normal mixfix annotations (instead of cinfix...),
5401 . minor changes to some names and values (for consistency),
5402 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5403 . separator between mutual domain defs: changed "," to "and",
5404 . improved handling of sort constraints; now they have to
5405 appear on the left-hand side of the equations only;
5407 * fixed LAM <x,y,zs>.b syntax;
5409 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5410 adm (%x. P (t x)), where P is chainfinite and t continuous;
5415 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5416 with `addloop' of the simplifier to faciliate case splitting in premises.
5418 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5419 in HOL, they strip ALL and --> from proved theorems;
5423 New in Isabelle94-8 (May 1997)
5424 ------------------------------
5426 *** General Changes ***
5428 * new utilities to build / run / maintain Isabelle etc. (in parts
5429 still somewhat experimental); old Makefiles etc. still functional;
5431 * new 'Isabelle System Manual';
5433 * INSTALL text, together with ./configure and ./build scripts;
5435 * reimplemented type inference for greater efficiency, better error
5436 messages and clean internal interface;
5438 * prlim command for dealing with lots of subgoals (an easier way of
5439 setting goals_limit);
5444 * supports alternative (named) syntax tables (parser and pretty
5445 printer); internal interface is provided by add_modesyntax(_i);
5447 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5448 be used in conjunction with the Isabelle symbol font; uses the
5449 "symbols" syntax table;
5451 * added token_translation interface (may translate name tokens in
5452 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5453 the current print_mode); IMPORTANT: user print translation functions
5454 are responsible for marking newly introduced bounds
5455 (Syntax.mark_boundT);
5457 * token translations for modes "xterm" and "xterm_color" that display
5458 names in bold, underline etc. or colors (which requires a color
5461 * infixes may now be declared with names independent of their syntax;
5463 * added typed_print_translation (like print_translation, but may
5464 access type of constant);
5467 *** Classical Reasoner ***
5469 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5470 some limitations. Blast_tac...
5471 + ignores addss, addbefore, addafter; this restriction is intrinsic
5472 + ignores elimination rules that don't have the correct format
5473 (the conclusion MUST be a formula variable)
5474 + ignores types, which can make HOL proofs fail
5475 + rules must not require higher-order unification, e.g. apply_type in ZF
5476 [message "Function Var's argument not a bound variable" relates to this]
5477 + its proof strategy is more general but can actually be slower
5479 * substitution with equality assumptions no longer permutes other
5482 * minor changes in semantics of addafter (now called addaltern); renamed
5483 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5484 (and access functions for it);
5486 * improved combination of classical reasoner and simplifier:
5487 + functions for handling clasimpsets
5488 + improvement of addss: now the simplifier is called _after_ the
5490 + safe variant of addss called addSss: uses safe simplifications
5491 _during_ the safe steps. It is more complete as it allows multiple
5492 instantiations of unknowns (e.g. with slow_tac).
5496 * added interface for simplification procedures (functions that
5497 produce *proven* rewrite rules on the fly, depending on current
5500 * ordering on terms as parameter (used for ordered rewriting);
5502 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5504 * the solver is now split into a safe and an unsafe part.
5505 This should be invisible for the normal user, except that the
5506 functions setsolver and addsolver have been renamed to setSolver and
5507 addSolver; added safe_asm_full_simp_tac;
5512 * a generic induction tactic `induct_tac' which works for all datatypes and
5513 also for type `nat';
5515 * a generic case distinction tactic `exhaust_tac' which works for all
5516 datatypes and also for type `nat';
5518 * each datatype comes with a function `size';
5520 * patterns in case expressions allow tuple patterns as arguments to
5521 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5523 * primrec now also works with type nat;
5525 * recdef: a new declaration form, allows general recursive functions to be
5526 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5528 * the constant for negation has been renamed from "not" to "Not" to
5529 harmonize with FOL, ZF, LK, etc.;
5531 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5534 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5536 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5537 problems in commutative rings, using axiomatic type classes for + and *;
5539 * more examples in HOL/MiniML and HOL/Auth;
5541 * more default rewrite rules for quantifiers, union/intersection;
5543 * a new constant `arbitrary == @x.False';
5545 * HOLCF/IOA replaces old HOL/IOA;
5547 * HOLCF changes: derived all rules and arities
5548 + axiomatic type classes instead of classes
5549 + typedef instead of faking type definitions
5550 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5551 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5552 + eliminated the types void, one, tr
5553 + use unit lift and bool lift (with translations) instead of one and tr
5554 + eliminated blift from Lift3.thy (use Def instead of blift)
5555 all eliminated rules are derived as theorems --> no visible changes ;
5560 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5561 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5562 as ZF_cs addSIs [equalityI];
5566 New in Isabelle94-7 (November 96)
5567 ---------------------------------
5569 * allowing negative levels (as offsets) in prlev and choplev;
5571 * super-linear speedup for large simplifications;
5573 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5574 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5575 FAIL); can suppress it using the command Delsimps (ex_simps @
5576 all_simps); De Morgan laws are also now included, by default;
5578 * improved printing of ==> : ~:
5580 * new object-logic "Sequents" adds linear logic, while replacing LK
5581 and Modal (thanks to Sara Kalvala);
5583 * HOL/Auth: correctness proofs for authentication protocols;
5585 * HOL: new auto_tac combines rewriting and classical reasoning (many
5586 examples on HOL/Auth);
5588 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5589 the rewriter and classical reasoner simultaneously;
5591 * function uresult no longer returns theorems in "standard" format;
5592 regain previous version by: val uresult = standard o uresult;
5599 * oracles -- these establish an interface between Isabelle and trusted
5600 external reasoners, which may deliver results as theorems;
5602 * proof objects (in particular record all uses of oracles);
5604 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5606 * "constdefs" section in theory files;
5608 * "primrec" section (HOL) no longer requires names;
5610 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5617 * reduced space requirements;
5619 * automatic HTML generation from theories;
5621 * theory files no longer require "..." (quotes) around most types;
5623 * new examples, including two proofs of the Church-Rosser theorem;
5625 * non-curried (1994) version of HOL is no longer distributed;
5632 * greatly reduced space requirements;
5634 * theory files (.thy) no longer require \...\ escapes at line breaks;
5636 * searchable theorem database (see the section "Retrieving theorems" on
5637 page 8 of the Reference Manual);
5639 * new examples, including Grabczewski's monumental case study of the
5642 * The previous version of HOL renamed to Old_HOL;
5644 * The new version of HOL (previously called CHOL) uses a curried syntax
5645 for functions. Application looks like f a b instead of f(a,b);
5647 * Mutually recursive inductive definitions finally work in HOL;
5649 * In ZF, pattern-matching on tuples is now available in all abstractions and
5650 translates to the operator "split";
5657 * new infix operator, addss, allowing the classical reasoner to
5658 perform simplification at each step of its search. Example:
5659 fast_tac (cs addss ss)
5661 * a new logic, CHOL, the same as HOL, but with a curried syntax
5662 for functions. Application looks like f a b instead of f(a,b). Also pairs
5663 look like (a,b) instead of <a,b>;
5665 * PLEASE NOTE: CHOL will eventually replace HOL!
5667 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5668 It translates to the operator "split". A new theory of integers is available;
5670 * In ZF, integer numerals now denote two's-complement binary integers.
5671 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5673 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5674 of the Axiom of Choice;
5681 * Significantly faster resolution;
5683 * the different sections in a .thy file can now be mixed and repeated
5686 * Database of theorems for FOL, HOL and ZF. New
5687 commands including qed, qed_goal and bind_thm store theorems in the database.
5689 * Simple database queries: return a named theorem (get_thm) or all theorems of
5690 a given theory (thms_of), or find out what theory a theorem was proved in
5693 * Bugs fixed in the inductive definition and datatype packages;
5695 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5696 and HOL_dup_cs obsolete;
5698 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5701 * Simpler definition of function space in ZF;
5703 * new results about cardinal and ordinal arithmetic in ZF;
5705 * 'subtype' facility in HOL for introducing new types as subsets of existing
5708 :mode=text:wrap=hard:maxLineLen=72: