* ML bindings produced via Isar commands are stored within the Isar context.
* Command 'ML_prf' is analogous to 'ML' but works within a proof context.
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * The Isabelle System Manual (system) has been updated, with formally
10 checked references as hyperlinks.
12 * Generalized Isar history, with support for linear undo, direct state
15 * Recovered hiding of consts, which was accidentally broken in
16 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
17 makes c inaccessible; consider using ``hide (open) const c'' instead.
19 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
25 * Changed defaults for unify configuration options:
27 unify_trace_bound = 50 (formerly 25)
28 unify_search_bound = 60 (formerly 30)
30 * Different bookkeeping for code equations:
31 a) On theory merge, the last set of code equations for a particular constant
32 is taken (in accordance with the policy applied by other parts of the
33 code generator framework).
34 b) Code equations stemming from explicit declarations (e.g. code attribute)
35 gain priority over default code equations stemming from definition, primrec,
39 * Global versions of theorems stemming from classes do not carry
40 a parameter prefix any longer. INCOMPATIBILITY.
42 * Dropped "locale (open)". INCOMPATBILITY.
44 * Interpretation commands no longer attempt to simplify goal.
45 INCOMPATIBILITY: in rare situations the generated goal differs. Use
46 methods intro_locales and unfold_locales to clarify.
48 * Interpretation commands no longer accept interpretation attributes.
51 * Command 'instance': attached definitions no longer accepted.
52 INCOMPATIBILITY, use proper 'instantiation' target.
54 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
56 * The 'axiomatization' command now only works within a global theory
57 context. INCOMPATIBILITY.
60 *** Document preparation ***
62 * Antiquotation @{lemma} now imitates a regular terminal proof,
63 demanding keyword 'by' and supporting the full method expression
64 syntax just like the Isar command 'by'.
69 * HOL/Main: command "value" now integrates different evaluation
70 mechanisms. The result of the first successful evaluation mechanism
71 is printed. In square brackets a particular named evaluation
72 mechanisms may be specified (currently, [SML], [code] or [nbe]). See
73 further src/HOL/ex/Eval_Examples.thy.
75 * HOL/Orderings: class "wellorder" moved here, with explicit induction
76 rule "less_induct" as assumption. For instantiation of "wellorder" by
77 means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY.
79 * HOL/Orderings: added class "preorder" as superclass of "order".
80 INCOMPATIBILITY: Instantiation proofs for order, linorder
81 etc. slightly changed. Some theorems named order_class.* now named
84 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been
85 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
86 dvd has been generalized to class comm_semiring_1. Likewise a bunch
87 of lemmas from Divides has been generalized from nat to class
88 semiring_div. INCOMPATIBILITY. This involves the following theorem
89 renames resulting from duplicate elimination:
91 dvd_def_mod ~> dvd_eq_mod_eq_0
92 zero_dvd_iff ~> dvd_0_left_iff
93 DIVISION_BY_ZERO_DIV ~> div_by_0
94 DIVISION_BY_ZERO_MOD ~> mod_by_0
95 mult_div ~> div_mult_self2_is_id
96 mult_mod ~> mod_mult_self2_is_0
98 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
99 zlcm (for int); carried together from various gcd/lcm developements in
100 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
101 corresponding theorems renamed accordingly. INCOMPATIBILY. To
102 recover tupled syntax, use syntax declarations like:
104 hide (open) const gcd
105 abbreviation gcd where
106 "gcd == (%(a, b). GCD.gcd a b)"
108 GCD.gcd ("gcd '(_, _')")
110 (analogously for lcm, zgcd, zlcm).
112 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
114 * New ML antiquotation @{code}: takes constant as argument, generates
115 corresponding code in background and inserts name of the corresponding
116 resulting ML value/function/datatype constructor binding in place.
117 All occurrences of @{code} with a single ML block are generated
118 simultaneously. Provides a generic and safe interface for
119 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
120 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
121 application. In future you ought refrain from ad-hoc compiling
122 generated SML code on the ML toplevel. Note that (for technical
123 reasons) @{code} cannot refer to constants for which user-defined
124 serializations are set. Refer to the corresponding ML counterpart
125 directly in that cases.
127 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
128 Complex_Main.thy remain as they are.
130 * New image HOL-Plain provides a minimal HOL with the most important
131 tools available (inductive, datatype, primrec, ...). By convention
132 the corresponding theory Plain should be ancestor of every further
133 (library) theory. Some library theories now have ancestor Plain
134 (instead of Main), thus theory Main occasionally has to be imported
137 * The metis method now fails in the usual manner, rather than raising
138 an exception, if it determines that it cannot prove the theorem.
140 * Methods "case_tac" and "induct_tac" now refer to the very same rules
141 as the structured Isar versions "cases" and "induct", cf. the
142 corresponding "cases" and "induct" attributes. Mutual induction rules
143 are now presented as a list of individual projections
144 (e.g. foo_bar.inducts for types foo and bar); the old format with
145 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
146 rare situations a different rule is selected --- notably nested tuple
147 elimination instead of former prod.exhaust: use explicit (case_tac t
148 rule: prod.exhaust) here.
150 * Attributes "cases", "induct", "coinduct" support "del" option.
152 * Removed fact "case_split_thm", which duplicates "case_split".
154 * Command 'rep_datatype': instead of theorem names the command now
155 takes a list of terms denoting the constructors of the type to be
156 represented as datatype. The characteristic theorems have to be
157 proven. INCOMPATIBILITY. Also observe that the following theorems
158 have disappeared in favour of existing ones:
160 unit_induct ~> unit.induct
161 prod_induct ~> prod.induct
162 sum_induct ~> sum.induct
163 Suc_Suc_eq ~> nat.inject
164 Suc_not_Zero Zero_not_Suc ~> nat.distinct
166 * Library/Nat_Infinity: added addition, numeral syntax and more
167 instantiations for algebraic structures. Removed some duplicate
168 theorems. Changes in simp rules. INCOMPATIBILITY.
170 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
176 * New locales for orders and lattices where the equivalence relation
177 is not restricted to equality. INCOMPATIBILITY: all order and
178 lattice locales use a record structure with field eq for the
181 * New theory of factorial domains.
183 * Units_l_inv and Units_r_inv are now simprules by default.
184 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
185 and/or r_inv will now also require deletion of these lemmas.
187 * Renamed the following theorems. INCOMPATIBILITY.
190 least_carrier ~> least_closed
191 greatest_carrier ~> greatest_closed
192 greatest_Lower_above ~> greatest_Lower_below
193 one_zero ~> carrier_one_zero
194 one_not_zero ~> carrier_one_not_zero (collision with assumption)
199 * Created new image HOL-NSA, containing theories of nonstandard
200 analysis which were previously part of HOL-Complex. Entry point
201 Hyperreal.thy remains valid, but theories formerly using
202 Complex_Main.thy should now use new entry point Hypercomplex.thy.
207 * Proof of Zorn's Lemma for partial orders.
212 * ML bindings produced via Isar commands are stored within the Isar
213 context (theory or proof). Consequently, commands like 'use' and 'ML'
214 become thread-safe and work with undo as expected (concerning
215 top-level bindings, not side-effects on global references).
216 INCOMPATIBILITY, need to provide proper Isar context when invoking the
217 compiler at runtime; really global bindings need to be given outside a
218 theory. [Poly/ML 5.2 or later]
220 * Command 'ML_prf' is analogous to 'ML' but works within a proof
221 context. Top-level ML bindings are stored within the proof context in
222 a purely sequential fashion, disregarding the nested proof structure.
223 ML bindings introduced by 'ML_prf' are discarded at the end of the
224 proof. [Poly/ML 5.2 or later]
226 * Generic Toplevel.add_hook interface allows to analyze the result of
227 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
228 for theorem dependency output of transactions resulting in a new
231 * Name bindings in higher specification mechanisms (notably
232 LocalTheory.define, LocalTheory.note, and derived packages) are now
233 formalized as type Name.binding, replacing old bstring.
234 INCOMPATIBILITY, need to wrap strings via Name.binding function, see
235 also Name.name_of. Packages should pass name bindings given by the
236 user to underlying specification mechanisms; this enables precise
237 tracking of source positions, for example.
239 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
240 LocalTheory.note etc.) now refer to the *full* internal name, not the
241 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
243 * Rules and tactics that read instantiations (read_instantiate,
244 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
245 context, which is required for parsing and type-checking. Moreover,
246 the variables are specified as plain indexnames, not string encodings
247 thereof. INCOMPATIBILITY.
249 * Disposed old type and term read functions (Sign.read_def_typ,
250 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
251 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
252 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
253 Syntax.read_term_global etc.; see also OldGoals.read_term as last
254 resort for legacy applications.
256 * Antiquotations: block-structured compilation context indicated by
257 \<lbrace> ... \<rbrace>; additional antiquotation forms:
259 @{let ?pat = term} - term abbreviation (HO matching)
260 @{note name = fact} - fact abbreviation
261 @{thm fact} - singleton fact (with attributes)
262 @{thms fact} - general fact (with attributes)
263 @{lemma prop by method} - singleton goal
264 @{lemma prop by meth1 meth2} - singleton goal
265 @{lemma prop1 ... propN by method} - general goal
266 @{lemma prop1 ... propN by meth1 meth2} - general goal
267 @{lemma (open) ...} - open derivation
272 * Multithreading for Poly/ML 5.1 is no longer supported, only for
273 Poly/ML 5.2 or later.
275 * The Isabelle "emacs" tool provides a specific interface to invoke
276 Proof General / Emacs, with more explicit failure if that is not
277 installed (the old isabelle-interface script silently falls back on
278 isabelle-process). The PROOFGENERAL_HOME setting determines the
279 installation location of the Proof General distribution.
281 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
282 the Isabelle process into a JVM/Scala application. See
283 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
284 process wrapper has been discontinued.)
286 * Status messages (with exact source position information) are
287 emitted, if proper markup print mode is enabled. This allows
288 user-interface components to provide detailed feedback on internal
291 * Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts.
295 New in Isabelle2008 (June 2008)
296 -------------------------------
300 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
301 and updated, with formally checked references as hyperlinks.
303 * Theory loader: use_thy (and similar operations) no longer set the
304 implicit ML context, which was occasionally hard to predict and in
305 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
306 provides a proper context already.
308 * Theory loader: old-style ML proof scripts being *attached* to a thy
309 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
310 'use' within a theory file will do the job.
312 * Name space merge now observes canonical order, i.e. the second space
313 is inserted into the first one, while existing entries in the first
314 space take precedence. INCOMPATIBILITY in rare situations, may try to
317 * Syntax: symbol \<chi> is now considered a letter. Potential
318 INCOMPATIBILITY in identifier syntax etc.
320 * Outer syntax: string tokens no longer admit escaped white space,
321 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
322 white space without escapes.
324 * Outer syntax: string tokens may contain arbitrary character codes
325 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
331 * Context-dependent token translations. Default setup reverts locally
332 fixed variables, and adds hilite markup for undeclared frees.
334 * Unused theorems can be found using the new command 'unused_thms'.
335 There are three ways of invoking it:
338 Only finds unused theorems in the current theory.
340 (2) unused_thms thy_1 ... thy_n -
341 Finds unused theorems in the current theory and all of its ancestors,
342 excluding the theories thy_1 ... thy_n and all of their ancestors.
344 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
345 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
346 their ancestors, excluding the theories thy_1 ... thy_n and all of
349 In order to increase the readability of the list produced by
350 unused_thms, theorems that have been created by a particular instance
351 of a theory command such as 'inductive' or 'function' are considered
352 to belong to the same "group", meaning that if at least one theorem in
353 this group is used, the other theorems in the same group are no longer
354 reported as unused. Moreover, if all theorems in the group are
355 unused, only one theorem in the group is displayed.
357 Note that proof objects have to be switched on in order for
358 unused_thms to work properly (i.e. !proofs must be >= 1, which is
359 usually the case when using Proof General with the default settings).
361 * Authentic naming of facts disallows ad-hoc overwriting of previous
362 theorems within the same name space. INCOMPATIBILITY, need to remove
363 duplicate fact bindings, or even accidental fact duplications. Note
364 that tools may maintain dynamically scoped facts systematically, using
365 PureThy.add_thms_dynamic.
367 * Command 'hide' now allows to hide from "fact" name space as well.
369 * Eliminated destructive theorem database, simpset, claset, and
370 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
371 update of theories within ML code.
373 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
374 INCOMPATIBILITY, object-logics depending on former Pure require
375 additional setup PureThy.old_appl_syntax_setup; object-logics
376 depending on former CPure need to refer to Pure.
378 * Commands 'use' and 'ML' are now purely functional, operating on
379 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
380 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
383 * Command 'setup': discontinued implicit version with ML reference.
385 * Instantiation target allows for simultaneous specification of class
386 instance operations together with an instantiation proof.
387 Type-checking phase allows to refer to class operations uniformly.
388 See src/HOL/Complex/Complex.thy for an Isar example and
389 src/HOL/Library/Eval.thy for an ML example.
391 * Indexing of literal facts: be more serious about including only
392 facts from the visible specification/proof context, but not the
393 background context (locale etc.). Affects `prop` notation and method
394 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
397 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
398 "(open)" option, which used to expose internal bound variables to the
401 * Isar statements: removed obsolete case "rule_context".
402 INCOMPATIBILITY, better use explicit fixes/assumes.
404 * Locale proofs: default proof step now includes 'unfold_locales';
405 hence 'proof' without argument may be used to unfold locale
409 *** Document preparation ***
411 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
412 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
413 obsolete thumbpdf setup (contemporary PDF viewers do this on the
414 spot); renamed link color from "darkblue" to "linkcolor" (default
415 value unchanged, can be redefined via \definecolor); no longer sets
416 "a4paper" option (unnecessary or even intrusive).
418 * Antiquotation @{lemma A method} proves proposition A by the given
419 method (either a method name or a method name plus (optional) method
420 arguments in parentheses) and prints A just like @{prop A}.
425 * New primrec package. Specification syntax conforms in style to
426 definition/function/.... No separate induction rule is provided. The
427 "primrec" command distinguishes old-style and new-style specifications
428 by syntax. The former primrec package is now named OldPrimrecPackage.
429 When adjusting theories, beware: constants stemming from new-style
430 primrec specifications have authentic syntax.
432 * Metis prover is now an order of magnitude faster, and also works
435 * Metis: the maximum number of clauses that can be produced from a
436 theorem is now given by the attribute max_clauses. Theorems that
437 exceed this number are ignored, with a warning printed.
439 * Sledgehammer no longer produces structured proofs by default. To
440 enable, declare [[sledgehammer_full = true]]. Attributes
441 reconstruction_modulus, reconstruction_sorts renamed
442 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
444 * Method "induct_scheme" derives user-specified induction rules
445 from well-founded induction and completeness of patterns. This factors
446 out some operations that are done internally by the function package
447 and makes them available separately. See
448 src/HOL/ex/Induction_Scheme.thy for examples.
450 * More flexible generation of measure functions for termination
451 proofs: Measure functions can be declared by proving a rule of the
452 form "is_measure f" and giving it the [measure_function] attribute.
453 The "is_measure" predicate is logically meaningless (always true), and
454 just guides the heuristic. To find suitable measure functions, the
455 termination prover sets up the goal "is_measure ?f" of the appropriate
456 type and generates all solutions by prolog-style backwards proof using
459 This setup also deals with rules like
461 "is_measure f ==> is_measure (list_size f)"
463 which accommodates nested datatypes that recurse through lists.
464 Similar rules are predeclared for products and option types.
466 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
470 - Definitions of overloaded constants on sets have to be replaced by
471 definitions on => and bool.
473 - Some definitions of overloaded operators on sets can now be proved
474 using the definitions of the operators on => and bool. Therefore,
475 the following theorems have been renamed:
477 subset_def -> subset_eq
478 psubset_def -> psubset_eq
479 set_diff_def -> set_diff_eq
480 Compl_def -> Compl_eq
481 Sup_set_def -> Sup_set_eq
482 Inf_set_def -> Inf_set_eq
483 sup_set_def -> sup_set_eq
484 inf_set_def -> inf_set_eq
486 - Due to the incompleteness of the HO unification algorithm, some
487 rules such as subst may require manual instantiation, if some of
488 the unknowns in the rule is a set.
490 - Higher order unification and forward proofs:
493 have "P (S::'a set)" <...>
494 then have "EX S. P S" ..
496 no longer works (due to the incompleteness of the HO unification
497 algorithm) and must be replaced by the pattern
504 - Calculational reasoning with subst (or similar rules):
507 have "P (S::'a set)" <...>
508 also have "S = T" <...>
511 no longer works (for similar reasons as the previous example) and
512 must be replaced by something like
514 have "P (S::'a set)" <...>
515 moreover have "S = T" <...>
516 ultimately have "P T" by simp
518 - Tactics or packages written in ML code:
519 Code performing pattern matching on types via
521 Type ("set", [T]) => ...
523 must be rewritten. Moreover, functions like strip_type or
524 binder_types no longer return the right value when applied to a
527 T1 => ... => Tn => U => bool
531 T1 => ... => Tn => U set
533 * Merged theories Wellfounded_Recursion, Accessible_Part and
534 Wellfounded_Relations to theory Wellfounded.
536 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
538 * Class finite no longer treats UNIV as class parameter. Use class
539 enum from theory Library/Enum instead to achieve a similar effect.
542 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
543 and "Cons". INCOMPATIBILITY.
545 * HOL (and FOL): renamed variables in rules imp_elim and swap.
546 Potential INCOMPATIBILITY.
548 * Theory Product_Type: duplicated lemmas split_Pair_apply and
549 injective_fst_snd removed, use split_eta and prod_eqI instead.
550 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
552 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
553 the same name in theory Orderings:
563 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
564 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
565 and different variable names.
567 * Library/Option_ord.thy: Canonical order on option type.
569 * Library/RBT.thy: Red-black trees, an efficient implementation of
572 * Library/Countable.thy: Type class for countable types.
574 * Theory Int: The representation of numerals has changed. The infix
575 operator BIT and the bit datatype with constructors B0 and B1 have
576 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
577 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
578 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
581 * Theory Nat: definition of <= and < on natural numbers no longer
582 depend on well-founded relations. INCOMPATIBILITY. Definitions
583 le_def and less_def have disappeared. Consider lemmas not_less
584 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
586 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
587 (whose purpose mainly is for various fold_set functionals) have been
588 abandoned in favor of the existing algebraic classes
589 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
590 lower_semilattice (resp. upper_semilattice) and linorder.
593 * Theory Transitive_Closure: induct and cases rules now declare proper
594 case_names ("base" and "step"). INCOMPATIBILITY.
596 * Theorem Inductive.lfp_ordinal_induct generalized to complete
597 lattices. The form set-specific version is available as
598 Inductive.lfp_ordinal_induct_set.
600 * Renamed theorems "power.simps" to "power_int.simps".
603 * Class semiring_div provides basic abstract properties of semirings
604 with division and modulo operations. Subsumes former class dvd_mod.
606 * Merged theories IntDef, Numeral and IntArith into unified theory
607 Int. INCOMPATIBILITY.
609 * Theory Library/Code_Index: type "index" now represents natural
610 numbers rather than integers. INCOMPATIBILITY.
612 * New class "uminus" with operation "uminus" (split of from class
613 "minus" which now only has operation "minus", binary).
616 * Constants "card", "internal_split", "option_map" now with authentic
617 syntax. INCOMPATIBILITY.
619 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
620 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
621 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
622 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
623 Sup_set_def, le_def, less_def, option_map_def now with object
624 equality. INCOMPATIBILITY.
626 * Records. Removed K_record, and replaced it by pure lambda term
627 %x. c. The simplifier setup is now more robust against eta expansion.
628 INCOMPATIBILITY: in cases explicitly referring to K_record.
630 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
632 * Library/ListVector: new theory of arithmetic vector operations.
634 * Library/Order_Relation: new theory of various orderings as sets of
635 pairs. Defines preorders, partial orders, linear orders and
636 well-orders on sets and on types.
641 * Renamed some theories to allow to loading both ZF and HOL in the
644 Datatype -> Datatype_ZF
645 Inductive -> Inductive_ZF
652 INCOMPATIBILITY: ZF theories that import individual theories below
653 Main might need to be adapted. Regular theory Main is still
654 available, as trivial extension of Main_ZF.
659 * ML within Isar: antiquotation @{const name} or @{const
660 name(typargs)} produces statically-checked Const term.
662 * Functor NamedThmsFun: data is available to the user as dynamic fact
663 (of the same name). Removed obsolete print command.
665 * Removed obsolete "use_legacy_bindings" function.
667 * The ``print mode'' is now a thread-local value derived from a global
668 template (the former print_mode reference), thus access becomes
669 non-critical. The global print_mode reference is for session
670 management only; user-code should use print_mode_value,
671 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
673 * Functions system/system_out provide a robust way to invoke external
674 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
675 Do not use OS.Process.system etc. from the basis library!
680 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
681 in accordance with Proof General 3.7, which prefers GNU emacs.
683 * isatool tty runs Isabelle process with plain tty interaction;
684 optional line editor may be specified via ISABELLE_LINE_EDITOR
685 setting, the default settings attempt to locate "ledit" and "rlwrap".
687 * isatool browser now works with Cygwin as well, using general
688 "javapath" function defined in Isabelle process environment.
690 * YXML notation provides a simple and efficient alternative to
691 standard XML transfer syntax. See src/Pure/General/yxml.ML and
692 isatool yxml as described in the Isabelle system manual.
694 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
695 provides general wrapper for managing an Isabelle process in a robust
696 fashion, with ``cooked'' output from stdin/stderr.
698 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
699 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
701 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
702 way of changing the user's settings is via
703 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
706 * Multithreading.max_threads := 0 refers to the number of actual CPU
707 cores of the underlying machine, which is a good starting point for
708 optimal performance tuning. The corresponding usedir option -M allows
709 "max" as an alias for "0". WARNING: does not work on certain versions
710 of Mac OS (with Poly/ML 5.1).
712 * isabelle-process: non-ML sessions are run with "nice", to reduce the
713 adverse effect of Isabelle flooding interactive front-ends (notably
714 ProofGeneral / XEmacs).
718 New in Isabelle2007 (November 2007)
719 -----------------------------------
723 * More uniform information about legacy features, notably a
724 warning/error of "Legacy feature: ...", depending on the state of the
725 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
726 legacy features will disappear eventually.
728 * Theory syntax: the header format ``theory A = B + C:'' has been
729 discontinued in favour of ``theory A imports B C begin''. Use isatool
730 fixheaders to convert existing theory files. INCOMPATIBILITY.
732 * Theory syntax: the old non-Isar theory file format has been
733 discontinued altogether. Note that ML proof scripts may still be used
734 with Isar theories; migration is usually quite simple with the ML
735 function use_legacy_bindings. INCOMPATIBILITY.
737 * Theory syntax: some popular names (e.g. 'class', 'declaration',
738 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
741 * Theory loader: be more serious about observing the static theory
742 header specifications (including optional directories), but not the
743 accidental file locations of previously successful loads. The strict
744 update policy of former update_thy is now already performed by
745 use_thy, so the former has been removed; use_thys updates several
746 theories simultaneously, just as 'imports' within a theory header
747 specification, but without merging the results. Potential
748 INCOMPATIBILITY: may need to refine theory headers and commands
749 ROOT.ML which depend on load order.
751 * Theory loader: optional support for content-based file
752 identification, instead of the traditional scheme of full physical
753 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
754 (cf. the system manual). The new scheme allows to work with
755 non-finished theories in persistent session images, such that source
756 files may be moved later on without requiring reloads.
758 * Theory loader: old-style ML proof scripts being *attached* to a thy
759 file (with the same base name as the theory) are considered a legacy
760 feature, which will disappear eventually. Even now, the theory loader
761 no longer maintains dependencies on such files.
763 * Syntax: the scope for resolving ambiguities via type-inference is
764 now limited to individual terms, instead of whole simultaneous
765 specifications as before. This greatly reduces the complexity of the
766 syntax module and improves flexibility by separating parsing and
767 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
768 'fixes' etc.) are required in rare situations.
770 * Syntax: constants introduced by new-style packages ('definition',
771 'abbreviation' etc.) are passed through the syntax module in
772 ``authentic mode''. This means that associated mixfix annotations
773 really stick to such constants, independently of potential name space
774 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
775 trees are represented slightly differently, may need to adapt syntax
776 translations accordingly. Use CONST marker in 'translations' and
777 @{const_syntax} antiquotation in 'parse_translation' etc.
779 * Legacy goal package: reduced interface to the bare minimum required
780 to keep existing proof scripts running. Most other user-level
781 functions are now part of the OldGoals structure, which is *not* open
782 by default (consider isatool expandshort before open OldGoals).
783 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
784 these tend to cause confusion about the actual goal (!) context being
785 used here, which is not necessarily the same as the_context().
787 * Command 'find_theorems': supports "*" wild-card in "name:"
788 criterion; "with_dups" option. Certain ProofGeneral versions might
789 support a specific search form (see ProofGeneral/CHANGES).
791 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
792 by default, which means that "prems" (and also "fixed variables") are
793 suppressed from proof state output. Note that the ProofGeneral
794 settings mechanism allows to change and save options persistently, but
795 older versions of Isabelle will fail to start up if a negative prems
798 * Local theory targets may be specified by non-nested blocks of
799 ``context/locale/class ... begin'' followed by ``end''. The body may
800 contain definitions, theorems etc., including any derived mechanism
801 that has been implemented on top of these primitives. This concept
802 generalizes the existing ``theorem (in ...)'' towards more versatility
805 * Proof General interface: proper undo of final 'end' command;
806 discontinued Isabelle/classic mode (ML proof scripts).
809 *** Document preparation ***
811 * Added antiquotation @{theory name} which prints the given name,
812 after checking that it refers to a valid ancestor theory in the
815 * Added antiquotations @{ML_type text} and @{ML_struct text} which
816 check the given source text as ML type/structure, printing verbatim.
818 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
819 "c args == rhs" given in the current context. (Any number of
820 arguments may be given on the LHS.)
825 * The 'class' package offers a combination of axclass and locale to
826 achieve Haskell-like type classes in Isabelle. Definitions and
827 theorems within a class context produce both relative results (with
828 implicit parameters according to the locale context), and polymorphic
829 constants with qualified polymorphism (according to the class
830 context). Within the body context of a 'class' target, a separate
831 syntax layer ("user space type system") takes care of converting
832 between global polymorphic consts and internal locale representation.
833 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
834 "isatool doc classes" provides a tutorial.
836 * Generic code generator framework allows to generate executable
837 code for ML and Haskell (including Isabelle classes). A short usage
840 internal compilation:
841 export_code <list of constants (term syntax)> in SML
842 writing SML code to a file:
843 export_code <list of constants (term syntax)> in SML <filename>
844 writing OCaml code to a file:
845 export_code <list of constants (term syntax)> in OCaml <filename>
846 writing Haskell code to a bunch of files:
847 export_code <list of constants (term syntax)> in Haskell <filename>
849 evaluating closed propositions to True/False using code generation:
852 Reasonable default setup of framework in HOL.
854 Theorem attributs for selecting and transforming function equations theorems:
856 [code fun]: select a theorem as function equation for a specific constant
857 [code fun del]: deselect a theorem as function equation for a specific constant
858 [code inline]: select an equation theorem for unfolding (inlining) in place
859 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
861 User-defined serializations (target in {SML, OCaml, Haskell}):
863 code_const <and-list of constants (term syntax)>
864 {(target) <and-list of const target syntax>}+
866 code_type <and-list of type constructors>
867 {(target) <and-list of type target syntax>}+
869 code_instance <and-list of instances>
871 where instance ::= <type constructor> :: <class>
873 code_class <and_list of classes>
874 {(target) <and-list of class target syntax>}+
875 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
877 code_instance and code_class only are effective to target Haskell.
879 For example usage see src/HOL/ex/Codegenerator.thy and
880 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
881 generation from Isabelle/HOL theories is available via "isatool doc
884 * Code generator: consts in 'consts_code' Isar commands are now
885 referred to by usual term syntax (including optional type
888 * Command 'no_translations' removes translation rules from theory
891 * Overloaded definitions are now actually checked for acyclic
892 dependencies. The overloading scheme is slightly more general than
893 that of Haskell98, although Isabelle does not demand an exact
894 correspondence to type class and instance declarations.
895 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
896 exotic versions of overloading -- at the discretion of the user!
898 Polymorphic constants are represented via type arguments, i.e. the
899 instantiation that matches an instance against the most general
900 declaration given in the signature. For example, with the declaration
901 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
902 as c(nat). Overloading is essentially simultaneous structural
903 recursion over such type arguments. Incomplete specification patterns
904 impose global constraints on all occurrences, e.g. c('a * 'a) on the
905 LHS means that more general c('a * 'b) will be disallowed on any RHS.
906 Command 'print_theory' outputs the normalized system of recursive
907 equations, see section "definitions".
909 * Configuration options are maintained within the theory or proof
910 context (with name and type bool/int/string), providing a very simple
911 interface to a poor-man's version of general context data. Tools may
912 declare options in ML (e.g. using Attrib.config_int) and then refer to
913 these values using Config.get etc. Users may change options via an
914 associated attribute of the same name. This form of context
915 declaration works particularly well with commands 'declare' or
916 'using', for example ``declare [[foo = 42]]''. Thus it has become
917 very easy to avoid global references, which would not observe Isar
918 toplevel undo/redo and fail to work with multithreading.
920 Various global ML references of Pure and HOL have been turned into
921 configuration options:
923 Unify.search_bound unify_search_bound
924 Unify.trace_bound unify_trace_bound
925 Unify.trace_simp unify_trace_simp
926 Unify.trace_types unify_trace_types
927 Simplifier.simp_depth_limit simp_depth_limit
928 Blast.depth_limit blast_depth_limit
929 DatatypeProp.dtK datatype_distinctness_limit
930 fast_arith_neq_limit fast_arith_neq_limit
931 fast_arith_split_limit fast_arith_split_limit
933 * Named collections of theorems may be easily installed as context
934 data using the functor NamedThmsFun (see also
935 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
936 attributes; there is also a toplevel print command. This facility is
937 just a common case of general context data, which is the preferred way
938 for anything more complex than just a list of facts in canonical
941 * Isar: command 'declaration' augments a local theory by generic
942 declaration functions written in ML. This enables arbitrary content
943 being added to the context, depending on a morphism that tells the
944 difference of the original declaration context wrt. the application
945 context encountered later on.
947 * Isar: proper interfaces for simplification procedures. Command
948 'simproc_setup' declares named simprocs (with match patterns, and body
949 text in ML). Attribute "simproc" adds/deletes simprocs in the current
950 context. ML antiquotation @{simproc name} retrieves named simprocs.
952 * Isar: an extra pair of brackets around attribute declarations
953 abbreviates a theorem reference involving an internal dummy fact,
954 which will be ignored later --- only the effect of the attribute on
955 the background context will persist. This form of in-place
956 declarations is particularly useful with commands like 'declare' and
957 'using', for example ``have A using [[simproc a]] by simp''.
959 * Isar: method "assumption" (and implicit closing of subproofs) now
960 takes simple non-atomic goal assumptions into account: after applying
961 an assumption as a rule the resulting subgoals are solved by atomic
962 assumption steps. This is particularly useful to finish 'obtain'
963 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
964 without referring to the original premise "!!x. P x ==> thesis" in the
965 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
968 * Isar: implicit use of prems from the Isar proof context is
969 considered a legacy feature. Common applications like ``have A .''
970 may be replaced by ``have A by fact'' or ``note `A`''. In general,
971 referencing facts explicitly here improves readability and
972 maintainability of proof texts.
974 * Isar: improper proof element 'guess' is like 'obtain', but derives
975 the obtained context from the course of reasoning! For example:
977 assume "EX x y. A x & B y" -- "any previous fact"
978 then guess x and y by clarify
980 This technique is potentially adventurous, depending on the facts and
981 proof tools being involved here.
983 * Isar: known facts from the proof context may be specified as literal
984 propositions, using ASCII back-quote syntax. This works wherever
985 named facts used to be allowed so far, in proof commands, proof
986 methods, attributes etc. Literal facts are retrieved from the context
987 according to unification of type and term parameters. For example,
988 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
989 theorems in the current context, then these are valid literal facts:
990 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
992 There is also a proof method "fact" which does the same composition
993 for explicit goal states, e.g. the following proof texts coincide with
994 certain special cases of literal facts:
996 have "A" by fact == note `A`
997 have "A ==> B" by fact == note `A ==> B`
998 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
999 have "P a ==> Q a" by fact == note `P a ==> Q a`
1001 * Isar: ":" (colon) is no longer a symbolic identifier character in
1002 outer syntax. Thus symbolic identifiers may be used without
1003 additional white space in declarations like this: ``assume *: A''.
1005 * Isar: 'print_facts' prints all local facts of the current context,
1006 both named and unnamed ones.
1008 * Isar: 'def' now admits simultaneous definitions, e.g.:
1010 def x == "t" and y == "u"
1012 * Isar: added command 'unfolding', which is structurally similar to
1013 'using', but affects both the goal state and facts by unfolding given
1014 rewrite rules. Thus many occurrences of the 'unfold' method or
1015 'unfolded' attribute may be replaced by first-class proof text.
1017 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
1018 and command 'unfolding' now all support object-level equalities
1019 (potentially conditional). The underlying notion of rewrite rule is
1020 analogous to the 'rule_format' attribute, but *not* that of the
1021 Simplifier (which is usually more generous).
1023 * Isar: the new attribute [rotated n] (default n = 1) rotates the
1024 premises of a theorem by n. Useful in conjunction with drule.
1026 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
1027 method expression within a sandbox consisting of the first N
1028 sub-goals, which need to exist. For example, ``simp_all [3]''
1029 simplifies the first three sub-goals, while (rule foo, simp_all)[]
1030 simplifies all new goals that emerge from applying rule foo to the
1031 originally first one.
1033 * Isar: schematic goals are no longer restricted to higher-order
1034 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
1037 * Isar: the conclusion of a long theorem statement is now either
1038 'shows' (a simultaneous conjunction, as before), or 'obtains'
1039 (essentially a disjunction of cases with local parameters and
1040 assumptions). The latter allows to express general elimination rules
1041 adequately; in this notation common elimination rules look like this:
1043 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
1045 obtains x where "P x"
1047 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
1051 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
1057 The subsequent classical rules even refer to the formal "thesis"
1060 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
1063 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
1064 obtains "thesis ==> something"
1066 The actual proof of an 'obtains' statement is analogous to that of the
1067 Isar proof element 'obtain', only that there may be several cases.
1068 Optional case names may be specified in parentheses; these will be
1069 available both in the present proof and as annotations in the
1070 resulting rule, for later use with the 'cases' method (cf. attribute
1073 * Isar: the assumptions of a long theorem statement are available as
1074 "assms" fact in the proof context. This is more appropriate than the
1075 (historical) "prems", which refers to all assumptions of the current
1076 context, including those from the target locale, proof body etc.
1078 * Isar: 'print_statement' prints theorems from the current theory or
1079 proof context in long statement form, according to the syntax of a
1082 * Isar: 'obtain' takes an optional case name for the local context
1083 introduction rule (default "that").
1085 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1086 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1089 * Pure: syntax "CONST name" produces a fully internalized constant
1090 according to the current context. This is particularly useful for
1091 syntax translations that should refer to internal constant
1092 representations independently of name spaces.
1094 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1095 instead of "FOO ". This allows multiple binder declarations to coexist
1096 in the same context. INCOMPATIBILITY.
1098 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1099 primitive that also works in a locale context (both for constants and
1100 fixed variables). Type declaration and internal syntactic representation
1101 of given constants retrieved from the context. Likewise, the
1102 'no_notation' command allows to remove given syntax annotations from the
1105 * Isar/locales: new derived specification elements 'axiomatization',
1106 'definition', 'abbreviation', which support type-inference, admit
1107 object-level specifications (equality, equivalence). See also the
1108 isar-ref manual. Examples:
1111 eq (infix "===" 50) where
1112 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1114 definition "f x y = x + y + 1"
1115 definition g where "g x = f x x"
1118 neq (infix "=!=" 50) where
1119 "x =!= y == ~ (x === y)"
1121 These specifications may be also used in a locale context. Then the
1122 constants being introduced depend on certain fixed parameters, and the
1123 constant name is qualified by the locale base name. An internal
1124 abbreviation takes care for convenient input and output, making the
1125 parameters implicit and using the original short name. See also
1126 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1127 entities from a monomorphic theory.
1129 Presently, abbreviations are only available 'in' a target locale, but
1130 not inherited by general import expressions. Also note that
1131 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1132 'translations' in common applications. The "no_abbrevs" print mode
1133 prevents folding of abbreviations in term output.
1135 Concrete syntax is attached to specified constants in internal form,
1136 independently of name spaces. The parse tree representation is
1137 slightly different -- use 'notation' instead of raw 'syntax', and
1138 'translations' with explicit "CONST" markup to accommodate this.
1140 * Pure/Isar: unified syntax for new-style specification mechanisms
1141 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1142 full type inference and dummy patterns ("_"). For example:
1144 definition "K x _ = x"
1146 inductive conj for A B
1147 where "A ==> B ==> conj A B"
1149 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1150 the current context. Print mode "no_abbrevs" prevents inversion of
1151 abbreviations on output.
1153 * Isar/locales: improved parameter handling: use of locales "var" and
1154 "struct" no longer necessary; - parameter renamings are no longer
1155 required to be injective. For example, this allows to define
1156 endomorphisms as locale endom = homom mult mult h.
1158 * Isar/locales: changed the way locales with predicates are defined.
1159 Instead of accumulating the specification, the imported expression is
1160 now an interpretation. INCOMPATIBILITY: different normal form of
1161 locale expressions. In particular, in interpretations of locales with
1162 predicates, goals repesenting already interpreted fragments are not
1163 removed automatically. Use methods `intro_locales' and
1164 `unfold_locales'; see below.
1166 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1167 provide backward reasoning on locales predicates. The methods are
1168 aware of interpretations and discharge corresponding goals.
1169 `intro_locales' is less aggressive then `unfold_locales' and does not
1170 unfold predicates to assumptions.
1172 * Isar/locales: the order in which locale fragments are accumulated
1173 has changed. This enables to override declarations from fragments due
1174 to interpretations -- for example, unwanted simp rules.
1176 * Isar/locales: interpretation in theories and proof contexts has been
1177 extended. One may now specify (and prove) equations, which are
1178 unfolded in interpreted theorems. This is useful for replacing
1179 defined concepts (constants depending on locale parameters) by
1180 concepts already existing in the target context. Example:
1182 interpretation partial_order ["op <= :: [int, int] => bool"]
1183 where "partial_order.less (op <=) (x::int) y = (x < y)"
1185 Typically, the constant `partial_order.less' is created by a
1186 definition specification element in the context of locale
1189 * Method "induct": improved internal context management to support
1190 local fixes and defines on-the-fly. Thus explicit meta-level
1191 connectives !! and ==> are rarely required anymore in inductive goals
1192 (using object-logic connectives for this purpose has been long
1193 obsolete anyway). Common proof patterns are explained in
1194 src/HOL/Induct/Common_Patterns.thy, see also
1195 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1198 * Method "induct": improved handling of simultaneous goals. Instead of
1199 introducing object-level conjunction, the statement is now split into
1200 several conclusions, while the corresponding symbolic cases are nested
1201 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1202 see src/HOL/Induct/Common_Patterns.thy, for example.
1204 * Method "induct": mutual induction rules are now specified as a list
1205 of rule sharing the same induction cases. HOL packages usually provide
1206 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1207 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1208 mutual induction rules differently, i.e. like this:
1210 (induct rule: foo_bar.inducts)
1211 (induct set: foo bar)
1212 (induct pred: foo bar)
1213 (induct type: foo bar)
1215 The ML function ProjectRule.projections turns old-style rules into the
1218 * Method "coinduct": dual of induction, see
1219 src/HOL/Library/Coinductive_List.thy for various examples.
1221 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1222 considered a legacy feature.
1224 * Attribute "symmetric" produces result with standardized schematic
1225 variables (index 0). Potential INCOMPATIBILITY.
1227 * Simplifier: by default the simplifier trace only shows top level
1228 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1229 default. Thus there is less danger of being flooded by the trace. The
1230 trace indicates where parts have been suppressed.
1232 * Provers/classical: removed obsolete classical version of elim_format
1233 attribute; classical elim/dest rules are now treated uniformly when
1234 manipulating the claset.
1236 * Provers/classical: stricter checks to ensure that supplied intro,
1237 dest and elim rules are well-formed; dest and elim rules must have at
1240 * Provers/classical: attributes dest/elim/intro take an optional
1241 weight argument for the rule (just as the Pure versions). Weights are
1242 ignored by automated tools, but determine the search order of single
1245 * Syntax: input syntax now supports dummy variable binding "%_. b",
1246 where the body does not mention the bound variable. Note that dummy
1247 patterns implicitly depend on their context of bounds, which makes
1248 "{_. _}" match any set comprehension as expected. Potential
1249 INCOMPATIBILITY -- parse translations need to cope with syntactic
1250 constant "_idtdummy" in the binding position.
1252 * Syntax: removed obsolete syntactic constant "_K" and its associated
1253 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1254 for example "A -> B" => "Pi A (%_. B)".
1256 * Pure: 'class_deps' command visualizes the subclass relation, using
1257 the graph browser tool.
1259 * Pure: 'print_theory' now suppresses certain internal declarations by
1260 default; use '!' option for full details.
1265 * Method "metis" proves goals by applying the Metis general-purpose
1266 resolution prover (see also http://gilith.com/software/metis/).
1267 Examples are in the directory MetisExamples. WARNING: the
1268 Isabelle/HOL-Metis integration does not yet work properly with
1271 * Command 'sledgehammer' invokes external automatic theorem provers as
1272 background processes. It generates calls to the "metis" method if
1273 successful. These can be pasted into the proof. Users do not have to
1274 wait for the automatic provers to return. WARNING: does not really
1275 work with multi-threading.
1277 * New "auto_quickcheck" feature tests outermost goal statements for
1278 potential counter-examples. Controlled by ML references
1279 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1280 5000 milliseconds). Fails silently if statements is outside of
1281 executable fragment, or any other codgenerator problem occurs.
1283 * New constant "undefined" with axiom "undefined x = undefined".
1285 * Added class "HOL.eq", allowing for code generation with polymorphic
1288 * Some renaming of class constants due to canonical name prefixing in
1289 the new 'class' package:
1291 HOL.abs ~> HOL.abs_class.abs
1292 HOL.divide ~> HOL.divide_class.divide
1293 0 ~> HOL.zero_class.zero
1294 1 ~> HOL.one_class.one
1295 op + ~> HOL.plus_class.plus
1296 op - ~> HOL.minus_class.minus
1297 uminus ~> HOL.minus_class.uminus
1298 op * ~> HOL.times_class.times
1299 op < ~> HOL.ord_class.less
1300 op <= > HOL.ord_class.less_eq
1301 Nat.power ~> Power.power_class.power
1302 Nat.size ~> Nat.size_class.size
1303 Numeral.number_of ~> Numeral.number_class.number_of
1304 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1305 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1306 Orderings.min ~> Orderings.ord_class.min
1307 Orderings.max ~> Orderings.ord_class.max
1308 Divides.op div ~> Divides.div_class.div
1309 Divides.op mod ~> Divides.div_class.mod
1310 Divides.op dvd ~> Divides.div_class.dvd
1312 INCOMPATIBILITY. Adaptions may be required in the following cases:
1314 a) User-defined constants using any of the names "plus", "minus",
1315 "times", "less" or "less_eq". The standard syntax translations for
1316 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1319 b) Variables named "plus", "minus", "times", "less", "less_eq"
1320 INCOMPATIBILITY: use more specific names.
1322 c) Permutative equations (e.g. "a + b = b + a")
1323 Since the change of names also changes the order of terms, permutative
1324 rewrite rules may get applied in a different order. Experience shows
1325 that this is rarely the case (only two adaptions in the whole Isabelle
1326 distribution). INCOMPATIBILITY: rewrite proofs
1328 d) ML code directly refering to constant names
1329 This in general only affects hand-written proof tactics, simprocs and
1330 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1331 Consider using @{const_name} antiquotation.
1333 * New class "default" with associated constant "default".
1335 * Function "sgn" is now overloaded and available on int, real, complex
1336 (and other numeric types), using class "sgn". Two possible defs of
1337 sgn are given as equational assumptions in the classes sgn_if and
1338 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1341 * Locale "partial_order" now unified with class "order" (cf. theory
1342 Orderings), added parameter "less". INCOMPATIBILITY.
1344 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1345 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1346 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1348 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1349 changed order of proof goals in instance proofs.
1351 * The transitivity reasoner for partial and linear orders is set up
1352 for classes "order" and "linorder". Instances of the reasoner are available
1353 in all contexts importing or interpreting the corresponding locales.
1354 Method "order" invokes the reasoner separately; the reasoner
1355 is also integrated with the Simplifier as a solver. Diagnostic
1356 command 'print_orders' shows the available instances of the reasoner
1357 in the current context.
1359 * Localized monotonicity predicate in theory "Orderings"; integrated
1360 lemmas max_of_mono and min_of_mono with this predicate.
1363 * Formulation of theorem "dense" changed slightly due to integration
1364 with new class dense_linear_order.
1366 * Uniform lattice theory development in HOL.
1368 constants "meet" and "join" now named "inf" and "sup"
1369 constant "Meet" now named "Inf"
1371 classes "meet_semilorder" and "join_semilorder" now named
1372 "lower_semilattice" and "upper_semilattice"
1373 class "lorder" now named "lattice"
1374 class "comp_lat" now named "complete_lattice"
1376 Instantiation of lattice classes allows explicit definitions
1377 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1379 INCOMPATIBILITY. Theorem renames:
1381 meet_left_le ~> inf_le1
1382 meet_right_le ~> inf_le2
1383 join_left_le ~> sup_ge1
1384 join_right_le ~> sup_ge2
1385 meet_join_le ~> inf_sup_ord
1388 le_meet ~> le_inf_iff
1389 le_join ~> ge_sup_conv
1390 meet_idempotent ~> inf_idem
1391 join_idempotent ~> sup_idem
1392 meet_comm ~> inf_commute
1393 join_comm ~> sup_commute
1394 meet_leI1 ~> le_infI1
1395 meet_leI2 ~> le_infI2
1396 le_joinI1 ~> le_supI1
1397 le_joinI2 ~> le_supI2
1398 meet_assoc ~> inf_assoc
1399 join_assoc ~> sup_assoc
1400 meet_left_comm ~> inf_left_commute
1401 meet_left_idempotent ~> inf_left_idem
1402 join_left_comm ~> sup_left_commute
1403 join_left_idempotent ~> sup_left_idem
1406 le_def_meet ~> le_iff_inf
1407 le_def_join ~> le_iff_sup
1408 join_absorp2 ~> sup_absorb2
1409 join_absorp1 ~> sup_absorb1
1410 meet_absorp1 ~> inf_absorb1
1411 meet_absorp2 ~> inf_absorb2
1412 meet_join_absorp ~> inf_sup_absorb
1413 join_meet_absorp ~> sup_inf_absorb
1414 distrib_join_le ~> distrib_sup_le
1415 distrib_meet_le ~> distrib_inf_le
1417 add_meet_distrib_left ~> add_inf_distrib_left
1418 add_join_distrib_left ~> add_sup_distrib_left
1419 is_join_neg_meet ~> is_join_neg_inf
1420 is_meet_neg_join ~> is_meet_neg_sup
1421 add_meet_distrib_right ~> add_inf_distrib_right
1422 add_join_distrib_right ~> add_sup_distrib_right
1423 add_meet_join_distribs ~> add_sup_inf_distribs
1424 join_eq_neg_meet ~> sup_eq_neg_inf
1425 meet_eq_neg_join ~> inf_eq_neg_sup
1426 add_eq_meet_join ~> add_eq_inf_sup
1427 meet_0_imp_0 ~> inf_0_imp_0
1428 join_0_imp_0 ~> sup_0_imp_0
1429 meet_0_eq_0 ~> inf_0_eq_0
1430 join_0_eq_0 ~> sup_0_eq_0
1431 neg_meet_eq_join ~> neg_inf_eq_sup
1432 neg_join_eq_meet ~> neg_sup_eq_inf
1433 join_eq_if ~> sup_eq_if
1435 mono_meet ~> mono_inf
1436 mono_join ~> mono_sup
1437 meet_bool_eq ~> inf_bool_eq
1438 join_bool_eq ~> sup_bool_eq
1439 meet_fun_eq ~> inf_fun_eq
1440 join_fun_eq ~> sup_fun_eq
1441 meet_set_eq ~> inf_set_eq
1442 join_set_eq ~> sup_set_eq
1443 meet1_iff ~> inf1_iff
1444 meet2_iff ~> inf2_iff
1453 join1_iff ~> sup1_iff
1454 join2_iff ~> sup2_iff
1464 is_meet_Meet ~> is_meet_Inf
1465 Meet_bool_def ~> Inf_bool_def
1466 Meet_fun_def ~> Inf_fun_def
1467 Meet_greatest ~> Inf_greatest
1468 Meet_lower ~> Inf_lower
1469 Meet_set_def ~> Inf_set_def
1472 Sup_bool_eq ~> Sup_bool_def
1473 Sup_fun_eq ~> Sup_fun_def
1474 Sup_set_eq ~> Sup_set_def
1476 listsp_meetI ~> listsp_infI
1477 listsp_meet_eq ~> listsp_inf_eq
1482 * Added syntactic class "size"; overloaded constant "size" now has
1483 type "'a::size ==> bool"
1485 * Internal reorganisation of `size' of datatypes: size theorems
1486 "foo.size" are no longer subsumed by "foo.simps" (but are still
1487 simplification rules by default!); theorems "prod.size" now named
1490 * Class "div" now inherits from class "times" rather than "type".
1493 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1494 Linorder etc. have disappeared; operations defined in terms of
1495 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1497 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1499 * HOL-Word: New extensive library and type for generic, fixed size
1500 machine words, with arithemtic, bit-wise, shifting and rotating
1501 operations, reflection into int, nat, and bool lists, automation for
1502 linear arithmetic (by automatic reflection into nat or int), including
1503 lemmas on overflow and monotonicity. Instantiated to all appropriate
1504 arithmetic type classes, supporting automatic simplification of
1505 numerals on all operations.
1507 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1509 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1511 * Code generator library theories:
1512 - Code_Integer represents HOL integers by big integer literals in target
1514 - Code_Char represents HOL characters by character literals in target
1516 - Code_Char_chr like Code_Char, but also offers treatment of character
1517 codes; includes Code_Integer.
1518 - Executable_Set allows to generate code for finite sets using lists.
1519 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1521 - Executable_Real implements a subset of real numbers, namly those
1522 representable by rational numbers.
1523 - Efficient_Nat implements natural numbers by integers, which in general will
1524 result in higher efficency; pattern matching with 0/Suc is eliminated;
1525 includes Code_Integer.
1526 - Code_Index provides an additional datatype index which is mapped to
1527 target-language built-in integers.
1528 - Code_Message provides an additional datatype message_string which is isomorphic to
1529 strings; messages are mapped to target-language strings.
1531 * New package for inductive predicates
1533 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1536 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1537 for z_1 :: U_1 and ... and z_n :: U_m
1539 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1542 with full support for type-inference, rather than
1544 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1546 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1547 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1549 inductive "s z_1 ... z_m"
1551 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1554 For backward compatibility, there is a wrapper allowing inductive
1555 sets to be defined with the new package via
1558 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1559 for z_1 :: U_1 and ... and z_n :: U_m
1561 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1567 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1568 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1569 for z_1 :: U_1 and ... and z_n :: U_m
1571 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1572 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1575 if the additional syntax "p ..." is required.
1577 Numerous examples can be found in the subdirectories src/HOL/Auth,
1578 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1582 - Since declaration and definition of inductive sets or predicates
1583 is no longer separated, abbreviations involving the newly
1584 introduced sets or predicates must be specified together with the
1585 introduction rules after the 'where' keyword (see above), rather
1586 than before the actual inductive definition.
1588 - The variables in induction and elimination rules are now
1589 quantified in the order of their occurrence in the introduction
1590 rules, rather than in alphabetical order. Since this may break
1591 some proofs, these proofs either have to be repaired, e.g. by
1592 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1593 statements of the form
1595 case (rule_i a_i_1 ... a_i_{k_i})
1597 or the old order of quantification has to be restored by explicitly adding
1598 meta-level quantifiers in the introduction rules, i.e.
1600 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1602 - The format of the elimination rules is now
1604 p z_1 ... z_m x_1 ... x_n ==>
1605 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1610 (x_1, ..., x_n) : s z_1 ... z_m ==>
1611 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1614 for sets rather than
1616 x : s z_1 ... z_m ==>
1617 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1620 This may require terms in goals to be expanded to n-tuples
1621 (e.g. using case_tac or simplification with the split_paired_all
1622 rule) before the above elimination rule is applicable.
1624 - The elimination or case analysis rules for (mutually) inductive
1625 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1626 list of rules "p_1_..._p_k.elims" is no longer available.
1628 * New package "function"/"fun" for general recursive functions,
1629 supporting mutual and nested recursion, definitions in local contexts,
1630 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1631 for small examples, and the separate tutorial on the function
1632 package. The old recdef "package" is still available as before, but
1633 users are encouraged to use the new package.
1635 * Method "lexicographic_order" automatically synthesizes termination
1636 relations as lexicographic combinations of size measures.
1638 * Case-expressions allow arbitrary constructor-patterns (including
1639 "_") and take their order into account, like in functional
1640 programming. Internally, this is translated into nested
1641 case-expressions; missing cases are added and mapped to the predefined
1642 constant "undefined". In complicated cases printing may no longer show
1643 the original input but the internal form. Lambda-abstractions allow
1644 the same form of pattern matching: "% pat1 => e1 | ..." is an
1645 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1648 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1649 is an abbreviation for "of_nat :: nat => int". The simplification
1650 rules for "of_nat" have been changed to work like "int" did
1651 previously. Potential INCOMPATIBILITY:
1652 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1653 - of_nat_diff and of_nat_mult are no longer default simp rules
1655 * Method "algebra" solves polynomial equations over (semi)rings using
1656 Groebner bases. The (semi)ring structure is defined by locales and the
1657 tool setup depends on that generic context. Installing the method for
1658 a specific type involves instantiating the locale and possibly adding
1659 declarations for computation on the coefficients. The method is
1660 already instantiated for natural numbers and for the axiomatic class
1661 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1662 CALCULEMUS 2007 for the general principles underlying this
1663 architecture of context-aware proof-tools.
1665 * Method "ferrack" implements quantifier elimination over
1666 special-purpose dense linear orders using locales (analogous to
1667 "algebra"). The method is already installed for class
1668 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1671 * Former constant "List.op @" now named "List.append". Use ML
1672 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1673 circumvent possible incompatibilities when working on ML level.
1675 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1677 * New function listsum :: 'a list => 'a for arbitrary monoids.
1678 Special syntax: "SUM x <- xs. f x" (and latex variants)
1680 * New syntax for Haskell-like list comprehension (input only), eg.
1681 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1683 * The special syntax for function "filter" has changed from [x :
1684 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1685 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1687 * [a..b] is now defined for arbitrary linear orders. It used to be
1688 defined on nat only, as an abbreviation for [a..<Suc b]
1691 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1693 * New functions "sorted" and "sort" in src/HOL/List.thy.
1695 * New lemma collection field_simps (an extension of ring_simps) for
1696 manipulating (in)equations involving division. Multiplies with all
1697 denominators that can be proved to be non-zero (in equations) or
1698 positive/negative (in inequations).
1700 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1701 have been improved and renamed to ring_simps, group_simps and
1702 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1703 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1705 * Theory Library/Commutative_Ring: switched from recdef to function
1706 package; constants add, mul, pow now curried. Infix syntax for
1707 algebraic operations.
1709 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1712 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1715 * HOL/records: generalised field-update to take a function on the
1716 field rather than the new value: r(|A := x|) is translated to A_update
1717 (K x) r The K-combinator that is internally used is called K_record.
1718 INCOMPATIBILITY: Usage of the plain update functions has to be
1721 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1722 * x = 0, which are required for a semiring. Richer structures do not
1723 inherit from semiring_0 anymore, because this property is a theorem
1724 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1725 there is more to prove, but this is mostly trivial.
1727 * Class "recpower" is generalized to arbitrary monoids, not just
1728 commutative semirings. INCOMPATIBILITY: may need to incorporate
1729 commutativity or semiring properties additionally.
1731 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1732 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1733 better use 'abbreviation'.
1735 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1737 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1738 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1739 significant changes for setting up numeral syntax for types:
1740 - New constants Numeral.pred and Numeral.succ instead
1741 of former Numeral.bin_pred and Numeral.bin_succ.
1742 - Use integer operations instead of bin_add, bin_mult and so on.
1743 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1744 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1746 See src/HOL/Integ/IntArith.thy for an example setup.
1748 * Command 'normal_form' computes the normal form of a term that may
1749 contain free variables. For example ``normal_form "rev [a, b, c]"''
1750 produces ``[b, c, a]'' (without proof). This command is suitable for
1751 heavy-duty computations because the functions are compiled to ML
1752 first. Correspondingly, a method "normalization" is provided. See
1753 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1755 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1756 25 like -->); output depends on the "iff" print_mode, the default is
1757 "A = B" (with priority 50).
1759 * Relations less (<) and less_eq (<=) are also available on type bool.
1760 Modified syntax to disallow nesting without explicit parentheses,
1761 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1764 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1766 * Relation composition operator "op O" now has precedence 75 and binds
1767 stronger than union and intersection. INCOMPATIBILITY.
1769 * The old set interval syntax "{m..n(}" (and relatives) has been
1770 removed. Use "{m..<n}" (and relatives) instead.
1772 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1773 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1774 ``declare [[simproc del: neq]]''.
1776 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1779 * Theorem Cons_eq_map_conv no longer declared as "simp".
1781 * Theorem setsum_mult renamed to setsum_right_distrib.
1783 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1786 * Reimplemented methods "sat" and "satx", with several improvements:
1787 goals no longer need to be stated as "<prems> ==> False", equivalences
1788 (i.e. "=" on type bool) are handled, variable names of the form
1789 "lit_<n>" are no longer reserved, significant speedup.
1791 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1792 zChaff is still supported as well.
1794 * 'inductive' and 'datatype': provide projections of mutual rules,
1795 bundled as foo_bar.inducts;
1797 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1800 * Library: moved theory Accessible_Part to main HOL.
1802 * Library: added theory Coinductive_List of potentially infinite lists
1803 as greatest fixed-point.
1805 * Library: added theory AssocList which implements (finite) maps as
1808 * Method "evaluation" solves goals (i.e. a boolean expression)
1809 efficiently by compiling it to ML. The goal is "proved" (via an
1810 oracle) if it evaluates to True.
1812 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1813 also when invoked by the simplifier. This results in the Simplifier
1814 being more powerful on arithmetic goals. INCOMPATIBILITY.
1815 Configuration option fast_arith_split_limit=0 recovers the old
1818 * Support for hex (0x20) and binary (0b1001) numerals.
1820 * New method: reify eqs (t), where eqs are equations for an
1821 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1822 parameter, computes a term s::'b and a list xs::'a list and proves the
1823 theorem I xs s = t. This is also known as reification or quoting. The
1824 resulting theorem is applied to the subgoal to substitute t with I xs
1825 s. If t is omitted, the subgoal itself is reified.
1827 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1828 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1829 where f is supposed to be a computable function (in the sense of code
1830 generattion). The method uses reify to compute s and xs as above then
1831 applies corr_thm and uses normalization by evaluation to "prove" f s =
1832 r and finally gets the theorem t = r, which is again applied to the
1833 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1835 * Reflection: Automatic reification now handels binding, an example is
1836 available in src/HOL/ex/ReflectionEx.thy
1838 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1839 command 'statespace' that is similar to 'record', but introduces an
1840 abstract specification based on the locale infrastructure instead of
1841 HOL types. This leads to extra flexibility in composing state spaces,
1842 in particular multiple inheritance and renaming of components.
1847 * Hyperreal: Functions root and sqrt are now defined on negative real
1848 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1849 Nonnegativity side conditions have been removed from many lemmas, so
1850 that more subgoals may now be solved by simplification; potential
1853 * Real: new type classes formalize real normed vector spaces and
1854 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1855 and norm :: 'a => real.
1857 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1858 reals into other types. The overloaded constant Reals :: 'a set is now
1859 defined as range of_real; potential INCOMPATIBILITY.
1861 * Real: proper support for ML code generation, including 'quickcheck'.
1862 Reals are implemented as arbitrary precision rationals.
1864 * Hyperreal: Several constants that previously worked only for the
1865 reals have been generalized, so they now work over arbitrary vector
1866 spaces. Type annotations may need to be added in some cases; potential
1869 Infinitesimal :: ('a::real_normed_vector) star set
1870 HFinite :: ('a::real_normed_vector) star set
1871 HInfinite :: ('a::real_normed_vector) star set
1872 approx :: ('a::real_normed_vector) star => 'a star => bool
1873 monad :: ('a::real_normed_vector) star => 'a star set
1874 galaxy :: ('a::real_normed_vector) star => 'a star set
1875 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1876 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1877 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1878 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1879 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
1880 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
1881 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
1882 sgn :: 'a::real_normed_vector => 'a
1883 exp :: 'a::{recpower,real_normed_field,banach} => 'a
1885 * Complex: Some complex-specific constants are now abbreviations for
1886 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
1887 hnorm. Other constants have been entirely removed in favor of the
1888 polymorphic versions (INCOMPATIBILITY):
1892 HInfinite <-- CInfinite
1893 Infinitesimal <-- CInfinitesimal
1896 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
1897 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
1898 (ns)deriv <-- (ns)cderiv
1903 * Formalisation of ideals and the quotient construction over rings.
1905 * Order and lattice theory no longer based on records.
1908 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
1909 greatest_closed. INCOMPATIBILITY.
1911 * Method algebra is now set up via an attribute. For examples see
1912 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
1913 of algebraic structures.
1915 * Renamed theory CRing to Ring.
1920 * Substantial, yet incomplete support for nominal datatypes (binding
1921 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
1922 src/HOL/Nominal/Examples. Prospective users should consult
1923 http://isabelle.in.tum.de/nominal/
1928 * ML basics: just one true type int, which coincides with IntInf.int
1931 * ML within Isar: antiquotations allow to embed statically-checked
1932 formal entities in the source, referring to the context available at
1933 compile-time. For example:
1935 ML {* @{sort "{zero,one}"} *}
1936 ML {* @{typ "'a => 'b"} *}
1937 ML {* @{term "%x. x"} *}
1938 ML {* @{prop "x == y"} *}
1939 ML {* @{ctyp "'a => 'b"} *}
1940 ML {* @{cterm "%x. x"} *}
1941 ML {* @{cprop "x == y"} *}
1942 ML {* @{thm asm_rl} *}
1943 ML {* @{thms asm_rl} *}
1944 ML {* @{type_name c} *}
1945 ML {* @{type_syntax c} *}
1946 ML {* @{const_name c} *}
1947 ML {* @{const_syntax c} *}
1950 ML {* @{theory Pure} *}
1951 ML {* @{theory_ref} *}
1952 ML {* @{theory_ref Pure} *}
1955 ML {* @{clasimpset} *}
1957 The same works for sources being ``used'' within an Isar context.
1959 * ML in Isar: improved error reporting; extra verbosity with
1960 ML_Context.trace enabled.
1962 * Pure/General/table.ML: the join operations now works via exceptions
1963 DUP/SAME instead of type option. This is simpler in simple cases, and
1964 admits slightly more efficient complex applications.
1966 * Pure: 'advanced' translation functions (parse_translation etc.) now
1967 use Context.generic instead of just theory.
1969 * Pure: datatype Context.generic joins theory/Proof.context and
1970 provides some facilities for code that works in either kind of
1971 context, notably GenericDataFun for uniform theory and proof data.
1973 * Pure: simplified internal attribute type, which is now always
1974 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
1975 local (Proof.context) attributes have been discontinued, while
1976 minimizing code duplication. Thm.rule_attribute and
1977 Thm.declaration_attribute build canonical attributes; see also structure
1978 Context for further operations on Context.generic, notably
1979 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
1980 declarations and definitions.
1982 * Context data interfaces (Theory/Proof/GenericDataFun): removed
1983 name/print, uninitialized data defaults to ad-hoc copy of empty value,
1984 init only required for impure data. INCOMPATIBILITY: empty really need
1985 to be empty (no dependencies on theory content!)
1987 * Pure/kernel: consts certification ignores sort constraints given in
1988 signature declarations. (This information is not relevant to the
1989 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
1990 potential INCOMPATIBILITY.
1992 * Pure: axiomatic type classes are now purely definitional, with
1993 explicit proofs of class axioms and super class relations performed
1994 internally. See Pure/axclass.ML for the main internal interfaces --
1995 notably AxClass.define_class supercedes AxClass.add_axclass, and
1996 AxClass.axiomatize_class/classrel/arity supersede
1997 Sign.add_classes/classrel/arities.
1999 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
2000 global/local versions on theory vs. Proof.context have been
2001 discontinued; Attrib.syntax and Method.syntax have been adapted
2002 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
2003 attributes, methods, etc.
2005 * Pure: several functions of signature "... -> theory -> theory * ..."
2006 have been reoriented to "... -> theory -> ... * theory" in order to
2007 allow natural usage in combination with the ||>, ||>>, |-> and
2008 fold_map combinators.
2010 * Pure: official theorem names (closed derivations) and additional
2011 comments (tags) are now strictly separate. Name hints -- which are
2012 maintained as tags -- may be attached any time without affecting the
2015 * Pure: primitive rule lift_rule now takes goal cterm instead of an
2016 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
2017 achieve the old behaviour.
2019 * Pure: the "Goal" constant is now called "prop", supporting a
2020 slightly more general idea of ``protecting'' meta-level rule
2023 * Pure: Logic.(un)varify only works in a global context, which is now
2024 enforced instead of silently assumed. INCOMPATIBILITY, may use
2025 Logic.legacy_(un)varify as temporary workaround.
2027 * Pure: structure Name provides scalable operations for generating
2028 internal variable names, notably Name.variants etc. This replaces
2029 some popular functions from term.ML:
2031 Term.variant -> Name.variant
2032 Term.variantlist -> Name.variant_list
2033 Term.invent_names -> Name.invent_list
2035 Note that low-level renaming rarely occurs in new code -- operations
2036 from structure Variable are used instead (see below).
2038 * Pure: structure Variable provides fundamental operations for proper
2039 treatment of fixed/schematic variables in a context. For example,
2040 Variable.import introduces fixes for schematics of given facts and
2041 Variable.export reverses the effect (up to renaming) -- this replaces
2042 various freeze_thaw operations.
2044 * Pure: structure Goal provides simple interfaces for
2045 init/conclude/finish and tactical prove operations (replacing former
2046 Tactic.prove). Goal.prove is the canonical way to prove results
2047 within a given context; Goal.prove_global is a degraded version for
2048 theory level goals, including a global Drule.standard. Note that
2049 OldGoals.prove_goalw_cterm has long been obsolete, since it is
2050 ill-behaved in a local proof context (e.g. with local fixes/assumes or
2051 in a locale context).
2053 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
2054 and type checking (Syntax.check_term etc.), with common combinations
2055 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
2056 which are considered legacy and await removal.
2058 * Pure/Syntax: generic interfaces for type unchecking
2059 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
2060 with common combinations (Syntax.pretty_term, Syntax.string_of_term
2061 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
2062 available for convenience, but refer to the very same operations using
2063 a mere theory instead of a full context.
2065 * Isar: simplified treatment of user-level errors, using exception
2066 ERROR of string uniformly. Function error now merely raises ERROR,
2067 without any side effect on output channels. The Isar toplevel takes
2068 care of proper display of ERROR exceptions. ML code may use plain
2069 handle/can/try; cat_error may be used to concatenate errors like this:
2071 ... handle ERROR msg => cat_error msg "..."
2073 Toplevel ML code (run directly or through the Isar toplevel) may be
2074 embedded into the Isar toplevel with exception display/debug like
2077 Isar.toplevel (fn () => ...)
2079 INCOMPATIBILITY, removed special transform_error facilities, removed
2080 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2081 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2082 -- use plain ERROR instead.
2084 * Isar: theory setup now has type (theory -> theory), instead of a
2085 list. INCOMPATIBILITY, may use #> to compose setup functions.
2087 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2088 ProofContext.debug/verbose flags.
2090 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2091 theory before entering a proof state. Transactions now always see a
2092 quasi-functional intermediate checkpoint, both in interactive and
2095 * Isar: simplified interfaces for outer syntax. Renamed
2096 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2097 OuterSyntax.add_parsers -- this functionality is now included in
2098 OuterSyntax.command etc. INCOMPATIBILITY.
2100 * Simplifier: the simpset of a running simplification process now
2101 contains a proof context (cf. Simplifier.the_context), which is the
2102 very context that the initial simpset has been retrieved from (by
2103 simpset_of/local_simpset_of). Consequently, all plug-in components
2104 (solver, looper etc.) may depend on arbitrary proof data.
2106 * Simplifier.inherit_context inherits the proof context (plus the
2107 local bounds) of the current simplification process; any simproc
2108 etc. that calls the Simplifier recursively should do this! Removed
2109 former Simplifier.inherit_bounds, which is already included here --
2110 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2111 specify an explicit context using Simplifier.context/theory_context.
2113 * Simplifier/Classical Reasoner: more abstract interfaces
2114 change_simpset/claset for modifying the simpset/claset reference of a
2115 theory; raw versions simpset/claset_ref etc. have been discontinued --
2118 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2124 * settings: the default heap location within ISABELLE_HOME_USER now
2125 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2126 Isabelle installations.
2128 * isabelle-process: option -S (secure mode) disables some critical
2129 operations, notably runtime compilation and evaluation of ML source
2132 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2134 * Support for parallel execution, using native multicore support of
2135 Poly/ML 5.1. The theory loader exploits parallelism when processing
2136 independent theories, according to the given theory header
2137 specifications. The maximum number of worker threads is specified via
2138 usedir option -M or the "max-threads" setting in Proof General. A
2139 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2140 to 6 on a 8-core machine. User-code needs to observe certain
2141 guidelines for thread-safe programming, see appendix A in the Isar
2142 Implementation manual.
2146 New in Isabelle2005 (October 2005)
2147 ----------------------------------
2151 * Theory headers: the new header syntax for Isar theories is
2154 imports <theory1> ... <theoryN>
2155 uses <file1> ... <fileM>
2158 where the 'uses' part is optional. The previous syntax
2160 theory <name> = <theory1> + ... + <theoryN>:
2162 will disappear in the next release. Use isatool fixheaders to convert
2163 existing theory files. Note that there is no change in ancient
2164 non-Isar theories now, but these will disappear soon.
2166 * Theory loader: parent theories can now also be referred to via
2167 relative and absolute paths.
2169 * Command 'find_theorems' searches for a list of criteria instead of a
2170 list of constants. Known criteria are: intro, elim, dest, name:string,
2171 simp:term, and any term. Criteria can be preceded by '-' to select
2172 theorems that do not match. Intro, elim, dest select theorems that
2173 match the current goal, name:s selects theorems whose fully qualified
2174 name contain s, and simp:term selects all simplification rules whose
2175 lhs match term. Any other term is interpreted as pattern and selects
2176 all theorems matching the pattern. Available in ProofGeneral under
2177 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2179 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2181 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2182 matching the current goal as introduction rule and not having "HOL."
2183 in their name (i.e. not being defined in theory HOL).
2185 * Command 'thms_containing' has been discontinued in favour of
2186 'find_theorems'; INCOMPATIBILITY.
2188 * Communication with Proof General is now 8bit clean, which means that
2189 Unicode text in UTF-8 encoding may be used within theory texts (both
2190 formal and informal parts). Cf. option -U of the Isabelle Proof
2191 General interface. Here are some simple examples (cf. src/HOL/ex):
2193 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2194 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2196 * Improved efficiency of the Simplifier and, to a lesser degree, the
2197 Classical Reasoner. Typical big applications run around 2 times
2201 *** Document preparation ***
2203 * Commands 'display_drafts' and 'print_drafts' perform simple output
2204 of raw sources. Only those symbols that do not require additional
2205 LaTeX packages (depending on comments in isabellesym.sty) are
2206 displayed properly, everything else is left verbatim. isatool display
2207 and isatool print are used as front ends (these are subject to the
2208 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2210 * Command tags control specific markup of certain regions of text,
2211 notably folding and hiding. Predefined tags include "theory" (for
2212 theory begin and end), "proof" for proof commands, and "ML" for
2213 commands involving ML code; the additional tags "visible" and
2214 "invisible" are unused by default. Users may give explicit tag
2215 specifications in the text, e.g. ''by %invisible (auto)''. The
2216 interpretation of tags is determined by the LaTeX job during document
2217 preparation: see option -V of isatool usedir, or options -n and -t of
2218 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2221 Several document versions may be produced at the same time via isatool
2222 usedir (the generated index.html will link all of them). Typical
2223 specifications include ''-V document=theory,proof,ML'' to present
2224 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2225 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2226 these parts without any formal replacement text. The Isabelle site
2227 default settings produce ''document'' and ''outline'' versions as
2230 * Several new antiquotations:
2232 @{term_type term} prints a term with its type annotated;
2234 @{typeof term} prints the type of a term;
2236 @{const const} is the same as @{term const}, but checks that the
2237 argument is a known logical constant;
2239 @{term_style style term} and @{thm_style style thm} print a term or
2240 theorem applying a "style" to it
2244 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2245 definitions, equations, inequations etc., 'concl' printing only the
2246 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2247 to print the specified premise. TermStyle.add_style provides an ML
2248 interface for introducing further styles. See also the "LaTeX Sugar"
2249 document practical applications. The ML antiquotation prints
2250 type-checked ML expressions verbatim.
2252 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2253 and 'text' support optional locale specification '(in loc)', which
2254 specifies the default context for interpreting antiquotations. For
2255 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2257 * Option 'locale=NAME' of antiquotations specifies an alternative
2258 context interpreting the subsequent argument. For example: @{thm
2259 [locale=lattice] inf_assoc}.
2261 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2264 * Proper output of antiquotations for theory commands involving a
2265 proof context (such as 'locale' or 'theorem (in loc) ...').
2267 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2268 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2270 * isatool usedir: new option -C (default true) controls whether option
2271 -D should include a copy of the original document directory; -C false
2272 prevents unwanted effects such as copying of administrative CVS data.
2277 * Considerably improved version of 'constdefs' command. Now performs
2278 automatic type-inference of declared constants; additional support for
2279 local structure declarations (cf. locales and HOL records), see also
2280 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2281 sequential dependencies of definitions within a single 'constdefs'
2282 section; moreover, the declared name needs to be an identifier. If
2283 all fails, consider to fall back on 'consts' and 'defs' separately.
2285 * Improved indexed syntax and implicit structures. First of all,
2286 indexed syntax provides a notational device for subscripted
2287 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2288 expressions. Secondly, in a local context with structure
2289 declarations, number indexes \<^sub>n or the empty index (default
2290 number 1) refer to a certain fixed variable implicitly; option
2291 show_structs controls printing of implicit structures. Typical
2292 applications of these concepts involve record types and locales.
2294 * New command 'no_syntax' removes grammar declarations (and
2295 translations) resulting from the given syntax specification, which is
2296 interpreted in the same manner as for the 'syntax' command.
2298 * 'Advanced' translation functions (parse_translation etc.) may depend
2299 on the signature of the theory context being presently used for
2300 parsing/printing, see also isar-ref manual.
2302 * Improved 'oracle' command provides a type-safe interface to turn an
2303 ML expression of type theory -> T -> term into a primitive rule of
2304 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2305 is already included here); see also FOL/ex/IffExample.thy;
2308 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2309 before); "cI" is no longer bound, use "c.intro" instead.
2310 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2311 axclasses vs. locales.
2313 * Improved internal renaming of symbolic identifiers -- attach primes
2314 instead of base 26 numbers.
2316 * New flag show_question_marks controls printing of leading question
2317 marks in schematic variable names.
2319 * In schematic variable names, *any* symbol following \<^isub> or
2320 \<^isup> is now treated as part of the base name. For example, the
2321 following works without printing of awkward ".0" indexes:
2323 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2326 * Inner syntax includes (*(*nested*) comments*).
2328 * Pretty printer now supports unbreakable blocks, specified in mixfix
2329 annotations as "(00...)".
2331 * Clear separation of logical types and nonterminals, where the latter
2332 may only occur in 'syntax' specifications or type abbreviations.
2333 Before that distinction was only partially implemented via type class
2334 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2335 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2336 exotic syntax specifications may require further adaption
2337 (e.g. Cube/Cube.thy).
2339 * Removed obsolete type class "logic", use the top sort {} instead.
2340 Note that non-logical types should be declared as 'nonterminals'
2341 rather than 'types'. INCOMPATIBILITY for new object-logic
2344 * Attributes 'induct' and 'cases': type or set names may now be
2345 locally fixed variables as well.
2347 * Simplifier: can now control the depth to which conditional rewriting
2348 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2351 * Simplifier: simplification procedures may now take the current
2352 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2353 interface), which is very useful for calling the Simplifier
2354 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2355 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2356 low-level mk_simproc no longer applies Logic.varify internally, to
2357 allow for use in a context of fixed variables.
2359 * thin_tac now works even if the assumption being deleted contains !!
2360 or ==>. More generally, erule now works even if the major premise of
2361 the elimination rule contains !! or ==>.
2363 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2365 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2366 from Pure, which contains all common declarations already. Both
2367 theories are defined via plain Isabelle/Isar .thy files.
2368 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2369 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2370 use isatool fixcpure to adapt your theory and ML sources.
2372 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2373 selections of theorems in named facts via index ranges.
2375 * 'print_theorems': in theory mode, really print the difference
2376 wrt. the last state (works for interactive theory development only),
2377 in proof mode print all local facts (cf. 'print_facts');
2379 * 'hide': option '(open)' hides only base names.
2381 * More efficient treatment of intermediate checkpoints in interactive
2384 * Code generator is now invoked via code_module (incremental code
2385 generation) and code_library (modular code generation, ML structures
2386 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2387 must be quoted when used as identifiers.
2389 * New 'value' command for reading, evaluating and printing terms using
2390 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2391 quoted when used as identifier.
2396 * New commands for the interpretation of locale expressions in
2397 theories (1), locales (2) and proof contexts (3). These generate
2398 proof obligations from the expression specification. After the
2399 obligations have been discharged, theorems of the expression are added
2400 to the theory, target locale or proof context. The synopsis of the
2401 commands is a follows:
2403 (1) interpretation expr inst
2404 (2) interpretation target < expr
2405 (3) interpret expr inst
2407 Interpretation in theories and proof contexts require a parameter
2408 instantiation of terms from the current context. This is applied to
2409 specifications and theorems of the interpreted expression.
2410 Interpretation in locales only permits parameter renaming through the
2411 locale expression. Interpretation is smart in that interpretations
2412 that are active already do not occur in proof obligations, neither are
2413 instantiated theorems stored in duplicate. Use 'print_interps' to
2414 inspect active interpretations of a particular locale. For details,
2415 see the Isar Reference manual. Examples can be found in
2416 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2418 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2419 'interpret' instead.
2421 * New context element 'constrains' for adding type constraints to
2424 * Context expressions: renaming of parameters with syntax
2427 * Locale declaration: 'includes' disallowed.
2429 * Proper static binding of attribute syntax -- i.e. types / terms /
2430 facts mentioned as arguments are always those of the locale definition
2431 context, independently of the context of later invocations. Moreover,
2432 locale operations (renaming and type / term instantiation) are applied
2433 to attribute arguments as expected.
2435 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2436 actual attributes; rare situations may require Attrib.attribute to
2437 embed those attributes into Attrib.src that lack concrete syntax.
2438 Attribute implementations need to cooperate properly with the static
2439 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2440 Attrib.XXX_thm etc. already do the right thing without further
2441 intervention. Only unusual applications -- such as "where" or "of"
2442 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2443 on the context and the facts involved -- may have to assign parsed
2444 values to argument tokens explicitly.
2446 * Changed parameter management in theorem generation for long goal
2447 statements with 'includes'. INCOMPATIBILITY: produces a different
2448 theorem statement in rare situations.
2450 * Locale inspection command 'print_locale' omits notes elements. Use
2451 'print_locale!' to have them included in the output.
2456 * Provers/hypsubst.ML: improved version of the subst method, for
2457 single-step rewriting: it now works in bound variable contexts. New is
2458 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2459 rewrite a different subterm than the original subst method, which is
2460 still available as 'simplesubst'.
2462 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2465 * Provers/trancl.ML: new transitivity reasoner for transitive and
2466 reflexive-transitive closure of relations.
2468 * Provers/blast.ML: new reference depth_limit to make blast's depth
2469 limit (previously hard-coded with a value of 20) user-definable.
2471 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2472 is peformed already. Object-logics merely need to finish their
2473 initial simpset configuration as before. INCOMPATIBILITY.
2478 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2481 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2483 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2484 and x-symbol; use option '-m epsilon' to get it actually printed.
2485 Moreover, the mathematically important symbolic identifier \<epsilon>
2486 becomes available as variable, constant etc. INCOMPATIBILITY,
2488 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2489 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2490 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2491 support corresponding Isar calculations.
2493 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2496 * theory SetInterval: changed the syntax for open intervals:
2505 The old syntax is still supported but will disappear in the next
2506 release. For conversion use the following Emacs search and replace
2507 patterns (these are not perfect but work quite well):
2509 {)\([^\.]*\)\.\. -> {\1<\.\.}
2510 \.\.\([^(}]*\)(} -> \.\.<\1}
2512 * Theory Commutative_Ring (in Library): method comm_ring for proving
2513 equalities in commutative rings; method 'algebra' provides a generic
2516 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2517 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2518 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2521 Some new syntax forms are available:
2523 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2524 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2525 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2526 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2528 The latter form "\<Sum>x < k. e" used to be based on a separate
2529 function "Summation", which has been discontinued.
2531 * theory Finite_Set: in structured induction proofs, the insert case
2532 is now 'case (insert x F)' instead of the old counterintuitive 'case
2535 * The 'refute' command has been extended to support a much larger
2536 fragment of HOL, including axiomatic type classes, constdefs and
2537 typedefs, inductive datatypes and recursion.
2539 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2540 Requires zChaff with proof generation to be installed. See
2541 HOL/ex/SAT_Examples.thy for examples.
2543 * Datatype induction via method 'induct' now preserves the name of the
2544 induction variable. For example, when proving P(xs::'a list) by
2545 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2546 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2547 in unstructured proof scripts.
2549 * Reworked implementation of records. Improved scalability for
2550 records with many fields, avoiding performance problems for type
2551 inference. Records are no longer composed of nested field types, but
2552 of nested extension types. Therefore the record type only grows linear
2553 in the number of extensions and not in the number of fields. The
2554 top-level (users) view on records is preserved. Potential
2555 INCOMPATIBILITY only in strange cases, where the theory depends on the
2556 old record representation. The type generated for a record is called
2557 <record_name>_ext_type.
2559 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2560 proofs triggered by a record definition or a simproc (if
2561 quick_and_dirty is enabled). Definitions of large records can take
2564 New simproc record_upd_simproc for simplification of multiple record
2565 updates enabled by default. Moreover, trivial updates are also
2566 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2567 occasionally, since simplification is more powerful by default.
2569 * typedef: proper support for polymorphic sets, which contain extra
2570 type-variables in the term.
2572 * Simplifier: automatically reasons about transitivity chains
2573 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2574 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2575 old proofs break occasionally as simplification may now solve more
2576 goals than previously.
2578 * Simplifier: converts x <= y into x = y if assumption y <= x is
2579 present. Works for all partial orders (class "order"), in particular
2580 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2583 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2584 bound variable or a constant then the let is unfolded. Otherwise
2585 first a is simplified to b, and then f b is simplified to g. If
2586 possible we abstract b from g arriving at "let x = b in h x",
2587 otherwise we unfold the let and arrive at g. The simproc can be
2588 enabled/disabled by the reference use_let_simproc. Potential
2589 INCOMPATIBILITY since simplification is more powerful by default.
2591 * Classical reasoning: the meson method now accepts theorems as arguments.
2593 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2594 jobs to provide advice on the provability of subgoals.
2596 * Theory OrderedGroup and Ring_and_Field: various additions and
2597 improvements to faciliate calculations involving equalities and
2600 The following theorems have been eliminated or modified
2603 abs_eq now named abs_of_nonneg
2604 abs_of_ge_0 now named abs_of_nonneg
2605 abs_minus_eq now named abs_of_nonpos
2606 imp_abs_id now named abs_of_nonneg
2607 imp_abs_neg_id now named abs_of_nonpos
2608 mult_pos now named mult_pos_pos
2609 mult_pos_le now named mult_nonneg_nonneg
2610 mult_pos_neg_le now named mult_nonneg_nonpos
2611 mult_pos_neg2_le now named mult_nonneg_nonpos2
2612 mult_neg now named mult_neg_neg
2613 mult_neg_le now named mult_nonpos_nonpos
2615 * The following lemmas in Ring_and_Field have been added to the simplifier:
2618 not_square_less_zero
2620 The following lemmas have been deleted from Real/RealPow:
2630 * Theory Parity: added rules for simplifying exponents.
2634 The following theorems have been eliminated or modified
2637 list_all_Nil now named list_all.simps(1)
2638 list_all_Cons now named list_all.simps(2)
2639 list_all_conv now named list_all_iff
2640 set_mem_eq now named mem_iff
2642 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2643 asymptotic "big O" calculations. See the notes in BigO.thy.
2648 * Theory RealDef: better support for embedding natural numbers and
2649 integers in the reals.
2651 The following theorems have been eliminated or modified
2654 exp_ge_add_one_self now requires no hypotheses
2655 real_of_int_add reversed direction of equality (use [symmetric])
2656 real_of_int_minus reversed direction of equality (use [symmetric])
2657 real_of_int_diff reversed direction of equality (use [symmetric])
2658 real_of_int_mult reversed direction of equality (use [symmetric])
2660 * Theory RComplete: expanded support for floor and ceiling functions.
2662 * Theory Ln is new, with properties of the natural logarithm
2664 * Hyperreal: There is a new type constructor "star" for making
2665 nonstandard types. The old type names are now type synonyms:
2669 hcomplex = complex star
2671 * Hyperreal: Many groups of similarly-defined constants have been
2672 replaced by polymorphic versions (INCOMPATIBILITY):
2674 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2676 starset <-- starsetNat, starsetC
2677 *s* <-- *sNat*, *sc*
2678 starset_n <-- starsetNat_n, starsetC_n
2679 *sn* <-- *sNatn*, *scn*
2680 InternalSets <-- InternalNatSets, InternalCSets
2682 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2683 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2684 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2685 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2686 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2688 * Hyperreal: Many type-specific theorems have been removed in favor of
2689 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2691 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2692 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2693 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2694 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2695 right_minus <-- hypreal_add_minus
2696 left_minus <-- {hypreal,hcomplex}_add_minus_left
2697 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2698 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2699 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2700 mult_1_right <-- hcomplex_mult_one_right
2701 mult_zero_left <-- hcomplex_mult_zero_left
2702 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2703 right_distrib <-- hypnat_add_mult_distrib2
2704 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2705 right_inverse <-- hypreal_mult_inverse
2706 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2707 order_refl <-- {hypreal,hypnat}_le_refl
2708 order_trans <-- {hypreal,hypnat}_le_trans
2709 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2710 order_less_le <-- {hypreal,hypnat}_less_le
2711 linorder_linear <-- {hypreal,hypnat}_le_linear
2712 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2713 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2714 add_nonneg_nonneg <-- hypreal_le_add_order
2716 * Hyperreal: Separate theorems having to do with type-specific
2717 versions of constants have been merged into theorems that apply to the
2718 new polymorphic constants (INCOMPATIBILITY):
2720 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2721 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2722 STAR_Un <-- {STAR,NatStar,STARC}_Un
2723 STAR_Int <-- {STAR,NatStar,STARC}_Int
2724 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2725 STAR_subset <-- {STAR,NatStar,STARC}_subset
2726 STAR_mem <-- {STAR,NatStar,STARC}_mem
2727 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2728 STAR_diff <-- {STAR,STARC}_diff
2729 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2730 STARC_hcomplex_of_complex}_image_subset
2731 starset_n_Un <-- starset{Nat,C}_n_Un
2732 starset_n_Int <-- starset{Nat,C}_n_Int
2733 starset_n_Compl <-- starset{Nat,C}_n_Compl
2734 starset_n_diff <-- starset{Nat,C}_n_diff
2735 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2736 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2737 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2738 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2739 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2740 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2741 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2742 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2743 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2744 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2745 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2746 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2747 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2748 starfun_diff <-- starfun{C,RC,CR}_diff
2749 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2750 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2751 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2752 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2753 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2754 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2755 starfun_Id <-- starfunC_Id
2756 starfun_approx <-- starfun{Nat,CR}_approx
2757 starfun_capprox <-- starfun{C,RC}_capprox
2758 starfun_abs <-- starfunNat_rabs
2759 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2760 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2761 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2762 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2763 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2764 starfun_add_approx <-- starfunCR_add_approx
2765 starfun_inverse_inverse <-- starfunC_inverse_inverse
2766 starfun_divide <-- starfun{C,CR,RC}_divide
2767 starfun_n <-- starfun{Nat,C}_n
2768 starfun_n_mult <-- starfun{Nat,C}_n_mult
2769 starfun_n_add <-- starfun{Nat,C}_n_add
2770 starfun_n_add_minus <-- starfunNat_n_add_minus
2771 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2772 starfun_n_minus <-- starfun{Nat,C}_n_minus
2773 starfun_n_eq <-- starfun{Nat,C}_n_eq
2775 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2776 star_n_minus <-- {hypreal,hcomplex}_minus
2777 star_n_diff <-- {hypreal,hcomplex}_diff
2778 star_n_mult <-- {hypreal,hcomplex}_mult
2779 star_n_inverse <-- {hypreal,hcomplex}_inverse
2780 star_n_le <-- {hypreal,hypnat}_le
2781 star_n_less <-- {hypreal,hypnat}_less
2782 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2783 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2784 star_n_abs <-- hypreal_hrabs
2785 star_n_divide <-- hcomplex_divide
2787 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2788 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2789 star_of_diff <-- hypreal_of_real_diff
2790 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2791 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2792 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2793 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2794 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2795 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2796 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2797 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2798 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2799 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2800 star_of_number_of <-- {hypreal,hcomplex}_number_of
2801 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2802 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2803 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2804 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2805 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2806 star_of_power <-- hypreal_of_real_power
2807 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2809 * Hyperreal: new method "transfer" that implements the transfer
2810 principle of nonstandard analysis. With a subgoal that mentions
2811 nonstandard types like "'a star", the command "apply transfer"
2812 replaces it with an equivalent one that mentions only standard types.
2813 To be successful, all free variables must have standard types; non-
2814 standard variables must have explicit universal quantifiers.
2816 * Hyperreal: A theory of Taylor series.
2821 * Discontinued special version of 'constdefs' (which used to support
2822 continuous functions) in favor of the general Pure one with full
2825 * New simplification procedure for solving continuity conditions; it
2826 is much faster on terms with many nested lambda abstractions (cubic
2827 instead of exponential time).
2829 * New syntax for domain package: selector names are now optional.
2830 Parentheses should be omitted unless argument is lazy, for example:
2832 domain 'a stream = cons "'a" (lazy "'a stream")
2834 * New command 'fixrec' for defining recursive functions with pattern
2835 matching; defining multiple functions with mutual recursion is also
2836 supported. Patterns may include the constants cpair, spair, up, sinl,
2837 sinr, or any data constructor defined by the domain package. The given
2838 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2839 syntax and examples.
2841 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2842 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2843 but the proof obligation additionally includes an admissibility
2844 requirement. The packages generate instances of class cpo or pcpo,
2845 with continuity and strictness theorems for Rep and Abs.
2847 * HOLCF: Many theorems have been renamed according to a more standard naming
2848 scheme (INCOMPATIBILITY):
2850 foo_inject: "foo$x = foo$y ==> x = y"
2851 foo_eq: "(foo$x = foo$y) = (x = y)"
2852 foo_less: "(foo$x << foo$y) = (x << y)"
2853 foo_strict: "foo$UU = UU"
2854 foo_defined: "... ==> foo$x ~= UU"
2855 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2860 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2861 including the First Isomorphism Theorem (on quotienting by the kernel
2864 * ZF/Simplifier: install second copy of type solver that actually
2865 makes use of TC rules declared to Isar proof contexts (or locales);
2866 the old version is still required for ML proof scripts.
2871 * Converted to Isar theory format; use locales instead of axiomatic
2877 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
2880 * Pure/library.ML no longer defines its own option datatype, but uses
2881 that of the SML basis, which has constructors NONE and SOME instead of
2882 None and Some, as well as exception Option.Option instead of OPTION.
2883 The functions the, if_none, is_some, is_none have been adapted
2884 accordingly, while Option.map replaces apsome.
2886 * Pure/library.ML: the exception LIST has been given up in favour of
2887 the standard exceptions Empty and Subscript, as well as
2888 Library.UnequalLengths. Function like Library.hd and Library.tl are
2889 superceded by the standard hd and tl functions etc.
2891 A number of basic list functions are no longer exported to the ML
2892 toplevel, as they are variants of predefined functions. The following
2893 suggests how one can translate existing code:
2895 rev_append xs ys = List.revAppend (xs, ys)
2896 nth_elem (i, xs) = List.nth (xs, i)
2897 last_elem xs = List.last xs
2898 flat xss = List.concat xss
2899 seq fs = List.app fs
2900 partition P xs = List.partition P xs
2901 mapfilter f xs = List.mapPartial f xs
2903 * Pure/library.ML: several combinators for linear functional
2904 transformations, notably reverse application and composition:
2907 (x, y) |-> f f #-> g
2909 * Pure/library.ML: introduced/changed precedence of infix operators:
2911 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
2913 infix 3 o oo ooo oooo;
2914 infix 4 ~~ upto downto;
2916 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
2919 * Pure/library.ML: natural list combinators fold, fold_rev, and
2920 fold_map support linear functional transformations and nesting. For
2923 fold f [x1, ..., xN] y =
2924 y |> f x1 |> ... |> f xN
2926 (fold o fold) f [xs1, ..., xsN] y =
2927 y |> fold f xs1 |> ... |> fold f xsN
2929 fold f [x1, ..., xN] =
2932 (fold o fold) f [xs1, ..., xsN] =
2933 fold f xs1 #> ... #> fold f xsN
2935 * Pure/library.ML: the following selectors on type 'a option are
2938 the: 'a option -> 'a (*partial*)
2939 these: 'a option -> 'a where 'a = 'b list
2940 the_default: 'a -> 'a option -> 'a
2941 the_list: 'a option -> 'a list
2943 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2944 basic operations for association lists, following natural argument
2945 order; moreover the explicit equality predicate passed here avoids
2946 potentially expensive polymorphic runtime equality checks.
2947 The old functions may be expressed as follows:
2949 assoc = uncurry (AList.lookup (op =))
2950 assocs = these oo AList.lookup (op =)
2951 overwrite = uncurry (AList.update (op =)) o swap
2953 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2955 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
2956 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
2958 replacing make_keylist and keyfilter (occassionally used)
2961 make_keylist = AList.make
2962 keyfilter = AList.find (op =)
2964 * eq_fst and eq_snd now take explicit equality parameter, thus
2965 avoiding eqtypes. Naive rewrites:
2967 eq_fst = eq_fst (op =)
2968 eq_snd = eq_snd (op =)
2970 * Removed deprecated apl and apr (rarely used).
2973 apl (n, op) =>>= curry op n
2974 apr (op, m) =>>= fn n => op (n, m)
2976 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
2977 provides a reasonably efficient light-weight implementation of sets as
2980 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
2981 few new operations; existing lookup and update are now curried to
2982 follow natural argument order (for use with fold etc.);
2983 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
2985 * Pure/General: output via the Isabelle channels of
2986 writeln/warning/error etc. is now passed through Output.output, with a
2987 hook for arbitrary transformations depending on the print_mode
2988 (cf. Output.add_mode -- the first active mode that provides a output
2989 function wins). Already formatted output may be embedded into further
2990 text via Output.raw; the result of Pretty.string_of/str_of and derived
2991 functions (string_of_term/cterm/thm etc.) is already marked raw to
2992 accommodate easy composition of diagnostic messages etc. Programmers
2993 rarely need to care about Output.output or Output.raw at all, with
2994 some notable exceptions: Output.output is required when bypassing the
2995 standard channels (writeln etc.), or in token translations to produce
2996 properly formatted results; Output.raw is required when capturing
2997 already output material that will eventually be presented to the user
2998 a second time. For the default print mode, both Output.output and
2999 Output.raw have no effect.
3001 * Pure/General: Output.time_accumulator NAME creates an operator ('a
3002 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
3003 cumulative results are displayed at the end of a batch session.
3005 * Pure/General: File.sysify_path and File.quote_sysify path have been
3006 replaced by File.platform_path and File.shell_path (with appropriate
3007 hooks). This provides a clean interface for unusual systems where the
3008 internal and external process view of file names are different.
3010 * Pure: more efficient orders for basic syntactic entities: added
3011 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
3012 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
3013 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
3014 orders now -- potential INCOMPATIBILITY for code that depends on a
3015 particular order for Symtab.keys, Symtab.dest, etc. (consider using
3016 Library.sort_strings on result).
3018 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
3019 fold_types traverse types/terms from left to right, observing natural
3020 argument order. Supercedes previous foldl_XXX versions, add_frees,
3021 add_vars etc. have been adapted as well: INCOMPATIBILITY.
3023 * Pure: name spaces have been refined, with significant changes of the
3024 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
3025 to extern(_table). The plain name entry path is superceded by a
3026 general 'naming' context, which also includes the 'policy' to produce
3027 a fully qualified name and external accesses of a fully qualified
3028 name; NameSpace.extend is superceded by context dependent
3029 Sign.declare_name. Several theory and proof context operations modify
3030 the naming context. Especially note Theory.restore_naming and
3031 ProofContext.restore_naming to get back to a sane state; note that
3032 Theory.add_path is no longer sufficient to recover from
3033 Theory.absolute_path in particular.
3035 * Pure: new flags short_names (default false) and unique_names
3036 (default true) for controlling output of qualified names. If
3037 short_names is set, names are printed unqualified. If unique_names is
3038 reset, the name prefix is reduced to the minimum required to achieve
3039 the original result when interning again, even if there is an overlap
3040 with earlier declarations.
3042 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
3043 now 'extend', and 'merge' gets an additional Pretty.pp argument
3044 (useful for printing error messages). INCOMPATIBILITY.
3046 * Pure: major reorganization of the theory context. Type Sign.sg and
3047 Theory.theory are now identified, referring to the universal
3048 Context.theory (see Pure/context.ML). Actual signature and theory
3049 content is managed as theory data. The old code and interfaces were
3050 spread over many files and structures; the new arrangement introduces
3051 considerable INCOMPATIBILITY to gain more clarity:
3053 Context -- theory management operations (name, identity, inclusion,
3054 parents, ancestors, merge, etc.), plus generic theory data;
3056 Sign -- logical signature and syntax operations (declaring consts,
3057 types, etc.), plus certify/read for common entities;
3059 Theory -- logical theory operations (stating axioms, definitions,
3060 oracles), plus a copy of logical signature operations (consts,
3061 types, etc.); also a few basic management operations (Theory.copy,
3064 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
3065 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
3066 for convenience -- they merely return the theory.
3068 * Pure: type Type.tsig is superceded by theory in most interfaces.
3070 * Pure: the Isar proof context type is already defined early in Pure
3071 as Context.proof (note that ProofContext.context and Proof.context are
3072 aliases, where the latter is the preferred name). This enables other
3073 Isabelle components to refer to that type even before Isar is present.
3075 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3076 typeK, constK, axiomK, oracleK), but provide explicit operations for
3077 any of these kinds. For example, Sign.intern typeK is now
3078 Sign.intern_type, Theory.hide_space Sign.typeK is now
3079 Theory.hide_types. Also note that former
3080 Theory.hide_classes/types/consts are now
3081 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3082 internalize their arguments! INCOMPATIBILITY.
3084 * Pure: get_thm interface (of PureThy and ProofContext) expects
3085 datatype thmref (with constructors Name and NameSelection) instead of
3086 plain string -- INCOMPATIBILITY;
3088 * Pure: cases produced by proof methods specify options, where NONE
3089 means to remove case bindings -- INCOMPATIBILITY in
3092 * Pure: the following operations retrieve axioms or theorems from a
3093 theory node or theory hierarchy, respectively:
3095 Theory.axioms_of: theory -> (string * term) list
3096 Theory.all_axioms_of: theory -> (string * term) list
3097 PureThy.thms_of: theory -> (string * thm) list
3098 PureThy.all_thms_of: theory -> (string * thm) list
3100 * Pure: print_tac now outputs the goal through the trace channel.
3102 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3103 Reference Toplevel.debug (default false) controls detailed printing
3104 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3105 controls execution profiling -- set to 1 for time and 2 for space
3106 (both increase the runtime).
3108 * Isar session: The initial use of ROOT.ML is now always timed,
3109 i.e. the log will show the actual process times, in contrast to the
3110 elapsed wall-clock time that the outer shell wrapper produces.
3112 * Simplifier: improved handling of bound variables (nameless
3113 representation, avoid allocating new strings). Simprocs that invoke
3114 the Simplifier recursively should use Simplifier.inherit_bounds to
3115 avoid local name clashes. Failure to do so produces warnings
3116 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3117 for further details.
3119 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3120 bindings for all theorems stored within a given theory; this may help
3121 in porting non-Isar theories to Isar ones, while keeping ML proof
3122 scripts for the time being.
3124 * ML operator HTML.with_charset specifies the charset begin used for
3125 generated HTML files. For example:
3127 HTML.with_charset "utf-8" use_thy "Hebrew";
3128 HTML.with_charset "utf-8" use_thy "Chinese";
3133 * Allow symlinks to all proper Isabelle executables (Isabelle,
3134 isabelle, isatool etc.).
3136 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3137 isatool doc, isatool mkdir, display_drafts etc.).
3139 * isatool usedir: option -f allows specification of the ML file to be
3140 used by Isabelle; default is ROOT.ML.
3142 * New isatool version outputs the version identifier of the Isabelle
3143 distribution being used.
3145 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3146 (containing Boolean satisfiability problems) into Isabelle/HOL
3151 New in Isabelle2004 (April 2004)
3152 --------------------------------
3156 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3157 Replaces linorder.ML.
3159 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3160 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3161 (\<a>...\<z>), are now considered normal letters, and can therefore
3162 be used anywhere where an ASCII letter (a...zA...Z) has until
3163 now. COMPATIBILITY: This obviously changes the parsing of some
3164 terms, especially where a symbol has been used as a binder, say
3165 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3166 as an identifier. Fix it by inserting a space around former
3167 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3168 existing theory and ML files.
3170 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3172 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3173 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3174 a normal (but invisible) letter. For multiple letter subscripts repeat
3175 \<^isub> like this: x\<^isub>1\<^isub>2.
3177 * Pure: There are now sub-/superscripts that can span more than one
3178 character. Text between \<^bsub> and \<^esub> is set in subscript in
3179 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3180 superscript. The new control characters are not identifier parts.
3182 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3183 content of "..." to the latex file instead of \isacntrl... . The "..."
3184 may consist of any printable characters excluding the end bracket >.
3186 * Pure: Using new Isar command "finalconsts" (or the ML functions
3187 Theory.add_finals or Theory.add_finals_i) it is now possible to
3188 declare constants "final", which prevents their being given a definition
3189 later. It is useful for constants whose behaviour is fixed axiomatically
3190 rather than definitionally, such as the meta-logic connectives.
3192 * Pure: 'instance' now handles general arities with general sorts
3193 (i.e. intersections of classes),
3195 * Presentation: generated HTML now uses a CSS style sheet to make layout
3196 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3197 It can be changed to alter the colors/layout of generated pages.
3202 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3203 cut_tac, subgoal_tac and thin_tac:
3204 - Now understand static (Isar) contexts. As a consequence, users of Isar
3205 locales are no longer forced to write Isar proof scripts.
3206 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3208 - INCOMPATIBILITY: names of variables to be instantiated may no
3209 longer be enclosed in quotes. Instead, precede variable name with `?'.
3210 This is consistent with the instantiation attribute "where".
3212 * Attributes "where" and "of":
3213 - Now take type variables of instantiated theorem into account when reading
3214 the instantiation string. This fixes a bug that caused instantiated
3215 theorems to have too special types in some circumstances.
3216 - "where" permits explicit instantiations of type variables.
3218 * Calculation commands "moreover" and "also" no longer interfere with
3219 current facts ("this"), admitting arbitrary combinations with "then"
3223 - Goal statements involving the context element "includes" no longer
3224 generate theorems with internal delta predicates (those ending on
3225 "_axioms") in the premise.
3226 Resolve particular premise with <locale>.intro to obtain old form.
3227 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3228 specification and "includes" elements in goal statement.
3229 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3230 [intro?] and [elim?] (respectively) by default.
3231 - Experimental command for instantiation of locales in proof contexts:
3232 instantiate <label>[<attrs>]: <loc>
3233 Instantiates locale <loc> and adds all its theorems to the current context
3234 taking into account their attributes. Label and attrs are optional
3235 modifiers, like in theorem declarations. If present, names of
3236 instantiated theorems are qualified with <label>, and the attributes
3237 <attrs> are applied after any attributes these theorems might have already.
3238 If the locale has assumptions, a chained fact of the form
3239 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3240 are derived. The command does not support old-style locales declared
3241 with "locale (open)".
3242 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3244 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3250 * Proof import: new image HOL4 contains the imported library from
3251 the HOL4 system with about 2500 theorems. It is imported by
3252 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3253 can be used like any other Isabelle image. See
3254 HOL/Import/HOL/README for more information.
3257 - Much improved handling of linear and partial orders.
3258 Reasoners for linear and partial orders are set up for type classes
3259 "linorder" and "order" respectively, and are added to the default simpset
3260 as solvers. This means that the simplifier can build transitivity chains
3261 to solve goals from the assumptions.
3262 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3263 of blast or auto after simplification become unnecessary because the goal
3264 is solved by simplification already.
3266 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3267 all proved in axiomatic type classes for semirings, rings and fields.
3270 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3271 now formalized using the Ring_and_Field theory mentioned above.
3272 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3273 than before, because now they are set up once in a generic manner.
3274 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3275 Look for the general versions in Ring_and_Field (and Power if they concern
3278 * Type "rat" of the rational numbers is now available in HOL-Complex.
3281 - Record types are now by default printed with their type abbreviation
3282 instead of the list of all field types. This can be configured via
3283 the reference "print_record_type_abbr".
3284 - Simproc "record_upd_simproc" for simplification of multiple updates added
3285 (not enabled by default).
3286 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3287 EX x. x = sel r to True (not enabled by default).
3288 - Tactic "record_split_simp_tac" to split and simplify records added.
3290 * 'specification' command added, allowing for definition by
3291 specification. There is also an 'ax_specification' command that
3292 introduces the new constants axiomatically.
3294 * arith(_tac) is now able to generate counterexamples for reals as well.
3296 * HOL-Algebra: new locale "ring" for non-commutative rings.
3298 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3299 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3301 * HOL-Matrix: a first theory for matrices in HOL with an application of
3302 matrix theory to linear programming.
3304 * Unions and Intersections:
3305 The latex output syntax of UN and INT has been changed
3306 from "\Union x \in A. B" to "\Union_{x \in A} B"
3307 i.e. the index formulae has become a subscript.
3308 Similarly for "\Union x. B", and for \Inter instead of \Union.
3310 * Unions and Intersections over Intervals:
3311 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3312 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3313 like in normal math, and corresponding versions for < and for intersection.
3315 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3316 lexicographic dictonary ordering has been added as "lexord".
3318 * ML: the legacy theory structures Int and List have been removed. They had
3319 conflicted with ML Basis Library structures having the same names.
3321 * 'refute' command added to search for (finite) countermodels. Only works
3322 for a fragment of HOL. The installation of an external SAT solver is
3323 highly recommended. See "HOL/Refute.thy" for details.
3325 * 'quickcheck' command: Allows to find counterexamples by evaluating
3326 formulae under an assignment of free variables to random values.
3327 In contrast to 'refute', it can deal with inductive datatypes,
3328 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3334 * Streams now come with concatenation and are part of the HOLCF image
3338 New in Isabelle2003 (May 2003)
3339 ------------------------------
3343 * Provers/simplifier:
3345 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3346 Assumptions are now subject to complete mutual simplification,
3347 not just from left to right. The simplifier now preserves
3348 the order of assumptions.
3350 Potential INCOMPATIBILITY:
3352 -- simp sometimes diverges where the old version did
3353 not, e.g. invoking simp on the goal
3355 [| P (f x); y = x; f x = f y |] ==> Q
3357 now gives rise to the infinite reduction sequence
3359 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3361 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3364 -- Tactics combining classical reasoner and simplification (such as auto)
3365 are also affected by this change, because many of them rely on
3366 simp. They may sometimes diverge as well or yield a different numbers
3367 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3368 in case of problems. Sometimes subsequent calls to the classical
3369 reasoner will fail because a preceeding call to the simplifier too
3370 eagerly simplified the goal, e.g. deleted redundant premises.
3372 - The simplifier trace now shows the names of the applied rewrite rules
3374 - You can limit the number of recursive invocations of the simplifier
3375 during conditional rewriting (where the simplifie tries to solve the
3376 conditions before applying the rewrite rule):
3377 ML "simp_depth_limit := n"
3378 where n is an integer. Thus you can force termination where previously
3379 the simplifier would diverge.
3381 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3383 - No longer aborts on failed congruence proof. Instead, the
3384 congruence is ignored.
3386 * Pure: New generic framework for extracting programs from constructive
3387 proofs. See HOL/Extraction.thy for an example instantiation, as well
3388 as HOL/Extraction for some case studies.
3390 * Pure: The main goal of the proof state is no longer shown by default, only
3391 the subgoals. This behaviour is controlled by a new flag.
3392 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3393 (ML: Proof.show_main_goal).
3395 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3396 rules whose conclusion matches subgoal 1:
3397 PG menu: Isabelle/Isar -> Show me -> matching rules
3398 The rules are ordered by how closely they match the subgoal.
3399 In particular, rules that solve a subgoal outright are displayed first
3400 (or rather last, the way they are printed).
3401 (ML: ProofGeneral.print_intros())
3403 * Pure: New flag trace_unify_fail causes unification to print
3404 diagnostic information (PG: in trace buffer) when it fails. This is
3405 useful for figuring out why single step proofs like rule, erule or
3408 * Pure: Locale specifications now produce predicate definitions
3409 according to the body of text (covering assumptions modulo local
3410 definitions); predicate "loc_axioms" covers newly introduced text,
3411 while "loc" is cumulative wrt. all included locale expressions; the
3412 latter view is presented only on export into the global theory
3413 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3414 on the old view without predicates;
3416 * Pure: predefined locales "var" and "struct" are useful for sharing
3417 parameters (as in CASL, for example); just specify something like
3418 ``var x + var y + struct M'' as import;
3420 * Pure: improved thms_containing: proper indexing of facts instead of
3421 raw theorems; check validity of results wrt. current name space;
3422 include local facts of proof configuration (also covers active
3423 locales), cover fixed variables in index; may use "_" in term
3424 specification; an optional limit for the number of printed facts may
3425 be given (the default is 40);
3427 * Pure: disallow duplicate fact bindings within new-style theory files
3430 * Provers: improved induct method: assumptions introduced by case
3431 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3432 the goal statement); "foo" still refers to all facts collectively;
3434 * Provers: the function blast.overloaded has been removed: all constants
3435 are regarded as potentially overloaded, which improves robustness in exchange
3436 for slight decrease in efficiency;
3438 * Provers/linorder: New generic prover for transitivity reasoning over
3439 linear orders. Note: this prover is not efficient!
3441 * Isar: preview of problems to finish 'show' now produce an error
3442 rather than just a warning (in interactive mode);
3449 - Produces a counter example if it cannot prove a goal.
3450 Note that the counter example may be spurious if the goal is not a formula
3451 of quantifier-free linear arithmetic.
3452 In ProofGeneral the counter example appears in the trace buffer.
3454 - Knows about div k and mod k where k is a numeral of type nat or int.
3456 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3457 linear arithmetic fails. This takes account of quantifiers and divisibility.
3458 Presburger arithmetic can also be called explicitly via presburger(_tac).
3460 * simp's arithmetic capabilities have been enhanced a bit: it now
3461 takes ~= in premises into account (by performing a case split);
3463 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3464 are distributed over a sum of terms;
3466 * New tactic "trans_tac" and method "trans" instantiate
3467 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3470 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3471 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3473 * 'typedef' command has new option "open" to suppress the set
3476 * functions Min and Max on finite sets have been introduced (theory
3479 * attribute [symmetric] now works for relations as well; it turns
3480 (x,y) : R^-1 into (y,x) : R, and vice versa;
3482 * induct over a !!-quantified statement (say !!x1..xn):
3483 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3485 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3486 %x. None. Warning: empty_def now refers to the previously hidden definition
3489 * Algebra: formalization of classical algebra. Intended as base for
3490 any algebraic development in Isabelle. Currently covers group theory
3491 (up to Sylow's theorem) and ring theory (Universal Property of
3492 Univariate Polynomials). Contributions welcome;
3494 * GroupTheory: deleted, since its material has been moved to Algebra;
3496 * Complex: new directory of the complex numbers with numeric constants,
3497 nonstandard complex numbers, and some complex analysis, standard and
3498 nonstandard (Jacques Fleuriot);
3500 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3502 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3505 * Real/HahnBanach: updated and adapted to locales;
3507 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3510 * UNITY: added the Meier-Sanders theory of progress sets;
3512 * MicroJava: bytecode verifier and lightweight bytecode verifier
3513 as abstract algorithms, instantiated to the JVM;
3515 * Bali: Java source language formalization. Type system, operational
3516 semantics, axiomatic semantics. Supported language features:
3517 classes, interfaces, objects,virtual methods, static methods,
3518 static/instance fields, arrays, access modifiers, definite
3519 assignment, exceptions.
3524 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3527 * Main ZF: virtually all theories converted to new-style format;
3532 * Pure: Tactic.prove provides sane interface for internal proofs;
3533 omits the infamous "standard" operation, so this is more appropriate
3534 than prove_goalw_cterm in many situations (e.g. in simprocs);
3536 * Pure: improved error reporting of simprocs;
3538 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3542 *** Document preparation ***
3544 * uses \par instead of \\ for line breaks in theory text. This may
3545 shift some page breaks in large documents. To get the old behaviour
3546 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3548 * minimized dependencies of isabelle.sty and isabellesym.sty on
3551 * \<euro> now needs package babel/greek instead of marvosym (which
3554 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3559 New in Isabelle2002 (March 2002)
3560 --------------------------------
3562 *** Document preparation ***
3564 * greatly simplified document preparation setup, including more
3565 graceful interpretation of isatool usedir -i/-d/-D options, and more
3566 instructive isatool mkdir; users should basically be able to get
3567 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3568 users may run a separate document processing stage manually like this:
3569 "isatool usedir -D output HOL Test && isatool document Test/output";
3571 * theory dependency graph may now be incorporated into documents;
3572 isatool usedir -g true will produce session_graph.eps/.pdf for use
3573 with \includegraphics of LaTeX;
3575 * proper spacing of consecutive markup elements, especially text
3576 blocks after section headings;
3578 * support bold style (for single symbols only), input syntax is like
3579 this: "\<^bold>\<alpha>" or "\<^bold>A";
3581 * \<bullet> is now output as bold \cdot by default, which looks much
3582 better in printed text;
3584 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3585 note that these symbols are currently unavailable in Proof General /
3586 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3588 * isatool latex no longer depends on changed TEXINPUTS, instead
3589 isatool document copies the Isabelle style files to the target
3595 * Pure/Provers: improved proof by cases and induction;
3596 - 'case' command admits impromptu naming of parameters (such as
3598 - 'induct' method divinates rule instantiation from the inductive
3599 claim; no longer requires excessive ?P bindings for proper
3600 instantiation of cases;
3601 - 'induct' method properly enumerates all possibilities of set/type
3602 rules; as a consequence facts may be also passed through *type*
3603 rules without further ado;
3604 - 'induct' method now derives symbolic cases from the *rulified*
3605 rule (before it used to rulify cases stemming from the internal
3606 atomized version); this means that the context of a non-atomic
3607 statement becomes is included in the hypothesis, avoiding the
3608 slightly cumbersome show "PROP ?case" form;
3609 - 'induct' may now use elim-style induction rules without chaining
3610 facts, using ``missing'' premises from the goal state; this allows
3611 rules stemming from inductive sets to be applied in unstructured
3612 scripts, while still benefitting from proper handling of non-atomic
3613 statements; NB: major inductive premises need to be put first, all
3614 the rest of the goal is passed through the induction;
3615 - 'induct' proper support for mutual induction involving non-atomic
3616 rule statements (uses the new concept of simultaneous goals, see
3618 - append all possible rule selections, but only use the first
3619 success (no backtracking);
3620 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3621 - undeclared rule case names default to numbers 1, 2, 3, ...;
3622 - added 'print_induct_rules' (covered by help item in recent Proof
3624 - moved induct/cases attributes to Pure, methods to Provers;
3625 - generic method setup instantiated for FOL and HOL;
3627 * Pure: support multiple simultaneous goal statements, for example
3628 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3629 meta-level mechanism, this acts as if several individual goals had
3630 been stated separately; in particular common proof methods need to be
3631 repeated in order to cover all claims; note that a single elimination
3632 step is *not* sufficient to establish the two conjunctions, so this
3635 assume "A & B" then have A and B .. (*".." fails*)
3637 better use "obtain" in situations as above; alternative refer to
3638 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3640 * Pure: proper integration with ``locales''; unlike the original
3641 version by Florian Kammller, Isar locales package high-level proof
3642 contexts rather than raw logical ones (e.g. we admit to include
3643 attributes everywhere); operations on locales include merge and
3644 rename; support for implicit arguments (``structures''); simultaneous
3645 type-inference over imports and text; see also HOL/ex/Locales.thy for
3648 * Pure: the following commands have been ``localized'', supporting a
3649 target locale specification "(in name)": 'lemma', 'theorem',
3650 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3651 stored both within the locale and at the theory level (exported and
3652 qualified by the locale name);
3654 * Pure: theory goals may now be specified in ``long'' form, with
3655 ad-hoc contexts consisting of arbitrary locale elements. for example
3656 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3657 definitions may be given, too); the result is a meta-level rule with
3658 the context elements being discharged in the obvious way;
3660 * Pure: new proof command 'using' allows to augment currently used
3661 facts after a goal statement ('using' is syntactically analogous to
3662 'apply', but acts on the goal's facts only); this allows chained facts
3663 to be separated into parts given before and after a claim, as in
3664 ``from a and b have C using d and e <proof>'';
3666 * Pure: renamed "antecedent" case to "rule_context";
3668 * Pure: new 'judgment' command records explicit information about the
3669 object-logic embedding (used by several tools internally); no longer
3670 use hard-wired "Trueprop";
3672 * Pure: added 'corollary' command;
3674 * Pure: fixed 'token_translation' command;
3676 * Pure: removed obsolete 'exported' attribute;
3678 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3679 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3680 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3682 * Pure: method 'atomize' presents local goal premises as object-level
3683 statements (atomic meta-level propositions); setup controlled via
3684 rewrite rules declarations of 'atomize' attribute; example
3685 application: 'induct' method with proper rule statements in improper
3688 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3689 now consider the syntactic context of assumptions, giving a better
3690 chance to get type-inference of the arguments right (this is
3691 especially important for locales);
3693 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3696 * Pure/obtain: the formal conclusion "thesis", being marked as
3697 ``internal'', may no longer be reference directly in the text;
3698 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3701 * Pure: generic 'sym' attribute which declares a rule both as pure
3702 'elim?' and for the 'symmetric' operation;
3704 * Pure: marginal comments ``--'' may now occur just anywhere in the
3705 text; the fixed correlation with particular command syntax has been
3708 * Pure: new method 'rules' is particularly well-suited for proof
3709 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3710 but often produces more compact proof terms with less detours;
3712 * Pure/Provers/classical: simplified integration with pure rule
3713 attributes and methods; the classical "intro?/elim?/dest?"
3714 declarations coincide with the pure ones; the "rule" method no longer
3715 includes classically swapped intros; "intro" and "elim" methods no
3716 longer pick rules from the context; also got rid of ML declarations
3717 AddXIs/AddXEs/AddXDs; all of this has some potential for
3720 * Provers/classical: attribute 'swapped' produces classical inversions
3721 of introduction rules;
3723 * Provers/simplifier: 'simplified' attribute may refer to explicit
3724 rules instead of full simplifier context; 'iff' attribute handles
3727 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3729 * HOL: 'recdef' now fails on unfinished automated proofs, use
3730 "(permissive)" option to recover old behavior;
3732 * HOL: 'inductive' no longer features separate (collective) attributes
3733 for 'intros' (was found too confusing);
3735 * HOL: properly declared induction rules less_induct and
3741 * HOL: moved over to sane numeral syntax; the new policy is as
3744 - 0 and 1 are polymorphic constants, which are defined on any
3745 numeric type (nat, int, real etc.);
3747 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3748 binary representation internally;
3750 - type nat has special constructor Suc, and generally prefers Suc 0
3751 over 1::nat and Suc (Suc 0) over 2::nat;
3753 This change may cause significant problems of INCOMPATIBILITY; here
3754 are some hints on converting existing sources:
3756 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3757 entities, so expressions involving "-" (unary or binary minus) need
3758 to be spaced properly;
3760 - existing occurrences of "1" may need to be constraint "1::nat" or
3761 even replaced by Suc 0; similar for old "2";
3763 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3765 - remove all special provisions on numerals in proofs;
3767 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3768 representation (depends on bin_arith_simps in the default context);
3770 * HOL: symbolic syntax for x^2 (numeral 2);
3772 * HOL: the class of all HOL types is now called "type" rather than
3773 "term"; INCOMPATIBILITY, need to adapt references to this type class
3774 in axclass/classes, instance/arities, and (usually rare) occurrences
3775 in typings (of consts etc.); internally the class is called
3776 "HOL.type", ML programs should refer to HOLogic.typeS;
3778 * HOL/record package improvements:
3779 - new derived operations "fields" to build a partial record section,
3780 "extend" to promote a fixed record to a record scheme, and
3781 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3782 declared as simp by default;
3783 - shared operations ("more", "fields", etc.) now need to be always
3784 qualified) --- potential INCOMPATIBILITY;
3785 - removed "make_scheme" operations (use "make" with "extend") --
3787 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3788 - provides cases/induct rules for use with corresponding Isar
3789 methods (for concrete records, record schemes, concrete more
3790 parts, and schematic more parts -- in that order);
3791 - internal definitions directly based on a light-weight abstract
3792 theory of product types over typedef rather than datatype;
3794 * HOL: generic code generator for generating executable ML code from
3795 specifications; specific support for HOL constructs such as inductive
3796 datatypes and sets, as well as recursive functions; can be invoked
3797 via 'generate_code' theory section;
3799 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3801 * HOL: consolidated and renamed several theories. In particular:
3802 Ord.thy has been absorbed into HOL.thy
3803 String.thy has been absorbed into List.thy
3805 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3806 (beware of argument permutation!);
3808 * HOL: linorder_less_split superseded by linorder_cases;
3810 * HOL/List: "nodups" renamed to "distinct";
3812 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3813 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3814 - Ex_def has changed, now need to use some_eq_ex
3816 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3817 in this (rare) case use:
3819 delSWrapper "split_all_tac"
3820 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3822 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3825 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3826 Isabelle's type classes, ^ on functions and relations has too general
3827 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3828 necessary to attach explicit type constraints;
3830 * HOL/Relation: the prefix name of the infix "O" has been changed from
3831 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3832 renamed accordingly (eg "compI" -> "rel_compI").
3834 * HOL: syntax translations now work properly with numerals and records
3837 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3838 of "lam" -- INCOMPATIBILITY;
3840 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3841 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3842 renamed "Product_Type.unit";
3844 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3846 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3847 the "cases" method);
3849 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3852 * HOL/IMP: updated and converted to new-style theory format; several
3853 parts turned into readable document, with proper Isar proof texts and
3854 some explanations (by Gerwin Klein);
3856 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3858 * HOL-Hyperreal is now a logic image;
3863 * Isar: consts/constdefs supports mixfix syntax for continuous
3866 * Isar: domain package adapted to new-style theory format, e.g. see
3869 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3870 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3871 lift.induct_tac, always use UU instead of Undef;
3873 * HOLCF/IMP: updated and converted to new-style theory;
3878 * Isar: proper integration of logic-specific tools and packages,
3879 including theory commands '(co)inductive', '(co)datatype',
3880 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
3881 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
3883 * theory Main no longer includes AC; for the Axiom of Choice, base
3884 your theory on Main_ZFC;
3886 * the integer library now covers quotients and remainders, with many
3887 laws relating division to addition, multiplication, etc.;
3889 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
3890 typeless version of the formalism;
3892 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
3895 * ZF/Induct: new directory for examples of inductive definitions,
3896 including theory Multiset for multiset orderings; converted to
3897 new-style theory format;
3899 * ZF: many new theorems about lists, ordinals, etc.;
3904 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
3905 variable proof controls level of detail: 0 = no proofs (only oracle
3906 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
3907 also ref manual for further ML interfaces;
3909 * Pure/axclass: removed obsolete ML interface
3910 goal_subclass/goal_arity;
3912 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
3913 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
3914 separate tokens, so expressions involving minus need to be spaced
3917 * Pure/syntax: support non-oriented infixes, using keyword "infix"
3918 rather than "infixl" or "infixr";
3920 * Pure/syntax: concrete syntax for dummy type variables admits genuine
3921 sort constraint specifications in type inference; e.g. "x::_::foo"
3922 ensures that the type of "x" is of sort "foo" (but not necessarily a
3925 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
3926 control output of nested => (types); the default behavior is
3929 * Pure/syntax: builtin parse translation for "_constify" turns valued
3930 tokens into AST constants;
3932 * Pure/syntax: prefer later declarations of translations and print
3933 translation functions; potential INCOMPATIBILITY: need to reverse
3934 multiple declarations for same syntax element constant;
3936 * Pure/show_hyps reset by default (in accordance to existing Isar
3939 * Provers/classical: renamed addaltern to addafter, addSaltern to
3942 * Provers/clasimp: ``iff'' declarations now handle conditional rules
3945 * system: tested support for MacOS X; should be able to get Isabelle +
3946 Proof General to work in a plain Terminal after installing Poly/ML
3947 (e.g. from the Isabelle distribution area) and GNU bash alone
3948 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
3949 support requires further installations, e.g. from
3950 http://fink.sourceforge.net/);
3952 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
3954 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
3955 of 40 MB), cf. ML_OPTIONS;
3957 * system: Proof General keywords specification is now part of the
3958 Isabelle distribution (see etc/isar-keywords.el);
3960 * system: support for persistent Proof General sessions (refrain from
3961 outdating all loaded theories on startup); user may create writable
3962 logic images like this: ``isabelle -q HOL Test'';
3964 * system: smart selection of Isabelle process versus Isabelle
3965 interface, accommodates case-insensitive file systems (e.g. HFS+); may
3966 run both "isabelle" and "Isabelle" even if file names are badly
3967 damaged (executable inspects the case of the first letter of its own
3968 name); added separate "isabelle-process" and "isabelle-interface";
3970 * system: refrain from any attempt at filtering input streams; no
3971 longer support ``8bit'' encoding of old isabelle font, instead proper
3972 iso-latin characters may now be used; the related isatools
3973 "symbolinput" and "nonascii" have disappeared as well;
3975 * system: removed old "xterm" interface (the print modes "xterm" and
3976 "xterm_color" are still available for direct use in a suitable
3981 New in Isabelle99-2 (February 2001)
3982 -----------------------------------
3984 *** Overview of INCOMPATIBILITIES ***
3986 * HOL: please note that theories in the Library and elsewhere often use the
3987 new-style (Isar) format; to refer to their theorems in an ML script you must
3988 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
3990 * HOL: inductive package no longer splits induction rule aggressively,
3991 but only as far as specified by the introductions given; the old
3992 format may be recovered via ML function complete_split_rule or attribute
3993 'split_rule (complete)';
3995 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
3996 gfp_Tarski to gfp_unfold;
3998 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
4000 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
4001 relation); infix "^^" has been renamed "``"; infix "``" has been
4002 renamed "`"; "univalent" has been renamed "single_valued";
4004 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
4007 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
4009 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
4011 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
4012 consequence, it is no longer monotonic wrt. the local goal context
4013 (which is now passed through the inductive cases);
4015 * Document preparation: renamed standard symbols \<ll> to \<lless> and
4016 \<gg> to \<ggreater>;
4019 *** Document preparation ***
4021 * \isabellestyle{NAME} selects version of Isabelle output (currently
4022 available: are "it" for near math-mode best-style output, "sl" for
4023 slanted text style, and "tt" for plain type-writer; if no
4024 \isabellestyle command is given, output is according to slanted
4027 * support sub/super scripts (for single symbols only), input syntax is
4028 like this: "A\<^sup>*" or "A\<^sup>\<star>";
4030 * some more standard symbols; see Appendix A of the system manual for
4031 the complete list of symbols defined in isabellesym.sty;
4033 * improved isabelle style files; more abstract symbol implementation
4034 (should now use \isamath{...} and \isatext{...} in custom symbol
4037 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
4038 state; Note that presentation of goal states does not conform to
4039 actual human-readable proof documents. Please do not include goal
4040 states into document output unless you really know what you are doing!
4042 * proper indentation of antiquoted output with proportional LaTeX
4045 * no_document ML operator temporarily disables LaTeX document
4048 * isatool unsymbolize tunes sources for plain ASCII communication;
4053 * Pure: Isar now suffers initial goal statements to contain unbound
4054 schematic variables (this does not conform to actual readable proof
4055 documents, due to unpredictable outcome and non-compositional proof
4056 checking); users who know what they are doing may use schematic goals
4057 for Prolog-style synthesis of proven results;
4059 * Pure: assumption method (an implicit finishing) now handles actual
4062 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
4063 initial goal, declare "that" only as Pure intro (only for single
4064 steps); the "that" rule assumption may now be involved in implicit
4065 finishing, thus ".." becomes a feasible for trivial obtains;
4067 * Pure: default proof step now includes 'intro_classes'; thus trivial
4068 instance proofs may be performed by "..";
4070 * Pure: ?thesis / ?this / "..." now work for pure meta-level
4073 * Pure: more robust selection of calculational rules;
4075 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4076 rule (as well as the assumption rule);
4078 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4079 lemmas, using the graph browser tool;
4081 * Pure: predict failure of "show" in interactive mode;
4083 * Pure: 'thms_containing' now takes actual terms as arguments;
4085 * HOL: improved method 'induct' --- now handles non-atomic goals
4086 (potential INCOMPATIBILITY); tuned error handling;
4088 * HOL: cases and induct rules now provide explicit hints about the
4089 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4090 any remaining facts are inserted into the goal verbatim;
4092 * HOL: local contexts (aka cases) may now contain term bindings as
4093 well; the 'cases' and 'induct' methods new provide a ?case binding for
4094 the result to be shown in each case;
4096 * HOL: added 'recdef_tc' command;
4098 * isatool convert assists in eliminating legacy ML scripts;
4103 * HOL/Library: a collection of generic theories to be used together
4104 with main HOL; the theory loader path already includes this directory
4105 by default; the following existing theories have been moved here:
4106 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4107 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4109 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4110 modelling and verification task performed in Isabelle/HOL +
4111 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4113 * HOL/Algebra: special summation operator SUM no longer exists, it has
4114 been replaced by setsum; infix 'assoc' now has priority 50 (like
4115 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4116 'domain', this makes the theory consistent with mathematical
4119 * HOL basics: added overloaded operations "inverse" and "divide"
4120 (infix "/"), syntax for generic "abs" operation, generic summation
4123 * HOL/typedef: simplified package, provide more useful rules (see also
4126 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4127 now expressed as a proper nested rule (old-style tactic scripts may
4128 require atomize_strip_tac to cope with non-atomic premises);
4130 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4131 to "split_conv" (old name still available for compatibility);
4133 * HOL: improved concrete syntax for strings (e.g. allows translation
4134 rules with string literals);
4136 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4137 and Fleuriot's mechanization of analysis, including the transcendental
4138 functions for the reals;
4140 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4145 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4146 "lam" is displayed as TWO lambda-symbols
4148 * CTT: theory Main now available, containing everything (that is, Bool
4154 * Pure: the Simplifier has been implemented properly as a derived rule
4155 outside of the actual kernel (at last!); the overall performance
4156 penalty in practical applications is about 50%, while reliability of
4157 the Isabelle inference kernel has been greatly improved;
4159 * print modes "brackets" and "no_brackets" control output of nested =>
4160 (types) and ==> (props); the default behaviour is "brackets";
4162 * Provers: fast_tac (and friends) now handle actual object-logic rules
4163 as assumptions as well;
4165 * system: support Poly/ML 4.0;
4167 * system: isatool install handles KDE version 1 or 2;
4171 New in Isabelle99-1 (October 2000)
4172 ----------------------------------
4174 *** Overview of INCOMPATIBILITIES ***
4176 * HOL: simplification of natural numbers is much changed; to partly
4177 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4178 issue the following ML commands:
4180 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4181 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4183 * HOL: simplification no longer dives into case-expressions; this is
4184 controlled by "t.weak_case_cong" for each datatype t;
4186 * HOL: nat_less_induct renamed to less_induct;
4188 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4189 fixsome to patch .thy and .ML sources automatically;
4191 select_equality -> some_equality
4192 select_eq_Ex -> some_eq_ex
4193 selectI2EX -> someI2_ex
4196 select1_equality -> some1_equality
4197 Eps_sym_eq -> some_sym_eq_trivial
4198 Eps_eq -> some_eq_trivial
4200 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4202 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4205 * HOL: the recursion equations generated by 'recdef' are now called
4206 f.simps instead of f.rules;
4208 * HOL: qed_spec_mp now also handles bounded ALL as well;
4210 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4211 sometimes be needed;
4213 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4215 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4217 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4218 product is now "<*>" instead of "Times"; the lexicographic product is
4219 now "<*lex*>" instead of "**";
4221 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4222 of main HOL, but was unused); better use HOL's datatype package;
4224 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4225 the old syntax may be recovered as follows:
4228 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4229 (infixl "\\<oplus>" 100)
4231 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4233 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4234 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4237 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4238 changed from A/r to A//r;
4240 * ZF: new treatment of arithmetic (nat & int) may break some old
4243 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4244 rulify -> rule_format, elimify -> elim_format, ...);
4246 * Isar/Provers: intro/elim/dest attributes changed; renamed
4247 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4248 should have to change intro!! to intro? only); replaced "delrule" by
4251 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4253 * Provers: strengthened force_tac by using new first_best_tac;
4255 * LaTeX document preparation: several changes of isabelle.sty (see
4259 *** Document preparation ***
4261 * formal comments (text blocks etc.) in new-style theories may now
4262 contain antiquotations of thm/prop/term/typ/text to be presented
4263 according to latex print mode; concrete syntax is like this:
4264 @{term[show_types] "f(x) = a + x"};
4266 * isatool mkdir provides easy setup of Isabelle session directories,
4267 including proper document sources;
4269 * generated LaTeX sources are now deleted after successful run
4270 (isatool document -c); may retain a copy somewhere else via -D option
4273 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4274 style files, achieving self-contained LaTeX sources and simplifying
4277 * old-style theories now produce (crude) LaTeX output as well;
4279 * browser info session directories are now self-contained (may be put
4280 on WWW server seperately); improved graphs of nested sessions; removed
4281 graph for 'all sessions';
4283 * several improvements in isabelle style files; \isabellestyle{it}
4284 produces fake math mode output; \isamarkupheader is now \section by
4285 default; see lib/texinputs/isabelle.sty etc.;
4290 * Isar/Pure: local results and corresponding term bindings are now
4291 subject to Hindley-Milner polymorphism (similar to ML); this
4292 accommodates incremental type-inference very nicely;
4294 * Isar/Pure: new derived language element 'obtain' supports
4295 generalized existence reasoning;
4297 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4298 support accumulation of results, without applying any rules yet;
4299 useful to collect intermediate results without explicit name
4300 references, and for use with transitivity rules with more than 2
4303 * Isar/Pure: scalable support for case-analysis type proofs: new
4304 'case' language element refers to local contexts symbolically, as
4305 produced by certain proof methods; internally, case names are attached
4306 to theorems as "tags";
4308 * Isar/Pure: theory command 'hide' removes declarations from
4309 class/type/const name spaces;
4311 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4312 indicate potential overloading;
4314 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4316 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4317 "{a,b,c}" instead of {a,b,c};
4319 * Isar/Pure now provides its own version of intro/elim/dest
4320 attributes; useful for building new logics, but beware of confusion
4321 with the version in Provers/classical;
4323 * Isar/Pure: the local context of (non-atomic) goals is provided via
4324 case name 'antecedent';
4326 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4327 to the current context is now done automatically);
4329 * Isar/Pure: theory command 'method_setup' provides a simple interface
4330 for definining proof methods in ML;
4332 * Isar/Provers: intro/elim/dest attributes changed; renamed
4333 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4334 most cases, one should have to change intro!! to intro? only);
4335 replaced "delrule" by "rule del";
4337 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4338 'symmetric' attribute (the latter supercedes [RS sym]);
4340 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4341 method modifier); 'simp' method: 'only:' modifier removes loopers as
4342 well (including splits);
4344 * Isar/Provers: Simplifier and Classical methods now support all kind
4345 of modifiers used in the past, including 'cong', 'iff', etc.
4347 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4348 of Simplifier and Classical reasoner);
4350 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4351 now support named cases; major packages (inductive, datatype, primrec,
4352 recdef) support case names and properly name parameters;
4354 * Isar/HOL: new transitivity rules for substitution in inequalities --
4355 monotonicity conditions are extracted to be proven at end of
4358 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4361 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4362 split_if split_if_asm; datatype package provides theorems foo.splits =
4363 foo.split foo.split_asm for each datatype;
4365 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4366 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4367 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4368 use "(cases (simplified))" method in proper proof texts);
4370 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4372 * Isar: names of theorems etc. may be natural numbers as well;
4374 * Isar: 'pr' command: optional arguments for goals_limit and
4375 ProofContext.prems_limit; no longer prints theory contexts, but only
4378 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4379 additional print modes to be specified; e.g. "pr(latex)" will print
4380 proof state according to the Isabelle LaTeX style;
4382 * Isar: improved support for emulating tactic scripts, including proof
4383 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4384 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4385 (for HOL datatypes);
4387 * Isar: simplified (more robust) goal selection of proof methods: 1st
4388 goal, all goals, or explicit goal specifier (tactic emulation); thus
4389 'proof method scripts' have to be in depth-first order;
4391 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4393 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4394 should instead use individual commands for printing items
4395 (print_commands, print_methods etc.);
4397 * Isar: added 'nothing' --- the empty list of theorems;
4402 * HOL/MicroJava: formalization of a fragment of Java, together with a
4403 corresponding virtual machine and a specification of its bytecode
4404 verifier and a lightweight bytecode verifier, including proofs of
4405 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4406 Cornelia Pusch (see also the homepage of project Bali at
4407 http://isabelle.in.tum.de/Bali/);
4409 * HOL/Algebra: new theory of rings and univariate polynomials, by
4412 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4413 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4416 * HOL/Lattice: fundamental concepts of lattice theory and order
4417 structures, including duals, properties of bounds versus algebraic
4418 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4419 Theorem for complete lattices etc.; may also serve as a demonstration
4420 for abstract algebraic reasoning using axiomatic type classes, and
4421 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4423 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4426 * HOL/IMPP: extension of IMP with local variables and mutually
4427 recursive procedures, by David von Oheimb;
4429 * HOL/Lambda: converted into new-style theory and document;
4431 * HOL/ex/Multiquote: example of multiple nested quotations and
4432 anti-quotations -- basically a generalized version of de-Bruijn
4433 representation; very useful in avoiding lifting of operations;
4435 * HOL/record: added general record equality rule to simpset; fixed
4436 select-update simplification procedure to handle extended records as
4437 well; admit "r" as field name;
4439 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4440 other numeric types and also as the identity of groups, rings, etc.;
4442 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4443 Types nat and int belong to this axclass;
4445 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4446 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4447 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4448 two terms #m*u and #n*u are replaced by #(m+n)*u
4449 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4450 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4451 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4453 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4454 powerful prover for predicate logic but knows nothing of clasets; see
4455 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4457 * HOL: new version of "case_tac" subsumes both boolean case split and
4458 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4459 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4461 * HOL: simplification no longer dives into case-expressions: only the
4462 selector expression is simplified, but not the remaining arms; to
4463 enable full simplification of case-expressions for datatype t, you may
4464 remove t.weak_case_cong from the simpset, either globally (Delcongs
4465 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4467 * HOL/recdef: the recursion equations generated by 'recdef' for
4468 function 'f' are now called f.simps instead of f.rules; if all
4469 termination conditions are proved automatically, these simplification
4470 rules are added to the simpset, as in primrec; rules may be named
4471 individually as well, resulting in a separate list of theorems for
4474 * HOL/While is a new theory that provides a while-combinator. It
4475 permits the definition of tail-recursive functions without the
4476 provision of a termination measure. The latter is necessary once the
4477 invariant proof rule for while is applied.
4479 * HOL: new (overloaded) notation for the set of elements below/above
4480 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4482 * HOL: theorems impI, allI, ballI bound as "strip";
4484 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4485 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4486 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4488 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4490 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4491 main HOL, but was unused);
4493 * HOL: fewer consts declared as global (e.g. have to refer to
4494 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4496 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4497 in case of overlap with user translations (e.g. judgements over
4498 tuples); (note that the underlying logical represenation is still
4504 * ZF: simplification automatically cancels common terms in arithmetic
4505 expressions over nat and int;
4507 * ZF: new treatment of nat to minimize type-checking: all operators
4508 coerce their operands to a natural number using the function natify,
4509 making the algebraic laws unconditional;
4511 * ZF: as above, for int: operators coerce their operands to an integer
4512 using the function intify;
4514 * ZF: the integer library now contains many of the usual laws for the
4515 orderings, including $<=, and monotonicity laws for $+ and $*;
4517 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4520 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4521 to the simplifier and classical reasoner simultaneously;
4526 * Provers: blast_tac now handles actual object-logic rules as
4527 assumptions; note that auto_tac uses blast_tac internally as well;
4529 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4530 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4532 * Provers: delrules now handles destruct rules as well (no longer need
4533 explicit make_elim);
4535 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4536 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4537 use instead the strong form,
4538 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4539 in HOL, FOL and ZF the function cla_make_elim will create such rules
4540 from destruct-rules;
4542 * Provers: Simplifier.easy_setup provides a fast path to basic
4543 Simplifier setup for new object-logics;
4545 * Pure: AST translation rules no longer require constant head on LHS;
4547 * Pure: improved name spaces: ambiguous output is qualified; support
4548 for hiding of names;
4550 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4551 XSYMBOL_HOME; no longer need to do manual configuration in most
4554 * system: compression of ML heaps images may now be controlled via -c
4555 option of isabelle and isatool usedir (currently only observed by
4558 * system: isatool installfonts may handle X-Symbol fonts as well (very
4559 useful for remote X11);
4561 * system: provide TAGS file for Isabelle sources;
4563 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4566 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4567 timing flag supersedes proof_timing and Toplevel.trace;
4569 * ML: new combinators |>> and |>>> for incremental transformations
4570 with secondary results (e.g. certain theory extensions):
4572 * ML: PureThy.add_defs gets additional argument to indicate potential
4573 overloading (usually false);
4575 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4580 New in Isabelle99 (October 1999)
4581 --------------------------------
4583 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4585 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4586 are no longer simplified. (This allows the simplifier to unfold recursive
4587 functional programs.) To restore the old behaviour, declare
4589 Delcongs [if_weak_cong];
4591 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4594 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4596 * HOL/datatype: mutual_induct_tac no longer exists --
4597 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4599 * HOL/typedef: fixed type inference for representing set; type
4600 arguments now have to occur explicitly on the rhs as type constraints;
4602 * ZF: The con_defs part of an inductive definition may no longer refer
4603 to constants declared in the same theory;
4605 * HOL, ZF: the function mk_cases, generated by the inductive
4606 definition package, has lost an argument. To simplify its result, it
4607 uses the default simpset instead of a supplied list of theorems.
4609 * HOL/List: the constructors of type list are now Nil and Cons;
4611 * Simplifier: the type of the infix ML functions
4612 setSSolver addSSolver setSolver addSolver
4613 is now simpset * solver -> simpset where `solver' is a new abstract type
4614 for packaging solvers. A solver is created via
4615 mk_solver: string -> (thm list -> int -> tactic) -> solver
4616 where the string argument is only a comment.
4621 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4622 decision procedure for linear arithmetic. Currently it is used for
4623 types `nat', `int', and `real' in HOL (see below); it can, should and
4624 will be instantiated for other types and logics as well.
4626 * The simplifier now accepts rewrite rules with flexible heads, eg
4627 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4628 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4634 * New Isabelle/Isar subsystem provides an alternative to traditional
4635 tactical theorem proving; together with the ProofGeneral/isar user
4636 interface it offers an interactive environment for developing human
4637 readable proof documents (Isar == Intelligible semi-automated
4638 reasoning); for further information see isatool doc isar-ref,
4639 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4641 * improved and simplified presentation of theories: better HTML markup
4642 (including colors), graph views in several sizes; isatool usedir now
4643 provides a proper interface for user theories (via -P option); actual
4644 document preparation based on (PDF)LaTeX is available as well (for
4645 new-style theories only); see isatool doc system for more information;
4647 * native support for Proof General, both for classic Isabelle and
4650 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4651 using the graph browser tool;
4653 * Isabelle manuals now also available as PDF;
4655 * theory loader rewritten from scratch (may not be fully
4656 bug-compatible); old loadpath variable has been replaced by show_path,
4657 add_path, del_path, reset_path functions; new operations such as
4658 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4661 * improved isatool install: option -k creates KDE application icon,
4662 option -p DIR installs standalone binaries;
4664 * added ML_PLATFORM setting (useful for cross-platform installations);
4665 more robust handling of platform specific ML images for SML/NJ;
4667 * the settings environment is now statically scoped, i.e. it is never
4668 created again in sub-processes invoked from isabelle, isatool, or
4671 * path element specification '~~' refers to '$ISABELLE_HOME';
4673 * in locales, the "assumes" and "defines" parts may be omitted if
4676 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4679 * new print_mode "HTML";
4681 * new flag show_tags controls display of tags of theorems (which are
4682 basically just comments that may be attached by some tools);
4684 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4685 mode and goal output format:
4687 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4689 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4691 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4692 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4694 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4696 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4698 * function bind_thms stores lists of theorems (cf. bind_thm);
4700 * new shorthand tactics ftac, eatac, datac, fatac;
4702 * qed (and friends) now accept "" as result name; in that case the
4703 theorem is not stored, but proper checks and presentation of the
4706 * theorem database now also indexes constants "Trueprop", "all",
4707 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4712 ** HOL arithmetic **
4714 * There are now decision procedures for linear arithmetic over nat and
4717 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4718 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4719 are treated as atomic; subformulae not involving type `nat' or `int'
4720 are ignored; quantified subformulae are ignored unless they are
4721 positive universal or negative existential. The tactic has to be
4722 invoked by hand and can be a little bit slow. In particular, the
4723 running time is exponential in the number of occurrences of `min' and
4724 `max', and `-' on `nat'.
4726 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4727 (negated) (in)equalities among the premises and the conclusion into
4728 account (i.e. no compound formulae) and does not know about `min' and
4729 `max', and `-' on `nat'. It is fast and is used automatically by the
4732 NB: At the moment, these decision procedures do not cope with mixed
4733 nat/int formulae where the two parts interact, such as `m < n ==>
4736 * HOL/Numeral provides a generic theory of numerals (encoded
4737 efficiently as bit strings); setup for types nat/int/real is in place;
4738 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4739 int, existing theories and proof scripts may require a few additional
4742 * integer division and remainder can now be performed on constant
4745 * many properties of integer multiplication, division and remainder
4748 * An interface to the Stanford Validity Checker (SVC) is available through the
4749 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4750 are proved automatically. SVC must be installed separately, and its results
4751 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4752 invocation of the underlying oracle). For SVC see
4753 http://verify.stanford.edu/SVC
4755 * IsaMakefile: the HOL-Real target now builds an actual image;
4760 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4761 (in Isabelle/Isar) -- by Gertrud Bauer;
4763 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4764 analysis for assembly languages with subtypes;
4766 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4767 -- avoids syntactic ambiguities and treats state, transition, and
4768 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4769 changed syntax and (many) tactics;
4771 * HOL/inductive: Now also handles more general introduction rules such
4772 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4773 theorems are now maintained within the theory (maintained via the
4776 * HOL/datatype: Now also handles arbitrarily branching datatypes
4777 (using function types) such as
4779 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4781 * HOL/record: record_simproc (part of the default simpset) takes care
4782 of selectors applied to updated records; record_split_tac is no longer
4783 part of the default claset; update_defs may now be removed from the
4784 simpset in many cases; COMPATIBILITY: old behavior achieved by
4786 claset_ref () := claset() addSWrapper record_split_wrapper;
4787 Delsimprocs [record_simproc]
4789 * HOL/typedef: fixed type inference for representing set; type
4790 arguments now have to occur explicitly on the rhs as type constraints;
4792 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4793 names rather than an ML expression;
4795 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4796 supplied later. Program schemes can be defined, such as
4797 "While B C s = (if B s then While B C (C s) else s)"
4798 where the well-founded relation can be chosen after B and C have been given.
4800 * HOL/List: the constructors of type list are now Nil and Cons;
4801 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4802 course, ML tools referring to List.list.op # etc. have to be adapted;
4804 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4805 disabled by default; run isabelle with option -m HOL to get back to
4806 the original Gordon/HOL-style output;
4808 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4809 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4811 * HOL basic syntax simplified (more orthogonal): all variants of
4812 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4813 Eps operator is provided as well: "SOME x. P[x]";
4815 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4817 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4818 thus available for user theories;
4820 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4821 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4824 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4825 several times and then mp;
4830 * the notation <<...>> is now available as a notation for sequences of
4833 * the simplifier is now installed
4835 * the axiom system has been generalized (thanks to Soren Heilmann)
4837 * the classical reasoner now has a default rule database
4842 * new primrec section allows primitive recursive functions to be given
4843 directly (as in HOL) over datatypes and the natural numbers;
4845 * new tactics induct_tac and exhaust_tac for induction (or case
4846 analysis) over datatypes and the natural numbers;
4848 * the datatype declaration of type T now defines the recursor T_rec;
4850 * simplification automatically does freeness reasoning for datatype
4853 * automatic type-inference, with AddTCs command to insert new
4854 type-checking rules;
4856 * datatype introduction rules are now added as Safe Introduction rules
4859 * the syntax "if P then x else y" is now available in addition to
4863 *** Internal programming interfaces ***
4865 * tuned simplifier trace output; new flag debug_simp;
4867 * structures Vartab / Termtab (instances of TableFun) offer efficient
4868 tables indexed by indexname_ord / term_ord (compatible with aconv);
4870 * AxClass.axclass_tac lost the theory argument;
4872 * tuned current_goals_markers semantics: begin / end goal avoids
4873 printing empty lines;
4875 * removed prs and prs_fn hook, which was broken because it did not
4876 include \n in its semantics, forcing writeln to add one
4877 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4878 string -> unit if you really want to output text without newline;
4880 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
4881 plain output, interface builders may have to enable 'isabelle_font'
4882 mode to get Isabelle font glyphs as before;
4884 * refined token_translation interface; INCOMPATIBILITY: output length
4885 now of type real instead of int;
4887 * theory loader actions may be traced via new ThyInfo.add_hook
4888 interface (see src/Pure/Thy/thy_info.ML); example application: keep
4889 your own database of information attached to *whole* theories -- as
4890 opposed to intra-theory data slots offered via TheoryDataFun;
4892 * proper handling of dangling sort hypotheses (at last!);
4893 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
4894 extra sort hypotheses that can be witnessed from the type signature;
4895 the force_strip_shyps flag is gone, any remaining shyps are simply
4896 left in the theorem (with a warning issued by strip_shyps_warning);
4900 New in Isabelle98-1 (October 1998)
4901 ----------------------------------
4903 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4905 * several changes of automated proof tools;
4907 * HOL: major changes to the inductive and datatype packages, including
4908 some minor incompatibilities of theory syntax;
4910 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
4913 * HOL: removed duplicate thms in Arith:
4914 less_imp_add_less should be replaced by trans_less_add1
4915 le_imp_add_le should be replaced by trans_le_add1
4917 * HOL: unary minus is now overloaded (new type constraints may be
4920 * HOL and ZF: unary minus for integers is now #- instead of #~. In
4921 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
4922 now taken as an integer constant.
4924 * Pure: ML function 'theory_of' renamed to 'theory';
4930 1. Asm_full_simp_tac is now more aggressive.
4931 1. It will sometimes reorient premises if that increases their power to
4933 2. It does no longer proceed strictly from left to right but may also
4934 rotate premises to achieve further simplification.
4935 For compatibility reasons there is now Asm_lr_simp_tac which is like the
4936 old Asm_full_simp_tac in that it does not rotate premises.
4937 2. The simplifier now knows a little bit about nat-arithmetic.
4939 * Classical reasoner: wrapper mechanism for the classical reasoner now
4940 allows for selected deletion of wrappers, by introduction of names for
4941 wrapper functionals. This implies that addbefore, addSbefore,
4942 addaltern, and addSaltern now take a pair (name, tactic) as argument,
4943 and that adding two tactics with the same name overwrites the first
4944 one (emitting a warning).
4945 type wrapper = (int -> tactic) -> (int -> tactic)
4946 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
4947 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
4948 delWrapper, delSWrapper: claset * string -> claset
4949 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
4951 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
4952 semantics; addbefore now affects only the unsafe part of step_tac
4953 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
4954 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
4957 * Classical reasoner: setwrapper to setWrapper and compwrapper to
4958 compWrapper; added safe wrapper (and access functions for it);
4960 * HOL/split_all_tac is now much faster and fails if there is nothing
4961 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
4962 and the names of the automatically generated variables have changed.
4963 split_all_tac has moved within claset() from unsafe wrappers to safe
4964 wrappers, which means that !!-bound variables are split much more
4965 aggressively, and safe_tac and clarify_tac now split such variables.
4966 If this splitting is not appropriate, use delSWrapper "split_all_tac".
4967 Note: the same holds for record_split_tac, which does the job of
4968 split_all_tac for record fields.
4970 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
4971 permanently to the default simpset using Addsplits just like
4972 Addsimps. They can be removed via Delsplits just like
4973 Delsimps. Lower-case versions are also available.
4975 * HOL/Simplifier: The rule split_if is now part of the default
4976 simpset. This means that the simplifier will eliminate all occurrences
4977 of if-then-else in the conclusion of a goal. To prevent this, you can
4978 either remove split_if completely from the default simpset by
4979 `Delsplits [split_if]' or remove it in a specific call of the
4980 simplifier using `... delsplits [split_if]'. You can also add/delete
4981 other case splitting rules to/from the default simpset: every datatype
4982 generates suitable rules `split_t_case' and `split_t_case_asm' (where
4983 t is the name of the datatype).
4985 * Classical reasoner / Simplifier combination: new force_tac (and
4986 derivatives Force_tac, force) combines rewriting and classical
4987 reasoning (and whatever other tools) similarly to auto_tac, but is
4988 aimed to solve the given subgoal completely.
4993 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
4994 and `goalw': the theory is no longer needed as an explicit argument -
4995 the current theory context is used; assumptions are no longer returned
4996 at the ML-level unless one of them starts with ==> or !!; it is
4997 recommended to convert to these new commands using isatool fixgoal
4998 (backup your sources first!);
5000 * new top-level commands 'thm' and 'thms' for retrieving theorems from
5001 the current theory context, and 'theory' to lookup stored theories;
5003 * new theory section 'locale' for declaring constants, assumptions and
5004 definitions that have local scope;
5006 * new theory section 'nonterminals' for purely syntactic types;
5008 * new theory section 'setup' for generic ML setup functions
5009 (e.g. package initialization);
5011 * the distribution now includes Isabelle icons: see
5012 lib/logo/isabelle-{small,tiny}.xpm;
5014 * isatool install - install binaries with absolute references to
5017 * isatool logo -- create instances of the Isabelle logo (as EPS);
5019 * print mode 'emacs' reserved for Isamode;
5021 * support multiple print (ast) translations per constant name;
5023 * theorems involving oracles are now printed with a suffixed [!];
5028 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
5030 * HOL/inductive package reorganized and improved: now supports mutual
5036 oddI "n : EVEN ==> Suc n : ODD"
5037 evenI "n : ODD ==> Suc n : EVEN"
5039 new theorem list "elims" contains an elimination rule for each of the
5040 recursive sets; inductive definitions now handle disjunctive premises
5041 correctly (also ZF);
5043 INCOMPATIBILITIES: requires Inductive as an ancestor; component
5044 "mutual_induct" no longer exists - the induction rule is always
5045 contained in "induct";
5048 * HOL/datatype package re-implemented and greatly improved: now
5049 supports mutually recursive datatypes such as
5052 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
5053 | SUM ('a aexp) ('a aexp)
5054 | DIFF ('a aexp) ('a aexp)
5057 'a bexp = LESS ('a aexp) ('a aexp)
5058 | AND ('a bexp) ('a bexp)
5059 | OR ('a bexp) ('a bexp)
5061 as well as indirectly recursive datatypes such as
5064 ('a, 'b) term = Var 'a
5065 | App 'b ((('a, 'b) term) list)
5067 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
5068 induction on mutually / indirectly recursive datatypes.
5070 Primrec equations are now stored in theory and can be accessed via
5071 <function_name>.simps.
5075 - Theories using datatypes must now have theory Datatype as an
5077 - The specific <typename>.induct_tac no longer exists - use the
5078 generic induct_tac instead.
5079 - natE has been renamed to nat.exhaust - use exhaust_tac
5080 instead of res_inst_tac ... natE. Note that the variable
5081 names in nat.exhaust differ from the names in natE, this
5082 may cause some "fragile" proofs to fail.
5083 - The theorems split_<typename>_case and split_<typename>_case_asm
5084 have been renamed to <typename>.split and <typename>.split_asm.
5085 - Since default sorts of type variables are now handled correctly,
5086 some datatype definitions may have to be annotated with explicit
5088 - Primrec definitions no longer require function name and type
5089 of recursive argument.
5091 Consider using isatool fixdatatype to adapt your theories and proof
5092 scripts to the new package (backup your sources first!).
5095 * HOL/record package: considerably improved implementation; now
5096 includes concrete syntax for record types, terms, updates; theorems
5097 for surjective pairing and splitting !!-bound record variables; proof
5098 support is as follows:
5100 1) standard conversions (selectors or updates applied to record
5101 constructor terms) are part of the standard simpset;
5103 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5104 made part of standard simpset and claset via addIffs;
5106 3) a tactic for record field splitting (record_split_tac) is part of
5107 the standard claset (addSWrapper);
5109 To get a better idea about these rules you may retrieve them via
5110 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5111 the name of your record type.
5113 The split tactic 3) conceptually simplifies by the following rule:
5115 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5117 Thus any record variable that is bound by meta-all will automatically
5118 blow up into some record constructor term, consequently the
5119 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5120 solve record problems automatically.
5123 * reorganized the main HOL image: HOL/Integ and String loaded by
5124 default; theory Main includes everything;
5126 * automatic simplification of integer sums and comparisons, using cancellation;
5128 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5130 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5132 * many new identities for unions, intersections, set difference, etc.;
5134 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5135 called split_if, split_split, split_sum_case and split_nat_case (to go
5136 with add/delsplits);
5138 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5139 (?x::unit) = (); this is made part of the default simpset, which COULD
5140 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5141 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5142 unit_abs_eta_conv is added in order to counter the effect of
5143 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5146 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5149 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5150 It and 'sym RS equals0D' are now in the default claset, giving automatic
5151 disjointness reasoning but breaking a few old proofs.
5153 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5154 to 'converse' from 'inverse' (for compatibility with ZF and some
5157 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5158 the well-founded relation;
5160 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5161 Compl A. The "Compl" syntax remains available as input syntax for this
5164 * HOL/Update: new theory of function updates:
5165 f(a:=b) == %x. if x=a then b else f x
5166 may also be iterated as in f(a:=b,c:=d,...);
5168 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5171 - new function list_update written xs[i:=v] that updates the i-th
5172 list position. May also be iterated as in xs[i:=a,j:=b,...].
5173 - new function `upt' written [i..j(] which generates the list
5174 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5175 bound write [i..j], which is a shorthand for [i..j+1(].
5176 - new lexicographic orderings and corresponding wellfoundedness theorems.
5179 - removed 'pred' (predecessor) function;
5180 - generalized some theorems about n-1;
5181 - many new laws about "div" and "mod";
5182 - new laws about greatest common divisors (see theory ex/Primes);
5184 * HOL/Relation: renamed the relational operator r^-1 "converse"
5185 instead of "inverse";
5187 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5188 of the multiset ordering;
5190 * directory HOL/Real: a construction of the reals using Dedekind cuts
5191 (not included by default);
5193 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5195 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5196 programs, i.e. different program variables may have different types.
5198 * calling (stac rew i) now fails if "rew" has no effect on the goal
5199 [previously, this check worked only if the rewrite rule was unconditional]
5200 Now rew can involve either definitions or equalities (either == or =).
5205 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5206 only the theorems proved on ZF.ML;
5208 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5209 It and 'sym RS equals0D' are now in the default claset, giving automatic
5210 disjointness reasoning but breaking a few old proofs.
5212 * ZF/Update: new theory of function updates
5213 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5214 may also be iterated as in f(a:=b,c:=d,...);
5216 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5218 * calling (stac rew i) now fails if "rew" has no effect on the goal
5219 [previously, this check worked only if the rewrite rule was unconditional]
5220 Now rew can involve either definitions or equalities (either == or =).
5222 * case_tac provided for compatibility with HOL
5223 (like the old excluded_middle_tac, but with subgoals swapped)
5226 *** Internal programming interfaces ***
5228 * Pure: several new basic modules made available for general use, see
5229 also src/Pure/README;
5231 * improved the theory data mechanism to support encapsulation (data
5232 kind name replaced by private Object.kind, acting as authorization
5233 key); new type-safe user interface via functor TheoryDataFun; generic
5234 print_data function becomes basically useless;
5236 * removed global_names compatibility flag -- all theory declarations
5237 are qualified by default;
5239 * module Pure/Syntax now offers quote / antiquote translation
5240 functions (useful for Hoare logic etc. with implicit dependencies);
5241 see HOL/ex/Antiquote for an example use;
5243 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5246 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5249 * Display.print_goals function moved to Locale.print_goals;
5251 * standard print function for goals supports current_goals_markers
5252 variable for marking begin of proof, end of proof, start of goal; the
5253 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5254 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5259 New in Isabelle98 (January 1998)
5260 --------------------------------
5262 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5264 * changed lexical syntax of terms / types: dots made part of long
5265 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5267 * simpset (and claset) reference variable replaced by functions
5268 simpset / simpset_ref;
5270 * no longer supports theory aliases (via merge) and non-trivial
5271 implicit merge of thms' signatures;
5273 * most internal names of constants changed due to qualified names;
5275 * changed Pure/Sequence interface (see Pure/seq.ML);
5278 *** General Changes ***
5280 * hierachically structured name spaces (for consts, types, axms, thms
5281 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5282 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5283 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5284 long_names for fully qualified output names; NOTE: ML programs
5285 (special tactics, packages etc.) referring to internal names may have
5286 to be adapted to cope with fully qualified names; in case of severe
5287 backward campatibility problems try setting 'global_names' at compile
5288 time to have enrything declared within a flat name space; one may also
5289 fine tune name declarations in theories via the 'global' and 'local'
5292 * reimplemented the implicit simpset and claset using the new anytype
5293 data filed in signatures; references simpset:simpset ref etc. are
5294 replaced by functions simpset:unit->simpset and
5295 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5296 to patch your ML files accordingly;
5298 * HTML output now includes theory graph data for display with Java
5299 applet or isatool browser; data generated automatically via isatool
5300 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5302 * defs may now be conditional; improved rewrite_goals_tac to handle
5303 conditional equations;
5305 * defs now admits additional type arguments, using TYPE('a) syntax;
5307 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5308 creates a new theory node; implicit merge of thms' signatures is
5309 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5310 transfer:theory->thm->thm in (rare) cases;
5312 * improved handling of draft signatures / theories; draft thms (and
5313 ctyps, cterms) are automatically promoted to real ones;
5315 * slightly changed interfaces for oracles: admit many per theory, named
5316 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5318 * print_goals: optional output of const types (set show_consts and
5321 * improved output of warnings (###) and errors (***);
5323 * subgoal_tac displays a warning if the new subgoal has type variables;
5325 * removed old README and Makefiles;
5327 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5329 * removed obsolete init_pps and init_database;
5331 * deleted the obsolete tactical STATE, which was declared by
5332 fun STATE tacfun st = tacfun st st;
5334 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5335 (which abbreviates $HOME);
5337 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5338 use isatool fixseq to adapt your ML programs (this works for fully
5339 qualified references to the Sequence structure only!);
5341 * use_thy no longer requires writable current directory; it always
5342 reloads .ML *and* .thy file, if either one is out of date;
5345 *** Classical Reasoner ***
5347 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5348 tactics that use classical reasoning to simplify a subgoal without
5349 splitting it into several subgoals;
5351 * Safe_tac: like safe_tac but uses the default claset;
5356 * added simplification meta rules:
5357 (asm_)(full_)simplify: simpset -> thm -> thm;
5359 * simplifier.ML no longer part of Pure -- has to be loaded by object
5362 * added prems argument to simplification procedures;
5364 * HOL, FOL, ZF: added infix function `addsplits':
5365 instead of `<simpset> setloop (split_tac <thms>)'
5366 you can simply write `<simpset> addsplits <thms>'
5371 * TYPE('a) syntax for type reflection terms;
5373 * no longer handles consts with name "" -- declare as 'syntax' instead;
5375 * pretty printer: changed order of mixfix annotation preference (again!);
5377 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5382 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5383 with `addloop' of the simplifier to faciliate case splitting in premises.
5385 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5387 * HOL/Auth: new protocol proofs including some for the Internet
5390 * HOL/Map: new theory of `maps' a la VDM;
5392 * HOL/simplifier: simplification procedures nat_cancel_sums for
5393 cancelling out common nat summands from =, <, <= (in)equalities, or
5394 differences; simplification procedures nat_cancel_factor for
5395 cancelling common factor from =, <, <= (in)equalities over natural
5396 sums; nat_cancel contains both kinds of procedures, it is installed by
5397 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5399 * HOL/simplifier: terms of the form
5400 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5402 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5403 and those of the form
5404 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5406 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5409 Each datatype `t' now comes with a theorem `split_t_case' of the form
5411 P(t_case f1 ... fn x) =
5412 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5414 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5417 and a theorem `split_t_case_asm' of the form
5419 P(t_case f1 ... fn x) =
5420 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5422 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5424 which can be added to a simpset via `addsplits'. The existing theorems
5425 expand_list_case and expand_option_case have been renamed to
5426 split_list_case and split_option_case.
5429 - `pred n' is automatically converted to `n-1'.
5430 Users are strongly encouraged not to use `pred' any longer,
5431 because it will disappear altogether at some point.
5432 - Users are strongly encouraged to write "0 < n" rather than
5433 "n ~= 0". Theorems and proof tools have been modified towards this
5437 the function "set_of_list" has been renamed "set" (and its theorems too);
5438 the function "nth" now takes its arguments in the reverse order and
5439 has acquired the infix notation "!" as in "xs!n".
5441 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5443 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5444 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5446 * HOL/record: extensible records with schematic structural subtyping
5447 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5448 still lacks various theorems and concrete record syntax;
5453 * removed "axioms" and "generated by" sections;
5455 * replaced "ops" section by extended "consts" section, which is capable of
5456 handling the continuous function space "->" directly;
5459 . proves theorems immediately and stores them in the theory,
5460 . creates hierachical name space,
5461 . now uses normal mixfix annotations (instead of cinfix...),
5462 . minor changes to some names and values (for consistency),
5463 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5464 . separator between mutual domain defs: changed "," to "and",
5465 . improved handling of sort constraints; now they have to
5466 appear on the left-hand side of the equations only;
5468 * fixed LAM <x,y,zs>.b syntax;
5470 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5471 adm (%x. P (t x)), where P is chainfinite and t continuous;
5476 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5477 with `addloop' of the simplifier to faciliate case splitting in premises.
5479 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5480 in HOL, they strip ALL and --> from proved theorems;
5484 New in Isabelle94-8 (May 1997)
5485 ------------------------------
5487 *** General Changes ***
5489 * new utilities to build / run / maintain Isabelle etc. (in parts
5490 still somewhat experimental); old Makefiles etc. still functional;
5492 * new 'Isabelle System Manual';
5494 * INSTALL text, together with ./configure and ./build scripts;
5496 * reimplemented type inference for greater efficiency, better error
5497 messages and clean internal interface;
5499 * prlim command for dealing with lots of subgoals (an easier way of
5500 setting goals_limit);
5505 * supports alternative (named) syntax tables (parser and pretty
5506 printer); internal interface is provided by add_modesyntax(_i);
5508 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5509 be used in conjunction with the Isabelle symbol font; uses the
5510 "symbols" syntax table;
5512 * added token_translation interface (may translate name tokens in
5513 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5514 the current print_mode); IMPORTANT: user print translation functions
5515 are responsible for marking newly introduced bounds
5516 (Syntax.mark_boundT);
5518 * token translations for modes "xterm" and "xterm_color" that display
5519 names in bold, underline etc. or colors (which requires a color
5522 * infixes may now be declared with names independent of their syntax;
5524 * added typed_print_translation (like print_translation, but may
5525 access type of constant);
5528 *** Classical Reasoner ***
5530 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5531 some limitations. Blast_tac...
5532 + ignores addss, addbefore, addafter; this restriction is intrinsic
5533 + ignores elimination rules that don't have the correct format
5534 (the conclusion MUST be a formula variable)
5535 + ignores types, which can make HOL proofs fail
5536 + rules must not require higher-order unification, e.g. apply_type in ZF
5537 [message "Function Var's argument not a bound variable" relates to this]
5538 + its proof strategy is more general but can actually be slower
5540 * substitution with equality assumptions no longer permutes other
5543 * minor changes in semantics of addafter (now called addaltern); renamed
5544 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5545 (and access functions for it);
5547 * improved combination of classical reasoner and simplifier:
5548 + functions for handling clasimpsets
5549 + improvement of addss: now the simplifier is called _after_ the
5551 + safe variant of addss called addSss: uses safe simplifications
5552 _during_ the safe steps. It is more complete as it allows multiple
5553 instantiations of unknowns (e.g. with slow_tac).
5557 * added interface for simplification procedures (functions that
5558 produce *proven* rewrite rules on the fly, depending on current
5561 * ordering on terms as parameter (used for ordered rewriting);
5563 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5565 * the solver is now split into a safe and an unsafe part.
5566 This should be invisible for the normal user, except that the
5567 functions setsolver and addsolver have been renamed to setSolver and
5568 addSolver; added safe_asm_full_simp_tac;
5573 * a generic induction tactic `induct_tac' which works for all datatypes and
5574 also for type `nat';
5576 * a generic case distinction tactic `exhaust_tac' which works for all
5577 datatypes and also for type `nat';
5579 * each datatype comes with a function `size';
5581 * patterns in case expressions allow tuple patterns as arguments to
5582 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5584 * primrec now also works with type nat;
5586 * recdef: a new declaration form, allows general recursive functions to be
5587 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5589 * the constant for negation has been renamed from "not" to "Not" to
5590 harmonize with FOL, ZF, LK, etc.;
5592 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5595 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5597 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5598 problems in commutative rings, using axiomatic type classes for + and *;
5600 * more examples in HOL/MiniML and HOL/Auth;
5602 * more default rewrite rules for quantifiers, union/intersection;
5604 * a new constant `arbitrary == @x.False';
5606 * HOLCF/IOA replaces old HOL/IOA;
5608 * HOLCF changes: derived all rules and arities
5609 + axiomatic type classes instead of classes
5610 + typedef instead of faking type definitions
5611 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5612 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5613 + eliminated the types void, one, tr
5614 + use unit lift and bool lift (with translations) instead of one and tr
5615 + eliminated blift from Lift3.thy (use Def instead of blift)
5616 all eliminated rules are derived as theorems --> no visible changes ;
5621 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5622 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5623 as ZF_cs addSIs [equalityI];
5627 New in Isabelle94-7 (November 96)
5628 ---------------------------------
5630 * allowing negative levels (as offsets) in prlev and choplev;
5632 * super-linear speedup for large simplifications;
5634 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5635 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5636 FAIL); can suppress it using the command Delsimps (ex_simps @
5637 all_simps); De Morgan laws are also now included, by default;
5639 * improved printing of ==> : ~:
5641 * new object-logic "Sequents" adds linear logic, while replacing LK
5642 and Modal (thanks to Sara Kalvala);
5644 * HOL/Auth: correctness proofs for authentication protocols;
5646 * HOL: new auto_tac combines rewriting and classical reasoning (many
5647 examples on HOL/Auth);
5649 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5650 the rewriter and classical reasoner simultaneously;
5652 * function uresult no longer returns theorems in "standard" format;
5653 regain previous version by: val uresult = standard o uresult;
5660 * oracles -- these establish an interface between Isabelle and trusted
5661 external reasoners, which may deliver results as theorems;
5663 * proof objects (in particular record all uses of oracles);
5665 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5667 * "constdefs" section in theory files;
5669 * "primrec" section (HOL) no longer requires names;
5671 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5678 * reduced space requirements;
5680 * automatic HTML generation from theories;
5682 * theory files no longer require "..." (quotes) around most types;
5684 * new examples, including two proofs of the Church-Rosser theorem;
5686 * non-curried (1994) version of HOL is no longer distributed;
5693 * greatly reduced space requirements;
5695 * theory files (.thy) no longer require \...\ escapes at line breaks;
5697 * searchable theorem database (see the section "Retrieving theorems" on
5698 page 8 of the Reference Manual);
5700 * new examples, including Grabczewski's monumental case study of the
5703 * The previous version of HOL renamed to Old_HOL;
5705 * The new version of HOL (previously called CHOL) uses a curried syntax
5706 for functions. Application looks like f a b instead of f(a,b);
5708 * Mutually recursive inductive definitions finally work in HOL;
5710 * In ZF, pattern-matching on tuples is now available in all abstractions and
5711 translates to the operator "split";
5718 * new infix operator, addss, allowing the classical reasoner to
5719 perform simplification at each step of its search. Example:
5720 fast_tac (cs addss ss)
5722 * a new logic, CHOL, the same as HOL, but with a curried syntax
5723 for functions. Application looks like f a b instead of f(a,b). Also pairs
5724 look like (a,b) instead of <a,b>;
5726 * PLEASE NOTE: CHOL will eventually replace HOL!
5728 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5729 It translates to the operator "split". A new theory of integers is available;
5731 * In ZF, integer numerals now denote two's-complement binary integers.
5732 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5734 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5735 of the Axiom of Choice;
5742 * Significantly faster resolution;
5744 * the different sections in a .thy file can now be mixed and repeated
5747 * Database of theorems for FOL, HOL and ZF. New
5748 commands including qed, qed_goal and bind_thm store theorems in the database.
5750 * Simple database queries: return a named theorem (get_thm) or all theorems of
5751 a given theory (thms_of), or find out what theory a theorem was proved in
5754 * Bugs fixed in the inductive definition and datatype packages;
5756 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5757 and HOL_dup_cs obsolete;
5759 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5762 * Simpler definition of function space in ZF;
5764 * new results about cardinal and ordinal arithmetic in ZF;
5766 * 'subtype' facility in HOL for introducing new types as subsets of existing
5769 :mode=text:wrap=hard:maxLineLen=72: