1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
10 one backslash should be used, even in ML sources.
15 * On instantiation of classes, remaining undefined class parameters
16 are formally declared. INCOMPATIBILITY.
21 * New proof method "smt" for a combination of first-order logic
22 with equality, linear and nonlinear (natural/integer/real)
23 arithmetic, and fixed-size bitvectors; there is also basic
24 support for higher-order features (esp. lambda abstractions).
25 It is an incomplete decision procedure based on external SMT
26 solvers using the oracle mechanism.
28 * Reorganization of number theory:
29 * former session NumberTheory now named Old_Number_Theory
30 * new session Number_Theory by Jeremy Avigad; if possible, prefer this.
31 * moved legacy theories Legacy_GCD and Primes from Library/ to Old_Number_Theory/;
32 * moved theory Pocklington from Library/ to Old_Number_Theory/;
33 * removed various references to Old_Number_Theory from HOL distribution.
36 * Theory GCD now has functions Gcd/GCD and Lcm/LCM for the gcd and lcm
37 of finite and infinite sets. It is shown that they form a complete
40 * Split off prime number ingredients from theory GCD
41 to theory Number_Theory/Primes;
43 * Class semiring_div requires superclass no_zero_divisors and proof of
44 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
45 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
46 generalized to class semiring_div, subsuming former theorems
47 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
48 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
51 * New testing tool "Mirabelle" for automated (proof) tools. Applies
52 several tools and tactics like sledgehammer, metis, or quickcheck, to
53 every proof step in a theory. To be used in batch mode via the
56 * New proof method "sos" (sum of squares) for nonlinear real
57 arithmetic (originally due to John Harison). It requires
58 Library/Sum_Of_Squares. It is not a complete decision procedure but
59 works well in practice on quantifier-free real arithmetic with +, -,
60 *, ^, =, <= and <, i.e. boolean combinations of equalities and
61 inequalities between polynomials. It makes use of external
62 semidefinite programming solvers. For more information and examples
63 see src/HOL/Library/Sum_Of_Squares.
65 * Code generator attributes follow the usual underscore convention:
66 code_unfold replaces code unfold
67 code_post replaces code post
71 * Refinements to lattice classes and sets:
72 - less default intro/elim rules in locale variant, more default
73 intro/elim rules in class variant: more uniformity
74 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with le_inf_iff
75 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and sup_aci)
76 - renamed ACI to inf_sup_aci
77 - new class "boolean_algebra"
78 - class "complete_lattice" moved to separate theory "complete_lattice";
79 corresponding constants (and abbreviations) renamed and with authentic syntax:
80 Set.Inf ~> Complete_Lattice.Inf
81 Set.Sup ~> Complete_Lattice.Sup
82 Set.INFI ~> Complete_Lattice.INFI
83 Set.SUPR ~> Complete_Lattice.SUPR
84 Set.Inter ~> Complete_Lattice.Inter
85 Set.Union ~> Complete_Lattice.Union
86 Set.INTER ~> Complete_Lattice.INTER
87 Set.UNION ~> Complete_Lattice.UNION
88 - more convenient names for set intersection and union:
91 - authentic syntax for
99 Complete_Lattice.Inter (for Inf)
100 Complete_Lattice.Union (for Sup)
101 Complete_Lattice.INTER (for INFI)
102 Complete_Lattice.UNION (for SUPR)
103 - object-logic definitions as far as appropriate
107 * Power operations on relations and functions are now one dedicate
108 constant "compow" with infix syntax "^^". Power operations on
109 multiplicative monoids retains syntax "^" and is now defined generic
110 in class power. INCOMPATIBILITY.
112 * Relation composition "R O S" now has a "more standard" argument
113 order, i.e., "R O S = {(x,z). EX y. (x,y) : R & (y,z) : S }".
114 INCOMPATIBILITY: Rewrite propositions with "S O R" --> "R O S". Proofs
115 may occationally break, since the O_assoc rule was not rewritten like
116 this. Fix using O_assoc[symmetric]. The same applies to the curried
119 * ML antiquotation @{code_datatype} inserts definition of a datatype
120 generated by the code generator; see Predicate.thy for an example.
122 * New method "linarith" invokes existing linear arithmetic decision
125 * New implementation of quickcheck uses generic code generator;
126 default generators are provided for all suitable HOL types, records
130 Suc_eq_add_numeral_1 -> Suc_eq_plus1
131 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
132 Suc_plus1 -> Suc_eq_plus1
135 Wellfounded.in_inv_image -> Relation.in_inv_image
137 * New sledgehammer option "Full Types" in Proof General settings menu.
138 Causes full type information to be output to the ATPs. This slows
139 ATPs down considerably but eliminates a source of unsound "proofs"
142 * New method metisFT: A version of metis that uses full type information
143 in order to avoid failures of proof reconstruction.
145 * Discontinued ancient tradition to suffix certain ML module names
146 with "_package", e.g.:
148 DatatypePackage ~> Datatype
149 InductivePackage ~> Inductive
153 * Discontinued abbreviation "arbitrary" of constant
154 "undefined". INCOMPATIBILITY, use "undefined" directly.
156 * New evaluator "approximate" approximates an real valued term using
157 the same method as the approximation method.
159 * Method "approximate" supports now arithmetic expressions as
160 boundaries of intervals and implements interval splitting and Taylor
163 * Changed DERIV_intros to a dynamic fact (via Named_Thms). Each of
164 the theorems in DERIV_intros assumes composition with an additional
165 function and matches a variable to the derivative, which has to be
166 solved by the simplifier. Hence (auto intro!: DERIV_intros) computes
167 the derivative of most elementary terms.
169 * Maclauren.DERIV_tac and Maclauren.deriv_tac was removed, they are
170 replaced by: (auto intro!: DERIV_intros). INCOMPATIBILITY.
175 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
176 parallel tactical reasoning.
178 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
179 are similar to SUBPROOF, but are slightly more flexible: only the
180 specified parts of the subgoal are imported into the context, and the
181 body tactic may introduce new subgoals and schematic variables.
183 * Old tactical METAHYPS, which does not observe the proof context, has
184 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
185 or Subgoal.FOCUS etc.
187 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
188 functors have their own ML name space there is no point to mark them
189 separately.) Minor INCOMPATIBILITY.
191 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
193 * Eliminated old Attrib.add_attributes, Method.add_methods and related
194 cominators for "args". INCOMPATIBILITY, need to use simplified
195 Attrib/Method.setup introduced in Isabelle2009.
197 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
198 back on global_simpset_of, global_claset_of, global_clasimpset_of as
199 last resort. INCOMPATIBILITY.
201 * Display.pretty_thm now requires a proper context (cf. former
202 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
203 or even Display.pretty_thm_without_context as last resort.
206 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
207 Syntax.pretty_typ/term directly, preferably with proper context
208 instead of global theory.
213 * Support for additional "Isabelle components" via etc/components, see
214 also the system manual.
216 * The isabelle makeall tool now operates on all components with
217 IsaMakefile, not just hardwired "logics".
219 * Discontinued support for Poly/ML 4.x versions.
221 * Removed "compress" option from isabelle-process and isabelle usedir;
222 this is always enabled.
224 * More fine-grained control of proof parallelism, cf.
225 Goal.parallel_proofs in ML and usedir option -q LEVEL.
229 New in Isabelle2009 (April 2009)
230 --------------------------------
234 * Simplified main Isabelle executables, with less surprises on
235 case-insensitive file-systems (such as Mac OS).
237 - The main Isabelle tool wrapper is now called "isabelle" instead of
240 - The former "isabelle" alias for "isabelle-process" has been
241 removed (should rarely occur to regular users).
243 - The former "isabelle-interface" and its alias "Isabelle" have been
244 removed (interfaces are now regular Isabelle tools).
246 Within scripts and make files, the Isabelle environment variables
247 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
248 respectively. (The latter are still available as legacy feature.)
250 The old isabelle-interface wrapper could react in confusing ways if
251 the interface was uninstalled or changed otherwise. Individual
252 interface tool configuration is now more explicit, see also the
253 Isabelle system manual. In particular, Proof General is now available
254 via "isabelle emacs".
256 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
257 purge installed copies of Isabelle executables and re-run "isabelle
258 install -p ...", or use symlinks.
260 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
261 old ~/isabelle, which was slightly non-standard and apt to cause
262 surprises on case-insensitive file-systems (such as Mac OS).
264 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
265 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
266 care is required when using older releases of Isabelle. Note that
267 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
268 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
270 * Proofs of fully specified statements are run in parallel on
271 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
272 a regular 4-core machine, if the initial heap space is made reasonably
273 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
275 * The main reference manuals ("isar-ref", "implementation", and
276 "system") have been updated and extended. Formally checked references
277 as hyperlinks are now available uniformly.
282 * Complete re-implementation of locales. INCOMPATIBILITY in several
283 respects. The most important changes are listed below. See the
284 Tutorial on Locales ("locales" manual) for details.
286 - In locale expressions, instantiation replaces renaming. Parameters
287 must be declared in a for clause. To aid compatibility with previous
288 parameter inheritance, in locale declarations, parameters that are not
289 'touched' (instantiation position "_" or omitted) are implicitly added
290 with their syntax at the beginning of the for clause.
292 - Syntax from abbreviations and definitions in locales is available in
293 locale expressions and context elements. The latter is particularly
294 useful in locale declarations.
296 - More flexible mechanisms to qualify names generated by locale
297 expressions. Qualifiers (prefixes) may be specified in locale
298 expressions, and can be marked as mandatory (syntax: "name!:") or
299 optional (syntax "name?:"). The default depends for plain "name:"
300 depends on the situation where a locale expression is used: in
301 commands 'locale' and 'sublocale' prefixes are optional, in
302 'interpretation' and 'interpret' prefixes are mandatory. The old
303 implicit qualifiers derived from the parameter names of a locale are
306 - Command "sublocale l < e" replaces "interpretation l < e". The
307 instantiation clause in "interpretation" and "interpret" (square
308 brackets) is no longer available. Use locale expressions.
310 - When converting proof scripts, mandatory qualifiers in
311 'interpretation' and 'interpret' should be retained by default, even
312 if this is an INCOMPATIBILITY compared to former behavior. In the
313 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
314 in locale expressions range over a single locale instance only.
316 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
317 In existing theorem specifications replace the includes element by the
318 respective context elements of the included locale, omitting those
319 that are already present in the theorem specification. Multiple
320 assume elements of a locale should be replaced by a single one
321 involving the locale predicate. In the proof body, declarations (most
322 notably theorems) may be regained by interpreting the respective
323 locales in the proof context as required (command "interpret").
325 If using "includes" in replacement of a target solely because the
326 parameter types in the theorem are not as general as in the target,
327 consider declaring a new locale with additional type constraints on
328 the parameters (context element "constrains").
330 - Discontinued "locale (open)". INCOMPATIBILITY.
332 - Locale interpretation commands no longer attempt to simplify goal.
333 INCOMPATIBILITY: in rare situations the generated goal differs. Use
334 methods intro_locales and unfold_locales to clarify.
336 - Locale interpretation commands no longer accept interpretation
337 attributes. INCOMPATIBILITY.
339 * Class declaration: so-called "base sort" must not be given in import
340 list any longer, but is inferred from the specification. Particularly
347 class foo = type + ...
349 * Class target: global versions of theorems stemming do not carry a
350 parameter prefix any longer. INCOMPATIBILITY.
352 * Class 'instance' command no longer accepts attached definitions.
353 INCOMPATIBILITY, use proper 'instantiation' target instead.
355 * Recovered hiding of consts, which was accidentally broken in
356 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
357 makes c inaccessible; consider using ``hide (open) const c'' instead.
359 * Slightly more coherent Pure syntax, with updated documentation in
360 isar-ref manual. Removed locales meta_term_syntax and
361 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
362 INCOMPATIBILITY in rare situations. Note that &&& should not be used
363 directly in regular applications.
365 * There is a new syntactic category "float_const" for signed decimal
366 fractions (e.g. 123.45 or -123.45).
368 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
369 interface with 'setup' command instead.
371 * Command 'local_setup' is similar to 'setup', but operates on a local
374 * The 'axiomatization' command now only works within a global theory
375 context. INCOMPATIBILITY.
377 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
378 hypotheses. Sorts required in the course of reasoning need to be
379 covered by the constraints in the initial statement, completed by the
380 type instance information of the background theory. Non-trivial sort
381 hypotheses, which rarely occur in practice, may be specified via
382 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
384 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
386 The result contains an implicit sort hypotheses as before --
387 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
390 * Generalized Isar history, with support for linear undo, direct state
393 * Changed defaults for unify configuration options:
395 unify_trace_bound = 50 (formerly 25)
396 unify_search_bound = 60 (formerly 30)
398 * Different bookkeeping for code equations (INCOMPATIBILITY):
400 a) On theory merge, the last set of code equations for a particular
401 constant is taken (in accordance with the policy applied by other
402 parts of the code generator framework).
404 b) Code equations stemming from explicit declarations (e.g. code
405 attribute) gain priority over default code equations stemming
406 from definition, primrec, fun etc.
408 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
410 * Unified theorem tables for both code generators. Thus [code
411 func] has disappeared and only [code] remains. INCOMPATIBILITY.
413 * Command 'find_consts' searches for constants based on type and name
416 find_consts "_ => bool"
418 By default, matching is against subtypes, but it may be restricted to
419 the whole type. Searching by name is possible. Multiple queries are
420 conjunctive and queries may be negated by prefixing them with a
423 find_consts strict: "_ => bool" name: "Int" -"int => int"
425 * New 'find_theorems' criterion "solves" matches theorems that
426 directly solve the current goal (modulo higher-order unification).
428 * Auto solve feature for main theorem statements: whenever a new goal
429 is stated, "find_theorems solves" is called; any theorems that could
430 solve the lemma directly are listed as part of the goal state.
431 Cf. associated options in Proof General Isabelle settings menu,
432 enabled by default, with reasonable timeout for pathological cases of
433 higher-order unification.
436 *** Document preparation ***
438 * Antiquotation @{lemma} now imitates a regular terminal proof,
439 demanding keyword 'by' and supporting the full method expression
440 syntax just like the Isar command 'by'.
445 * Integrated main parts of former image HOL-Complex with HOL. Entry
446 points Main and Complex_Main remain as before.
448 * Logic image HOL-Plain provides a minimal HOL with the most important
449 tools available (inductive, datatype, primrec, ...). This facilitates
450 experimentation and tool development. Note that user applications
451 (and library theories) should never refer to anything below theory
454 * Logic image HOL-Main stops at theory Main, and thus facilitates
455 experimentation due to shorter build times.
457 * Logic image HOL-NSA contains theories of nonstandard analysis which
458 were previously part of former HOL-Complex. Entry point Hyperreal
459 remains valid, but theories formerly using Complex_Main should now use
460 new entry point Hypercomplex.
462 * Generic ATP manager for Sledgehammer, based on ML threads instead of
463 Posix processes. Avoids potentially expensive forking of the ML
464 process. New thread-based implementation also works on non-Unix
465 platforms (Cygwin). Provers are no longer hardwired, but defined
466 within the theory via plain ML wrapper functions. Basic Sledgehammer
467 commands are covered in the isar-ref manual.
469 * Wrapper scripts for remote SystemOnTPTP service allows to use
470 sledgehammer without local ATP installation (Vampire etc.). Other
471 provers may be included via suitable ML wrappers, see also
472 src/HOL/ATP_Linkup.thy.
474 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
477 * The metis method no longer fails because the theorem is too trivial
478 (contains the empty clause).
480 * The metis method now fails in the usual manner, rather than raising
481 an exception, if it determines that it cannot prove the theorem.
483 * Method "coherent" implements a prover for coherent logic (see also
484 src/Tools/coherent.ML).
486 * Constants "undefined" and "default" replace "arbitrary". Usually
487 "undefined" is the right choice to replace "arbitrary", though
488 logically there is no difference. INCOMPATIBILITY.
490 * Command "value" now integrates different evaluation mechanisms. The
491 result of the first successful evaluation mechanism is printed. In
492 square brackets a particular named evaluation mechanisms may be
493 specified (currently, [SML], [code] or [nbe]). See further
494 src/HOL/ex/Eval_Examples.thy.
496 * Normalization by evaluation now allows non-leftlinear equations.
497 Declare with attribute [code nbe].
499 * Methods "case_tac" and "induct_tac" now refer to the very same rules
500 as the structured Isar versions "cases" and "induct", cf. the
501 corresponding "cases" and "induct" attributes. Mutual induction rules
502 are now presented as a list of individual projections
503 (e.g. foo_bar.inducts for types foo and bar); the old format with
504 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
505 rare situations a different rule is selected --- notably nested tuple
506 elimination instead of former prod.exhaust: use explicit (case_tac t
507 rule: prod.exhaust) here.
509 * Attributes "cases", "induct", "coinduct" support "del" option.
511 * Removed fact "case_split_thm", which duplicates "case_split".
513 * The option datatype has been moved to a new theory Option. Renamed
514 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
516 * New predicate "strict_mono" classifies strict functions on partial
517 orders. With strict functions on linear orders, reasoning about
518 (in)equalities is facilitated by theorems "strict_mono_eq",
519 "strict_mono_less_eq" and "strict_mono_less".
521 * Some set operations are now proper qualified constants with
522 authentic syntax. INCOMPATIBILITY:
533 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
536 * Auxiliary class "itself" has disappeared -- classes without any
537 parameter are treated as expected by the 'class' command.
539 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
541 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
542 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
544 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
545 method "approximation". It proves formulas on real values by using
546 interval arithmetic. In the formulas are also the transcendental
547 functions sin, cos, tan, atan, ln, exp and the constant pi are
548 allowed. For examples see
549 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
551 * Theory "Reflection" now resides in HOL/Library.
553 * Entry point to Word library now simply named "Word".
556 * Made source layout more coherent with logical distribution
559 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
560 src/HOL/Library/Code_Message.thy ~> src/HOL/
561 src/HOL/Library/GCD.thy ~> src/HOL/
562 src/HOL/Library/Order_Relation.thy ~> src/HOL/
563 src/HOL/Library/Parity.thy ~> src/HOL/
564 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
565 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
566 src/HOL/Real/Lubs.thy ~> src/HOL/
567 src/HOL/Real/PReal.thy ~> src/HOL/
568 src/HOL/Real/Rational.thy ~> src/HOL/
569 src/HOL/Real/RComplete.thy ~> src/HOL/
570 src/HOL/Real/RealDef.thy ~> src/HOL/
571 src/HOL/Real/RealPow.thy ~> src/HOL/
572 src/HOL/Real/Real.thy ~> src/HOL/
573 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
574 src/HOL/Complex/Complex.thy ~> src/HOL/
575 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
576 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
577 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
578 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
579 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
580 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
581 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
582 src/HOL/Hyperreal/Log.thy ~> src/HOL/
583 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
584 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
585 src/HOL/Hyperreal/Series.thy ~> src/HOL/
586 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
587 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
588 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
589 src/HOL/Real/Float ~> src/HOL/Library/
590 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
591 src/HOL/Real/RealVector.thy ~> src/HOL/
593 src/HOL/arith_data.ML ~> src/HOL/Tools
594 src/HOL/hologic.ML ~> src/HOL/Tools
595 src/HOL/simpdata.ML ~> src/HOL/Tools
596 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
597 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
598 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
599 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
600 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
601 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
602 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
604 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
605 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
606 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
607 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
608 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
609 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
611 * If methods "eval" and "evaluation" encounter a structured proof
612 state with !!/==>, only the conclusion is evaluated to True (if
613 possible), avoiding strange error messages.
615 * Method "sizechange" automates termination proofs using (a
616 modification of) the size-change principle. Requires SAT solver. See
617 src/HOL/ex/Termination.thy for examples.
619 * Simplifier: simproc for let expressions now unfolds if bound
620 variable occurs at most once in let expression body. INCOMPATIBILITY.
622 * Method "arith": Linear arithmetic now ignores all inequalities when
623 fast_arith_neq_limit is exceeded, instead of giving up entirely.
625 * New attribute "arith" for facts that should always be used
626 automatically by arithmetic. It is intended to be used locally in
629 assumes [arith]: "x > 0"
631 Global usage is discouraged because of possible performance impact.
633 * New classes "top" and "bot" with corresponding operations "top" and
634 "bot" in theory Orderings; instantiation of class "complete_lattice"
635 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
637 * Changed definition lemma "less_fun_def" in order to provide an
638 instance for preorders on functions; use lemma "less_le" instead.
641 * Theory Orderings: class "wellorder" moved here, with explicit
642 induction rule "less_induct" as assumption. For instantiation of
643 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
646 * Theory Orderings: added class "preorder" as superclass of "order".
647 INCOMPATIBILITY: Instantiation proofs for order, linorder
648 etc. slightly changed. Some theorems named order_class.* now named
651 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
654 * Theory Finite_Set: added a new fold combinator of type
656 ('a => 'b => 'b) => 'b => 'a set => 'b
658 Occasionally this is more convenient than the old fold combinator
659 which is now defined in terms of the new one and renamed to
662 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
663 and "ring_simps" have been replaced by "algebra_simps" (which can be
664 extended with further lemmas!). At the moment both still exist but
665 the former will disappear at some point.
667 * Theory Power: Lemma power_Suc is now declared as a simp rule in
668 class recpower. Type-specific simp rules for various recpower types
669 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
671 rat_power_0 -> power_0
672 rat_power_Suc -> power_Suc
674 realpow_Suc -> power_Suc
675 complexpow_0 -> power_0
676 complexpow_Suc -> power_Suc
677 power_poly_0 -> power_0
678 power_poly_Suc -> power_Suc
680 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
681 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
682 dvd has been generalized to class comm_semiring_1. Likewise a bunch
683 of lemmas from Divides has been generalized from nat to class
684 semiring_div. INCOMPATIBILITY. This involves the following theorem
685 renames resulting from duplicate elimination:
687 dvd_def_mod ~> dvd_eq_mod_eq_0
688 zero_dvd_iff ~> dvd_0_left_iff
690 DIVISION_BY_ZERO_DIV ~> div_by_0
691 DIVISION_BY_ZERO_MOD ~> mod_by_0
692 mult_div ~> div_mult_self2_is_id
693 mult_mod ~> mod_mult_self2_is_0
695 * Theory IntDiv: removed many lemmas that are instances of class-based
696 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
697 rename old lemmas as follows:
699 dvd_diff -> nat_dvd_diff
700 dvd_zminus_iff -> dvd_minus_iff
701 mod_add1_eq -> mod_add_eq
702 mod_mult1_eq -> mod_mult_right_eq
703 mod_mult1_eq' -> mod_mult_left_eq
704 mod_mult_distrib_mod -> mod_mult_eq
705 nat_mod_add_left_eq -> mod_add_left_eq
706 nat_mod_add_right_eq -> mod_add_right_eq
707 nat_mod_div_trivial -> mod_div_trivial
708 nat_mod_mod_trivial -> mod_mod_trivial
709 zdiv_zadd_self1 -> div_add_self1
710 zdiv_zadd_self2 -> div_add_self2
711 zdiv_zmult_self1 -> div_mult_self2_is_id
712 zdiv_zmult_self2 -> div_mult_self1_is_id
713 zdvd_triv_left -> dvd_triv_left
714 zdvd_triv_right -> dvd_triv_right
715 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
716 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
717 zmod_zadd_left_eq -> mod_add_left_eq
718 zmod_zadd_right_eq -> mod_add_right_eq
719 zmod_zadd_self1 -> mod_add_self1
720 zmod_zadd_self2 -> mod_add_self2
721 zmod_zadd1_eq -> mod_add_eq
722 zmod_zdiff1_eq -> mod_diff_eq
723 zmod_zdvd_zmod -> mod_mod_cancel
724 zmod_zmod_cancel -> mod_mod_cancel
725 zmod_zmult_self1 -> mod_mult_self2_is_0
726 zmod_zmult_self2 -> mod_mult_self1_is_0
729 zdvd_abs1 -> abs_dvd_iff
730 zdvd_abs2 -> dvd_abs_iff
731 zdvd_refl -> dvd_refl
732 zdvd_trans -> dvd_trans
734 zdvd_zdiff -> dvd_diff
735 zdvd_zminus_iff -> dvd_minus_iff
736 zdvd_zminus2_iff -> minus_dvd_iff
737 zdvd_zmultD -> dvd_mult_right
738 zdvd_zmultD2 -> dvd_mult_left
739 zdvd_zmult_mono -> mult_dvd_mono
740 zdvd_0_right -> dvd_0_right
741 zdvd_0_left -> dvd_0_left_iff
742 zdvd_1_left -> one_dvd
743 zminus_dvd_iff -> minus_dvd_iff
745 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
747 * The real numbers offer decimal input syntax: 12.34 is translated
748 into 1234/10^2. This translation is not reversed upon output.
750 * Theory Library/Polynomial defines an abstract type 'a poly of
751 univariate polynomials with coefficients of type 'a. In addition to
752 the standard ring operations, it also supports div and mod. Code
753 generation is also supported, using list-style constructors.
755 * Theory Library/Inner_Product defines a class of real_inner for real
756 inner product spaces, with an overloaded operation inner :: 'a => 'a
757 => real. Class real_inner is a subclass of real_normed_vector from
760 * Theory Library/Product_Vector provides instances for the product
761 type 'a * 'b of several classes from RealVector and Inner_Product.
762 Definitions of addition, subtraction, scalar multiplication, norms,
763 and inner products are included.
765 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
766 addition to the field operations, numerals and case syntax are also
769 * Theory Library/Diagonalize provides constructive version of Cantor's
770 first diagonalization argument.
772 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
773 zlcm (for int); carried together from various gcd/lcm developements in
774 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
775 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
776 may recover tupled syntax as follows:
778 hide (open) const gcd
779 abbreviation gcd where
780 "gcd == (%(a, b). GCD.gcd a b)"
782 GCD.gcd ("gcd '(_, _')")
784 The same works for lcm, zgcd, zlcm.
786 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
787 instantiations for algebraic structures. Removed some duplicate
788 theorems. Changes in simp rules. INCOMPATIBILITY.
790 * ML antiquotation @{code} takes a constant as argument and generates
791 corresponding code in background and inserts name of the corresponding
792 resulting ML value/function/datatype constructor binding in place.
793 All occurrences of @{code} with a single ML block are generated
794 simultaneously. Provides a generic and safe interface for
795 instrumentalizing code generation. See
796 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
797 In future you ought to refrain from ad-hoc compiling generated SML
798 code on the ML toplevel. Note that (for technical reasons) @{code}
799 cannot refer to constants for which user-defined serializations are
800 set. Refer to the corresponding ML counterpart directly in that
803 * Command 'rep_datatype': instead of theorem names the command now
804 takes a list of terms denoting the constructors of the type to be
805 represented as datatype. The characteristic theorems have to be
806 proven. INCOMPATIBILITY. Also observe that the following theorems
807 have disappeared in favour of existing ones:
809 unit_induct ~> unit.induct
810 prod_induct ~> prod.induct
811 sum_induct ~> sum.induct
812 Suc_Suc_eq ~> nat.inject
813 Suc_not_Zero Zero_not_Suc ~> nat.distinct
818 * New locales for orders and lattices where the equivalence relation
819 is not restricted to equality. INCOMPATIBILITY: all order and lattice
820 locales use a record structure with field eq for the equivalence.
822 * New theory of factorial domains.
824 * Units_l_inv and Units_r_inv are now simp rules by default.
825 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
826 and/or r_inv will now also require deletion of these lemmas.
828 * Renamed the following theorems, INCOMPATIBILITY:
832 least_carrier ~> least_closed
833 greatest_carrier ~> greatest_closed
834 greatest_Lower_above ~> greatest_Lower_below
835 one_zero ~> carrier_one_zero
836 one_not_zero ~> carrier_one_not_zero (collision with assumption)
841 * Nominal datatypes can now contain type-variables.
843 * Commands 'nominal_inductive' and 'equivariance' work with local
846 * Nominal primrec can now works with local theory targets and its
847 specification syntax now conforms to the general format as seen in
850 * Method "perm_simp" honours the standard simplifier attributes
851 (no_asm), (no_asm_use) etc.
853 * The new predicate #* is defined like freshness, except that on the
854 left hand side can be a set or list of atoms.
856 * Experimental command 'nominal_inductive2' derives strong induction
857 principles for inductive definitions. In contrast to
858 'nominal_inductive', which can only deal with a fixed number of
859 binders, it can deal with arbitrary expressions standing for sets of
860 atoms to be avoided. The only inductive definition we have at the
861 moment that needs this generalisation is the typing rule for Lets in
864 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
865 -----------------------------------------------------------------
866 Gamma |- Let x be t1 in t2 : T2
868 In this rule one wants to avoid all the binders that are introduced by
869 "close Gamma T1". We are looking for other examples where this
870 feature might be useful. Please let us know.
875 * Reimplemented the simplification procedure for proving continuity
876 subgoals. The new simproc is extensible; users can declare additional
877 continuity introduction rules with the attribute [cont2cont].
879 * The continuity simproc now uses a different introduction rule for
880 solving continuity subgoals on terms with lambda abstractions. In
881 some rare cases the new simproc may fail to solve subgoals that the
882 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
883 Potential INCOMPATIBILITY.
885 * Command 'fixrec': specification syntax now conforms to the general
886 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
887 examples. INCOMPATIBILITY.
892 * Proof of Zorn's Lemma for partial orders.
897 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
898 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
899 depends on multithreading, so timouts will not work before Poly/ML
902 * High-level support for concurrent ML programming, see
903 src/Pure/Cuncurrent. The data-oriented model of "future values" is
904 particularly convenient to organize independent functional
905 computations. The concept of "synchronized variables" provides a
906 higher-order interface for components with shared state, avoiding the
907 delicate details of mutexes and condition variables. (Requires
908 Poly/ML 5.2.1 or later.)
910 * ML bindings produced via Isar commands are stored within the Isar
911 context (theory or proof). Consequently, commands like 'use' and 'ML'
912 become thread-safe and work with undo as expected (concerning
913 top-level bindings, not side-effects on global references).
914 INCOMPATIBILITY, need to provide proper Isar context when invoking the
915 compiler at runtime; really global bindings need to be given outside a
916 theory. (Requires Poly/ML 5.2 or later.)
918 * Command 'ML_prf' is analogous to 'ML' but works within a proof
919 context. Top-level ML bindings are stored within the proof context in
920 a purely sequential fashion, disregarding the nested proof structure.
921 ML bindings introduced by 'ML_prf' are discarded at the end of the
922 proof. (Requires Poly/ML 5.2 or later.)
924 * Simplified ML attribute and method setup, cf. functions Attrib.setup
925 and Method.setup, as well as Isar commands 'attribute_setup' and
926 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
927 existing code accordingly, or use plain 'setup' together with old
930 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
931 to 'a -> thm, while results are always tagged with an authentic oracle
932 name. The Isar command 'oracle' is now polymorphic, no argument type
933 is specified. INCOMPATIBILITY, need to simplify existing oracle code
934 accordingly. Note that extra performance may be gained by producing
935 the cterm carefully, avoiding slow Thm.cterm_of.
937 * Simplified interface for defining document antiquotations via
938 ThyOutput.antiquotation, ThyOutput.output, and optionally
939 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
940 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
943 * More systematic treatment of long names, abstract name bindings, and
944 name space operations. Basic operations on qualified names have been
945 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
946 Long_Name.append. Old type bstring has been mostly replaced by
947 abstract type binding (see structure Binding), which supports precise
948 qualification by packages and local theory targets, as well as proper
949 tracking of source positions. INCOMPATIBILITY, need to wrap old
950 bstring values into Binding.name, or better pass through abstract
951 bindings everywhere. See further src/Pure/General/long_name.ML,
952 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
954 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
955 LocalTheory.note etc.) now refer to the *full* internal name, not the
956 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
958 * Disposed old type and term read functions (Sign.read_def_typ,
959 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
960 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
961 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
962 Syntax.read_term_global etc.; see also OldGoals.read_term as last
963 resort for legacy applications.
965 * Disposed old declarations, tactics, tactic combinators that refer to
966 the simpset or claset of an implicit theory (such as Addsimps,
967 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
968 embedded ML text, or local_simpset_of with a proper context passed as
969 explicit runtime argument.
971 * Rules and tactics that read instantiations (read_instantiate,
972 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
973 context, which is required for parsing and type-checking. Moreover,
974 the variables are specified as plain indexnames, not string encodings
975 thereof. INCOMPATIBILITY.
977 * Generic Toplevel.add_hook interface allows to analyze the result of
978 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
979 for theorem dependency output of transactions resulting in a new
982 * ML antiquotations: block-structured compilation context indicated by
983 \<lbrace> ... \<rbrace>; additional antiquotation forms:
985 @{binding name} - basic name binding
986 @{let ?pat = term} - term abbreviation (HO matching)
987 @{note name = fact} - fact abbreviation
988 @{thm fact} - singleton fact (with attributes)
989 @{thms fact} - general fact (with attributes)
990 @{lemma prop by method} - singleton goal
991 @{lemma prop by meth1 meth2} - singleton goal
992 @{lemma prop1 ... propN by method} - general goal
993 @{lemma prop1 ... propN by meth1 meth2} - general goal
994 @{lemma (open) ...} - open derivation
999 * The Isabelle "emacs" tool provides a specific interface to invoke
1000 Proof General / Emacs, with more explicit failure if that is not
1001 installed (the old isabelle-interface script silently falls back on
1002 isabelle-process). The PROOFGENERAL_HOME setting determines the
1003 installation location of the Proof General distribution.
1005 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1006 the Isabelle process into a JVM/Scala application. See
1007 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1008 process wrapper has been discontinued.)
1010 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1012 * Various status messages (with exact source position information) are
1013 emitted, if proper markup print mode is enabled. This allows
1014 user-interface components to provide detailed feedback on internal
1019 New in Isabelle2008 (June 2008)
1020 -------------------------------
1024 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1025 and updated, with formally checked references as hyperlinks.
1027 * Theory loader: use_thy (and similar operations) no longer set the
1028 implicit ML context, which was occasionally hard to predict and in
1029 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1030 provides a proper context already.
1032 * Theory loader: old-style ML proof scripts being *attached* to a thy
1033 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1034 'use' within a theory file will do the job.
1036 * Name space merge now observes canonical order, i.e. the second space
1037 is inserted into the first one, while existing entries in the first
1038 space take precedence. INCOMPATIBILITY in rare situations, may try to
1039 swap theory imports.
1041 * Syntax: symbol \<chi> is now considered a letter. Potential
1042 INCOMPATIBILITY in identifier syntax etc.
1044 * Outer syntax: string tokens no longer admit escaped white space,
1045 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1046 white space without escapes.
1048 * Outer syntax: string tokens may contain arbitrary character codes
1049 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1055 * Context-dependent token translations. Default setup reverts locally
1056 fixed variables, and adds hilite markup for undeclared frees.
1058 * Unused theorems can be found using the new command 'unused_thms'.
1059 There are three ways of invoking it:
1062 Only finds unused theorems in the current theory.
1064 (2) unused_thms thy_1 ... thy_n -
1065 Finds unused theorems in the current theory and all of its ancestors,
1066 excluding the theories thy_1 ... thy_n and all of their ancestors.
1068 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1069 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1070 their ancestors, excluding the theories thy_1 ... thy_n and all of
1073 In order to increase the readability of the list produced by
1074 unused_thms, theorems that have been created by a particular instance
1075 of a theory command such as 'inductive' or 'function' are considered
1076 to belong to the same "group", meaning that if at least one theorem in
1077 this group is used, the other theorems in the same group are no longer
1078 reported as unused. Moreover, if all theorems in the group are
1079 unused, only one theorem in the group is displayed.
1081 Note that proof objects have to be switched on in order for
1082 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1083 usually the case when using Proof General with the default settings).
1085 * Authentic naming of facts disallows ad-hoc overwriting of previous
1086 theorems within the same name space. INCOMPATIBILITY, need to remove
1087 duplicate fact bindings, or even accidental fact duplications. Note
1088 that tools may maintain dynamically scoped facts systematically, using
1089 PureThy.add_thms_dynamic.
1091 * Command 'hide' now allows to hide from "fact" name space as well.
1093 * Eliminated destructive theorem database, simpset, claset, and
1094 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1095 update of theories within ML code.
1097 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1098 INCOMPATIBILITY, object-logics depending on former Pure require
1099 additional setup PureThy.old_appl_syntax_setup; object-logics
1100 depending on former CPure need to refer to Pure.
1102 * Commands 'use' and 'ML' are now purely functional, operating on
1103 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1104 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1107 * Command 'setup': discontinued implicit version with ML reference.
1109 * Instantiation target allows for simultaneous specification of class
1110 instance operations together with an instantiation proof.
1111 Type-checking phase allows to refer to class operations uniformly.
1112 See src/HOL/Complex/Complex.thy for an Isar example and
1113 src/HOL/Library/Eval.thy for an ML example.
1115 * Indexing of literal facts: be more serious about including only
1116 facts from the visible specification/proof context, but not the
1117 background context (locale etc.). Affects `prop` notation and method
1118 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1121 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1122 "(open)" option, which used to expose internal bound variables to the
1125 * Isar statements: removed obsolete case "rule_context".
1126 INCOMPATIBILITY, better use explicit fixes/assumes.
1128 * Locale proofs: default proof step now includes 'unfold_locales';
1129 hence 'proof' without argument may be used to unfold locale
1133 *** Document preparation ***
1135 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1136 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1137 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1138 spot); renamed link color from "darkblue" to "linkcolor" (default
1139 value unchanged, can be redefined via \definecolor); no longer sets
1140 "a4paper" option (unnecessary or even intrusive).
1142 * Antiquotation @{lemma A method} proves proposition A by the given
1143 method (either a method name or a method name plus (optional) method
1144 arguments in parentheses) and prints A just like @{prop A}.
1149 * New primrec package. Specification syntax conforms in style to
1150 definition/function/.... No separate induction rule is provided. The
1151 "primrec" command distinguishes old-style and new-style specifications
1152 by syntax. The former primrec package is now named OldPrimrecPackage.
1153 When adjusting theories, beware: constants stemming from new-style
1154 primrec specifications have authentic syntax.
1156 * Metis prover is now an order of magnitude faster, and also works
1157 with multithreading.
1159 * Metis: the maximum number of clauses that can be produced from a
1160 theorem is now given by the attribute max_clauses. Theorems that
1161 exceed this number are ignored, with a warning printed.
1163 * Sledgehammer no longer produces structured proofs by default. To
1164 enable, declare [[sledgehammer_full = true]]. Attributes
1165 reconstruction_modulus, reconstruction_sorts renamed
1166 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1168 * Method "induct_scheme" derives user-specified induction rules
1169 from well-founded induction and completeness of patterns. This factors
1170 out some operations that are done internally by the function package
1171 and makes them available separately. See
1172 src/HOL/ex/Induction_Scheme.thy for examples.
1174 * More flexible generation of measure functions for termination
1175 proofs: Measure functions can be declared by proving a rule of the
1176 form "is_measure f" and giving it the [measure_function] attribute.
1177 The "is_measure" predicate is logically meaningless (always true), and
1178 just guides the heuristic. To find suitable measure functions, the
1179 termination prover sets up the goal "is_measure ?f" of the appropriate
1180 type and generates all solutions by prolog-style backwards proof using
1183 This setup also deals with rules like
1185 "is_measure f ==> is_measure (list_size f)"
1187 which accommodates nested datatypes that recurse through lists.
1188 Similar rules are predeclared for products and option types.
1190 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1194 - Definitions of overloaded constants on sets have to be replaced by
1195 definitions on => and bool.
1197 - Some definitions of overloaded operators on sets can now be proved
1198 using the definitions of the operators on => and bool. Therefore,
1199 the following theorems have been renamed:
1201 subset_def -> subset_eq
1202 psubset_def -> psubset_eq
1203 set_diff_def -> set_diff_eq
1204 Compl_def -> Compl_eq
1205 Sup_set_def -> Sup_set_eq
1206 Inf_set_def -> Inf_set_eq
1207 sup_set_def -> sup_set_eq
1208 inf_set_def -> inf_set_eq
1210 - Due to the incompleteness of the HO unification algorithm, some
1211 rules such as subst may require manual instantiation, if some of
1212 the unknowns in the rule is a set.
1214 - Higher order unification and forward proofs:
1217 have "P (S::'a set)" <...>
1218 then have "EX S. P S" ..
1220 no longer works (due to the incompleteness of the HO unification
1221 algorithm) and must be replaced by the pattern
1228 - Calculational reasoning with subst (or similar rules):
1231 have "P (S::'a set)" <...>
1232 also have "S = T" <...>
1233 finally have "P T" .
1235 no longer works (for similar reasons as the previous example) and
1236 must be replaced by something like
1238 have "P (S::'a set)" <...>
1239 moreover have "S = T" <...>
1240 ultimately have "P T" by simp
1242 - Tactics or packages written in ML code:
1243 Code performing pattern matching on types via
1245 Type ("set", [T]) => ...
1247 must be rewritten. Moreover, functions like strip_type or
1248 binder_types no longer return the right value when applied to a
1251 T1 => ... => Tn => U => bool
1255 T1 => ... => Tn => U set
1257 * Merged theories Wellfounded_Recursion, Accessible_Part and
1258 Wellfounded_Relations to theory Wellfounded.
1260 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1262 * Class finite no longer treats UNIV as class parameter. Use class
1263 enum from theory Library/Enum instead to achieve a similar effect.
1266 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1267 and "Cons". INCOMPATIBILITY.
1269 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1270 Potential INCOMPATIBILITY.
1272 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1273 injective_fst_snd removed, use split_eta and prod_eqI instead.
1274 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1276 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1277 the same name in theory Orderings:
1287 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1288 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1289 and different variable names.
1291 * Library/Option_ord.thy: Canonical order on option type.
1293 * Library/RBT.thy: Red-black trees, an efficient implementation of
1296 * Library/Countable.thy: Type class for countable types.
1298 * Theory Int: The representation of numerals has changed. The infix
1299 operator BIT and the bit datatype with constructors B0 and B1 have
1300 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1301 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1302 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1305 * Theory Nat: definition of <= and < on natural numbers no longer
1306 depend on well-founded relations. INCOMPATIBILITY. Definitions
1307 le_def and less_def have disappeared. Consider lemmas not_less
1308 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1310 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1311 (whose purpose mainly is for various fold_set functionals) have been
1312 abandoned in favor of the existing algebraic classes
1313 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1314 lower_semilattice (resp. upper_semilattice) and linorder.
1317 * Theory Transitive_Closure: induct and cases rules now declare proper
1318 case_names ("base" and "step"). INCOMPATIBILITY.
1320 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1321 lattices. The form set-specific version is available as
1322 Inductive.lfp_ordinal_induct_set.
1324 * Renamed theorems "power.simps" to "power_int.simps".
1327 * Class semiring_div provides basic abstract properties of semirings
1328 with division and modulo operations. Subsumes former class dvd_mod.
1330 * Merged theories IntDef, Numeral and IntArith into unified theory
1331 Int. INCOMPATIBILITY.
1333 * Theory Library/Code_Index: type "index" now represents natural
1334 numbers rather than integers. INCOMPATIBILITY.
1336 * New class "uminus" with operation "uminus" (split of from class
1337 "minus" which now only has operation "minus", binary).
1340 * Constants "card", "internal_split", "option_map" now with authentic
1341 syntax. INCOMPATIBILITY.
1343 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1344 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1345 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1346 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1347 Sup_set_def, le_def, less_def, option_map_def now with object
1348 equality. INCOMPATIBILITY.
1350 * Records. Removed K_record, and replaced it by pure lambda term
1351 %x. c. The simplifier setup is now more robust against eta expansion.
1352 INCOMPATIBILITY: in cases explicitly referring to K_record.
1354 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1356 * Library/ListVector: new theory of arithmetic vector operations.
1358 * Library/Order_Relation: new theory of various orderings as sets of
1359 pairs. Defines preorders, partial orders, linear orders and
1360 well-orders on sets and on types.
1365 * Renamed some theories to allow to loading both ZF and HOL in the
1368 Datatype -> Datatype_ZF
1369 Inductive -> Inductive_ZF
1376 INCOMPATIBILITY: ZF theories that import individual theories below
1377 Main might need to be adapted. Regular theory Main is still
1378 available, as trivial extension of Main_ZF.
1383 * ML within Isar: antiquotation @{const name} or @{const
1384 name(typargs)} produces statically-checked Const term.
1386 * Functor NamedThmsFun: data is available to the user as dynamic fact
1387 (of the same name). Removed obsolete print command.
1389 * Removed obsolete "use_legacy_bindings" function.
1391 * The ``print mode'' is now a thread-local value derived from a global
1392 template (the former print_mode reference), thus access becomes
1393 non-critical. The global print_mode reference is for session
1394 management only; user-code should use print_mode_value,
1395 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1397 * Functions system/system_out provide a robust way to invoke external
1398 shell commands, with propagation of interrupts (requires Poly/ML
1399 5.2.1). Do not use OS.Process.system etc. from the basis library!
1404 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
1405 in accordance with Proof General 3.7, which prefers GNU emacs.
1407 * isatool tty runs Isabelle process with plain tty interaction;
1408 optional line editor may be specified via ISABELLE_LINE_EDITOR
1409 setting, the default settings attempt to locate "ledit" and "rlwrap".
1411 * isatool browser now works with Cygwin as well, using general
1412 "javapath" function defined in Isabelle process environment.
1414 * YXML notation provides a simple and efficient alternative to
1415 standard XML transfer syntax. See src/Pure/General/yxml.ML and
1416 isatool yxml as described in the Isabelle system manual.
1418 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
1419 provides general wrapper for managing an Isabelle process in a robust
1420 fashion, with ``cooked'' output from stdin/stderr.
1422 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
1423 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
1425 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
1426 way of changing the user's settings is via
1427 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
1430 * Multithreading.max_threads := 0 refers to the number of actual CPU
1431 cores of the underlying machine, which is a good starting point for
1432 optimal performance tuning. The corresponding usedir option -M allows
1433 "max" as an alias for "0". WARNING: does not work on certain versions
1434 of Mac OS (with Poly/ML 5.1).
1436 * isabelle-process: non-ML sessions are run with "nice", to reduce the
1437 adverse effect of Isabelle flooding interactive front-ends (notably
1438 ProofGeneral / XEmacs).
1442 New in Isabelle2007 (November 2007)
1443 -----------------------------------
1447 * More uniform information about legacy features, notably a
1448 warning/error of "Legacy feature: ...", depending on the state of the
1449 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
1450 legacy features will disappear eventually.
1452 * Theory syntax: the header format ``theory A = B + C:'' has been
1453 discontinued in favour of ``theory A imports B C begin''. Use isatool
1454 fixheaders to convert existing theory files. INCOMPATIBILITY.
1456 * Theory syntax: the old non-Isar theory file format has been
1457 discontinued altogether. Note that ML proof scripts may still be used
1458 with Isar theories; migration is usually quite simple with the ML
1459 function use_legacy_bindings. INCOMPATIBILITY.
1461 * Theory syntax: some popular names (e.g. 'class', 'declaration',
1462 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
1465 * Theory loader: be more serious about observing the static theory
1466 header specifications (including optional directories), but not the
1467 accidental file locations of previously successful loads. The strict
1468 update policy of former update_thy is now already performed by
1469 use_thy, so the former has been removed; use_thys updates several
1470 theories simultaneously, just as 'imports' within a theory header
1471 specification, but without merging the results. Potential
1472 INCOMPATIBILITY: may need to refine theory headers and commands
1473 ROOT.ML which depend on load order.
1475 * Theory loader: optional support for content-based file
1476 identification, instead of the traditional scheme of full physical
1477 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
1478 (cf. the system manual). The new scheme allows to work with
1479 non-finished theories in persistent session images, such that source
1480 files may be moved later on without requiring reloads.
1482 * Theory loader: old-style ML proof scripts being *attached* to a thy
1483 file (with the same base name as the theory) are considered a legacy
1484 feature, which will disappear eventually. Even now, the theory loader
1485 no longer maintains dependencies on such files.
1487 * Syntax: the scope for resolving ambiguities via type-inference is
1488 now limited to individual terms, instead of whole simultaneous
1489 specifications as before. This greatly reduces the complexity of the
1490 syntax module and improves flexibility by separating parsing and
1491 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
1492 'fixes' etc.) are required in rare situations.
1494 * Syntax: constants introduced by new-style packages ('definition',
1495 'abbreviation' etc.) are passed through the syntax module in
1496 ``authentic mode''. This means that associated mixfix annotations
1497 really stick to such constants, independently of potential name space
1498 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
1499 trees are represented slightly differently, may need to adapt syntax
1500 translations accordingly. Use CONST marker in 'translations' and
1501 @{const_syntax} antiquotation in 'parse_translation' etc.
1503 * Legacy goal package: reduced interface to the bare minimum required
1504 to keep existing proof scripts running. Most other user-level
1505 functions are now part of the OldGoals structure, which is *not* open
1506 by default (consider isatool expandshort before open OldGoals).
1507 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
1508 these tend to cause confusion about the actual goal (!) context being
1509 used here, which is not necessarily the same as the_context().
1511 * Command 'find_theorems': supports "*" wild-card in "name:"
1512 criterion; "with_dups" option. Certain ProofGeneral versions might
1513 support a specific search form (see ProofGeneral/CHANGES).
1515 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
1516 by default, which means that "prems" (and also "fixed variables") are
1517 suppressed from proof state output. Note that the ProofGeneral
1518 settings mechanism allows to change and save options persistently, but
1519 older versions of Isabelle will fail to start up if a negative prems
1522 * Local theory targets may be specified by non-nested blocks of
1523 ``context/locale/class ... begin'' followed by ``end''. The body may
1524 contain definitions, theorems etc., including any derived mechanism
1525 that has been implemented on top of these primitives. This concept
1526 generalizes the existing ``theorem (in ...)'' towards more versatility
1529 * Proof General interface: proper undo of final 'end' command;
1530 discontinued Isabelle/classic mode (ML proof scripts).
1533 *** Document preparation ***
1535 * Added antiquotation @{theory name} which prints the given name,
1536 after checking that it refers to a valid ancestor theory in the
1539 * Added antiquotations @{ML_type text} and @{ML_struct text} which
1540 check the given source text as ML type/structure, printing verbatim.
1542 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
1543 "c args == rhs" given in the current context. (Any number of
1544 arguments may be given on the LHS.)
1549 * The 'class' package offers a combination of axclass and locale to
1550 achieve Haskell-like type classes in Isabelle. Definitions and
1551 theorems within a class context produce both relative results (with
1552 implicit parameters according to the locale context), and polymorphic
1553 constants with qualified polymorphism (according to the class
1554 context). Within the body context of a 'class' target, a separate
1555 syntax layer ("user space type system") takes care of converting
1556 between global polymorphic consts and internal locale representation.
1557 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
1558 "isatool doc classes" provides a tutorial.
1560 * Generic code generator framework allows to generate executable
1561 code for ML and Haskell (including Isabelle classes). A short usage
1564 internal compilation:
1565 export_code <list of constants (term syntax)> in SML
1566 writing SML code to a file:
1567 export_code <list of constants (term syntax)> in SML <filename>
1568 writing OCaml code to a file:
1569 export_code <list of constants (term syntax)> in OCaml <filename>
1570 writing Haskell code to a bunch of files:
1571 export_code <list of constants (term syntax)> in Haskell <filename>
1573 evaluating closed propositions to True/False using code generation:
1576 Reasonable default setup of framework in HOL.
1578 Theorem attributs for selecting and transforming function equations theorems:
1580 [code fun]: select a theorem as function equation for a specific constant
1581 [code fun del]: deselect a theorem as function equation for a specific constant
1582 [code inline]: select an equation theorem for unfolding (inlining) in place
1583 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
1585 User-defined serializations (target in {SML, OCaml, Haskell}):
1587 code_const <and-list of constants (term syntax)>
1588 {(target) <and-list of const target syntax>}+
1590 code_type <and-list of type constructors>
1591 {(target) <and-list of type target syntax>}+
1593 code_instance <and-list of instances>
1595 where instance ::= <type constructor> :: <class>
1597 code_class <and_list of classes>
1598 {(target) <and-list of class target syntax>}+
1599 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
1601 code_instance and code_class only are effective to target Haskell.
1603 For example usage see src/HOL/ex/Codegenerator.thy and
1604 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
1605 generation from Isabelle/HOL theories is available via "isatool doc
1608 * Code generator: consts in 'consts_code' Isar commands are now
1609 referred to by usual term syntax (including optional type
1612 * Command 'no_translations' removes translation rules from theory
1615 * Overloaded definitions are now actually checked for acyclic
1616 dependencies. The overloading scheme is slightly more general than
1617 that of Haskell98, although Isabelle does not demand an exact
1618 correspondence to type class and instance declarations.
1619 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
1620 exotic versions of overloading -- at the discretion of the user!
1622 Polymorphic constants are represented via type arguments, i.e. the
1623 instantiation that matches an instance against the most general
1624 declaration given in the signature. For example, with the declaration
1625 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
1626 as c(nat). Overloading is essentially simultaneous structural
1627 recursion over such type arguments. Incomplete specification patterns
1628 impose global constraints on all occurrences, e.g. c('a * 'a) on the
1629 LHS means that more general c('a * 'b) will be disallowed on any RHS.
1630 Command 'print_theory' outputs the normalized system of recursive
1631 equations, see section "definitions".
1633 * Configuration options are maintained within the theory or proof
1634 context (with name and type bool/int/string), providing a very simple
1635 interface to a poor-man's version of general context data. Tools may
1636 declare options in ML (e.g. using Attrib.config_int) and then refer to
1637 these values using Config.get etc. Users may change options via an
1638 associated attribute of the same name. This form of context
1639 declaration works particularly well with commands 'declare' or
1640 'using', for example ``declare [[foo = 42]]''. Thus it has become
1641 very easy to avoid global references, which would not observe Isar
1642 toplevel undo/redo and fail to work with multithreading.
1644 Various global ML references of Pure and HOL have been turned into
1645 configuration options:
1647 Unify.search_bound unify_search_bound
1648 Unify.trace_bound unify_trace_bound
1649 Unify.trace_simp unify_trace_simp
1650 Unify.trace_types unify_trace_types
1651 Simplifier.simp_depth_limit simp_depth_limit
1652 Blast.depth_limit blast_depth_limit
1653 DatatypeProp.dtK datatype_distinctness_limit
1654 fast_arith_neq_limit fast_arith_neq_limit
1655 fast_arith_split_limit fast_arith_split_limit
1657 * Named collections of theorems may be easily installed as context
1658 data using the functor NamedThmsFun (see also
1659 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
1660 attributes; there is also a toplevel print command. This facility is
1661 just a common case of general context data, which is the preferred way
1662 for anything more complex than just a list of facts in canonical
1665 * Isar: command 'declaration' augments a local theory by generic
1666 declaration functions written in ML. This enables arbitrary content
1667 being added to the context, depending on a morphism that tells the
1668 difference of the original declaration context wrt. the application
1669 context encountered later on.
1671 * Isar: proper interfaces for simplification procedures. Command
1672 'simproc_setup' declares named simprocs (with match patterns, and body
1673 text in ML). Attribute "simproc" adds/deletes simprocs in the current
1674 context. ML antiquotation @{simproc name} retrieves named simprocs.
1676 * Isar: an extra pair of brackets around attribute declarations
1677 abbreviates a theorem reference involving an internal dummy fact,
1678 which will be ignored later --- only the effect of the attribute on
1679 the background context will persist. This form of in-place
1680 declarations is particularly useful with commands like 'declare' and
1681 'using', for example ``have A using [[simproc a]] by simp''.
1683 * Isar: method "assumption" (and implicit closing of subproofs) now
1684 takes simple non-atomic goal assumptions into account: after applying
1685 an assumption as a rule the resulting subgoals are solved by atomic
1686 assumption steps. This is particularly useful to finish 'obtain'
1687 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
1688 without referring to the original premise "!!x. P x ==> thesis" in the
1689 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
1692 * Isar: implicit use of prems from the Isar proof context is
1693 considered a legacy feature. Common applications like ``have A .''
1694 may be replaced by ``have A by fact'' or ``note `A`''. In general,
1695 referencing facts explicitly here improves readability and
1696 maintainability of proof texts.
1698 * Isar: improper proof element 'guess' is like 'obtain', but derives
1699 the obtained context from the course of reasoning! For example:
1701 assume "EX x y. A x & B y" -- "any previous fact"
1702 then guess x and y by clarify
1704 This technique is potentially adventurous, depending on the facts and
1705 proof tools being involved here.
1707 * Isar: known facts from the proof context may be specified as literal
1708 propositions, using ASCII back-quote syntax. This works wherever
1709 named facts used to be allowed so far, in proof commands, proof
1710 methods, attributes etc. Literal facts are retrieved from the context
1711 according to unification of type and term parameters. For example,
1712 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
1713 theorems in the current context, then these are valid literal facts:
1714 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
1716 There is also a proof method "fact" which does the same composition
1717 for explicit goal states, e.g. the following proof texts coincide with
1718 certain special cases of literal facts:
1720 have "A" by fact == note `A`
1721 have "A ==> B" by fact == note `A ==> B`
1722 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
1723 have "P a ==> Q a" by fact == note `P a ==> Q a`
1725 * Isar: ":" (colon) is no longer a symbolic identifier character in
1726 outer syntax. Thus symbolic identifiers may be used without
1727 additional white space in declarations like this: ``assume *: A''.
1729 * Isar: 'print_facts' prints all local facts of the current context,
1730 both named and unnamed ones.
1732 * Isar: 'def' now admits simultaneous definitions, e.g.:
1734 def x == "t" and y == "u"
1736 * Isar: added command 'unfolding', which is structurally similar to
1737 'using', but affects both the goal state and facts by unfolding given
1738 rewrite rules. Thus many occurrences of the 'unfold' method or
1739 'unfolded' attribute may be replaced by first-class proof text.
1741 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
1742 and command 'unfolding' now all support object-level equalities
1743 (potentially conditional). The underlying notion of rewrite rule is
1744 analogous to the 'rule_format' attribute, but *not* that of the
1745 Simplifier (which is usually more generous).
1747 * Isar: the new attribute [rotated n] (default n = 1) rotates the
1748 premises of a theorem by n. Useful in conjunction with drule.
1750 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
1751 method expression within a sandbox consisting of the first N
1752 sub-goals, which need to exist. For example, ``simp_all [3]''
1753 simplifies the first three sub-goals, while (rule foo, simp_all)[]
1754 simplifies all new goals that emerge from applying rule foo to the
1755 originally first one.
1757 * Isar: schematic goals are no longer restricted to higher-order
1758 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
1761 * Isar: the conclusion of a long theorem statement is now either
1762 'shows' (a simultaneous conjunction, as before), or 'obtains'
1763 (essentially a disjunction of cases with local parameters and
1764 assumptions). The latter allows to express general elimination rules
1765 adequately; in this notation common elimination rules look like this:
1767 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
1769 obtains x where "P x"
1771 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
1775 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
1781 The subsequent classical rules even refer to the formal "thesis"
1784 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
1787 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
1788 obtains "thesis ==> something"
1790 The actual proof of an 'obtains' statement is analogous to that of the
1791 Isar proof element 'obtain', only that there may be several cases.
1792 Optional case names may be specified in parentheses; these will be
1793 available both in the present proof and as annotations in the
1794 resulting rule, for later use with the 'cases' method (cf. attribute
1797 * Isar: the assumptions of a long theorem statement are available as
1798 "assms" fact in the proof context. This is more appropriate than the
1799 (historical) "prems", which refers to all assumptions of the current
1800 context, including those from the target locale, proof body etc.
1802 * Isar: 'print_statement' prints theorems from the current theory or
1803 proof context in long statement form, according to the syntax of a
1806 * Isar: 'obtain' takes an optional case name for the local context
1807 introduction rule (default "that").
1809 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1810 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1813 * Pure: syntax "CONST name" produces a fully internalized constant
1814 according to the current context. This is particularly useful for
1815 syntax translations that should refer to internal constant
1816 representations independently of name spaces.
1818 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1819 instead of "FOO ". This allows multiple binder declarations to coexist
1820 in the same context. INCOMPATIBILITY.
1822 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1823 primitive that also works in a locale context (both for constants and
1824 fixed variables). Type declaration and internal syntactic representation
1825 of given constants retrieved from the context. Likewise, the
1826 'no_notation' command allows to remove given syntax annotations from the
1829 * Isar/locales: new derived specification elements 'axiomatization',
1830 'definition', 'abbreviation', which support type-inference, admit
1831 object-level specifications (equality, equivalence). See also the
1832 isar-ref manual. Examples:
1835 eq (infix "===" 50) where
1836 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1838 definition "f x y = x + y + 1"
1839 definition g where "g x = f x x"
1842 neq (infix "=!=" 50) where
1843 "x =!= y == ~ (x === y)"
1845 These specifications may be also used in a locale context. Then the
1846 constants being introduced depend on certain fixed parameters, and the
1847 constant name is qualified by the locale base name. An internal
1848 abbreviation takes care for convenient input and output, making the
1849 parameters implicit and using the original short name. See also
1850 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1851 entities from a monomorphic theory.
1853 Presently, abbreviations are only available 'in' a target locale, but
1854 not inherited by general import expressions. Also note that
1855 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1856 'translations' in common applications. The "no_abbrevs" print mode
1857 prevents folding of abbreviations in term output.
1859 Concrete syntax is attached to specified constants in internal form,
1860 independently of name spaces. The parse tree representation is
1861 slightly different -- use 'notation' instead of raw 'syntax', and
1862 'translations' with explicit "CONST" markup to accommodate this.
1864 * Pure/Isar: unified syntax for new-style specification mechanisms
1865 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1866 full type inference and dummy patterns ("_"). For example:
1868 definition "K x _ = x"
1870 inductive conj for A B
1871 where "A ==> B ==> conj A B"
1873 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1874 the current context. Print mode "no_abbrevs" prevents inversion of
1875 abbreviations on output.
1877 * Isar/locales: improved parameter handling: use of locales "var" and
1878 "struct" no longer necessary; - parameter renamings are no longer
1879 required to be injective. For example, this allows to define
1880 endomorphisms as locale endom = homom mult mult h.
1882 * Isar/locales: changed the way locales with predicates are defined.
1883 Instead of accumulating the specification, the imported expression is
1884 now an interpretation. INCOMPATIBILITY: different normal form of
1885 locale expressions. In particular, in interpretations of locales with
1886 predicates, goals repesenting already interpreted fragments are not
1887 removed automatically. Use methods `intro_locales' and
1888 `unfold_locales'; see below.
1890 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1891 provide backward reasoning on locales predicates. The methods are
1892 aware of interpretations and discharge corresponding goals.
1893 `intro_locales' is less aggressive then `unfold_locales' and does not
1894 unfold predicates to assumptions.
1896 * Isar/locales: the order in which locale fragments are accumulated
1897 has changed. This enables to override declarations from fragments due
1898 to interpretations -- for example, unwanted simp rules.
1900 * Isar/locales: interpretation in theories and proof contexts has been
1901 extended. One may now specify (and prove) equations, which are
1902 unfolded in interpreted theorems. This is useful for replacing
1903 defined concepts (constants depending on locale parameters) by
1904 concepts already existing in the target context. Example:
1906 interpretation partial_order ["op <= :: [int, int] => bool"]
1907 where "partial_order.less (op <=) (x::int) y = (x < y)"
1909 Typically, the constant `partial_order.less' is created by a
1910 definition specification element in the context of locale
1913 * Method "induct": improved internal context management to support
1914 local fixes and defines on-the-fly. Thus explicit meta-level
1915 connectives !! and ==> are rarely required anymore in inductive goals
1916 (using object-logic connectives for this purpose has been long
1917 obsolete anyway). Common proof patterns are explained in
1918 src/HOL/Induct/Common_Patterns.thy, see also
1919 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1922 * Method "induct": improved handling of simultaneous goals. Instead of
1923 introducing object-level conjunction, the statement is now split into
1924 several conclusions, while the corresponding symbolic cases are nested
1925 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1926 see src/HOL/Induct/Common_Patterns.thy, for example.
1928 * Method "induct": mutual induction rules are now specified as a list
1929 of rule sharing the same induction cases. HOL packages usually provide
1930 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1931 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1932 mutual induction rules differently, i.e. like this:
1934 (induct rule: foo_bar.inducts)
1935 (induct set: foo bar)
1936 (induct pred: foo bar)
1937 (induct type: foo bar)
1939 The ML function ProjectRule.projections turns old-style rules into the
1942 * Method "coinduct": dual of induction, see
1943 src/HOL/Library/Coinductive_List.thy for various examples.
1945 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1946 considered a legacy feature.
1948 * Attribute "symmetric" produces result with standardized schematic
1949 variables (index 0). Potential INCOMPATIBILITY.
1951 * Simplifier: by default the simplifier trace only shows top level
1952 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1953 default. Thus there is less danger of being flooded by the trace. The
1954 trace indicates where parts have been suppressed.
1956 * Provers/classical: removed obsolete classical version of elim_format
1957 attribute; classical elim/dest rules are now treated uniformly when
1958 manipulating the claset.
1960 * Provers/classical: stricter checks to ensure that supplied intro,
1961 dest and elim rules are well-formed; dest and elim rules must have at
1964 * Provers/classical: attributes dest/elim/intro take an optional
1965 weight argument for the rule (just as the Pure versions). Weights are
1966 ignored by automated tools, but determine the search order of single
1969 * Syntax: input syntax now supports dummy variable binding "%_. b",
1970 where the body does not mention the bound variable. Note that dummy
1971 patterns implicitly depend on their context of bounds, which makes
1972 "{_. _}" match any set comprehension as expected. Potential
1973 INCOMPATIBILITY -- parse translations need to cope with syntactic
1974 constant "_idtdummy" in the binding position.
1976 * Syntax: removed obsolete syntactic constant "_K" and its associated
1977 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1978 for example "A -> B" => "Pi A (%_. B)".
1980 * Pure: 'class_deps' command visualizes the subclass relation, using
1981 the graph browser tool.
1983 * Pure: 'print_theory' now suppresses certain internal declarations by
1984 default; use '!' option for full details.
1989 * Method "metis" proves goals by applying the Metis general-purpose
1990 resolution prover (see also http://gilith.com/software/metis/).
1991 Examples are in the directory MetisExamples. WARNING: the
1992 Isabelle/HOL-Metis integration does not yet work properly with
1995 * Command 'sledgehammer' invokes external automatic theorem provers as
1996 background processes. It generates calls to the "metis" method if
1997 successful. These can be pasted into the proof. Users do not have to
1998 wait for the automatic provers to return. WARNING: does not really
1999 work with multi-threading.
2001 * New "auto_quickcheck" feature tests outermost goal statements for
2002 potential counter-examples. Controlled by ML references
2003 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2004 5000 milliseconds). Fails silently if statements is outside of
2005 executable fragment, or any other codgenerator problem occurs.
2007 * New constant "undefined" with axiom "undefined x = undefined".
2009 * Added class "HOL.eq", allowing for code generation with polymorphic
2012 * Some renaming of class constants due to canonical name prefixing in
2013 the new 'class' package:
2015 HOL.abs ~> HOL.abs_class.abs
2016 HOL.divide ~> HOL.divide_class.divide
2017 0 ~> HOL.zero_class.zero
2018 1 ~> HOL.one_class.one
2019 op + ~> HOL.plus_class.plus
2020 op - ~> HOL.minus_class.minus
2021 uminus ~> HOL.minus_class.uminus
2022 op * ~> HOL.times_class.times
2023 op < ~> HOL.ord_class.less
2024 op <= > HOL.ord_class.less_eq
2025 Nat.power ~> Power.power_class.power
2026 Nat.size ~> Nat.size_class.size
2027 Numeral.number_of ~> Numeral.number_class.number_of
2028 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2029 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2030 Orderings.min ~> Orderings.ord_class.min
2031 Orderings.max ~> Orderings.ord_class.max
2032 Divides.op div ~> Divides.div_class.div
2033 Divides.op mod ~> Divides.div_class.mod
2034 Divides.op dvd ~> Divides.div_class.dvd
2036 INCOMPATIBILITY. Adaptions may be required in the following cases:
2038 a) User-defined constants using any of the names "plus", "minus",
2039 "times", "less" or "less_eq". The standard syntax translations for
2040 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2043 b) Variables named "plus", "minus", "times", "less", "less_eq"
2044 INCOMPATIBILITY: use more specific names.
2046 c) Permutative equations (e.g. "a + b = b + a")
2047 Since the change of names also changes the order of terms, permutative
2048 rewrite rules may get applied in a different order. Experience shows
2049 that this is rarely the case (only two adaptions in the whole Isabelle
2050 distribution). INCOMPATIBILITY: rewrite proofs
2052 d) ML code directly refering to constant names
2053 This in general only affects hand-written proof tactics, simprocs and
2054 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2055 Consider using @{const_name} antiquotation.
2057 * New class "default" with associated constant "default".
2059 * Function "sgn" is now overloaded and available on int, real, complex
2060 (and other numeric types), using class "sgn". Two possible defs of
2061 sgn are given as equational assumptions in the classes sgn_if and
2062 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2065 * Locale "partial_order" now unified with class "order" (cf. theory
2066 Orderings), added parameter "less". INCOMPATIBILITY.
2068 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2069 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2070 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2072 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2073 changed order of proof goals in instance proofs.
2075 * The transitivity reasoner for partial and linear orders is set up
2076 for classes "order" and "linorder". Instances of the reasoner are available
2077 in all contexts importing or interpreting the corresponding locales.
2078 Method "order" invokes the reasoner separately; the reasoner
2079 is also integrated with the Simplifier as a solver. Diagnostic
2080 command 'print_orders' shows the available instances of the reasoner
2081 in the current context.
2083 * Localized monotonicity predicate in theory "Orderings"; integrated
2084 lemmas max_of_mono and min_of_mono with this predicate.
2087 * Formulation of theorem "dense" changed slightly due to integration
2088 with new class dense_linear_order.
2090 * Uniform lattice theory development in HOL.
2092 constants "meet" and "join" now named "inf" and "sup"
2093 constant "Meet" now named "Inf"
2095 classes "meet_semilorder" and "join_semilorder" now named
2096 "lower_semilattice" and "upper_semilattice"
2097 class "lorder" now named "lattice"
2098 class "comp_lat" now named "complete_lattice"
2100 Instantiation of lattice classes allows explicit definitions
2101 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2103 INCOMPATIBILITY. Theorem renames:
2105 meet_left_le ~> inf_le1
2106 meet_right_le ~> inf_le2
2107 join_left_le ~> sup_ge1
2108 join_right_le ~> sup_ge2
2109 meet_join_le ~> inf_sup_ord
2112 le_meet ~> le_inf_iff
2113 le_join ~> ge_sup_conv
2114 meet_idempotent ~> inf_idem
2115 join_idempotent ~> sup_idem
2116 meet_comm ~> inf_commute
2117 join_comm ~> sup_commute
2118 meet_leI1 ~> le_infI1
2119 meet_leI2 ~> le_infI2
2120 le_joinI1 ~> le_supI1
2121 le_joinI2 ~> le_supI2
2122 meet_assoc ~> inf_assoc
2123 join_assoc ~> sup_assoc
2124 meet_left_comm ~> inf_left_commute
2125 meet_left_idempotent ~> inf_left_idem
2126 join_left_comm ~> sup_left_commute
2127 join_left_idempotent ~> sup_left_idem
2130 le_def_meet ~> le_iff_inf
2131 le_def_join ~> le_iff_sup
2132 join_absorp2 ~> sup_absorb2
2133 join_absorp1 ~> sup_absorb1
2134 meet_absorp1 ~> inf_absorb1
2135 meet_absorp2 ~> inf_absorb2
2136 meet_join_absorp ~> inf_sup_absorb
2137 join_meet_absorp ~> sup_inf_absorb
2138 distrib_join_le ~> distrib_sup_le
2139 distrib_meet_le ~> distrib_inf_le
2141 add_meet_distrib_left ~> add_inf_distrib_left
2142 add_join_distrib_left ~> add_sup_distrib_left
2143 is_join_neg_meet ~> is_join_neg_inf
2144 is_meet_neg_join ~> is_meet_neg_sup
2145 add_meet_distrib_right ~> add_inf_distrib_right
2146 add_join_distrib_right ~> add_sup_distrib_right
2147 add_meet_join_distribs ~> add_sup_inf_distribs
2148 join_eq_neg_meet ~> sup_eq_neg_inf
2149 meet_eq_neg_join ~> inf_eq_neg_sup
2150 add_eq_meet_join ~> add_eq_inf_sup
2151 meet_0_imp_0 ~> inf_0_imp_0
2152 join_0_imp_0 ~> sup_0_imp_0
2153 meet_0_eq_0 ~> inf_0_eq_0
2154 join_0_eq_0 ~> sup_0_eq_0
2155 neg_meet_eq_join ~> neg_inf_eq_sup
2156 neg_join_eq_meet ~> neg_sup_eq_inf
2157 join_eq_if ~> sup_eq_if
2159 mono_meet ~> mono_inf
2160 mono_join ~> mono_sup
2161 meet_bool_eq ~> inf_bool_eq
2162 join_bool_eq ~> sup_bool_eq
2163 meet_fun_eq ~> inf_fun_eq
2164 join_fun_eq ~> sup_fun_eq
2165 meet_set_eq ~> inf_set_eq
2166 join_set_eq ~> sup_set_eq
2167 meet1_iff ~> inf1_iff
2168 meet2_iff ~> inf2_iff
2177 join1_iff ~> sup1_iff
2178 join2_iff ~> sup2_iff
2188 is_meet_Meet ~> is_meet_Inf
2189 Meet_bool_def ~> Inf_bool_def
2190 Meet_fun_def ~> Inf_fun_def
2191 Meet_greatest ~> Inf_greatest
2192 Meet_lower ~> Inf_lower
2193 Meet_set_def ~> Inf_set_def
2196 Sup_bool_eq ~> Sup_bool_def
2197 Sup_fun_eq ~> Sup_fun_def
2198 Sup_set_eq ~> Sup_set_def
2200 listsp_meetI ~> listsp_infI
2201 listsp_meet_eq ~> listsp_inf_eq
2206 * Added syntactic class "size"; overloaded constant "size" now has
2207 type "'a::size ==> bool"
2209 * Internal reorganisation of `size' of datatypes: size theorems
2210 "foo.size" are no longer subsumed by "foo.simps" (but are still
2211 simplification rules by default!); theorems "prod.size" now named
2214 * Class "div" now inherits from class "times" rather than "type".
2217 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2218 Linorder etc. have disappeared; operations defined in terms of
2219 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2221 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2223 * HOL-Word: New extensive library and type for generic, fixed size
2224 machine words, with arithemtic, bit-wise, shifting and rotating
2225 operations, reflection into int, nat, and bool lists, automation for
2226 linear arithmetic (by automatic reflection into nat or int), including
2227 lemmas on overflow and monotonicity. Instantiated to all appropriate
2228 arithmetic type classes, supporting automatic simplification of
2229 numerals on all operations.
2231 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2233 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2235 * Code generator library theories:
2236 - Code_Integer represents HOL integers by big integer literals in target
2238 - Code_Char represents HOL characters by character literals in target
2240 - Code_Char_chr like Code_Char, but also offers treatment of character
2241 codes; includes Code_Integer.
2242 - Executable_Set allows to generate code for finite sets using lists.
2243 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2245 - Executable_Real implements a subset of real numbers, namly those
2246 representable by rational numbers.
2247 - Efficient_Nat implements natural numbers by integers, which in general will
2248 result in higher efficency; pattern matching with 0/Suc is eliminated;
2249 includes Code_Integer.
2250 - Code_Index provides an additional datatype index which is mapped to
2251 target-language built-in integers.
2252 - Code_Message provides an additional datatype message_string which is isomorphic to
2253 strings; messages are mapped to target-language strings.
2255 * New package for inductive predicates
2257 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2260 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2261 for z_1 :: U_1 and ... and z_n :: U_m
2263 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2266 with full support for type-inference, rather than
2268 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2270 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2271 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2273 inductive "s z_1 ... z_m"
2275 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2278 For backward compatibility, there is a wrapper allowing inductive
2279 sets to be defined with the new package via
2282 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2283 for z_1 :: U_1 and ... and z_n :: U_m
2285 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2291 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2292 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2293 for z_1 :: U_1 and ... and z_n :: U_m
2295 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2296 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2299 if the additional syntax "p ..." is required.
2301 Numerous examples can be found in the subdirectories src/HOL/Auth,
2302 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2306 - Since declaration and definition of inductive sets or predicates
2307 is no longer separated, abbreviations involving the newly
2308 introduced sets or predicates must be specified together with the
2309 introduction rules after the 'where' keyword (see above), rather
2310 than before the actual inductive definition.
2312 - The variables in induction and elimination rules are now
2313 quantified in the order of their occurrence in the introduction
2314 rules, rather than in alphabetical order. Since this may break
2315 some proofs, these proofs either have to be repaired, e.g. by
2316 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2317 statements of the form
2319 case (rule_i a_i_1 ... a_i_{k_i})
2321 or the old order of quantification has to be restored by explicitly adding
2322 meta-level quantifiers in the introduction rules, i.e.
2324 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2326 - The format of the elimination rules is now
2328 p z_1 ... z_m x_1 ... x_n ==>
2329 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2334 (x_1, ..., x_n) : s z_1 ... z_m ==>
2335 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2338 for sets rather than
2340 x : s z_1 ... z_m ==>
2341 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2344 This may require terms in goals to be expanded to n-tuples
2345 (e.g. using case_tac or simplification with the split_paired_all
2346 rule) before the above elimination rule is applicable.
2348 - The elimination or case analysis rules for (mutually) inductive
2349 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2350 list of rules "p_1_..._p_k.elims" is no longer available.
2352 * New package "function"/"fun" for general recursive functions,
2353 supporting mutual and nested recursion, definitions in local contexts,
2354 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2355 for small examples, and the separate tutorial on the function
2356 package. The old recdef "package" is still available as before, but
2357 users are encouraged to use the new package.
2359 * Method "lexicographic_order" automatically synthesizes termination
2360 relations as lexicographic combinations of size measures.
2362 * Case-expressions allow arbitrary constructor-patterns (including
2363 "_") and take their order into account, like in functional
2364 programming. Internally, this is translated into nested
2365 case-expressions; missing cases are added and mapped to the predefined
2366 constant "undefined". In complicated cases printing may no longer show
2367 the original input but the internal form. Lambda-abstractions allow
2368 the same form of pattern matching: "% pat1 => e1 | ..." is an
2369 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2372 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2373 is an abbreviation for "of_nat :: nat => int". The simplification
2374 rules for "of_nat" have been changed to work like "int" did
2375 previously. Potential INCOMPATIBILITY:
2376 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2377 - of_nat_diff and of_nat_mult are no longer default simp rules
2379 * Method "algebra" solves polynomial equations over (semi)rings using
2380 Groebner bases. The (semi)ring structure is defined by locales and the
2381 tool setup depends on that generic context. Installing the method for
2382 a specific type involves instantiating the locale and possibly adding
2383 declarations for computation on the coefficients. The method is
2384 already instantiated for natural numbers and for the axiomatic class
2385 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2386 CALCULEMUS 2007 for the general principles underlying this
2387 architecture of context-aware proof-tools.
2389 * Method "ferrack" implements quantifier elimination over
2390 special-purpose dense linear orders using locales (analogous to
2391 "algebra"). The method is already installed for class
2392 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2395 * Former constant "List.op @" now named "List.append". Use ML
2396 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2397 circumvent possible incompatibilities when working on ML level.
2399 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
2401 * New function listsum :: 'a list => 'a for arbitrary monoids.
2402 Special syntax: "SUM x <- xs. f x" (and latex variants)
2404 * New syntax for Haskell-like list comprehension (input only), eg.
2405 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
2407 * The special syntax for function "filter" has changed from [x :
2408 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
2409 comprehension syntax, and for uniformity. INCOMPATIBILITY.
2411 * [a..b] is now defined for arbitrary linear orders. It used to be
2412 defined on nat only, as an abbreviation for [a..<Suc b]
2415 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
2417 * New functions "sorted" and "sort" in src/HOL/List.thy.
2419 * New lemma collection field_simps (an extension of ring_simps) for
2420 manipulating (in)equations involving division. Multiplies with all
2421 denominators that can be proved to be non-zero (in equations) or
2422 positive/negative (in inequations).
2424 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
2425 have been improved and renamed to ring_simps, group_simps and
2426 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
2427 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
2429 * Theory Library/Commutative_Ring: switched from recdef to function
2430 package; constants add, mul, pow now curried. Infix syntax for
2431 algebraic operations.
2433 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
2436 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
2439 * HOL/records: generalised field-update to take a function on the
2440 field rather than the new value: r(|A := x|) is translated to A_update
2441 (K x) r The K-combinator that is internally used is called K_record.
2442 INCOMPATIBILITY: Usage of the plain update functions has to be
2445 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
2446 * x = 0, which are required for a semiring. Richer structures do not
2447 inherit from semiring_0 anymore, because this property is a theorem
2448 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
2449 there is more to prove, but this is mostly trivial.
2451 * Class "recpower" is generalized to arbitrary monoids, not just
2452 commutative semirings. INCOMPATIBILITY: may need to incorporate
2453 commutativity or semiring properties additionally.
2455 * Constant "List.list_all2" in List.thy now uses authentic syntax.
2456 INCOMPATIBILITY: translations containing list_all2 may go wrong,
2457 better use 'abbreviation'.
2459 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
2461 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
2462 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
2463 significant changes for setting up numeral syntax for types:
2464 - New constants Numeral.pred and Numeral.succ instead
2465 of former Numeral.bin_pred and Numeral.bin_succ.
2466 - Use integer operations instead of bin_add, bin_mult and so on.
2467 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
2468 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
2470 See src/HOL/Integ/IntArith.thy for an example setup.
2472 * Command 'normal_form' computes the normal form of a term that may
2473 contain free variables. For example ``normal_form "rev [a, b, c]"''
2474 produces ``[b, c, a]'' (without proof). This command is suitable for
2475 heavy-duty computations because the functions are compiled to ML
2476 first. Correspondingly, a method "normalization" is provided. See
2477 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
2479 * Alternative iff syntax "A <-> B" for equality on bool (with priority
2480 25 like -->); output depends on the "iff" print_mode, the default is
2481 "A = B" (with priority 50).
2483 * Relations less (<) and less_eq (<=) are also available on type bool.
2484 Modified syntax to disallow nesting without explicit parentheses,
2485 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
2488 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
2490 * Relation composition operator "op O" now has precedence 75 and binds
2491 stronger than union and intersection. INCOMPATIBILITY.
2493 * The old set interval syntax "{m..n(}" (and relatives) has been
2494 removed. Use "{m..<n}" (and relatives) instead.
2496 * In the context of the assumption "~(s = t)" the Simplifier rewrites
2497 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
2498 ``declare [[simproc del: neq]]''.
2500 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
2503 * Theorem Cons_eq_map_conv no longer declared as "simp".
2505 * Theorem setsum_mult renamed to setsum_right_distrib.
2507 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
2510 * Reimplemented methods "sat" and "satx", with several improvements:
2511 goals no longer need to be stated as "<prems> ==> False", equivalences
2512 (i.e. "=" on type bool) are handled, variable names of the form
2513 "lit_<n>" are no longer reserved, significant speedup.
2515 * Methods "sat" and "satx" can now replay MiniSat proof traces.
2516 zChaff is still supported as well.
2518 * 'inductive' and 'datatype': provide projections of mutual rules,
2519 bundled as foo_bar.inducts;
2521 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
2524 * Library: moved theory Accessible_Part to main HOL.
2526 * Library: added theory Coinductive_List of potentially infinite lists
2527 as greatest fixed-point.
2529 * Library: added theory AssocList which implements (finite) maps as
2532 * Method "evaluation" solves goals (i.e. a boolean expression)
2533 efficiently by compiling it to ML. The goal is "proved" (via an
2534 oracle) if it evaluates to True.
2536 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
2537 also when invoked by the simplifier. This results in the Simplifier
2538 being more powerful on arithmetic goals. INCOMPATIBILITY.
2539 Configuration option fast_arith_split_limit=0 recovers the old
2542 * Support for hex (0x20) and binary (0b1001) numerals.
2544 * New method: reify eqs (t), where eqs are equations for an
2545 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
2546 parameter, computes a term s::'b and a list xs::'a list and proves the
2547 theorem I xs s = t. This is also known as reification or quoting. The
2548 resulting theorem is applied to the subgoal to substitute t with I xs
2549 s. If t is omitted, the subgoal itself is reified.
2551 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
2552 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
2553 where f is supposed to be a computable function (in the sense of code
2554 generattion). The method uses reify to compute s and xs as above then
2555 applies corr_thm and uses normalization by evaluation to "prove" f s =
2556 r and finally gets the theorem t = r, which is again applied to the
2557 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
2559 * Reflection: Automatic reification now handels binding, an example is
2560 available in src/HOL/ex/ReflectionEx.thy
2562 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
2563 command 'statespace' that is similar to 'record', but introduces an
2564 abstract specification based on the locale infrastructure instead of
2565 HOL types. This leads to extra flexibility in composing state spaces,
2566 in particular multiple inheritance and renaming of components.
2571 * Hyperreal: Functions root and sqrt are now defined on negative real
2572 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
2573 Nonnegativity side conditions have been removed from many lemmas, so
2574 that more subgoals may now be solved by simplification; potential
2577 * Real: new type classes formalize real normed vector spaces and
2578 algebras, using new overloaded constants scaleR :: real => 'a => 'a
2579 and norm :: 'a => real.
2581 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
2582 reals into other types. The overloaded constant Reals :: 'a set is now
2583 defined as range of_real; potential INCOMPATIBILITY.
2585 * Real: proper support for ML code generation, including 'quickcheck'.
2586 Reals are implemented as arbitrary precision rationals.
2588 * Hyperreal: Several constants that previously worked only for the
2589 reals have been generalized, so they now work over arbitrary vector
2590 spaces. Type annotations may need to be added in some cases; potential
2593 Infinitesimal :: ('a::real_normed_vector) star set
2594 HFinite :: ('a::real_normed_vector) star set
2595 HInfinite :: ('a::real_normed_vector) star set
2596 approx :: ('a::real_normed_vector) star => 'a star => bool
2597 monad :: ('a::real_normed_vector) star => 'a star set
2598 galaxy :: ('a::real_normed_vector) star => 'a star set
2599 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
2600 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
2601 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
2602 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
2603 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
2604 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
2605 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
2606 sgn :: 'a::real_normed_vector => 'a
2607 exp :: 'a::{recpower,real_normed_field,banach} => 'a
2609 * Complex: Some complex-specific constants are now abbreviations for
2610 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
2611 hnorm. Other constants have been entirely removed in favor of the
2612 polymorphic versions (INCOMPATIBILITY):
2616 HInfinite <-- CInfinite
2617 Infinitesimal <-- CInfinitesimal
2620 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
2621 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
2622 (ns)deriv <-- (ns)cderiv
2627 * Formalisation of ideals and the quotient construction over rings.
2629 * Order and lattice theory no longer based on records.
2632 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
2633 greatest_closed. INCOMPATIBILITY.
2635 * Method algebra is now set up via an attribute. For examples see
2636 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
2637 of algebraic structures.
2639 * Renamed theory CRing to Ring.
2644 * Substantial, yet incomplete support for nominal datatypes (binding
2645 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
2646 src/HOL/Nominal/Examples. Prospective users should consult
2647 http://isabelle.in.tum.de/nominal/
2652 * ML basics: just one true type int, which coincides with IntInf.int
2655 * ML within Isar: antiquotations allow to embed statically-checked
2656 formal entities in the source, referring to the context available at
2657 compile-time. For example:
2659 ML {* @{sort "{zero,one}"} *}
2660 ML {* @{typ "'a => 'b"} *}
2661 ML {* @{term "%x. x"} *}
2662 ML {* @{prop "x == y"} *}
2663 ML {* @{ctyp "'a => 'b"} *}
2664 ML {* @{cterm "%x. x"} *}
2665 ML {* @{cprop "x == y"} *}
2666 ML {* @{thm asm_rl} *}
2667 ML {* @{thms asm_rl} *}
2668 ML {* @{type_name c} *}
2669 ML {* @{type_syntax c} *}
2670 ML {* @{const_name c} *}
2671 ML {* @{const_syntax c} *}
2674 ML {* @{theory Pure} *}
2675 ML {* @{theory_ref} *}
2676 ML {* @{theory_ref Pure} *}
2679 ML {* @{clasimpset} *}
2681 The same works for sources being ``used'' within an Isar context.
2683 * ML in Isar: improved error reporting; extra verbosity with
2684 ML_Context.trace enabled.
2686 * Pure/General/table.ML: the join operations now works via exceptions
2687 DUP/SAME instead of type option. This is simpler in simple cases, and
2688 admits slightly more efficient complex applications.
2690 * Pure: 'advanced' translation functions (parse_translation etc.) now
2691 use Context.generic instead of just theory.
2693 * Pure: datatype Context.generic joins theory/Proof.context and
2694 provides some facilities for code that works in either kind of
2695 context, notably GenericDataFun for uniform theory and proof data.
2697 * Pure: simplified internal attribute type, which is now always
2698 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
2699 local (Proof.context) attributes have been discontinued, while
2700 minimizing code duplication. Thm.rule_attribute and
2701 Thm.declaration_attribute build canonical attributes; see also structure
2702 Context for further operations on Context.generic, notably
2703 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
2704 declarations and definitions.
2706 * Context data interfaces (Theory/Proof/GenericDataFun): removed
2707 name/print, uninitialized data defaults to ad-hoc copy of empty value,
2708 init only required for impure data. INCOMPATIBILITY: empty really need
2709 to be empty (no dependencies on theory content!)
2711 * Pure/kernel: consts certification ignores sort constraints given in
2712 signature declarations. (This information is not relevant to the
2713 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
2714 potential INCOMPATIBILITY.
2716 * Pure: axiomatic type classes are now purely definitional, with
2717 explicit proofs of class axioms and super class relations performed
2718 internally. See Pure/axclass.ML for the main internal interfaces --
2719 notably AxClass.define_class supercedes AxClass.add_axclass, and
2720 AxClass.axiomatize_class/classrel/arity supersede
2721 Sign.add_classes/classrel/arities.
2723 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
2724 global/local versions on theory vs. Proof.context have been
2725 discontinued; Attrib.syntax and Method.syntax have been adapted
2726 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
2727 attributes, methods, etc.
2729 * Pure: several functions of signature "... -> theory -> theory * ..."
2730 have been reoriented to "... -> theory -> ... * theory" in order to
2731 allow natural usage in combination with the ||>, ||>>, |-> and
2732 fold_map combinators.
2734 * Pure: official theorem names (closed derivations) and additional
2735 comments (tags) are now strictly separate. Name hints -- which are
2736 maintained as tags -- may be attached any time without affecting the
2739 * Pure: primitive rule lift_rule now takes goal cterm instead of an
2740 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
2741 achieve the old behaviour.
2743 * Pure: the "Goal" constant is now called "prop", supporting a
2744 slightly more general idea of ``protecting'' meta-level rule
2747 * Pure: Logic.(un)varify only works in a global context, which is now
2748 enforced instead of silently assumed. INCOMPATIBILITY, may use
2749 Logic.legacy_(un)varify as temporary workaround.
2751 * Pure: structure Name provides scalable operations for generating
2752 internal variable names, notably Name.variants etc. This replaces
2753 some popular functions from term.ML:
2755 Term.variant -> Name.variant
2756 Term.variantlist -> Name.variant_list
2757 Term.invent_names -> Name.invent_list
2759 Note that low-level renaming rarely occurs in new code -- operations
2760 from structure Variable are used instead (see below).
2762 * Pure: structure Variable provides fundamental operations for proper
2763 treatment of fixed/schematic variables in a context. For example,
2764 Variable.import introduces fixes for schematics of given facts and
2765 Variable.export reverses the effect (up to renaming) -- this replaces
2766 various freeze_thaw operations.
2768 * Pure: structure Goal provides simple interfaces for
2769 init/conclude/finish and tactical prove operations (replacing former
2770 Tactic.prove). Goal.prove is the canonical way to prove results
2771 within a given context; Goal.prove_global is a degraded version for
2772 theory level goals, including a global Drule.standard. Note that
2773 OldGoals.prove_goalw_cterm has long been obsolete, since it is
2774 ill-behaved in a local proof context (e.g. with local fixes/assumes or
2775 in a locale context).
2777 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
2778 and type checking (Syntax.check_term etc.), with common combinations
2779 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
2780 which are considered legacy and await removal.
2782 * Pure/Syntax: generic interfaces for type unchecking
2783 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
2784 with common combinations (Syntax.pretty_term, Syntax.string_of_term
2785 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
2786 available for convenience, but refer to the very same operations using
2787 a mere theory instead of a full context.
2789 * Isar: simplified treatment of user-level errors, using exception
2790 ERROR of string uniformly. Function error now merely raises ERROR,
2791 without any side effect on output channels. The Isar toplevel takes
2792 care of proper display of ERROR exceptions. ML code may use plain
2793 handle/can/try; cat_error may be used to concatenate errors like this:
2795 ... handle ERROR msg => cat_error msg "..."
2797 Toplevel ML code (run directly or through the Isar toplevel) may be
2798 embedded into the Isar toplevel with exception display/debug like
2801 Isar.toplevel (fn () => ...)
2803 INCOMPATIBILITY, removed special transform_error facilities, removed
2804 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2805 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2806 -- use plain ERROR instead.
2808 * Isar: theory setup now has type (theory -> theory), instead of a
2809 list. INCOMPATIBILITY, may use #> to compose setup functions.
2811 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2812 ProofContext.debug/verbose flags.
2814 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2815 theory before entering a proof state. Transactions now always see a
2816 quasi-functional intermediate checkpoint, both in interactive and
2819 * Isar: simplified interfaces for outer syntax. Renamed
2820 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2821 OuterSyntax.add_parsers -- this functionality is now included in
2822 OuterSyntax.command etc. INCOMPATIBILITY.
2824 * Simplifier: the simpset of a running simplification process now
2825 contains a proof context (cf. Simplifier.the_context), which is the
2826 very context that the initial simpset has been retrieved from (by
2827 simpset_of/local_simpset_of). Consequently, all plug-in components
2828 (solver, looper etc.) may depend on arbitrary proof data.
2830 * Simplifier.inherit_context inherits the proof context (plus the
2831 local bounds) of the current simplification process; any simproc
2832 etc. that calls the Simplifier recursively should do this! Removed
2833 former Simplifier.inherit_bounds, which is already included here --
2834 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2835 specify an explicit context using Simplifier.context/theory_context.
2837 * Simplifier/Classical Reasoner: more abstract interfaces
2838 change_simpset/claset for modifying the simpset/claset reference of a
2839 theory; raw versions simpset/claset_ref etc. have been discontinued --
2842 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2848 * settings: the default heap location within ISABELLE_HOME_USER now
2849 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2850 Isabelle installations.
2852 * isabelle-process: option -S (secure mode) disables some critical
2853 operations, notably runtime compilation and evaluation of ML source
2856 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2858 * Support for parallel execution, using native multicore support of
2859 Poly/ML 5.1. The theory loader exploits parallelism when processing
2860 independent theories, according to the given theory header
2861 specifications. The maximum number of worker threads is specified via
2862 usedir option -M or the "max-threads" setting in Proof General. A
2863 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2864 to 6 on a 8-core machine. User-code needs to observe certain
2865 guidelines for thread-safe programming, see appendix A in the Isar
2866 Implementation manual.
2870 New in Isabelle2005 (October 2005)
2871 ----------------------------------
2875 * Theory headers: the new header syntax for Isar theories is
2878 imports <theory1> ... <theoryN>
2879 uses <file1> ... <fileM>
2882 where the 'uses' part is optional. The previous syntax
2884 theory <name> = <theory1> + ... + <theoryN>:
2886 will disappear in the next release. Use isatool fixheaders to convert
2887 existing theory files. Note that there is no change in ancient
2888 non-Isar theories now, but these will disappear soon.
2890 * Theory loader: parent theories can now also be referred to via
2891 relative and absolute paths.
2893 * Command 'find_theorems' searches for a list of criteria instead of a
2894 list of constants. Known criteria are: intro, elim, dest, name:string,
2895 simp:term, and any term. Criteria can be preceded by '-' to select
2896 theorems that do not match. Intro, elim, dest select theorems that
2897 match the current goal, name:s selects theorems whose fully qualified
2898 name contain s, and simp:term selects all simplification rules whose
2899 lhs match term. Any other term is interpreted as pattern and selects
2900 all theorems matching the pattern. Available in ProofGeneral under
2901 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2903 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2905 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2906 matching the current goal as introduction rule and not having "HOL."
2907 in their name (i.e. not being defined in theory HOL).
2909 * Command 'thms_containing' has been discontinued in favour of
2910 'find_theorems'; INCOMPATIBILITY.
2912 * Communication with Proof General is now 8bit clean, which means that
2913 Unicode text in UTF-8 encoding may be used within theory texts (both
2914 formal and informal parts). Cf. option -U of the Isabelle Proof
2915 General interface. Here are some simple examples (cf. src/HOL/ex):
2917 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2918 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2920 * Improved efficiency of the Simplifier and, to a lesser degree, the
2921 Classical Reasoner. Typical big applications run around 2 times
2925 *** Document preparation ***
2927 * Commands 'display_drafts' and 'print_drafts' perform simple output
2928 of raw sources. Only those symbols that do not require additional
2929 LaTeX packages (depending on comments in isabellesym.sty) are
2930 displayed properly, everything else is left verbatim. isatool display
2931 and isatool print are used as front ends (these are subject to the
2932 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2934 * Command tags control specific markup of certain regions of text,
2935 notably folding and hiding. Predefined tags include "theory" (for
2936 theory begin and end), "proof" for proof commands, and "ML" for
2937 commands involving ML code; the additional tags "visible" and
2938 "invisible" are unused by default. Users may give explicit tag
2939 specifications in the text, e.g. ''by %invisible (auto)''. The
2940 interpretation of tags is determined by the LaTeX job during document
2941 preparation: see option -V of isatool usedir, or options -n and -t of
2942 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2945 Several document versions may be produced at the same time via isatool
2946 usedir (the generated index.html will link all of them). Typical
2947 specifications include ''-V document=theory,proof,ML'' to present
2948 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2949 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2950 these parts without any formal replacement text. The Isabelle site
2951 default settings produce ''document'' and ''outline'' versions as
2954 * Several new antiquotations:
2956 @{term_type term} prints a term with its type annotated;
2958 @{typeof term} prints the type of a term;
2960 @{const const} is the same as @{term const}, but checks that the
2961 argument is a known logical constant;
2963 @{term_style style term} and @{thm_style style thm} print a term or
2964 theorem applying a "style" to it
2968 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2969 definitions, equations, inequations etc., 'concl' printing only the
2970 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2971 to print the specified premise. TermStyle.add_style provides an ML
2972 interface for introducing further styles. See also the "LaTeX Sugar"
2973 document practical applications. The ML antiquotation prints
2974 type-checked ML expressions verbatim.
2976 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2977 and 'text' support optional locale specification '(in loc)', which
2978 specifies the default context for interpreting antiquotations. For
2979 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2981 * Option 'locale=NAME' of antiquotations specifies an alternative
2982 context interpreting the subsequent argument. For example: @{thm
2983 [locale=lattice] inf_assoc}.
2985 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2988 * Proper output of antiquotations for theory commands involving a
2989 proof context (such as 'locale' or 'theorem (in loc) ...').
2991 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2992 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2994 * isatool usedir: new option -C (default true) controls whether option
2995 -D should include a copy of the original document directory; -C false
2996 prevents unwanted effects such as copying of administrative CVS data.
3001 * Considerably improved version of 'constdefs' command. Now performs
3002 automatic type-inference of declared constants; additional support for
3003 local structure declarations (cf. locales and HOL records), see also
3004 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3005 sequential dependencies of definitions within a single 'constdefs'
3006 section; moreover, the declared name needs to be an identifier. If
3007 all fails, consider to fall back on 'consts' and 'defs' separately.
3009 * Improved indexed syntax and implicit structures. First of all,
3010 indexed syntax provides a notational device for subscripted
3011 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3012 expressions. Secondly, in a local context with structure
3013 declarations, number indexes \<^sub>n or the empty index (default
3014 number 1) refer to a certain fixed variable implicitly; option
3015 show_structs controls printing of implicit structures. Typical
3016 applications of these concepts involve record types and locales.
3018 * New command 'no_syntax' removes grammar declarations (and
3019 translations) resulting from the given syntax specification, which is
3020 interpreted in the same manner as for the 'syntax' command.
3022 * 'Advanced' translation functions (parse_translation etc.) may depend
3023 on the signature of the theory context being presently used for
3024 parsing/printing, see also isar-ref manual.
3026 * Improved 'oracle' command provides a type-safe interface to turn an
3027 ML expression of type theory -> T -> term into a primitive rule of
3028 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3029 is already included here); see also FOL/ex/IffExample.thy;
3032 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3033 before); "cI" is no longer bound, use "c.intro" instead.
3034 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3035 axclasses vs. locales.
3037 * Improved internal renaming of symbolic identifiers -- attach primes
3038 instead of base 26 numbers.
3040 * New flag show_question_marks controls printing of leading question
3041 marks in schematic variable names.
3043 * In schematic variable names, *any* symbol following \<^isub> or
3044 \<^isup> is now treated as part of the base name. For example, the
3045 following works without printing of awkward ".0" indexes:
3047 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3050 * Inner syntax includes (*(*nested*) comments*).
3052 * Pretty printer now supports unbreakable blocks, specified in mixfix
3053 annotations as "(00...)".
3055 * Clear separation of logical types and nonterminals, where the latter
3056 may only occur in 'syntax' specifications or type abbreviations.
3057 Before that distinction was only partially implemented via type class
3058 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3059 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3060 exotic syntax specifications may require further adaption
3061 (e.g. Cube/Cube.thy).
3063 * Removed obsolete type class "logic", use the top sort {} instead.
3064 Note that non-logical types should be declared as 'nonterminals'
3065 rather than 'types'. INCOMPATIBILITY for new object-logic
3068 * Attributes 'induct' and 'cases': type or set names may now be
3069 locally fixed variables as well.
3071 * Simplifier: can now control the depth to which conditional rewriting
3072 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3075 * Simplifier: simplification procedures may now take the current
3076 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3077 interface), which is very useful for calling the Simplifier
3078 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3079 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3080 low-level mk_simproc no longer applies Logic.varify internally, to
3081 allow for use in a context of fixed variables.
3083 * thin_tac now works even if the assumption being deleted contains !!
3084 or ==>. More generally, erule now works even if the major premise of
3085 the elimination rule contains !! or ==>.
3087 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3089 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3090 from Pure, which contains all common declarations already. Both
3091 theories are defined via plain Isabelle/Isar .thy files.
3092 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3093 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3094 use isatool fixcpure to adapt your theory and ML sources.
3096 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3097 selections of theorems in named facts via index ranges.
3099 * 'print_theorems': in theory mode, really print the difference
3100 wrt. the last state (works for interactive theory development only),
3101 in proof mode print all local facts (cf. 'print_facts');
3103 * 'hide': option '(open)' hides only base names.
3105 * More efficient treatment of intermediate checkpoints in interactive
3108 * Code generator is now invoked via code_module (incremental code
3109 generation) and code_library (modular code generation, ML structures
3110 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3111 must be quoted when used as identifiers.
3113 * New 'value' command for reading, evaluating and printing terms using
3114 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3115 quoted when used as identifier.
3120 * New commands for the interpretation of locale expressions in
3121 theories (1), locales (2) and proof contexts (3). These generate
3122 proof obligations from the expression specification. After the
3123 obligations have been discharged, theorems of the expression are added
3124 to the theory, target locale or proof context. The synopsis of the
3125 commands is a follows:
3127 (1) interpretation expr inst
3128 (2) interpretation target < expr
3129 (3) interpret expr inst
3131 Interpretation in theories and proof contexts require a parameter
3132 instantiation of terms from the current context. This is applied to
3133 specifications and theorems of the interpreted expression.
3134 Interpretation in locales only permits parameter renaming through the
3135 locale expression. Interpretation is smart in that interpretations
3136 that are active already do not occur in proof obligations, neither are
3137 instantiated theorems stored in duplicate. Use 'print_interps' to
3138 inspect active interpretations of a particular locale. For details,
3139 see the Isar Reference manual. Examples can be found in
3140 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3142 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3143 'interpret' instead.
3145 * New context element 'constrains' for adding type constraints to
3148 * Context expressions: renaming of parameters with syntax
3151 * Locale declaration: 'includes' disallowed.
3153 * Proper static binding of attribute syntax -- i.e. types / terms /
3154 facts mentioned as arguments are always those of the locale definition
3155 context, independently of the context of later invocations. Moreover,
3156 locale operations (renaming and type / term instantiation) are applied
3157 to attribute arguments as expected.
3159 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3160 actual attributes; rare situations may require Attrib.attribute to
3161 embed those attributes into Attrib.src that lack concrete syntax.
3162 Attribute implementations need to cooperate properly with the static
3163 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3164 Attrib.XXX_thm etc. already do the right thing without further
3165 intervention. Only unusual applications -- such as "where" or "of"
3166 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3167 on the context and the facts involved -- may have to assign parsed
3168 values to argument tokens explicitly.
3170 * Changed parameter management in theorem generation for long goal
3171 statements with 'includes'. INCOMPATIBILITY: produces a different
3172 theorem statement in rare situations.
3174 * Locale inspection command 'print_locale' omits notes elements. Use
3175 'print_locale!' to have them included in the output.
3180 * Provers/hypsubst.ML: improved version of the subst method, for
3181 single-step rewriting: it now works in bound variable contexts. New is
3182 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3183 rewrite a different subterm than the original subst method, which is
3184 still available as 'simplesubst'.
3186 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3189 * Provers/trancl.ML: new transitivity reasoner for transitive and
3190 reflexive-transitive closure of relations.
3192 * Provers/blast.ML: new reference depth_limit to make blast's depth
3193 limit (previously hard-coded with a value of 20) user-definable.
3195 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3196 is peformed already. Object-logics merely need to finish their
3197 initial simpset configuration as before. INCOMPATIBILITY.
3202 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3205 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3207 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3208 and x-symbol; use option '-m epsilon' to get it actually printed.
3209 Moreover, the mathematically important symbolic identifier \<epsilon>
3210 becomes available as variable, constant etc. INCOMPATIBILITY,
3212 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3213 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3214 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3215 support corresponding Isar calculations.
3217 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3220 * theory SetInterval: changed the syntax for open intervals:
3229 The old syntax is still supported but will disappear in the next
3230 release. For conversion use the following Emacs search and replace
3231 patterns (these are not perfect but work quite well):
3233 {)\([^\.]*\)\.\. -> {\1<\.\.}
3234 \.\.\([^(}]*\)(} -> \.\.<\1}
3236 * Theory Commutative_Ring (in Library): method comm_ring for proving
3237 equalities in commutative rings; method 'algebra' provides a generic
3240 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3241 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3242 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3245 Some new syntax forms are available:
3247 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3248 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3249 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3250 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3252 The latter form "\<Sum>x < k. e" used to be based on a separate
3253 function "Summation", which has been discontinued.
3255 * theory Finite_Set: in structured induction proofs, the insert case
3256 is now 'case (insert x F)' instead of the old counterintuitive 'case
3259 * The 'refute' command has been extended to support a much larger
3260 fragment of HOL, including axiomatic type classes, constdefs and
3261 typedefs, inductive datatypes and recursion.
3263 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3264 Requires zChaff with proof generation to be installed. See
3265 HOL/ex/SAT_Examples.thy for examples.
3267 * Datatype induction via method 'induct' now preserves the name of the
3268 induction variable. For example, when proving P(xs::'a list) by
3269 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3270 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3271 in unstructured proof scripts.
3273 * Reworked implementation of records. Improved scalability for
3274 records with many fields, avoiding performance problems for type
3275 inference. Records are no longer composed of nested field types, but
3276 of nested extension types. Therefore the record type only grows linear
3277 in the number of extensions and not in the number of fields. The
3278 top-level (users) view on records is preserved. Potential
3279 INCOMPATIBILITY only in strange cases, where the theory depends on the
3280 old record representation. The type generated for a record is called
3281 <record_name>_ext_type.
3283 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3284 proofs triggered by a record definition or a simproc (if
3285 quick_and_dirty is enabled). Definitions of large records can take
3288 New simproc record_upd_simproc for simplification of multiple record
3289 updates enabled by default. Moreover, trivial updates are also
3290 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3291 occasionally, since simplification is more powerful by default.
3293 * typedef: proper support for polymorphic sets, which contain extra
3294 type-variables in the term.
3296 * Simplifier: automatically reasons about transitivity chains
3297 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3298 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3299 old proofs break occasionally as simplification may now solve more
3300 goals than previously.
3302 * Simplifier: converts x <= y into x = y if assumption y <= x is
3303 present. Works for all partial orders (class "order"), in particular
3304 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3307 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3308 bound variable or a constant then the let is unfolded. Otherwise
3309 first a is simplified to b, and then f b is simplified to g. If
3310 possible we abstract b from g arriving at "let x = b in h x",
3311 otherwise we unfold the let and arrive at g. The simproc can be
3312 enabled/disabled by the reference use_let_simproc. Potential
3313 INCOMPATIBILITY since simplification is more powerful by default.
3315 * Classical reasoning: the meson method now accepts theorems as arguments.
3317 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3318 jobs to provide advice on the provability of subgoals.
3320 * Theory OrderedGroup and Ring_and_Field: various additions and
3321 improvements to faciliate calculations involving equalities and
3324 The following theorems have been eliminated or modified
3327 abs_eq now named abs_of_nonneg
3328 abs_of_ge_0 now named abs_of_nonneg
3329 abs_minus_eq now named abs_of_nonpos
3330 imp_abs_id now named abs_of_nonneg
3331 imp_abs_neg_id now named abs_of_nonpos
3332 mult_pos now named mult_pos_pos
3333 mult_pos_le now named mult_nonneg_nonneg
3334 mult_pos_neg_le now named mult_nonneg_nonpos
3335 mult_pos_neg2_le now named mult_nonneg_nonpos2
3336 mult_neg now named mult_neg_neg
3337 mult_neg_le now named mult_nonpos_nonpos
3339 * The following lemmas in Ring_and_Field have been added to the simplifier:
3342 not_square_less_zero
3344 The following lemmas have been deleted from Real/RealPow:
3354 * Theory Parity: added rules for simplifying exponents.
3358 The following theorems have been eliminated or modified
3361 list_all_Nil now named list_all.simps(1)
3362 list_all_Cons now named list_all.simps(2)
3363 list_all_conv now named list_all_iff
3364 set_mem_eq now named mem_iff
3366 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3367 asymptotic "big O" calculations. See the notes in BigO.thy.
3372 * Theory RealDef: better support for embedding natural numbers and
3373 integers in the reals.
3375 The following theorems have been eliminated or modified
3378 exp_ge_add_one_self now requires no hypotheses
3379 real_of_int_add reversed direction of equality (use [symmetric])
3380 real_of_int_minus reversed direction of equality (use [symmetric])
3381 real_of_int_diff reversed direction of equality (use [symmetric])
3382 real_of_int_mult reversed direction of equality (use [symmetric])
3384 * Theory RComplete: expanded support for floor and ceiling functions.
3386 * Theory Ln is new, with properties of the natural logarithm
3388 * Hyperreal: There is a new type constructor "star" for making
3389 nonstandard types. The old type names are now type synonyms:
3393 hcomplex = complex star
3395 * Hyperreal: Many groups of similarly-defined constants have been
3396 replaced by polymorphic versions (INCOMPATIBILITY):
3398 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
3400 starset <-- starsetNat, starsetC
3401 *s* <-- *sNat*, *sc*
3402 starset_n <-- starsetNat_n, starsetC_n
3403 *sn* <-- *sNatn*, *scn*
3404 InternalSets <-- InternalNatSets, InternalCSets
3406 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3407 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
3408 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
3409 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
3410 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
3412 * Hyperreal: Many type-specific theorems have been removed in favor of
3413 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
3415 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
3416 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
3417 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
3418 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
3419 right_minus <-- hypreal_add_minus
3420 left_minus <-- {hypreal,hcomplex}_add_minus_left
3421 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
3422 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
3423 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
3424 mult_1_right <-- hcomplex_mult_one_right
3425 mult_zero_left <-- hcomplex_mult_zero_left
3426 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
3427 right_distrib <-- hypnat_add_mult_distrib2
3428 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
3429 right_inverse <-- hypreal_mult_inverse
3430 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
3431 order_refl <-- {hypreal,hypnat}_le_refl
3432 order_trans <-- {hypreal,hypnat}_le_trans
3433 order_antisym <-- {hypreal,hypnat}_le_anti_sym
3434 order_less_le <-- {hypreal,hypnat}_less_le
3435 linorder_linear <-- {hypreal,hypnat}_le_linear
3436 add_left_mono <-- {hypreal,hypnat}_add_left_mono
3437 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
3438 add_nonneg_nonneg <-- hypreal_le_add_order
3440 * Hyperreal: Separate theorems having to do with type-specific
3441 versions of constants have been merged into theorems that apply to the
3442 new polymorphic constants (INCOMPATIBILITY):
3444 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
3445 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
3446 STAR_Un <-- {STAR,NatStar,STARC}_Un
3447 STAR_Int <-- {STAR,NatStar,STARC}_Int
3448 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
3449 STAR_subset <-- {STAR,NatStar,STARC}_subset
3450 STAR_mem <-- {STAR,NatStar,STARC}_mem
3451 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
3452 STAR_diff <-- {STAR,STARC}_diff
3453 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
3454 STARC_hcomplex_of_complex}_image_subset
3455 starset_n_Un <-- starset{Nat,C}_n_Un
3456 starset_n_Int <-- starset{Nat,C}_n_Int
3457 starset_n_Compl <-- starset{Nat,C}_n_Compl
3458 starset_n_diff <-- starset{Nat,C}_n_diff
3459 InternalSets_Un <-- Internal{Nat,C}Sets_Un
3460 InternalSets_Int <-- Internal{Nat,C}Sets_Int
3461 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
3462 InternalSets_diff <-- Internal{Nat,C}Sets_diff
3463 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
3464 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
3465 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
3466 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
3467 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
3468 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3469 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
3470 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
3471 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
3472 starfun_diff <-- starfun{C,RC,CR}_diff
3473 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
3474 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
3475 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
3476 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
3477 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
3478 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
3479 starfun_Id <-- starfunC_Id
3480 starfun_approx <-- starfun{Nat,CR}_approx
3481 starfun_capprox <-- starfun{C,RC}_capprox
3482 starfun_abs <-- starfunNat_rabs
3483 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
3484 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
3485 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
3486 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
3487 starfun_add_capprox <-- starfun{C,RC}_add_capprox
3488 starfun_add_approx <-- starfunCR_add_approx
3489 starfun_inverse_inverse <-- starfunC_inverse_inverse
3490 starfun_divide <-- starfun{C,CR,RC}_divide
3491 starfun_n <-- starfun{Nat,C}_n
3492 starfun_n_mult <-- starfun{Nat,C}_n_mult
3493 starfun_n_add <-- starfun{Nat,C}_n_add
3494 starfun_n_add_minus <-- starfunNat_n_add_minus
3495 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
3496 starfun_n_minus <-- starfun{Nat,C}_n_minus
3497 starfun_n_eq <-- starfun{Nat,C}_n_eq
3499 star_n_add <-- {hypreal,hypnat,hcomplex}_add
3500 star_n_minus <-- {hypreal,hcomplex}_minus
3501 star_n_diff <-- {hypreal,hcomplex}_diff
3502 star_n_mult <-- {hypreal,hcomplex}_mult
3503 star_n_inverse <-- {hypreal,hcomplex}_inverse
3504 star_n_le <-- {hypreal,hypnat}_le
3505 star_n_less <-- {hypreal,hypnat}_less
3506 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
3507 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
3508 star_n_abs <-- hypreal_hrabs
3509 star_n_divide <-- hcomplex_divide
3511 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
3512 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
3513 star_of_diff <-- hypreal_of_real_diff
3514 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
3515 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
3516 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
3517 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
3518 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
3519 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
3520 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
3521 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
3522 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
3523 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
3524 star_of_number_of <-- {hypreal,hcomplex}_number_of
3525 star_of_number_less <-- number_of_less_hypreal_of_real_iff
3526 star_of_number_le <-- number_of_le_hypreal_of_real_iff
3527 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
3528 star_of_less_number <-- hypreal_of_real_less_number_of_iff
3529 star_of_le_number <-- hypreal_of_real_le_number_of_iff
3530 star_of_power <-- hypreal_of_real_power
3531 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
3533 * Hyperreal: new method "transfer" that implements the transfer
3534 principle of nonstandard analysis. With a subgoal that mentions
3535 nonstandard types like "'a star", the command "apply transfer"
3536 replaces it with an equivalent one that mentions only standard types.
3537 To be successful, all free variables must have standard types; non-
3538 standard variables must have explicit universal quantifiers.
3540 * Hyperreal: A theory of Taylor series.
3545 * Discontinued special version of 'constdefs' (which used to support
3546 continuous functions) in favor of the general Pure one with full
3549 * New simplification procedure for solving continuity conditions; it
3550 is much faster on terms with many nested lambda abstractions (cubic
3551 instead of exponential time).
3553 * New syntax for domain package: selector names are now optional.
3554 Parentheses should be omitted unless argument is lazy, for example:
3556 domain 'a stream = cons "'a" (lazy "'a stream")
3558 * New command 'fixrec' for defining recursive functions with pattern
3559 matching; defining multiple functions with mutual recursion is also
3560 supported. Patterns may include the constants cpair, spair, up, sinl,
3561 sinr, or any data constructor defined by the domain package. The given
3562 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
3563 syntax and examples.
3565 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
3566 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
3567 but the proof obligation additionally includes an admissibility
3568 requirement. The packages generate instances of class cpo or pcpo,
3569 with continuity and strictness theorems for Rep and Abs.
3571 * HOLCF: Many theorems have been renamed according to a more standard naming
3572 scheme (INCOMPATIBILITY):
3574 foo_inject: "foo$x = foo$y ==> x = y"
3575 foo_eq: "(foo$x = foo$y) = (x = y)"
3576 foo_less: "(foo$x << foo$y) = (x << y)"
3577 foo_strict: "foo$UU = UU"
3578 foo_defined: "... ==> foo$x ~= UU"
3579 foo_defined_iff: "(foo$x = UU) = (x = UU)"
3584 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
3585 including the First Isomorphism Theorem (on quotienting by the kernel
3588 * ZF/Simplifier: install second copy of type solver that actually
3589 makes use of TC rules declared to Isar proof contexts (or locales);
3590 the old version is still required for ML proof scripts.
3595 * Converted to Isar theory format; use locales instead of axiomatic
3601 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
3604 * Pure/library.ML no longer defines its own option datatype, but uses
3605 that of the SML basis, which has constructors NONE and SOME instead of
3606 None and Some, as well as exception Option.Option instead of OPTION.
3607 The functions the, if_none, is_some, is_none have been adapted
3608 accordingly, while Option.map replaces apsome.
3610 * Pure/library.ML: the exception LIST has been given up in favour of
3611 the standard exceptions Empty and Subscript, as well as
3612 Library.UnequalLengths. Function like Library.hd and Library.tl are
3613 superceded by the standard hd and tl functions etc.
3615 A number of basic list functions are no longer exported to the ML
3616 toplevel, as they are variants of predefined functions. The following
3617 suggests how one can translate existing code:
3619 rev_append xs ys = List.revAppend (xs, ys)
3620 nth_elem (i, xs) = List.nth (xs, i)
3621 last_elem xs = List.last xs
3622 flat xss = List.concat xss
3623 seq fs = List.app fs
3624 partition P xs = List.partition P xs
3625 mapfilter f xs = List.mapPartial f xs
3627 * Pure/library.ML: several combinators for linear functional
3628 transformations, notably reverse application and composition:
3631 (x, y) |-> f f #-> g
3633 * Pure/library.ML: introduced/changed precedence of infix operators:
3635 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
3637 infix 3 o oo ooo oooo;
3638 infix 4 ~~ upto downto;
3640 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
3643 * Pure/library.ML: natural list combinators fold, fold_rev, and
3644 fold_map support linear functional transformations and nesting. For
3647 fold f [x1, ..., xN] y =
3648 y |> f x1 |> ... |> f xN
3650 (fold o fold) f [xs1, ..., xsN] y =
3651 y |> fold f xs1 |> ... |> fold f xsN
3653 fold f [x1, ..., xN] =
3656 (fold o fold) f [xs1, ..., xsN] =
3657 fold f xs1 #> ... #> fold f xsN
3659 * Pure/library.ML: the following selectors on type 'a option are
3662 the: 'a option -> 'a (*partial*)
3663 these: 'a option -> 'a where 'a = 'b list
3664 the_default: 'a -> 'a option -> 'a
3665 the_list: 'a option -> 'a list
3667 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3668 basic operations for association lists, following natural argument
3669 order; moreover the explicit equality predicate passed here avoids
3670 potentially expensive polymorphic runtime equality checks.
3671 The old functions may be expressed as follows:
3673 assoc = uncurry (AList.lookup (op =))
3674 assocs = these oo AList.lookup (op =)
3675 overwrite = uncurry (AList.update (op =)) o swap
3677 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3679 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
3680 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
3682 replacing make_keylist and keyfilter (occassionally used)
3685 make_keylist = AList.make
3686 keyfilter = AList.find (op =)
3688 * eq_fst and eq_snd now take explicit equality parameter, thus
3689 avoiding eqtypes. Naive rewrites:
3691 eq_fst = eq_fst (op =)
3692 eq_snd = eq_snd (op =)
3694 * Removed deprecated apl and apr (rarely used).
3697 apl (n, op) =>>= curry op n
3698 apr (op, m) =>>= fn n => op (n, m)
3700 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
3701 provides a reasonably efficient light-weight implementation of sets as
3704 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
3705 few new operations; existing lookup and update are now curried to
3706 follow natural argument order (for use with fold etc.);
3707 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
3709 * Pure/General: output via the Isabelle channels of
3710 writeln/warning/error etc. is now passed through Output.output, with a
3711 hook for arbitrary transformations depending on the print_mode
3712 (cf. Output.add_mode -- the first active mode that provides a output
3713 function wins). Already formatted output may be embedded into further
3714 text via Output.raw; the result of Pretty.string_of/str_of and derived
3715 functions (string_of_term/cterm/thm etc.) is already marked raw to
3716 accommodate easy composition of diagnostic messages etc. Programmers
3717 rarely need to care about Output.output or Output.raw at all, with
3718 some notable exceptions: Output.output is required when bypassing the
3719 standard channels (writeln etc.), or in token translations to produce
3720 properly formatted results; Output.raw is required when capturing
3721 already output material that will eventually be presented to the user
3722 a second time. For the default print mode, both Output.output and
3723 Output.raw have no effect.
3725 * Pure/General: Output.time_accumulator NAME creates an operator ('a
3726 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
3727 cumulative results are displayed at the end of a batch session.
3729 * Pure/General: File.sysify_path and File.quote_sysify path have been
3730 replaced by File.platform_path and File.shell_path (with appropriate
3731 hooks). This provides a clean interface for unusual systems where the
3732 internal and external process view of file names are different.
3734 * Pure: more efficient orders for basic syntactic entities: added
3735 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
3736 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
3737 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
3738 orders now -- potential INCOMPATIBILITY for code that depends on a
3739 particular order for Symtab.keys, Symtab.dest, etc. (consider using
3740 Library.sort_strings on result).
3742 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
3743 fold_types traverse types/terms from left to right, observing natural
3744 argument order. Supercedes previous foldl_XXX versions, add_frees,
3745 add_vars etc. have been adapted as well: INCOMPATIBILITY.
3747 * Pure: name spaces have been refined, with significant changes of the
3748 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
3749 to extern(_table). The plain name entry path is superceded by a
3750 general 'naming' context, which also includes the 'policy' to produce
3751 a fully qualified name and external accesses of a fully qualified
3752 name; NameSpace.extend is superceded by context dependent
3753 Sign.declare_name. Several theory and proof context operations modify
3754 the naming context. Especially note Theory.restore_naming and
3755 ProofContext.restore_naming to get back to a sane state; note that
3756 Theory.add_path is no longer sufficient to recover from
3757 Theory.absolute_path in particular.
3759 * Pure: new flags short_names (default false) and unique_names
3760 (default true) for controlling output of qualified names. If
3761 short_names is set, names are printed unqualified. If unique_names is
3762 reset, the name prefix is reduced to the minimum required to achieve
3763 the original result when interning again, even if there is an overlap
3764 with earlier declarations.
3766 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
3767 now 'extend', and 'merge' gets an additional Pretty.pp argument
3768 (useful for printing error messages). INCOMPATIBILITY.
3770 * Pure: major reorganization of the theory context. Type Sign.sg and
3771 Theory.theory are now identified, referring to the universal
3772 Context.theory (see Pure/context.ML). Actual signature and theory
3773 content is managed as theory data. The old code and interfaces were
3774 spread over many files and structures; the new arrangement introduces
3775 considerable INCOMPATIBILITY to gain more clarity:
3777 Context -- theory management operations (name, identity, inclusion,
3778 parents, ancestors, merge, etc.), plus generic theory data;
3780 Sign -- logical signature and syntax operations (declaring consts,
3781 types, etc.), plus certify/read for common entities;
3783 Theory -- logical theory operations (stating axioms, definitions,
3784 oracles), plus a copy of logical signature operations (consts,
3785 types, etc.); also a few basic management operations (Theory.copy,
3788 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
3789 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
3790 for convenience -- they merely return the theory.
3792 * Pure: type Type.tsig is superceded by theory in most interfaces.
3794 * Pure: the Isar proof context type is already defined early in Pure
3795 as Context.proof (note that ProofContext.context and Proof.context are
3796 aliases, where the latter is the preferred name). This enables other
3797 Isabelle components to refer to that type even before Isar is present.
3799 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3800 typeK, constK, axiomK, oracleK), but provide explicit operations for
3801 any of these kinds. For example, Sign.intern typeK is now
3802 Sign.intern_type, Theory.hide_space Sign.typeK is now
3803 Theory.hide_types. Also note that former
3804 Theory.hide_classes/types/consts are now
3805 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3806 internalize their arguments! INCOMPATIBILITY.
3808 * Pure: get_thm interface (of PureThy and ProofContext) expects
3809 datatype thmref (with constructors Name and NameSelection) instead of
3810 plain string -- INCOMPATIBILITY;
3812 * Pure: cases produced by proof methods specify options, where NONE
3813 means to remove case bindings -- INCOMPATIBILITY in
3816 * Pure: the following operations retrieve axioms or theorems from a
3817 theory node or theory hierarchy, respectively:
3819 Theory.axioms_of: theory -> (string * term) list
3820 Theory.all_axioms_of: theory -> (string * term) list
3821 PureThy.thms_of: theory -> (string * thm) list
3822 PureThy.all_thms_of: theory -> (string * thm) list
3824 * Pure: print_tac now outputs the goal through the trace channel.
3826 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3827 Reference Toplevel.debug (default false) controls detailed printing
3828 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3829 controls execution profiling -- set to 1 for time and 2 for space
3830 (both increase the runtime).
3832 * Isar session: The initial use of ROOT.ML is now always timed,
3833 i.e. the log will show the actual process times, in contrast to the
3834 elapsed wall-clock time that the outer shell wrapper produces.
3836 * Simplifier: improved handling of bound variables (nameless
3837 representation, avoid allocating new strings). Simprocs that invoke
3838 the Simplifier recursively should use Simplifier.inherit_bounds to
3839 avoid local name clashes. Failure to do so produces warnings
3840 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3841 for further details.
3843 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3844 bindings for all theorems stored within a given theory; this may help
3845 in porting non-Isar theories to Isar ones, while keeping ML proof
3846 scripts for the time being.
3848 * ML operator HTML.with_charset specifies the charset begin used for
3849 generated HTML files. For example:
3851 HTML.with_charset "utf-8" use_thy "Hebrew";
3852 HTML.with_charset "utf-8" use_thy "Chinese";
3857 * Allow symlinks to all proper Isabelle executables (Isabelle,
3858 isabelle, isatool etc.).
3860 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3861 isatool doc, isatool mkdir, display_drafts etc.).
3863 * isatool usedir: option -f allows specification of the ML file to be
3864 used by Isabelle; default is ROOT.ML.
3866 * New isatool version outputs the version identifier of the Isabelle
3867 distribution being used.
3869 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3870 (containing Boolean satisfiability problems) into Isabelle/HOL
3875 New in Isabelle2004 (April 2004)
3876 --------------------------------
3880 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3881 Replaces linorder.ML.
3883 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3884 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3885 (\<a>...\<z>), are now considered normal letters, and can therefore
3886 be used anywhere where an ASCII letter (a...zA...Z) has until
3887 now. COMPATIBILITY: This obviously changes the parsing of some
3888 terms, especially where a symbol has been used as a binder, say
3889 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3890 as an identifier. Fix it by inserting a space around former
3891 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3892 existing theory and ML files.
3894 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3896 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3897 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3898 a normal (but invisible) letter. For multiple letter subscripts repeat
3899 \<^isub> like this: x\<^isub>1\<^isub>2.
3901 * Pure: There are now sub-/superscripts that can span more than one
3902 character. Text between \<^bsub> and \<^esub> is set in subscript in
3903 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3904 superscript. The new control characters are not identifier parts.
3906 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3907 content of "..." to the latex file instead of \isacntrl... . The "..."
3908 may consist of any printable characters excluding the end bracket >.
3910 * Pure: Using new Isar command "finalconsts" (or the ML functions
3911 Theory.add_finals or Theory.add_finals_i) it is now possible to
3912 declare constants "final", which prevents their being given a definition
3913 later. It is useful for constants whose behaviour is fixed axiomatically
3914 rather than definitionally, such as the meta-logic connectives.
3916 * Pure: 'instance' now handles general arities with general sorts
3917 (i.e. intersections of classes),
3919 * Presentation: generated HTML now uses a CSS style sheet to make layout
3920 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3921 It can be changed to alter the colors/layout of generated pages.
3926 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3927 cut_tac, subgoal_tac and thin_tac:
3928 - Now understand static (Isar) contexts. As a consequence, users of Isar
3929 locales are no longer forced to write Isar proof scripts.
3930 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3932 - INCOMPATIBILITY: names of variables to be instantiated may no
3933 longer be enclosed in quotes. Instead, precede variable name with `?'.
3934 This is consistent with the instantiation attribute "where".
3936 * Attributes "where" and "of":
3937 - Now take type variables of instantiated theorem into account when reading
3938 the instantiation string. This fixes a bug that caused instantiated
3939 theorems to have too special types in some circumstances.
3940 - "where" permits explicit instantiations of type variables.
3942 * Calculation commands "moreover" and "also" no longer interfere with
3943 current facts ("this"), admitting arbitrary combinations with "then"
3947 - Goal statements involving the context element "includes" no longer
3948 generate theorems with internal delta predicates (those ending on
3949 "_axioms") in the premise.
3950 Resolve particular premise with <locale>.intro to obtain old form.
3951 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3952 specification and "includes" elements in goal statement.
3953 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3954 [intro?] and [elim?] (respectively) by default.
3955 - Experimental command for instantiation of locales in proof contexts:
3956 instantiate <label>[<attrs>]: <loc>
3957 Instantiates locale <loc> and adds all its theorems to the current context
3958 taking into account their attributes. Label and attrs are optional
3959 modifiers, like in theorem declarations. If present, names of
3960 instantiated theorems are qualified with <label>, and the attributes
3961 <attrs> are applied after any attributes these theorems might have already.
3962 If the locale has assumptions, a chained fact of the form
3963 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3964 are derived. The command does not support old-style locales declared
3965 with "locale (open)".
3966 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3968 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3974 * Proof import: new image HOL4 contains the imported library from
3975 the HOL4 system with about 2500 theorems. It is imported by
3976 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3977 can be used like any other Isabelle image. See
3978 HOL/Import/HOL/README for more information.
3981 - Much improved handling of linear and partial orders.
3982 Reasoners for linear and partial orders are set up for type classes
3983 "linorder" and "order" respectively, and are added to the default simpset
3984 as solvers. This means that the simplifier can build transitivity chains
3985 to solve goals from the assumptions.
3986 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3987 of blast or auto after simplification become unnecessary because the goal
3988 is solved by simplification already.
3990 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3991 all proved in axiomatic type classes for semirings, rings and fields.
3994 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3995 now formalized using the Ring_and_Field theory mentioned above.
3996 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3997 than before, because now they are set up once in a generic manner.
3998 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3999 Look for the general versions in Ring_and_Field (and Power if they concern
4002 * Type "rat" of the rational numbers is now available in HOL-Complex.
4005 - Record types are now by default printed with their type abbreviation
4006 instead of the list of all field types. This can be configured via
4007 the reference "print_record_type_abbr".
4008 - Simproc "record_upd_simproc" for simplification of multiple updates added
4009 (not enabled by default).
4010 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4011 EX x. x = sel r to True (not enabled by default).
4012 - Tactic "record_split_simp_tac" to split and simplify records added.
4014 * 'specification' command added, allowing for definition by
4015 specification. There is also an 'ax_specification' command that
4016 introduces the new constants axiomatically.
4018 * arith(_tac) is now able to generate counterexamples for reals as well.
4020 * HOL-Algebra: new locale "ring" for non-commutative rings.
4022 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4023 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4025 * HOL-Matrix: a first theory for matrices in HOL with an application of
4026 matrix theory to linear programming.
4028 * Unions and Intersections:
4029 The latex output syntax of UN and INT has been changed
4030 from "\Union x \in A. B" to "\Union_{x \in A} B"
4031 i.e. the index formulae has become a subscript.
4032 Similarly for "\Union x. B", and for \Inter instead of \Union.
4034 * Unions and Intersections over Intervals:
4035 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4036 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4037 like in normal math, and corresponding versions for < and for intersection.
4039 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4040 lexicographic dictonary ordering has been added as "lexord".
4042 * ML: the legacy theory structures Int and List have been removed. They had
4043 conflicted with ML Basis Library structures having the same names.
4045 * 'refute' command added to search for (finite) countermodels. Only works
4046 for a fragment of HOL. The installation of an external SAT solver is
4047 highly recommended. See "HOL/Refute.thy" for details.
4049 * 'quickcheck' command: Allows to find counterexamples by evaluating
4050 formulae under an assignment of free variables to random values.
4051 In contrast to 'refute', it can deal with inductive datatypes,
4052 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4058 * Streams now come with concatenation and are part of the HOLCF image
4062 New in Isabelle2003 (May 2003)
4063 ------------------------------
4067 * Provers/simplifier:
4069 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4070 Assumptions are now subject to complete mutual simplification,
4071 not just from left to right. The simplifier now preserves
4072 the order of assumptions.
4074 Potential INCOMPATIBILITY:
4076 -- simp sometimes diverges where the old version did
4077 not, e.g. invoking simp on the goal
4079 [| P (f x); y = x; f x = f y |] ==> Q
4081 now gives rise to the infinite reduction sequence
4083 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4085 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4088 -- Tactics combining classical reasoner and simplification (such as auto)
4089 are also affected by this change, because many of them rely on
4090 simp. They may sometimes diverge as well or yield a different numbers
4091 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4092 in case of problems. Sometimes subsequent calls to the classical
4093 reasoner will fail because a preceeding call to the simplifier too
4094 eagerly simplified the goal, e.g. deleted redundant premises.
4096 - The simplifier trace now shows the names of the applied rewrite rules
4098 - You can limit the number of recursive invocations of the simplifier
4099 during conditional rewriting (where the simplifie tries to solve the
4100 conditions before applying the rewrite rule):
4101 ML "simp_depth_limit := n"
4102 where n is an integer. Thus you can force termination where previously
4103 the simplifier would diverge.
4105 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4107 - No longer aborts on failed congruence proof. Instead, the
4108 congruence is ignored.
4110 * Pure: New generic framework for extracting programs from constructive
4111 proofs. See HOL/Extraction.thy for an example instantiation, as well
4112 as HOL/Extraction for some case studies.
4114 * Pure: The main goal of the proof state is no longer shown by default, only
4115 the subgoals. This behaviour is controlled by a new flag.
4116 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4117 (ML: Proof.show_main_goal).
4119 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4120 rules whose conclusion matches subgoal 1:
4121 PG menu: Isabelle/Isar -> Show me -> matching rules
4122 The rules are ordered by how closely they match the subgoal.
4123 In particular, rules that solve a subgoal outright are displayed first
4124 (or rather last, the way they are printed).
4125 (ML: ProofGeneral.print_intros())
4127 * Pure: New flag trace_unify_fail causes unification to print
4128 diagnostic information (PG: in trace buffer) when it fails. This is
4129 useful for figuring out why single step proofs like rule, erule or
4132 * Pure: Locale specifications now produce predicate definitions
4133 according to the body of text (covering assumptions modulo local
4134 definitions); predicate "loc_axioms" covers newly introduced text,
4135 while "loc" is cumulative wrt. all included locale expressions; the
4136 latter view is presented only on export into the global theory
4137 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4138 on the old view without predicates;
4140 * Pure: predefined locales "var" and "struct" are useful for sharing
4141 parameters (as in CASL, for example); just specify something like
4142 ``var x + var y + struct M'' as import;
4144 * Pure: improved thms_containing: proper indexing of facts instead of
4145 raw theorems; check validity of results wrt. current name space;
4146 include local facts of proof configuration (also covers active
4147 locales), cover fixed variables in index; may use "_" in term
4148 specification; an optional limit for the number of printed facts may
4149 be given (the default is 40);
4151 * Pure: disallow duplicate fact bindings within new-style theory files
4154 * Provers: improved induct method: assumptions introduced by case
4155 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4156 the goal statement); "foo" still refers to all facts collectively;
4158 * Provers: the function blast.overloaded has been removed: all constants
4159 are regarded as potentially overloaded, which improves robustness in exchange
4160 for slight decrease in efficiency;
4162 * Provers/linorder: New generic prover for transitivity reasoning over
4163 linear orders. Note: this prover is not efficient!
4165 * Isar: preview of problems to finish 'show' now produce an error
4166 rather than just a warning (in interactive mode);
4173 - Produces a counter example if it cannot prove a goal.
4174 Note that the counter example may be spurious if the goal is not a formula
4175 of quantifier-free linear arithmetic.
4176 In ProofGeneral the counter example appears in the trace buffer.
4178 - Knows about div k and mod k where k is a numeral of type nat or int.
4180 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4181 linear arithmetic fails. This takes account of quantifiers and divisibility.
4182 Presburger arithmetic can also be called explicitly via presburger(_tac).
4184 * simp's arithmetic capabilities have been enhanced a bit: it now
4185 takes ~= in premises into account (by performing a case split);
4187 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4188 are distributed over a sum of terms;
4190 * New tactic "trans_tac" and method "trans" instantiate
4191 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4194 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4195 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4197 * 'typedef' command has new option "open" to suppress the set
4200 * functions Min and Max on finite sets have been introduced (theory
4203 * attribute [symmetric] now works for relations as well; it turns
4204 (x,y) : R^-1 into (y,x) : R, and vice versa;
4206 * induct over a !!-quantified statement (say !!x1..xn):
4207 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4209 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4210 %x. None. Warning: empty_def now refers to the previously hidden definition
4213 * Algebra: formalization of classical algebra. Intended as base for
4214 any algebraic development in Isabelle. Currently covers group theory
4215 (up to Sylow's theorem) and ring theory (Universal Property of
4216 Univariate Polynomials). Contributions welcome;
4218 * GroupTheory: deleted, since its material has been moved to Algebra;
4220 * Complex: new directory of the complex numbers with numeric constants,
4221 nonstandard complex numbers, and some complex analysis, standard and
4222 nonstandard (Jacques Fleuriot);
4224 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4226 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4229 * Real/HahnBanach: updated and adapted to locales;
4231 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4234 * UNITY: added the Meier-Sanders theory of progress sets;
4236 * MicroJava: bytecode verifier and lightweight bytecode verifier
4237 as abstract algorithms, instantiated to the JVM;
4239 * Bali: Java source language formalization. Type system, operational
4240 semantics, axiomatic semantics. Supported language features:
4241 classes, interfaces, objects,virtual methods, static methods,
4242 static/instance fields, arrays, access modifiers, definite
4243 assignment, exceptions.
4248 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4251 * Main ZF: virtually all theories converted to new-style format;
4256 * Pure: Tactic.prove provides sane interface for internal proofs;
4257 omits the infamous "standard" operation, so this is more appropriate
4258 than prove_goalw_cterm in many situations (e.g. in simprocs);
4260 * Pure: improved error reporting of simprocs;
4262 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4266 *** Document preparation ***
4268 * uses \par instead of \\ for line breaks in theory text. This may
4269 shift some page breaks in large documents. To get the old behaviour
4270 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4272 * minimized dependencies of isabelle.sty and isabellesym.sty on
4275 * \<euro> now needs package babel/greek instead of marvosym (which
4278 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4283 New in Isabelle2002 (March 2002)
4284 --------------------------------
4286 *** Document preparation ***
4288 * greatly simplified document preparation setup, including more
4289 graceful interpretation of isatool usedir -i/-d/-D options, and more
4290 instructive isatool mkdir; users should basically be able to get
4291 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4292 users may run a separate document processing stage manually like this:
4293 "isatool usedir -D output HOL Test && isatool document Test/output";
4295 * theory dependency graph may now be incorporated into documents;
4296 isatool usedir -g true will produce session_graph.eps/.pdf for use
4297 with \includegraphics of LaTeX;
4299 * proper spacing of consecutive markup elements, especially text
4300 blocks after section headings;
4302 * support bold style (for single symbols only), input syntax is like
4303 this: "\<^bold>\<alpha>" or "\<^bold>A";
4305 * \<bullet> is now output as bold \cdot by default, which looks much
4306 better in printed text;
4308 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4309 note that these symbols are currently unavailable in Proof General /
4310 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4312 * isatool latex no longer depends on changed TEXINPUTS, instead
4313 isatool document copies the Isabelle style files to the target
4319 * Pure/Provers: improved proof by cases and induction;
4320 - 'case' command admits impromptu naming of parameters (such as
4322 - 'induct' method divinates rule instantiation from the inductive
4323 claim; no longer requires excessive ?P bindings for proper
4324 instantiation of cases;
4325 - 'induct' method properly enumerates all possibilities of set/type
4326 rules; as a consequence facts may be also passed through *type*
4327 rules without further ado;
4328 - 'induct' method now derives symbolic cases from the *rulified*
4329 rule (before it used to rulify cases stemming from the internal
4330 atomized version); this means that the context of a non-atomic
4331 statement becomes is included in the hypothesis, avoiding the
4332 slightly cumbersome show "PROP ?case" form;
4333 - 'induct' may now use elim-style induction rules without chaining
4334 facts, using ``missing'' premises from the goal state; this allows
4335 rules stemming from inductive sets to be applied in unstructured
4336 scripts, while still benefitting from proper handling of non-atomic
4337 statements; NB: major inductive premises need to be put first, all
4338 the rest of the goal is passed through the induction;
4339 - 'induct' proper support for mutual induction involving non-atomic
4340 rule statements (uses the new concept of simultaneous goals, see
4342 - append all possible rule selections, but only use the first
4343 success (no backtracking);
4344 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4345 - undeclared rule case names default to numbers 1, 2, 3, ...;
4346 - added 'print_induct_rules' (covered by help item in recent Proof
4348 - moved induct/cases attributes to Pure, methods to Provers;
4349 - generic method setup instantiated for FOL and HOL;
4351 * Pure: support multiple simultaneous goal statements, for example
4352 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4353 meta-level mechanism, this acts as if several individual goals had
4354 been stated separately; in particular common proof methods need to be
4355 repeated in order to cover all claims; note that a single elimination
4356 step is *not* sufficient to establish the two conjunctions, so this
4359 assume "A & B" then have A and B .. (*".." fails*)
4361 better use "obtain" in situations as above; alternative refer to
4362 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4364 * Pure: proper integration with ``locales''; unlike the original
4365 version by Florian Kammller, Isar locales package high-level proof
4366 contexts rather than raw logical ones (e.g. we admit to include
4367 attributes everywhere); operations on locales include merge and
4368 rename; support for implicit arguments (``structures''); simultaneous
4369 type-inference over imports and text; see also HOL/ex/Locales.thy for
4372 * Pure: the following commands have been ``localized'', supporting a
4373 target locale specification "(in name)": 'lemma', 'theorem',
4374 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4375 stored both within the locale and at the theory level (exported and
4376 qualified by the locale name);
4378 * Pure: theory goals may now be specified in ``long'' form, with
4379 ad-hoc contexts consisting of arbitrary locale elements. for example
4380 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4381 definitions may be given, too); the result is a meta-level rule with
4382 the context elements being discharged in the obvious way;
4384 * Pure: new proof command 'using' allows to augment currently used
4385 facts after a goal statement ('using' is syntactically analogous to
4386 'apply', but acts on the goal's facts only); this allows chained facts
4387 to be separated into parts given before and after a claim, as in
4388 ``from a and b have C using d and e <proof>'';
4390 * Pure: renamed "antecedent" case to "rule_context";
4392 * Pure: new 'judgment' command records explicit information about the
4393 object-logic embedding (used by several tools internally); no longer
4394 use hard-wired "Trueprop";
4396 * Pure: added 'corollary' command;
4398 * Pure: fixed 'token_translation' command;
4400 * Pure: removed obsolete 'exported' attribute;
4402 * Pure: dummy pattern "_" in is/let is now automatically lifted over
4403 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
4404 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
4406 * Pure: method 'atomize' presents local goal premises as object-level
4407 statements (atomic meta-level propositions); setup controlled via
4408 rewrite rules declarations of 'atomize' attribute; example
4409 application: 'induct' method with proper rule statements in improper
4412 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
4413 now consider the syntactic context of assumptions, giving a better
4414 chance to get type-inference of the arguments right (this is
4415 especially important for locales);
4417 * Pure: "sorry" no longer requires quick_and_dirty in interactive
4420 * Pure/obtain: the formal conclusion "thesis", being marked as
4421 ``internal'', may no longer be reference directly in the text;
4422 potential INCOMPATIBILITY, may need to use "?thesis" in rare
4425 * Pure: generic 'sym' attribute which declares a rule both as pure
4426 'elim?' and for the 'symmetric' operation;
4428 * Pure: marginal comments ``--'' may now occur just anywhere in the
4429 text; the fixed correlation with particular command syntax has been
4432 * Pure: new method 'rules' is particularly well-suited for proof
4433 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
4434 but often produces more compact proof terms with less detours;
4436 * Pure/Provers/classical: simplified integration with pure rule
4437 attributes and methods; the classical "intro?/elim?/dest?"
4438 declarations coincide with the pure ones; the "rule" method no longer
4439 includes classically swapped intros; "intro" and "elim" methods no
4440 longer pick rules from the context; also got rid of ML declarations
4441 AddXIs/AddXEs/AddXDs; all of this has some potential for
4444 * Provers/classical: attribute 'swapped' produces classical inversions
4445 of introduction rules;
4447 * Provers/simplifier: 'simplified' attribute may refer to explicit
4448 rules instead of full simplifier context; 'iff' attribute handles
4451 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
4453 * HOL: 'recdef' now fails on unfinished automated proofs, use
4454 "(permissive)" option to recover old behavior;
4456 * HOL: 'inductive' no longer features separate (collective) attributes
4457 for 'intros' (was found too confusing);
4459 * HOL: properly declared induction rules less_induct and
4465 * HOL: moved over to sane numeral syntax; the new policy is as
4468 - 0 and 1 are polymorphic constants, which are defined on any
4469 numeric type (nat, int, real etc.);
4471 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
4472 binary representation internally;
4474 - type nat has special constructor Suc, and generally prefers Suc 0
4475 over 1::nat and Suc (Suc 0) over 2::nat;
4477 This change may cause significant problems of INCOMPATIBILITY; here
4478 are some hints on converting existing sources:
4480 - due to the new "num" token, "-0" and "-1" etc. are now atomic
4481 entities, so expressions involving "-" (unary or binary minus) need
4482 to be spaced properly;
4484 - existing occurrences of "1" may need to be constraint "1::nat" or
4485 even replaced by Suc 0; similar for old "2";
4487 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
4489 - remove all special provisions on numerals in proofs;
4491 * HOL: simp rules nat_number expand numerals on nat to Suc/0
4492 representation (depends on bin_arith_simps in the default context);
4494 * HOL: symbolic syntax for x^2 (numeral 2);
4496 * HOL: the class of all HOL types is now called "type" rather than
4497 "term"; INCOMPATIBILITY, need to adapt references to this type class
4498 in axclass/classes, instance/arities, and (usually rare) occurrences
4499 in typings (of consts etc.); internally the class is called
4500 "HOL.type", ML programs should refer to HOLogic.typeS;
4502 * HOL/record package improvements:
4503 - new derived operations "fields" to build a partial record section,
4504 "extend" to promote a fixed record to a record scheme, and
4505 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
4506 declared as simp by default;
4507 - shared operations ("more", "fields", etc.) now need to be always
4508 qualified) --- potential INCOMPATIBILITY;
4509 - removed "make_scheme" operations (use "make" with "extend") --
4511 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
4512 - provides cases/induct rules for use with corresponding Isar
4513 methods (for concrete records, record schemes, concrete more
4514 parts, and schematic more parts -- in that order);
4515 - internal definitions directly based on a light-weight abstract
4516 theory of product types over typedef rather than datatype;
4518 * HOL: generic code generator for generating executable ML code from
4519 specifications; specific support for HOL constructs such as inductive
4520 datatypes and sets, as well as recursive functions; can be invoked
4521 via 'generate_code' theory section;
4523 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
4525 * HOL: consolidated and renamed several theories. In particular:
4526 Ord.thy has been absorbed into HOL.thy
4527 String.thy has been absorbed into List.thy
4529 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
4530 (beware of argument permutation!);
4532 * HOL: linorder_less_split superseded by linorder_cases;
4534 * HOL/List: "nodups" renamed to "distinct";
4536 * HOL: added "The" definite description operator; move Hilbert's "Eps"
4537 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
4538 - Ex_def has changed, now need to use some_eq_ex
4540 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
4541 in this (rare) case use:
4543 delSWrapper "split_all_tac"
4544 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
4546 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
4549 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
4550 Isabelle's type classes, ^ on functions and relations has too general
4551 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
4552 necessary to attach explicit type constraints;
4554 * HOL/Relation: the prefix name of the infix "O" has been changed from
4555 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
4556 renamed accordingly (eg "compI" -> "rel_compI").
4558 * HOL: syntax translations now work properly with numerals and records
4561 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
4562 of "lam" -- INCOMPATIBILITY;
4564 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
4565 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
4566 renamed "Product_Type.unit";
4568 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
4570 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
4571 the "cases" method);
4573 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
4576 * HOL/IMP: updated and converted to new-style theory format; several
4577 parts turned into readable document, with proper Isar proof texts and
4578 some explanations (by Gerwin Klein);
4580 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
4582 * HOL-Hyperreal is now a logic image;
4587 * Isar: consts/constdefs supports mixfix syntax for continuous
4590 * Isar: domain package adapted to new-style theory format, e.g. see
4593 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
4594 potential INCOMPATIBILITY; now use plain induct_tac instead of former
4595 lift.induct_tac, always use UU instead of Undef;
4597 * HOLCF/IMP: updated and converted to new-style theory;
4602 * Isar: proper integration of logic-specific tools and packages,
4603 including theory commands '(co)inductive', '(co)datatype',
4604 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
4605 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
4607 * theory Main no longer includes AC; for the Axiom of Choice, base
4608 your theory on Main_ZFC;
4610 * the integer library now covers quotients and remainders, with many
4611 laws relating division to addition, multiplication, etc.;
4613 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
4614 typeless version of the formalism;
4616 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
4619 * ZF/Induct: new directory for examples of inductive definitions,
4620 including theory Multiset for multiset orderings; converted to
4621 new-style theory format;
4623 * ZF: many new theorems about lists, ordinals, etc.;
4628 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
4629 variable proof controls level of detail: 0 = no proofs (only oracle
4630 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
4631 also ref manual for further ML interfaces;
4633 * Pure/axclass: removed obsolete ML interface
4634 goal_subclass/goal_arity;
4636 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
4637 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
4638 separate tokens, so expressions involving minus need to be spaced
4641 * Pure/syntax: support non-oriented infixes, using keyword "infix"
4642 rather than "infixl" or "infixr";
4644 * Pure/syntax: concrete syntax for dummy type variables admits genuine
4645 sort constraint specifications in type inference; e.g. "x::_::foo"
4646 ensures that the type of "x" is of sort "foo" (but not necessarily a
4649 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
4650 control output of nested => (types); the default behavior is
4653 * Pure/syntax: builtin parse translation for "_constify" turns valued
4654 tokens into AST constants;
4656 * Pure/syntax: prefer later declarations of translations and print
4657 translation functions; potential INCOMPATIBILITY: need to reverse
4658 multiple declarations for same syntax element constant;
4660 * Pure/show_hyps reset by default (in accordance to existing Isar
4663 * Provers/classical: renamed addaltern to addafter, addSaltern to
4666 * Provers/clasimp: ``iff'' declarations now handle conditional rules
4669 * system: tested support for MacOS X; should be able to get Isabelle +
4670 Proof General to work in a plain Terminal after installing Poly/ML
4671 (e.g. from the Isabelle distribution area) and GNU bash alone
4672 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
4673 support requires further installations, e.g. from
4674 http://fink.sourceforge.net/);
4676 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
4678 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
4679 of 40 MB), cf. ML_OPTIONS;
4681 * system: Proof General keywords specification is now part of the
4682 Isabelle distribution (see etc/isar-keywords.el);
4684 * system: support for persistent Proof General sessions (refrain from
4685 outdating all loaded theories on startup); user may create writable
4686 logic images like this: ``isabelle -q HOL Test'';
4688 * system: smart selection of Isabelle process versus Isabelle
4689 interface, accommodates case-insensitive file systems (e.g. HFS+); may
4690 run both "isabelle" and "Isabelle" even if file names are badly
4691 damaged (executable inspects the case of the first letter of its own
4692 name); added separate "isabelle-process" and "isabelle-interface";
4694 * system: refrain from any attempt at filtering input streams; no
4695 longer support ``8bit'' encoding of old isabelle font, instead proper
4696 iso-latin characters may now be used; the related isatools
4697 "symbolinput" and "nonascii" have disappeared as well;
4699 * system: removed old "xterm" interface (the print modes "xterm" and
4700 "xterm_color" are still available for direct use in a suitable
4705 New in Isabelle99-2 (February 2001)
4706 -----------------------------------
4708 *** Overview of INCOMPATIBILITIES ***
4710 * HOL: please note that theories in the Library and elsewhere often use the
4711 new-style (Isar) format; to refer to their theorems in an ML script you must
4712 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
4714 * HOL: inductive package no longer splits induction rule aggressively,
4715 but only as far as specified by the introductions given; the old
4716 format may be recovered via ML function complete_split_rule or attribute
4717 'split_rule (complete)';
4719 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
4720 gfp_Tarski to gfp_unfold;
4722 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
4724 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
4725 relation); infix "^^" has been renamed "``"; infix "``" has been
4726 renamed "`"; "univalent" has been renamed "single_valued";
4728 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
4731 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
4733 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
4735 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
4736 consequence, it is no longer monotonic wrt. the local goal context
4737 (which is now passed through the inductive cases);
4739 * Document preparation: renamed standard symbols \<ll> to \<lless> and
4740 \<gg> to \<ggreater>;
4743 *** Document preparation ***
4745 * \isabellestyle{NAME} selects version of Isabelle output (currently
4746 available: are "it" for near math-mode best-style output, "sl" for
4747 slanted text style, and "tt" for plain type-writer; if no
4748 \isabellestyle command is given, output is according to slanted
4751 * support sub/super scripts (for single symbols only), input syntax is
4752 like this: "A\<^sup>*" or "A\<^sup>\<star>";
4754 * some more standard symbols; see Appendix A of the system manual for
4755 the complete list of symbols defined in isabellesym.sty;
4757 * improved isabelle style files; more abstract symbol implementation
4758 (should now use \isamath{...} and \isatext{...} in custom symbol
4761 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
4762 state; Note that presentation of goal states does not conform to
4763 actual human-readable proof documents. Please do not include goal
4764 states into document output unless you really know what you are doing!
4766 * proper indentation of antiquoted output with proportional LaTeX
4769 * no_document ML operator temporarily disables LaTeX document
4772 * isatool unsymbolize tunes sources for plain ASCII communication;
4777 * Pure: Isar now suffers initial goal statements to contain unbound
4778 schematic variables (this does not conform to actual readable proof
4779 documents, due to unpredictable outcome and non-compositional proof
4780 checking); users who know what they are doing may use schematic goals
4781 for Prolog-style synthesis of proven results;
4783 * Pure: assumption method (an implicit finishing) now handles actual
4786 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
4787 initial goal, declare "that" only as Pure intro (only for single
4788 steps); the "that" rule assumption may now be involved in implicit
4789 finishing, thus ".." becomes a feasible for trivial obtains;
4791 * Pure: default proof step now includes 'intro_classes'; thus trivial
4792 instance proofs may be performed by "..";
4794 * Pure: ?thesis / ?this / "..." now work for pure meta-level
4797 * Pure: more robust selection of calculational rules;
4799 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4800 rule (as well as the assumption rule);
4802 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4803 lemmas, using the graph browser tool;
4805 * Pure: predict failure of "show" in interactive mode;
4807 * Pure: 'thms_containing' now takes actual terms as arguments;
4809 * HOL: improved method 'induct' --- now handles non-atomic goals
4810 (potential INCOMPATIBILITY); tuned error handling;
4812 * HOL: cases and induct rules now provide explicit hints about the
4813 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4814 any remaining facts are inserted into the goal verbatim;
4816 * HOL: local contexts (aka cases) may now contain term bindings as
4817 well; the 'cases' and 'induct' methods new provide a ?case binding for
4818 the result to be shown in each case;
4820 * HOL: added 'recdef_tc' command;
4822 * isatool convert assists in eliminating legacy ML scripts;
4827 * HOL/Library: a collection of generic theories to be used together
4828 with main HOL; the theory loader path already includes this directory
4829 by default; the following existing theories have been moved here:
4830 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4831 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4833 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4834 modelling and verification task performed in Isabelle/HOL +
4835 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4837 * HOL/Algebra: special summation operator SUM no longer exists, it has
4838 been replaced by setsum; infix 'assoc' now has priority 50 (like
4839 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4840 'domain', this makes the theory consistent with mathematical
4843 * HOL basics: added overloaded operations "inverse" and "divide"
4844 (infix "/"), syntax for generic "abs" operation, generic summation
4847 * HOL/typedef: simplified package, provide more useful rules (see also
4850 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4851 now expressed as a proper nested rule (old-style tactic scripts may
4852 require atomize_strip_tac to cope with non-atomic premises);
4854 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4855 to "split_conv" (old name still available for compatibility);
4857 * HOL: improved concrete syntax for strings (e.g. allows translation
4858 rules with string literals);
4860 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4861 and Fleuriot's mechanization of analysis, including the transcendental
4862 functions for the reals;
4864 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4869 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4870 "lam" is displayed as TWO lambda-symbols
4872 * CTT: theory Main now available, containing everything (that is, Bool
4878 * Pure: the Simplifier has been implemented properly as a derived rule
4879 outside of the actual kernel (at last!); the overall performance
4880 penalty in practical applications is about 50%, while reliability of
4881 the Isabelle inference kernel has been greatly improved;
4883 * print modes "brackets" and "no_brackets" control output of nested =>
4884 (types) and ==> (props); the default behaviour is "brackets";
4886 * Provers: fast_tac (and friends) now handle actual object-logic rules
4887 as assumptions as well;
4889 * system: support Poly/ML 4.0;
4891 * system: isatool install handles KDE version 1 or 2;
4895 New in Isabelle99-1 (October 2000)
4896 ----------------------------------
4898 *** Overview of INCOMPATIBILITIES ***
4900 * HOL: simplification of natural numbers is much changed; to partly
4901 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4902 issue the following ML commands:
4904 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4905 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4907 * HOL: simplification no longer dives into case-expressions; this is
4908 controlled by "t.weak_case_cong" for each datatype t;
4910 * HOL: nat_less_induct renamed to less_induct;
4912 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4913 fixsome to patch .thy and .ML sources automatically;
4915 select_equality -> some_equality
4916 select_eq_Ex -> some_eq_ex
4917 selectI2EX -> someI2_ex
4920 select1_equality -> some1_equality
4921 Eps_sym_eq -> some_sym_eq_trivial
4922 Eps_eq -> some_eq_trivial
4924 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4926 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4929 * HOL: the recursion equations generated by 'recdef' are now called
4930 f.simps instead of f.rules;
4932 * HOL: qed_spec_mp now also handles bounded ALL as well;
4934 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4935 sometimes be needed;
4937 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4939 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4941 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4942 product is now "<*>" instead of "Times"; the lexicographic product is
4943 now "<*lex*>" instead of "**";
4945 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4946 of main HOL, but was unused); better use HOL's datatype package;
4948 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4949 the old syntax may be recovered as follows:
4952 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4953 (infixl "\\<oplus>" 100)
4955 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4957 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4958 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4961 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4962 changed from A/r to A//r;
4964 * ZF: new treatment of arithmetic (nat & int) may break some old
4967 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4968 rulify -> rule_format, elimify -> elim_format, ...);
4970 * Isar/Provers: intro/elim/dest attributes changed; renamed
4971 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4972 should have to change intro!! to intro? only); replaced "delrule" by
4975 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4977 * Provers: strengthened force_tac by using new first_best_tac;
4979 * LaTeX document preparation: several changes of isabelle.sty (see
4983 *** Document preparation ***
4985 * formal comments (text blocks etc.) in new-style theories may now
4986 contain antiquotations of thm/prop/term/typ/text to be presented
4987 according to latex print mode; concrete syntax is like this:
4988 @{term[show_types] "f(x) = a + x"};
4990 * isatool mkdir provides easy setup of Isabelle session directories,
4991 including proper document sources;
4993 * generated LaTeX sources are now deleted after successful run
4994 (isatool document -c); may retain a copy somewhere else via -D option
4997 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4998 style files, achieving self-contained LaTeX sources and simplifying
5001 * old-style theories now produce (crude) LaTeX output as well;
5003 * browser info session directories are now self-contained (may be put
5004 on WWW server seperately); improved graphs of nested sessions; removed
5005 graph for 'all sessions';
5007 * several improvements in isabelle style files; \isabellestyle{it}
5008 produces fake math mode output; \isamarkupheader is now \section by
5009 default; see lib/texinputs/isabelle.sty etc.;
5014 * Isar/Pure: local results and corresponding term bindings are now
5015 subject to Hindley-Milner polymorphism (similar to ML); this
5016 accommodates incremental type-inference very nicely;
5018 * Isar/Pure: new derived language element 'obtain' supports
5019 generalized existence reasoning;
5021 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5022 support accumulation of results, without applying any rules yet;
5023 useful to collect intermediate results without explicit name
5024 references, and for use with transitivity rules with more than 2
5027 * Isar/Pure: scalable support for case-analysis type proofs: new
5028 'case' language element refers to local contexts symbolically, as
5029 produced by certain proof methods; internally, case names are attached
5030 to theorems as "tags";
5032 * Isar/Pure: theory command 'hide' removes declarations from
5033 class/type/const name spaces;
5035 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5036 indicate potential overloading;
5038 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5040 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5041 "{a,b,c}" instead of {a,b,c};
5043 * Isar/Pure now provides its own version of intro/elim/dest
5044 attributes; useful for building new logics, but beware of confusion
5045 with the version in Provers/classical;
5047 * Isar/Pure: the local context of (non-atomic) goals is provided via
5048 case name 'antecedent';
5050 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5051 to the current context is now done automatically);
5053 * Isar/Pure: theory command 'method_setup' provides a simple interface
5054 for definining proof methods in ML;
5056 * Isar/Provers: intro/elim/dest attributes changed; renamed
5057 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5058 most cases, one should have to change intro!! to intro? only);
5059 replaced "delrule" by "rule del";
5061 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5062 'symmetric' attribute (the latter supercedes [RS sym]);
5064 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5065 method modifier); 'simp' method: 'only:' modifier removes loopers as
5066 well (including splits);
5068 * Isar/Provers: Simplifier and Classical methods now support all kind
5069 of modifiers used in the past, including 'cong', 'iff', etc.
5071 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5072 of Simplifier and Classical reasoner);
5074 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5075 now support named cases; major packages (inductive, datatype, primrec,
5076 recdef) support case names and properly name parameters;
5078 * Isar/HOL: new transitivity rules for substitution in inequalities --
5079 monotonicity conditions are extracted to be proven at end of
5082 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5085 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5086 split_if split_if_asm; datatype package provides theorems foo.splits =
5087 foo.split foo.split_asm for each datatype;
5089 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5090 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5091 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5092 use "(cases (simplified))" method in proper proof texts);
5094 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5096 * Isar: names of theorems etc. may be natural numbers as well;
5098 * Isar: 'pr' command: optional arguments for goals_limit and
5099 ProofContext.prems_limit; no longer prints theory contexts, but only
5102 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5103 additional print modes to be specified; e.g. "pr(latex)" will print
5104 proof state according to the Isabelle LaTeX style;
5106 * Isar: improved support for emulating tactic scripts, including proof
5107 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5108 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5109 (for HOL datatypes);
5111 * Isar: simplified (more robust) goal selection of proof methods: 1st
5112 goal, all goals, or explicit goal specifier (tactic emulation); thus
5113 'proof method scripts' have to be in depth-first order;
5115 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5117 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5118 should instead use individual commands for printing items
5119 (print_commands, print_methods etc.);
5121 * Isar: added 'nothing' --- the empty list of theorems;
5126 * HOL/MicroJava: formalization of a fragment of Java, together with a
5127 corresponding virtual machine and a specification of its bytecode
5128 verifier and a lightweight bytecode verifier, including proofs of
5129 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5130 Cornelia Pusch (see also the homepage of project Bali at
5131 http://isabelle.in.tum.de/Bali/);
5133 * HOL/Algebra: new theory of rings and univariate polynomials, by
5136 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5137 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5140 * HOL/Lattice: fundamental concepts of lattice theory and order
5141 structures, including duals, properties of bounds versus algebraic
5142 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5143 Theorem for complete lattices etc.; may also serve as a demonstration
5144 for abstract algebraic reasoning using axiomatic type classes, and
5145 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5147 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5150 * HOL/IMPP: extension of IMP with local variables and mutually
5151 recursive procedures, by David von Oheimb;
5153 * HOL/Lambda: converted into new-style theory and document;
5155 * HOL/ex/Multiquote: example of multiple nested quotations and
5156 anti-quotations -- basically a generalized version of de-Bruijn
5157 representation; very useful in avoiding lifting of operations;
5159 * HOL/record: added general record equality rule to simpset; fixed
5160 select-update simplification procedure to handle extended records as
5161 well; admit "r" as field name;
5163 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5164 other numeric types and also as the identity of groups, rings, etc.;
5166 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5167 Types nat and int belong to this axclass;
5169 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5170 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5171 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5172 two terms #m*u and #n*u are replaced by #(m+n)*u
5173 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5174 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5175 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5177 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5178 powerful prover for predicate logic but knows nothing of clasets; see
5179 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5181 * HOL: new version of "case_tac" subsumes both boolean case split and
5182 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5183 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5185 * HOL: simplification no longer dives into case-expressions: only the
5186 selector expression is simplified, but not the remaining arms; to
5187 enable full simplification of case-expressions for datatype t, you may
5188 remove t.weak_case_cong from the simpset, either globally (Delcongs
5189 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5191 * HOL/recdef: the recursion equations generated by 'recdef' for
5192 function 'f' are now called f.simps instead of f.rules; if all
5193 termination conditions are proved automatically, these simplification
5194 rules are added to the simpset, as in primrec; rules may be named
5195 individually as well, resulting in a separate list of theorems for
5198 * HOL/While is a new theory that provides a while-combinator. It
5199 permits the definition of tail-recursive functions without the
5200 provision of a termination measure. The latter is necessary once the
5201 invariant proof rule for while is applied.
5203 * HOL: new (overloaded) notation for the set of elements below/above
5204 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5206 * HOL: theorems impI, allI, ballI bound as "strip";
5208 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5209 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5210 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5212 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5214 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5215 main HOL, but was unused);
5217 * HOL: fewer consts declared as global (e.g. have to refer to
5218 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5220 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5221 in case of overlap with user translations (e.g. judgements over
5222 tuples); (note that the underlying logical represenation is still
5228 * ZF: simplification automatically cancels common terms in arithmetic
5229 expressions over nat and int;
5231 * ZF: new treatment of nat to minimize type-checking: all operators
5232 coerce their operands to a natural number using the function natify,
5233 making the algebraic laws unconditional;
5235 * ZF: as above, for int: operators coerce their operands to an integer
5236 using the function intify;
5238 * ZF: the integer library now contains many of the usual laws for the
5239 orderings, including $<=, and monotonicity laws for $+ and $*;
5241 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5244 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5245 to the simplifier and classical reasoner simultaneously;
5250 * Provers: blast_tac now handles actual object-logic rules as
5251 assumptions; note that auto_tac uses blast_tac internally as well;
5253 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5254 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5256 * Provers: delrules now handles destruct rules as well (no longer need
5257 explicit make_elim);
5259 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5260 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5261 use instead the strong form,
5262 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5263 in HOL, FOL and ZF the function cla_make_elim will create such rules
5264 from destruct-rules;
5266 * Provers: Simplifier.easy_setup provides a fast path to basic
5267 Simplifier setup for new object-logics;
5269 * Pure: AST translation rules no longer require constant head on LHS;
5271 * Pure: improved name spaces: ambiguous output is qualified; support
5272 for hiding of names;
5274 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5275 XSYMBOL_HOME; no longer need to do manual configuration in most
5278 * system: compression of ML heaps images may now be controlled via -c
5279 option of isabelle and isatool usedir (currently only observed by
5282 * system: isatool installfonts may handle X-Symbol fonts as well (very
5283 useful for remote X11);
5285 * system: provide TAGS file for Isabelle sources;
5287 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5290 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5291 timing flag supersedes proof_timing and Toplevel.trace;
5293 * ML: new combinators |>> and |>>> for incremental transformations
5294 with secondary results (e.g. certain theory extensions):
5296 * ML: PureThy.add_defs gets additional argument to indicate potential
5297 overloading (usually false);
5299 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5304 New in Isabelle99 (October 1999)
5305 --------------------------------
5307 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5309 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5310 are no longer simplified. (This allows the simplifier to unfold recursive
5311 functional programs.) To restore the old behaviour, declare
5313 Delcongs [if_weak_cong];
5315 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5318 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5320 * HOL/datatype: mutual_induct_tac no longer exists --
5321 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5323 * HOL/typedef: fixed type inference for representing set; type
5324 arguments now have to occur explicitly on the rhs as type constraints;
5326 * ZF: The con_defs part of an inductive definition may no longer refer
5327 to constants declared in the same theory;
5329 * HOL, ZF: the function mk_cases, generated by the inductive
5330 definition package, has lost an argument. To simplify its result, it
5331 uses the default simpset instead of a supplied list of theorems.
5333 * HOL/List: the constructors of type list are now Nil and Cons;
5335 * Simplifier: the type of the infix ML functions
5336 setSSolver addSSolver setSolver addSolver
5337 is now simpset * solver -> simpset where `solver' is a new abstract type
5338 for packaging solvers. A solver is created via
5339 mk_solver: string -> (thm list -> int -> tactic) -> solver
5340 where the string argument is only a comment.
5345 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5346 decision procedure for linear arithmetic. Currently it is used for
5347 types `nat', `int', and `real' in HOL (see below); it can, should and
5348 will be instantiated for other types and logics as well.
5350 * The simplifier now accepts rewrite rules with flexible heads, eg
5351 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5352 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5358 * New Isabelle/Isar subsystem provides an alternative to traditional
5359 tactical theorem proving; together with the ProofGeneral/isar user
5360 interface it offers an interactive environment for developing human
5361 readable proof documents (Isar == Intelligible semi-automated
5362 reasoning); for further information see isatool doc isar-ref,
5363 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5365 * improved and simplified presentation of theories: better HTML markup
5366 (including colors), graph views in several sizes; isatool usedir now
5367 provides a proper interface for user theories (via -P option); actual
5368 document preparation based on (PDF)LaTeX is available as well (for
5369 new-style theories only); see isatool doc system for more information;
5371 * native support for Proof General, both for classic Isabelle and
5374 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5375 using the graph browser tool;
5377 * Isabelle manuals now also available as PDF;
5379 * theory loader rewritten from scratch (may not be fully
5380 bug-compatible); old loadpath variable has been replaced by show_path,
5381 add_path, del_path, reset_path functions; new operations such as
5382 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5385 * improved isatool install: option -k creates KDE application icon,
5386 option -p DIR installs standalone binaries;
5388 * added ML_PLATFORM setting (useful for cross-platform installations);
5389 more robust handling of platform specific ML images for SML/NJ;
5391 * the settings environment is now statically scoped, i.e. it is never
5392 created again in sub-processes invoked from isabelle, isatool, or
5395 * path element specification '~~' refers to '$ISABELLE_HOME';
5397 * in locales, the "assumes" and "defines" parts may be omitted if
5400 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
5403 * new print_mode "HTML";
5405 * new flag show_tags controls display of tags of theorems (which are
5406 basically just comments that may be attached by some tools);
5408 * Isamode 2.6 requires patch to accomodate change of Isabelle font
5409 mode and goal output format:
5411 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
5413 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
5415 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
5416 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
5418 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
5420 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
5422 * function bind_thms stores lists of theorems (cf. bind_thm);
5424 * new shorthand tactics ftac, eatac, datac, fatac;
5426 * qed (and friends) now accept "" as result name; in that case the
5427 theorem is not stored, but proper checks and presentation of the
5430 * theorem database now also indexes constants "Trueprop", "all",
5431 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
5436 ** HOL arithmetic **
5438 * There are now decision procedures for linear arithmetic over nat and
5441 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
5442 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
5443 are treated as atomic; subformulae not involving type `nat' or `int'
5444 are ignored; quantified subformulae are ignored unless they are
5445 positive universal or negative existential. The tactic has to be
5446 invoked by hand and can be a little bit slow. In particular, the
5447 running time is exponential in the number of occurrences of `min' and
5448 `max', and `-' on `nat'.
5450 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
5451 (negated) (in)equalities among the premises and the conclusion into
5452 account (i.e. no compound formulae) and does not know about `min' and
5453 `max', and `-' on `nat'. It is fast and is used automatically by the
5456 NB: At the moment, these decision procedures do not cope with mixed
5457 nat/int formulae where the two parts interact, such as `m < n ==>
5460 * HOL/Numeral provides a generic theory of numerals (encoded
5461 efficiently as bit strings); setup for types nat/int/real is in place;
5462 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
5463 int, existing theories and proof scripts may require a few additional
5466 * integer division and remainder can now be performed on constant
5469 * many properties of integer multiplication, division and remainder
5472 * An interface to the Stanford Validity Checker (SVC) is available through the
5473 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
5474 are proved automatically. SVC must be installed separately, and its results
5475 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
5476 invocation of the underlying oracle). For SVC see
5477 http://verify.stanford.edu/SVC
5479 * IsaMakefile: the HOL-Real target now builds an actual image;
5484 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
5485 (in Isabelle/Isar) -- by Gertrud Bauer;
5487 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
5488 analysis for assembly languages with subtypes;
5490 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
5491 -- avoids syntactic ambiguities and treats state, transition, and
5492 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
5493 changed syntax and (many) tactics;
5495 * HOL/inductive: Now also handles more general introduction rules such
5496 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
5497 theorems are now maintained within the theory (maintained via the
5500 * HOL/datatype: Now also handles arbitrarily branching datatypes
5501 (using function types) such as
5503 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
5505 * HOL/record: record_simproc (part of the default simpset) takes care
5506 of selectors applied to updated records; record_split_tac is no longer
5507 part of the default claset; update_defs may now be removed from the
5508 simpset in many cases; COMPATIBILITY: old behavior achieved by
5510 claset_ref () := claset() addSWrapper record_split_wrapper;
5511 Delsimprocs [record_simproc]
5513 * HOL/typedef: fixed type inference for representing set; type
5514 arguments now have to occur explicitly on the rhs as type constraints;
5516 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
5517 names rather than an ML expression;
5519 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
5520 supplied later. Program schemes can be defined, such as
5521 "While B C s = (if B s then While B C (C s) else s)"
5522 where the well-founded relation can be chosen after B and C have been given.
5524 * HOL/List: the constructors of type list are now Nil and Cons;
5525 INCOMPATIBILITY: while [] and infix # syntax is still there, of
5526 course, ML tools referring to List.list.op # etc. have to be adapted;
5528 * HOL_quantifiers flag superseded by "HOL" print mode, which is
5529 disabled by default; run isabelle with option -m HOL to get back to
5530 the original Gordon/HOL-style output;
5532 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
5533 ALL x<=y. P, EX x<y. P, EX x<=y. P;
5535 * HOL basic syntax simplified (more orthogonal): all variants of
5536 All/Ex now support plain / symbolic / HOL notation; plain syntax for
5537 Eps operator is provided as well: "SOME x. P[x]";
5539 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
5541 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
5542 thus available for user theories;
5544 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
5545 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
5548 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
5549 several times and then mp;
5554 * the notation <<...>> is now available as a notation for sequences of
5557 * the simplifier is now installed
5559 * the axiom system has been generalized (thanks to Soren Heilmann)
5561 * the classical reasoner now has a default rule database
5566 * new primrec section allows primitive recursive functions to be given
5567 directly (as in HOL) over datatypes and the natural numbers;
5569 * new tactics induct_tac and exhaust_tac for induction (or case
5570 analysis) over datatypes and the natural numbers;
5572 * the datatype declaration of type T now defines the recursor T_rec;
5574 * simplification automatically does freeness reasoning for datatype
5577 * automatic type-inference, with AddTCs command to insert new
5578 type-checking rules;
5580 * datatype introduction rules are now added as Safe Introduction rules
5583 * the syntax "if P then x else y" is now available in addition to
5587 *** Internal programming interfaces ***
5589 * tuned simplifier trace output; new flag debug_simp;
5591 * structures Vartab / Termtab (instances of TableFun) offer efficient
5592 tables indexed by indexname_ord / term_ord (compatible with aconv);
5594 * AxClass.axclass_tac lost the theory argument;
5596 * tuned current_goals_markers semantics: begin / end goal avoids
5597 printing empty lines;
5599 * removed prs and prs_fn hook, which was broken because it did not
5600 include \n in its semantics, forcing writeln to add one
5601 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
5602 string -> unit if you really want to output text without newline;
5604 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
5605 plain output, interface builders may have to enable 'isabelle_font'
5606 mode to get Isabelle font glyphs as before;
5608 * refined token_translation interface; INCOMPATIBILITY: output length
5609 now of type real instead of int;
5611 * theory loader actions may be traced via new ThyInfo.add_hook
5612 interface (see src/Pure/Thy/thy_info.ML); example application: keep
5613 your own database of information attached to *whole* theories -- as
5614 opposed to intra-theory data slots offered via TheoryDataFun;
5616 * proper handling of dangling sort hypotheses (at last!);
5617 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
5618 extra sort hypotheses that can be witnessed from the type signature;
5619 the force_strip_shyps flag is gone, any remaining shyps are simply
5620 left in the theorem (with a warning issued by strip_shyps_warning);
5624 New in Isabelle98-1 (October 1998)
5625 ----------------------------------
5627 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5629 * several changes of automated proof tools;
5631 * HOL: major changes to the inductive and datatype packages, including
5632 some minor incompatibilities of theory syntax;
5634 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
5637 * HOL: removed duplicate thms in Arith:
5638 less_imp_add_less should be replaced by trans_less_add1
5639 le_imp_add_le should be replaced by trans_le_add1
5641 * HOL: unary minus is now overloaded (new type constraints may be
5644 * HOL and ZF: unary minus for integers is now #- instead of #~. In
5645 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
5646 now taken as an integer constant.
5648 * Pure: ML function 'theory_of' renamed to 'theory';
5654 1. Asm_full_simp_tac is now more aggressive.
5655 1. It will sometimes reorient premises if that increases their power to
5657 2. It does no longer proceed strictly from left to right but may also
5658 rotate premises to achieve further simplification.
5659 For compatibility reasons there is now Asm_lr_simp_tac which is like the
5660 old Asm_full_simp_tac in that it does not rotate premises.
5661 2. The simplifier now knows a little bit about nat-arithmetic.
5663 * Classical reasoner: wrapper mechanism for the classical reasoner now
5664 allows for selected deletion of wrappers, by introduction of names for
5665 wrapper functionals. This implies that addbefore, addSbefore,
5666 addaltern, and addSaltern now take a pair (name, tactic) as argument,
5667 and that adding two tactics with the same name overwrites the first
5668 one (emitting a warning).
5669 type wrapper = (int -> tactic) -> (int -> tactic)
5670 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
5671 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
5672 delWrapper, delSWrapper: claset * string -> claset
5673 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
5675 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
5676 semantics; addbefore now affects only the unsafe part of step_tac
5677 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
5678 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
5681 * Classical reasoner: setwrapper to setWrapper and compwrapper to
5682 compWrapper; added safe wrapper (and access functions for it);
5684 * HOL/split_all_tac is now much faster and fails if there is nothing
5685 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
5686 and the names of the automatically generated variables have changed.
5687 split_all_tac has moved within claset() from unsafe wrappers to safe
5688 wrappers, which means that !!-bound variables are split much more
5689 aggressively, and safe_tac and clarify_tac now split such variables.
5690 If this splitting is not appropriate, use delSWrapper "split_all_tac".
5691 Note: the same holds for record_split_tac, which does the job of
5692 split_all_tac for record fields.
5694 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
5695 permanently to the default simpset using Addsplits just like
5696 Addsimps. They can be removed via Delsplits just like
5697 Delsimps. Lower-case versions are also available.
5699 * HOL/Simplifier: The rule split_if is now part of the default
5700 simpset. This means that the simplifier will eliminate all occurrences
5701 of if-then-else in the conclusion of a goal. To prevent this, you can
5702 either remove split_if completely from the default simpset by
5703 `Delsplits [split_if]' or remove it in a specific call of the
5704 simplifier using `... delsplits [split_if]'. You can also add/delete
5705 other case splitting rules to/from the default simpset: every datatype
5706 generates suitable rules `split_t_case' and `split_t_case_asm' (where
5707 t is the name of the datatype).
5709 * Classical reasoner / Simplifier combination: new force_tac (and
5710 derivatives Force_tac, force) combines rewriting and classical
5711 reasoning (and whatever other tools) similarly to auto_tac, but is
5712 aimed to solve the given subgoal completely.
5717 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
5718 and `goalw': the theory is no longer needed as an explicit argument -
5719 the current theory context is used; assumptions are no longer returned
5720 at the ML-level unless one of them starts with ==> or !!; it is
5721 recommended to convert to these new commands using isatool fixgoal
5722 (backup your sources first!);
5724 * new top-level commands 'thm' and 'thms' for retrieving theorems from
5725 the current theory context, and 'theory' to lookup stored theories;
5727 * new theory section 'locale' for declaring constants, assumptions and
5728 definitions that have local scope;
5730 * new theory section 'nonterminals' for purely syntactic types;
5732 * new theory section 'setup' for generic ML setup functions
5733 (e.g. package initialization);
5735 * the distribution now includes Isabelle icons: see
5736 lib/logo/isabelle-{small,tiny}.xpm;
5738 * isatool install - install binaries with absolute references to
5741 * isatool logo -- create instances of the Isabelle logo (as EPS);
5743 * print mode 'emacs' reserved for Isamode;
5745 * support multiple print (ast) translations per constant name;
5747 * theorems involving oracles are now printed with a suffixed [!];
5752 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
5754 * HOL/inductive package reorganized and improved: now supports mutual
5760 oddI "n : EVEN ==> Suc n : ODD"
5761 evenI "n : ODD ==> Suc n : EVEN"
5763 new theorem list "elims" contains an elimination rule for each of the
5764 recursive sets; inductive definitions now handle disjunctive premises
5765 correctly (also ZF);
5767 INCOMPATIBILITIES: requires Inductive as an ancestor; component
5768 "mutual_induct" no longer exists - the induction rule is always
5769 contained in "induct";
5772 * HOL/datatype package re-implemented and greatly improved: now
5773 supports mutually recursive datatypes such as
5776 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
5777 | SUM ('a aexp) ('a aexp)
5778 | DIFF ('a aexp) ('a aexp)
5781 'a bexp = LESS ('a aexp) ('a aexp)
5782 | AND ('a bexp) ('a bexp)
5783 | OR ('a bexp) ('a bexp)
5785 as well as indirectly recursive datatypes such as
5788 ('a, 'b) term = Var 'a
5789 | App 'b ((('a, 'b) term) list)
5791 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
5792 induction on mutually / indirectly recursive datatypes.
5794 Primrec equations are now stored in theory and can be accessed via
5795 <function_name>.simps.
5799 - Theories using datatypes must now have theory Datatype as an
5801 - The specific <typename>.induct_tac no longer exists - use the
5802 generic induct_tac instead.
5803 - natE has been renamed to nat.exhaust - use exhaust_tac
5804 instead of res_inst_tac ... natE. Note that the variable
5805 names in nat.exhaust differ from the names in natE, this
5806 may cause some "fragile" proofs to fail.
5807 - The theorems split_<typename>_case and split_<typename>_case_asm
5808 have been renamed to <typename>.split and <typename>.split_asm.
5809 - Since default sorts of type variables are now handled correctly,
5810 some datatype definitions may have to be annotated with explicit
5812 - Primrec definitions no longer require function name and type
5813 of recursive argument.
5815 Consider using isatool fixdatatype to adapt your theories and proof
5816 scripts to the new package (backup your sources first!).
5819 * HOL/record package: considerably improved implementation; now
5820 includes concrete syntax for record types, terms, updates; theorems
5821 for surjective pairing and splitting !!-bound record variables; proof
5822 support is as follows:
5824 1) standard conversions (selectors or updates applied to record
5825 constructor terms) are part of the standard simpset;
5827 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5828 made part of standard simpset and claset via addIffs;
5830 3) a tactic for record field splitting (record_split_tac) is part of
5831 the standard claset (addSWrapper);
5833 To get a better idea about these rules you may retrieve them via
5834 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5835 the name of your record type.
5837 The split tactic 3) conceptually simplifies by the following rule:
5839 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5841 Thus any record variable that is bound by meta-all will automatically
5842 blow up into some record constructor term, consequently the
5843 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5844 solve record problems automatically.
5847 * reorganized the main HOL image: HOL/Integ and String loaded by
5848 default; theory Main includes everything;
5850 * automatic simplification of integer sums and comparisons, using cancellation;
5852 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5854 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5856 * many new identities for unions, intersections, set difference, etc.;
5858 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5859 called split_if, split_split, split_sum_case and split_nat_case (to go
5860 with add/delsplits);
5862 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5863 (?x::unit) = (); this is made part of the default simpset, which COULD
5864 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5865 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5866 unit_abs_eta_conv is added in order to counter the effect of
5867 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5870 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5873 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5874 It and 'sym RS equals0D' are now in the default claset, giving automatic
5875 disjointness reasoning but breaking a few old proofs.
5877 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5878 to 'converse' from 'inverse' (for compatibility with ZF and some
5881 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5882 the well-founded relation;
5884 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5885 Compl A. The "Compl" syntax remains available as input syntax for this
5888 * HOL/Update: new theory of function updates:
5889 f(a:=b) == %x. if x=a then b else f x
5890 may also be iterated as in f(a:=b,c:=d,...);
5892 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5895 - new function list_update written xs[i:=v] that updates the i-th
5896 list position. May also be iterated as in xs[i:=a,j:=b,...].
5897 - new function `upt' written [i..j(] which generates the list
5898 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5899 bound write [i..j], which is a shorthand for [i..j+1(].
5900 - new lexicographic orderings and corresponding wellfoundedness theorems.
5903 - removed 'pred' (predecessor) function;
5904 - generalized some theorems about n-1;
5905 - many new laws about "div" and "mod";
5906 - new laws about greatest common divisors (see theory ex/Primes);
5908 * HOL/Relation: renamed the relational operator r^-1 "converse"
5909 instead of "inverse";
5911 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5912 of the multiset ordering;
5914 * directory HOL/Real: a construction of the reals using Dedekind cuts
5915 (not included by default);
5917 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5919 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5920 programs, i.e. different program variables may have different types.
5922 * calling (stac rew i) now fails if "rew" has no effect on the goal
5923 [previously, this check worked only if the rewrite rule was unconditional]
5924 Now rew can involve either definitions or equalities (either == or =).
5929 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5930 only the theorems proved on ZF.ML;
5932 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5933 It and 'sym RS equals0D' are now in the default claset, giving automatic
5934 disjointness reasoning but breaking a few old proofs.
5936 * ZF/Update: new theory of function updates
5937 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5938 may also be iterated as in f(a:=b,c:=d,...);
5940 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5942 * calling (stac rew i) now fails if "rew" has no effect on the goal
5943 [previously, this check worked only if the rewrite rule was unconditional]
5944 Now rew can involve either definitions or equalities (either == or =).
5946 * case_tac provided for compatibility with HOL
5947 (like the old excluded_middle_tac, but with subgoals swapped)
5950 *** Internal programming interfaces ***
5952 * Pure: several new basic modules made available for general use, see
5953 also src/Pure/README;
5955 * improved the theory data mechanism to support encapsulation (data
5956 kind name replaced by private Object.kind, acting as authorization
5957 key); new type-safe user interface via functor TheoryDataFun; generic
5958 print_data function becomes basically useless;
5960 * removed global_names compatibility flag -- all theory declarations
5961 are qualified by default;
5963 * module Pure/Syntax now offers quote / antiquote translation
5964 functions (useful for Hoare logic etc. with implicit dependencies);
5965 see HOL/ex/Antiquote for an example use;
5967 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5970 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5973 * Display.print_goals function moved to Locale.print_goals;
5975 * standard print function for goals supports current_goals_markers
5976 variable for marking begin of proof, end of proof, start of goal; the
5977 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5978 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5983 New in Isabelle98 (January 1998)
5984 --------------------------------
5986 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5988 * changed lexical syntax of terms / types: dots made part of long
5989 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5991 * simpset (and claset) reference variable replaced by functions
5992 simpset / simpset_ref;
5994 * no longer supports theory aliases (via merge) and non-trivial
5995 implicit merge of thms' signatures;
5997 * most internal names of constants changed due to qualified names;
5999 * changed Pure/Sequence interface (see Pure/seq.ML);
6002 *** General Changes ***
6004 * hierachically structured name spaces (for consts, types, axms, thms
6005 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6006 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6007 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6008 long_names for fully qualified output names; NOTE: ML programs
6009 (special tactics, packages etc.) referring to internal names may have
6010 to be adapted to cope with fully qualified names; in case of severe
6011 backward campatibility problems try setting 'global_names' at compile
6012 time to have enrything declared within a flat name space; one may also
6013 fine tune name declarations in theories via the 'global' and 'local'
6016 * reimplemented the implicit simpset and claset using the new anytype
6017 data filed in signatures; references simpset:simpset ref etc. are
6018 replaced by functions simpset:unit->simpset and
6019 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6020 to patch your ML files accordingly;
6022 * HTML output now includes theory graph data for display with Java
6023 applet or isatool browser; data generated automatically via isatool
6024 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6026 * defs may now be conditional; improved rewrite_goals_tac to handle
6027 conditional equations;
6029 * defs now admits additional type arguments, using TYPE('a) syntax;
6031 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6032 creates a new theory node; implicit merge of thms' signatures is
6033 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6034 transfer:theory->thm->thm in (rare) cases;
6036 * improved handling of draft signatures / theories; draft thms (and
6037 ctyps, cterms) are automatically promoted to real ones;
6039 * slightly changed interfaces for oracles: admit many per theory, named
6040 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6042 * print_goals: optional output of const types (set show_consts and
6045 * improved output of warnings (###) and errors (***);
6047 * subgoal_tac displays a warning if the new subgoal has type variables;
6049 * removed old README and Makefiles;
6051 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6053 * removed obsolete init_pps and init_database;
6055 * deleted the obsolete tactical STATE, which was declared by
6056 fun STATE tacfun st = tacfun st st;
6058 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6059 (which abbreviates $HOME);
6061 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6062 use isatool fixseq to adapt your ML programs (this works for fully
6063 qualified references to the Sequence structure only!);
6065 * use_thy no longer requires writable current directory; it always
6066 reloads .ML *and* .thy file, if either one is out of date;
6069 *** Classical Reasoner ***
6071 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6072 tactics that use classical reasoning to simplify a subgoal without
6073 splitting it into several subgoals;
6075 * Safe_tac: like safe_tac but uses the default claset;
6080 * added simplification meta rules:
6081 (asm_)(full_)simplify: simpset -> thm -> thm;
6083 * simplifier.ML no longer part of Pure -- has to be loaded by object
6086 * added prems argument to simplification procedures;
6088 * HOL, FOL, ZF: added infix function `addsplits':
6089 instead of `<simpset> setloop (split_tac <thms>)'
6090 you can simply write `<simpset> addsplits <thms>'
6095 * TYPE('a) syntax for type reflection terms;
6097 * no longer handles consts with name "" -- declare as 'syntax' instead;
6099 * pretty printer: changed order of mixfix annotation preference (again!);
6101 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6106 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6107 with `addloop' of the simplifier to faciliate case splitting in premises.
6109 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6111 * HOL/Auth: new protocol proofs including some for the Internet
6114 * HOL/Map: new theory of `maps' a la VDM;
6116 * HOL/simplifier: simplification procedures nat_cancel_sums for
6117 cancelling out common nat summands from =, <, <= (in)equalities, or
6118 differences; simplification procedures nat_cancel_factor for
6119 cancelling common factor from =, <, <= (in)equalities over natural
6120 sums; nat_cancel contains both kinds of procedures, it is installed by
6121 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6123 * HOL/simplifier: terms of the form
6124 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6126 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6127 and those of the form
6128 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6130 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6133 Each datatype `t' now comes with a theorem `split_t_case' of the form
6135 P(t_case f1 ... fn x) =
6136 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6138 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6141 and a theorem `split_t_case_asm' of the form
6143 P(t_case f1 ... fn x) =
6144 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6146 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6148 which can be added to a simpset via `addsplits'. The existing theorems
6149 expand_list_case and expand_option_case have been renamed to
6150 split_list_case and split_option_case.
6153 - `pred n' is automatically converted to `n-1'.
6154 Users are strongly encouraged not to use `pred' any longer,
6155 because it will disappear altogether at some point.
6156 - Users are strongly encouraged to write "0 < n" rather than
6157 "n ~= 0". Theorems and proof tools have been modified towards this
6161 the function "set_of_list" has been renamed "set" (and its theorems too);
6162 the function "nth" now takes its arguments in the reverse order and
6163 has acquired the infix notation "!" as in "xs!n".
6165 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6167 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6168 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6170 * HOL/record: extensible records with schematic structural subtyping
6171 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6172 still lacks various theorems and concrete record syntax;
6177 * removed "axioms" and "generated by" sections;
6179 * replaced "ops" section by extended "consts" section, which is capable of
6180 handling the continuous function space "->" directly;
6183 . proves theorems immediately and stores them in the theory,
6184 . creates hierachical name space,
6185 . now uses normal mixfix annotations (instead of cinfix...),
6186 . minor changes to some names and values (for consistency),
6187 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6188 . separator between mutual domain defs: changed "," to "and",
6189 . improved handling of sort constraints; now they have to
6190 appear on the left-hand side of the equations only;
6192 * fixed LAM <x,y,zs>.b syntax;
6194 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6195 adm (%x. P (t x)), where P is chainfinite and t continuous;
6200 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6201 with `addloop' of the simplifier to faciliate case splitting in premises.
6203 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6204 in HOL, they strip ALL and --> from proved theorems;
6208 New in Isabelle94-8 (May 1997)
6209 ------------------------------
6211 *** General Changes ***
6213 * new utilities to build / run / maintain Isabelle etc. (in parts
6214 still somewhat experimental); old Makefiles etc. still functional;
6216 * new 'Isabelle System Manual';
6218 * INSTALL text, together with ./configure and ./build scripts;
6220 * reimplemented type inference for greater efficiency, better error
6221 messages and clean internal interface;
6223 * prlim command for dealing with lots of subgoals (an easier way of
6224 setting goals_limit);
6229 * supports alternative (named) syntax tables (parser and pretty
6230 printer); internal interface is provided by add_modesyntax(_i);
6232 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6233 be used in conjunction with the Isabelle symbol font; uses the
6234 "symbols" syntax table;
6236 * added token_translation interface (may translate name tokens in
6237 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6238 the current print_mode); IMPORTANT: user print translation functions
6239 are responsible for marking newly introduced bounds
6240 (Syntax.mark_boundT);
6242 * token translations for modes "xterm" and "xterm_color" that display
6243 names in bold, underline etc. or colors (which requires a color
6246 * infixes may now be declared with names independent of their syntax;
6248 * added typed_print_translation (like print_translation, but may
6249 access type of constant);
6252 *** Classical Reasoner ***
6254 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6255 some limitations. Blast_tac...
6256 + ignores addss, addbefore, addafter; this restriction is intrinsic
6257 + ignores elimination rules that don't have the correct format
6258 (the conclusion MUST be a formula variable)
6259 + ignores types, which can make HOL proofs fail
6260 + rules must not require higher-order unification, e.g. apply_type in ZF
6261 [message "Function Var's argument not a bound variable" relates to this]
6262 + its proof strategy is more general but can actually be slower
6264 * substitution with equality assumptions no longer permutes other
6267 * minor changes in semantics of addafter (now called addaltern); renamed
6268 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6269 (and access functions for it);
6271 * improved combination of classical reasoner and simplifier:
6272 + functions for handling clasimpsets
6273 + improvement of addss: now the simplifier is called _after_ the
6275 + safe variant of addss called addSss: uses safe simplifications
6276 _during_ the safe steps. It is more complete as it allows multiple
6277 instantiations of unknowns (e.g. with slow_tac).
6281 * added interface for simplification procedures (functions that
6282 produce *proven* rewrite rules on the fly, depending on current
6285 * ordering on terms as parameter (used for ordered rewriting);
6287 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6289 * the solver is now split into a safe and an unsafe part.
6290 This should be invisible for the normal user, except that the
6291 functions setsolver and addsolver have been renamed to setSolver and
6292 addSolver; added safe_asm_full_simp_tac;
6297 * a generic induction tactic `induct_tac' which works for all datatypes and
6298 also for type `nat';
6300 * a generic case distinction tactic `exhaust_tac' which works for all
6301 datatypes and also for type `nat';
6303 * each datatype comes with a function `size';
6305 * patterns in case expressions allow tuple patterns as arguments to
6306 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6308 * primrec now also works with type nat;
6310 * recdef: a new declaration form, allows general recursive functions to be
6311 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6313 * the constant for negation has been renamed from "not" to "Not" to
6314 harmonize with FOL, ZF, LK, etc.;
6316 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6319 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6321 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6322 problems in commutative rings, using axiomatic type classes for + and *;
6324 * more examples in HOL/MiniML and HOL/Auth;
6326 * more default rewrite rules for quantifiers, union/intersection;
6328 * a new constant `arbitrary == @x.False';
6330 * HOLCF/IOA replaces old HOL/IOA;
6332 * HOLCF changes: derived all rules and arities
6333 + axiomatic type classes instead of classes
6334 + typedef instead of faking type definitions
6335 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6336 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6337 + eliminated the types void, one, tr
6338 + use unit lift and bool lift (with translations) instead of one and tr
6339 + eliminated blift from Lift3.thy (use Def instead of blift)
6340 all eliminated rules are derived as theorems --> no visible changes ;
6345 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6346 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6347 as ZF_cs addSIs [equalityI];
6351 New in Isabelle94-7 (November 96)
6352 ---------------------------------
6354 * allowing negative levels (as offsets) in prlev and choplev;
6356 * super-linear speedup for large simplifications;
6358 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6359 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6360 FAIL); can suppress it using the command Delsimps (ex_simps @
6361 all_simps); De Morgan laws are also now included, by default;
6363 * improved printing of ==> : ~:
6365 * new object-logic "Sequents" adds linear logic, while replacing LK
6366 and Modal (thanks to Sara Kalvala);
6368 * HOL/Auth: correctness proofs for authentication protocols;
6370 * HOL: new auto_tac combines rewriting and classical reasoning (many
6371 examples on HOL/Auth);
6373 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6374 the rewriter and classical reasoner simultaneously;
6376 * function uresult no longer returns theorems in "standard" format;
6377 regain previous version by: val uresult = standard o uresult;
6384 * oracles -- these establish an interface between Isabelle and trusted
6385 external reasoners, which may deliver results as theorems;
6387 * proof objects (in particular record all uses of oracles);
6389 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6391 * "constdefs" section in theory files;
6393 * "primrec" section (HOL) no longer requires names;
6395 * internal type "tactic" now simply "thm -> thm Sequence.seq";
6402 * reduced space requirements;
6404 * automatic HTML generation from theories;
6406 * theory files no longer require "..." (quotes) around most types;
6408 * new examples, including two proofs of the Church-Rosser theorem;
6410 * non-curried (1994) version of HOL is no longer distributed;
6417 * greatly reduced space requirements;
6419 * theory files (.thy) no longer require \...\ escapes at line breaks;
6421 * searchable theorem database (see the section "Retrieving theorems" on
6422 page 8 of the Reference Manual);
6424 * new examples, including Grabczewski's monumental case study of the
6427 * The previous version of HOL renamed to Old_HOL;
6429 * The new version of HOL (previously called CHOL) uses a curried syntax
6430 for functions. Application looks like f a b instead of f(a,b);
6432 * Mutually recursive inductive definitions finally work in HOL;
6434 * In ZF, pattern-matching on tuples is now available in all abstractions and
6435 translates to the operator "split";
6442 * new infix operator, addss, allowing the classical reasoner to
6443 perform simplification at each step of its search. Example:
6444 fast_tac (cs addss ss)
6446 * a new logic, CHOL, the same as HOL, but with a curried syntax
6447 for functions. Application looks like f a b instead of f(a,b). Also pairs
6448 look like (a,b) instead of <a,b>;
6450 * PLEASE NOTE: CHOL will eventually replace HOL!
6452 * In CHOL, pattern-matching on tuples is now available in all abstractions.
6453 It translates to the operator "split". A new theory of integers is available;
6455 * In ZF, integer numerals now denote two's-complement binary integers.
6456 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
6458 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
6459 of the Axiom of Choice;
6466 * Significantly faster resolution;
6468 * the different sections in a .thy file can now be mixed and repeated
6471 * Database of theorems for FOL, HOL and ZF. New
6472 commands including qed, qed_goal and bind_thm store theorems in the database.
6474 * Simple database queries: return a named theorem (get_thm) or all theorems of
6475 a given theory (thms_of), or find out what theory a theorem was proved in
6478 * Bugs fixed in the inductive definition and datatype packages;
6480 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
6481 and HOL_dup_cs obsolete;
6483 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
6486 * Simpler definition of function space in ZF;
6488 * new results about cardinal and ordinal arithmetic in ZF;
6490 * 'subtype' facility in HOL for introducing new types as subsets of existing
6493 :mode=text:wrap=hard:maxLineLen=72: