1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Syntax: symbol \<chi> is now considered a letter. Potential
10 INCOMPATIBILITY in identifier syntax etc.
12 * Outer syntax: string tokens may contain arbitrary character codes
13 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
19 * Command "instance" now takes list of definitions in the same manner
20 as the "definition" command. Most notably, object equality is now
21 possible. Type inference is more canonical than it used to be.
22 INCOMPATIBILITY: in some cases explicit type annotations are required.
27 * New primrec package. Specification syntax conforms in style to
28 definition/function/.... No separate induction rule is provided.
29 The "primrec" command distinguishes old-style and new-style specifications
30 by syntax. The former primrec package is now named OldPrimrecPackage.
31 When adjusting theories, beware: constants stemming for new-style
32 primrec specifications have authentic syntax.
34 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
36 * Constants "card", "internal_split", "option_map" now with authentic
39 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
40 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
41 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
42 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
43 Sup_set_def, le_def, less_def, option_map_def now with object
49 * isatool tty runs Isabelle process with plain tty interaction;
50 optional line editor may be specified via ISABELLE_LINE_EDITOR
51 setting, the default settings attempt to locate "ledit" and "rlwrap".
55 New in Isabelle2007 (November 2007)
56 -----------------------------------
60 * More uniform information about legacy features, notably a
61 warning/error of "Legacy feature: ...", depending on the state of the
62 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
63 legacy features will disappear eventually.
65 * Theory syntax: the header format ``theory A = B + C:'' has been
66 discontinued in favour of ``theory A imports B C begin''. Use isatool
67 fixheaders to convert existing theory files. INCOMPATIBILITY.
69 * Theory syntax: the old non-Isar theory file format has been
70 discontinued altogether. Note that ML proof scripts may still be used
71 with Isar theories; migration is usually quite simple with the ML
72 function use_legacy_bindings. INCOMPATIBILITY.
74 * Theory syntax: some popular names (e.g. 'class', 'declaration',
75 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
78 * Theory loader: be more serious about observing the static theory
79 header specifications (including optional directories), but not the
80 accidental file locations of previously successful loads. The strict
81 update policy of former update_thy is now already performed by
82 use_thy, so the former has been removed; use_thys updates several
83 theories simultaneously, just as 'imports' within a theory header
84 specification, but without merging the results. Potential
85 INCOMPATIBILITY: may need to refine theory headers and commands
86 ROOT.ML which depend on load order.
88 * Theory loader: optional support for content-based file
89 identification, instead of the traditional scheme of full physical
90 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
91 (cf. the system manual). The new scheme allows to work with
92 non-finished theories in persistent session images, such that source
93 files may be moved later on without requiring reloads.
95 * Theory loader: old-style ML proof scripts being *attached* to a thy
96 file (with the same base name as the theory) are considered a legacy
97 feature, which will disappear eventually. Even now, the theory loader
98 no longer maintains dependencies on such files.
100 * Syntax: the scope for resolving ambiguities via type-inference is
101 now limited to individual terms, instead of whole simultaneous
102 specifications as before. This greatly reduces the complexity of the
103 syntax module and improves flexibility by separating parsing and
104 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
105 'fixes' etc.) are required in rare situations.
107 * Syntax: constants introduced by new-style packages ('definition',
108 'abbreviation' etc.) are passed through the syntax module in
109 ``authentic mode''. This means that associated mixfix annotations
110 really stick to such constants, independently of potential name space
111 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
112 trees are represented slightly differently, may need to adapt syntax
113 translations accordingly. Use CONST marker in 'translations' and
114 @{const_syntax} antiquotation in 'parse_translation' etc.
116 * Legacy goal package: reduced interface to the bare minimum required
117 to keep existing proof scripts running. Most other user-level
118 functions are now part of the OldGoals structure, which is *not* open
119 by default (consider isatool expandshort before open OldGoals).
120 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
121 these tend to cause confusion about the actual goal (!) context being
122 used here, which is not necessarily the same as the_context().
124 * Command 'find_theorems': supports "*" wild-card in "name:"
125 criterion; "with_dups" option. Certain ProofGeneral versions might
126 support a specific search form (see ProofGeneral/CHANGES).
128 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
129 by default, which means that "prems" (and also "fixed variables") are
130 suppressed from proof state output. Note that the ProofGeneral
131 settings mechanism allows to change and save options persistently, but
132 older versions of Isabelle will fail to start up if a negative prems
135 * Local theory targets may be specified by non-nested blocks of
136 ``context/locale/class ... begin'' followed by ``end''. The body may
137 contain definitions, theorems etc., including any derived mechanism
138 that has been implemented on top of these primitives. This concept
139 generalizes the existing ``theorem (in ...)'' towards more versatility
142 * Proof General interface: proper undo of final 'end' command;
143 discontinued Isabelle/classic mode (ML proof scripts).
146 *** Document preparation ***
148 * Added antiquotation @{theory name} which prints the given name,
149 after checking that it refers to a valid ancestor theory in the
152 * Added antiquotations @{ML_type text} and @{ML_struct text} which
153 check the given source text as ML type/structure, printing verbatim.
155 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
156 "c args == rhs" given in the current context. (Any number of
157 arguments may be given on the LHS.)
162 * The 'class' package offers a combination of axclass and locale to
163 achieve Haskell-like type classes in Isabelle. Definitions and
164 theorems within a class context produce both relative results (with
165 implicit parameters according to the locale context), and polymorphic
166 constants with qualified polymorphism (according to the class
167 context). Within the body context of a 'class' target, a separate
168 syntax layer ("user space type system") takes care of converting
169 between global polymorphic consts and internal locale representation.
170 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
171 "isatool doc classes" provides a tutorial.
173 * Generic code generator framework allows to generate executable
174 code for ML and Haskell (including Isabelle classes). A short usage
177 internal compilation:
178 export_code <list of constants (term syntax)> in SML
179 writing SML code to a file:
180 export_code <list of constants (term syntax)> in SML <filename>
181 writing OCaml code to a file:
182 export_code <list of constants (term syntax)> in OCaml <filename>
183 writing Haskell code to a bunch of files:
184 export_code <list of constants (term syntax)> in Haskell <filename>
186 evaluating closed propositions to True/False using code generation:
189 Reasonable default setup of framework in HOL.
191 Theorem attributs for selecting and transforming function equations theorems:
193 [code fun]: select a theorem as function equation for a specific constant
194 [code fun del]: deselect a theorem as function equation for a specific constant
195 [code inline]: select an equation theorem for unfolding (inlining) in place
196 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
198 User-defined serializations (target in {SML, OCaml, Haskell}):
200 code_const <and-list of constants (term syntax)>
201 {(target) <and-list of const target syntax>}+
203 code_type <and-list of type constructors>
204 {(target) <and-list of type target syntax>}+
206 code_instance <and-list of instances>
208 where instance ::= <type constructor> :: <class>
210 code_class <and_list of classes>
211 {(target) <and-list of class target syntax>}+
212 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
214 code_instance and code_class only are effective to target Haskell.
216 For example usage see src/HOL/ex/Codegenerator.thy and
217 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
218 generation from Isabelle/HOL theories is available via "isatool doc
221 * Code generator: consts in 'consts_code' Isar commands are now
222 referred to by usual term syntax (including optional type
225 * Command 'no_translations' removes translation rules from theory
228 * Overloaded definitions are now actually checked for acyclic
229 dependencies. The overloading scheme is slightly more general than
230 that of Haskell98, although Isabelle does not demand an exact
231 correspondence to type class and instance declarations.
232 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
233 exotic versions of overloading -- at the discretion of the user!
235 Polymorphic constants are represented via type arguments, i.e. the
236 instantiation that matches an instance against the most general
237 declaration given in the signature. For example, with the declaration
238 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
239 as c(nat). Overloading is essentially simultaneous structural
240 recursion over such type arguments. Incomplete specification patterns
241 impose global constraints on all occurrences, e.g. c('a * 'a) on the
242 LHS means that more general c('a * 'b) will be disallowed on any RHS.
243 Command 'print_theory' outputs the normalized system of recursive
244 equations, see section "definitions".
246 * Configuration options are maintained within the theory or proof
247 context (with name and type bool/int/string), providing a very simple
248 interface to a poor-man's version of general context data. Tools may
249 declare options in ML (e.g. using Attrib.config_int) and then refer to
250 these values using Config.get etc. Users may change options via an
251 associated attribute of the same name. This form of context
252 declaration works particularly well with commands 'declare' or
253 'using', for example ``declare [[foo = 42]]''. Thus it has become
254 very easy to avoid global references, which would not observe Isar
255 toplevel undo/redo and fail to work with multithreading.
257 Various global ML references of Pure and HOL have been turned into
258 configuration options:
260 Unify.search_bound unify_search_bound
261 Unify.trace_bound unify_trace_bound
262 Unify.trace_simp unify_trace_simp
263 Unify.trace_types unify_trace_types
264 Simplifier.simp_depth_limit simp_depth_limit
265 Blast.depth_limit blast_depth_limit
266 DatatypeProp.dtK datatype_distinctness_limit
267 fast_arith_neq_limit fast_arith_neq_limit
268 fast_arith_split_limit fast_arith_split_limit
270 * Named collections of theorems may be easily installed as context
271 data using the functor NamedThmsFun (see also
272 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
273 attributes; there is also a toplevel print command. This facility is
274 just a common case of general context data, which is the preferred way
275 for anything more complex than just a list of facts in canonical
278 * Isar: command 'declaration' augments a local theory by generic
279 declaration functions written in ML. This enables arbitrary content
280 being added to the context, depending on a morphism that tells the
281 difference of the original declaration context wrt. the application
282 context encountered later on.
284 * Isar: proper interfaces for simplification procedures. Command
285 'simproc_setup' declares named simprocs (with match patterns, and body
286 text in ML). Attribute "simproc" adds/deletes simprocs in the current
287 context. ML antiquotation @{simproc name} retrieves named simprocs.
289 * Isar: an extra pair of brackets around attribute declarations
290 abbreviates a theorem reference involving an internal dummy fact,
291 which will be ignored later --- only the effect of the attribute on
292 the background context will persist. This form of in-place
293 declarations is particularly useful with commands like 'declare' and
294 'using', for example ``have A using [[simproc a]] by simp''.
296 * Isar: method "assumption" (and implicit closing of subproofs) now
297 takes simple non-atomic goal assumptions into account: after applying
298 an assumption as a rule the resulting subgoals are solved by atomic
299 assumption steps. This is particularly useful to finish 'obtain'
300 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
301 without referring to the original premise "!!x. P x ==> thesis" in the
302 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
305 * Isar: implicit use of prems from the Isar proof context is
306 considered a legacy feature. Common applications like ``have A .''
307 may be replaced by ``have A by fact'' or ``note `A`''. In general,
308 referencing facts explicitly here improves readability and
309 maintainability of proof texts.
311 * Isar: improper proof element 'guess' is like 'obtain', but derives
312 the obtained context from the course of reasoning! For example:
314 assume "EX x y. A x & B y" -- "any previous fact"
315 then guess x and y by clarify
317 This technique is potentially adventurous, depending on the facts and
318 proof tools being involved here.
320 * Isar: known facts from the proof context may be specified as literal
321 propositions, using ASCII back-quote syntax. This works wherever
322 named facts used to be allowed so far, in proof commands, proof
323 methods, attributes etc. Literal facts are retrieved from the context
324 according to unification of type and term parameters. For example,
325 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
326 theorems in the current context, then these are valid literal facts:
327 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
329 There is also a proof method "fact" which does the same composition
330 for explicit goal states, e.g. the following proof texts coincide with
331 certain special cases of literal facts:
333 have "A" by fact == note `A`
334 have "A ==> B" by fact == note `A ==> B`
335 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
336 have "P a ==> Q a" by fact == note `P a ==> Q a`
338 * Isar: ":" (colon) is no longer a symbolic identifier character in
339 outer syntax. Thus symbolic identifiers may be used without
340 additional white space in declarations like this: ``assume *: A''.
342 * Isar: 'print_facts' prints all local facts of the current context,
343 both named and unnamed ones.
345 * Isar: 'def' now admits simultaneous definitions, e.g.:
347 def x == "t" and y == "u"
349 * Isar: added command 'unfolding', which is structurally similar to
350 'using', but affects both the goal state and facts by unfolding given
351 rewrite rules. Thus many occurrences of the 'unfold' method or
352 'unfolded' attribute may be replaced by first-class proof text.
354 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
355 and command 'unfolding' now all support object-level equalities
356 (potentially conditional). The underlying notion of rewrite rule is
357 analogous to the 'rule_format' attribute, but *not* that of the
358 Simplifier (which is usually more generous).
360 * Isar: the new attribute [rotated n] (default n = 1) rotates the
361 premises of a theorem by n. Useful in conjunction with drule.
363 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
364 method expression within a sandbox consisting of the first N
365 sub-goals, which need to exist. For example, ``simp_all [3]''
366 simplifies the first three sub-goals, while (rule foo, simp_all)[]
367 simplifies all new goals that emerge from applying rule foo to the
368 originally first one.
370 * Isar: schematic goals are no longer restricted to higher-order
371 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
374 * Isar: the conclusion of a long theorem statement is now either
375 'shows' (a simultaneous conjunction, as before), or 'obtains'
376 (essentially a disjunction of cases with local parameters and
377 assumptions). The latter allows to express general elimination rules
378 adequately; in this notation common elimination rules look like this:
380 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
382 obtains x where "P x"
384 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
388 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
394 The subsequent classical rules even refer to the formal "thesis"
397 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
400 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
401 obtains "thesis ==> something"
403 The actual proof of an 'obtains' statement is analogous to that of the
404 Isar proof element 'obtain', only that there may be several cases.
405 Optional case names may be specified in parentheses; these will be
406 available both in the present proof and as annotations in the
407 resulting rule, for later use with the 'cases' method (cf. attribute
410 * Isar: the assumptions of a long theorem statement are available as
411 "assms" fact in the proof context. This is more appropriate than the
412 (historical) "prems", which refers to all assumptions of the current
413 context, including those from the target locale, proof body etc.
415 * Isar: 'print_statement' prints theorems from the current theory or
416 proof context in long statement form, according to the syntax of a
419 * Isar: 'obtain' takes an optional case name for the local context
420 introduction rule (default "that").
422 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
423 explicit (is "_ ==> ?foo") in the rare cases where this still happens
426 * Pure: syntax "CONST name" produces a fully internalized constant
427 according to the current context. This is particularly useful for
428 syntax translations that should refer to internal constant
429 representations independently of name spaces.
431 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
432 instead of "FOO ". This allows multiple binder declarations to coexist
433 in the same context. INCOMPATIBILITY.
435 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
436 primitive that also works in a locale context (both for constants and
437 fixed variables). Type declaration and internal syntactic representation
438 of given constants retrieved from the context. Likewise, the
439 'no_notation' command allows to remove given syntax annotations from the
442 * Isar/locales: new derived specification elements 'axiomatization',
443 'definition', 'abbreviation', which support type-inference, admit
444 object-level specifications (equality, equivalence). See also the
445 isar-ref manual. Examples:
448 eq (infix "===" 50) where
449 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
451 definition "f x y = x + y + 1"
452 definition g where "g x = f x x"
455 neq (infix "=!=" 50) where
456 "x =!= y == ~ (x === y)"
458 These specifications may be also used in a locale context. Then the
459 constants being introduced depend on certain fixed parameters, and the
460 constant name is qualified by the locale base name. An internal
461 abbreviation takes care for convenient input and output, making the
462 parameters implicit and using the original short name. See also
463 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
464 entities from a monomorphic theory.
466 Presently, abbreviations are only available 'in' a target locale, but
467 not inherited by general import expressions. Also note that
468 'abbreviation' may be used as a type-safe replacement for 'syntax' +
469 'translations' in common applications. The "no_abbrevs" print mode
470 prevents folding of abbreviations in term output.
472 Concrete syntax is attached to specified constants in internal form,
473 independently of name spaces. The parse tree representation is
474 slightly different -- use 'notation' instead of raw 'syntax', and
475 'translations' with explicit "CONST" markup to accommodate this.
477 * Pure/Isar: unified syntax for new-style specification mechanisms
478 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
479 full type inference and dummy patterns ("_"). For example:
481 definition "K x _ = x"
483 inductive conj for A B
484 where "A ==> B ==> conj A B"
486 * Pure: command 'print_abbrevs' prints all constant abbreviations of
487 the current context. Print mode "no_abbrevs" prevents inversion of
488 abbreviations on output.
490 * Isar/locales: improved parameter handling: use of locales "var" and
491 "struct" no longer necessary; - parameter renamings are no longer
492 required to be injective. For example, this allows to define
493 endomorphisms as locale endom = homom mult mult h.
495 * Isar/locales: changed the way locales with predicates are defined.
496 Instead of accumulating the specification, the imported expression is
497 now an interpretation. INCOMPATIBILITY: different normal form of
498 locale expressions. In particular, in interpretations of locales with
499 predicates, goals repesenting already interpreted fragments are not
500 removed automatically. Use methods `intro_locales' and
501 `unfold_locales'; see below.
503 * Isar/locales: new methods `intro_locales' and `unfold_locales'
504 provide backward reasoning on locales predicates. The methods are
505 aware of interpretations and discharge corresponding goals.
506 `intro_locales' is less aggressive then `unfold_locales' and does not
507 unfold predicates to assumptions.
509 * Isar/locales: the order in which locale fragments are accumulated
510 has changed. This enables to override declarations from fragments due
511 to interpretations -- for example, unwanted simp rules.
513 * Isar/locales: interpretation in theories and proof contexts has been
514 extended. One may now specify (and prove) equations, which are
515 unfolded in interpreted theorems. This is useful for replacing
516 defined concepts (constants depending on locale parameters) by
517 concepts already existing in the target context. Example:
519 interpretation partial_order ["op <= :: [int, int] => bool"]
520 where "partial_order.less (op <=) (x::int) y = (x < y)"
522 Typically, the constant `partial_order.less' is created by a
523 definition specification element in the context of locale
526 * Method "induct": improved internal context management to support
527 local fixes and defines on-the-fly. Thus explicit meta-level
528 connectives !! and ==> are rarely required anymore in inductive goals
529 (using object-logic connectives for this purpose has been long
530 obsolete anyway). Common proof patterns are explained in
531 src/HOL/Induct/Common_Patterns.thy, see also
532 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
535 * Method "induct": improved handling of simultaneous goals. Instead of
536 introducing object-level conjunction, the statement is now split into
537 several conclusions, while the corresponding symbolic cases are nested
538 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
539 see src/HOL/Induct/Common_Patterns.thy, for example.
541 * Method "induct": mutual induction rules are now specified as a list
542 of rule sharing the same induction cases. HOL packages usually provide
543 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
544 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
545 mutual induction rules differently, i.e. like this:
547 (induct rule: foo_bar.inducts)
548 (induct set: foo bar)
549 (induct pred: foo bar)
550 (induct type: foo bar)
552 The ML function ProjectRule.projections turns old-style rules into the
555 * Method "coinduct": dual of induction, see
556 src/HOL/Library/Coinductive_List.thy for various examples.
558 * Method "cases", "induct", "coinduct": the ``(open)'' option is
559 considered a legacy feature.
561 * Attribute "symmetric" produces result with standardized schematic
562 variables (index 0). Potential INCOMPATIBILITY.
564 * Simplifier: by default the simplifier trace only shows top level
565 rewrites now. That is, trace_simp_depth_limit is set to 1 by
566 default. Thus there is less danger of being flooded by the trace. The
567 trace indicates where parts have been suppressed.
569 * Provers/classical: removed obsolete classical version of elim_format
570 attribute; classical elim/dest rules are now treated uniformly when
571 manipulating the claset.
573 * Provers/classical: stricter checks to ensure that supplied intro,
574 dest and elim rules are well-formed; dest and elim rules must have at
577 * Provers/classical: attributes dest/elim/intro take an optional
578 weight argument for the rule (just as the Pure versions). Weights are
579 ignored by automated tools, but determine the search order of single
582 * Syntax: input syntax now supports dummy variable binding "%_. b",
583 where the body does not mention the bound variable. Note that dummy
584 patterns implicitly depend on their context of bounds, which makes
585 "{_. _}" match any set comprehension as expected. Potential
586 INCOMPATIBILITY -- parse translations need to cope with syntactic
587 constant "_idtdummy" in the binding position.
589 * Syntax: removed obsolete syntactic constant "_K" and its associated
590 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
591 for example "A -> B" => "Pi A (%_. B)".
593 * Pure: 'class_deps' command visualizes the subclass relation, using
594 the graph browser tool.
596 * Pure: 'print_theory' now suppresses certain internal declarations by
597 default; use '!' option for full details.
602 * Method "metis" proves goals by applying the Metis general-purpose
603 resolution prover (see also http://gilith.com/software/metis/).
604 Examples are in the directory MetisExamples. WARNING: the
605 Isabelle/HOL-Metis integration does not yet work properly with
608 * Command 'sledgehammer' invokes external automatic theorem provers as
609 background processes. It generates calls to the "metis" method if
610 successful. These can be pasted into the proof. Users do not have to
611 wait for the automatic provers to return. WARNING: does not really
612 work with multi-threading.
614 * New "auto_quickcheck" feature tests outermost goal statements for
615 potential counter-examples. Controlled by ML references
616 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
617 5000 milliseconds). Fails silently if statements is outside of
618 executable fragment, or any other codgenerator problem occurs.
620 * New constant "undefined" with axiom "undefined x = undefined".
622 * Added class "HOL.eq", allowing for code generation with polymorphic
625 * Some renaming of class constants due to canonical name prefixing in
626 the new 'class' package:
628 HOL.abs ~> HOL.abs_class.abs
629 HOL.divide ~> HOL.divide_class.divide
630 0 ~> HOL.zero_class.zero
631 1 ~> HOL.one_class.one
632 op + ~> HOL.plus_class.plus
633 op - ~> HOL.minus_class.minus
634 uminus ~> HOL.minus_class.uminus
635 op * ~> HOL.times_class.times
636 op < ~> HOL.ord_class.less
637 op <= > HOL.ord_class.less_eq
638 Nat.power ~> Power.power_class.power
639 Nat.size ~> Nat.size_class.size
640 Numeral.number_of ~> Numeral.number_class.number_of
641 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
642 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
643 Orderings.min ~> Orderings.ord_class.min
644 Orderings.max ~> Orderings.ord_class.max
645 Divides.op div ~> Divides.div_class.div
646 Divides.op mod ~> Divides.div_class.mod
647 Divides.op dvd ~> Divides.div_class.dvd
649 INCOMPATIBILITY. Adaptions may be required in the following cases:
651 a) User-defined constants using any of the names "plus", "minus",
652 "times", "less" or "less_eq". The standard syntax translations for
653 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
656 b) Variables named "plus", "minus", "times", "less", "less_eq"
657 INCOMPATIBILITY: use more specific names.
659 c) Permutative equations (e.g. "a + b = b + a")
660 Since the change of names also changes the order of terms, permutative
661 rewrite rules may get applied in a different order. Experience shows
662 that this is rarely the case (only two adaptions in the whole Isabelle
663 distribution). INCOMPATIBILITY: rewrite proofs
665 d) ML code directly refering to constant names
666 This in general only affects hand-written proof tactics, simprocs and
667 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
668 Consider using @{const_name} antiquotation.
670 * New class "default" with associated constant "default".
672 * Function "sgn" is now overloaded and available on int, real, complex
673 (and other numeric types), using class "sgn". Two possible defs of
674 sgn are given as equational assumptions in the classes sgn_if and
675 sgn_div_norm; ordered_idom now also inherits from sgn_if.
678 * Locale "partial_order" now unified with class "order" (cf. theory
679 Orderings), added parameter "less". INCOMPATIBILITY.
681 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
682 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
683 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
685 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
686 changed order of proof goals in instance proofs.
688 * The transitivity reasoner for partial and linear orders is set up
689 for classes "order" and "linorder". Instances of the reasoner are available
690 in all contexts importing or interpreting the corresponding locales.
691 Method "order" invokes the reasoner separately; the reasoner
692 is also integrated with the Simplifier as a solver. Diagnostic
693 command 'print_orders' shows the available instances of the reasoner
694 in the current context.
696 * Localized monotonicity predicate in theory "Orderings"; integrated
697 lemmas max_of_mono and min_of_mono with this predicate.
700 * Formulation of theorem "dense" changed slightly due to integration
701 with new class dense_linear_order.
703 * Uniform lattice theory development in HOL.
705 constants "meet" and "join" now named "inf" and "sup"
706 constant "Meet" now named "Inf"
708 classes "meet_semilorder" and "join_semilorder" now named
709 "lower_semilattice" and "upper_semilattice"
710 class "lorder" now named "lattice"
711 class "comp_lat" now named "complete_lattice"
713 Instantiation of lattice classes allows explicit definitions
714 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
716 INCOMPATIBILITY. Theorem renames:
718 meet_left_le ~> inf_le1
719 meet_right_le ~> inf_le2
720 join_left_le ~> sup_ge1
721 join_right_le ~> sup_ge2
722 meet_join_le ~> inf_sup_ord
725 le_meet ~> le_inf_iff
726 le_join ~> ge_sup_conv
727 meet_idempotent ~> inf_idem
728 join_idempotent ~> sup_idem
729 meet_comm ~> inf_commute
730 join_comm ~> sup_commute
731 meet_leI1 ~> le_infI1
732 meet_leI2 ~> le_infI2
733 le_joinI1 ~> le_supI1
734 le_joinI2 ~> le_supI2
735 meet_assoc ~> inf_assoc
736 join_assoc ~> sup_assoc
737 meet_left_comm ~> inf_left_commute
738 meet_left_idempotent ~> inf_left_idem
739 join_left_comm ~> sup_left_commute
740 join_left_idempotent ~> sup_left_idem
743 le_def_meet ~> le_iff_inf
744 le_def_join ~> le_iff_sup
745 join_absorp2 ~> sup_absorb2
746 join_absorp1 ~> sup_absorb1
747 meet_absorp1 ~> inf_absorb1
748 meet_absorp2 ~> inf_absorb2
749 meet_join_absorp ~> inf_sup_absorb
750 join_meet_absorp ~> sup_inf_absorb
751 distrib_join_le ~> distrib_sup_le
752 distrib_meet_le ~> distrib_inf_le
754 add_meet_distrib_left ~> add_inf_distrib_left
755 add_join_distrib_left ~> add_sup_distrib_left
756 is_join_neg_meet ~> is_join_neg_inf
757 is_meet_neg_join ~> is_meet_neg_sup
758 add_meet_distrib_right ~> add_inf_distrib_right
759 add_join_distrib_right ~> add_sup_distrib_right
760 add_meet_join_distribs ~> add_sup_inf_distribs
761 join_eq_neg_meet ~> sup_eq_neg_inf
762 meet_eq_neg_join ~> inf_eq_neg_sup
763 add_eq_meet_join ~> add_eq_inf_sup
764 meet_0_imp_0 ~> inf_0_imp_0
765 join_0_imp_0 ~> sup_0_imp_0
766 meet_0_eq_0 ~> inf_0_eq_0
767 join_0_eq_0 ~> sup_0_eq_0
768 neg_meet_eq_join ~> neg_inf_eq_sup
769 neg_join_eq_meet ~> neg_sup_eq_inf
770 join_eq_if ~> sup_eq_if
772 mono_meet ~> mono_inf
773 mono_join ~> mono_sup
774 meet_bool_eq ~> inf_bool_eq
775 join_bool_eq ~> sup_bool_eq
776 meet_fun_eq ~> inf_fun_eq
777 join_fun_eq ~> sup_fun_eq
778 meet_set_eq ~> inf_set_eq
779 join_set_eq ~> sup_set_eq
780 meet1_iff ~> inf1_iff
781 meet2_iff ~> inf2_iff
790 join1_iff ~> sup1_iff
791 join2_iff ~> sup2_iff
801 is_meet_Meet ~> is_meet_Inf
802 Meet_bool_def ~> Inf_bool_def
803 Meet_fun_def ~> Inf_fun_def
804 Meet_greatest ~> Inf_greatest
805 Meet_lower ~> Inf_lower
806 Meet_set_def ~> Inf_set_def
809 Sup_bool_eq ~> Sup_bool_def
810 Sup_fun_eq ~> Sup_fun_def
811 Sup_set_eq ~> Sup_set_def
813 listsp_meetI ~> listsp_infI
814 listsp_meet_eq ~> listsp_inf_eq
819 * Added syntactic class "size"; overloaded constant "size" now has
820 type "'a::size ==> bool"
822 * Internal reorganisation of `size' of datatypes: size theorems
823 "foo.size" are no longer subsumed by "foo.simps" (but are still
824 simplification rules by default!); theorems "prod.size" now named
827 * Class "div" now inherits from class "times" rather than "type".
830 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
831 Linorder etc. have disappeared; operations defined in terms of
832 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
834 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
836 * HOL-Word: New extensive library and type for generic, fixed size
837 machine words, with arithemtic, bit-wise, shifting and rotating
838 operations, reflection into int, nat, and bool lists, automation for
839 linear arithmetic (by automatic reflection into nat or int), including
840 lemmas on overflow and monotonicity. Instantiated to all appropriate
841 arithmetic type classes, supporting automatic simplification of
842 numerals on all operations.
844 * Library/Boolean_Algebra: locales for abstract boolean algebras.
846 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
848 * Code generator library theories:
849 - Code_Integer represents HOL integers by big integer literals in target
851 - Code_Char represents HOL characters by character literals in target
853 - Code_Char_chr like Code_Char, but also offers treatment of character
854 codes; includes Code_Integer.
855 - Executable_Set allows to generate code for finite sets using lists.
856 - Executable_Rat implements rational numbers as triples (sign, enumerator,
858 - Executable_Real implements a subset of real numbers, namly those
859 representable by rational numbers.
860 - Efficient_Nat implements natural numbers by integers, which in general will
861 result in higher efficency; pattern matching with 0/Suc is eliminated;
862 includes Code_Integer.
863 - Code_Index provides an additional datatype index which is mapped to
864 target-language built-in integers.
865 - Code_Message provides an additional datatype message_string} which is isomorphic to
866 strings; messages are mapped to target-language strings.
868 * New package for inductive predicates
870 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
873 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
874 for z_1 :: U_1 and ... and z_n :: U_m
876 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
879 with full support for type-inference, rather than
881 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
883 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
884 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
886 inductive "s z_1 ... z_m"
888 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
891 For backward compatibility, there is a wrapper allowing inductive
892 sets to be defined with the new package via
895 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
896 for z_1 :: U_1 and ... and z_n :: U_m
898 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
904 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
905 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
906 for z_1 :: U_1 and ... and z_n :: U_m
908 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
909 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
912 if the additional syntax "p ..." is required.
914 Numerous examples can be found in the subdirectories src/HOL/Auth,
915 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
919 - Since declaration and definition of inductive sets or predicates
920 is no longer separated, abbreviations involving the newly
921 introduced sets or predicates must be specified together with the
922 introduction rules after the 'where' keyword (see above), rather
923 than before the actual inductive definition.
925 - The variables in induction and elimination rules are now
926 quantified in the order of their occurrence in the introduction
927 rules, rather than in alphabetical order. Since this may break
928 some proofs, these proofs either have to be repaired, e.g. by
929 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
930 statements of the form
932 case (rule_i a_i_1 ... a_i_{k_i})
934 or the old order of quantification has to be restored by explicitly adding
935 meta-level quantifiers in the introduction rules, i.e.
937 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
939 - The format of the elimination rules is now
941 p z_1 ... z_m x_1 ... x_n ==>
942 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
947 (x_1, ..., x_n) : s z_1 ... z_m ==>
948 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
953 x : s z_1 ... z_m ==>
954 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
957 This may require terms in goals to be expanded to n-tuples
958 (e.g. using case_tac or simplification with the split_paired_all
959 rule) before the above elimination rule is applicable.
961 - The elimination or case analysis rules for (mutually) inductive
962 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
963 list of rules "p_1_..._p_k.elims" is no longer available.
965 * New package "function"/"fun" for general recursive functions,
966 supporting mutual and nested recursion, definitions in local contexts,
967 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
968 for small examples, and the separate tutorial on the function
969 package. The old recdef "package" is still available as before, but
970 users are encouraged to use the new package.
972 * Method "lexicographic_order" automatically synthesizes termination
973 relations as lexicographic combinations of size measures.
975 * Case-expressions allow arbitrary constructor-patterns (including
976 "_") and take their order into account, like in functional
977 programming. Internally, this is translated into nested
978 case-expressions; missing cases are added and mapped to the predefined
979 constant "undefined". In complicated cases printing may no longer show
980 the original input but the internal form. Lambda-abstractions allow
981 the same form of pattern matching: "% pat1 => e1 | ..." is an
982 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
985 * IntDef: The constant "int :: nat => int" has been removed; now "int"
986 is an abbreviation for "of_nat :: nat => int". The simplification
987 rules for "of_nat" have been changed to work like "int" did
988 previously. Potential INCOMPATIBILITY:
989 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
990 - of_nat_diff and of_nat_mult are no longer default simp rules
992 * Method "algebra" solves polynomial equations over (semi)rings using
993 Groebner bases. The (semi)ring structure is defined by locales and the
994 tool setup depends on that generic context. Installing the method for
995 a specific type involves instantiating the locale and possibly adding
996 declarations for computation on the coefficients. The method is
997 already instantiated for natural numbers and for the axiomatic class
998 of idoms with numerals. See also the paper by Chaieb and Wenzel at
999 CALCULEMUS 2007 for the general principles underlying this
1000 architecture of context-aware proof-tools.
1002 * Method "ferrack" implements quantifier elimination over
1003 special-purpose dense linear orders using locales (analogous to
1004 "algebra"). The method is already installed for class
1005 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1008 * Former constant "List.op @" now named "List.append". Use ML
1009 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1010 circumvent possible incompatibilities when working on ML level.
1012 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1014 * New function listsum :: 'a list => 'a for arbitrary monoids.
1015 Special syntax: "SUM x <- xs. f x" (and latex variants)
1017 * New syntax for Haskell-like list comprehension (input only), eg.
1018 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1020 * The special syntax for function "filter" has changed from [x :
1021 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1022 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1024 * [a..b] is now defined for arbitrary linear orders. It used to be
1025 defined on nat only, as an abbreviation for [a..<Suc b]
1028 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1030 * New functions "sorted" and "sort" in src/HOL/List.thy.
1032 * New lemma collection field_simps (an extension of ring_simps) for
1033 manipulating (in)equations involving division. Multiplies with all
1034 denominators that can be proved to be non-zero (in equations) or
1035 positive/negative (in inequations).
1037 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1038 have been improved and renamed to ring_simps, group_simps and
1039 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1040 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1042 * Theory Library/Commutative_Ring: switched from recdef to function
1043 package; constants add, mul, pow now curried. Infix syntax for
1044 algebraic operations.
1046 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1049 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1052 * HOL/records: generalised field-update to take a function on the
1053 field rather than the new value: r(|A := x|) is translated to A_update
1054 (K x) r The K-combinator that is internally used is called K_record.
1055 INCOMPATIBILITY: Usage of the plain update functions has to be
1058 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1059 * x = 0, which are required for a semiring. Richer structures do not
1060 inherit from semiring_0 anymore, because this property is a theorem
1061 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1062 there is more to prove, but this is mostly trivial.
1064 * Class "recpower" is generalized to arbitrary monoids, not just
1065 commutative semirings. INCOMPATIBILITY: may need to incorporate
1066 commutativity or semiring properties additionally.
1068 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1069 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1070 better use 'abbreviation'.
1072 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1074 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1075 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1076 significant changes for setting up numeral syntax for types:
1077 - New constants Numeral.pred and Numeral.succ instead
1078 of former Numeral.bin_pred and Numeral.bin_succ.
1079 - Use integer operations instead of bin_add, bin_mult and so on.
1080 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1081 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1083 See src/HOL/Integ/IntArith.thy for an example setup.
1085 * Command 'normal_form' computes the normal form of a term that may
1086 contain free variables. For example ``normal_form "rev [a, b, c]"''
1087 produces ``[b, c, a]'' (without proof). This command is suitable for
1088 heavy-duty computations because the functions are compiled to ML
1089 first. Correspondingly, a method "normalization" is provided. See
1090 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1092 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1093 25 like -->); output depends on the "iff" print_mode, the default is
1094 "A = B" (with priority 50).
1096 * Relations less (<) and less_eq (<=) are also available on type bool.
1097 Modified syntax to disallow nesting without explicit parentheses,
1098 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1101 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1103 * Relation composition operator "op O" now has precedence 75 and binds
1104 stronger than union and intersection. INCOMPATIBILITY.
1106 * The old set interval syntax "{m..n(}" (and relatives) has been
1107 removed. Use "{m..<n}" (and relatives) instead.
1109 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1110 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1111 ``declare [[simproc del: neq]]''.
1113 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1116 * Theorem Cons_eq_map_conv no longer declared as "simp".
1118 * Theorem setsum_mult renamed to setsum_right_distrib.
1120 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1123 * Reimplemented methods "sat" and "satx", with several improvements:
1124 goals no longer need to be stated as "<prems> ==> False", equivalences
1125 (i.e. "=" on type bool) are handled, variable names of the form
1126 "lit_<n>" are no longer reserved, significant speedup.
1128 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1129 zChaff is still supported as well.
1131 * 'inductive' and 'datatype': provide projections of mutual rules,
1132 bundled as foo_bar.inducts;
1134 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1137 * Library: moved theory Accessible_Part to main HOL.
1139 * Library: added theory Coinductive_List of potentially infinite lists
1140 as greatest fixed-point.
1142 * Library: added theory AssocList which implements (finite) maps as
1145 * Method "evaluation" solves goals (i.e. a boolean expression)
1146 efficiently by compiling it to ML. The goal is "proved" (via an
1147 oracle) if it evaluates to True.
1149 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1150 also when invoked by the simplifier. This results in the Simplifier
1151 being more powerful on arithmetic goals. INCOMPATIBILITY.
1152 Configuration option fast_arith_split_limit=0 recovers the old
1155 * Support for hex (0x20) and binary (0b1001) numerals.
1157 * New method: reify eqs (t), where eqs are equations for an
1158 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1159 parameter, computes a term s::'b and a list xs::'a list and proves the
1160 theorem I xs s = t. This is also known as reification or quoting. The
1161 resulting theorem is applied to the subgoal to substitute t with I xs
1162 s. If t is omitted, the subgoal itself is reified.
1164 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1165 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1166 where f is supposed to be a computable function (in the sense of code
1167 generattion). The method uses reify to compute s and xs as above then
1168 applies corr_thm and uses normalization by evaluation to "prove" f s =
1169 r and finally gets the theorem t = r, which is again applied to the
1170 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1172 * Reflection: Automatic reification now handels binding, an example is
1173 available in src/HOL/ex/ReflectionEx.thy
1175 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1176 command 'statespace' that is similar to 'record', but introduces an
1177 abstract specification based on the locale infrastructure instead of
1178 HOL types. This leads to extra flexibility in composing state spaces,
1179 in particular multiple inheritance and renaming of components.
1184 * Hyperreal: Functions root and sqrt are now defined on negative real
1185 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1186 Nonnegativity side conditions have been removed from many lemmas, so
1187 that more subgoals may now be solved by simplification; potential
1190 * Real: new type classes formalize real normed vector spaces and
1191 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1192 and norm :: 'a => real.
1194 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1195 reals into other types. The overloaded constant Reals :: 'a set is now
1196 defined as range of_real; potential INCOMPATIBILITY.
1198 * Real: proper support for ML code generation, including 'quickcheck'.
1199 Reals are implemented as arbitrary precision rationals.
1201 * Hyperreal: Several constants that previously worked only for the
1202 reals have been generalized, so they now work over arbitrary vector
1203 spaces. Type annotations may need to be added in some cases; potential
1206 Infinitesimal :: ('a::real_normed_vector) star set
1207 HFinite :: ('a::real_normed_vector) star set
1208 HInfinite :: ('a::real_normed_vector) star set
1209 approx :: ('a::real_normed_vector) star => 'a star => bool
1210 monad :: ('a::real_normed_vector) star => 'a star set
1211 galaxy :: ('a::real_normed_vector) star => 'a star set
1212 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1213 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1214 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1215 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1216 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
1217 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
1218 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
1219 sgn :: 'a::real_normed_vector => 'a
1220 exp :: 'a::{recpower,real_normed_field,banach} => 'a
1222 * Complex: Some complex-specific constants are now abbreviations for
1223 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
1224 hnorm. Other constants have been entirely removed in favor of the
1225 polymorphic versions (INCOMPATIBILITY):
1229 HInfinite <-- CInfinite
1230 Infinitesimal <-- CInfinitesimal
1233 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
1234 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
1235 (ns)deriv <-- (ns)cderiv
1240 * Formalisation of ideals and the quotient construction over rings.
1242 * Order and lattice theory no longer based on records.
1245 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
1246 greatest_closed. INCOMPATIBILITY.
1248 * Method algebra is now set up via an attribute. For examples see
1249 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
1250 of algebraic structures.
1252 * Renamed theory CRing to Ring.
1257 * Substantial, yet incomplete support for nominal datatypes (binding
1258 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
1259 src/HOL/Nominal/Examples. Prospective users should consult
1260 http://isabelle.in.tum.de/nominal/
1265 * ML basics: just one true type int, which coincides with IntInf.int
1268 * ML within Isar: antiquotations allow to embed statically-checked
1269 formal entities in the source, referring to the context available at
1270 compile-time. For example:
1272 ML {* @{sort "{zero,one}"} *}
1273 ML {* @{typ "'a => 'b"} *}
1274 ML {* @{term "%x. x"} *}
1275 ML {* @{prop "x == y"} *}
1276 ML {* @{ctyp "'a => 'b"} *}
1277 ML {* @{cterm "%x. x"} *}
1278 ML {* @{cprop "x == y"} *}
1279 ML {* @{thm asm_rl} *}
1280 ML {* @{thms asm_rl} *}
1281 ML {* @{type_name c} *}
1282 ML {* @{type_syntax c} *}
1283 ML {* @{const_name c} *}
1284 ML {* @{const_syntax c} *}
1287 ML {* @{theory Pure} *}
1288 ML {* @{theory_ref} *}
1289 ML {* @{theory_ref Pure} *}
1292 ML {* @{clasimpset} *}
1294 The same works for sources being ``used'' within an Isar context.
1296 * ML in Isar: improved error reporting; extra verbosity with
1297 ML_Context.trace enabled.
1299 * Pure/General/table.ML: the join operations now works via exceptions
1300 DUP/SAME instead of type option. This is simpler in simple cases, and
1301 admits slightly more efficient complex applications.
1303 * Pure: 'advanced' translation functions (parse_translation etc.) now
1304 use Context.generic instead of just theory.
1306 * Pure: datatype Context.generic joins theory/Proof.context and
1307 provides some facilities for code that works in either kind of
1308 context, notably GenericDataFun for uniform theory and proof data.
1310 * Pure: simplified internal attribute type, which is now always
1311 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
1312 local (Proof.context) attributes have been discontinued, while
1313 minimizing code duplication. Thm.rule_attribute and
1314 Thm.declaration_attribute build canonical attributes; see also structure
1315 Context for further operations on Context.generic, notably
1316 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
1317 declarations and definitions.
1319 * Context data interfaces (Theory/Proof/GenericDataFun): removed
1320 name/print, uninitialized data defaults to ad-hoc copy of empty value,
1321 init only required for impure data. INCOMPATIBILITY: empty really need
1322 to be empty (no dependencies on theory content!)
1324 * Pure/kernel: consts certification ignores sort constraints given in
1325 signature declarations. (This information is not relevant to the
1326 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
1327 potential INCOMPATIBILITY.
1329 * Pure: axiomatic type classes are now purely definitional, with
1330 explicit proofs of class axioms and super class relations performed
1331 internally. See Pure/axclass.ML for the main internal interfaces --
1332 notably AxClass.define_class supercedes AxClass.add_axclass, and
1333 AxClass.axiomatize_class/classrel/arity supersede
1334 Sign.add_classes/classrel/arities.
1336 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
1337 global/local versions on theory vs. Proof.context have been
1338 discontinued; Attrib.syntax and Method.syntax have been adapted
1339 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
1340 attributes, methods, etc.
1342 * Pure: several functions of signature "... -> theory -> theory * ..."
1343 have been reoriented to "... -> theory -> ... * theory" in order to
1344 allow natural usage in combination with the ||>, ||>>, |-> and
1345 fold_map combinators.
1347 * Pure: official theorem names (closed derivations) and additional
1348 comments (tags) are now strictly separate. Name hints -- which are
1349 maintained as tags -- may be attached any time without affecting the
1352 * Pure: primitive rule lift_rule now takes goal cterm instead of an
1353 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
1354 achieve the old behaviour.
1356 * Pure: the "Goal" constant is now called "prop", supporting a
1357 slightly more general idea of ``protecting'' meta-level rule
1360 * Pure: Logic.(un)varify only works in a global context, which is now
1361 enforced instead of silently assumed. INCOMPATIBILITY, may use
1362 Logic.legacy_(un)varify as temporary workaround.
1364 * Pure: structure Name provides scalable operations for generating
1365 internal variable names, notably Name.variants etc. This replaces
1366 some popular functions from term.ML:
1368 Term.variant -> Name.variant
1369 Term.variantlist -> Name.variant_list
1370 Term.invent_names -> Name.invent_list
1372 Note that low-level renaming rarely occurs in new code -- operations
1373 from structure Variable are used instead (see below).
1375 * Pure: structure Variable provides fundamental operations for proper
1376 treatment of fixed/schematic variables in a context. For example,
1377 Variable.import introduces fixes for schematics of given facts and
1378 Variable.export reverses the effect (up to renaming) -- this replaces
1379 various freeze_thaw operations.
1381 * Pure: structure Goal provides simple interfaces for
1382 init/conclude/finish and tactical prove operations (replacing former
1383 Tactic.prove). Goal.prove is the canonical way to prove results
1384 within a given context; Goal.prove_global is a degraded version for
1385 theory level goals, including a global Drule.standard. Note that
1386 OldGoals.prove_goalw_cterm has long been obsolete, since it is
1387 ill-behaved in a local proof context (e.g. with local fixes/assumes or
1388 in a locale context).
1390 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
1391 and type checking (Syntax.check_term etc.), with common combinations
1392 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
1393 which are considered legacy and await removal.
1395 * Pure/Syntax: generic interfaces for type unchecking
1396 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
1397 with common combinations (Syntax.pretty_term, Syntax.string_of_term
1398 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
1399 available for convenience, but refer to the very same operations using
1400 a mere theory instead of a full context.
1402 * Isar: simplified treatment of user-level errors, using exception
1403 ERROR of string uniformly. Function error now merely raises ERROR,
1404 without any side effect on output channels. The Isar toplevel takes
1405 care of proper display of ERROR exceptions. ML code may use plain
1406 handle/can/try; cat_error may be used to concatenate errors like this:
1408 ... handle ERROR msg => cat_error msg "..."
1410 Toplevel ML code (run directly or through the Isar toplevel) may be
1411 embedded into the Isar toplevel with exception display/debug like
1414 Isar.toplevel (fn () => ...)
1416 INCOMPATIBILITY, removed special transform_error facilities, removed
1417 obsolete variants of user-level exceptions (ERROR_MESSAGE,
1418 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
1419 -- use plain ERROR instead.
1421 * Isar: theory setup now has type (theory -> theory), instead of a
1422 list. INCOMPATIBILITY, may use #> to compose setup functions.
1424 * Isar: ML toplevel pretty printer for type Proof.context, subject to
1425 ProofContext.debug/verbose flags.
1427 * Isar: Toplevel.theory_to_proof admits transactions that modify the
1428 theory before entering a proof state. Transactions now always see a
1429 quasi-functional intermediate checkpoint, both in interactive and
1432 * Isar: simplified interfaces for outer syntax. Renamed
1433 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
1434 OuterSyntax.add_parsers -- this functionality is now included in
1435 OuterSyntax.command etc. INCOMPATIBILITY.
1437 * Simplifier: the simpset of a running simplification process now
1438 contains a proof context (cf. Simplifier.the_context), which is the
1439 very context that the initial simpset has been retrieved from (by
1440 simpset_of/local_simpset_of). Consequently, all plug-in components
1441 (solver, looper etc.) may depend on arbitrary proof data.
1443 * Simplifier.inherit_context inherits the proof context (plus the
1444 local bounds) of the current simplification process; any simproc
1445 etc. that calls the Simplifier recursively should do this! Removed
1446 former Simplifier.inherit_bounds, which is already included here --
1447 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
1448 specify an explicit context using Simplifier.context/theory_context.
1450 * Simplifier/Classical Reasoner: more abstract interfaces
1451 change_simpset/claset for modifying the simpset/claset reference of a
1452 theory; raw versions simpset/claset_ref etc. have been discontinued --
1455 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
1461 * settings: the default heap location within ISABELLE_HOME_USER now
1462 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
1463 Isabelle installations.
1465 * isabelle-process: option -S (secure mode) disables some critical
1466 operations, notably runtime compilation and evaluation of ML source
1469 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
1471 * Support for parallel execution, using native multicore support of
1472 Poly/ML 5.1. The theory loader exploits parallelism when processing
1473 independent theories, according to the given theory header
1474 specifications. The maximum number of worker threads is specified via
1475 usedir option -M or the "max-threads" setting in Proof General. A
1476 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
1477 to 6 on a 8-core machine. User-code needs to observe certain
1478 guidelines for thread-safe programming, see appendix A in the Isar
1479 Implementation manual.
1483 New in Isabelle2005 (October 2005)
1484 ----------------------------------
1488 * Theory headers: the new header syntax for Isar theories is
1491 imports <theory1> ... <theoryN>
1492 uses <file1> ... <fileM>
1495 where the 'uses' part is optional. The previous syntax
1497 theory <name> = <theory1> + ... + <theoryN>:
1499 will disappear in the next release. Use isatool fixheaders to convert
1500 existing theory files. Note that there is no change in ancient
1501 non-Isar theories now, but these will disappear soon.
1503 * Theory loader: parent theories can now also be referred to via
1504 relative and absolute paths.
1506 * Command 'find_theorems' searches for a list of criteria instead of a
1507 list of constants. Known criteria are: intro, elim, dest, name:string,
1508 simp:term, and any term. Criteria can be preceded by '-' to select
1509 theorems that do not match. Intro, elim, dest select theorems that
1510 match the current goal, name:s selects theorems whose fully qualified
1511 name contain s, and simp:term selects all simplification rules whose
1512 lhs match term. Any other term is interpreted as pattern and selects
1513 all theorems matching the pattern. Available in ProofGeneral under
1514 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
1516 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
1518 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
1519 matching the current goal as introduction rule and not having "HOL."
1520 in their name (i.e. not being defined in theory HOL).
1522 * Command 'thms_containing' has been discontinued in favour of
1523 'find_theorems'; INCOMPATIBILITY.
1525 * Communication with Proof General is now 8bit clean, which means that
1526 Unicode text in UTF-8 encoding may be used within theory texts (both
1527 formal and informal parts). Cf. option -U of the Isabelle Proof
1528 General interface. Here are some simple examples (cf. src/HOL/ex):
1530 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
1531 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
1533 * Improved efficiency of the Simplifier and, to a lesser degree, the
1534 Classical Reasoner. Typical big applications run around 2 times
1538 *** Document preparation ***
1540 * Commands 'display_drafts' and 'print_drafts' perform simple output
1541 of raw sources. Only those symbols that do not require additional
1542 LaTeX packages (depending on comments in isabellesym.sty) are
1543 displayed properly, everything else is left verbatim. isatool display
1544 and isatool print are used as front ends (these are subject to the
1545 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
1547 * Command tags control specific markup of certain regions of text,
1548 notably folding and hiding. Predefined tags include "theory" (for
1549 theory begin and end), "proof" for proof commands, and "ML" for
1550 commands involving ML code; the additional tags "visible" and
1551 "invisible" are unused by default. Users may give explicit tag
1552 specifications in the text, e.g. ''by %invisible (auto)''. The
1553 interpretation of tags is determined by the LaTeX job during document
1554 preparation: see option -V of isatool usedir, or options -n and -t of
1555 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
1558 Several document versions may be produced at the same time via isatool
1559 usedir (the generated index.html will link all of them). Typical
1560 specifications include ''-V document=theory,proof,ML'' to present
1561 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
1562 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
1563 these parts without any formal replacement text. The Isabelle site
1564 default settings produce ''document'' and ''outline'' versions as
1567 * Several new antiquotations:
1569 @{term_type term} prints a term with its type annotated;
1571 @{typeof term} prints the type of a term;
1573 @{const const} is the same as @{term const}, but checks that the
1574 argument is a known logical constant;
1576 @{term_style style term} and @{thm_style style thm} print a term or
1577 theorem applying a "style" to it
1581 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
1582 definitions, equations, inequations etc., 'concl' printing only the
1583 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
1584 to print the specified premise. TermStyle.add_style provides an ML
1585 interface for introducing further styles. See also the "LaTeX Sugar"
1586 document practical applications. The ML antiquotation prints
1587 type-checked ML expressions verbatim.
1589 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
1590 and 'text' support optional locale specification '(in loc)', which
1591 specifies the default context for interpreting antiquotations. For
1592 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
1594 * Option 'locale=NAME' of antiquotations specifies an alternative
1595 context interpreting the subsequent argument. For example: @{thm
1596 [locale=lattice] inf_assoc}.
1598 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
1601 * Proper output of antiquotations for theory commands involving a
1602 proof context (such as 'locale' or 'theorem (in loc) ...').
1604 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
1605 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
1607 * isatool usedir: new option -C (default true) controls whether option
1608 -D should include a copy of the original document directory; -C false
1609 prevents unwanted effects such as copying of administrative CVS data.
1614 * Considerably improved version of 'constdefs' command. Now performs
1615 automatic type-inference of declared constants; additional support for
1616 local structure declarations (cf. locales and HOL records), see also
1617 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
1618 sequential dependencies of definitions within a single 'constdefs'
1619 section; moreover, the declared name needs to be an identifier. If
1620 all fails, consider to fall back on 'consts' and 'defs' separately.
1622 * Improved indexed syntax and implicit structures. First of all,
1623 indexed syntax provides a notational device for subscripted
1624 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
1625 expressions. Secondly, in a local context with structure
1626 declarations, number indexes \<^sub>n or the empty index (default
1627 number 1) refer to a certain fixed variable implicitly; option
1628 show_structs controls printing of implicit structures. Typical
1629 applications of these concepts involve record types and locales.
1631 * New command 'no_syntax' removes grammar declarations (and
1632 translations) resulting from the given syntax specification, which is
1633 interpreted in the same manner as for the 'syntax' command.
1635 * 'Advanced' translation functions (parse_translation etc.) may depend
1636 on the signature of the theory context being presently used for
1637 parsing/printing, see also isar-ref manual.
1639 * Improved 'oracle' command provides a type-safe interface to turn an
1640 ML expression of type theory -> T -> term into a primitive rule of
1641 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
1642 is already included here); see also FOL/ex/IffExample.thy;
1645 * axclass: name space prefix for class "c" is now "c_class" (was "c"
1646 before); "cI" is no longer bound, use "c.intro" instead.
1647 INCOMPATIBILITY. This change avoids clashes of fact bindings for
1648 axclasses vs. locales.
1650 * Improved internal renaming of symbolic identifiers -- attach primes
1651 instead of base 26 numbers.
1653 * New flag show_question_marks controls printing of leading question
1654 marks in schematic variable names.
1656 * In schematic variable names, *any* symbol following \<^isub> or
1657 \<^isup> is now treated as part of the base name. For example, the
1658 following works without printing of awkward ".0" indexes:
1660 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
1663 * Inner syntax includes (*(*nested*) comments*).
1665 * Pretty printer now supports unbreakable blocks, specified in mixfix
1666 annotations as "(00...)".
1668 * Clear separation of logical types and nonterminals, where the latter
1669 may only occur in 'syntax' specifications or type abbreviations.
1670 Before that distinction was only partially implemented via type class
1671 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
1672 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
1673 exotic syntax specifications may require further adaption
1674 (e.g. Cube/Cube.thy).
1676 * Removed obsolete type class "logic", use the top sort {} instead.
1677 Note that non-logical types should be declared as 'nonterminals'
1678 rather than 'types'. INCOMPATIBILITY for new object-logic
1681 * Attributes 'induct' and 'cases': type or set names may now be
1682 locally fixed variables as well.
1684 * Simplifier: can now control the depth to which conditional rewriting
1685 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
1688 * Simplifier: simplification procedures may now take the current
1689 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
1690 interface), which is very useful for calling the Simplifier
1691 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
1692 is gone -- use prems_of_ss on the simpset instead. Moreover, the
1693 low-level mk_simproc no longer applies Logic.varify internally, to
1694 allow for use in a context of fixed variables.
1696 * thin_tac now works even if the assumption being deleted contains !!
1697 or ==>. More generally, erule now works even if the major premise of
1698 the elimination rule contains !! or ==>.
1700 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
1702 * Reorganized bootstrapping of the Pure theories; CPure is now derived
1703 from Pure, which contains all common declarations already. Both
1704 theories are defined via plain Isabelle/Isar .thy files.
1705 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
1706 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
1707 use isatool fixcpure to adapt your theory and ML sources.
1709 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
1710 selections of theorems in named facts via index ranges.
1712 * 'print_theorems': in theory mode, really print the difference
1713 wrt. the last state (works for interactive theory development only),
1714 in proof mode print all local facts (cf. 'print_facts');
1716 * 'hide': option '(open)' hides only base names.
1718 * More efficient treatment of intermediate checkpoints in interactive
1721 * Code generator is now invoked via code_module (incremental code
1722 generation) and code_library (modular code generation, ML structures
1723 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
1724 must be quoted when used as identifiers.
1726 * New 'value' command for reading, evaluating and printing terms using
1727 the code generator. INCOMPATIBILITY: command keyword 'value' must be
1728 quoted when used as identifier.
1733 * New commands for the interpretation of locale expressions in
1734 theories (1), locales (2) and proof contexts (3). These generate
1735 proof obligations from the expression specification. After the
1736 obligations have been discharged, theorems of the expression are added
1737 to the theory, target locale or proof context. The synopsis of the
1738 commands is a follows:
1740 (1) interpretation expr inst
1741 (2) interpretation target < expr
1742 (3) interpret expr inst
1744 Interpretation in theories and proof contexts require a parameter
1745 instantiation of terms from the current context. This is applied to
1746 specifications and theorems of the interpreted expression.
1747 Interpretation in locales only permits parameter renaming through the
1748 locale expression. Interpretation is smart in that interpretations
1749 that are active already do not occur in proof obligations, neither are
1750 instantiated theorems stored in duplicate. Use 'print_interps' to
1751 inspect active interpretations of a particular locale. For details,
1752 see the Isar Reference manual. Examples can be found in
1753 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
1755 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
1756 'interpret' instead.
1758 * New context element 'constrains' for adding type constraints to
1761 * Context expressions: renaming of parameters with syntax
1764 * Locale declaration: 'includes' disallowed.
1766 * Proper static binding of attribute syntax -- i.e. types / terms /
1767 facts mentioned as arguments are always those of the locale definition
1768 context, independently of the context of later invocations. Moreover,
1769 locale operations (renaming and type / term instantiation) are applied
1770 to attribute arguments as expected.
1772 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
1773 actual attributes; rare situations may require Attrib.attribute to
1774 embed those attributes into Attrib.src that lack concrete syntax.
1775 Attribute implementations need to cooperate properly with the static
1776 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
1777 Attrib.XXX_thm etc. already do the right thing without further
1778 intervention. Only unusual applications -- such as "where" or "of"
1779 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
1780 on the context and the facts involved -- may have to assign parsed
1781 values to argument tokens explicitly.
1783 * Changed parameter management in theorem generation for long goal
1784 statements with 'includes'. INCOMPATIBILITY: produces a different
1785 theorem statement in rare situations.
1787 * Locale inspection command 'print_locale' omits notes elements. Use
1788 'print_locale!' to have them included in the output.
1793 * Provers/hypsubst.ML: improved version of the subst method, for
1794 single-step rewriting: it now works in bound variable contexts. New is
1795 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
1796 rewrite a different subterm than the original subst method, which is
1797 still available as 'simplesubst'.
1799 * Provers/quasi.ML: new transitivity reasoners for transitivity only
1802 * Provers/trancl.ML: new transitivity reasoner for transitive and
1803 reflexive-transitive closure of relations.
1805 * Provers/blast.ML: new reference depth_limit to make blast's depth
1806 limit (previously hard-coded with a value of 20) user-definable.
1808 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
1809 is peformed already. Object-logics merely need to finish their
1810 initial simpset configuration as before. INCOMPATIBILITY.
1815 * Symbolic syntax of Hilbert Choice Operator is now as follows:
1818 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
1820 The symbol \<some> is displayed as the alternative epsilon of LaTeX
1821 and x-symbol; use option '-m epsilon' to get it actually printed.
1822 Moreover, the mathematically important symbolic identifier \<epsilon>
1823 becomes available as variable, constant etc. INCOMPATIBILITY,
1825 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
1826 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
1827 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
1828 support corresponding Isar calculations.
1830 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
1833 * theory SetInterval: changed the syntax for open intervals:
1842 The old syntax is still supported but will disappear in the next
1843 release. For conversion use the following Emacs search and replace
1844 patterns (these are not perfect but work quite well):
1846 {)\([^\.]*\)\.\. -> {\1<\.\.}
1847 \.\.\([^(}]*\)(} -> \.\.<\1}
1849 * Theory Commutative_Ring (in Library): method comm_ring for proving
1850 equalities in commutative rings; method 'algebra' provides a generic
1853 * Theory Finite_Set: changed the syntax for 'setsum', summation over
1854 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
1855 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
1858 Some new syntax forms are available:
1860 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
1861 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
1862 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
1863 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
1865 The latter form "\<Sum>x < k. e" used to be based on a separate
1866 function "Summation", which has been discontinued.
1868 * theory Finite_Set: in structured induction proofs, the insert case
1869 is now 'case (insert x F)' instead of the old counterintuitive 'case
1872 * The 'refute' command has been extended to support a much larger
1873 fragment of HOL, including axiomatic type classes, constdefs and
1874 typedefs, inductive datatypes and recursion.
1876 * New tactics 'sat' and 'satx' to prove propositional tautologies.
1877 Requires zChaff with proof generation to be installed. See
1878 HOL/ex/SAT_Examples.thy for examples.
1880 * Datatype induction via method 'induct' now preserves the name of the
1881 induction variable. For example, when proving P(xs::'a list) by
1882 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
1883 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
1884 in unstructured proof scripts.
1886 * Reworked implementation of records. Improved scalability for
1887 records with many fields, avoiding performance problems for type
1888 inference. Records are no longer composed of nested field types, but
1889 of nested extension types. Therefore the record type only grows linear
1890 in the number of extensions and not in the number of fields. The
1891 top-level (users) view on records is preserved. Potential
1892 INCOMPATIBILITY only in strange cases, where the theory depends on the
1893 old record representation. The type generated for a record is called
1894 <record_name>_ext_type.
1896 Flag record_quick_and_dirty_sensitive can be enabled to skip the
1897 proofs triggered by a record definition or a simproc (if
1898 quick_and_dirty is enabled). Definitions of large records can take
1901 New simproc record_upd_simproc for simplification of multiple record
1902 updates enabled by default. Moreover, trivial updates are also
1903 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
1904 occasionally, since simplification is more powerful by default.
1906 * typedef: proper support for polymorphic sets, which contain extra
1907 type-variables in the term.
1909 * Simplifier: automatically reasons about transitivity chains
1910 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
1911 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
1912 old proofs break occasionally as simplification may now solve more
1913 goals than previously.
1915 * Simplifier: converts x <= y into x = y if assumption y <= x is
1916 present. Works for all partial orders (class "order"), in particular
1917 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
1920 * Simplifier: new simproc for "let x = a in f x". If a is a free or
1921 bound variable or a constant then the let is unfolded. Otherwise
1922 first a is simplified to b, and then f b is simplified to g. If
1923 possible we abstract b from g arriving at "let x = b in h x",
1924 otherwise we unfold the let and arrive at g. The simproc can be
1925 enabled/disabled by the reference use_let_simproc. Potential
1926 INCOMPATIBILITY since simplification is more powerful by default.
1928 * Classical reasoning: the meson method now accepts theorems as arguments.
1930 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
1931 jobs to provide advice on the provability of subgoals.
1933 * Theory OrderedGroup and Ring_and_Field: various additions and
1934 improvements to faciliate calculations involving equalities and
1937 The following theorems have been eliminated or modified
1940 abs_eq now named abs_of_nonneg
1941 abs_of_ge_0 now named abs_of_nonneg
1942 abs_minus_eq now named abs_of_nonpos
1943 imp_abs_id now named abs_of_nonneg
1944 imp_abs_neg_id now named abs_of_nonpos
1945 mult_pos now named mult_pos_pos
1946 mult_pos_le now named mult_nonneg_nonneg
1947 mult_pos_neg_le now named mult_nonneg_nonpos
1948 mult_pos_neg2_le now named mult_nonneg_nonpos2
1949 mult_neg now named mult_neg_neg
1950 mult_neg_le now named mult_nonpos_nonpos
1952 * The following lemmas in Ring_and_Field have been added to the simplifier:
1955 not_square_less_zero
1957 The following lemmas have been deleted from Real/RealPow:
1967 * Theory Parity: added rules for simplifying exponents.
1971 The following theorems have been eliminated or modified
1974 list_all_Nil now named list_all.simps(1)
1975 list_all_Cons now named list_all.simps(2)
1976 list_all_conv now named list_all_iff
1977 set_mem_eq now named mem_iff
1979 * Theories SetsAndFunctions and BigO (see HOL/Library) support
1980 asymptotic "big O" calculations. See the notes in BigO.thy.
1985 * Theory RealDef: better support for embedding natural numbers and
1986 integers in the reals.
1988 The following theorems have been eliminated or modified
1991 exp_ge_add_one_self now requires no hypotheses
1992 real_of_int_add reversed direction of equality (use [symmetric])
1993 real_of_int_minus reversed direction of equality (use [symmetric])
1994 real_of_int_diff reversed direction of equality (use [symmetric])
1995 real_of_int_mult reversed direction of equality (use [symmetric])
1997 * Theory RComplete: expanded support for floor and ceiling functions.
1999 * Theory Ln is new, with properties of the natural logarithm
2001 * Hyperreal: There is a new type constructor "star" for making
2002 nonstandard types. The old type names are now type synonyms:
2006 hcomplex = complex star
2008 * Hyperreal: Many groups of similarly-defined constants have been
2009 replaced by polymorphic versions (INCOMPATIBILITY):
2011 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2013 starset <-- starsetNat, starsetC
2014 *s* <-- *sNat*, *sc*
2015 starset_n <-- starsetNat_n, starsetC_n
2016 *sn* <-- *sNatn*, *scn*
2017 InternalSets <-- InternalNatSets, InternalCSets
2019 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2020 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2021 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2022 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2023 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2025 * Hyperreal: Many type-specific theorems have been removed in favor of
2026 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2028 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2029 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2030 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2031 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2032 right_minus <-- hypreal_add_minus
2033 left_minus <-- {hypreal,hcomplex}_add_minus_left
2034 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2035 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2036 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2037 mult_1_right <-- hcomplex_mult_one_right
2038 mult_zero_left <-- hcomplex_mult_zero_left
2039 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2040 right_distrib <-- hypnat_add_mult_distrib2
2041 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2042 right_inverse <-- hypreal_mult_inverse
2043 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2044 order_refl <-- {hypreal,hypnat}_le_refl
2045 order_trans <-- {hypreal,hypnat}_le_trans
2046 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2047 order_less_le <-- {hypreal,hypnat}_less_le
2048 linorder_linear <-- {hypreal,hypnat}_le_linear
2049 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2050 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2051 add_nonneg_nonneg <-- hypreal_le_add_order
2053 * Hyperreal: Separate theorems having to do with type-specific
2054 versions of constants have been merged into theorems that apply to the
2055 new polymorphic constants (INCOMPATIBILITY):
2057 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2058 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2059 STAR_Un <-- {STAR,NatStar,STARC}_Un
2060 STAR_Int <-- {STAR,NatStar,STARC}_Int
2061 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2062 STAR_subset <-- {STAR,NatStar,STARC}_subset
2063 STAR_mem <-- {STAR,NatStar,STARC}_mem
2064 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2065 STAR_diff <-- {STAR,STARC}_diff
2066 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2067 STARC_hcomplex_of_complex}_image_subset
2068 starset_n_Un <-- starset{Nat,C}_n_Un
2069 starset_n_Int <-- starset{Nat,C}_n_Int
2070 starset_n_Compl <-- starset{Nat,C}_n_Compl
2071 starset_n_diff <-- starset{Nat,C}_n_diff
2072 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2073 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2074 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2075 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2076 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2077 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2078 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2079 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2080 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2081 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2082 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2083 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2084 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2085 starfun_diff <-- starfun{C,RC,CR}_diff
2086 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2087 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2088 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2089 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2090 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2091 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2092 starfun_Id <-- starfunC_Id
2093 starfun_approx <-- starfun{Nat,CR}_approx
2094 starfun_capprox <-- starfun{C,RC}_capprox
2095 starfun_abs <-- starfunNat_rabs
2096 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2097 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2098 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2099 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2100 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2101 starfun_add_approx <-- starfunCR_add_approx
2102 starfun_inverse_inverse <-- starfunC_inverse_inverse
2103 starfun_divide <-- starfun{C,CR,RC}_divide
2104 starfun_n <-- starfun{Nat,C}_n
2105 starfun_n_mult <-- starfun{Nat,C}_n_mult
2106 starfun_n_add <-- starfun{Nat,C}_n_add
2107 starfun_n_add_minus <-- starfunNat_n_add_minus
2108 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2109 starfun_n_minus <-- starfun{Nat,C}_n_minus
2110 starfun_n_eq <-- starfun{Nat,C}_n_eq
2112 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2113 star_n_minus <-- {hypreal,hcomplex}_minus
2114 star_n_diff <-- {hypreal,hcomplex}_diff
2115 star_n_mult <-- {hypreal,hcomplex}_mult
2116 star_n_inverse <-- {hypreal,hcomplex}_inverse
2117 star_n_le <-- {hypreal,hypnat}_le
2118 star_n_less <-- {hypreal,hypnat}_less
2119 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2120 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2121 star_n_abs <-- hypreal_hrabs
2122 star_n_divide <-- hcomplex_divide
2124 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2125 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2126 star_of_diff <-- hypreal_of_real_diff
2127 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2128 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2129 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2130 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2131 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2132 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2133 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2134 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2135 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2136 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2137 star_of_number_of <-- {hypreal,hcomplex}_number_of
2138 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2139 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2140 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2141 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2142 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2143 star_of_power <-- hypreal_of_real_power
2144 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2146 * Hyperreal: new method "transfer" that implements the transfer
2147 principle of nonstandard analysis. With a subgoal that mentions
2148 nonstandard types like "'a star", the command "apply transfer"
2149 replaces it with an equivalent one that mentions only standard types.
2150 To be successful, all free variables must have standard types; non-
2151 standard variables must have explicit universal quantifiers.
2153 * Hyperreal: A theory of Taylor series.
2158 * Discontinued special version of 'constdefs' (which used to support
2159 continuous functions) in favor of the general Pure one with full
2162 * New simplification procedure for solving continuity conditions; it
2163 is much faster on terms with many nested lambda abstractions (cubic
2164 instead of exponential time).
2166 * New syntax for domain package: selector names are now optional.
2167 Parentheses should be omitted unless argument is lazy, for example:
2169 domain 'a stream = cons "'a" (lazy "'a stream")
2171 * New command 'fixrec' for defining recursive functions with pattern
2172 matching; defining multiple functions with mutual recursion is also
2173 supported. Patterns may include the constants cpair, spair, up, sinl,
2174 sinr, or any data constructor defined by the domain package. The given
2175 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2176 syntax and examples.
2178 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2179 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2180 but the proof obligation additionally includes an admissibility
2181 requirement. The packages generate instances of class cpo or pcpo,
2182 with continuity and strictness theorems for Rep and Abs.
2184 * HOLCF: Many theorems have been renamed according to a more standard naming
2185 scheme (INCOMPATIBILITY):
2187 foo_inject: "foo$x = foo$y ==> x = y"
2188 foo_eq: "(foo$x = foo$y) = (x = y)"
2189 foo_less: "(foo$x << foo$y) = (x << y)"
2190 foo_strict: "foo$UU = UU"
2191 foo_defined: "... ==> foo$x ~= UU"
2192 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2197 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2198 including the First Isomorphism Theorem (on quotienting by the kernel
2201 * ZF/Simplifier: install second copy of type solver that actually
2202 makes use of TC rules declared to Isar proof contexts (or locales);
2203 the old version is still required for ML proof scripts.
2208 * Converted to Isar theory format; use locales instead of axiomatic
2214 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
2217 * Pure/library.ML no longer defines its own option datatype, but uses
2218 that of the SML basis, which has constructors NONE and SOME instead of
2219 None and Some, as well as exception Option.Option instead of OPTION.
2220 The functions the, if_none, is_some, is_none have been adapted
2221 accordingly, while Option.map replaces apsome.
2223 * Pure/library.ML: the exception LIST has been given up in favour of
2224 the standard exceptions Empty and Subscript, as well as
2225 Library.UnequalLengths. Function like Library.hd and Library.tl are
2226 superceded by the standard hd and tl functions etc.
2228 A number of basic list functions are no longer exported to the ML
2229 toplevel, as they are variants of predefined functions. The following
2230 suggests how one can translate existing code:
2232 rev_append xs ys = List.revAppend (xs, ys)
2233 nth_elem (i, xs) = List.nth (xs, i)
2234 last_elem xs = List.last xs
2235 flat xss = List.concat xss
2236 seq fs = List.app fs
2237 partition P xs = List.partition P xs
2238 mapfilter f xs = List.mapPartial f xs
2240 * Pure/library.ML: several combinators for linear functional
2241 transformations, notably reverse application and composition:
2244 (x, y) |-> f f #-> g
2246 * Pure/library.ML: introduced/changed precedence of infix operators:
2248 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
2250 infix 3 o oo ooo oooo;
2251 infix 4 ~~ upto downto;
2253 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
2256 * Pure/library.ML: natural list combinators fold, fold_rev, and
2257 fold_map support linear functional transformations and nesting. For
2260 fold f [x1, ..., xN] y =
2261 y |> f x1 |> ... |> f xN
2263 (fold o fold) f [xs1, ..., xsN] y =
2264 y |> fold f xs1 |> ... |> fold f xsN
2266 fold f [x1, ..., xN] =
2269 (fold o fold) f [xs1, ..., xsN] =
2270 fold f xs1 #> ... #> fold f xsN
2272 * Pure/library.ML: the following selectors on type 'a option are
2275 the: 'a option -> 'a (*partial*)
2276 these: 'a option -> 'a where 'a = 'b list
2277 the_default: 'a -> 'a option -> 'a
2278 the_list: 'a option -> 'a list
2280 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2281 basic operations for association lists, following natural argument
2282 order; moreover the explicit equality predicate passed here avoids
2283 potentially expensive polymorphic runtime equality checks.
2284 The old functions may be expressed as follows:
2286 assoc = uncurry (AList.lookup (op =))
2287 assocs = these oo AList.lookup (op =)
2288 overwrite = uncurry (AList.update (op =)) o swap
2290 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2292 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
2293 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
2295 replacing make_keylist and keyfilter (occassionally used)
2298 make_keylist = AList.make
2299 keyfilter = AList.find (op =)
2301 * eq_fst and eq_snd now take explicit equality parameter, thus
2302 avoiding eqtypes. Naive rewrites:
2304 eq_fst = eq_fst (op =)
2305 eq_snd = eq_snd (op =)
2307 * Removed deprecated apl and apr (rarely used).
2310 apl (n, op) =>>= curry op n
2311 apr (op, m) =>>= fn n => op (n, m)
2313 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
2314 provides a reasonably efficient light-weight implementation of sets as
2317 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
2318 few new operations; existing lookup and update are now curried to
2319 follow natural argument order (for use with fold etc.);
2320 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
2322 * Pure/General: output via the Isabelle channels of
2323 writeln/warning/error etc. is now passed through Output.output, with a
2324 hook for arbitrary transformations depending on the print_mode
2325 (cf. Output.add_mode -- the first active mode that provides a output
2326 function wins). Already formatted output may be embedded into further
2327 text via Output.raw; the result of Pretty.string_of/str_of and derived
2328 functions (string_of_term/cterm/thm etc.) is already marked raw to
2329 accommodate easy composition of diagnostic messages etc. Programmers
2330 rarely need to care about Output.output or Output.raw at all, with
2331 some notable exceptions: Output.output is required when bypassing the
2332 standard channels (writeln etc.), or in token translations to produce
2333 properly formatted results; Output.raw is required when capturing
2334 already output material that will eventually be presented to the user
2335 a second time. For the default print mode, both Output.output and
2336 Output.raw have no effect.
2338 * Pure/General: Output.time_accumulator NAME creates an operator ('a
2339 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
2340 cumulative results are displayed at the end of a batch session.
2342 * Pure/General: File.sysify_path and File.quote_sysify path have been
2343 replaced by File.platform_path and File.shell_path (with appropriate
2344 hooks). This provides a clean interface for unusual systems where the
2345 internal and external process view of file names are different.
2347 * Pure: more efficient orders for basic syntactic entities: added
2348 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
2349 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
2350 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
2351 orders now -- potential INCOMPATIBILITY for code that depends on a
2352 particular order for Symtab.keys, Symtab.dest, etc. (consider using
2353 Library.sort_strings on result).
2355 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
2356 fold_types traverse types/terms from left to right, observing natural
2357 argument order. Supercedes previous foldl_XXX versions, add_frees,
2358 add_vars etc. have been adapted as well: INCOMPATIBILITY.
2360 * Pure: name spaces have been refined, with significant changes of the
2361 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
2362 to extern(_table). The plain name entry path is superceded by a
2363 general 'naming' context, which also includes the 'policy' to produce
2364 a fully qualified name and external accesses of a fully qualified
2365 name; NameSpace.extend is superceded by context dependent
2366 Sign.declare_name. Several theory and proof context operations modify
2367 the naming context. Especially note Theory.restore_naming and
2368 ProofContext.restore_naming to get back to a sane state; note that
2369 Theory.add_path is no longer sufficient to recover from
2370 Theory.absolute_path in particular.
2372 * Pure: new flags short_names (default false) and unique_names
2373 (default true) for controlling output of qualified names. If
2374 short_names is set, names are printed unqualified. If unique_names is
2375 reset, the name prefix is reduced to the minimum required to achieve
2376 the original result when interning again, even if there is an overlap
2377 with earlier declarations.
2379 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
2380 now 'extend', and 'merge' gets an additional Pretty.pp argument
2381 (useful for printing error messages). INCOMPATIBILITY.
2383 * Pure: major reorganization of the theory context. Type Sign.sg and
2384 Theory.theory are now identified, referring to the universal
2385 Context.theory (see Pure/context.ML). Actual signature and theory
2386 content is managed as theory data. The old code and interfaces were
2387 spread over many files and structures; the new arrangement introduces
2388 considerable INCOMPATIBILITY to gain more clarity:
2390 Context -- theory management operations (name, identity, inclusion,
2391 parents, ancestors, merge, etc.), plus generic theory data;
2393 Sign -- logical signature and syntax operations (declaring consts,
2394 types, etc.), plus certify/read for common entities;
2396 Theory -- logical theory operations (stating axioms, definitions,
2397 oracles), plus a copy of logical signature operations (consts,
2398 types, etc.); also a few basic management operations (Theory.copy,
2401 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
2402 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
2403 for convenience -- they merely return the theory.
2405 * Pure: type Type.tsig is superceded by theory in most interfaces.
2407 * Pure: the Isar proof context type is already defined early in Pure
2408 as Context.proof (note that ProofContext.context and Proof.context are
2409 aliases, where the latter is the preferred name). This enables other
2410 Isabelle components to refer to that type even before Isar is present.
2412 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
2413 typeK, constK, axiomK, oracleK), but provide explicit operations for
2414 any of these kinds. For example, Sign.intern typeK is now
2415 Sign.intern_type, Theory.hide_space Sign.typeK is now
2416 Theory.hide_types. Also note that former
2417 Theory.hide_classes/types/consts are now
2418 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
2419 internalize their arguments! INCOMPATIBILITY.
2421 * Pure: get_thm interface (of PureThy and ProofContext) expects
2422 datatype thmref (with constructors Name and NameSelection) instead of
2423 plain string -- INCOMPATIBILITY;
2425 * Pure: cases produced by proof methods specify options, where NONE
2426 means to remove case bindings -- INCOMPATIBILITY in
2429 * Pure: the following operations retrieve axioms or theorems from a
2430 theory node or theory hierarchy, respectively:
2432 Theory.axioms_of: theory -> (string * term) list
2433 Theory.all_axioms_of: theory -> (string * term) list
2434 PureThy.thms_of: theory -> (string * thm) list
2435 PureThy.all_thms_of: theory -> (string * thm) list
2437 * Pure: print_tac now outputs the goal through the trace channel.
2439 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
2440 Reference Toplevel.debug (default false) controls detailed printing
2441 and tracing of low-level exceptions; Toplevel.profiling (default 0)
2442 controls execution profiling -- set to 1 for time and 2 for space
2443 (both increase the runtime).
2445 * Isar session: The initial use of ROOT.ML is now always timed,
2446 i.e. the log will show the actual process times, in contrast to the
2447 elapsed wall-clock time that the outer shell wrapper produces.
2449 * Simplifier: improved handling of bound variables (nameless
2450 representation, avoid allocating new strings). Simprocs that invoke
2451 the Simplifier recursively should use Simplifier.inherit_bounds to
2452 avoid local name clashes. Failure to do so produces warnings
2453 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
2454 for further details.
2456 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
2457 bindings for all theorems stored within a given theory; this may help
2458 in porting non-Isar theories to Isar ones, while keeping ML proof
2459 scripts for the time being.
2461 * ML operator HTML.with_charset specifies the charset begin used for
2462 generated HTML files. For example:
2464 HTML.with_charset "utf-8" use_thy "Hebrew";
2465 HTML.with_charset "utf-8" use_thy "Chinese";
2470 * Allow symlinks to all proper Isabelle executables (Isabelle,
2471 isabelle, isatool etc.).
2473 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
2474 isatool doc, isatool mkdir, display_drafts etc.).
2476 * isatool usedir: option -f allows specification of the ML file to be
2477 used by Isabelle; default is ROOT.ML.
2479 * New isatool version outputs the version identifier of the Isabelle
2480 distribution being used.
2482 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
2483 (containing Boolean satisfiability problems) into Isabelle/HOL
2488 New in Isabelle2004 (April 2004)
2489 --------------------------------
2493 * Provers/order.ML: new efficient reasoner for partial and linear orders.
2494 Replaces linorder.ML.
2496 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
2497 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
2498 (\<a>...\<z>), are now considered normal letters, and can therefore
2499 be used anywhere where an ASCII letter (a...zA...Z) has until
2500 now. COMPATIBILITY: This obviously changes the parsing of some
2501 terms, especially where a symbol has been used as a binder, say
2502 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
2503 as an identifier. Fix it by inserting a space around former
2504 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
2505 existing theory and ML files.
2507 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
2509 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
2510 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
2511 a normal (but invisible) letter. For multiple letter subscripts repeat
2512 \<^isub> like this: x\<^isub>1\<^isub>2.
2514 * Pure: There are now sub-/superscripts that can span more than one
2515 character. Text between \<^bsub> and \<^esub> is set in subscript in
2516 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
2517 superscript. The new control characters are not identifier parts.
2519 * Pure: Control-symbols of the form \<^raw:...> will literally print the
2520 content of "..." to the latex file instead of \isacntrl... . The "..."
2521 may consist of any printable characters excluding the end bracket >.
2523 * Pure: Using new Isar command "finalconsts" (or the ML functions
2524 Theory.add_finals or Theory.add_finals_i) it is now possible to
2525 declare constants "final", which prevents their being given a definition
2526 later. It is useful for constants whose behaviour is fixed axiomatically
2527 rather than definitionally, such as the meta-logic connectives.
2529 * Pure: 'instance' now handles general arities with general sorts
2530 (i.e. intersections of classes),
2532 * Presentation: generated HTML now uses a CSS style sheet to make layout
2533 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
2534 It can be changed to alter the colors/layout of generated pages.
2539 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
2540 cut_tac, subgoal_tac and thin_tac:
2541 - Now understand static (Isar) contexts. As a consequence, users of Isar
2542 locales are no longer forced to write Isar proof scripts.
2543 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
2545 - INCOMPATIBILITY: names of variables to be instantiated may no
2546 longer be enclosed in quotes. Instead, precede variable name with `?'.
2547 This is consistent with the instantiation attribute "where".
2549 * Attributes "where" and "of":
2550 - Now take type variables of instantiated theorem into account when reading
2551 the instantiation string. This fixes a bug that caused instantiated
2552 theorems to have too special types in some circumstances.
2553 - "where" permits explicit instantiations of type variables.
2555 * Calculation commands "moreover" and "also" no longer interfere with
2556 current facts ("this"), admitting arbitrary combinations with "then"
2560 - Goal statements involving the context element "includes" no longer
2561 generate theorems with internal delta predicates (those ending on
2562 "_axioms") in the premise.
2563 Resolve particular premise with <locale>.intro to obtain old form.
2564 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
2565 specification and "includes" elements in goal statement.
2566 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
2567 [intro?] and [elim?] (respectively) by default.
2568 - Experimental command for instantiation of locales in proof contexts:
2569 instantiate <label>[<attrs>]: <loc>
2570 Instantiates locale <loc> and adds all its theorems to the current context
2571 taking into account their attributes. Label and attrs are optional
2572 modifiers, like in theorem declarations. If present, names of
2573 instantiated theorems are qualified with <label>, and the attributes
2574 <attrs> are applied after any attributes these theorems might have already.
2575 If the locale has assumptions, a chained fact of the form
2576 "<loc> t1 ... tn" is expected from which instantiations of the parameters
2577 are derived. The command does not support old-style locales declared
2578 with "locale (open)".
2579 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
2581 * HOL: Tactic emulation methods induct_tac and case_tac understand static
2587 * Proof import: new image HOL4 contains the imported library from
2588 the HOL4 system with about 2500 theorems. It is imported by
2589 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
2590 can be used like any other Isabelle image. See
2591 HOL/Import/HOL/README for more information.
2594 - Much improved handling of linear and partial orders.
2595 Reasoners for linear and partial orders are set up for type classes
2596 "linorder" and "order" respectively, and are added to the default simpset
2597 as solvers. This means that the simplifier can build transitivity chains
2598 to solve goals from the assumptions.
2599 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
2600 of blast or auto after simplification become unnecessary because the goal
2601 is solved by simplification already.
2603 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
2604 all proved in axiomatic type classes for semirings, rings and fields.
2607 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
2608 now formalized using the Ring_and_Field theory mentioned above.
2609 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
2610 than before, because now they are set up once in a generic manner.
2611 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
2612 Look for the general versions in Ring_and_Field (and Power if they concern
2615 * Type "rat" of the rational numbers is now available in HOL-Complex.
2618 - Record types are now by default printed with their type abbreviation
2619 instead of the list of all field types. This can be configured via
2620 the reference "print_record_type_abbr".
2621 - Simproc "record_upd_simproc" for simplification of multiple updates added
2622 (not enabled by default).
2623 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
2624 EX x. x = sel r to True (not enabled by default).
2625 - Tactic "record_split_simp_tac" to split and simplify records added.
2627 * 'specification' command added, allowing for definition by
2628 specification. There is also an 'ax_specification' command that
2629 introduces the new constants axiomatically.
2631 * arith(_tac) is now able to generate counterexamples for reals as well.
2633 * HOL-Algebra: new locale "ring" for non-commutative rings.
2635 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
2636 definitions, thanks to Sava Krsti\'{c} and John Matthews.
2638 * HOL-Matrix: a first theory for matrices in HOL with an application of
2639 matrix theory to linear programming.
2641 * Unions and Intersections:
2642 The latex output syntax of UN and INT has been changed
2643 from "\Union x \in A. B" to "\Union_{x \in A} B"
2644 i.e. the index formulae has become a subscript.
2645 Similarly for "\Union x. B", and for \Inter instead of \Union.
2647 * Unions and Intersections over Intervals:
2648 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
2649 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
2650 like in normal math, and corresponding versions for < and for intersection.
2652 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
2653 lexicographic dictonary ordering has been added as "lexord".
2655 * ML: the legacy theory structures Int and List have been removed. They had
2656 conflicted with ML Basis Library structures having the same names.
2658 * 'refute' command added to search for (finite) countermodels. Only works
2659 for a fragment of HOL. The installation of an external SAT solver is
2660 highly recommended. See "HOL/Refute.thy" for details.
2662 * 'quickcheck' command: Allows to find counterexamples by evaluating
2663 formulae under an assignment of free variables to random values.
2664 In contrast to 'refute', it can deal with inductive datatypes,
2665 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
2671 * Streams now come with concatenation and are part of the HOLCF image
2675 New in Isabelle2003 (May 2003)
2676 ------------------------------
2680 * Provers/simplifier:
2682 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
2683 Assumptions are now subject to complete mutual simplification,
2684 not just from left to right. The simplifier now preserves
2685 the order of assumptions.
2687 Potential INCOMPATIBILITY:
2689 -- simp sometimes diverges where the old version did
2690 not, e.g. invoking simp on the goal
2692 [| P (f x); y = x; f x = f y |] ==> Q
2694 now gives rise to the infinite reduction sequence
2696 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
2698 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
2701 -- Tactics combining classical reasoner and simplification (such as auto)
2702 are also affected by this change, because many of them rely on
2703 simp. They may sometimes diverge as well or yield a different numbers
2704 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
2705 in case of problems. Sometimes subsequent calls to the classical
2706 reasoner will fail because a preceeding call to the simplifier too
2707 eagerly simplified the goal, e.g. deleted redundant premises.
2709 - The simplifier trace now shows the names of the applied rewrite rules
2711 - You can limit the number of recursive invocations of the simplifier
2712 during conditional rewriting (where the simplifie tries to solve the
2713 conditions before applying the rewrite rule):
2714 ML "simp_depth_limit := n"
2715 where n is an integer. Thus you can force termination where previously
2716 the simplifier would diverge.
2718 - Accepts free variables as head terms in congruence rules. Useful in Isar.
2720 - No longer aborts on failed congruence proof. Instead, the
2721 congruence is ignored.
2723 * Pure: New generic framework for extracting programs from constructive
2724 proofs. See HOL/Extraction.thy for an example instantiation, as well
2725 as HOL/Extraction for some case studies.
2727 * Pure: The main goal of the proof state is no longer shown by default, only
2728 the subgoals. This behaviour is controlled by a new flag.
2729 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
2730 (ML: Proof.show_main_goal).
2732 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
2733 rules whose conclusion matches subgoal 1:
2734 PG menu: Isabelle/Isar -> Show me -> matching rules
2735 The rules are ordered by how closely they match the subgoal.
2736 In particular, rules that solve a subgoal outright are displayed first
2737 (or rather last, the way they are printed).
2738 (ML: ProofGeneral.print_intros())
2740 * Pure: New flag trace_unify_fail causes unification to print
2741 diagnostic information (PG: in trace buffer) when it fails. This is
2742 useful for figuring out why single step proofs like rule, erule or
2745 * Pure: Locale specifications now produce predicate definitions
2746 according to the body of text (covering assumptions modulo local
2747 definitions); predicate "loc_axioms" covers newly introduced text,
2748 while "loc" is cumulative wrt. all included locale expressions; the
2749 latter view is presented only on export into the global theory
2750 context; potential INCOMPATIBILITY, use "(open)" option to fall back
2751 on the old view without predicates;
2753 * Pure: predefined locales "var" and "struct" are useful for sharing
2754 parameters (as in CASL, for example); just specify something like
2755 ``var x + var y + struct M'' as import;
2757 * Pure: improved thms_containing: proper indexing of facts instead of
2758 raw theorems; check validity of results wrt. current name space;
2759 include local facts of proof configuration (also covers active
2760 locales), cover fixed variables in index; may use "_" in term
2761 specification; an optional limit for the number of printed facts may
2762 be given (the default is 40);
2764 * Pure: disallow duplicate fact bindings within new-style theory files
2767 * Provers: improved induct method: assumptions introduced by case
2768 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
2769 the goal statement); "foo" still refers to all facts collectively;
2771 * Provers: the function blast.overloaded has been removed: all constants
2772 are regarded as potentially overloaded, which improves robustness in exchange
2773 for slight decrease in efficiency;
2775 * Provers/linorder: New generic prover for transitivity reasoning over
2776 linear orders. Note: this prover is not efficient!
2778 * Isar: preview of problems to finish 'show' now produce an error
2779 rather than just a warning (in interactive mode);
2786 - Produces a counter example if it cannot prove a goal.
2787 Note that the counter example may be spurious if the goal is not a formula
2788 of quantifier-free linear arithmetic.
2789 In ProofGeneral the counter example appears in the trace buffer.
2791 - Knows about div k and mod k where k is a numeral of type nat or int.
2793 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
2794 linear arithmetic fails. This takes account of quantifiers and divisibility.
2795 Presburger arithmetic can also be called explicitly via presburger(_tac).
2797 * simp's arithmetic capabilities have been enhanced a bit: it now
2798 takes ~= in premises into account (by performing a case split);
2800 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
2801 are distributed over a sum of terms;
2803 * New tactic "trans_tac" and method "trans" instantiate
2804 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
2807 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
2808 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
2810 * 'typedef' command has new option "open" to suppress the set
2813 * functions Min and Max on finite sets have been introduced (theory
2816 * attribute [symmetric] now works for relations as well; it turns
2817 (x,y) : R^-1 into (y,x) : R, and vice versa;
2819 * induct over a !!-quantified statement (say !!x1..xn):
2820 each "case" automatically performs "fix x1 .. xn" with exactly those names.
2822 * Map: `empty' is no longer a constant but a syntactic abbreviation for
2823 %x. None. Warning: empty_def now refers to the previously hidden definition
2826 * Algebra: formalization of classical algebra. Intended as base for
2827 any algebraic development in Isabelle. Currently covers group theory
2828 (up to Sylow's theorem) and ring theory (Universal Property of
2829 Univariate Polynomials). Contributions welcome;
2831 * GroupTheory: deleted, since its material has been moved to Algebra;
2833 * Complex: new directory of the complex numbers with numeric constants,
2834 nonstandard complex numbers, and some complex analysis, standard and
2835 nonstandard (Jacques Fleuriot);
2837 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
2839 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
2842 * Real/HahnBanach: updated and adapted to locales;
2844 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
2847 * UNITY: added the Meier-Sanders theory of progress sets;
2849 * MicroJava: bytecode verifier and lightweight bytecode verifier
2850 as abstract algorithms, instantiated to the JVM;
2852 * Bali: Java source language formalization. Type system, operational
2853 semantics, axiomatic semantics. Supported language features:
2854 classes, interfaces, objects,virtual methods, static methods,
2855 static/instance fields, arrays, access modifiers, definite
2856 assignment, exceptions.
2861 * ZF/Constructible: consistency proof for AC (Gdel's constructible
2864 * Main ZF: virtually all theories converted to new-style format;
2869 * Pure: Tactic.prove provides sane interface for internal proofs;
2870 omits the infamous "standard" operation, so this is more appropriate
2871 than prove_goalw_cterm in many situations (e.g. in simprocs);
2873 * Pure: improved error reporting of simprocs;
2875 * Provers: Simplifier.simproc(_i) provides sane interface for setting
2879 *** Document preparation ***
2881 * uses \par instead of \\ for line breaks in theory text. This may
2882 shift some page breaks in large documents. To get the old behaviour
2883 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
2885 * minimized dependencies of isabelle.sty and isabellesym.sty on
2888 * \<euro> now needs package babel/greek instead of marvosym (which
2891 * normal size for \<zero>...\<nine> (uses \mathbf instead of
2896 New in Isabelle2002 (March 2002)
2897 --------------------------------
2899 *** Document preparation ***
2901 * greatly simplified document preparation setup, including more
2902 graceful interpretation of isatool usedir -i/-d/-D options, and more
2903 instructive isatool mkdir; users should basically be able to get
2904 started with "isatool mkdir HOL Test && isatool make"; alternatively,
2905 users may run a separate document processing stage manually like this:
2906 "isatool usedir -D output HOL Test && isatool document Test/output";
2908 * theory dependency graph may now be incorporated into documents;
2909 isatool usedir -g true will produce session_graph.eps/.pdf for use
2910 with \includegraphics of LaTeX;
2912 * proper spacing of consecutive markup elements, especially text
2913 blocks after section headings;
2915 * support bold style (for single symbols only), input syntax is like
2916 this: "\<^bold>\<alpha>" or "\<^bold>A";
2918 * \<bullet> is now output as bold \cdot by default, which looks much
2919 better in printed text;
2921 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
2922 note that these symbols are currently unavailable in Proof General /
2923 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
2925 * isatool latex no longer depends on changed TEXINPUTS, instead
2926 isatool document copies the Isabelle style files to the target
2932 * Pure/Provers: improved proof by cases and induction;
2933 - 'case' command admits impromptu naming of parameters (such as
2935 - 'induct' method divinates rule instantiation from the inductive
2936 claim; no longer requires excessive ?P bindings for proper
2937 instantiation of cases;
2938 - 'induct' method properly enumerates all possibilities of set/type
2939 rules; as a consequence facts may be also passed through *type*
2940 rules without further ado;
2941 - 'induct' method now derives symbolic cases from the *rulified*
2942 rule (before it used to rulify cases stemming from the internal
2943 atomized version); this means that the context of a non-atomic
2944 statement becomes is included in the hypothesis, avoiding the
2945 slightly cumbersome show "PROP ?case" form;
2946 - 'induct' may now use elim-style induction rules without chaining
2947 facts, using ``missing'' premises from the goal state; this allows
2948 rules stemming from inductive sets to be applied in unstructured
2949 scripts, while still benefitting from proper handling of non-atomic
2950 statements; NB: major inductive premises need to be put first, all
2951 the rest of the goal is passed through the induction;
2952 - 'induct' proper support for mutual induction involving non-atomic
2953 rule statements (uses the new concept of simultaneous goals, see
2955 - append all possible rule selections, but only use the first
2956 success (no backtracking);
2957 - removed obsolete "(simplified)" and "(stripped)" options of methods;
2958 - undeclared rule case names default to numbers 1, 2, 3, ...;
2959 - added 'print_induct_rules' (covered by help item in recent Proof
2961 - moved induct/cases attributes to Pure, methods to Provers;
2962 - generic method setup instantiated for FOL and HOL;
2964 * Pure: support multiple simultaneous goal statements, for example
2965 "have a: A and b: B" (same for 'theorem' etc.); being a pure
2966 meta-level mechanism, this acts as if several individual goals had
2967 been stated separately; in particular common proof methods need to be
2968 repeated in order to cover all claims; note that a single elimination
2969 step is *not* sufficient to establish the two conjunctions, so this
2972 assume "A & B" then have A and B .. (*".." fails*)
2974 better use "obtain" in situations as above; alternative refer to
2975 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
2977 * Pure: proper integration with ``locales''; unlike the original
2978 version by Florian Kammller, Isar locales package high-level proof
2979 contexts rather than raw logical ones (e.g. we admit to include
2980 attributes everywhere); operations on locales include merge and
2981 rename; support for implicit arguments (``structures''); simultaneous
2982 type-inference over imports and text; see also HOL/ex/Locales.thy for
2985 * Pure: the following commands have been ``localized'', supporting a
2986 target locale specification "(in name)": 'lemma', 'theorem',
2987 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
2988 stored both within the locale and at the theory level (exported and
2989 qualified by the locale name);
2991 * Pure: theory goals may now be specified in ``long'' form, with
2992 ad-hoc contexts consisting of arbitrary locale elements. for example
2993 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
2994 definitions may be given, too); the result is a meta-level rule with
2995 the context elements being discharged in the obvious way;
2997 * Pure: new proof command 'using' allows to augment currently used
2998 facts after a goal statement ('using' is syntactically analogous to
2999 'apply', but acts on the goal's facts only); this allows chained facts
3000 to be separated into parts given before and after a claim, as in
3001 ``from a and b have C using d and e <proof>'';
3003 * Pure: renamed "antecedent" case to "rule_context";
3005 * Pure: new 'judgment' command records explicit information about the
3006 object-logic embedding (used by several tools internally); no longer
3007 use hard-wired "Trueprop";
3009 * Pure: added 'corollary' command;
3011 * Pure: fixed 'token_translation' command;
3013 * Pure: removed obsolete 'exported' attribute;
3015 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3016 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3017 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3019 * Pure: method 'atomize' presents local goal premises as object-level
3020 statements (atomic meta-level propositions); setup controlled via
3021 rewrite rules declarations of 'atomize' attribute; example
3022 application: 'induct' method with proper rule statements in improper
3025 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3026 now consider the syntactic context of assumptions, giving a better
3027 chance to get type-inference of the arguments right (this is
3028 especially important for locales);
3030 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3033 * Pure/obtain: the formal conclusion "thesis", being marked as
3034 ``internal'', may no longer be reference directly in the text;
3035 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3038 * Pure: generic 'sym' attribute which declares a rule both as pure
3039 'elim?' and for the 'symmetric' operation;
3041 * Pure: marginal comments ``--'' may now occur just anywhere in the
3042 text; the fixed correlation with particular command syntax has been
3045 * Pure: new method 'rules' is particularly well-suited for proof
3046 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3047 but often produces more compact proof terms with less detours;
3049 * Pure/Provers/classical: simplified integration with pure rule
3050 attributes and methods; the classical "intro?/elim?/dest?"
3051 declarations coincide with the pure ones; the "rule" method no longer
3052 includes classically swapped intros; "intro" and "elim" methods no
3053 longer pick rules from the context; also got rid of ML declarations
3054 AddXIs/AddXEs/AddXDs; all of this has some potential for
3057 * Provers/classical: attribute 'swapped' produces classical inversions
3058 of introduction rules;
3060 * Provers/simplifier: 'simplified' attribute may refer to explicit
3061 rules instead of full simplifier context; 'iff' attribute handles
3064 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3066 * HOL: 'recdef' now fails on unfinished automated proofs, use
3067 "(permissive)" option to recover old behavior;
3069 * HOL: 'inductive' no longer features separate (collective) attributes
3070 for 'intros' (was found too confusing);
3072 * HOL: properly declared induction rules less_induct and
3078 * HOL: moved over to sane numeral syntax; the new policy is as
3081 - 0 and 1 are polymorphic constants, which are defined on any
3082 numeric type (nat, int, real etc.);
3084 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3085 binary representation internally;
3087 - type nat has special constructor Suc, and generally prefers Suc 0
3088 over 1::nat and Suc (Suc 0) over 2::nat;
3090 This change may cause significant problems of INCOMPATIBILITY; here
3091 are some hints on converting existing sources:
3093 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3094 entities, so expressions involving "-" (unary or binary minus) need
3095 to be spaced properly;
3097 - existing occurrences of "1" may need to be constraint "1::nat" or
3098 even replaced by Suc 0; similar for old "2";
3100 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3102 - remove all special provisions on numerals in proofs;
3104 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3105 representation (depends on bin_arith_simps in the default context);
3107 * HOL: symbolic syntax for x^2 (numeral 2);
3109 * HOL: the class of all HOL types is now called "type" rather than
3110 "term"; INCOMPATIBILITY, need to adapt references to this type class
3111 in axclass/classes, instance/arities, and (usually rare) occurrences
3112 in typings (of consts etc.); internally the class is called
3113 "HOL.type", ML programs should refer to HOLogic.typeS;
3115 * HOL/record package improvements:
3116 - new derived operations "fields" to build a partial record section,
3117 "extend" to promote a fixed record to a record scheme, and
3118 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3119 declared as simp by default;
3120 - shared operations ("more", "fields", etc.) now need to be always
3121 qualified) --- potential INCOMPATIBILITY;
3122 - removed "make_scheme" operations (use "make" with "extend") --
3124 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3125 - provides cases/induct rules for use with corresponding Isar
3126 methods (for concrete records, record schemes, concrete more
3127 parts, and schematic more parts -- in that order);
3128 - internal definitions directly based on a light-weight abstract
3129 theory of product types over typedef rather than datatype;
3131 * HOL: generic code generator for generating executable ML code from
3132 specifications; specific support for HOL constructs such as inductive
3133 datatypes and sets, as well as recursive functions; can be invoked
3134 via 'generate_code' theory section;
3136 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3138 * HOL: consolidated and renamed several theories. In particular:
3139 Ord.thy has been absorbed into HOL.thy
3140 String.thy has been absorbed into List.thy
3142 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3143 (beware of argument permutation!);
3145 * HOL: linorder_less_split superseded by linorder_cases;
3147 * HOL/List: "nodups" renamed to "distinct";
3149 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3150 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3151 - Ex_def has changed, now need to use some_eq_ex
3153 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3154 in this (rare) case use:
3156 delSWrapper "split_all_tac"
3157 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3159 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3162 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3163 Isabelle's type classes, ^ on functions and relations has too general
3164 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3165 necessary to attach explicit type constraints;
3167 * HOL/Relation: the prefix name of the infix "O" has been changed from
3168 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3169 renamed accordingly (eg "compI" -> "rel_compI").
3171 * HOL: syntax translations now work properly with numerals and records
3174 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3175 of "lam" -- INCOMPATIBILITY;
3177 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3178 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3179 renamed "Product_Type.unit";
3181 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3183 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3184 the "cases" method);
3186 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3189 * HOL/IMP: updated and converted to new-style theory format; several
3190 parts turned into readable document, with proper Isar proof texts and
3191 some explanations (by Gerwin Klein);
3193 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3195 * HOL-Hyperreal is now a logic image;
3200 * Isar: consts/constdefs supports mixfix syntax for continuous
3203 * Isar: domain package adapted to new-style theory format, e.g. see
3206 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3207 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3208 lift.induct_tac, always use UU instead of Undef;
3210 * HOLCF/IMP: updated and converted to new-style theory;
3215 * Isar: proper integration of logic-specific tools and packages,
3216 including theory commands '(co)inductive', '(co)datatype',
3217 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
3218 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
3220 * theory Main no longer includes AC; for the Axiom of Choice, base
3221 your theory on Main_ZFC;
3223 * the integer library now covers quotients and remainders, with many
3224 laws relating division to addition, multiplication, etc.;
3226 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
3227 typeless version of the formalism;
3229 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
3232 * ZF/Induct: new directory for examples of inductive definitions,
3233 including theory Multiset for multiset orderings; converted to
3234 new-style theory format;
3236 * ZF: many new theorems about lists, ordinals, etc.;
3241 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
3242 variable proof controls level of detail: 0 = no proofs (only oracle
3243 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
3244 also ref manual for further ML interfaces;
3246 * Pure/axclass: removed obsolete ML interface
3247 goal_subclass/goal_arity;
3249 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
3250 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
3251 separate tokens, so expressions involving minus need to be spaced
3254 * Pure/syntax: support non-oriented infixes, using keyword "infix"
3255 rather than "infixl" or "infixr";
3257 * Pure/syntax: concrete syntax for dummy type variables admits genuine
3258 sort constraint specifications in type inference; e.g. "x::_::foo"
3259 ensures that the type of "x" is of sort "foo" (but not necessarily a
3262 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
3263 control output of nested => (types); the default behavior is
3266 * Pure/syntax: builtin parse translation for "_constify" turns valued
3267 tokens into AST constants;
3269 * Pure/syntax: prefer later declarations of translations and print
3270 translation functions; potential INCOMPATIBILITY: need to reverse
3271 multiple declarations for same syntax element constant;
3273 * Pure/show_hyps reset by default (in accordance to existing Isar
3276 * Provers/classical: renamed addaltern to addafter, addSaltern to
3279 * Provers/clasimp: ``iff'' declarations now handle conditional rules
3282 * system: tested support for MacOS X; should be able to get Isabelle +
3283 Proof General to work in a plain Terminal after installing Poly/ML
3284 (e.g. from the Isabelle distribution area) and GNU bash alone
3285 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
3286 support requires further installations, e.g. from
3287 http://fink.sourceforge.net/);
3289 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
3291 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
3292 of 40 MB), cf. ML_OPTIONS;
3294 * system: Proof General keywords specification is now part of the
3295 Isabelle distribution (see etc/isar-keywords.el);
3297 * system: support for persistent Proof General sessions (refrain from
3298 outdating all loaded theories on startup); user may create writable
3299 logic images like this: ``isabelle -q HOL Test'';
3301 * system: smart selection of Isabelle process versus Isabelle
3302 interface, accommodates case-insensitive file systems (e.g. HFS+); may
3303 run both "isabelle" and "Isabelle" even if file names are badly
3304 damaged (executable inspects the case of the first letter of its own
3305 name); added separate "isabelle-process" and "isabelle-interface";
3307 * system: refrain from any attempt at filtering input streams; no
3308 longer support ``8bit'' encoding of old isabelle font, instead proper
3309 iso-latin characters may now be used; the related isatools
3310 "symbolinput" and "nonascii" have disappeared as well;
3312 * system: removed old "xterm" interface (the print modes "xterm" and
3313 "xterm_color" are still available for direct use in a suitable
3318 New in Isabelle99-2 (February 2001)
3319 -----------------------------------
3321 *** Overview of INCOMPATIBILITIES ***
3323 * HOL: please note that theories in the Library and elsewhere often use the
3324 new-style (Isar) format; to refer to their theorems in an ML script you must
3325 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
3327 * HOL: inductive package no longer splits induction rule aggressively,
3328 but only as far as specified by the introductions given; the old
3329 format may be recovered via ML function complete_split_rule or attribute
3330 'split_rule (complete)';
3332 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
3333 gfp_Tarski to gfp_unfold;
3335 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
3337 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
3338 relation); infix "^^" has been renamed "``"; infix "``" has been
3339 renamed "`"; "univalent" has been renamed "single_valued";
3341 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
3344 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
3346 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
3348 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
3349 consequence, it is no longer monotonic wrt. the local goal context
3350 (which is now passed through the inductive cases);
3352 * Document preparation: renamed standard symbols \<ll> to \<lless> and
3353 \<gg> to \<ggreater>;
3356 *** Document preparation ***
3358 * \isabellestyle{NAME} selects version of Isabelle output (currently
3359 available: are "it" for near math-mode best-style output, "sl" for
3360 slanted text style, and "tt" for plain type-writer; if no
3361 \isabellestyle command is given, output is according to slanted
3364 * support sub/super scripts (for single symbols only), input syntax is
3365 like this: "A\<^sup>*" or "A\<^sup>\<star>";
3367 * some more standard symbols; see Appendix A of the system manual for
3368 the complete list of symbols defined in isabellesym.sty;
3370 * improved isabelle style files; more abstract symbol implementation
3371 (should now use \isamath{...} and \isatext{...} in custom symbol
3374 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
3375 state; Note that presentation of goal states does not conform to
3376 actual human-readable proof documents. Please do not include goal
3377 states into document output unless you really know what you are doing!
3379 * proper indentation of antiquoted output with proportional LaTeX
3382 * no_document ML operator temporarily disables LaTeX document
3385 * isatool unsymbolize tunes sources for plain ASCII communication;
3390 * Pure: Isar now suffers initial goal statements to contain unbound
3391 schematic variables (this does not conform to actual readable proof
3392 documents, due to unpredictable outcome and non-compositional proof
3393 checking); users who know what they are doing may use schematic goals
3394 for Prolog-style synthesis of proven results;
3396 * Pure: assumption method (an implicit finishing) now handles actual
3399 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
3400 initial goal, declare "that" only as Pure intro (only for single
3401 steps); the "that" rule assumption may now be involved in implicit
3402 finishing, thus ".." becomes a feasible for trivial obtains;
3404 * Pure: default proof step now includes 'intro_classes'; thus trivial
3405 instance proofs may be performed by "..";
3407 * Pure: ?thesis / ?this / "..." now work for pure meta-level
3410 * Pure: more robust selection of calculational rules;
3412 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
3413 rule (as well as the assumption rule);
3415 * Pure: 'thm_deps' command visualizes dependencies of theorems and
3416 lemmas, using the graph browser tool;
3418 * Pure: predict failure of "show" in interactive mode;
3420 * Pure: 'thms_containing' now takes actual terms as arguments;
3422 * HOL: improved method 'induct' --- now handles non-atomic goals
3423 (potential INCOMPATIBILITY); tuned error handling;
3425 * HOL: cases and induct rules now provide explicit hints about the
3426 number of facts to be consumed (0 for "type" and 1 for "set" rules);
3427 any remaining facts are inserted into the goal verbatim;
3429 * HOL: local contexts (aka cases) may now contain term bindings as
3430 well; the 'cases' and 'induct' methods new provide a ?case binding for
3431 the result to be shown in each case;
3433 * HOL: added 'recdef_tc' command;
3435 * isatool convert assists in eliminating legacy ML scripts;
3440 * HOL/Library: a collection of generic theories to be used together
3441 with main HOL; the theory loader path already includes this directory
3442 by default; the following existing theories have been moved here:
3443 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
3444 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
3446 * HOL/Unix: "Some aspects of Unix file-system security", a typical
3447 modelling and verification task performed in Isabelle/HOL +
3448 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
3450 * HOL/Algebra: special summation operator SUM no longer exists, it has
3451 been replaced by setsum; infix 'assoc' now has priority 50 (like
3452 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
3453 'domain', this makes the theory consistent with mathematical
3456 * HOL basics: added overloaded operations "inverse" and "divide"
3457 (infix "/"), syntax for generic "abs" operation, generic summation
3460 * HOL/typedef: simplified package, provide more useful rules (see also
3463 * HOL/datatype: induction rule for arbitrarily branching datatypes is
3464 now expressed as a proper nested rule (old-style tactic scripts may
3465 require atomize_strip_tac to cope with non-atomic premises);
3467 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
3468 to "split_conv" (old name still available for compatibility);
3470 * HOL: improved concrete syntax for strings (e.g. allows translation
3471 rules with string literals);
3473 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
3474 and Fleuriot's mechanization of analysis, including the transcendental
3475 functions for the reals;
3477 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
3482 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
3483 "lam" is displayed as TWO lambda-symbols
3485 * CTT: theory Main now available, containing everything (that is, Bool
3491 * Pure: the Simplifier has been implemented properly as a derived rule
3492 outside of the actual kernel (at last!); the overall performance
3493 penalty in practical applications is about 50%, while reliability of
3494 the Isabelle inference kernel has been greatly improved;
3496 * print modes "brackets" and "no_brackets" control output of nested =>
3497 (types) and ==> (props); the default behaviour is "brackets";
3499 * Provers: fast_tac (and friends) now handle actual object-logic rules
3500 as assumptions as well;
3502 * system: support Poly/ML 4.0;
3504 * system: isatool install handles KDE version 1 or 2;
3508 New in Isabelle99-1 (October 2000)
3509 ----------------------------------
3511 *** Overview of INCOMPATIBILITIES ***
3513 * HOL: simplification of natural numbers is much changed; to partly
3514 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
3515 issue the following ML commands:
3517 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
3518 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
3520 * HOL: simplification no longer dives into case-expressions; this is
3521 controlled by "t.weak_case_cong" for each datatype t;
3523 * HOL: nat_less_induct renamed to less_induct;
3525 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
3526 fixsome to patch .thy and .ML sources automatically;
3528 select_equality -> some_equality
3529 select_eq_Ex -> some_eq_ex
3530 selectI2EX -> someI2_ex
3533 select1_equality -> some1_equality
3534 Eps_sym_eq -> some_sym_eq_trivial
3535 Eps_eq -> some_eq_trivial
3537 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
3539 * HOL: removed obsolete theorem binding expand_if (refer to split_if
3542 * HOL: the recursion equations generated by 'recdef' are now called
3543 f.simps instead of f.rules;
3545 * HOL: qed_spec_mp now also handles bounded ALL as well;
3547 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
3548 sometimes be needed;
3550 * HOL: the constant for "f``x" is now "image" rather than "op ``";
3552 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
3554 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
3555 product is now "<*>" instead of "Times"; the lexicographic product is
3556 now "<*lex*>" instead of "**";
3558 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
3559 of main HOL, but was unused); better use HOL's datatype package;
3561 * HOL: removed "symbols" syntax for constant "override" of theory Map;
3562 the old syntax may be recovered as follows:
3565 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
3566 (infixl "\\<oplus>" 100)
3568 * HOL/Real: "rabs" replaced by overloaded "abs" function;
3570 * HOL/ML: even fewer consts are declared as global (see theories Ord,
3571 Lfp, Gfp, WF); this only affects ML packages that refer to const names
3574 * HOL and ZF: syntax for quotienting wrt an equivalence relation
3575 changed from A/r to A//r;
3577 * ZF: new treatment of arithmetic (nat & int) may break some old
3580 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
3581 rulify -> rule_format, elimify -> elim_format, ...);
3583 * Isar/Provers: intro/elim/dest attributes changed; renamed
3584 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
3585 should have to change intro!! to intro? only); replaced "delrule" by
3588 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
3590 * Provers: strengthened force_tac by using new first_best_tac;
3592 * LaTeX document preparation: several changes of isabelle.sty (see
3596 *** Document preparation ***
3598 * formal comments (text blocks etc.) in new-style theories may now
3599 contain antiquotations of thm/prop/term/typ/text to be presented
3600 according to latex print mode; concrete syntax is like this:
3601 @{term[show_types] "f(x) = a + x"};
3603 * isatool mkdir provides easy setup of Isabelle session directories,
3604 including proper document sources;
3606 * generated LaTeX sources are now deleted after successful run
3607 (isatool document -c); may retain a copy somewhere else via -D option
3610 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
3611 style files, achieving self-contained LaTeX sources and simplifying
3614 * old-style theories now produce (crude) LaTeX output as well;
3616 * browser info session directories are now self-contained (may be put
3617 on WWW server seperately); improved graphs of nested sessions; removed
3618 graph for 'all sessions';
3620 * several improvements in isabelle style files; \isabellestyle{it}
3621 produces fake math mode output; \isamarkupheader is now \section by
3622 default; see lib/texinputs/isabelle.sty etc.;
3627 * Isar/Pure: local results and corresponding term bindings are now
3628 subject to Hindley-Milner polymorphism (similar to ML); this
3629 accommodates incremental type-inference very nicely;
3631 * Isar/Pure: new derived language element 'obtain' supports
3632 generalized existence reasoning;
3634 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
3635 support accumulation of results, without applying any rules yet;
3636 useful to collect intermediate results without explicit name
3637 references, and for use with transitivity rules with more than 2
3640 * Isar/Pure: scalable support for case-analysis type proofs: new
3641 'case' language element refers to local contexts symbolically, as
3642 produced by certain proof methods; internally, case names are attached
3643 to theorems as "tags";
3645 * Isar/Pure: theory command 'hide' removes declarations from
3646 class/type/const name spaces;
3648 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
3649 indicate potential overloading;
3651 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
3653 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
3654 "{a,b,c}" instead of {a,b,c};
3656 * Isar/Pure now provides its own version of intro/elim/dest
3657 attributes; useful for building new logics, but beware of confusion
3658 with the version in Provers/classical;
3660 * Isar/Pure: the local context of (non-atomic) goals is provided via
3661 case name 'antecedent';
3663 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
3664 to the current context is now done automatically);
3666 * Isar/Pure: theory command 'method_setup' provides a simple interface
3667 for definining proof methods in ML;
3669 * Isar/Provers: intro/elim/dest attributes changed; renamed
3670 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
3671 most cases, one should have to change intro!! to intro? only);
3672 replaced "delrule" by "rule del";
3674 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
3675 'symmetric' attribute (the latter supercedes [RS sym]);
3677 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
3678 method modifier); 'simp' method: 'only:' modifier removes loopers as
3679 well (including splits);
3681 * Isar/Provers: Simplifier and Classical methods now support all kind
3682 of modifiers used in the past, including 'cong', 'iff', etc.
3684 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
3685 of Simplifier and Classical reasoner);
3687 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
3688 now support named cases; major packages (inductive, datatype, primrec,
3689 recdef) support case names and properly name parameters;
3691 * Isar/HOL: new transitivity rules for substitution in inequalities --
3692 monotonicity conditions are extracted to be proven at end of
3695 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
3698 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
3699 split_if split_if_asm; datatype package provides theorems foo.splits =
3700 foo.split foo.split_asm for each datatype;
3702 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
3703 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
3704 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
3705 use "(cases (simplified))" method in proper proof texts);
3707 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
3709 * Isar: names of theorems etc. may be natural numbers as well;
3711 * Isar: 'pr' command: optional arguments for goals_limit and
3712 ProofContext.prems_limit; no longer prints theory contexts, but only
3715 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
3716 additional print modes to be specified; e.g. "pr(latex)" will print
3717 proof state according to the Isabelle LaTeX style;
3719 * Isar: improved support for emulating tactic scripts, including proof
3720 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
3721 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
3722 (for HOL datatypes);
3724 * Isar: simplified (more robust) goal selection of proof methods: 1st
3725 goal, all goals, or explicit goal specifier (tactic emulation); thus
3726 'proof method scripts' have to be in depth-first order;
3728 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
3730 * Isar: removed 'help' command, which hasn't been too helpful anyway;
3731 should instead use individual commands for printing items
3732 (print_commands, print_methods etc.);
3734 * Isar: added 'nothing' --- the empty list of theorems;
3739 * HOL/MicroJava: formalization of a fragment of Java, together with a
3740 corresponding virtual machine and a specification of its bytecode
3741 verifier and a lightweight bytecode verifier, including proofs of
3742 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
3743 Cornelia Pusch (see also the homepage of project Bali at
3744 http://isabelle.in.tum.de/Bali/);
3746 * HOL/Algebra: new theory of rings and univariate polynomials, by
3749 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
3750 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
3753 * HOL/Lattice: fundamental concepts of lattice theory and order
3754 structures, including duals, properties of bounds versus algebraic
3755 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
3756 Theorem for complete lattices etc.; may also serve as a demonstration
3757 for abstract algebraic reasoning using axiomatic type classes, and
3758 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
3760 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
3763 * HOL/IMPP: extension of IMP with local variables and mutually
3764 recursive procedures, by David von Oheimb;
3766 * HOL/Lambda: converted into new-style theory and document;
3768 * HOL/ex/Multiquote: example of multiple nested quotations and
3769 anti-quotations -- basically a generalized version of de-Bruijn
3770 representation; very useful in avoiding lifting of operations;
3772 * HOL/record: added general record equality rule to simpset; fixed
3773 select-update simplification procedure to handle extended records as
3774 well; admit "r" as field name;
3776 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
3777 other numeric types and also as the identity of groups, rings, etc.;
3779 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
3780 Types nat and int belong to this axclass;
3782 * HOL: greatly improved simplification involving numerals of type nat, int, real:
3783 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
3784 i*j + k + j*#3*i simplifies to #4*(i*j) + k
3785 two terms #m*u and #n*u are replaced by #(m+n)*u
3786 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
3787 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
3788 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
3790 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
3791 powerful prover for predicate logic but knows nothing of clasets; see
3792 ex/mesontest.ML and ex/mesontest2.ML for example applications;
3794 * HOL: new version of "case_tac" subsumes both boolean case split and
3795 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
3796 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
3798 * HOL: simplification no longer dives into case-expressions: only the
3799 selector expression is simplified, but not the remaining arms; to
3800 enable full simplification of case-expressions for datatype t, you may
3801 remove t.weak_case_cong from the simpset, either globally (Delcongs
3802 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
3804 * HOL/recdef: the recursion equations generated by 'recdef' for
3805 function 'f' are now called f.simps instead of f.rules; if all
3806 termination conditions are proved automatically, these simplification
3807 rules are added to the simpset, as in primrec; rules may be named
3808 individually as well, resulting in a separate list of theorems for
3811 * HOL/While is a new theory that provides a while-combinator. It
3812 permits the definition of tail-recursive functions without the
3813 provision of a termination measure. The latter is necessary once the
3814 invariant proof rule for while is applied.
3816 * HOL: new (overloaded) notation for the set of elements below/above
3817 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
3819 * HOL: theorems impI, allI, ballI bound as "strip";
3821 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
3822 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
3823 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
3825 * HOL/Real: "rabs" replaced by overloaded "abs" function;
3827 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
3828 main HOL, but was unused);
3830 * HOL: fewer consts declared as global (e.g. have to refer to
3831 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
3833 * HOL: tuned AST representation of nested pairs, avoiding bogus output
3834 in case of overlap with user translations (e.g. judgements over
3835 tuples); (note that the underlying logical represenation is still
3841 * ZF: simplification automatically cancels common terms in arithmetic
3842 expressions over nat and int;
3844 * ZF: new treatment of nat to minimize type-checking: all operators
3845 coerce their operands to a natural number using the function natify,
3846 making the algebraic laws unconditional;
3848 * ZF: as above, for int: operators coerce their operands to an integer
3849 using the function intify;
3851 * ZF: the integer library now contains many of the usual laws for the
3852 orderings, including $<=, and monotonicity laws for $+ and $*;
3854 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
3857 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
3858 to the simplifier and classical reasoner simultaneously;
3863 * Provers: blast_tac now handles actual object-logic rules as
3864 assumptions; note that auto_tac uses blast_tac internally as well;
3866 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
3867 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
3869 * Provers: delrules now handles destruct rules as well (no longer need
3870 explicit make_elim);
3872 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
3873 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
3874 use instead the strong form,
3875 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
3876 in HOL, FOL and ZF the function cla_make_elim will create such rules
3877 from destruct-rules;
3879 * Provers: Simplifier.easy_setup provides a fast path to basic
3880 Simplifier setup for new object-logics;
3882 * Pure: AST translation rules no longer require constant head on LHS;
3884 * Pure: improved name spaces: ambiguous output is qualified; support
3885 for hiding of names;
3887 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
3888 XSYMBOL_HOME; no longer need to do manual configuration in most
3891 * system: compression of ML heaps images may now be controlled via -c
3892 option of isabelle and isatool usedir (currently only observed by
3895 * system: isatool installfonts may handle X-Symbol fonts as well (very
3896 useful for remote X11);
3898 * system: provide TAGS file for Isabelle sources;
3900 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
3903 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
3904 timing flag supersedes proof_timing and Toplevel.trace;
3906 * ML: new combinators |>> and |>>> for incremental transformations
3907 with secondary results (e.g. certain theory extensions):
3909 * ML: PureThy.add_defs gets additional argument to indicate potential
3910 overloading (usually false);
3912 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
3917 New in Isabelle99 (October 1999)
3918 --------------------------------
3920 *** Overview of INCOMPATIBILITIES (see below for more details) ***
3922 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
3923 are no longer simplified. (This allows the simplifier to unfold recursive
3924 functional programs.) To restore the old behaviour, declare
3926 Delcongs [if_weak_cong];
3928 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
3931 * HOL: the predicate "inj" is now defined by translation to "inj_on";
3933 * HOL/datatype: mutual_induct_tac no longer exists --
3934 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
3936 * HOL/typedef: fixed type inference for representing set; type
3937 arguments now have to occur explicitly on the rhs as type constraints;
3939 * ZF: The con_defs part of an inductive definition may no longer refer
3940 to constants declared in the same theory;
3942 * HOL, ZF: the function mk_cases, generated by the inductive
3943 definition package, has lost an argument. To simplify its result, it
3944 uses the default simpset instead of a supplied list of theorems.
3946 * HOL/List: the constructors of type list are now Nil and Cons;
3948 * Simplifier: the type of the infix ML functions
3949 setSSolver addSSolver setSolver addSolver
3950 is now simpset * solver -> simpset where `solver' is a new abstract type
3951 for packaging solvers. A solver is created via
3952 mk_solver: string -> (thm list -> int -> tactic) -> solver
3953 where the string argument is only a comment.
3958 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
3959 decision procedure for linear arithmetic. Currently it is used for
3960 types `nat', `int', and `real' in HOL (see below); it can, should and
3961 will be instantiated for other types and logics as well.
3963 * The simplifier now accepts rewrite rules with flexible heads, eg
3964 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
3965 They are applied like any rule with a non-pattern lhs, i.e. by first-order
3971 * New Isabelle/Isar subsystem provides an alternative to traditional
3972 tactical theorem proving; together with the ProofGeneral/isar user
3973 interface it offers an interactive environment for developing human
3974 readable proof documents (Isar == Intelligible semi-automated
3975 reasoning); for further information see isatool doc isar-ref,
3976 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
3978 * improved and simplified presentation of theories: better HTML markup
3979 (including colors), graph views in several sizes; isatool usedir now
3980 provides a proper interface for user theories (via -P option); actual
3981 document preparation based on (PDF)LaTeX is available as well (for
3982 new-style theories only); see isatool doc system for more information;
3984 * native support for Proof General, both for classic Isabelle and
3987 * ML function thm_deps visualizes dependencies of theorems and lemmas,
3988 using the graph browser tool;
3990 * Isabelle manuals now also available as PDF;
3992 * theory loader rewritten from scratch (may not be fully
3993 bug-compatible); old loadpath variable has been replaced by show_path,
3994 add_path, del_path, reset_path functions; new operations such as
3995 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
3998 * improved isatool install: option -k creates KDE application icon,
3999 option -p DIR installs standalone binaries;
4001 * added ML_PLATFORM setting (useful for cross-platform installations);
4002 more robust handling of platform specific ML images for SML/NJ;
4004 * the settings environment is now statically scoped, i.e. it is never
4005 created again in sub-processes invoked from isabelle, isatool, or
4008 * path element specification '~~' refers to '$ISABELLE_HOME';
4010 * in locales, the "assumes" and "defines" parts may be omitted if
4013 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4016 * new print_mode "HTML";
4018 * new flag show_tags controls display of tags of theorems (which are
4019 basically just comments that may be attached by some tools);
4021 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4022 mode and goal output format:
4024 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4026 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4028 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4029 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4031 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4033 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4035 * function bind_thms stores lists of theorems (cf. bind_thm);
4037 * new shorthand tactics ftac, eatac, datac, fatac;
4039 * qed (and friends) now accept "" as result name; in that case the
4040 theorem is not stored, but proper checks and presentation of the
4043 * theorem database now also indexes constants "Trueprop", "all",
4044 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4049 ** HOL arithmetic **
4051 * There are now decision procedures for linear arithmetic over nat and
4054 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4055 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4056 are treated as atomic; subformulae not involving type `nat' or `int'
4057 are ignored; quantified subformulae are ignored unless they are
4058 positive universal or negative existential. The tactic has to be
4059 invoked by hand and can be a little bit slow. In particular, the
4060 running time is exponential in the number of occurrences of `min' and
4061 `max', and `-' on `nat'.
4063 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4064 (negated) (in)equalities among the premises and the conclusion into
4065 account (i.e. no compound formulae) and does not know about `min' and
4066 `max', and `-' on `nat'. It is fast and is used automatically by the
4069 NB: At the moment, these decision procedures do not cope with mixed
4070 nat/int formulae where the two parts interact, such as `m < n ==>
4073 * HOL/Numeral provides a generic theory of numerals (encoded
4074 efficiently as bit strings); setup for types nat/int/real is in place;
4075 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4076 int, existing theories and proof scripts may require a few additional
4079 * integer division and remainder can now be performed on constant
4082 * many properties of integer multiplication, division and remainder
4085 * An interface to the Stanford Validity Checker (SVC) is available through the
4086 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4087 are proved automatically. SVC must be installed separately, and its results
4088 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4089 invocation of the underlying oracle). For SVC see
4090 http://verify.stanford.edu/SVC
4092 * IsaMakefile: the HOL-Real target now builds an actual image;
4097 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4098 (in Isabelle/Isar) -- by Gertrud Bauer;
4100 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4101 analysis for assembly languages with subtypes;
4103 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4104 -- avoids syntactic ambiguities and treats state, transition, and
4105 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4106 changed syntax and (many) tactics;
4108 * HOL/inductive: Now also handles more general introduction rules such
4109 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4110 theorems are now maintained within the theory (maintained via the
4113 * HOL/datatype: Now also handles arbitrarily branching datatypes
4114 (using function types) such as
4116 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4118 * HOL/record: record_simproc (part of the default simpset) takes care
4119 of selectors applied to updated records; record_split_tac is no longer
4120 part of the default claset; update_defs may now be removed from the
4121 simpset in many cases; COMPATIBILITY: old behavior achieved by
4123 claset_ref () := claset() addSWrapper record_split_wrapper;
4124 Delsimprocs [record_simproc]
4126 * HOL/typedef: fixed type inference for representing set; type
4127 arguments now have to occur explicitly on the rhs as type constraints;
4129 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4130 names rather than an ML expression;
4132 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4133 supplied later. Program schemes can be defined, such as
4134 "While B C s = (if B s then While B C (C s) else s)"
4135 where the well-founded relation can be chosen after B and C have been given.
4137 * HOL/List: the constructors of type list are now Nil and Cons;
4138 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4139 course, ML tools referring to List.list.op # etc. have to be adapted;
4141 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4142 disabled by default; run isabelle with option -m HOL to get back to
4143 the original Gordon/HOL-style output;
4145 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4146 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4148 * HOL basic syntax simplified (more orthogonal): all variants of
4149 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4150 Eps operator is provided as well: "SOME x. P[x]";
4152 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4154 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4155 thus available for user theories;
4157 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4158 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4161 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4162 several times and then mp;
4167 * the notation <<...>> is now available as a notation for sequences of
4170 * the simplifier is now installed
4172 * the axiom system has been generalized (thanks to Soren Heilmann)
4174 * the classical reasoner now has a default rule database
4179 * new primrec section allows primitive recursive functions to be given
4180 directly (as in HOL) over datatypes and the natural numbers;
4182 * new tactics induct_tac and exhaust_tac for induction (or case
4183 analysis) over datatypes and the natural numbers;
4185 * the datatype declaration of type T now defines the recursor T_rec;
4187 * simplification automatically does freeness reasoning for datatype
4190 * automatic type-inference, with AddTCs command to insert new
4191 type-checking rules;
4193 * datatype introduction rules are now added as Safe Introduction rules
4196 * the syntax "if P then x else y" is now available in addition to
4200 *** Internal programming interfaces ***
4202 * tuned simplifier trace output; new flag debug_simp;
4204 * structures Vartab / Termtab (instances of TableFun) offer efficient
4205 tables indexed by indexname_ord / term_ord (compatible with aconv);
4207 * AxClass.axclass_tac lost the theory argument;
4209 * tuned current_goals_markers semantics: begin / end goal avoids
4210 printing empty lines;
4212 * removed prs and prs_fn hook, which was broken because it did not
4213 include \n in its semantics, forcing writeln to add one
4214 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4215 string -> unit if you really want to output text without newline;
4217 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
4218 plain output, interface builders may have to enable 'isabelle_font'
4219 mode to get Isabelle font glyphs as before;
4221 * refined token_translation interface; INCOMPATIBILITY: output length
4222 now of type real instead of int;
4224 * theory loader actions may be traced via new ThyInfo.add_hook
4225 interface (see src/Pure/Thy/thy_info.ML); example application: keep
4226 your own database of information attached to *whole* theories -- as
4227 opposed to intra-theory data slots offered via TheoryDataFun;
4229 * proper handling of dangling sort hypotheses (at last!);
4230 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
4231 extra sort hypotheses that can be witnessed from the type signature;
4232 the force_strip_shyps flag is gone, any remaining shyps are simply
4233 left in the theorem (with a warning issued by strip_shyps_warning);
4237 New in Isabelle98-1 (October 1998)
4238 ----------------------------------
4240 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4242 * several changes of automated proof tools;
4244 * HOL: major changes to the inductive and datatype packages, including
4245 some minor incompatibilities of theory syntax;
4247 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
4250 * HOL: removed duplicate thms in Arith:
4251 less_imp_add_less should be replaced by trans_less_add1
4252 le_imp_add_le should be replaced by trans_le_add1
4254 * HOL: unary minus is now overloaded (new type constraints may be
4257 * HOL and ZF: unary minus for integers is now #- instead of #~. In
4258 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
4259 now taken as an integer constant.
4261 * Pure: ML function 'theory_of' renamed to 'theory';
4267 1. Asm_full_simp_tac is now more aggressive.
4268 1. It will sometimes reorient premises if that increases their power to
4270 2. It does no longer proceed strictly from left to right but may also
4271 rotate premises to achieve further simplification.
4272 For compatibility reasons there is now Asm_lr_simp_tac which is like the
4273 old Asm_full_simp_tac in that it does not rotate premises.
4274 2. The simplifier now knows a little bit about nat-arithmetic.
4276 * Classical reasoner: wrapper mechanism for the classical reasoner now
4277 allows for selected deletion of wrappers, by introduction of names for
4278 wrapper functionals. This implies that addbefore, addSbefore,
4279 addaltern, and addSaltern now take a pair (name, tactic) as argument,
4280 and that adding two tactics with the same name overwrites the first
4281 one (emitting a warning).
4282 type wrapper = (int -> tactic) -> (int -> tactic)
4283 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
4284 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
4285 delWrapper, delSWrapper: claset * string -> claset
4286 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
4288 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
4289 semantics; addbefore now affects only the unsafe part of step_tac
4290 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
4291 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
4294 * Classical reasoner: setwrapper to setWrapper and compwrapper to
4295 compWrapper; added safe wrapper (and access functions for it);
4297 * HOL/split_all_tac is now much faster and fails if there is nothing
4298 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
4299 and the names of the automatically generated variables have changed.
4300 split_all_tac has moved within claset() from unsafe wrappers to safe
4301 wrappers, which means that !!-bound variables are split much more
4302 aggressively, and safe_tac and clarify_tac now split such variables.
4303 If this splitting is not appropriate, use delSWrapper "split_all_tac".
4304 Note: the same holds for record_split_tac, which does the job of
4305 split_all_tac for record fields.
4307 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
4308 permanently to the default simpset using Addsplits just like
4309 Addsimps. They can be removed via Delsplits just like
4310 Delsimps. Lower-case versions are also available.
4312 * HOL/Simplifier: The rule split_if is now part of the default
4313 simpset. This means that the simplifier will eliminate all occurrences
4314 of if-then-else in the conclusion of a goal. To prevent this, you can
4315 either remove split_if completely from the default simpset by
4316 `Delsplits [split_if]' or remove it in a specific call of the
4317 simplifier using `... delsplits [split_if]'. You can also add/delete
4318 other case splitting rules to/from the default simpset: every datatype
4319 generates suitable rules `split_t_case' and `split_t_case_asm' (where
4320 t is the name of the datatype).
4322 * Classical reasoner / Simplifier combination: new force_tac (and
4323 derivatives Force_tac, force) combines rewriting and classical
4324 reasoning (and whatever other tools) similarly to auto_tac, but is
4325 aimed to solve the given subgoal completely.
4330 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
4331 and `goalw': the theory is no longer needed as an explicit argument -
4332 the current theory context is used; assumptions are no longer returned
4333 at the ML-level unless one of them starts with ==> or !!; it is
4334 recommended to convert to these new commands using isatool fixgoal
4335 (backup your sources first!);
4337 * new top-level commands 'thm' and 'thms' for retrieving theorems from
4338 the current theory context, and 'theory' to lookup stored theories;
4340 * new theory section 'locale' for declaring constants, assumptions and
4341 definitions that have local scope;
4343 * new theory section 'nonterminals' for purely syntactic types;
4345 * new theory section 'setup' for generic ML setup functions
4346 (e.g. package initialization);
4348 * the distribution now includes Isabelle icons: see
4349 lib/logo/isabelle-{small,tiny}.xpm;
4351 * isatool install - install binaries with absolute references to
4354 * isatool logo -- create instances of the Isabelle logo (as EPS);
4356 * print mode 'emacs' reserved for Isamode;
4358 * support multiple print (ast) translations per constant name;
4360 * theorems involving oracles are now printed with a suffixed [!];
4365 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
4367 * HOL/inductive package reorganized and improved: now supports mutual
4373 oddI "n : EVEN ==> Suc n : ODD"
4374 evenI "n : ODD ==> Suc n : EVEN"
4376 new theorem list "elims" contains an elimination rule for each of the
4377 recursive sets; inductive definitions now handle disjunctive premises
4378 correctly (also ZF);
4380 INCOMPATIBILITIES: requires Inductive as an ancestor; component
4381 "mutual_induct" no longer exists - the induction rule is always
4382 contained in "induct";
4385 * HOL/datatype package re-implemented and greatly improved: now
4386 supports mutually recursive datatypes such as
4389 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
4390 | SUM ('a aexp) ('a aexp)
4391 | DIFF ('a aexp) ('a aexp)
4394 'a bexp = LESS ('a aexp) ('a aexp)
4395 | AND ('a bexp) ('a bexp)
4396 | OR ('a bexp) ('a bexp)
4398 as well as indirectly recursive datatypes such as
4401 ('a, 'b) term = Var 'a
4402 | App 'b ((('a, 'b) term) list)
4404 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
4405 induction on mutually / indirectly recursive datatypes.
4407 Primrec equations are now stored in theory and can be accessed via
4408 <function_name>.simps.
4412 - Theories using datatypes must now have theory Datatype as an
4414 - The specific <typename>.induct_tac no longer exists - use the
4415 generic induct_tac instead.
4416 - natE has been renamed to nat.exhaust - use exhaust_tac
4417 instead of res_inst_tac ... natE. Note that the variable
4418 names in nat.exhaust differ from the names in natE, this
4419 may cause some "fragile" proofs to fail.
4420 - The theorems split_<typename>_case and split_<typename>_case_asm
4421 have been renamed to <typename>.split and <typename>.split_asm.
4422 - Since default sorts of type variables are now handled correctly,
4423 some datatype definitions may have to be annotated with explicit
4425 - Primrec definitions no longer require function name and type
4426 of recursive argument.
4428 Consider using isatool fixdatatype to adapt your theories and proof
4429 scripts to the new package (backup your sources first!).
4432 * HOL/record package: considerably improved implementation; now
4433 includes concrete syntax for record types, terms, updates; theorems
4434 for surjective pairing and splitting !!-bound record variables; proof
4435 support is as follows:
4437 1) standard conversions (selectors or updates applied to record
4438 constructor terms) are part of the standard simpset;
4440 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
4441 made part of standard simpset and claset via addIffs;
4443 3) a tactic for record field splitting (record_split_tac) is part of
4444 the standard claset (addSWrapper);
4446 To get a better idea about these rules you may retrieve them via
4447 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
4448 the name of your record type.
4450 The split tactic 3) conceptually simplifies by the following rule:
4452 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
4454 Thus any record variable that is bound by meta-all will automatically
4455 blow up into some record constructor term, consequently the
4456 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
4457 solve record problems automatically.
4460 * reorganized the main HOL image: HOL/Integ and String loaded by
4461 default; theory Main includes everything;
4463 * automatic simplification of integer sums and comparisons, using cancellation;
4465 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
4467 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
4469 * many new identities for unions, intersections, set difference, etc.;
4471 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
4472 called split_if, split_split, split_sum_case and split_nat_case (to go
4473 with add/delsplits);
4475 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
4476 (?x::unit) = (); this is made part of the default simpset, which COULD
4477 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
4478 'Delsimprocs [unit_eq_proc];' as last resort); also note that
4479 unit_abs_eta_conv is added in order to counter the effect of
4480 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
4483 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
4486 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
4487 It and 'sym RS equals0D' are now in the default claset, giving automatic
4488 disjointness reasoning but breaking a few old proofs.
4490 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
4491 to 'converse' from 'inverse' (for compatibility with ZF and some
4494 * HOL/recdef can now declare non-recursive functions, with {} supplied as
4495 the well-founded relation;
4497 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
4498 Compl A. The "Compl" syntax remains available as input syntax for this
4501 * HOL/Update: new theory of function updates:
4502 f(a:=b) == %x. if x=a then b else f x
4503 may also be iterated as in f(a:=b,c:=d,...);
4505 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
4508 - new function list_update written xs[i:=v] that updates the i-th
4509 list position. May also be iterated as in xs[i:=a,j:=b,...].
4510 - new function `upt' written [i..j(] which generates the list
4511 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
4512 bound write [i..j], which is a shorthand for [i..j+1(].
4513 - new lexicographic orderings and corresponding wellfoundedness theorems.
4516 - removed 'pred' (predecessor) function;
4517 - generalized some theorems about n-1;
4518 - many new laws about "div" and "mod";
4519 - new laws about greatest common divisors (see theory ex/Primes);
4521 * HOL/Relation: renamed the relational operator r^-1 "converse"
4522 instead of "inverse";
4524 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
4525 of the multiset ordering;
4527 * directory HOL/Real: a construction of the reals using Dedekind cuts
4528 (not included by default);
4530 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
4532 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
4533 programs, i.e. different program variables may have different types.
4535 * calling (stac rew i) now fails if "rew" has no effect on the goal
4536 [previously, this check worked only if the rewrite rule was unconditional]
4537 Now rew can involve either definitions or equalities (either == or =).
4542 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
4543 only the theorems proved on ZF.ML;
4545 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
4546 It and 'sym RS equals0D' are now in the default claset, giving automatic
4547 disjointness reasoning but breaking a few old proofs.
4549 * ZF/Update: new theory of function updates
4550 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
4551 may also be iterated as in f(a:=b,c:=d,...);
4553 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
4555 * calling (stac rew i) now fails if "rew" has no effect on the goal
4556 [previously, this check worked only if the rewrite rule was unconditional]
4557 Now rew can involve either definitions or equalities (either == or =).
4559 * case_tac provided for compatibility with HOL
4560 (like the old excluded_middle_tac, but with subgoals swapped)
4563 *** Internal programming interfaces ***
4565 * Pure: several new basic modules made available for general use, see
4566 also src/Pure/README;
4568 * improved the theory data mechanism to support encapsulation (data
4569 kind name replaced by private Object.kind, acting as authorization
4570 key); new type-safe user interface via functor TheoryDataFun; generic
4571 print_data function becomes basically useless;
4573 * removed global_names compatibility flag -- all theory declarations
4574 are qualified by default;
4576 * module Pure/Syntax now offers quote / antiquote translation
4577 functions (useful for Hoare logic etc. with implicit dependencies);
4578 see HOL/ex/Antiquote for an example use;
4580 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
4583 * new tactical CHANGED_GOAL for checking that a tactic modifies a
4586 * Display.print_goals function moved to Locale.print_goals;
4588 * standard print function for goals supports current_goals_markers
4589 variable for marking begin of proof, end of proof, start of goal; the
4590 default is ("", "", ""); setting current_goals_markers := ("<proof>",
4591 "</proof>", "<goal>") causes SGML like tagged proof state printing,
4596 New in Isabelle98 (January 1998)
4597 --------------------------------
4599 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4601 * changed lexical syntax of terms / types: dots made part of long
4602 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
4604 * simpset (and claset) reference variable replaced by functions
4605 simpset / simpset_ref;
4607 * no longer supports theory aliases (via merge) and non-trivial
4608 implicit merge of thms' signatures;
4610 * most internal names of constants changed due to qualified names;
4612 * changed Pure/Sequence interface (see Pure/seq.ML);
4615 *** General Changes ***
4617 * hierachically structured name spaces (for consts, types, axms, thms
4618 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
4619 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
4620 isatool fixdots ensures space after dots (e.g. "%x. x"); set
4621 long_names for fully qualified output names; NOTE: ML programs
4622 (special tactics, packages etc.) referring to internal names may have
4623 to be adapted to cope with fully qualified names; in case of severe
4624 backward campatibility problems try setting 'global_names' at compile
4625 time to have enrything declared within a flat name space; one may also
4626 fine tune name declarations in theories via the 'global' and 'local'
4629 * reimplemented the implicit simpset and claset using the new anytype
4630 data filed in signatures; references simpset:simpset ref etc. are
4631 replaced by functions simpset:unit->simpset and
4632 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
4633 to patch your ML files accordingly;
4635 * HTML output now includes theory graph data for display with Java
4636 applet or isatool browser; data generated automatically via isatool
4637 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
4639 * defs may now be conditional; improved rewrite_goals_tac to handle
4640 conditional equations;
4642 * defs now admits additional type arguments, using TYPE('a) syntax;
4644 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
4645 creates a new theory node; implicit merge of thms' signatures is
4646 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
4647 transfer:theory->thm->thm in (rare) cases;
4649 * improved handling of draft signatures / theories; draft thms (and
4650 ctyps, cterms) are automatically promoted to real ones;
4652 * slightly changed interfaces for oracles: admit many per theory, named
4653 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
4655 * print_goals: optional output of const types (set show_consts and
4658 * improved output of warnings (###) and errors (***);
4660 * subgoal_tac displays a warning if the new subgoal has type variables;
4662 * removed old README and Makefiles;
4664 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
4666 * removed obsolete init_pps and init_database;
4668 * deleted the obsolete tactical STATE, which was declared by
4669 fun STATE tacfun st = tacfun st st;
4671 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
4672 (which abbreviates $HOME);
4674 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
4675 use isatool fixseq to adapt your ML programs (this works for fully
4676 qualified references to the Sequence structure only!);
4678 * use_thy no longer requires writable current directory; it always
4679 reloads .ML *and* .thy file, if either one is out of date;
4682 *** Classical Reasoner ***
4684 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
4685 tactics that use classical reasoning to simplify a subgoal without
4686 splitting it into several subgoals;
4688 * Safe_tac: like safe_tac but uses the default claset;
4693 * added simplification meta rules:
4694 (asm_)(full_)simplify: simpset -> thm -> thm;
4696 * simplifier.ML no longer part of Pure -- has to be loaded by object
4699 * added prems argument to simplification procedures;
4701 * HOL, FOL, ZF: added infix function `addsplits':
4702 instead of `<simpset> setloop (split_tac <thms>)'
4703 you can simply write `<simpset> addsplits <thms>'
4708 * TYPE('a) syntax for type reflection terms;
4710 * no longer handles consts with name "" -- declare as 'syntax' instead;
4712 * pretty printer: changed order of mixfix annotation preference (again!);
4714 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
4719 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
4720 with `addloop' of the simplifier to faciliate case splitting in premises.
4722 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
4724 * HOL/Auth: new protocol proofs including some for the Internet
4727 * HOL/Map: new theory of `maps' a la VDM;
4729 * HOL/simplifier: simplification procedures nat_cancel_sums for
4730 cancelling out common nat summands from =, <, <= (in)equalities, or
4731 differences; simplification procedures nat_cancel_factor for
4732 cancelling common factor from =, <, <= (in)equalities over natural
4733 sums; nat_cancel contains both kinds of procedures, it is installed by
4734 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
4736 * HOL/simplifier: terms of the form
4737 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
4739 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
4740 and those of the form
4741 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
4743 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
4746 Each datatype `t' now comes with a theorem `split_t_case' of the form
4748 P(t_case f1 ... fn x) =
4749 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
4751 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
4754 and a theorem `split_t_case_asm' of the form
4756 P(t_case f1 ... fn x) =
4757 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
4759 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
4761 which can be added to a simpset via `addsplits'. The existing theorems
4762 expand_list_case and expand_option_case have been renamed to
4763 split_list_case and split_option_case.
4766 - `pred n' is automatically converted to `n-1'.
4767 Users are strongly encouraged not to use `pred' any longer,
4768 because it will disappear altogether at some point.
4769 - Users are strongly encouraged to write "0 < n" rather than
4770 "n ~= 0". Theorems and proof tools have been modified towards this
4774 the function "set_of_list" has been renamed "set" (and its theorems too);
4775 the function "nth" now takes its arguments in the reverse order and
4776 has acquired the infix notation "!" as in "xs!n".
4778 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
4780 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
4781 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
4783 * HOL/record: extensible records with schematic structural subtyping
4784 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
4785 still lacks various theorems and concrete record syntax;
4790 * removed "axioms" and "generated by" sections;
4792 * replaced "ops" section by extended "consts" section, which is capable of
4793 handling the continuous function space "->" directly;
4796 . proves theorems immediately and stores them in the theory,
4797 . creates hierachical name space,
4798 . now uses normal mixfix annotations (instead of cinfix...),
4799 . minor changes to some names and values (for consistency),
4800 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
4801 . separator between mutual domain defs: changed "," to "and",
4802 . improved handling of sort constraints; now they have to
4803 appear on the left-hand side of the equations only;
4805 * fixed LAM <x,y,zs>.b syntax;
4807 * added extended adm_tac to simplifier in HOLCF -- can now discharge
4808 adm (%x. P (t x)), where P is chainfinite and t continuous;
4813 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
4814 with `addloop' of the simplifier to faciliate case splitting in premises.
4816 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
4817 in HOL, they strip ALL and --> from proved theorems;
4821 New in Isabelle94-8 (May 1997)
4822 ------------------------------
4824 *** General Changes ***
4826 * new utilities to build / run / maintain Isabelle etc. (in parts
4827 still somewhat experimental); old Makefiles etc. still functional;
4829 * new 'Isabelle System Manual';
4831 * INSTALL text, together with ./configure and ./build scripts;
4833 * reimplemented type inference for greater efficiency, better error
4834 messages and clean internal interface;
4836 * prlim command for dealing with lots of subgoals (an easier way of
4837 setting goals_limit);
4842 * supports alternative (named) syntax tables (parser and pretty
4843 printer); internal interface is provided by add_modesyntax(_i);
4845 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
4846 be used in conjunction with the Isabelle symbol font; uses the
4847 "symbols" syntax table;
4849 * added token_translation interface (may translate name tokens in
4850 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
4851 the current print_mode); IMPORTANT: user print translation functions
4852 are responsible for marking newly introduced bounds
4853 (Syntax.mark_boundT);
4855 * token translations for modes "xterm" and "xterm_color" that display
4856 names in bold, underline etc. or colors (which requires a color
4859 * infixes may now be declared with names independent of their syntax;
4861 * added typed_print_translation (like print_translation, but may
4862 access type of constant);
4865 *** Classical Reasoner ***
4867 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
4868 some limitations. Blast_tac...
4869 + ignores addss, addbefore, addafter; this restriction is intrinsic
4870 + ignores elimination rules that don't have the correct format
4871 (the conclusion MUST be a formula variable)
4872 + ignores types, which can make HOL proofs fail
4873 + rules must not require higher-order unification, e.g. apply_type in ZF
4874 [message "Function Var's argument not a bound variable" relates to this]
4875 + its proof strategy is more general but can actually be slower
4877 * substitution with equality assumptions no longer permutes other
4880 * minor changes in semantics of addafter (now called addaltern); renamed
4881 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
4882 (and access functions for it);
4884 * improved combination of classical reasoner and simplifier:
4885 + functions for handling clasimpsets
4886 + improvement of addss: now the simplifier is called _after_ the
4888 + safe variant of addss called addSss: uses safe simplifications
4889 _during_ the safe steps. It is more complete as it allows multiple
4890 instantiations of unknowns (e.g. with slow_tac).
4894 * added interface for simplification procedures (functions that
4895 produce *proven* rewrite rules on the fly, depending on current
4898 * ordering on terms as parameter (used for ordered rewriting);
4900 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
4902 * the solver is now split into a safe and an unsafe part.
4903 This should be invisible for the normal user, except that the
4904 functions setsolver and addsolver have been renamed to setSolver and
4905 addSolver; added safe_asm_full_simp_tac;
4910 * a generic induction tactic `induct_tac' which works for all datatypes and
4911 also for type `nat';
4913 * a generic case distinction tactic `exhaust_tac' which works for all
4914 datatypes and also for type `nat';
4916 * each datatype comes with a function `size';
4918 * patterns in case expressions allow tuple patterns as arguments to
4919 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
4921 * primrec now also works with type nat;
4923 * recdef: a new declaration form, allows general recursive functions to be
4924 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
4926 * the constant for negation has been renamed from "not" to "Not" to
4927 harmonize with FOL, ZF, LK, etc.;
4929 * HOL/ex/LFilter theory of a corecursive "filter" functional for
4932 * HOL/Modelcheck demonstrates invocation of model checker oracle;
4934 * HOL/ex/Ring.thy declares cring_simp, which solves equational
4935 problems in commutative rings, using axiomatic type classes for + and *;
4937 * more examples in HOL/MiniML and HOL/Auth;
4939 * more default rewrite rules for quantifiers, union/intersection;
4941 * a new constant `arbitrary == @x.False';
4943 * HOLCF/IOA replaces old HOL/IOA;
4945 * HOLCF changes: derived all rules and arities
4946 + axiomatic type classes instead of classes
4947 + typedef instead of faking type definitions
4948 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
4949 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
4950 + eliminated the types void, one, tr
4951 + use unit lift and bool lift (with translations) instead of one and tr
4952 + eliminated blift from Lift3.thy (use Def instead of blift)
4953 all eliminated rules are derived as theorems --> no visible changes ;
4958 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
4959 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
4960 as ZF_cs addSIs [equalityI];
4964 New in Isabelle94-7 (November 96)
4965 ---------------------------------
4967 * allowing negative levels (as offsets) in prlev and choplev;
4969 * super-linear speedup for large simplifications;
4971 * FOL, ZF and HOL now use miniscoping: rewriting pushes
4972 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
4973 FAIL); can suppress it using the command Delsimps (ex_simps @
4974 all_simps); De Morgan laws are also now included, by default;
4976 * improved printing of ==> : ~:
4978 * new object-logic "Sequents" adds linear logic, while replacing LK
4979 and Modal (thanks to Sara Kalvala);
4981 * HOL/Auth: correctness proofs for authentication protocols;
4983 * HOL: new auto_tac combines rewriting and classical reasoning (many
4984 examples on HOL/Auth);
4986 * HOL: new command AddIffs for declaring theorems of the form P=Q to
4987 the rewriter and classical reasoner simultaneously;
4989 * function uresult no longer returns theorems in "standard" format;
4990 regain previous version by: val uresult = standard o uresult;
4997 * oracles -- these establish an interface between Isabelle and trusted
4998 external reasoners, which may deliver results as theorems;
5000 * proof objects (in particular record all uses of oracles);
5002 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5004 * "constdefs" section in theory files;
5006 * "primrec" section (HOL) no longer requires names;
5008 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5015 * reduced space requirements;
5017 * automatic HTML generation from theories;
5019 * theory files no longer require "..." (quotes) around most types;
5021 * new examples, including two proofs of the Church-Rosser theorem;
5023 * non-curried (1994) version of HOL is no longer distributed;
5030 * greatly reduced space requirements;
5032 * theory files (.thy) no longer require \...\ escapes at line breaks;
5034 * searchable theorem database (see the section "Retrieving theorems" on
5035 page 8 of the Reference Manual);
5037 * new examples, including Grabczewski's monumental case study of the
5040 * The previous version of HOL renamed to Old_HOL;
5042 * The new version of HOL (previously called CHOL) uses a curried syntax
5043 for functions. Application looks like f a b instead of f(a,b);
5045 * Mutually recursive inductive definitions finally work in HOL;
5047 * In ZF, pattern-matching on tuples is now available in all abstractions and
5048 translates to the operator "split";
5055 * new infix operator, addss, allowing the classical reasoner to
5056 perform simplification at each step of its search. Example:
5057 fast_tac (cs addss ss)
5059 * a new logic, CHOL, the same as HOL, but with a curried syntax
5060 for functions. Application looks like f a b instead of f(a,b). Also pairs
5061 look like (a,b) instead of <a,b>;
5063 * PLEASE NOTE: CHOL will eventually replace HOL!
5065 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5066 It translates to the operator "split". A new theory of integers is available;
5068 * In ZF, integer numerals now denote two's-complement binary integers.
5069 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5071 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5072 of the Axiom of Choice;
5079 * Significantly faster resolution;
5081 * the different sections in a .thy file can now be mixed and repeated
5084 * Database of theorems for FOL, HOL and ZF. New
5085 commands including qed, qed_goal and bind_thm store theorems in the database.
5087 * Simple database queries: return a named theorem (get_thm) or all theorems of
5088 a given theory (thms_of), or find out what theory a theorem was proved in
5091 * Bugs fixed in the inductive definition and datatype packages;
5093 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5094 and HOL_dup_cs obsolete;
5096 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5099 * Simpler definition of function space in ZF;
5101 * new results about cardinal and ordinal arithmetic in ZF;
5103 * 'subtype' facility in HOL for introducing new types as subsets of existing
5106 :mode=text:wrap=hard:maxLineLen=72: