1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Fact generalization and consolidation:
10 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
13 * Purely algebraic definition of even. Fact generalization and consolidation:
14 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
15 even_zero_(nat|int) ~> even_zero
20 * Elimination of fact duplicates:
21 equals_zero_I ~> minus_unique
22 diff_eq_0_iff_eq ~> right_minus_eq
25 * Fact name consolidation:
26 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
27 minus_le_self_iff ~> neg_less_eq_nonneg
28 le_minus_self_iff ~> less_eq_neg_nonpos
29 neg_less_nonneg ~> neg_less_pos
30 less_minus_self_iff ~> less_neg_neg [simp]
33 * More simplification rules on unary and binary minus:
34 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
35 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
36 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
37 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
38 minus_add_cancel, uminus_add_conv_diff. These correspondingly
39 have been taken away from fact collections algebra_simps and
40 field_simps. INCOMPATIBILITY.
42 To restore proofs, the following patterns are helpful:
44 a) Arbitrary failing proof not involving "diff_def":
45 Consider simplification with algebra_simps or field_simps.
47 b) Lifting rules from addition to subtraction:
48 Try with "using <rule for addition> of [… "- _" …]" by simp".
50 c) Simplification with "diff_def": just drop "diff_def".
51 Consider simplification with algebra_simps or field_simps;
53 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
55 New in Isabelle2013-1 (November 2013)
56 -------------------------------------
60 * Discontinued obsolete 'uses' within theory header. Note that
61 commands like 'ML_file' work without separate declaration of file
62 dependencies. Minor INCOMPATIBILITY.
64 * Discontinued redundant 'use' command, which was superseded by
65 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
67 * Simplified subscripts within identifiers, using plain \<^sub>
68 instead of the second copy \<^isub> and \<^isup>. Superscripts are
69 only for literal tokens within notation; explicit mixfix annotations
70 for consts or fixed variables may be used as fall-back for unusual
71 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
72 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
73 standardize symbols as a starting point for further manual cleanup.
74 The ML reference variable "legacy_isub_isup" may be set as temporary
75 workaround, to make the prover accept a subset of the old identifier
78 * Document antiquotations: term style "isub" has been renamed to
79 "sub". Minor INCOMPATIBILITY.
81 * Uniform management of "quick_and_dirty" as system option (see also
82 "isabelle options"), configuration option within the context (see also
83 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
84 INCOMPATIBILITY, need to use more official Isabelle means to access
85 quick_and_dirty, instead of historical poking into mutable reference.
87 * Renamed command 'print_configs' to 'print_options'. Minor
90 * Proper diagnostic command 'print_state'. Old 'pr' (with its
91 implicit change of some global references) is retained for now as
92 control command, e.g. for ProofGeneral 3.7.x.
94 * Discontinued 'print_drafts' command with its old-fashioned PS output
95 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
96 'display_drafts' instead and print via the regular document viewer.
98 * Updated and extended "isar-ref" and "implementation" manual,
99 eliminated old "ref" manual.
102 *** Prover IDE -- Isabelle/Scala/jEdit ***
104 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
107 * Dockable window "Documentation" provides access to Isabelle
110 * Dockable window "Find" provides query operations for formal entities
111 (GUI front-end to 'find_theorems' command).
113 * Dockable window "Sledgehammer" manages asynchronous / parallel
114 sledgehammer runs over existing document sources, independently of
115 normal editing and checking process.
117 * Dockable window "Timing" provides an overview of relevant command
120 * Improved dockable window "Theories": Continuous checking of proof
121 document (visible and required parts) may be controlled explicitly,
122 using check box or shortcut "C+e ENTER". Individual theory nodes may
123 be marked explicitly as required and checked in full, using check box
124 or shortcut "C+e SPACE".
126 * Strictly monotonic document update, without premature cancellation of
127 running transactions that are still needed: avoid reset/restart of
128 such command executions while editing.
130 * Improved completion mechanism, which is now managed by the
131 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
132 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
134 * Support for asynchronous print functions, as overlay to existing
137 * Support for automatic tools in HOL, which try to prove or disprove
138 toplevel theorem statements.
140 * Action isabelle.reset-font-size resets main text area font size
141 according to Isabelle/Scala plugin option "jedit_font_reset_size"
142 (cf. keyboard shortcut C+0).
144 * File specifications in jEdit (e.g. file browser) may refer to
145 $ISABELLE_HOME on all platforms. Discontinued obsolete
146 $ISABELLE_HOME_WINDOWS variable.
148 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
149 / Global Options / Appearance".
151 * Improved support of native Mac OS X functionality via "MacOSX"
152 plugin, which is now enabled by default.
157 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
158 In particular, 'interpretation' allows for non-persistent
159 interpretation within "context ... begin ... end" blocks offering a
160 light-weight alternative to 'sublocale'. See "isar-ref" manual for
163 * Improved locales diagnostic command 'print_dependencies'.
165 * Discontinued obsolete 'axioms' command, which has been marked as
166 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
167 instead, while observing its uniform scope for polymorphism.
169 * Discontinued empty name bindings in 'axiomatization'.
172 * System option "proofs" has been discontinued. Instead the global
173 state of Proofterm.proofs is persistently compiled into logic images
174 as required, notably HOL-Proofs. Users no longer need to change
175 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
177 * Syntax translation functions (print_translation etc.) always depend
178 on Proof.context. Discontinued former "(advanced)" option -- this is
179 now the default. Minor INCOMPATIBILITY.
181 * Former global reference trace_unify_fail is now available as
182 configuration option "unify_trace_failure" (global context only).
184 * SELECT_GOAL now retains the syntactic context of the overall goal
185 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
191 * Stronger precedence of syntax for big intersection and union on
192 sets, in accordance with corresponding lattice operations.
195 * Notation "{p:A. P}" now allows tuple patterns as well.
197 * Nested case expressions are now translated in a separate check phase
198 rather than during parsing. The data for case combinators is separated
199 from the datatype package. The declaration attribute
200 "case_translation" can be used to register new case combinators:
202 declare [[case_translation case_combinator constructor1 ... constructorN]]
205 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
207 - 'code_identifier' declares name hints for arbitrary identifiers in
208 generated code, subsuming 'code_modulename'.
210 See the isar-ref manual for syntax diagrams, and the HOL theories for
213 * Attibute 'code': 'code' now declares concrete and abstract code
214 equations uniformly. Use explicit 'code equation' and 'code abstract'
215 to distinguish both when desired.
217 * Discontinued theories Code_Integer and Efficient_Nat by a more
218 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
219 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
220 generation for details. INCOMPATIBILITY.
222 * Numeric types are mapped by default to target language numerals:
223 natural (replaces former code_numeral) and integer (replaces former
224 code_int). Conversions are available as integer_of_natural /
225 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
226 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
227 ML). INCOMPATIBILITY.
229 * Function package: For mutually recursive functions f and g, separate
230 cases rules f.cases and g.cases are generated instead of unusable
231 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
232 in the case that the unusable rule was used nevertheless.
234 * Function package: For each function f, new rules f.elims are
235 generated, which eliminate equalities of the form "f x = t".
237 * New command 'fun_cases' derives ad-hoc elimination rules for
238 function equations as simplified instances of f.elims, analogous to
239 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
242 - parametrized correspondence relations are now supported:
243 + parametricity theorems for the raw term can be specified in
244 the command lift_definition, which allow us to generate stronger
246 + setup_lifting generates stronger transfer rules if parametric
247 correspondence relation can be generated
248 + various new properties of the relator must be specified to support
250 + parametricity theorem for the Quotient relation can be specified
251 - setup_lifting generates domain rules for the Transfer package
252 - stronger reflexivity prover of respectfulness theorems for type
254 - ===> and --> are now local. The symbols can be introduced
255 by interpreting the locale lifting_syntax (typically in an
257 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
258 Main. Potential INCOMPATIBILITY
259 - new commands for restoring and deleting Lifting/Transfer context:
260 lifting_forget, lifting_update
261 - the command print_quotmaps was renamed to print_quot_maps.
265 - better support for domains in Transfer: replace Domainp T
266 by the actual invariant in a transferred goal
267 - transfer rules can have as assumptions other transfer rules
268 - Experimental support for transferring from the raw level to the
269 abstract level: Transfer.transferred attribute
270 - Attribute version of the transfer method: untransferred attribute
272 * Reification and reflection:
273 - Reification is now directly available in HOL-Main in structure
275 - Reflection now handles multiple lists with variables also.
276 - The whole reflection stack has been decomposed into conversions.
279 * Revised devices for recursive definitions over finite sets:
280 - Only one fundamental fold combinator on finite set remains:
281 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
282 This is now identity on infinite sets.
283 - Locales ("mini packages") for fundamental definitions with
284 Finite_Set.fold: folding, folding_idem.
285 - Locales comm_monoid_set, semilattice_order_set and
286 semilattice_neutr_order_set for big operators on sets.
287 See theory Big_Operators for canonical examples.
288 Note that foundational constants comm_monoid_set.F and
289 semilattice_set.F correspond to former combinators fold_image
290 and fold1 respectively. These are now gone. You may use
291 those foundational constants as substitutes, but it is
292 preferable to interpret the above locales accordingly.
293 - Dropped class ab_semigroup_idem_mult (special case of lattice,
294 no longer needed in connection with Finite_Set.fold etc.)
296 card.union_inter ~> card_Un_Int [symmetric]
297 card.union_disjoint ~> card_Un_disjoint
300 * Locale hierarchy for abstract orderings and (semi)lattices.
302 * Complete_Partial_Order.admissible is defined outside the type class
303 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
304 class predicate assumption or sort constraint when possible.
307 * Introduce type class "conditionally_complete_lattice": Like a
308 complete lattice but does not assume the existence of the top and
309 bottom elements. Allows to generalize some lemmas about reals and
310 extended reals. Removed SupInf and replaced it by the instantiation
311 of conditionally_complete_lattice for real. Renamed lemmas about
312 conditionally-complete lattice from Sup_... to cSup_... and from
313 Inf_... to cInf_... to avoid hidding of similar complete lattice
316 * Introduce type class linear_continuum as combination of
317 conditionally-complete lattices and inner dense linorders which have
318 more than one element. INCOMPATIBILITY.
320 * Introduced type classes order_top and order_bot. The old classes top
321 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
322 Rename bot -> order_bot, top -> order_top
324 * Introduce type classes "no_top" and "no_bot" for orderings without
325 top and bottom elements.
327 * Split dense_linorder into inner_dense_order and no_top, no_bot.
329 * Complex_Main: Unify and move various concepts from
330 HOL-Multivariate_Analysis to HOL-Complex_Main.
332 - Introduce type class (lin)order_topology and
333 linear_continuum_topology. Allows to generalize theorems about
334 limits and order. Instances are reals and extended reals.
336 - continuous and continuos_on from Multivariate_Analysis:
337 "continuous" is the continuity of a function at a filter. "isCont"
338 is now an abbrevitation: "isCont x f == continuous (at _) f".
340 Generalized continuity lemmas from isCont to continuous on an
343 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
344 compactness of closed intervals on reals. Continuous functions
345 attain infimum and supremum on compact sets. The inverse of a
346 continuous function is continuous, when the function is continuous
349 - connected from Multivariate_Analysis. Use it to prove the
350 intermediate value theorem. Show connectedness of intervals on
351 linear_continuum_topology).
353 - first_countable_topology from Multivariate_Analysis. Is used to
354 show equivalence of properties on the neighbourhood filter of x and
355 on all sequences converging to x.
357 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
358 theorems from Library/FDERIV.thy to Deriv.thy and base the
359 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
360 which are restricted to sets, i.e. to represent derivatives from
363 - Removed the within-filter. It is replaced by the principal filter:
365 F within X = inf F (principal X)
367 - Introduce "at x within U" as a single constant, "at x" is now an
368 abbreviation for "at x within UNIV"
370 - Introduce named theorem collections tendsto_intros,
371 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
372 in tendsto_intros (or FDERIV_intros) are also available as
373 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
374 is replaced by a congruence rule. This allows to apply them as
375 intro rules and then proving equivalence by the simplifier.
377 - Restructured theories in HOL-Complex_Main:
379 + Moved RealDef and RComplete into Real
381 + Introduced Topological_Spaces and moved theorems about
382 topological spaces, filters, limits and continuity to it
384 + Renamed RealVector to Real_Vector_Spaces
386 + Split Lim, SEQ, Series into Topological_Spaces,
387 Real_Vector_Spaces, and Limits
389 + Moved Ln and Log to Transcendental
391 + Moved theorems about continuity from Deriv to Topological_Spaces
393 - Remove various auxiliary lemmas.
399 - Reduce incidence of "too high arity" errors
403 isar_shrink ~> isar_compress
405 - Added options "isar_try0", "spy"
406 - Better support for "isar_proofs"
407 - MaSh has been fined-tuned and now runs as a local server
409 * Improved support for ad hoc overloading of constants (see also
410 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
412 * Library/Polynomial.thy:
413 - Use lifting for primitive definitions.
414 - Explicit conversions from and to lists of coefficients, used for
416 - Replaced recursion operator poly_rec by fold_coeffs.
417 - Prefer pre-existing gcd operation for gcd.
419 poly_eq_iff ~> poly_eq_poly_eq_iff
421 expand_poly_eq ~> poly_eq_iff
424 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
425 case_of_simps to convert function definitions between a list of
426 equations with patterns on the lhs and a single equation with case
427 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
429 * New Library/FSet.thy: type of finite sets defined as a subtype of
430 sets defined by Lifting/Transfer.
432 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
434 * Consolidation of library theories on product orders:
436 Product_Lattice ~> Product_Order -- pointwise order on products
437 Product_ord ~> Product_Lexorder -- lexicographic order on products
441 * Imperative-HOL: The MREC combinator is considered legacy and no
442 longer included by default. INCOMPATIBILITY, use partial_function
443 instead, or import theory Legacy_Mrec as a fallback.
445 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
446 ~~/src/HOL/Algebra/poly. Existing theories should be based on
447 ~~/src/HOL/Library/Polynomial instead. The latter provides
448 integration with HOL's type classes for rings. INCOMPATIBILITY.
451 - Various improvements to BNF-based (co)datatype package, including
452 new commands "primrec_new", "primcorec", and
453 "datatype_new_compat", as well as documentation. See
454 "datatypes.pdf" for details.
455 - New "coinduction" method to avoid some boilerplate (compared to
461 - Renamed many generated theorems, including
463 map_comp' ~> map_comp
473 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
474 "check_property" allows to check specifications of the form "ALL x y
475 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
476 Examples.thy in particular.
478 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
479 tracing output in the command transaction context instead of physical
480 stdout. See also Toplevel.debug, Toplevel.debugging and
481 ML_Compiler.exn_trace.
483 * ML type "theory" is now immutable, without any special treatment of
484 drafts or linear updates (which could lead to "stale theory" errors in
485 the past). Discontinued obsolete operations like Theory.copy,
486 Theory.checkpoint, and the auxiliary type theory_ref. Minor
489 * More uniform naming of goal functions for skipped proofs:
491 Skip_Proof.prove ~> Goal.prove_sorry
492 Skip_Proof.prove_global ~> Goal.prove_sorry_global
494 Minor INCOMPATIBILITY.
496 * Simplifier tactics and tools use proper Proof.context instead of
497 historic type simpset. Old-style declarations like addsimps,
498 addsimprocs etc. operate directly on Proof.context. Raw type simpset
499 retains its use as snapshot of the main Simplifier context, using
500 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
501 old tools by making them depend on (ctxt : Proof.context) instead of
502 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
504 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
505 operate on Proof.context instead of claset, for uniformity with addIs,
506 addEs, addDs etc. Note that claset_of and put_claset allow to manage
507 clasets separately from the context.
509 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
510 INCOMPATIBILITY, use @{context} instead.
512 * Antiquotation @{theory_context A} is similar to @{theory A}, but
513 presents the result as initial Proof.context.
518 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
519 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
521 * Discontinued obsolete isabelle-process options -f and -u (former
522 administrative aliases of option -e). Minor INCOMPATIBILITY.
524 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
527 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
528 document formats: dvi.gz, ps, ps.gz -- the default document format is
531 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
532 specify global resources of the JVM process run by isabelle build.
534 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
535 to run Isabelle/Scala source files as standalone programs.
537 * Improved "isabelle keywords" tool (for old-style ProofGeneral
538 keyword tables): use Isabelle/Scala operations, which inspect outer
539 syntax without requiring to build sessions first.
541 * Sessions may be organized via 'chapter' specifications in the ROOT
542 file, which determines a two-level hierarchy of browser info. The old
543 tree-like organization via implicit sub-session relation (with its
544 tendency towards erratic fluctuation of URLs) has been discontinued.
545 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
546 for HTML presentation of theories.
550 New in Isabelle2013 (February 2013)
551 -----------------------------------
555 * Theorem status about oracles and unfinished/failed future proofs is
556 no longer printed by default, since it is incompatible with
557 incremental / parallel checking of the persistent document model. ML
558 function Thm.peek_status may be used to inspect a snapshot of the
559 ongoing evaluation process. Note that in batch mode --- notably
560 isabelle build --- the system ensures that future proofs of all
561 accessible theorems in the theory context are finished (as before).
563 * Configuration option show_markup controls direct inlining of markup
564 into the printed representation of formal entities --- notably type
565 and sort constraints. This enables Prover IDE users to retrieve that
566 information via tooltips in the output window, for example.
568 * Command 'ML_file' evaluates ML text from a file directly within the
569 theory, without any predeclaration via 'uses' in the theory header.
571 * Old command 'use' command and corresponding keyword 'uses' in the
572 theory header are legacy features and will be discontinued soon.
573 Tools that load their additional source files may imitate the
574 'ML_file' implementation, such that the system can take care of
575 dependencies properly.
577 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
578 is called fastforce / fast_force_tac already since Isabelle2011-1.
580 * Updated and extended "isar-ref" and "implementation" manual, reduced
581 remaining material in old "ref" manual.
583 * Improved support for auxiliary contexts that indicate block structure
584 for specifications. Nesting of "context fixes ... context assumes ..."
585 and "class ... context ...".
587 * Attribute "consumes" allows a negative value as well, which is
588 interpreted relatively to the total number of premises of the rule in
589 the target context. This form of declaration is stable when exported
590 from a nested 'context' with additional assumptions. It is the
591 preferred form for definitional packages, notably cases/rules produced
592 in HOL/inductive and HOL/function.
594 * More informative error messages for Isar proof commands involving
595 lazy enumerations (method applications etc.).
597 * Refined 'help' command to retrieve outer syntax commands according
598 to name patterns (with clickable results).
601 *** Prover IDE -- Isabelle/Scala/jEdit ***
603 * Parallel terminal proofs ('by') are enabled by default, likewise
604 proofs that are built into packages like 'datatype', 'function'. This
605 allows to "run ahead" checking the theory specifications on the
606 surface, while the prover is still crunching on internal
607 justifications. Unfinished / cancelled proofs are restarted as
608 required to complete full proof checking eventually.
610 * Improved output panel with tooltips, hyperlinks etc. based on the
611 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
612 tooltips leads to some window that supports the same recursively,
613 which can lead to stacks of tooltips as the semantic document content
614 is explored. ESCAPE closes the whole stack, individual windows may be
615 closed separately, or detached to become independent jEdit dockables.
617 * Improved support for commands that produce graph output: the text
618 message contains a clickable area to open a new instance of the graph
621 * More robust incremental parsing of outer syntax (partial comments,
622 malformed symbols). Changing the balance of open/close quotes and
623 comment delimiters works more conveniently with unfinished situations
624 that frequently occur in user interaction.
626 * More efficient painting and improved reactivity when editing large
627 files. More scalable management of formal document content.
629 * Smarter handling of tracing messages: prover process pauses after
630 certain number of messages per command transaction, with some user
631 dialog to stop or continue. This avoids swamping the front-end with
632 potentially infinite message streams.
634 * More plugin options and preferences, based on Isabelle/Scala. The
635 jEdit plugin option panel provides access to some Isabelle/Scala
636 options, including tuning parameters for editor reactivity and color
639 * Dockable window "Symbols" provides some editing support for Isabelle
642 * Dockable window "Monitor" shows ML runtime statistics. Note that
643 continuous display of the chart slows down the system.
645 * Improved editing support for control styles: subscript, superscript,
646 bold, reset of style -- operating on single symbols or text
647 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
649 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
650 adjust the main text area font size, and its derivatives for output,
651 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
652 need to be adapted to local keyboard layouts.
654 * More reactive completion popup by default: use \t (TAB) instead of
655 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
656 also "Plugin Options / SideKick / General / Code Completion Options".
658 * Implicit check and build dialog of the specified logic session
659 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
660 demand, without bundling big platform-dependent heap images in the
661 Isabelle distribution.
663 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
664 from Oracle provide better multi-platform experience. This version is
665 now bundled exclusively with Isabelle.
670 * Code generation for Haskell: restrict unqualified imports from
671 Haskell Prelude to a small set of fundamental operations.
673 * Command 'export_code': relative file names are interpreted
674 relatively to master directory of current theory rather than the
675 rather arbitrary current working directory. INCOMPATIBILITY.
677 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
678 use regular rule composition via "OF" / "THEN", or explicit proof
679 structure instead. Note that Isabelle/ML provides a variety of
680 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
681 with some care where this is really required.
683 * Command 'typ' supports an additional variant with explicit sort
684 constraint, to infer and check the most general type conforming to a
685 given sort. Example (in HOL):
687 typ "_ * _ * bool * unit" :: finite
689 * Command 'locale_deps' visualizes all locales and their relations as
697 - Added MaSh relevance filter based on machine-learning; see the
698 Sledgehammer manual for details.
699 - Polished Isar proofs generated with "isar_proofs" option.
700 - Rationalized type encodings ("type_enc" option).
701 - Renamed "kill_provers" subcommand to "kill_all".
703 isar_proof ~> isar_proofs
704 isar_shrink_factor ~> isar_shrink
705 max_relevant ~> max_facts
706 relevance_thresholds ~> fact_thresholds
708 * Quickcheck: added an optimisation for equality premises. It is
709 switched on by default, and can be switched off by setting the
710 configuration quickcheck_optimise_equality to false.
712 * Quotient: only one quotient can be defined by quotient_type
716 - generation of an abstraction function equation in lift_definition
718 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
720 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
723 * Preprocessing of the code generator rewrites set comprehensions into
724 pointfree expressions.
726 * The SMT solver Z3 has now by default a restricted set of directly
727 supported features. For the full set of features (div/mod, nonlinear
728 arithmetic, datatypes/records) with potential proof reconstruction
729 failures, enable the configuration option "z3_with_extensions". Minor
732 * Simplified 'typedef' specifications: historical options for implicit
733 set definition and alternative name have been discontinued. The
734 former behavior of "typedef (open) t = A" is now the default, but
735 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
738 * Removed constant "chars"; prefer "Enum.enum" on type "char"
739 directly. INCOMPATIBILITY.
741 * Moved operation product, sublists and n_lists from theory Enum to
742 List. INCOMPATIBILITY.
744 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
746 * Class "comm_monoid_diff" formalises properties of bounded
747 subtraction, with natural numbers and multisets as typical instances.
749 * Added combinator "Option.these" with type "'a option set => 'a set".
751 * Theory "Transitive_Closure": renamed lemmas
753 reflcl_tranclp -> reflclp_tranclp
754 rtranclp_reflcl -> rtranclp_reflclp
758 * Theory "Rings": renamed lemmas (in class semiring)
760 left_distrib ~> distrib_right
761 right_distrib ~> distrib_left
765 * Generalized the definition of limits:
767 - Introduced the predicate filterlim (LIM x F. f x :> G) which
768 expresses that when the input values x converge to F then the
769 output f x converges to G.
771 - Added filters for convergence to positive (at_top) and negative
774 - Moved infinity in the norm (at_infinity) from
775 Multivariate_Analysis to Complex_Main.
777 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
782 * Theory "Library/Option_ord" provides instantiation of option type to
783 lattice type classes.
785 * Theory "Library/Multiset": renamed
787 constant fold_mset ~> Multiset.fold
788 fact fold_mset_commute ~> fold_mset_comm
792 * Renamed theory Library/List_Prefix to Library/Sublist, with related
795 - Renamed constants (and related lemmas)
798 strict_prefix ~> prefix
800 - Replaced constant "postfix" by "suffixeq" with swapped argument
801 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
802 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
803 Renamed lemmas accordingly.
805 - Added constant "list_hembeq" for homeomorphic embedding on
806 lists. Added abbreviation "sublisteq" for special case
807 "list_hembeq (op =)".
809 - Theory Library/Sublist no longer provides "order" and "bot" type
810 class instances for the prefix order (merely corresponding locale
811 interpretations). The type class instances are now in theory
812 Library/Prefix_Order.
814 - The sublist relation of theory Library/Sublist_Order is now based
815 on "Sublist.sublisteq". Renamed lemmas accordingly:
817 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
818 le_list_append_mono ~> Sublist.list_hembeq_append_mono
819 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
820 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
821 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
822 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
823 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
824 le_list_drop_many ~> Sublist.sublisteq_drop_many
825 le_list_filter_left ~> Sublist.sublisteq_filter_left
826 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
827 le_list_rev_take_iff ~> Sublist.sublisteq_append
828 le_list_same_length ~> Sublist.sublisteq_same_length
829 le_list_take_many_iff ~> Sublist.sublisteq_append'
830 less_eq_list.drop ~> less_eq_list_drop
831 less_eq_list.induct ~> less_eq_list_induct
832 not_le_list_length ~> Sublist.not_sublisteq_length
836 * New theory Library/Countable_Set.
838 * Theory Library/Debug and Library/Parallel provide debugging and
839 parallel execution for code generated towards Isabelle/ML.
841 * Theory Library/FuncSet: Extended support for Pi and extensional and
842 introduce the extensional dependent function space "PiE". Replaced
843 extensional_funcset by an abbreviation, and renamed lemmas from
844 extensional_funcset to PiE as follows:
846 extensional_empty ~> PiE_empty
847 extensional_funcset_empty_domain ~> PiE_empty_domain
848 extensional_funcset_empty_range ~> PiE_empty_range
849 extensional_funcset_arb ~> PiE_arb
850 extensional_funcset_mem ~> PiE_mem
851 extensional_funcset_extend_domainI ~> PiE_fun_upd
852 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
853 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
854 card_extensional_funcset ~> card_PiE
855 finite_extensional_funcset ~> finite_PiE
859 * Theory Library/FinFun: theory of almost everywhere constant
860 functions (supersedes the AFP entry "Code Generation for Functions as
863 * Theory Library/Phantom: generic phantom type to make a type
864 parameter appear in a constant's type. This alternative to adding
865 TYPE('a) as another parameter avoids unnecessary closures in generated
868 * Theory Library/RBT_Impl: efficient construction of red-black trees
869 from sorted associative lists. Merging two trees with rbt_union may
870 return a structurally different tree than before. Potential
873 * Theory Library/IArray: immutable arrays with code generation.
875 * Theory Library/Finite_Lattice: theory of finite lattices.
877 * HOL/Multivariate_Analysis: replaced
879 "basis :: 'a::euclidean_space => nat => real"
880 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
882 on euclidean spaces by using the inner product "_ \<bullet> _" with
883 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
884 "SUM i : Basis. f i * r i".
886 With this change the following constants are also changed or removed:
888 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
889 a $$ i ~> inner a i (where i : Basis)
891 \<pi>, \<pi>' removed
893 Theorems about these constants where removed.
897 component_le_norm ~> Basis_le_norm
898 euclidean_eq ~> euclidean_eq_iff
899 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
900 euclidean_simps ~> inner_simps
901 independent_basis ~> independent_Basis
902 span_basis ~> span_Basis
903 in_span_basis ~> in_span_Basis
904 norm_bound_component_le ~> norm_boound_Basis_le
905 norm_bound_component_lt ~> norm_boound_Basis_lt
906 component_le_infnorm ~> Basis_le_infnorm
912 - Added simproc "measurable" to automatically prove measurability.
914 - Added induction rules for sigma sets with disjoint union
915 (sigma_sets_induct_disjoint) and for Borel-measurable functions
916 (borel_measurable_induct).
918 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
921 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
922 AFP entry "Ordinals_and_Cardinals").
924 * HOL/BNF: New (co)datatype package based on bounded natural functors
925 with support for mixed, nested recursion and interesting non-free
928 * HOL/Finite_Set and Relation: added new set and relation operations
929 expressed by Finite_Set.fold.
931 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
932 trees for the code generator.
934 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
936 possible INCOMPATIBILITY.
938 * HOL/Set: renamed Set.project -> Set.filter
942 *** Document preparation ***
944 * Dropped legacy antiquotations "term_style" and "thm_style", since
945 styles may be given as arguments to "term" and "thm" already.
946 Discontinued legacy styles "prem1" .. "prem19".
948 * Default LaTeX rendering for \<euro> is now based on eurosym package,
949 instead of slightly exotic babel/greek.
951 * Document variant NAME may use different LaTeX entry point
952 document/root_NAME.tex if that file exists, instead of the common
955 * Simplified custom document/build script, instead of old-style
956 document/IsaMakefile. Minor INCOMPATIBILITY.
961 * The default limit for maximum number of worker threads is now 8,
962 instead of 4, in correspondence to capabilities of contemporary
963 hardware and Poly/ML runtime system.
965 * Type Seq.results and related operations support embedded error
966 messages within lazy enumerations, and thus allow to provide
967 informative errors in the absence of any usable results.
969 * Renamed Position.str_of to Position.here to emphasize that this is a
970 formal device to inline positions into message text, but not
971 necessarily printing visible text.
976 * Advanced support for Isabelle sessions and build management, see
977 "system" manual for the chapter of that name, especially the "isabelle
978 build" tool and its examples. The "isabelle mkroot" tool prepares
979 session root directories for use with "isabelle build", similar to
980 former "isabelle mkdir" for "isabelle usedir". Note that this affects
981 document preparation as well. INCOMPATIBILITY, isabelle usedir /
982 mkdir / make are rendered obsolete.
984 * Discontinued obsolete Isabelle/build script, it is superseded by the
985 regular isabelle build tool. For example:
987 isabelle build -s -b HOL
989 * Discontinued obsolete "isabelle makeall".
991 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
992 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
993 provides some traditional targets that invoke "isabelle build". Note
994 that this is inefficient! Applications of Isabelle/HOL involving
995 "isabelle make" should be upgraded to use "isabelle build" directly.
997 * The "isabelle options" tool prints Isabelle system options, as
998 required for "isabelle build", for example.
1000 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
1001 Minor INCOMPATIBILITY in command-line options.
1003 * The "isabelle install" tool has now a simpler command-line. Minor
1006 * The "isabelle components" tool helps to resolve add-on components
1007 that are not bundled, or referenced from a bare-bones repository
1008 version of Isabelle.
1010 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
1011 platform family: "linux", "macos", "windows".
1013 * The ML system is configured as regular component, and no longer
1014 picked up from some surrounding directory. Potential INCOMPATIBILITY
1015 for home-made settings.
1017 * Improved ML runtime statistics (heap, threads, future tasks etc.).
1019 * Discontinued support for Poly/ML 5.2.1, which was the last version
1020 without exception positions and advanced ML compiler/toplevel
1023 * Discontinued special treatment of Proof General -- no longer guess
1024 PROOFGENERAL_HOME based on accidental file-system layout. Minor
1025 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
1026 settings manually, or use a Proof General version that has been
1027 bundled as Isabelle component.
1031 New in Isabelle2012 (May 2012)
1032 ------------------------------
1036 * Prover IDE (PIDE) improvements:
1038 - more robust Sledgehammer integration (as before the sledgehammer
1039 command-line needs to be typed into the source buffer)
1040 - markup for bound variables
1041 - markup for types of term variables (displayed as tooltips)
1042 - support for user-defined Isar commands within the running session
1043 - improved support for Unicode outside original 16bit range
1044 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1046 * Forward declaration of outer syntax keywords within the theory
1047 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1048 commands to be used in the same theory where defined.
1050 * Auxiliary contexts indicate block structure for specifications with
1051 additional parameters and assumptions. Such unnamed contexts may be
1052 nested within other targets, like 'theory', 'locale', 'class',
1053 'instantiation' etc. Results from the local context are generalized
1054 accordingly and applied to the enclosing target context. Example:
1058 assumes xy: "x = y" and yz: "y = z"
1061 lemma my_trans: "x = z" using xy yz by simp
1067 The most basic application is to factor-out context elements of
1068 several fixes/assumes/shows theorem statements, e.g. see
1069 ~~/src/HOL/Isar_Examples/Group_Context.thy
1071 Any other local theory specification element works within the "context
1072 ... begin ... end" block as well.
1074 * Bundled declarations associate attributed fact expressions with a
1075 given name in the context. These may be later included in other
1076 contexts. This allows to manage context extensions casually, without
1077 the logical dependencies of locales and locale interpretation. See
1078 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1080 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1081 declaration, and results are standardized before being stored. Thus
1082 old-style "standard" after instantiation or composition of facts
1083 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1084 indices of schematic variables.
1086 * Rule attributes in local theory declarations (e.g. locale or class)
1087 are now statically evaluated: the resulting theorem is stored instead
1088 of the original expression. INCOMPATIBILITY in rare situations, where
1089 the historic accident of dynamic re-evaluation in interpretations
1092 * New tutorial "Programming and Proving in Isabelle/HOL"
1093 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1094 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1095 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1096 Logic" as the recommended beginners tutorial, but does not cover all
1097 of the material of that old tutorial.
1099 * Updated and extended reference manuals: "isar-ref",
1100 "implementation", "system"; reduced remaining material in old "ref"
1106 * Command 'definition' no longer exports the foundational "raw_def"
1107 into the user context. Minor INCOMPATIBILITY, may use the regular
1108 "def" result with attribute "abs_def" to imitate the old version.
1110 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1111 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1112 expand it. This also works for object-logic equality. (Formerly
1113 undocumented feature.)
1115 * Sort constraints are now propagated in simultaneous statements, just
1116 like type constraints. INCOMPATIBILITY in rare situations, where
1117 distinct sorts used to be assigned accidentally. For example:
1119 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1121 lemma "P (x::'a)" and "Q (y::'a::bar)"
1122 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1124 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1125 tolerant against multiple unifiers, as long as the final result is
1126 unique. (As before, rules are composed in canonical right-to-left
1127 order to accommodate newly introduced premises.)
1129 * Renamed some inner syntax categories:
1135 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1136 "num_position" etc. are mainly used instead (which also include
1137 position information via constraints).
1139 * Simplified configuration options for syntax ambiguity: see
1140 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1141 manual. Minor INCOMPATIBILITY.
1143 * Discontinued configuration option "syntax_positions": atomic terms
1144 in parse trees are always annotated by position constraints.
1146 * Old code generator for SML and its commands 'code_module',
1147 'code_library', 'consts_code', 'types_code' have been discontinued.
1148 Use commands of the generic code generator instead. INCOMPATIBILITY.
1150 * Redundant attribute "code_inline" has been discontinued. Use
1151 "code_unfold" instead. INCOMPATIBILITY.
1153 * Dropped attribute "code_unfold_post" in favor of the its dual
1154 "code_abbrev", which yields a common pattern in definitions like
1156 definition [code_abbrev]: "f = t"
1160 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1161 instead. INCOMPATIBILITY.
1163 * Discontinued old "prems" fact, which used to refer to the accidental
1164 collection of foundational premises in the context (already marked as
1165 legacy since Isabelle2011).
1170 * Type 'a set is now a proper type constructor (just as before
1171 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1172 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1173 sets separate, it is often sufficient to rephrase some set S that has
1174 been accidentally used as predicates by "%x. x : S", and some
1175 predicate P that has been accidentally used as set by "{x. P x}".
1176 Corresponding proofs in a first step should be pruned from any
1177 tinkering with former theorems mem_def and Collect_def as far as
1180 For developments which deliberately mix predicates and sets, a
1181 planning step is necessary to determine what should become a predicate
1182 and what a set. It can be helpful to carry out that step in
1183 Isabelle2011-1 before jumping right into the current release.
1185 * Code generation by default implements sets as container type rather
1186 than predicates. INCOMPATIBILITY.
1188 * New type synonym 'a rel = ('a * 'a) set
1190 * The representation of numerals has changed. Datatype "num"
1191 represents strictly positive binary numerals, along with functions
1192 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1193 positive and negated numeric literals, respectively. See also
1194 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1195 user theories may require adaptations as follows:
1197 - Theorems with number_ring or number_semiring constraints: These
1198 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1200 - Theories defining numeric types: Remove number, number_semiring,
1201 and number_ring instances. Defer all theorems about numerals until
1202 after classes one and semigroup_add have been instantiated.
1204 - Numeral-only simp rules: Replace each rule having a "number_of v"
1205 pattern with two copies, one for numeral and one for neg_numeral.
1207 - Theorems about subclasses of semiring_1 or ring_1: These classes
1208 automatically support numerals now, so more simp rules and
1209 simprocs may now apply within the proof.
1211 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1212 Redefine using other integer operations.
1214 * Transfer: New package intended to generalize the existing
1215 "descending" method and related theorem attributes from the Quotient
1216 package. (Not all functionality is implemented yet, but future
1217 development will focus on Transfer as an eventual replacement for the
1218 corresponding parts of the Quotient package.)
1220 - transfer_rule attribute: Maintains a collection of transfer rules,
1221 which relate constants at two different types. Transfer rules may
1222 relate different type instances of the same polymorphic constant,
1223 or they may relate an operation on a raw type to a corresponding
1224 operation on an abstract type (quotient or subtype). For example:
1226 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1227 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1229 - transfer method: Replaces a subgoal on abstract types with an
1230 equivalent subgoal on the corresponding raw types. Constants are
1231 replaced with corresponding ones according to the transfer rules.
1232 Goals are generalized over all free variables by default; this is
1233 necessary for variables whose types change, but can be overridden
1234 for specific variables with e.g. "transfer fixing: x y z". The
1235 variant transfer' method allows replacing a subgoal with one that
1236 is logically stronger (rather than equivalent).
1238 - relator_eq attribute: Collects identity laws for relators of
1239 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1240 transfer method uses these lemmas to infer transfer rules for
1241 non-polymorphic constants on the fly.
1243 - transfer_prover method: Assists with proving a transfer rule for a
1244 new constant, provided the constant is defined in terms of other
1245 constants that already have transfer rules. It should be applied
1246 after unfolding the constant definitions.
1248 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1249 from type nat to type int.
1251 * Lifting: New package intended to generalize the quotient_definition
1252 facility of the Quotient package; designed to work with Transfer.
1254 - lift_definition command: Defines operations on an abstract type in
1255 terms of a corresponding operation on a representation
1256 type. Example syntax:
1258 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1261 Users must discharge a respectfulness proof obligation when each
1262 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1263 the proof is discharged automatically.) The obligation is
1264 presented in a user-friendly, readable form; a respectfulness
1265 theorem in the standard format and a transfer rule are generated
1268 - Integration with code_abstype: For typedefs (e.g. subtypes
1269 corresponding to a datatype invariant, such as dlist),
1270 lift_definition generates a code certificate theorem and sets up
1271 code generation for each constant.
1273 - setup_lifting command: Sets up the Lifting package to work with a
1274 user-defined type. The user must provide either a quotient theorem
1275 or a type_definition theorem. The package configures transfer
1276 rules for equality and quantifiers on the type, and sets up the
1277 lift_definition command to work with the type.
1279 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1280 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1281 Word/Word.thy and Library/Float.thy.
1285 - The 'quotient_type' command now supports a 'morphisms' option with
1286 rep and abs functions, similar to typedef.
1288 - 'quotient_type' sets up new types to work with the Lifting and
1289 Transfer packages, as with 'setup_lifting'.
1291 - The 'quotient_definition' command now requires the user to prove a
1292 respectfulness property at the point where the constant is
1293 defined, similar to lift_definition; INCOMPATIBILITY.
1295 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1296 accordingly, INCOMPATIBILITY.
1298 * New diagnostic command 'find_unused_assms' to find potentially
1299 superfluous assumptions in theorems using Quickcheck.
1303 - Quickcheck returns variable assignments as counterexamples, which
1304 allows to reveal the underspecification of functions under test.
1305 For example, refuting "hd xs = x", it presents the variable
1306 assignment xs = [] and x = a1 as a counterexample, assuming that
1307 any property is false whenever "hd []" occurs in it.
1309 These counterexample are marked as potentially spurious, as
1310 Quickcheck also returns "xs = []" as a counterexample to the
1311 obvious theorem "hd xs = hd xs".
1313 After finding a potentially spurious counterexample, Quickcheck
1314 continues searching for genuine ones.
1316 By default, Quickcheck shows potentially spurious and genuine
1317 counterexamples. The option "genuine_only" sets quickcheck to only
1318 show genuine counterexamples.
1320 - The command 'quickcheck_generator' creates random and exhaustive
1321 value generators for a given type and operations.
1323 It generates values by using the operations as if they were
1324 constructors of that type.
1326 - Support for multisets.
1328 - Added "use_subtype" options.
1330 - Added "quickcheck_locale" configuration to specify how to process
1331 conjectures in a locale context.
1333 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1334 and affecting 'rat' and 'real'.
1337 - Integrated more tightly with SPASS, as described in the ITP 2012
1338 paper "More SPASS with Isabelle".
1339 - Made it try "smt" as a fallback if "metis" fails or times out.
1340 - Added support for the following provers: Alt-Ergo (via Why3 and
1341 TFF1), iProver, iProver-Eq.
1342 - Sped up the minimizer.
1343 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1344 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1345 - Renamed "sound" option to "strict".
1347 * Metis: Added possibility to specify lambda translations scheme as a
1348 parenthesized argument (e.g., "by (metis (lifting) ...)").
1350 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1352 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1354 * New "case_product" attribute to generate a case rule doing multiple
1355 case distinctions at the same time. E.g.
1357 list.exhaust [case_product nat.exhaust]
1359 produces a rule which can be used to perform case distinction on both
1362 * New "eventually_elim" method as a generalized variant of the
1363 eventually_elim* rules. Supports structured proofs.
1365 * Typedef with implicit set definition is considered legacy. Use
1366 "typedef (open)" form instead, which will eventually become the
1369 * Record: code generation can be switched off manually with
1371 declare [[record_coden = false]] -- "default true"
1373 * Datatype: type parameters allow explicit sort constraints.
1375 * Concrete syntax for case expressions includes constraints for source
1376 positions, and thus produces Prover IDE markup for its bindings.
1377 INCOMPATIBILITY for old-style syntax translations that augment the
1378 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1381 * Clarified attribute "mono_set": pure declaration without modifying
1382 the result of the fact expression.
1384 * More default pred/set conversions on a couple of relation operations
1385 and predicates. Added powers of predicate relations. Consolidation
1386 of some relation theorems:
1388 converse_def ~> converse_unfold
1389 rel_comp_def ~> relcomp_unfold
1390 symp_def ~> (modified, use symp_def and sym_def instead)
1391 transp_def ~> transp_trans
1392 Domain_def ~> Domain_unfold
1393 Range_def ~> Domain_converse [symmetric]
1395 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1397 See theory "Relation" for examples for making use of pred/set
1398 conversions by means of attributes "to_set" and "to_pred".
1402 * Renamed facts about the power operation on relations, i.e., relpow
1403 to match the constant's name:
1405 rel_pow_1 ~> relpow_1
1406 rel_pow_0_I ~> relpow_0_I
1407 rel_pow_Suc_I ~> relpow_Suc_I
1408 rel_pow_Suc_I2 ~> relpow_Suc_I2
1409 rel_pow_0_E ~> relpow_0_E
1410 rel_pow_Suc_E ~> relpow_Suc_E
1411 rel_pow_E ~> relpow_E
1412 rel_pow_Suc_D2 ~> relpow_Suc_D2
1413 rel_pow_Suc_E2 ~> relpow_Suc_E2
1414 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1415 rel_pow_E2 ~> relpow_E2
1416 rel_pow_add ~> relpow_add
1417 rel_pow_commute ~> relpow
1418 rel_pow_empty ~> relpow_empty:
1419 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1420 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1421 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1422 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1423 rel_pow_fun_conv ~> relpow_fun_conv
1424 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1425 rel_pow_finite_bounded ~> relpow_finite_bounded
1426 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1427 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1428 single_valued_rel_pow ~> single_valued_relpow
1432 * Theory Relation: Consolidated constant name for relation composition
1433 and corresponding theorem names:
1435 - Renamed constant rel_comp to relcomp.
1437 - Dropped abbreviation pred_comp. Use relcompp instead.
1441 rel_compI ~> relcompI
1442 rel_compEpair ~> relcompEpair
1443 rel_compE ~> relcompE
1444 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1445 rel_comp_empty1 ~> relcomp_empty1
1446 rel_comp_mono ~> relcomp_mono
1447 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1448 rel_comp_distrib ~> relcomp_distrib
1449 rel_comp_distrib2 ~> relcomp_distrib2
1450 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1451 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1452 single_valued_rel_comp ~> single_valued_relcomp
1453 rel_comp_def ~> relcomp_unfold
1454 converse_rel_comp ~> converse_relcomp
1455 pred_compI ~> relcomppI
1456 pred_compE ~> relcomppE
1457 pred_comp_bot1 ~> relcompp_bot1
1458 pred_comp_bot2 ~> relcompp_bot2
1459 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1460 pred_comp_mono ~> relcompp_mono
1461 pred_comp_distrib ~> relcompp_distrib
1462 pred_comp_distrib2 ~> relcompp_distrib2
1463 converse_pred_comp ~> converse_relcompp
1465 finite_rel_comp ~> finite_relcomp
1467 set_rel_comp ~> set_relcomp
1471 * Theory Divides: Discontinued redundant theorems about div and mod.
1472 INCOMPATIBILITY, use the corresponding generic theorems instead.
1474 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1475 zdiv_self ~> div_self
1476 zmod_self ~> mod_self
1479 zdiv_zmod_equality ~> div_mod_equality2
1480 zdiv_zmod_equality2 ~> div_mod_equality
1481 zmod_zdiv_trivial ~> mod_div_trivial
1482 zdiv_zminus_zminus ~> div_minus_minus
1483 zmod_zminus_zminus ~> mod_minus_minus
1484 zdiv_zminus2 ~> div_minus_right
1485 zmod_zminus2 ~> mod_minus_right
1486 zdiv_minus1_right ~> div_minus1_right
1487 zmod_minus1_right ~> mod_minus1_right
1488 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1489 zmod_zmult1_eq ~> mod_mult_right_eq
1490 zpower_zmod ~> power_mod
1491 zdvd_zmod ~> dvd_mod
1492 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1493 mod_mult_distrib ~> mult_mod_left
1494 mod_mult_distrib2 ~> mult_mod_right
1496 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1497 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1499 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1501 * Consolidated theorem names concerning fold combinators:
1503 inf_INFI_fold_inf ~> inf_INF_fold_inf
1504 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1505 INFI_fold_inf ~> INF_fold_inf
1506 SUPR_fold_sup ~> SUP_fold_sup
1507 union_set ~> union_set_fold
1508 minus_set ~> minus_set_fold
1509 INFI_set_fold ~> INF_set_fold
1510 SUPR_set_fold ~> SUP_set_fold
1511 INF_code ~> INF_set_foldr
1512 SUP_code ~> SUP_set_foldr
1513 foldr.simps ~> foldr.simps (in point-free formulation)
1514 foldr_fold_rev ~> foldr_conv_fold
1515 foldl_fold ~> foldl_conv_fold
1516 foldr_foldr ~> foldr_conv_foldl
1517 foldl_foldr ~> foldl_conv_foldr
1518 fold_set_remdups ~> fold_set_fold_remdups
1519 fold_set ~> fold_set_fold
1520 fold1_set ~> fold1_set_fold
1524 * Dropped rarely useful theorems concerning fold combinators:
1525 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1526 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1527 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1528 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1529 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1530 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1531 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1532 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1533 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1534 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1536 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1537 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1538 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1539 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1540 lemmas over fold rather than foldr, or make use of lemmas
1541 fold_conv_foldr and fold_rev.
1543 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1544 through option types.
1546 * "Transitive_Closure.ntrancl": bounded transitive closure on
1549 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1551 * Theory Int: Discontinued many legacy theorems specific to type int.
1552 INCOMPATIBILITY, use the corresponding generic theorems instead.
1554 zminus_zminus ~> minus_minus
1555 zminus_0 ~> minus_zero
1556 zminus_zadd_distrib ~> minus_add_distrib
1557 zadd_commute ~> add_commute
1558 zadd_assoc ~> add_assoc
1559 zadd_left_commute ~> add_left_commute
1562 zadd_0 ~> add_0_left
1563 zadd_0_right ~> add_0_right
1564 zadd_zminus_inverse2 ~> left_minus
1565 zmult_zminus ~> mult_minus_left
1566 zmult_commute ~> mult_commute
1567 zmult_assoc ~> mult_assoc
1568 zadd_zmult_distrib ~> left_distrib
1569 zadd_zmult_distrib2 ~> right_distrib
1570 zdiff_zmult_distrib ~> left_diff_distrib
1571 zdiff_zmult_distrib2 ~> right_diff_distrib
1572 zmult_1 ~> mult_1_left
1573 zmult_1_right ~> mult_1_right
1574 zle_refl ~> order_refl
1575 zle_trans ~> order_trans
1576 zle_antisym ~> order_antisym
1577 zle_linear ~> linorder_linear
1578 zless_linear ~> linorder_less_linear
1579 zadd_left_mono ~> add_left_mono
1580 zadd_strict_right_mono ~> add_strict_right_mono
1581 zadd_zless_mono ~> add_less_le_mono
1582 int_0_less_1 ~> zero_less_one
1583 int_0_neq_1 ~> zero_neq_one
1585 zpower_zadd_distrib ~> power_add
1586 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1587 zero_le_zpower_abs ~> zero_le_power_abs
1589 * Theory Deriv: Renamed
1591 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1593 * Theory Library/Multiset: Improved code generation of multisets.
1595 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1596 are expressed via type classes again. The special syntax
1597 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1598 setsum_set, which is now subsumed by Big_Operators.setsum.
1601 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1602 use theory HOL/Library/Nat_Bijection instead.
1604 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1605 trees is now inside a type class context. Names of affected
1606 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1607 theories working directly with raw red-black trees, adapt the names as
1611 bulkload -> rbt_bulkload
1612 del_from_left -> rbt_del_from_left
1613 del_from_right -> rbt_del_from_right
1615 delete -> rbt_delete
1617 insert -> rbt_insert
1618 insertw -> rbt_insert_with
1619 insert_with_key -> rbt_insert_with_key
1620 map_entry -> rbt_map_entry
1621 lookup -> rbt_lookup
1622 sorted -> rbt_sorted
1623 tree_greater -> rbt_greater
1624 tree_less -> rbt_less
1625 tree_less_symbol -> rbt_less_symbol
1627 union_with -> rbt_union_with
1628 union_with_key -> rbt_union_with_key
1631 balance_left_sorted -> balance_left_rbt_sorted
1632 balance_left_tree_greater -> balance_left_rbt_greater
1633 balance_left_tree_less -> balance_left_rbt_less
1634 balance_right_sorted -> balance_right_rbt_sorted
1635 balance_right_tree_greater -> balance_right_rbt_greater
1636 balance_right_tree_less -> balance_right_rbt_less
1637 balance_sorted -> balance_rbt_sorted
1638 balance_tree_greater -> balance_rbt_greater
1639 balance_tree_less -> balance_rbt_less
1640 bulkload_is_rbt -> rbt_bulkload_is_rbt
1641 combine_sorted -> combine_rbt_sorted
1642 combine_tree_greater -> combine_rbt_greater
1643 combine_tree_less -> combine_rbt_less
1644 delete_in_tree -> rbt_delete_in_tree
1645 delete_is_rbt -> rbt_delete_is_rbt
1646 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1647 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1648 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1649 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1650 del_in_tree -> rbt_del_in_tree
1651 del_inv1_inv2 -> rbt_del_inv1_inv2
1652 del_sorted -> rbt_del_rbt_sorted
1653 del_tree_greater -> rbt_del_rbt_greater
1654 del_tree_less -> rbt_del_rbt_less
1655 dom_lookup_Branch -> dom_rbt_lookup_Branch
1656 entries_lookup -> entries_rbt_lookup
1657 finite_dom_lookup -> finite_dom_rbt_lookup
1658 insert_sorted -> rbt_insert_rbt_sorted
1659 insertw_is_rbt -> rbt_insertw_is_rbt
1660 insertwk_is_rbt -> rbt_insertwk_is_rbt
1661 insertwk_sorted -> rbt_insertwk_rbt_sorted
1662 insertw_sorted -> rbt_insertw_rbt_sorted
1663 ins_sorted -> ins_rbt_sorted
1664 ins_tree_greater -> ins_rbt_greater
1665 ins_tree_less -> ins_rbt_less
1666 is_rbt_sorted -> is_rbt_rbt_sorted
1667 lookup_balance -> rbt_lookup_balance
1668 lookup_bulkload -> rbt_lookup_rbt_bulkload
1669 lookup_delete -> rbt_lookup_rbt_delete
1670 lookup_Empty -> rbt_lookup_Empty
1671 lookup_from_in_tree -> rbt_lookup_from_in_tree
1672 lookup_in_tree -> rbt_lookup_in_tree
1673 lookup_ins -> rbt_lookup_ins
1674 lookup_insert -> rbt_lookup_rbt_insert
1675 lookup_insertw -> rbt_lookup_rbt_insertw
1676 lookup_insertwk -> rbt_lookup_rbt_insertwk
1677 lookup_keys -> rbt_lookup_keys
1678 lookup_map -> rbt_lookup_map
1679 lookup_map_entry -> rbt_lookup_rbt_map_entry
1680 lookup_tree_greater -> rbt_lookup_rbt_greater
1681 lookup_tree_less -> rbt_lookup_rbt_less
1682 lookup_union -> rbt_lookup_rbt_union
1683 map_entry_color_of -> rbt_map_entry_color_of
1684 map_entry_inv1 -> rbt_map_entry_inv1
1685 map_entry_inv2 -> rbt_map_entry_inv2
1686 map_entry_is_rbt -> rbt_map_entry_is_rbt
1687 map_entry_sorted -> rbt_map_entry_rbt_sorted
1688 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1689 map_entry_tree_less -> rbt_map_entry_rbt_less
1690 map_tree_greater -> map_rbt_greater
1691 map_tree_less -> map_rbt_less
1692 map_sorted -> map_rbt_sorted
1693 paint_sorted -> paint_rbt_sorted
1694 paint_lookup -> paint_rbt_lookup
1695 paint_tree_greater -> paint_rbt_greater
1696 paint_tree_less -> paint_rbt_less
1697 sorted_entries -> rbt_sorted_entries
1698 tree_greater_eq_trans -> rbt_greater_eq_trans
1699 tree_greater_nit -> rbt_greater_nit
1700 tree_greater_prop -> rbt_greater_prop
1701 tree_greater_simps -> rbt_greater_simps
1702 tree_greater_trans -> rbt_greater_trans
1703 tree_less_eq_trans -> rbt_less_eq_trans
1704 tree_less_nit -> rbt_less_nit
1705 tree_less_prop -> rbt_less_prop
1706 tree_less_simps -> rbt_less_simps
1707 tree_less_trans -> rbt_less_trans
1708 tree_ord_props -> rbt_ord_props
1709 union_Branch -> rbt_union_Branch
1710 union_is_rbt -> rbt_union_is_rbt
1711 unionw_is_rbt -> rbt_unionw_is_rbt
1712 unionwk_is_rbt -> rbt_unionwk_is_rbt
1713 unionwk_sorted -> rbt_unionwk_rbt_sorted
1715 * Theory HOL/Library/Float: Floating point numbers are now defined as
1716 a subset of the real numbers. All operations are defined using the
1717 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1724 round_down -> float_round_down
1725 round_up -> float_round_up
1729 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1732 abs_float_def -> Float.compute_float_abs
1733 bitlen_ge0 -> bitlen_nonneg
1734 bitlen.simps -> Float.compute_bitlen
1735 float_components -> Float_mantissa_exponent
1736 float_divl.simps -> Float.compute_float_divl
1737 float_divr.simps -> Float.compute_float_divr
1738 float_eq_odd -> mult_powr_eq_mult_powr_iff
1739 float_power -> real_of_float_power
1740 lapprox_posrat_def -> Float.compute_lapprox_posrat
1741 lapprox_rat.simps -> Float.compute_lapprox_rat
1742 le_float_def' -> Float.compute_float_le
1743 le_float_def -> less_eq_float.rep_eq
1744 less_float_def' -> Float.compute_float_less
1745 less_float_def -> less_float.rep_eq
1746 normfloat_def -> Float.compute_normfloat
1747 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1748 normfloat -> normfloat_def
1749 normfloat_unique -> use normfloat_def
1750 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1751 one_float_def -> Float.compute_float_one
1752 plus_float_def -> Float.compute_float_plus
1753 rapprox_posrat_def -> Float.compute_rapprox_posrat
1754 rapprox_rat.simps -> Float.compute_rapprox_rat
1755 real_of_float_0 -> zero_float.rep_eq
1756 real_of_float_1 -> one_float.rep_eq
1757 real_of_float_abs -> abs_float.rep_eq
1758 real_of_float_add -> plus_float.rep_eq
1759 real_of_float_minus -> uminus_float.rep_eq
1760 real_of_float_mult -> times_float.rep_eq
1761 real_of_float_simp -> Float.rep_eq
1762 real_of_float_sub -> minus_float.rep_eq
1763 round_down.simps -> Float.compute_float_round_down
1764 round_up.simps -> Float.compute_float_round_up
1765 times_float_def -> Float.compute_float_times
1766 uminus_float_def -> Float.compute_float_uminus
1767 zero_float_def -> Float.compute_float_zero
1769 Lemmas not necessary anymore, use the transfer method:
1770 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1771 float_divr, float_le_simp, float_less1_mantissa_bound,
1772 float_less_simp, float_less_zero, float_le_zero,
1773 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1774 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1775 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1776 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1777 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1778 round_up, zero_le_float, zero_less_float
1780 * New theory HOL/Library/DAList provides an abstract type for
1781 association lists with distinct keys.
1783 * Session HOL/IMP: Added new theory of abstract interpretation of
1786 * Session HOL-Import: Re-implementation from scratch is faster,
1787 simpler, and more scalable. Requires a proof bundle, which is
1788 available as an external component. Discontinued old (and mostly
1789 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1791 * Session HOL-Word: Discontinued many redundant theorems specific to
1792 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1795 word_sub_alt ~> word_sub_wi
1796 word_add_alt ~> word_add_def
1797 word_mult_alt ~> word_mult_def
1798 word_minus_alt ~> word_minus_def
1799 word_0_alt ~> word_0_wi
1800 word_1_alt ~> word_1_wi
1801 word_add_0 ~> add_0_left
1802 word_add_0_right ~> add_0_right
1803 word_mult_1 ~> mult_1_left
1804 word_mult_1_right ~> mult_1_right
1805 word_add_commute ~> add_commute
1806 word_add_assoc ~> add_assoc
1807 word_add_left_commute ~> add_left_commute
1808 word_mult_commute ~> mult_commute
1809 word_mult_assoc ~> mult_assoc
1810 word_mult_left_commute ~> mult_left_commute
1811 word_left_distrib ~> left_distrib
1812 word_right_distrib ~> right_distrib
1813 word_left_minus ~> left_minus
1814 word_diff_0_right ~> diff_0_right
1815 word_diff_self ~> diff_self
1816 word_sub_def ~> diff_minus
1817 word_diff_minus ~> diff_minus
1818 word_add_ac ~> add_ac
1819 word_mult_ac ~> mult_ac
1820 word_plus_ac0 ~> add_0_left add_0_right add_ac
1821 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1822 word_order_trans ~> order_trans
1823 word_order_refl ~> order_refl
1824 word_order_antisym ~> order_antisym
1825 word_order_linear ~> linorder_linear
1826 lenw1_zero_neq_one ~> zero_neq_one
1827 word_number_of_eq ~> number_of_eq
1828 word_of_int_add_hom ~> wi_hom_add
1829 word_of_int_sub_hom ~> wi_hom_sub
1830 word_of_int_mult_hom ~> wi_hom_mult
1831 word_of_int_minus_hom ~> wi_hom_neg
1832 word_of_int_succ_hom ~> wi_hom_succ
1833 word_of_int_pred_hom ~> wi_hom_pred
1834 word_of_int_0_hom ~> word_0_wi
1835 word_of_int_1_hom ~> word_1_wi
1837 * Session HOL-Word: New proof method "word_bitwise" for splitting
1838 machine word equalities and inequalities into logical circuits,
1839 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1840 multiplication, shifting by constants, bitwise operators and numeric
1841 constants. Requires fixed-length word types, not 'a word. Solves
1842 many standard word identities outright and converts more into first
1843 order problems amenable to blast or similar. See also examples in
1844 HOL/Word/Examples/WordExamples.thy.
1846 * Session HOL-Probability: Introduced the type "'a measure" to
1847 represent measures, this replaces the records 'a algebra and 'a
1848 measure_space. The locales based on subset_class now have two
1849 locale-parameters the space \<Omega> and the set of measurable sets M.
1850 The product of probability spaces uses now the same constant as the
1851 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1852 measure". Most constants are defined now outside of locales and gain
1853 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1854 Measure space constructions for distributions and densities now got
1855 their own constants distr and density. Instead of using locales to
1856 describe measure spaces with a finite space, the measure count_space
1857 and point_measure is introduced. INCOMPATIBILITY.
1861 finite_measure.\<mu>' -> measure
1862 product_algebra_generator -> prod_algebra
1863 product_prob_space.emb -> prod_emb
1864 product_prob_space.infprod_algebra -> PiM
1867 completeable_measure_space
1868 finite_measure_space
1870 finite_product_finite_prob_space
1871 finite_product_sigma_algebra
1872 finite_sigma_algebra
1874 pair_finite_prob_space
1875 pair_finite_sigma_algebra
1878 product_sigma_algebra
1882 distribution -> use distr measure, or distributed predicate
1884 joint_distribution -> use distr measure, or distributed predicate
1885 pair_measure_generator
1886 product_prob_space.infprod_algebra -> use PiM
1889 Replacement theorems:
1890 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1891 finite_measure.empty_measure -> measure_empty
1892 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1893 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1894 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1895 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1896 finite_measure.finite_measure -> finite_measure.emeasure_finite
1897 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1898 finite_measure.positive_measure' -> measure_nonneg
1899 finite_measure.real_measure -> finite_measure.emeasure_real
1900 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1901 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1902 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1903 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1904 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1905 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1906 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1907 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1908 information_space.entropy_commute -> information_space.entropy_commute_simple
1909 information_space.entropy_eq -> information_space.entropy_simple_distributed
1910 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1911 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1912 information_space.entropy_uniform_max -> information_space.entropy_uniform
1913 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1914 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1915 information_space.KL_ge_0 -> information_space.KL_nonneg
1916 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1917 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1918 Int_stable_cuboids -> Int_stable_atLeastAtMost
1919 Int_stable_product_algebra_generator -> positive_integral
1920 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1921 measure_space.additive -> emeasure_additive
1922 measure_space.AE_iff_null_set -> AE_iff_null
1923 measure_space.almost_everywhere_def -> eventually_ae_filter
1924 measure_space.almost_everywhere_vimage -> AE_distrD
1925 measure_space.continuity_from_above -> INF_emeasure_decseq
1926 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1927 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1928 measure_space.continuity_from_below -> SUP_emeasure_incseq
1929 measure_space_density -> emeasure_density
1930 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1931 measure_space.integrable_vimage -> integrable_distr
1932 measure_space.integral_translated_density -> integral_density
1933 measure_space.integral_vimage -> integral_distr
1934 measure_space.measure_additive -> plus_emeasure
1935 measure_space.measure_compl -> emeasure_compl
1936 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1937 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1938 measure_space.measure_decseq -> decseq_emeasure
1939 measure_space.measure_Diff -> emeasure_Diff
1940 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1941 measure_space.measure_eq_0 -> emeasure_eq_0
1942 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1943 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1944 measure_space.measure_incseq -> incseq_emeasure
1945 measure_space.measure_insert -> emeasure_insert
1946 measure_space.measure_mono -> emeasure_mono
1947 measure_space.measure_not_negative -> emeasure_not_MInf
1948 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1949 measure_space.measure_setsum -> setsum_emeasure
1950 measure_space.measure_setsum_split -> setsum_emeasure_cover
1951 measure_space.measure_space_vimage -> emeasure_distr
1952 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1953 measure_space.measure_subadditive -> subadditive
1954 measure_space.measure_top -> emeasure_space
1955 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1956 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1957 measure_space.positive_integral_translated_density -> positive_integral_density
1958 measure_space.positive_integral_vimage -> positive_integral_distr
1959 measure_space.real_continuity_from_above -> Lim_measure_decseq
1960 measure_space.real_continuity_from_below -> Lim_measure_incseq
1961 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1962 measure_space.real_measure_Diff -> measure_Diff
1963 measure_space.real_measure_finite_Union -> measure_finite_Union
1964 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1965 measure_space.real_measure_subadditive -> measure_subadditive
1966 measure_space.real_measure_Union -> measure_Union
1967 measure_space.real_measure_UNION -> measure_UNION
1968 measure_space.simple_function_vimage -> simple_function_comp
1969 measure_space.simple_integral_vimage -> simple_integral_distr
1970 measure_space.simple_integral_vimage -> simple_integral_distr
1971 measure_unique_Int_stable -> measure_eqI_generator_eq
1972 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1973 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1974 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1975 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1976 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1977 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1978 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1979 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1980 pair_sigma_algebra.sets_swap -> sets_pair_swap
1981 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1982 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1983 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1984 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1985 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1986 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1987 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1988 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1989 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1990 prob_space.prob_space_vimage -> prob_space_distr
1991 prob_space.random_variable_restrict -> measurable_restrict
1992 prob_space_unique_Int_stable -> measure_eqI_prob_space
1993 product_algebraE -> prod_algebraE_all
1994 product_algebra_generator_der -> prod_algebra_eq_finite
1995 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1996 product_algebraI -> sets_PiM_I_finite
1997 product_measure_exists -> product_sigma_finite.sigma_finite
1998 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1999 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
2000 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
2001 product_prob_space.measurable_component -> measurable_component_singleton
2002 product_prob_space.measurable_emb -> measurable_prod_emb
2003 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
2004 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
2005 product_prob_space.measure_emb -> emeasure_prod_emb
2006 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
2007 product_sigma_algebra.product_algebra_into_space -> space_closed
2008 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
2009 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
2010 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
2011 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
2012 sets_product_algebra -> sets_PiM
2013 sigma_algebra.measurable_sigma -> measurable_measure_of
2014 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
2015 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
2016 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
2017 space_product_algebra -> space_PiM
2019 * Session HOL-TPTP: support to parse and import TPTP problems (all
2020 languages) into Isabelle/HOL.
2025 * New "case_product" attribute (see HOL).
2030 * Greater support for structured proofs involving induction or case
2033 * Much greater use of mathematical symbols.
2035 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2040 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2041 from a minor keyword introduced via theory header declaration.
2043 * Antiquotation @{command_spec "name"} produces the
2044 Outer_Syntax.command_spec from a major keyword introduced via theory
2045 header declaration; it can be passed to Outer_Syntax.command etc.
2047 * Local_Theory.define no longer hard-wires default theorem name
2048 "foo_def", but retains the binding as given. If that is Binding.empty
2049 / Attrib.empty_binding, the result is not registered as user-level
2050 fact. The Local_Theory.define_internal variant allows to specify a
2051 non-empty name (used for the foundation in the background theory),
2052 while omitting the fact binding in the user-context. Potential
2053 INCOMPATIBILITY for derived definitional packages: need to specify
2054 naming policy for primitive definitions more explicitly.
2056 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2057 conformance with similar operations in structure Term and Logic.
2059 * Antiquotation @{attributes [...]} embeds attribute source
2060 representation into the ML text, which is particularly useful with
2061 declarations like Local_Theory.note.
2063 * Structure Proof_Context follows standard naming scheme. Old
2064 ProofContext has been discontinued. INCOMPATIBILITY.
2066 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2067 change of semantics: update is applied to auxiliary local theory
2070 * Modernized some old-style infix operations:
2072 addeqcongs ~> Simplifier.add_eqcong
2073 deleqcongs ~> Simplifier.del_eqcong
2074 addcongs ~> Simplifier.add_cong
2075 delcongs ~> Simplifier.del_cong
2076 setmksimps ~> Simplifier.set_mksimps
2077 setmkcong ~> Simplifier.set_mkcong
2078 setmksym ~> Simplifier.set_mksym
2079 setmkeqTrue ~> Simplifier.set_mkeqTrue
2080 settermless ~> Simplifier.set_termless
2081 setsubgoaler ~> Simplifier.set_subgoaler
2082 addsplits ~> Splitter.add_split
2083 delsplits ~> Splitter.del_split
2088 * USER_HOME settings variable points to cross-platform user home
2089 directory, which coincides with HOME on POSIX systems only. Likewise,
2090 the Isabelle path specification "~" now expands to $USER_HOME, instead
2091 of former $HOME. A different default for USER_HOME may be set
2092 explicitly in shell environment, before Isabelle settings are
2093 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2094 the generic user home was intended.
2096 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2097 notation, which is useful for the jEdit file browser, for example.
2099 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2104 New in Isabelle2011-1 (October 2011)
2105 ------------------------------------
2109 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2110 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2112 - Management of multiple theory files directly from the editor
2113 buffer store -- bypassing the file-system (no requirement to save
2114 files for checking).
2116 - Markup of formal entities within the text buffer, with semantic
2117 highlighting, tooltips and hyperlinks to jump to defining source
2120 - Improved text rendering, with sub/superscripts in the source
2121 buffer (including support for copy/paste wrt. output panel, HTML
2122 theory output and other non-Isabelle text boxes).
2124 - Refined scheduling of proof checking and printing of results,
2125 based on interactive editor view. (Note: jEdit folding and
2126 narrowing allows to restrict buffer perspectives explicitly.)
2128 - Reduced CPU performance requirements, usable on machines with few
2131 - Reduced memory requirements due to pruning of unused document
2132 versions (garbage collection).
2134 See also ~~/src/Tools/jEdit/README.html for further information,
2135 including some remaining limitations.
2137 * Theory loader: source files are exclusively located via the master
2138 directory of each theory node (where the .thy file itself resides).
2139 The global load path (such as src/HOL/Library) has been discontinued.
2140 Note that the path element ~~ may be used to reference theories in the
2141 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2144 * Theory loader: source files are identified by content via SHA1
2145 digests. Discontinued former path/modtime identification and optional
2146 ISABELLE_FILE_IDENT plugin scripts.
2148 * Parallelization of nested Isar proofs is subject to
2149 Goal.parallel_proofs_threshold (default 100). See also isabelle
2152 * Name space: former unsynchronized references are now proper
2153 configuration options, with more conventional names:
2155 long_names ~> names_long
2156 short_names ~> names_short
2157 unique_names ~> names_unique
2159 Minor INCOMPATIBILITY, need to declare options in context like this:
2161 declare [[names_unique = false]]
2163 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2164 that the result needs to be unique, which means fact specifications
2165 may have to be refined after enriching a proof context.
2167 * Attribute "case_names" has been refined: the assumptions in each case
2168 can be named now by following the case name with [name1 name2 ...].
2170 * Isabelle/Isar reference manual has been updated and extended:
2171 - "Synopsis" provides a catalog of main Isar language concepts.
2172 - Formal references in syntax diagrams, via @{rail} antiquotation.
2173 - Updated material from classic "ref" manual, notably about
2174 "Classical Reasoner".
2179 * Class bot and top require underlying partial order rather than
2180 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2182 * Class complete_lattice: generalized a couple of lemmas from sets;
2183 generalized theorems INF_cong and SUP_cong. New type classes for
2184 complete boolean algebras and complete linear orders. Lemmas
2185 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2186 class complete_linorder.
2188 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2189 Sup_fun_def, Inf_apply, Sup_apply.
2191 Removed redundant lemmas (the right hand side gives hints how to
2192 replace them for (metis ...), or (simp only: ...) proofs):
2194 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2195 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2196 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2197 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2198 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2199 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2200 Inter_def ~> INF_def, image_def
2201 Union_def ~> SUP_def, image_def
2202 INT_eq ~> INF_def, and image_def
2203 UN_eq ~> SUP_def, and image_def
2204 INF_subset ~> INF_superset_mono [OF _ order_refl]
2206 More consistent and comprehensive names:
2208 INTER_eq_Inter_image ~> INF_def
2209 UNION_eq_Union_image ~> SUP_def
2212 INF_leI ~> INF_lower
2213 INF_leI2 ~> INF_lower2
2214 le_INFI ~> INF_greatest
2215 le_SUPI ~> SUP_upper
2216 le_SUPI2 ~> SUP_upper2
2217 SUP_leI ~> SUP_least
2218 INFI_bool_eq ~> INF_bool_eq
2219 SUPR_bool_eq ~> SUP_bool_eq
2220 INFI_apply ~> INF_apply
2221 SUPR_apply ~> SUP_apply
2222 INTER_def ~> INTER_eq
2223 UNION_def ~> UNION_eq
2227 * Renamed theory Complete_Lattice to Complete_Lattices.
2230 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2231 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2232 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2233 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2235 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2236 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2237 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2240 * Added syntactic classes "inf" and "sup" for the respective
2241 constants. INCOMPATIBILITY: Changes in the argument order of the
2242 (mostly internal) locale predicates for some derived classes.
2244 * Theorem collections ball_simps and bex_simps do not contain theorems
2245 referring to UNION any longer; these have been moved to collection
2246 UN_ball_bex_simps. INCOMPATIBILITY.
2248 * Theory Archimedean_Field: floor now is defined as parameter of a
2249 separate type class floor_ceiling.
2251 * Theory Finite_Set: more coherent development of fold_set locales:
2253 locale fun_left_comm ~> locale comp_fun_commute
2254 locale fun_left_comm_idem ~> locale comp_fun_idem
2256 Both use point-free characterization; interpretation proofs may need
2257 adjustment. INCOMPATIBILITY.
2259 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2260 accordance with standard mathematical terminology. INCOMPATIBILITY.
2262 * Theory Complex_Main: The locale interpretations for the
2263 bounded_linear and bounded_bilinear locales have been removed, in
2264 order to reduce the number of duplicate lemmas. Users must use the
2265 original names for distributivity theorems, potential INCOMPATIBILITY.
2267 divide.add ~> add_divide_distrib
2268 divide.diff ~> diff_divide_distrib
2269 divide.setsum ~> setsum_divide_distrib
2270 mult.add_right ~> right_distrib
2271 mult.diff_right ~> right_diff_distrib
2272 mult_right.setsum ~> setsum_right_distrib
2273 mult_left.diff ~> left_diff_distrib
2275 * Theory Complex_Main: Several redundant theorems have been removed or
2276 replaced by more general versions. INCOMPATIBILITY.
2278 real_diff_def ~> minus_real_def
2279 real_divide_def ~> divide_real_def
2280 real_less_def ~> less_le
2281 real_abs_def ~> abs_real_def
2282 real_sgn_def ~> sgn_real_def
2283 real_mult_commute ~> mult_commute
2284 real_mult_assoc ~> mult_assoc
2285 real_mult_1 ~> mult_1_left
2286 real_add_mult_distrib ~> left_distrib
2287 real_zero_not_eq_one ~> zero_neq_one
2288 real_mult_inverse_left ~> left_inverse
2289 INVERSE_ZERO ~> inverse_zero
2290 real_le_refl ~> order_refl
2291 real_le_antisym ~> order_antisym
2292 real_le_trans ~> order_trans
2293 real_le_linear ~> linear
2294 real_le_eq_diff ~> le_iff_diff_le_0
2295 real_add_left_mono ~> add_left_mono
2296 real_mult_order ~> mult_pos_pos
2297 real_mult_less_mono2 ~> mult_strict_left_mono
2298 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2299 real_0_le_divide_iff ~> zero_le_divide_iff
2300 realpow_two_disj ~> power2_eq_iff
2301 real_squared_diff_one_factored ~> square_diff_one_factored
2302 realpow_two_diff ~> square_diff_square_factored
2303 reals_complete2 ~> complete_real
2304 real_sum_squared_expand ~> power2_sum
2305 exp_ln_eq ~> ln_unique
2307 expi_zero ~> exp_zero
2308 lemma_DERIV_subst ~> DERIV_cong
2309 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2310 LIMSEQ_const ~> tendsto_const
2311 LIMSEQ_norm ~> tendsto_norm
2312 LIMSEQ_add ~> tendsto_add
2313 LIMSEQ_minus ~> tendsto_minus
2314 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2315 LIMSEQ_diff ~> tendsto_diff
2316 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2317 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2318 LIMSEQ_mult ~> tendsto_mult
2319 LIMSEQ_inverse ~> tendsto_inverse
2320 LIMSEQ_divide ~> tendsto_divide
2321 LIMSEQ_pow ~> tendsto_power
2322 LIMSEQ_setsum ~> tendsto_setsum
2323 LIMSEQ_setprod ~> tendsto_setprod
2324 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2325 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2326 LIMSEQ_imp_rabs ~> tendsto_rabs
2327 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2328 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2329 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2330 LIMSEQ_Complex ~> tendsto_Complex
2331 LIM_ident ~> tendsto_ident_at
2332 LIM_const ~> tendsto_const
2333 LIM_add ~> tendsto_add
2334 LIM_add_zero ~> tendsto_add_zero
2335 LIM_minus ~> tendsto_minus
2336 LIM_diff ~> tendsto_diff
2337 LIM_norm ~> tendsto_norm
2338 LIM_norm_zero ~> tendsto_norm_zero
2339 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2340 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2341 LIM_rabs ~> tendsto_rabs
2342 LIM_rabs_zero ~> tendsto_rabs_zero
2343 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2344 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2345 LIM_compose ~> tendsto_compose
2346 LIM_mult ~> tendsto_mult
2347 LIM_scaleR ~> tendsto_scaleR
2348 LIM_of_real ~> tendsto_of_real
2349 LIM_power ~> tendsto_power
2350 LIM_inverse ~> tendsto_inverse
2351 LIM_sgn ~> tendsto_sgn
2352 isCont_LIM_compose ~> isCont_tendsto_compose
2353 bounded_linear.LIM ~> bounded_linear.tendsto
2354 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2355 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2356 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2357 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2358 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2359 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2361 * Theory Complex_Main: The definition of infinite series was
2362 generalized. Now it is defined on the type class {topological_space,
2363 comm_monoid_add}. Hence it is useable also for extended real numbers.
2365 * Theory Complex_Main: The complex exponential function "expi" is now
2366 a type-constrained abbreviation for "exp :: complex => complex"; thus
2367 several polymorphic lemmas about "exp" are now applicable to "expi".
2371 - Theory Library/Code_Char_ord provides native ordering of
2372 characters in the target language.
2374 - Commands code_module and code_library are legacy, use export_code
2377 - Method "evaluation" is legacy, use method "eval" instead.
2379 - Legacy evaluator "SML" is deactivated by default. May be
2380 reactivated by the following theory command:
2382 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2384 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2386 * New proof method "induction" that gives induction hypotheses the
2387 name "IH", thus distinguishing them from further hypotheses that come
2388 from rule induction. The latter are still called "hyps". Method
2389 "induction" is a thin wrapper around "induct" and follows the same
2392 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2393 still available as a legacy feature for some time.
2396 - Added "need" and "total_consts" options.
2397 - Reintroduced "show_skolems" option by popular demand.
2398 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2402 - Use quasi-sound (and efficient) translations by default.
2403 - Added support for the following provers: E-ToFoF, LEO-II,
2404 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2405 - Automatically preplay and minimize proofs before showing them if
2406 this can be done within reasonable time.
2407 - sledgehammer available_provers ~> sledgehammer supported_provers.
2409 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2410 "max_mono_iters", and "max_new_mono_instances" options.
2411 - Removed "explicit_apply" and "full_types" options as well as "Full
2412 Types" Proof General menu item. INCOMPATIBILITY.
2415 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2416 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2420 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2421 "elim:" options. INCOMPATIBILITY.
2422 - Introduced 'try' that not only runs 'try_methods' but also
2423 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2426 - Added "eval" option to evaluate terms for the found counterexample
2427 (currently only supported by the default (exhaustive) tester).
2428 - Added post-processing of terms to obtain readable counterexamples
2429 (currently only supported by the default (exhaustive) tester).
2430 - New counterexample generator quickcheck[narrowing] enables
2431 narrowing-based testing. Requires the Glasgow Haskell compiler
2432 with its installation location defined in the Isabelle settings
2433 environment as ISABELLE_GHC.
2434 - Removed quickcheck tester "SML" based on the SML code generator
2435 (formly in HOL/Library).
2437 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2438 use 'partial_function' instead.
2440 * Theory Library/Extended_Reals replaces now the positive extended
2441 reals found in probability theory. This file is extended by
2442 Multivariate_Analysis/Extended_Real_Limits.
2444 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2445 from where it must be imported explicitly if it is really required.
2448 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2449 been moved here. INCOMPATIBILITY.
2451 * Theory Library/Saturated provides type of numbers with saturated
2454 * Theory Library/Product_Lattice defines a pointwise ordering for the
2455 product type 'a * 'b, and provides instance proofs for various order
2456 and lattice type classes.
2458 * Theory Library/Countable now provides the "countable_datatype" proof
2459 method for proving "countable" class instances for datatypes.
2461 * Theory Library/Cset_Monad allows do notation for computable sets
2462 (cset) via the generic monad ad-hoc overloading facility.
2464 * Library: Theories of common data structures are split into theories
2465 for implementation, an invariant-ensuring type, and connection to an
2466 abstract type. INCOMPATIBILITY.
2468 - RBT is split into RBT and RBT_Mapping.
2469 - AssocList is split and renamed into AList and AList_Mapping.
2470 - DList is split into DList_Impl, DList, and DList_Cset.
2471 - Cset is split into Cset and List_Cset.
2473 * Theory Library/Nat_Infinity has been renamed to
2474 Library/Extended_Nat, with name changes of the following types and
2477 type inat ~> type enat
2479 Infty ~> infinity (overloaded)
2483 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2484 been renamed accordingly. INCOMPATIBILITY.
2486 * Session Multivariate_Analysis: The euclidean_space type class now
2487 fixes a constant "Basis :: 'a set" consisting of the standard
2488 orthonormal basis for the type. Users now have the option of
2489 quantifying over this set instead of using the "basis" function, e.g.
2490 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2492 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2493 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2494 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2495 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2496 changed to match. Definition theorems for overloaded constants now use
2497 the standard "foo_vec_def" naming scheme. A few other theorems have
2498 been renamed as follows (INCOMPATIBILITY):
2500 Cart_eq ~> vec_eq_iff
2501 dist_nth_le_cart ~> dist_vec_nth_le
2502 tendsto_vector ~> vec_tendstoI
2503 Cauchy_vector ~> vec_CauchyI
2505 * Session Multivariate_Analysis: Several duplicate theorems have been
2506 removed, and other theorems have been renamed or replaced with more
2507 general versions. INCOMPATIBILITY.
2509 finite_choice ~> finite_set_choice
2510 eventually_conjI ~> eventually_conj
2511 eventually_and ~> eventually_conj_iff
2512 eventually_false ~> eventually_False
2513 setsum_norm ~> norm_setsum
2514 Lim_sequentially ~> LIMSEQ_def
2515 Lim_ident_at ~> LIM_ident
2516 Lim_const ~> tendsto_const
2517 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2518 Lim_neg ~> tendsto_minus
2519 Lim_add ~> tendsto_add
2520 Lim_sub ~> tendsto_diff
2521 Lim_mul ~> tendsto_scaleR
2522 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2523 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2524 Lim_linear ~> bounded_linear.tendsto
2525 Lim_component ~> tendsto_euclidean_component
2526 Lim_component_cart ~> tendsto_vec_nth
2527 Lim_inner ~> tendsto_inner [OF tendsto_const]
2528 dot_lsum ~> inner_setsum_left
2529 dot_rsum ~> inner_setsum_right
2530 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2531 continuous_neg ~> continuous_minus
2532 continuous_sub ~> continuous_diff
2533 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2534 continuous_mul ~> continuous_scaleR
2535 continuous_inv ~> continuous_inverse
2536 continuous_at_within_inv ~> continuous_at_within_inverse
2537 continuous_at_inv ~> continuous_at_inverse
2538 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2539 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2540 continuous_at_component ~> continuous_component [OF continuous_at_id]
2541 continuous_on_neg ~> continuous_on_minus
2542 continuous_on_sub ~> continuous_on_diff
2543 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2544 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2545 continuous_on_mul ~> continuous_on_scaleR
2546 continuous_on_mul_real ~> continuous_on_mult
2547 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2548 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2549 continuous_on_inverse ~> continuous_on_inv
2550 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2551 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2552 subset_interior ~> interior_mono
2553 subset_closure ~> closure_mono
2554 closure_univ ~> closure_UNIV
2555 real_arch_lt ~> reals_Archimedean2
2556 real_arch ~> reals_Archimedean3
2557 real_abs_norm ~> abs_norm_cancel
2558 real_abs_sub_norm ~> norm_triangle_ineq3
2559 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2561 * Session HOL-Probability:
2562 - Caratheodory's extension lemma is now proved for ring_of_sets.
2563 - Infinite products of probability measures are now available.
2564 - Sigma closure is independent, if the generator is independent
2565 - Use extended reals instead of positive extended
2566 reals. INCOMPATIBILITY.
2568 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2570 expand_fun_below ~> fun_below_iff
2571 below_fun_ext ~> fun_belowI
2572 expand_cfun_eq ~> cfun_eq_iff
2573 ext_cfun ~> cfun_eqI
2574 expand_cfun_below ~> cfun_below_iff
2575 below_cfun_ext ~> cfun_belowI
2576 monofun_fun_fun ~> fun_belowD
2577 monofun_fun_arg ~> monofunE
2578 monofun_lub_fun ~> adm_monofun [THEN admD]
2579 cont_lub_fun ~> adm_cont [THEN admD]
2580 cont2cont_Rep_CFun ~> cont2cont_APP
2581 cont_Rep_CFun_app ~> cont_APP_app
2582 cont_Rep_CFun_app_app ~> cont_APP_app_app
2583 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2584 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2585 contlub_cfun ~> lub_APP [symmetric]
2586 contlub_LAM ~> lub_LAM [symmetric]
2589 lift_distinct1 ~> lift.distinct(1)
2590 lift_distinct2 ~> lift.distinct(2)
2591 Def_not_UU ~> lift.distinct(2)
2592 Def_inject ~> lift.inject
2593 below_UU_iff ~> below_bottom_iff
2594 eq_UU_iff ~> eq_bottom_iff
2597 *** Document preparation ***
2599 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2600 isar-ref manual, both for description and actual application of the
2603 * Antiquotation @{value} evaluates the given term and presents its
2606 * Antiquotations: term style "isub" provides ad-hoc conversion of
2607 variables x1, y23 into subscripted form x\<^isub>1,
2608 y\<^isub>2\<^isub>3.
2610 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2611 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2613 * Localized \isabellestyle switch can be used within blocks or groups
2616 \isabellestyle{it} %preferred default
2617 {\isabellestylett @{text "typewriter stuff"}}
2619 * Discontinued special treatment of hard tabulators. Implicit
2620 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2626 * The inner syntax of sort/type/term/prop supports inlined YXML
2627 representations within quoted string tokens. By encoding logical
2628 entities via Term_XML (in ML or Scala) concrete syntax can be
2629 bypassed, which is particularly useful for producing bits of text
2630 under external program control.
2632 * Antiquotations for ML and document preparation are managed as theory
2633 data, which requires explicit setup.
2635 * Isabelle_Process.is_active allows tools to check if the official
2636 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2637 (better known as Proof General).
2639 * Structure Proof_Context follows standard naming scheme. Old
2640 ProofContext is still available for some time as legacy alias.
2642 * Structure Timing provides various operations for timing; supersedes
2643 former start_timing/end_timing etc.
2645 * Path.print is the official way to show file-system paths to users
2646 (including quotes etc.).
2648 * Inner syntax: identifiers in parse trees of generic categories
2649 "logic", "aprop", "idt" etc. carry position information (disguised as
2650 type constraints). Occasional INCOMPATIBILITY with non-compliant
2651 translations that choke on unexpected type constraints. Positions can
2652 be stripped in ML translations via Syntax.strip_positions /
2653 Syntax.strip_positions_ast, or via the syntax constant
2654 "_strip_positions" within parse trees. As last resort, positions can
2655 be disabled via the configuration option Syntax.positions, which is
2656 called "syntax_positions" in Isar attribute syntax.
2658 * Discontinued special status of various ML structures that contribute
2659 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2660 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2661 refer directly to Ast.Constant, Lexicon.is_identifier,
2662 Syntax_Trans.mk_binder_tr etc.
2664 * Typed print translation: discontinued show_sorts argument, which is
2665 already available via context of "advanced" translation.
2667 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2668 goal states; body tactic needs to address all subgoals uniformly.
2670 * Slightly more special eq_list/eq_set, with shortcut involving
2671 pointer equality (assumes that eq relation is reflexive).
2673 * Classical tactics use proper Proof.context instead of historic types
2674 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2675 operate directly on Proof.context. Raw type claset retains its use as
2676 snapshot of the classical context, which can be recovered via
2677 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2678 INCOMPATIBILITY, classical tactics and derived proof methods require
2679 proper Proof.context.
2684 * Discontinued support for Poly/ML 5.2, which was the last version
2685 without proper multithreading and TimeLimit implementation.
2687 * Discontinued old lib/scripts/polyml-platform, which has been
2688 obsolete since Isabelle2009-2.
2690 * Various optional external tools are referenced more robustly and
2691 uniformly by explicit Isabelle settings as follows:
2693 ISABELLE_CSDP (formerly CSDP_EXE)
2694 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2695 ISABELLE_OCAML (formerly EXEC_OCAML)
2696 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2697 ISABELLE_YAP (formerly EXEC_YAP)
2699 Note that automated detection from the file-system or search path has
2700 been discontinued. INCOMPATIBILITY.
2702 * Scala layer provides JVM method invocation service for static
2703 methods of type (String)String, see Invoke_Scala.method in ML. For
2706 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2708 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2709 this allows to pass structured values between ML and Scala.
2711 * The IsabelleText fonts includes some further glyphs to support the
2712 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2713 installed a local copy (which is normally *not* required) need to
2714 delete or update it from ~~/lib/fonts/.
2718 New in Isabelle2011 (January 2011)
2719 ----------------------------------
2723 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2724 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2725 useful tooltips and hyperlinks produced from its static analysis. The
2726 bundled component provides an executable Isabelle tool that can be run
2729 Isabelle2011/bin/isabelle jedit
2731 * Significantly improved Isabelle/Isar implementation manual.
2733 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2734 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2735 while the default heap location within that directory lacks that extra
2736 suffix. This isolates multiple Isabelle installations from each
2737 other, avoiding problems with old settings in new versions.
2738 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2740 * Source files are always encoded as UTF-8, instead of old-fashioned
2741 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2742 the following package declarations:
2744 \usepackage[utf8]{inputenc}
2745 \usepackage{textcomp}
2747 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2748 a Unicode character is treated as a single symbol, not a sequence of
2749 non-ASCII bytes as before. Since Isabelle/ML string literals may
2750 contain symbols without further backslash escapes, Unicode can now be
2751 used here as well. Recall that Symbol.explode in ML provides a
2752 consistent view on symbols, while raw explode (or String.explode)
2753 merely give a byte-oriented representation.
2755 * Theory loader: source files are primarily located via the master
2756 directory of each theory node (where the .thy file itself resides).
2757 The global load path is still partially available as legacy feature.
2758 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2759 explicit paths, relatively to the theory.
2761 * Special treatment of ML file names has been discontinued.
2762 Historically, optional extensions .ML or .sml were added on demand --
2763 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2764 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2766 * Various options that affect pretty printing etc. are now properly
2767 handled within the context via configuration options, instead of
2768 unsynchronized references or print modes. There are both ML Config.T
2769 entities and Isar declaration attributes to access these.
2771 ML (Config.T) Isar (attribute)
2773 eta_contract eta_contract
2774 show_brackets show_brackets
2775 show_sorts show_sorts
2776 show_types show_types
2777 show_question_marks show_question_marks
2778 show_consts show_consts
2779 show_abbrevs show_abbrevs
2781 Syntax.ast_trace syntax_ast_trace
2782 Syntax.ast_stat syntax_ast_stat
2783 Syntax.ambiguity_level syntax_ambiguity_level
2785 Goal_Display.goals_limit goals_limit
2786 Goal_Display.show_main_goal show_main_goal
2788 Method.rule_trace rule_trace
2790 Thy_Output.display thy_output_display
2791 Thy_Output.quotes thy_output_quotes
2792 Thy_Output.indent thy_output_indent
2793 Thy_Output.source thy_output_source
2794 Thy_Output.break thy_output_break
2796 Note that corresponding "..._default" references in ML may only be
2797 changed globally at the ROOT session setup, but *not* within a theory.
2798 The option "show_abbrevs" supersedes the former print mode
2799 "no_abbrevs" with inverted meaning.
2801 * More systematic naming of some configuration options.
2804 trace_simp ~> simp_trace
2805 debug_simp ~> simp_debug
2807 * Support for real valued configuration options, using simplistic
2808 floating-point notation that coincides with the inner syntax for
2811 * Support for real valued preferences (with approximative PGIP type):
2812 front-ends need to accept "pgint" values in float notation.
2815 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2818 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2823 * Command 'type_synonym' (with single argument) replaces somewhat
2824 outdated 'types', which is still available as legacy feature for some
2827 * Command 'nonterminal' (with 'and' separated list of arguments)
2828 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2830 * Command 'notepad' replaces former 'example_proof' for
2831 experimentation in Isar without any result. INCOMPATIBILITY.
2833 * Locale interpretation commands 'interpret' and 'sublocale' accept
2834 lists of equations to map definitions in a locale to appropriate
2835 entities in the context of the interpretation. The 'interpretation'
2836 command already provided this functionality.
2838 * Diagnostic command 'print_dependencies' prints the locale instances
2839 that would be activated if the specified expression was interpreted in
2840 the current context. Variant "print_dependencies!" assumes a context
2841 without interpretations.
2843 * Diagnostic command 'print_interps' prints interpretations in proofs
2844 in addition to interpretations in theories.
2846 * Discontinued obsolete 'global' and 'local' commands to manipulate
2847 the theory name space. Rare INCOMPATIBILITY. The ML functions
2848 Sign.root_path and Sign.local_path may be applied directly where this
2849 feature is still required for historical reasons.
2851 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2852 'definition' instead.
2854 * The "prems" fact, which refers to the accidental collection of
2855 foundational premises in the context, is now explicitly marked as
2856 legacy feature and will be discontinued soon. Consider using "assms"
2857 of the head statement or reference facts by explicit names.
2859 * Document antiquotations @{class} and @{type} print classes and type
2862 * Document antiquotation @{file} checks file/directory entries within
2863 the local file system.
2868 * Coercive subtyping: functions can be declared as coercions and type
2869 inference will add them as necessary upon input of a term. Theory
2870 Complex_Main declares real :: nat => real and real :: int => real as
2871 coercions. A coercion function f is declared like this:
2873 declare [[coercion f]]
2875 To lift coercions through type constructors (e.g. from nat => real to
2876 nat list => real list), map functions can be declared, e.g.
2878 declare [[coercion_map map]]
2880 Currently coercion inference is activated only in theories including
2881 real numbers, i.e. descendants of Complex_Main. This is controlled by
2882 the configuration option "coercion_enabled", e.g. it can be enabled in
2883 other theories like this:
2885 declare [[coercion_enabled]]
2887 * Command 'partial_function' provides basic support for recursive
2888 function definitions over complete partial orders. Concrete instances
2889 are provided for i) the option type, ii) tail recursion on arbitrary
2890 types, and iii) the heap monad of Imperative_HOL. See
2891 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2894 * Function package: f.psimps rules are no longer implicitly declared
2895 as [simp]. INCOMPATIBILITY.
2897 * Datatype package: theorems generated for executable equality (class
2898 "eq") carry proper names and are treated as default code equations.
2900 * Inductive package: now offers command 'inductive_simps' to
2901 automatically derive instantiated and simplified equations for
2902 inductive predicates, similar to 'inductive_cases'.
2904 * Command 'enriched_type' allows to register properties of the
2905 functorial structure of types.
2907 * Improved infrastructure for term evaluation using code generator
2908 techniques, in particular static evaluation conversions.
2910 * Code generator: Scala (2.8 or higher) has been added to the target
2913 * Code generator: globbing constant expressions "*" and "Theory.*"
2914 have been replaced by the more idiomatic "_" and "Theory._".
2917 * Code generator: export_code without explicit file declaration prints
2918 to standard output. INCOMPATIBILITY.
2920 * Code generator: do not print function definitions for case
2921 combinators any longer.
2923 * Code generator: simplification with rules determined with
2924 src/Tools/Code/code_simp.ML and method "code_simp".
2926 * Code generator for records: more idiomatic representation of record
2927 types. Warning: records are not covered by ancient SML code
2928 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2929 rep_datatype declaration helps to succeed then:
2933 rep_datatype foo_ext ...
2935 * Records: logical foundation type for records does not carry a
2936 '_type' suffix any longer (obsolete due to authentic syntax).
2939 * Quickcheck now by default uses exhaustive testing instead of random
2940 testing. Random testing can be invoked by "quickcheck [random]",
2941 exhaustive testing by "quickcheck [exhaustive]".
2943 * Quickcheck instantiates polymorphic types with small finite
2944 datatypes by default. This enables a simple execution mechanism to
2945 handle quantifiers and function equality over the finite datatypes.
2947 * Quickcheck random generator has been renamed from "code" to
2948 "random". INCOMPATIBILITY.
2950 * Quickcheck now has a configurable time limit which is set to 30
2951 seconds by default. This can be changed by adding [timeout = n] to the
2952 quickcheck command. The time limit for Auto Quickcheck is still set
2955 * Quickcheck in locales considers interpretations of that locale for
2956 counter example search.
2959 - Added "smt" and "remote_smt" provers based on the "smt" proof
2960 method. See the Sledgehammer manual for details ("isabelle doc
2963 sledgehammer atp_info ~> sledgehammer running_provers
2964 sledgehammer atp_kill ~> sledgehammer kill_provers
2965 sledgehammer available_atps ~> sledgehammer available_provers
2968 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2969 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2970 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2971 (and "ms" and "min" are no longer supported)
2976 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2977 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2979 - Added support for partial quotient types.
2980 - Added local versions of the "Nitpick.register_xxx" functions.
2981 - Added "whack" option.
2982 - Allow registration of quotient types as codatatypes.
2983 - Improved "merge_type_vars" option to merge more types.
2984 - Removed unsound "fast_descrs" option.
2985 - Added custom symmetry breaking for datatypes, making it possible to reach
2986 higher cardinalities.
2987 - Prevent the expansion of too large definitions.
2989 * Proof methods "metis" and "meson" now have configuration options
2990 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2991 to diagnose these tools. E.g.
2993 using [[metis_trace = true]]
2995 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2996 manually as command 'solve_direct'.
2998 * The default SMT solver Z3 must be enabled explicitly (due to
2999 licensing issues) by setting the environment variable
3000 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
3001 commercial applications, the SMT solver CVC3 is provided as fall-back;
3002 changing the SMT solver is done via the configuration option
3005 * Remote SMT solvers need to be referred to by the "remote_" prefix,
3006 i.e. "remote_cvc3" and "remote_z3".
3008 * Added basic SMT support for datatypes, records, and typedefs using
3009 the oracle mode (no proofs). Direct support of pairs has been dropped
3010 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
3011 support for a similar behavior). Minor INCOMPATIBILITY.
3013 * Changed SMT configuration options:
3015 z3_proofs ~> smt_oracle (with inverted meaning)
3016 z3_trace_assms ~> smt_trace_used_facts
3029 * Boogie output files (.b2i files) need to be declared in the theory
3032 * Simplification procedure "list_to_set_comprehension" rewrites list
3033 comprehensions applied to List.set to set comprehensions. Occasional
3034 INCOMPATIBILITY, may be deactivated like this:
3036 declare [[simproc del: list_to_set_comprehension]]
3038 * Removed old version of primrec package. INCOMPATIBILITY.
3040 * Removed simplifier congruence rule of "prod_case", as has for long
3041 been the case with "split". INCOMPATIBILITY.
3043 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3045 * Removed [split_format ... and ... and ...] version of
3046 [split_format]. Potential INCOMPATIBILITY.
3048 * Predicate "sorted" now defined inductively, with nice induction
3049 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3051 * Constant "contents" renamed to "the_elem", to free the generic name
3052 contents for other uses. INCOMPATIBILITY.
3054 * Renamed class eq and constant eq (for code generation) to class
3055 equal and constant equal, plus renaming of related facts and various
3056 tuning. INCOMPATIBILITY.
3058 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3060 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3063 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3064 avoid confusion with finite sets. INCOMPATIBILITY.
3066 * Abandoned locales equiv, congruent and congruent2 for equivalence
3067 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3070 * Some previously unqualified names have been qualified:
3077 Trueprop ~> HOL.Trueprop
3082 op --> ~> HOL.implies
3094 Pair ~> Product_Type.Pair
3095 fst ~> Product_Type.fst
3096 snd ~> Product_Type.snd
3097 curry ~> Product_Type.curry
3099 Collect ~> Set.Collect
3103 * More canonical naming convention for some fundamental definitions:
3105 bot_bool_eq ~> bot_bool_def
3106 top_bool_eq ~> top_bool_def
3107 inf_bool_eq ~> inf_bool_def
3108 sup_bool_eq ~> sup_bool_def
3109 bot_fun_eq ~> bot_fun_def
3110 top_fun_eq ~> top_fun_def
3111 inf_fun_eq ~> inf_fun_def
3112 sup_fun_eq ~> sup_fun_def
3116 * More stylized fact names:
3118 expand_fun_eq ~> fun_eq_iff
3119 expand_set_eq ~> set_eq_iff
3121 nat_number ~> eval_nat_numeral
3125 * Refactoring of code-generation specific operations in theory List:
3131 mem_iff ~> member_def
3132 null_empty ~> null_def
3134 INCOMPATIBILITY. Note that these were not supposed to be used
3135 regularly unless for striking reasons; their main purpose was code
3138 Various operations from the Haskell prelude are used for generating
3141 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3142 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3143 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3145 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3146 "*" and "+" respectively. INCOMPATIBILITY.
3148 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3149 "Sum_Type.Plus" instead.
3151 * Constant "split" has been merged with constant "prod_case"; names of
3152 ML functions, facts etc. involving split have been retained so far,
3153 though. INCOMPATIBILITY.
3155 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3156 instead. INCOMPATIBILITY.
3158 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3161 * Former theory Library/Enum is now part of the HOL-Main image.
3162 INCOMPATIBILITY: all constants of the Enum theory now have to be
3163 referred to by its qualified name.
3166 nlists ~> Enum.nlists
3167 product ~> Enum.product
3169 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3170 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3173 * Theory Library/SetsAndFunctions has been split into
3174 Library/Function_Algebras and Library/Set_Algebras; canonical names
3175 for instance definitions for functions; various improvements.
3178 * Theory Library/Multiset provides stable quicksort implementation of
3181 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3184 * Session Multivariate_Analysis: introduced a type class for euclidean
3185 space. Most theorems are now stated in terms of euclidean spaces
3186 instead of finite cartesian products.
3189 real ^ 'n ~> 'a::real_vector
3190 ~> 'a::euclidean_space
3191 ~> 'a::ordered_euclidean_space
3192 (depends on your needs)
3196 \<chi> x. _ ~> \<chi>\<chi> x. _
3199 Also note that the indices are now natural numbers and not from some
3200 finite type. Finite cartesian products of euclidean spaces, products
3201 of euclidean spaces the real and complex numbers are instantiated to
3202 be euclidean_spaces. INCOMPATIBILITY.
3204 * Session Probability: introduced pextreal as positive extended real
3205 numbers. Use pextreal as value for measures. Introduce the
3206 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3207 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3208 the integral in Multivariate Analysis. INCOMPATIBILITY.
3210 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3213 * Session SPARK (with image HOL-SPARK) provides commands to load and
3214 prove verification conditions generated by the SPARK Ada program
3215 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3220 * Theorems for additive ring operations (locale abelian_monoid and
3221 descendants) are generated by interpretation from their multiplicative
3222 counterparts. Names (in particular theorem names) have the mandatory
3223 qualifier 'add'. Previous theorem names are redeclared for
3226 * Structure "int_ring" is now an abbreviation (previously a
3227 definition). This fits more natural with advanced interpretations.
3232 * The domain package now runs in definitional mode by default: The
3233 former command 'new_domain' is now called 'domain'. To use the domain
3234 package in its original axiomatic mode, use 'domain (unsafe)'.
3237 * The new class "domain" is now the default sort. Class "predomain"
3238 is an unpointed version of "domain". Theories can be updated by
3239 replacing sort annotations as shown below. INCOMPATIBILITY.
3241 'a::type ~> 'a::countable
3242 'a::cpo ~> 'a::predomain
3243 'a::pcpo ~> 'a::domain
3245 * The old type class "rep" has been superseded by class "domain".
3246 Accordingly, users of the definitional package must remove any
3247 "default_sort rep" declarations. INCOMPATIBILITY.
3249 * The domain package (definitional mode) now supports unpointed
3250 predomain argument types, as long as they are marked 'lazy'. (Strict
3251 arguments must be in class "domain".) For example, the following
3252 domain definition now works:
3254 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3256 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3257 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3258 'a option, and 'a list. Additionally, it configures fixrec and the
3259 domain package to work with these types. For example:
3261 fixrec isInl :: "('a + 'b) u -> tr"
3262 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3264 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3266 * The "(permissive)" option of fixrec has been replaced with a
3267 per-equation "(unchecked)" option. See
3268 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3270 * The "bifinite" class no longer fixes a constant "approx"; the class
3271 now just asserts that such a function exists. INCOMPATIBILITY.
3273 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3274 defines an embedding of type 'a defl into udom by default; instances
3275 of "bifinite" and "domain" classes are available in
3276 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3278 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3280 * The predicate "directed" has been removed. INCOMPATIBILITY.
3282 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3284 * The function "cprod_map" has been renamed to "prod_map".
3287 * The monadic bind operator on each powerdomain has new binder syntax
3288 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3289 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3291 * The infix syntax for binary union on each powerdomain has changed
3292 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3293 syntax. INCOMPATIBILITY.
3295 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3296 still supported as an input translation.
3298 * Renamed some theorems (the original names are also still available).
3300 expand_fun_below ~> fun_below_iff
3301 below_fun_ext ~> fun_belowI
3302 expand_cfun_eq ~> cfun_eq_iff
3303 ext_cfun ~> cfun_eqI
3304 expand_cfun_below ~> cfun_below_iff
3305 below_cfun_ext ~> cfun_belowI
3306 cont2cont_Rep_CFun ~> cont2cont_APP
3308 * The Abs and Rep functions for various types have changed names.
3309 Related theorem names have also changed to match. INCOMPATIBILITY.
3311 Rep_CFun ~> Rep_cfun
3312 Abs_CFun ~> Abs_cfun
3313 Rep_Sprod ~> Rep_sprod
3314 Abs_Sprod ~> Abs_sprod
3315 Rep_Ssum ~> Rep_ssum
3316 Abs_Ssum ~> Abs_ssum
3318 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3319 been renamed to *_bottom_iff. INCOMPATIBILITY.
3321 * Various changes to bisimulation/coinduction with domain package:
3323 - Definitions of "bisim" constants no longer mention definedness.
3324 - With mutual recursion, "bisim" predicate is now curried.
3325 - With mutual recursion, each type gets a separate coind theorem.
3326 - Variable names in bisim_def and coinduct rules have changed.
3330 * Case combinators generated by the domain package for type "foo" are
3331 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3333 * Several theorems have been renamed to more accurately reflect the
3334 names of constants and types involved. INCOMPATIBILITY.
3336 thelub_const ~> lub_const
3337 lub_const ~> is_lub_const
3339 is_lub_lub ~> is_lubD2
3341 unique_lub ~> is_lub_unique
3342 is_ub_lub ~> is_lub_rangeD1
3343 lub_bin_chain ~> is_lub_bin_chain
3344 lub_fun ~> is_lub_fun
3345 thelub_fun ~> lub_fun
3346 thelub_cfun ~> lub_cfun
3347 thelub_Pair ~> lub_Pair
3348 lub_cprod ~> is_lub_prod
3349 thelub_cprod ~> lub_prod
3350 minimal_cprod ~> minimal_prod
3351 inst_cprod_pcpo ~> inst_prod_pcpo
3353 compact_UU ~> compact_bottom
3354 deflation_UU ~> deflation_bottom
3355 finite_deflation_UU ~> finite_deflation_bottom
3357 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3359 sq_ord_less_eq_trans ~> below_eq_trans
3360 sq_ord_eq_less_trans ~> eq_below_trans
3361 refl_less ~> below_refl
3362 trans_less ~> below_trans
3363 antisym_less ~> below_antisym
3364 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3365 box_less ~> box_below
3366 rev_trans_less ~> rev_below_trans
3367 not_less2not_eq ~> not_below2not_eq
3368 less_UU_iff ~> below_UU_iff
3369 flat_less_iff ~> flat_below_iff
3370 adm_less ~> adm_below
3371 adm_not_less ~> adm_not_below
3372 adm_compact_not_less ~> adm_compact_not_below
3373 less_fun_def ~> below_fun_def
3374 expand_fun_less ~> fun_below_iff
3375 less_fun_ext ~> fun_belowI
3376 less_discr_def ~> below_discr_def
3377 discr_less_eq ~> discr_below_eq
3378 less_unit_def ~> below_unit_def
3379 less_cprod_def ~> below_prod_def
3380 prod_lessI ~> prod_belowI
3381 Pair_less_iff ~> Pair_below_iff
3382 fst_less_iff ~> fst_below_iff
3383 snd_less_iff ~> snd_below_iff
3384 expand_cfun_less ~> cfun_below_iff
3385 less_cfun_ext ~> cfun_belowI
3386 injection_less ~> injection_below
3387 less_up_def ~> below_up_def
3388 not_Iup_less ~> not_Iup_below
3389 Iup_less ~> Iup_below
3391 Def_inject_less_eq ~> Def_below_Def
3392 Def_less_is_eq ~> Def_below_iff
3393 spair_less_iff ~> spair_below_iff
3394 less_sprod ~> below_sprod
3395 spair_less ~> spair_below
3396 sfst_less_iff ~> sfst_below_iff
3397 ssnd_less_iff ~> ssnd_below_iff
3398 fix_least_less ~> fix_least_below
3399 dist_less_one ~> dist_below_one
3400 less_ONE ~> below_ONE
3401 ONE_less_iff ~> ONE_below_iff
3402 less_sinlD ~> below_sinlD
3403 less_sinrD ~> below_sinrD
3408 * All constant names are now qualified internally and use proper
3409 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3414 * Antiquotation @{assert} inlines a function bool -> unit that raises
3415 Fail if the argument is false. Due to inlining the source position of
3416 failed assertions is included in the error output.
3418 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3419 text is in practice always evaluated with a stable theory checkpoint.
3420 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3422 * Antiquotation @{theory A} refers to theory A from the ancestry of
3423 the current context, not any accidental theory loader state as before.
3424 Potential INCOMPATIBILITY, subtle change in semantics.
3426 * Syntax.pretty_priority (default 0) configures the required priority
3427 of pretty-printed output and thus affects insertion of parentheses.
3429 * Syntax.default_root (default "any") configures the inner syntax
3430 category (nonterminal symbol) for parsing of terms.
3432 * Former exception Library.UnequalLengths now coincides with
3433 ListPair.UnequalLengths.
3435 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3436 main functionality is provided by structure Simplifier.
3438 * Renamed raw "explode" function to "raw_explode" to emphasize its
3439 meaning. Note that internally to Isabelle, Symbol.explode is used in
3440 almost all situations.
3442 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3443 See implementation manual for further details on exceptions in
3446 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3449 * Renamed structure PureThy to Pure_Thy and moved most of its
3450 operations to structure Global_Theory, to emphasize that this is
3451 rarely-used global-only stuff.
3453 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3454 instead (or tracing for high-volume output).
3456 * Configuration option show_question_marks only affects regular pretty
3457 printing of types and terms, not raw Term.string_of_vname.
3459 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3460 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3461 @{thms} for most purposes.
3463 * ML structure Unsynchronized is never opened, not even in Isar
3464 interaction mode as before. Old Unsynchronized.set etc. have been
3465 discontinued -- use plain := instead. This should be *rare* anyway,
3466 since modern tools always work via official context data, notably
3467 configuration options.
3469 * Parallel and asynchronous execution requires special care concerning
3470 interrupts. Structure Exn provides some convenience functions that
3471 avoid working directly with raw Interrupt. User code must not absorb
3472 interrupts -- intermediate handling (for cleanup etc.) needs to be
3473 followed by re-raising of the original exception. Another common
3474 source of mistakes are "handle _" patterns, which make the meaning of
3475 the program subject to physical effects of the environment.
3479 New in Isabelle2009-2 (June 2010)
3480 ---------------------------------
3484 * Authentic syntax for *all* logical entities (type classes, type
3485 constructors, term constants): provides simple and robust
3486 correspondence between formal entities and concrete syntax. Within
3487 the parse tree / AST representations, "constants" are decorated by
3488 their category (class, type, const) and spelled out explicitly with
3489 their full internal name.
3491 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3492 and translations (translation rules and translation functions in ML).
3493 Some hints on upgrading:
3495 - Many existing uses of 'syntax' and 'translations' can be replaced
3496 by more modern 'type_notation', 'notation' and 'abbreviation',
3497 which are independent of this issue.
3499 - 'translations' require markup within the AST; the term syntax
3500 provides the following special forms:
3502 CONST c -- produces syntax version of constant c from context
3503 XCONST c -- literally c, checked as constant from context
3504 c -- literally c, if declared by 'syntax'
3506 Plain identifiers are treated as AST variables -- occasionally the
3507 system indicates accidental variables via the error "rhs contains
3510 Type classes and type constructors are marked according to their
3511 concrete syntax. Some old translations rules need to be written
3512 for the "type" category, using type constructor application
3513 instead of pseudo-term application of the default category
3516 - 'parse_translation' etc. in ML may use the following
3519 @{class_syntax c} -- type class c within parse tree / AST
3520 @{term_syntax c} -- type constructor c within parse tree / AST
3521 @{const_syntax c} -- ML version of "CONST c" above
3522 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3524 - Literal types within 'typed_print_translations', i.e. those *not*
3525 represented as pseudo-terms are represented verbatim. Use @{class
3526 c} or @{type_name c} here instead of the above syntax
3529 Note that old non-authentic syntax was based on unqualified base
3530 names, so all of the above "constant" names would coincide. Recall
3531 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3532 diagnose syntax problems.
3534 * Type constructors admit general mixfix syntax, not just infix.
3536 * Concrete syntax may be attached to local entities without a proof
3537 body, too. This works via regular mixfix annotations for 'fix',
3538 'def', 'obtain' etc. or via the explicit 'write' command, which is
3539 similar to the 'notation' command in theory specifications.
3541 * Discontinued unnamed infix syntax (legacy feature for many years) --
3542 need to specify constant name and syntax separately. Internal ML
3543 datatype constructors have been renamed from InfixName to Infix etc.
3544 Minor INCOMPATIBILITY.
3546 * Schematic theorem statements need to be explicitly markup as such,
3547 via commands 'schematic_lemma', 'schematic_theorem',
3548 'schematic_corollary'. Thus the relevance of the proof is made
3549 syntactically clear, which impacts performance in a parallel or
3550 asynchronous interactive environment. Minor INCOMPATIBILITY.
3552 * Use of cumulative prems via "!" in some proof methods has been
3553 discontinued (old legacy feature).
3555 * References 'trace_simp' and 'debug_simp' have been replaced by
3556 configuration options stored in the context. Enabling tracing (the
3557 case of debugging is similar) in proofs works via
3559 using [[trace_simp = true]]
3561 Tracing is then active for all invocations of the simplifier in
3562 subsequent goal refinement steps. Tracing may also still be enabled or
3563 disabled via the ProofGeneral settings menu.
3565 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3566 'hide_fact' replace the former 'hide' KIND command. Minor
3569 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3570 more efficient than combinations with -q1 or -q2.
3575 * Proofterms record type-class reasoning explicitly, using the
3576 "unconstrain" operation internally. This eliminates all sort
3577 constraints from a theorem and proof, introducing explicit
3578 OFCLASS-premises. On the proof term level, this operation is
3579 automatically applied at theorem boundaries, such that closed proofs
3580 are always free of sort constraints. INCOMPATIBILITY for tools that
3581 inspect proof terms.
3583 * Local theory specifications may depend on extra type variables that
3584 are not present in the result type -- arguments TYPE('a) :: 'a itself
3585 are added internally. For example:
3587 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3589 * Predicates of locales introduced by classes carry a mandatory
3590 "class" prefix. INCOMPATIBILITY.
3592 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3594 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3597 * Command 'code_reflect' allows to incorporate generated ML code into
3598 runtime environment; replaces immature code_datatype antiquotation.
3601 * Code generator: simple concept for abstract datatypes obeying
3604 * Code generator: details of internal data cache have no impact on the
3605 user space functionality any longer.
3607 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3608 subgoals. This is more appropriate for interpretations with 'where'.
3611 * Command 'example_proof' opens an empty proof body. This allows to
3612 experiment with Isar, without producing any persistent result.
3614 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3615 within a local theory context, with explicit checking of the
3616 constructors involved (in contrast to the raw 'syntax' versions).
3618 * Commands 'types' and 'typedecl' now work within a local theory
3619 context -- without introducing dependencies on parameters or
3620 assumptions, which is not possible in Isabelle/Pure.
3622 * Command 'defaultsort' has been renamed to 'default_sort', it works
3623 within a local theory context. Minor INCOMPATIBILITY.
3628 * Command 'typedef' now works within a local theory context -- without
3629 introducing dependencies on parameters or assumptions, which is not
3630 possible in Isabelle/Pure/HOL. Note that the logical environment may
3631 contain multiple interpretations of local typedefs (with different
3632 non-emptiness proofs), even in a global theory context.
3634 * New package for quotient types. Commands 'quotient_type' and
3635 'quotient_definition' may be used for defining types and constants by
3636 quotient constructions. An example is the type of integers created by
3637 quotienting pairs of natural numbers:
3640 intrel :: "(nat * nat) => (nat * nat) => bool"
3642 "intrel (x, y) (u, v) = (x + v = u + y)"
3644 quotient_type int = "nat * nat" / intrel
3645 by (auto simp add: equivp_def expand_fun_eq)
3648 "0::int" is "(0::nat, 0::nat)"
3650 The method "lifting" can be used to lift of theorems from the
3651 underlying "raw" type to the quotient type. The example
3652 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3653 construction and provides a reasoning infrastructure for finite sets.
3655 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3656 clash with new theory Quotient in Main HOL.
3658 * Moved the SMT binding into the main HOL session, eliminating
3659 separate HOL-SMT session.
3661 * List membership infix mem operation is only an input abbreviation.
3664 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3665 for future developements; former Library/Word.thy is still present in
3666 the AFP entry RSAPPS.
3668 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3669 longer shadowed. INCOMPATIBILITY.
3671 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3674 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3677 * Dropped normalizing_semiring etc; use the facts in semiring classes
3678 instead. INCOMPATIBILITY.
3680 * Dropped several real-specific versions of lemmas about floor and
3681 ceiling; use the generic lemmas from theory "Archimedean_Field"
3682 instead. INCOMPATIBILITY.
3684 floor_number_of_eq ~> floor_number_of
3685 le_floor_eq_number_of ~> number_of_le_floor
3686 le_floor_eq_zero ~> zero_le_floor
3687 le_floor_eq_one ~> one_le_floor
3688 floor_less_eq_number_of ~> floor_less_number_of
3689 floor_less_eq_zero ~> floor_less_zero
3690 floor_less_eq_one ~> floor_less_one
3691 less_floor_eq_number_of ~> number_of_less_floor
3692 less_floor_eq_zero ~> zero_less_floor
3693 less_floor_eq_one ~> one_less_floor
3694 floor_le_eq_number_of ~> floor_le_number_of
3695 floor_le_eq_zero ~> floor_le_zero
3696 floor_le_eq_one ~> floor_le_one
3697 floor_subtract_number_of ~> floor_diff_number_of
3698 floor_subtract_one ~> floor_diff_one
3699 ceiling_number_of_eq ~> ceiling_number_of
3700 ceiling_le_eq_number_of ~> ceiling_le_number_of
3701 ceiling_le_zero_eq ~> ceiling_le_zero
3702 ceiling_le_eq_one ~> ceiling_le_one
3703 less_ceiling_eq_number_of ~> number_of_less_ceiling
3704 less_ceiling_eq_zero ~> zero_less_ceiling
3705 less_ceiling_eq_one ~> one_less_ceiling
3706 ceiling_less_eq_number_of ~> ceiling_less_number_of
3707 ceiling_less_eq_zero ~> ceiling_less_zero
3708 ceiling_less_eq_one ~> ceiling_less_one
3709 le_ceiling_eq_number_of ~> number_of_le_ceiling
3710 le_ceiling_eq_zero ~> zero_le_ceiling
3711 le_ceiling_eq_one ~> one_le_ceiling
3712 ceiling_subtract_number_of ~> ceiling_diff_number_of
3713 ceiling_subtract_one ~> ceiling_diff_one
3715 * Theory "Finite_Set": various folding_XXX locales facilitate the
3716 application of the various fold combinators on finite sets.
3718 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3719 provides abstract red-black tree type which is backed by "RBT_Impl" as
3720 implementation. INCOMPATIBILTY.
3722 * Theory Library/Coinductive_List has been removed -- superseded by
3723 AFP/thys/Coinductive.
3725 * Theory PReal, including the type "preal" and related operations, has
3726 been removed. INCOMPATIBILITY.
3728 * Real: new development using Cauchy Sequences.
3730 * Split off theory "Big_Operators" containing setsum, setprod,
3731 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3733 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3734 "Int" etc. INCOMPATIBILITY.
3736 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3738 * New set of rules "ac_simps" provides combined assoc / commute
3739 rewrites for all interpretations of the appropriate generic locales.
3741 * Renamed theory "OrderedGroup" to "Groups" and split theory
3742 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3743 appropriate and more consistent names suitable for name prefixes
3744 within the HOL theories. INCOMPATIBILITY.
3746 * Some generic constants have been put to appropriate theories:
3747 - less_eq, less: Orderings
3748 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3749 - inverse, divide: Rings
3752 * More consistent naming of type classes involving orderings (and
3755 lower_semilattice ~> semilattice_inf
3756 upper_semilattice ~> semilattice_sup
3758 dense_linear_order ~> dense_linorder
3760 pordered_ab_group_add ~> ordered_ab_group_add
3761 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3762 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3763 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3764 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3765 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3766 pordered_cancel_semiring ~> ordered_cancel_semiring
3767 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3768 pordered_comm_ring ~> ordered_comm_ring
3769 pordered_comm_semiring ~> ordered_comm_semiring
3770 pordered_ring ~> ordered_ring
3771 pordered_ring_abs ~> ordered_ring_abs
3772 pordered_semiring ~> ordered_semiring
3774 ordered_ab_group_add ~> linordered_ab_group_add
3775 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3776 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3777 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3778 ordered_field ~> linordered_field
3779 ordered_field_no_lb ~> linordered_field_no_lb
3780 ordered_field_no_ub ~> linordered_field_no_ub
3781 ordered_field_dense_linear_order ~> dense_linordered_field
3782 ordered_idom ~> linordered_idom
3783 ordered_ring ~> linordered_ring
3784 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3785 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3786 ordered_ring_strict ~> linordered_ring_strict
3787 ordered_semidom ~> linordered_semidom
3788 ordered_semiring ~> linordered_semiring
3789 ordered_semiring_1 ~> linordered_semiring_1
3790 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3791 ordered_semiring_strict ~> linordered_semiring_strict
3793 The following slightly odd type classes have been moved to a
3794 separate theory Library/Lattice_Algebras:
3796 lordered_ab_group_add ~> lattice_ab_group_add
3797 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3798 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3799 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3800 lordered_ring ~> lattice_ring
3804 * Refined field classes:
3805 - classes division_ring_inverse_zero, field_inverse_zero,
3806 linordered_field_inverse_zero include rule inverse 0 = 0 --
3807 subsumes former division_by_zero class;
3808 - numerous lemmas have been ported from field to division_ring.
3811 * Refined algebra theorem collections:
3812 - dropped theorem group group_simps, use algebra_simps instead;
3813 - dropped theorem group ring_simps, use field_simps instead;
3814 - proper theorem collection field_simps subsumes former theorem
3815 groups field_eq_simps and field_simps;
3816 - dropped lemma eq_minus_self_iff which is a duplicate for
3820 * Theory Finite_Set and List: some lemmas have been generalized from
3823 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3824 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3825 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3826 union_Union_fold_union ~> sup_Sup_fold_sup
3827 Inter_fold_inter ~> Inf_fold_inf
3828 Union_fold_union ~> Sup_fold_sup
3829 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3830 union_UNION_fold_union ~> sup_SUPR_fold_sup
3831 INTER_fold_inter ~> INFI_fold_inf
3832 UNION_fold_union ~> SUPR_fold_sup
3834 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3835 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3836 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3837 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3838 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3839 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3841 * Reorganized theory Multiset: swapped notation of pointwise and
3844 - pointwise ordering is instance of class order with standard syntax
3846 - multiset ordering has syntax <=# and <#; partial order properties
3847 are provided by means of interpretation with prefix
3849 - less duplication, less historical organization of sections,
3850 conversion from associations lists to multisets, rudimentary code
3852 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3857 multiset_eq_conv_count_eq ~> multiset_ext_iff
3858 multi_count_ext ~> multiset_ext
3859 diff_union_inverse2 ~> diff_union_cancelR
3863 * Theory Permutation: replaced local "remove" by List.remove1.
3865 * Code generation: ML and OCaml code is decorated with signatures.
3867 * Theory List: added transpose.
3869 * Library/Nat_Bijection.thy is a collection of bijective functions
3870 between nat and other types, which supersedes the older libraries
3871 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3874 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3875 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3876 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3877 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3878 Countable.pair_encode ~> prod_encode
3879 NatIso.prod2nat ~> prod_encode
3880 NatIso.nat2prod ~> prod_decode
3881 NatIso.sum2nat ~> sum_encode
3882 NatIso.nat2sum ~> sum_decode
3883 NatIso.list2nat ~> list_encode
3884 NatIso.nat2list ~> list_decode
3885 NatIso.set2nat ~> set_encode
3886 NatIso.nat2set ~> set_decode
3889 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3890 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3891 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3892 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3893 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3894 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3895 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3896 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3897 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3898 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3899 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3900 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3901 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3904 - Renamed ATP commands:
3905 atp_info ~> sledgehammer running_atps
3906 atp_kill ~> sledgehammer kill_atps
3907 atp_messages ~> sledgehammer messages
3908 atp_minimize ~> sledgehammer minimize
3909 print_atps ~> sledgehammer available_atps
3911 - Added user's manual ("isabelle doc sledgehammer").
3912 - Added option syntax and "sledgehammer_params" to customize
3913 Sledgehammer's behavior. See the manual for details.
3914 - Modified the Isar proof reconstruction code so that it produces
3915 direct proofs rather than proofs by contradiction. (This feature
3916 is still experimental.)
3917 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3919 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3922 - Added and implemented "binary_ints" and "bits" options.
3923 - Added "std" option and implemented support for nonstandard models.
3924 - Added and implemented "finitize" option to improve the precision
3925 of infinite datatypes based on a monotonicity analysis.
3926 - Added support for quotient types.
3927 - Added support for "specification" and "ax_specification"
3929 - Added support for local definitions (for "function" and
3930 "termination" proofs).
3931 - Added support for term postprocessors.
3932 - Optimized "Multiset.multiset" and "FinFun.finfun".
3933 - Improved efficiency of "destroy_constrs" optimization.
3934 - Fixed soundness bugs related to "destroy_constrs" optimization and
3936 - Fixed soundness bug related to higher-order constructors.
3937 - Fixed soundness bug when "full_descrs" is enabled.
3938 - Improved precision of set constructs.
3939 - Added "atoms" option.
3940 - Added cache to speed up repeated Kodkod invocations on the same
3942 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3943 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3944 "SAT4J_Light". INCOMPATIBILITY.
3945 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3946 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3947 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3949 * Method "induct" now takes instantiations of the form t, where t is not
3950 a variable, as a shorthand for "x == t", where x is a fresh variable.
3951 If this is not intended, t has to be enclosed in parentheses.
3952 By default, the equalities generated by definitional instantiations
3953 are pre-simplified, which may cause parameters of inductive cases
3954 to disappear, or may even delete some of the inductive cases.
3955 Use "induct (no_simp)" instead of "induct" to restore the old
3956 behaviour. The (no_simp) option is also understood by the "cases"
3957 and "nominal_induct" methods, which now perform pre-simplification, too.
3963 * Variable names in lemmas generated by the domain package have
3964 changed; the naming scheme is now consistent with the HOL datatype
3965 package. Some proof scripts may be affected, INCOMPATIBILITY.
3967 * The domain package no longer defines the function "foo_copy" for
3968 recursive domain "foo". The reach lemma is now stated directly in
3969 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3970 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3972 * Most definedness lemmas generated by the domain package (previously
3973 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3974 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3975 Proofs that used definedness lemmas as intro rules may break,
3976 potential INCOMPATIBILITY.
3978 * Induction and casedist rules generated by the domain package now
3979 declare proper case_names (one called "bottom", and one named for each
3980 constructor). INCOMPATIBILITY.
3982 * For mutually-recursive domains, separate "reach" and "take_lemma"
3983 rules are generated for each domain, INCOMPATIBILITY.
3985 foo_bar.reach ~> foo.reach bar.reach
3986 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3988 * Some lemmas generated by the domain package have been renamed for
3989 consistency with the datatype package, INCOMPATIBILITY.
3991 foo.ind ~> foo.induct
3992 foo.finite_ind ~> foo.finite_induct
3993 foo.coind ~> foo.coinduct
3994 foo.casedist ~> foo.exhaust
3995 foo.exhaust ~> foo.nchotomy
3997 * For consistency with other definition packages, the fixrec package
3998 now generates qualified theorem names, INCOMPATIBILITY.
4000 foo_simps ~> foo.simps
4001 foo_unfold ~> foo.unfold
4002 foo_induct ~> foo.induct
4004 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
4005 method and internal fixrec proofs now use the default simpset instead.
4008 * The "contlub" predicate has been removed. Proof scripts should use
4009 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
4011 * The "admw" predicate has been removed, INCOMPATIBILITY.
4013 * The constants cpair, cfst, and csnd have been removed in favor of
4014 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
4019 * Antiquotations for basic formal entities:
4021 @{class NAME} -- type class
4022 @{class_syntax NAME} -- syntax representation of the above
4024 @{type_name NAME} -- logical type
4025 @{type_abbrev NAME} -- type abbreviation
4026 @{nonterminal NAME} -- type of concrete syntactic category
4027 @{type_syntax NAME} -- syntax representation of any of the above
4029 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
4030 @{const_abbrev NAME} -- abbreviated constant
4031 @{const_syntax NAME} -- syntax representation of any of the above
4033 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
4034 syntax constant (cf. 'syntax' command).
4036 * Antiquotation @{make_string} inlines a function to print arbitrary
4037 values similar to the ML toplevel. The result is compiler dependent
4038 and may fall back on "?" in certain situations.
4040 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4041 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4042 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4043 not work with the asynchronous Isar document model.
4045 * Configuration options now admit dynamic default values, depending on
4046 the context or even global references.
4048 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4049 uses an efficient external library if available (for Poly/ML).
4051 * Renamed some important ML structures, while keeping the old names
4052 for some time as aliases within the structure Legacy:
4054 OuterKeyword ~> Keyword
4057 OuterSyntax ~> Outer_Syntax
4058 PrintMode ~> Print_Mode
4059 SpecParse ~> Parse_Spec
4062 ThyOutput ~> Thy_Output
4063 TypeInfer ~> Type_Infer
4065 Note that "open Legacy" simplifies porting of sources, but forgetting
4066 to remove it again will complicate porting again in the future.
4068 * Most operations that refer to a global context are named
4069 accordingly, e.g. Simplifier.global_context or
4070 ProofContext.init_global. There are some situations where a global
4071 context actually works, but under normal circumstances one needs to
4072 pass the proper local context through the code!
4074 * Discontinued old TheoryDataFun with its copy/init operation -- data
4075 needs to be pure. Functor Theory_Data_PP retains the traditional
4076 Pretty.pp argument to merge, which is absent in the standard
4077 Theory_Data version.
4079 * Sorts.certify_sort and derived "cert" operations for types and terms
4080 no longer minimize sorts. Thus certification at the boundary of the
4081 inference kernel becomes invariant under addition of class relations,
4082 which is an important monotonicity principle. Sorts are now minimized
4083 in the syntax layer only, at the boundary between the end-user and the
4084 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4085 explicitly in rare situations.
4087 * Renamed old-style Drule.standard to Drule.export_without_context, to
4088 emphasize that this is in no way a standard operation.
4091 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4092 usual for resolution. Rare INCOMPATIBILITY.
4094 * Renamed varify/unvarify operations to varify_global/unvarify_global
4095 to emphasize that these only work in a global situation (which is
4098 * Curried take and drop in library.ML; negative length is interpreted
4099 as infinity (as in chop). Subtle INCOMPATIBILITY.
4101 * Proof terms: type substitutions on proof constants now use canonical
4102 order of type variables. INCOMPATIBILITY for tools working with proof
4105 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4106 may no longer carry premises. User-level specifications are
4107 transformed accordingly by Thm.add_axiom/add_def.
4112 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4113 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4114 proof terms are enabled unconditionally in the new HOL-Proofs image.
4116 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4117 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4120 * Old lib/scripts/polyml-platform is superseded by the
4121 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4122 variant, even on a 64 bit machine. The following example setting
4123 prefers 64 bit if available:
4125 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4127 * The preliminary Isabelle/jEdit application demonstrates the emerging
4128 Isabelle/Scala layer for advanced prover interaction and integration.
4129 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4132 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4133 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4134 similar to the default assignment of the document preparation system
4135 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4136 provides some operations for direct access to the font without asking
4137 the user for manual installation.
4141 New in Isabelle2009-1 (December 2009)
4142 -------------------------------------
4146 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4147 one backslash should be used, even in ML sources.
4152 * Locale interpretation propagates mixins along the locale hierarchy.
4153 The currently only available mixins are the equations used to map
4154 local definitions to terms of the target domain of an interpretation.
4156 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4157 loc" to print all interpretations of locale "loc" in the theory.
4158 Interpretations in proofs are not shown.
4160 * Thoroughly revised locales tutorial. New section on conditional
4163 * On instantiation of classes, remaining undefined class parameters
4164 are formally declared. INCOMPATIBILITY.
4167 *** Document preparation ***
4169 * New generalized style concept for printing terms: @{foo (style) ...}
4170 instead of @{foo_style style ...} (old form is still retained for
4171 backward compatibility). Styles can be also applied for
4172 antiquotations prop, term_type and typeof.
4177 * New proof method "smt" for a combination of first-order logic with
4178 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4179 fixed-size bitvectors; there is also basic support for higher-order
4180 features (esp. lambda abstractions). It is an incomplete decision
4181 procedure based on external SMT solvers using the oracle mechanism;
4182 for the SMT solver Z3, this method is proof-producing. Certificates
4183 are provided to avoid calling the external solvers solely for
4184 re-checking proofs. Due to a remote SMT service there is no need for
4185 installing SMT solvers locally. See src/HOL/SMT.
4187 * New commands to load and prove verification conditions generated by
4188 the Boogie program verifier or derived systems (e.g. the Verifying C
4189 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4191 * New counterexample generator tool 'nitpick' based on the Kodkod
4192 relational model finder. See src/HOL/Tools/Nitpick and
4193 src/HOL/Nitpick_Examples.
4195 * New commands 'code_pred' and 'values' to invoke the predicate
4196 compiler and to enumerate values of inductive predicates.
4198 * A tabled implementation of the reflexive transitive closure.
4200 * New implementation of quickcheck uses generic code generator;
4201 default generators are provided for all suitable HOL types, records
4202 and datatypes. Old quickcheck can be re-activated importing theory
4203 Library/SML_Quickcheck.
4205 * New testing tool Mirabelle for automated proof tools. Applies
4206 several tools and tactics like sledgehammer, metis, or quickcheck, to
4207 every proof step in a theory. To be used in batch mode via the
4208 "mirabelle" utility.
4210 * New proof method "sos" (sum of squares) for nonlinear real
4211 arithmetic (originally due to John Harison). It requires theory
4212 Library/Sum_Of_Squares. It is not a complete decision procedure but
4213 works well in practice on quantifier-free real arithmetic with +, -,
4214 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4215 inequalities between polynomials. It makes use of external
4216 semidefinite programming solvers. Method "sos" generates a
4217 certificate that can be pasted into the proof thus avoiding the need
4218 to call an external tool every time the proof is checked. See
4219 src/HOL/Library/Sum_Of_Squares.
4221 * New method "linarith" invokes existing linear arithmetic decision
4224 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4226 * New Sledgehammer option "Full Types" in Proof General settings menu.
4227 Causes full type information to be output to the ATPs. This slows
4228 ATPs down considerably but eliminates a source of unsound "proofs"
4231 * New method "metisFT": A version of metis that uses full type
4232 information in order to avoid failures of proof reconstruction.
4234 * New evaluator "approximate" approximates an real valued term using
4235 the same method as the approximation method.
4237 * Method "approximate" now supports arithmetic expressions as
4238 boundaries of intervals and implements interval splitting and Taylor
4241 * ML antiquotation @{code_datatype} inserts definition of a datatype
4242 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4244 * New theory SupInf of the supremum and infimum operators for sets of
4247 * New theory Probability, which contains a development of measure
4248 theory, eventually leading to Lebesgue integration and probability.
4250 * Extended Multivariate Analysis to include derivation and Brouwer's
4253 * Reorganization of number theory, INCOMPATIBILITY:
4254 - new number theory development for nat and int, in theories Divides
4255 and GCD as well as in new session Number_Theory
4256 - some constants and facts now suffixed with _nat and _int
4258 - former session NumberTheory now named Old_Number_Theory, including
4259 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4260 - moved theory Pocklington from src/HOL/Library to
4261 src/HOL/Old_Number_Theory
4263 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4264 lcm of finite and infinite sets. It is shown that they form a complete
4267 * Class semiring_div requires superclass no_zero_divisors and proof of
4268 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4269 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4270 generalized to class semiring_div, subsuming former theorems
4271 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4272 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4275 * Refinements to lattice classes and sets:
4276 - less default intro/elim rules in locale variant, more default
4277 intro/elim rules in class variant: more uniformity
4278 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4280 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4282 - renamed ACI to inf_sup_aci
4283 - new class "boolean_algebra"
4284 - class "complete_lattice" moved to separate theory
4285 "Complete_Lattice"; corresponding constants (and abbreviations)
4286 renamed and with authentic syntax:
4287 Set.Inf ~> Complete_Lattice.Inf
4288 Set.Sup ~> Complete_Lattice.Sup
4289 Set.INFI ~> Complete_Lattice.INFI
4290 Set.SUPR ~> Complete_Lattice.SUPR
4291 Set.Inter ~> Complete_Lattice.Inter
4292 Set.Union ~> Complete_Lattice.Union
4293 Set.INTER ~> Complete_Lattice.INTER
4294 Set.UNION ~> Complete_Lattice.UNION
4295 - authentic syntax for
4298 - mere abbreviations:
4301 Set.inter (for inf, formerly Set.Int)
4302 Set.union (for sup, formerly Set.Un)
4303 Complete_Lattice.Inter (for Inf)
4304 Complete_Lattice.Union (for Sup)
4305 Complete_Lattice.INTER (for INFI)
4306 Complete_Lattice.UNION (for SUPR)
4307 - object-logic definitions as far as appropriate
4309 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4310 Un_subset_iff are explicitly deleted as default simp rules; then also
4311 their lattice counterparts le_inf_iff and le_sup_iff have to be
4312 deleted to achieve the desired effect.
4314 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4315 rules by default any longer; the same applies to min_max.inf_absorb1
4316 etc. INCOMPATIBILITY.
4318 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4319 pred_set_conv by default. INCOMPATIBILITY.
4321 * Power operations on relations and functions are now one dedicated
4322 constant "compow" with infix syntax "^^". Power operation on
4323 multiplicative monoids retains syntax "^" and is now defined generic
4324 in class power. INCOMPATIBILITY.
4326 * Relation composition "R O S" now has a more standard argument order:
4327 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4328 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4329 break, since the O_assoc rule was not rewritten like this. Fix using
4330 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4332 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4333 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4336 * Most rules produced by inductive and datatype package have mandatory
4337 prefixes. INCOMPATIBILITY.
4339 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4340 the attribute of the same name. Each of the theorems in the list
4341 DERIV_intros assumes composition with an additional function and
4342 matches a variable to the derivative, which has to be solved by the
4343 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4344 of most elementary terms. Former Maclauren.DERIV_tac and
4345 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4348 * Code generator attributes follow the usual underscore convention:
4349 code_unfold replaces code unfold
4350 code_post replaces code post
4355 sizechange -> size_change
4356 induct_scheme -> induction_schema
4359 * Discontinued abbreviation "arbitrary" of constant "undefined".
4360 INCOMPATIBILITY, use "undefined" directly.
4363 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4364 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4365 Suc_plus1 -> Suc_eq_plus1
4366 *anti_sym -> *antisym*
4367 vector_less_eq_def -> vector_le_def
4370 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4373 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4379 * Theory Representable defines a class "rep" of domains that are
4380 representable (via an ep-pair) in the universal domain type "udom".
4381 Instances are provided for all type constructors defined in HOLCF.
4383 * The 'new_domain' command is a purely definitional version of the
4384 domain package, for representable domains. Syntax is identical to the
4385 old domain package. The 'new_domain' package also supports indirect
4386 recursion using previously-defined type constructors. See
4387 src/HOLCF/ex/New_Domain.thy for examples.
4389 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4390 on the left-hand side of an equation, and then performs
4391 simplification. Rewriting is done using rules declared with the
4392 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4393 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4395 * The pattern-match compiler in 'fixrec' can now handle constructors
4396 with HOL function types. Pattern-match combinators for the Pair
4397 constructor are pre-configured.
4399 * The 'fixrec' package now produces better fixed-point induction rules
4400 for mutually-recursive definitions: Induction rules have conclusions
4401 of the form "P foo bar" instead of "P <foo, bar>".
4403 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4404 been renamed to "below". The name "below" now replaces "less" in many
4405 theorem names. (Legacy theorem names using "less" are still supported
4408 * The 'fixrec' package now supports "bottom patterns". Bottom
4409 patterns can be used to generate strictness rules, or to make
4410 functions more strict (much like the bang-patterns supported by the
4411 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4417 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4418 errors and run-time exceptions, including detailed source positions.
4420 * Structure Name_Space (formerly NameSpace) now manages uniquely
4421 identified entries, with some additional information such as source
4422 position, logical grouping etc.
4424 * Theory and context data is now introduced by the simplified and
4425 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4426 to be pure, but the old TheoryDataFun for mutable data (with explicit
4427 copy operation) is still available for some time.
4429 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4430 provides a high-level programming interface to synchronized state
4431 variables with atomic update. This works via pure function
4432 application within a critical section -- its runtime should be as
4433 short as possible; beware of deadlocks if critical code is nested,
4434 either directly or indirectly via other synchronized variables!
4436 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4437 wraps raw ML references, explicitly indicating their non-thread-safe
4438 behaviour. The Isar toplevel keeps this structure open, to
4439 accommodate Proof General as well as quick and dirty interactive
4440 experiments with references.
4442 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4443 parallel tactical reasoning.
4445 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4446 are similar to SUBPROOF, but are slightly more flexible: only the
4447 specified parts of the subgoal are imported into the context, and the
4448 body tactic may introduce new subgoals and schematic variables.
4450 * Old tactical METAHYPS, which does not observe the proof context, has
4451 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4452 or Subgoal.FOCUS etc.
4454 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4455 functors have their own ML name space there is no point to mark them
4456 separately.) Minor INCOMPATIBILITY.
4458 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4460 * Renamed several structures FooBar to Foo_Bar. Occasional,
4463 * Operations of structure Skip_Proof no longer require quick_and_dirty
4464 mode, which avoids critical setmp.
4466 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4467 combinators for "args". INCOMPATIBILITY, need to use simplified
4468 Attrib/Method.setup introduced in Isabelle2009.
4470 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4471 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4472 last resort. INCOMPATIBILITY.
4474 * Display.pretty_thm now requires a proper context (cf. former
4475 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4476 or even Display.pretty_thm_without_context as last resort.
4479 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4480 Syntax.pretty_typ/term directly, preferably with proper context
4481 instead of global theory.
4486 * Further fine tuning of parallel proof checking, scales up to 8 cores
4487 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4490 * Support for additional "Isabelle components" via etc/components, see
4491 also the system manual.
4493 * The isabelle makeall tool now operates on all components with
4494 IsaMakefile, not just hardwired "logics".
4496 * Removed "compress" option from isabelle-process and isabelle usedir;
4497 this is always enabled.
4499 * Discontinued support for Poly/ML 4.x versions.
4501 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4502 on a given logic image. This requires the lighttpd webserver and is
4503 currently supported on Linux only.
4507 New in Isabelle2009 (April 2009)
4508 --------------------------------
4512 * Simplified main Isabelle executables, with less surprises on
4513 case-insensitive file-systems (such as Mac OS).
4515 - The main Isabelle tool wrapper is now called "isabelle" instead of
4518 - The former "isabelle" alias for "isabelle-process" has been
4519 removed (should rarely occur to regular users).
4521 - The former "isabelle-interface" and its alias "Isabelle" have been
4522 removed (interfaces are now regular Isabelle tools).
4524 Within scripts and make files, the Isabelle environment variables
4525 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4526 respectively. (The latter are still available as legacy feature.)
4528 The old isabelle-interface wrapper could react in confusing ways if
4529 the interface was uninstalled or changed otherwise. Individual
4530 interface tool configuration is now more explicit, see also the
4531 Isabelle system manual. In particular, Proof General is now available
4532 via "isabelle emacs".
4534 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4535 purge installed copies of Isabelle executables and re-run "isabelle
4536 install -p ...", or use symlinks.
4538 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4539 old ~/isabelle, which was slightly non-standard and apt to cause
4540 surprises on case-insensitive file-systems (such as Mac OS).
4542 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4543 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4544 care is required when using older releases of Isabelle. Note that
4545 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4546 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4548 * Proofs of fully specified statements are run in parallel on
4549 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4550 a regular 4-core machine, if the initial heap space is made reasonably
4551 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4553 * The main reference manuals ("isar-ref", "implementation", and
4554 "system") have been updated and extended. Formally checked references
4555 as hyperlinks are now available uniformly.
4560 * Complete re-implementation of locales. INCOMPATIBILITY in several
4561 respects. The most important changes are listed below. See the
4562 Tutorial on Locales ("locales" manual) for details.
4564 - In locale expressions, instantiation replaces renaming. Parameters
4565 must be declared in a for clause. To aid compatibility with previous
4566 parameter inheritance, in locale declarations, parameters that are not
4567 'touched' (instantiation position "_" or omitted) are implicitly added
4568 with their syntax at the beginning of the for clause.
4570 - Syntax from abbreviations and definitions in locales is available in
4571 locale expressions and context elements. The latter is particularly
4572 useful in locale declarations.
4574 - More flexible mechanisms to qualify names generated by locale
4575 expressions. Qualifiers (prefixes) may be specified in locale
4576 expressions, and can be marked as mandatory (syntax: "name!:") or
4577 optional (syntax "name?:"). The default depends for plain "name:"
4578 depends on the situation where a locale expression is used: in
4579 commands 'locale' and 'sublocale' prefixes are optional, in
4580 'interpretation' and 'interpret' prefixes are mandatory. The old
4581 implicit qualifiers derived from the parameter names of a locale are
4582 no longer generated.
4584 - Command "sublocale l < e" replaces "interpretation l < e". The
4585 instantiation clause in "interpretation" and "interpret" (square
4586 brackets) is no longer available. Use locale expressions.
4588 - When converting proof scripts, mandatory qualifiers in
4589 'interpretation' and 'interpret' should be retained by default, even
4590 if this is an INCOMPATIBILITY compared to former behavior. In the
4591 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4592 in locale expressions range over a single locale instance only.
4594 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4595 In existing theorem specifications replace the includes element by the
4596 respective context elements of the included locale, omitting those
4597 that are already present in the theorem specification. Multiple
4598 assume elements of a locale should be replaced by a single one
4599 involving the locale predicate. In the proof body, declarations (most
4600 notably theorems) may be regained by interpreting the respective
4601 locales in the proof context as required (command "interpret").
4603 If using "includes" in replacement of a target solely because the
4604 parameter types in the theorem are not as general as in the target,
4605 consider declaring a new locale with additional type constraints on
4606 the parameters (context element "constrains").
4608 - Discontinued "locale (open)". INCOMPATIBILITY.
4610 - Locale interpretation commands no longer attempt to simplify goal.
4611 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4612 methods intro_locales and unfold_locales to clarify.
4614 - Locale interpretation commands no longer accept interpretation
4615 attributes. INCOMPATIBILITY.
4617 * Class declaration: so-called "base sort" must not be given in import
4618 list any longer, but is inferred from the specification. Particularly
4625 class foo = type + ...
4627 * Class target: global versions of theorems stemming do not carry a
4628 parameter prefix any longer. INCOMPATIBILITY.
4630 * Class 'instance' command no longer accepts attached definitions.
4631 INCOMPATIBILITY, use proper 'instantiation' target instead.
4633 * Recovered hiding of consts, which was accidentally broken in
4634 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4635 makes c inaccessible; consider using ``hide (open) const c'' instead.
4637 * Slightly more coherent Pure syntax, with updated documentation in
4638 isar-ref manual. Removed locales meta_term_syntax and
4639 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4640 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4641 directly in regular applications.
4643 * There is a new syntactic category "float_const" for signed decimal
4644 fractions (e.g. 123.45 or -123.45).
4646 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4647 interface with 'setup' command instead.
4649 * Command 'local_setup' is similar to 'setup', but operates on a local
4652 * The 'axiomatization' command now only works within a global theory
4653 context. INCOMPATIBILITY.
4655 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4656 hypotheses. Sorts required in the course of reasoning need to be
4657 covered by the constraints in the initial statement, completed by the
4658 type instance information of the background theory. Non-trivial sort
4659 hypotheses, which rarely occur in practice, may be specified via
4660 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4662 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4664 The result contains an implicit sort hypotheses as before --
4665 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4668 * Generalized Isar history, with support for linear undo, direct state
4671 * Changed defaults for unify configuration options:
4673 unify_trace_bound = 50 (formerly 25)
4674 unify_search_bound = 60 (formerly 30)
4676 * Different bookkeeping for code equations (INCOMPATIBILITY):
4678 a) On theory merge, the last set of code equations for a particular
4679 constant is taken (in accordance with the policy applied by other
4680 parts of the code generator framework).
4682 b) Code equations stemming from explicit declarations (e.g. code
4683 attribute) gain priority over default code equations stemming
4684 from definition, primrec, fun etc.
4686 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4688 * Unified theorem tables for both code generators. Thus [code
4689 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4691 * Command 'find_consts' searches for constants based on type and name
4694 find_consts "_ => bool"
4696 By default, matching is against subtypes, but it may be restricted to
4697 the whole type. Searching by name is possible. Multiple queries are
4698 conjunctive and queries may be negated by prefixing them with a
4701 find_consts strict: "_ => bool" name: "Int" -"int => int"
4703 * New 'find_theorems' criterion "solves" matches theorems that
4704 directly solve the current goal (modulo higher-order unification).
4706 * Auto solve feature for main theorem statements: whenever a new goal
4707 is stated, "find_theorems solves" is called; any theorems that could
4708 solve the lemma directly are listed as part of the goal state.
4709 Cf. associated options in Proof General Isabelle settings menu,
4710 enabled by default, with reasonable timeout for pathological cases of
4711 higher-order unification.
4714 *** Document preparation ***
4716 * Antiquotation @{lemma} now imitates a regular terminal proof,
4717 demanding keyword 'by' and supporting the full method expression
4718 syntax just like the Isar command 'by'.
4723 * Integrated main parts of former image HOL-Complex with HOL. Entry
4724 points Main and Complex_Main remain as before.
4726 * Logic image HOL-Plain provides a minimal HOL with the most important
4727 tools available (inductive, datatype, primrec, ...). This facilitates
4728 experimentation and tool development. Note that user applications
4729 (and library theories) should never refer to anything below theory
4732 * Logic image HOL-Main stops at theory Main, and thus facilitates
4733 experimentation due to shorter build times.
4735 * Logic image HOL-NSA contains theories of nonstandard analysis which
4736 were previously part of former HOL-Complex. Entry point Hyperreal
4737 remains valid, but theories formerly using Complex_Main should now use
4738 new entry point Hypercomplex.
4740 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4741 Posix processes. Avoids potentially expensive forking of the ML
4742 process. New thread-based implementation also works on non-Unix
4743 platforms (Cygwin). Provers are no longer hardwired, but defined
4744 within the theory via plain ML wrapper functions. Basic Sledgehammer
4745 commands are covered in the isar-ref manual.
4747 * Wrapper scripts for remote SystemOnTPTP service allows to use
4748 sledgehammer without local ATP installation (Vampire etc.). Other
4749 provers may be included via suitable ML wrappers, see also
4750 src/HOL/ATP_Linkup.thy.
4752 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4755 * The metis method no longer fails because the theorem is too trivial
4756 (contains the empty clause).
4758 * The metis method now fails in the usual manner, rather than raising
4759 an exception, if it determines that it cannot prove the theorem.
4761 * Method "coherent" implements a prover for coherent logic (see also
4762 src/Tools/coherent.ML).
4764 * Constants "undefined" and "default" replace "arbitrary". Usually
4765 "undefined" is the right choice to replace "arbitrary", though
4766 logically there is no difference. INCOMPATIBILITY.
4768 * Command "value" now integrates different evaluation mechanisms. The
4769 result of the first successful evaluation mechanism is printed. In
4770 square brackets a particular named evaluation mechanisms may be
4771 specified (currently, [SML], [code] or [nbe]). See further
4772 src/HOL/ex/Eval_Examples.thy.
4774 * Normalization by evaluation now allows non-leftlinear equations.
4775 Declare with attribute [code nbe].
4777 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4778 as the structured Isar versions "cases" and "induct", cf. the
4779 corresponding "cases" and "induct" attributes. Mutual induction rules
4780 are now presented as a list of individual projections
4781 (e.g. foo_bar.inducts for types foo and bar); the old format with
4782 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4783 rare situations a different rule is selected --- notably nested tuple
4784 elimination instead of former prod.exhaust: use explicit (case_tac t
4785 rule: prod.exhaust) here.
4787 * Attributes "cases", "induct", "coinduct" support "del" option.
4789 * Removed fact "case_split_thm", which duplicates "case_split".
4791 * The option datatype has been moved to a new theory Option. Renamed
4792 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4794 * New predicate "strict_mono" classifies strict functions on partial
4795 orders. With strict functions on linear orders, reasoning about
4796 (in)equalities is facilitated by theorems "strict_mono_eq",
4797 "strict_mono_less_eq" and "strict_mono_less".
4799 * Some set operations are now proper qualified constants with
4800 authentic syntax. INCOMPATIBILITY:
4811 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4814 * Auxiliary class "itself" has disappeared -- classes without any
4815 parameter are treated as expected by the 'class' command.
4817 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4819 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4820 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4822 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4823 method "approximation". It proves formulas on real values by using
4824 interval arithmetic. In the formulas are also the transcendental
4825 functions sin, cos, tan, atan, ln, exp and the constant pi are
4826 allowed. For examples see
4827 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4829 * Theory "Reflection" now resides in HOL/Library.
4831 * Entry point to Word library now simply named "Word".
4834 * Made source layout more coherent with logical distribution
4837 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4838 src/HOL/Library/Code_Message.thy ~> src/HOL/
4839 src/HOL/Library/GCD.thy ~> src/HOL/
4840 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4841 src/HOL/Library/Parity.thy ~> src/HOL/
4842 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4843 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4844 src/HOL/Real/Lubs.thy ~> src/HOL/
4845 src/HOL/Real/PReal.thy ~> src/HOL/
4846 src/HOL/Real/Rational.thy ~> src/HOL/
4847 src/HOL/Real/RComplete.thy ~> src/HOL/
4848 src/HOL/Real/RealDef.thy ~> src/HOL/
4849 src/HOL/Real/RealPow.thy ~> src/HOL/
4850 src/HOL/Real/Real.thy ~> src/HOL/
4851 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4852 src/HOL/Complex/Complex.thy ~> src/HOL/
4853 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4854 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4855 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4856 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4857 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4858 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4859 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4860 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4861 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4862 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4863 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4864 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4865 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4866 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4867 src/HOL/Real/Float ~> src/HOL/Library/
4868 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4869 src/HOL/Real/RealVector.thy ~> src/HOL/
4871 src/HOL/arith_data.ML ~> src/HOL/Tools
4872 src/HOL/hologic.ML ~> src/HOL/Tools
4873 src/HOL/simpdata.ML ~> src/HOL/Tools
4874 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4875 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4876 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4877 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4878 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4879 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4880 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4882 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4883 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4884 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4885 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4886 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4887 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4889 * If methods "eval" and "evaluation" encounter a structured proof
4890 state with !!/==>, only the conclusion is evaluated to True (if
4891 possible), avoiding strange error messages.
4893 * Method "sizechange" automates termination proofs using (a
4894 modification of) the size-change principle. Requires SAT solver. See
4895 src/HOL/ex/Termination.thy for examples.
4897 * Simplifier: simproc for let expressions now unfolds if bound
4898 variable occurs at most once in let expression body. INCOMPATIBILITY.
4900 * Method "arith": Linear arithmetic now ignores all inequalities when
4901 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4903 * New attribute "arith" for facts that should always be used
4904 automatically by arithmetic. It is intended to be used locally in
4907 assumes [arith]: "x > 0"
4909 Global usage is discouraged because of possible performance impact.
4911 * New classes "top" and "bot" with corresponding operations "top" and
4912 "bot" in theory Orderings; instantiation of class "complete_lattice"
4913 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4915 * Changed definition lemma "less_fun_def" in order to provide an
4916 instance for preorders on functions; use lemma "less_le" instead.
4919 * Theory Orderings: class "wellorder" moved here, with explicit
4920 induction rule "less_induct" as assumption. For instantiation of
4921 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4924 * Theory Orderings: added class "preorder" as superclass of "order".
4925 INCOMPATIBILITY: Instantiation proofs for order, linorder
4926 etc. slightly changed. Some theorems named order_class.* now named
4929 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4932 * Theory Finite_Set: added a new fold combinator of type
4934 ('a => 'b => 'b) => 'b => 'a set => 'b
4936 Occasionally this is more convenient than the old fold combinator
4937 which is now defined in terms of the new one and renamed to
4940 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4941 and "ring_simps" have been replaced by "algebra_simps" (which can be
4942 extended with further lemmas!). At the moment both still exist but
4943 the former will disappear at some point.
4945 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4946 class recpower. Type-specific simp rules for various recpower types
4947 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4949 rat_power_0 -> power_0
4950 rat_power_Suc -> power_Suc
4951 realpow_0 -> power_0
4952 realpow_Suc -> power_Suc
4953 complexpow_0 -> power_0
4954 complexpow_Suc -> power_Suc
4955 power_poly_0 -> power_0
4956 power_poly_Suc -> power_Suc
4958 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4959 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4960 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4961 of lemmas from Divides has been generalized from nat to class
4962 semiring_div. INCOMPATIBILITY. This involves the following theorem
4963 renames resulting from duplicate elimination:
4965 dvd_def_mod ~> dvd_eq_mod_eq_0
4966 zero_dvd_iff ~> dvd_0_left_iff
4967 dvd_0 ~> dvd_0_right
4968 DIVISION_BY_ZERO_DIV ~> div_by_0
4969 DIVISION_BY_ZERO_MOD ~> mod_by_0
4970 mult_div ~> div_mult_self2_is_id
4971 mult_mod ~> mod_mult_self2_is_0
4973 * Theory IntDiv: removed many lemmas that are instances of class-based
4974 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4975 rename old lemmas as follows:
4977 dvd_diff -> nat_dvd_diff
4978 dvd_zminus_iff -> dvd_minus_iff
4979 mod_add1_eq -> mod_add_eq
4980 mod_mult1_eq -> mod_mult_right_eq
4981 mod_mult1_eq' -> mod_mult_left_eq
4982 mod_mult_distrib_mod -> mod_mult_eq
4983 nat_mod_add_left_eq -> mod_add_left_eq
4984 nat_mod_add_right_eq -> mod_add_right_eq
4985 nat_mod_div_trivial -> mod_div_trivial
4986 nat_mod_mod_trivial -> mod_mod_trivial
4987 zdiv_zadd_self1 -> div_add_self1
4988 zdiv_zadd_self2 -> div_add_self2
4989 zdiv_zmult_self1 -> div_mult_self2_is_id
4990 zdiv_zmult_self2 -> div_mult_self1_is_id
4991 zdvd_triv_left -> dvd_triv_left
4992 zdvd_triv_right -> dvd_triv_right
4993 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4994 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4995 zmod_zadd_left_eq -> mod_add_left_eq
4996 zmod_zadd_right_eq -> mod_add_right_eq
4997 zmod_zadd_self1 -> mod_add_self1
4998 zmod_zadd_self2 -> mod_add_self2
4999 zmod_zadd1_eq -> mod_add_eq
5000 zmod_zdiff1_eq -> mod_diff_eq
5001 zmod_zdvd_zmod -> mod_mod_cancel
5002 zmod_zmod_cancel -> mod_mod_cancel
5003 zmod_zmult_self1 -> mod_mult_self2_is_0
5004 zmod_zmult_self2 -> mod_mult_self1_is_0
5007 zdvd_abs1 -> abs_dvd_iff
5008 zdvd_abs2 -> dvd_abs_iff
5009 zdvd_refl -> dvd_refl
5010 zdvd_trans -> dvd_trans
5011 zdvd_zadd -> dvd_add
5012 zdvd_zdiff -> dvd_diff
5013 zdvd_zminus_iff -> dvd_minus_iff
5014 zdvd_zminus2_iff -> minus_dvd_iff
5015 zdvd_zmultD -> dvd_mult_right
5016 zdvd_zmultD2 -> dvd_mult_left
5017 zdvd_zmult_mono -> mult_dvd_mono
5018 zdvd_0_right -> dvd_0_right
5019 zdvd_0_left -> dvd_0_left_iff
5020 zdvd_1_left -> one_dvd
5021 zminus_dvd_iff -> minus_dvd_iff
5023 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
5025 * The real numbers offer decimal input syntax: 12.34 is translated
5026 into 1234/10^2. This translation is not reversed upon output.
5028 * Theory Library/Polynomial defines an abstract type 'a poly of
5029 univariate polynomials with coefficients of type 'a. In addition to
5030 the standard ring operations, it also supports div and mod. Code
5031 generation is also supported, using list-style constructors.
5033 * Theory Library/Inner_Product defines a class of real_inner for real
5034 inner product spaces, with an overloaded operation inner :: 'a => 'a
5035 => real. Class real_inner is a subclass of real_normed_vector from
5038 * Theory Library/Product_Vector provides instances for the product
5039 type 'a * 'b of several classes from RealVector and Inner_Product.
5040 Definitions of addition, subtraction, scalar multiplication, norms,
5041 and inner products are included.
5043 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5044 addition to the field operations, numerals and case syntax are also
5047 * Theory Library/Diagonalize provides constructive version of Cantor's
5048 first diagonalization argument.
5050 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5051 zlcm (for int); carried together from various gcd/lcm developements in
5052 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5053 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5054 may recover tupled syntax as follows:
5056 hide (open) const gcd
5057 abbreviation gcd where
5058 "gcd == (%(a, b). GCD.gcd a b)"
5060 GCD.gcd ("gcd '(_, _')")
5062 The same works for lcm, zgcd, zlcm.
5064 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5065 instantiations for algebraic structures. Removed some duplicate
5066 theorems. Changes in simp rules. INCOMPATIBILITY.
5068 * ML antiquotation @{code} takes a constant as argument and generates
5069 corresponding code in background and inserts name of the corresponding
5070 resulting ML value/function/datatype constructor binding in place.
5071 All occurrences of @{code} with a single ML block are generated
5072 simultaneously. Provides a generic and safe interface for
5073 instrumentalizing code generation. See
5074 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5075 In future you ought to refrain from ad-hoc compiling generated SML
5076 code on the ML toplevel. Note that (for technical reasons) @{code}
5077 cannot refer to constants for which user-defined serializations are
5078 set. Refer to the corresponding ML counterpart directly in that
5081 * Command 'rep_datatype': instead of theorem names the command now
5082 takes a list of terms denoting the constructors of the type to be
5083 represented as datatype. The characteristic theorems have to be
5084 proven. INCOMPATIBILITY. Also observe that the following theorems
5085 have disappeared in favour of existing ones:
5087 unit_induct ~> unit.induct
5088 prod_induct ~> prod.induct
5089 sum_induct ~> sum.induct
5090 Suc_Suc_eq ~> nat.inject
5091 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5096 * New locales for orders and lattices where the equivalence relation
5097 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5098 locales use a record structure with field eq for the equivalence.
5100 * New theory of factorial domains.
5102 * Units_l_inv and Units_r_inv are now simp rules by default.
5103 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5104 and/or r_inv will now also require deletion of these lemmas.
5106 * Renamed the following theorems, INCOMPATIBILITY:
5108 UpperD ~> Upper_memD
5109 LowerD ~> Lower_memD
5110 least_carrier ~> least_closed
5111 greatest_carrier ~> greatest_closed
5112 greatest_Lower_above ~> greatest_Lower_below
5113 one_zero ~> carrier_one_zero
5114 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5119 * Nominal datatypes can now contain type-variables.
5121 * Commands 'nominal_inductive' and 'equivariance' work with local
5124 * Nominal primrec can now works with local theory targets and its
5125 specification syntax now conforms to the general format as seen in
5128 * Method "perm_simp" honours the standard simplifier attributes
5129 (no_asm), (no_asm_use) etc.
5131 * The new predicate #* is defined like freshness, except that on the
5132 left hand side can be a set or list of atoms.
5134 * Experimental command 'nominal_inductive2' derives strong induction
5135 principles for inductive definitions. In contrast to
5136 'nominal_inductive', which can only deal with a fixed number of
5137 binders, it can deal with arbitrary expressions standing for sets of
5138 atoms to be avoided. The only inductive definition we have at the
5139 moment that needs this generalisation is the typing rule for Lets in
5142 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5143 -----------------------------------------------------------------
5144 Gamma |- Let x be t1 in t2 : T2
5146 In this rule one wants to avoid all the binders that are introduced by
5147 "close Gamma T1". We are looking for other examples where this
5148 feature might be useful. Please let us know.
5153 * Reimplemented the simplification procedure for proving continuity
5154 subgoals. The new simproc is extensible; users can declare additional
5155 continuity introduction rules with the attribute [cont2cont].
5157 * The continuity simproc now uses a different introduction rule for
5158 solving continuity subgoals on terms with lambda abstractions. In
5159 some rare cases the new simproc may fail to solve subgoals that the
5160 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5161 Potential INCOMPATIBILITY.
5163 * Command 'fixrec': specification syntax now conforms to the general
5164 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5165 examples. INCOMPATIBILITY.
5170 * Proof of Zorn's Lemma for partial orders.
5175 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5176 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5177 depends on multithreading, so timouts will not work before Poly/ML
5180 * High-level support for concurrent ML programming, see
5181 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5182 particularly convenient to organize independent functional
5183 computations. The concept of "synchronized variables" provides a
5184 higher-order interface for components with shared state, avoiding the
5185 delicate details of mutexes and condition variables. (Requires
5186 Poly/ML 5.2.1 or later.)
5188 * ML bindings produced via Isar commands are stored within the Isar
5189 context (theory or proof). Consequently, commands like 'use' and 'ML'
5190 become thread-safe and work with undo as expected (concerning
5191 top-level bindings, not side-effects on global references).
5192 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5193 compiler at runtime; really global bindings need to be given outside a
5194 theory. (Requires Poly/ML 5.2 or later.)
5196 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5197 context. Top-level ML bindings are stored within the proof context in
5198 a purely sequential fashion, disregarding the nested proof structure.
5199 ML bindings introduced by 'ML_prf' are discarded at the end of the
5200 proof. (Requires Poly/ML 5.2 or later.)
5202 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5203 and Method.setup, as well as Isar commands 'attribute_setup' and
5204 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5205 existing code accordingly, or use plain 'setup' together with old
5208 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5209 to 'a -> thm, while results are always tagged with an authentic oracle
5210 name. The Isar command 'oracle' is now polymorphic, no argument type
5211 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5212 accordingly. Note that extra performance may be gained by producing
5213 the cterm carefully, avoiding slow Thm.cterm_of.
5215 * Simplified interface for defining document antiquotations via
5216 ThyOutput.antiquotation, ThyOutput.output, and optionally
5217 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5218 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5221 * More systematic treatment of long names, abstract name bindings, and
5222 name space operations. Basic operations on qualified names have been
5223 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5224 Long_Name.append. Old type bstring has been mostly replaced by
5225 abstract type binding (see structure Binding), which supports precise
5226 qualification by packages and local theory targets, as well as proper
5227 tracking of source positions. INCOMPATIBILITY, need to wrap old
5228 bstring values into Binding.name, or better pass through abstract
5229 bindings everywhere. See further src/Pure/General/long_name.ML,
5230 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5232 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5233 LocalTheory.note etc.) now refer to the *full* internal name, not the
5234 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5236 * Disposed old type and term read functions (Sign.read_def_typ,
5237 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5238 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5239 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5240 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5241 resort for legacy applications.
5243 * Disposed old declarations, tactics, tactic combinators that refer to
5244 the simpset or claset of an implicit theory (such as Addsimps,
5245 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5246 embedded ML text, or local_simpset_of with a proper context passed as
5247 explicit runtime argument.
5249 * Rules and tactics that read instantiations (read_instantiate,
5250 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5251 context, which is required for parsing and type-checking. Moreover,
5252 the variables are specified as plain indexnames, not string encodings
5253 thereof. INCOMPATIBILITY.
5255 * Generic Toplevel.add_hook interface allows to analyze the result of
5256 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5257 for theorem dependency output of transactions resulting in a new
5260 * ML antiquotations: block-structured compilation context indicated by
5261 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5263 @{binding name} - basic name binding
5264 @{let ?pat = term} - term abbreviation (HO matching)
5265 @{note name = fact} - fact abbreviation
5266 @{thm fact} - singleton fact (with attributes)
5267 @{thms fact} - general fact (with attributes)
5268 @{lemma prop by method} - singleton goal
5269 @{lemma prop by meth1 meth2} - singleton goal
5270 @{lemma prop1 ... propN by method} - general goal
5271 @{lemma prop1 ... propN by meth1 meth2} - general goal
5272 @{lemma (open) ...} - open derivation
5277 * The Isabelle "emacs" tool provides a specific interface to invoke
5278 Proof General / Emacs, with more explicit failure if that is not
5279 installed (the old isabelle-interface script silently falls back on
5280 isabelle-process). The PROOFGENERAL_HOME setting determines the
5281 installation location of the Proof General distribution.
5283 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5284 the Isabelle process into a JVM/Scala application. See
5285 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5286 process wrapper has been discontinued.)
5288 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5290 * Various status messages (with exact source position information) are
5291 emitted, if proper markup print mode is enabled. This allows
5292 user-interface components to provide detailed feedback on internal
5297 New in Isabelle2008 (June 2008)
5298 -------------------------------
5302 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5303 and updated, with formally checked references as hyperlinks.
5305 * Theory loader: use_thy (and similar operations) no longer set the
5306 implicit ML context, which was occasionally hard to predict and in
5307 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5308 provides a proper context already.
5310 * Theory loader: old-style ML proof scripts being *attached* to a thy
5311 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5312 'use' within a theory file will do the job.
5314 * Name space merge now observes canonical order, i.e. the second space
5315 is inserted into the first one, while existing entries in the first
5316 space take precedence. INCOMPATIBILITY in rare situations, may try to
5317 swap theory imports.
5319 * Syntax: symbol \<chi> is now considered a letter. Potential
5320 INCOMPATIBILITY in identifier syntax etc.
5322 * Outer syntax: string tokens no longer admit escaped white space,
5323 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5324 white space without escapes.
5326 * Outer syntax: string tokens may contain arbitrary character codes
5327 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5333 * Context-dependent token translations. Default setup reverts locally
5334 fixed variables, and adds hilite markup for undeclared frees.
5336 * Unused theorems can be found using the new command 'unused_thms'.
5337 There are three ways of invoking it:
5340 Only finds unused theorems in the current theory.
5342 (2) unused_thms thy_1 ... thy_n -
5343 Finds unused theorems in the current theory and all of its ancestors,
5344 excluding the theories thy_1 ... thy_n and all of their ancestors.
5346 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5347 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5348 their ancestors, excluding the theories thy_1 ... thy_n and all of
5351 In order to increase the readability of the list produced by
5352 unused_thms, theorems that have been created by a particular instance
5353 of a theory command such as 'inductive' or 'function' are considered
5354 to belong to the same "group", meaning that if at least one theorem in
5355 this group is used, the other theorems in the same group are no longer
5356 reported as unused. Moreover, if all theorems in the group are
5357 unused, only one theorem in the group is displayed.
5359 Note that proof objects have to be switched on in order for
5360 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5361 usually the case when using Proof General with the default settings).
5363 * Authentic naming of facts disallows ad-hoc overwriting of previous
5364 theorems within the same name space. INCOMPATIBILITY, need to remove
5365 duplicate fact bindings, or even accidental fact duplications. Note
5366 that tools may maintain dynamically scoped facts systematically, using
5367 PureThy.add_thms_dynamic.
5369 * Command 'hide' now allows to hide from "fact" name space as well.
5371 * Eliminated destructive theorem database, simpset, claset, and
5372 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5373 update of theories within ML code.
5375 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5376 INCOMPATIBILITY, object-logics depending on former Pure require
5377 additional setup PureThy.old_appl_syntax_setup; object-logics
5378 depending on former CPure need to refer to Pure.
5380 * Commands 'use' and 'ML' are now purely functional, operating on
5381 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5382 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5385 * Command 'setup': discontinued implicit version with ML reference.
5387 * Instantiation target allows for simultaneous specification of class
5388 instance operations together with an instantiation proof.
5389 Type-checking phase allows to refer to class operations uniformly.
5390 See src/HOL/Complex/Complex.thy for an Isar example and
5391 src/HOL/Library/Eval.thy for an ML example.
5393 * Indexing of literal facts: be more serious about including only
5394 facts from the visible specification/proof context, but not the
5395 background context (locale etc.). Affects `prop` notation and method
5396 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5399 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5400 "(open)" option, which used to expose internal bound variables to the
5403 * Isar statements: removed obsolete case "rule_context".
5404 INCOMPATIBILITY, better use explicit fixes/assumes.
5406 * Locale proofs: default proof step now includes 'unfold_locales';
5407 hence 'proof' without argument may be used to unfold locale
5411 *** Document preparation ***
5413 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5414 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5415 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5416 spot); renamed link color from "darkblue" to "linkcolor" (default
5417 value unchanged, can be redefined via \definecolor); no longer sets
5418 "a4paper" option (unnecessary or even intrusive).
5420 * Antiquotation @{lemma A method} proves proposition A by the given
5421 method (either a method name or a method name plus (optional) method
5422 arguments in parentheses) and prints A just like @{prop A}.
5427 * New primrec package. Specification syntax conforms in style to
5428 definition/function/.... No separate induction rule is provided. The
5429 "primrec" command distinguishes old-style and new-style specifications
5430 by syntax. The former primrec package is now named OldPrimrecPackage.
5431 When adjusting theories, beware: constants stemming from new-style
5432 primrec specifications have authentic syntax.
5434 * Metis prover is now an order of magnitude faster, and also works
5435 with multithreading.
5437 * Metis: the maximum number of clauses that can be produced from a
5438 theorem is now given by the attribute max_clauses. Theorems that
5439 exceed this number are ignored, with a warning printed.
5441 * Sledgehammer no longer produces structured proofs by default. To
5442 enable, declare [[sledgehammer_full = true]]. Attributes
5443 reconstruction_modulus, reconstruction_sorts renamed
5444 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5446 * Method "induct_scheme" derives user-specified induction rules
5447 from well-founded induction and completeness of patterns. This factors
5448 out some operations that are done internally by the function package
5449 and makes them available separately. See
5450 src/HOL/ex/Induction_Scheme.thy for examples.
5452 * More flexible generation of measure functions for termination
5453 proofs: Measure functions can be declared by proving a rule of the
5454 form "is_measure f" and giving it the [measure_function] attribute.
5455 The "is_measure" predicate is logically meaningless (always true), and
5456 just guides the heuristic. To find suitable measure functions, the
5457 termination prover sets up the goal "is_measure ?f" of the appropriate
5458 type and generates all solutions by prolog-style backwards proof using
5461 This setup also deals with rules like
5463 "is_measure f ==> is_measure (list_size f)"
5465 which accommodates nested datatypes that recurse through lists.
5466 Similar rules are predeclared for products and option types.
5468 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5472 - Definitions of overloaded constants on sets have to be replaced by
5473 definitions on => and bool.
5475 - Some definitions of overloaded operators on sets can now be proved
5476 using the definitions of the operators on => and bool. Therefore,
5477 the following theorems have been renamed:
5479 subset_def -> subset_eq
5480 psubset_def -> psubset_eq
5481 set_diff_def -> set_diff_eq
5482 Compl_def -> Compl_eq
5483 Sup_set_def -> Sup_set_eq
5484 Inf_set_def -> Inf_set_eq
5485 sup_set_def -> sup_set_eq
5486 inf_set_def -> inf_set_eq
5488 - Due to the incompleteness of the HO unification algorithm, some
5489 rules such as subst may require manual instantiation, if some of
5490 the unknowns in the rule is a set.
5492 - Higher order unification and forward proofs:
5495 have "P (S::'a set)" <...>
5496 then have "EX S. P S" ..
5498 no longer works (due to the incompleteness of the HO unification
5499 algorithm) and must be replaced by the pattern
5506 - Calculational reasoning with subst (or similar rules):
5509 have "P (S::'a set)" <...>
5510 also have "S = T" <...>
5511 finally have "P T" .
5513 no longer works (for similar reasons as the previous example) and
5514 must be replaced by something like
5516 have "P (S::'a set)" <...>
5517 moreover have "S = T" <...>
5518 ultimately have "P T" by simp
5520 - Tactics or packages written in ML code:
5521 Code performing pattern matching on types via
5523 Type ("set", [T]) => ...
5525 must be rewritten. Moreover, functions like strip_type or
5526 binder_types no longer return the right value when applied to a
5529 T1 => ... => Tn => U => bool
5533 T1 => ... => Tn => U set
5535 * Merged theories Wellfounded_Recursion, Accessible_Part and
5536 Wellfounded_Relations to theory Wellfounded.
5538 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5540 * Class finite no longer treats UNIV as class parameter. Use class
5541 enum from theory Library/Enum instead to achieve a similar effect.
5544 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5545 and "Cons". INCOMPATIBILITY.
5547 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5548 Potential INCOMPATIBILITY.
5550 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5551 injective_fst_snd removed, use split_eta and prod_eqI instead.
5552 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5554 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5555 the same name in theory Orderings:
5565 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5566 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5567 and different variable names.
5569 * Library/Option_ord.thy: Canonical order on option type.
5571 * Library/RBT.thy: Red-black trees, an efficient implementation of
5574 * Library/Countable.thy: Type class for countable types.
5576 * Theory Int: The representation of numerals has changed. The infix
5577 operator BIT and the bit datatype with constructors B0 and B1 have
5578 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5579 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5580 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5583 * Theory Nat: definition of <= and < on natural numbers no longer
5584 depend on well-founded relations. INCOMPATIBILITY. Definitions
5585 le_def and less_def have disappeared. Consider lemmas not_less
5586 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5588 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5589 (whose purpose mainly is for various fold_set functionals) have been
5590 abandoned in favor of the existing algebraic classes
5591 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5592 lower_semilattice (resp. upper_semilattice) and linorder.
5595 * Theory Transitive_Closure: induct and cases rules now declare proper
5596 case_names ("base" and "step"). INCOMPATIBILITY.
5598 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5599 lattices. The form set-specific version is available as
5600 Inductive.lfp_ordinal_induct_set.
5602 * Renamed theorems "power.simps" to "power_int.simps".
5605 * Class semiring_div provides basic abstract properties of semirings
5606 with division and modulo operations. Subsumes former class dvd_mod.
5608 * Merged theories IntDef, Numeral and IntArith into unified theory
5609 Int. INCOMPATIBILITY.
5611 * Theory Library/Code_Index: type "index" now represents natural
5612 numbers rather than integers. INCOMPATIBILITY.
5614 * New class "uminus" with operation "uminus" (split of from class
5615 "minus" which now only has operation "minus", binary).
5618 * Constants "card", "internal_split", "option_map" now with authentic
5619 syntax. INCOMPATIBILITY.
5621 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5622 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5623 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5624 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5625 Sup_set_def, le_def, less_def, option_map_def now with object
5626 equality. INCOMPATIBILITY.
5628 * Records. Removed K_record, and replaced it by pure lambda term
5629 %x. c. The simplifier setup is now more robust against eta expansion.
5630 INCOMPATIBILITY: in cases explicitly referring to K_record.
5632 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5634 * Library/ListVector: new theory of arithmetic vector operations.
5636 * Library/Order_Relation: new theory of various orderings as sets of
5637 pairs. Defines preorders, partial orders, linear orders and
5638 well-orders on sets and on types.
5643 * Renamed some theories to allow to loading both ZF and HOL in the
5646 Datatype -> Datatype_ZF
5647 Inductive -> Inductive_ZF
5654 INCOMPATIBILITY: ZF theories that import individual theories below
5655 Main might need to be adapted. Regular theory Main is still
5656 available, as trivial extension of Main_ZF.
5661 * ML within Isar: antiquotation @{const name} or @{const
5662 name(typargs)} produces statically-checked Const term.
5664 * Functor NamedThmsFun: data is available to the user as dynamic fact
5665 (of the same name). Removed obsolete print command.
5667 * Removed obsolete "use_legacy_bindings" function.
5669 * The ``print mode'' is now a thread-local value derived from a global
5670 template (the former print_mode reference), thus access becomes
5671 non-critical. The global print_mode reference is for session
5672 management only; user-code should use print_mode_value,
5673 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5675 * Functions system/system_out provide a robust way to invoke external
5676 shell commands, with propagation of interrupts (requires Poly/ML
5677 5.2.1). Do not use OS.Process.system etc. from the basis library!
5682 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5683 in accordance with Proof General 3.7, which prefers GNU emacs.
5685 * isatool tty runs Isabelle process with plain tty interaction;
5686 optional line editor may be specified via ISABELLE_LINE_EDITOR
5687 setting, the default settings attempt to locate "ledit" and "rlwrap".
5689 * isatool browser now works with Cygwin as well, using general
5690 "javapath" function defined in Isabelle process environment.
5692 * YXML notation provides a simple and efficient alternative to
5693 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5694 isatool yxml as described in the Isabelle system manual.
5696 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5697 provides general wrapper for managing an Isabelle process in a robust
5698 fashion, with ``cooked'' output from stdin/stderr.
5700 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5701 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5703 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5704 way of changing the user's settings is via
5705 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5708 * Multithreading.max_threads := 0 refers to the number of actual CPU
5709 cores of the underlying machine, which is a good starting point for
5710 optimal performance tuning. The corresponding usedir option -M allows
5711 "max" as an alias for "0". WARNING: does not work on certain versions
5712 of Mac OS (with Poly/ML 5.1).
5714 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5715 adverse effect of Isabelle flooding interactive front-ends (notably
5716 ProofGeneral / XEmacs).
5720 New in Isabelle2007 (November 2007)
5721 -----------------------------------
5725 * More uniform information about legacy features, notably a
5726 warning/error of "Legacy feature: ...", depending on the state of the
5727 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5728 legacy features will disappear eventually.
5730 * Theory syntax: the header format ``theory A = B + C:'' has been
5731 discontinued in favour of ``theory A imports B C begin''. Use isatool
5732 fixheaders to convert existing theory files. INCOMPATIBILITY.
5734 * Theory syntax: the old non-Isar theory file format has been
5735 discontinued altogether. Note that ML proof scripts may still be used
5736 with Isar theories; migration is usually quite simple with the ML
5737 function use_legacy_bindings. INCOMPATIBILITY.
5739 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5740 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5743 * Theory loader: be more serious about observing the static theory
5744 header specifications (including optional directories), but not the
5745 accidental file locations of previously successful loads. The strict
5746 update policy of former update_thy is now already performed by
5747 use_thy, so the former has been removed; use_thys updates several
5748 theories simultaneously, just as 'imports' within a theory header
5749 specification, but without merging the results. Potential
5750 INCOMPATIBILITY: may need to refine theory headers and commands
5751 ROOT.ML which depend on load order.
5753 * Theory loader: optional support for content-based file
5754 identification, instead of the traditional scheme of full physical
5755 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5756 (cf. the system manual). The new scheme allows to work with
5757 non-finished theories in persistent session images, such that source
5758 files may be moved later on without requiring reloads.
5760 * Theory loader: old-style ML proof scripts being *attached* to a thy
5761 file (with the same base name as the theory) are considered a legacy
5762 feature, which will disappear eventually. Even now, the theory loader
5763 no longer maintains dependencies on such files.
5765 * Syntax: the scope for resolving ambiguities via type-inference is
5766 now limited to individual terms, instead of whole simultaneous
5767 specifications as before. This greatly reduces the complexity of the
5768 syntax module and improves flexibility by separating parsing and
5769 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5770 'fixes' etc.) are required in rare situations.
5772 * Syntax: constants introduced by new-style packages ('definition',
5773 'abbreviation' etc.) are passed through the syntax module in
5774 ``authentic mode''. This means that associated mixfix annotations
5775 really stick to such constants, independently of potential name space
5776 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5777 trees are represented slightly differently, may need to adapt syntax
5778 translations accordingly. Use CONST marker in 'translations' and
5779 @{const_syntax} antiquotation in 'parse_translation' etc.
5781 * Legacy goal package: reduced interface to the bare minimum required
5782 to keep existing proof scripts running. Most other user-level
5783 functions are now part of the OldGoals structure, which is *not* open
5784 by default (consider isatool expandshort before open OldGoals).
5785 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5786 these tend to cause confusion about the actual goal (!) context being
5787 used here, which is not necessarily the same as the_context().
5789 * Command 'find_theorems': supports "*" wild-card in "name:"
5790 criterion; "with_dups" option. Certain ProofGeneral versions might
5791 support a specific search form (see ProofGeneral/CHANGES).
5793 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5794 by default, which means that "prems" (and also "fixed variables") are
5795 suppressed from proof state output. Note that the ProofGeneral
5796 settings mechanism allows to change and save options persistently, but
5797 older versions of Isabelle will fail to start up if a negative prems
5800 * Local theory targets may be specified by non-nested blocks of
5801 ``context/locale/class ... begin'' followed by ``end''. The body may
5802 contain definitions, theorems etc., including any derived mechanism
5803 that has been implemented on top of these primitives. This concept
5804 generalizes the existing ``theorem (in ...)'' towards more versatility
5807 * Proof General interface: proper undo of final 'end' command;
5808 discontinued Isabelle/classic mode (ML proof scripts).
5811 *** Document preparation ***
5813 * Added antiquotation @{theory name} which prints the given name,
5814 after checking that it refers to a valid ancestor theory in the
5817 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5818 check the given source text as ML type/structure, printing verbatim.
5820 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5821 "c args == rhs" given in the current context. (Any number of
5822 arguments may be given on the LHS.)
5827 * The 'class' package offers a combination of axclass and locale to
5828 achieve Haskell-like type classes in Isabelle. Definitions and
5829 theorems within a class context produce both relative results (with
5830 implicit parameters according to the locale context), and polymorphic
5831 constants with qualified polymorphism (according to the class
5832 context). Within the body context of a 'class' target, a separate
5833 syntax layer ("user space type system") takes care of converting
5834 between global polymorphic consts and internal locale representation.
5835 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5836 "isatool doc classes" provides a tutorial.
5838 * Generic code generator framework allows to generate executable
5839 code for ML and Haskell (including Isabelle classes). A short usage
5842 internal compilation:
5843 export_code <list of constants (term syntax)> in SML
5844 writing SML code to a file:
5845 export_code <list of constants (term syntax)> in SML <filename>
5846 writing OCaml code to a file:
5847 export_code <list of constants (term syntax)> in OCaml <filename>
5848 writing Haskell code to a bunch of files:
5849 export_code <list of constants (term syntax)> in Haskell <filename>
5851 evaluating closed propositions to True/False using code generation:
5854 Reasonable default setup of framework in HOL.
5856 Theorem attributs for selecting and transforming function equations theorems:
5858 [code fun]: select a theorem as function equation for a specific constant
5859 [code fun del]: deselect a theorem as function equation for a specific constant
5860 [code inline]: select an equation theorem for unfolding (inlining) in place
5861 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5863 User-defined serializations (target in {SML, OCaml, Haskell}):
5865 code_const <and-list of constants (term syntax)>
5866 {(target) <and-list of const target syntax>}+
5868 code_type <and-list of type constructors>
5869 {(target) <and-list of type target syntax>}+
5871 code_instance <and-list of instances>
5873 where instance ::= <type constructor> :: <class>
5875 code_class <and_list of classes>
5876 {(target) <and-list of class target syntax>}+
5877 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5879 code_instance and code_class only are effective to target Haskell.
5881 For example usage see src/HOL/ex/Codegenerator.thy and
5882 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5883 generation from Isabelle/HOL theories is available via "isatool doc
5886 * Code generator: consts in 'consts_code' Isar commands are now
5887 referred to by usual term syntax (including optional type
5890 * Command 'no_translations' removes translation rules from theory
5893 * Overloaded definitions are now actually checked for acyclic
5894 dependencies. The overloading scheme is slightly more general than
5895 that of Haskell98, although Isabelle does not demand an exact
5896 correspondence to type class and instance declarations.
5897 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5898 exotic versions of overloading -- at the discretion of the user!
5900 Polymorphic constants are represented via type arguments, i.e. the
5901 instantiation that matches an instance against the most general
5902 declaration given in the signature. For example, with the declaration
5903 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5904 as c(nat). Overloading is essentially simultaneous structural
5905 recursion over such type arguments. Incomplete specification patterns
5906 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5907 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5908 Command 'print_theory' outputs the normalized system of recursive
5909 equations, see section "definitions".
5911 * Configuration options are maintained within the theory or proof
5912 context (with name and type bool/int/string), providing a very simple
5913 interface to a poor-man's version of general context data. Tools may
5914 declare options in ML (e.g. using Attrib.config_int) and then refer to
5915 these values using Config.get etc. Users may change options via an
5916 associated attribute of the same name. This form of context
5917 declaration works particularly well with commands 'declare' or
5918 'using', for example ``declare [[foo = 42]]''. Thus it has become
5919 very easy to avoid global references, which would not observe Isar
5920 toplevel undo/redo and fail to work with multithreading.
5922 Various global ML references of Pure and HOL have been turned into
5923 configuration options:
5925 Unify.search_bound unify_search_bound
5926 Unify.trace_bound unify_trace_bound
5927 Unify.trace_simp unify_trace_simp
5928 Unify.trace_types unify_trace_types
5929 Simplifier.simp_depth_limit simp_depth_limit
5930 Blast.depth_limit blast_depth_limit
5931 DatatypeProp.dtK datatype_distinctness_limit
5932 fast_arith_neq_limit fast_arith_neq_limit
5933 fast_arith_split_limit fast_arith_split_limit
5935 * Named collections of theorems may be easily installed as context
5936 data using the functor NamedThmsFun (see also
5937 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5938 attributes; there is also a toplevel print command. This facility is
5939 just a common case of general context data, which is the preferred way
5940 for anything more complex than just a list of facts in canonical
5943 * Isar: command 'declaration' augments a local theory by generic
5944 declaration functions written in ML. This enables arbitrary content
5945 being added to the context, depending on a morphism that tells the
5946 difference of the original declaration context wrt. the application
5947 context encountered later on.
5949 * Isar: proper interfaces for simplification procedures. Command
5950 'simproc_setup' declares named simprocs (with match patterns, and body
5951 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5952 context. ML antiquotation @{simproc name} retrieves named simprocs.
5954 * Isar: an extra pair of brackets around attribute declarations
5955 abbreviates a theorem reference involving an internal dummy fact,
5956 which will be ignored later --- only the effect of the attribute on
5957 the background context will persist. This form of in-place
5958 declarations is particularly useful with commands like 'declare' and
5959 'using', for example ``have A using [[simproc a]] by simp''.
5961 * Isar: method "assumption" (and implicit closing of subproofs) now
5962 takes simple non-atomic goal assumptions into account: after applying
5963 an assumption as a rule the resulting subgoals are solved by atomic
5964 assumption steps. This is particularly useful to finish 'obtain'
5965 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5966 without referring to the original premise "!!x. P x ==> thesis" in the
5967 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5970 * Isar: implicit use of prems from the Isar proof context is
5971 considered a legacy feature. Common applications like ``have A .''
5972 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5973 referencing facts explicitly here improves readability and
5974 maintainability of proof texts.
5976 * Isar: improper proof element 'guess' is like 'obtain', but derives
5977 the obtained context from the course of reasoning! For example:
5979 assume "EX x y. A x & B y" -- "any previous fact"
5980 then guess x and y by clarify
5982 This technique is potentially adventurous, depending on the facts and
5983 proof tools being involved here.
5985 * Isar: known facts from the proof context may be specified as literal
5986 propositions, using ASCII back-quote syntax. This works wherever
5987 named facts used to be allowed so far, in proof commands, proof
5988 methods, attributes etc. Literal facts are retrieved from the context
5989 according to unification of type and term parameters. For example,
5990 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5991 theorems in the current context, then these are valid literal facts:
5992 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5994 There is also a proof method "fact" which does the same composition
5995 for explicit goal states, e.g. the following proof texts coincide with
5996 certain special cases of literal facts:
5998 have "A" by fact == note `A`
5999 have "A ==> B" by fact == note `A ==> B`
6000 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
6001 have "P a ==> Q a" by fact == note `P a ==> Q a`
6003 * Isar: ":" (colon) is no longer a symbolic identifier character in
6004 outer syntax. Thus symbolic identifiers may be used without
6005 additional white space in declarations like this: ``assume *: A''.
6007 * Isar: 'print_facts' prints all local facts of the current context,
6008 both named and unnamed ones.
6010 * Isar: 'def' now admits simultaneous definitions, e.g.:
6012 def x == "t" and y == "u"
6014 * Isar: added command 'unfolding', which is structurally similar to
6015 'using', but affects both the goal state and facts by unfolding given
6016 rewrite rules. Thus many occurrences of the 'unfold' method or
6017 'unfolded' attribute may be replaced by first-class proof text.
6019 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
6020 and command 'unfolding' now all support object-level equalities
6021 (potentially conditional). The underlying notion of rewrite rule is
6022 analogous to the 'rule_format' attribute, but *not* that of the
6023 Simplifier (which is usually more generous).
6025 * Isar: the new attribute [rotated n] (default n = 1) rotates the
6026 premises of a theorem by n. Useful in conjunction with drule.
6028 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
6029 method expression within a sandbox consisting of the first N
6030 sub-goals, which need to exist. For example, ``simp_all [3]''
6031 simplifies the first three sub-goals, while (rule foo, simp_all)[]
6032 simplifies all new goals that emerge from applying rule foo to the
6033 originally first one.
6035 * Isar: schematic goals are no longer restricted to higher-order
6036 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
6039 * Isar: the conclusion of a long theorem statement is now either
6040 'shows' (a simultaneous conjunction, as before), or 'obtains'
6041 (essentially a disjunction of cases with local parameters and
6042 assumptions). The latter allows to express general elimination rules
6043 adequately; in this notation common elimination rules look like this:
6045 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6047 obtains x where "P x"
6049 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6053 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6059 The subsequent classical rules even refer to the formal "thesis"
6062 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6065 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6066 obtains "thesis ==> something"
6068 The actual proof of an 'obtains' statement is analogous to that of the
6069 Isar proof element 'obtain', only that there may be several cases.
6070 Optional case names may be specified in parentheses; these will be
6071 available both in the present proof and as annotations in the
6072 resulting rule, for later use with the 'cases' method (cf. attribute
6075 * Isar: the assumptions of a long theorem statement are available as
6076 "assms" fact in the proof context. This is more appropriate than the
6077 (historical) "prems", which refers to all assumptions of the current
6078 context, including those from the target locale, proof body etc.
6080 * Isar: 'print_statement' prints theorems from the current theory or
6081 proof context in long statement form, according to the syntax of a
6084 * Isar: 'obtain' takes an optional case name for the local context
6085 introduction rule (default "that").
6087 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6088 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6091 * Pure: syntax "CONST name" produces a fully internalized constant
6092 according to the current context. This is particularly useful for
6093 syntax translations that should refer to internal constant
6094 representations independently of name spaces.
6096 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6097 instead of "FOO ". This allows multiple binder declarations to coexist
6098 in the same context. INCOMPATIBILITY.
6100 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6101 primitive that also works in a locale context (both for constants and
6102 fixed variables). Type declaration and internal syntactic representation
6103 of given constants retrieved from the context. Likewise, the
6104 'no_notation' command allows to remove given syntax annotations from the
6107 * Isar/locales: new derived specification elements 'axiomatization',
6108 'definition', 'abbreviation', which support type-inference, admit
6109 object-level specifications (equality, equivalence). See also the
6110 isar-ref manual. Examples:
6113 eq (infix "===" 50) where
6114 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6116 definition "f x y = x + y + 1"
6117 definition g where "g x = f x x"
6120 neq (infix "=!=" 50) where
6121 "x =!= y == ~ (x === y)"
6123 These specifications may be also used in a locale context. Then the
6124 constants being introduced depend on certain fixed parameters, and the
6125 constant name is qualified by the locale base name. An internal
6126 abbreviation takes care for convenient input and output, making the
6127 parameters implicit and using the original short name. See also
6128 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6129 entities from a monomorphic theory.
6131 Presently, abbreviations are only available 'in' a target locale, but
6132 not inherited by general import expressions. Also note that
6133 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6134 'translations' in common applications. The "no_abbrevs" print mode
6135 prevents folding of abbreviations in term output.
6137 Concrete syntax is attached to specified constants in internal form,
6138 independently of name spaces. The parse tree representation is
6139 slightly different -- use 'notation' instead of raw 'syntax', and
6140 'translations' with explicit "CONST" markup to accommodate this.
6142 * Pure/Isar: unified syntax for new-style specification mechanisms
6143 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6144 full type inference and dummy patterns ("_"). For example:
6146 definition "K x _ = x"
6148 inductive conj for A B
6149 where "A ==> B ==> conj A B"
6151 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6152 the current context. Print mode "no_abbrevs" prevents inversion of
6153 abbreviations on output.
6155 * Isar/locales: improved parameter handling: use of locales "var" and
6156 "struct" no longer necessary; - parameter renamings are no longer
6157 required to be injective. For example, this allows to define
6158 endomorphisms as locale endom = homom mult mult h.
6160 * Isar/locales: changed the way locales with predicates are defined.
6161 Instead of accumulating the specification, the imported expression is
6162 now an interpretation. INCOMPATIBILITY: different normal form of
6163 locale expressions. In particular, in interpretations of locales with
6164 predicates, goals repesenting already interpreted fragments are not
6165 removed automatically. Use methods `intro_locales' and
6166 `unfold_locales'; see below.
6168 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6169 provide backward reasoning on locales predicates. The methods are
6170 aware of interpretations and discharge corresponding goals.
6171 `intro_locales' is less aggressive then `unfold_locales' and does not
6172 unfold predicates to assumptions.
6174 * Isar/locales: the order in which locale fragments are accumulated
6175 has changed. This enables to override declarations from fragments due
6176 to interpretations -- for example, unwanted simp rules.
6178 * Isar/locales: interpretation in theories and proof contexts has been
6179 extended. One may now specify (and prove) equations, which are
6180 unfolded in interpreted theorems. This is useful for replacing
6181 defined concepts (constants depending on locale parameters) by
6182 concepts already existing in the target context. Example:
6184 interpretation partial_order ["op <= :: [int, int] => bool"]
6185 where "partial_order.less (op <=) (x::int) y = (x < y)"
6187 Typically, the constant `partial_order.less' is created by a
6188 definition specification element in the context of locale
6191 * Method "induct": improved internal context management to support
6192 local fixes and defines on-the-fly. Thus explicit meta-level
6193 connectives !! and ==> are rarely required anymore in inductive goals
6194 (using object-logic connectives for this purpose has been long
6195 obsolete anyway). Common proof patterns are explained in
6196 src/HOL/Induct/Common_Patterns.thy, see also
6197 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6200 * Method "induct": improved handling of simultaneous goals. Instead of
6201 introducing object-level conjunction, the statement is now split into
6202 several conclusions, while the corresponding symbolic cases are nested
6203 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6204 see src/HOL/Induct/Common_Patterns.thy, for example.
6206 * Method "induct": mutual induction rules are now specified as a list
6207 of rule sharing the same induction cases. HOL packages usually provide
6208 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6209 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6210 mutual induction rules differently, i.e. like this:
6212 (induct rule: foo_bar.inducts)
6213 (induct set: foo bar)
6214 (induct pred: foo bar)
6215 (induct type: foo bar)
6217 The ML function ProjectRule.projections turns old-style rules into the
6220 * Method "coinduct": dual of induction, see
6221 src/HOL/Library/Coinductive_List.thy for various examples.
6223 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6224 considered a legacy feature.
6226 * Attribute "symmetric" produces result with standardized schematic
6227 variables (index 0). Potential INCOMPATIBILITY.
6229 * Simplifier: by default the simplifier trace only shows top level
6230 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6231 default. Thus there is less danger of being flooded by the trace. The
6232 trace indicates where parts have been suppressed.
6234 * Provers/classical: removed obsolete classical version of elim_format
6235 attribute; classical elim/dest rules are now treated uniformly when
6236 manipulating the claset.
6238 * Provers/classical: stricter checks to ensure that supplied intro,
6239 dest and elim rules are well-formed; dest and elim rules must have at
6242 * Provers/classical: attributes dest/elim/intro take an optional
6243 weight argument for the rule (just as the Pure versions). Weights are
6244 ignored by automated tools, but determine the search order of single
6247 * Syntax: input syntax now supports dummy variable binding "%_. b",
6248 where the body does not mention the bound variable. Note that dummy
6249 patterns implicitly depend on their context of bounds, which makes
6250 "{_. _}" match any set comprehension as expected. Potential
6251 INCOMPATIBILITY -- parse translations need to cope with syntactic
6252 constant "_idtdummy" in the binding position.
6254 * Syntax: removed obsolete syntactic constant "_K" and its associated
6255 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6256 for example "A -> B" => "Pi A (%_. B)".
6258 * Pure: 'class_deps' command visualizes the subclass relation, using
6259 the graph browser tool.
6261 * Pure: 'print_theory' now suppresses certain internal declarations by
6262 default; use '!' option for full details.
6267 * Method "metis" proves goals by applying the Metis general-purpose
6268 resolution prover (see also http://gilith.com/software/metis/).
6269 Examples are in the directory MetisExamples. WARNING: the
6270 Isabelle/HOL-Metis integration does not yet work properly with
6273 * Command 'sledgehammer' invokes external automatic theorem provers as
6274 background processes. It generates calls to the "metis" method if
6275 successful. These can be pasted into the proof. Users do not have to
6276 wait for the automatic provers to return. WARNING: does not really
6277 work with multi-threading.
6279 * New "auto_quickcheck" feature tests outermost goal statements for
6280 potential counter-examples. Controlled by ML references
6281 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6282 5000 milliseconds). Fails silently if statements is outside of
6283 executable fragment, or any other codgenerator problem occurs.
6285 * New constant "undefined" with axiom "undefined x = undefined".
6287 * Added class "HOL.eq", allowing for code generation with polymorphic
6290 * Some renaming of class constants due to canonical name prefixing in
6291 the new 'class' package:
6293 HOL.abs ~> HOL.abs_class.abs
6294 HOL.divide ~> HOL.divide_class.divide
6295 0 ~> HOL.zero_class.zero
6296 1 ~> HOL.one_class.one
6297 op + ~> HOL.plus_class.plus
6298 op - ~> HOL.minus_class.minus
6299 uminus ~> HOL.minus_class.uminus
6300 op * ~> HOL.times_class.times
6301 op < ~> HOL.ord_class.less
6302 op <= > HOL.ord_class.less_eq
6303 Nat.power ~> Power.power_class.power
6304 Nat.size ~> Nat.size_class.size
6305 Numeral.number_of ~> Numeral.number_class.number_of
6306 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6307 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6308 Orderings.min ~> Orderings.ord_class.min
6309 Orderings.max ~> Orderings.ord_class.max
6310 Divides.op div ~> Divides.div_class.div
6311 Divides.op mod ~> Divides.div_class.mod
6312 Divides.op dvd ~> Divides.div_class.dvd
6314 INCOMPATIBILITY. Adaptions may be required in the following cases:
6316 a) User-defined constants using any of the names "plus", "minus",
6317 "times", "less" or "less_eq". The standard syntax translations for
6318 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6321 b) Variables named "plus", "minus", "times", "less", "less_eq"
6322 INCOMPATIBILITY: use more specific names.
6324 c) Permutative equations (e.g. "a + b = b + a")
6325 Since the change of names also changes the order of terms, permutative
6326 rewrite rules may get applied in a different order. Experience shows
6327 that this is rarely the case (only two adaptions in the whole Isabelle
6328 distribution). INCOMPATIBILITY: rewrite proofs
6330 d) ML code directly refering to constant names
6331 This in general only affects hand-written proof tactics, simprocs and
6332 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6333 Consider using @{const_name} antiquotation.
6335 * New class "default" with associated constant "default".
6337 * Function "sgn" is now overloaded and available on int, real, complex
6338 (and other numeric types), using class "sgn". Two possible defs of
6339 sgn are given as equational assumptions in the classes sgn_if and
6340 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6343 * Locale "partial_order" now unified with class "order" (cf. theory
6344 Orderings), added parameter "less". INCOMPATIBILITY.
6346 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6347 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6348 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6350 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6351 changed order of proof goals in instance proofs.
6353 * The transitivity reasoner for partial and linear orders is set up
6354 for classes "order" and "linorder". Instances of the reasoner are available
6355 in all contexts importing or interpreting the corresponding locales.
6356 Method "order" invokes the reasoner separately; the reasoner
6357 is also integrated with the Simplifier as a solver. Diagnostic
6358 command 'print_orders' shows the available instances of the reasoner
6359 in the current context.
6361 * Localized monotonicity predicate in theory "Orderings"; integrated
6362 lemmas max_of_mono and min_of_mono with this predicate.
6365 * Formulation of theorem "dense" changed slightly due to integration
6366 with new class dense_linear_order.
6368 * Uniform lattice theory development in HOL.
6370 constants "meet" and "join" now named "inf" and "sup"
6371 constant "Meet" now named "Inf"
6373 classes "meet_semilorder" and "join_semilorder" now named
6374 "lower_semilattice" and "upper_semilattice"
6375 class "lorder" now named "lattice"
6376 class "comp_lat" now named "complete_lattice"
6378 Instantiation of lattice classes allows explicit definitions
6379 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6381 INCOMPATIBILITY. Theorem renames:
6383 meet_left_le ~> inf_le1
6384 meet_right_le ~> inf_le2
6385 join_left_le ~> sup_ge1
6386 join_right_le ~> sup_ge2
6387 meet_join_le ~> inf_sup_ord
6390 le_meet ~> le_inf_iff
6391 le_join ~> ge_sup_conv
6392 meet_idempotent ~> inf_idem
6393 join_idempotent ~> sup_idem
6394 meet_comm ~> inf_commute
6395 join_comm ~> sup_commute
6396 meet_leI1 ~> le_infI1
6397 meet_leI2 ~> le_infI2
6398 le_joinI1 ~> le_supI1
6399 le_joinI2 ~> le_supI2
6400 meet_assoc ~> inf_assoc
6401 join_assoc ~> sup_assoc
6402 meet_left_comm ~> inf_left_commute
6403 meet_left_idempotent ~> inf_left_idem
6404 join_left_comm ~> sup_left_commute
6405 join_left_idempotent ~> sup_left_idem
6408 le_def_meet ~> le_iff_inf
6409 le_def_join ~> le_iff_sup
6410 join_absorp2 ~> sup_absorb2
6411 join_absorp1 ~> sup_absorb1
6412 meet_absorp1 ~> inf_absorb1
6413 meet_absorp2 ~> inf_absorb2
6414 meet_join_absorp ~> inf_sup_absorb
6415 join_meet_absorp ~> sup_inf_absorb
6416 distrib_join_le ~> distrib_sup_le
6417 distrib_meet_le ~> distrib_inf_le
6419 add_meet_distrib_left ~> add_inf_distrib_left
6420 add_join_distrib_left ~> add_sup_distrib_left
6421 is_join_neg_meet ~> is_join_neg_inf
6422 is_meet_neg_join ~> is_meet_neg_sup
6423 add_meet_distrib_right ~> add_inf_distrib_right
6424 add_join_distrib_right ~> add_sup_distrib_right
6425 add_meet_join_distribs ~> add_sup_inf_distribs
6426 join_eq_neg_meet ~> sup_eq_neg_inf
6427 meet_eq_neg_join ~> inf_eq_neg_sup
6428 add_eq_meet_join ~> add_eq_inf_sup
6429 meet_0_imp_0 ~> inf_0_imp_0
6430 join_0_imp_0 ~> sup_0_imp_0
6431 meet_0_eq_0 ~> inf_0_eq_0
6432 join_0_eq_0 ~> sup_0_eq_0
6433 neg_meet_eq_join ~> neg_inf_eq_sup
6434 neg_join_eq_meet ~> neg_sup_eq_inf
6435 join_eq_if ~> sup_eq_if
6437 mono_meet ~> mono_inf
6438 mono_join ~> mono_sup
6439 meet_bool_eq ~> inf_bool_eq
6440 join_bool_eq ~> sup_bool_eq
6441 meet_fun_eq ~> inf_fun_eq
6442 join_fun_eq ~> sup_fun_eq
6443 meet_set_eq ~> inf_set_eq
6444 join_set_eq ~> sup_set_eq
6445 meet1_iff ~> inf1_iff
6446 meet2_iff ~> inf2_iff
6455 join1_iff ~> sup1_iff
6456 join2_iff ~> sup2_iff
6466 is_meet_Meet ~> is_meet_Inf
6467 Meet_bool_def ~> Inf_bool_def
6468 Meet_fun_def ~> Inf_fun_def
6469 Meet_greatest ~> Inf_greatest
6470 Meet_lower ~> Inf_lower
6471 Meet_set_def ~> Inf_set_def
6474 Sup_bool_eq ~> Sup_bool_def
6475 Sup_fun_eq ~> Sup_fun_def
6476 Sup_set_eq ~> Sup_set_def
6478 listsp_meetI ~> listsp_infI
6479 listsp_meet_eq ~> listsp_inf_eq
6484 * Added syntactic class "size"; overloaded constant "size" now has
6485 type "'a::size ==> bool"
6487 * Internal reorganisation of `size' of datatypes: size theorems
6488 "foo.size" are no longer subsumed by "foo.simps" (but are still
6489 simplification rules by default!); theorems "prod.size" now named
6492 * Class "div" now inherits from class "times" rather than "type".
6495 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6496 Linorder etc. have disappeared; operations defined in terms of
6497 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6499 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6501 * HOL-Word: New extensive library and type for generic, fixed size
6502 machine words, with arithmetic, bit-wise, shifting and rotating
6503 operations, reflection into int, nat, and bool lists, automation for
6504 linear arithmetic (by automatic reflection into nat or int), including
6505 lemmas on overflow and monotonicity. Instantiated to all appropriate
6506 arithmetic type classes, supporting automatic simplification of
6507 numerals on all operations.
6509 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6511 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6513 * Code generator library theories:
6514 - Code_Integer represents HOL integers by big integer literals in target
6516 - Code_Char represents HOL characters by character literals in target
6518 - Code_Char_chr like Code_Char, but also offers treatment of character
6519 codes; includes Code_Integer.
6520 - Executable_Set allows to generate code for finite sets using lists.
6521 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6523 - Executable_Real implements a subset of real numbers, namly those
6524 representable by rational numbers.
6525 - Efficient_Nat implements natural numbers by integers, which in general will
6526 result in higher efficency; pattern matching with 0/Suc is eliminated;
6527 includes Code_Integer.
6528 - Code_Index provides an additional datatype index which is mapped to
6529 target-language built-in integers.
6530 - Code_Message provides an additional datatype message_string which is isomorphic to
6531 strings; messages are mapped to target-language strings.
6533 * New package for inductive predicates
6535 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6538 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6539 for z_1 :: U_1 and ... and z_n :: U_m
6541 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6544 with full support for type-inference, rather than
6546 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6548 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6549 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6551 inductive "s z_1 ... z_m"
6553 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6556 For backward compatibility, there is a wrapper allowing inductive
6557 sets to be defined with the new package via
6560 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6561 for z_1 :: U_1 and ... and z_n :: U_m
6563 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6569 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6570 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6571 for z_1 :: U_1 and ... and z_n :: U_m
6573 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6574 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6577 if the additional syntax "p ..." is required.
6579 Numerous examples can be found in the subdirectories src/HOL/Auth,
6580 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6584 - Since declaration and definition of inductive sets or predicates
6585 is no longer separated, abbreviations involving the newly
6586 introduced sets or predicates must be specified together with the
6587 introduction rules after the 'where' keyword (see above), rather
6588 than before the actual inductive definition.
6590 - The variables in induction and elimination rules are now
6591 quantified in the order of their occurrence in the introduction
6592 rules, rather than in alphabetical order. Since this may break
6593 some proofs, these proofs either have to be repaired, e.g. by
6594 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6595 statements of the form
6597 case (rule_i a_i_1 ... a_i_{k_i})
6599 or the old order of quantification has to be restored by explicitly adding
6600 meta-level quantifiers in the introduction rules, i.e.
6602 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6604 - The format of the elimination rules is now
6606 p z_1 ... z_m x_1 ... x_n ==>
6607 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6612 (x_1, ..., x_n) : s z_1 ... z_m ==>
6613 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6616 for sets rather than
6618 x : s z_1 ... z_m ==>
6619 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6622 This may require terms in goals to be expanded to n-tuples
6623 (e.g. using case_tac or simplification with the split_paired_all
6624 rule) before the above elimination rule is applicable.
6626 - The elimination or case analysis rules for (mutually) inductive
6627 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6628 list of rules "p_1_..._p_k.elims" is no longer available.
6630 * New package "function"/"fun" for general recursive functions,
6631 supporting mutual and nested recursion, definitions in local contexts,
6632 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6633 for small examples, and the separate tutorial on the function
6634 package. The old recdef "package" is still available as before, but
6635 users are encouraged to use the new package.
6637 * Method "lexicographic_order" automatically synthesizes termination
6638 relations as lexicographic combinations of size measures.
6640 * Case-expressions allow arbitrary constructor-patterns (including
6641 "_") and take their order into account, like in functional
6642 programming. Internally, this is translated into nested
6643 case-expressions; missing cases are added and mapped to the predefined
6644 constant "undefined". In complicated cases printing may no longer show
6645 the original input but the internal form. Lambda-abstractions allow
6646 the same form of pattern matching: "% pat1 => e1 | ..." is an
6647 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6650 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6651 is an abbreviation for "of_nat :: nat => int". The simplification
6652 rules for "of_nat" have been changed to work like "int" did
6653 previously. Potential INCOMPATIBILITY:
6654 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6655 - of_nat_diff and of_nat_mult are no longer default simp rules
6657 * Method "algebra" solves polynomial equations over (semi)rings using
6658 Groebner bases. The (semi)ring structure is defined by locales and the
6659 tool setup depends on that generic context. Installing the method for
6660 a specific type involves instantiating the locale and possibly adding
6661 declarations for computation on the coefficients. The method is
6662 already instantiated for natural numbers and for the axiomatic class
6663 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6664 CALCULEMUS 2007 for the general principles underlying this
6665 architecture of context-aware proof-tools.
6667 * Method "ferrack" implements quantifier elimination over
6668 special-purpose dense linear orders using locales (analogous to
6669 "algebra"). The method is already installed for class
6670 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6673 * Former constant "List.op @" now named "List.append". Use ML
6674 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6675 circumvent possible incompatibilities when working on ML level.
6677 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6679 * New function listsum :: 'a list => 'a for arbitrary monoids.
6680 Special syntax: "SUM x <- xs. f x" (and latex variants)
6682 * New syntax for Haskell-like list comprehension (input only), eg.
6683 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6685 * The special syntax for function "filter" has changed from [x :
6686 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6687 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6689 * [a..b] is now defined for arbitrary linear orders. It used to be
6690 defined on nat only, as an abbreviation for [a..<Suc b]
6693 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6695 * New functions "sorted" and "sort" in src/HOL/List.thy.
6697 * New lemma collection field_simps (an extension of ring_simps) for
6698 manipulating (in)equations involving division. Multiplies with all
6699 denominators that can be proved to be non-zero (in equations) or
6700 positive/negative (in inequations).
6702 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6703 have been improved and renamed to ring_simps, group_simps and
6704 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6705 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6707 * Theory Library/Commutative_Ring: switched from recdef to function
6708 package; constants add, mul, pow now curried. Infix syntax for
6709 algebraic operations.
6711 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6714 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6717 * HOL/records: generalised field-update to take a function on the
6718 field rather than the new value: r(|A := x|) is translated to A_update
6719 (K x) r The K-combinator that is internally used is called K_record.
6720 INCOMPATIBILITY: Usage of the plain update functions has to be
6723 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6724 * x = 0, which are required for a semiring. Richer structures do not
6725 inherit from semiring_0 anymore, because this property is a theorem
6726 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6727 there is more to prove, but this is mostly trivial.
6729 * Class "recpower" is generalized to arbitrary monoids, not just
6730 commutative semirings. INCOMPATIBILITY: may need to incorporate
6731 commutativity or semiring properties additionally.
6733 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6734 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6735 better use 'abbreviation'.
6737 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6739 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6740 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6741 significant changes for setting up numeral syntax for types:
6742 - New constants Numeral.pred and Numeral.succ instead
6743 of former Numeral.bin_pred and Numeral.bin_succ.
6744 - Use integer operations instead of bin_add, bin_mult and so on.
6745 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6746 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6748 See src/HOL/Integ/IntArith.thy for an example setup.
6750 * Command 'normal_form' computes the normal form of a term that may
6751 contain free variables. For example ``normal_form "rev [a, b, c]"''
6752 produces ``[b, c, a]'' (without proof). This command is suitable for
6753 heavy-duty computations because the functions are compiled to ML
6754 first. Correspondingly, a method "normalization" is provided. See
6755 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6757 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6758 25 like -->); output depends on the "iff" print_mode, the default is
6759 "A = B" (with priority 50).
6761 * Relations less (<) and less_eq (<=) are also available on type bool.
6762 Modified syntax to disallow nesting without explicit parentheses,
6763 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6766 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6768 * Relation composition operator "op O" now has precedence 75 and binds
6769 stronger than union and intersection. INCOMPATIBILITY.
6771 * The old set interval syntax "{m..n(}" (and relatives) has been
6772 removed. Use "{m..<n}" (and relatives) instead.
6774 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6775 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6776 ``declare [[simproc del: neq]]''.
6778 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6781 * Theorem Cons_eq_map_conv no longer declared as "simp".
6783 * Theorem setsum_mult renamed to setsum_right_distrib.
6785 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6788 * Reimplemented methods "sat" and "satx", with several improvements:
6789 goals no longer need to be stated as "<prems> ==> False", equivalences
6790 (i.e. "=" on type bool) are handled, variable names of the form
6791 "lit_<n>" are no longer reserved, significant speedup.
6793 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6794 zChaff is still supported as well.
6796 * 'inductive' and 'datatype': provide projections of mutual rules,
6797 bundled as foo_bar.inducts;
6799 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6802 * Library: moved theory Accessible_Part to main HOL.
6804 * Library: added theory Coinductive_List of potentially infinite lists
6805 as greatest fixed-point.
6807 * Library: added theory AssocList which implements (finite) maps as
6810 * Method "evaluation" solves goals (i.e. a boolean expression)
6811 efficiently by compiling it to ML. The goal is "proved" (via an
6812 oracle) if it evaluates to True.
6814 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6815 also when invoked by the simplifier. This results in the Simplifier
6816 being more powerful on arithmetic goals. INCOMPATIBILITY.
6817 Configuration option fast_arith_split_limit=0 recovers the old
6820 * Support for hex (0x20) and binary (0b1001) numerals.
6822 * New method: reify eqs (t), where eqs are equations for an
6823 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6824 parameter, computes a term s::'b and a list xs::'a list and proves the
6825 theorem I xs s = t. This is also known as reification or quoting. The
6826 resulting theorem is applied to the subgoal to substitute t with I xs
6827 s. If t is omitted, the subgoal itself is reified.
6829 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6830 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6831 where f is supposed to be a computable function (in the sense of code
6832 generattion). The method uses reify to compute s and xs as above then
6833 applies corr_thm and uses normalization by evaluation to "prove" f s =
6834 r and finally gets the theorem t = r, which is again applied to the
6835 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6837 * Reflection: Automatic reification now handels binding, an example is
6838 available in src/HOL/ex/ReflectionEx.thy
6840 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6841 command 'statespace' that is similar to 'record', but introduces an
6842 abstract specification based on the locale infrastructure instead of
6843 HOL types. This leads to extra flexibility in composing state spaces,
6844 in particular multiple inheritance and renaming of components.
6849 * Hyperreal: Functions root and sqrt are now defined on negative real
6850 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6851 Nonnegativity side conditions have been removed from many lemmas, so
6852 that more subgoals may now be solved by simplification; potential
6855 * Real: new type classes formalize real normed vector spaces and
6856 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6857 and norm :: 'a => real.
6859 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6860 reals into other types. The overloaded constant Reals :: 'a set is now
6861 defined as range of_real; potential INCOMPATIBILITY.
6863 * Real: proper support for ML code generation, including 'quickcheck'.
6864 Reals are implemented as arbitrary precision rationals.
6866 * Hyperreal: Several constants that previously worked only for the
6867 reals have been generalized, so they now work over arbitrary vector
6868 spaces. Type annotations may need to be added in some cases; potential
6871 Infinitesimal :: ('a::real_normed_vector) star set
6872 HFinite :: ('a::real_normed_vector) star set
6873 HInfinite :: ('a::real_normed_vector) star set
6874 approx :: ('a::real_normed_vector) star => 'a star => bool
6875 monad :: ('a::real_normed_vector) star => 'a star set
6876 galaxy :: ('a::real_normed_vector) star => 'a star set
6877 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6878 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6879 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6880 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6881 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6882 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6883 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6884 sgn :: 'a::real_normed_vector => 'a
6885 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6887 * Complex: Some complex-specific constants are now abbreviations for
6888 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6889 hnorm. Other constants have been entirely removed in favor of the
6890 polymorphic versions (INCOMPATIBILITY):
6894 HInfinite <-- CInfinite
6895 Infinitesimal <-- CInfinitesimal
6898 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6899 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6900 (ns)deriv <-- (ns)cderiv
6905 * Formalisation of ideals and the quotient construction over rings.
6907 * Order and lattice theory no longer based on records.
6910 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6911 greatest_closed. INCOMPATIBILITY.
6913 * Method algebra is now set up via an attribute. For examples see
6914 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6915 of algebraic structures.
6917 * Renamed theory CRing to Ring.
6922 * Substantial, yet incomplete support for nominal datatypes (binding
6923 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6924 src/HOL/Nominal/Examples. Prospective users should consult
6925 http://isabelle.in.tum.de/nominal/
6930 * ML basics: just one true type int, which coincides with IntInf.int
6933 * ML within Isar: antiquotations allow to embed statically-checked
6934 formal entities in the source, referring to the context available at
6935 compile-time. For example:
6937 ML {* @{sort "{zero,one}"} *}
6938 ML {* @{typ "'a => 'b"} *}
6939 ML {* @{term "%x. x"} *}
6940 ML {* @{prop "x == y"} *}
6941 ML {* @{ctyp "'a => 'b"} *}
6942 ML {* @{cterm "%x. x"} *}
6943 ML {* @{cprop "x == y"} *}
6944 ML {* @{thm asm_rl} *}
6945 ML {* @{thms asm_rl} *}
6946 ML {* @{type_name c} *}
6947 ML {* @{type_syntax c} *}
6948 ML {* @{const_name c} *}
6949 ML {* @{const_syntax c} *}
6952 ML {* @{theory Pure} *}
6953 ML {* @{theory_ref} *}
6954 ML {* @{theory_ref Pure} *}
6957 ML {* @{clasimpset} *}
6959 The same works for sources being ``used'' within an Isar context.
6961 * ML in Isar: improved error reporting; extra verbosity with
6962 ML_Context.trace enabled.
6964 * Pure/General/table.ML: the join operations now works via exceptions
6965 DUP/SAME instead of type option. This is simpler in simple cases, and
6966 admits slightly more efficient complex applications.
6968 * Pure: 'advanced' translation functions (parse_translation etc.) now
6969 use Context.generic instead of just theory.
6971 * Pure: datatype Context.generic joins theory/Proof.context and
6972 provides some facilities for code that works in either kind of
6973 context, notably GenericDataFun for uniform theory and proof data.
6975 * Pure: simplified internal attribute type, which is now always
6976 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6977 local (Proof.context) attributes have been discontinued, while
6978 minimizing code duplication. Thm.rule_attribute and
6979 Thm.declaration_attribute build canonical attributes; see also structure
6980 Context for further operations on Context.generic, notably
6981 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6982 declarations and definitions.
6984 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6985 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6986 init only required for impure data. INCOMPATIBILITY: empty really need
6987 to be empty (no dependencies on theory content!)
6989 * Pure/kernel: consts certification ignores sort constraints given in
6990 signature declarations. (This information is not relevant to the
6991 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6992 potential INCOMPATIBILITY.
6994 * Pure: axiomatic type classes are now purely definitional, with
6995 explicit proofs of class axioms and super class relations performed
6996 internally. See Pure/axclass.ML for the main internal interfaces --
6997 notably AxClass.define_class supercedes AxClass.add_axclass, and
6998 AxClass.axiomatize_class/classrel/arity supersede
6999 Sign.add_classes/classrel/arities.
7001 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
7002 global/local versions on theory vs. Proof.context have been
7003 discontinued; Attrib.syntax and Method.syntax have been adapted
7004 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
7005 attributes, methods, etc.
7007 * Pure: several functions of signature "... -> theory -> theory * ..."
7008 have been reoriented to "... -> theory -> ... * theory" in order to
7009 allow natural usage in combination with the ||>, ||>>, |-> and
7010 fold_map combinators.
7012 * Pure: official theorem names (closed derivations) and additional
7013 comments (tags) are now strictly separate. Name hints -- which are
7014 maintained as tags -- may be attached any time without affecting the
7017 * Pure: primitive rule lift_rule now takes goal cterm instead of an
7018 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
7019 achieve the old behaviour.
7021 * Pure: the "Goal" constant is now called "prop", supporting a
7022 slightly more general idea of ``protecting'' meta-level rule
7025 * Pure: Logic.(un)varify only works in a global context, which is now
7026 enforced instead of silently assumed. INCOMPATIBILITY, may use
7027 Logic.legacy_(un)varify as temporary workaround.
7029 * Pure: structure Name provides scalable operations for generating
7030 internal variable names, notably Name.variants etc. This replaces
7031 some popular functions from term.ML:
7033 Term.variant -> Name.variant
7034 Term.variantlist -> Name.variant_list
7035 Term.invent_names -> Name.invent_list
7037 Note that low-level renaming rarely occurs in new code -- operations
7038 from structure Variable are used instead (see below).
7040 * Pure: structure Variable provides fundamental operations for proper
7041 treatment of fixed/schematic variables in a context. For example,
7042 Variable.import introduces fixes for schematics of given facts and
7043 Variable.export reverses the effect (up to renaming) -- this replaces
7044 various freeze_thaw operations.
7046 * Pure: structure Goal provides simple interfaces for
7047 init/conclude/finish and tactical prove operations (replacing former
7048 Tactic.prove). Goal.prove is the canonical way to prove results
7049 within a given context; Goal.prove_global is a degraded version for
7050 theory level goals, including a global Drule.standard. Note that
7051 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7052 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7053 in a locale context).
7055 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7056 and type checking (Syntax.check_term etc.), with common combinations
7057 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7058 which are considered legacy and await removal.
7060 * Pure/Syntax: generic interfaces for type unchecking
7061 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7062 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7063 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7064 available for convenience, but refer to the very same operations using
7065 a mere theory instead of a full context.
7067 * Isar: simplified treatment of user-level errors, using exception
7068 ERROR of string uniformly. Function error now merely raises ERROR,
7069 without any side effect on output channels. The Isar toplevel takes
7070 care of proper display of ERROR exceptions. ML code may use plain
7071 handle/can/try; cat_error may be used to concatenate errors like this:
7073 ... handle ERROR msg => cat_error msg "..."
7075 Toplevel ML code (run directly or through the Isar toplevel) may be
7076 embedded into the Isar toplevel with exception display/debug like
7079 Isar.toplevel (fn () => ...)
7081 INCOMPATIBILITY, removed special transform_error facilities, removed
7082 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7083 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7084 -- use plain ERROR instead.
7086 * Isar: theory setup now has type (theory -> theory), instead of a
7087 list. INCOMPATIBILITY, may use #> to compose setup functions.
7089 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7090 ProofContext.debug/verbose flags.
7092 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7093 theory before entering a proof state. Transactions now always see a
7094 quasi-functional intermediate checkpoint, both in interactive and
7097 * Isar: simplified interfaces for outer syntax. Renamed
7098 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7099 OuterSyntax.add_parsers -- this functionality is now included in
7100 OuterSyntax.command etc. INCOMPATIBILITY.
7102 * Simplifier: the simpset of a running simplification process now
7103 contains a proof context (cf. Simplifier.the_context), which is the
7104 very context that the initial simpset has been retrieved from (by
7105 simpset_of/local_simpset_of). Consequently, all plug-in components
7106 (solver, looper etc.) may depend on arbitrary proof data.
7108 * Simplifier.inherit_context inherits the proof context (plus the
7109 local bounds) of the current simplification process; any simproc
7110 etc. that calls the Simplifier recursively should do this! Removed
7111 former Simplifier.inherit_bounds, which is already included here --
7112 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7113 specify an explicit context using Simplifier.context/theory_context.
7115 * Simplifier/Classical Reasoner: more abstract interfaces
7116 change_simpset/claset for modifying the simpset/claset reference of a
7117 theory; raw versions simpset/claset_ref etc. have been discontinued --
7120 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7126 * settings: the default heap location within ISABELLE_HOME_USER now
7127 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7128 Isabelle installations.
7130 * isabelle-process: option -S (secure mode) disables some critical
7131 operations, notably runtime compilation and evaluation of ML source
7134 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7136 * Support for parallel execution, using native multicore support of
7137 Poly/ML 5.1. The theory loader exploits parallelism when processing
7138 independent theories, according to the given theory header
7139 specifications. The maximum number of worker threads is specified via
7140 usedir option -M or the "max-threads" setting in Proof General. A
7141 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7142 to 6 on a 8-core machine. User-code needs to observe certain
7143 guidelines for thread-safe programming, see appendix A in the Isar
7144 Implementation manual.
7148 New in Isabelle2005 (October 2005)
7149 ----------------------------------
7153 * Theory headers: the new header syntax for Isar theories is
7156 imports <theory1> ... <theoryN>
7157 uses <file1> ... <fileM>
7160 where the 'uses' part is optional. The previous syntax
7162 theory <name> = <theory1> + ... + <theoryN>:
7164 will disappear in the next release. Use isatool fixheaders to convert
7165 existing theory files. Note that there is no change in ancient
7166 non-Isar theories now, but these will disappear soon.
7168 * Theory loader: parent theories can now also be referred to via
7169 relative and absolute paths.
7171 * Command 'find_theorems' searches for a list of criteria instead of a
7172 list of constants. Known criteria are: intro, elim, dest, name:string,
7173 simp:term, and any term. Criteria can be preceded by '-' to select
7174 theorems that do not match. Intro, elim, dest select theorems that
7175 match the current goal, name:s selects theorems whose fully qualified
7176 name contain s, and simp:term selects all simplification rules whose
7177 lhs match term. Any other term is interpreted as pattern and selects
7178 all theorems matching the pattern. Available in ProofGeneral under
7179 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7181 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7183 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7184 matching the current goal as introduction rule and not having "HOL."
7185 in their name (i.e. not being defined in theory HOL).
7187 * Command 'thms_containing' has been discontinued in favour of
7188 'find_theorems'; INCOMPATIBILITY.
7190 * Communication with Proof General is now 8bit clean, which means that
7191 Unicode text in UTF-8 encoding may be used within theory texts (both
7192 formal and informal parts). Cf. option -U of the Isabelle Proof
7193 General interface. Here are some simple examples (cf. src/HOL/ex):
7195 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7196 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7198 * Improved efficiency of the Simplifier and, to a lesser degree, the
7199 Classical Reasoner. Typical big applications run around 2 times
7203 *** Document preparation ***
7205 * Commands 'display_drafts' and 'print_drafts' perform simple output
7206 of raw sources. Only those symbols that do not require additional
7207 LaTeX packages (depending on comments in isabellesym.sty) are
7208 displayed properly, everything else is left verbatim. isatool display
7209 and isatool print are used as front ends (these are subject to the
7210 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7212 * Command tags control specific markup of certain regions of text,
7213 notably folding and hiding. Predefined tags include "theory" (for
7214 theory begin and end), "proof" for proof commands, and "ML" for
7215 commands involving ML code; the additional tags "visible" and
7216 "invisible" are unused by default. Users may give explicit tag
7217 specifications in the text, e.g. ''by %invisible (auto)''. The
7218 interpretation of tags is determined by the LaTeX job during document
7219 preparation: see option -V of isatool usedir, or options -n and -t of
7220 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7223 Several document versions may be produced at the same time via isatool
7224 usedir (the generated index.html will link all of them). Typical
7225 specifications include ''-V document=theory,proof,ML'' to present
7226 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7227 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7228 these parts without any formal replacement text. The Isabelle site
7229 default settings produce ''document'' and ''outline'' versions as
7232 * Several new antiquotations:
7234 @{term_type term} prints a term with its type annotated;
7236 @{typeof term} prints the type of a term;
7238 @{const const} is the same as @{term const}, but checks that the
7239 argument is a known logical constant;
7241 @{term_style style term} and @{thm_style style thm} print a term or
7242 theorem applying a "style" to it
7246 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7247 definitions, equations, inequations etc., 'concl' printing only the
7248 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7249 to print the specified premise. TermStyle.add_style provides an ML
7250 interface for introducing further styles. See also the "LaTeX Sugar"
7251 document practical applications. The ML antiquotation prints
7252 type-checked ML expressions verbatim.
7254 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7255 and 'text' support optional locale specification '(in loc)', which
7256 specifies the default context for interpreting antiquotations. For
7257 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7259 * Option 'locale=NAME' of antiquotations specifies an alternative
7260 context interpreting the subsequent argument. For example: @{thm
7261 [locale=lattice] inf_assoc}.
7263 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7266 * Proper output of antiquotations for theory commands involving a
7267 proof context (such as 'locale' or 'theorem (in loc) ...').
7269 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7270 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7272 * isatool usedir: new option -C (default true) controls whether option
7273 -D should include a copy of the original document directory; -C false
7274 prevents unwanted effects such as copying of administrative CVS data.
7279 * Considerably improved version of 'constdefs' command. Now performs
7280 automatic type-inference of declared constants; additional support for
7281 local structure declarations (cf. locales and HOL records), see also
7282 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7283 sequential dependencies of definitions within a single 'constdefs'
7284 section; moreover, the declared name needs to be an identifier. If
7285 all fails, consider to fall back on 'consts' and 'defs' separately.
7287 * Improved indexed syntax and implicit structures. First of all,
7288 indexed syntax provides a notational device for subscripted
7289 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7290 expressions. Secondly, in a local context with structure
7291 declarations, number indexes \<^sub>n or the empty index (default
7292 number 1) refer to a certain fixed variable implicitly; option
7293 show_structs controls printing of implicit structures. Typical
7294 applications of these concepts involve record types and locales.
7296 * New command 'no_syntax' removes grammar declarations (and
7297 translations) resulting from the given syntax specification, which is
7298 interpreted in the same manner as for the 'syntax' command.
7300 * 'Advanced' translation functions (parse_translation etc.) may depend
7301 on the signature of the theory context being presently used for
7302 parsing/printing, see also isar-ref manual.
7304 * Improved 'oracle' command provides a type-safe interface to turn an
7305 ML expression of type theory -> T -> term into a primitive rule of
7306 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7307 is already included here); see also FOL/ex/IffExample.thy;
7310 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7311 before); "cI" is no longer bound, use "c.intro" instead.
7312 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7313 axclasses vs. locales.
7315 * Improved internal renaming of symbolic identifiers -- attach primes
7316 instead of base 26 numbers.
7318 * New flag show_question_marks controls printing of leading question
7319 marks in schematic variable names.
7321 * In schematic variable names, *any* symbol following \<^isub> or
7322 \<^isup> is now treated as part of the base name. For example, the
7323 following works without printing of awkward ".0" indexes:
7325 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7328 * Inner syntax includes (*(*nested*) comments*).
7330 * Pretty printer now supports unbreakable blocks, specified in mixfix
7331 annotations as "(00...)".
7333 * Clear separation of logical types and nonterminals, where the latter
7334 may only occur in 'syntax' specifications or type abbreviations.
7335 Before that distinction was only partially implemented via type class
7336 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7337 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7338 exotic syntax specifications may require further adaption
7339 (e.g. Cube/Cube.thy).
7341 * Removed obsolete type class "logic", use the top sort {} instead.
7342 Note that non-logical types should be declared as 'nonterminals'
7343 rather than 'types'. INCOMPATIBILITY for new object-logic
7346 * Attributes 'induct' and 'cases': type or set names may now be
7347 locally fixed variables as well.
7349 * Simplifier: can now control the depth to which conditional rewriting
7350 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7353 * Simplifier: simplification procedures may now take the current
7354 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7355 interface), which is very useful for calling the Simplifier
7356 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7357 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7358 low-level mk_simproc no longer applies Logic.varify internally, to
7359 allow for use in a context of fixed variables.
7361 * thin_tac now works even if the assumption being deleted contains !!
7362 or ==>. More generally, erule now works even if the major premise of
7363 the elimination rule contains !! or ==>.
7365 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7367 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7368 from Pure, which contains all common declarations already. Both
7369 theories are defined via plain Isabelle/Isar .thy files.
7370 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7371 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7372 use isatool fixcpure to adapt your theory and ML sources.
7374 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7375 selections of theorems in named facts via index ranges.
7377 * 'print_theorems': in theory mode, really print the difference
7378 wrt. the last state (works for interactive theory development only),
7379 in proof mode print all local facts (cf. 'print_facts');
7381 * 'hide': option '(open)' hides only base names.
7383 * More efficient treatment of intermediate checkpoints in interactive
7386 * Code generator is now invoked via code_module (incremental code
7387 generation) and code_library (modular code generation, ML structures
7388 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7389 must be quoted when used as identifiers.
7391 * New 'value' command for reading, evaluating and printing terms using
7392 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7393 quoted when used as identifier.
7398 * New commands for the interpretation of locale expressions in
7399 theories (1), locales (2) and proof contexts (3). These generate
7400 proof obligations from the expression specification. After the
7401 obligations have been discharged, theorems of the expression are added
7402 to the theory, target locale or proof context. The synopsis of the
7403 commands is a follows:
7405 (1) interpretation expr inst
7406 (2) interpretation target < expr
7407 (3) interpret expr inst
7409 Interpretation in theories and proof contexts require a parameter
7410 instantiation of terms from the current context. This is applied to
7411 specifications and theorems of the interpreted expression.
7412 Interpretation in locales only permits parameter renaming through the
7413 locale expression. Interpretation is smart in that interpretations
7414 that are active already do not occur in proof obligations, neither are
7415 instantiated theorems stored in duplicate. Use 'print_interps' to
7416 inspect active interpretations of a particular locale. For details,
7417 see the Isar Reference manual. Examples can be found in
7418 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7420 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7421 'interpret' instead.
7423 * New context element 'constrains' for adding type constraints to
7426 * Context expressions: renaming of parameters with syntax
7429 * Locale declaration: 'includes' disallowed.
7431 * Proper static binding of attribute syntax -- i.e. types / terms /
7432 facts mentioned as arguments are always those of the locale definition
7433 context, independently of the context of later invocations. Moreover,
7434 locale operations (renaming and type / term instantiation) are applied
7435 to attribute arguments as expected.
7437 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7438 actual attributes; rare situations may require Attrib.attribute to
7439 embed those attributes into Attrib.src that lack concrete syntax.
7440 Attribute implementations need to cooperate properly with the static
7441 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7442 Attrib.XXX_thm etc. already do the right thing without further
7443 intervention. Only unusual applications -- such as "where" or "of"
7444 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7445 on the context and the facts involved -- may have to assign parsed
7446 values to argument tokens explicitly.
7448 * Changed parameter management in theorem generation for long goal
7449 statements with 'includes'. INCOMPATIBILITY: produces a different
7450 theorem statement in rare situations.
7452 * Locale inspection command 'print_locale' omits notes elements. Use
7453 'print_locale!' to have them included in the output.
7458 * Provers/hypsubst.ML: improved version of the subst method, for
7459 single-step rewriting: it now works in bound variable contexts. New is
7460 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7461 rewrite a different subterm than the original subst method, which is
7462 still available as 'simplesubst'.
7464 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7467 * Provers/trancl.ML: new transitivity reasoner for transitive and
7468 reflexive-transitive closure of relations.
7470 * Provers/blast.ML: new reference depth_limit to make blast's depth
7471 limit (previously hard-coded with a value of 20) user-definable.
7473 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7474 is peformed already. Object-logics merely need to finish their
7475 initial simpset configuration as before. INCOMPATIBILITY.
7480 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7483 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7485 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7486 and x-symbol; use option '-m epsilon' to get it actually printed.
7487 Moreover, the mathematically important symbolic identifier \<epsilon>
7488 becomes available as variable, constant etc. INCOMPATIBILITY,
7490 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7491 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7492 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7493 support corresponding Isar calculations.
7495 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7498 * theory SetInterval: changed the syntax for open intervals:
7507 The old syntax is still supported but will disappear in the next
7508 release. For conversion use the following Emacs search and replace
7509 patterns (these are not perfect but work quite well):
7511 {)\([^\.]*\)\.\. -> {\1<\.\.}
7512 \.\.\([^(}]*\)(} -> \.\.<\1}
7514 * Theory Commutative_Ring (in Library): method comm_ring for proving
7515 equalities in commutative rings; method 'algebra' provides a generic
7518 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7519 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7520 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7523 Some new syntax forms are available:
7525 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7526 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7527 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7528 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7530 The latter form "\<Sum>x < k. e" used to be based on a separate
7531 function "Summation", which has been discontinued.
7533 * theory Finite_Set: in structured induction proofs, the insert case
7534 is now 'case (insert x F)' instead of the old counterintuitive 'case
7537 * The 'refute' command has been extended to support a much larger
7538 fragment of HOL, including axiomatic type classes, constdefs and
7539 typedefs, inductive datatypes and recursion.
7541 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7542 Requires zChaff with proof generation to be installed. See
7543 HOL/ex/SAT_Examples.thy for examples.
7545 * Datatype induction via method 'induct' now preserves the name of the
7546 induction variable. For example, when proving P(xs::'a list) by
7547 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7548 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7549 in unstructured proof scripts.
7551 * Reworked implementation of records. Improved scalability for
7552 records with many fields, avoiding performance problems for type
7553 inference. Records are no longer composed of nested field types, but
7554 of nested extension types. Therefore the record type only grows linear
7555 in the number of extensions and not in the number of fields. The
7556 top-level (users) view on records is preserved. Potential
7557 INCOMPATIBILITY only in strange cases, where the theory depends on the
7558 old record representation. The type generated for a record is called
7559 <record_name>_ext_type.
7561 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7562 proofs triggered by a record definition or a simproc (if
7563 quick_and_dirty is enabled). Definitions of large records can take
7566 New simproc record_upd_simproc for simplification of multiple record
7567 updates enabled by default. Moreover, trivial updates are also
7568 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7569 occasionally, since simplification is more powerful by default.
7571 * typedef: proper support for polymorphic sets, which contain extra
7572 type-variables in the term.
7574 * Simplifier: automatically reasons about transitivity chains
7575 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7576 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7577 old proofs break occasionally as simplification may now solve more
7578 goals than previously.
7580 * Simplifier: converts x <= y into x = y if assumption y <= x is
7581 present. Works for all partial orders (class "order"), in particular
7582 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7585 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7586 bound variable or a constant then the let is unfolded. Otherwise
7587 first a is simplified to b, and then f b is simplified to g. If
7588 possible we abstract b from g arriving at "let x = b in h x",
7589 otherwise we unfold the let and arrive at g. The simproc can be
7590 enabled/disabled by the reference use_let_simproc. Potential
7591 INCOMPATIBILITY since simplification is more powerful by default.
7593 * Classical reasoning: the meson method now accepts theorems as arguments.
7595 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7596 jobs to provide advice on the provability of subgoals.
7598 * Theory OrderedGroup and Ring_and_Field: various additions and
7599 improvements to faciliate calculations involving equalities and
7602 The following theorems have been eliminated or modified
7605 abs_eq now named abs_of_nonneg
7606 abs_of_ge_0 now named abs_of_nonneg
7607 abs_minus_eq now named abs_of_nonpos
7608 imp_abs_id now named abs_of_nonneg
7609 imp_abs_neg_id now named abs_of_nonpos
7610 mult_pos now named mult_pos_pos
7611 mult_pos_le now named mult_nonneg_nonneg
7612 mult_pos_neg_le now named mult_nonneg_nonpos
7613 mult_pos_neg2_le now named mult_nonneg_nonpos2
7614 mult_neg now named mult_neg_neg
7615 mult_neg_le now named mult_nonpos_nonpos
7617 * The following lemmas in Ring_and_Field have been added to the simplifier:
7620 not_square_less_zero
7622 The following lemmas have been deleted from Real/RealPow:
7632 * Theory Parity: added rules for simplifying exponents.
7636 The following theorems have been eliminated or modified
7639 list_all_Nil now named list_all.simps(1)
7640 list_all_Cons now named list_all.simps(2)
7641 list_all_conv now named list_all_iff
7642 set_mem_eq now named mem_iff
7644 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7645 asymptotic "big O" calculations. See the notes in BigO.thy.
7650 * Theory RealDef: better support for embedding natural numbers and
7651 integers in the reals.
7653 The following theorems have been eliminated or modified
7656 exp_ge_add_one_self now requires no hypotheses
7657 real_of_int_add reversed direction of equality (use [symmetric])
7658 real_of_int_minus reversed direction of equality (use [symmetric])
7659 real_of_int_diff reversed direction of equality (use [symmetric])
7660 real_of_int_mult reversed direction of equality (use [symmetric])
7662 * Theory RComplete: expanded support for floor and ceiling functions.
7664 * Theory Ln is new, with properties of the natural logarithm
7666 * Hyperreal: There is a new type constructor "star" for making
7667 nonstandard types. The old type names are now type synonyms:
7671 hcomplex = complex star
7673 * Hyperreal: Many groups of similarly-defined constants have been
7674 replaced by polymorphic versions (INCOMPATIBILITY):
7676 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7678 starset <-- starsetNat, starsetC
7679 *s* <-- *sNat*, *sc*
7680 starset_n <-- starsetNat_n, starsetC_n
7681 *sn* <-- *sNatn*, *scn*
7682 InternalSets <-- InternalNatSets, InternalCSets
7684 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7685 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7686 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7687 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7688 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7690 * Hyperreal: Many type-specific theorems have been removed in favor of
7691 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7693 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7694 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7695 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7696 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7697 right_minus <-- hypreal_add_minus
7698 left_minus <-- {hypreal,hcomplex}_add_minus_left
7699 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7700 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7701 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7702 mult_1_right <-- hcomplex_mult_one_right
7703 mult_zero_left <-- hcomplex_mult_zero_left
7704 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7705 right_distrib <-- hypnat_add_mult_distrib2
7706 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7707 right_inverse <-- hypreal_mult_inverse
7708 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7709 order_refl <-- {hypreal,hypnat}_le_refl
7710 order_trans <-- {hypreal,hypnat}_le_trans
7711 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7712 order_less_le <-- {hypreal,hypnat}_less_le
7713 linorder_linear <-- {hypreal,hypnat}_le_linear
7714 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7715 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7716 add_nonneg_nonneg <-- hypreal_le_add_order
7718 * Hyperreal: Separate theorems having to do with type-specific
7719 versions of constants have been merged into theorems that apply to the
7720 new polymorphic constants (INCOMPATIBILITY):
7722 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7723 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7724 STAR_Un <-- {STAR,NatStar,STARC}_Un
7725 STAR_Int <-- {STAR,NatStar,STARC}_Int
7726 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7727 STAR_subset <-- {STAR,NatStar,STARC}_subset
7728 STAR_mem <-- {STAR,NatStar,STARC}_mem
7729 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7730 STAR_diff <-- {STAR,STARC}_diff
7731 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7732 STARC_hcomplex_of_complex}_image_subset
7733 starset_n_Un <-- starset{Nat,C}_n_Un
7734 starset_n_Int <-- starset{Nat,C}_n_Int
7735 starset_n_Compl <-- starset{Nat,C}_n_Compl
7736 starset_n_diff <-- starset{Nat,C}_n_diff
7737 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7738 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7739 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7740 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7741 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7742 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7743 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7744 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7745 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7746 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7747 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7748 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7749 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7750 starfun_diff <-- starfun{C,RC,CR}_diff
7751 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7752 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7753 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7754 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7755 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7756 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7757 starfun_Id <-- starfunC_Id
7758 starfun_approx <-- starfun{Nat,CR}_approx
7759 starfun_capprox <-- starfun{C,RC}_capprox
7760 starfun_abs <-- starfunNat_rabs
7761 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7762 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7763 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7764 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7765 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7766 starfun_add_approx <-- starfunCR_add_approx
7767 starfun_inverse_inverse <-- starfunC_inverse_inverse
7768 starfun_divide <-- starfun{C,CR,RC}_divide
7769 starfun_n <-- starfun{Nat,C}_n
7770 starfun_n_mult <-- starfun{Nat,C}_n_mult
7771 starfun_n_add <-- starfun{Nat,C}_n_add
7772 starfun_n_add_minus <-- starfunNat_n_add_minus
7773 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7774 starfun_n_minus <-- starfun{Nat,C}_n_minus
7775 starfun_n_eq <-- starfun{Nat,C}_n_eq
7777 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7778 star_n_minus <-- {hypreal,hcomplex}_minus
7779 star_n_diff <-- {hypreal,hcomplex}_diff
7780 star_n_mult <-- {hypreal,hcomplex}_mult
7781 star_n_inverse <-- {hypreal,hcomplex}_inverse
7782 star_n_le <-- {hypreal,hypnat}_le
7783 star_n_less <-- {hypreal,hypnat}_less
7784 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7785 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7786 star_n_abs <-- hypreal_hrabs
7787 star_n_divide <-- hcomplex_divide
7789 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7790 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7791 star_of_diff <-- hypreal_of_real_diff
7792 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7793 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7794 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7795 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7796 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7797 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7798 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7799 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7800 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7801 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7802 star_of_number_of <-- {hypreal,hcomplex}_number_of
7803 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7804 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7805 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7806 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7807 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7808 star_of_power <-- hypreal_of_real_power
7809 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7811 * Hyperreal: new method "transfer" that implements the transfer
7812 principle of nonstandard analysis. With a subgoal that mentions
7813 nonstandard types like "'a star", the command "apply transfer"
7814 replaces it with an equivalent one that mentions only standard types.
7815 To be successful, all free variables must have standard types; non-
7816 standard variables must have explicit universal quantifiers.
7818 * Hyperreal: A theory of Taylor series.
7823 * Discontinued special version of 'constdefs' (which used to support
7824 continuous functions) in favor of the general Pure one with full
7827 * New simplification procedure for solving continuity conditions; it
7828 is much faster on terms with many nested lambda abstractions (cubic
7829 instead of exponential time).
7831 * New syntax for domain package: selector names are now optional.
7832 Parentheses should be omitted unless argument is lazy, for example:
7834 domain 'a stream = cons "'a" (lazy "'a stream")
7836 * New command 'fixrec' for defining recursive functions with pattern
7837 matching; defining multiple functions with mutual recursion is also
7838 supported. Patterns may include the constants cpair, spair, up, sinl,
7839 sinr, or any data constructor defined by the domain package. The given
7840 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7841 syntax and examples.
7843 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7844 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7845 but the proof obligation additionally includes an admissibility
7846 requirement. The packages generate instances of class cpo or pcpo,
7847 with continuity and strictness theorems for Rep and Abs.
7849 * HOLCF: Many theorems have been renamed according to a more standard naming
7850 scheme (INCOMPATIBILITY):
7852 foo_inject: "foo$x = foo$y ==> x = y"
7853 foo_eq: "(foo$x = foo$y) = (x = y)"
7854 foo_less: "(foo$x << foo$y) = (x << y)"
7855 foo_strict: "foo$UU = UU"
7856 foo_defined: "... ==> foo$x ~= UU"
7857 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7862 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7863 including the First Isomorphism Theorem (on quotienting by the kernel
7866 * ZF/Simplifier: install second copy of type solver that actually
7867 makes use of TC rules declared to Isar proof contexts (or locales);
7868 the old version is still required for ML proof scripts.
7873 * Converted to Isar theory format; use locales instead of axiomatic
7879 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7882 * Pure/library.ML no longer defines its own option datatype, but uses
7883 that of the SML basis, which has constructors NONE and SOME instead of
7884 None and Some, as well as exception Option.Option instead of OPTION.
7885 The functions the, if_none, is_some, is_none have been adapted
7886 accordingly, while Option.map replaces apsome.
7888 * Pure/library.ML: the exception LIST has been given up in favour of
7889 the standard exceptions Empty and Subscript, as well as
7890 Library.UnequalLengths. Function like Library.hd and Library.tl are
7891 superceded by the standard hd and tl functions etc.
7893 A number of basic list functions are no longer exported to the ML
7894 toplevel, as they are variants of predefined functions. The following
7895 suggests how one can translate existing code:
7897 rev_append xs ys = List.revAppend (xs, ys)
7898 nth_elem (i, xs) = List.nth (xs, i)
7899 last_elem xs = List.last xs
7900 flat xss = List.concat xss
7901 seq fs = List.app fs
7902 partition P xs = List.partition P xs
7903 mapfilter f xs = List.mapPartial f xs
7905 * Pure/library.ML: several combinators for linear functional
7906 transformations, notably reverse application and composition:
7909 (x, y) |-> f f #-> g
7911 * Pure/library.ML: introduced/changed precedence of infix operators:
7913 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7915 infix 3 o oo ooo oooo;
7916 infix 4 ~~ upto downto;
7918 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7921 * Pure/library.ML: natural list combinators fold, fold_rev, and
7922 fold_map support linear functional transformations and nesting. For
7925 fold f [x1, ..., xN] y =
7926 y |> f x1 |> ... |> f xN
7928 (fold o fold) f [xs1, ..., xsN] y =
7929 y |> fold f xs1 |> ... |> fold f xsN
7931 fold f [x1, ..., xN] =
7934 (fold o fold) f [xs1, ..., xsN] =
7935 fold f xs1 #> ... #> fold f xsN
7937 * Pure/library.ML: the following selectors on type 'a option are
7940 the: 'a option -> 'a (*partial*)
7941 these: 'a option -> 'a where 'a = 'b list
7942 the_default: 'a -> 'a option -> 'a
7943 the_list: 'a option -> 'a list
7945 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7946 basic operations for association lists, following natural argument
7947 order; moreover the explicit equality predicate passed here avoids
7948 potentially expensive polymorphic runtime equality checks.
7949 The old functions may be expressed as follows:
7951 assoc = uncurry (AList.lookup (op =))
7952 assocs = these oo AList.lookup (op =)
7953 overwrite = uncurry (AList.update (op =)) o swap
7955 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7957 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7958 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7960 replacing make_keylist and keyfilter (occassionally used)
7963 make_keylist = AList.make
7964 keyfilter = AList.find (op =)
7966 * eq_fst and eq_snd now take explicit equality parameter, thus
7967 avoiding eqtypes. Naive rewrites:
7969 eq_fst = eq_fst (op =)
7970 eq_snd = eq_snd (op =)
7972 * Removed deprecated apl and apr (rarely used).
7975 apl (n, op) =>>= curry op n
7976 apr (op, m) =>>= fn n => op (n, m)
7978 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7979 provides a reasonably efficient light-weight implementation of sets as
7982 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7983 few new operations; existing lookup and update are now curried to
7984 follow natural argument order (for use with fold etc.);
7985 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7987 * Pure/General: output via the Isabelle channels of
7988 writeln/warning/error etc. is now passed through Output.output, with a
7989 hook for arbitrary transformations depending on the print_mode
7990 (cf. Output.add_mode -- the first active mode that provides a output
7991 function wins). Already formatted output may be embedded into further
7992 text via Output.raw; the result of Pretty.string_of/str_of and derived
7993 functions (string_of_term/cterm/thm etc.) is already marked raw to
7994 accommodate easy composition of diagnostic messages etc. Programmers
7995 rarely need to care about Output.output or Output.raw at all, with
7996 some notable exceptions: Output.output is required when bypassing the
7997 standard channels (writeln etc.), or in token translations to produce
7998 properly formatted results; Output.raw is required when capturing
7999 already output material that will eventually be presented to the user
8000 a second time. For the default print mode, both Output.output and
8001 Output.raw have no effect.
8003 * Pure/General: Output.time_accumulator NAME creates an operator ('a
8004 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
8005 cumulative results are displayed at the end of a batch session.
8007 * Pure/General: File.sysify_path and File.quote_sysify path have been
8008 replaced by File.platform_path and File.shell_path (with appropriate
8009 hooks). This provides a clean interface for unusual systems where the
8010 internal and external process view of file names are different.
8012 * Pure: more efficient orders for basic syntactic entities: added
8013 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
8014 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
8015 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
8016 orders now -- potential INCOMPATIBILITY for code that depends on a
8017 particular order for Symtab.keys, Symtab.dest, etc. (consider using
8018 Library.sort_strings on result).
8020 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
8021 fold_types traverse types/terms from left to right, observing natural
8022 argument order. Supercedes previous foldl_XXX versions, add_frees,
8023 add_vars etc. have been adapted as well: INCOMPATIBILITY.
8025 * Pure: name spaces have been refined, with significant changes of the
8026 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
8027 to extern(_table). The plain name entry path is superceded by a
8028 general 'naming' context, which also includes the 'policy' to produce
8029 a fully qualified name and external accesses of a fully qualified
8030 name; NameSpace.extend is superceded by context dependent
8031 Sign.declare_name. Several theory and proof context operations modify
8032 the naming context. Especially note Theory.restore_naming and
8033 ProofContext.restore_naming to get back to a sane state; note that
8034 Theory.add_path is no longer sufficient to recover from
8035 Theory.absolute_path in particular.
8037 * Pure: new flags short_names (default false) and unique_names
8038 (default true) for controlling output of qualified names. If
8039 short_names is set, names are printed unqualified. If unique_names is
8040 reset, the name prefix is reduced to the minimum required to achieve
8041 the original result when interning again, even if there is an overlap
8042 with earlier declarations.
8044 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8045 now 'extend', and 'merge' gets an additional Pretty.pp argument
8046 (useful for printing error messages). INCOMPATIBILITY.
8048 * Pure: major reorganization of the theory context. Type Sign.sg and
8049 Theory.theory are now identified, referring to the universal
8050 Context.theory (see Pure/context.ML). Actual signature and theory
8051 content is managed as theory data. The old code and interfaces were
8052 spread over many files and structures; the new arrangement introduces
8053 considerable INCOMPATIBILITY to gain more clarity:
8055 Context -- theory management operations (name, identity, inclusion,
8056 parents, ancestors, merge, etc.), plus generic theory data;
8058 Sign -- logical signature and syntax operations (declaring consts,
8059 types, etc.), plus certify/read for common entities;
8061 Theory -- logical theory operations (stating axioms, definitions,
8062 oracles), plus a copy of logical signature operations (consts,
8063 types, etc.); also a few basic management operations (Theory.copy,
8066 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8067 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8068 for convenience -- they merely return the theory.
8070 * Pure: type Type.tsig is superceded by theory in most interfaces.
8072 * Pure: the Isar proof context type is already defined early in Pure
8073 as Context.proof (note that ProofContext.context and Proof.context are
8074 aliases, where the latter is the preferred name). This enables other
8075 Isabelle components to refer to that type even before Isar is present.
8077 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8078 typeK, constK, axiomK, oracleK), but provide explicit operations for
8079 any of these kinds. For example, Sign.intern typeK is now
8080 Sign.intern_type, Theory.hide_space Sign.typeK is now
8081 Theory.hide_types. Also note that former
8082 Theory.hide_classes/types/consts are now
8083 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8084 internalize their arguments! INCOMPATIBILITY.
8086 * Pure: get_thm interface (of PureThy and ProofContext) expects
8087 datatype thmref (with constructors Name and NameSelection) instead of
8088 plain string -- INCOMPATIBILITY;
8090 * Pure: cases produced by proof methods specify options, where NONE
8091 means to remove case bindings -- INCOMPATIBILITY in
8094 * Pure: the following operations retrieve axioms or theorems from a
8095 theory node or theory hierarchy, respectively:
8097 Theory.axioms_of: theory -> (string * term) list
8098 Theory.all_axioms_of: theory -> (string * term) list
8099 PureThy.thms_of: theory -> (string * thm) list
8100 PureThy.all_thms_of: theory -> (string * thm) list
8102 * Pure: print_tac now outputs the goal through the trace channel.
8104 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8105 Reference Toplevel.debug (default false) controls detailed printing
8106 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8107 controls execution profiling -- set to 1 for time and 2 for space
8108 (both increase the runtime).
8110 * Isar session: The initial use of ROOT.ML is now always timed,
8111 i.e. the log will show the actual process times, in contrast to the
8112 elapsed wall-clock time that the outer shell wrapper produces.
8114 * Simplifier: improved handling of bound variables (nameless
8115 representation, avoid allocating new strings). Simprocs that invoke
8116 the Simplifier recursively should use Simplifier.inherit_bounds to
8117 avoid local name clashes. Failure to do so produces warnings
8118 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8119 for further details.
8121 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8122 bindings for all theorems stored within a given theory; this may help
8123 in porting non-Isar theories to Isar ones, while keeping ML proof
8124 scripts for the time being.
8126 * ML operator HTML.with_charset specifies the charset begin used for
8127 generated HTML files. For example:
8129 HTML.with_charset "utf-8" use_thy "Hebrew";
8130 HTML.with_charset "utf-8" use_thy "Chinese";
8135 * Allow symlinks to all proper Isabelle executables (Isabelle,
8136 isabelle, isatool etc.).
8138 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8139 isatool doc, isatool mkdir, display_drafts etc.).
8141 * isatool usedir: option -f allows specification of the ML file to be
8142 used by Isabelle; default is ROOT.ML.
8144 * New isatool version outputs the version identifier of the Isabelle
8145 distribution being used.
8147 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8148 (containing Boolean satisfiability problems) into Isabelle/HOL
8153 New in Isabelle2004 (April 2004)
8154 --------------------------------
8158 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8159 Replaces linorder.ML.
8161 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8162 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8163 (\<a>...\<z>), are now considered normal letters, and can therefore
8164 be used anywhere where an ASCII letter (a...zA...Z) has until
8165 now. COMPATIBILITY: This obviously changes the parsing of some
8166 terms, especially where a symbol has been used as a binder, say
8167 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8168 as an identifier. Fix it by inserting a space around former
8169 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8170 existing theory and ML files.
8172 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8174 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8175 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8176 a normal (but invisible) letter. For multiple letter subscripts repeat
8177 \<^isub> like this: x\<^isub>1\<^isub>2.
8179 * Pure: There are now sub-/superscripts that can span more than one
8180 character. Text between \<^bsub> and \<^esub> is set in subscript in
8181 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8182 superscript. The new control characters are not identifier parts.
8184 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8185 content of "..." to the latex file instead of \isacntrl... . The "..."
8186 may consist of any printable characters excluding the end bracket >.
8188 * Pure: Using new Isar command "finalconsts" (or the ML functions
8189 Theory.add_finals or Theory.add_finals_i) it is now possible to
8190 declare constants "final", which prevents their being given a definition
8191 later. It is useful for constants whose behaviour is fixed axiomatically
8192 rather than definitionally, such as the meta-logic connectives.
8194 * Pure: 'instance' now handles general arities with general sorts
8195 (i.e. intersections of classes),
8197 * Presentation: generated HTML now uses a CSS style sheet to make layout
8198 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8199 It can be changed to alter the colors/layout of generated pages.
8204 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8205 cut_tac, subgoal_tac and thin_tac:
8206 - Now understand static (Isar) contexts. As a consequence, users of Isar
8207 locales are no longer forced to write Isar proof scripts.
8208 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8210 - INCOMPATIBILITY: names of variables to be instantiated may no
8211 longer be enclosed in quotes. Instead, precede variable name with `?'.
8212 This is consistent with the instantiation attribute "where".
8214 * Attributes "where" and "of":
8215 - Now take type variables of instantiated theorem into account when reading
8216 the instantiation string. This fixes a bug that caused instantiated
8217 theorems to have too special types in some circumstances.
8218 - "where" permits explicit instantiations of type variables.
8220 * Calculation commands "moreover" and "also" no longer interfere with
8221 current facts ("this"), admitting arbitrary combinations with "then"
8225 - Goal statements involving the context element "includes" no longer
8226 generate theorems with internal delta predicates (those ending on
8227 "_axioms") in the premise.
8228 Resolve particular premise with <locale>.intro to obtain old form.
8229 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8230 specification and "includes" elements in goal statement.
8231 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8232 [intro?] and [elim?] (respectively) by default.
8233 - Experimental command for instantiation of locales in proof contexts:
8234 instantiate <label>[<attrs>]: <loc>
8235 Instantiates locale <loc> and adds all its theorems to the current context
8236 taking into account their attributes. Label and attrs are optional
8237 modifiers, like in theorem declarations. If present, names of
8238 instantiated theorems are qualified with <label>, and the attributes
8239 <attrs> are applied after any attributes these theorems might have already.
8240 If the locale has assumptions, a chained fact of the form
8241 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8242 are derived. The command does not support old-style locales declared
8243 with "locale (open)".
8244 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8246 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8252 * Proof import: new image HOL4 contains the imported library from
8253 the HOL4 system with about 2500 theorems. It is imported by
8254 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8255 can be used like any other Isabelle image. See
8256 HOL/Import/HOL/README for more information.
8259 - Much improved handling of linear and partial orders.
8260 Reasoners for linear and partial orders are set up for type classes
8261 "linorder" and "order" respectively, and are added to the default simpset
8262 as solvers. This means that the simplifier can build transitivity chains
8263 to solve goals from the assumptions.
8264 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8265 of blast or auto after simplification become unnecessary because the goal
8266 is solved by simplification already.
8268 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8269 all proved in axiomatic type classes for semirings, rings and fields.
8272 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8273 now formalized using the Ring_and_Field theory mentioned above.
8274 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8275 than before, because now they are set up once in a generic manner.
8276 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8277 Look for the general versions in Ring_and_Field (and Power if they concern
8280 * Type "rat" of the rational numbers is now available in HOL-Complex.
8283 - Record types are now by default printed with their type abbreviation
8284 instead of the list of all field types. This can be configured via
8285 the reference "print_record_type_abbr".
8286 - Simproc "record_upd_simproc" for simplification of multiple updates added
8287 (not enabled by default).
8288 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8289 EX x. x = sel r to True (not enabled by default).
8290 - Tactic "record_split_simp_tac" to split and simplify records added.
8292 * 'specification' command added, allowing for definition by
8293 specification. There is also an 'ax_specification' command that
8294 introduces the new constants axiomatically.
8296 * arith(_tac) is now able to generate counterexamples for reals as well.
8298 * HOL-Algebra: new locale "ring" for non-commutative rings.
8300 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8301 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8303 * HOL-Matrix: a first theory for matrices in HOL with an application of
8304 matrix theory to linear programming.
8306 * Unions and Intersections:
8307 The latex output syntax of UN and INT has been changed
8308 from "\Union x \in A. B" to "\Union_{x \in A} B"
8309 i.e. the index formulae has become a subscript.
8310 Similarly for "\Union x. B", and for \Inter instead of \Union.
8312 * Unions and Intersections over Intervals:
8313 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8314 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8315 like in normal math, and corresponding versions for < and for intersection.
8317 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8318 lexicographic dictonary ordering has been added as "lexord".
8320 * ML: the legacy theory structures Int and List have been removed. They had
8321 conflicted with ML Basis Library structures having the same names.
8323 * 'refute' command added to search for (finite) countermodels. Only works
8324 for a fragment of HOL. The installation of an external SAT solver is
8325 highly recommended. See "HOL/Refute.thy" for details.
8327 * 'quickcheck' command: Allows to find counterexamples by evaluating
8328 formulae under an assignment of free variables to random values.
8329 In contrast to 'refute', it can deal with inductive datatypes,
8330 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8336 * Streams now come with concatenation and are part of the HOLCF image
8340 New in Isabelle2003 (May 2003)
8341 ------------------------------
8345 * Provers/simplifier:
8347 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8348 Assumptions are now subject to complete mutual simplification,
8349 not just from left to right. The simplifier now preserves
8350 the order of assumptions.
8352 Potential INCOMPATIBILITY:
8354 -- simp sometimes diverges where the old version did
8355 not, e.g. invoking simp on the goal
8357 [| P (f x); y = x; f x = f y |] ==> Q
8359 now gives rise to the infinite reduction sequence
8361 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8363 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8366 -- Tactics combining classical reasoner and simplification (such as auto)
8367 are also affected by this change, because many of them rely on
8368 simp. They may sometimes diverge as well or yield a different numbers
8369 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8370 in case of problems. Sometimes subsequent calls to the classical
8371 reasoner will fail because a preceeding call to the simplifier too
8372 eagerly simplified the goal, e.g. deleted redundant premises.
8374 - The simplifier trace now shows the names of the applied rewrite rules
8376 - You can limit the number of recursive invocations of the simplifier
8377 during conditional rewriting (where the simplifie tries to solve the
8378 conditions before applying the rewrite rule):
8379 ML "simp_depth_limit := n"
8380 where n is an integer. Thus you can force termination where previously
8381 the simplifier would diverge.
8383 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8385 - No longer aborts on failed congruence proof. Instead, the
8386 congruence is ignored.
8388 * Pure: New generic framework for extracting programs from constructive
8389 proofs. See HOL/Extraction.thy for an example instantiation, as well
8390 as HOL/Extraction for some case studies.
8392 * Pure: The main goal of the proof state is no longer shown by default, only
8393 the subgoals. This behaviour is controlled by a new flag.
8394 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8395 (ML: Proof.show_main_goal).
8397 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8398 rules whose conclusion matches subgoal 1:
8399 PG menu: Isabelle/Isar -> Show me -> matching rules
8400 The rules are ordered by how closely they match the subgoal.
8401 In particular, rules that solve a subgoal outright are displayed first
8402 (or rather last, the way they are printed).
8403 (ML: ProofGeneral.print_intros())
8405 * Pure: New flag trace_unify_fail causes unification to print
8406 diagnostic information (PG: in trace buffer) when it fails. This is
8407 useful for figuring out why single step proofs like rule, erule or
8410 * Pure: Locale specifications now produce predicate definitions
8411 according to the body of text (covering assumptions modulo local
8412 definitions); predicate "loc_axioms" covers newly introduced text,
8413 while "loc" is cumulative wrt. all included locale expressions; the
8414 latter view is presented only on export into the global theory
8415 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8416 on the old view without predicates;
8418 * Pure: predefined locales "var" and "struct" are useful for sharing
8419 parameters (as in CASL, for example); just specify something like
8420 ``var x + var y + struct M'' as import;
8422 * Pure: improved thms_containing: proper indexing of facts instead of
8423 raw theorems; check validity of results wrt. current name space;
8424 include local facts of proof configuration (also covers active
8425 locales), cover fixed variables in index; may use "_" in term
8426 specification; an optional limit for the number of printed facts may
8427 be given (the default is 40);
8429 * Pure: disallow duplicate fact bindings within new-style theory files
8432 * Provers: improved induct method: assumptions introduced by case
8433 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8434 the goal statement); "foo" still refers to all facts collectively;
8436 * Provers: the function blast.overloaded has been removed: all constants
8437 are regarded as potentially overloaded, which improves robustness in exchange
8438 for slight decrease in efficiency;
8440 * Provers/linorder: New generic prover for transitivity reasoning over
8441 linear orders. Note: this prover is not efficient!
8443 * Isar: preview of problems to finish 'show' now produce an error
8444 rather than just a warning (in interactive mode);
8451 - Produces a counter example if it cannot prove a goal.
8452 Note that the counter example may be spurious if the goal is not a formula
8453 of quantifier-free linear arithmetic.
8454 In ProofGeneral the counter example appears in the trace buffer.
8456 - Knows about div k and mod k where k is a numeral of type nat or int.
8458 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8459 linear arithmetic fails. This takes account of quantifiers and divisibility.
8460 Presburger arithmetic can also be called explicitly via presburger(_tac).
8462 * simp's arithmetic capabilities have been enhanced a bit: it now
8463 takes ~= in premises into account (by performing a case split);
8465 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8466 are distributed over a sum of terms;
8468 * New tactic "trans_tac" and method "trans" instantiate
8469 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8472 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8473 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8475 * 'typedef' command has new option "open" to suppress the set
8478 * functions Min and Max on finite sets have been introduced (theory
8481 * attribute [symmetric] now works for relations as well; it turns
8482 (x,y) : R^-1 into (y,x) : R, and vice versa;
8484 * induct over a !!-quantified statement (say !!x1..xn):
8485 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8487 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8488 %x. None. Warning: empty_def now refers to the previously hidden definition
8491 * Algebra: formalization of classical algebra. Intended as base for
8492 any algebraic development in Isabelle. Currently covers group theory
8493 (up to Sylow's theorem) and ring theory (Universal Property of
8494 Univariate Polynomials). Contributions welcome;
8496 * GroupTheory: deleted, since its material has been moved to Algebra;
8498 * Complex: new directory of the complex numbers with numeric constants,
8499 nonstandard complex numbers, and some complex analysis, standard and
8500 nonstandard (Jacques Fleuriot);
8502 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8504 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8507 * Real/HahnBanach: updated and adapted to locales;
8509 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8512 * UNITY: added the Meier-Sanders theory of progress sets;
8514 * MicroJava: bytecode verifier and lightweight bytecode verifier
8515 as abstract algorithms, instantiated to the JVM;
8517 * Bali: Java source language formalization. Type system, operational
8518 semantics, axiomatic semantics. Supported language features:
8519 classes, interfaces, objects,virtual methods, static methods,
8520 static/instance fields, arrays, access modifiers, definite
8521 assignment, exceptions.
8526 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8529 * Main ZF: virtually all theories converted to new-style format;
8534 * Pure: Tactic.prove provides sane interface for internal proofs;
8535 omits the infamous "standard" operation, so this is more appropriate
8536 than prove_goalw_cterm in many situations (e.g. in simprocs);
8538 * Pure: improved error reporting of simprocs;
8540 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8544 *** Document preparation ***
8546 * uses \par instead of \\ for line breaks in theory text. This may
8547 shift some page breaks in large documents. To get the old behaviour
8548 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8550 * minimized dependencies of isabelle.sty and isabellesym.sty on
8553 * \<euro> now needs package babel/greek instead of marvosym (which
8556 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8561 New in Isabelle2002 (March 2002)
8562 --------------------------------
8564 *** Document preparation ***
8566 * greatly simplified document preparation setup, including more
8567 graceful interpretation of isatool usedir -i/-d/-D options, and more
8568 instructive isatool mkdir; users should basically be able to get
8569 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8570 users may run a separate document processing stage manually like this:
8571 "isatool usedir -D output HOL Test && isatool document Test/output";
8573 * theory dependency graph may now be incorporated into documents;
8574 isatool usedir -g true will produce session_graph.eps/.pdf for use
8575 with \includegraphics of LaTeX;
8577 * proper spacing of consecutive markup elements, especially text
8578 blocks after section headings;
8580 * support bold style (for single symbols only), input syntax is like
8581 this: "\<^bold>\<alpha>" or "\<^bold>A";
8583 * \<bullet> is now output as bold \cdot by default, which looks much
8584 better in printed text;
8586 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8587 note that these symbols are currently unavailable in Proof General /
8588 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8590 * isatool latex no longer depends on changed TEXINPUTS, instead
8591 isatool document copies the Isabelle style files to the target
8597 * Pure/Provers: improved proof by cases and induction;
8598 - 'case' command admits impromptu naming of parameters (such as
8600 - 'induct' method divinates rule instantiation from the inductive
8601 claim; no longer requires excessive ?P bindings for proper
8602 instantiation of cases;
8603 - 'induct' method properly enumerates all possibilities of set/type
8604 rules; as a consequence facts may be also passed through *type*
8605 rules without further ado;
8606 - 'induct' method now derives symbolic cases from the *rulified*
8607 rule (before it used to rulify cases stemming from the internal
8608 atomized version); this means that the context of a non-atomic
8609 statement becomes is included in the hypothesis, avoiding the
8610 slightly cumbersome show "PROP ?case" form;
8611 - 'induct' may now use elim-style induction rules without chaining
8612 facts, using ``missing'' premises from the goal state; this allows
8613 rules stemming from inductive sets to be applied in unstructured
8614 scripts, while still benefitting from proper handling of non-atomic
8615 statements; NB: major inductive premises need to be put first, all
8616 the rest of the goal is passed through the induction;
8617 - 'induct' proper support for mutual induction involving non-atomic
8618 rule statements (uses the new concept of simultaneous goals, see
8620 - append all possible rule selections, but only use the first
8621 success (no backtracking);
8622 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8623 - undeclared rule case names default to numbers 1, 2, 3, ...;
8624 - added 'print_induct_rules' (covered by help item in recent Proof
8626 - moved induct/cases attributes to Pure, methods to Provers;
8627 - generic method setup instantiated for FOL and HOL;
8629 * Pure: support multiple simultaneous goal statements, for example
8630 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8631 meta-level mechanism, this acts as if several individual goals had
8632 been stated separately; in particular common proof methods need to be
8633 repeated in order to cover all claims; note that a single elimination
8634 step is *not* sufficient to establish the two conjunctions, so this
8637 assume "A & B" then have A and B .. (*".." fails*)
8639 better use "obtain" in situations as above; alternative refer to
8640 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8642 * Pure: proper integration with ``locales''; unlike the original
8643 version by Florian Kammller, Isar locales package high-level proof
8644 contexts rather than raw logical ones (e.g. we admit to include
8645 attributes everywhere); operations on locales include merge and
8646 rename; support for implicit arguments (``structures''); simultaneous
8647 type-inference over imports and text; see also HOL/ex/Locales.thy for
8650 * Pure: the following commands have been ``localized'', supporting a
8651 target locale specification "(in name)": 'lemma', 'theorem',
8652 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8653 stored both within the locale and at the theory level (exported and
8654 qualified by the locale name);
8656 * Pure: theory goals may now be specified in ``long'' form, with
8657 ad-hoc contexts consisting of arbitrary locale elements. for example
8658 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8659 definitions may be given, too); the result is a meta-level rule with
8660 the context elements being discharged in the obvious way;
8662 * Pure: new proof command 'using' allows to augment currently used
8663 facts after a goal statement ('using' is syntactically analogous to
8664 'apply', but acts on the goal's facts only); this allows chained facts
8665 to be separated into parts given before and after a claim, as in
8666 ``from a and b have C using d and e <proof>'';
8668 * Pure: renamed "antecedent" case to "rule_context";
8670 * Pure: new 'judgment' command records explicit information about the
8671 object-logic embedding (used by several tools internally); no longer
8672 use hard-wired "Trueprop";
8674 * Pure: added 'corollary' command;
8676 * Pure: fixed 'token_translation' command;
8678 * Pure: removed obsolete 'exported' attribute;
8680 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8681 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8682 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8684 * Pure: method 'atomize' presents local goal premises as object-level
8685 statements (atomic meta-level propositions); setup controlled via
8686 rewrite rules declarations of 'atomize' attribute; example
8687 application: 'induct' method with proper rule statements in improper
8690 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8691 now consider the syntactic context of assumptions, giving a better
8692 chance to get type-inference of the arguments right (this is
8693 especially important for locales);
8695 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8698 * Pure/obtain: the formal conclusion "thesis", being marked as
8699 ``internal'', may no longer be reference directly in the text;
8700 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8703 * Pure: generic 'sym' attribute which declares a rule both as pure
8704 'elim?' and for the 'symmetric' operation;
8706 * Pure: marginal comments ``--'' may now occur just anywhere in the
8707 text; the fixed correlation with particular command syntax has been
8710 * Pure: new method 'rules' is particularly well-suited for proof
8711 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8712 but often produces more compact proof terms with less detours;
8714 * Pure/Provers/classical: simplified integration with pure rule
8715 attributes and methods; the classical "intro?/elim?/dest?"
8716 declarations coincide with the pure ones; the "rule" method no longer
8717 includes classically swapped intros; "intro" and "elim" methods no
8718 longer pick rules from the context; also got rid of ML declarations
8719 AddXIs/AddXEs/AddXDs; all of this has some potential for
8722 * Provers/classical: attribute 'swapped' produces classical inversions
8723 of introduction rules;
8725 * Provers/simplifier: 'simplified' attribute may refer to explicit
8726 rules instead of full simplifier context; 'iff' attribute handles
8729 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8731 * HOL: 'recdef' now fails on unfinished automated proofs, use
8732 "(permissive)" option to recover old behavior;
8734 * HOL: 'inductive' no longer features separate (collective) attributes
8735 for 'intros' (was found too confusing);
8737 * HOL: properly declared induction rules less_induct and
8743 * HOL: moved over to sane numeral syntax; the new policy is as
8746 - 0 and 1 are polymorphic constants, which are defined on any
8747 numeric type (nat, int, real etc.);
8749 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8750 binary representation internally;
8752 - type nat has special constructor Suc, and generally prefers Suc 0
8753 over 1::nat and Suc (Suc 0) over 2::nat;
8755 This change may cause significant problems of INCOMPATIBILITY; here
8756 are some hints on converting existing sources:
8758 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8759 entities, so expressions involving "-" (unary or binary minus) need
8760 to be spaced properly;
8762 - existing occurrences of "1" may need to be constraint "1::nat" or
8763 even replaced by Suc 0; similar for old "2";
8765 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8767 - remove all special provisions on numerals in proofs;
8769 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8770 representation (depends on bin_arith_simps in the default context);
8772 * HOL: symbolic syntax for x^2 (numeral 2);
8774 * HOL: the class of all HOL types is now called "type" rather than
8775 "term"; INCOMPATIBILITY, need to adapt references to this type class
8776 in axclass/classes, instance/arities, and (usually rare) occurrences
8777 in typings (of consts etc.); internally the class is called
8778 "HOL.type", ML programs should refer to HOLogic.typeS;
8780 * HOL/record package improvements:
8781 - new derived operations "fields" to build a partial record section,
8782 "extend" to promote a fixed record to a record scheme, and
8783 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8784 declared as simp by default;
8785 - shared operations ("more", "fields", etc.) now need to be always
8786 qualified) --- potential INCOMPATIBILITY;
8787 - removed "make_scheme" operations (use "make" with "extend") --
8789 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8790 - provides cases/induct rules for use with corresponding Isar
8791 methods (for concrete records, record schemes, concrete more
8792 parts, and schematic more parts -- in that order);
8793 - internal definitions directly based on a light-weight abstract
8794 theory of product types over typedef rather than datatype;
8796 * HOL: generic code generator for generating executable ML code from
8797 specifications; specific support for HOL constructs such as inductive
8798 datatypes and sets, as well as recursive functions; can be invoked
8799 via 'generate_code' theory section;
8801 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8803 * HOL: consolidated and renamed several theories. In particular:
8804 Ord.thy has been absorbed into HOL.thy
8805 String.thy has been absorbed into List.thy
8807 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8808 (beware of argument permutation!);
8810 * HOL: linorder_less_split superseded by linorder_cases;
8812 * HOL/List: "nodups" renamed to "distinct";
8814 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8815 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8816 - Ex_def has changed, now need to use some_eq_ex
8818 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8819 in this (rare) case use:
8821 delSWrapper "split_all_tac"
8822 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8824 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8827 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8828 Isabelle's type classes, ^ on functions and relations has too general
8829 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8830 necessary to attach explicit type constraints;
8832 * HOL/Relation: the prefix name of the infix "O" has been changed from
8833 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8834 renamed accordingly (eg "compI" -> "rel_compI").
8836 * HOL: syntax translations now work properly with numerals and records
8839 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8840 of "lam" -- INCOMPATIBILITY;
8842 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8843 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8844 renamed "Product_Type.unit";
8846 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8848 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8849 the "cases" method);
8851 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8854 * HOL/IMP: updated and converted to new-style theory format; several
8855 parts turned into readable document, with proper Isar proof texts and
8856 some explanations (by Gerwin Klein);
8858 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8860 * HOL-Hyperreal is now a logic image;
8865 * Isar: consts/constdefs supports mixfix syntax for continuous
8868 * Isar: domain package adapted to new-style theory format, e.g. see
8871 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8872 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8873 lift.induct_tac, always use UU instead of Undef;
8875 * HOLCF/IMP: updated and converted to new-style theory;
8880 * Isar: proper integration of logic-specific tools and packages,
8881 including theory commands '(co)inductive', '(co)datatype',
8882 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8883 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8885 * theory Main no longer includes AC; for the Axiom of Choice, base
8886 your theory on Main_ZFC;
8888 * the integer library now covers quotients and remainders, with many
8889 laws relating division to addition, multiplication, etc.;
8891 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8892 typeless version of the formalism;
8894 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8897 * ZF/Induct: new directory for examples of inductive definitions,
8898 including theory Multiset for multiset orderings; converted to
8899 new-style theory format;
8901 * ZF: many new theorems about lists, ordinals, etc.;
8906 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8907 variable proof controls level of detail: 0 = no proofs (only oracle
8908 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8909 also ref manual for further ML interfaces;
8911 * Pure/axclass: removed obsolete ML interface
8912 goal_subclass/goal_arity;
8914 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8915 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8916 separate tokens, so expressions involving minus need to be spaced
8919 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8920 rather than "infixl" or "infixr";
8922 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8923 sort constraint specifications in type inference; e.g. "x::_::foo"
8924 ensures that the type of "x" is of sort "foo" (but not necessarily a
8927 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8928 control output of nested => (types); the default behavior is
8931 * Pure/syntax: builtin parse translation for "_constify" turns valued
8932 tokens into AST constants;
8934 * Pure/syntax: prefer later declarations of translations and print
8935 translation functions; potential INCOMPATIBILITY: need to reverse
8936 multiple declarations for same syntax element constant;
8938 * Pure/show_hyps reset by default (in accordance to existing Isar
8941 * Provers/classical: renamed addaltern to addafter, addSaltern to
8944 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8947 * system: tested support for MacOS X; should be able to get Isabelle +
8948 Proof General to work in a plain Terminal after installing Poly/ML
8949 (e.g. from the Isabelle distribution area) and GNU bash alone
8950 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8951 support requires further installations, e.g. from
8952 http://fink.sourceforge.net/);
8954 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8956 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8957 of 40 MB), cf. ML_OPTIONS;
8959 * system: Proof General keywords specification is now part of the
8960 Isabelle distribution (see etc/isar-keywords.el);
8962 * system: support for persistent Proof General sessions (refrain from
8963 outdating all loaded theories on startup); user may create writable
8964 logic images like this: ``isabelle -q HOL Test'';
8966 * system: smart selection of Isabelle process versus Isabelle
8967 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8968 run both "isabelle" and "Isabelle" even if file names are badly
8969 damaged (executable inspects the case of the first letter of its own
8970 name); added separate "isabelle-process" and "isabelle-interface";
8972 * system: refrain from any attempt at filtering input streams; no
8973 longer support ``8bit'' encoding of old isabelle font, instead proper
8974 iso-latin characters may now be used; the related isatools
8975 "symbolinput" and "nonascii" have disappeared as well;
8977 * system: removed old "xterm" interface (the print modes "xterm" and
8978 "xterm_color" are still available for direct use in a suitable
8983 New in Isabelle99-2 (February 2001)
8984 -----------------------------------
8986 *** Overview of INCOMPATIBILITIES ***
8988 * HOL: please note that theories in the Library and elsewhere often use the
8989 new-style (Isar) format; to refer to their theorems in an ML script you must
8990 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8992 * HOL: inductive package no longer splits induction rule aggressively,
8993 but only as far as specified by the introductions given; the old
8994 format may be recovered via ML function complete_split_rule or attribute
8995 'split_rule (complete)';
8997 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8998 gfp_Tarski to gfp_unfold;
9000 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
9002 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
9003 relation); infix "^^" has been renamed "``"; infix "``" has been
9004 renamed "`"; "univalent" has been renamed "single_valued";
9006 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
9009 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
9011 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
9013 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
9014 consequence, it is no longer monotonic wrt. the local goal context
9015 (which is now passed through the inductive cases);
9017 * Document preparation: renamed standard symbols \<ll> to \<lless> and
9018 \<gg> to \<ggreater>;
9021 *** Document preparation ***
9023 * \isabellestyle{NAME} selects version of Isabelle output (currently
9024 available: are "it" for near math-mode best-style output, "sl" for
9025 slanted text style, and "tt" for plain type-writer; if no
9026 \isabellestyle command is given, output is according to slanted
9029 * support sub/super scripts (for single symbols only), input syntax is
9030 like this: "A\<^sup>*" or "A\<^sup>\<star>";
9032 * some more standard symbols; see Appendix A of the system manual for
9033 the complete list of symbols defined in isabellesym.sty;
9035 * improved isabelle style files; more abstract symbol implementation
9036 (should now use \isamath{...} and \isatext{...} in custom symbol
9039 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9040 state; Note that presentation of goal states does not conform to
9041 actual human-readable proof documents. Please do not include goal
9042 states into document output unless you really know what you are doing!
9044 * proper indentation of antiquoted output with proportional LaTeX
9047 * no_document ML operator temporarily disables LaTeX document
9050 * isatool unsymbolize tunes sources for plain ASCII communication;
9055 * Pure: Isar now suffers initial goal statements to contain unbound
9056 schematic variables (this does not conform to actual readable proof
9057 documents, due to unpredictable outcome and non-compositional proof
9058 checking); users who know what they are doing may use schematic goals
9059 for Prolog-style synthesis of proven results;
9061 * Pure: assumption method (an implicit finishing) now handles actual
9064 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9065 initial goal, declare "that" only as Pure intro (only for single
9066 steps); the "that" rule assumption may now be involved in implicit
9067 finishing, thus ".." becomes a feasible for trivial obtains;
9069 * Pure: default proof step now includes 'intro_classes'; thus trivial
9070 instance proofs may be performed by "..";
9072 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9075 * Pure: more robust selection of calculational rules;
9077 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9078 rule (as well as the assumption rule);
9080 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9081 lemmas, using the graph browser tool;
9083 * Pure: predict failure of "show" in interactive mode;
9085 * Pure: 'thms_containing' now takes actual terms as arguments;
9087 * HOL: improved method 'induct' --- now handles non-atomic goals
9088 (potential INCOMPATIBILITY); tuned error handling;
9090 * HOL: cases and induct rules now provide explicit hints about the
9091 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9092 any remaining facts are inserted into the goal verbatim;
9094 * HOL: local contexts (aka cases) may now contain term bindings as
9095 well; the 'cases' and 'induct' methods new provide a ?case binding for
9096 the result to be shown in each case;
9098 * HOL: added 'recdef_tc' command;
9100 * isatool convert assists in eliminating legacy ML scripts;
9105 * HOL/Library: a collection of generic theories to be used together
9106 with main HOL; the theory loader path already includes this directory
9107 by default; the following existing theories have been moved here:
9108 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9109 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9111 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9112 modelling and verification task performed in Isabelle/HOL +
9113 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9115 * HOL/Algebra: special summation operator SUM no longer exists, it has
9116 been replaced by setsum; infix 'assoc' now has priority 50 (like
9117 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9118 'domain', this makes the theory consistent with mathematical
9121 * HOL basics: added overloaded operations "inverse" and "divide"
9122 (infix "/"), syntax for generic "abs" operation, generic summation
9125 * HOL/typedef: simplified package, provide more useful rules (see also
9128 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9129 now expressed as a proper nested rule (old-style tactic scripts may
9130 require atomize_strip_tac to cope with non-atomic premises);
9132 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9133 to "split_conv" (old name still available for compatibility);
9135 * HOL: improved concrete syntax for strings (e.g. allows translation
9136 rules with string literals);
9138 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9139 and Fleuriot's mechanization of analysis, including the transcendental
9140 functions for the reals;
9142 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9147 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9148 "lam" is displayed as TWO lambda-symbols
9150 * CTT: theory Main now available, containing everything (that is, Bool
9156 * Pure: the Simplifier has been implemented properly as a derived rule
9157 outside of the actual kernel (at last!); the overall performance
9158 penalty in practical applications is about 50%, while reliability of
9159 the Isabelle inference kernel has been greatly improved;
9161 * print modes "brackets" and "no_brackets" control output of nested =>
9162 (types) and ==> (props); the default behaviour is "brackets";
9164 * Provers: fast_tac (and friends) now handle actual object-logic rules
9165 as assumptions as well;
9167 * system: support Poly/ML 4.0;
9169 * system: isatool install handles KDE version 1 or 2;
9173 New in Isabelle99-1 (October 2000)
9174 ----------------------------------
9176 *** Overview of INCOMPATIBILITIES ***
9178 * HOL: simplification of natural numbers is much changed; to partly
9179 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9180 issue the following ML commands:
9182 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9183 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9185 * HOL: simplification no longer dives into case-expressions; this is
9186 controlled by "t.weak_case_cong" for each datatype t;
9188 * HOL: nat_less_induct renamed to less_induct;
9190 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9191 fixsome to patch .thy and .ML sources automatically;
9193 select_equality -> some_equality
9194 select_eq_Ex -> some_eq_ex
9195 selectI2EX -> someI2_ex
9198 select1_equality -> some1_equality
9199 Eps_sym_eq -> some_sym_eq_trivial
9200 Eps_eq -> some_eq_trivial
9202 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9204 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9207 * HOL: the recursion equations generated by 'recdef' are now called
9208 f.simps instead of f.rules;
9210 * HOL: qed_spec_mp now also handles bounded ALL as well;
9212 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9213 sometimes be needed;
9215 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9217 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9219 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9220 product is now "<*>" instead of "Times"; the lexicographic product is
9221 now "<*lex*>" instead of "**";
9223 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9224 of main HOL, but was unused); better use HOL's datatype package;
9226 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9227 the old syntax may be recovered as follows:
9230 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9231 (infixl "\\<oplus>" 100)
9233 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9235 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9236 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9239 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9240 changed from A/r to A//r;
9242 * ZF: new treatment of arithmetic (nat & int) may break some old
9245 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9246 rulify -> rule_format, elimify -> elim_format, ...);
9248 * Isar/Provers: intro/elim/dest attributes changed; renamed
9249 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9250 should have to change intro!! to intro? only); replaced "delrule" by
9253 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9255 * Provers: strengthened force_tac by using new first_best_tac;
9257 * LaTeX document preparation: several changes of isabelle.sty (see
9261 *** Document preparation ***
9263 * formal comments (text blocks etc.) in new-style theories may now
9264 contain antiquotations of thm/prop/term/typ/text to be presented
9265 according to latex print mode; concrete syntax is like this:
9266 @{term[show_types] "f(x) = a + x"};
9268 * isatool mkdir provides easy setup of Isabelle session directories,
9269 including proper document sources;
9271 * generated LaTeX sources are now deleted after successful run
9272 (isatool document -c); may retain a copy somewhere else via -D option
9275 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9276 style files, achieving self-contained LaTeX sources and simplifying
9279 * old-style theories now produce (crude) LaTeX output as well;
9281 * browser info session directories are now self-contained (may be put
9282 on WWW server seperately); improved graphs of nested sessions; removed
9283 graph for 'all sessions';
9285 * several improvements in isabelle style files; \isabellestyle{it}
9286 produces fake math mode output; \isamarkupheader is now \section by
9287 default; see lib/texinputs/isabelle.sty etc.;
9292 * Isar/Pure: local results and corresponding term bindings are now
9293 subject to Hindley-Milner polymorphism (similar to ML); this
9294 accommodates incremental type-inference very nicely;
9296 * Isar/Pure: new derived language element 'obtain' supports
9297 generalized existence reasoning;
9299 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9300 support accumulation of results, without applying any rules yet;
9301 useful to collect intermediate results without explicit name
9302 references, and for use with transitivity rules with more than 2
9305 * Isar/Pure: scalable support for case-analysis type proofs: new
9306 'case' language element refers to local contexts symbolically, as
9307 produced by certain proof methods; internally, case names are attached
9308 to theorems as "tags";
9310 * Isar/Pure: theory command 'hide' removes declarations from
9311 class/type/const name spaces;
9313 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9314 indicate potential overloading;
9316 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9318 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9319 "{a,b,c}" instead of {a,b,c};
9321 * Isar/Pure now provides its own version of intro/elim/dest
9322 attributes; useful for building new logics, but beware of confusion
9323 with the version in Provers/classical;
9325 * Isar/Pure: the local context of (non-atomic) goals is provided via
9326 case name 'antecedent';
9328 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9329 to the current context is now done automatically);
9331 * Isar/Pure: theory command 'method_setup' provides a simple interface
9332 for definining proof methods in ML;
9334 * Isar/Provers: intro/elim/dest attributes changed; renamed
9335 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9336 most cases, one should have to change intro!! to intro? only);
9337 replaced "delrule" by "rule del";
9339 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9340 'symmetric' attribute (the latter supercedes [RS sym]);
9342 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9343 method modifier); 'simp' method: 'only:' modifier removes loopers as
9344 well (including splits);
9346 * Isar/Provers: Simplifier and Classical methods now support all kind
9347 of modifiers used in the past, including 'cong', 'iff', etc.
9349 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9350 of Simplifier and Classical reasoner);
9352 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9353 now support named cases; major packages (inductive, datatype, primrec,
9354 recdef) support case names and properly name parameters;
9356 * Isar/HOL: new transitivity rules for substitution in inequalities --
9357 monotonicity conditions are extracted to be proven at end of
9360 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9363 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9364 split_if split_if_asm; datatype package provides theorems foo.splits =
9365 foo.split foo.split_asm for each datatype;
9367 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9368 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9369 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9370 use "(cases (simplified))" method in proper proof texts);
9372 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9374 * Isar: names of theorems etc. may be natural numbers as well;
9376 * Isar: 'pr' command: optional arguments for goals_limit and
9377 ProofContext.prems_limit; no longer prints theory contexts, but only
9380 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9381 additional print modes to be specified; e.g. "pr(latex)" will print
9382 proof state according to the Isabelle LaTeX style;
9384 * Isar: improved support for emulating tactic scripts, including proof
9385 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9386 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9387 (for HOL datatypes);
9389 * Isar: simplified (more robust) goal selection of proof methods: 1st
9390 goal, all goals, or explicit goal specifier (tactic emulation); thus
9391 'proof method scripts' have to be in depth-first order;
9393 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9395 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9396 should instead use individual commands for printing items
9397 (print_commands, print_methods etc.);
9399 * Isar: added 'nothing' --- the empty list of theorems;
9404 * HOL/MicroJava: formalization of a fragment of Java, together with a
9405 corresponding virtual machine and a specification of its bytecode
9406 verifier and a lightweight bytecode verifier, including proofs of
9407 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9408 Cornelia Pusch (see also the homepage of project Bali at
9409 http://isabelle.in.tum.de/Bali/);
9411 * HOL/Algebra: new theory of rings and univariate polynomials, by
9414 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9415 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9418 * HOL/Lattice: fundamental concepts of lattice theory and order
9419 structures, including duals, properties of bounds versus algebraic
9420 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9421 Theorem for complete lattices etc.; may also serve as a demonstration
9422 for abstract algebraic reasoning using axiomatic type classes, and
9423 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9425 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9428 * HOL/IMPP: extension of IMP with local variables and mutually
9429 recursive procedures, by David von Oheimb;
9431 * HOL/Lambda: converted into new-style theory and document;
9433 * HOL/ex/Multiquote: example of multiple nested quotations and
9434 anti-quotations -- basically a generalized version of de-Bruijn
9435 representation; very useful in avoiding lifting of operations;
9437 * HOL/record: added general record equality rule to simpset; fixed
9438 select-update simplification procedure to handle extended records as
9439 well; admit "r" as field name;
9441 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9442 other numeric types and also as the identity of groups, rings, etc.;
9444 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9445 Types nat and int belong to this axclass;
9447 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9448 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9449 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9450 two terms #m*u and #n*u are replaced by #(m+n)*u
9451 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9452 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9453 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9455 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9456 powerful prover for predicate logic but knows nothing of clasets; see
9457 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9459 * HOL: new version of "case_tac" subsumes both boolean case split and
9460 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9461 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9463 * HOL: simplification no longer dives into case-expressions: only the
9464 selector expression is simplified, but not the remaining arms; to
9465 enable full simplification of case-expressions for datatype t, you may
9466 remove t.weak_case_cong from the simpset, either globally (Delcongs
9467 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9469 * HOL/recdef: the recursion equations generated by 'recdef' for
9470 function 'f' are now called f.simps instead of f.rules; if all
9471 termination conditions are proved automatically, these simplification
9472 rules are added to the simpset, as in primrec; rules may be named
9473 individually as well, resulting in a separate list of theorems for
9476 * HOL/While is a new theory that provides a while-combinator. It
9477 permits the definition of tail-recursive functions without the
9478 provision of a termination measure. The latter is necessary once the
9479 invariant proof rule for while is applied.
9481 * HOL: new (overloaded) notation for the set of elements below/above
9482 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9484 * HOL: theorems impI, allI, ballI bound as "strip";
9486 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9487 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9488 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9490 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9492 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9493 main HOL, but was unused);
9495 * HOL: fewer consts declared as global (e.g. have to refer to
9496 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9498 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9499 in case of overlap with user translations (e.g. judgements over
9500 tuples); (note that the underlying logical represenation is still
9506 * ZF: simplification automatically cancels common terms in arithmetic
9507 expressions over nat and int;
9509 * ZF: new treatment of nat to minimize type-checking: all operators
9510 coerce their operands to a natural number using the function natify,
9511 making the algebraic laws unconditional;
9513 * ZF: as above, for int: operators coerce their operands to an integer
9514 using the function intify;
9516 * ZF: the integer library now contains many of the usual laws for the
9517 orderings, including $<=, and monotonicity laws for $+ and $*;
9519 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9522 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9523 to the simplifier and classical reasoner simultaneously;
9528 * Provers: blast_tac now handles actual object-logic rules as
9529 assumptions; note that auto_tac uses blast_tac internally as well;
9531 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9532 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9534 * Provers: delrules now handles destruct rules as well (no longer need
9535 explicit make_elim);
9537 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9538 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9539 use instead the strong form,
9540 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9541 in HOL, FOL and ZF the function cla_make_elim will create such rules
9542 from destruct-rules;
9544 * Provers: Simplifier.easy_setup provides a fast path to basic
9545 Simplifier setup for new object-logics;
9547 * Pure: AST translation rules no longer require constant head on LHS;
9549 * Pure: improved name spaces: ambiguous output is qualified; support
9550 for hiding of names;
9552 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9553 XSYMBOL_HOME; no longer need to do manual configuration in most
9556 * system: compression of ML heaps images may now be controlled via -c
9557 option of isabelle and isatool usedir (currently only observed by
9560 * system: isatool installfonts may handle X-Symbol fonts as well (very
9561 useful for remote X11);
9563 * system: provide TAGS file for Isabelle sources;
9565 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9568 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9569 timing flag supersedes proof_timing and Toplevel.trace;
9571 * ML: new combinators |>> and |>>> for incremental transformations
9572 with secondary results (e.g. certain theory extensions):
9574 * ML: PureThy.add_defs gets additional argument to indicate potential
9575 overloading (usually false);
9577 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9582 New in Isabelle99 (October 1999)
9583 --------------------------------
9585 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9587 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9588 are no longer simplified. (This allows the simplifier to unfold recursive
9589 functional programs.) To restore the old behaviour, declare
9591 Delcongs [if_weak_cong];
9593 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9596 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9598 * HOL/datatype: mutual_induct_tac no longer exists --
9599 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9601 * HOL/typedef: fixed type inference for representing set; type
9602 arguments now have to occur explicitly on the rhs as type constraints;
9604 * ZF: The con_defs part of an inductive definition may no longer refer
9605 to constants declared in the same theory;
9607 * HOL, ZF: the function mk_cases, generated by the inductive
9608 definition package, has lost an argument. To simplify its result, it
9609 uses the default simpset instead of a supplied list of theorems.
9611 * HOL/List: the constructors of type list are now Nil and Cons;
9613 * Simplifier: the type of the infix ML functions
9614 setSSolver addSSolver setSolver addSolver
9615 is now simpset * solver -> simpset where `solver' is a new abstract type
9616 for packaging solvers. A solver is created via
9617 mk_solver: string -> (thm list -> int -> tactic) -> solver
9618 where the string argument is only a comment.
9623 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9624 decision procedure for linear arithmetic. Currently it is used for
9625 types `nat', `int', and `real' in HOL (see below); it can, should and
9626 will be instantiated for other types and logics as well.
9628 * The simplifier now accepts rewrite rules with flexible heads, eg
9629 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9630 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9636 * New Isabelle/Isar subsystem provides an alternative to traditional
9637 tactical theorem proving; together with the ProofGeneral/isar user
9638 interface it offers an interactive environment for developing human
9639 readable proof documents (Isar == Intelligible semi-automated
9640 reasoning); for further information see isatool doc isar-ref,
9641 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9643 * improved and simplified presentation of theories: better HTML markup
9644 (including colors), graph views in several sizes; isatool usedir now
9645 provides a proper interface for user theories (via -P option); actual
9646 document preparation based on (PDF)LaTeX is available as well (for
9647 new-style theories only); see isatool doc system for more information;
9649 * native support for Proof General, both for classic Isabelle and
9652 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9653 using the graph browser tool;
9655 * Isabelle manuals now also available as PDF;
9657 * theory loader rewritten from scratch (may not be fully
9658 bug-compatible); old loadpath variable has been replaced by show_path,
9659 add_path, del_path, reset_path functions; new operations such as
9660 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9663 * improved isatool install: option -k creates KDE application icon,
9664 option -p DIR installs standalone binaries;
9666 * added ML_PLATFORM setting (useful for cross-platform installations);
9667 more robust handling of platform specific ML images for SML/NJ;
9669 * the settings environment is now statically scoped, i.e. it is never
9670 created again in sub-processes invoked from isabelle, isatool, or
9673 * path element specification '~~' refers to '$ISABELLE_HOME';
9675 * in locales, the "assumes" and "defines" parts may be omitted if
9678 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9681 * new print_mode "HTML";
9683 * new flag show_tags controls display of tags of theorems (which are
9684 basically just comments that may be attached by some tools);
9686 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9687 mode and goal output format:
9689 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9691 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9693 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9694 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9696 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9698 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9700 * function bind_thms stores lists of theorems (cf. bind_thm);
9702 * new shorthand tactics ftac, eatac, datac, fatac;
9704 * qed (and friends) now accept "" as result name; in that case the
9705 theorem is not stored, but proper checks and presentation of the
9708 * theorem database now also indexes constants "Trueprop", "all",
9709 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9714 ** HOL arithmetic **
9716 * There are now decision procedures for linear arithmetic over nat and
9719 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9720 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9721 are treated as atomic; subformulae not involving type `nat' or `int'
9722 are ignored; quantified subformulae are ignored unless they are
9723 positive universal or negative existential. The tactic has to be
9724 invoked by hand and can be a little bit slow. In particular, the
9725 running time is exponential in the number of occurrences of `min' and
9726 `max', and `-' on `nat'.
9728 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9729 (negated) (in)equalities among the premises and the conclusion into
9730 account (i.e. no compound formulae) and does not know about `min' and
9731 `max', and `-' on `nat'. It is fast and is used automatically by the
9734 NB: At the moment, these decision procedures do not cope with mixed
9735 nat/int formulae where the two parts interact, such as `m < n ==>
9738 * HOL/Numeral provides a generic theory of numerals (encoded
9739 efficiently as bit strings); setup for types nat/int/real is in place;
9740 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9741 int, existing theories and proof scripts may require a few additional
9744 * integer division and remainder can now be performed on constant
9747 * many properties of integer multiplication, division and remainder
9750 * An interface to the Stanford Validity Checker (SVC) is available through the
9751 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9752 are proved automatically. SVC must be installed separately, and its results
9753 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9754 invocation of the underlying oracle). For SVC see
9755 http://verify.stanford.edu/SVC
9757 * IsaMakefile: the HOL-Real target now builds an actual image;
9762 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9763 (in Isabelle/Isar) -- by Gertrud Bauer;
9765 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9766 analysis for assembly languages with subtypes;
9768 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9769 -- avoids syntactic ambiguities and treats state, transition, and
9770 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9771 changed syntax and (many) tactics;
9773 * HOL/inductive: Now also handles more general introduction rules such
9774 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9775 theorems are now maintained within the theory (maintained via the
9778 * HOL/datatype: Now also handles arbitrarily branching datatypes
9779 (using function types) such as
9781 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9783 * HOL/record: record_simproc (part of the default simpset) takes care
9784 of selectors applied to updated records; record_split_tac is no longer
9785 part of the default claset; update_defs may now be removed from the
9786 simpset in many cases; COMPATIBILITY: old behavior achieved by
9788 claset_ref () := claset() addSWrapper record_split_wrapper;
9789 Delsimprocs [record_simproc]
9791 * HOL/typedef: fixed type inference for representing set; type
9792 arguments now have to occur explicitly on the rhs as type constraints;
9794 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9795 names rather than an ML expression;
9797 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9798 supplied later. Program schemes can be defined, such as
9799 "While B C s = (if B s then While B C (C s) else s)"
9800 where the well-founded relation can be chosen after B and C have been given.
9802 * HOL/List: the constructors of type list are now Nil and Cons;
9803 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9804 course, ML tools referring to List.list.op # etc. have to be adapted;
9806 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9807 disabled by default; run isabelle with option -m HOL to get back to
9808 the original Gordon/HOL-style output;
9810 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9811 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9813 * HOL basic syntax simplified (more orthogonal): all variants of
9814 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9815 Eps operator is provided as well: "SOME x. P[x]";
9817 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9819 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9820 thus available for user theories;
9822 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9823 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9826 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9827 several times and then mp;
9832 * the notation <<...>> is now available as a notation for sequences of
9835 * the simplifier is now installed
9837 * the axiom system has been generalized (thanks to Soren Heilmann)
9839 * the classical reasoner now has a default rule database
9844 * new primrec section allows primitive recursive functions to be given
9845 directly (as in HOL) over datatypes and the natural numbers;
9847 * new tactics induct_tac and exhaust_tac for induction (or case
9848 analysis) over datatypes and the natural numbers;
9850 * the datatype declaration of type T now defines the recursor T_rec;
9852 * simplification automatically does freeness reasoning for datatype
9855 * automatic type-inference, with AddTCs command to insert new
9856 type-checking rules;
9858 * datatype introduction rules are now added as Safe Introduction rules
9861 * the syntax "if P then x else y" is now available in addition to
9865 *** Internal programming interfaces ***
9867 * tuned simplifier trace output; new flag debug_simp;
9869 * structures Vartab / Termtab (instances of TableFun) offer efficient
9870 tables indexed by indexname_ord / term_ord (compatible with aconv);
9872 * AxClass.axclass_tac lost the theory argument;
9874 * tuned current_goals_markers semantics: begin / end goal avoids
9875 printing empty lines;
9877 * removed prs and prs_fn hook, which was broken because it did not
9878 include \n in its semantics, forcing writeln to add one
9879 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9880 string -> unit if you really want to output text without newline;
9882 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9883 plain output, interface builders may have to enable 'isabelle_font'
9884 mode to get Isabelle font glyphs as before;
9886 * refined token_translation interface; INCOMPATIBILITY: output length
9887 now of type real instead of int;
9889 * theory loader actions may be traced via new ThyInfo.add_hook
9890 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9891 your own database of information attached to *whole* theories -- as
9892 opposed to intra-theory data slots offered via TheoryDataFun;
9894 * proper handling of dangling sort hypotheses (at last!);
9895 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9896 extra sort hypotheses that can be witnessed from the type signature;
9897 the force_strip_shyps flag is gone, any remaining shyps are simply
9898 left in the theorem (with a warning issued by strip_shyps_warning);
9902 New in Isabelle98-1 (October 1998)
9903 ----------------------------------
9905 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9907 * several changes of automated proof tools;
9909 * HOL: major changes to the inductive and datatype packages, including
9910 some minor incompatibilities of theory syntax;
9912 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9915 * HOL: removed duplicate thms in Arith:
9916 less_imp_add_less should be replaced by trans_less_add1
9917 le_imp_add_le should be replaced by trans_le_add1
9919 * HOL: unary minus is now overloaded (new type constraints may be
9922 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9923 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9924 now taken as an integer constant.
9926 * Pure: ML function 'theory_of' renamed to 'theory';
9932 1. Asm_full_simp_tac is now more aggressive.
9933 1. It will sometimes reorient premises if that increases their power to
9935 2. It does no longer proceed strictly from left to right but may also
9936 rotate premises to achieve further simplification.
9937 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9938 old Asm_full_simp_tac in that it does not rotate premises.
9939 2. The simplifier now knows a little bit about nat-arithmetic.
9941 * Classical reasoner: wrapper mechanism for the classical reasoner now
9942 allows for selected deletion of wrappers, by introduction of names for
9943 wrapper functionals. This implies that addbefore, addSbefore,
9944 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9945 and that adding two tactics with the same name overwrites the first
9946 one (emitting a warning).
9947 type wrapper = (int -> tactic) -> (int -> tactic)
9948 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9949 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9950 delWrapper, delSWrapper: claset * string -> claset
9951 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9953 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9954 semantics; addbefore now affects only the unsafe part of step_tac
9955 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9956 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9959 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9960 compWrapper; added safe wrapper (and access functions for it);
9962 * HOL/split_all_tac is now much faster and fails if there is nothing
9963 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9964 and the names of the automatically generated variables have changed.
9965 split_all_tac has moved within claset() from unsafe wrappers to safe
9966 wrappers, which means that !!-bound variables are split much more
9967 aggressively, and safe_tac and clarify_tac now split such variables.
9968 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9969 Note: the same holds for record_split_tac, which does the job of
9970 split_all_tac for record fields.
9972 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9973 permanently to the default simpset using Addsplits just like
9974 Addsimps. They can be removed via Delsplits just like
9975 Delsimps. Lower-case versions are also available.
9977 * HOL/Simplifier: The rule split_if is now part of the default
9978 simpset. This means that the simplifier will eliminate all occurrences
9979 of if-then-else in the conclusion of a goal. To prevent this, you can
9980 either remove split_if completely from the default simpset by
9981 `Delsplits [split_if]' or remove it in a specific call of the
9982 simplifier using `... delsplits [split_if]'. You can also add/delete
9983 other case splitting rules to/from the default simpset: every datatype
9984 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9985 t is the name of the datatype).
9987 * Classical reasoner / Simplifier combination: new force_tac (and
9988 derivatives Force_tac, force) combines rewriting and classical
9989 reasoning (and whatever other tools) similarly to auto_tac, but is
9990 aimed to solve the given subgoal completely.
9995 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9996 and `goalw': the theory is no longer needed as an explicit argument -
9997 the current theory context is used; assumptions are no longer returned
9998 at the ML-level unless one of them starts with ==> or !!; it is
9999 recommended to convert to these new commands using isatool fixgoal
10000 (backup your sources first!);
10002 * new top-level commands 'thm' and 'thms' for retrieving theorems from
10003 the current theory context, and 'theory' to lookup stored theories;
10005 * new theory section 'locale' for declaring constants, assumptions and
10006 definitions that have local scope;
10008 * new theory section 'nonterminals' for purely syntactic types;
10010 * new theory section 'setup' for generic ML setup functions
10011 (e.g. package initialization);
10013 * the distribution now includes Isabelle icons: see
10014 lib/logo/isabelle-{small,tiny}.xpm;
10016 * isatool install - install binaries with absolute references to
10019 * isatool logo -- create instances of the Isabelle logo (as EPS);
10021 * print mode 'emacs' reserved for Isamode;
10023 * support multiple print (ast) translations per constant name;
10025 * theorems involving oracles are now printed with a suffixed [!];
10030 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
10032 * HOL/inductive package reorganized and improved: now supports mutual
10033 definitions such as
10038 oddI "n : EVEN ==> Suc n : ODD"
10039 evenI "n : ODD ==> Suc n : EVEN"
10041 new theorem list "elims" contains an elimination rule for each of the
10042 recursive sets; inductive definitions now handle disjunctive premises
10043 correctly (also ZF);
10045 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10046 "mutual_induct" no longer exists - the induction rule is always
10047 contained in "induct";
10050 * HOL/datatype package re-implemented and greatly improved: now
10051 supports mutually recursive datatypes such as
10054 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10055 | SUM ('a aexp) ('a aexp)
10056 | DIFF ('a aexp) ('a aexp)
10059 'a bexp = LESS ('a aexp) ('a aexp)
10060 | AND ('a bexp) ('a bexp)
10061 | OR ('a bexp) ('a bexp)
10063 as well as indirectly recursive datatypes such as
10066 ('a, 'b) term = Var 'a
10067 | App 'b ((('a, 'b) term) list)
10069 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10070 induction on mutually / indirectly recursive datatypes.
10072 Primrec equations are now stored in theory and can be accessed via
10073 <function_name>.simps.
10077 - Theories using datatypes must now have theory Datatype as an
10079 - The specific <typename>.induct_tac no longer exists - use the
10080 generic induct_tac instead.
10081 - natE has been renamed to nat.exhaust - use exhaust_tac
10082 instead of res_inst_tac ... natE. Note that the variable
10083 names in nat.exhaust differ from the names in natE, this
10084 may cause some "fragile" proofs to fail.
10085 - The theorems split_<typename>_case and split_<typename>_case_asm
10086 have been renamed to <typename>.split and <typename>.split_asm.
10087 - Since default sorts of type variables are now handled correctly,
10088 some datatype definitions may have to be annotated with explicit
10090 - Primrec definitions no longer require function name and type
10091 of recursive argument.
10093 Consider using isatool fixdatatype to adapt your theories and proof
10094 scripts to the new package (backup your sources first!).
10097 * HOL/record package: considerably improved implementation; now
10098 includes concrete syntax for record types, terms, updates; theorems
10099 for surjective pairing and splitting !!-bound record variables; proof
10100 support is as follows:
10102 1) standard conversions (selectors or updates applied to record
10103 constructor terms) are part of the standard simpset;
10105 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10106 made part of standard simpset and claset via addIffs;
10108 3) a tactic for record field splitting (record_split_tac) is part of
10109 the standard claset (addSWrapper);
10111 To get a better idea about these rules you may retrieve them via
10112 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10113 the name of your record type.
10115 The split tactic 3) conceptually simplifies by the following rule:
10117 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10119 Thus any record variable that is bound by meta-all will automatically
10120 blow up into some record constructor term, consequently the
10121 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10122 solve record problems automatically.
10125 * reorganized the main HOL image: HOL/Integ and String loaded by
10126 default; theory Main includes everything;
10128 * automatic simplification of integer sums and comparisons, using cancellation;
10130 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10132 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10134 * many new identities for unions, intersections, set difference, etc.;
10136 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10137 called split_if, split_split, split_sum_case and split_nat_case (to go
10138 with add/delsplits);
10140 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10141 (?x::unit) = (); this is made part of the default simpset, which COULD
10142 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10143 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10144 unit_abs_eta_conv is added in order to counter the effect of
10145 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10148 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10151 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10152 It and 'sym RS equals0D' are now in the default claset, giving automatic
10153 disjointness reasoning but breaking a few old proofs.
10155 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10156 to 'converse' from 'inverse' (for compatibility with ZF and some
10159 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10160 the well-founded relation;
10162 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10163 Compl A. The "Compl" syntax remains available as input syntax for this
10166 * HOL/Update: new theory of function updates:
10167 f(a:=b) == %x. if x=a then b else f x
10168 may also be iterated as in f(a:=b,c:=d,...);
10170 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10173 - new function list_update written xs[i:=v] that updates the i-th
10174 list position. May also be iterated as in xs[i:=a,j:=b,...].
10175 - new function `upt' written [i..j(] which generates the list
10176 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10177 bound write [i..j], which is a shorthand for [i..j+1(].
10178 - new lexicographic orderings and corresponding wellfoundedness theorems.
10181 - removed 'pred' (predecessor) function;
10182 - generalized some theorems about n-1;
10183 - many new laws about "div" and "mod";
10184 - new laws about greatest common divisors (see theory ex/Primes);
10186 * HOL/Relation: renamed the relational operator r^-1 "converse"
10187 instead of "inverse";
10189 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10190 of the multiset ordering;
10192 * directory HOL/Real: a construction of the reals using Dedekind cuts
10193 (not included by default);
10195 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10197 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10198 programs, i.e. different program variables may have different types.
10200 * calling (stac rew i) now fails if "rew" has no effect on the goal
10201 [previously, this check worked only if the rewrite rule was unconditional]
10202 Now rew can involve either definitions or equalities (either == or =).
10207 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10208 only the theorems proved on ZF.ML;
10210 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10211 It and 'sym RS equals0D' are now in the default claset, giving automatic
10212 disjointness reasoning but breaking a few old proofs.
10214 * ZF/Update: new theory of function updates
10215 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10216 may also be iterated as in f(a:=b,c:=d,...);
10218 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10220 * calling (stac rew i) now fails if "rew" has no effect on the goal
10221 [previously, this check worked only if the rewrite rule was unconditional]
10222 Now rew can involve either definitions or equalities (either == or =).
10224 * case_tac provided for compatibility with HOL
10225 (like the old excluded_middle_tac, but with subgoals swapped)
10228 *** Internal programming interfaces ***
10230 * Pure: several new basic modules made available for general use, see
10231 also src/Pure/README;
10233 * improved the theory data mechanism to support encapsulation (data
10234 kind name replaced by private Object.kind, acting as authorization
10235 key); new type-safe user interface via functor TheoryDataFun; generic
10236 print_data function becomes basically useless;
10238 * removed global_names compatibility flag -- all theory declarations
10239 are qualified by default;
10241 * module Pure/Syntax now offers quote / antiquote translation
10242 functions (useful for Hoare logic etc. with implicit dependencies);
10243 see HOL/ex/Antiquote for an example use;
10245 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10248 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10251 * Display.print_goals function moved to Locale.print_goals;
10253 * standard print function for goals supports current_goals_markers
10254 variable for marking begin of proof, end of proof, start of goal; the
10255 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10256 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10261 New in Isabelle98 (January 1998)
10262 --------------------------------
10264 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10266 * changed lexical syntax of terms / types: dots made part of long
10267 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10269 * simpset (and claset) reference variable replaced by functions
10270 simpset / simpset_ref;
10272 * no longer supports theory aliases (via merge) and non-trivial
10273 implicit merge of thms' signatures;
10275 * most internal names of constants changed due to qualified names;
10277 * changed Pure/Sequence interface (see Pure/seq.ML);
10280 *** General Changes ***
10282 * hierachically structured name spaces (for consts, types, axms, thms
10283 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10284 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10285 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10286 long_names for fully qualified output names; NOTE: ML programs
10287 (special tactics, packages etc.) referring to internal names may have
10288 to be adapted to cope with fully qualified names; in case of severe
10289 backward campatibility problems try setting 'global_names' at compile
10290 time to have enrything declared within a flat name space; one may also
10291 fine tune name declarations in theories via the 'global' and 'local'
10294 * reimplemented the implicit simpset and claset using the new anytype
10295 data filed in signatures; references simpset:simpset ref etc. are
10296 replaced by functions simpset:unit->simpset and
10297 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10298 to patch your ML files accordingly;
10300 * HTML output now includes theory graph data for display with Java
10301 applet or isatool browser; data generated automatically via isatool
10302 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10304 * defs may now be conditional; improved rewrite_goals_tac to handle
10305 conditional equations;
10307 * defs now admits additional type arguments, using TYPE('a) syntax;
10309 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10310 creates a new theory node; implicit merge of thms' signatures is
10311 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10312 transfer:theory->thm->thm in (rare) cases;
10314 * improved handling of draft signatures / theories; draft thms (and
10315 ctyps, cterms) are automatically promoted to real ones;
10317 * slightly changed interfaces for oracles: admit many per theory, named
10318 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10320 * print_goals: optional output of const types (set show_consts and
10323 * improved output of warnings (###) and errors (***);
10325 * subgoal_tac displays a warning if the new subgoal has type variables;
10327 * removed old README and Makefiles;
10329 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10331 * removed obsolete init_pps and init_database;
10333 * deleted the obsolete tactical STATE, which was declared by
10334 fun STATE tacfun st = tacfun st st;
10336 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10337 (which abbreviates $HOME);
10339 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10340 use isatool fixseq to adapt your ML programs (this works for fully
10341 qualified references to the Sequence structure only!);
10343 * use_thy no longer requires writable current directory; it always
10344 reloads .ML *and* .thy file, if either one is out of date;
10347 *** Classical Reasoner ***
10349 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10350 tactics that use classical reasoning to simplify a subgoal without
10351 splitting it into several subgoals;
10353 * Safe_tac: like safe_tac but uses the default claset;
10358 * added simplification meta rules:
10359 (asm_)(full_)simplify: simpset -> thm -> thm;
10361 * simplifier.ML no longer part of Pure -- has to be loaded by object
10364 * added prems argument to simplification procedures;
10366 * HOL, FOL, ZF: added infix function `addsplits':
10367 instead of `<simpset> setloop (split_tac <thms>)'
10368 you can simply write `<simpset> addsplits <thms>'
10373 * TYPE('a) syntax for type reflection terms;
10375 * no longer handles consts with name "" -- declare as 'syntax' instead;
10377 * pretty printer: changed order of mixfix annotation preference (again!);
10379 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10384 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10385 with `addloop' of the simplifier to faciliate case splitting in premises.
10387 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10389 * HOL/Auth: new protocol proofs including some for the Internet
10392 * HOL/Map: new theory of `maps' a la VDM;
10394 * HOL/simplifier: simplification procedures nat_cancel_sums for
10395 cancelling out common nat summands from =, <, <= (in)equalities, or
10396 differences; simplification procedures nat_cancel_factor for
10397 cancelling common factor from =, <, <= (in)equalities over natural
10398 sums; nat_cancel contains both kinds of procedures, it is installed by
10399 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10401 * HOL/simplifier: terms of the form
10402 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10404 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10405 and those of the form
10406 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10408 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10411 Each datatype `t' now comes with a theorem `split_t_case' of the form
10413 P(t_case f1 ... fn x) =
10414 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10416 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10419 and a theorem `split_t_case_asm' of the form
10421 P(t_case f1 ... fn x) =
10422 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10424 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10426 which can be added to a simpset via `addsplits'. The existing theorems
10427 expand_list_case and expand_option_case have been renamed to
10428 split_list_case and split_option_case.
10431 - `pred n' is automatically converted to `n-1'.
10432 Users are strongly encouraged not to use `pred' any longer,
10433 because it will disappear altogether at some point.
10434 - Users are strongly encouraged to write "0 < n" rather than
10435 "n ~= 0". Theorems and proof tools have been modified towards this
10439 the function "set_of_list" has been renamed "set" (and its theorems too);
10440 the function "nth" now takes its arguments in the reverse order and
10441 has acquired the infix notation "!" as in "xs!n".
10443 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10445 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10446 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10448 * HOL/record: extensible records with schematic structural subtyping
10449 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10450 still lacks various theorems and concrete record syntax;
10455 * removed "axioms" and "generated by" sections;
10457 * replaced "ops" section by extended "consts" section, which is capable of
10458 handling the continuous function space "->" directly;
10461 . proves theorems immediately and stores them in the theory,
10462 . creates hierachical name space,
10463 . now uses normal mixfix annotations (instead of cinfix...),
10464 . minor changes to some names and values (for consistency),
10465 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10466 . separator between mutual domain defs: changed "," to "and",
10467 . improved handling of sort constraints; now they have to
10468 appear on the left-hand side of the equations only;
10470 * fixed LAM <x,y,zs>.b syntax;
10472 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10473 adm (%x. P (t x)), where P is chainfinite and t continuous;
10478 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10479 with `addloop' of the simplifier to faciliate case splitting in premises.
10481 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10482 in HOL, they strip ALL and --> from proved theorems;
10486 New in Isabelle94-8 (May 1997)
10487 ------------------------------
10489 *** General Changes ***
10491 * new utilities to build / run / maintain Isabelle etc. (in parts
10492 still somewhat experimental); old Makefiles etc. still functional;
10494 * new 'Isabelle System Manual';
10496 * INSTALL text, together with ./configure and ./build scripts;
10498 * reimplemented type inference for greater efficiency, better error
10499 messages and clean internal interface;
10501 * prlim command for dealing with lots of subgoals (an easier way of
10502 setting goals_limit);
10507 * supports alternative (named) syntax tables (parser and pretty
10508 printer); internal interface is provided by add_modesyntax(_i);
10510 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10511 be used in conjunction with the Isabelle symbol font; uses the
10512 "symbols" syntax table;
10514 * added token_translation interface (may translate name tokens in
10515 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10516 the current print_mode); IMPORTANT: user print translation functions
10517 are responsible for marking newly introduced bounds
10518 (Syntax.mark_boundT);
10520 * token translations for modes "xterm" and "xterm_color" that display
10521 names in bold, underline etc. or colors (which requires a color
10524 * infixes may now be declared with names independent of their syntax;
10526 * added typed_print_translation (like print_translation, but may
10527 access type of constant);
10530 *** Classical Reasoner ***
10532 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10533 some limitations. Blast_tac...
10534 + ignores addss, addbefore, addafter; this restriction is intrinsic
10535 + ignores elimination rules that don't have the correct format
10536 (the conclusion MUST be a formula variable)
10537 + ignores types, which can make HOL proofs fail
10538 + rules must not require higher-order unification, e.g. apply_type in ZF
10539 [message "Function Var's argument not a bound variable" relates to this]
10540 + its proof strategy is more general but can actually be slower
10542 * substitution with equality assumptions no longer permutes other
10545 * minor changes in semantics of addafter (now called addaltern); renamed
10546 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10547 (and access functions for it);
10549 * improved combination of classical reasoner and simplifier:
10550 + functions for handling clasimpsets
10551 + improvement of addss: now the simplifier is called _after_ the
10553 + safe variant of addss called addSss: uses safe simplifications
10554 _during_ the safe steps. It is more complete as it allows multiple
10555 instantiations of unknowns (e.g. with slow_tac).
10559 * added interface for simplification procedures (functions that
10560 produce *proven* rewrite rules on the fly, depending on current
10563 * ordering on terms as parameter (used for ordered rewriting);
10565 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10567 * the solver is now split into a safe and an unsafe part.
10568 This should be invisible for the normal user, except that the
10569 functions setsolver and addsolver have been renamed to setSolver and
10570 addSolver; added safe_asm_full_simp_tac;
10575 * a generic induction tactic `induct_tac' which works for all datatypes and
10576 also for type `nat';
10578 * a generic case distinction tactic `exhaust_tac' which works for all
10579 datatypes and also for type `nat';
10581 * each datatype comes with a function `size';
10583 * patterns in case expressions allow tuple patterns as arguments to
10584 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10586 * primrec now also works with type nat;
10588 * recdef: a new declaration form, allows general recursive functions to be
10589 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10591 * the constant for negation has been renamed from "not" to "Not" to
10592 harmonize with FOL, ZF, LK, etc.;
10594 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10597 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10599 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10600 problems in commutative rings, using axiomatic type classes for + and *;
10602 * more examples in HOL/MiniML and HOL/Auth;
10604 * more default rewrite rules for quantifiers, union/intersection;
10606 * a new constant `arbitrary == @x.False';
10608 * HOLCF/IOA replaces old HOL/IOA;
10610 * HOLCF changes: derived all rules and arities
10611 + axiomatic type classes instead of classes
10612 + typedef instead of faking type definitions
10613 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10614 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10615 + eliminated the types void, one, tr
10616 + use unit lift and bool lift (with translations) instead of one and tr
10617 + eliminated blift from Lift3.thy (use Def instead of blift)
10618 all eliminated rules are derived as theorems --> no visible changes ;
10623 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10624 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10625 as ZF_cs addSIs [equalityI];
10629 New in Isabelle94-7 (November 96)
10630 ---------------------------------
10632 * allowing negative levels (as offsets) in prlev and choplev;
10634 * super-linear speedup for large simplifications;
10636 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10637 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10638 FAIL); can suppress it using the command Delsimps (ex_simps @
10639 all_simps); De Morgan laws are also now included, by default;
10641 * improved printing of ==> : ~:
10643 * new object-logic "Sequents" adds linear logic, while replacing LK
10644 and Modal (thanks to Sara Kalvala);
10646 * HOL/Auth: correctness proofs for authentication protocols;
10648 * HOL: new auto_tac combines rewriting and classical reasoning (many
10649 examples on HOL/Auth);
10651 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10652 the rewriter and classical reasoner simultaneously;
10654 * function uresult no longer returns theorems in "standard" format;
10655 regain previous version by: val uresult = standard o uresult;
10659 New in Isabelle94-6
10660 -------------------
10662 * oracles -- these establish an interface between Isabelle and trusted
10663 external reasoners, which may deliver results as theorems;
10665 * proof objects (in particular record all uses of oracles);
10667 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10669 * "constdefs" section in theory files;
10671 * "primrec" section (HOL) no longer requires names;
10673 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10677 New in Isabelle94-5
10678 -------------------
10680 * reduced space requirements;
10682 * automatic HTML generation from theories;
10684 * theory files no longer require "..." (quotes) around most types;
10686 * new examples, including two proofs of the Church-Rosser theorem;
10688 * non-curried (1994) version of HOL is no longer distributed;
10692 New in Isabelle94-4
10693 -------------------
10695 * greatly reduced space requirements;
10697 * theory files (.thy) no longer require \...\ escapes at line breaks;
10699 * searchable theorem database (see the section "Retrieving theorems" on
10700 page 8 of the Reference Manual);
10702 * new examples, including Grabczewski's monumental case study of the
10705 * The previous version of HOL renamed to Old_HOL;
10707 * The new version of HOL (previously called CHOL) uses a curried syntax
10708 for functions. Application looks like f a b instead of f(a,b);
10710 * Mutually recursive inductive definitions finally work in HOL;
10712 * In ZF, pattern-matching on tuples is now available in all abstractions and
10713 translates to the operator "split";
10717 New in Isabelle94-3
10718 -------------------
10720 * new infix operator, addss, allowing the classical reasoner to
10721 perform simplification at each step of its search. Example:
10722 fast_tac (cs addss ss)
10724 * a new logic, CHOL, the same as HOL, but with a curried syntax
10725 for functions. Application looks like f a b instead of f(a,b). Also pairs
10726 look like (a,b) instead of <a,b>;
10728 * PLEASE NOTE: CHOL will eventually replace HOL!
10730 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10731 It translates to the operator "split". A new theory of integers is available;
10733 * In ZF, integer numerals now denote two's-complement binary integers.
10734 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10736 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10737 of the Axiom of Choice;
10741 New in Isabelle94-2
10742 -------------------
10744 * Significantly faster resolution;
10746 * the different sections in a .thy file can now be mixed and repeated
10749 * Database of theorems for FOL, HOL and ZF. New
10750 commands including qed, qed_goal and bind_thm store theorems in the database.
10752 * Simple database queries: return a named theorem (get_thm) or all theorems of
10753 a given theory (thms_of), or find out what theory a theorem was proved in
10756 * Bugs fixed in the inductive definition and datatype packages;
10758 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10759 and HOL_dup_cs obsolete;
10761 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10764 * Simpler definition of function space in ZF;
10766 * new results about cardinal and ordinal arithmetic in ZF;
10768 * 'subtype' facility in HOL for introducing new types as subsets of existing
10771 :mode=isabelle-news:wrap=hard:maxLineLen=72: