New locales for orders and lattices where the equivalence relation is not restricted to equality.
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Generalized Isar history, with support for linear undo, direct state
12 * Recovered hiding of consts, which was accidentally broken in
13 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
14 makes c inaccessible; consider using ``hide (open) const c'' instead.
16 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
22 * dropped "locale (open)". INCOMPATBILITY.
24 * Command 'instance': attached definitions no longer accepted.
25 INCOMPATIBILITY, use proper 'instantiation' target.
27 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
30 *** Document preparation ***
32 * Antiquotation @{lemma} now imitates a regular terminal proof,
33 demanding keyword 'by' and supporting the full method expression
34 syntax just like the Isar command 'by'.
39 * HOL/Orderings: added class "preorder" as superclass of "order". INCOMPATIBILITY:
40 Instantiation proofs for order, linorder etc. slightly changed. Some theorems
41 named order_class.* now named preorder_class.*.
43 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been moved
44 to separate class dvd in Ring_and_Field; a couple of lemmas on dvd has been
45 generalized to class comm_semiring_1. Likewise a bunch of lemmas from Divides
46 has been generalized from nat to class semiring_div. INCOMPATIBILITY.
47 This involves the following theorem renames resulting from duplicate elimination:
49 dvd_def_mod ~> dvd_eq_mod_eq_0
50 zero_dvd_iff ~> dvd_0_left_iff
51 DIVISION_BY_ZERO_DIV ~> div_by_0
52 DIVISION_BY_ZERO_MOD ~> mod_by_0
53 mult_div ~> div_mult_self2_is_id
54 mult_mod ~> mod_mult_self2_is_0
56 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
57 zlcm (for int); carried together from various gcd/lcm developements in
58 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
59 corresponding theorems renamed accordingly. INCOMPATIBILY. To
60 recover tupled syntax, use syntax declarations like:
63 abbreviation gcd where
64 "gcd == (%(a, b). GCD.gcd a b)"
66 GCD.gcd ("gcd '(_, _')")
68 (analogously for lcm, zgcd, zlcm).
70 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
72 * New ML antiquotation @{code}: takes constant as argument, generates
73 corresponding code in background and inserts name of the corresponding
74 resulting ML value/function/datatype constructor binding in place.
75 All occurrences of @{code} with a single ML block are generated
76 simultaneously. Provides a generic and safe interface for
77 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
78 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
79 application. In future you ought refrain from ad-hoc compiling
80 generated SML code on the ML toplevel. Note that (for technical
81 reasons) @{code} cannot refer to constants for which user-defined
82 serializations are set. Refer to the corresponding ML counterpart
83 directly in that cases.
85 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
86 Complex_Main.thy remain as they are.
88 * New image HOL-Plain provides a minimal HOL with the most important
89 tools available (inductive, datatype, primrec, ...). By convention
90 the corresponding theory Plain should be ancestor of every further
91 (library) theory. Some library theories now have ancestor Plain
92 (instead of Main), thus theory Main occasionally has to be imported
95 * Methods "case_tac" and "induct_tac" now refer to the very same rules
96 as the structured Isar versions "cases" and "induct", cf. the
97 corresponding "cases" and "induct" attributes. Mutual induction rules
98 are now presented as a list of individual projections
99 (e.g. foo_bar.inducts for types foo and bar); the old format with
100 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
101 rare situations a different rule is selected --- notably nested tuple
102 elimination instead of former prod.exhaust: use explicit (case_tac t
103 rule: prod.exhaust) here.
105 * Attributes "cases", "induct", "coinduct" support "del" option.
107 * Removed fact "case_split_thm", which duplicates "case_split".
109 * Command 'rep_datatype': instead of theorem names the command now
110 takes a list of terms denoting the constructors of the type to be
111 represented as datatype. The characteristic theorems have to be
112 proven. INCOMPATIBILITY. Also observe that the following theorems
113 have disappeared in favour of existing ones:
115 unit_induct ~> unit.induct
116 prod_induct ~> prod.induct
117 sum_induct ~> sum.induct
118 Suc_Suc_eq ~> nat.inject
119 Suc_not_Zero Zero_not_Suc ~> nat.distinct
121 * Library/Nat_Infinity: added addition, numeral syntax and more
122 instantiations for algebraic structures. Removed some duplicate
123 theorems. Changes in simp rules. INCOMPATIBILITY.
128 * New locales for orders and lattices where the equivalence relation
129 is not restricted to equality. INCOMPATIBILITY: all order and
130 lattice locales use a record structure with field eq for the
133 * New theory of factorial domains.
135 * Units_l_inv and Units_r_inv are now simprules by default.
136 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
137 and/or r_inv will now also require deletion of these lemmas.
139 * Renamed the following theorems. INCOMPATIBILITY.
142 least_carrier ~> least_closed
143 greatest_carrier ~> greatest_closed
144 greatest_Lower_above ~> greatest_Lower_below
149 * Created new image HOL-NSA, containing theories of nonstandard
150 analysis which were previously part of HOL-Complex. Entry point
151 Hyperreal.thy remains valid, but theories formerly using
152 Complex_Main.thy should now use new entry point Hypercomplex.thy.
157 * Proof of Zorn's Lemma for partial orders.
162 * Rules and tactics that read instantiations (read_instantiate,
163 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
164 context, which is required for parsing and type-checking. Moreover,
165 the variables are specified as plain indexnames, not string encodings
166 thereof. INCOMPATIBILITY.
168 * Disposed old type and term read functions (Sign.read_def_typ,
169 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
170 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
171 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
172 Syntax.read_term_global etc.; see also OldGoals.read_term as last
173 resort for legacy applications.
175 * Antiquotations: block-structured compilation context indicated by
176 \<lbrace> ... \<rbrace>; additional antiquotation forms:
178 @{let ?pat = term} - term abbreviation (HO matching)
179 @{note name = fact} - fact abbreviation
180 @{thm fact} - singleton fact (with attributes)
181 @{thms fact} - general fact (with attributes)
182 @{lemma prop by method} - singleton goal
183 @{lemma prop by meth1 meth2} - singleton goal
184 @{lemma prop1 ... propN by method} - general goal
185 @{lemma prop1 ... propN by meth1 meth2} - general goal
186 @{lemma (open) ...} - open derivation
190 New in Isabelle2008 (June 2008)
191 -------------------------------
195 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
196 and updated, with formally checked references as hyperlinks.
198 * Theory loader: use_thy (and similar operations) no longer set the
199 implicit ML context, which was occasionally hard to predict and in
200 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
201 provides a proper context already.
203 * Theory loader: old-style ML proof scripts being *attached* to a thy
204 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
205 'use' within a theory file will do the job.
207 * Name space merge now observes canonical order, i.e. the second space
208 is inserted into the first one, while existing entries in the first
209 space take precedence. INCOMPATIBILITY in rare situations, may try to
212 * Syntax: symbol \<chi> is now considered a letter. Potential
213 INCOMPATIBILITY in identifier syntax etc.
215 * Outer syntax: string tokens no longer admit escaped white space,
216 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
217 white space without escapes.
219 * Outer syntax: string tokens may contain arbitrary character codes
220 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
226 * Context-dependent token translations. Default setup reverts locally
227 fixed variables, and adds hilite markup for undeclared frees.
229 * Unused theorems can be found using the new command 'unused_thms'.
230 There are three ways of invoking it:
233 Only finds unused theorems in the current theory.
235 (2) unused_thms thy_1 ... thy_n -
236 Finds unused theorems in the current theory and all of its ancestors,
237 excluding the theories thy_1 ... thy_n and all of their ancestors.
239 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
240 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
241 their ancestors, excluding the theories thy_1 ... thy_n and all of
244 In order to increase the readability of the list produced by
245 unused_thms, theorems that have been created by a particular instance
246 of a theory command such as 'inductive' or 'function' are considered
247 to belong to the same "group", meaning that if at least one theorem in
248 this group is used, the other theorems in the same group are no longer
249 reported as unused. Moreover, if all theorems in the group are
250 unused, only one theorem in the group is displayed.
252 Note that proof objects have to be switched on in order for
253 unused_thms to work properly (i.e. !proofs must be >= 1, which is
254 usually the case when using Proof General with the default settings).
256 * Authentic naming of facts disallows ad-hoc overwriting of previous
257 theorems within the same name space. INCOMPATIBILITY, need to remove
258 duplicate fact bindings, or even accidental fact duplications. Note
259 that tools may maintain dynamically scoped facts systematically, using
260 PureThy.add_thms_dynamic.
262 * Command 'hide' now allows to hide from "fact" name space as well.
264 * Eliminated destructive theorem database, simpset, claset, and
265 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
266 update of theories within ML code.
268 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
269 INCOMPATIBILITY, object-logics depending on former Pure require
270 additional setup PureThy.old_appl_syntax_setup; object-logics
271 depending on former CPure need to refer to Pure.
273 * Commands 'use' and 'ML' are now purely functional, operating on
274 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
275 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
278 * Command 'setup': discontinued implicit version with ML reference.
280 * Instantiation target allows for simultaneous specification of class
281 instance operations together with an instantiation proof.
282 Type-checking phase allows to refer to class operations uniformly.
283 See src/HOL/Complex/Complex.thy for an Isar example and
284 src/HOL/Library/Eval.thy for an ML example.
286 * Indexing of literal facts: be more serious about including only
287 facts from the visible specification/proof context, but not the
288 background context (locale etc.). Affects `prop` notation and method
289 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
292 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
293 "(open)" option, which used to expose internal bound variables to the
296 * Isar statements: removed obsolete case "rule_context".
297 INCOMPATIBILITY, better use explicit fixes/assumes.
299 * Locale proofs: default proof step now includes 'unfold_locales';
300 hence 'proof' without argument may be used to unfold locale
304 *** Document preparation ***
306 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
307 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
308 obsolete thumbpdf setup (contemporary PDF viewers do this on the
309 spot); renamed link color from "darkblue" to "linkcolor" (default
310 value unchanged, can be redefined via \definecolor); no longer sets
311 "a4paper" option (unnecessary or even intrusive).
313 * Antiquotation @{lemma A method} proves proposition A by the given
314 method (either a method name or a method name plus (optional) method
315 arguments in parentheses) and prints A just like @{prop A}.
320 * New primrec package. Specification syntax conforms in style to
321 definition/function/.... No separate induction rule is provided. The
322 "primrec" command distinguishes old-style and new-style specifications
323 by syntax. The former primrec package is now named OldPrimrecPackage.
324 When adjusting theories, beware: constants stemming from new-style
325 primrec specifications have authentic syntax.
327 * Metis prover is now an order of magnitude faster, and also works
330 * Metis: the maximum number of clauses that can be produced from a
331 theorem is now given by the attribute max_clauses. Theorems that
332 exceed this number are ignored, with a warning printed.
334 * Sledgehammer no longer produces structured proofs by default. To
335 enable, declare [[sledgehammer_full = true]]. Attributes
336 reconstruction_modulus, reconstruction_sorts renamed
337 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
339 * Method "induct_scheme" derives user-specified induction rules
340 from well-founded induction and completeness of patterns. This factors
341 out some operations that are done internally by the function package
342 and makes them available separately. See
343 src/HOL/ex/Induction_Scheme.thy for examples.
345 * More flexible generation of measure functions for termination
346 proofs: Measure functions can be declared by proving a rule of the
347 form "is_measure f" and giving it the [measure_function] attribute.
348 The "is_measure" predicate is logically meaningless (always true), and
349 just guides the heuristic. To find suitable measure functions, the
350 termination prover sets up the goal "is_measure ?f" of the appropriate
351 type and generates all solutions by prolog-style backwards proof using
354 This setup also deals with rules like
356 "is_measure f ==> is_measure (list_size f)"
358 which accommodates nested datatypes that recurse through lists.
359 Similar rules are predeclared for products and option types.
361 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
365 - Definitions of overloaded constants on sets have to be replaced by
366 definitions on => and bool.
368 - Some definitions of overloaded operators on sets can now be proved
369 using the definitions of the operators on => and bool. Therefore,
370 the following theorems have been renamed:
372 subset_def -> subset_eq
373 psubset_def -> psubset_eq
374 set_diff_def -> set_diff_eq
375 Compl_def -> Compl_eq
376 Sup_set_def -> Sup_set_eq
377 Inf_set_def -> Inf_set_eq
378 sup_set_def -> sup_set_eq
379 inf_set_def -> inf_set_eq
381 - Due to the incompleteness of the HO unification algorithm, some
382 rules such as subst may require manual instantiation, if some of
383 the unknowns in the rule is a set.
385 - Higher order unification and forward proofs:
388 have "P (S::'a set)" <...>
389 then have "EX S. P S" ..
391 no longer works (due to the incompleteness of the HO unification
392 algorithm) and must be replaced by the pattern
399 - Calculational reasoning with subst (or similar rules):
402 have "P (S::'a set)" <...>
403 also have "S = T" <...>
406 no longer works (for similar reasons as the previous example) and
407 must be replaced by something like
409 have "P (S::'a set)" <...>
410 moreover have "S = T" <...>
411 ultimately have "P T" by simp
413 - Tactics or packages written in ML code:
414 Code performing pattern matching on types via
416 Type ("set", [T]) => ...
418 must be rewritten. Moreover, functions like strip_type or
419 binder_types no longer return the right value when applied to a
422 T1 => ... => Tn => U => bool
426 T1 => ... => Tn => U set
428 * Merged theories Wellfounded_Recursion, Accessible_Part and
429 Wellfounded_Relations to theory Wellfounded.
431 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
433 * Class finite no longer treats UNIV as class parameter. Use class
434 enum from theory Library/Enum instead to achieve a similar effect.
437 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
438 and "Cons". INCOMPATIBILITY.
440 * HOL (and FOL): renamed variables in rules imp_elim and swap.
441 Potential INCOMPATIBILITY.
443 * Theory Product_Type: duplicated lemmas split_Pair_apply and
444 injective_fst_snd removed, use split_eta and prod_eqI instead.
445 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
447 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
448 the same name in theory Orderings:
458 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
459 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
460 and different variable names.
462 * Library/Option_ord.thy: Canonical order on option type.
464 * Library/RBT.thy: Red-black trees, an efficient implementation of
467 * Library/Countable.thy: Type class for countable types.
469 * Theory Int: The representation of numerals has changed. The infix
470 operator BIT and the bit datatype with constructors B0 and B1 have
471 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
472 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
473 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
476 * Theory Nat: definition of <= and < on natural numbers no longer
477 depend on well-founded relations. INCOMPATIBILITY. Definitions
478 le_def and less_def have disappeared. Consider lemmas not_less
479 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
481 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
482 (whose purpose mainly is for various fold_set functionals) have been
483 abandoned in favor of the existing algebraic classes
484 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
485 lower_semilattice (resp. upper_semilattice) and linorder.
488 * Theory Transitive_Closure: induct and cases rules now declare proper
489 case_names ("base" and "step"). INCOMPATIBILITY.
491 * Theorem Inductive.lfp_ordinal_induct generalized to complete
492 lattices. The form set-specific version is available as
493 Inductive.lfp_ordinal_induct_set.
495 * Renamed theorems "power.simps" to "power_int.simps".
498 * Class semiring_div provides basic abstract properties of semirings
499 with division and modulo operations. Subsumes former class dvd_mod.
501 * Merged theories IntDef, Numeral and IntArith into unified theory
502 Int. INCOMPATIBILITY.
504 * Theory Library/Code_Index: type "index" now represents natural
505 numbers rather than integers. INCOMPATIBILITY.
507 * New class "uminus" with operation "uminus" (split of from class
508 "minus" which now only has operation "minus", binary).
511 * Constants "card", "internal_split", "option_map" now with authentic
512 syntax. INCOMPATIBILITY.
514 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
515 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
516 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
517 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
518 Sup_set_def, le_def, less_def, option_map_def now with object
519 equality. INCOMPATIBILITY.
521 * Records. Removed K_record, and replaced it by pure lambda term
522 %x. c. The simplifier setup is now more robust against eta expansion.
523 INCOMPATIBILITY: in cases explicitly referring to K_record.
525 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
527 * Library/ListVector: new theory of arithmetic vector operations.
529 * Library/Order_Relation: new theory of various orderings as sets of
530 pairs. Defines preorders, partial orders, linear orders and
531 well-orders on sets and on types.
536 * Renamed some theories to allow to loading both ZF and HOL in the
539 Datatype -> Datatype_ZF
540 Inductive -> Inductive_ZF
547 INCOMPATIBILITY: ZF theories that import individual theories below
548 Main might need to be adapted. Regular theory Main is still
549 available, as trivial extension of Main_ZF.
554 * ML within Isar: antiquotation @{const name} or @{const
555 name(typargs)} produces statically-checked Const term.
557 * Functor NamedThmsFun: data is available to the user as dynamic fact
558 (of the same name). Removed obsolete print command.
560 * Removed obsolete "use_legacy_bindings" function.
562 * The ``print mode'' is now a thread-local value derived from a global
563 template (the former print_mode reference), thus access becomes
564 non-critical. The global print_mode reference is for session
565 management only; user-code should use print_mode_value,
566 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
568 * Functions system/system_out provide a robust way to invoke external
569 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
570 Do not use OS.Process.system etc. from the basis library!
575 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
576 in accordance with Proof General 3.7, which prefers GNU emacs.
578 * isatool tty runs Isabelle process with plain tty interaction;
579 optional line editor may be specified via ISABELLE_LINE_EDITOR
580 setting, the default settings attempt to locate "ledit" and "rlwrap".
582 * isatool browser now works with Cygwin as well, using general
583 "javapath" function defined in Isabelle process environment.
585 * YXML notation provides a simple and efficient alternative to
586 standard XML transfer syntax. See src/Pure/General/yxml.ML and
587 isatool yxml as described in the Isabelle system manual.
589 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
590 provides general wrapper for managing an Isabelle process in a robust
591 fashion, with ``cooked'' output from stdin/stderr.
593 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
594 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
596 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
597 way of changing the user's settings is via
598 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
601 * Multithreading.max_threads := 0 refers to the number of actual CPU
602 cores of the underlying machine, which is a good starting point for
603 optimal performance tuning. The corresponding usedir option -M allows
604 "max" as an alias for "0". WARNING: does not work on certain versions
605 of Mac OS (with Poly/ML 5.1).
607 * isabelle-process: non-ML sessions are run with "nice", to reduce the
608 adverse effect of Isabelle flooding interactive front-ends (notably
609 ProofGeneral / XEmacs).
613 New in Isabelle2007 (November 2007)
614 -----------------------------------
618 * More uniform information about legacy features, notably a
619 warning/error of "Legacy feature: ...", depending on the state of the
620 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
621 legacy features will disappear eventually.
623 * Theory syntax: the header format ``theory A = B + C:'' has been
624 discontinued in favour of ``theory A imports B C begin''. Use isatool
625 fixheaders to convert existing theory files. INCOMPATIBILITY.
627 * Theory syntax: the old non-Isar theory file format has been
628 discontinued altogether. Note that ML proof scripts may still be used
629 with Isar theories; migration is usually quite simple with the ML
630 function use_legacy_bindings. INCOMPATIBILITY.
632 * Theory syntax: some popular names (e.g. 'class', 'declaration',
633 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
636 * Theory loader: be more serious about observing the static theory
637 header specifications (including optional directories), but not the
638 accidental file locations of previously successful loads. The strict
639 update policy of former update_thy is now already performed by
640 use_thy, so the former has been removed; use_thys updates several
641 theories simultaneously, just as 'imports' within a theory header
642 specification, but without merging the results. Potential
643 INCOMPATIBILITY: may need to refine theory headers and commands
644 ROOT.ML which depend on load order.
646 * Theory loader: optional support for content-based file
647 identification, instead of the traditional scheme of full physical
648 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
649 (cf. the system manual). The new scheme allows to work with
650 non-finished theories in persistent session images, such that source
651 files may be moved later on without requiring reloads.
653 * Theory loader: old-style ML proof scripts being *attached* to a thy
654 file (with the same base name as the theory) are considered a legacy
655 feature, which will disappear eventually. Even now, the theory loader
656 no longer maintains dependencies on such files.
658 * Syntax: the scope for resolving ambiguities via type-inference is
659 now limited to individual terms, instead of whole simultaneous
660 specifications as before. This greatly reduces the complexity of the
661 syntax module and improves flexibility by separating parsing and
662 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
663 'fixes' etc.) are required in rare situations.
665 * Syntax: constants introduced by new-style packages ('definition',
666 'abbreviation' etc.) are passed through the syntax module in
667 ``authentic mode''. This means that associated mixfix annotations
668 really stick to such constants, independently of potential name space
669 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
670 trees are represented slightly differently, may need to adapt syntax
671 translations accordingly. Use CONST marker in 'translations' and
672 @{const_syntax} antiquotation in 'parse_translation' etc.
674 * Legacy goal package: reduced interface to the bare minimum required
675 to keep existing proof scripts running. Most other user-level
676 functions are now part of the OldGoals structure, which is *not* open
677 by default (consider isatool expandshort before open OldGoals).
678 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
679 these tend to cause confusion about the actual goal (!) context being
680 used here, which is not necessarily the same as the_context().
682 * Command 'find_theorems': supports "*" wild-card in "name:"
683 criterion; "with_dups" option. Certain ProofGeneral versions might
684 support a specific search form (see ProofGeneral/CHANGES).
686 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
687 by default, which means that "prems" (and also "fixed variables") are
688 suppressed from proof state output. Note that the ProofGeneral
689 settings mechanism allows to change and save options persistently, but
690 older versions of Isabelle will fail to start up if a negative prems
693 * Local theory targets may be specified by non-nested blocks of
694 ``context/locale/class ... begin'' followed by ``end''. The body may
695 contain definitions, theorems etc., including any derived mechanism
696 that has been implemented on top of these primitives. This concept
697 generalizes the existing ``theorem (in ...)'' towards more versatility
700 * Proof General interface: proper undo of final 'end' command;
701 discontinued Isabelle/classic mode (ML proof scripts).
704 *** Document preparation ***
706 * Added antiquotation @{theory name} which prints the given name,
707 after checking that it refers to a valid ancestor theory in the
710 * Added antiquotations @{ML_type text} and @{ML_struct text} which
711 check the given source text as ML type/structure, printing verbatim.
713 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
714 "c args == rhs" given in the current context. (Any number of
715 arguments may be given on the LHS.)
720 * The 'class' package offers a combination of axclass and locale to
721 achieve Haskell-like type classes in Isabelle. Definitions and
722 theorems within a class context produce both relative results (with
723 implicit parameters according to the locale context), and polymorphic
724 constants with qualified polymorphism (according to the class
725 context). Within the body context of a 'class' target, a separate
726 syntax layer ("user space type system") takes care of converting
727 between global polymorphic consts and internal locale representation.
728 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
729 "isatool doc classes" provides a tutorial.
731 * Generic code generator framework allows to generate executable
732 code for ML and Haskell (including Isabelle classes). A short usage
735 internal compilation:
736 export_code <list of constants (term syntax)> in SML
737 writing SML code to a file:
738 export_code <list of constants (term syntax)> in SML <filename>
739 writing OCaml code to a file:
740 export_code <list of constants (term syntax)> in OCaml <filename>
741 writing Haskell code to a bunch of files:
742 export_code <list of constants (term syntax)> in Haskell <filename>
744 evaluating closed propositions to True/False using code generation:
747 Reasonable default setup of framework in HOL.
749 Theorem attributs for selecting and transforming function equations theorems:
751 [code fun]: select a theorem as function equation for a specific constant
752 [code fun del]: deselect a theorem as function equation for a specific constant
753 [code inline]: select an equation theorem for unfolding (inlining) in place
754 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
756 User-defined serializations (target in {SML, OCaml, Haskell}):
758 code_const <and-list of constants (term syntax)>
759 {(target) <and-list of const target syntax>}+
761 code_type <and-list of type constructors>
762 {(target) <and-list of type target syntax>}+
764 code_instance <and-list of instances>
766 where instance ::= <type constructor> :: <class>
768 code_class <and_list of classes>
769 {(target) <and-list of class target syntax>}+
770 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
772 code_instance and code_class only are effective to target Haskell.
774 For example usage see src/HOL/ex/Codegenerator.thy and
775 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
776 generation from Isabelle/HOL theories is available via "isatool doc
779 * Code generator: consts in 'consts_code' Isar commands are now
780 referred to by usual term syntax (including optional type
783 * Command 'no_translations' removes translation rules from theory
786 * Overloaded definitions are now actually checked for acyclic
787 dependencies. The overloading scheme is slightly more general than
788 that of Haskell98, although Isabelle does not demand an exact
789 correspondence to type class and instance declarations.
790 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
791 exotic versions of overloading -- at the discretion of the user!
793 Polymorphic constants are represented via type arguments, i.e. the
794 instantiation that matches an instance against the most general
795 declaration given in the signature. For example, with the declaration
796 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
797 as c(nat). Overloading is essentially simultaneous structural
798 recursion over such type arguments. Incomplete specification patterns
799 impose global constraints on all occurrences, e.g. c('a * 'a) on the
800 LHS means that more general c('a * 'b) will be disallowed on any RHS.
801 Command 'print_theory' outputs the normalized system of recursive
802 equations, see section "definitions".
804 * Configuration options are maintained within the theory or proof
805 context (with name and type bool/int/string), providing a very simple
806 interface to a poor-man's version of general context data. Tools may
807 declare options in ML (e.g. using Attrib.config_int) and then refer to
808 these values using Config.get etc. Users may change options via an
809 associated attribute of the same name. This form of context
810 declaration works particularly well with commands 'declare' or
811 'using', for example ``declare [[foo = 42]]''. Thus it has become
812 very easy to avoid global references, which would not observe Isar
813 toplevel undo/redo and fail to work with multithreading.
815 Various global ML references of Pure and HOL have been turned into
816 configuration options:
818 Unify.search_bound unify_search_bound
819 Unify.trace_bound unify_trace_bound
820 Unify.trace_simp unify_trace_simp
821 Unify.trace_types unify_trace_types
822 Simplifier.simp_depth_limit simp_depth_limit
823 Blast.depth_limit blast_depth_limit
824 DatatypeProp.dtK datatype_distinctness_limit
825 fast_arith_neq_limit fast_arith_neq_limit
826 fast_arith_split_limit fast_arith_split_limit
828 * Named collections of theorems may be easily installed as context
829 data using the functor NamedThmsFun (see also
830 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
831 attributes; there is also a toplevel print command. This facility is
832 just a common case of general context data, which is the preferred way
833 for anything more complex than just a list of facts in canonical
836 * Isar: command 'declaration' augments a local theory by generic
837 declaration functions written in ML. This enables arbitrary content
838 being added to the context, depending on a morphism that tells the
839 difference of the original declaration context wrt. the application
840 context encountered later on.
842 * Isar: proper interfaces for simplification procedures. Command
843 'simproc_setup' declares named simprocs (with match patterns, and body
844 text in ML). Attribute "simproc" adds/deletes simprocs in the current
845 context. ML antiquotation @{simproc name} retrieves named simprocs.
847 * Isar: an extra pair of brackets around attribute declarations
848 abbreviates a theorem reference involving an internal dummy fact,
849 which will be ignored later --- only the effect of the attribute on
850 the background context will persist. This form of in-place
851 declarations is particularly useful with commands like 'declare' and
852 'using', for example ``have A using [[simproc a]] by simp''.
854 * Isar: method "assumption" (and implicit closing of subproofs) now
855 takes simple non-atomic goal assumptions into account: after applying
856 an assumption as a rule the resulting subgoals are solved by atomic
857 assumption steps. This is particularly useful to finish 'obtain'
858 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
859 without referring to the original premise "!!x. P x ==> thesis" in the
860 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
863 * Isar: implicit use of prems from the Isar proof context is
864 considered a legacy feature. Common applications like ``have A .''
865 may be replaced by ``have A by fact'' or ``note `A`''. In general,
866 referencing facts explicitly here improves readability and
867 maintainability of proof texts.
869 * Isar: improper proof element 'guess' is like 'obtain', but derives
870 the obtained context from the course of reasoning! For example:
872 assume "EX x y. A x & B y" -- "any previous fact"
873 then guess x and y by clarify
875 This technique is potentially adventurous, depending on the facts and
876 proof tools being involved here.
878 * Isar: known facts from the proof context may be specified as literal
879 propositions, using ASCII back-quote syntax. This works wherever
880 named facts used to be allowed so far, in proof commands, proof
881 methods, attributes etc. Literal facts are retrieved from the context
882 according to unification of type and term parameters. For example,
883 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
884 theorems in the current context, then these are valid literal facts:
885 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
887 There is also a proof method "fact" which does the same composition
888 for explicit goal states, e.g. the following proof texts coincide with
889 certain special cases of literal facts:
891 have "A" by fact == note `A`
892 have "A ==> B" by fact == note `A ==> B`
893 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
894 have "P a ==> Q a" by fact == note `P a ==> Q a`
896 * Isar: ":" (colon) is no longer a symbolic identifier character in
897 outer syntax. Thus symbolic identifiers may be used without
898 additional white space in declarations like this: ``assume *: A''.
900 * Isar: 'print_facts' prints all local facts of the current context,
901 both named and unnamed ones.
903 * Isar: 'def' now admits simultaneous definitions, e.g.:
905 def x == "t" and y == "u"
907 * Isar: added command 'unfolding', which is structurally similar to
908 'using', but affects both the goal state and facts by unfolding given
909 rewrite rules. Thus many occurrences of the 'unfold' method or
910 'unfolded' attribute may be replaced by first-class proof text.
912 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
913 and command 'unfolding' now all support object-level equalities
914 (potentially conditional). The underlying notion of rewrite rule is
915 analogous to the 'rule_format' attribute, but *not* that of the
916 Simplifier (which is usually more generous).
918 * Isar: the new attribute [rotated n] (default n = 1) rotates the
919 premises of a theorem by n. Useful in conjunction with drule.
921 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
922 method expression within a sandbox consisting of the first N
923 sub-goals, which need to exist. For example, ``simp_all [3]''
924 simplifies the first three sub-goals, while (rule foo, simp_all)[]
925 simplifies all new goals that emerge from applying rule foo to the
926 originally first one.
928 * Isar: schematic goals are no longer restricted to higher-order
929 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
932 * Isar: the conclusion of a long theorem statement is now either
933 'shows' (a simultaneous conjunction, as before), or 'obtains'
934 (essentially a disjunction of cases with local parameters and
935 assumptions). The latter allows to express general elimination rules
936 adequately; in this notation common elimination rules look like this:
938 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
940 obtains x where "P x"
942 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
946 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
952 The subsequent classical rules even refer to the formal "thesis"
955 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
958 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
959 obtains "thesis ==> something"
961 The actual proof of an 'obtains' statement is analogous to that of the
962 Isar proof element 'obtain', only that there may be several cases.
963 Optional case names may be specified in parentheses; these will be
964 available both in the present proof and as annotations in the
965 resulting rule, for later use with the 'cases' method (cf. attribute
968 * Isar: the assumptions of a long theorem statement are available as
969 "assms" fact in the proof context. This is more appropriate than the
970 (historical) "prems", which refers to all assumptions of the current
971 context, including those from the target locale, proof body etc.
973 * Isar: 'print_statement' prints theorems from the current theory or
974 proof context in long statement form, according to the syntax of a
977 * Isar: 'obtain' takes an optional case name for the local context
978 introduction rule (default "that").
980 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
981 explicit (is "_ ==> ?foo") in the rare cases where this still happens
984 * Pure: syntax "CONST name" produces a fully internalized constant
985 according to the current context. This is particularly useful for
986 syntax translations that should refer to internal constant
987 representations independently of name spaces.
989 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
990 instead of "FOO ". This allows multiple binder declarations to coexist
991 in the same context. INCOMPATIBILITY.
993 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
994 primitive that also works in a locale context (both for constants and
995 fixed variables). Type declaration and internal syntactic representation
996 of given constants retrieved from the context. Likewise, the
997 'no_notation' command allows to remove given syntax annotations from the
1000 * Isar/locales: new derived specification elements 'axiomatization',
1001 'definition', 'abbreviation', which support type-inference, admit
1002 object-level specifications (equality, equivalence). See also the
1003 isar-ref manual. Examples:
1006 eq (infix "===" 50) where
1007 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1009 definition "f x y = x + y + 1"
1010 definition g where "g x = f x x"
1013 neq (infix "=!=" 50) where
1014 "x =!= y == ~ (x === y)"
1016 These specifications may be also used in a locale context. Then the
1017 constants being introduced depend on certain fixed parameters, and the
1018 constant name is qualified by the locale base name. An internal
1019 abbreviation takes care for convenient input and output, making the
1020 parameters implicit and using the original short name. See also
1021 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1022 entities from a monomorphic theory.
1024 Presently, abbreviations are only available 'in' a target locale, but
1025 not inherited by general import expressions. Also note that
1026 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1027 'translations' in common applications. The "no_abbrevs" print mode
1028 prevents folding of abbreviations in term output.
1030 Concrete syntax is attached to specified constants in internal form,
1031 independently of name spaces. The parse tree representation is
1032 slightly different -- use 'notation' instead of raw 'syntax', and
1033 'translations' with explicit "CONST" markup to accommodate this.
1035 * Pure/Isar: unified syntax for new-style specification mechanisms
1036 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1037 full type inference and dummy patterns ("_"). For example:
1039 definition "K x _ = x"
1041 inductive conj for A B
1042 where "A ==> B ==> conj A B"
1044 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1045 the current context. Print mode "no_abbrevs" prevents inversion of
1046 abbreviations on output.
1048 * Isar/locales: improved parameter handling: use of locales "var" and
1049 "struct" no longer necessary; - parameter renamings are no longer
1050 required to be injective. For example, this allows to define
1051 endomorphisms as locale endom = homom mult mult h.
1053 * Isar/locales: changed the way locales with predicates are defined.
1054 Instead of accumulating the specification, the imported expression is
1055 now an interpretation. INCOMPATIBILITY: different normal form of
1056 locale expressions. In particular, in interpretations of locales with
1057 predicates, goals repesenting already interpreted fragments are not
1058 removed automatically. Use methods `intro_locales' and
1059 `unfold_locales'; see below.
1061 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1062 provide backward reasoning on locales predicates. The methods are
1063 aware of interpretations and discharge corresponding goals.
1064 `intro_locales' is less aggressive then `unfold_locales' and does not
1065 unfold predicates to assumptions.
1067 * Isar/locales: the order in which locale fragments are accumulated
1068 has changed. This enables to override declarations from fragments due
1069 to interpretations -- for example, unwanted simp rules.
1071 * Isar/locales: interpretation in theories and proof contexts has been
1072 extended. One may now specify (and prove) equations, which are
1073 unfolded in interpreted theorems. This is useful for replacing
1074 defined concepts (constants depending on locale parameters) by
1075 concepts already existing in the target context. Example:
1077 interpretation partial_order ["op <= :: [int, int] => bool"]
1078 where "partial_order.less (op <=) (x::int) y = (x < y)"
1080 Typically, the constant `partial_order.less' is created by a
1081 definition specification element in the context of locale
1084 * Method "induct": improved internal context management to support
1085 local fixes and defines on-the-fly. Thus explicit meta-level
1086 connectives !! and ==> are rarely required anymore in inductive goals
1087 (using object-logic connectives for this purpose has been long
1088 obsolete anyway). Common proof patterns are explained in
1089 src/HOL/Induct/Common_Patterns.thy, see also
1090 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1093 * Method "induct": improved handling of simultaneous goals. Instead of
1094 introducing object-level conjunction, the statement is now split into
1095 several conclusions, while the corresponding symbolic cases are nested
1096 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1097 see src/HOL/Induct/Common_Patterns.thy, for example.
1099 * Method "induct": mutual induction rules are now specified as a list
1100 of rule sharing the same induction cases. HOL packages usually provide
1101 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1102 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1103 mutual induction rules differently, i.e. like this:
1105 (induct rule: foo_bar.inducts)
1106 (induct set: foo bar)
1107 (induct pred: foo bar)
1108 (induct type: foo bar)
1110 The ML function ProjectRule.projections turns old-style rules into the
1113 * Method "coinduct": dual of induction, see
1114 src/HOL/Library/Coinductive_List.thy for various examples.
1116 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1117 considered a legacy feature.
1119 * Attribute "symmetric" produces result with standardized schematic
1120 variables (index 0). Potential INCOMPATIBILITY.
1122 * Simplifier: by default the simplifier trace only shows top level
1123 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1124 default. Thus there is less danger of being flooded by the trace. The
1125 trace indicates where parts have been suppressed.
1127 * Provers/classical: removed obsolete classical version of elim_format
1128 attribute; classical elim/dest rules are now treated uniformly when
1129 manipulating the claset.
1131 * Provers/classical: stricter checks to ensure that supplied intro,
1132 dest and elim rules are well-formed; dest and elim rules must have at
1135 * Provers/classical: attributes dest/elim/intro take an optional
1136 weight argument for the rule (just as the Pure versions). Weights are
1137 ignored by automated tools, but determine the search order of single
1140 * Syntax: input syntax now supports dummy variable binding "%_. b",
1141 where the body does not mention the bound variable. Note that dummy
1142 patterns implicitly depend on their context of bounds, which makes
1143 "{_. _}" match any set comprehension as expected. Potential
1144 INCOMPATIBILITY -- parse translations need to cope with syntactic
1145 constant "_idtdummy" in the binding position.
1147 * Syntax: removed obsolete syntactic constant "_K" and its associated
1148 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1149 for example "A -> B" => "Pi A (%_. B)".
1151 * Pure: 'class_deps' command visualizes the subclass relation, using
1152 the graph browser tool.
1154 * Pure: 'print_theory' now suppresses certain internal declarations by
1155 default; use '!' option for full details.
1160 * Method "metis" proves goals by applying the Metis general-purpose
1161 resolution prover (see also http://gilith.com/software/metis/).
1162 Examples are in the directory MetisExamples. WARNING: the
1163 Isabelle/HOL-Metis integration does not yet work properly with
1166 * Command 'sledgehammer' invokes external automatic theorem provers as
1167 background processes. It generates calls to the "metis" method if
1168 successful. These can be pasted into the proof. Users do not have to
1169 wait for the automatic provers to return. WARNING: does not really
1170 work with multi-threading.
1172 * New "auto_quickcheck" feature tests outermost goal statements for
1173 potential counter-examples. Controlled by ML references
1174 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1175 5000 milliseconds). Fails silently if statements is outside of
1176 executable fragment, or any other codgenerator problem occurs.
1178 * New constant "undefined" with axiom "undefined x = undefined".
1180 * Added class "HOL.eq", allowing for code generation with polymorphic
1183 * Some renaming of class constants due to canonical name prefixing in
1184 the new 'class' package:
1186 HOL.abs ~> HOL.abs_class.abs
1187 HOL.divide ~> HOL.divide_class.divide
1188 0 ~> HOL.zero_class.zero
1189 1 ~> HOL.one_class.one
1190 op + ~> HOL.plus_class.plus
1191 op - ~> HOL.minus_class.minus
1192 uminus ~> HOL.minus_class.uminus
1193 op * ~> HOL.times_class.times
1194 op < ~> HOL.ord_class.less
1195 op <= > HOL.ord_class.less_eq
1196 Nat.power ~> Power.power_class.power
1197 Nat.size ~> Nat.size_class.size
1198 Numeral.number_of ~> Numeral.number_class.number_of
1199 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1200 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1201 Orderings.min ~> Orderings.ord_class.min
1202 Orderings.max ~> Orderings.ord_class.max
1203 Divides.op div ~> Divides.div_class.div
1204 Divides.op mod ~> Divides.div_class.mod
1205 Divides.op dvd ~> Divides.div_class.dvd
1207 INCOMPATIBILITY. Adaptions may be required in the following cases:
1209 a) User-defined constants using any of the names "plus", "minus",
1210 "times", "less" or "less_eq". The standard syntax translations for
1211 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1214 b) Variables named "plus", "minus", "times", "less", "less_eq"
1215 INCOMPATIBILITY: use more specific names.
1217 c) Permutative equations (e.g. "a + b = b + a")
1218 Since the change of names also changes the order of terms, permutative
1219 rewrite rules may get applied in a different order. Experience shows
1220 that this is rarely the case (only two adaptions in the whole Isabelle
1221 distribution). INCOMPATIBILITY: rewrite proofs
1223 d) ML code directly refering to constant names
1224 This in general only affects hand-written proof tactics, simprocs and
1225 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1226 Consider using @{const_name} antiquotation.
1228 * New class "default" with associated constant "default".
1230 * Function "sgn" is now overloaded and available on int, real, complex
1231 (and other numeric types), using class "sgn". Two possible defs of
1232 sgn are given as equational assumptions in the classes sgn_if and
1233 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1236 * Locale "partial_order" now unified with class "order" (cf. theory
1237 Orderings), added parameter "less". INCOMPATIBILITY.
1239 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1240 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1241 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1243 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1244 changed order of proof goals in instance proofs.
1246 * The transitivity reasoner for partial and linear orders is set up
1247 for classes "order" and "linorder". Instances of the reasoner are available
1248 in all contexts importing or interpreting the corresponding locales.
1249 Method "order" invokes the reasoner separately; the reasoner
1250 is also integrated with the Simplifier as a solver. Diagnostic
1251 command 'print_orders' shows the available instances of the reasoner
1252 in the current context.
1254 * Localized monotonicity predicate in theory "Orderings"; integrated
1255 lemmas max_of_mono and min_of_mono with this predicate.
1258 * Formulation of theorem "dense" changed slightly due to integration
1259 with new class dense_linear_order.
1261 * Uniform lattice theory development in HOL.
1263 constants "meet" and "join" now named "inf" and "sup"
1264 constant "Meet" now named "Inf"
1266 classes "meet_semilorder" and "join_semilorder" now named
1267 "lower_semilattice" and "upper_semilattice"
1268 class "lorder" now named "lattice"
1269 class "comp_lat" now named "complete_lattice"
1271 Instantiation of lattice classes allows explicit definitions
1272 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1274 INCOMPATIBILITY. Theorem renames:
1276 meet_left_le ~> inf_le1
1277 meet_right_le ~> inf_le2
1278 join_left_le ~> sup_ge1
1279 join_right_le ~> sup_ge2
1280 meet_join_le ~> inf_sup_ord
1283 le_meet ~> le_inf_iff
1284 le_join ~> ge_sup_conv
1285 meet_idempotent ~> inf_idem
1286 join_idempotent ~> sup_idem
1287 meet_comm ~> inf_commute
1288 join_comm ~> sup_commute
1289 meet_leI1 ~> le_infI1
1290 meet_leI2 ~> le_infI2
1291 le_joinI1 ~> le_supI1
1292 le_joinI2 ~> le_supI2
1293 meet_assoc ~> inf_assoc
1294 join_assoc ~> sup_assoc
1295 meet_left_comm ~> inf_left_commute
1296 meet_left_idempotent ~> inf_left_idem
1297 join_left_comm ~> sup_left_commute
1298 join_left_idempotent ~> sup_left_idem
1301 le_def_meet ~> le_iff_inf
1302 le_def_join ~> le_iff_sup
1303 join_absorp2 ~> sup_absorb2
1304 join_absorp1 ~> sup_absorb1
1305 meet_absorp1 ~> inf_absorb1
1306 meet_absorp2 ~> inf_absorb2
1307 meet_join_absorp ~> inf_sup_absorb
1308 join_meet_absorp ~> sup_inf_absorb
1309 distrib_join_le ~> distrib_sup_le
1310 distrib_meet_le ~> distrib_inf_le
1312 add_meet_distrib_left ~> add_inf_distrib_left
1313 add_join_distrib_left ~> add_sup_distrib_left
1314 is_join_neg_meet ~> is_join_neg_inf
1315 is_meet_neg_join ~> is_meet_neg_sup
1316 add_meet_distrib_right ~> add_inf_distrib_right
1317 add_join_distrib_right ~> add_sup_distrib_right
1318 add_meet_join_distribs ~> add_sup_inf_distribs
1319 join_eq_neg_meet ~> sup_eq_neg_inf
1320 meet_eq_neg_join ~> inf_eq_neg_sup
1321 add_eq_meet_join ~> add_eq_inf_sup
1322 meet_0_imp_0 ~> inf_0_imp_0
1323 join_0_imp_0 ~> sup_0_imp_0
1324 meet_0_eq_0 ~> inf_0_eq_0
1325 join_0_eq_0 ~> sup_0_eq_0
1326 neg_meet_eq_join ~> neg_inf_eq_sup
1327 neg_join_eq_meet ~> neg_sup_eq_inf
1328 join_eq_if ~> sup_eq_if
1330 mono_meet ~> mono_inf
1331 mono_join ~> mono_sup
1332 meet_bool_eq ~> inf_bool_eq
1333 join_bool_eq ~> sup_bool_eq
1334 meet_fun_eq ~> inf_fun_eq
1335 join_fun_eq ~> sup_fun_eq
1336 meet_set_eq ~> inf_set_eq
1337 join_set_eq ~> sup_set_eq
1338 meet1_iff ~> inf1_iff
1339 meet2_iff ~> inf2_iff
1348 join1_iff ~> sup1_iff
1349 join2_iff ~> sup2_iff
1359 is_meet_Meet ~> is_meet_Inf
1360 Meet_bool_def ~> Inf_bool_def
1361 Meet_fun_def ~> Inf_fun_def
1362 Meet_greatest ~> Inf_greatest
1363 Meet_lower ~> Inf_lower
1364 Meet_set_def ~> Inf_set_def
1367 Sup_bool_eq ~> Sup_bool_def
1368 Sup_fun_eq ~> Sup_fun_def
1369 Sup_set_eq ~> Sup_set_def
1371 listsp_meetI ~> listsp_infI
1372 listsp_meet_eq ~> listsp_inf_eq
1377 * Added syntactic class "size"; overloaded constant "size" now has
1378 type "'a::size ==> bool"
1380 * Internal reorganisation of `size' of datatypes: size theorems
1381 "foo.size" are no longer subsumed by "foo.simps" (but are still
1382 simplification rules by default!); theorems "prod.size" now named
1385 * Class "div" now inherits from class "times" rather than "type".
1388 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1389 Linorder etc. have disappeared; operations defined in terms of
1390 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1392 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1394 * HOL-Word: New extensive library and type for generic, fixed size
1395 machine words, with arithemtic, bit-wise, shifting and rotating
1396 operations, reflection into int, nat, and bool lists, automation for
1397 linear arithmetic (by automatic reflection into nat or int), including
1398 lemmas on overflow and monotonicity. Instantiated to all appropriate
1399 arithmetic type classes, supporting automatic simplification of
1400 numerals on all operations.
1402 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1404 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1406 * Code generator library theories:
1407 - Code_Integer represents HOL integers by big integer literals in target
1409 - Code_Char represents HOL characters by character literals in target
1411 - Code_Char_chr like Code_Char, but also offers treatment of character
1412 codes; includes Code_Integer.
1413 - Executable_Set allows to generate code for finite sets using lists.
1414 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1416 - Executable_Real implements a subset of real numbers, namly those
1417 representable by rational numbers.
1418 - Efficient_Nat implements natural numbers by integers, which in general will
1419 result in higher efficency; pattern matching with 0/Suc is eliminated;
1420 includes Code_Integer.
1421 - Code_Index provides an additional datatype index which is mapped to
1422 target-language built-in integers.
1423 - Code_Message provides an additional datatype message_string which is isomorphic to
1424 strings; messages are mapped to target-language strings.
1426 * New package for inductive predicates
1428 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1431 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1432 for z_1 :: U_1 and ... and z_n :: U_m
1434 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1437 with full support for type-inference, rather than
1439 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1441 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1442 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1444 inductive "s z_1 ... z_m"
1446 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1449 For backward compatibility, there is a wrapper allowing inductive
1450 sets to be defined with the new package via
1453 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1454 for z_1 :: U_1 and ... and z_n :: U_m
1456 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1462 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1463 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1464 for z_1 :: U_1 and ... and z_n :: U_m
1466 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1467 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1470 if the additional syntax "p ..." is required.
1472 Numerous examples can be found in the subdirectories src/HOL/Auth,
1473 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1477 - Since declaration and definition of inductive sets or predicates
1478 is no longer separated, abbreviations involving the newly
1479 introduced sets or predicates must be specified together with the
1480 introduction rules after the 'where' keyword (see above), rather
1481 than before the actual inductive definition.
1483 - The variables in induction and elimination rules are now
1484 quantified in the order of their occurrence in the introduction
1485 rules, rather than in alphabetical order. Since this may break
1486 some proofs, these proofs either have to be repaired, e.g. by
1487 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1488 statements of the form
1490 case (rule_i a_i_1 ... a_i_{k_i})
1492 or the old order of quantification has to be restored by explicitly adding
1493 meta-level quantifiers in the introduction rules, i.e.
1495 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1497 - The format of the elimination rules is now
1499 p z_1 ... z_m x_1 ... x_n ==>
1500 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1505 (x_1, ..., x_n) : s z_1 ... z_m ==>
1506 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1509 for sets rather than
1511 x : s z_1 ... z_m ==>
1512 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1515 This may require terms in goals to be expanded to n-tuples
1516 (e.g. using case_tac or simplification with the split_paired_all
1517 rule) before the above elimination rule is applicable.
1519 - The elimination or case analysis rules for (mutually) inductive
1520 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1521 list of rules "p_1_..._p_k.elims" is no longer available.
1523 * New package "function"/"fun" for general recursive functions,
1524 supporting mutual and nested recursion, definitions in local contexts,
1525 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1526 for small examples, and the separate tutorial on the function
1527 package. The old recdef "package" is still available as before, but
1528 users are encouraged to use the new package.
1530 * Method "lexicographic_order" automatically synthesizes termination
1531 relations as lexicographic combinations of size measures.
1533 * Case-expressions allow arbitrary constructor-patterns (including
1534 "_") and take their order into account, like in functional
1535 programming. Internally, this is translated into nested
1536 case-expressions; missing cases are added and mapped to the predefined
1537 constant "undefined". In complicated cases printing may no longer show
1538 the original input but the internal form. Lambda-abstractions allow
1539 the same form of pattern matching: "% pat1 => e1 | ..." is an
1540 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1543 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1544 is an abbreviation for "of_nat :: nat => int". The simplification
1545 rules for "of_nat" have been changed to work like "int" did
1546 previously. Potential INCOMPATIBILITY:
1547 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1548 - of_nat_diff and of_nat_mult are no longer default simp rules
1550 * Method "algebra" solves polynomial equations over (semi)rings using
1551 Groebner bases. The (semi)ring structure is defined by locales and the
1552 tool setup depends on that generic context. Installing the method for
1553 a specific type involves instantiating the locale and possibly adding
1554 declarations for computation on the coefficients. The method is
1555 already instantiated for natural numbers and for the axiomatic class
1556 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1557 CALCULEMUS 2007 for the general principles underlying this
1558 architecture of context-aware proof-tools.
1560 * Method "ferrack" implements quantifier elimination over
1561 special-purpose dense linear orders using locales (analogous to
1562 "algebra"). The method is already installed for class
1563 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1566 * Former constant "List.op @" now named "List.append". Use ML
1567 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1568 circumvent possible incompatibilities when working on ML level.
1570 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1572 * New function listsum :: 'a list => 'a for arbitrary monoids.
1573 Special syntax: "SUM x <- xs. f x" (and latex variants)
1575 * New syntax for Haskell-like list comprehension (input only), eg.
1576 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1578 * The special syntax for function "filter" has changed from [x :
1579 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1580 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1582 * [a..b] is now defined for arbitrary linear orders. It used to be
1583 defined on nat only, as an abbreviation for [a..<Suc b]
1586 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1588 * New functions "sorted" and "sort" in src/HOL/List.thy.
1590 * New lemma collection field_simps (an extension of ring_simps) for
1591 manipulating (in)equations involving division. Multiplies with all
1592 denominators that can be proved to be non-zero (in equations) or
1593 positive/negative (in inequations).
1595 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1596 have been improved and renamed to ring_simps, group_simps and
1597 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1598 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1600 * Theory Library/Commutative_Ring: switched from recdef to function
1601 package; constants add, mul, pow now curried. Infix syntax for
1602 algebraic operations.
1604 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1607 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1610 * HOL/records: generalised field-update to take a function on the
1611 field rather than the new value: r(|A := x|) is translated to A_update
1612 (K x) r The K-combinator that is internally used is called K_record.
1613 INCOMPATIBILITY: Usage of the plain update functions has to be
1616 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1617 * x = 0, which are required for a semiring. Richer structures do not
1618 inherit from semiring_0 anymore, because this property is a theorem
1619 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1620 there is more to prove, but this is mostly trivial.
1622 * Class "recpower" is generalized to arbitrary monoids, not just
1623 commutative semirings. INCOMPATIBILITY: may need to incorporate
1624 commutativity or semiring properties additionally.
1626 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1627 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1628 better use 'abbreviation'.
1630 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1632 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1633 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1634 significant changes for setting up numeral syntax for types:
1635 - New constants Numeral.pred and Numeral.succ instead
1636 of former Numeral.bin_pred and Numeral.bin_succ.
1637 - Use integer operations instead of bin_add, bin_mult and so on.
1638 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1639 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1641 See src/HOL/Integ/IntArith.thy for an example setup.
1643 * Command 'normal_form' computes the normal form of a term that may
1644 contain free variables. For example ``normal_form "rev [a, b, c]"''
1645 produces ``[b, c, a]'' (without proof). This command is suitable for
1646 heavy-duty computations because the functions are compiled to ML
1647 first. Correspondingly, a method "normalization" is provided. See
1648 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1650 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1651 25 like -->); output depends on the "iff" print_mode, the default is
1652 "A = B" (with priority 50).
1654 * Relations less (<) and less_eq (<=) are also available on type bool.
1655 Modified syntax to disallow nesting without explicit parentheses,
1656 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1659 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1661 * Relation composition operator "op O" now has precedence 75 and binds
1662 stronger than union and intersection. INCOMPATIBILITY.
1664 * The old set interval syntax "{m..n(}" (and relatives) has been
1665 removed. Use "{m..<n}" (and relatives) instead.
1667 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1668 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1669 ``declare [[simproc del: neq]]''.
1671 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1674 * Theorem Cons_eq_map_conv no longer declared as "simp".
1676 * Theorem setsum_mult renamed to setsum_right_distrib.
1678 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1681 * Reimplemented methods "sat" and "satx", with several improvements:
1682 goals no longer need to be stated as "<prems> ==> False", equivalences
1683 (i.e. "=" on type bool) are handled, variable names of the form
1684 "lit_<n>" are no longer reserved, significant speedup.
1686 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1687 zChaff is still supported as well.
1689 * 'inductive' and 'datatype': provide projections of mutual rules,
1690 bundled as foo_bar.inducts;
1692 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1695 * Library: moved theory Accessible_Part to main HOL.
1697 * Library: added theory Coinductive_List of potentially infinite lists
1698 as greatest fixed-point.
1700 * Library: added theory AssocList which implements (finite) maps as
1703 * Method "evaluation" solves goals (i.e. a boolean expression)
1704 efficiently by compiling it to ML. The goal is "proved" (via an
1705 oracle) if it evaluates to True.
1707 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1708 also when invoked by the simplifier. This results in the Simplifier
1709 being more powerful on arithmetic goals. INCOMPATIBILITY.
1710 Configuration option fast_arith_split_limit=0 recovers the old
1713 * Support for hex (0x20) and binary (0b1001) numerals.
1715 * New method: reify eqs (t), where eqs are equations for an
1716 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1717 parameter, computes a term s::'b and a list xs::'a list and proves the
1718 theorem I xs s = t. This is also known as reification or quoting. The
1719 resulting theorem is applied to the subgoal to substitute t with I xs
1720 s. If t is omitted, the subgoal itself is reified.
1722 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1723 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1724 where f is supposed to be a computable function (in the sense of code
1725 generattion). The method uses reify to compute s and xs as above then
1726 applies corr_thm and uses normalization by evaluation to "prove" f s =
1727 r and finally gets the theorem t = r, which is again applied to the
1728 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1730 * Reflection: Automatic reification now handels binding, an example is
1731 available in src/HOL/ex/ReflectionEx.thy
1733 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1734 command 'statespace' that is similar to 'record', but introduces an
1735 abstract specification based on the locale infrastructure instead of
1736 HOL types. This leads to extra flexibility in composing state spaces,
1737 in particular multiple inheritance and renaming of components.
1742 * Hyperreal: Functions root and sqrt are now defined on negative real
1743 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1744 Nonnegativity side conditions have been removed from many lemmas, so
1745 that more subgoals may now be solved by simplification; potential
1748 * Real: new type classes formalize real normed vector spaces and
1749 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1750 and norm :: 'a => real.
1752 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1753 reals into other types. The overloaded constant Reals :: 'a set is now
1754 defined as range of_real; potential INCOMPATIBILITY.
1756 * Real: proper support for ML code generation, including 'quickcheck'.
1757 Reals are implemented as arbitrary precision rationals.
1759 * Hyperreal: Several constants that previously worked only for the
1760 reals have been generalized, so they now work over arbitrary vector
1761 spaces. Type annotations may need to be added in some cases; potential
1764 Infinitesimal :: ('a::real_normed_vector) star set
1765 HFinite :: ('a::real_normed_vector) star set
1766 HInfinite :: ('a::real_normed_vector) star set
1767 approx :: ('a::real_normed_vector) star => 'a star => bool
1768 monad :: ('a::real_normed_vector) star => 'a star set
1769 galaxy :: ('a::real_normed_vector) star => 'a star set
1770 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1771 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1772 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1773 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1774 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
1775 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
1776 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
1777 sgn :: 'a::real_normed_vector => 'a
1778 exp :: 'a::{recpower,real_normed_field,banach} => 'a
1780 * Complex: Some complex-specific constants are now abbreviations for
1781 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
1782 hnorm. Other constants have been entirely removed in favor of the
1783 polymorphic versions (INCOMPATIBILITY):
1787 HInfinite <-- CInfinite
1788 Infinitesimal <-- CInfinitesimal
1791 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
1792 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
1793 (ns)deriv <-- (ns)cderiv
1798 * Formalisation of ideals and the quotient construction over rings.
1800 * Order and lattice theory no longer based on records.
1803 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
1804 greatest_closed. INCOMPATIBILITY.
1806 * Method algebra is now set up via an attribute. For examples see
1807 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
1808 of algebraic structures.
1810 * Renamed theory CRing to Ring.
1815 * Substantial, yet incomplete support for nominal datatypes (binding
1816 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
1817 src/HOL/Nominal/Examples. Prospective users should consult
1818 http://isabelle.in.tum.de/nominal/
1823 * ML basics: just one true type int, which coincides with IntInf.int
1826 * ML within Isar: antiquotations allow to embed statically-checked
1827 formal entities in the source, referring to the context available at
1828 compile-time. For example:
1830 ML {* @{sort "{zero,one}"} *}
1831 ML {* @{typ "'a => 'b"} *}
1832 ML {* @{term "%x. x"} *}
1833 ML {* @{prop "x == y"} *}
1834 ML {* @{ctyp "'a => 'b"} *}
1835 ML {* @{cterm "%x. x"} *}
1836 ML {* @{cprop "x == y"} *}
1837 ML {* @{thm asm_rl} *}
1838 ML {* @{thms asm_rl} *}
1839 ML {* @{type_name c} *}
1840 ML {* @{type_syntax c} *}
1841 ML {* @{const_name c} *}
1842 ML {* @{const_syntax c} *}
1845 ML {* @{theory Pure} *}
1846 ML {* @{theory_ref} *}
1847 ML {* @{theory_ref Pure} *}
1850 ML {* @{clasimpset} *}
1852 The same works for sources being ``used'' within an Isar context.
1854 * ML in Isar: improved error reporting; extra verbosity with
1855 ML_Context.trace enabled.
1857 * Pure/General/table.ML: the join operations now works via exceptions
1858 DUP/SAME instead of type option. This is simpler in simple cases, and
1859 admits slightly more efficient complex applications.
1861 * Pure: 'advanced' translation functions (parse_translation etc.) now
1862 use Context.generic instead of just theory.
1864 * Pure: datatype Context.generic joins theory/Proof.context and
1865 provides some facilities for code that works in either kind of
1866 context, notably GenericDataFun for uniform theory and proof data.
1868 * Pure: simplified internal attribute type, which is now always
1869 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
1870 local (Proof.context) attributes have been discontinued, while
1871 minimizing code duplication. Thm.rule_attribute and
1872 Thm.declaration_attribute build canonical attributes; see also structure
1873 Context for further operations on Context.generic, notably
1874 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
1875 declarations and definitions.
1877 * Context data interfaces (Theory/Proof/GenericDataFun): removed
1878 name/print, uninitialized data defaults to ad-hoc copy of empty value,
1879 init only required for impure data. INCOMPATIBILITY: empty really need
1880 to be empty (no dependencies on theory content!)
1882 * Pure/kernel: consts certification ignores sort constraints given in
1883 signature declarations. (This information is not relevant to the
1884 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
1885 potential INCOMPATIBILITY.
1887 * Pure: axiomatic type classes are now purely definitional, with
1888 explicit proofs of class axioms and super class relations performed
1889 internally. See Pure/axclass.ML for the main internal interfaces --
1890 notably AxClass.define_class supercedes AxClass.add_axclass, and
1891 AxClass.axiomatize_class/classrel/arity supersede
1892 Sign.add_classes/classrel/arities.
1894 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
1895 global/local versions on theory vs. Proof.context have been
1896 discontinued; Attrib.syntax and Method.syntax have been adapted
1897 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
1898 attributes, methods, etc.
1900 * Pure: several functions of signature "... -> theory -> theory * ..."
1901 have been reoriented to "... -> theory -> ... * theory" in order to
1902 allow natural usage in combination with the ||>, ||>>, |-> and
1903 fold_map combinators.
1905 * Pure: official theorem names (closed derivations) and additional
1906 comments (tags) are now strictly separate. Name hints -- which are
1907 maintained as tags -- may be attached any time without affecting the
1910 * Pure: primitive rule lift_rule now takes goal cterm instead of an
1911 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
1912 achieve the old behaviour.
1914 * Pure: the "Goal" constant is now called "prop", supporting a
1915 slightly more general idea of ``protecting'' meta-level rule
1918 * Pure: Logic.(un)varify only works in a global context, which is now
1919 enforced instead of silently assumed. INCOMPATIBILITY, may use
1920 Logic.legacy_(un)varify as temporary workaround.
1922 * Pure: structure Name provides scalable operations for generating
1923 internal variable names, notably Name.variants etc. This replaces
1924 some popular functions from term.ML:
1926 Term.variant -> Name.variant
1927 Term.variantlist -> Name.variant_list
1928 Term.invent_names -> Name.invent_list
1930 Note that low-level renaming rarely occurs in new code -- operations
1931 from structure Variable are used instead (see below).
1933 * Pure: structure Variable provides fundamental operations for proper
1934 treatment of fixed/schematic variables in a context. For example,
1935 Variable.import introduces fixes for schematics of given facts and
1936 Variable.export reverses the effect (up to renaming) -- this replaces
1937 various freeze_thaw operations.
1939 * Pure: structure Goal provides simple interfaces for
1940 init/conclude/finish and tactical prove operations (replacing former
1941 Tactic.prove). Goal.prove is the canonical way to prove results
1942 within a given context; Goal.prove_global is a degraded version for
1943 theory level goals, including a global Drule.standard. Note that
1944 OldGoals.prove_goalw_cterm has long been obsolete, since it is
1945 ill-behaved in a local proof context (e.g. with local fixes/assumes or
1946 in a locale context).
1948 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
1949 and type checking (Syntax.check_term etc.), with common combinations
1950 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
1951 which are considered legacy and await removal.
1953 * Pure/Syntax: generic interfaces for type unchecking
1954 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
1955 with common combinations (Syntax.pretty_term, Syntax.string_of_term
1956 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
1957 available for convenience, but refer to the very same operations using
1958 a mere theory instead of a full context.
1960 * Isar: simplified treatment of user-level errors, using exception
1961 ERROR of string uniformly. Function error now merely raises ERROR,
1962 without any side effect on output channels. The Isar toplevel takes
1963 care of proper display of ERROR exceptions. ML code may use plain
1964 handle/can/try; cat_error may be used to concatenate errors like this:
1966 ... handle ERROR msg => cat_error msg "..."
1968 Toplevel ML code (run directly or through the Isar toplevel) may be
1969 embedded into the Isar toplevel with exception display/debug like
1972 Isar.toplevel (fn () => ...)
1974 INCOMPATIBILITY, removed special transform_error facilities, removed
1975 obsolete variants of user-level exceptions (ERROR_MESSAGE,
1976 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
1977 -- use plain ERROR instead.
1979 * Isar: theory setup now has type (theory -> theory), instead of a
1980 list. INCOMPATIBILITY, may use #> to compose setup functions.
1982 * Isar: ML toplevel pretty printer for type Proof.context, subject to
1983 ProofContext.debug/verbose flags.
1985 * Isar: Toplevel.theory_to_proof admits transactions that modify the
1986 theory before entering a proof state. Transactions now always see a
1987 quasi-functional intermediate checkpoint, both in interactive and
1990 * Isar: simplified interfaces for outer syntax. Renamed
1991 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
1992 OuterSyntax.add_parsers -- this functionality is now included in
1993 OuterSyntax.command etc. INCOMPATIBILITY.
1995 * Simplifier: the simpset of a running simplification process now
1996 contains a proof context (cf. Simplifier.the_context), which is the
1997 very context that the initial simpset has been retrieved from (by
1998 simpset_of/local_simpset_of). Consequently, all plug-in components
1999 (solver, looper etc.) may depend on arbitrary proof data.
2001 * Simplifier.inherit_context inherits the proof context (plus the
2002 local bounds) of the current simplification process; any simproc
2003 etc. that calls the Simplifier recursively should do this! Removed
2004 former Simplifier.inherit_bounds, which is already included here --
2005 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2006 specify an explicit context using Simplifier.context/theory_context.
2008 * Simplifier/Classical Reasoner: more abstract interfaces
2009 change_simpset/claset for modifying the simpset/claset reference of a
2010 theory; raw versions simpset/claset_ref etc. have been discontinued --
2013 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2019 * settings: the default heap location within ISABELLE_HOME_USER now
2020 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2021 Isabelle installations.
2023 * isabelle-process: option -S (secure mode) disables some critical
2024 operations, notably runtime compilation and evaluation of ML source
2027 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2029 * Support for parallel execution, using native multicore support of
2030 Poly/ML 5.1. The theory loader exploits parallelism when processing
2031 independent theories, according to the given theory header
2032 specifications. The maximum number of worker threads is specified via
2033 usedir option -M or the "max-threads" setting in Proof General. A
2034 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2035 to 6 on a 8-core machine. User-code needs to observe certain
2036 guidelines for thread-safe programming, see appendix A in the Isar
2037 Implementation manual.
2041 New in Isabelle2005 (October 2005)
2042 ----------------------------------
2046 * Theory headers: the new header syntax for Isar theories is
2049 imports <theory1> ... <theoryN>
2050 uses <file1> ... <fileM>
2053 where the 'uses' part is optional. The previous syntax
2055 theory <name> = <theory1> + ... + <theoryN>:
2057 will disappear in the next release. Use isatool fixheaders to convert
2058 existing theory files. Note that there is no change in ancient
2059 non-Isar theories now, but these will disappear soon.
2061 * Theory loader: parent theories can now also be referred to via
2062 relative and absolute paths.
2064 * Command 'find_theorems' searches for a list of criteria instead of a
2065 list of constants. Known criteria are: intro, elim, dest, name:string,
2066 simp:term, and any term. Criteria can be preceded by '-' to select
2067 theorems that do not match. Intro, elim, dest select theorems that
2068 match the current goal, name:s selects theorems whose fully qualified
2069 name contain s, and simp:term selects all simplification rules whose
2070 lhs match term. Any other term is interpreted as pattern and selects
2071 all theorems matching the pattern. Available in ProofGeneral under
2072 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2074 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2076 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2077 matching the current goal as introduction rule and not having "HOL."
2078 in their name (i.e. not being defined in theory HOL).
2080 * Command 'thms_containing' has been discontinued in favour of
2081 'find_theorems'; INCOMPATIBILITY.
2083 * Communication with Proof General is now 8bit clean, which means that
2084 Unicode text in UTF-8 encoding may be used within theory texts (both
2085 formal and informal parts). Cf. option -U of the Isabelle Proof
2086 General interface. Here are some simple examples (cf. src/HOL/ex):
2088 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2089 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2091 * Improved efficiency of the Simplifier and, to a lesser degree, the
2092 Classical Reasoner. Typical big applications run around 2 times
2096 *** Document preparation ***
2098 * Commands 'display_drafts' and 'print_drafts' perform simple output
2099 of raw sources. Only those symbols that do not require additional
2100 LaTeX packages (depending on comments in isabellesym.sty) are
2101 displayed properly, everything else is left verbatim. isatool display
2102 and isatool print are used as front ends (these are subject to the
2103 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2105 * Command tags control specific markup of certain regions of text,
2106 notably folding and hiding. Predefined tags include "theory" (for
2107 theory begin and end), "proof" for proof commands, and "ML" for
2108 commands involving ML code; the additional tags "visible" and
2109 "invisible" are unused by default. Users may give explicit tag
2110 specifications in the text, e.g. ''by %invisible (auto)''. The
2111 interpretation of tags is determined by the LaTeX job during document
2112 preparation: see option -V of isatool usedir, or options -n and -t of
2113 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2116 Several document versions may be produced at the same time via isatool
2117 usedir (the generated index.html will link all of them). Typical
2118 specifications include ''-V document=theory,proof,ML'' to present
2119 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2120 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2121 these parts without any formal replacement text. The Isabelle site
2122 default settings produce ''document'' and ''outline'' versions as
2125 * Several new antiquotations:
2127 @{term_type term} prints a term with its type annotated;
2129 @{typeof term} prints the type of a term;
2131 @{const const} is the same as @{term const}, but checks that the
2132 argument is a known logical constant;
2134 @{term_style style term} and @{thm_style style thm} print a term or
2135 theorem applying a "style" to it
2139 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2140 definitions, equations, inequations etc., 'concl' printing only the
2141 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2142 to print the specified premise. TermStyle.add_style provides an ML
2143 interface for introducing further styles. See also the "LaTeX Sugar"
2144 document practical applications. The ML antiquotation prints
2145 type-checked ML expressions verbatim.
2147 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2148 and 'text' support optional locale specification '(in loc)', which
2149 specifies the default context for interpreting antiquotations. For
2150 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2152 * Option 'locale=NAME' of antiquotations specifies an alternative
2153 context interpreting the subsequent argument. For example: @{thm
2154 [locale=lattice] inf_assoc}.
2156 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2159 * Proper output of antiquotations for theory commands involving a
2160 proof context (such as 'locale' or 'theorem (in loc) ...').
2162 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2163 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2165 * isatool usedir: new option -C (default true) controls whether option
2166 -D should include a copy of the original document directory; -C false
2167 prevents unwanted effects such as copying of administrative CVS data.
2172 * Considerably improved version of 'constdefs' command. Now performs
2173 automatic type-inference of declared constants; additional support for
2174 local structure declarations (cf. locales and HOL records), see also
2175 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2176 sequential dependencies of definitions within a single 'constdefs'
2177 section; moreover, the declared name needs to be an identifier. If
2178 all fails, consider to fall back on 'consts' and 'defs' separately.
2180 * Improved indexed syntax and implicit structures. First of all,
2181 indexed syntax provides a notational device for subscripted
2182 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2183 expressions. Secondly, in a local context with structure
2184 declarations, number indexes \<^sub>n or the empty index (default
2185 number 1) refer to a certain fixed variable implicitly; option
2186 show_structs controls printing of implicit structures. Typical
2187 applications of these concepts involve record types and locales.
2189 * New command 'no_syntax' removes grammar declarations (and
2190 translations) resulting from the given syntax specification, which is
2191 interpreted in the same manner as for the 'syntax' command.
2193 * 'Advanced' translation functions (parse_translation etc.) may depend
2194 on the signature of the theory context being presently used for
2195 parsing/printing, see also isar-ref manual.
2197 * Improved 'oracle' command provides a type-safe interface to turn an
2198 ML expression of type theory -> T -> term into a primitive rule of
2199 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2200 is already included here); see also FOL/ex/IffExample.thy;
2203 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2204 before); "cI" is no longer bound, use "c.intro" instead.
2205 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2206 axclasses vs. locales.
2208 * Improved internal renaming of symbolic identifiers -- attach primes
2209 instead of base 26 numbers.
2211 * New flag show_question_marks controls printing of leading question
2212 marks in schematic variable names.
2214 * In schematic variable names, *any* symbol following \<^isub> or
2215 \<^isup> is now treated as part of the base name. For example, the
2216 following works without printing of awkward ".0" indexes:
2218 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2221 * Inner syntax includes (*(*nested*) comments*).
2223 * Pretty printer now supports unbreakable blocks, specified in mixfix
2224 annotations as "(00...)".
2226 * Clear separation of logical types and nonterminals, where the latter
2227 may only occur in 'syntax' specifications or type abbreviations.
2228 Before that distinction was only partially implemented via type class
2229 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2230 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2231 exotic syntax specifications may require further adaption
2232 (e.g. Cube/Cube.thy).
2234 * Removed obsolete type class "logic", use the top sort {} instead.
2235 Note that non-logical types should be declared as 'nonterminals'
2236 rather than 'types'. INCOMPATIBILITY for new object-logic
2239 * Attributes 'induct' and 'cases': type or set names may now be
2240 locally fixed variables as well.
2242 * Simplifier: can now control the depth to which conditional rewriting
2243 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2246 * Simplifier: simplification procedures may now take the current
2247 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2248 interface), which is very useful for calling the Simplifier
2249 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2250 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2251 low-level mk_simproc no longer applies Logic.varify internally, to
2252 allow for use in a context of fixed variables.
2254 * thin_tac now works even if the assumption being deleted contains !!
2255 or ==>. More generally, erule now works even if the major premise of
2256 the elimination rule contains !! or ==>.
2258 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2260 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2261 from Pure, which contains all common declarations already. Both
2262 theories are defined via plain Isabelle/Isar .thy files.
2263 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2264 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2265 use isatool fixcpure to adapt your theory and ML sources.
2267 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2268 selections of theorems in named facts via index ranges.
2270 * 'print_theorems': in theory mode, really print the difference
2271 wrt. the last state (works for interactive theory development only),
2272 in proof mode print all local facts (cf. 'print_facts');
2274 * 'hide': option '(open)' hides only base names.
2276 * More efficient treatment of intermediate checkpoints in interactive
2279 * Code generator is now invoked via code_module (incremental code
2280 generation) and code_library (modular code generation, ML structures
2281 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2282 must be quoted when used as identifiers.
2284 * New 'value' command for reading, evaluating and printing terms using
2285 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2286 quoted when used as identifier.
2291 * New commands for the interpretation of locale expressions in
2292 theories (1), locales (2) and proof contexts (3). These generate
2293 proof obligations from the expression specification. After the
2294 obligations have been discharged, theorems of the expression are added
2295 to the theory, target locale or proof context. The synopsis of the
2296 commands is a follows:
2298 (1) interpretation expr inst
2299 (2) interpretation target < expr
2300 (3) interpret expr inst
2302 Interpretation in theories and proof contexts require a parameter
2303 instantiation of terms from the current context. This is applied to
2304 specifications and theorems of the interpreted expression.
2305 Interpretation in locales only permits parameter renaming through the
2306 locale expression. Interpretation is smart in that interpretations
2307 that are active already do not occur in proof obligations, neither are
2308 instantiated theorems stored in duplicate. Use 'print_interps' to
2309 inspect active interpretations of a particular locale. For details,
2310 see the Isar Reference manual. Examples can be found in
2311 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2313 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2314 'interpret' instead.
2316 * New context element 'constrains' for adding type constraints to
2319 * Context expressions: renaming of parameters with syntax
2322 * Locale declaration: 'includes' disallowed.
2324 * Proper static binding of attribute syntax -- i.e. types / terms /
2325 facts mentioned as arguments are always those of the locale definition
2326 context, independently of the context of later invocations. Moreover,
2327 locale operations (renaming and type / term instantiation) are applied
2328 to attribute arguments as expected.
2330 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2331 actual attributes; rare situations may require Attrib.attribute to
2332 embed those attributes into Attrib.src that lack concrete syntax.
2333 Attribute implementations need to cooperate properly with the static
2334 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2335 Attrib.XXX_thm etc. already do the right thing without further
2336 intervention. Only unusual applications -- such as "where" or "of"
2337 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2338 on the context and the facts involved -- may have to assign parsed
2339 values to argument tokens explicitly.
2341 * Changed parameter management in theorem generation for long goal
2342 statements with 'includes'. INCOMPATIBILITY: produces a different
2343 theorem statement in rare situations.
2345 * Locale inspection command 'print_locale' omits notes elements. Use
2346 'print_locale!' to have them included in the output.
2351 * Provers/hypsubst.ML: improved version of the subst method, for
2352 single-step rewriting: it now works in bound variable contexts. New is
2353 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2354 rewrite a different subterm than the original subst method, which is
2355 still available as 'simplesubst'.
2357 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2360 * Provers/trancl.ML: new transitivity reasoner for transitive and
2361 reflexive-transitive closure of relations.
2363 * Provers/blast.ML: new reference depth_limit to make blast's depth
2364 limit (previously hard-coded with a value of 20) user-definable.
2366 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2367 is peformed already. Object-logics merely need to finish their
2368 initial simpset configuration as before. INCOMPATIBILITY.
2373 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2376 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2378 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2379 and x-symbol; use option '-m epsilon' to get it actually printed.
2380 Moreover, the mathematically important symbolic identifier \<epsilon>
2381 becomes available as variable, constant etc. INCOMPATIBILITY,
2383 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2384 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2385 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2386 support corresponding Isar calculations.
2388 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2391 * theory SetInterval: changed the syntax for open intervals:
2400 The old syntax is still supported but will disappear in the next
2401 release. For conversion use the following Emacs search and replace
2402 patterns (these are not perfect but work quite well):
2404 {)\([^\.]*\)\.\. -> {\1<\.\.}
2405 \.\.\([^(}]*\)(} -> \.\.<\1}
2407 * Theory Commutative_Ring (in Library): method comm_ring for proving
2408 equalities in commutative rings; method 'algebra' provides a generic
2411 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2412 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2413 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2416 Some new syntax forms are available:
2418 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2419 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2420 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2421 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2423 The latter form "\<Sum>x < k. e" used to be based on a separate
2424 function "Summation", which has been discontinued.
2426 * theory Finite_Set: in structured induction proofs, the insert case
2427 is now 'case (insert x F)' instead of the old counterintuitive 'case
2430 * The 'refute' command has been extended to support a much larger
2431 fragment of HOL, including axiomatic type classes, constdefs and
2432 typedefs, inductive datatypes and recursion.
2434 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2435 Requires zChaff with proof generation to be installed. See
2436 HOL/ex/SAT_Examples.thy for examples.
2438 * Datatype induction via method 'induct' now preserves the name of the
2439 induction variable. For example, when proving P(xs::'a list) by
2440 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2441 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2442 in unstructured proof scripts.
2444 * Reworked implementation of records. Improved scalability for
2445 records with many fields, avoiding performance problems for type
2446 inference. Records are no longer composed of nested field types, but
2447 of nested extension types. Therefore the record type only grows linear
2448 in the number of extensions and not in the number of fields. The
2449 top-level (users) view on records is preserved. Potential
2450 INCOMPATIBILITY only in strange cases, where the theory depends on the
2451 old record representation. The type generated for a record is called
2452 <record_name>_ext_type.
2454 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2455 proofs triggered by a record definition or a simproc (if
2456 quick_and_dirty is enabled). Definitions of large records can take
2459 New simproc record_upd_simproc for simplification of multiple record
2460 updates enabled by default. Moreover, trivial updates are also
2461 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2462 occasionally, since simplification is more powerful by default.
2464 * typedef: proper support for polymorphic sets, which contain extra
2465 type-variables in the term.
2467 * Simplifier: automatically reasons about transitivity chains
2468 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2469 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2470 old proofs break occasionally as simplification may now solve more
2471 goals than previously.
2473 * Simplifier: converts x <= y into x = y if assumption y <= x is
2474 present. Works for all partial orders (class "order"), in particular
2475 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2478 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2479 bound variable or a constant then the let is unfolded. Otherwise
2480 first a is simplified to b, and then f b is simplified to g. If
2481 possible we abstract b from g arriving at "let x = b in h x",
2482 otherwise we unfold the let and arrive at g. The simproc can be
2483 enabled/disabled by the reference use_let_simproc. Potential
2484 INCOMPATIBILITY since simplification is more powerful by default.
2486 * Classical reasoning: the meson method now accepts theorems as arguments.
2488 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2489 jobs to provide advice on the provability of subgoals.
2491 * Theory OrderedGroup and Ring_and_Field: various additions and
2492 improvements to faciliate calculations involving equalities and
2495 The following theorems have been eliminated or modified
2498 abs_eq now named abs_of_nonneg
2499 abs_of_ge_0 now named abs_of_nonneg
2500 abs_minus_eq now named abs_of_nonpos
2501 imp_abs_id now named abs_of_nonneg
2502 imp_abs_neg_id now named abs_of_nonpos
2503 mult_pos now named mult_pos_pos
2504 mult_pos_le now named mult_nonneg_nonneg
2505 mult_pos_neg_le now named mult_nonneg_nonpos
2506 mult_pos_neg2_le now named mult_nonneg_nonpos2
2507 mult_neg now named mult_neg_neg
2508 mult_neg_le now named mult_nonpos_nonpos
2510 * The following lemmas in Ring_and_Field have been added to the simplifier:
2513 not_square_less_zero
2515 The following lemmas have been deleted from Real/RealPow:
2525 * Theory Parity: added rules for simplifying exponents.
2529 The following theorems have been eliminated or modified
2532 list_all_Nil now named list_all.simps(1)
2533 list_all_Cons now named list_all.simps(2)
2534 list_all_conv now named list_all_iff
2535 set_mem_eq now named mem_iff
2537 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2538 asymptotic "big O" calculations. See the notes in BigO.thy.
2543 * Theory RealDef: better support for embedding natural numbers and
2544 integers in the reals.
2546 The following theorems have been eliminated or modified
2549 exp_ge_add_one_self now requires no hypotheses
2550 real_of_int_add reversed direction of equality (use [symmetric])
2551 real_of_int_minus reversed direction of equality (use [symmetric])
2552 real_of_int_diff reversed direction of equality (use [symmetric])
2553 real_of_int_mult reversed direction of equality (use [symmetric])
2555 * Theory RComplete: expanded support for floor and ceiling functions.
2557 * Theory Ln is new, with properties of the natural logarithm
2559 * Hyperreal: There is a new type constructor "star" for making
2560 nonstandard types. The old type names are now type synonyms:
2564 hcomplex = complex star
2566 * Hyperreal: Many groups of similarly-defined constants have been
2567 replaced by polymorphic versions (INCOMPATIBILITY):
2569 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2571 starset <-- starsetNat, starsetC
2572 *s* <-- *sNat*, *sc*
2573 starset_n <-- starsetNat_n, starsetC_n
2574 *sn* <-- *sNatn*, *scn*
2575 InternalSets <-- InternalNatSets, InternalCSets
2577 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2578 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2579 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2580 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2581 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2583 * Hyperreal: Many type-specific theorems have been removed in favor of
2584 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2586 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2587 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2588 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2589 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2590 right_minus <-- hypreal_add_minus
2591 left_minus <-- {hypreal,hcomplex}_add_minus_left
2592 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2593 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2594 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2595 mult_1_right <-- hcomplex_mult_one_right
2596 mult_zero_left <-- hcomplex_mult_zero_left
2597 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2598 right_distrib <-- hypnat_add_mult_distrib2
2599 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2600 right_inverse <-- hypreal_mult_inverse
2601 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2602 order_refl <-- {hypreal,hypnat}_le_refl
2603 order_trans <-- {hypreal,hypnat}_le_trans
2604 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2605 order_less_le <-- {hypreal,hypnat}_less_le
2606 linorder_linear <-- {hypreal,hypnat}_le_linear
2607 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2608 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2609 add_nonneg_nonneg <-- hypreal_le_add_order
2611 * Hyperreal: Separate theorems having to do with type-specific
2612 versions of constants have been merged into theorems that apply to the
2613 new polymorphic constants (INCOMPATIBILITY):
2615 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2616 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2617 STAR_Un <-- {STAR,NatStar,STARC}_Un
2618 STAR_Int <-- {STAR,NatStar,STARC}_Int
2619 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2620 STAR_subset <-- {STAR,NatStar,STARC}_subset
2621 STAR_mem <-- {STAR,NatStar,STARC}_mem
2622 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2623 STAR_diff <-- {STAR,STARC}_diff
2624 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2625 STARC_hcomplex_of_complex}_image_subset
2626 starset_n_Un <-- starset{Nat,C}_n_Un
2627 starset_n_Int <-- starset{Nat,C}_n_Int
2628 starset_n_Compl <-- starset{Nat,C}_n_Compl
2629 starset_n_diff <-- starset{Nat,C}_n_diff
2630 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2631 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2632 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2633 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2634 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2635 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2636 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2637 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2638 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2639 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2640 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2641 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2642 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2643 starfun_diff <-- starfun{C,RC,CR}_diff
2644 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2645 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2646 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2647 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2648 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2649 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2650 starfun_Id <-- starfunC_Id
2651 starfun_approx <-- starfun{Nat,CR}_approx
2652 starfun_capprox <-- starfun{C,RC}_capprox
2653 starfun_abs <-- starfunNat_rabs
2654 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2655 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2656 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2657 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2658 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2659 starfun_add_approx <-- starfunCR_add_approx
2660 starfun_inverse_inverse <-- starfunC_inverse_inverse
2661 starfun_divide <-- starfun{C,CR,RC}_divide
2662 starfun_n <-- starfun{Nat,C}_n
2663 starfun_n_mult <-- starfun{Nat,C}_n_mult
2664 starfun_n_add <-- starfun{Nat,C}_n_add
2665 starfun_n_add_minus <-- starfunNat_n_add_minus
2666 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2667 starfun_n_minus <-- starfun{Nat,C}_n_minus
2668 starfun_n_eq <-- starfun{Nat,C}_n_eq
2670 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2671 star_n_minus <-- {hypreal,hcomplex}_minus
2672 star_n_diff <-- {hypreal,hcomplex}_diff
2673 star_n_mult <-- {hypreal,hcomplex}_mult
2674 star_n_inverse <-- {hypreal,hcomplex}_inverse
2675 star_n_le <-- {hypreal,hypnat}_le
2676 star_n_less <-- {hypreal,hypnat}_less
2677 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2678 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2679 star_n_abs <-- hypreal_hrabs
2680 star_n_divide <-- hcomplex_divide
2682 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2683 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2684 star_of_diff <-- hypreal_of_real_diff
2685 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2686 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2687 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2688 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2689 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2690 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2691 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2692 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2693 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2694 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2695 star_of_number_of <-- {hypreal,hcomplex}_number_of
2696 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2697 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2698 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2699 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2700 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2701 star_of_power <-- hypreal_of_real_power
2702 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2704 * Hyperreal: new method "transfer" that implements the transfer
2705 principle of nonstandard analysis. With a subgoal that mentions
2706 nonstandard types like "'a star", the command "apply transfer"
2707 replaces it with an equivalent one that mentions only standard types.
2708 To be successful, all free variables must have standard types; non-
2709 standard variables must have explicit universal quantifiers.
2711 * Hyperreal: A theory of Taylor series.
2716 * Discontinued special version of 'constdefs' (which used to support
2717 continuous functions) in favor of the general Pure one with full
2720 * New simplification procedure for solving continuity conditions; it
2721 is much faster on terms with many nested lambda abstractions (cubic
2722 instead of exponential time).
2724 * New syntax for domain package: selector names are now optional.
2725 Parentheses should be omitted unless argument is lazy, for example:
2727 domain 'a stream = cons "'a" (lazy "'a stream")
2729 * New command 'fixrec' for defining recursive functions with pattern
2730 matching; defining multiple functions with mutual recursion is also
2731 supported. Patterns may include the constants cpair, spair, up, sinl,
2732 sinr, or any data constructor defined by the domain package. The given
2733 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2734 syntax and examples.
2736 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2737 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2738 but the proof obligation additionally includes an admissibility
2739 requirement. The packages generate instances of class cpo or pcpo,
2740 with continuity and strictness theorems for Rep and Abs.
2742 * HOLCF: Many theorems have been renamed according to a more standard naming
2743 scheme (INCOMPATIBILITY):
2745 foo_inject: "foo$x = foo$y ==> x = y"
2746 foo_eq: "(foo$x = foo$y) = (x = y)"
2747 foo_less: "(foo$x << foo$y) = (x << y)"
2748 foo_strict: "foo$UU = UU"
2749 foo_defined: "... ==> foo$x ~= UU"
2750 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2755 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2756 including the First Isomorphism Theorem (on quotienting by the kernel
2759 * ZF/Simplifier: install second copy of type solver that actually
2760 makes use of TC rules declared to Isar proof contexts (or locales);
2761 the old version is still required for ML proof scripts.
2766 * Converted to Isar theory format; use locales instead of axiomatic
2772 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
2775 * Pure/library.ML no longer defines its own option datatype, but uses
2776 that of the SML basis, which has constructors NONE and SOME instead of
2777 None and Some, as well as exception Option.Option instead of OPTION.
2778 The functions the, if_none, is_some, is_none have been adapted
2779 accordingly, while Option.map replaces apsome.
2781 * Pure/library.ML: the exception LIST has been given up in favour of
2782 the standard exceptions Empty and Subscript, as well as
2783 Library.UnequalLengths. Function like Library.hd and Library.tl are
2784 superceded by the standard hd and tl functions etc.
2786 A number of basic list functions are no longer exported to the ML
2787 toplevel, as they are variants of predefined functions. The following
2788 suggests how one can translate existing code:
2790 rev_append xs ys = List.revAppend (xs, ys)
2791 nth_elem (i, xs) = List.nth (xs, i)
2792 last_elem xs = List.last xs
2793 flat xss = List.concat xss
2794 seq fs = List.app fs
2795 partition P xs = List.partition P xs
2796 mapfilter f xs = List.mapPartial f xs
2798 * Pure/library.ML: several combinators for linear functional
2799 transformations, notably reverse application and composition:
2802 (x, y) |-> f f #-> g
2804 * Pure/library.ML: introduced/changed precedence of infix operators:
2806 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
2808 infix 3 o oo ooo oooo;
2809 infix 4 ~~ upto downto;
2811 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
2814 * Pure/library.ML: natural list combinators fold, fold_rev, and
2815 fold_map support linear functional transformations and nesting. For
2818 fold f [x1, ..., xN] y =
2819 y |> f x1 |> ... |> f xN
2821 (fold o fold) f [xs1, ..., xsN] y =
2822 y |> fold f xs1 |> ... |> fold f xsN
2824 fold f [x1, ..., xN] =
2827 (fold o fold) f [xs1, ..., xsN] =
2828 fold f xs1 #> ... #> fold f xsN
2830 * Pure/library.ML: the following selectors on type 'a option are
2833 the: 'a option -> 'a (*partial*)
2834 these: 'a option -> 'a where 'a = 'b list
2835 the_default: 'a -> 'a option -> 'a
2836 the_list: 'a option -> 'a list
2838 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2839 basic operations for association lists, following natural argument
2840 order; moreover the explicit equality predicate passed here avoids
2841 potentially expensive polymorphic runtime equality checks.
2842 The old functions may be expressed as follows:
2844 assoc = uncurry (AList.lookup (op =))
2845 assocs = these oo AList.lookup (op =)
2846 overwrite = uncurry (AList.update (op =)) o swap
2848 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2850 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
2851 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
2853 replacing make_keylist and keyfilter (occassionally used)
2856 make_keylist = AList.make
2857 keyfilter = AList.find (op =)
2859 * eq_fst and eq_snd now take explicit equality parameter, thus
2860 avoiding eqtypes. Naive rewrites:
2862 eq_fst = eq_fst (op =)
2863 eq_snd = eq_snd (op =)
2865 * Removed deprecated apl and apr (rarely used).
2868 apl (n, op) =>>= curry op n
2869 apr (op, m) =>>= fn n => op (n, m)
2871 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
2872 provides a reasonably efficient light-weight implementation of sets as
2875 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
2876 few new operations; existing lookup and update are now curried to
2877 follow natural argument order (for use with fold etc.);
2878 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
2880 * Pure/General: output via the Isabelle channels of
2881 writeln/warning/error etc. is now passed through Output.output, with a
2882 hook for arbitrary transformations depending on the print_mode
2883 (cf. Output.add_mode -- the first active mode that provides a output
2884 function wins). Already formatted output may be embedded into further
2885 text via Output.raw; the result of Pretty.string_of/str_of and derived
2886 functions (string_of_term/cterm/thm etc.) is already marked raw to
2887 accommodate easy composition of diagnostic messages etc. Programmers
2888 rarely need to care about Output.output or Output.raw at all, with
2889 some notable exceptions: Output.output is required when bypassing the
2890 standard channels (writeln etc.), or in token translations to produce
2891 properly formatted results; Output.raw is required when capturing
2892 already output material that will eventually be presented to the user
2893 a second time. For the default print mode, both Output.output and
2894 Output.raw have no effect.
2896 * Pure/General: Output.time_accumulator NAME creates an operator ('a
2897 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
2898 cumulative results are displayed at the end of a batch session.
2900 * Pure/General: File.sysify_path and File.quote_sysify path have been
2901 replaced by File.platform_path and File.shell_path (with appropriate
2902 hooks). This provides a clean interface for unusual systems where the
2903 internal and external process view of file names are different.
2905 * Pure: more efficient orders for basic syntactic entities: added
2906 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
2907 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
2908 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
2909 orders now -- potential INCOMPATIBILITY for code that depends on a
2910 particular order for Symtab.keys, Symtab.dest, etc. (consider using
2911 Library.sort_strings on result).
2913 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
2914 fold_types traverse types/terms from left to right, observing natural
2915 argument order. Supercedes previous foldl_XXX versions, add_frees,
2916 add_vars etc. have been adapted as well: INCOMPATIBILITY.
2918 * Pure: name spaces have been refined, with significant changes of the
2919 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
2920 to extern(_table). The plain name entry path is superceded by a
2921 general 'naming' context, which also includes the 'policy' to produce
2922 a fully qualified name and external accesses of a fully qualified
2923 name; NameSpace.extend is superceded by context dependent
2924 Sign.declare_name. Several theory and proof context operations modify
2925 the naming context. Especially note Theory.restore_naming and
2926 ProofContext.restore_naming to get back to a sane state; note that
2927 Theory.add_path is no longer sufficient to recover from
2928 Theory.absolute_path in particular.
2930 * Pure: new flags short_names (default false) and unique_names
2931 (default true) for controlling output of qualified names. If
2932 short_names is set, names are printed unqualified. If unique_names is
2933 reset, the name prefix is reduced to the minimum required to achieve
2934 the original result when interning again, even if there is an overlap
2935 with earlier declarations.
2937 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
2938 now 'extend', and 'merge' gets an additional Pretty.pp argument
2939 (useful for printing error messages). INCOMPATIBILITY.
2941 * Pure: major reorganization of the theory context. Type Sign.sg and
2942 Theory.theory are now identified, referring to the universal
2943 Context.theory (see Pure/context.ML). Actual signature and theory
2944 content is managed as theory data. The old code and interfaces were
2945 spread over many files and structures; the new arrangement introduces
2946 considerable INCOMPATIBILITY to gain more clarity:
2948 Context -- theory management operations (name, identity, inclusion,
2949 parents, ancestors, merge, etc.), plus generic theory data;
2951 Sign -- logical signature and syntax operations (declaring consts,
2952 types, etc.), plus certify/read for common entities;
2954 Theory -- logical theory operations (stating axioms, definitions,
2955 oracles), plus a copy of logical signature operations (consts,
2956 types, etc.); also a few basic management operations (Theory.copy,
2959 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
2960 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
2961 for convenience -- they merely return the theory.
2963 * Pure: type Type.tsig is superceded by theory in most interfaces.
2965 * Pure: the Isar proof context type is already defined early in Pure
2966 as Context.proof (note that ProofContext.context and Proof.context are
2967 aliases, where the latter is the preferred name). This enables other
2968 Isabelle components to refer to that type even before Isar is present.
2970 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
2971 typeK, constK, axiomK, oracleK), but provide explicit operations for
2972 any of these kinds. For example, Sign.intern typeK is now
2973 Sign.intern_type, Theory.hide_space Sign.typeK is now
2974 Theory.hide_types. Also note that former
2975 Theory.hide_classes/types/consts are now
2976 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
2977 internalize their arguments! INCOMPATIBILITY.
2979 * Pure: get_thm interface (of PureThy and ProofContext) expects
2980 datatype thmref (with constructors Name and NameSelection) instead of
2981 plain string -- INCOMPATIBILITY;
2983 * Pure: cases produced by proof methods specify options, where NONE
2984 means to remove case bindings -- INCOMPATIBILITY in
2987 * Pure: the following operations retrieve axioms or theorems from a
2988 theory node or theory hierarchy, respectively:
2990 Theory.axioms_of: theory -> (string * term) list
2991 Theory.all_axioms_of: theory -> (string * term) list
2992 PureThy.thms_of: theory -> (string * thm) list
2993 PureThy.all_thms_of: theory -> (string * thm) list
2995 * Pure: print_tac now outputs the goal through the trace channel.
2997 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
2998 Reference Toplevel.debug (default false) controls detailed printing
2999 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3000 controls execution profiling -- set to 1 for time and 2 for space
3001 (both increase the runtime).
3003 * Isar session: The initial use of ROOT.ML is now always timed,
3004 i.e. the log will show the actual process times, in contrast to the
3005 elapsed wall-clock time that the outer shell wrapper produces.
3007 * Simplifier: improved handling of bound variables (nameless
3008 representation, avoid allocating new strings). Simprocs that invoke
3009 the Simplifier recursively should use Simplifier.inherit_bounds to
3010 avoid local name clashes. Failure to do so produces warnings
3011 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3012 for further details.
3014 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3015 bindings for all theorems stored within a given theory; this may help
3016 in porting non-Isar theories to Isar ones, while keeping ML proof
3017 scripts for the time being.
3019 * ML operator HTML.with_charset specifies the charset begin used for
3020 generated HTML files. For example:
3022 HTML.with_charset "utf-8" use_thy "Hebrew";
3023 HTML.with_charset "utf-8" use_thy "Chinese";
3028 * Allow symlinks to all proper Isabelle executables (Isabelle,
3029 isabelle, isatool etc.).
3031 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3032 isatool doc, isatool mkdir, display_drafts etc.).
3034 * isatool usedir: option -f allows specification of the ML file to be
3035 used by Isabelle; default is ROOT.ML.
3037 * New isatool version outputs the version identifier of the Isabelle
3038 distribution being used.
3040 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3041 (containing Boolean satisfiability problems) into Isabelle/HOL
3046 New in Isabelle2004 (April 2004)
3047 --------------------------------
3051 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3052 Replaces linorder.ML.
3054 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3055 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3056 (\<a>...\<z>), are now considered normal letters, and can therefore
3057 be used anywhere where an ASCII letter (a...zA...Z) has until
3058 now. COMPATIBILITY: This obviously changes the parsing of some
3059 terms, especially where a symbol has been used as a binder, say
3060 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3061 as an identifier. Fix it by inserting a space around former
3062 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3063 existing theory and ML files.
3065 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3067 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3068 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3069 a normal (but invisible) letter. For multiple letter subscripts repeat
3070 \<^isub> like this: x\<^isub>1\<^isub>2.
3072 * Pure: There are now sub-/superscripts that can span more than one
3073 character. Text between \<^bsub> and \<^esub> is set in subscript in
3074 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3075 superscript. The new control characters are not identifier parts.
3077 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3078 content of "..." to the latex file instead of \isacntrl... . The "..."
3079 may consist of any printable characters excluding the end bracket >.
3081 * Pure: Using new Isar command "finalconsts" (or the ML functions
3082 Theory.add_finals or Theory.add_finals_i) it is now possible to
3083 declare constants "final", which prevents their being given a definition
3084 later. It is useful for constants whose behaviour is fixed axiomatically
3085 rather than definitionally, such as the meta-logic connectives.
3087 * Pure: 'instance' now handles general arities with general sorts
3088 (i.e. intersections of classes),
3090 * Presentation: generated HTML now uses a CSS style sheet to make layout
3091 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3092 It can be changed to alter the colors/layout of generated pages.
3097 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3098 cut_tac, subgoal_tac and thin_tac:
3099 - Now understand static (Isar) contexts. As a consequence, users of Isar
3100 locales are no longer forced to write Isar proof scripts.
3101 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3103 - INCOMPATIBILITY: names of variables to be instantiated may no
3104 longer be enclosed in quotes. Instead, precede variable name with `?'.
3105 This is consistent with the instantiation attribute "where".
3107 * Attributes "where" and "of":
3108 - Now take type variables of instantiated theorem into account when reading
3109 the instantiation string. This fixes a bug that caused instantiated
3110 theorems to have too special types in some circumstances.
3111 - "where" permits explicit instantiations of type variables.
3113 * Calculation commands "moreover" and "also" no longer interfere with
3114 current facts ("this"), admitting arbitrary combinations with "then"
3118 - Goal statements involving the context element "includes" no longer
3119 generate theorems with internal delta predicates (those ending on
3120 "_axioms") in the premise.
3121 Resolve particular premise with <locale>.intro to obtain old form.
3122 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3123 specification and "includes" elements in goal statement.
3124 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3125 [intro?] and [elim?] (respectively) by default.
3126 - Experimental command for instantiation of locales in proof contexts:
3127 instantiate <label>[<attrs>]: <loc>
3128 Instantiates locale <loc> and adds all its theorems to the current context
3129 taking into account their attributes. Label and attrs are optional
3130 modifiers, like in theorem declarations. If present, names of
3131 instantiated theorems are qualified with <label>, and the attributes
3132 <attrs> are applied after any attributes these theorems might have already.
3133 If the locale has assumptions, a chained fact of the form
3134 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3135 are derived. The command does not support old-style locales declared
3136 with "locale (open)".
3137 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3139 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3145 * Proof import: new image HOL4 contains the imported library from
3146 the HOL4 system with about 2500 theorems. It is imported by
3147 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3148 can be used like any other Isabelle image. See
3149 HOL/Import/HOL/README for more information.
3152 - Much improved handling of linear and partial orders.
3153 Reasoners for linear and partial orders are set up for type classes
3154 "linorder" and "order" respectively, and are added to the default simpset
3155 as solvers. This means that the simplifier can build transitivity chains
3156 to solve goals from the assumptions.
3157 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3158 of blast or auto after simplification become unnecessary because the goal
3159 is solved by simplification already.
3161 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3162 all proved in axiomatic type classes for semirings, rings and fields.
3165 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3166 now formalized using the Ring_and_Field theory mentioned above.
3167 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3168 than before, because now they are set up once in a generic manner.
3169 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3170 Look for the general versions in Ring_and_Field (and Power if they concern
3173 * Type "rat" of the rational numbers is now available in HOL-Complex.
3176 - Record types are now by default printed with their type abbreviation
3177 instead of the list of all field types. This can be configured via
3178 the reference "print_record_type_abbr".
3179 - Simproc "record_upd_simproc" for simplification of multiple updates added
3180 (not enabled by default).
3181 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3182 EX x. x = sel r to True (not enabled by default).
3183 - Tactic "record_split_simp_tac" to split and simplify records added.
3185 * 'specification' command added, allowing for definition by
3186 specification. There is also an 'ax_specification' command that
3187 introduces the new constants axiomatically.
3189 * arith(_tac) is now able to generate counterexamples for reals as well.
3191 * HOL-Algebra: new locale "ring" for non-commutative rings.
3193 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3194 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3196 * HOL-Matrix: a first theory for matrices in HOL with an application of
3197 matrix theory to linear programming.
3199 * Unions and Intersections:
3200 The latex output syntax of UN and INT has been changed
3201 from "\Union x \in A. B" to "\Union_{x \in A} B"
3202 i.e. the index formulae has become a subscript.
3203 Similarly for "\Union x. B", and for \Inter instead of \Union.
3205 * Unions and Intersections over Intervals:
3206 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3207 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3208 like in normal math, and corresponding versions for < and for intersection.
3210 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3211 lexicographic dictonary ordering has been added as "lexord".
3213 * ML: the legacy theory structures Int and List have been removed. They had
3214 conflicted with ML Basis Library structures having the same names.
3216 * 'refute' command added to search for (finite) countermodels. Only works
3217 for a fragment of HOL. The installation of an external SAT solver is
3218 highly recommended. See "HOL/Refute.thy" for details.
3220 * 'quickcheck' command: Allows to find counterexamples by evaluating
3221 formulae under an assignment of free variables to random values.
3222 In contrast to 'refute', it can deal with inductive datatypes,
3223 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3229 * Streams now come with concatenation and are part of the HOLCF image
3233 New in Isabelle2003 (May 2003)
3234 ------------------------------
3238 * Provers/simplifier:
3240 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3241 Assumptions are now subject to complete mutual simplification,
3242 not just from left to right. The simplifier now preserves
3243 the order of assumptions.
3245 Potential INCOMPATIBILITY:
3247 -- simp sometimes diverges where the old version did
3248 not, e.g. invoking simp on the goal
3250 [| P (f x); y = x; f x = f y |] ==> Q
3252 now gives rise to the infinite reduction sequence
3254 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3256 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3259 -- Tactics combining classical reasoner and simplification (such as auto)
3260 are also affected by this change, because many of them rely on
3261 simp. They may sometimes diverge as well or yield a different numbers
3262 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3263 in case of problems. Sometimes subsequent calls to the classical
3264 reasoner will fail because a preceeding call to the simplifier too
3265 eagerly simplified the goal, e.g. deleted redundant premises.
3267 - The simplifier trace now shows the names of the applied rewrite rules
3269 - You can limit the number of recursive invocations of the simplifier
3270 during conditional rewriting (where the simplifie tries to solve the
3271 conditions before applying the rewrite rule):
3272 ML "simp_depth_limit := n"
3273 where n is an integer. Thus you can force termination where previously
3274 the simplifier would diverge.
3276 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3278 - No longer aborts on failed congruence proof. Instead, the
3279 congruence is ignored.
3281 * Pure: New generic framework for extracting programs from constructive
3282 proofs. See HOL/Extraction.thy for an example instantiation, as well
3283 as HOL/Extraction for some case studies.
3285 * Pure: The main goal of the proof state is no longer shown by default, only
3286 the subgoals. This behaviour is controlled by a new flag.
3287 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3288 (ML: Proof.show_main_goal).
3290 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3291 rules whose conclusion matches subgoal 1:
3292 PG menu: Isabelle/Isar -> Show me -> matching rules
3293 The rules are ordered by how closely they match the subgoal.
3294 In particular, rules that solve a subgoal outright are displayed first
3295 (or rather last, the way they are printed).
3296 (ML: ProofGeneral.print_intros())
3298 * Pure: New flag trace_unify_fail causes unification to print
3299 diagnostic information (PG: in trace buffer) when it fails. This is
3300 useful for figuring out why single step proofs like rule, erule or
3303 * Pure: Locale specifications now produce predicate definitions
3304 according to the body of text (covering assumptions modulo local
3305 definitions); predicate "loc_axioms" covers newly introduced text,
3306 while "loc" is cumulative wrt. all included locale expressions; the
3307 latter view is presented only on export into the global theory
3308 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3309 on the old view without predicates;
3311 * Pure: predefined locales "var" and "struct" are useful for sharing
3312 parameters (as in CASL, for example); just specify something like
3313 ``var x + var y + struct M'' as import;
3315 * Pure: improved thms_containing: proper indexing of facts instead of
3316 raw theorems; check validity of results wrt. current name space;
3317 include local facts of proof configuration (also covers active
3318 locales), cover fixed variables in index; may use "_" in term
3319 specification; an optional limit for the number of printed facts may
3320 be given (the default is 40);
3322 * Pure: disallow duplicate fact bindings within new-style theory files
3325 * Provers: improved induct method: assumptions introduced by case
3326 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3327 the goal statement); "foo" still refers to all facts collectively;
3329 * Provers: the function blast.overloaded has been removed: all constants
3330 are regarded as potentially overloaded, which improves robustness in exchange
3331 for slight decrease in efficiency;
3333 * Provers/linorder: New generic prover for transitivity reasoning over
3334 linear orders. Note: this prover is not efficient!
3336 * Isar: preview of problems to finish 'show' now produce an error
3337 rather than just a warning (in interactive mode);
3344 - Produces a counter example if it cannot prove a goal.
3345 Note that the counter example may be spurious if the goal is not a formula
3346 of quantifier-free linear arithmetic.
3347 In ProofGeneral the counter example appears in the trace buffer.
3349 - Knows about div k and mod k where k is a numeral of type nat or int.
3351 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3352 linear arithmetic fails. This takes account of quantifiers and divisibility.
3353 Presburger arithmetic can also be called explicitly via presburger(_tac).
3355 * simp's arithmetic capabilities have been enhanced a bit: it now
3356 takes ~= in premises into account (by performing a case split);
3358 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3359 are distributed over a sum of terms;
3361 * New tactic "trans_tac" and method "trans" instantiate
3362 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3365 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3366 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3368 * 'typedef' command has new option "open" to suppress the set
3371 * functions Min and Max on finite sets have been introduced (theory
3374 * attribute [symmetric] now works for relations as well; it turns
3375 (x,y) : R^-1 into (y,x) : R, and vice versa;
3377 * induct over a !!-quantified statement (say !!x1..xn):
3378 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3380 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3381 %x. None. Warning: empty_def now refers to the previously hidden definition
3384 * Algebra: formalization of classical algebra. Intended as base for
3385 any algebraic development in Isabelle. Currently covers group theory
3386 (up to Sylow's theorem) and ring theory (Universal Property of
3387 Univariate Polynomials). Contributions welcome;
3389 * GroupTheory: deleted, since its material has been moved to Algebra;
3391 * Complex: new directory of the complex numbers with numeric constants,
3392 nonstandard complex numbers, and some complex analysis, standard and
3393 nonstandard (Jacques Fleuriot);
3395 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3397 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3400 * Real/HahnBanach: updated and adapted to locales;
3402 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3405 * UNITY: added the Meier-Sanders theory of progress sets;
3407 * MicroJava: bytecode verifier and lightweight bytecode verifier
3408 as abstract algorithms, instantiated to the JVM;
3410 * Bali: Java source language formalization. Type system, operational
3411 semantics, axiomatic semantics. Supported language features:
3412 classes, interfaces, objects,virtual methods, static methods,
3413 static/instance fields, arrays, access modifiers, definite
3414 assignment, exceptions.
3419 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3422 * Main ZF: virtually all theories converted to new-style format;
3427 * Pure: Tactic.prove provides sane interface for internal proofs;
3428 omits the infamous "standard" operation, so this is more appropriate
3429 than prove_goalw_cterm in many situations (e.g. in simprocs);
3431 * Pure: improved error reporting of simprocs;
3433 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3437 *** Document preparation ***
3439 * uses \par instead of \\ for line breaks in theory text. This may
3440 shift some page breaks in large documents. To get the old behaviour
3441 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3443 * minimized dependencies of isabelle.sty and isabellesym.sty on
3446 * \<euro> now needs package babel/greek instead of marvosym (which
3449 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3454 New in Isabelle2002 (March 2002)
3455 --------------------------------
3457 *** Document preparation ***
3459 * greatly simplified document preparation setup, including more
3460 graceful interpretation of isatool usedir -i/-d/-D options, and more
3461 instructive isatool mkdir; users should basically be able to get
3462 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3463 users may run a separate document processing stage manually like this:
3464 "isatool usedir -D output HOL Test && isatool document Test/output";
3466 * theory dependency graph may now be incorporated into documents;
3467 isatool usedir -g true will produce session_graph.eps/.pdf for use
3468 with \includegraphics of LaTeX;
3470 * proper spacing of consecutive markup elements, especially text
3471 blocks after section headings;
3473 * support bold style (for single symbols only), input syntax is like
3474 this: "\<^bold>\<alpha>" or "\<^bold>A";
3476 * \<bullet> is now output as bold \cdot by default, which looks much
3477 better in printed text;
3479 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3480 note that these symbols are currently unavailable in Proof General /
3481 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3483 * isatool latex no longer depends on changed TEXINPUTS, instead
3484 isatool document copies the Isabelle style files to the target
3490 * Pure/Provers: improved proof by cases and induction;
3491 - 'case' command admits impromptu naming of parameters (such as
3493 - 'induct' method divinates rule instantiation from the inductive
3494 claim; no longer requires excessive ?P bindings for proper
3495 instantiation of cases;
3496 - 'induct' method properly enumerates all possibilities of set/type
3497 rules; as a consequence facts may be also passed through *type*
3498 rules without further ado;
3499 - 'induct' method now derives symbolic cases from the *rulified*
3500 rule (before it used to rulify cases stemming from the internal
3501 atomized version); this means that the context of a non-atomic
3502 statement becomes is included in the hypothesis, avoiding the
3503 slightly cumbersome show "PROP ?case" form;
3504 - 'induct' may now use elim-style induction rules without chaining
3505 facts, using ``missing'' premises from the goal state; this allows
3506 rules stemming from inductive sets to be applied in unstructured
3507 scripts, while still benefitting from proper handling of non-atomic
3508 statements; NB: major inductive premises need to be put first, all
3509 the rest of the goal is passed through the induction;
3510 - 'induct' proper support for mutual induction involving non-atomic
3511 rule statements (uses the new concept of simultaneous goals, see
3513 - append all possible rule selections, but only use the first
3514 success (no backtracking);
3515 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3516 - undeclared rule case names default to numbers 1, 2, 3, ...;
3517 - added 'print_induct_rules' (covered by help item in recent Proof
3519 - moved induct/cases attributes to Pure, methods to Provers;
3520 - generic method setup instantiated for FOL and HOL;
3522 * Pure: support multiple simultaneous goal statements, for example
3523 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3524 meta-level mechanism, this acts as if several individual goals had
3525 been stated separately; in particular common proof methods need to be
3526 repeated in order to cover all claims; note that a single elimination
3527 step is *not* sufficient to establish the two conjunctions, so this
3530 assume "A & B" then have A and B .. (*".." fails*)
3532 better use "obtain" in situations as above; alternative refer to
3533 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3535 * Pure: proper integration with ``locales''; unlike the original
3536 version by Florian Kammller, Isar locales package high-level proof
3537 contexts rather than raw logical ones (e.g. we admit to include
3538 attributes everywhere); operations on locales include merge and
3539 rename; support for implicit arguments (``structures''); simultaneous
3540 type-inference over imports and text; see also HOL/ex/Locales.thy for
3543 * Pure: the following commands have been ``localized'', supporting a
3544 target locale specification "(in name)": 'lemma', 'theorem',
3545 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3546 stored both within the locale and at the theory level (exported and
3547 qualified by the locale name);
3549 * Pure: theory goals may now be specified in ``long'' form, with
3550 ad-hoc contexts consisting of arbitrary locale elements. for example
3551 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3552 definitions may be given, too); the result is a meta-level rule with
3553 the context elements being discharged in the obvious way;
3555 * Pure: new proof command 'using' allows to augment currently used
3556 facts after a goal statement ('using' is syntactically analogous to
3557 'apply', but acts on the goal's facts only); this allows chained facts
3558 to be separated into parts given before and after a claim, as in
3559 ``from a and b have C using d and e <proof>'';
3561 * Pure: renamed "antecedent" case to "rule_context";
3563 * Pure: new 'judgment' command records explicit information about the
3564 object-logic embedding (used by several tools internally); no longer
3565 use hard-wired "Trueprop";
3567 * Pure: added 'corollary' command;
3569 * Pure: fixed 'token_translation' command;
3571 * Pure: removed obsolete 'exported' attribute;
3573 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3574 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3575 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3577 * Pure: method 'atomize' presents local goal premises as object-level
3578 statements (atomic meta-level propositions); setup controlled via
3579 rewrite rules declarations of 'atomize' attribute; example
3580 application: 'induct' method with proper rule statements in improper
3583 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3584 now consider the syntactic context of assumptions, giving a better
3585 chance to get type-inference of the arguments right (this is
3586 especially important for locales);
3588 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3591 * Pure/obtain: the formal conclusion "thesis", being marked as
3592 ``internal'', may no longer be reference directly in the text;
3593 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3596 * Pure: generic 'sym' attribute which declares a rule both as pure
3597 'elim?' and for the 'symmetric' operation;
3599 * Pure: marginal comments ``--'' may now occur just anywhere in the
3600 text; the fixed correlation with particular command syntax has been
3603 * Pure: new method 'rules' is particularly well-suited for proof
3604 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3605 but often produces more compact proof terms with less detours;
3607 * Pure/Provers/classical: simplified integration with pure rule
3608 attributes and methods; the classical "intro?/elim?/dest?"
3609 declarations coincide with the pure ones; the "rule" method no longer
3610 includes classically swapped intros; "intro" and "elim" methods no
3611 longer pick rules from the context; also got rid of ML declarations
3612 AddXIs/AddXEs/AddXDs; all of this has some potential for
3615 * Provers/classical: attribute 'swapped' produces classical inversions
3616 of introduction rules;
3618 * Provers/simplifier: 'simplified' attribute may refer to explicit
3619 rules instead of full simplifier context; 'iff' attribute handles
3622 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3624 * HOL: 'recdef' now fails on unfinished automated proofs, use
3625 "(permissive)" option to recover old behavior;
3627 * HOL: 'inductive' no longer features separate (collective) attributes
3628 for 'intros' (was found too confusing);
3630 * HOL: properly declared induction rules less_induct and
3636 * HOL: moved over to sane numeral syntax; the new policy is as
3639 - 0 and 1 are polymorphic constants, which are defined on any
3640 numeric type (nat, int, real etc.);
3642 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3643 binary representation internally;
3645 - type nat has special constructor Suc, and generally prefers Suc 0
3646 over 1::nat and Suc (Suc 0) over 2::nat;
3648 This change may cause significant problems of INCOMPATIBILITY; here
3649 are some hints on converting existing sources:
3651 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3652 entities, so expressions involving "-" (unary or binary minus) need
3653 to be spaced properly;
3655 - existing occurrences of "1" may need to be constraint "1::nat" or
3656 even replaced by Suc 0; similar for old "2";
3658 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3660 - remove all special provisions on numerals in proofs;
3662 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3663 representation (depends on bin_arith_simps in the default context);
3665 * HOL: symbolic syntax for x^2 (numeral 2);
3667 * HOL: the class of all HOL types is now called "type" rather than
3668 "term"; INCOMPATIBILITY, need to adapt references to this type class
3669 in axclass/classes, instance/arities, and (usually rare) occurrences
3670 in typings (of consts etc.); internally the class is called
3671 "HOL.type", ML programs should refer to HOLogic.typeS;
3673 * HOL/record package improvements:
3674 - new derived operations "fields" to build a partial record section,
3675 "extend" to promote a fixed record to a record scheme, and
3676 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3677 declared as simp by default;
3678 - shared operations ("more", "fields", etc.) now need to be always
3679 qualified) --- potential INCOMPATIBILITY;
3680 - removed "make_scheme" operations (use "make" with "extend") --
3682 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3683 - provides cases/induct rules for use with corresponding Isar
3684 methods (for concrete records, record schemes, concrete more
3685 parts, and schematic more parts -- in that order);
3686 - internal definitions directly based on a light-weight abstract
3687 theory of product types over typedef rather than datatype;
3689 * HOL: generic code generator for generating executable ML code from
3690 specifications; specific support for HOL constructs such as inductive
3691 datatypes and sets, as well as recursive functions; can be invoked
3692 via 'generate_code' theory section;
3694 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3696 * HOL: consolidated and renamed several theories. In particular:
3697 Ord.thy has been absorbed into HOL.thy
3698 String.thy has been absorbed into List.thy
3700 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3701 (beware of argument permutation!);
3703 * HOL: linorder_less_split superseded by linorder_cases;
3705 * HOL/List: "nodups" renamed to "distinct";
3707 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3708 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3709 - Ex_def has changed, now need to use some_eq_ex
3711 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3712 in this (rare) case use:
3714 delSWrapper "split_all_tac"
3715 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3717 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3720 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3721 Isabelle's type classes, ^ on functions and relations has too general
3722 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3723 necessary to attach explicit type constraints;
3725 * HOL/Relation: the prefix name of the infix "O" has been changed from
3726 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3727 renamed accordingly (eg "compI" -> "rel_compI").
3729 * HOL: syntax translations now work properly with numerals and records
3732 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3733 of "lam" -- INCOMPATIBILITY;
3735 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3736 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3737 renamed "Product_Type.unit";
3739 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3741 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3742 the "cases" method);
3744 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3747 * HOL/IMP: updated and converted to new-style theory format; several
3748 parts turned into readable document, with proper Isar proof texts and
3749 some explanations (by Gerwin Klein);
3751 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3753 * HOL-Hyperreal is now a logic image;
3758 * Isar: consts/constdefs supports mixfix syntax for continuous
3761 * Isar: domain package adapted to new-style theory format, e.g. see
3764 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3765 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3766 lift.induct_tac, always use UU instead of Undef;
3768 * HOLCF/IMP: updated and converted to new-style theory;
3773 * Isar: proper integration of logic-specific tools and packages,
3774 including theory commands '(co)inductive', '(co)datatype',
3775 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
3776 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
3778 * theory Main no longer includes AC; for the Axiom of Choice, base
3779 your theory on Main_ZFC;
3781 * the integer library now covers quotients and remainders, with many
3782 laws relating division to addition, multiplication, etc.;
3784 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
3785 typeless version of the formalism;
3787 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
3790 * ZF/Induct: new directory for examples of inductive definitions,
3791 including theory Multiset for multiset orderings; converted to
3792 new-style theory format;
3794 * ZF: many new theorems about lists, ordinals, etc.;
3799 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
3800 variable proof controls level of detail: 0 = no proofs (only oracle
3801 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
3802 also ref manual for further ML interfaces;
3804 * Pure/axclass: removed obsolete ML interface
3805 goal_subclass/goal_arity;
3807 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
3808 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
3809 separate tokens, so expressions involving minus need to be spaced
3812 * Pure/syntax: support non-oriented infixes, using keyword "infix"
3813 rather than "infixl" or "infixr";
3815 * Pure/syntax: concrete syntax for dummy type variables admits genuine
3816 sort constraint specifications in type inference; e.g. "x::_::foo"
3817 ensures that the type of "x" is of sort "foo" (but not necessarily a
3820 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
3821 control output of nested => (types); the default behavior is
3824 * Pure/syntax: builtin parse translation for "_constify" turns valued
3825 tokens into AST constants;
3827 * Pure/syntax: prefer later declarations of translations and print
3828 translation functions; potential INCOMPATIBILITY: need to reverse
3829 multiple declarations for same syntax element constant;
3831 * Pure/show_hyps reset by default (in accordance to existing Isar
3834 * Provers/classical: renamed addaltern to addafter, addSaltern to
3837 * Provers/clasimp: ``iff'' declarations now handle conditional rules
3840 * system: tested support for MacOS X; should be able to get Isabelle +
3841 Proof General to work in a plain Terminal after installing Poly/ML
3842 (e.g. from the Isabelle distribution area) and GNU bash alone
3843 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
3844 support requires further installations, e.g. from
3845 http://fink.sourceforge.net/);
3847 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
3849 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
3850 of 40 MB), cf. ML_OPTIONS;
3852 * system: Proof General keywords specification is now part of the
3853 Isabelle distribution (see etc/isar-keywords.el);
3855 * system: support for persistent Proof General sessions (refrain from
3856 outdating all loaded theories on startup); user may create writable
3857 logic images like this: ``isabelle -q HOL Test'';
3859 * system: smart selection of Isabelle process versus Isabelle
3860 interface, accommodates case-insensitive file systems (e.g. HFS+); may
3861 run both "isabelle" and "Isabelle" even if file names are badly
3862 damaged (executable inspects the case of the first letter of its own
3863 name); added separate "isabelle-process" and "isabelle-interface";
3865 * system: refrain from any attempt at filtering input streams; no
3866 longer support ``8bit'' encoding of old isabelle font, instead proper
3867 iso-latin characters may now be used; the related isatools
3868 "symbolinput" and "nonascii" have disappeared as well;
3870 * system: removed old "xterm" interface (the print modes "xterm" and
3871 "xterm_color" are still available for direct use in a suitable
3876 New in Isabelle99-2 (February 2001)
3877 -----------------------------------
3879 *** Overview of INCOMPATIBILITIES ***
3881 * HOL: please note that theories in the Library and elsewhere often use the
3882 new-style (Isar) format; to refer to their theorems in an ML script you must
3883 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
3885 * HOL: inductive package no longer splits induction rule aggressively,
3886 but only as far as specified by the introductions given; the old
3887 format may be recovered via ML function complete_split_rule or attribute
3888 'split_rule (complete)';
3890 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
3891 gfp_Tarski to gfp_unfold;
3893 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
3895 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
3896 relation); infix "^^" has been renamed "``"; infix "``" has been
3897 renamed "`"; "univalent" has been renamed "single_valued";
3899 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
3902 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
3904 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
3906 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
3907 consequence, it is no longer monotonic wrt. the local goal context
3908 (which is now passed through the inductive cases);
3910 * Document preparation: renamed standard symbols \<ll> to \<lless> and
3911 \<gg> to \<ggreater>;
3914 *** Document preparation ***
3916 * \isabellestyle{NAME} selects version of Isabelle output (currently
3917 available: are "it" for near math-mode best-style output, "sl" for
3918 slanted text style, and "tt" for plain type-writer; if no
3919 \isabellestyle command is given, output is according to slanted
3922 * support sub/super scripts (for single symbols only), input syntax is
3923 like this: "A\<^sup>*" or "A\<^sup>\<star>";
3925 * some more standard symbols; see Appendix A of the system manual for
3926 the complete list of symbols defined in isabellesym.sty;
3928 * improved isabelle style files; more abstract symbol implementation
3929 (should now use \isamath{...} and \isatext{...} in custom symbol
3932 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
3933 state; Note that presentation of goal states does not conform to
3934 actual human-readable proof documents. Please do not include goal
3935 states into document output unless you really know what you are doing!
3937 * proper indentation of antiquoted output with proportional LaTeX
3940 * no_document ML operator temporarily disables LaTeX document
3943 * isatool unsymbolize tunes sources for plain ASCII communication;
3948 * Pure: Isar now suffers initial goal statements to contain unbound
3949 schematic variables (this does not conform to actual readable proof
3950 documents, due to unpredictable outcome and non-compositional proof
3951 checking); users who know what they are doing may use schematic goals
3952 for Prolog-style synthesis of proven results;
3954 * Pure: assumption method (an implicit finishing) now handles actual
3957 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
3958 initial goal, declare "that" only as Pure intro (only for single
3959 steps); the "that" rule assumption may now be involved in implicit
3960 finishing, thus ".." becomes a feasible for trivial obtains;
3962 * Pure: default proof step now includes 'intro_classes'; thus trivial
3963 instance proofs may be performed by "..";
3965 * Pure: ?thesis / ?this / "..." now work for pure meta-level
3968 * Pure: more robust selection of calculational rules;
3970 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
3971 rule (as well as the assumption rule);
3973 * Pure: 'thm_deps' command visualizes dependencies of theorems and
3974 lemmas, using the graph browser tool;
3976 * Pure: predict failure of "show" in interactive mode;
3978 * Pure: 'thms_containing' now takes actual terms as arguments;
3980 * HOL: improved method 'induct' --- now handles non-atomic goals
3981 (potential INCOMPATIBILITY); tuned error handling;
3983 * HOL: cases and induct rules now provide explicit hints about the
3984 number of facts to be consumed (0 for "type" and 1 for "set" rules);
3985 any remaining facts are inserted into the goal verbatim;
3987 * HOL: local contexts (aka cases) may now contain term bindings as
3988 well; the 'cases' and 'induct' methods new provide a ?case binding for
3989 the result to be shown in each case;
3991 * HOL: added 'recdef_tc' command;
3993 * isatool convert assists in eliminating legacy ML scripts;
3998 * HOL/Library: a collection of generic theories to be used together
3999 with main HOL; the theory loader path already includes this directory
4000 by default; the following existing theories have been moved here:
4001 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4002 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4004 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4005 modelling and verification task performed in Isabelle/HOL +
4006 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4008 * HOL/Algebra: special summation operator SUM no longer exists, it has
4009 been replaced by setsum; infix 'assoc' now has priority 50 (like
4010 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4011 'domain', this makes the theory consistent with mathematical
4014 * HOL basics: added overloaded operations "inverse" and "divide"
4015 (infix "/"), syntax for generic "abs" operation, generic summation
4018 * HOL/typedef: simplified package, provide more useful rules (see also
4021 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4022 now expressed as a proper nested rule (old-style tactic scripts may
4023 require atomize_strip_tac to cope with non-atomic premises);
4025 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4026 to "split_conv" (old name still available for compatibility);
4028 * HOL: improved concrete syntax for strings (e.g. allows translation
4029 rules with string literals);
4031 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4032 and Fleuriot's mechanization of analysis, including the transcendental
4033 functions for the reals;
4035 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4040 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4041 "lam" is displayed as TWO lambda-symbols
4043 * CTT: theory Main now available, containing everything (that is, Bool
4049 * Pure: the Simplifier has been implemented properly as a derived rule
4050 outside of the actual kernel (at last!); the overall performance
4051 penalty in practical applications is about 50%, while reliability of
4052 the Isabelle inference kernel has been greatly improved;
4054 * print modes "brackets" and "no_brackets" control output of nested =>
4055 (types) and ==> (props); the default behaviour is "brackets";
4057 * Provers: fast_tac (and friends) now handle actual object-logic rules
4058 as assumptions as well;
4060 * system: support Poly/ML 4.0;
4062 * system: isatool install handles KDE version 1 or 2;
4066 New in Isabelle99-1 (October 2000)
4067 ----------------------------------
4069 *** Overview of INCOMPATIBILITIES ***
4071 * HOL: simplification of natural numbers is much changed; to partly
4072 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4073 issue the following ML commands:
4075 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4076 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4078 * HOL: simplification no longer dives into case-expressions; this is
4079 controlled by "t.weak_case_cong" for each datatype t;
4081 * HOL: nat_less_induct renamed to less_induct;
4083 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4084 fixsome to patch .thy and .ML sources automatically;
4086 select_equality -> some_equality
4087 select_eq_Ex -> some_eq_ex
4088 selectI2EX -> someI2_ex
4091 select1_equality -> some1_equality
4092 Eps_sym_eq -> some_sym_eq_trivial
4093 Eps_eq -> some_eq_trivial
4095 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4097 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4100 * HOL: the recursion equations generated by 'recdef' are now called
4101 f.simps instead of f.rules;
4103 * HOL: qed_spec_mp now also handles bounded ALL as well;
4105 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4106 sometimes be needed;
4108 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4110 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4112 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4113 product is now "<*>" instead of "Times"; the lexicographic product is
4114 now "<*lex*>" instead of "**";
4116 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4117 of main HOL, but was unused); better use HOL's datatype package;
4119 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4120 the old syntax may be recovered as follows:
4123 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4124 (infixl "\\<oplus>" 100)
4126 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4128 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4129 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4132 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4133 changed from A/r to A//r;
4135 * ZF: new treatment of arithmetic (nat & int) may break some old
4138 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4139 rulify -> rule_format, elimify -> elim_format, ...);
4141 * Isar/Provers: intro/elim/dest attributes changed; renamed
4142 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4143 should have to change intro!! to intro? only); replaced "delrule" by
4146 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4148 * Provers: strengthened force_tac by using new first_best_tac;
4150 * LaTeX document preparation: several changes of isabelle.sty (see
4154 *** Document preparation ***
4156 * formal comments (text blocks etc.) in new-style theories may now
4157 contain antiquotations of thm/prop/term/typ/text to be presented
4158 according to latex print mode; concrete syntax is like this:
4159 @{term[show_types] "f(x) = a + x"};
4161 * isatool mkdir provides easy setup of Isabelle session directories,
4162 including proper document sources;
4164 * generated LaTeX sources are now deleted after successful run
4165 (isatool document -c); may retain a copy somewhere else via -D option
4168 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4169 style files, achieving self-contained LaTeX sources and simplifying
4172 * old-style theories now produce (crude) LaTeX output as well;
4174 * browser info session directories are now self-contained (may be put
4175 on WWW server seperately); improved graphs of nested sessions; removed
4176 graph for 'all sessions';
4178 * several improvements in isabelle style files; \isabellestyle{it}
4179 produces fake math mode output; \isamarkupheader is now \section by
4180 default; see lib/texinputs/isabelle.sty etc.;
4185 * Isar/Pure: local results and corresponding term bindings are now
4186 subject to Hindley-Milner polymorphism (similar to ML); this
4187 accommodates incremental type-inference very nicely;
4189 * Isar/Pure: new derived language element 'obtain' supports
4190 generalized existence reasoning;
4192 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4193 support accumulation of results, without applying any rules yet;
4194 useful to collect intermediate results without explicit name
4195 references, and for use with transitivity rules with more than 2
4198 * Isar/Pure: scalable support for case-analysis type proofs: new
4199 'case' language element refers to local contexts symbolically, as
4200 produced by certain proof methods; internally, case names are attached
4201 to theorems as "tags";
4203 * Isar/Pure: theory command 'hide' removes declarations from
4204 class/type/const name spaces;
4206 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4207 indicate potential overloading;
4209 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4211 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4212 "{a,b,c}" instead of {a,b,c};
4214 * Isar/Pure now provides its own version of intro/elim/dest
4215 attributes; useful for building new logics, but beware of confusion
4216 with the version in Provers/classical;
4218 * Isar/Pure: the local context of (non-atomic) goals is provided via
4219 case name 'antecedent';
4221 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4222 to the current context is now done automatically);
4224 * Isar/Pure: theory command 'method_setup' provides a simple interface
4225 for definining proof methods in ML;
4227 * Isar/Provers: intro/elim/dest attributes changed; renamed
4228 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4229 most cases, one should have to change intro!! to intro? only);
4230 replaced "delrule" by "rule del";
4232 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4233 'symmetric' attribute (the latter supercedes [RS sym]);
4235 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4236 method modifier); 'simp' method: 'only:' modifier removes loopers as
4237 well (including splits);
4239 * Isar/Provers: Simplifier and Classical methods now support all kind
4240 of modifiers used in the past, including 'cong', 'iff', etc.
4242 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4243 of Simplifier and Classical reasoner);
4245 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4246 now support named cases; major packages (inductive, datatype, primrec,
4247 recdef) support case names and properly name parameters;
4249 * Isar/HOL: new transitivity rules for substitution in inequalities --
4250 monotonicity conditions are extracted to be proven at end of
4253 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4256 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4257 split_if split_if_asm; datatype package provides theorems foo.splits =
4258 foo.split foo.split_asm for each datatype;
4260 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4261 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4262 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4263 use "(cases (simplified))" method in proper proof texts);
4265 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4267 * Isar: names of theorems etc. may be natural numbers as well;
4269 * Isar: 'pr' command: optional arguments for goals_limit and
4270 ProofContext.prems_limit; no longer prints theory contexts, but only
4273 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4274 additional print modes to be specified; e.g. "pr(latex)" will print
4275 proof state according to the Isabelle LaTeX style;
4277 * Isar: improved support for emulating tactic scripts, including proof
4278 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4279 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4280 (for HOL datatypes);
4282 * Isar: simplified (more robust) goal selection of proof methods: 1st
4283 goal, all goals, or explicit goal specifier (tactic emulation); thus
4284 'proof method scripts' have to be in depth-first order;
4286 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4288 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4289 should instead use individual commands for printing items
4290 (print_commands, print_methods etc.);
4292 * Isar: added 'nothing' --- the empty list of theorems;
4297 * HOL/MicroJava: formalization of a fragment of Java, together with a
4298 corresponding virtual machine and a specification of its bytecode
4299 verifier and a lightweight bytecode verifier, including proofs of
4300 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4301 Cornelia Pusch (see also the homepage of project Bali at
4302 http://isabelle.in.tum.de/Bali/);
4304 * HOL/Algebra: new theory of rings and univariate polynomials, by
4307 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4308 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4311 * HOL/Lattice: fundamental concepts of lattice theory and order
4312 structures, including duals, properties of bounds versus algebraic
4313 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4314 Theorem for complete lattices etc.; may also serve as a demonstration
4315 for abstract algebraic reasoning using axiomatic type classes, and
4316 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4318 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4321 * HOL/IMPP: extension of IMP with local variables and mutually
4322 recursive procedures, by David von Oheimb;
4324 * HOL/Lambda: converted into new-style theory and document;
4326 * HOL/ex/Multiquote: example of multiple nested quotations and
4327 anti-quotations -- basically a generalized version of de-Bruijn
4328 representation; very useful in avoiding lifting of operations;
4330 * HOL/record: added general record equality rule to simpset; fixed
4331 select-update simplification procedure to handle extended records as
4332 well; admit "r" as field name;
4334 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4335 other numeric types and also as the identity of groups, rings, etc.;
4337 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4338 Types nat and int belong to this axclass;
4340 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4341 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4342 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4343 two terms #m*u and #n*u are replaced by #(m+n)*u
4344 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4345 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4346 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4348 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4349 powerful prover for predicate logic but knows nothing of clasets; see
4350 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4352 * HOL: new version of "case_tac" subsumes both boolean case split and
4353 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4354 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4356 * HOL: simplification no longer dives into case-expressions: only the
4357 selector expression is simplified, but not the remaining arms; to
4358 enable full simplification of case-expressions for datatype t, you may
4359 remove t.weak_case_cong from the simpset, either globally (Delcongs
4360 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4362 * HOL/recdef: the recursion equations generated by 'recdef' for
4363 function 'f' are now called f.simps instead of f.rules; if all
4364 termination conditions are proved automatically, these simplification
4365 rules are added to the simpset, as in primrec; rules may be named
4366 individually as well, resulting in a separate list of theorems for
4369 * HOL/While is a new theory that provides a while-combinator. It
4370 permits the definition of tail-recursive functions without the
4371 provision of a termination measure. The latter is necessary once the
4372 invariant proof rule for while is applied.
4374 * HOL: new (overloaded) notation for the set of elements below/above
4375 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4377 * HOL: theorems impI, allI, ballI bound as "strip";
4379 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4380 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4381 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4383 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4385 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4386 main HOL, but was unused);
4388 * HOL: fewer consts declared as global (e.g. have to refer to
4389 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4391 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4392 in case of overlap with user translations (e.g. judgements over
4393 tuples); (note that the underlying logical represenation is still
4399 * ZF: simplification automatically cancels common terms in arithmetic
4400 expressions over nat and int;
4402 * ZF: new treatment of nat to minimize type-checking: all operators
4403 coerce their operands to a natural number using the function natify,
4404 making the algebraic laws unconditional;
4406 * ZF: as above, for int: operators coerce their operands to an integer
4407 using the function intify;
4409 * ZF: the integer library now contains many of the usual laws for the
4410 orderings, including $<=, and monotonicity laws for $+ and $*;
4412 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4415 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4416 to the simplifier and classical reasoner simultaneously;
4421 * Provers: blast_tac now handles actual object-logic rules as
4422 assumptions; note that auto_tac uses blast_tac internally as well;
4424 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4425 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4427 * Provers: delrules now handles destruct rules as well (no longer need
4428 explicit make_elim);
4430 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4431 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4432 use instead the strong form,
4433 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4434 in HOL, FOL and ZF the function cla_make_elim will create such rules
4435 from destruct-rules;
4437 * Provers: Simplifier.easy_setup provides a fast path to basic
4438 Simplifier setup for new object-logics;
4440 * Pure: AST translation rules no longer require constant head on LHS;
4442 * Pure: improved name spaces: ambiguous output is qualified; support
4443 for hiding of names;
4445 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4446 XSYMBOL_HOME; no longer need to do manual configuration in most
4449 * system: compression of ML heaps images may now be controlled via -c
4450 option of isabelle and isatool usedir (currently only observed by
4453 * system: isatool installfonts may handle X-Symbol fonts as well (very
4454 useful for remote X11);
4456 * system: provide TAGS file for Isabelle sources;
4458 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4461 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4462 timing flag supersedes proof_timing and Toplevel.trace;
4464 * ML: new combinators |>> and |>>> for incremental transformations
4465 with secondary results (e.g. certain theory extensions):
4467 * ML: PureThy.add_defs gets additional argument to indicate potential
4468 overloading (usually false);
4470 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4475 New in Isabelle99 (October 1999)
4476 --------------------------------
4478 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4480 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4481 are no longer simplified. (This allows the simplifier to unfold recursive
4482 functional programs.) To restore the old behaviour, declare
4484 Delcongs [if_weak_cong];
4486 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4489 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4491 * HOL/datatype: mutual_induct_tac no longer exists --
4492 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4494 * HOL/typedef: fixed type inference for representing set; type
4495 arguments now have to occur explicitly on the rhs as type constraints;
4497 * ZF: The con_defs part of an inductive definition may no longer refer
4498 to constants declared in the same theory;
4500 * HOL, ZF: the function mk_cases, generated by the inductive
4501 definition package, has lost an argument. To simplify its result, it
4502 uses the default simpset instead of a supplied list of theorems.
4504 * HOL/List: the constructors of type list are now Nil and Cons;
4506 * Simplifier: the type of the infix ML functions
4507 setSSolver addSSolver setSolver addSolver
4508 is now simpset * solver -> simpset where `solver' is a new abstract type
4509 for packaging solvers. A solver is created via
4510 mk_solver: string -> (thm list -> int -> tactic) -> solver
4511 where the string argument is only a comment.
4516 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4517 decision procedure for linear arithmetic. Currently it is used for
4518 types `nat', `int', and `real' in HOL (see below); it can, should and
4519 will be instantiated for other types and logics as well.
4521 * The simplifier now accepts rewrite rules with flexible heads, eg
4522 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4523 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4529 * New Isabelle/Isar subsystem provides an alternative to traditional
4530 tactical theorem proving; together with the ProofGeneral/isar user
4531 interface it offers an interactive environment for developing human
4532 readable proof documents (Isar == Intelligible semi-automated
4533 reasoning); for further information see isatool doc isar-ref,
4534 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4536 * improved and simplified presentation of theories: better HTML markup
4537 (including colors), graph views in several sizes; isatool usedir now
4538 provides a proper interface for user theories (via -P option); actual
4539 document preparation based on (PDF)LaTeX is available as well (for
4540 new-style theories only); see isatool doc system for more information;
4542 * native support for Proof General, both for classic Isabelle and
4545 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4546 using the graph browser tool;
4548 * Isabelle manuals now also available as PDF;
4550 * theory loader rewritten from scratch (may not be fully
4551 bug-compatible); old loadpath variable has been replaced by show_path,
4552 add_path, del_path, reset_path functions; new operations such as
4553 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4556 * improved isatool install: option -k creates KDE application icon,
4557 option -p DIR installs standalone binaries;
4559 * added ML_PLATFORM setting (useful for cross-platform installations);
4560 more robust handling of platform specific ML images for SML/NJ;
4562 * the settings environment is now statically scoped, i.e. it is never
4563 created again in sub-processes invoked from isabelle, isatool, or
4566 * path element specification '~~' refers to '$ISABELLE_HOME';
4568 * in locales, the "assumes" and "defines" parts may be omitted if
4571 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4574 * new print_mode "HTML";
4576 * new flag show_tags controls display of tags of theorems (which are
4577 basically just comments that may be attached by some tools);
4579 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4580 mode and goal output format:
4582 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4584 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4586 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4587 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4589 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4591 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4593 * function bind_thms stores lists of theorems (cf. bind_thm);
4595 * new shorthand tactics ftac, eatac, datac, fatac;
4597 * qed (and friends) now accept "" as result name; in that case the
4598 theorem is not stored, but proper checks and presentation of the
4601 * theorem database now also indexes constants "Trueprop", "all",
4602 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4607 ** HOL arithmetic **
4609 * There are now decision procedures for linear arithmetic over nat and
4612 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4613 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4614 are treated as atomic; subformulae not involving type `nat' or `int'
4615 are ignored; quantified subformulae are ignored unless they are
4616 positive universal or negative existential. The tactic has to be
4617 invoked by hand and can be a little bit slow. In particular, the
4618 running time is exponential in the number of occurrences of `min' and
4619 `max', and `-' on `nat'.
4621 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4622 (negated) (in)equalities among the premises and the conclusion into
4623 account (i.e. no compound formulae) and does not know about `min' and
4624 `max', and `-' on `nat'. It is fast and is used automatically by the
4627 NB: At the moment, these decision procedures do not cope with mixed
4628 nat/int formulae where the two parts interact, such as `m < n ==>
4631 * HOL/Numeral provides a generic theory of numerals (encoded
4632 efficiently as bit strings); setup for types nat/int/real is in place;
4633 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4634 int, existing theories and proof scripts may require a few additional
4637 * integer division and remainder can now be performed on constant
4640 * many properties of integer multiplication, division and remainder
4643 * An interface to the Stanford Validity Checker (SVC) is available through the
4644 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4645 are proved automatically. SVC must be installed separately, and its results
4646 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4647 invocation of the underlying oracle). For SVC see
4648 http://verify.stanford.edu/SVC
4650 * IsaMakefile: the HOL-Real target now builds an actual image;
4655 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4656 (in Isabelle/Isar) -- by Gertrud Bauer;
4658 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4659 analysis for assembly languages with subtypes;
4661 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4662 -- avoids syntactic ambiguities and treats state, transition, and
4663 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4664 changed syntax and (many) tactics;
4666 * HOL/inductive: Now also handles more general introduction rules such
4667 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4668 theorems are now maintained within the theory (maintained via the
4671 * HOL/datatype: Now also handles arbitrarily branching datatypes
4672 (using function types) such as
4674 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4676 * HOL/record: record_simproc (part of the default simpset) takes care
4677 of selectors applied to updated records; record_split_tac is no longer
4678 part of the default claset; update_defs may now be removed from the
4679 simpset in many cases; COMPATIBILITY: old behavior achieved by
4681 claset_ref () := claset() addSWrapper record_split_wrapper;
4682 Delsimprocs [record_simproc]
4684 * HOL/typedef: fixed type inference for representing set; type
4685 arguments now have to occur explicitly on the rhs as type constraints;
4687 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4688 names rather than an ML expression;
4690 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4691 supplied later. Program schemes can be defined, such as
4692 "While B C s = (if B s then While B C (C s) else s)"
4693 where the well-founded relation can be chosen after B and C have been given.
4695 * HOL/List: the constructors of type list are now Nil and Cons;
4696 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4697 course, ML tools referring to List.list.op # etc. have to be adapted;
4699 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4700 disabled by default; run isabelle with option -m HOL to get back to
4701 the original Gordon/HOL-style output;
4703 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4704 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4706 * HOL basic syntax simplified (more orthogonal): all variants of
4707 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4708 Eps operator is provided as well: "SOME x. P[x]";
4710 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4712 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4713 thus available for user theories;
4715 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4716 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4719 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4720 several times and then mp;
4725 * the notation <<...>> is now available as a notation for sequences of
4728 * the simplifier is now installed
4730 * the axiom system has been generalized (thanks to Soren Heilmann)
4732 * the classical reasoner now has a default rule database
4737 * new primrec section allows primitive recursive functions to be given
4738 directly (as in HOL) over datatypes and the natural numbers;
4740 * new tactics induct_tac and exhaust_tac for induction (or case
4741 analysis) over datatypes and the natural numbers;
4743 * the datatype declaration of type T now defines the recursor T_rec;
4745 * simplification automatically does freeness reasoning for datatype
4748 * automatic type-inference, with AddTCs command to insert new
4749 type-checking rules;
4751 * datatype introduction rules are now added as Safe Introduction rules
4754 * the syntax "if P then x else y" is now available in addition to
4758 *** Internal programming interfaces ***
4760 * tuned simplifier trace output; new flag debug_simp;
4762 * structures Vartab / Termtab (instances of TableFun) offer efficient
4763 tables indexed by indexname_ord / term_ord (compatible with aconv);
4765 * AxClass.axclass_tac lost the theory argument;
4767 * tuned current_goals_markers semantics: begin / end goal avoids
4768 printing empty lines;
4770 * removed prs and prs_fn hook, which was broken because it did not
4771 include \n in its semantics, forcing writeln to add one
4772 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4773 string -> unit if you really want to output text without newline;
4775 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
4776 plain output, interface builders may have to enable 'isabelle_font'
4777 mode to get Isabelle font glyphs as before;
4779 * refined token_translation interface; INCOMPATIBILITY: output length
4780 now of type real instead of int;
4782 * theory loader actions may be traced via new ThyInfo.add_hook
4783 interface (see src/Pure/Thy/thy_info.ML); example application: keep
4784 your own database of information attached to *whole* theories -- as
4785 opposed to intra-theory data slots offered via TheoryDataFun;
4787 * proper handling of dangling sort hypotheses (at last!);
4788 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
4789 extra sort hypotheses that can be witnessed from the type signature;
4790 the force_strip_shyps flag is gone, any remaining shyps are simply
4791 left in the theorem (with a warning issued by strip_shyps_warning);
4795 New in Isabelle98-1 (October 1998)
4796 ----------------------------------
4798 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4800 * several changes of automated proof tools;
4802 * HOL: major changes to the inductive and datatype packages, including
4803 some minor incompatibilities of theory syntax;
4805 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
4808 * HOL: removed duplicate thms in Arith:
4809 less_imp_add_less should be replaced by trans_less_add1
4810 le_imp_add_le should be replaced by trans_le_add1
4812 * HOL: unary minus is now overloaded (new type constraints may be
4815 * HOL and ZF: unary minus for integers is now #- instead of #~. In
4816 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
4817 now taken as an integer constant.
4819 * Pure: ML function 'theory_of' renamed to 'theory';
4825 1. Asm_full_simp_tac is now more aggressive.
4826 1. It will sometimes reorient premises if that increases their power to
4828 2. It does no longer proceed strictly from left to right but may also
4829 rotate premises to achieve further simplification.
4830 For compatibility reasons there is now Asm_lr_simp_tac which is like the
4831 old Asm_full_simp_tac in that it does not rotate premises.
4832 2. The simplifier now knows a little bit about nat-arithmetic.
4834 * Classical reasoner: wrapper mechanism for the classical reasoner now
4835 allows for selected deletion of wrappers, by introduction of names for
4836 wrapper functionals. This implies that addbefore, addSbefore,
4837 addaltern, and addSaltern now take a pair (name, tactic) as argument,
4838 and that adding two tactics with the same name overwrites the first
4839 one (emitting a warning).
4840 type wrapper = (int -> tactic) -> (int -> tactic)
4841 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
4842 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
4843 delWrapper, delSWrapper: claset * string -> claset
4844 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
4846 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
4847 semantics; addbefore now affects only the unsafe part of step_tac
4848 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
4849 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
4852 * Classical reasoner: setwrapper to setWrapper and compwrapper to
4853 compWrapper; added safe wrapper (and access functions for it);
4855 * HOL/split_all_tac is now much faster and fails if there is nothing
4856 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
4857 and the names of the automatically generated variables have changed.
4858 split_all_tac has moved within claset() from unsafe wrappers to safe
4859 wrappers, which means that !!-bound variables are split much more
4860 aggressively, and safe_tac and clarify_tac now split such variables.
4861 If this splitting is not appropriate, use delSWrapper "split_all_tac".
4862 Note: the same holds for record_split_tac, which does the job of
4863 split_all_tac for record fields.
4865 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
4866 permanently to the default simpset using Addsplits just like
4867 Addsimps. They can be removed via Delsplits just like
4868 Delsimps. Lower-case versions are also available.
4870 * HOL/Simplifier: The rule split_if is now part of the default
4871 simpset. This means that the simplifier will eliminate all occurrences
4872 of if-then-else in the conclusion of a goal. To prevent this, you can
4873 either remove split_if completely from the default simpset by
4874 `Delsplits [split_if]' or remove it in a specific call of the
4875 simplifier using `... delsplits [split_if]'. You can also add/delete
4876 other case splitting rules to/from the default simpset: every datatype
4877 generates suitable rules `split_t_case' and `split_t_case_asm' (where
4878 t is the name of the datatype).
4880 * Classical reasoner / Simplifier combination: new force_tac (and
4881 derivatives Force_tac, force) combines rewriting and classical
4882 reasoning (and whatever other tools) similarly to auto_tac, but is
4883 aimed to solve the given subgoal completely.
4888 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
4889 and `goalw': the theory is no longer needed as an explicit argument -
4890 the current theory context is used; assumptions are no longer returned
4891 at the ML-level unless one of them starts with ==> or !!; it is
4892 recommended to convert to these new commands using isatool fixgoal
4893 (backup your sources first!);
4895 * new top-level commands 'thm' and 'thms' for retrieving theorems from
4896 the current theory context, and 'theory' to lookup stored theories;
4898 * new theory section 'locale' for declaring constants, assumptions and
4899 definitions that have local scope;
4901 * new theory section 'nonterminals' for purely syntactic types;
4903 * new theory section 'setup' for generic ML setup functions
4904 (e.g. package initialization);
4906 * the distribution now includes Isabelle icons: see
4907 lib/logo/isabelle-{small,tiny}.xpm;
4909 * isatool install - install binaries with absolute references to
4912 * isatool logo -- create instances of the Isabelle logo (as EPS);
4914 * print mode 'emacs' reserved for Isamode;
4916 * support multiple print (ast) translations per constant name;
4918 * theorems involving oracles are now printed with a suffixed [!];
4923 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
4925 * HOL/inductive package reorganized and improved: now supports mutual
4931 oddI "n : EVEN ==> Suc n : ODD"
4932 evenI "n : ODD ==> Suc n : EVEN"
4934 new theorem list "elims" contains an elimination rule for each of the
4935 recursive sets; inductive definitions now handle disjunctive premises
4936 correctly (also ZF);
4938 INCOMPATIBILITIES: requires Inductive as an ancestor; component
4939 "mutual_induct" no longer exists - the induction rule is always
4940 contained in "induct";
4943 * HOL/datatype package re-implemented and greatly improved: now
4944 supports mutually recursive datatypes such as
4947 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
4948 | SUM ('a aexp) ('a aexp)
4949 | DIFF ('a aexp) ('a aexp)
4952 'a bexp = LESS ('a aexp) ('a aexp)
4953 | AND ('a bexp) ('a bexp)
4954 | OR ('a bexp) ('a bexp)
4956 as well as indirectly recursive datatypes such as
4959 ('a, 'b) term = Var 'a
4960 | App 'b ((('a, 'b) term) list)
4962 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
4963 induction on mutually / indirectly recursive datatypes.
4965 Primrec equations are now stored in theory and can be accessed via
4966 <function_name>.simps.
4970 - Theories using datatypes must now have theory Datatype as an
4972 - The specific <typename>.induct_tac no longer exists - use the
4973 generic induct_tac instead.
4974 - natE has been renamed to nat.exhaust - use exhaust_tac
4975 instead of res_inst_tac ... natE. Note that the variable
4976 names in nat.exhaust differ from the names in natE, this
4977 may cause some "fragile" proofs to fail.
4978 - The theorems split_<typename>_case and split_<typename>_case_asm
4979 have been renamed to <typename>.split and <typename>.split_asm.
4980 - Since default sorts of type variables are now handled correctly,
4981 some datatype definitions may have to be annotated with explicit
4983 - Primrec definitions no longer require function name and type
4984 of recursive argument.
4986 Consider using isatool fixdatatype to adapt your theories and proof
4987 scripts to the new package (backup your sources first!).
4990 * HOL/record package: considerably improved implementation; now
4991 includes concrete syntax for record types, terms, updates; theorems
4992 for surjective pairing and splitting !!-bound record variables; proof
4993 support is as follows:
4995 1) standard conversions (selectors or updates applied to record
4996 constructor terms) are part of the standard simpset;
4998 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
4999 made part of standard simpset and claset via addIffs;
5001 3) a tactic for record field splitting (record_split_tac) is part of
5002 the standard claset (addSWrapper);
5004 To get a better idea about these rules you may retrieve them via
5005 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5006 the name of your record type.
5008 The split tactic 3) conceptually simplifies by the following rule:
5010 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5012 Thus any record variable that is bound by meta-all will automatically
5013 blow up into some record constructor term, consequently the
5014 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5015 solve record problems automatically.
5018 * reorganized the main HOL image: HOL/Integ and String loaded by
5019 default; theory Main includes everything;
5021 * automatic simplification of integer sums and comparisons, using cancellation;
5023 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5025 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5027 * many new identities for unions, intersections, set difference, etc.;
5029 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5030 called split_if, split_split, split_sum_case and split_nat_case (to go
5031 with add/delsplits);
5033 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5034 (?x::unit) = (); this is made part of the default simpset, which COULD
5035 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5036 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5037 unit_abs_eta_conv is added in order to counter the effect of
5038 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5041 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5044 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5045 It and 'sym RS equals0D' are now in the default claset, giving automatic
5046 disjointness reasoning but breaking a few old proofs.
5048 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5049 to 'converse' from 'inverse' (for compatibility with ZF and some
5052 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5053 the well-founded relation;
5055 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5056 Compl A. The "Compl" syntax remains available as input syntax for this
5059 * HOL/Update: new theory of function updates:
5060 f(a:=b) == %x. if x=a then b else f x
5061 may also be iterated as in f(a:=b,c:=d,...);
5063 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5066 - new function list_update written xs[i:=v] that updates the i-th
5067 list position. May also be iterated as in xs[i:=a,j:=b,...].
5068 - new function `upt' written [i..j(] which generates the list
5069 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5070 bound write [i..j], which is a shorthand for [i..j+1(].
5071 - new lexicographic orderings and corresponding wellfoundedness theorems.
5074 - removed 'pred' (predecessor) function;
5075 - generalized some theorems about n-1;
5076 - many new laws about "div" and "mod";
5077 - new laws about greatest common divisors (see theory ex/Primes);
5079 * HOL/Relation: renamed the relational operator r^-1 "converse"
5080 instead of "inverse";
5082 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5083 of the multiset ordering;
5085 * directory HOL/Real: a construction of the reals using Dedekind cuts
5086 (not included by default);
5088 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5090 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5091 programs, i.e. different program variables may have different types.
5093 * calling (stac rew i) now fails if "rew" has no effect on the goal
5094 [previously, this check worked only if the rewrite rule was unconditional]
5095 Now rew can involve either definitions or equalities (either == or =).
5100 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5101 only the theorems proved on ZF.ML;
5103 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5104 It and 'sym RS equals0D' are now in the default claset, giving automatic
5105 disjointness reasoning but breaking a few old proofs.
5107 * ZF/Update: new theory of function updates
5108 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5109 may also be iterated as in f(a:=b,c:=d,...);
5111 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5113 * calling (stac rew i) now fails if "rew" has no effect on the goal
5114 [previously, this check worked only if the rewrite rule was unconditional]
5115 Now rew can involve either definitions or equalities (either == or =).
5117 * case_tac provided for compatibility with HOL
5118 (like the old excluded_middle_tac, but with subgoals swapped)
5121 *** Internal programming interfaces ***
5123 * Pure: several new basic modules made available for general use, see
5124 also src/Pure/README;
5126 * improved the theory data mechanism to support encapsulation (data
5127 kind name replaced by private Object.kind, acting as authorization
5128 key); new type-safe user interface via functor TheoryDataFun; generic
5129 print_data function becomes basically useless;
5131 * removed global_names compatibility flag -- all theory declarations
5132 are qualified by default;
5134 * module Pure/Syntax now offers quote / antiquote translation
5135 functions (useful for Hoare logic etc. with implicit dependencies);
5136 see HOL/ex/Antiquote for an example use;
5138 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5141 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5144 * Display.print_goals function moved to Locale.print_goals;
5146 * standard print function for goals supports current_goals_markers
5147 variable for marking begin of proof, end of proof, start of goal; the
5148 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5149 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5154 New in Isabelle98 (January 1998)
5155 --------------------------------
5157 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5159 * changed lexical syntax of terms / types: dots made part of long
5160 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5162 * simpset (and claset) reference variable replaced by functions
5163 simpset / simpset_ref;
5165 * no longer supports theory aliases (via merge) and non-trivial
5166 implicit merge of thms' signatures;
5168 * most internal names of constants changed due to qualified names;
5170 * changed Pure/Sequence interface (see Pure/seq.ML);
5173 *** General Changes ***
5175 * hierachically structured name spaces (for consts, types, axms, thms
5176 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5177 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5178 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5179 long_names for fully qualified output names; NOTE: ML programs
5180 (special tactics, packages etc.) referring to internal names may have
5181 to be adapted to cope with fully qualified names; in case of severe
5182 backward campatibility problems try setting 'global_names' at compile
5183 time to have enrything declared within a flat name space; one may also
5184 fine tune name declarations in theories via the 'global' and 'local'
5187 * reimplemented the implicit simpset and claset using the new anytype
5188 data filed in signatures; references simpset:simpset ref etc. are
5189 replaced by functions simpset:unit->simpset and
5190 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5191 to patch your ML files accordingly;
5193 * HTML output now includes theory graph data for display with Java
5194 applet or isatool browser; data generated automatically via isatool
5195 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5197 * defs may now be conditional; improved rewrite_goals_tac to handle
5198 conditional equations;
5200 * defs now admits additional type arguments, using TYPE('a) syntax;
5202 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5203 creates a new theory node; implicit merge of thms' signatures is
5204 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5205 transfer:theory->thm->thm in (rare) cases;
5207 * improved handling of draft signatures / theories; draft thms (and
5208 ctyps, cterms) are automatically promoted to real ones;
5210 * slightly changed interfaces for oracles: admit many per theory, named
5211 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5213 * print_goals: optional output of const types (set show_consts and
5216 * improved output of warnings (###) and errors (***);
5218 * subgoal_tac displays a warning if the new subgoal has type variables;
5220 * removed old README and Makefiles;
5222 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5224 * removed obsolete init_pps and init_database;
5226 * deleted the obsolete tactical STATE, which was declared by
5227 fun STATE tacfun st = tacfun st st;
5229 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5230 (which abbreviates $HOME);
5232 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5233 use isatool fixseq to adapt your ML programs (this works for fully
5234 qualified references to the Sequence structure only!);
5236 * use_thy no longer requires writable current directory; it always
5237 reloads .ML *and* .thy file, if either one is out of date;
5240 *** Classical Reasoner ***
5242 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5243 tactics that use classical reasoning to simplify a subgoal without
5244 splitting it into several subgoals;
5246 * Safe_tac: like safe_tac but uses the default claset;
5251 * added simplification meta rules:
5252 (asm_)(full_)simplify: simpset -> thm -> thm;
5254 * simplifier.ML no longer part of Pure -- has to be loaded by object
5257 * added prems argument to simplification procedures;
5259 * HOL, FOL, ZF: added infix function `addsplits':
5260 instead of `<simpset> setloop (split_tac <thms>)'
5261 you can simply write `<simpset> addsplits <thms>'
5266 * TYPE('a) syntax for type reflection terms;
5268 * no longer handles consts with name "" -- declare as 'syntax' instead;
5270 * pretty printer: changed order of mixfix annotation preference (again!);
5272 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5277 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5278 with `addloop' of the simplifier to faciliate case splitting in premises.
5280 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5282 * HOL/Auth: new protocol proofs including some for the Internet
5285 * HOL/Map: new theory of `maps' a la VDM;
5287 * HOL/simplifier: simplification procedures nat_cancel_sums for
5288 cancelling out common nat summands from =, <, <= (in)equalities, or
5289 differences; simplification procedures nat_cancel_factor for
5290 cancelling common factor from =, <, <= (in)equalities over natural
5291 sums; nat_cancel contains both kinds of procedures, it is installed by
5292 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5294 * HOL/simplifier: terms of the form
5295 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5297 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5298 and those of the form
5299 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5301 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5304 Each datatype `t' now comes with a theorem `split_t_case' of the form
5306 P(t_case f1 ... fn x) =
5307 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5309 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5312 and a theorem `split_t_case_asm' of the form
5314 P(t_case f1 ... fn x) =
5315 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5317 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5319 which can be added to a simpset via `addsplits'. The existing theorems
5320 expand_list_case and expand_option_case have been renamed to
5321 split_list_case and split_option_case.
5324 - `pred n' is automatically converted to `n-1'.
5325 Users are strongly encouraged not to use `pred' any longer,
5326 because it will disappear altogether at some point.
5327 - Users are strongly encouraged to write "0 < n" rather than
5328 "n ~= 0". Theorems and proof tools have been modified towards this
5332 the function "set_of_list" has been renamed "set" (and its theorems too);
5333 the function "nth" now takes its arguments in the reverse order and
5334 has acquired the infix notation "!" as in "xs!n".
5336 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5338 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5339 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5341 * HOL/record: extensible records with schematic structural subtyping
5342 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5343 still lacks various theorems and concrete record syntax;
5348 * removed "axioms" and "generated by" sections;
5350 * replaced "ops" section by extended "consts" section, which is capable of
5351 handling the continuous function space "->" directly;
5354 . proves theorems immediately and stores them in the theory,
5355 . creates hierachical name space,
5356 . now uses normal mixfix annotations (instead of cinfix...),
5357 . minor changes to some names and values (for consistency),
5358 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5359 . separator between mutual domain defs: changed "," to "and",
5360 . improved handling of sort constraints; now they have to
5361 appear on the left-hand side of the equations only;
5363 * fixed LAM <x,y,zs>.b syntax;
5365 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5366 adm (%x. P (t x)), where P is chainfinite and t continuous;
5371 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5372 with `addloop' of the simplifier to faciliate case splitting in premises.
5374 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5375 in HOL, they strip ALL and --> from proved theorems;
5379 New in Isabelle94-8 (May 1997)
5380 ------------------------------
5382 *** General Changes ***
5384 * new utilities to build / run / maintain Isabelle etc. (in parts
5385 still somewhat experimental); old Makefiles etc. still functional;
5387 * new 'Isabelle System Manual';
5389 * INSTALL text, together with ./configure and ./build scripts;
5391 * reimplemented type inference for greater efficiency, better error
5392 messages and clean internal interface;
5394 * prlim command for dealing with lots of subgoals (an easier way of
5395 setting goals_limit);
5400 * supports alternative (named) syntax tables (parser and pretty
5401 printer); internal interface is provided by add_modesyntax(_i);
5403 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5404 be used in conjunction with the Isabelle symbol font; uses the
5405 "symbols" syntax table;
5407 * added token_translation interface (may translate name tokens in
5408 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5409 the current print_mode); IMPORTANT: user print translation functions
5410 are responsible for marking newly introduced bounds
5411 (Syntax.mark_boundT);
5413 * token translations for modes "xterm" and "xterm_color" that display
5414 names in bold, underline etc. or colors (which requires a color
5417 * infixes may now be declared with names independent of their syntax;
5419 * added typed_print_translation (like print_translation, but may
5420 access type of constant);
5423 *** Classical Reasoner ***
5425 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5426 some limitations. Blast_tac...
5427 + ignores addss, addbefore, addafter; this restriction is intrinsic
5428 + ignores elimination rules that don't have the correct format
5429 (the conclusion MUST be a formula variable)
5430 + ignores types, which can make HOL proofs fail
5431 + rules must not require higher-order unification, e.g. apply_type in ZF
5432 [message "Function Var's argument not a bound variable" relates to this]
5433 + its proof strategy is more general but can actually be slower
5435 * substitution with equality assumptions no longer permutes other
5438 * minor changes in semantics of addafter (now called addaltern); renamed
5439 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5440 (and access functions for it);
5442 * improved combination of classical reasoner and simplifier:
5443 + functions for handling clasimpsets
5444 + improvement of addss: now the simplifier is called _after_ the
5446 + safe variant of addss called addSss: uses safe simplifications
5447 _during_ the safe steps. It is more complete as it allows multiple
5448 instantiations of unknowns (e.g. with slow_tac).
5452 * added interface for simplification procedures (functions that
5453 produce *proven* rewrite rules on the fly, depending on current
5456 * ordering on terms as parameter (used for ordered rewriting);
5458 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5460 * the solver is now split into a safe and an unsafe part.
5461 This should be invisible for the normal user, except that the
5462 functions setsolver and addsolver have been renamed to setSolver and
5463 addSolver; added safe_asm_full_simp_tac;
5468 * a generic induction tactic `induct_tac' which works for all datatypes and
5469 also for type `nat';
5471 * a generic case distinction tactic `exhaust_tac' which works for all
5472 datatypes and also for type `nat';
5474 * each datatype comes with a function `size';
5476 * patterns in case expressions allow tuple patterns as arguments to
5477 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5479 * primrec now also works with type nat;
5481 * recdef: a new declaration form, allows general recursive functions to be
5482 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5484 * the constant for negation has been renamed from "not" to "Not" to
5485 harmonize with FOL, ZF, LK, etc.;
5487 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5490 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5492 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5493 problems in commutative rings, using axiomatic type classes for + and *;
5495 * more examples in HOL/MiniML and HOL/Auth;
5497 * more default rewrite rules for quantifiers, union/intersection;
5499 * a new constant `arbitrary == @x.False';
5501 * HOLCF/IOA replaces old HOL/IOA;
5503 * HOLCF changes: derived all rules and arities
5504 + axiomatic type classes instead of classes
5505 + typedef instead of faking type definitions
5506 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5507 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5508 + eliminated the types void, one, tr
5509 + use unit lift and bool lift (with translations) instead of one and tr
5510 + eliminated blift from Lift3.thy (use Def instead of blift)
5511 all eliminated rules are derived as theorems --> no visible changes ;
5516 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5517 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5518 as ZF_cs addSIs [equalityI];
5522 New in Isabelle94-7 (November 96)
5523 ---------------------------------
5525 * allowing negative levels (as offsets) in prlev and choplev;
5527 * super-linear speedup for large simplifications;
5529 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5530 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5531 FAIL); can suppress it using the command Delsimps (ex_simps @
5532 all_simps); De Morgan laws are also now included, by default;
5534 * improved printing of ==> : ~:
5536 * new object-logic "Sequents" adds linear logic, while replacing LK
5537 and Modal (thanks to Sara Kalvala);
5539 * HOL/Auth: correctness proofs for authentication protocols;
5541 * HOL: new auto_tac combines rewriting and classical reasoning (many
5542 examples on HOL/Auth);
5544 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5545 the rewriter and classical reasoner simultaneously;
5547 * function uresult no longer returns theorems in "standard" format;
5548 regain previous version by: val uresult = standard o uresult;
5555 * oracles -- these establish an interface between Isabelle and trusted
5556 external reasoners, which may deliver results as theorems;
5558 * proof objects (in particular record all uses of oracles);
5560 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5562 * "constdefs" section in theory files;
5564 * "primrec" section (HOL) no longer requires names;
5566 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5573 * reduced space requirements;
5575 * automatic HTML generation from theories;
5577 * theory files no longer require "..." (quotes) around most types;
5579 * new examples, including two proofs of the Church-Rosser theorem;
5581 * non-curried (1994) version of HOL is no longer distributed;
5588 * greatly reduced space requirements;
5590 * theory files (.thy) no longer require \...\ escapes at line breaks;
5592 * searchable theorem database (see the section "Retrieving theorems" on
5593 page 8 of the Reference Manual);
5595 * new examples, including Grabczewski's monumental case study of the
5598 * The previous version of HOL renamed to Old_HOL;
5600 * The new version of HOL (previously called CHOL) uses a curried syntax
5601 for functions. Application looks like f a b instead of f(a,b);
5603 * Mutually recursive inductive definitions finally work in HOL;
5605 * In ZF, pattern-matching on tuples is now available in all abstractions and
5606 translates to the operator "split";
5613 * new infix operator, addss, allowing the classical reasoner to
5614 perform simplification at each step of its search. Example:
5615 fast_tac (cs addss ss)
5617 * a new logic, CHOL, the same as HOL, but with a curried syntax
5618 for functions. Application looks like f a b instead of f(a,b). Also pairs
5619 look like (a,b) instead of <a,b>;
5621 * PLEASE NOTE: CHOL will eventually replace HOL!
5623 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5624 It translates to the operator "split". A new theory of integers is available;
5626 * In ZF, integer numerals now denote two's-complement binary integers.
5627 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5629 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5630 of the Axiom of Choice;
5637 * Significantly faster resolution;
5639 * the different sections in a .thy file can now be mixed and repeated
5642 * Database of theorems for FOL, HOL and ZF. New
5643 commands including qed, qed_goal and bind_thm store theorems in the database.
5645 * Simple database queries: return a named theorem (get_thm) or all theorems of
5646 a given theory (thms_of), or find out what theory a theorem was proved in
5649 * Bugs fixed in the inductive definition and datatype packages;
5651 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5652 and HOL_dup_cs obsolete;
5654 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5657 * Simpler definition of function space in ZF;
5659 * new results about cardinal and ordinal arithmetic in ZF;
5661 * 'subtype' facility in HOL for introducing new types as subsets of existing
5664 :mode=text:wrap=hard:maxLineLen=72: