1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
12 * Fact generalization and consolidation:
13 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
16 * Purely algebraic definition of even. Fact generalization and consolidation:
17 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
18 even_zero_(nat|int) ~> even_zero
21 * Abolished neg_numeral.
22 * Canonical representation for minus one is "- 1".
23 * Canonical representation for other negative numbers is "- (numeral _)".
24 * When devising rule sets for number calculation, consider the
25 following cases: 0, 1, numeral _, - 1, - numeral _.
26 * Syntax for negative numerals is mere input syntax.
29 * Elimination of fact duplicates:
30 equals_zero_I ~> minus_unique
31 diff_eq_0_iff_eq ~> right_minus_eq
34 * Fact name consolidation:
35 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
36 minus_le_self_iff ~> neg_less_eq_nonneg
37 le_minus_self_iff ~> less_eq_neg_nonpos
38 neg_less_nonneg ~> neg_less_pos
39 less_minus_self_iff ~> less_neg_neg [simp]
42 * More simplification rules on unary and binary minus:
43 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
44 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
45 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
46 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
47 minus_add_cancel, uminus_add_conv_diff. These correspondingly
48 have been taken away from fact collections algebra_simps and
49 field_simps. INCOMPATIBILITY.
51 To restore proofs, the following patterns are helpful:
53 a) Arbitrary failing proof not involving "diff_def":
54 Consider simplification with algebra_simps or field_simps.
56 b) Lifting rules from addition to subtraction:
57 Try with "using <rule for addition> of [… "- _" …]" by simp".
59 c) Simplification with "diff_def": just drop "diff_def".
60 Consider simplification with algebra_simps or field_simps;
62 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
64 * SUP and INF generalized to conditionally_complete_lattice
66 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
67 Conditionally_Complete_Lattices. INCOMPATIBILITY.
69 * Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
70 instead of explicitly stating boundedness of sets.
75 * Toplevel function "use" refers to raw ML bootstrap environment,
76 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
77 Note that 'ML_file' is the canonical command to load ML files into the
82 New in Isabelle2013-1 (November 2013)
83 -------------------------------------
87 * Discontinued obsolete 'uses' within theory header. Note that
88 commands like 'ML_file' work without separate declaration of file
89 dependencies. Minor INCOMPATIBILITY.
91 * Discontinued redundant 'use' command, which was superseded by
92 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
94 * Simplified subscripts within identifiers, using plain \<^sub>
95 instead of the second copy \<^isub> and \<^isup>. Superscripts are
96 only for literal tokens within notation; explicit mixfix annotations
97 for consts or fixed variables may be used as fall-back for unusual
98 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
99 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
100 standardize symbols as a starting point for further manual cleanup.
101 The ML reference variable "legacy_isub_isup" may be set as temporary
102 workaround, to make the prover accept a subset of the old identifier
105 * Document antiquotations: term style "isub" has been renamed to
106 "sub". Minor INCOMPATIBILITY.
108 * Uniform management of "quick_and_dirty" as system option (see also
109 "isabelle options"), configuration option within the context (see also
110 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
111 INCOMPATIBILITY, need to use more official Isabelle means to access
112 quick_and_dirty, instead of historical poking into mutable reference.
114 * Renamed command 'print_configs' to 'print_options'. Minor
117 * Proper diagnostic command 'print_state'. Old 'pr' (with its
118 implicit change of some global references) is retained for now as
119 control command, e.g. for ProofGeneral 3.7.x.
121 * Discontinued 'print_drafts' command with its old-fashioned PS output
122 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
123 'display_drafts' instead and print via the regular document viewer.
125 * Updated and extended "isar-ref" and "implementation" manual,
126 eliminated old "ref" manual.
129 *** Prover IDE -- Isabelle/Scala/jEdit ***
131 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
134 * Dockable window "Documentation" provides access to Isabelle
137 * Dockable window "Find" provides query operations for formal entities
138 (GUI front-end to 'find_theorems' command).
140 * Dockable window "Sledgehammer" manages asynchronous / parallel
141 sledgehammer runs over existing document sources, independently of
142 normal editing and checking process.
144 * Dockable window "Timing" provides an overview of relevant command
145 timing information, depending on option jedit_timing_threshold. The
146 same timing information is shown in the extended tooltip of the
147 command keyword, when hovering the mouse over it while the CONTROL or
148 COMMAND modifier is pressed.
150 * Improved dockable window "Theories": Continuous checking of proof
151 document (visible and required parts) may be controlled explicitly,
152 using check box or shortcut "C+e ENTER". Individual theory nodes may
153 be marked explicitly as required and checked in full, using check box
154 or shortcut "C+e SPACE".
156 * Improved completion mechanism, which is now managed by the
157 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
158 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
160 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
161 isabelle.complete for explicit completion in Isabelle sources.
162 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
165 * Improved support of various "minor modes" for Isabelle NEWS,
166 options, session ROOT etc., with completion and SideKick tree view.
168 * Strictly monotonic document update, without premature cancellation of
169 running transactions that are still needed: avoid reset/restart of
170 such command executions while editing.
172 * Support for asynchronous print functions, as overlay to existing
175 * Support for automatic tools in HOL, which try to prove or disprove
176 toplevel theorem statements.
178 * Action isabelle.reset-font-size resets main text area font size
179 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
180 also "Plugin Options / Isabelle / General"). It can be bound to some
181 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
183 * File specifications in jEdit (e.g. file browser) may refer to
184 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
185 obsolete $ISABELLE_HOME_WINDOWS variable.
187 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
188 / Global Options / Appearance".
190 * Improved support of native Mac OS X functionality via "MacOSX"
191 plugin, which is now enabled by default.
196 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
197 In particular, 'interpretation' allows for non-persistent
198 interpretation within "context ... begin ... end" blocks offering a
199 light-weight alternative to 'sublocale'. See "isar-ref" manual for
202 * Improved locales diagnostic command 'print_dependencies'.
204 * Discontinued obsolete 'axioms' command, which has been marked as
205 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
206 instead, while observing its uniform scope for polymorphism.
208 * Discontinued empty name bindings in 'axiomatization'.
211 * System option "proofs" has been discontinued. Instead the global
212 state of Proofterm.proofs is persistently compiled into logic images
213 as required, notably HOL-Proofs. Users no longer need to change
214 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
216 * Syntax translation functions (print_translation etc.) always depend
217 on Proof.context. Discontinued former "(advanced)" option -- this is
218 now the default. Minor INCOMPATIBILITY.
220 * Former global reference trace_unify_fail is now available as
221 configuration option "unify_trace_failure" (global context only).
223 * SELECT_GOAL now retains the syntactic context of the overall goal
224 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
230 * Stronger precedence of syntax for big intersection and union on
231 sets, in accordance with corresponding lattice operations.
234 * Notation "{p:A. P}" now allows tuple patterns as well.
236 * Nested case expressions are now translated in a separate check phase
237 rather than during parsing. The data for case combinators is separated
238 from the datatype package. The declaration attribute
239 "case_translation" can be used to register new case combinators:
241 declare [[case_translation case_combinator constructor1 ... constructorN]]
244 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
246 - 'code_identifier' declares name hints for arbitrary identifiers in
247 generated code, subsuming 'code_modulename'.
249 See the isar-ref manual for syntax diagrams, and the HOL theories for
252 * Attibute 'code': 'code' now declares concrete and abstract code
253 equations uniformly. Use explicit 'code equation' and 'code abstract'
254 to distinguish both when desired.
256 * Discontinued theories Code_Integer and Efficient_Nat by a more
257 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
258 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
259 generation for details. INCOMPATIBILITY.
261 * Numeric types are mapped by default to target language numerals:
262 natural (replaces former code_numeral) and integer (replaces former
263 code_int). Conversions are available as integer_of_natural /
264 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
265 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
266 ML). INCOMPATIBILITY.
268 * Function package: For mutually recursive functions f and g, separate
269 cases rules f.cases and g.cases are generated instead of unusable
270 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
271 in the case that the unusable rule was used nevertheless.
273 * Function package: For each function f, new rules f.elims are
274 generated, which eliminate equalities of the form "f x = t".
276 * New command 'fun_cases' derives ad-hoc elimination rules for
277 function equations as simplified instances of f.elims, analogous to
278 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
281 - parametrized correspondence relations are now supported:
282 + parametricity theorems for the raw term can be specified in
283 the command lift_definition, which allow us to generate stronger
285 + setup_lifting generates stronger transfer rules if parametric
286 correspondence relation can be generated
287 + various new properties of the relator must be specified to support
289 + parametricity theorem for the Quotient relation can be specified
290 - setup_lifting generates domain rules for the Transfer package
291 - stronger reflexivity prover of respectfulness theorems for type
293 - ===> and --> are now local. The symbols can be introduced
294 by interpreting the locale lifting_syntax (typically in an
296 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
297 Main. Potential INCOMPATIBILITY
298 - new commands for restoring and deleting Lifting/Transfer context:
299 lifting_forget, lifting_update
300 - the command print_quotmaps was renamed to print_quot_maps.
304 - better support for domains in Transfer: replace Domainp T
305 by the actual invariant in a transferred goal
306 - transfer rules can have as assumptions other transfer rules
307 - Experimental support for transferring from the raw level to the
308 abstract level: Transfer.transferred attribute
309 - Attribute version of the transfer method: untransferred attribute
311 * Reification and reflection:
312 - Reification is now directly available in HOL-Main in structure
314 - Reflection now handles multiple lists with variables also.
315 - The whole reflection stack has been decomposed into conversions.
318 * Revised devices for recursive definitions over finite sets:
319 - Only one fundamental fold combinator on finite set remains:
320 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
321 This is now identity on infinite sets.
322 - Locales ("mini packages") for fundamental definitions with
323 Finite_Set.fold: folding, folding_idem.
324 - Locales comm_monoid_set, semilattice_order_set and
325 semilattice_neutr_order_set for big operators on sets.
326 See theory Big_Operators for canonical examples.
327 Note that foundational constants comm_monoid_set.F and
328 semilattice_set.F correspond to former combinators fold_image
329 and fold1 respectively. These are now gone. You may use
330 those foundational constants as substitutes, but it is
331 preferable to interpret the above locales accordingly.
332 - Dropped class ab_semigroup_idem_mult (special case of lattice,
333 no longer needed in connection with Finite_Set.fold etc.)
335 card.union_inter ~> card_Un_Int [symmetric]
336 card.union_disjoint ~> card_Un_disjoint
339 * Locale hierarchy for abstract orderings and (semi)lattices.
341 * Complete_Partial_Order.admissible is defined outside the type class
342 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
343 class predicate assumption or sort constraint when possible.
346 * Introduce type class "conditionally_complete_lattice": Like a
347 complete lattice but does not assume the existence of the top and
348 bottom elements. Allows to generalize some lemmas about reals and
349 extended reals. Removed SupInf and replaced it by the instantiation
350 of conditionally_complete_lattice for real. Renamed lemmas about
351 conditionally-complete lattice from Sup_... to cSup_... and from
352 Inf_... to cInf_... to avoid hidding of similar complete lattice
355 * Introduce type class linear_continuum as combination of
356 conditionally-complete lattices and inner dense linorders which have
357 more than one element. INCOMPATIBILITY.
359 * Introduced type classes order_top and order_bot. The old classes top
360 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
361 Rename bot -> order_bot, top -> order_top
363 * Introduce type classes "no_top" and "no_bot" for orderings without
364 top and bottom elements.
366 * Split dense_linorder into inner_dense_order and no_top, no_bot.
368 * Complex_Main: Unify and move various concepts from
369 HOL-Multivariate_Analysis to HOL-Complex_Main.
371 - Introduce type class (lin)order_topology and
372 linear_continuum_topology. Allows to generalize theorems about
373 limits and order. Instances are reals and extended reals.
375 - continuous and continuos_on from Multivariate_Analysis:
376 "continuous" is the continuity of a function at a filter. "isCont"
377 is now an abbrevitation: "isCont x f == continuous (at _) f".
379 Generalized continuity lemmas from isCont to continuous on an
382 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
383 compactness of closed intervals on reals. Continuous functions
384 attain infimum and supremum on compact sets. The inverse of a
385 continuous function is continuous, when the function is continuous
388 - connected from Multivariate_Analysis. Use it to prove the
389 intermediate value theorem. Show connectedness of intervals on
390 linear_continuum_topology).
392 - first_countable_topology from Multivariate_Analysis. Is used to
393 show equivalence of properties on the neighbourhood filter of x and
394 on all sequences converging to x.
396 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
397 theorems from Library/FDERIV.thy to Deriv.thy and base the
398 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
399 which are restricted to sets, i.e. to represent derivatives from
402 - Removed the within-filter. It is replaced by the principal filter:
404 F within X = inf F (principal X)
406 - Introduce "at x within U" as a single constant, "at x" is now an
407 abbreviation for "at x within UNIV"
409 - Introduce named theorem collections tendsto_intros,
410 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
411 in tendsto_intros (or FDERIV_intros) are also available as
412 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
413 is replaced by a congruence rule. This allows to apply them as
414 intro rules and then proving equivalence by the simplifier.
416 - Restructured theories in HOL-Complex_Main:
418 + Moved RealDef and RComplete into Real
420 + Introduced Topological_Spaces and moved theorems about
421 topological spaces, filters, limits and continuity to it
423 + Renamed RealVector to Real_Vector_Spaces
425 + Split Lim, SEQ, Series into Topological_Spaces,
426 Real_Vector_Spaces, and Limits
428 + Moved Ln and Log to Transcendental
430 + Moved theorems about continuity from Deriv to Topological_Spaces
432 - Remove various auxiliary lemmas.
438 - Reduce incidence of "too high arity" errors
442 isar_shrink ~> isar_compress
444 - Added options "isar_try0", "spy"
445 - Better support for "isar_proofs"
446 - MaSh has been fined-tuned and now runs as a local server
448 * Improved support for ad hoc overloading of constants (see also
449 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
451 * Library/Polynomial.thy:
452 - Use lifting for primitive definitions.
453 - Explicit conversions from and to lists of coefficients, used for
455 - Replaced recursion operator poly_rec by fold_coeffs.
456 - Prefer pre-existing gcd operation for gcd.
458 poly_eq_iff ~> poly_eq_poly_eq_iff
460 expand_poly_eq ~> poly_eq_iff
463 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
464 case_of_simps to convert function definitions between a list of
465 equations with patterns on the lhs and a single equation with case
466 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
468 * New Library/FSet.thy: type of finite sets defined as a subtype of
469 sets defined by Lifting/Transfer.
471 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
473 * Consolidation of library theories on product orders:
475 Product_Lattice ~> Product_Order -- pointwise order on products
476 Product_ord ~> Product_Lexorder -- lexicographic order on products
480 * Imperative-HOL: The MREC combinator is considered legacy and no
481 longer included by default. INCOMPATIBILITY, use partial_function
482 instead, or import theory Legacy_Mrec as a fallback.
484 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
485 ~~/src/HOL/Algebra/poly. Existing theories should be based on
486 ~~/src/HOL/Library/Polynomial instead. The latter provides
487 integration with HOL's type classes for rings. INCOMPATIBILITY.
490 - Various improvements to BNF-based (co)datatype package, including
491 new commands "primrec_new", "primcorec", and
492 "datatype_new_compat", as well as documentation. See
493 "datatypes.pdf" for details.
494 - New "coinduction" method to avoid some boilerplate (compared to
500 - Renamed many generated theorems, including
502 map_comp' ~> map_comp
512 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
513 "check_property" allows to check specifications of the form "ALL x y
514 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
515 Examples.thy in particular.
517 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
518 tracing output in the command transaction context instead of physical
519 stdout. See also Toplevel.debug, Toplevel.debugging and
520 ML_Compiler.exn_trace.
522 * ML type "theory" is now immutable, without any special treatment of
523 drafts or linear updates (which could lead to "stale theory" errors in
524 the past). Discontinued obsolete operations like Theory.copy,
525 Theory.checkpoint, and the auxiliary type theory_ref. Minor
528 * More uniform naming of goal functions for skipped proofs:
530 Skip_Proof.prove ~> Goal.prove_sorry
531 Skip_Proof.prove_global ~> Goal.prove_sorry_global
533 Minor INCOMPATIBILITY.
535 * Simplifier tactics and tools use proper Proof.context instead of
536 historic type simpset. Old-style declarations like addsimps,
537 addsimprocs etc. operate directly on Proof.context. Raw type simpset
538 retains its use as snapshot of the main Simplifier context, using
539 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
540 old tools by making them depend on (ctxt : Proof.context) instead of
541 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
543 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
544 operate on Proof.context instead of claset, for uniformity with addIs,
545 addEs, addDs etc. Note that claset_of and put_claset allow to manage
546 clasets separately from the context.
548 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
549 INCOMPATIBILITY, use @{context} instead.
551 * Antiquotation @{theory_context A} is similar to @{theory A}, but
552 presents the result as initial Proof.context.
557 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
558 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
560 * Discontinued obsolete isabelle-process options -f and -u (former
561 administrative aliases of option -e). Minor INCOMPATIBILITY.
563 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
566 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
567 document formats: dvi.gz, ps, ps.gz -- the default document format is
570 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
571 specify global resources of the JVM process run by isabelle build.
573 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
574 to run Isabelle/Scala source files as standalone programs.
576 * Improved "isabelle keywords" tool (for old-style ProofGeneral
577 keyword tables): use Isabelle/Scala operations, which inspect outer
578 syntax without requiring to build sessions first.
580 * Sessions may be organized via 'chapter' specifications in the ROOT
581 file, which determines a two-level hierarchy of browser info. The old
582 tree-like organization via implicit sub-session relation (with its
583 tendency towards erratic fluctuation of URLs) has been discontinued.
584 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
585 for HTML presentation of theories.
589 New in Isabelle2013 (February 2013)
590 -----------------------------------
594 * Theorem status about oracles and unfinished/failed future proofs is
595 no longer printed by default, since it is incompatible with
596 incremental / parallel checking of the persistent document model. ML
597 function Thm.peek_status may be used to inspect a snapshot of the
598 ongoing evaluation process. Note that in batch mode --- notably
599 isabelle build --- the system ensures that future proofs of all
600 accessible theorems in the theory context are finished (as before).
602 * Configuration option show_markup controls direct inlining of markup
603 into the printed representation of formal entities --- notably type
604 and sort constraints. This enables Prover IDE users to retrieve that
605 information via tooltips in the output window, for example.
607 * Command 'ML_file' evaluates ML text from a file directly within the
608 theory, without any predeclaration via 'uses' in the theory header.
610 * Old command 'use' command and corresponding keyword 'uses' in the
611 theory header are legacy features and will be discontinued soon.
612 Tools that load their additional source files may imitate the
613 'ML_file' implementation, such that the system can take care of
614 dependencies properly.
616 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
617 is called fastforce / fast_force_tac already since Isabelle2011-1.
619 * Updated and extended "isar-ref" and "implementation" manual, reduced
620 remaining material in old "ref" manual.
622 * Improved support for auxiliary contexts that indicate block structure
623 for specifications. Nesting of "context fixes ... context assumes ..."
624 and "class ... context ...".
626 * Attribute "consumes" allows a negative value as well, which is
627 interpreted relatively to the total number of premises of the rule in
628 the target context. This form of declaration is stable when exported
629 from a nested 'context' with additional assumptions. It is the
630 preferred form for definitional packages, notably cases/rules produced
631 in HOL/inductive and HOL/function.
633 * More informative error messages for Isar proof commands involving
634 lazy enumerations (method applications etc.).
636 * Refined 'help' command to retrieve outer syntax commands according
637 to name patterns (with clickable results).
640 *** Prover IDE -- Isabelle/Scala/jEdit ***
642 * Parallel terminal proofs ('by') are enabled by default, likewise
643 proofs that are built into packages like 'datatype', 'function'. This
644 allows to "run ahead" checking the theory specifications on the
645 surface, while the prover is still crunching on internal
646 justifications. Unfinished / cancelled proofs are restarted as
647 required to complete full proof checking eventually.
649 * Improved output panel with tooltips, hyperlinks etc. based on the
650 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
651 tooltips leads to some window that supports the same recursively,
652 which can lead to stacks of tooltips as the semantic document content
653 is explored. ESCAPE closes the whole stack, individual windows may be
654 closed separately, or detached to become independent jEdit dockables.
656 * Improved support for commands that produce graph output: the text
657 message contains a clickable area to open a new instance of the graph
660 * More robust incremental parsing of outer syntax (partial comments,
661 malformed symbols). Changing the balance of open/close quotes and
662 comment delimiters works more conveniently with unfinished situations
663 that frequently occur in user interaction.
665 * More efficient painting and improved reactivity when editing large
666 files. More scalable management of formal document content.
668 * Smarter handling of tracing messages: prover process pauses after
669 certain number of messages per command transaction, with some user
670 dialog to stop or continue. This avoids swamping the front-end with
671 potentially infinite message streams.
673 * More plugin options and preferences, based on Isabelle/Scala. The
674 jEdit plugin option panel provides access to some Isabelle/Scala
675 options, including tuning parameters for editor reactivity and color
678 * Dockable window "Symbols" provides some editing support for Isabelle
681 * Dockable window "Monitor" shows ML runtime statistics. Note that
682 continuous display of the chart slows down the system.
684 * Improved editing support for control styles: subscript, superscript,
685 bold, reset of style -- operating on single symbols or text
686 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
688 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
689 adjust the main text area font size, and its derivatives for output,
690 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
691 need to be adapted to local keyboard layouts.
693 * More reactive completion popup by default: use \t (TAB) instead of
694 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
695 also "Plugin Options / SideKick / General / Code Completion Options".
697 * Implicit check and build dialog of the specified logic session
698 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
699 demand, without bundling big platform-dependent heap images in the
700 Isabelle distribution.
702 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
703 from Oracle provide better multi-platform experience. This version is
704 now bundled exclusively with Isabelle.
709 * Code generation for Haskell: restrict unqualified imports from
710 Haskell Prelude to a small set of fundamental operations.
712 * Command 'export_code': relative file names are interpreted
713 relatively to master directory of current theory rather than the
714 rather arbitrary current working directory. INCOMPATIBILITY.
716 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
717 use regular rule composition via "OF" / "THEN", or explicit proof
718 structure instead. Note that Isabelle/ML provides a variety of
719 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
720 with some care where this is really required.
722 * Command 'typ' supports an additional variant with explicit sort
723 constraint, to infer and check the most general type conforming to a
724 given sort. Example (in HOL):
726 typ "_ * _ * bool * unit" :: finite
728 * Command 'locale_deps' visualizes all locales and their relations as
736 - Added MaSh relevance filter based on machine-learning; see the
737 Sledgehammer manual for details.
738 - Polished Isar proofs generated with "isar_proofs" option.
739 - Rationalized type encodings ("type_enc" option).
740 - Renamed "kill_provers" subcommand to "kill_all".
742 isar_proof ~> isar_proofs
743 isar_shrink_factor ~> isar_shrink
744 max_relevant ~> max_facts
745 relevance_thresholds ~> fact_thresholds
747 * Quickcheck: added an optimisation for equality premises. It is
748 switched on by default, and can be switched off by setting the
749 configuration quickcheck_optimise_equality to false.
751 * Quotient: only one quotient can be defined by quotient_type
755 - generation of an abstraction function equation in lift_definition
757 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
759 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
762 * Preprocessing of the code generator rewrites set comprehensions into
763 pointfree expressions.
765 * The SMT solver Z3 has now by default a restricted set of directly
766 supported features. For the full set of features (div/mod, nonlinear
767 arithmetic, datatypes/records) with potential proof reconstruction
768 failures, enable the configuration option "z3_with_extensions". Minor
771 * Simplified 'typedef' specifications: historical options for implicit
772 set definition and alternative name have been discontinued. The
773 former behavior of "typedef (open) t = A" is now the default, but
774 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
777 * Removed constant "chars"; prefer "Enum.enum" on type "char"
778 directly. INCOMPATIBILITY.
780 * Moved operation product, sublists and n_lists from theory Enum to
781 List. INCOMPATIBILITY.
783 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
785 * Class "comm_monoid_diff" formalises properties of bounded
786 subtraction, with natural numbers and multisets as typical instances.
788 * Added combinator "Option.these" with type "'a option set => 'a set".
790 * Theory "Transitive_Closure": renamed lemmas
792 reflcl_tranclp -> reflclp_tranclp
793 rtranclp_reflcl -> rtranclp_reflclp
797 * Theory "Rings": renamed lemmas (in class semiring)
799 left_distrib ~> distrib_right
800 right_distrib ~> distrib_left
804 * Generalized the definition of limits:
806 - Introduced the predicate filterlim (LIM x F. f x :> G) which
807 expresses that when the input values x converge to F then the
808 output f x converges to G.
810 - Added filters for convergence to positive (at_top) and negative
813 - Moved infinity in the norm (at_infinity) from
814 Multivariate_Analysis to Complex_Main.
816 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
821 * Theory "Library/Option_ord" provides instantiation of option type to
822 lattice type classes.
824 * Theory "Library/Multiset": renamed
826 constant fold_mset ~> Multiset.fold
827 fact fold_mset_commute ~> fold_mset_comm
831 * Renamed theory Library/List_Prefix to Library/Sublist, with related
834 - Renamed constants (and related lemmas)
837 strict_prefix ~> prefix
839 - Replaced constant "postfix" by "suffixeq" with swapped argument
840 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
841 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
842 Renamed lemmas accordingly.
844 - Added constant "list_hembeq" for homeomorphic embedding on
845 lists. Added abbreviation "sublisteq" for special case
846 "list_hembeq (op =)".
848 - Theory Library/Sublist no longer provides "order" and "bot" type
849 class instances for the prefix order (merely corresponding locale
850 interpretations). The type class instances are now in theory
851 Library/Prefix_Order.
853 - The sublist relation of theory Library/Sublist_Order is now based
854 on "Sublist.sublisteq". Renamed lemmas accordingly:
856 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
857 le_list_append_mono ~> Sublist.list_hembeq_append_mono
858 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
859 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
860 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
861 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
862 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
863 le_list_drop_many ~> Sublist.sublisteq_drop_many
864 le_list_filter_left ~> Sublist.sublisteq_filter_left
865 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
866 le_list_rev_take_iff ~> Sublist.sublisteq_append
867 le_list_same_length ~> Sublist.sublisteq_same_length
868 le_list_take_many_iff ~> Sublist.sublisteq_append'
869 less_eq_list.drop ~> less_eq_list_drop
870 less_eq_list.induct ~> less_eq_list_induct
871 not_le_list_length ~> Sublist.not_sublisteq_length
875 * New theory Library/Countable_Set.
877 * Theory Library/Debug and Library/Parallel provide debugging and
878 parallel execution for code generated towards Isabelle/ML.
880 * Theory Library/FuncSet: Extended support for Pi and extensional and
881 introduce the extensional dependent function space "PiE". Replaced
882 extensional_funcset by an abbreviation, and renamed lemmas from
883 extensional_funcset to PiE as follows:
885 extensional_empty ~> PiE_empty
886 extensional_funcset_empty_domain ~> PiE_empty_domain
887 extensional_funcset_empty_range ~> PiE_empty_range
888 extensional_funcset_arb ~> PiE_arb
889 extensional_funcset_mem ~> PiE_mem
890 extensional_funcset_extend_domainI ~> PiE_fun_upd
891 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
892 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
893 card_extensional_funcset ~> card_PiE
894 finite_extensional_funcset ~> finite_PiE
898 * Theory Library/FinFun: theory of almost everywhere constant
899 functions (supersedes the AFP entry "Code Generation for Functions as
902 * Theory Library/Phantom: generic phantom type to make a type
903 parameter appear in a constant's type. This alternative to adding
904 TYPE('a) as another parameter avoids unnecessary closures in generated
907 * Theory Library/RBT_Impl: efficient construction of red-black trees
908 from sorted associative lists. Merging two trees with rbt_union may
909 return a structurally different tree than before. Potential
912 * Theory Library/IArray: immutable arrays with code generation.
914 * Theory Library/Finite_Lattice: theory of finite lattices.
916 * HOL/Multivariate_Analysis: replaced
918 "basis :: 'a::euclidean_space => nat => real"
919 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
921 on euclidean spaces by using the inner product "_ \<bullet> _" with
922 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
923 "SUM i : Basis. f i * r i".
925 With this change the following constants are also changed or removed:
927 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
928 a $$ i ~> inner a i (where i : Basis)
930 \<pi>, \<pi>' removed
932 Theorems about these constants where removed.
936 component_le_norm ~> Basis_le_norm
937 euclidean_eq ~> euclidean_eq_iff
938 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
939 euclidean_simps ~> inner_simps
940 independent_basis ~> independent_Basis
941 span_basis ~> span_Basis
942 in_span_basis ~> in_span_Basis
943 norm_bound_component_le ~> norm_boound_Basis_le
944 norm_bound_component_lt ~> norm_boound_Basis_lt
945 component_le_infnorm ~> Basis_le_infnorm
951 - Added simproc "measurable" to automatically prove measurability.
953 - Added induction rules for sigma sets with disjoint union
954 (sigma_sets_induct_disjoint) and for Borel-measurable functions
955 (borel_measurable_induct).
957 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
960 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
961 AFP entry "Ordinals_and_Cardinals").
963 * HOL/BNF: New (co)datatype package based on bounded natural functors
964 with support for mixed, nested recursion and interesting non-free
967 * HOL/Finite_Set and Relation: added new set and relation operations
968 expressed by Finite_Set.fold.
970 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
971 trees for the code generator.
973 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
975 possible INCOMPATIBILITY.
977 * HOL/Set: renamed Set.project -> Set.filter
981 *** Document preparation ***
983 * Dropped legacy antiquotations "term_style" and "thm_style", since
984 styles may be given as arguments to "term" and "thm" already.
985 Discontinued legacy styles "prem1" .. "prem19".
987 * Default LaTeX rendering for \<euro> is now based on eurosym package,
988 instead of slightly exotic babel/greek.
990 * Document variant NAME may use different LaTeX entry point
991 document/root_NAME.tex if that file exists, instead of the common
994 * Simplified custom document/build script, instead of old-style
995 document/IsaMakefile. Minor INCOMPATIBILITY.
1000 * The default limit for maximum number of worker threads is now 8,
1001 instead of 4, in correspondence to capabilities of contemporary
1002 hardware and Poly/ML runtime system.
1004 * Type Seq.results and related operations support embedded error
1005 messages within lazy enumerations, and thus allow to provide
1006 informative errors in the absence of any usable results.
1008 * Renamed Position.str_of to Position.here to emphasize that this is a
1009 formal device to inline positions into message text, but not
1010 necessarily printing visible text.
1015 * Advanced support for Isabelle sessions and build management, see
1016 "system" manual for the chapter of that name, especially the "isabelle
1017 build" tool and its examples. The "isabelle mkroot" tool prepares
1018 session root directories for use with "isabelle build", similar to
1019 former "isabelle mkdir" for "isabelle usedir". Note that this affects
1020 document preparation as well. INCOMPATIBILITY, isabelle usedir /
1021 mkdir / make are rendered obsolete.
1023 * Discontinued obsolete Isabelle/build script, it is superseded by the
1024 regular isabelle build tool. For example:
1026 isabelle build -s -b HOL
1028 * Discontinued obsolete "isabelle makeall".
1030 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
1031 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
1032 provides some traditional targets that invoke "isabelle build". Note
1033 that this is inefficient! Applications of Isabelle/HOL involving
1034 "isabelle make" should be upgraded to use "isabelle build" directly.
1036 * The "isabelle options" tool prints Isabelle system options, as
1037 required for "isabelle build", for example.
1039 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
1040 Minor INCOMPATIBILITY in command-line options.
1042 * The "isabelle install" tool has now a simpler command-line. Minor
1045 * The "isabelle components" tool helps to resolve add-on components
1046 that are not bundled, or referenced from a bare-bones repository
1047 version of Isabelle.
1049 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
1050 platform family: "linux", "macos", "windows".
1052 * The ML system is configured as regular component, and no longer
1053 picked up from some surrounding directory. Potential INCOMPATIBILITY
1054 for home-made settings.
1056 * Improved ML runtime statistics (heap, threads, future tasks etc.).
1058 * Discontinued support for Poly/ML 5.2.1, which was the last version
1059 without exception positions and advanced ML compiler/toplevel
1062 * Discontinued special treatment of Proof General -- no longer guess
1063 PROOFGENERAL_HOME based on accidental file-system layout. Minor
1064 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
1065 settings manually, or use a Proof General version that has been
1066 bundled as Isabelle component.
1070 New in Isabelle2012 (May 2012)
1071 ------------------------------
1075 * Prover IDE (PIDE) improvements:
1077 - more robust Sledgehammer integration (as before the sledgehammer
1078 command-line needs to be typed into the source buffer)
1079 - markup for bound variables
1080 - markup for types of term variables (displayed as tooltips)
1081 - support for user-defined Isar commands within the running session
1082 - improved support for Unicode outside original 16bit range
1083 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1085 * Forward declaration of outer syntax keywords within the theory
1086 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1087 commands to be used in the same theory where defined.
1089 * Auxiliary contexts indicate block structure for specifications with
1090 additional parameters and assumptions. Such unnamed contexts may be
1091 nested within other targets, like 'theory', 'locale', 'class',
1092 'instantiation' etc. Results from the local context are generalized
1093 accordingly and applied to the enclosing target context. Example:
1097 assumes xy: "x = y" and yz: "y = z"
1100 lemma my_trans: "x = z" using xy yz by simp
1106 The most basic application is to factor-out context elements of
1107 several fixes/assumes/shows theorem statements, e.g. see
1108 ~~/src/HOL/Isar_Examples/Group_Context.thy
1110 Any other local theory specification element works within the "context
1111 ... begin ... end" block as well.
1113 * Bundled declarations associate attributed fact expressions with a
1114 given name in the context. These may be later included in other
1115 contexts. This allows to manage context extensions casually, without
1116 the logical dependencies of locales and locale interpretation. See
1117 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1119 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1120 declaration, and results are standardized before being stored. Thus
1121 old-style "standard" after instantiation or composition of facts
1122 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1123 indices of schematic variables.
1125 * Rule attributes in local theory declarations (e.g. locale or class)
1126 are now statically evaluated: the resulting theorem is stored instead
1127 of the original expression. INCOMPATIBILITY in rare situations, where
1128 the historic accident of dynamic re-evaluation in interpretations
1131 * New tutorial "Programming and Proving in Isabelle/HOL"
1132 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1133 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1134 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1135 Logic" as the recommended beginners tutorial, but does not cover all
1136 of the material of that old tutorial.
1138 * Updated and extended reference manuals: "isar-ref",
1139 "implementation", "system"; reduced remaining material in old "ref"
1145 * Command 'definition' no longer exports the foundational "raw_def"
1146 into the user context. Minor INCOMPATIBILITY, may use the regular
1147 "def" result with attribute "abs_def" to imitate the old version.
1149 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1150 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1151 expand it. This also works for object-logic equality. (Formerly
1152 undocumented feature.)
1154 * Sort constraints are now propagated in simultaneous statements, just
1155 like type constraints. INCOMPATIBILITY in rare situations, where
1156 distinct sorts used to be assigned accidentally. For example:
1158 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1160 lemma "P (x::'a)" and "Q (y::'a::bar)"
1161 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1163 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1164 tolerant against multiple unifiers, as long as the final result is
1165 unique. (As before, rules are composed in canonical right-to-left
1166 order to accommodate newly introduced premises.)
1168 * Renamed some inner syntax categories:
1174 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1175 "num_position" etc. are mainly used instead (which also include
1176 position information via constraints).
1178 * Simplified configuration options for syntax ambiguity: see
1179 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1180 manual. Minor INCOMPATIBILITY.
1182 * Discontinued configuration option "syntax_positions": atomic terms
1183 in parse trees are always annotated by position constraints.
1185 * Old code generator for SML and its commands 'code_module',
1186 'code_library', 'consts_code', 'types_code' have been discontinued.
1187 Use commands of the generic code generator instead. INCOMPATIBILITY.
1189 * Redundant attribute "code_inline" has been discontinued. Use
1190 "code_unfold" instead. INCOMPATIBILITY.
1192 * Dropped attribute "code_unfold_post" in favor of the its dual
1193 "code_abbrev", which yields a common pattern in definitions like
1195 definition [code_abbrev]: "f = t"
1199 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1200 instead. INCOMPATIBILITY.
1202 * Discontinued old "prems" fact, which used to refer to the accidental
1203 collection of foundational premises in the context (already marked as
1204 legacy since Isabelle2011).
1209 * Type 'a set is now a proper type constructor (just as before
1210 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1211 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1212 sets separate, it is often sufficient to rephrase some set S that has
1213 been accidentally used as predicates by "%x. x : S", and some
1214 predicate P that has been accidentally used as set by "{x. P x}".
1215 Corresponding proofs in a first step should be pruned from any
1216 tinkering with former theorems mem_def and Collect_def as far as
1219 For developments which deliberately mix predicates and sets, a
1220 planning step is necessary to determine what should become a predicate
1221 and what a set. It can be helpful to carry out that step in
1222 Isabelle2011-1 before jumping right into the current release.
1224 * Code generation by default implements sets as container type rather
1225 than predicates. INCOMPATIBILITY.
1227 * New type synonym 'a rel = ('a * 'a) set
1229 * The representation of numerals has changed. Datatype "num"
1230 represents strictly positive binary numerals, along with functions
1231 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1232 positive and negated numeric literals, respectively. See also
1233 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1234 user theories may require adaptations as follows:
1236 - Theorems with number_ring or number_semiring constraints: These
1237 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1239 - Theories defining numeric types: Remove number, number_semiring,
1240 and number_ring instances. Defer all theorems about numerals until
1241 after classes one and semigroup_add have been instantiated.
1243 - Numeral-only simp rules: Replace each rule having a "number_of v"
1244 pattern with two copies, one for numeral and one for neg_numeral.
1246 - Theorems about subclasses of semiring_1 or ring_1: These classes
1247 automatically support numerals now, so more simp rules and
1248 simprocs may now apply within the proof.
1250 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1251 Redefine using other integer operations.
1253 * Transfer: New package intended to generalize the existing
1254 "descending" method and related theorem attributes from the Quotient
1255 package. (Not all functionality is implemented yet, but future
1256 development will focus on Transfer as an eventual replacement for the
1257 corresponding parts of the Quotient package.)
1259 - transfer_rule attribute: Maintains a collection of transfer rules,
1260 which relate constants at two different types. Transfer rules may
1261 relate different type instances of the same polymorphic constant,
1262 or they may relate an operation on a raw type to a corresponding
1263 operation on an abstract type (quotient or subtype). For example:
1265 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1266 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1268 - transfer method: Replaces a subgoal on abstract types with an
1269 equivalent subgoal on the corresponding raw types. Constants are
1270 replaced with corresponding ones according to the transfer rules.
1271 Goals are generalized over all free variables by default; this is
1272 necessary for variables whose types change, but can be overridden
1273 for specific variables with e.g. "transfer fixing: x y z". The
1274 variant transfer' method allows replacing a subgoal with one that
1275 is logically stronger (rather than equivalent).
1277 - relator_eq attribute: Collects identity laws for relators of
1278 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1279 transfer method uses these lemmas to infer transfer rules for
1280 non-polymorphic constants on the fly.
1282 - transfer_prover method: Assists with proving a transfer rule for a
1283 new constant, provided the constant is defined in terms of other
1284 constants that already have transfer rules. It should be applied
1285 after unfolding the constant definitions.
1287 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1288 from type nat to type int.
1290 * Lifting: New package intended to generalize the quotient_definition
1291 facility of the Quotient package; designed to work with Transfer.
1293 - lift_definition command: Defines operations on an abstract type in
1294 terms of a corresponding operation on a representation
1295 type. Example syntax:
1297 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1300 Users must discharge a respectfulness proof obligation when each
1301 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1302 the proof is discharged automatically.) The obligation is
1303 presented in a user-friendly, readable form; a respectfulness
1304 theorem in the standard format and a transfer rule are generated
1307 - Integration with code_abstype: For typedefs (e.g. subtypes
1308 corresponding to a datatype invariant, such as dlist),
1309 lift_definition generates a code certificate theorem and sets up
1310 code generation for each constant.
1312 - setup_lifting command: Sets up the Lifting package to work with a
1313 user-defined type. The user must provide either a quotient theorem
1314 or a type_definition theorem. The package configures transfer
1315 rules for equality and quantifiers on the type, and sets up the
1316 lift_definition command to work with the type.
1318 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1319 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1320 Word/Word.thy and Library/Float.thy.
1324 - The 'quotient_type' command now supports a 'morphisms' option with
1325 rep and abs functions, similar to typedef.
1327 - 'quotient_type' sets up new types to work with the Lifting and
1328 Transfer packages, as with 'setup_lifting'.
1330 - The 'quotient_definition' command now requires the user to prove a
1331 respectfulness property at the point where the constant is
1332 defined, similar to lift_definition; INCOMPATIBILITY.
1334 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1335 accordingly, INCOMPATIBILITY.
1337 * New diagnostic command 'find_unused_assms' to find potentially
1338 superfluous assumptions in theorems using Quickcheck.
1342 - Quickcheck returns variable assignments as counterexamples, which
1343 allows to reveal the underspecification of functions under test.
1344 For example, refuting "hd xs = x", it presents the variable
1345 assignment xs = [] and x = a1 as a counterexample, assuming that
1346 any property is false whenever "hd []" occurs in it.
1348 These counterexample are marked as potentially spurious, as
1349 Quickcheck also returns "xs = []" as a counterexample to the
1350 obvious theorem "hd xs = hd xs".
1352 After finding a potentially spurious counterexample, Quickcheck
1353 continues searching for genuine ones.
1355 By default, Quickcheck shows potentially spurious and genuine
1356 counterexamples. The option "genuine_only" sets quickcheck to only
1357 show genuine counterexamples.
1359 - The command 'quickcheck_generator' creates random and exhaustive
1360 value generators for a given type and operations.
1362 It generates values by using the operations as if they were
1363 constructors of that type.
1365 - Support for multisets.
1367 - Added "use_subtype" options.
1369 - Added "quickcheck_locale" configuration to specify how to process
1370 conjectures in a locale context.
1372 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1373 and affecting 'rat' and 'real'.
1376 - Integrated more tightly with SPASS, as described in the ITP 2012
1377 paper "More SPASS with Isabelle".
1378 - Made it try "smt" as a fallback if "metis" fails or times out.
1379 - Added support for the following provers: Alt-Ergo (via Why3 and
1380 TFF1), iProver, iProver-Eq.
1381 - Sped up the minimizer.
1382 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1383 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1384 - Renamed "sound" option to "strict".
1386 * Metis: Added possibility to specify lambda translations scheme as a
1387 parenthesized argument (e.g., "by (metis (lifting) ...)").
1389 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1391 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1393 * New "case_product" attribute to generate a case rule doing multiple
1394 case distinctions at the same time. E.g.
1396 list.exhaust [case_product nat.exhaust]
1398 produces a rule which can be used to perform case distinction on both
1401 * New "eventually_elim" method as a generalized variant of the
1402 eventually_elim* rules. Supports structured proofs.
1404 * Typedef with implicit set definition is considered legacy. Use
1405 "typedef (open)" form instead, which will eventually become the
1408 * Record: code generation can be switched off manually with
1410 declare [[record_coden = false]] -- "default true"
1412 * Datatype: type parameters allow explicit sort constraints.
1414 * Concrete syntax for case expressions includes constraints for source
1415 positions, and thus produces Prover IDE markup for its bindings.
1416 INCOMPATIBILITY for old-style syntax translations that augment the
1417 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1420 * Clarified attribute "mono_set": pure declaration without modifying
1421 the result of the fact expression.
1423 * More default pred/set conversions on a couple of relation operations
1424 and predicates. Added powers of predicate relations. Consolidation
1425 of some relation theorems:
1427 converse_def ~> converse_unfold
1428 rel_comp_def ~> relcomp_unfold
1429 symp_def ~> (modified, use symp_def and sym_def instead)
1430 transp_def ~> transp_trans
1431 Domain_def ~> Domain_unfold
1432 Range_def ~> Domain_converse [symmetric]
1434 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1436 See theory "Relation" for examples for making use of pred/set
1437 conversions by means of attributes "to_set" and "to_pred".
1441 * Renamed facts about the power operation on relations, i.e., relpow
1442 to match the constant's name:
1444 rel_pow_1 ~> relpow_1
1445 rel_pow_0_I ~> relpow_0_I
1446 rel_pow_Suc_I ~> relpow_Suc_I
1447 rel_pow_Suc_I2 ~> relpow_Suc_I2
1448 rel_pow_0_E ~> relpow_0_E
1449 rel_pow_Suc_E ~> relpow_Suc_E
1450 rel_pow_E ~> relpow_E
1451 rel_pow_Suc_D2 ~> relpow_Suc_D2
1452 rel_pow_Suc_E2 ~> relpow_Suc_E2
1453 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1454 rel_pow_E2 ~> relpow_E2
1455 rel_pow_add ~> relpow_add
1456 rel_pow_commute ~> relpow
1457 rel_pow_empty ~> relpow_empty:
1458 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1459 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1460 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1461 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1462 rel_pow_fun_conv ~> relpow_fun_conv
1463 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1464 rel_pow_finite_bounded ~> relpow_finite_bounded
1465 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1466 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1467 single_valued_rel_pow ~> single_valued_relpow
1471 * Theory Relation: Consolidated constant name for relation composition
1472 and corresponding theorem names:
1474 - Renamed constant rel_comp to relcomp.
1476 - Dropped abbreviation pred_comp. Use relcompp instead.
1480 rel_compI ~> relcompI
1481 rel_compEpair ~> relcompEpair
1482 rel_compE ~> relcompE
1483 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1484 rel_comp_empty1 ~> relcomp_empty1
1485 rel_comp_mono ~> relcomp_mono
1486 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1487 rel_comp_distrib ~> relcomp_distrib
1488 rel_comp_distrib2 ~> relcomp_distrib2
1489 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1490 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1491 single_valued_rel_comp ~> single_valued_relcomp
1492 rel_comp_def ~> relcomp_unfold
1493 converse_rel_comp ~> converse_relcomp
1494 pred_compI ~> relcomppI
1495 pred_compE ~> relcomppE
1496 pred_comp_bot1 ~> relcompp_bot1
1497 pred_comp_bot2 ~> relcompp_bot2
1498 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1499 pred_comp_mono ~> relcompp_mono
1500 pred_comp_distrib ~> relcompp_distrib
1501 pred_comp_distrib2 ~> relcompp_distrib2
1502 converse_pred_comp ~> converse_relcompp
1504 finite_rel_comp ~> finite_relcomp
1506 set_rel_comp ~> set_relcomp
1510 * Theory Divides: Discontinued redundant theorems about div and mod.
1511 INCOMPATIBILITY, use the corresponding generic theorems instead.
1513 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1514 zdiv_self ~> div_self
1515 zmod_self ~> mod_self
1518 zdiv_zmod_equality ~> div_mod_equality2
1519 zdiv_zmod_equality2 ~> div_mod_equality
1520 zmod_zdiv_trivial ~> mod_div_trivial
1521 zdiv_zminus_zminus ~> div_minus_minus
1522 zmod_zminus_zminus ~> mod_minus_minus
1523 zdiv_zminus2 ~> div_minus_right
1524 zmod_zminus2 ~> mod_minus_right
1525 zdiv_minus1_right ~> div_minus1_right
1526 zmod_minus1_right ~> mod_minus1_right
1527 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1528 zmod_zmult1_eq ~> mod_mult_right_eq
1529 zpower_zmod ~> power_mod
1530 zdvd_zmod ~> dvd_mod
1531 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1532 mod_mult_distrib ~> mult_mod_left
1533 mod_mult_distrib2 ~> mult_mod_right
1535 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1536 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1538 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1540 * Consolidated theorem names concerning fold combinators:
1542 inf_INFI_fold_inf ~> inf_INF_fold_inf
1543 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1544 INFI_fold_inf ~> INF_fold_inf
1545 SUPR_fold_sup ~> SUP_fold_sup
1546 union_set ~> union_set_fold
1547 minus_set ~> minus_set_fold
1548 INFI_set_fold ~> INF_set_fold
1549 SUPR_set_fold ~> SUP_set_fold
1550 INF_code ~> INF_set_foldr
1551 SUP_code ~> SUP_set_foldr
1552 foldr.simps ~> foldr.simps (in point-free formulation)
1553 foldr_fold_rev ~> foldr_conv_fold
1554 foldl_fold ~> foldl_conv_fold
1555 foldr_foldr ~> foldr_conv_foldl
1556 foldl_foldr ~> foldl_conv_foldr
1557 fold_set_remdups ~> fold_set_fold_remdups
1558 fold_set ~> fold_set_fold
1559 fold1_set ~> fold1_set_fold
1563 * Dropped rarely useful theorems concerning fold combinators:
1564 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1565 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1566 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1567 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1568 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1569 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1570 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1571 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1572 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1573 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1575 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1576 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1577 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1578 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1579 lemmas over fold rather than foldr, or make use of lemmas
1580 fold_conv_foldr and fold_rev.
1582 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1583 through option types.
1585 * "Transitive_Closure.ntrancl": bounded transitive closure on
1588 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1590 * Theory Int: Discontinued many legacy theorems specific to type int.
1591 INCOMPATIBILITY, use the corresponding generic theorems instead.
1593 zminus_zminus ~> minus_minus
1594 zminus_0 ~> minus_zero
1595 zminus_zadd_distrib ~> minus_add_distrib
1596 zadd_commute ~> add_commute
1597 zadd_assoc ~> add_assoc
1598 zadd_left_commute ~> add_left_commute
1601 zadd_0 ~> add_0_left
1602 zadd_0_right ~> add_0_right
1603 zadd_zminus_inverse2 ~> left_minus
1604 zmult_zminus ~> mult_minus_left
1605 zmult_commute ~> mult_commute
1606 zmult_assoc ~> mult_assoc
1607 zadd_zmult_distrib ~> left_distrib
1608 zadd_zmult_distrib2 ~> right_distrib
1609 zdiff_zmult_distrib ~> left_diff_distrib
1610 zdiff_zmult_distrib2 ~> right_diff_distrib
1611 zmult_1 ~> mult_1_left
1612 zmult_1_right ~> mult_1_right
1613 zle_refl ~> order_refl
1614 zle_trans ~> order_trans
1615 zle_antisym ~> order_antisym
1616 zle_linear ~> linorder_linear
1617 zless_linear ~> linorder_less_linear
1618 zadd_left_mono ~> add_left_mono
1619 zadd_strict_right_mono ~> add_strict_right_mono
1620 zadd_zless_mono ~> add_less_le_mono
1621 int_0_less_1 ~> zero_less_one
1622 int_0_neq_1 ~> zero_neq_one
1624 zpower_zadd_distrib ~> power_add
1625 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1626 zero_le_zpower_abs ~> zero_le_power_abs
1628 * Theory Deriv: Renamed
1630 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1632 * Theory Library/Multiset: Improved code generation of multisets.
1634 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1635 are expressed via type classes again. The special syntax
1636 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1637 setsum_set, which is now subsumed by Big_Operators.setsum.
1640 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1641 use theory HOL/Library/Nat_Bijection instead.
1643 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1644 trees is now inside a type class context. Names of affected
1645 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1646 theories working directly with raw red-black trees, adapt the names as
1650 bulkload -> rbt_bulkload
1651 del_from_left -> rbt_del_from_left
1652 del_from_right -> rbt_del_from_right
1654 delete -> rbt_delete
1656 insert -> rbt_insert
1657 insertw -> rbt_insert_with
1658 insert_with_key -> rbt_insert_with_key
1659 map_entry -> rbt_map_entry
1660 lookup -> rbt_lookup
1661 sorted -> rbt_sorted
1662 tree_greater -> rbt_greater
1663 tree_less -> rbt_less
1664 tree_less_symbol -> rbt_less_symbol
1666 union_with -> rbt_union_with
1667 union_with_key -> rbt_union_with_key
1670 balance_left_sorted -> balance_left_rbt_sorted
1671 balance_left_tree_greater -> balance_left_rbt_greater
1672 balance_left_tree_less -> balance_left_rbt_less
1673 balance_right_sorted -> balance_right_rbt_sorted
1674 balance_right_tree_greater -> balance_right_rbt_greater
1675 balance_right_tree_less -> balance_right_rbt_less
1676 balance_sorted -> balance_rbt_sorted
1677 balance_tree_greater -> balance_rbt_greater
1678 balance_tree_less -> balance_rbt_less
1679 bulkload_is_rbt -> rbt_bulkload_is_rbt
1680 combine_sorted -> combine_rbt_sorted
1681 combine_tree_greater -> combine_rbt_greater
1682 combine_tree_less -> combine_rbt_less
1683 delete_in_tree -> rbt_delete_in_tree
1684 delete_is_rbt -> rbt_delete_is_rbt
1685 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1686 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1687 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1688 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1689 del_in_tree -> rbt_del_in_tree
1690 del_inv1_inv2 -> rbt_del_inv1_inv2
1691 del_sorted -> rbt_del_rbt_sorted
1692 del_tree_greater -> rbt_del_rbt_greater
1693 del_tree_less -> rbt_del_rbt_less
1694 dom_lookup_Branch -> dom_rbt_lookup_Branch
1695 entries_lookup -> entries_rbt_lookup
1696 finite_dom_lookup -> finite_dom_rbt_lookup
1697 insert_sorted -> rbt_insert_rbt_sorted
1698 insertw_is_rbt -> rbt_insertw_is_rbt
1699 insertwk_is_rbt -> rbt_insertwk_is_rbt
1700 insertwk_sorted -> rbt_insertwk_rbt_sorted
1701 insertw_sorted -> rbt_insertw_rbt_sorted
1702 ins_sorted -> ins_rbt_sorted
1703 ins_tree_greater -> ins_rbt_greater
1704 ins_tree_less -> ins_rbt_less
1705 is_rbt_sorted -> is_rbt_rbt_sorted
1706 lookup_balance -> rbt_lookup_balance
1707 lookup_bulkload -> rbt_lookup_rbt_bulkload
1708 lookup_delete -> rbt_lookup_rbt_delete
1709 lookup_Empty -> rbt_lookup_Empty
1710 lookup_from_in_tree -> rbt_lookup_from_in_tree
1711 lookup_in_tree -> rbt_lookup_in_tree
1712 lookup_ins -> rbt_lookup_ins
1713 lookup_insert -> rbt_lookup_rbt_insert
1714 lookup_insertw -> rbt_lookup_rbt_insertw
1715 lookup_insertwk -> rbt_lookup_rbt_insertwk
1716 lookup_keys -> rbt_lookup_keys
1717 lookup_map -> rbt_lookup_map
1718 lookup_map_entry -> rbt_lookup_rbt_map_entry
1719 lookup_tree_greater -> rbt_lookup_rbt_greater
1720 lookup_tree_less -> rbt_lookup_rbt_less
1721 lookup_union -> rbt_lookup_rbt_union
1722 map_entry_color_of -> rbt_map_entry_color_of
1723 map_entry_inv1 -> rbt_map_entry_inv1
1724 map_entry_inv2 -> rbt_map_entry_inv2
1725 map_entry_is_rbt -> rbt_map_entry_is_rbt
1726 map_entry_sorted -> rbt_map_entry_rbt_sorted
1727 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1728 map_entry_tree_less -> rbt_map_entry_rbt_less
1729 map_tree_greater -> map_rbt_greater
1730 map_tree_less -> map_rbt_less
1731 map_sorted -> map_rbt_sorted
1732 paint_sorted -> paint_rbt_sorted
1733 paint_lookup -> paint_rbt_lookup
1734 paint_tree_greater -> paint_rbt_greater
1735 paint_tree_less -> paint_rbt_less
1736 sorted_entries -> rbt_sorted_entries
1737 tree_greater_eq_trans -> rbt_greater_eq_trans
1738 tree_greater_nit -> rbt_greater_nit
1739 tree_greater_prop -> rbt_greater_prop
1740 tree_greater_simps -> rbt_greater_simps
1741 tree_greater_trans -> rbt_greater_trans
1742 tree_less_eq_trans -> rbt_less_eq_trans
1743 tree_less_nit -> rbt_less_nit
1744 tree_less_prop -> rbt_less_prop
1745 tree_less_simps -> rbt_less_simps
1746 tree_less_trans -> rbt_less_trans
1747 tree_ord_props -> rbt_ord_props
1748 union_Branch -> rbt_union_Branch
1749 union_is_rbt -> rbt_union_is_rbt
1750 unionw_is_rbt -> rbt_unionw_is_rbt
1751 unionwk_is_rbt -> rbt_unionwk_is_rbt
1752 unionwk_sorted -> rbt_unionwk_rbt_sorted
1754 * Theory HOL/Library/Float: Floating point numbers are now defined as
1755 a subset of the real numbers. All operations are defined using the
1756 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1763 round_down -> float_round_down
1764 round_up -> float_round_up
1768 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1771 abs_float_def -> Float.compute_float_abs
1772 bitlen_ge0 -> bitlen_nonneg
1773 bitlen.simps -> Float.compute_bitlen
1774 float_components -> Float_mantissa_exponent
1775 float_divl.simps -> Float.compute_float_divl
1776 float_divr.simps -> Float.compute_float_divr
1777 float_eq_odd -> mult_powr_eq_mult_powr_iff
1778 float_power -> real_of_float_power
1779 lapprox_posrat_def -> Float.compute_lapprox_posrat
1780 lapprox_rat.simps -> Float.compute_lapprox_rat
1781 le_float_def' -> Float.compute_float_le
1782 le_float_def -> less_eq_float.rep_eq
1783 less_float_def' -> Float.compute_float_less
1784 less_float_def -> less_float.rep_eq
1785 normfloat_def -> Float.compute_normfloat
1786 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1787 normfloat -> normfloat_def
1788 normfloat_unique -> use normfloat_def
1789 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1790 one_float_def -> Float.compute_float_one
1791 plus_float_def -> Float.compute_float_plus
1792 rapprox_posrat_def -> Float.compute_rapprox_posrat
1793 rapprox_rat.simps -> Float.compute_rapprox_rat
1794 real_of_float_0 -> zero_float.rep_eq
1795 real_of_float_1 -> one_float.rep_eq
1796 real_of_float_abs -> abs_float.rep_eq
1797 real_of_float_add -> plus_float.rep_eq
1798 real_of_float_minus -> uminus_float.rep_eq
1799 real_of_float_mult -> times_float.rep_eq
1800 real_of_float_simp -> Float.rep_eq
1801 real_of_float_sub -> minus_float.rep_eq
1802 round_down.simps -> Float.compute_float_round_down
1803 round_up.simps -> Float.compute_float_round_up
1804 times_float_def -> Float.compute_float_times
1805 uminus_float_def -> Float.compute_float_uminus
1806 zero_float_def -> Float.compute_float_zero
1808 Lemmas not necessary anymore, use the transfer method:
1809 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1810 float_divr, float_le_simp, float_less1_mantissa_bound,
1811 float_less_simp, float_less_zero, float_le_zero,
1812 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1813 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1814 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1815 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1816 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1817 round_up, zero_le_float, zero_less_float
1819 * New theory HOL/Library/DAList provides an abstract type for
1820 association lists with distinct keys.
1822 * Session HOL/IMP: Added new theory of abstract interpretation of
1825 * Session HOL-Import: Re-implementation from scratch is faster,
1826 simpler, and more scalable. Requires a proof bundle, which is
1827 available as an external component. Discontinued old (and mostly
1828 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1830 * Session HOL-Word: Discontinued many redundant theorems specific to
1831 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1834 word_sub_alt ~> word_sub_wi
1835 word_add_alt ~> word_add_def
1836 word_mult_alt ~> word_mult_def
1837 word_minus_alt ~> word_minus_def
1838 word_0_alt ~> word_0_wi
1839 word_1_alt ~> word_1_wi
1840 word_add_0 ~> add_0_left
1841 word_add_0_right ~> add_0_right
1842 word_mult_1 ~> mult_1_left
1843 word_mult_1_right ~> mult_1_right
1844 word_add_commute ~> add_commute
1845 word_add_assoc ~> add_assoc
1846 word_add_left_commute ~> add_left_commute
1847 word_mult_commute ~> mult_commute
1848 word_mult_assoc ~> mult_assoc
1849 word_mult_left_commute ~> mult_left_commute
1850 word_left_distrib ~> left_distrib
1851 word_right_distrib ~> right_distrib
1852 word_left_minus ~> left_minus
1853 word_diff_0_right ~> diff_0_right
1854 word_diff_self ~> diff_self
1855 word_sub_def ~> diff_minus
1856 word_diff_minus ~> diff_minus
1857 word_add_ac ~> add_ac
1858 word_mult_ac ~> mult_ac
1859 word_plus_ac0 ~> add_0_left add_0_right add_ac
1860 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1861 word_order_trans ~> order_trans
1862 word_order_refl ~> order_refl
1863 word_order_antisym ~> order_antisym
1864 word_order_linear ~> linorder_linear
1865 lenw1_zero_neq_one ~> zero_neq_one
1866 word_number_of_eq ~> number_of_eq
1867 word_of_int_add_hom ~> wi_hom_add
1868 word_of_int_sub_hom ~> wi_hom_sub
1869 word_of_int_mult_hom ~> wi_hom_mult
1870 word_of_int_minus_hom ~> wi_hom_neg
1871 word_of_int_succ_hom ~> wi_hom_succ
1872 word_of_int_pred_hom ~> wi_hom_pred
1873 word_of_int_0_hom ~> word_0_wi
1874 word_of_int_1_hom ~> word_1_wi
1876 * Session HOL-Word: New proof method "word_bitwise" for splitting
1877 machine word equalities and inequalities into logical circuits,
1878 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1879 multiplication, shifting by constants, bitwise operators and numeric
1880 constants. Requires fixed-length word types, not 'a word. Solves
1881 many standard word identities outright and converts more into first
1882 order problems amenable to blast or similar. See also examples in
1883 HOL/Word/Examples/WordExamples.thy.
1885 * Session HOL-Probability: Introduced the type "'a measure" to
1886 represent measures, this replaces the records 'a algebra and 'a
1887 measure_space. The locales based on subset_class now have two
1888 locale-parameters the space \<Omega> and the set of measurable sets M.
1889 The product of probability spaces uses now the same constant as the
1890 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1891 measure". Most constants are defined now outside of locales and gain
1892 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1893 Measure space constructions for distributions and densities now got
1894 their own constants distr and density. Instead of using locales to
1895 describe measure spaces with a finite space, the measure count_space
1896 and point_measure is introduced. INCOMPATIBILITY.
1900 finite_measure.\<mu>' -> measure
1901 product_algebra_generator -> prod_algebra
1902 product_prob_space.emb -> prod_emb
1903 product_prob_space.infprod_algebra -> PiM
1906 completeable_measure_space
1907 finite_measure_space
1909 finite_product_finite_prob_space
1910 finite_product_sigma_algebra
1911 finite_sigma_algebra
1913 pair_finite_prob_space
1914 pair_finite_sigma_algebra
1917 product_sigma_algebra
1921 distribution -> use distr measure, or distributed predicate
1923 joint_distribution -> use distr measure, or distributed predicate
1924 pair_measure_generator
1925 product_prob_space.infprod_algebra -> use PiM
1928 Replacement theorems:
1929 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1930 finite_measure.empty_measure -> measure_empty
1931 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1932 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1933 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1934 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1935 finite_measure.finite_measure -> finite_measure.emeasure_finite
1936 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1937 finite_measure.positive_measure' -> measure_nonneg
1938 finite_measure.real_measure -> finite_measure.emeasure_real
1939 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1940 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1941 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1942 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1943 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1944 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1945 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1946 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1947 information_space.entropy_commute -> information_space.entropy_commute_simple
1948 information_space.entropy_eq -> information_space.entropy_simple_distributed
1949 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1950 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1951 information_space.entropy_uniform_max -> information_space.entropy_uniform
1952 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1953 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1954 information_space.KL_ge_0 -> information_space.KL_nonneg
1955 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1956 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1957 Int_stable_cuboids -> Int_stable_atLeastAtMost
1958 Int_stable_product_algebra_generator -> positive_integral
1959 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1960 measure_space.additive -> emeasure_additive
1961 measure_space.AE_iff_null_set -> AE_iff_null
1962 measure_space.almost_everywhere_def -> eventually_ae_filter
1963 measure_space.almost_everywhere_vimage -> AE_distrD
1964 measure_space.continuity_from_above -> INF_emeasure_decseq
1965 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1966 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1967 measure_space.continuity_from_below -> SUP_emeasure_incseq
1968 measure_space_density -> emeasure_density
1969 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1970 measure_space.integrable_vimage -> integrable_distr
1971 measure_space.integral_translated_density -> integral_density
1972 measure_space.integral_vimage -> integral_distr
1973 measure_space.measure_additive -> plus_emeasure
1974 measure_space.measure_compl -> emeasure_compl
1975 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1976 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1977 measure_space.measure_decseq -> decseq_emeasure
1978 measure_space.measure_Diff -> emeasure_Diff
1979 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1980 measure_space.measure_eq_0 -> emeasure_eq_0
1981 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1982 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1983 measure_space.measure_incseq -> incseq_emeasure
1984 measure_space.measure_insert -> emeasure_insert
1985 measure_space.measure_mono -> emeasure_mono
1986 measure_space.measure_not_negative -> emeasure_not_MInf
1987 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1988 measure_space.measure_setsum -> setsum_emeasure
1989 measure_space.measure_setsum_split -> setsum_emeasure_cover
1990 measure_space.measure_space_vimage -> emeasure_distr
1991 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1992 measure_space.measure_subadditive -> subadditive
1993 measure_space.measure_top -> emeasure_space
1994 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1995 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1996 measure_space.positive_integral_translated_density -> positive_integral_density
1997 measure_space.positive_integral_vimage -> positive_integral_distr
1998 measure_space.real_continuity_from_above -> Lim_measure_decseq
1999 measure_space.real_continuity_from_below -> Lim_measure_incseq
2000 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
2001 measure_space.real_measure_Diff -> measure_Diff
2002 measure_space.real_measure_finite_Union -> measure_finite_Union
2003 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
2004 measure_space.real_measure_subadditive -> measure_subadditive
2005 measure_space.real_measure_Union -> measure_Union
2006 measure_space.real_measure_UNION -> measure_UNION
2007 measure_space.simple_function_vimage -> simple_function_comp
2008 measure_space.simple_integral_vimage -> simple_integral_distr
2009 measure_space.simple_integral_vimage -> simple_integral_distr
2010 measure_unique_Int_stable -> measure_eqI_generator_eq
2011 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
2012 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
2013 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
2014 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
2015 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
2016 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
2017 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
2018 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
2019 pair_sigma_algebra.sets_swap -> sets_pair_swap
2020 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
2021 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
2022 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
2023 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
2024 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
2025 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
2026 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
2027 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
2028 prob_space.measure_space_1 -> prob_space.emeasure_space_1
2029 prob_space.prob_space_vimage -> prob_space_distr
2030 prob_space.random_variable_restrict -> measurable_restrict
2031 prob_space_unique_Int_stable -> measure_eqI_prob_space
2032 product_algebraE -> prod_algebraE_all
2033 product_algebra_generator_der -> prod_algebra_eq_finite
2034 product_algebra_generator_into_space -> prod_algebra_sets_into_space
2035 product_algebraI -> sets_PiM_I_finite
2036 product_measure_exists -> product_sigma_finite.sigma_finite
2037 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
2038 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
2039 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
2040 product_prob_space.measurable_component -> measurable_component_singleton
2041 product_prob_space.measurable_emb -> measurable_prod_emb
2042 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
2043 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
2044 product_prob_space.measure_emb -> emeasure_prod_emb
2045 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
2046 product_sigma_algebra.product_algebra_into_space -> space_closed
2047 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
2048 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
2049 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
2050 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
2051 sets_product_algebra -> sets_PiM
2052 sigma_algebra.measurable_sigma -> measurable_measure_of
2053 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
2054 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
2055 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
2056 space_product_algebra -> space_PiM
2058 * Session HOL-TPTP: support to parse and import TPTP problems (all
2059 languages) into Isabelle/HOL.
2064 * New "case_product" attribute (see HOL).
2069 * Greater support for structured proofs involving induction or case
2072 * Much greater use of mathematical symbols.
2074 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2079 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2080 from a minor keyword introduced via theory header declaration.
2082 * Antiquotation @{command_spec "name"} produces the
2083 Outer_Syntax.command_spec from a major keyword introduced via theory
2084 header declaration; it can be passed to Outer_Syntax.command etc.
2086 * Local_Theory.define no longer hard-wires default theorem name
2087 "foo_def", but retains the binding as given. If that is Binding.empty
2088 / Attrib.empty_binding, the result is not registered as user-level
2089 fact. The Local_Theory.define_internal variant allows to specify a
2090 non-empty name (used for the foundation in the background theory),
2091 while omitting the fact binding in the user-context. Potential
2092 INCOMPATIBILITY for derived definitional packages: need to specify
2093 naming policy for primitive definitions more explicitly.
2095 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2096 conformance with similar operations in structure Term and Logic.
2098 * Antiquotation @{attributes [...]} embeds attribute source
2099 representation into the ML text, which is particularly useful with
2100 declarations like Local_Theory.note.
2102 * Structure Proof_Context follows standard naming scheme. Old
2103 ProofContext has been discontinued. INCOMPATIBILITY.
2105 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2106 change of semantics: update is applied to auxiliary local theory
2109 * Modernized some old-style infix operations:
2111 addeqcongs ~> Simplifier.add_eqcong
2112 deleqcongs ~> Simplifier.del_eqcong
2113 addcongs ~> Simplifier.add_cong
2114 delcongs ~> Simplifier.del_cong
2115 setmksimps ~> Simplifier.set_mksimps
2116 setmkcong ~> Simplifier.set_mkcong
2117 setmksym ~> Simplifier.set_mksym
2118 setmkeqTrue ~> Simplifier.set_mkeqTrue
2119 settermless ~> Simplifier.set_termless
2120 setsubgoaler ~> Simplifier.set_subgoaler
2121 addsplits ~> Splitter.add_split
2122 delsplits ~> Splitter.del_split
2127 * USER_HOME settings variable points to cross-platform user home
2128 directory, which coincides with HOME on POSIX systems only. Likewise,
2129 the Isabelle path specification "~" now expands to $USER_HOME, instead
2130 of former $HOME. A different default for USER_HOME may be set
2131 explicitly in shell environment, before Isabelle settings are
2132 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2133 the generic user home was intended.
2135 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2136 notation, which is useful for the jEdit file browser, for example.
2138 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2143 New in Isabelle2011-1 (October 2011)
2144 ------------------------------------
2148 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2149 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2151 - Management of multiple theory files directly from the editor
2152 buffer store -- bypassing the file-system (no requirement to save
2153 files for checking).
2155 - Markup of formal entities within the text buffer, with semantic
2156 highlighting, tooltips and hyperlinks to jump to defining source
2159 - Improved text rendering, with sub/superscripts in the source
2160 buffer (including support for copy/paste wrt. output panel, HTML
2161 theory output and other non-Isabelle text boxes).
2163 - Refined scheduling of proof checking and printing of results,
2164 based on interactive editor view. (Note: jEdit folding and
2165 narrowing allows to restrict buffer perspectives explicitly.)
2167 - Reduced CPU performance requirements, usable on machines with few
2170 - Reduced memory requirements due to pruning of unused document
2171 versions (garbage collection).
2173 See also ~~/src/Tools/jEdit/README.html for further information,
2174 including some remaining limitations.
2176 * Theory loader: source files are exclusively located via the master
2177 directory of each theory node (where the .thy file itself resides).
2178 The global load path (such as src/HOL/Library) has been discontinued.
2179 Note that the path element ~~ may be used to reference theories in the
2180 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2183 * Theory loader: source files are identified by content via SHA1
2184 digests. Discontinued former path/modtime identification and optional
2185 ISABELLE_FILE_IDENT plugin scripts.
2187 * Parallelization of nested Isar proofs is subject to
2188 Goal.parallel_proofs_threshold (default 100). See also isabelle
2191 * Name space: former unsynchronized references are now proper
2192 configuration options, with more conventional names:
2194 long_names ~> names_long
2195 short_names ~> names_short
2196 unique_names ~> names_unique
2198 Minor INCOMPATIBILITY, need to declare options in context like this:
2200 declare [[names_unique = false]]
2202 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2203 that the result needs to be unique, which means fact specifications
2204 may have to be refined after enriching a proof context.
2206 * Attribute "case_names" has been refined: the assumptions in each case
2207 can be named now by following the case name with [name1 name2 ...].
2209 * Isabelle/Isar reference manual has been updated and extended:
2210 - "Synopsis" provides a catalog of main Isar language concepts.
2211 - Formal references in syntax diagrams, via @{rail} antiquotation.
2212 - Updated material from classic "ref" manual, notably about
2213 "Classical Reasoner".
2218 * Class bot and top require underlying partial order rather than
2219 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2221 * Class complete_lattice: generalized a couple of lemmas from sets;
2222 generalized theorems INF_cong and SUP_cong. New type classes for
2223 complete boolean algebras and complete linear orders. Lemmas
2224 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2225 class complete_linorder.
2227 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2228 Sup_fun_def, Inf_apply, Sup_apply.
2230 Removed redundant lemmas (the right hand side gives hints how to
2231 replace them for (metis ...), or (simp only: ...) proofs):
2233 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2234 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2235 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2236 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2237 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2238 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2239 Inter_def ~> INF_def, image_def
2240 Union_def ~> SUP_def, image_def
2241 INT_eq ~> INF_def, and image_def
2242 UN_eq ~> SUP_def, and image_def
2243 INF_subset ~> INF_superset_mono [OF _ order_refl]
2245 More consistent and comprehensive names:
2247 INTER_eq_Inter_image ~> INF_def
2248 UNION_eq_Union_image ~> SUP_def
2251 INF_leI ~> INF_lower
2252 INF_leI2 ~> INF_lower2
2253 le_INFI ~> INF_greatest
2254 le_SUPI ~> SUP_upper
2255 le_SUPI2 ~> SUP_upper2
2256 SUP_leI ~> SUP_least
2257 INFI_bool_eq ~> INF_bool_eq
2258 SUPR_bool_eq ~> SUP_bool_eq
2259 INFI_apply ~> INF_apply
2260 SUPR_apply ~> SUP_apply
2261 INTER_def ~> INTER_eq
2262 UNION_def ~> UNION_eq
2266 * Renamed theory Complete_Lattice to Complete_Lattices.
2269 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2270 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2271 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2272 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2274 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2275 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2276 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2279 * Added syntactic classes "inf" and "sup" for the respective
2280 constants. INCOMPATIBILITY: Changes in the argument order of the
2281 (mostly internal) locale predicates for some derived classes.
2283 * Theorem collections ball_simps and bex_simps do not contain theorems
2284 referring to UNION any longer; these have been moved to collection
2285 UN_ball_bex_simps. INCOMPATIBILITY.
2287 * Theory Archimedean_Field: floor now is defined as parameter of a
2288 separate type class floor_ceiling.
2290 * Theory Finite_Set: more coherent development of fold_set locales:
2292 locale fun_left_comm ~> locale comp_fun_commute
2293 locale fun_left_comm_idem ~> locale comp_fun_idem
2295 Both use point-free characterization; interpretation proofs may need
2296 adjustment. INCOMPATIBILITY.
2298 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2299 accordance with standard mathematical terminology. INCOMPATIBILITY.
2301 * Theory Complex_Main: The locale interpretations for the
2302 bounded_linear and bounded_bilinear locales have been removed, in
2303 order to reduce the number of duplicate lemmas. Users must use the
2304 original names for distributivity theorems, potential INCOMPATIBILITY.
2306 divide.add ~> add_divide_distrib
2307 divide.diff ~> diff_divide_distrib
2308 divide.setsum ~> setsum_divide_distrib
2309 mult.add_right ~> right_distrib
2310 mult.diff_right ~> right_diff_distrib
2311 mult_right.setsum ~> setsum_right_distrib
2312 mult_left.diff ~> left_diff_distrib
2314 * Theory Complex_Main: Several redundant theorems have been removed or
2315 replaced by more general versions. INCOMPATIBILITY.
2317 real_diff_def ~> minus_real_def
2318 real_divide_def ~> divide_real_def
2319 real_less_def ~> less_le
2320 real_abs_def ~> abs_real_def
2321 real_sgn_def ~> sgn_real_def
2322 real_mult_commute ~> mult_commute
2323 real_mult_assoc ~> mult_assoc
2324 real_mult_1 ~> mult_1_left
2325 real_add_mult_distrib ~> left_distrib
2326 real_zero_not_eq_one ~> zero_neq_one
2327 real_mult_inverse_left ~> left_inverse
2328 INVERSE_ZERO ~> inverse_zero
2329 real_le_refl ~> order_refl
2330 real_le_antisym ~> order_antisym
2331 real_le_trans ~> order_trans
2332 real_le_linear ~> linear
2333 real_le_eq_diff ~> le_iff_diff_le_0
2334 real_add_left_mono ~> add_left_mono
2335 real_mult_order ~> mult_pos_pos
2336 real_mult_less_mono2 ~> mult_strict_left_mono
2337 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2338 real_0_le_divide_iff ~> zero_le_divide_iff
2339 realpow_two_disj ~> power2_eq_iff
2340 real_squared_diff_one_factored ~> square_diff_one_factored
2341 realpow_two_diff ~> square_diff_square_factored
2342 reals_complete2 ~> complete_real
2343 real_sum_squared_expand ~> power2_sum
2344 exp_ln_eq ~> ln_unique
2346 expi_zero ~> exp_zero
2347 lemma_DERIV_subst ~> DERIV_cong
2348 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2349 LIMSEQ_const ~> tendsto_const
2350 LIMSEQ_norm ~> tendsto_norm
2351 LIMSEQ_add ~> tendsto_add
2352 LIMSEQ_minus ~> tendsto_minus
2353 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2354 LIMSEQ_diff ~> tendsto_diff
2355 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2356 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2357 LIMSEQ_mult ~> tendsto_mult
2358 LIMSEQ_inverse ~> tendsto_inverse
2359 LIMSEQ_divide ~> tendsto_divide
2360 LIMSEQ_pow ~> tendsto_power
2361 LIMSEQ_setsum ~> tendsto_setsum
2362 LIMSEQ_setprod ~> tendsto_setprod
2363 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2364 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2365 LIMSEQ_imp_rabs ~> tendsto_rabs
2366 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2367 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2368 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2369 LIMSEQ_Complex ~> tendsto_Complex
2370 LIM_ident ~> tendsto_ident_at
2371 LIM_const ~> tendsto_const
2372 LIM_add ~> tendsto_add
2373 LIM_add_zero ~> tendsto_add_zero
2374 LIM_minus ~> tendsto_minus
2375 LIM_diff ~> tendsto_diff
2376 LIM_norm ~> tendsto_norm
2377 LIM_norm_zero ~> tendsto_norm_zero
2378 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2379 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2380 LIM_rabs ~> tendsto_rabs
2381 LIM_rabs_zero ~> tendsto_rabs_zero
2382 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2383 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2384 LIM_compose ~> tendsto_compose
2385 LIM_mult ~> tendsto_mult
2386 LIM_scaleR ~> tendsto_scaleR
2387 LIM_of_real ~> tendsto_of_real
2388 LIM_power ~> tendsto_power
2389 LIM_inverse ~> tendsto_inverse
2390 LIM_sgn ~> tendsto_sgn
2391 isCont_LIM_compose ~> isCont_tendsto_compose
2392 bounded_linear.LIM ~> bounded_linear.tendsto
2393 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2394 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2395 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2396 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2397 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2398 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2400 * Theory Complex_Main: The definition of infinite series was
2401 generalized. Now it is defined on the type class {topological_space,
2402 comm_monoid_add}. Hence it is useable also for extended real numbers.
2404 * Theory Complex_Main: The complex exponential function "expi" is now
2405 a type-constrained abbreviation for "exp :: complex => complex"; thus
2406 several polymorphic lemmas about "exp" are now applicable to "expi".
2410 - Theory Library/Code_Char_ord provides native ordering of
2411 characters in the target language.
2413 - Commands code_module and code_library are legacy, use export_code
2416 - Method "evaluation" is legacy, use method "eval" instead.
2418 - Legacy evaluator "SML" is deactivated by default. May be
2419 reactivated by the following theory command:
2421 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2423 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2425 * New proof method "induction" that gives induction hypotheses the
2426 name "IH", thus distinguishing them from further hypotheses that come
2427 from rule induction. The latter are still called "hyps". Method
2428 "induction" is a thin wrapper around "induct" and follows the same
2431 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2432 still available as a legacy feature for some time.
2435 - Added "need" and "total_consts" options.
2436 - Reintroduced "show_skolems" option by popular demand.
2437 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2441 - Use quasi-sound (and efficient) translations by default.
2442 - Added support for the following provers: E-ToFoF, LEO-II,
2443 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2444 - Automatically preplay and minimize proofs before showing them if
2445 this can be done within reasonable time.
2446 - sledgehammer available_provers ~> sledgehammer supported_provers.
2448 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2449 "max_mono_iters", and "max_new_mono_instances" options.
2450 - Removed "explicit_apply" and "full_types" options as well as "Full
2451 Types" Proof General menu item. INCOMPATIBILITY.
2454 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2455 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2459 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2460 "elim:" options. INCOMPATIBILITY.
2461 - Introduced 'try' that not only runs 'try_methods' but also
2462 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2465 - Added "eval" option to evaluate terms for the found counterexample
2466 (currently only supported by the default (exhaustive) tester).
2467 - Added post-processing of terms to obtain readable counterexamples
2468 (currently only supported by the default (exhaustive) tester).
2469 - New counterexample generator quickcheck[narrowing] enables
2470 narrowing-based testing. Requires the Glasgow Haskell compiler
2471 with its installation location defined in the Isabelle settings
2472 environment as ISABELLE_GHC.
2473 - Removed quickcheck tester "SML" based on the SML code generator
2474 (formly in HOL/Library).
2476 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2477 use 'partial_function' instead.
2479 * Theory Library/Extended_Reals replaces now the positive extended
2480 reals found in probability theory. This file is extended by
2481 Multivariate_Analysis/Extended_Real_Limits.
2483 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2484 from where it must be imported explicitly if it is really required.
2487 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2488 been moved here. INCOMPATIBILITY.
2490 * Theory Library/Saturated provides type of numbers with saturated
2493 * Theory Library/Product_Lattice defines a pointwise ordering for the
2494 product type 'a * 'b, and provides instance proofs for various order
2495 and lattice type classes.
2497 * Theory Library/Countable now provides the "countable_datatype" proof
2498 method for proving "countable" class instances for datatypes.
2500 * Theory Library/Cset_Monad allows do notation for computable sets
2501 (cset) via the generic monad ad-hoc overloading facility.
2503 * Library: Theories of common data structures are split into theories
2504 for implementation, an invariant-ensuring type, and connection to an
2505 abstract type. INCOMPATIBILITY.
2507 - RBT is split into RBT and RBT_Mapping.
2508 - AssocList is split and renamed into AList and AList_Mapping.
2509 - DList is split into DList_Impl, DList, and DList_Cset.
2510 - Cset is split into Cset and List_Cset.
2512 * Theory Library/Nat_Infinity has been renamed to
2513 Library/Extended_Nat, with name changes of the following types and
2516 type inat ~> type enat
2518 Infty ~> infinity (overloaded)
2522 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2523 been renamed accordingly. INCOMPATIBILITY.
2525 * Session Multivariate_Analysis: The euclidean_space type class now
2526 fixes a constant "Basis :: 'a set" consisting of the standard
2527 orthonormal basis for the type. Users now have the option of
2528 quantifying over this set instead of using the "basis" function, e.g.
2529 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2531 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2532 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2533 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2534 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2535 changed to match. Definition theorems for overloaded constants now use
2536 the standard "foo_vec_def" naming scheme. A few other theorems have
2537 been renamed as follows (INCOMPATIBILITY):
2539 Cart_eq ~> vec_eq_iff
2540 dist_nth_le_cart ~> dist_vec_nth_le
2541 tendsto_vector ~> vec_tendstoI
2542 Cauchy_vector ~> vec_CauchyI
2544 * Session Multivariate_Analysis: Several duplicate theorems have been
2545 removed, and other theorems have been renamed or replaced with more
2546 general versions. INCOMPATIBILITY.
2548 finite_choice ~> finite_set_choice
2549 eventually_conjI ~> eventually_conj
2550 eventually_and ~> eventually_conj_iff
2551 eventually_false ~> eventually_False
2552 setsum_norm ~> norm_setsum
2553 Lim_sequentially ~> LIMSEQ_def
2554 Lim_ident_at ~> LIM_ident
2555 Lim_const ~> tendsto_const
2556 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2557 Lim_neg ~> tendsto_minus
2558 Lim_add ~> tendsto_add
2559 Lim_sub ~> tendsto_diff
2560 Lim_mul ~> tendsto_scaleR
2561 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2562 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2563 Lim_linear ~> bounded_linear.tendsto
2564 Lim_component ~> tendsto_euclidean_component
2565 Lim_component_cart ~> tendsto_vec_nth
2566 Lim_inner ~> tendsto_inner [OF tendsto_const]
2567 dot_lsum ~> inner_setsum_left
2568 dot_rsum ~> inner_setsum_right
2569 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2570 continuous_neg ~> continuous_minus
2571 continuous_sub ~> continuous_diff
2572 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2573 continuous_mul ~> continuous_scaleR
2574 continuous_inv ~> continuous_inverse
2575 continuous_at_within_inv ~> continuous_at_within_inverse
2576 continuous_at_inv ~> continuous_at_inverse
2577 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2578 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2579 continuous_at_component ~> continuous_component [OF continuous_at_id]
2580 continuous_on_neg ~> continuous_on_minus
2581 continuous_on_sub ~> continuous_on_diff
2582 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2583 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2584 continuous_on_mul ~> continuous_on_scaleR
2585 continuous_on_mul_real ~> continuous_on_mult
2586 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2587 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2588 continuous_on_inverse ~> continuous_on_inv
2589 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2590 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2591 subset_interior ~> interior_mono
2592 subset_closure ~> closure_mono
2593 closure_univ ~> closure_UNIV
2594 real_arch_lt ~> reals_Archimedean2
2595 real_arch ~> reals_Archimedean3
2596 real_abs_norm ~> abs_norm_cancel
2597 real_abs_sub_norm ~> norm_triangle_ineq3
2598 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2600 * Session HOL-Probability:
2601 - Caratheodory's extension lemma is now proved for ring_of_sets.
2602 - Infinite products of probability measures are now available.
2603 - Sigma closure is independent, if the generator is independent
2604 - Use extended reals instead of positive extended
2605 reals. INCOMPATIBILITY.
2607 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2609 expand_fun_below ~> fun_below_iff
2610 below_fun_ext ~> fun_belowI
2611 expand_cfun_eq ~> cfun_eq_iff
2612 ext_cfun ~> cfun_eqI
2613 expand_cfun_below ~> cfun_below_iff
2614 below_cfun_ext ~> cfun_belowI
2615 monofun_fun_fun ~> fun_belowD
2616 monofun_fun_arg ~> monofunE
2617 monofun_lub_fun ~> adm_monofun [THEN admD]
2618 cont_lub_fun ~> adm_cont [THEN admD]
2619 cont2cont_Rep_CFun ~> cont2cont_APP
2620 cont_Rep_CFun_app ~> cont_APP_app
2621 cont_Rep_CFun_app_app ~> cont_APP_app_app
2622 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2623 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2624 contlub_cfun ~> lub_APP [symmetric]
2625 contlub_LAM ~> lub_LAM [symmetric]
2628 lift_distinct1 ~> lift.distinct(1)
2629 lift_distinct2 ~> lift.distinct(2)
2630 Def_not_UU ~> lift.distinct(2)
2631 Def_inject ~> lift.inject
2632 below_UU_iff ~> below_bottom_iff
2633 eq_UU_iff ~> eq_bottom_iff
2636 *** Document preparation ***
2638 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2639 isar-ref manual, both for description and actual application of the
2642 * Antiquotation @{value} evaluates the given term and presents its
2645 * Antiquotations: term style "isub" provides ad-hoc conversion of
2646 variables x1, y23 into subscripted form x\<^isub>1,
2647 y\<^isub>2\<^isub>3.
2649 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2650 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2652 * Localized \isabellestyle switch can be used within blocks or groups
2655 \isabellestyle{it} %preferred default
2656 {\isabellestylett @{text "typewriter stuff"}}
2658 * Discontinued special treatment of hard tabulators. Implicit
2659 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2665 * The inner syntax of sort/type/term/prop supports inlined YXML
2666 representations within quoted string tokens. By encoding logical
2667 entities via Term_XML (in ML or Scala) concrete syntax can be
2668 bypassed, which is particularly useful for producing bits of text
2669 under external program control.
2671 * Antiquotations for ML and document preparation are managed as theory
2672 data, which requires explicit setup.
2674 * Isabelle_Process.is_active allows tools to check if the official
2675 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2676 (better known as Proof General).
2678 * Structure Proof_Context follows standard naming scheme. Old
2679 ProofContext is still available for some time as legacy alias.
2681 * Structure Timing provides various operations for timing; supersedes
2682 former start_timing/end_timing etc.
2684 * Path.print is the official way to show file-system paths to users
2685 (including quotes etc.).
2687 * Inner syntax: identifiers in parse trees of generic categories
2688 "logic", "aprop", "idt" etc. carry position information (disguised as
2689 type constraints). Occasional INCOMPATIBILITY with non-compliant
2690 translations that choke on unexpected type constraints. Positions can
2691 be stripped in ML translations via Syntax.strip_positions /
2692 Syntax.strip_positions_ast, or via the syntax constant
2693 "_strip_positions" within parse trees. As last resort, positions can
2694 be disabled via the configuration option Syntax.positions, which is
2695 called "syntax_positions" in Isar attribute syntax.
2697 * Discontinued special status of various ML structures that contribute
2698 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2699 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2700 refer directly to Ast.Constant, Lexicon.is_identifier,
2701 Syntax_Trans.mk_binder_tr etc.
2703 * Typed print translation: discontinued show_sorts argument, which is
2704 already available via context of "advanced" translation.
2706 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2707 goal states; body tactic needs to address all subgoals uniformly.
2709 * Slightly more special eq_list/eq_set, with shortcut involving
2710 pointer equality (assumes that eq relation is reflexive).
2712 * Classical tactics use proper Proof.context instead of historic types
2713 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2714 operate directly on Proof.context. Raw type claset retains its use as
2715 snapshot of the classical context, which can be recovered via
2716 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2717 INCOMPATIBILITY, classical tactics and derived proof methods require
2718 proper Proof.context.
2723 * Discontinued support for Poly/ML 5.2, which was the last version
2724 without proper multithreading and TimeLimit implementation.
2726 * Discontinued old lib/scripts/polyml-platform, which has been
2727 obsolete since Isabelle2009-2.
2729 * Various optional external tools are referenced more robustly and
2730 uniformly by explicit Isabelle settings as follows:
2732 ISABELLE_CSDP (formerly CSDP_EXE)
2733 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2734 ISABELLE_OCAML (formerly EXEC_OCAML)
2735 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2736 ISABELLE_YAP (formerly EXEC_YAP)
2738 Note that automated detection from the file-system or search path has
2739 been discontinued. INCOMPATIBILITY.
2741 * Scala layer provides JVM method invocation service for static
2742 methods of type (String)String, see Invoke_Scala.method in ML. For
2745 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2747 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2748 this allows to pass structured values between ML and Scala.
2750 * The IsabelleText fonts includes some further glyphs to support the
2751 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2752 installed a local copy (which is normally *not* required) need to
2753 delete or update it from ~~/lib/fonts/.
2757 New in Isabelle2011 (January 2011)
2758 ----------------------------------
2762 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2763 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2764 useful tooltips and hyperlinks produced from its static analysis. The
2765 bundled component provides an executable Isabelle tool that can be run
2768 Isabelle2011/bin/isabelle jedit
2770 * Significantly improved Isabelle/Isar implementation manual.
2772 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2773 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2774 while the default heap location within that directory lacks that extra
2775 suffix. This isolates multiple Isabelle installations from each
2776 other, avoiding problems with old settings in new versions.
2777 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2779 * Source files are always encoded as UTF-8, instead of old-fashioned
2780 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2781 the following package declarations:
2783 \usepackage[utf8]{inputenc}
2784 \usepackage{textcomp}
2786 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2787 a Unicode character is treated as a single symbol, not a sequence of
2788 non-ASCII bytes as before. Since Isabelle/ML string literals may
2789 contain symbols without further backslash escapes, Unicode can now be
2790 used here as well. Recall that Symbol.explode in ML provides a
2791 consistent view on symbols, while raw explode (or String.explode)
2792 merely give a byte-oriented representation.
2794 * Theory loader: source files are primarily located via the master
2795 directory of each theory node (where the .thy file itself resides).
2796 The global load path is still partially available as legacy feature.
2797 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2798 explicit paths, relatively to the theory.
2800 * Special treatment of ML file names has been discontinued.
2801 Historically, optional extensions .ML or .sml were added on demand --
2802 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2803 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2805 * Various options that affect pretty printing etc. are now properly
2806 handled within the context via configuration options, instead of
2807 unsynchronized references or print modes. There are both ML Config.T
2808 entities and Isar declaration attributes to access these.
2810 ML (Config.T) Isar (attribute)
2812 eta_contract eta_contract
2813 show_brackets show_brackets
2814 show_sorts show_sorts
2815 show_types show_types
2816 show_question_marks show_question_marks
2817 show_consts show_consts
2818 show_abbrevs show_abbrevs
2820 Syntax.ast_trace syntax_ast_trace
2821 Syntax.ast_stat syntax_ast_stat
2822 Syntax.ambiguity_level syntax_ambiguity_level
2824 Goal_Display.goals_limit goals_limit
2825 Goal_Display.show_main_goal show_main_goal
2827 Method.rule_trace rule_trace
2829 Thy_Output.display thy_output_display
2830 Thy_Output.quotes thy_output_quotes
2831 Thy_Output.indent thy_output_indent
2832 Thy_Output.source thy_output_source
2833 Thy_Output.break thy_output_break
2835 Note that corresponding "..._default" references in ML may only be
2836 changed globally at the ROOT session setup, but *not* within a theory.
2837 The option "show_abbrevs" supersedes the former print mode
2838 "no_abbrevs" with inverted meaning.
2840 * More systematic naming of some configuration options.
2843 trace_simp ~> simp_trace
2844 debug_simp ~> simp_debug
2846 * Support for real valued configuration options, using simplistic
2847 floating-point notation that coincides with the inner syntax for
2850 * Support for real valued preferences (with approximative PGIP type):
2851 front-ends need to accept "pgint" values in float notation.
2854 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2857 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2862 * Command 'type_synonym' (with single argument) replaces somewhat
2863 outdated 'types', which is still available as legacy feature for some
2866 * Command 'nonterminal' (with 'and' separated list of arguments)
2867 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2869 * Command 'notepad' replaces former 'example_proof' for
2870 experimentation in Isar without any result. INCOMPATIBILITY.
2872 * Locale interpretation commands 'interpret' and 'sublocale' accept
2873 lists of equations to map definitions in a locale to appropriate
2874 entities in the context of the interpretation. The 'interpretation'
2875 command already provided this functionality.
2877 * Diagnostic command 'print_dependencies' prints the locale instances
2878 that would be activated if the specified expression was interpreted in
2879 the current context. Variant "print_dependencies!" assumes a context
2880 without interpretations.
2882 * Diagnostic command 'print_interps' prints interpretations in proofs
2883 in addition to interpretations in theories.
2885 * Discontinued obsolete 'global' and 'local' commands to manipulate
2886 the theory name space. Rare INCOMPATIBILITY. The ML functions
2887 Sign.root_path and Sign.local_path may be applied directly where this
2888 feature is still required for historical reasons.
2890 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2891 'definition' instead.
2893 * The "prems" fact, which refers to the accidental collection of
2894 foundational premises in the context, is now explicitly marked as
2895 legacy feature and will be discontinued soon. Consider using "assms"
2896 of the head statement or reference facts by explicit names.
2898 * Document antiquotations @{class} and @{type} print classes and type
2901 * Document antiquotation @{file} checks file/directory entries within
2902 the local file system.
2907 * Coercive subtyping: functions can be declared as coercions and type
2908 inference will add them as necessary upon input of a term. Theory
2909 Complex_Main declares real :: nat => real and real :: int => real as
2910 coercions. A coercion function f is declared like this:
2912 declare [[coercion f]]
2914 To lift coercions through type constructors (e.g. from nat => real to
2915 nat list => real list), map functions can be declared, e.g.
2917 declare [[coercion_map map]]
2919 Currently coercion inference is activated only in theories including
2920 real numbers, i.e. descendants of Complex_Main. This is controlled by
2921 the configuration option "coercion_enabled", e.g. it can be enabled in
2922 other theories like this:
2924 declare [[coercion_enabled]]
2926 * Command 'partial_function' provides basic support for recursive
2927 function definitions over complete partial orders. Concrete instances
2928 are provided for i) the option type, ii) tail recursion on arbitrary
2929 types, and iii) the heap monad of Imperative_HOL. See
2930 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2933 * Function package: f.psimps rules are no longer implicitly declared
2934 as [simp]. INCOMPATIBILITY.
2936 * Datatype package: theorems generated for executable equality (class
2937 "eq") carry proper names and are treated as default code equations.
2939 * Inductive package: now offers command 'inductive_simps' to
2940 automatically derive instantiated and simplified equations for
2941 inductive predicates, similar to 'inductive_cases'.
2943 * Command 'enriched_type' allows to register properties of the
2944 functorial structure of types.
2946 * Improved infrastructure for term evaluation using code generator
2947 techniques, in particular static evaluation conversions.
2949 * Code generator: Scala (2.8 or higher) has been added to the target
2952 * Code generator: globbing constant expressions "*" and "Theory.*"
2953 have been replaced by the more idiomatic "_" and "Theory._".
2956 * Code generator: export_code without explicit file declaration prints
2957 to standard output. INCOMPATIBILITY.
2959 * Code generator: do not print function definitions for case
2960 combinators any longer.
2962 * Code generator: simplification with rules determined with
2963 src/Tools/Code/code_simp.ML and method "code_simp".
2965 * Code generator for records: more idiomatic representation of record
2966 types. Warning: records are not covered by ancient SML code
2967 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2968 rep_datatype declaration helps to succeed then:
2972 rep_datatype foo_ext ...
2974 * Records: logical foundation type for records does not carry a
2975 '_type' suffix any longer (obsolete due to authentic syntax).
2978 * Quickcheck now by default uses exhaustive testing instead of random
2979 testing. Random testing can be invoked by "quickcheck [random]",
2980 exhaustive testing by "quickcheck [exhaustive]".
2982 * Quickcheck instantiates polymorphic types with small finite
2983 datatypes by default. This enables a simple execution mechanism to
2984 handle quantifiers and function equality over the finite datatypes.
2986 * Quickcheck random generator has been renamed from "code" to
2987 "random". INCOMPATIBILITY.
2989 * Quickcheck now has a configurable time limit which is set to 30
2990 seconds by default. This can be changed by adding [timeout = n] to the
2991 quickcheck command. The time limit for Auto Quickcheck is still set
2994 * Quickcheck in locales considers interpretations of that locale for
2995 counter example search.
2998 - Added "smt" and "remote_smt" provers based on the "smt" proof
2999 method. See the Sledgehammer manual for details ("isabelle doc
3002 sledgehammer atp_info ~> sledgehammer running_provers
3003 sledgehammer atp_kill ~> sledgehammer kill_provers
3004 sledgehammer available_atps ~> sledgehammer available_provers
3007 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
3008 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
3009 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
3010 (and "ms" and "min" are no longer supported)
3015 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
3016 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
3018 - Added support for partial quotient types.
3019 - Added local versions of the "Nitpick.register_xxx" functions.
3020 - Added "whack" option.
3021 - Allow registration of quotient types as codatatypes.
3022 - Improved "merge_type_vars" option to merge more types.
3023 - Removed unsound "fast_descrs" option.
3024 - Added custom symmetry breaking for datatypes, making it possible to reach
3025 higher cardinalities.
3026 - Prevent the expansion of too large definitions.
3028 * Proof methods "metis" and "meson" now have configuration options
3029 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
3030 to diagnose these tools. E.g.
3032 using [[metis_trace = true]]
3034 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
3035 manually as command 'solve_direct'.
3037 * The default SMT solver Z3 must be enabled explicitly (due to
3038 licensing issues) by setting the environment variable
3039 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
3040 commercial applications, the SMT solver CVC3 is provided as fall-back;
3041 changing the SMT solver is done via the configuration option
3044 * Remote SMT solvers need to be referred to by the "remote_" prefix,
3045 i.e. "remote_cvc3" and "remote_z3".
3047 * Added basic SMT support for datatypes, records, and typedefs using
3048 the oracle mode (no proofs). Direct support of pairs has been dropped
3049 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
3050 support for a similar behavior). Minor INCOMPATIBILITY.
3052 * Changed SMT configuration options:
3054 z3_proofs ~> smt_oracle (with inverted meaning)
3055 z3_trace_assms ~> smt_trace_used_facts
3068 * Boogie output files (.b2i files) need to be declared in the theory
3071 * Simplification procedure "list_to_set_comprehension" rewrites list
3072 comprehensions applied to List.set to set comprehensions. Occasional
3073 INCOMPATIBILITY, may be deactivated like this:
3075 declare [[simproc del: list_to_set_comprehension]]
3077 * Removed old version of primrec package. INCOMPATIBILITY.
3079 * Removed simplifier congruence rule of "prod_case", as has for long
3080 been the case with "split". INCOMPATIBILITY.
3082 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3084 * Removed [split_format ... and ... and ...] version of
3085 [split_format]. Potential INCOMPATIBILITY.
3087 * Predicate "sorted" now defined inductively, with nice induction
3088 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3090 * Constant "contents" renamed to "the_elem", to free the generic name
3091 contents for other uses. INCOMPATIBILITY.
3093 * Renamed class eq and constant eq (for code generation) to class
3094 equal and constant equal, plus renaming of related facts and various
3095 tuning. INCOMPATIBILITY.
3097 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3099 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3102 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3103 avoid confusion with finite sets. INCOMPATIBILITY.
3105 * Abandoned locales equiv, congruent and congruent2 for equivalence
3106 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3109 * Some previously unqualified names have been qualified:
3116 Trueprop ~> HOL.Trueprop
3121 op --> ~> HOL.implies
3133 Pair ~> Product_Type.Pair
3134 fst ~> Product_Type.fst
3135 snd ~> Product_Type.snd
3136 curry ~> Product_Type.curry
3138 Collect ~> Set.Collect
3142 * More canonical naming convention for some fundamental definitions:
3144 bot_bool_eq ~> bot_bool_def
3145 top_bool_eq ~> top_bool_def
3146 inf_bool_eq ~> inf_bool_def
3147 sup_bool_eq ~> sup_bool_def
3148 bot_fun_eq ~> bot_fun_def
3149 top_fun_eq ~> top_fun_def
3150 inf_fun_eq ~> inf_fun_def
3151 sup_fun_eq ~> sup_fun_def
3155 * More stylized fact names:
3157 expand_fun_eq ~> fun_eq_iff
3158 expand_set_eq ~> set_eq_iff
3160 nat_number ~> eval_nat_numeral
3164 * Refactoring of code-generation specific operations in theory List:
3170 mem_iff ~> member_def
3171 null_empty ~> null_def
3173 INCOMPATIBILITY. Note that these were not supposed to be used
3174 regularly unless for striking reasons; their main purpose was code
3177 Various operations from the Haskell prelude are used for generating
3180 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3181 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3182 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3184 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3185 "*" and "+" respectively. INCOMPATIBILITY.
3187 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3188 "Sum_Type.Plus" instead.
3190 * Constant "split" has been merged with constant "prod_case"; names of
3191 ML functions, facts etc. involving split have been retained so far,
3192 though. INCOMPATIBILITY.
3194 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3195 instead. INCOMPATIBILITY.
3197 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3200 * Former theory Library/Enum is now part of the HOL-Main image.
3201 INCOMPATIBILITY: all constants of the Enum theory now have to be
3202 referred to by its qualified name.
3205 nlists ~> Enum.nlists
3206 product ~> Enum.product
3208 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3209 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3212 * Theory Library/SetsAndFunctions has been split into
3213 Library/Function_Algebras and Library/Set_Algebras; canonical names
3214 for instance definitions for functions; various improvements.
3217 * Theory Library/Multiset provides stable quicksort implementation of
3220 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3223 * Session Multivariate_Analysis: introduced a type class for euclidean
3224 space. Most theorems are now stated in terms of euclidean spaces
3225 instead of finite cartesian products.
3228 real ^ 'n ~> 'a::real_vector
3229 ~> 'a::euclidean_space
3230 ~> 'a::ordered_euclidean_space
3231 (depends on your needs)
3235 \<chi> x. _ ~> \<chi>\<chi> x. _
3238 Also note that the indices are now natural numbers and not from some
3239 finite type. Finite cartesian products of euclidean spaces, products
3240 of euclidean spaces the real and complex numbers are instantiated to
3241 be euclidean_spaces. INCOMPATIBILITY.
3243 * Session Probability: introduced pextreal as positive extended real
3244 numbers. Use pextreal as value for measures. Introduce the
3245 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3246 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3247 the integral in Multivariate Analysis. INCOMPATIBILITY.
3249 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3252 * Session SPARK (with image HOL-SPARK) provides commands to load and
3253 prove verification conditions generated by the SPARK Ada program
3254 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3259 * Theorems for additive ring operations (locale abelian_monoid and
3260 descendants) are generated by interpretation from their multiplicative
3261 counterparts. Names (in particular theorem names) have the mandatory
3262 qualifier 'add'. Previous theorem names are redeclared for
3265 * Structure "int_ring" is now an abbreviation (previously a
3266 definition). This fits more natural with advanced interpretations.
3271 * The domain package now runs in definitional mode by default: The
3272 former command 'new_domain' is now called 'domain'. To use the domain
3273 package in its original axiomatic mode, use 'domain (unsafe)'.
3276 * The new class "domain" is now the default sort. Class "predomain"
3277 is an unpointed version of "domain". Theories can be updated by
3278 replacing sort annotations as shown below. INCOMPATIBILITY.
3280 'a::type ~> 'a::countable
3281 'a::cpo ~> 'a::predomain
3282 'a::pcpo ~> 'a::domain
3284 * The old type class "rep" has been superseded by class "domain".
3285 Accordingly, users of the definitional package must remove any
3286 "default_sort rep" declarations. INCOMPATIBILITY.
3288 * The domain package (definitional mode) now supports unpointed
3289 predomain argument types, as long as they are marked 'lazy'. (Strict
3290 arguments must be in class "domain".) For example, the following
3291 domain definition now works:
3293 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3295 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3296 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3297 'a option, and 'a list. Additionally, it configures fixrec and the
3298 domain package to work with these types. For example:
3300 fixrec isInl :: "('a + 'b) u -> tr"
3301 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3303 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3305 * The "(permissive)" option of fixrec has been replaced with a
3306 per-equation "(unchecked)" option. See
3307 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3309 * The "bifinite" class no longer fixes a constant "approx"; the class
3310 now just asserts that such a function exists. INCOMPATIBILITY.
3312 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3313 defines an embedding of type 'a defl into udom by default; instances
3314 of "bifinite" and "domain" classes are available in
3315 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3317 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3319 * The predicate "directed" has been removed. INCOMPATIBILITY.
3321 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3323 * The function "cprod_map" has been renamed to "prod_map".
3326 * The monadic bind operator on each powerdomain has new binder syntax
3327 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3328 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3330 * The infix syntax for binary union on each powerdomain has changed
3331 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3332 syntax. INCOMPATIBILITY.
3334 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3335 still supported as an input translation.
3337 * Renamed some theorems (the original names are also still available).
3339 expand_fun_below ~> fun_below_iff
3340 below_fun_ext ~> fun_belowI
3341 expand_cfun_eq ~> cfun_eq_iff
3342 ext_cfun ~> cfun_eqI
3343 expand_cfun_below ~> cfun_below_iff
3344 below_cfun_ext ~> cfun_belowI
3345 cont2cont_Rep_CFun ~> cont2cont_APP
3347 * The Abs and Rep functions for various types have changed names.
3348 Related theorem names have also changed to match. INCOMPATIBILITY.
3350 Rep_CFun ~> Rep_cfun
3351 Abs_CFun ~> Abs_cfun
3352 Rep_Sprod ~> Rep_sprod
3353 Abs_Sprod ~> Abs_sprod
3354 Rep_Ssum ~> Rep_ssum
3355 Abs_Ssum ~> Abs_ssum
3357 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3358 been renamed to *_bottom_iff. INCOMPATIBILITY.
3360 * Various changes to bisimulation/coinduction with domain package:
3362 - Definitions of "bisim" constants no longer mention definedness.
3363 - With mutual recursion, "bisim" predicate is now curried.
3364 - With mutual recursion, each type gets a separate coind theorem.
3365 - Variable names in bisim_def and coinduct rules have changed.
3369 * Case combinators generated by the domain package for type "foo" are
3370 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3372 * Several theorems have been renamed to more accurately reflect the
3373 names of constants and types involved. INCOMPATIBILITY.
3375 thelub_const ~> lub_const
3376 lub_const ~> is_lub_const
3378 is_lub_lub ~> is_lubD2
3380 unique_lub ~> is_lub_unique
3381 is_ub_lub ~> is_lub_rangeD1
3382 lub_bin_chain ~> is_lub_bin_chain
3383 lub_fun ~> is_lub_fun
3384 thelub_fun ~> lub_fun
3385 thelub_cfun ~> lub_cfun
3386 thelub_Pair ~> lub_Pair
3387 lub_cprod ~> is_lub_prod
3388 thelub_cprod ~> lub_prod
3389 minimal_cprod ~> minimal_prod
3390 inst_cprod_pcpo ~> inst_prod_pcpo
3392 compact_UU ~> compact_bottom
3393 deflation_UU ~> deflation_bottom
3394 finite_deflation_UU ~> finite_deflation_bottom
3396 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3398 sq_ord_less_eq_trans ~> below_eq_trans
3399 sq_ord_eq_less_trans ~> eq_below_trans
3400 refl_less ~> below_refl
3401 trans_less ~> below_trans
3402 antisym_less ~> below_antisym
3403 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3404 box_less ~> box_below
3405 rev_trans_less ~> rev_below_trans
3406 not_less2not_eq ~> not_below2not_eq
3407 less_UU_iff ~> below_UU_iff
3408 flat_less_iff ~> flat_below_iff
3409 adm_less ~> adm_below
3410 adm_not_less ~> adm_not_below
3411 adm_compact_not_less ~> adm_compact_not_below
3412 less_fun_def ~> below_fun_def
3413 expand_fun_less ~> fun_below_iff
3414 less_fun_ext ~> fun_belowI
3415 less_discr_def ~> below_discr_def
3416 discr_less_eq ~> discr_below_eq
3417 less_unit_def ~> below_unit_def
3418 less_cprod_def ~> below_prod_def
3419 prod_lessI ~> prod_belowI
3420 Pair_less_iff ~> Pair_below_iff
3421 fst_less_iff ~> fst_below_iff
3422 snd_less_iff ~> snd_below_iff
3423 expand_cfun_less ~> cfun_below_iff
3424 less_cfun_ext ~> cfun_belowI
3425 injection_less ~> injection_below
3426 less_up_def ~> below_up_def
3427 not_Iup_less ~> not_Iup_below
3428 Iup_less ~> Iup_below
3430 Def_inject_less_eq ~> Def_below_Def
3431 Def_less_is_eq ~> Def_below_iff
3432 spair_less_iff ~> spair_below_iff
3433 less_sprod ~> below_sprod
3434 spair_less ~> spair_below
3435 sfst_less_iff ~> sfst_below_iff
3436 ssnd_less_iff ~> ssnd_below_iff
3437 fix_least_less ~> fix_least_below
3438 dist_less_one ~> dist_below_one
3439 less_ONE ~> below_ONE
3440 ONE_less_iff ~> ONE_below_iff
3441 less_sinlD ~> below_sinlD
3442 less_sinrD ~> below_sinrD
3447 * All constant names are now qualified internally and use proper
3448 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3453 * Antiquotation @{assert} inlines a function bool -> unit that raises
3454 Fail if the argument is false. Due to inlining the source position of
3455 failed assertions is included in the error output.
3457 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3458 text is in practice always evaluated with a stable theory checkpoint.
3459 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3461 * Antiquotation @{theory A} refers to theory A from the ancestry of
3462 the current context, not any accidental theory loader state as before.
3463 Potential INCOMPATIBILITY, subtle change in semantics.
3465 * Syntax.pretty_priority (default 0) configures the required priority
3466 of pretty-printed output and thus affects insertion of parentheses.
3468 * Syntax.default_root (default "any") configures the inner syntax
3469 category (nonterminal symbol) for parsing of terms.
3471 * Former exception Library.UnequalLengths now coincides with
3472 ListPair.UnequalLengths.
3474 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3475 main functionality is provided by structure Simplifier.
3477 * Renamed raw "explode" function to "raw_explode" to emphasize its
3478 meaning. Note that internally to Isabelle, Symbol.explode is used in
3479 almost all situations.
3481 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3482 See implementation manual for further details on exceptions in
3485 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3488 * Renamed structure PureThy to Pure_Thy and moved most of its
3489 operations to structure Global_Theory, to emphasize that this is
3490 rarely-used global-only stuff.
3492 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3493 instead (or tracing for high-volume output).
3495 * Configuration option show_question_marks only affects regular pretty
3496 printing of types and terms, not raw Term.string_of_vname.
3498 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3499 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3500 @{thms} for most purposes.
3502 * ML structure Unsynchronized is never opened, not even in Isar
3503 interaction mode as before. Old Unsynchronized.set etc. have been
3504 discontinued -- use plain := instead. This should be *rare* anyway,
3505 since modern tools always work via official context data, notably
3506 configuration options.
3508 * Parallel and asynchronous execution requires special care concerning
3509 interrupts. Structure Exn provides some convenience functions that
3510 avoid working directly with raw Interrupt. User code must not absorb
3511 interrupts -- intermediate handling (for cleanup etc.) needs to be
3512 followed by re-raising of the original exception. Another common
3513 source of mistakes are "handle _" patterns, which make the meaning of
3514 the program subject to physical effects of the environment.
3518 New in Isabelle2009-2 (June 2010)
3519 ---------------------------------
3523 * Authentic syntax for *all* logical entities (type classes, type
3524 constructors, term constants): provides simple and robust
3525 correspondence between formal entities and concrete syntax. Within
3526 the parse tree / AST representations, "constants" are decorated by
3527 their category (class, type, const) and spelled out explicitly with
3528 their full internal name.
3530 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3531 and translations (translation rules and translation functions in ML).
3532 Some hints on upgrading:
3534 - Many existing uses of 'syntax' and 'translations' can be replaced
3535 by more modern 'type_notation', 'notation' and 'abbreviation',
3536 which are independent of this issue.
3538 - 'translations' require markup within the AST; the term syntax
3539 provides the following special forms:
3541 CONST c -- produces syntax version of constant c from context
3542 XCONST c -- literally c, checked as constant from context
3543 c -- literally c, if declared by 'syntax'
3545 Plain identifiers are treated as AST variables -- occasionally the
3546 system indicates accidental variables via the error "rhs contains
3549 Type classes and type constructors are marked according to their
3550 concrete syntax. Some old translations rules need to be written
3551 for the "type" category, using type constructor application
3552 instead of pseudo-term application of the default category
3555 - 'parse_translation' etc. in ML may use the following
3558 @{class_syntax c} -- type class c within parse tree / AST
3559 @{term_syntax c} -- type constructor c within parse tree / AST
3560 @{const_syntax c} -- ML version of "CONST c" above
3561 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3563 - Literal types within 'typed_print_translations', i.e. those *not*
3564 represented as pseudo-terms are represented verbatim. Use @{class
3565 c} or @{type_name c} here instead of the above syntax
3568 Note that old non-authentic syntax was based on unqualified base
3569 names, so all of the above "constant" names would coincide. Recall
3570 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3571 diagnose syntax problems.
3573 * Type constructors admit general mixfix syntax, not just infix.
3575 * Concrete syntax may be attached to local entities without a proof
3576 body, too. This works via regular mixfix annotations for 'fix',
3577 'def', 'obtain' etc. or via the explicit 'write' command, which is
3578 similar to the 'notation' command in theory specifications.
3580 * Discontinued unnamed infix syntax (legacy feature for many years) --
3581 need to specify constant name and syntax separately. Internal ML
3582 datatype constructors have been renamed from InfixName to Infix etc.
3583 Minor INCOMPATIBILITY.
3585 * Schematic theorem statements need to be explicitly markup as such,
3586 via commands 'schematic_lemma', 'schematic_theorem',
3587 'schematic_corollary'. Thus the relevance of the proof is made
3588 syntactically clear, which impacts performance in a parallel or
3589 asynchronous interactive environment. Minor INCOMPATIBILITY.
3591 * Use of cumulative prems via "!" in some proof methods has been
3592 discontinued (old legacy feature).
3594 * References 'trace_simp' and 'debug_simp' have been replaced by
3595 configuration options stored in the context. Enabling tracing (the
3596 case of debugging is similar) in proofs works via
3598 using [[trace_simp = true]]
3600 Tracing is then active for all invocations of the simplifier in
3601 subsequent goal refinement steps. Tracing may also still be enabled or
3602 disabled via the ProofGeneral settings menu.
3604 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3605 'hide_fact' replace the former 'hide' KIND command. Minor
3608 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3609 more efficient than combinations with -q1 or -q2.
3614 * Proofterms record type-class reasoning explicitly, using the
3615 "unconstrain" operation internally. This eliminates all sort
3616 constraints from a theorem and proof, introducing explicit
3617 OFCLASS-premises. On the proof term level, this operation is
3618 automatically applied at theorem boundaries, such that closed proofs
3619 are always free of sort constraints. INCOMPATIBILITY for tools that
3620 inspect proof terms.
3622 * Local theory specifications may depend on extra type variables that
3623 are not present in the result type -- arguments TYPE('a) :: 'a itself
3624 are added internally. For example:
3626 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3628 * Predicates of locales introduced by classes carry a mandatory
3629 "class" prefix. INCOMPATIBILITY.
3631 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3633 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3636 * Command 'code_reflect' allows to incorporate generated ML code into
3637 runtime environment; replaces immature code_datatype antiquotation.
3640 * Code generator: simple concept for abstract datatypes obeying
3643 * Code generator: details of internal data cache have no impact on the
3644 user space functionality any longer.
3646 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3647 subgoals. This is more appropriate for interpretations with 'where'.
3650 * Command 'example_proof' opens an empty proof body. This allows to
3651 experiment with Isar, without producing any persistent result.
3653 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3654 within a local theory context, with explicit checking of the
3655 constructors involved (in contrast to the raw 'syntax' versions).
3657 * Commands 'types' and 'typedecl' now work within a local theory
3658 context -- without introducing dependencies on parameters or
3659 assumptions, which is not possible in Isabelle/Pure.
3661 * Command 'defaultsort' has been renamed to 'default_sort', it works
3662 within a local theory context. Minor INCOMPATIBILITY.
3667 * Command 'typedef' now works within a local theory context -- without
3668 introducing dependencies on parameters or assumptions, which is not
3669 possible in Isabelle/Pure/HOL. Note that the logical environment may
3670 contain multiple interpretations of local typedefs (with different
3671 non-emptiness proofs), even in a global theory context.
3673 * New package for quotient types. Commands 'quotient_type' and
3674 'quotient_definition' may be used for defining types and constants by
3675 quotient constructions. An example is the type of integers created by
3676 quotienting pairs of natural numbers:
3679 intrel :: "(nat * nat) => (nat * nat) => bool"
3681 "intrel (x, y) (u, v) = (x + v = u + y)"
3683 quotient_type int = "nat * nat" / intrel
3684 by (auto simp add: equivp_def expand_fun_eq)
3687 "0::int" is "(0::nat, 0::nat)"
3689 The method "lifting" can be used to lift of theorems from the
3690 underlying "raw" type to the quotient type. The example
3691 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3692 construction and provides a reasoning infrastructure for finite sets.
3694 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3695 clash with new theory Quotient in Main HOL.
3697 * Moved the SMT binding into the main HOL session, eliminating
3698 separate HOL-SMT session.
3700 * List membership infix mem operation is only an input abbreviation.
3703 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3704 for future developements; former Library/Word.thy is still present in
3705 the AFP entry RSAPPS.
3707 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3708 longer shadowed. INCOMPATIBILITY.
3710 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3713 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3716 * Dropped normalizing_semiring etc; use the facts in semiring classes
3717 instead. INCOMPATIBILITY.
3719 * Dropped several real-specific versions of lemmas about floor and
3720 ceiling; use the generic lemmas from theory "Archimedean_Field"
3721 instead. INCOMPATIBILITY.
3723 floor_number_of_eq ~> floor_number_of
3724 le_floor_eq_number_of ~> number_of_le_floor
3725 le_floor_eq_zero ~> zero_le_floor
3726 le_floor_eq_one ~> one_le_floor
3727 floor_less_eq_number_of ~> floor_less_number_of
3728 floor_less_eq_zero ~> floor_less_zero
3729 floor_less_eq_one ~> floor_less_one
3730 less_floor_eq_number_of ~> number_of_less_floor
3731 less_floor_eq_zero ~> zero_less_floor
3732 less_floor_eq_one ~> one_less_floor
3733 floor_le_eq_number_of ~> floor_le_number_of
3734 floor_le_eq_zero ~> floor_le_zero
3735 floor_le_eq_one ~> floor_le_one
3736 floor_subtract_number_of ~> floor_diff_number_of
3737 floor_subtract_one ~> floor_diff_one
3738 ceiling_number_of_eq ~> ceiling_number_of
3739 ceiling_le_eq_number_of ~> ceiling_le_number_of
3740 ceiling_le_zero_eq ~> ceiling_le_zero
3741 ceiling_le_eq_one ~> ceiling_le_one
3742 less_ceiling_eq_number_of ~> number_of_less_ceiling
3743 less_ceiling_eq_zero ~> zero_less_ceiling
3744 less_ceiling_eq_one ~> one_less_ceiling
3745 ceiling_less_eq_number_of ~> ceiling_less_number_of
3746 ceiling_less_eq_zero ~> ceiling_less_zero
3747 ceiling_less_eq_one ~> ceiling_less_one
3748 le_ceiling_eq_number_of ~> number_of_le_ceiling
3749 le_ceiling_eq_zero ~> zero_le_ceiling
3750 le_ceiling_eq_one ~> one_le_ceiling
3751 ceiling_subtract_number_of ~> ceiling_diff_number_of
3752 ceiling_subtract_one ~> ceiling_diff_one
3754 * Theory "Finite_Set": various folding_XXX locales facilitate the
3755 application of the various fold combinators on finite sets.
3757 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3758 provides abstract red-black tree type which is backed by "RBT_Impl" as
3759 implementation. INCOMPATIBILTY.
3761 * Theory Library/Coinductive_List has been removed -- superseded by
3762 AFP/thys/Coinductive.
3764 * Theory PReal, including the type "preal" and related operations, has
3765 been removed. INCOMPATIBILITY.
3767 * Real: new development using Cauchy Sequences.
3769 * Split off theory "Big_Operators" containing setsum, setprod,
3770 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3772 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3773 "Int" etc. INCOMPATIBILITY.
3775 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3777 * New set of rules "ac_simps" provides combined assoc / commute
3778 rewrites for all interpretations of the appropriate generic locales.
3780 * Renamed theory "OrderedGroup" to "Groups" and split theory
3781 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3782 appropriate and more consistent names suitable for name prefixes
3783 within the HOL theories. INCOMPATIBILITY.
3785 * Some generic constants have been put to appropriate theories:
3786 - less_eq, less: Orderings
3787 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3788 - inverse, divide: Rings
3791 * More consistent naming of type classes involving orderings (and
3794 lower_semilattice ~> semilattice_inf
3795 upper_semilattice ~> semilattice_sup
3797 dense_linear_order ~> dense_linorder
3799 pordered_ab_group_add ~> ordered_ab_group_add
3800 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3801 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3802 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3803 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3804 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3805 pordered_cancel_semiring ~> ordered_cancel_semiring
3806 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3807 pordered_comm_ring ~> ordered_comm_ring
3808 pordered_comm_semiring ~> ordered_comm_semiring
3809 pordered_ring ~> ordered_ring
3810 pordered_ring_abs ~> ordered_ring_abs
3811 pordered_semiring ~> ordered_semiring
3813 ordered_ab_group_add ~> linordered_ab_group_add
3814 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3815 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3816 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3817 ordered_field ~> linordered_field
3818 ordered_field_no_lb ~> linordered_field_no_lb
3819 ordered_field_no_ub ~> linordered_field_no_ub
3820 ordered_field_dense_linear_order ~> dense_linordered_field
3821 ordered_idom ~> linordered_idom
3822 ordered_ring ~> linordered_ring
3823 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3824 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3825 ordered_ring_strict ~> linordered_ring_strict
3826 ordered_semidom ~> linordered_semidom
3827 ordered_semiring ~> linordered_semiring
3828 ordered_semiring_1 ~> linordered_semiring_1
3829 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3830 ordered_semiring_strict ~> linordered_semiring_strict
3832 The following slightly odd type classes have been moved to a
3833 separate theory Library/Lattice_Algebras:
3835 lordered_ab_group_add ~> lattice_ab_group_add
3836 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3837 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3838 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3839 lordered_ring ~> lattice_ring
3843 * Refined field classes:
3844 - classes division_ring_inverse_zero, field_inverse_zero,
3845 linordered_field_inverse_zero include rule inverse 0 = 0 --
3846 subsumes former division_by_zero class;
3847 - numerous lemmas have been ported from field to division_ring.
3850 * Refined algebra theorem collections:
3851 - dropped theorem group group_simps, use algebra_simps instead;
3852 - dropped theorem group ring_simps, use field_simps instead;
3853 - proper theorem collection field_simps subsumes former theorem
3854 groups field_eq_simps and field_simps;
3855 - dropped lemma eq_minus_self_iff which is a duplicate for
3859 * Theory Finite_Set and List: some lemmas have been generalized from
3862 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3863 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3864 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3865 union_Union_fold_union ~> sup_Sup_fold_sup
3866 Inter_fold_inter ~> Inf_fold_inf
3867 Union_fold_union ~> Sup_fold_sup
3868 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3869 union_UNION_fold_union ~> sup_SUPR_fold_sup
3870 INTER_fold_inter ~> INFI_fold_inf
3871 UNION_fold_union ~> SUPR_fold_sup
3873 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3874 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3875 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3876 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3877 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3878 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3880 * Reorganized theory Multiset: swapped notation of pointwise and
3883 - pointwise ordering is instance of class order with standard syntax
3885 - multiset ordering has syntax <=# and <#; partial order properties
3886 are provided by means of interpretation with prefix
3888 - less duplication, less historical organization of sections,
3889 conversion from associations lists to multisets, rudimentary code
3891 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3896 multiset_eq_conv_count_eq ~> multiset_ext_iff
3897 multi_count_ext ~> multiset_ext
3898 diff_union_inverse2 ~> diff_union_cancelR
3902 * Theory Permutation: replaced local "remove" by List.remove1.
3904 * Code generation: ML and OCaml code is decorated with signatures.
3906 * Theory List: added transpose.
3908 * Library/Nat_Bijection.thy is a collection of bijective functions
3909 between nat and other types, which supersedes the older libraries
3910 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3913 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3914 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3915 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3916 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3917 Countable.pair_encode ~> prod_encode
3918 NatIso.prod2nat ~> prod_encode
3919 NatIso.nat2prod ~> prod_decode
3920 NatIso.sum2nat ~> sum_encode
3921 NatIso.nat2sum ~> sum_decode
3922 NatIso.list2nat ~> list_encode
3923 NatIso.nat2list ~> list_decode
3924 NatIso.set2nat ~> set_encode
3925 NatIso.nat2set ~> set_decode
3928 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3929 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3930 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3931 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3932 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3933 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3934 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3935 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3936 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3937 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3938 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3939 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3940 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3943 - Renamed ATP commands:
3944 atp_info ~> sledgehammer running_atps
3945 atp_kill ~> sledgehammer kill_atps
3946 atp_messages ~> sledgehammer messages
3947 atp_minimize ~> sledgehammer minimize
3948 print_atps ~> sledgehammer available_atps
3950 - Added user's manual ("isabelle doc sledgehammer").
3951 - Added option syntax and "sledgehammer_params" to customize
3952 Sledgehammer's behavior. See the manual for details.
3953 - Modified the Isar proof reconstruction code so that it produces
3954 direct proofs rather than proofs by contradiction. (This feature
3955 is still experimental.)
3956 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3958 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3961 - Added and implemented "binary_ints" and "bits" options.
3962 - Added "std" option and implemented support for nonstandard models.
3963 - Added and implemented "finitize" option to improve the precision
3964 of infinite datatypes based on a monotonicity analysis.
3965 - Added support for quotient types.
3966 - Added support for "specification" and "ax_specification"
3968 - Added support for local definitions (for "function" and
3969 "termination" proofs).
3970 - Added support for term postprocessors.
3971 - Optimized "Multiset.multiset" and "FinFun.finfun".
3972 - Improved efficiency of "destroy_constrs" optimization.
3973 - Fixed soundness bugs related to "destroy_constrs" optimization and
3975 - Fixed soundness bug related to higher-order constructors.
3976 - Fixed soundness bug when "full_descrs" is enabled.
3977 - Improved precision of set constructs.
3978 - Added "atoms" option.
3979 - Added cache to speed up repeated Kodkod invocations on the same
3981 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3982 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3983 "SAT4J_Light". INCOMPATIBILITY.
3984 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3985 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3986 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3988 * Method "induct" now takes instantiations of the form t, where t is not
3989 a variable, as a shorthand for "x == t", where x is a fresh variable.
3990 If this is not intended, t has to be enclosed in parentheses.
3991 By default, the equalities generated by definitional instantiations
3992 are pre-simplified, which may cause parameters of inductive cases
3993 to disappear, or may even delete some of the inductive cases.
3994 Use "induct (no_simp)" instead of "induct" to restore the old
3995 behaviour. The (no_simp) option is also understood by the "cases"
3996 and "nominal_induct" methods, which now perform pre-simplification, too.
4002 * Variable names in lemmas generated by the domain package have
4003 changed; the naming scheme is now consistent with the HOL datatype
4004 package. Some proof scripts may be affected, INCOMPATIBILITY.
4006 * The domain package no longer defines the function "foo_copy" for
4007 recursive domain "foo". The reach lemma is now stated directly in
4008 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
4009 be reformulated in terms of "foo_take", INCOMPATIBILITY.
4011 * Most definedness lemmas generated by the domain package (previously
4012 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
4013 like "foo$x = UU <-> x = UU", which works better as a simp rule.
4014 Proofs that used definedness lemmas as intro rules may break,
4015 potential INCOMPATIBILITY.
4017 * Induction and casedist rules generated by the domain package now
4018 declare proper case_names (one called "bottom", and one named for each
4019 constructor). INCOMPATIBILITY.
4021 * For mutually-recursive domains, separate "reach" and "take_lemma"
4022 rules are generated for each domain, INCOMPATIBILITY.
4024 foo_bar.reach ~> foo.reach bar.reach
4025 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
4027 * Some lemmas generated by the domain package have been renamed for
4028 consistency with the datatype package, INCOMPATIBILITY.
4030 foo.ind ~> foo.induct
4031 foo.finite_ind ~> foo.finite_induct
4032 foo.coind ~> foo.coinduct
4033 foo.casedist ~> foo.exhaust
4034 foo.exhaust ~> foo.nchotomy
4036 * For consistency with other definition packages, the fixrec package
4037 now generates qualified theorem names, INCOMPATIBILITY.
4039 foo_simps ~> foo.simps
4040 foo_unfold ~> foo.unfold
4041 foo_induct ~> foo.induct
4043 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
4044 method and internal fixrec proofs now use the default simpset instead.
4047 * The "contlub" predicate has been removed. Proof scripts should use
4048 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
4050 * The "admw" predicate has been removed, INCOMPATIBILITY.
4052 * The constants cpair, cfst, and csnd have been removed in favor of
4053 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
4058 * Antiquotations for basic formal entities:
4060 @{class NAME} -- type class
4061 @{class_syntax NAME} -- syntax representation of the above
4063 @{type_name NAME} -- logical type
4064 @{type_abbrev NAME} -- type abbreviation
4065 @{nonterminal NAME} -- type of concrete syntactic category
4066 @{type_syntax NAME} -- syntax representation of any of the above
4068 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
4069 @{const_abbrev NAME} -- abbreviated constant
4070 @{const_syntax NAME} -- syntax representation of any of the above
4072 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
4073 syntax constant (cf. 'syntax' command).
4075 * Antiquotation @{make_string} inlines a function to print arbitrary
4076 values similar to the ML toplevel. The result is compiler dependent
4077 and may fall back on "?" in certain situations.
4079 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4080 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4081 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4082 not work with the asynchronous Isar document model.
4084 * Configuration options now admit dynamic default values, depending on
4085 the context or even global references.
4087 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4088 uses an efficient external library if available (for Poly/ML).
4090 * Renamed some important ML structures, while keeping the old names
4091 for some time as aliases within the structure Legacy:
4093 OuterKeyword ~> Keyword
4096 OuterSyntax ~> Outer_Syntax
4097 PrintMode ~> Print_Mode
4098 SpecParse ~> Parse_Spec
4101 ThyOutput ~> Thy_Output
4102 TypeInfer ~> Type_Infer
4104 Note that "open Legacy" simplifies porting of sources, but forgetting
4105 to remove it again will complicate porting again in the future.
4107 * Most operations that refer to a global context are named
4108 accordingly, e.g. Simplifier.global_context or
4109 ProofContext.init_global. There are some situations where a global
4110 context actually works, but under normal circumstances one needs to
4111 pass the proper local context through the code!
4113 * Discontinued old TheoryDataFun with its copy/init operation -- data
4114 needs to be pure. Functor Theory_Data_PP retains the traditional
4115 Pretty.pp argument to merge, which is absent in the standard
4116 Theory_Data version.
4118 * Sorts.certify_sort and derived "cert" operations for types and terms
4119 no longer minimize sorts. Thus certification at the boundary of the
4120 inference kernel becomes invariant under addition of class relations,
4121 which is an important monotonicity principle. Sorts are now minimized
4122 in the syntax layer only, at the boundary between the end-user and the
4123 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4124 explicitly in rare situations.
4126 * Renamed old-style Drule.standard to Drule.export_without_context, to
4127 emphasize that this is in no way a standard operation.
4130 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4131 usual for resolution. Rare INCOMPATIBILITY.
4133 * Renamed varify/unvarify operations to varify_global/unvarify_global
4134 to emphasize that these only work in a global situation (which is
4137 * Curried take and drop in library.ML; negative length is interpreted
4138 as infinity (as in chop). Subtle INCOMPATIBILITY.
4140 * Proof terms: type substitutions on proof constants now use canonical
4141 order of type variables. INCOMPATIBILITY for tools working with proof
4144 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4145 may no longer carry premises. User-level specifications are
4146 transformed accordingly by Thm.add_axiom/add_def.
4151 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4152 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4153 proof terms are enabled unconditionally in the new HOL-Proofs image.
4155 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4156 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4159 * Old lib/scripts/polyml-platform is superseded by the
4160 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4161 variant, even on a 64 bit machine. The following example setting
4162 prefers 64 bit if available:
4164 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4166 * The preliminary Isabelle/jEdit application demonstrates the emerging
4167 Isabelle/Scala layer for advanced prover interaction and integration.
4168 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4171 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4172 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4173 similar to the default assignment of the document preparation system
4174 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4175 provides some operations for direct access to the font without asking
4176 the user for manual installation.
4180 New in Isabelle2009-1 (December 2009)
4181 -------------------------------------
4185 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4186 one backslash should be used, even in ML sources.
4191 * Locale interpretation propagates mixins along the locale hierarchy.
4192 The currently only available mixins are the equations used to map
4193 local definitions to terms of the target domain of an interpretation.
4195 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4196 loc" to print all interpretations of locale "loc" in the theory.
4197 Interpretations in proofs are not shown.
4199 * Thoroughly revised locales tutorial. New section on conditional
4202 * On instantiation of classes, remaining undefined class parameters
4203 are formally declared. INCOMPATIBILITY.
4206 *** Document preparation ***
4208 * New generalized style concept for printing terms: @{foo (style) ...}
4209 instead of @{foo_style style ...} (old form is still retained for
4210 backward compatibility). Styles can be also applied for
4211 antiquotations prop, term_type and typeof.
4216 * New proof method "smt" for a combination of first-order logic with
4217 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4218 fixed-size bitvectors; there is also basic support for higher-order
4219 features (esp. lambda abstractions). It is an incomplete decision
4220 procedure based on external SMT solvers using the oracle mechanism;
4221 for the SMT solver Z3, this method is proof-producing. Certificates
4222 are provided to avoid calling the external solvers solely for
4223 re-checking proofs. Due to a remote SMT service there is no need for
4224 installing SMT solvers locally. See src/HOL/SMT.
4226 * New commands to load and prove verification conditions generated by
4227 the Boogie program verifier or derived systems (e.g. the Verifying C
4228 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4230 * New counterexample generator tool 'nitpick' based on the Kodkod
4231 relational model finder. See src/HOL/Tools/Nitpick and
4232 src/HOL/Nitpick_Examples.
4234 * New commands 'code_pred' and 'values' to invoke the predicate
4235 compiler and to enumerate values of inductive predicates.
4237 * A tabled implementation of the reflexive transitive closure.
4239 * New implementation of quickcheck uses generic code generator;
4240 default generators are provided for all suitable HOL types, records
4241 and datatypes. Old quickcheck can be re-activated importing theory
4242 Library/SML_Quickcheck.
4244 * New testing tool Mirabelle for automated proof tools. Applies
4245 several tools and tactics like sledgehammer, metis, or quickcheck, to
4246 every proof step in a theory. To be used in batch mode via the
4247 "mirabelle" utility.
4249 * New proof method "sos" (sum of squares) for nonlinear real
4250 arithmetic (originally due to John Harison). It requires theory
4251 Library/Sum_Of_Squares. It is not a complete decision procedure but
4252 works well in practice on quantifier-free real arithmetic with +, -,
4253 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4254 inequalities between polynomials. It makes use of external
4255 semidefinite programming solvers. Method "sos" generates a
4256 certificate that can be pasted into the proof thus avoiding the need
4257 to call an external tool every time the proof is checked. See
4258 src/HOL/Library/Sum_Of_Squares.
4260 * New method "linarith" invokes existing linear arithmetic decision
4263 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4265 * New Sledgehammer option "Full Types" in Proof General settings menu.
4266 Causes full type information to be output to the ATPs. This slows
4267 ATPs down considerably but eliminates a source of unsound "proofs"
4270 * New method "metisFT": A version of metis that uses full type
4271 information in order to avoid failures of proof reconstruction.
4273 * New evaluator "approximate" approximates an real valued term using
4274 the same method as the approximation method.
4276 * Method "approximate" now supports arithmetic expressions as
4277 boundaries of intervals and implements interval splitting and Taylor
4280 * ML antiquotation @{code_datatype} inserts definition of a datatype
4281 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4283 * New theory SupInf of the supremum and infimum operators for sets of
4286 * New theory Probability, which contains a development of measure
4287 theory, eventually leading to Lebesgue integration and probability.
4289 * Extended Multivariate Analysis to include derivation and Brouwer's
4292 * Reorganization of number theory, INCOMPATIBILITY:
4293 - new number theory development for nat and int, in theories Divides
4294 and GCD as well as in new session Number_Theory
4295 - some constants and facts now suffixed with _nat and _int
4297 - former session NumberTheory now named Old_Number_Theory, including
4298 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4299 - moved theory Pocklington from src/HOL/Library to
4300 src/HOL/Old_Number_Theory
4302 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4303 lcm of finite and infinite sets. It is shown that they form a complete
4306 * Class semiring_div requires superclass no_zero_divisors and proof of
4307 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4308 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4309 generalized to class semiring_div, subsuming former theorems
4310 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4311 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4314 * Refinements to lattice classes and sets:
4315 - less default intro/elim rules in locale variant, more default
4316 intro/elim rules in class variant: more uniformity
4317 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4319 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4321 - renamed ACI to inf_sup_aci
4322 - new class "boolean_algebra"
4323 - class "complete_lattice" moved to separate theory
4324 "Complete_Lattice"; corresponding constants (and abbreviations)
4325 renamed and with authentic syntax:
4326 Set.Inf ~> Complete_Lattice.Inf
4327 Set.Sup ~> Complete_Lattice.Sup
4328 Set.INFI ~> Complete_Lattice.INFI
4329 Set.SUPR ~> Complete_Lattice.SUPR
4330 Set.Inter ~> Complete_Lattice.Inter
4331 Set.Union ~> Complete_Lattice.Union
4332 Set.INTER ~> Complete_Lattice.INTER
4333 Set.UNION ~> Complete_Lattice.UNION
4334 - authentic syntax for
4337 - mere abbreviations:
4340 Set.inter (for inf, formerly Set.Int)
4341 Set.union (for sup, formerly Set.Un)
4342 Complete_Lattice.Inter (for Inf)
4343 Complete_Lattice.Union (for Sup)
4344 Complete_Lattice.INTER (for INFI)
4345 Complete_Lattice.UNION (for SUPR)
4346 - object-logic definitions as far as appropriate
4348 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4349 Un_subset_iff are explicitly deleted as default simp rules; then also
4350 their lattice counterparts le_inf_iff and le_sup_iff have to be
4351 deleted to achieve the desired effect.
4353 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4354 rules by default any longer; the same applies to min_max.inf_absorb1
4355 etc. INCOMPATIBILITY.
4357 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4358 pred_set_conv by default. INCOMPATIBILITY.
4360 * Power operations on relations and functions are now one dedicated
4361 constant "compow" with infix syntax "^^". Power operation on
4362 multiplicative monoids retains syntax "^" and is now defined generic
4363 in class power. INCOMPATIBILITY.
4365 * Relation composition "R O S" now has a more standard argument order:
4366 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4367 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4368 break, since the O_assoc rule was not rewritten like this. Fix using
4369 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4371 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4372 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4375 * Most rules produced by inductive and datatype package have mandatory
4376 prefixes. INCOMPATIBILITY.
4378 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4379 the attribute of the same name. Each of the theorems in the list
4380 DERIV_intros assumes composition with an additional function and
4381 matches a variable to the derivative, which has to be solved by the
4382 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4383 of most elementary terms. Former Maclauren.DERIV_tac and
4384 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4387 * Code generator attributes follow the usual underscore convention:
4388 code_unfold replaces code unfold
4389 code_post replaces code post
4394 sizechange -> size_change
4395 induct_scheme -> induction_schema
4398 * Discontinued abbreviation "arbitrary" of constant "undefined".
4399 INCOMPATIBILITY, use "undefined" directly.
4402 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4403 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4404 Suc_plus1 -> Suc_eq_plus1
4405 *anti_sym -> *antisym*
4406 vector_less_eq_def -> vector_le_def
4409 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4412 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4418 * Theory Representable defines a class "rep" of domains that are
4419 representable (via an ep-pair) in the universal domain type "udom".
4420 Instances are provided for all type constructors defined in HOLCF.
4422 * The 'new_domain' command is a purely definitional version of the
4423 domain package, for representable domains. Syntax is identical to the
4424 old domain package. The 'new_domain' package also supports indirect
4425 recursion using previously-defined type constructors. See
4426 src/HOLCF/ex/New_Domain.thy for examples.
4428 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4429 on the left-hand side of an equation, and then performs
4430 simplification. Rewriting is done using rules declared with the
4431 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4432 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4434 * The pattern-match compiler in 'fixrec' can now handle constructors
4435 with HOL function types. Pattern-match combinators for the Pair
4436 constructor are pre-configured.
4438 * The 'fixrec' package now produces better fixed-point induction rules
4439 for mutually-recursive definitions: Induction rules have conclusions
4440 of the form "P foo bar" instead of "P <foo, bar>".
4442 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4443 been renamed to "below". The name "below" now replaces "less" in many
4444 theorem names. (Legacy theorem names using "less" are still supported
4447 * The 'fixrec' package now supports "bottom patterns". Bottom
4448 patterns can be used to generate strictness rules, or to make
4449 functions more strict (much like the bang-patterns supported by the
4450 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4456 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4457 errors and run-time exceptions, including detailed source positions.
4459 * Structure Name_Space (formerly NameSpace) now manages uniquely
4460 identified entries, with some additional information such as source
4461 position, logical grouping etc.
4463 * Theory and context data is now introduced by the simplified and
4464 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4465 to be pure, but the old TheoryDataFun for mutable data (with explicit
4466 copy operation) is still available for some time.
4468 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4469 provides a high-level programming interface to synchronized state
4470 variables with atomic update. This works via pure function
4471 application within a critical section -- its runtime should be as
4472 short as possible; beware of deadlocks if critical code is nested,
4473 either directly or indirectly via other synchronized variables!
4475 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4476 wraps raw ML references, explicitly indicating their non-thread-safe
4477 behaviour. The Isar toplevel keeps this structure open, to
4478 accommodate Proof General as well as quick and dirty interactive
4479 experiments with references.
4481 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4482 parallel tactical reasoning.
4484 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4485 are similar to SUBPROOF, but are slightly more flexible: only the
4486 specified parts of the subgoal are imported into the context, and the
4487 body tactic may introduce new subgoals and schematic variables.
4489 * Old tactical METAHYPS, which does not observe the proof context, has
4490 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4491 or Subgoal.FOCUS etc.
4493 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4494 functors have their own ML name space there is no point to mark them
4495 separately.) Minor INCOMPATIBILITY.
4497 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4499 * Renamed several structures FooBar to Foo_Bar. Occasional,
4502 * Operations of structure Skip_Proof no longer require quick_and_dirty
4503 mode, which avoids critical setmp.
4505 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4506 combinators for "args". INCOMPATIBILITY, need to use simplified
4507 Attrib/Method.setup introduced in Isabelle2009.
4509 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4510 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4511 last resort. INCOMPATIBILITY.
4513 * Display.pretty_thm now requires a proper context (cf. former
4514 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4515 or even Display.pretty_thm_without_context as last resort.
4518 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4519 Syntax.pretty_typ/term directly, preferably with proper context
4520 instead of global theory.
4525 * Further fine tuning of parallel proof checking, scales up to 8 cores
4526 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4529 * Support for additional "Isabelle components" via etc/components, see
4530 also the system manual.
4532 * The isabelle makeall tool now operates on all components with
4533 IsaMakefile, not just hardwired "logics".
4535 * Removed "compress" option from isabelle-process and isabelle usedir;
4536 this is always enabled.
4538 * Discontinued support for Poly/ML 4.x versions.
4540 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4541 on a given logic image. This requires the lighttpd webserver and is
4542 currently supported on Linux only.
4546 New in Isabelle2009 (April 2009)
4547 --------------------------------
4551 * Simplified main Isabelle executables, with less surprises on
4552 case-insensitive file-systems (such as Mac OS).
4554 - The main Isabelle tool wrapper is now called "isabelle" instead of
4557 - The former "isabelle" alias for "isabelle-process" has been
4558 removed (should rarely occur to regular users).
4560 - The former "isabelle-interface" and its alias "Isabelle" have been
4561 removed (interfaces are now regular Isabelle tools).
4563 Within scripts and make files, the Isabelle environment variables
4564 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4565 respectively. (The latter are still available as legacy feature.)
4567 The old isabelle-interface wrapper could react in confusing ways if
4568 the interface was uninstalled or changed otherwise. Individual
4569 interface tool configuration is now more explicit, see also the
4570 Isabelle system manual. In particular, Proof General is now available
4571 via "isabelle emacs".
4573 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4574 purge installed copies of Isabelle executables and re-run "isabelle
4575 install -p ...", or use symlinks.
4577 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4578 old ~/isabelle, which was slightly non-standard and apt to cause
4579 surprises on case-insensitive file-systems (such as Mac OS).
4581 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4582 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4583 care is required when using older releases of Isabelle. Note that
4584 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4585 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4587 * Proofs of fully specified statements are run in parallel on
4588 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4589 a regular 4-core machine, if the initial heap space is made reasonably
4590 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4592 * The main reference manuals ("isar-ref", "implementation", and
4593 "system") have been updated and extended. Formally checked references
4594 as hyperlinks are now available uniformly.
4599 * Complete re-implementation of locales. INCOMPATIBILITY in several
4600 respects. The most important changes are listed below. See the
4601 Tutorial on Locales ("locales" manual) for details.
4603 - In locale expressions, instantiation replaces renaming. Parameters
4604 must be declared in a for clause. To aid compatibility with previous
4605 parameter inheritance, in locale declarations, parameters that are not
4606 'touched' (instantiation position "_" or omitted) are implicitly added
4607 with their syntax at the beginning of the for clause.
4609 - Syntax from abbreviations and definitions in locales is available in
4610 locale expressions and context elements. The latter is particularly
4611 useful in locale declarations.
4613 - More flexible mechanisms to qualify names generated by locale
4614 expressions. Qualifiers (prefixes) may be specified in locale
4615 expressions, and can be marked as mandatory (syntax: "name!:") or
4616 optional (syntax "name?:"). The default depends for plain "name:"
4617 depends on the situation where a locale expression is used: in
4618 commands 'locale' and 'sublocale' prefixes are optional, in
4619 'interpretation' and 'interpret' prefixes are mandatory. The old
4620 implicit qualifiers derived from the parameter names of a locale are
4621 no longer generated.
4623 - Command "sublocale l < e" replaces "interpretation l < e". The
4624 instantiation clause in "interpretation" and "interpret" (square
4625 brackets) is no longer available. Use locale expressions.
4627 - When converting proof scripts, mandatory qualifiers in
4628 'interpretation' and 'interpret' should be retained by default, even
4629 if this is an INCOMPATIBILITY compared to former behavior. In the
4630 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4631 in locale expressions range over a single locale instance only.
4633 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4634 In existing theorem specifications replace the includes element by the
4635 respective context elements of the included locale, omitting those
4636 that are already present in the theorem specification. Multiple
4637 assume elements of a locale should be replaced by a single one
4638 involving the locale predicate. In the proof body, declarations (most
4639 notably theorems) may be regained by interpreting the respective
4640 locales in the proof context as required (command "interpret").
4642 If using "includes" in replacement of a target solely because the
4643 parameter types in the theorem are not as general as in the target,
4644 consider declaring a new locale with additional type constraints on
4645 the parameters (context element "constrains").
4647 - Discontinued "locale (open)". INCOMPATIBILITY.
4649 - Locale interpretation commands no longer attempt to simplify goal.
4650 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4651 methods intro_locales and unfold_locales to clarify.
4653 - Locale interpretation commands no longer accept interpretation
4654 attributes. INCOMPATIBILITY.
4656 * Class declaration: so-called "base sort" must not be given in import
4657 list any longer, but is inferred from the specification. Particularly
4664 class foo = type + ...
4666 * Class target: global versions of theorems stemming do not carry a
4667 parameter prefix any longer. INCOMPATIBILITY.
4669 * Class 'instance' command no longer accepts attached definitions.
4670 INCOMPATIBILITY, use proper 'instantiation' target instead.
4672 * Recovered hiding of consts, which was accidentally broken in
4673 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4674 makes c inaccessible; consider using ``hide (open) const c'' instead.
4676 * Slightly more coherent Pure syntax, with updated documentation in
4677 isar-ref manual. Removed locales meta_term_syntax and
4678 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4679 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4680 directly in regular applications.
4682 * There is a new syntactic category "float_const" for signed decimal
4683 fractions (e.g. 123.45 or -123.45).
4685 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4686 interface with 'setup' command instead.
4688 * Command 'local_setup' is similar to 'setup', but operates on a local
4691 * The 'axiomatization' command now only works within a global theory
4692 context. INCOMPATIBILITY.
4694 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4695 hypotheses. Sorts required in the course of reasoning need to be
4696 covered by the constraints in the initial statement, completed by the
4697 type instance information of the background theory. Non-trivial sort
4698 hypotheses, which rarely occur in practice, may be specified via
4699 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4701 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4703 The result contains an implicit sort hypotheses as before --
4704 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4707 * Generalized Isar history, with support for linear undo, direct state
4710 * Changed defaults for unify configuration options:
4712 unify_trace_bound = 50 (formerly 25)
4713 unify_search_bound = 60 (formerly 30)
4715 * Different bookkeeping for code equations (INCOMPATIBILITY):
4717 a) On theory merge, the last set of code equations for a particular
4718 constant is taken (in accordance with the policy applied by other
4719 parts of the code generator framework).
4721 b) Code equations stemming from explicit declarations (e.g. code
4722 attribute) gain priority over default code equations stemming
4723 from definition, primrec, fun etc.
4725 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4727 * Unified theorem tables for both code generators. Thus [code
4728 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4730 * Command 'find_consts' searches for constants based on type and name
4733 find_consts "_ => bool"
4735 By default, matching is against subtypes, but it may be restricted to
4736 the whole type. Searching by name is possible. Multiple queries are
4737 conjunctive and queries may be negated by prefixing them with a
4740 find_consts strict: "_ => bool" name: "Int" -"int => int"
4742 * New 'find_theorems' criterion "solves" matches theorems that
4743 directly solve the current goal (modulo higher-order unification).
4745 * Auto solve feature for main theorem statements: whenever a new goal
4746 is stated, "find_theorems solves" is called; any theorems that could
4747 solve the lemma directly are listed as part of the goal state.
4748 Cf. associated options in Proof General Isabelle settings menu,
4749 enabled by default, with reasonable timeout for pathological cases of
4750 higher-order unification.
4753 *** Document preparation ***
4755 * Antiquotation @{lemma} now imitates a regular terminal proof,
4756 demanding keyword 'by' and supporting the full method expression
4757 syntax just like the Isar command 'by'.
4762 * Integrated main parts of former image HOL-Complex with HOL. Entry
4763 points Main and Complex_Main remain as before.
4765 * Logic image HOL-Plain provides a minimal HOL with the most important
4766 tools available (inductive, datatype, primrec, ...). This facilitates
4767 experimentation and tool development. Note that user applications
4768 (and library theories) should never refer to anything below theory
4771 * Logic image HOL-Main stops at theory Main, and thus facilitates
4772 experimentation due to shorter build times.
4774 * Logic image HOL-NSA contains theories of nonstandard analysis which
4775 were previously part of former HOL-Complex. Entry point Hyperreal
4776 remains valid, but theories formerly using Complex_Main should now use
4777 new entry point Hypercomplex.
4779 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4780 Posix processes. Avoids potentially expensive forking of the ML
4781 process. New thread-based implementation also works on non-Unix
4782 platforms (Cygwin). Provers are no longer hardwired, but defined
4783 within the theory via plain ML wrapper functions. Basic Sledgehammer
4784 commands are covered in the isar-ref manual.
4786 * Wrapper scripts for remote SystemOnTPTP service allows to use
4787 sledgehammer without local ATP installation (Vampire etc.). Other
4788 provers may be included via suitable ML wrappers, see also
4789 src/HOL/ATP_Linkup.thy.
4791 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4794 * The metis method no longer fails because the theorem is too trivial
4795 (contains the empty clause).
4797 * The metis method now fails in the usual manner, rather than raising
4798 an exception, if it determines that it cannot prove the theorem.
4800 * Method "coherent" implements a prover for coherent logic (see also
4801 src/Tools/coherent.ML).
4803 * Constants "undefined" and "default" replace "arbitrary". Usually
4804 "undefined" is the right choice to replace "arbitrary", though
4805 logically there is no difference. INCOMPATIBILITY.
4807 * Command "value" now integrates different evaluation mechanisms. The
4808 result of the first successful evaluation mechanism is printed. In
4809 square brackets a particular named evaluation mechanisms may be
4810 specified (currently, [SML], [code] or [nbe]). See further
4811 src/HOL/ex/Eval_Examples.thy.
4813 * Normalization by evaluation now allows non-leftlinear equations.
4814 Declare with attribute [code nbe].
4816 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4817 as the structured Isar versions "cases" and "induct", cf. the
4818 corresponding "cases" and "induct" attributes. Mutual induction rules
4819 are now presented as a list of individual projections
4820 (e.g. foo_bar.inducts for types foo and bar); the old format with
4821 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4822 rare situations a different rule is selected --- notably nested tuple
4823 elimination instead of former prod.exhaust: use explicit (case_tac t
4824 rule: prod.exhaust) here.
4826 * Attributes "cases", "induct", "coinduct" support "del" option.
4828 * Removed fact "case_split_thm", which duplicates "case_split".
4830 * The option datatype has been moved to a new theory Option. Renamed
4831 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4833 * New predicate "strict_mono" classifies strict functions on partial
4834 orders. With strict functions on linear orders, reasoning about
4835 (in)equalities is facilitated by theorems "strict_mono_eq",
4836 "strict_mono_less_eq" and "strict_mono_less".
4838 * Some set operations are now proper qualified constants with
4839 authentic syntax. INCOMPATIBILITY:
4850 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4853 * Auxiliary class "itself" has disappeared -- classes without any
4854 parameter are treated as expected by the 'class' command.
4856 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4858 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4859 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4861 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4862 method "approximation". It proves formulas on real values by using
4863 interval arithmetic. In the formulas are also the transcendental
4864 functions sin, cos, tan, atan, ln, exp and the constant pi are
4865 allowed. For examples see
4866 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4868 * Theory "Reflection" now resides in HOL/Library.
4870 * Entry point to Word library now simply named "Word".
4873 * Made source layout more coherent with logical distribution
4876 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4877 src/HOL/Library/Code_Message.thy ~> src/HOL/
4878 src/HOL/Library/GCD.thy ~> src/HOL/
4879 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4880 src/HOL/Library/Parity.thy ~> src/HOL/
4881 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4882 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4883 src/HOL/Real/Lubs.thy ~> src/HOL/
4884 src/HOL/Real/PReal.thy ~> src/HOL/
4885 src/HOL/Real/Rational.thy ~> src/HOL/
4886 src/HOL/Real/RComplete.thy ~> src/HOL/
4887 src/HOL/Real/RealDef.thy ~> src/HOL/
4888 src/HOL/Real/RealPow.thy ~> src/HOL/
4889 src/HOL/Real/Real.thy ~> src/HOL/
4890 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4891 src/HOL/Complex/Complex.thy ~> src/HOL/
4892 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4893 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4894 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4895 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4896 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4897 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4898 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4899 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4900 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4901 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4902 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4903 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4904 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4905 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4906 src/HOL/Real/Float ~> src/HOL/Library/
4907 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4908 src/HOL/Real/RealVector.thy ~> src/HOL/
4910 src/HOL/arith_data.ML ~> src/HOL/Tools
4911 src/HOL/hologic.ML ~> src/HOL/Tools
4912 src/HOL/simpdata.ML ~> src/HOL/Tools
4913 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4914 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4915 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4916 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4917 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4918 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4919 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4921 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4922 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4923 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4924 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4925 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4926 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4928 * If methods "eval" and "evaluation" encounter a structured proof
4929 state with !!/==>, only the conclusion is evaluated to True (if
4930 possible), avoiding strange error messages.
4932 * Method "sizechange" automates termination proofs using (a
4933 modification of) the size-change principle. Requires SAT solver. See
4934 src/HOL/ex/Termination.thy for examples.
4936 * Simplifier: simproc for let expressions now unfolds if bound
4937 variable occurs at most once in let expression body. INCOMPATIBILITY.
4939 * Method "arith": Linear arithmetic now ignores all inequalities when
4940 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4942 * New attribute "arith" for facts that should always be used
4943 automatically by arithmetic. It is intended to be used locally in
4946 assumes [arith]: "x > 0"
4948 Global usage is discouraged because of possible performance impact.
4950 * New classes "top" and "bot" with corresponding operations "top" and
4951 "bot" in theory Orderings; instantiation of class "complete_lattice"
4952 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4954 * Changed definition lemma "less_fun_def" in order to provide an
4955 instance for preorders on functions; use lemma "less_le" instead.
4958 * Theory Orderings: class "wellorder" moved here, with explicit
4959 induction rule "less_induct" as assumption. For instantiation of
4960 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4963 * Theory Orderings: added class "preorder" as superclass of "order".
4964 INCOMPATIBILITY: Instantiation proofs for order, linorder
4965 etc. slightly changed. Some theorems named order_class.* now named
4968 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4971 * Theory Finite_Set: added a new fold combinator of type
4973 ('a => 'b => 'b) => 'b => 'a set => 'b
4975 Occasionally this is more convenient than the old fold combinator
4976 which is now defined in terms of the new one and renamed to
4979 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4980 and "ring_simps" have been replaced by "algebra_simps" (which can be
4981 extended with further lemmas!). At the moment both still exist but
4982 the former will disappear at some point.
4984 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4985 class recpower. Type-specific simp rules for various recpower types
4986 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4988 rat_power_0 -> power_0
4989 rat_power_Suc -> power_Suc
4990 realpow_0 -> power_0
4991 realpow_Suc -> power_Suc
4992 complexpow_0 -> power_0
4993 complexpow_Suc -> power_Suc
4994 power_poly_0 -> power_0
4995 power_poly_Suc -> power_Suc
4997 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4998 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4999 dvd has been generalized to class comm_semiring_1. Likewise a bunch
5000 of lemmas from Divides has been generalized from nat to class
5001 semiring_div. INCOMPATIBILITY. This involves the following theorem
5002 renames resulting from duplicate elimination:
5004 dvd_def_mod ~> dvd_eq_mod_eq_0
5005 zero_dvd_iff ~> dvd_0_left_iff
5006 dvd_0 ~> dvd_0_right
5007 DIVISION_BY_ZERO_DIV ~> div_by_0
5008 DIVISION_BY_ZERO_MOD ~> mod_by_0
5009 mult_div ~> div_mult_self2_is_id
5010 mult_mod ~> mod_mult_self2_is_0
5012 * Theory IntDiv: removed many lemmas that are instances of class-based
5013 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
5014 rename old lemmas as follows:
5016 dvd_diff -> nat_dvd_diff
5017 dvd_zminus_iff -> dvd_minus_iff
5018 mod_add1_eq -> mod_add_eq
5019 mod_mult1_eq -> mod_mult_right_eq
5020 mod_mult1_eq' -> mod_mult_left_eq
5021 mod_mult_distrib_mod -> mod_mult_eq
5022 nat_mod_add_left_eq -> mod_add_left_eq
5023 nat_mod_add_right_eq -> mod_add_right_eq
5024 nat_mod_div_trivial -> mod_div_trivial
5025 nat_mod_mod_trivial -> mod_mod_trivial
5026 zdiv_zadd_self1 -> div_add_self1
5027 zdiv_zadd_self2 -> div_add_self2
5028 zdiv_zmult_self1 -> div_mult_self2_is_id
5029 zdiv_zmult_self2 -> div_mult_self1_is_id
5030 zdvd_triv_left -> dvd_triv_left
5031 zdvd_triv_right -> dvd_triv_right
5032 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
5033 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
5034 zmod_zadd_left_eq -> mod_add_left_eq
5035 zmod_zadd_right_eq -> mod_add_right_eq
5036 zmod_zadd_self1 -> mod_add_self1
5037 zmod_zadd_self2 -> mod_add_self2
5038 zmod_zadd1_eq -> mod_add_eq
5039 zmod_zdiff1_eq -> mod_diff_eq
5040 zmod_zdvd_zmod -> mod_mod_cancel
5041 zmod_zmod_cancel -> mod_mod_cancel
5042 zmod_zmult_self1 -> mod_mult_self2_is_0
5043 zmod_zmult_self2 -> mod_mult_self1_is_0
5046 zdvd_abs1 -> abs_dvd_iff
5047 zdvd_abs2 -> dvd_abs_iff
5048 zdvd_refl -> dvd_refl
5049 zdvd_trans -> dvd_trans
5050 zdvd_zadd -> dvd_add
5051 zdvd_zdiff -> dvd_diff
5052 zdvd_zminus_iff -> dvd_minus_iff
5053 zdvd_zminus2_iff -> minus_dvd_iff
5054 zdvd_zmultD -> dvd_mult_right
5055 zdvd_zmultD2 -> dvd_mult_left
5056 zdvd_zmult_mono -> mult_dvd_mono
5057 zdvd_0_right -> dvd_0_right
5058 zdvd_0_left -> dvd_0_left_iff
5059 zdvd_1_left -> one_dvd
5060 zminus_dvd_iff -> minus_dvd_iff
5062 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
5064 * The real numbers offer decimal input syntax: 12.34 is translated
5065 into 1234/10^2. This translation is not reversed upon output.
5067 * Theory Library/Polynomial defines an abstract type 'a poly of
5068 univariate polynomials with coefficients of type 'a. In addition to
5069 the standard ring operations, it also supports div and mod. Code
5070 generation is also supported, using list-style constructors.
5072 * Theory Library/Inner_Product defines a class of real_inner for real
5073 inner product spaces, with an overloaded operation inner :: 'a => 'a
5074 => real. Class real_inner is a subclass of real_normed_vector from
5077 * Theory Library/Product_Vector provides instances for the product
5078 type 'a * 'b of several classes from RealVector and Inner_Product.
5079 Definitions of addition, subtraction, scalar multiplication, norms,
5080 and inner products are included.
5082 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5083 addition to the field operations, numerals and case syntax are also
5086 * Theory Library/Diagonalize provides constructive version of Cantor's
5087 first diagonalization argument.
5089 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5090 zlcm (for int); carried together from various gcd/lcm developements in
5091 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5092 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5093 may recover tupled syntax as follows:
5095 hide (open) const gcd
5096 abbreviation gcd where
5097 "gcd == (%(a, b). GCD.gcd a b)"
5099 GCD.gcd ("gcd '(_, _')")
5101 The same works for lcm, zgcd, zlcm.
5103 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5104 instantiations for algebraic structures. Removed some duplicate
5105 theorems. Changes in simp rules. INCOMPATIBILITY.
5107 * ML antiquotation @{code} takes a constant as argument and generates
5108 corresponding code in background and inserts name of the corresponding
5109 resulting ML value/function/datatype constructor binding in place.
5110 All occurrences of @{code} with a single ML block are generated
5111 simultaneously. Provides a generic and safe interface for
5112 instrumentalizing code generation. See
5113 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5114 In future you ought to refrain from ad-hoc compiling generated SML
5115 code on the ML toplevel. Note that (for technical reasons) @{code}
5116 cannot refer to constants for which user-defined serializations are
5117 set. Refer to the corresponding ML counterpart directly in that
5120 * Command 'rep_datatype': instead of theorem names the command now
5121 takes a list of terms denoting the constructors of the type to be
5122 represented as datatype. The characteristic theorems have to be
5123 proven. INCOMPATIBILITY. Also observe that the following theorems
5124 have disappeared in favour of existing ones:
5126 unit_induct ~> unit.induct
5127 prod_induct ~> prod.induct
5128 sum_induct ~> sum.induct
5129 Suc_Suc_eq ~> nat.inject
5130 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5135 * New locales for orders and lattices where the equivalence relation
5136 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5137 locales use a record structure with field eq for the equivalence.
5139 * New theory of factorial domains.
5141 * Units_l_inv and Units_r_inv are now simp rules by default.
5142 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5143 and/or r_inv will now also require deletion of these lemmas.
5145 * Renamed the following theorems, INCOMPATIBILITY:
5147 UpperD ~> Upper_memD
5148 LowerD ~> Lower_memD
5149 least_carrier ~> least_closed
5150 greatest_carrier ~> greatest_closed
5151 greatest_Lower_above ~> greatest_Lower_below
5152 one_zero ~> carrier_one_zero
5153 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5158 * Nominal datatypes can now contain type-variables.
5160 * Commands 'nominal_inductive' and 'equivariance' work with local
5163 * Nominal primrec can now works with local theory targets and its
5164 specification syntax now conforms to the general format as seen in
5167 * Method "perm_simp" honours the standard simplifier attributes
5168 (no_asm), (no_asm_use) etc.
5170 * The new predicate #* is defined like freshness, except that on the
5171 left hand side can be a set or list of atoms.
5173 * Experimental command 'nominal_inductive2' derives strong induction
5174 principles for inductive definitions. In contrast to
5175 'nominal_inductive', which can only deal with a fixed number of
5176 binders, it can deal with arbitrary expressions standing for sets of
5177 atoms to be avoided. The only inductive definition we have at the
5178 moment that needs this generalisation is the typing rule for Lets in
5181 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5182 -----------------------------------------------------------------
5183 Gamma |- Let x be t1 in t2 : T2
5185 In this rule one wants to avoid all the binders that are introduced by
5186 "close Gamma T1". We are looking for other examples where this
5187 feature might be useful. Please let us know.
5192 * Reimplemented the simplification procedure for proving continuity
5193 subgoals. The new simproc is extensible; users can declare additional
5194 continuity introduction rules with the attribute [cont2cont].
5196 * The continuity simproc now uses a different introduction rule for
5197 solving continuity subgoals on terms with lambda abstractions. In
5198 some rare cases the new simproc may fail to solve subgoals that the
5199 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5200 Potential INCOMPATIBILITY.
5202 * Command 'fixrec': specification syntax now conforms to the general
5203 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5204 examples. INCOMPATIBILITY.
5209 * Proof of Zorn's Lemma for partial orders.
5214 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5215 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5216 depends on multithreading, so timouts will not work before Poly/ML
5219 * High-level support for concurrent ML programming, see
5220 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5221 particularly convenient to organize independent functional
5222 computations. The concept of "synchronized variables" provides a
5223 higher-order interface for components with shared state, avoiding the
5224 delicate details of mutexes and condition variables. (Requires
5225 Poly/ML 5.2.1 or later.)
5227 * ML bindings produced via Isar commands are stored within the Isar
5228 context (theory or proof). Consequently, commands like 'use' and 'ML'
5229 become thread-safe and work with undo as expected (concerning
5230 top-level bindings, not side-effects on global references).
5231 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5232 compiler at runtime; really global bindings need to be given outside a
5233 theory. (Requires Poly/ML 5.2 or later.)
5235 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5236 context. Top-level ML bindings are stored within the proof context in
5237 a purely sequential fashion, disregarding the nested proof structure.
5238 ML bindings introduced by 'ML_prf' are discarded at the end of the
5239 proof. (Requires Poly/ML 5.2 or later.)
5241 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5242 and Method.setup, as well as Isar commands 'attribute_setup' and
5243 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5244 existing code accordingly, or use plain 'setup' together with old
5247 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5248 to 'a -> thm, while results are always tagged with an authentic oracle
5249 name. The Isar command 'oracle' is now polymorphic, no argument type
5250 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5251 accordingly. Note that extra performance may be gained by producing
5252 the cterm carefully, avoiding slow Thm.cterm_of.
5254 * Simplified interface for defining document antiquotations via
5255 ThyOutput.antiquotation, ThyOutput.output, and optionally
5256 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5257 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5260 * More systematic treatment of long names, abstract name bindings, and
5261 name space operations. Basic operations on qualified names have been
5262 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5263 Long_Name.append. Old type bstring has been mostly replaced by
5264 abstract type binding (see structure Binding), which supports precise
5265 qualification by packages and local theory targets, as well as proper
5266 tracking of source positions. INCOMPATIBILITY, need to wrap old
5267 bstring values into Binding.name, or better pass through abstract
5268 bindings everywhere. See further src/Pure/General/long_name.ML,
5269 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5271 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5272 LocalTheory.note etc.) now refer to the *full* internal name, not the
5273 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5275 * Disposed old type and term read functions (Sign.read_def_typ,
5276 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5277 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5278 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5279 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5280 resort for legacy applications.
5282 * Disposed old declarations, tactics, tactic combinators that refer to
5283 the simpset or claset of an implicit theory (such as Addsimps,
5284 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5285 embedded ML text, or local_simpset_of with a proper context passed as
5286 explicit runtime argument.
5288 * Rules and tactics that read instantiations (read_instantiate,
5289 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5290 context, which is required for parsing and type-checking. Moreover,
5291 the variables are specified as plain indexnames, not string encodings
5292 thereof. INCOMPATIBILITY.
5294 * Generic Toplevel.add_hook interface allows to analyze the result of
5295 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5296 for theorem dependency output of transactions resulting in a new
5299 * ML antiquotations: block-structured compilation context indicated by
5300 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5302 @{binding name} - basic name binding
5303 @{let ?pat = term} - term abbreviation (HO matching)
5304 @{note name = fact} - fact abbreviation
5305 @{thm fact} - singleton fact (with attributes)
5306 @{thms fact} - general fact (with attributes)
5307 @{lemma prop by method} - singleton goal
5308 @{lemma prop by meth1 meth2} - singleton goal
5309 @{lemma prop1 ... propN by method} - general goal
5310 @{lemma prop1 ... propN by meth1 meth2} - general goal
5311 @{lemma (open) ...} - open derivation
5316 * The Isabelle "emacs" tool provides a specific interface to invoke
5317 Proof General / Emacs, with more explicit failure if that is not
5318 installed (the old isabelle-interface script silently falls back on
5319 isabelle-process). The PROOFGENERAL_HOME setting determines the
5320 installation location of the Proof General distribution.
5322 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5323 the Isabelle process into a JVM/Scala application. See
5324 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5325 process wrapper has been discontinued.)
5327 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5329 * Various status messages (with exact source position information) are
5330 emitted, if proper markup print mode is enabled. This allows
5331 user-interface components to provide detailed feedback on internal
5336 New in Isabelle2008 (June 2008)
5337 -------------------------------
5341 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5342 and updated, with formally checked references as hyperlinks.
5344 * Theory loader: use_thy (and similar operations) no longer set the
5345 implicit ML context, which was occasionally hard to predict and in
5346 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5347 provides a proper context already.
5349 * Theory loader: old-style ML proof scripts being *attached* to a thy
5350 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5351 'use' within a theory file will do the job.
5353 * Name space merge now observes canonical order, i.e. the second space
5354 is inserted into the first one, while existing entries in the first
5355 space take precedence. INCOMPATIBILITY in rare situations, may try to
5356 swap theory imports.
5358 * Syntax: symbol \<chi> is now considered a letter. Potential
5359 INCOMPATIBILITY in identifier syntax etc.
5361 * Outer syntax: string tokens no longer admit escaped white space,
5362 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5363 white space without escapes.
5365 * Outer syntax: string tokens may contain arbitrary character codes
5366 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5372 * Context-dependent token translations. Default setup reverts locally
5373 fixed variables, and adds hilite markup for undeclared frees.
5375 * Unused theorems can be found using the new command 'unused_thms'.
5376 There are three ways of invoking it:
5379 Only finds unused theorems in the current theory.
5381 (2) unused_thms thy_1 ... thy_n -
5382 Finds unused theorems in the current theory and all of its ancestors,
5383 excluding the theories thy_1 ... thy_n and all of their ancestors.
5385 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5386 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5387 their ancestors, excluding the theories thy_1 ... thy_n and all of
5390 In order to increase the readability of the list produced by
5391 unused_thms, theorems that have been created by a particular instance
5392 of a theory command such as 'inductive' or 'function' are considered
5393 to belong to the same "group", meaning that if at least one theorem in
5394 this group is used, the other theorems in the same group are no longer
5395 reported as unused. Moreover, if all theorems in the group are
5396 unused, only one theorem in the group is displayed.
5398 Note that proof objects have to be switched on in order for
5399 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5400 usually the case when using Proof General with the default settings).
5402 * Authentic naming of facts disallows ad-hoc overwriting of previous
5403 theorems within the same name space. INCOMPATIBILITY, need to remove
5404 duplicate fact bindings, or even accidental fact duplications. Note
5405 that tools may maintain dynamically scoped facts systematically, using
5406 PureThy.add_thms_dynamic.
5408 * Command 'hide' now allows to hide from "fact" name space as well.
5410 * Eliminated destructive theorem database, simpset, claset, and
5411 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5412 update of theories within ML code.
5414 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5415 INCOMPATIBILITY, object-logics depending on former Pure require
5416 additional setup PureThy.old_appl_syntax_setup; object-logics
5417 depending on former CPure need to refer to Pure.
5419 * Commands 'use' and 'ML' are now purely functional, operating on
5420 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5421 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5424 * Command 'setup': discontinued implicit version with ML reference.
5426 * Instantiation target allows for simultaneous specification of class
5427 instance operations together with an instantiation proof.
5428 Type-checking phase allows to refer to class operations uniformly.
5429 See src/HOL/Complex/Complex.thy for an Isar example and
5430 src/HOL/Library/Eval.thy for an ML example.
5432 * Indexing of literal facts: be more serious about including only
5433 facts from the visible specification/proof context, but not the
5434 background context (locale etc.). Affects `prop` notation and method
5435 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5438 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5439 "(open)" option, which used to expose internal bound variables to the
5442 * Isar statements: removed obsolete case "rule_context".
5443 INCOMPATIBILITY, better use explicit fixes/assumes.
5445 * Locale proofs: default proof step now includes 'unfold_locales';
5446 hence 'proof' without argument may be used to unfold locale
5450 *** Document preparation ***
5452 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5453 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5454 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5455 spot); renamed link color from "darkblue" to "linkcolor" (default
5456 value unchanged, can be redefined via \definecolor); no longer sets
5457 "a4paper" option (unnecessary or even intrusive).
5459 * Antiquotation @{lemma A method} proves proposition A by the given
5460 method (either a method name or a method name plus (optional) method
5461 arguments in parentheses) and prints A just like @{prop A}.
5466 * New primrec package. Specification syntax conforms in style to
5467 definition/function/.... No separate induction rule is provided. The
5468 "primrec" command distinguishes old-style and new-style specifications
5469 by syntax. The former primrec package is now named OldPrimrecPackage.
5470 When adjusting theories, beware: constants stemming from new-style
5471 primrec specifications have authentic syntax.
5473 * Metis prover is now an order of magnitude faster, and also works
5474 with multithreading.
5476 * Metis: the maximum number of clauses that can be produced from a
5477 theorem is now given by the attribute max_clauses. Theorems that
5478 exceed this number are ignored, with a warning printed.
5480 * Sledgehammer no longer produces structured proofs by default. To
5481 enable, declare [[sledgehammer_full = true]]. Attributes
5482 reconstruction_modulus, reconstruction_sorts renamed
5483 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5485 * Method "induct_scheme" derives user-specified induction rules
5486 from well-founded induction and completeness of patterns. This factors
5487 out some operations that are done internally by the function package
5488 and makes them available separately. See
5489 src/HOL/ex/Induction_Scheme.thy for examples.
5491 * More flexible generation of measure functions for termination
5492 proofs: Measure functions can be declared by proving a rule of the
5493 form "is_measure f" and giving it the [measure_function] attribute.
5494 The "is_measure" predicate is logically meaningless (always true), and
5495 just guides the heuristic. To find suitable measure functions, the
5496 termination prover sets up the goal "is_measure ?f" of the appropriate
5497 type and generates all solutions by prolog-style backwards proof using
5500 This setup also deals with rules like
5502 "is_measure f ==> is_measure (list_size f)"
5504 which accommodates nested datatypes that recurse through lists.
5505 Similar rules are predeclared for products and option types.
5507 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5511 - Definitions of overloaded constants on sets have to be replaced by
5512 definitions on => and bool.
5514 - Some definitions of overloaded operators on sets can now be proved
5515 using the definitions of the operators on => and bool. Therefore,
5516 the following theorems have been renamed:
5518 subset_def -> subset_eq
5519 psubset_def -> psubset_eq
5520 set_diff_def -> set_diff_eq
5521 Compl_def -> Compl_eq
5522 Sup_set_def -> Sup_set_eq
5523 Inf_set_def -> Inf_set_eq
5524 sup_set_def -> sup_set_eq
5525 inf_set_def -> inf_set_eq
5527 - Due to the incompleteness of the HO unification algorithm, some
5528 rules such as subst may require manual instantiation, if some of
5529 the unknowns in the rule is a set.
5531 - Higher order unification and forward proofs:
5534 have "P (S::'a set)" <...>
5535 then have "EX S. P S" ..
5537 no longer works (due to the incompleteness of the HO unification
5538 algorithm) and must be replaced by the pattern
5545 - Calculational reasoning with subst (or similar rules):
5548 have "P (S::'a set)" <...>
5549 also have "S = T" <...>
5550 finally have "P T" .
5552 no longer works (for similar reasons as the previous example) and
5553 must be replaced by something like
5555 have "P (S::'a set)" <...>
5556 moreover have "S = T" <...>
5557 ultimately have "P T" by simp
5559 - Tactics or packages written in ML code:
5560 Code performing pattern matching on types via
5562 Type ("set", [T]) => ...
5564 must be rewritten. Moreover, functions like strip_type or
5565 binder_types no longer return the right value when applied to a
5568 T1 => ... => Tn => U => bool
5572 T1 => ... => Tn => U set
5574 * Merged theories Wellfounded_Recursion, Accessible_Part and
5575 Wellfounded_Relations to theory Wellfounded.
5577 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5579 * Class finite no longer treats UNIV as class parameter. Use class
5580 enum from theory Library/Enum instead to achieve a similar effect.
5583 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5584 and "Cons". INCOMPATIBILITY.
5586 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5587 Potential INCOMPATIBILITY.
5589 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5590 injective_fst_snd removed, use split_eta and prod_eqI instead.
5591 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5593 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5594 the same name in theory Orderings:
5604 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5605 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5606 and different variable names.
5608 * Library/Option_ord.thy: Canonical order on option type.
5610 * Library/RBT.thy: Red-black trees, an efficient implementation of
5613 * Library/Countable.thy: Type class for countable types.
5615 * Theory Int: The representation of numerals has changed. The infix
5616 operator BIT and the bit datatype with constructors B0 and B1 have
5617 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5618 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5619 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5622 * Theory Nat: definition of <= and < on natural numbers no longer
5623 depend on well-founded relations. INCOMPATIBILITY. Definitions
5624 le_def and less_def have disappeared. Consider lemmas not_less
5625 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5627 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5628 (whose purpose mainly is for various fold_set functionals) have been
5629 abandoned in favor of the existing algebraic classes
5630 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5631 lower_semilattice (resp. upper_semilattice) and linorder.
5634 * Theory Transitive_Closure: induct and cases rules now declare proper
5635 case_names ("base" and "step"). INCOMPATIBILITY.
5637 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5638 lattices. The form set-specific version is available as
5639 Inductive.lfp_ordinal_induct_set.
5641 * Renamed theorems "power.simps" to "power_int.simps".
5644 * Class semiring_div provides basic abstract properties of semirings
5645 with division and modulo operations. Subsumes former class dvd_mod.
5647 * Merged theories IntDef, Numeral and IntArith into unified theory
5648 Int. INCOMPATIBILITY.
5650 * Theory Library/Code_Index: type "index" now represents natural
5651 numbers rather than integers. INCOMPATIBILITY.
5653 * New class "uminus" with operation "uminus" (split of from class
5654 "minus" which now only has operation "minus", binary).
5657 * Constants "card", "internal_split", "option_map" now with authentic
5658 syntax. INCOMPATIBILITY.
5660 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5661 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5662 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5663 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5664 Sup_set_def, le_def, less_def, option_map_def now with object
5665 equality. INCOMPATIBILITY.
5667 * Records. Removed K_record, and replaced it by pure lambda term
5668 %x. c. The simplifier setup is now more robust against eta expansion.
5669 INCOMPATIBILITY: in cases explicitly referring to K_record.
5671 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5673 * Library/ListVector: new theory of arithmetic vector operations.
5675 * Library/Order_Relation: new theory of various orderings as sets of
5676 pairs. Defines preorders, partial orders, linear orders and
5677 well-orders on sets and on types.
5682 * Renamed some theories to allow to loading both ZF and HOL in the
5685 Datatype -> Datatype_ZF
5686 Inductive -> Inductive_ZF
5693 INCOMPATIBILITY: ZF theories that import individual theories below
5694 Main might need to be adapted. Regular theory Main is still
5695 available, as trivial extension of Main_ZF.
5700 * ML within Isar: antiquotation @{const name} or @{const
5701 name(typargs)} produces statically-checked Const term.
5703 * Functor NamedThmsFun: data is available to the user as dynamic fact
5704 (of the same name). Removed obsolete print command.
5706 * Removed obsolete "use_legacy_bindings" function.
5708 * The ``print mode'' is now a thread-local value derived from a global
5709 template (the former print_mode reference), thus access becomes
5710 non-critical. The global print_mode reference is for session
5711 management only; user-code should use print_mode_value,
5712 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5714 * Functions system/system_out provide a robust way to invoke external
5715 shell commands, with propagation of interrupts (requires Poly/ML
5716 5.2.1). Do not use OS.Process.system etc. from the basis library!
5721 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5722 in accordance with Proof General 3.7, which prefers GNU emacs.
5724 * isatool tty runs Isabelle process with plain tty interaction;
5725 optional line editor may be specified via ISABELLE_LINE_EDITOR
5726 setting, the default settings attempt to locate "ledit" and "rlwrap".
5728 * isatool browser now works with Cygwin as well, using general
5729 "javapath" function defined in Isabelle process environment.
5731 * YXML notation provides a simple and efficient alternative to
5732 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5733 isatool yxml as described in the Isabelle system manual.
5735 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5736 provides general wrapper for managing an Isabelle process in a robust
5737 fashion, with ``cooked'' output from stdin/stderr.
5739 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5740 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5742 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5743 way of changing the user's settings is via
5744 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5747 * Multithreading.max_threads := 0 refers to the number of actual CPU
5748 cores of the underlying machine, which is a good starting point for
5749 optimal performance tuning. The corresponding usedir option -M allows
5750 "max" as an alias for "0". WARNING: does not work on certain versions
5751 of Mac OS (with Poly/ML 5.1).
5753 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5754 adverse effect of Isabelle flooding interactive front-ends (notably
5755 ProofGeneral / XEmacs).
5759 New in Isabelle2007 (November 2007)
5760 -----------------------------------
5764 * More uniform information about legacy features, notably a
5765 warning/error of "Legacy feature: ...", depending on the state of the
5766 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5767 legacy features will disappear eventually.
5769 * Theory syntax: the header format ``theory A = B + C:'' has been
5770 discontinued in favour of ``theory A imports B C begin''. Use isatool
5771 fixheaders to convert existing theory files. INCOMPATIBILITY.
5773 * Theory syntax: the old non-Isar theory file format has been
5774 discontinued altogether. Note that ML proof scripts may still be used
5775 with Isar theories; migration is usually quite simple with the ML
5776 function use_legacy_bindings. INCOMPATIBILITY.
5778 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5779 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5782 * Theory loader: be more serious about observing the static theory
5783 header specifications (including optional directories), but not the
5784 accidental file locations of previously successful loads. The strict
5785 update policy of former update_thy is now already performed by
5786 use_thy, so the former has been removed; use_thys updates several
5787 theories simultaneously, just as 'imports' within a theory header
5788 specification, but without merging the results. Potential
5789 INCOMPATIBILITY: may need to refine theory headers and commands
5790 ROOT.ML which depend on load order.
5792 * Theory loader: optional support for content-based file
5793 identification, instead of the traditional scheme of full physical
5794 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5795 (cf. the system manual). The new scheme allows to work with
5796 non-finished theories in persistent session images, such that source
5797 files may be moved later on without requiring reloads.
5799 * Theory loader: old-style ML proof scripts being *attached* to a thy
5800 file (with the same base name as the theory) are considered a legacy
5801 feature, which will disappear eventually. Even now, the theory loader
5802 no longer maintains dependencies on such files.
5804 * Syntax: the scope for resolving ambiguities via type-inference is
5805 now limited to individual terms, instead of whole simultaneous
5806 specifications as before. This greatly reduces the complexity of the
5807 syntax module and improves flexibility by separating parsing and
5808 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5809 'fixes' etc.) are required in rare situations.
5811 * Syntax: constants introduced by new-style packages ('definition',
5812 'abbreviation' etc.) are passed through the syntax module in
5813 ``authentic mode''. This means that associated mixfix annotations
5814 really stick to such constants, independently of potential name space
5815 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5816 trees are represented slightly differently, may need to adapt syntax
5817 translations accordingly. Use CONST marker in 'translations' and
5818 @{const_syntax} antiquotation in 'parse_translation' etc.
5820 * Legacy goal package: reduced interface to the bare minimum required
5821 to keep existing proof scripts running. Most other user-level
5822 functions are now part of the OldGoals structure, which is *not* open
5823 by default (consider isatool expandshort before open OldGoals).
5824 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5825 these tend to cause confusion about the actual goal (!) context being
5826 used here, which is not necessarily the same as the_context().
5828 * Command 'find_theorems': supports "*" wild-card in "name:"
5829 criterion; "with_dups" option. Certain ProofGeneral versions might
5830 support a specific search form (see ProofGeneral/CHANGES).
5832 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5833 by default, which means that "prems" (and also "fixed variables") are
5834 suppressed from proof state output. Note that the ProofGeneral
5835 settings mechanism allows to change and save options persistently, but
5836 older versions of Isabelle will fail to start up if a negative prems
5839 * Local theory targets may be specified by non-nested blocks of
5840 ``context/locale/class ... begin'' followed by ``end''. The body may
5841 contain definitions, theorems etc., including any derived mechanism
5842 that has been implemented on top of these primitives. This concept
5843 generalizes the existing ``theorem (in ...)'' towards more versatility
5846 * Proof General interface: proper undo of final 'end' command;
5847 discontinued Isabelle/classic mode (ML proof scripts).
5850 *** Document preparation ***
5852 * Added antiquotation @{theory name} which prints the given name,
5853 after checking that it refers to a valid ancestor theory in the
5856 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5857 check the given source text as ML type/structure, printing verbatim.
5859 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5860 "c args == rhs" given in the current context. (Any number of
5861 arguments may be given on the LHS.)
5866 * The 'class' package offers a combination of axclass and locale to
5867 achieve Haskell-like type classes in Isabelle. Definitions and
5868 theorems within a class context produce both relative results (with
5869 implicit parameters according to the locale context), and polymorphic
5870 constants with qualified polymorphism (according to the class
5871 context). Within the body context of a 'class' target, a separate
5872 syntax layer ("user space type system") takes care of converting
5873 between global polymorphic consts and internal locale representation.
5874 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5875 "isatool doc classes" provides a tutorial.
5877 * Generic code generator framework allows to generate executable
5878 code for ML and Haskell (including Isabelle classes). A short usage
5881 internal compilation:
5882 export_code <list of constants (term syntax)> in SML
5883 writing SML code to a file:
5884 export_code <list of constants (term syntax)> in SML <filename>
5885 writing OCaml code to a file:
5886 export_code <list of constants (term syntax)> in OCaml <filename>
5887 writing Haskell code to a bunch of files:
5888 export_code <list of constants (term syntax)> in Haskell <filename>
5890 evaluating closed propositions to True/False using code generation:
5893 Reasonable default setup of framework in HOL.
5895 Theorem attributs for selecting and transforming function equations theorems:
5897 [code fun]: select a theorem as function equation for a specific constant
5898 [code fun del]: deselect a theorem as function equation for a specific constant
5899 [code inline]: select an equation theorem for unfolding (inlining) in place
5900 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5902 User-defined serializations (target in {SML, OCaml, Haskell}):
5904 code_const <and-list of constants (term syntax)>
5905 {(target) <and-list of const target syntax>}+
5907 code_type <and-list of type constructors>
5908 {(target) <and-list of type target syntax>}+
5910 code_instance <and-list of instances>
5912 where instance ::= <type constructor> :: <class>
5914 code_class <and_list of classes>
5915 {(target) <and-list of class target syntax>}+
5916 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5918 code_instance and code_class only are effective to target Haskell.
5920 For example usage see src/HOL/ex/Codegenerator.thy and
5921 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5922 generation from Isabelle/HOL theories is available via "isatool doc
5925 * Code generator: consts in 'consts_code' Isar commands are now
5926 referred to by usual term syntax (including optional type
5929 * Command 'no_translations' removes translation rules from theory
5932 * Overloaded definitions are now actually checked for acyclic
5933 dependencies. The overloading scheme is slightly more general than
5934 that of Haskell98, although Isabelle does not demand an exact
5935 correspondence to type class and instance declarations.
5936 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5937 exotic versions of overloading -- at the discretion of the user!
5939 Polymorphic constants are represented via type arguments, i.e. the
5940 instantiation that matches an instance against the most general
5941 declaration given in the signature. For example, with the declaration
5942 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5943 as c(nat). Overloading is essentially simultaneous structural
5944 recursion over such type arguments. Incomplete specification patterns
5945 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5946 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5947 Command 'print_theory' outputs the normalized system of recursive
5948 equations, see section "definitions".
5950 * Configuration options are maintained within the theory or proof
5951 context (with name and type bool/int/string), providing a very simple
5952 interface to a poor-man's version of general context data. Tools may
5953 declare options in ML (e.g. using Attrib.config_int) and then refer to
5954 these values using Config.get etc. Users may change options via an
5955 associated attribute of the same name. This form of context
5956 declaration works particularly well with commands 'declare' or
5957 'using', for example ``declare [[foo = 42]]''. Thus it has become
5958 very easy to avoid global references, which would not observe Isar
5959 toplevel undo/redo and fail to work with multithreading.
5961 Various global ML references of Pure and HOL have been turned into
5962 configuration options:
5964 Unify.search_bound unify_search_bound
5965 Unify.trace_bound unify_trace_bound
5966 Unify.trace_simp unify_trace_simp
5967 Unify.trace_types unify_trace_types
5968 Simplifier.simp_depth_limit simp_depth_limit
5969 Blast.depth_limit blast_depth_limit
5970 DatatypeProp.dtK datatype_distinctness_limit
5971 fast_arith_neq_limit fast_arith_neq_limit
5972 fast_arith_split_limit fast_arith_split_limit
5974 * Named collections of theorems may be easily installed as context
5975 data using the functor NamedThmsFun (see also
5976 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5977 attributes; there is also a toplevel print command. This facility is
5978 just a common case of general context data, which is the preferred way
5979 for anything more complex than just a list of facts in canonical
5982 * Isar: command 'declaration' augments a local theory by generic
5983 declaration functions written in ML. This enables arbitrary content
5984 being added to the context, depending on a morphism that tells the
5985 difference of the original declaration context wrt. the application
5986 context encountered later on.
5988 * Isar: proper interfaces for simplification procedures. Command
5989 'simproc_setup' declares named simprocs (with match patterns, and body
5990 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5991 context. ML antiquotation @{simproc name} retrieves named simprocs.
5993 * Isar: an extra pair of brackets around attribute declarations
5994 abbreviates a theorem reference involving an internal dummy fact,
5995 which will be ignored later --- only the effect of the attribute on
5996 the background context will persist. This form of in-place
5997 declarations is particularly useful with commands like 'declare' and
5998 'using', for example ``have A using [[simproc a]] by simp''.
6000 * Isar: method "assumption" (and implicit closing of subproofs) now
6001 takes simple non-atomic goal assumptions into account: after applying
6002 an assumption as a rule the resulting subgoals are solved by atomic
6003 assumption steps. This is particularly useful to finish 'obtain'
6004 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
6005 without referring to the original premise "!!x. P x ==> thesis" in the
6006 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
6009 * Isar: implicit use of prems from the Isar proof context is
6010 considered a legacy feature. Common applications like ``have A .''
6011 may be replaced by ``have A by fact'' or ``note `A`''. In general,
6012 referencing facts explicitly here improves readability and
6013 maintainability of proof texts.
6015 * Isar: improper proof element 'guess' is like 'obtain', but derives
6016 the obtained context from the course of reasoning! For example:
6018 assume "EX x y. A x & B y" -- "any previous fact"
6019 then guess x and y by clarify
6021 This technique is potentially adventurous, depending on the facts and
6022 proof tools being involved here.
6024 * Isar: known facts from the proof context may be specified as literal
6025 propositions, using ASCII back-quote syntax. This works wherever
6026 named facts used to be allowed so far, in proof commands, proof
6027 methods, attributes etc. Literal facts are retrieved from the context
6028 according to unification of type and term parameters. For example,
6029 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
6030 theorems in the current context, then these are valid literal facts:
6031 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
6033 There is also a proof method "fact" which does the same composition
6034 for explicit goal states, e.g. the following proof texts coincide with
6035 certain special cases of literal facts:
6037 have "A" by fact == note `A`
6038 have "A ==> B" by fact == note `A ==> B`
6039 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
6040 have "P a ==> Q a" by fact == note `P a ==> Q a`
6042 * Isar: ":" (colon) is no longer a symbolic identifier character in
6043 outer syntax. Thus symbolic identifiers may be used without
6044 additional white space in declarations like this: ``assume *: A''.
6046 * Isar: 'print_facts' prints all local facts of the current context,
6047 both named and unnamed ones.
6049 * Isar: 'def' now admits simultaneous definitions, e.g.:
6051 def x == "t" and y == "u"
6053 * Isar: added command 'unfolding', which is structurally similar to
6054 'using', but affects both the goal state and facts by unfolding given
6055 rewrite rules. Thus many occurrences of the 'unfold' method or
6056 'unfolded' attribute may be replaced by first-class proof text.
6058 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
6059 and command 'unfolding' now all support object-level equalities
6060 (potentially conditional). The underlying notion of rewrite rule is
6061 analogous to the 'rule_format' attribute, but *not* that of the
6062 Simplifier (which is usually more generous).
6064 * Isar: the new attribute [rotated n] (default n = 1) rotates the
6065 premises of a theorem by n. Useful in conjunction with drule.
6067 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
6068 method expression within a sandbox consisting of the first N
6069 sub-goals, which need to exist. For example, ``simp_all [3]''
6070 simplifies the first three sub-goals, while (rule foo, simp_all)[]
6071 simplifies all new goals that emerge from applying rule foo to the
6072 originally first one.
6074 * Isar: schematic goals are no longer restricted to higher-order
6075 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
6078 * Isar: the conclusion of a long theorem statement is now either
6079 'shows' (a simultaneous conjunction, as before), or 'obtains'
6080 (essentially a disjunction of cases with local parameters and
6081 assumptions). The latter allows to express general elimination rules
6082 adequately; in this notation common elimination rules look like this:
6084 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6086 obtains x where "P x"
6088 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6092 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6098 The subsequent classical rules even refer to the formal "thesis"
6101 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6104 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6105 obtains "thesis ==> something"
6107 The actual proof of an 'obtains' statement is analogous to that of the
6108 Isar proof element 'obtain', only that there may be several cases.
6109 Optional case names may be specified in parentheses; these will be
6110 available both in the present proof and as annotations in the
6111 resulting rule, for later use with the 'cases' method (cf. attribute
6114 * Isar: the assumptions of a long theorem statement are available as
6115 "assms" fact in the proof context. This is more appropriate than the
6116 (historical) "prems", which refers to all assumptions of the current
6117 context, including those from the target locale, proof body etc.
6119 * Isar: 'print_statement' prints theorems from the current theory or
6120 proof context in long statement form, according to the syntax of a
6123 * Isar: 'obtain' takes an optional case name for the local context
6124 introduction rule (default "that").
6126 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6127 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6130 * Pure: syntax "CONST name" produces a fully internalized constant
6131 according to the current context. This is particularly useful for
6132 syntax translations that should refer to internal constant
6133 representations independently of name spaces.
6135 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6136 instead of "FOO ". This allows multiple binder declarations to coexist
6137 in the same context. INCOMPATIBILITY.
6139 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6140 primitive that also works in a locale context (both for constants and
6141 fixed variables). Type declaration and internal syntactic representation
6142 of given constants retrieved from the context. Likewise, the
6143 'no_notation' command allows to remove given syntax annotations from the
6146 * Isar/locales: new derived specification elements 'axiomatization',
6147 'definition', 'abbreviation', which support type-inference, admit
6148 object-level specifications (equality, equivalence). See also the
6149 isar-ref manual. Examples:
6152 eq (infix "===" 50) where
6153 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6155 definition "f x y = x + y + 1"
6156 definition g where "g x = f x x"
6159 neq (infix "=!=" 50) where
6160 "x =!= y == ~ (x === y)"
6162 These specifications may be also used in a locale context. Then the
6163 constants being introduced depend on certain fixed parameters, and the
6164 constant name is qualified by the locale base name. An internal
6165 abbreviation takes care for convenient input and output, making the
6166 parameters implicit and using the original short name. See also
6167 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6168 entities from a monomorphic theory.
6170 Presently, abbreviations are only available 'in' a target locale, but
6171 not inherited by general import expressions. Also note that
6172 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6173 'translations' in common applications. The "no_abbrevs" print mode
6174 prevents folding of abbreviations in term output.
6176 Concrete syntax is attached to specified constants in internal form,
6177 independently of name spaces. The parse tree representation is
6178 slightly different -- use 'notation' instead of raw 'syntax', and
6179 'translations' with explicit "CONST" markup to accommodate this.
6181 * Pure/Isar: unified syntax for new-style specification mechanisms
6182 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6183 full type inference and dummy patterns ("_"). For example:
6185 definition "K x _ = x"
6187 inductive conj for A B
6188 where "A ==> B ==> conj A B"
6190 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6191 the current context. Print mode "no_abbrevs" prevents inversion of
6192 abbreviations on output.
6194 * Isar/locales: improved parameter handling: use of locales "var" and
6195 "struct" no longer necessary; - parameter renamings are no longer
6196 required to be injective. For example, this allows to define
6197 endomorphisms as locale endom = homom mult mult h.
6199 * Isar/locales: changed the way locales with predicates are defined.
6200 Instead of accumulating the specification, the imported expression is
6201 now an interpretation. INCOMPATIBILITY: different normal form of
6202 locale expressions. In particular, in interpretations of locales with
6203 predicates, goals repesenting already interpreted fragments are not
6204 removed automatically. Use methods `intro_locales' and
6205 `unfold_locales'; see below.
6207 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6208 provide backward reasoning on locales predicates. The methods are
6209 aware of interpretations and discharge corresponding goals.
6210 `intro_locales' is less aggressive then `unfold_locales' and does not
6211 unfold predicates to assumptions.
6213 * Isar/locales: the order in which locale fragments are accumulated
6214 has changed. This enables to override declarations from fragments due
6215 to interpretations -- for example, unwanted simp rules.
6217 * Isar/locales: interpretation in theories and proof contexts has been
6218 extended. One may now specify (and prove) equations, which are
6219 unfolded in interpreted theorems. This is useful for replacing
6220 defined concepts (constants depending on locale parameters) by
6221 concepts already existing in the target context. Example:
6223 interpretation partial_order ["op <= :: [int, int] => bool"]
6224 where "partial_order.less (op <=) (x::int) y = (x < y)"
6226 Typically, the constant `partial_order.less' is created by a
6227 definition specification element in the context of locale
6230 * Method "induct": improved internal context management to support
6231 local fixes and defines on-the-fly. Thus explicit meta-level
6232 connectives !! and ==> are rarely required anymore in inductive goals
6233 (using object-logic connectives for this purpose has been long
6234 obsolete anyway). Common proof patterns are explained in
6235 src/HOL/Induct/Common_Patterns.thy, see also
6236 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6239 * Method "induct": improved handling of simultaneous goals. Instead of
6240 introducing object-level conjunction, the statement is now split into
6241 several conclusions, while the corresponding symbolic cases are nested
6242 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6243 see src/HOL/Induct/Common_Patterns.thy, for example.
6245 * Method "induct": mutual induction rules are now specified as a list
6246 of rule sharing the same induction cases. HOL packages usually provide
6247 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6248 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6249 mutual induction rules differently, i.e. like this:
6251 (induct rule: foo_bar.inducts)
6252 (induct set: foo bar)
6253 (induct pred: foo bar)
6254 (induct type: foo bar)
6256 The ML function ProjectRule.projections turns old-style rules into the
6259 * Method "coinduct": dual of induction, see
6260 src/HOL/Library/Coinductive_List.thy for various examples.
6262 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6263 considered a legacy feature.
6265 * Attribute "symmetric" produces result with standardized schematic
6266 variables (index 0). Potential INCOMPATIBILITY.
6268 * Simplifier: by default the simplifier trace only shows top level
6269 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6270 default. Thus there is less danger of being flooded by the trace. The
6271 trace indicates where parts have been suppressed.
6273 * Provers/classical: removed obsolete classical version of elim_format
6274 attribute; classical elim/dest rules are now treated uniformly when
6275 manipulating the claset.
6277 * Provers/classical: stricter checks to ensure that supplied intro,
6278 dest and elim rules are well-formed; dest and elim rules must have at
6281 * Provers/classical: attributes dest/elim/intro take an optional
6282 weight argument for the rule (just as the Pure versions). Weights are
6283 ignored by automated tools, but determine the search order of single
6286 * Syntax: input syntax now supports dummy variable binding "%_. b",
6287 where the body does not mention the bound variable. Note that dummy
6288 patterns implicitly depend on their context of bounds, which makes
6289 "{_. _}" match any set comprehension as expected. Potential
6290 INCOMPATIBILITY -- parse translations need to cope with syntactic
6291 constant "_idtdummy" in the binding position.
6293 * Syntax: removed obsolete syntactic constant "_K" and its associated
6294 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6295 for example "A -> B" => "Pi A (%_. B)".
6297 * Pure: 'class_deps' command visualizes the subclass relation, using
6298 the graph browser tool.
6300 * Pure: 'print_theory' now suppresses certain internal declarations by
6301 default; use '!' option for full details.
6306 * Method "metis" proves goals by applying the Metis general-purpose
6307 resolution prover (see also http://gilith.com/software/metis/).
6308 Examples are in the directory MetisExamples. WARNING: the
6309 Isabelle/HOL-Metis integration does not yet work properly with
6312 * Command 'sledgehammer' invokes external automatic theorem provers as
6313 background processes. It generates calls to the "metis" method if
6314 successful. These can be pasted into the proof. Users do not have to
6315 wait for the automatic provers to return. WARNING: does not really
6316 work with multi-threading.
6318 * New "auto_quickcheck" feature tests outermost goal statements for
6319 potential counter-examples. Controlled by ML references
6320 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6321 5000 milliseconds). Fails silently if statements is outside of
6322 executable fragment, or any other codgenerator problem occurs.
6324 * New constant "undefined" with axiom "undefined x = undefined".
6326 * Added class "HOL.eq", allowing for code generation with polymorphic
6329 * Some renaming of class constants due to canonical name prefixing in
6330 the new 'class' package:
6332 HOL.abs ~> HOL.abs_class.abs
6333 HOL.divide ~> HOL.divide_class.divide
6334 0 ~> HOL.zero_class.zero
6335 1 ~> HOL.one_class.one
6336 op + ~> HOL.plus_class.plus
6337 op - ~> HOL.minus_class.minus
6338 uminus ~> HOL.minus_class.uminus
6339 op * ~> HOL.times_class.times
6340 op < ~> HOL.ord_class.less
6341 op <= > HOL.ord_class.less_eq
6342 Nat.power ~> Power.power_class.power
6343 Nat.size ~> Nat.size_class.size
6344 Numeral.number_of ~> Numeral.number_class.number_of
6345 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6346 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6347 Orderings.min ~> Orderings.ord_class.min
6348 Orderings.max ~> Orderings.ord_class.max
6349 Divides.op div ~> Divides.div_class.div
6350 Divides.op mod ~> Divides.div_class.mod
6351 Divides.op dvd ~> Divides.div_class.dvd
6353 INCOMPATIBILITY. Adaptions may be required in the following cases:
6355 a) User-defined constants using any of the names "plus", "minus",
6356 "times", "less" or "less_eq". The standard syntax translations for
6357 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6360 b) Variables named "plus", "minus", "times", "less", "less_eq"
6361 INCOMPATIBILITY: use more specific names.
6363 c) Permutative equations (e.g. "a + b = b + a")
6364 Since the change of names also changes the order of terms, permutative
6365 rewrite rules may get applied in a different order. Experience shows
6366 that this is rarely the case (only two adaptions in the whole Isabelle
6367 distribution). INCOMPATIBILITY: rewrite proofs
6369 d) ML code directly refering to constant names
6370 This in general only affects hand-written proof tactics, simprocs and
6371 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6372 Consider using @{const_name} antiquotation.
6374 * New class "default" with associated constant "default".
6376 * Function "sgn" is now overloaded and available on int, real, complex
6377 (and other numeric types), using class "sgn". Two possible defs of
6378 sgn are given as equational assumptions in the classes sgn_if and
6379 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6382 * Locale "partial_order" now unified with class "order" (cf. theory
6383 Orderings), added parameter "less". INCOMPATIBILITY.
6385 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6386 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6387 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6389 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6390 changed order of proof goals in instance proofs.
6392 * The transitivity reasoner for partial and linear orders is set up
6393 for classes "order" and "linorder". Instances of the reasoner are available
6394 in all contexts importing or interpreting the corresponding locales.
6395 Method "order" invokes the reasoner separately; the reasoner
6396 is also integrated with the Simplifier as a solver. Diagnostic
6397 command 'print_orders' shows the available instances of the reasoner
6398 in the current context.
6400 * Localized monotonicity predicate in theory "Orderings"; integrated
6401 lemmas max_of_mono and min_of_mono with this predicate.
6404 * Formulation of theorem "dense" changed slightly due to integration
6405 with new class dense_linear_order.
6407 * Uniform lattice theory development in HOL.
6409 constants "meet" and "join" now named "inf" and "sup"
6410 constant "Meet" now named "Inf"
6412 classes "meet_semilorder" and "join_semilorder" now named
6413 "lower_semilattice" and "upper_semilattice"
6414 class "lorder" now named "lattice"
6415 class "comp_lat" now named "complete_lattice"
6417 Instantiation of lattice classes allows explicit definitions
6418 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6420 INCOMPATIBILITY. Theorem renames:
6422 meet_left_le ~> inf_le1
6423 meet_right_le ~> inf_le2
6424 join_left_le ~> sup_ge1
6425 join_right_le ~> sup_ge2
6426 meet_join_le ~> inf_sup_ord
6429 le_meet ~> le_inf_iff
6430 le_join ~> ge_sup_conv
6431 meet_idempotent ~> inf_idem
6432 join_idempotent ~> sup_idem
6433 meet_comm ~> inf_commute
6434 join_comm ~> sup_commute
6435 meet_leI1 ~> le_infI1
6436 meet_leI2 ~> le_infI2
6437 le_joinI1 ~> le_supI1
6438 le_joinI2 ~> le_supI2
6439 meet_assoc ~> inf_assoc
6440 join_assoc ~> sup_assoc
6441 meet_left_comm ~> inf_left_commute
6442 meet_left_idempotent ~> inf_left_idem
6443 join_left_comm ~> sup_left_commute
6444 join_left_idempotent ~> sup_left_idem
6447 le_def_meet ~> le_iff_inf
6448 le_def_join ~> le_iff_sup
6449 join_absorp2 ~> sup_absorb2
6450 join_absorp1 ~> sup_absorb1
6451 meet_absorp1 ~> inf_absorb1
6452 meet_absorp2 ~> inf_absorb2
6453 meet_join_absorp ~> inf_sup_absorb
6454 join_meet_absorp ~> sup_inf_absorb
6455 distrib_join_le ~> distrib_sup_le
6456 distrib_meet_le ~> distrib_inf_le
6458 add_meet_distrib_left ~> add_inf_distrib_left
6459 add_join_distrib_left ~> add_sup_distrib_left
6460 is_join_neg_meet ~> is_join_neg_inf
6461 is_meet_neg_join ~> is_meet_neg_sup
6462 add_meet_distrib_right ~> add_inf_distrib_right
6463 add_join_distrib_right ~> add_sup_distrib_right
6464 add_meet_join_distribs ~> add_sup_inf_distribs
6465 join_eq_neg_meet ~> sup_eq_neg_inf
6466 meet_eq_neg_join ~> inf_eq_neg_sup
6467 add_eq_meet_join ~> add_eq_inf_sup
6468 meet_0_imp_0 ~> inf_0_imp_0
6469 join_0_imp_0 ~> sup_0_imp_0
6470 meet_0_eq_0 ~> inf_0_eq_0
6471 join_0_eq_0 ~> sup_0_eq_0
6472 neg_meet_eq_join ~> neg_inf_eq_sup
6473 neg_join_eq_meet ~> neg_sup_eq_inf
6474 join_eq_if ~> sup_eq_if
6476 mono_meet ~> mono_inf
6477 mono_join ~> mono_sup
6478 meet_bool_eq ~> inf_bool_eq
6479 join_bool_eq ~> sup_bool_eq
6480 meet_fun_eq ~> inf_fun_eq
6481 join_fun_eq ~> sup_fun_eq
6482 meet_set_eq ~> inf_set_eq
6483 join_set_eq ~> sup_set_eq
6484 meet1_iff ~> inf1_iff
6485 meet2_iff ~> inf2_iff
6494 join1_iff ~> sup1_iff
6495 join2_iff ~> sup2_iff
6505 is_meet_Meet ~> is_meet_Inf
6506 Meet_bool_def ~> Inf_bool_def
6507 Meet_fun_def ~> Inf_fun_def
6508 Meet_greatest ~> Inf_greatest
6509 Meet_lower ~> Inf_lower
6510 Meet_set_def ~> Inf_set_def
6513 Sup_bool_eq ~> Sup_bool_def
6514 Sup_fun_eq ~> Sup_fun_def
6515 Sup_set_eq ~> Sup_set_def
6517 listsp_meetI ~> listsp_infI
6518 listsp_meet_eq ~> listsp_inf_eq
6523 * Added syntactic class "size"; overloaded constant "size" now has
6524 type "'a::size ==> bool"
6526 * Internal reorganisation of `size' of datatypes: size theorems
6527 "foo.size" are no longer subsumed by "foo.simps" (but are still
6528 simplification rules by default!); theorems "prod.size" now named
6531 * Class "div" now inherits from class "times" rather than "type".
6534 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6535 Linorder etc. have disappeared; operations defined in terms of
6536 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6538 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6540 * HOL-Word: New extensive library and type for generic, fixed size
6541 machine words, with arithmetic, bit-wise, shifting and rotating
6542 operations, reflection into int, nat, and bool lists, automation for
6543 linear arithmetic (by automatic reflection into nat or int), including
6544 lemmas on overflow and monotonicity. Instantiated to all appropriate
6545 arithmetic type classes, supporting automatic simplification of
6546 numerals on all operations.
6548 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6550 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6552 * Code generator library theories:
6553 - Code_Integer represents HOL integers by big integer literals in target
6555 - Code_Char represents HOL characters by character literals in target
6557 - Code_Char_chr like Code_Char, but also offers treatment of character
6558 codes; includes Code_Integer.
6559 - Executable_Set allows to generate code for finite sets using lists.
6560 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6562 - Executable_Real implements a subset of real numbers, namly those
6563 representable by rational numbers.
6564 - Efficient_Nat implements natural numbers by integers, which in general will
6565 result in higher efficency; pattern matching with 0/Suc is eliminated;
6566 includes Code_Integer.
6567 - Code_Index provides an additional datatype index which is mapped to
6568 target-language built-in integers.
6569 - Code_Message provides an additional datatype message_string which is isomorphic to
6570 strings; messages are mapped to target-language strings.
6572 * New package for inductive predicates
6574 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6577 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6578 for z_1 :: U_1 and ... and z_n :: U_m
6580 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6583 with full support for type-inference, rather than
6585 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6587 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6588 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6590 inductive "s z_1 ... z_m"
6592 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6595 For backward compatibility, there is a wrapper allowing inductive
6596 sets to be defined with the new package via
6599 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6600 for z_1 :: U_1 and ... and z_n :: U_m
6602 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6608 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6609 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6610 for z_1 :: U_1 and ... and z_n :: U_m
6612 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6613 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6616 if the additional syntax "p ..." is required.
6618 Numerous examples can be found in the subdirectories src/HOL/Auth,
6619 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6623 - Since declaration and definition of inductive sets or predicates
6624 is no longer separated, abbreviations involving the newly
6625 introduced sets or predicates must be specified together with the
6626 introduction rules after the 'where' keyword (see above), rather
6627 than before the actual inductive definition.
6629 - The variables in induction and elimination rules are now
6630 quantified in the order of their occurrence in the introduction
6631 rules, rather than in alphabetical order. Since this may break
6632 some proofs, these proofs either have to be repaired, e.g. by
6633 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6634 statements of the form
6636 case (rule_i a_i_1 ... a_i_{k_i})
6638 or the old order of quantification has to be restored by explicitly adding
6639 meta-level quantifiers in the introduction rules, i.e.
6641 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6643 - The format of the elimination rules is now
6645 p z_1 ... z_m x_1 ... x_n ==>
6646 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6651 (x_1, ..., x_n) : s z_1 ... z_m ==>
6652 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6655 for sets rather than
6657 x : s z_1 ... z_m ==>
6658 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6661 This may require terms in goals to be expanded to n-tuples
6662 (e.g. using case_tac or simplification with the split_paired_all
6663 rule) before the above elimination rule is applicable.
6665 - The elimination or case analysis rules for (mutually) inductive
6666 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6667 list of rules "p_1_..._p_k.elims" is no longer available.
6669 * New package "function"/"fun" for general recursive functions,
6670 supporting mutual and nested recursion, definitions in local contexts,
6671 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6672 for small examples, and the separate tutorial on the function
6673 package. The old recdef "package" is still available as before, but
6674 users are encouraged to use the new package.
6676 * Method "lexicographic_order" automatically synthesizes termination
6677 relations as lexicographic combinations of size measures.
6679 * Case-expressions allow arbitrary constructor-patterns (including
6680 "_") and take their order into account, like in functional
6681 programming. Internally, this is translated into nested
6682 case-expressions; missing cases are added and mapped to the predefined
6683 constant "undefined". In complicated cases printing may no longer show
6684 the original input but the internal form. Lambda-abstractions allow
6685 the same form of pattern matching: "% pat1 => e1 | ..." is an
6686 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6689 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6690 is an abbreviation for "of_nat :: nat => int". The simplification
6691 rules for "of_nat" have been changed to work like "int" did
6692 previously. Potential INCOMPATIBILITY:
6693 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6694 - of_nat_diff and of_nat_mult are no longer default simp rules
6696 * Method "algebra" solves polynomial equations over (semi)rings using
6697 Groebner bases. The (semi)ring structure is defined by locales and the
6698 tool setup depends on that generic context. Installing the method for
6699 a specific type involves instantiating the locale and possibly adding
6700 declarations for computation on the coefficients. The method is
6701 already instantiated for natural numbers and for the axiomatic class
6702 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6703 CALCULEMUS 2007 for the general principles underlying this
6704 architecture of context-aware proof-tools.
6706 * Method "ferrack" implements quantifier elimination over
6707 special-purpose dense linear orders using locales (analogous to
6708 "algebra"). The method is already installed for class
6709 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6712 * Former constant "List.op @" now named "List.append". Use ML
6713 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6714 circumvent possible incompatibilities when working on ML level.
6716 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6718 * New function listsum :: 'a list => 'a for arbitrary monoids.
6719 Special syntax: "SUM x <- xs. f x" (and latex variants)
6721 * New syntax for Haskell-like list comprehension (input only), eg.
6722 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6724 * The special syntax for function "filter" has changed from [x :
6725 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6726 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6728 * [a..b] is now defined for arbitrary linear orders. It used to be
6729 defined on nat only, as an abbreviation for [a..<Suc b]
6732 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6734 * New functions "sorted" and "sort" in src/HOL/List.thy.
6736 * New lemma collection field_simps (an extension of ring_simps) for
6737 manipulating (in)equations involving division. Multiplies with all
6738 denominators that can be proved to be non-zero (in equations) or
6739 positive/negative (in inequations).
6741 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6742 have been improved and renamed to ring_simps, group_simps and
6743 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6744 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6746 * Theory Library/Commutative_Ring: switched from recdef to function
6747 package; constants add, mul, pow now curried. Infix syntax for
6748 algebraic operations.
6750 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6753 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6756 * HOL/records: generalised field-update to take a function on the
6757 field rather than the new value: r(|A := x|) is translated to A_update
6758 (K x) r The K-combinator that is internally used is called K_record.
6759 INCOMPATIBILITY: Usage of the plain update functions has to be
6762 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6763 * x = 0, which are required for a semiring. Richer structures do not
6764 inherit from semiring_0 anymore, because this property is a theorem
6765 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6766 there is more to prove, but this is mostly trivial.
6768 * Class "recpower" is generalized to arbitrary monoids, not just
6769 commutative semirings. INCOMPATIBILITY: may need to incorporate
6770 commutativity or semiring properties additionally.
6772 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6773 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6774 better use 'abbreviation'.
6776 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6778 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6779 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6780 significant changes for setting up numeral syntax for types:
6781 - New constants Numeral.pred and Numeral.succ instead
6782 of former Numeral.bin_pred and Numeral.bin_succ.
6783 - Use integer operations instead of bin_add, bin_mult and so on.
6784 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6785 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6787 See src/HOL/Integ/IntArith.thy for an example setup.
6789 * Command 'normal_form' computes the normal form of a term that may
6790 contain free variables. For example ``normal_form "rev [a, b, c]"''
6791 produces ``[b, c, a]'' (without proof). This command is suitable for
6792 heavy-duty computations because the functions are compiled to ML
6793 first. Correspondingly, a method "normalization" is provided. See
6794 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6796 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6797 25 like -->); output depends on the "iff" print_mode, the default is
6798 "A = B" (with priority 50).
6800 * Relations less (<) and less_eq (<=) are also available on type bool.
6801 Modified syntax to disallow nesting without explicit parentheses,
6802 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6805 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6807 * Relation composition operator "op O" now has precedence 75 and binds
6808 stronger than union and intersection. INCOMPATIBILITY.
6810 * The old set interval syntax "{m..n(}" (and relatives) has been
6811 removed. Use "{m..<n}" (and relatives) instead.
6813 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6814 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6815 ``declare [[simproc del: neq]]''.
6817 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6820 * Theorem Cons_eq_map_conv no longer declared as "simp".
6822 * Theorem setsum_mult renamed to setsum_right_distrib.
6824 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6827 * Reimplemented methods "sat" and "satx", with several improvements:
6828 goals no longer need to be stated as "<prems> ==> False", equivalences
6829 (i.e. "=" on type bool) are handled, variable names of the form
6830 "lit_<n>" are no longer reserved, significant speedup.
6832 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6833 zChaff is still supported as well.
6835 * 'inductive' and 'datatype': provide projections of mutual rules,
6836 bundled as foo_bar.inducts;
6838 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6841 * Library: moved theory Accessible_Part to main HOL.
6843 * Library: added theory Coinductive_List of potentially infinite lists
6844 as greatest fixed-point.
6846 * Library: added theory AssocList which implements (finite) maps as
6849 * Method "evaluation" solves goals (i.e. a boolean expression)
6850 efficiently by compiling it to ML. The goal is "proved" (via an
6851 oracle) if it evaluates to True.
6853 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6854 also when invoked by the simplifier. This results in the Simplifier
6855 being more powerful on arithmetic goals. INCOMPATIBILITY.
6856 Configuration option fast_arith_split_limit=0 recovers the old
6859 * Support for hex (0x20) and binary (0b1001) numerals.
6861 * New method: reify eqs (t), where eqs are equations for an
6862 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6863 parameter, computes a term s::'b and a list xs::'a list and proves the
6864 theorem I xs s = t. This is also known as reification or quoting. The
6865 resulting theorem is applied to the subgoal to substitute t with I xs
6866 s. If t is omitted, the subgoal itself is reified.
6868 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6869 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6870 where f is supposed to be a computable function (in the sense of code
6871 generattion). The method uses reify to compute s and xs as above then
6872 applies corr_thm and uses normalization by evaluation to "prove" f s =
6873 r and finally gets the theorem t = r, which is again applied to the
6874 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6876 * Reflection: Automatic reification now handels binding, an example is
6877 available in src/HOL/ex/ReflectionEx.thy
6879 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6880 command 'statespace' that is similar to 'record', but introduces an
6881 abstract specification based on the locale infrastructure instead of
6882 HOL types. This leads to extra flexibility in composing state spaces,
6883 in particular multiple inheritance and renaming of components.
6888 * Hyperreal: Functions root and sqrt are now defined on negative real
6889 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6890 Nonnegativity side conditions have been removed from many lemmas, so
6891 that more subgoals may now be solved by simplification; potential
6894 * Real: new type classes formalize real normed vector spaces and
6895 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6896 and norm :: 'a => real.
6898 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6899 reals into other types. The overloaded constant Reals :: 'a set is now
6900 defined as range of_real; potential INCOMPATIBILITY.
6902 * Real: proper support for ML code generation, including 'quickcheck'.
6903 Reals are implemented as arbitrary precision rationals.
6905 * Hyperreal: Several constants that previously worked only for the
6906 reals have been generalized, so they now work over arbitrary vector
6907 spaces. Type annotations may need to be added in some cases; potential
6910 Infinitesimal :: ('a::real_normed_vector) star set
6911 HFinite :: ('a::real_normed_vector) star set
6912 HInfinite :: ('a::real_normed_vector) star set
6913 approx :: ('a::real_normed_vector) star => 'a star => bool
6914 monad :: ('a::real_normed_vector) star => 'a star set
6915 galaxy :: ('a::real_normed_vector) star => 'a star set
6916 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6917 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6918 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6919 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6920 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6921 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6922 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6923 sgn :: 'a::real_normed_vector => 'a
6924 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6926 * Complex: Some complex-specific constants are now abbreviations for
6927 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6928 hnorm. Other constants have been entirely removed in favor of the
6929 polymorphic versions (INCOMPATIBILITY):
6933 HInfinite <-- CInfinite
6934 Infinitesimal <-- CInfinitesimal
6937 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6938 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6939 (ns)deriv <-- (ns)cderiv
6944 * Formalisation of ideals and the quotient construction over rings.
6946 * Order and lattice theory no longer based on records.
6949 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6950 greatest_closed. INCOMPATIBILITY.
6952 * Method algebra is now set up via an attribute. For examples see
6953 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6954 of algebraic structures.
6956 * Renamed theory CRing to Ring.
6961 * Substantial, yet incomplete support for nominal datatypes (binding
6962 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6963 src/HOL/Nominal/Examples. Prospective users should consult
6964 http://isabelle.in.tum.de/nominal/
6969 * ML basics: just one true type int, which coincides with IntInf.int
6972 * ML within Isar: antiquotations allow to embed statically-checked
6973 formal entities in the source, referring to the context available at
6974 compile-time. For example:
6976 ML {* @{sort "{zero,one}"} *}
6977 ML {* @{typ "'a => 'b"} *}
6978 ML {* @{term "%x. x"} *}
6979 ML {* @{prop "x == y"} *}
6980 ML {* @{ctyp "'a => 'b"} *}
6981 ML {* @{cterm "%x. x"} *}
6982 ML {* @{cprop "x == y"} *}
6983 ML {* @{thm asm_rl} *}
6984 ML {* @{thms asm_rl} *}
6985 ML {* @{type_name c} *}
6986 ML {* @{type_syntax c} *}
6987 ML {* @{const_name c} *}
6988 ML {* @{const_syntax c} *}
6991 ML {* @{theory Pure} *}
6992 ML {* @{theory_ref} *}
6993 ML {* @{theory_ref Pure} *}
6996 ML {* @{clasimpset} *}
6998 The same works for sources being ``used'' within an Isar context.
7000 * ML in Isar: improved error reporting; extra verbosity with
7001 ML_Context.trace enabled.
7003 * Pure/General/table.ML: the join operations now works via exceptions
7004 DUP/SAME instead of type option. This is simpler in simple cases, and
7005 admits slightly more efficient complex applications.
7007 * Pure: 'advanced' translation functions (parse_translation etc.) now
7008 use Context.generic instead of just theory.
7010 * Pure: datatype Context.generic joins theory/Proof.context and
7011 provides some facilities for code that works in either kind of
7012 context, notably GenericDataFun for uniform theory and proof data.
7014 * Pure: simplified internal attribute type, which is now always
7015 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
7016 local (Proof.context) attributes have been discontinued, while
7017 minimizing code duplication. Thm.rule_attribute and
7018 Thm.declaration_attribute build canonical attributes; see also structure
7019 Context for further operations on Context.generic, notably
7020 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
7021 declarations and definitions.
7023 * Context data interfaces (Theory/Proof/GenericDataFun): removed
7024 name/print, uninitialized data defaults to ad-hoc copy of empty value,
7025 init only required for impure data. INCOMPATIBILITY: empty really need
7026 to be empty (no dependencies on theory content!)
7028 * Pure/kernel: consts certification ignores sort constraints given in
7029 signature declarations. (This information is not relevant to the
7030 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
7031 potential INCOMPATIBILITY.
7033 * Pure: axiomatic type classes are now purely definitional, with
7034 explicit proofs of class axioms and super class relations performed
7035 internally. See Pure/axclass.ML for the main internal interfaces --
7036 notably AxClass.define_class supercedes AxClass.add_axclass, and
7037 AxClass.axiomatize_class/classrel/arity supersede
7038 Sign.add_classes/classrel/arities.
7040 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
7041 global/local versions on theory vs. Proof.context have been
7042 discontinued; Attrib.syntax and Method.syntax have been adapted
7043 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
7044 attributes, methods, etc.
7046 * Pure: several functions of signature "... -> theory -> theory * ..."
7047 have been reoriented to "... -> theory -> ... * theory" in order to
7048 allow natural usage in combination with the ||>, ||>>, |-> and
7049 fold_map combinators.
7051 * Pure: official theorem names (closed derivations) and additional
7052 comments (tags) are now strictly separate. Name hints -- which are
7053 maintained as tags -- may be attached any time without affecting the
7056 * Pure: primitive rule lift_rule now takes goal cterm instead of an
7057 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
7058 achieve the old behaviour.
7060 * Pure: the "Goal" constant is now called "prop", supporting a
7061 slightly more general idea of ``protecting'' meta-level rule
7064 * Pure: Logic.(un)varify only works in a global context, which is now
7065 enforced instead of silently assumed. INCOMPATIBILITY, may use
7066 Logic.legacy_(un)varify as temporary workaround.
7068 * Pure: structure Name provides scalable operations for generating
7069 internal variable names, notably Name.variants etc. This replaces
7070 some popular functions from term.ML:
7072 Term.variant -> Name.variant
7073 Term.variantlist -> Name.variant_list
7074 Term.invent_names -> Name.invent_list
7076 Note that low-level renaming rarely occurs in new code -- operations
7077 from structure Variable are used instead (see below).
7079 * Pure: structure Variable provides fundamental operations for proper
7080 treatment of fixed/schematic variables in a context. For example,
7081 Variable.import introduces fixes for schematics of given facts and
7082 Variable.export reverses the effect (up to renaming) -- this replaces
7083 various freeze_thaw operations.
7085 * Pure: structure Goal provides simple interfaces for
7086 init/conclude/finish and tactical prove operations (replacing former
7087 Tactic.prove). Goal.prove is the canonical way to prove results
7088 within a given context; Goal.prove_global is a degraded version for
7089 theory level goals, including a global Drule.standard. Note that
7090 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7091 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7092 in a locale context).
7094 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7095 and type checking (Syntax.check_term etc.), with common combinations
7096 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7097 which are considered legacy and await removal.
7099 * Pure/Syntax: generic interfaces for type unchecking
7100 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7101 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7102 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7103 available for convenience, but refer to the very same operations using
7104 a mere theory instead of a full context.
7106 * Isar: simplified treatment of user-level errors, using exception
7107 ERROR of string uniformly. Function error now merely raises ERROR,
7108 without any side effect on output channels. The Isar toplevel takes
7109 care of proper display of ERROR exceptions. ML code may use plain
7110 handle/can/try; cat_error may be used to concatenate errors like this:
7112 ... handle ERROR msg => cat_error msg "..."
7114 Toplevel ML code (run directly or through the Isar toplevel) may be
7115 embedded into the Isar toplevel with exception display/debug like
7118 Isar.toplevel (fn () => ...)
7120 INCOMPATIBILITY, removed special transform_error facilities, removed
7121 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7122 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7123 -- use plain ERROR instead.
7125 * Isar: theory setup now has type (theory -> theory), instead of a
7126 list. INCOMPATIBILITY, may use #> to compose setup functions.
7128 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7129 ProofContext.debug/verbose flags.
7131 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7132 theory before entering a proof state. Transactions now always see a
7133 quasi-functional intermediate checkpoint, both in interactive and
7136 * Isar: simplified interfaces for outer syntax. Renamed
7137 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7138 OuterSyntax.add_parsers -- this functionality is now included in
7139 OuterSyntax.command etc. INCOMPATIBILITY.
7141 * Simplifier: the simpset of a running simplification process now
7142 contains a proof context (cf. Simplifier.the_context), which is the
7143 very context that the initial simpset has been retrieved from (by
7144 simpset_of/local_simpset_of). Consequently, all plug-in components
7145 (solver, looper etc.) may depend on arbitrary proof data.
7147 * Simplifier.inherit_context inherits the proof context (plus the
7148 local bounds) of the current simplification process; any simproc
7149 etc. that calls the Simplifier recursively should do this! Removed
7150 former Simplifier.inherit_bounds, which is already included here --
7151 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7152 specify an explicit context using Simplifier.context/theory_context.
7154 * Simplifier/Classical Reasoner: more abstract interfaces
7155 change_simpset/claset for modifying the simpset/claset reference of a
7156 theory; raw versions simpset/claset_ref etc. have been discontinued --
7159 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7165 * settings: the default heap location within ISABELLE_HOME_USER now
7166 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7167 Isabelle installations.
7169 * isabelle-process: option -S (secure mode) disables some critical
7170 operations, notably runtime compilation and evaluation of ML source
7173 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7175 * Support for parallel execution, using native multicore support of
7176 Poly/ML 5.1. The theory loader exploits parallelism when processing
7177 independent theories, according to the given theory header
7178 specifications. The maximum number of worker threads is specified via
7179 usedir option -M or the "max-threads" setting in Proof General. A
7180 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7181 to 6 on a 8-core machine. User-code needs to observe certain
7182 guidelines for thread-safe programming, see appendix A in the Isar
7183 Implementation manual.
7187 New in Isabelle2005 (October 2005)
7188 ----------------------------------
7192 * Theory headers: the new header syntax for Isar theories is
7195 imports <theory1> ... <theoryN>
7196 uses <file1> ... <fileM>
7199 where the 'uses' part is optional. The previous syntax
7201 theory <name> = <theory1> + ... + <theoryN>:
7203 will disappear in the next release. Use isatool fixheaders to convert
7204 existing theory files. Note that there is no change in ancient
7205 non-Isar theories now, but these will disappear soon.
7207 * Theory loader: parent theories can now also be referred to via
7208 relative and absolute paths.
7210 * Command 'find_theorems' searches for a list of criteria instead of a
7211 list of constants. Known criteria are: intro, elim, dest, name:string,
7212 simp:term, and any term. Criteria can be preceded by '-' to select
7213 theorems that do not match. Intro, elim, dest select theorems that
7214 match the current goal, name:s selects theorems whose fully qualified
7215 name contain s, and simp:term selects all simplification rules whose
7216 lhs match term. Any other term is interpreted as pattern and selects
7217 all theorems matching the pattern. Available in ProofGeneral under
7218 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7220 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7222 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7223 matching the current goal as introduction rule and not having "HOL."
7224 in their name (i.e. not being defined in theory HOL).
7226 * Command 'thms_containing' has been discontinued in favour of
7227 'find_theorems'; INCOMPATIBILITY.
7229 * Communication with Proof General is now 8bit clean, which means that
7230 Unicode text in UTF-8 encoding may be used within theory texts (both
7231 formal and informal parts). Cf. option -U of the Isabelle Proof
7232 General interface. Here are some simple examples (cf. src/HOL/ex):
7234 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7235 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7237 * Improved efficiency of the Simplifier and, to a lesser degree, the
7238 Classical Reasoner. Typical big applications run around 2 times
7242 *** Document preparation ***
7244 * Commands 'display_drafts' and 'print_drafts' perform simple output
7245 of raw sources. Only those symbols that do not require additional
7246 LaTeX packages (depending on comments in isabellesym.sty) are
7247 displayed properly, everything else is left verbatim. isatool display
7248 and isatool print are used as front ends (these are subject to the
7249 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7251 * Command tags control specific markup of certain regions of text,
7252 notably folding and hiding. Predefined tags include "theory" (for
7253 theory begin and end), "proof" for proof commands, and "ML" for
7254 commands involving ML code; the additional tags "visible" and
7255 "invisible" are unused by default. Users may give explicit tag
7256 specifications in the text, e.g. ''by %invisible (auto)''. The
7257 interpretation of tags is determined by the LaTeX job during document
7258 preparation: see option -V of isatool usedir, or options -n and -t of
7259 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7262 Several document versions may be produced at the same time via isatool
7263 usedir (the generated index.html will link all of them). Typical
7264 specifications include ''-V document=theory,proof,ML'' to present
7265 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7266 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7267 these parts without any formal replacement text. The Isabelle site
7268 default settings produce ''document'' and ''outline'' versions as
7271 * Several new antiquotations:
7273 @{term_type term} prints a term with its type annotated;
7275 @{typeof term} prints the type of a term;
7277 @{const const} is the same as @{term const}, but checks that the
7278 argument is a known logical constant;
7280 @{term_style style term} and @{thm_style style thm} print a term or
7281 theorem applying a "style" to it
7285 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7286 definitions, equations, inequations etc., 'concl' printing only the
7287 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7288 to print the specified premise. TermStyle.add_style provides an ML
7289 interface for introducing further styles. See also the "LaTeX Sugar"
7290 document practical applications. The ML antiquotation prints
7291 type-checked ML expressions verbatim.
7293 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7294 and 'text' support optional locale specification '(in loc)', which
7295 specifies the default context for interpreting antiquotations. For
7296 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7298 * Option 'locale=NAME' of antiquotations specifies an alternative
7299 context interpreting the subsequent argument. For example: @{thm
7300 [locale=lattice] inf_assoc}.
7302 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7305 * Proper output of antiquotations for theory commands involving a
7306 proof context (such as 'locale' or 'theorem (in loc) ...').
7308 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7309 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7311 * isatool usedir: new option -C (default true) controls whether option
7312 -D should include a copy of the original document directory; -C false
7313 prevents unwanted effects such as copying of administrative CVS data.
7318 * Considerably improved version of 'constdefs' command. Now performs
7319 automatic type-inference of declared constants; additional support for
7320 local structure declarations (cf. locales and HOL records), see also
7321 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7322 sequential dependencies of definitions within a single 'constdefs'
7323 section; moreover, the declared name needs to be an identifier. If
7324 all fails, consider to fall back on 'consts' and 'defs' separately.
7326 * Improved indexed syntax and implicit structures. First of all,
7327 indexed syntax provides a notational device for subscripted
7328 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7329 expressions. Secondly, in a local context with structure
7330 declarations, number indexes \<^sub>n or the empty index (default
7331 number 1) refer to a certain fixed variable implicitly; option
7332 show_structs controls printing of implicit structures. Typical
7333 applications of these concepts involve record types and locales.
7335 * New command 'no_syntax' removes grammar declarations (and
7336 translations) resulting from the given syntax specification, which is
7337 interpreted in the same manner as for the 'syntax' command.
7339 * 'Advanced' translation functions (parse_translation etc.) may depend
7340 on the signature of the theory context being presently used for
7341 parsing/printing, see also isar-ref manual.
7343 * Improved 'oracle' command provides a type-safe interface to turn an
7344 ML expression of type theory -> T -> term into a primitive rule of
7345 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7346 is already included here); see also FOL/ex/IffExample.thy;
7349 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7350 before); "cI" is no longer bound, use "c.intro" instead.
7351 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7352 axclasses vs. locales.
7354 * Improved internal renaming of symbolic identifiers -- attach primes
7355 instead of base 26 numbers.
7357 * New flag show_question_marks controls printing of leading question
7358 marks in schematic variable names.
7360 * In schematic variable names, *any* symbol following \<^isub> or
7361 \<^isup> is now treated as part of the base name. For example, the
7362 following works without printing of awkward ".0" indexes:
7364 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7367 * Inner syntax includes (*(*nested*) comments*).
7369 * Pretty printer now supports unbreakable blocks, specified in mixfix
7370 annotations as "(00...)".
7372 * Clear separation of logical types and nonterminals, where the latter
7373 may only occur in 'syntax' specifications or type abbreviations.
7374 Before that distinction was only partially implemented via type class
7375 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7376 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7377 exotic syntax specifications may require further adaption
7378 (e.g. Cube/Cube.thy).
7380 * Removed obsolete type class "logic", use the top sort {} instead.
7381 Note that non-logical types should be declared as 'nonterminals'
7382 rather than 'types'. INCOMPATIBILITY for new object-logic
7385 * Attributes 'induct' and 'cases': type or set names may now be
7386 locally fixed variables as well.
7388 * Simplifier: can now control the depth to which conditional rewriting
7389 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7392 * Simplifier: simplification procedures may now take the current
7393 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7394 interface), which is very useful for calling the Simplifier
7395 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7396 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7397 low-level mk_simproc no longer applies Logic.varify internally, to
7398 allow for use in a context of fixed variables.
7400 * thin_tac now works even if the assumption being deleted contains !!
7401 or ==>. More generally, erule now works even if the major premise of
7402 the elimination rule contains !! or ==>.
7404 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7406 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7407 from Pure, which contains all common declarations already. Both
7408 theories are defined via plain Isabelle/Isar .thy files.
7409 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7410 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7411 use isatool fixcpure to adapt your theory and ML sources.
7413 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7414 selections of theorems in named facts via index ranges.
7416 * 'print_theorems': in theory mode, really print the difference
7417 wrt. the last state (works for interactive theory development only),
7418 in proof mode print all local facts (cf. 'print_facts');
7420 * 'hide': option '(open)' hides only base names.
7422 * More efficient treatment of intermediate checkpoints in interactive
7425 * Code generator is now invoked via code_module (incremental code
7426 generation) and code_library (modular code generation, ML structures
7427 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7428 must be quoted when used as identifiers.
7430 * New 'value' command for reading, evaluating and printing terms using
7431 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7432 quoted when used as identifier.
7437 * New commands for the interpretation of locale expressions in
7438 theories (1), locales (2) and proof contexts (3). These generate
7439 proof obligations from the expression specification. After the
7440 obligations have been discharged, theorems of the expression are added
7441 to the theory, target locale or proof context. The synopsis of the
7442 commands is a follows:
7444 (1) interpretation expr inst
7445 (2) interpretation target < expr
7446 (3) interpret expr inst
7448 Interpretation in theories and proof contexts require a parameter
7449 instantiation of terms from the current context. This is applied to
7450 specifications and theorems of the interpreted expression.
7451 Interpretation in locales only permits parameter renaming through the
7452 locale expression. Interpretation is smart in that interpretations
7453 that are active already do not occur in proof obligations, neither are
7454 instantiated theorems stored in duplicate. Use 'print_interps' to
7455 inspect active interpretations of a particular locale. For details,
7456 see the Isar Reference manual. Examples can be found in
7457 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7459 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7460 'interpret' instead.
7462 * New context element 'constrains' for adding type constraints to
7465 * Context expressions: renaming of parameters with syntax
7468 * Locale declaration: 'includes' disallowed.
7470 * Proper static binding of attribute syntax -- i.e. types / terms /
7471 facts mentioned as arguments are always those of the locale definition
7472 context, independently of the context of later invocations. Moreover,
7473 locale operations (renaming and type / term instantiation) are applied
7474 to attribute arguments as expected.
7476 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7477 actual attributes; rare situations may require Attrib.attribute to
7478 embed those attributes into Attrib.src that lack concrete syntax.
7479 Attribute implementations need to cooperate properly with the static
7480 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7481 Attrib.XXX_thm etc. already do the right thing without further
7482 intervention. Only unusual applications -- such as "where" or "of"
7483 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7484 on the context and the facts involved -- may have to assign parsed
7485 values to argument tokens explicitly.
7487 * Changed parameter management in theorem generation for long goal
7488 statements with 'includes'. INCOMPATIBILITY: produces a different
7489 theorem statement in rare situations.
7491 * Locale inspection command 'print_locale' omits notes elements. Use
7492 'print_locale!' to have them included in the output.
7497 * Provers/hypsubst.ML: improved version of the subst method, for
7498 single-step rewriting: it now works in bound variable contexts. New is
7499 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7500 rewrite a different subterm than the original subst method, which is
7501 still available as 'simplesubst'.
7503 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7506 * Provers/trancl.ML: new transitivity reasoner for transitive and
7507 reflexive-transitive closure of relations.
7509 * Provers/blast.ML: new reference depth_limit to make blast's depth
7510 limit (previously hard-coded with a value of 20) user-definable.
7512 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7513 is peformed already. Object-logics merely need to finish their
7514 initial simpset configuration as before. INCOMPATIBILITY.
7519 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7522 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7524 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7525 and x-symbol; use option '-m epsilon' to get it actually printed.
7526 Moreover, the mathematically important symbolic identifier \<epsilon>
7527 becomes available as variable, constant etc. INCOMPATIBILITY,
7529 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7530 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7531 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7532 support corresponding Isar calculations.
7534 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7537 * theory SetInterval: changed the syntax for open intervals:
7546 The old syntax is still supported but will disappear in the next
7547 release. For conversion use the following Emacs search and replace
7548 patterns (these are not perfect but work quite well):
7550 {)\([^\.]*\)\.\. -> {\1<\.\.}
7551 \.\.\([^(}]*\)(} -> \.\.<\1}
7553 * Theory Commutative_Ring (in Library): method comm_ring for proving
7554 equalities in commutative rings; method 'algebra' provides a generic
7557 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7558 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7559 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7562 Some new syntax forms are available:
7564 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7565 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7566 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7567 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7569 The latter form "\<Sum>x < k. e" used to be based on a separate
7570 function "Summation", which has been discontinued.
7572 * theory Finite_Set: in structured induction proofs, the insert case
7573 is now 'case (insert x F)' instead of the old counterintuitive 'case
7576 * The 'refute' command has been extended to support a much larger
7577 fragment of HOL, including axiomatic type classes, constdefs and
7578 typedefs, inductive datatypes and recursion.
7580 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7581 Requires zChaff with proof generation to be installed. See
7582 HOL/ex/SAT_Examples.thy for examples.
7584 * Datatype induction via method 'induct' now preserves the name of the
7585 induction variable. For example, when proving P(xs::'a list) by
7586 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7587 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7588 in unstructured proof scripts.
7590 * Reworked implementation of records. Improved scalability for
7591 records with many fields, avoiding performance problems for type
7592 inference. Records are no longer composed of nested field types, but
7593 of nested extension types. Therefore the record type only grows linear
7594 in the number of extensions and not in the number of fields. The
7595 top-level (users) view on records is preserved. Potential
7596 INCOMPATIBILITY only in strange cases, where the theory depends on the
7597 old record representation. The type generated for a record is called
7598 <record_name>_ext_type.
7600 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7601 proofs triggered by a record definition or a simproc (if
7602 quick_and_dirty is enabled). Definitions of large records can take
7605 New simproc record_upd_simproc for simplification of multiple record
7606 updates enabled by default. Moreover, trivial updates are also
7607 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7608 occasionally, since simplification is more powerful by default.
7610 * typedef: proper support for polymorphic sets, which contain extra
7611 type-variables in the term.
7613 * Simplifier: automatically reasons about transitivity chains
7614 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7615 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7616 old proofs break occasionally as simplification may now solve more
7617 goals than previously.
7619 * Simplifier: converts x <= y into x = y if assumption y <= x is
7620 present. Works for all partial orders (class "order"), in particular
7621 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7624 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7625 bound variable or a constant then the let is unfolded. Otherwise
7626 first a is simplified to b, and then f b is simplified to g. If
7627 possible we abstract b from g arriving at "let x = b in h x",
7628 otherwise we unfold the let and arrive at g. The simproc can be
7629 enabled/disabled by the reference use_let_simproc. Potential
7630 INCOMPATIBILITY since simplification is more powerful by default.
7632 * Classical reasoning: the meson method now accepts theorems as arguments.
7634 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7635 jobs to provide advice on the provability of subgoals.
7637 * Theory OrderedGroup and Ring_and_Field: various additions and
7638 improvements to faciliate calculations involving equalities and
7641 The following theorems have been eliminated or modified
7644 abs_eq now named abs_of_nonneg
7645 abs_of_ge_0 now named abs_of_nonneg
7646 abs_minus_eq now named abs_of_nonpos
7647 imp_abs_id now named abs_of_nonneg
7648 imp_abs_neg_id now named abs_of_nonpos
7649 mult_pos now named mult_pos_pos
7650 mult_pos_le now named mult_nonneg_nonneg
7651 mult_pos_neg_le now named mult_nonneg_nonpos
7652 mult_pos_neg2_le now named mult_nonneg_nonpos2
7653 mult_neg now named mult_neg_neg
7654 mult_neg_le now named mult_nonpos_nonpos
7656 * The following lemmas in Ring_and_Field have been added to the simplifier:
7659 not_square_less_zero
7661 The following lemmas have been deleted from Real/RealPow:
7671 * Theory Parity: added rules for simplifying exponents.
7675 The following theorems have been eliminated or modified
7678 list_all_Nil now named list_all.simps(1)
7679 list_all_Cons now named list_all.simps(2)
7680 list_all_conv now named list_all_iff
7681 set_mem_eq now named mem_iff
7683 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7684 asymptotic "big O" calculations. See the notes in BigO.thy.
7689 * Theory RealDef: better support for embedding natural numbers and
7690 integers in the reals.
7692 The following theorems have been eliminated or modified
7695 exp_ge_add_one_self now requires no hypotheses
7696 real_of_int_add reversed direction of equality (use [symmetric])
7697 real_of_int_minus reversed direction of equality (use [symmetric])
7698 real_of_int_diff reversed direction of equality (use [symmetric])
7699 real_of_int_mult reversed direction of equality (use [symmetric])
7701 * Theory RComplete: expanded support for floor and ceiling functions.
7703 * Theory Ln is new, with properties of the natural logarithm
7705 * Hyperreal: There is a new type constructor "star" for making
7706 nonstandard types. The old type names are now type synonyms:
7710 hcomplex = complex star
7712 * Hyperreal: Many groups of similarly-defined constants have been
7713 replaced by polymorphic versions (INCOMPATIBILITY):
7715 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7717 starset <-- starsetNat, starsetC
7718 *s* <-- *sNat*, *sc*
7719 starset_n <-- starsetNat_n, starsetC_n
7720 *sn* <-- *sNatn*, *scn*
7721 InternalSets <-- InternalNatSets, InternalCSets
7723 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7724 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7725 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7726 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7727 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7729 * Hyperreal: Many type-specific theorems have been removed in favor of
7730 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7732 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7733 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7734 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7735 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7736 right_minus <-- hypreal_add_minus
7737 left_minus <-- {hypreal,hcomplex}_add_minus_left
7738 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7739 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7740 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7741 mult_1_right <-- hcomplex_mult_one_right
7742 mult_zero_left <-- hcomplex_mult_zero_left
7743 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7744 right_distrib <-- hypnat_add_mult_distrib2
7745 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7746 right_inverse <-- hypreal_mult_inverse
7747 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7748 order_refl <-- {hypreal,hypnat}_le_refl
7749 order_trans <-- {hypreal,hypnat}_le_trans
7750 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7751 order_less_le <-- {hypreal,hypnat}_less_le
7752 linorder_linear <-- {hypreal,hypnat}_le_linear
7753 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7754 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7755 add_nonneg_nonneg <-- hypreal_le_add_order
7757 * Hyperreal: Separate theorems having to do with type-specific
7758 versions of constants have been merged into theorems that apply to the
7759 new polymorphic constants (INCOMPATIBILITY):
7761 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7762 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7763 STAR_Un <-- {STAR,NatStar,STARC}_Un
7764 STAR_Int <-- {STAR,NatStar,STARC}_Int
7765 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7766 STAR_subset <-- {STAR,NatStar,STARC}_subset
7767 STAR_mem <-- {STAR,NatStar,STARC}_mem
7768 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7769 STAR_diff <-- {STAR,STARC}_diff
7770 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7771 STARC_hcomplex_of_complex}_image_subset
7772 starset_n_Un <-- starset{Nat,C}_n_Un
7773 starset_n_Int <-- starset{Nat,C}_n_Int
7774 starset_n_Compl <-- starset{Nat,C}_n_Compl
7775 starset_n_diff <-- starset{Nat,C}_n_diff
7776 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7777 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7778 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7779 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7780 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7781 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7782 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7783 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7784 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7785 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7786 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7787 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7788 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7789 starfun_diff <-- starfun{C,RC,CR}_diff
7790 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7791 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7792 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7793 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7794 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7795 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7796 starfun_Id <-- starfunC_Id
7797 starfun_approx <-- starfun{Nat,CR}_approx
7798 starfun_capprox <-- starfun{C,RC}_capprox
7799 starfun_abs <-- starfunNat_rabs
7800 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7801 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7802 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7803 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7804 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7805 starfun_add_approx <-- starfunCR_add_approx
7806 starfun_inverse_inverse <-- starfunC_inverse_inverse
7807 starfun_divide <-- starfun{C,CR,RC}_divide
7808 starfun_n <-- starfun{Nat,C}_n
7809 starfun_n_mult <-- starfun{Nat,C}_n_mult
7810 starfun_n_add <-- starfun{Nat,C}_n_add
7811 starfun_n_add_minus <-- starfunNat_n_add_minus
7812 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7813 starfun_n_minus <-- starfun{Nat,C}_n_minus
7814 starfun_n_eq <-- starfun{Nat,C}_n_eq
7816 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7817 star_n_minus <-- {hypreal,hcomplex}_minus
7818 star_n_diff <-- {hypreal,hcomplex}_diff
7819 star_n_mult <-- {hypreal,hcomplex}_mult
7820 star_n_inverse <-- {hypreal,hcomplex}_inverse
7821 star_n_le <-- {hypreal,hypnat}_le
7822 star_n_less <-- {hypreal,hypnat}_less
7823 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7824 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7825 star_n_abs <-- hypreal_hrabs
7826 star_n_divide <-- hcomplex_divide
7828 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7829 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7830 star_of_diff <-- hypreal_of_real_diff
7831 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7832 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7833 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7834 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7835 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7836 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7837 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7838 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7839 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7840 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7841 star_of_number_of <-- {hypreal,hcomplex}_number_of
7842 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7843 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7844 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7845 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7846 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7847 star_of_power <-- hypreal_of_real_power
7848 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7850 * Hyperreal: new method "transfer" that implements the transfer
7851 principle of nonstandard analysis. With a subgoal that mentions
7852 nonstandard types like "'a star", the command "apply transfer"
7853 replaces it with an equivalent one that mentions only standard types.
7854 To be successful, all free variables must have standard types; non-
7855 standard variables must have explicit universal quantifiers.
7857 * Hyperreal: A theory of Taylor series.
7862 * Discontinued special version of 'constdefs' (which used to support
7863 continuous functions) in favor of the general Pure one with full
7866 * New simplification procedure for solving continuity conditions; it
7867 is much faster on terms with many nested lambda abstractions (cubic
7868 instead of exponential time).
7870 * New syntax for domain package: selector names are now optional.
7871 Parentheses should be omitted unless argument is lazy, for example:
7873 domain 'a stream = cons "'a" (lazy "'a stream")
7875 * New command 'fixrec' for defining recursive functions with pattern
7876 matching; defining multiple functions with mutual recursion is also
7877 supported. Patterns may include the constants cpair, spair, up, sinl,
7878 sinr, or any data constructor defined by the domain package. The given
7879 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7880 syntax and examples.
7882 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7883 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7884 but the proof obligation additionally includes an admissibility
7885 requirement. The packages generate instances of class cpo or pcpo,
7886 with continuity and strictness theorems for Rep and Abs.
7888 * HOLCF: Many theorems have been renamed according to a more standard naming
7889 scheme (INCOMPATIBILITY):
7891 foo_inject: "foo$x = foo$y ==> x = y"
7892 foo_eq: "(foo$x = foo$y) = (x = y)"
7893 foo_less: "(foo$x << foo$y) = (x << y)"
7894 foo_strict: "foo$UU = UU"
7895 foo_defined: "... ==> foo$x ~= UU"
7896 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7901 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7902 including the First Isomorphism Theorem (on quotienting by the kernel
7905 * ZF/Simplifier: install second copy of type solver that actually
7906 makes use of TC rules declared to Isar proof contexts (or locales);
7907 the old version is still required for ML proof scripts.
7912 * Converted to Isar theory format; use locales instead of axiomatic
7918 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7921 * Pure/library.ML no longer defines its own option datatype, but uses
7922 that of the SML basis, which has constructors NONE and SOME instead of
7923 None and Some, as well as exception Option.Option instead of OPTION.
7924 The functions the, if_none, is_some, is_none have been adapted
7925 accordingly, while Option.map replaces apsome.
7927 * Pure/library.ML: the exception LIST has been given up in favour of
7928 the standard exceptions Empty and Subscript, as well as
7929 Library.UnequalLengths. Function like Library.hd and Library.tl are
7930 superceded by the standard hd and tl functions etc.
7932 A number of basic list functions are no longer exported to the ML
7933 toplevel, as they are variants of predefined functions. The following
7934 suggests how one can translate existing code:
7936 rev_append xs ys = List.revAppend (xs, ys)
7937 nth_elem (i, xs) = List.nth (xs, i)
7938 last_elem xs = List.last xs
7939 flat xss = List.concat xss
7940 seq fs = List.app fs
7941 partition P xs = List.partition P xs
7942 mapfilter f xs = List.mapPartial f xs
7944 * Pure/library.ML: several combinators for linear functional
7945 transformations, notably reverse application and composition:
7948 (x, y) |-> f f #-> g
7950 * Pure/library.ML: introduced/changed precedence of infix operators:
7952 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7954 infix 3 o oo ooo oooo;
7955 infix 4 ~~ upto downto;
7957 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7960 * Pure/library.ML: natural list combinators fold, fold_rev, and
7961 fold_map support linear functional transformations and nesting. For
7964 fold f [x1, ..., xN] y =
7965 y |> f x1 |> ... |> f xN
7967 (fold o fold) f [xs1, ..., xsN] y =
7968 y |> fold f xs1 |> ... |> fold f xsN
7970 fold f [x1, ..., xN] =
7973 (fold o fold) f [xs1, ..., xsN] =
7974 fold f xs1 #> ... #> fold f xsN
7976 * Pure/library.ML: the following selectors on type 'a option are
7979 the: 'a option -> 'a (*partial*)
7980 these: 'a option -> 'a where 'a = 'b list
7981 the_default: 'a -> 'a option -> 'a
7982 the_list: 'a option -> 'a list
7984 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7985 basic operations for association lists, following natural argument
7986 order; moreover the explicit equality predicate passed here avoids
7987 potentially expensive polymorphic runtime equality checks.
7988 The old functions may be expressed as follows:
7990 assoc = uncurry (AList.lookup (op =))
7991 assocs = these oo AList.lookup (op =)
7992 overwrite = uncurry (AList.update (op =)) o swap
7994 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7996 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7997 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7999 replacing make_keylist and keyfilter (occassionally used)
8002 make_keylist = AList.make
8003 keyfilter = AList.find (op =)
8005 * eq_fst and eq_snd now take explicit equality parameter, thus
8006 avoiding eqtypes. Naive rewrites:
8008 eq_fst = eq_fst (op =)
8009 eq_snd = eq_snd (op =)
8011 * Removed deprecated apl and apr (rarely used).
8014 apl (n, op) =>>= curry op n
8015 apr (op, m) =>>= fn n => op (n, m)
8017 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
8018 provides a reasonably efficient light-weight implementation of sets as
8021 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
8022 few new operations; existing lookup and update are now curried to
8023 follow natural argument order (for use with fold etc.);
8024 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
8026 * Pure/General: output via the Isabelle channels of
8027 writeln/warning/error etc. is now passed through Output.output, with a
8028 hook for arbitrary transformations depending on the print_mode
8029 (cf. Output.add_mode -- the first active mode that provides a output
8030 function wins). Already formatted output may be embedded into further
8031 text via Output.raw; the result of Pretty.string_of/str_of and derived
8032 functions (string_of_term/cterm/thm etc.) is already marked raw to
8033 accommodate easy composition of diagnostic messages etc. Programmers
8034 rarely need to care about Output.output or Output.raw at all, with
8035 some notable exceptions: Output.output is required when bypassing the
8036 standard channels (writeln etc.), or in token translations to produce
8037 properly formatted results; Output.raw is required when capturing
8038 already output material that will eventually be presented to the user
8039 a second time. For the default print mode, both Output.output and
8040 Output.raw have no effect.
8042 * Pure/General: Output.time_accumulator NAME creates an operator ('a
8043 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
8044 cumulative results are displayed at the end of a batch session.
8046 * Pure/General: File.sysify_path and File.quote_sysify path have been
8047 replaced by File.platform_path and File.shell_path (with appropriate
8048 hooks). This provides a clean interface for unusual systems where the
8049 internal and external process view of file names are different.
8051 * Pure: more efficient orders for basic syntactic entities: added
8052 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
8053 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
8054 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
8055 orders now -- potential INCOMPATIBILITY for code that depends on a
8056 particular order for Symtab.keys, Symtab.dest, etc. (consider using
8057 Library.sort_strings on result).
8059 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
8060 fold_types traverse types/terms from left to right, observing natural
8061 argument order. Supercedes previous foldl_XXX versions, add_frees,
8062 add_vars etc. have been adapted as well: INCOMPATIBILITY.
8064 * Pure: name spaces have been refined, with significant changes of the
8065 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
8066 to extern(_table). The plain name entry path is superceded by a
8067 general 'naming' context, which also includes the 'policy' to produce
8068 a fully qualified name and external accesses of a fully qualified
8069 name; NameSpace.extend is superceded by context dependent
8070 Sign.declare_name. Several theory and proof context operations modify
8071 the naming context. Especially note Theory.restore_naming and
8072 ProofContext.restore_naming to get back to a sane state; note that
8073 Theory.add_path is no longer sufficient to recover from
8074 Theory.absolute_path in particular.
8076 * Pure: new flags short_names (default false) and unique_names
8077 (default true) for controlling output of qualified names. If
8078 short_names is set, names are printed unqualified. If unique_names is
8079 reset, the name prefix is reduced to the minimum required to achieve
8080 the original result when interning again, even if there is an overlap
8081 with earlier declarations.
8083 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8084 now 'extend', and 'merge' gets an additional Pretty.pp argument
8085 (useful for printing error messages). INCOMPATIBILITY.
8087 * Pure: major reorganization of the theory context. Type Sign.sg and
8088 Theory.theory are now identified, referring to the universal
8089 Context.theory (see Pure/context.ML). Actual signature and theory
8090 content is managed as theory data. The old code and interfaces were
8091 spread over many files and structures; the new arrangement introduces
8092 considerable INCOMPATIBILITY to gain more clarity:
8094 Context -- theory management operations (name, identity, inclusion,
8095 parents, ancestors, merge, etc.), plus generic theory data;
8097 Sign -- logical signature and syntax operations (declaring consts,
8098 types, etc.), plus certify/read for common entities;
8100 Theory -- logical theory operations (stating axioms, definitions,
8101 oracles), plus a copy of logical signature operations (consts,
8102 types, etc.); also a few basic management operations (Theory.copy,
8105 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8106 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8107 for convenience -- they merely return the theory.
8109 * Pure: type Type.tsig is superceded by theory in most interfaces.
8111 * Pure: the Isar proof context type is already defined early in Pure
8112 as Context.proof (note that ProofContext.context and Proof.context are
8113 aliases, where the latter is the preferred name). This enables other
8114 Isabelle components to refer to that type even before Isar is present.
8116 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8117 typeK, constK, axiomK, oracleK), but provide explicit operations for
8118 any of these kinds. For example, Sign.intern typeK is now
8119 Sign.intern_type, Theory.hide_space Sign.typeK is now
8120 Theory.hide_types. Also note that former
8121 Theory.hide_classes/types/consts are now
8122 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8123 internalize their arguments! INCOMPATIBILITY.
8125 * Pure: get_thm interface (of PureThy and ProofContext) expects
8126 datatype thmref (with constructors Name and NameSelection) instead of
8127 plain string -- INCOMPATIBILITY;
8129 * Pure: cases produced by proof methods specify options, where NONE
8130 means to remove case bindings -- INCOMPATIBILITY in
8133 * Pure: the following operations retrieve axioms or theorems from a
8134 theory node or theory hierarchy, respectively:
8136 Theory.axioms_of: theory -> (string * term) list
8137 Theory.all_axioms_of: theory -> (string * term) list
8138 PureThy.thms_of: theory -> (string * thm) list
8139 PureThy.all_thms_of: theory -> (string * thm) list
8141 * Pure: print_tac now outputs the goal through the trace channel.
8143 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8144 Reference Toplevel.debug (default false) controls detailed printing
8145 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8146 controls execution profiling -- set to 1 for time and 2 for space
8147 (both increase the runtime).
8149 * Isar session: The initial use of ROOT.ML is now always timed,
8150 i.e. the log will show the actual process times, in contrast to the
8151 elapsed wall-clock time that the outer shell wrapper produces.
8153 * Simplifier: improved handling of bound variables (nameless
8154 representation, avoid allocating new strings). Simprocs that invoke
8155 the Simplifier recursively should use Simplifier.inherit_bounds to
8156 avoid local name clashes. Failure to do so produces warnings
8157 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8158 for further details.
8160 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8161 bindings for all theorems stored within a given theory; this may help
8162 in porting non-Isar theories to Isar ones, while keeping ML proof
8163 scripts for the time being.
8165 * ML operator HTML.with_charset specifies the charset begin used for
8166 generated HTML files. For example:
8168 HTML.with_charset "utf-8" use_thy "Hebrew";
8169 HTML.with_charset "utf-8" use_thy "Chinese";
8174 * Allow symlinks to all proper Isabelle executables (Isabelle,
8175 isabelle, isatool etc.).
8177 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8178 isatool doc, isatool mkdir, display_drafts etc.).
8180 * isatool usedir: option -f allows specification of the ML file to be
8181 used by Isabelle; default is ROOT.ML.
8183 * New isatool version outputs the version identifier of the Isabelle
8184 distribution being used.
8186 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8187 (containing Boolean satisfiability problems) into Isabelle/HOL
8192 New in Isabelle2004 (April 2004)
8193 --------------------------------
8197 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8198 Replaces linorder.ML.
8200 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8201 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8202 (\<a>...\<z>), are now considered normal letters, and can therefore
8203 be used anywhere where an ASCII letter (a...zA...Z) has until
8204 now. COMPATIBILITY: This obviously changes the parsing of some
8205 terms, especially where a symbol has been used as a binder, say
8206 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8207 as an identifier. Fix it by inserting a space around former
8208 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8209 existing theory and ML files.
8211 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8213 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8214 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8215 a normal (but invisible) letter. For multiple letter subscripts repeat
8216 \<^isub> like this: x\<^isub>1\<^isub>2.
8218 * Pure: There are now sub-/superscripts that can span more than one
8219 character. Text between \<^bsub> and \<^esub> is set in subscript in
8220 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8221 superscript. The new control characters are not identifier parts.
8223 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8224 content of "..." to the latex file instead of \isacntrl... . The "..."
8225 may consist of any printable characters excluding the end bracket >.
8227 * Pure: Using new Isar command "finalconsts" (or the ML functions
8228 Theory.add_finals or Theory.add_finals_i) it is now possible to
8229 declare constants "final", which prevents their being given a definition
8230 later. It is useful for constants whose behaviour is fixed axiomatically
8231 rather than definitionally, such as the meta-logic connectives.
8233 * Pure: 'instance' now handles general arities with general sorts
8234 (i.e. intersections of classes),
8236 * Presentation: generated HTML now uses a CSS style sheet to make layout
8237 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8238 It can be changed to alter the colors/layout of generated pages.
8243 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8244 cut_tac, subgoal_tac and thin_tac:
8245 - Now understand static (Isar) contexts. As a consequence, users of Isar
8246 locales are no longer forced to write Isar proof scripts.
8247 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8249 - INCOMPATIBILITY: names of variables to be instantiated may no
8250 longer be enclosed in quotes. Instead, precede variable name with `?'.
8251 This is consistent with the instantiation attribute "where".
8253 * Attributes "where" and "of":
8254 - Now take type variables of instantiated theorem into account when reading
8255 the instantiation string. This fixes a bug that caused instantiated
8256 theorems to have too special types in some circumstances.
8257 - "where" permits explicit instantiations of type variables.
8259 * Calculation commands "moreover" and "also" no longer interfere with
8260 current facts ("this"), admitting arbitrary combinations with "then"
8264 - Goal statements involving the context element "includes" no longer
8265 generate theorems with internal delta predicates (those ending on
8266 "_axioms") in the premise.
8267 Resolve particular premise with <locale>.intro to obtain old form.
8268 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8269 specification and "includes" elements in goal statement.
8270 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8271 [intro?] and [elim?] (respectively) by default.
8272 - Experimental command for instantiation of locales in proof contexts:
8273 instantiate <label>[<attrs>]: <loc>
8274 Instantiates locale <loc> and adds all its theorems to the current context
8275 taking into account their attributes. Label and attrs are optional
8276 modifiers, like in theorem declarations. If present, names of
8277 instantiated theorems are qualified with <label>, and the attributes
8278 <attrs> are applied after any attributes these theorems might have already.
8279 If the locale has assumptions, a chained fact of the form
8280 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8281 are derived. The command does not support old-style locales declared
8282 with "locale (open)".
8283 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8285 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8291 * Proof import: new image HOL4 contains the imported library from
8292 the HOL4 system with about 2500 theorems. It is imported by
8293 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8294 can be used like any other Isabelle image. See
8295 HOL/Import/HOL/README for more information.
8298 - Much improved handling of linear and partial orders.
8299 Reasoners for linear and partial orders are set up for type classes
8300 "linorder" and "order" respectively, and are added to the default simpset
8301 as solvers. This means that the simplifier can build transitivity chains
8302 to solve goals from the assumptions.
8303 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8304 of blast or auto after simplification become unnecessary because the goal
8305 is solved by simplification already.
8307 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8308 all proved in axiomatic type classes for semirings, rings and fields.
8311 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8312 now formalized using the Ring_and_Field theory mentioned above.
8313 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8314 than before, because now they are set up once in a generic manner.
8315 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8316 Look for the general versions in Ring_and_Field (and Power if they concern
8319 * Type "rat" of the rational numbers is now available in HOL-Complex.
8322 - Record types are now by default printed with their type abbreviation
8323 instead of the list of all field types. This can be configured via
8324 the reference "print_record_type_abbr".
8325 - Simproc "record_upd_simproc" for simplification of multiple updates added
8326 (not enabled by default).
8327 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8328 EX x. x = sel r to True (not enabled by default).
8329 - Tactic "record_split_simp_tac" to split and simplify records added.
8331 * 'specification' command added, allowing for definition by
8332 specification. There is also an 'ax_specification' command that
8333 introduces the new constants axiomatically.
8335 * arith(_tac) is now able to generate counterexamples for reals as well.
8337 * HOL-Algebra: new locale "ring" for non-commutative rings.
8339 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8340 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8342 * HOL-Matrix: a first theory for matrices in HOL with an application of
8343 matrix theory to linear programming.
8345 * Unions and Intersections:
8346 The latex output syntax of UN and INT has been changed
8347 from "\Union x \in A. B" to "\Union_{x \in A} B"
8348 i.e. the index formulae has become a subscript.
8349 Similarly for "\Union x. B", and for \Inter instead of \Union.
8351 * Unions and Intersections over Intervals:
8352 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8353 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8354 like in normal math, and corresponding versions for < and for intersection.
8356 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8357 lexicographic dictonary ordering has been added as "lexord".
8359 * ML: the legacy theory structures Int and List have been removed. They had
8360 conflicted with ML Basis Library structures having the same names.
8362 * 'refute' command added to search for (finite) countermodels. Only works
8363 for a fragment of HOL. The installation of an external SAT solver is
8364 highly recommended. See "HOL/Refute.thy" for details.
8366 * 'quickcheck' command: Allows to find counterexamples by evaluating
8367 formulae under an assignment of free variables to random values.
8368 In contrast to 'refute', it can deal with inductive datatypes,
8369 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8375 * Streams now come with concatenation and are part of the HOLCF image
8379 New in Isabelle2003 (May 2003)
8380 ------------------------------
8384 * Provers/simplifier:
8386 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8387 Assumptions are now subject to complete mutual simplification,
8388 not just from left to right. The simplifier now preserves
8389 the order of assumptions.
8391 Potential INCOMPATIBILITY:
8393 -- simp sometimes diverges where the old version did
8394 not, e.g. invoking simp on the goal
8396 [| P (f x); y = x; f x = f y |] ==> Q
8398 now gives rise to the infinite reduction sequence
8400 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8402 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8405 -- Tactics combining classical reasoner and simplification (such as auto)
8406 are also affected by this change, because many of them rely on
8407 simp. They may sometimes diverge as well or yield a different numbers
8408 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8409 in case of problems. Sometimes subsequent calls to the classical
8410 reasoner will fail because a preceeding call to the simplifier too
8411 eagerly simplified the goal, e.g. deleted redundant premises.
8413 - The simplifier trace now shows the names of the applied rewrite rules
8415 - You can limit the number of recursive invocations of the simplifier
8416 during conditional rewriting (where the simplifie tries to solve the
8417 conditions before applying the rewrite rule):
8418 ML "simp_depth_limit := n"
8419 where n is an integer. Thus you can force termination where previously
8420 the simplifier would diverge.
8422 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8424 - No longer aborts on failed congruence proof. Instead, the
8425 congruence is ignored.
8427 * Pure: New generic framework for extracting programs from constructive
8428 proofs. See HOL/Extraction.thy for an example instantiation, as well
8429 as HOL/Extraction for some case studies.
8431 * Pure: The main goal of the proof state is no longer shown by default, only
8432 the subgoals. This behaviour is controlled by a new flag.
8433 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8434 (ML: Proof.show_main_goal).
8436 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8437 rules whose conclusion matches subgoal 1:
8438 PG menu: Isabelle/Isar -> Show me -> matching rules
8439 The rules are ordered by how closely they match the subgoal.
8440 In particular, rules that solve a subgoal outright are displayed first
8441 (or rather last, the way they are printed).
8442 (ML: ProofGeneral.print_intros())
8444 * Pure: New flag trace_unify_fail causes unification to print
8445 diagnostic information (PG: in trace buffer) when it fails. This is
8446 useful for figuring out why single step proofs like rule, erule or
8449 * Pure: Locale specifications now produce predicate definitions
8450 according to the body of text (covering assumptions modulo local
8451 definitions); predicate "loc_axioms" covers newly introduced text,
8452 while "loc" is cumulative wrt. all included locale expressions; the
8453 latter view is presented only on export into the global theory
8454 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8455 on the old view without predicates;
8457 * Pure: predefined locales "var" and "struct" are useful for sharing
8458 parameters (as in CASL, for example); just specify something like
8459 ``var x + var y + struct M'' as import;
8461 * Pure: improved thms_containing: proper indexing of facts instead of
8462 raw theorems; check validity of results wrt. current name space;
8463 include local facts of proof configuration (also covers active
8464 locales), cover fixed variables in index; may use "_" in term
8465 specification; an optional limit for the number of printed facts may
8466 be given (the default is 40);
8468 * Pure: disallow duplicate fact bindings within new-style theory files
8471 * Provers: improved induct method: assumptions introduced by case
8472 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8473 the goal statement); "foo" still refers to all facts collectively;
8475 * Provers: the function blast.overloaded has been removed: all constants
8476 are regarded as potentially overloaded, which improves robustness in exchange
8477 for slight decrease in efficiency;
8479 * Provers/linorder: New generic prover for transitivity reasoning over
8480 linear orders. Note: this prover is not efficient!
8482 * Isar: preview of problems to finish 'show' now produce an error
8483 rather than just a warning (in interactive mode);
8490 - Produces a counter example if it cannot prove a goal.
8491 Note that the counter example may be spurious if the goal is not a formula
8492 of quantifier-free linear arithmetic.
8493 In ProofGeneral the counter example appears in the trace buffer.
8495 - Knows about div k and mod k where k is a numeral of type nat or int.
8497 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8498 linear arithmetic fails. This takes account of quantifiers and divisibility.
8499 Presburger arithmetic can also be called explicitly via presburger(_tac).
8501 * simp's arithmetic capabilities have been enhanced a bit: it now
8502 takes ~= in premises into account (by performing a case split);
8504 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8505 are distributed over a sum of terms;
8507 * New tactic "trans_tac" and method "trans" instantiate
8508 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8511 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8512 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8514 * 'typedef' command has new option "open" to suppress the set
8517 * functions Min and Max on finite sets have been introduced (theory
8520 * attribute [symmetric] now works for relations as well; it turns
8521 (x,y) : R^-1 into (y,x) : R, and vice versa;
8523 * induct over a !!-quantified statement (say !!x1..xn):
8524 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8526 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8527 %x. None. Warning: empty_def now refers to the previously hidden definition
8530 * Algebra: formalization of classical algebra. Intended as base for
8531 any algebraic development in Isabelle. Currently covers group theory
8532 (up to Sylow's theorem) and ring theory (Universal Property of
8533 Univariate Polynomials). Contributions welcome;
8535 * GroupTheory: deleted, since its material has been moved to Algebra;
8537 * Complex: new directory of the complex numbers with numeric constants,
8538 nonstandard complex numbers, and some complex analysis, standard and
8539 nonstandard (Jacques Fleuriot);
8541 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8543 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8546 * Real/HahnBanach: updated and adapted to locales;
8548 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8551 * UNITY: added the Meier-Sanders theory of progress sets;
8553 * MicroJava: bytecode verifier and lightweight bytecode verifier
8554 as abstract algorithms, instantiated to the JVM;
8556 * Bali: Java source language formalization. Type system, operational
8557 semantics, axiomatic semantics. Supported language features:
8558 classes, interfaces, objects,virtual methods, static methods,
8559 static/instance fields, arrays, access modifiers, definite
8560 assignment, exceptions.
8565 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8568 * Main ZF: virtually all theories converted to new-style format;
8573 * Pure: Tactic.prove provides sane interface for internal proofs;
8574 omits the infamous "standard" operation, so this is more appropriate
8575 than prove_goalw_cterm in many situations (e.g. in simprocs);
8577 * Pure: improved error reporting of simprocs;
8579 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8583 *** Document preparation ***
8585 * uses \par instead of \\ for line breaks in theory text. This may
8586 shift some page breaks in large documents. To get the old behaviour
8587 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8589 * minimized dependencies of isabelle.sty and isabellesym.sty on
8592 * \<euro> now needs package babel/greek instead of marvosym (which
8595 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8600 New in Isabelle2002 (March 2002)
8601 --------------------------------
8603 *** Document preparation ***
8605 * greatly simplified document preparation setup, including more
8606 graceful interpretation of isatool usedir -i/-d/-D options, and more
8607 instructive isatool mkdir; users should basically be able to get
8608 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8609 users may run a separate document processing stage manually like this:
8610 "isatool usedir -D output HOL Test && isatool document Test/output";
8612 * theory dependency graph may now be incorporated into documents;
8613 isatool usedir -g true will produce session_graph.eps/.pdf for use
8614 with \includegraphics of LaTeX;
8616 * proper spacing of consecutive markup elements, especially text
8617 blocks after section headings;
8619 * support bold style (for single symbols only), input syntax is like
8620 this: "\<^bold>\<alpha>" or "\<^bold>A";
8622 * \<bullet> is now output as bold \cdot by default, which looks much
8623 better in printed text;
8625 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8626 note that these symbols are currently unavailable in Proof General /
8627 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8629 * isatool latex no longer depends on changed TEXINPUTS, instead
8630 isatool document copies the Isabelle style files to the target
8636 * Pure/Provers: improved proof by cases and induction;
8637 - 'case' command admits impromptu naming of parameters (such as
8639 - 'induct' method divinates rule instantiation from the inductive
8640 claim; no longer requires excessive ?P bindings for proper
8641 instantiation of cases;
8642 - 'induct' method properly enumerates all possibilities of set/type
8643 rules; as a consequence facts may be also passed through *type*
8644 rules without further ado;
8645 - 'induct' method now derives symbolic cases from the *rulified*
8646 rule (before it used to rulify cases stemming from the internal
8647 atomized version); this means that the context of a non-atomic
8648 statement becomes is included in the hypothesis, avoiding the
8649 slightly cumbersome show "PROP ?case" form;
8650 - 'induct' may now use elim-style induction rules without chaining
8651 facts, using ``missing'' premises from the goal state; this allows
8652 rules stemming from inductive sets to be applied in unstructured
8653 scripts, while still benefitting from proper handling of non-atomic
8654 statements; NB: major inductive premises need to be put first, all
8655 the rest of the goal is passed through the induction;
8656 - 'induct' proper support for mutual induction involving non-atomic
8657 rule statements (uses the new concept of simultaneous goals, see
8659 - append all possible rule selections, but only use the first
8660 success (no backtracking);
8661 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8662 - undeclared rule case names default to numbers 1, 2, 3, ...;
8663 - added 'print_induct_rules' (covered by help item in recent Proof
8665 - moved induct/cases attributes to Pure, methods to Provers;
8666 - generic method setup instantiated for FOL and HOL;
8668 * Pure: support multiple simultaneous goal statements, for example
8669 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8670 meta-level mechanism, this acts as if several individual goals had
8671 been stated separately; in particular common proof methods need to be
8672 repeated in order to cover all claims; note that a single elimination
8673 step is *not* sufficient to establish the two conjunctions, so this
8676 assume "A & B" then have A and B .. (*".." fails*)
8678 better use "obtain" in situations as above; alternative refer to
8679 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8681 * Pure: proper integration with ``locales''; unlike the original
8682 version by Florian Kammller, Isar locales package high-level proof
8683 contexts rather than raw logical ones (e.g. we admit to include
8684 attributes everywhere); operations on locales include merge and
8685 rename; support for implicit arguments (``structures''); simultaneous
8686 type-inference over imports and text; see also HOL/ex/Locales.thy for
8689 * Pure: the following commands have been ``localized'', supporting a
8690 target locale specification "(in name)": 'lemma', 'theorem',
8691 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8692 stored both within the locale and at the theory level (exported and
8693 qualified by the locale name);
8695 * Pure: theory goals may now be specified in ``long'' form, with
8696 ad-hoc contexts consisting of arbitrary locale elements. for example
8697 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8698 definitions may be given, too); the result is a meta-level rule with
8699 the context elements being discharged in the obvious way;
8701 * Pure: new proof command 'using' allows to augment currently used
8702 facts after a goal statement ('using' is syntactically analogous to
8703 'apply', but acts on the goal's facts only); this allows chained facts
8704 to be separated into parts given before and after a claim, as in
8705 ``from a and b have C using d and e <proof>'';
8707 * Pure: renamed "antecedent" case to "rule_context";
8709 * Pure: new 'judgment' command records explicit information about the
8710 object-logic embedding (used by several tools internally); no longer
8711 use hard-wired "Trueprop";
8713 * Pure: added 'corollary' command;
8715 * Pure: fixed 'token_translation' command;
8717 * Pure: removed obsolete 'exported' attribute;
8719 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8720 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8721 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8723 * Pure: method 'atomize' presents local goal premises as object-level
8724 statements (atomic meta-level propositions); setup controlled via
8725 rewrite rules declarations of 'atomize' attribute; example
8726 application: 'induct' method with proper rule statements in improper
8729 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8730 now consider the syntactic context of assumptions, giving a better
8731 chance to get type-inference of the arguments right (this is
8732 especially important for locales);
8734 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8737 * Pure/obtain: the formal conclusion "thesis", being marked as
8738 ``internal'', may no longer be reference directly in the text;
8739 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8742 * Pure: generic 'sym' attribute which declares a rule both as pure
8743 'elim?' and for the 'symmetric' operation;
8745 * Pure: marginal comments ``--'' may now occur just anywhere in the
8746 text; the fixed correlation with particular command syntax has been
8749 * Pure: new method 'rules' is particularly well-suited for proof
8750 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8751 but often produces more compact proof terms with less detours;
8753 * Pure/Provers/classical: simplified integration with pure rule
8754 attributes and methods; the classical "intro?/elim?/dest?"
8755 declarations coincide with the pure ones; the "rule" method no longer
8756 includes classically swapped intros; "intro" and "elim" methods no
8757 longer pick rules from the context; also got rid of ML declarations
8758 AddXIs/AddXEs/AddXDs; all of this has some potential for
8761 * Provers/classical: attribute 'swapped' produces classical inversions
8762 of introduction rules;
8764 * Provers/simplifier: 'simplified' attribute may refer to explicit
8765 rules instead of full simplifier context; 'iff' attribute handles
8768 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8770 * HOL: 'recdef' now fails on unfinished automated proofs, use
8771 "(permissive)" option to recover old behavior;
8773 * HOL: 'inductive' no longer features separate (collective) attributes
8774 for 'intros' (was found too confusing);
8776 * HOL: properly declared induction rules less_induct and
8782 * HOL: moved over to sane numeral syntax; the new policy is as
8785 - 0 and 1 are polymorphic constants, which are defined on any
8786 numeric type (nat, int, real etc.);
8788 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8789 binary representation internally;
8791 - type nat has special constructor Suc, and generally prefers Suc 0
8792 over 1::nat and Suc (Suc 0) over 2::nat;
8794 This change may cause significant problems of INCOMPATIBILITY; here
8795 are some hints on converting existing sources:
8797 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8798 entities, so expressions involving "-" (unary or binary minus) need
8799 to be spaced properly;
8801 - existing occurrences of "1" may need to be constraint "1::nat" or
8802 even replaced by Suc 0; similar for old "2";
8804 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8806 - remove all special provisions on numerals in proofs;
8808 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8809 representation (depends on bin_arith_simps in the default context);
8811 * HOL: symbolic syntax for x^2 (numeral 2);
8813 * HOL: the class of all HOL types is now called "type" rather than
8814 "term"; INCOMPATIBILITY, need to adapt references to this type class
8815 in axclass/classes, instance/arities, and (usually rare) occurrences
8816 in typings (of consts etc.); internally the class is called
8817 "HOL.type", ML programs should refer to HOLogic.typeS;
8819 * HOL/record package improvements:
8820 - new derived operations "fields" to build a partial record section,
8821 "extend" to promote a fixed record to a record scheme, and
8822 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8823 declared as simp by default;
8824 - shared operations ("more", "fields", etc.) now need to be always
8825 qualified) --- potential INCOMPATIBILITY;
8826 - removed "make_scheme" operations (use "make" with "extend") --
8828 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8829 - provides cases/induct rules for use with corresponding Isar
8830 methods (for concrete records, record schemes, concrete more
8831 parts, and schematic more parts -- in that order);
8832 - internal definitions directly based on a light-weight abstract
8833 theory of product types over typedef rather than datatype;
8835 * HOL: generic code generator for generating executable ML code from
8836 specifications; specific support for HOL constructs such as inductive
8837 datatypes and sets, as well as recursive functions; can be invoked
8838 via 'generate_code' theory section;
8840 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8842 * HOL: consolidated and renamed several theories. In particular:
8843 Ord.thy has been absorbed into HOL.thy
8844 String.thy has been absorbed into List.thy
8846 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8847 (beware of argument permutation!);
8849 * HOL: linorder_less_split superseded by linorder_cases;
8851 * HOL/List: "nodups" renamed to "distinct";
8853 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8854 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8855 - Ex_def has changed, now need to use some_eq_ex
8857 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8858 in this (rare) case use:
8860 delSWrapper "split_all_tac"
8861 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8863 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8866 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8867 Isabelle's type classes, ^ on functions and relations has too general
8868 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8869 necessary to attach explicit type constraints;
8871 * HOL/Relation: the prefix name of the infix "O" has been changed from
8872 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8873 renamed accordingly (eg "compI" -> "rel_compI").
8875 * HOL: syntax translations now work properly with numerals and records
8878 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8879 of "lam" -- INCOMPATIBILITY;
8881 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8882 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8883 renamed "Product_Type.unit";
8885 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8887 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8888 the "cases" method);
8890 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8893 * HOL/IMP: updated and converted to new-style theory format; several
8894 parts turned into readable document, with proper Isar proof texts and
8895 some explanations (by Gerwin Klein);
8897 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8899 * HOL-Hyperreal is now a logic image;
8904 * Isar: consts/constdefs supports mixfix syntax for continuous
8907 * Isar: domain package adapted to new-style theory format, e.g. see
8910 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8911 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8912 lift.induct_tac, always use UU instead of Undef;
8914 * HOLCF/IMP: updated and converted to new-style theory;
8919 * Isar: proper integration of logic-specific tools and packages,
8920 including theory commands '(co)inductive', '(co)datatype',
8921 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8922 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8924 * theory Main no longer includes AC; for the Axiom of Choice, base
8925 your theory on Main_ZFC;
8927 * the integer library now covers quotients and remainders, with many
8928 laws relating division to addition, multiplication, etc.;
8930 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8931 typeless version of the formalism;
8933 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8936 * ZF/Induct: new directory for examples of inductive definitions,
8937 including theory Multiset for multiset orderings; converted to
8938 new-style theory format;
8940 * ZF: many new theorems about lists, ordinals, etc.;
8945 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8946 variable proof controls level of detail: 0 = no proofs (only oracle
8947 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8948 also ref manual for further ML interfaces;
8950 * Pure/axclass: removed obsolete ML interface
8951 goal_subclass/goal_arity;
8953 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8954 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8955 separate tokens, so expressions involving minus need to be spaced
8958 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8959 rather than "infixl" or "infixr";
8961 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8962 sort constraint specifications in type inference; e.g. "x::_::foo"
8963 ensures that the type of "x" is of sort "foo" (but not necessarily a
8966 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8967 control output of nested => (types); the default behavior is
8970 * Pure/syntax: builtin parse translation for "_constify" turns valued
8971 tokens into AST constants;
8973 * Pure/syntax: prefer later declarations of translations and print
8974 translation functions; potential INCOMPATIBILITY: need to reverse
8975 multiple declarations for same syntax element constant;
8977 * Pure/show_hyps reset by default (in accordance to existing Isar
8980 * Provers/classical: renamed addaltern to addafter, addSaltern to
8983 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8986 * system: tested support for MacOS X; should be able to get Isabelle +
8987 Proof General to work in a plain Terminal after installing Poly/ML
8988 (e.g. from the Isabelle distribution area) and GNU bash alone
8989 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8990 support requires further installations, e.g. from
8991 http://fink.sourceforge.net/);
8993 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8995 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8996 of 40 MB), cf. ML_OPTIONS;
8998 * system: Proof General keywords specification is now part of the
8999 Isabelle distribution (see etc/isar-keywords.el);
9001 * system: support for persistent Proof General sessions (refrain from
9002 outdating all loaded theories on startup); user may create writable
9003 logic images like this: ``isabelle -q HOL Test'';
9005 * system: smart selection of Isabelle process versus Isabelle
9006 interface, accommodates case-insensitive file systems (e.g. HFS+); may
9007 run both "isabelle" and "Isabelle" even if file names are badly
9008 damaged (executable inspects the case of the first letter of its own
9009 name); added separate "isabelle-process" and "isabelle-interface";
9011 * system: refrain from any attempt at filtering input streams; no
9012 longer support ``8bit'' encoding of old isabelle font, instead proper
9013 iso-latin characters may now be used; the related isatools
9014 "symbolinput" and "nonascii" have disappeared as well;
9016 * system: removed old "xterm" interface (the print modes "xterm" and
9017 "xterm_color" are still available for direct use in a suitable
9022 New in Isabelle99-2 (February 2001)
9023 -----------------------------------
9025 *** Overview of INCOMPATIBILITIES ***
9027 * HOL: please note that theories in the Library and elsewhere often use the
9028 new-style (Isar) format; to refer to their theorems in an ML script you must
9029 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
9031 * HOL: inductive package no longer splits induction rule aggressively,
9032 but only as far as specified by the introductions given; the old
9033 format may be recovered via ML function complete_split_rule or attribute
9034 'split_rule (complete)';
9036 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
9037 gfp_Tarski to gfp_unfold;
9039 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
9041 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
9042 relation); infix "^^" has been renamed "``"; infix "``" has been
9043 renamed "`"; "univalent" has been renamed "single_valued";
9045 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
9048 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
9050 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
9052 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
9053 consequence, it is no longer monotonic wrt. the local goal context
9054 (which is now passed through the inductive cases);
9056 * Document preparation: renamed standard symbols \<ll> to \<lless> and
9057 \<gg> to \<ggreater>;
9060 *** Document preparation ***
9062 * \isabellestyle{NAME} selects version of Isabelle output (currently
9063 available: are "it" for near math-mode best-style output, "sl" for
9064 slanted text style, and "tt" for plain type-writer; if no
9065 \isabellestyle command is given, output is according to slanted
9068 * support sub/super scripts (for single symbols only), input syntax is
9069 like this: "A\<^sup>*" or "A\<^sup>\<star>";
9071 * some more standard symbols; see Appendix A of the system manual for
9072 the complete list of symbols defined in isabellesym.sty;
9074 * improved isabelle style files; more abstract symbol implementation
9075 (should now use \isamath{...} and \isatext{...} in custom symbol
9078 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9079 state; Note that presentation of goal states does not conform to
9080 actual human-readable proof documents. Please do not include goal
9081 states into document output unless you really know what you are doing!
9083 * proper indentation of antiquoted output with proportional LaTeX
9086 * no_document ML operator temporarily disables LaTeX document
9089 * isatool unsymbolize tunes sources for plain ASCII communication;
9094 * Pure: Isar now suffers initial goal statements to contain unbound
9095 schematic variables (this does not conform to actual readable proof
9096 documents, due to unpredictable outcome and non-compositional proof
9097 checking); users who know what they are doing may use schematic goals
9098 for Prolog-style synthesis of proven results;
9100 * Pure: assumption method (an implicit finishing) now handles actual
9103 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9104 initial goal, declare "that" only as Pure intro (only for single
9105 steps); the "that" rule assumption may now be involved in implicit
9106 finishing, thus ".." becomes a feasible for trivial obtains;
9108 * Pure: default proof step now includes 'intro_classes'; thus trivial
9109 instance proofs may be performed by "..";
9111 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9114 * Pure: more robust selection of calculational rules;
9116 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9117 rule (as well as the assumption rule);
9119 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9120 lemmas, using the graph browser tool;
9122 * Pure: predict failure of "show" in interactive mode;
9124 * Pure: 'thms_containing' now takes actual terms as arguments;
9126 * HOL: improved method 'induct' --- now handles non-atomic goals
9127 (potential INCOMPATIBILITY); tuned error handling;
9129 * HOL: cases and induct rules now provide explicit hints about the
9130 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9131 any remaining facts are inserted into the goal verbatim;
9133 * HOL: local contexts (aka cases) may now contain term bindings as
9134 well; the 'cases' and 'induct' methods new provide a ?case binding for
9135 the result to be shown in each case;
9137 * HOL: added 'recdef_tc' command;
9139 * isatool convert assists in eliminating legacy ML scripts;
9144 * HOL/Library: a collection of generic theories to be used together
9145 with main HOL; the theory loader path already includes this directory
9146 by default; the following existing theories have been moved here:
9147 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9148 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9150 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9151 modelling and verification task performed in Isabelle/HOL +
9152 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9154 * HOL/Algebra: special summation operator SUM no longer exists, it has
9155 been replaced by setsum; infix 'assoc' now has priority 50 (like
9156 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9157 'domain', this makes the theory consistent with mathematical
9160 * HOL basics: added overloaded operations "inverse" and "divide"
9161 (infix "/"), syntax for generic "abs" operation, generic summation
9164 * HOL/typedef: simplified package, provide more useful rules (see also
9167 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9168 now expressed as a proper nested rule (old-style tactic scripts may
9169 require atomize_strip_tac to cope with non-atomic premises);
9171 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9172 to "split_conv" (old name still available for compatibility);
9174 * HOL: improved concrete syntax for strings (e.g. allows translation
9175 rules with string literals);
9177 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9178 and Fleuriot's mechanization of analysis, including the transcendental
9179 functions for the reals;
9181 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9186 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9187 "lam" is displayed as TWO lambda-symbols
9189 * CTT: theory Main now available, containing everything (that is, Bool
9195 * Pure: the Simplifier has been implemented properly as a derived rule
9196 outside of the actual kernel (at last!); the overall performance
9197 penalty in practical applications is about 50%, while reliability of
9198 the Isabelle inference kernel has been greatly improved;
9200 * print modes "brackets" and "no_brackets" control output of nested =>
9201 (types) and ==> (props); the default behaviour is "brackets";
9203 * Provers: fast_tac (and friends) now handle actual object-logic rules
9204 as assumptions as well;
9206 * system: support Poly/ML 4.0;
9208 * system: isatool install handles KDE version 1 or 2;
9212 New in Isabelle99-1 (October 2000)
9213 ----------------------------------
9215 *** Overview of INCOMPATIBILITIES ***
9217 * HOL: simplification of natural numbers is much changed; to partly
9218 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9219 issue the following ML commands:
9221 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9222 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9224 * HOL: simplification no longer dives into case-expressions; this is
9225 controlled by "t.weak_case_cong" for each datatype t;
9227 * HOL: nat_less_induct renamed to less_induct;
9229 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9230 fixsome to patch .thy and .ML sources automatically;
9232 select_equality -> some_equality
9233 select_eq_Ex -> some_eq_ex
9234 selectI2EX -> someI2_ex
9237 select1_equality -> some1_equality
9238 Eps_sym_eq -> some_sym_eq_trivial
9239 Eps_eq -> some_eq_trivial
9241 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9243 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9246 * HOL: the recursion equations generated by 'recdef' are now called
9247 f.simps instead of f.rules;
9249 * HOL: qed_spec_mp now also handles bounded ALL as well;
9251 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9252 sometimes be needed;
9254 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9256 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9258 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9259 product is now "<*>" instead of "Times"; the lexicographic product is
9260 now "<*lex*>" instead of "**";
9262 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9263 of main HOL, but was unused); better use HOL's datatype package;
9265 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9266 the old syntax may be recovered as follows:
9269 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9270 (infixl "\\<oplus>" 100)
9272 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9274 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9275 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9278 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9279 changed from A/r to A//r;
9281 * ZF: new treatment of arithmetic (nat & int) may break some old
9284 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9285 rulify -> rule_format, elimify -> elim_format, ...);
9287 * Isar/Provers: intro/elim/dest attributes changed; renamed
9288 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9289 should have to change intro!! to intro? only); replaced "delrule" by
9292 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9294 * Provers: strengthened force_tac by using new first_best_tac;
9296 * LaTeX document preparation: several changes of isabelle.sty (see
9300 *** Document preparation ***
9302 * formal comments (text blocks etc.) in new-style theories may now
9303 contain antiquotations of thm/prop/term/typ/text to be presented
9304 according to latex print mode; concrete syntax is like this:
9305 @{term[show_types] "f(x) = a + x"};
9307 * isatool mkdir provides easy setup of Isabelle session directories,
9308 including proper document sources;
9310 * generated LaTeX sources are now deleted after successful run
9311 (isatool document -c); may retain a copy somewhere else via -D option
9314 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9315 style files, achieving self-contained LaTeX sources and simplifying
9318 * old-style theories now produce (crude) LaTeX output as well;
9320 * browser info session directories are now self-contained (may be put
9321 on WWW server seperately); improved graphs of nested sessions; removed
9322 graph for 'all sessions';
9324 * several improvements in isabelle style files; \isabellestyle{it}
9325 produces fake math mode output; \isamarkupheader is now \section by
9326 default; see lib/texinputs/isabelle.sty etc.;
9331 * Isar/Pure: local results and corresponding term bindings are now
9332 subject to Hindley-Milner polymorphism (similar to ML); this
9333 accommodates incremental type-inference very nicely;
9335 * Isar/Pure: new derived language element 'obtain' supports
9336 generalized existence reasoning;
9338 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9339 support accumulation of results, without applying any rules yet;
9340 useful to collect intermediate results without explicit name
9341 references, and for use with transitivity rules with more than 2
9344 * Isar/Pure: scalable support for case-analysis type proofs: new
9345 'case' language element refers to local contexts symbolically, as
9346 produced by certain proof methods; internally, case names are attached
9347 to theorems as "tags";
9349 * Isar/Pure: theory command 'hide' removes declarations from
9350 class/type/const name spaces;
9352 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9353 indicate potential overloading;
9355 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9357 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9358 "{a,b,c}" instead of {a,b,c};
9360 * Isar/Pure now provides its own version of intro/elim/dest
9361 attributes; useful for building new logics, but beware of confusion
9362 with the version in Provers/classical;
9364 * Isar/Pure: the local context of (non-atomic) goals is provided via
9365 case name 'antecedent';
9367 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9368 to the current context is now done automatically);
9370 * Isar/Pure: theory command 'method_setup' provides a simple interface
9371 for definining proof methods in ML;
9373 * Isar/Provers: intro/elim/dest attributes changed; renamed
9374 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9375 most cases, one should have to change intro!! to intro? only);
9376 replaced "delrule" by "rule del";
9378 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9379 'symmetric' attribute (the latter supercedes [RS sym]);
9381 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9382 method modifier); 'simp' method: 'only:' modifier removes loopers as
9383 well (including splits);
9385 * Isar/Provers: Simplifier and Classical methods now support all kind
9386 of modifiers used in the past, including 'cong', 'iff', etc.
9388 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9389 of Simplifier and Classical reasoner);
9391 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9392 now support named cases; major packages (inductive, datatype, primrec,
9393 recdef) support case names and properly name parameters;
9395 * Isar/HOL: new transitivity rules for substitution in inequalities --
9396 monotonicity conditions are extracted to be proven at end of
9399 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9402 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9403 split_if split_if_asm; datatype package provides theorems foo.splits =
9404 foo.split foo.split_asm for each datatype;
9406 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9407 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9408 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9409 use "(cases (simplified))" method in proper proof texts);
9411 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9413 * Isar: names of theorems etc. may be natural numbers as well;
9415 * Isar: 'pr' command: optional arguments for goals_limit and
9416 ProofContext.prems_limit; no longer prints theory contexts, but only
9419 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9420 additional print modes to be specified; e.g. "pr(latex)" will print
9421 proof state according to the Isabelle LaTeX style;
9423 * Isar: improved support for emulating tactic scripts, including proof
9424 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9425 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9426 (for HOL datatypes);
9428 * Isar: simplified (more robust) goal selection of proof methods: 1st
9429 goal, all goals, or explicit goal specifier (tactic emulation); thus
9430 'proof method scripts' have to be in depth-first order;
9432 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9434 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9435 should instead use individual commands for printing items
9436 (print_commands, print_methods etc.);
9438 * Isar: added 'nothing' --- the empty list of theorems;
9443 * HOL/MicroJava: formalization of a fragment of Java, together with a
9444 corresponding virtual machine and a specification of its bytecode
9445 verifier and a lightweight bytecode verifier, including proofs of
9446 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9447 Cornelia Pusch (see also the homepage of project Bali at
9448 http://isabelle.in.tum.de/Bali/);
9450 * HOL/Algebra: new theory of rings and univariate polynomials, by
9453 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9454 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9457 * HOL/Lattice: fundamental concepts of lattice theory and order
9458 structures, including duals, properties of bounds versus algebraic
9459 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9460 Theorem for complete lattices etc.; may also serve as a demonstration
9461 for abstract algebraic reasoning using axiomatic type classes, and
9462 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9464 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9467 * HOL/IMPP: extension of IMP with local variables and mutually
9468 recursive procedures, by David von Oheimb;
9470 * HOL/Lambda: converted into new-style theory and document;
9472 * HOL/ex/Multiquote: example of multiple nested quotations and
9473 anti-quotations -- basically a generalized version of de-Bruijn
9474 representation; very useful in avoiding lifting of operations;
9476 * HOL/record: added general record equality rule to simpset; fixed
9477 select-update simplification procedure to handle extended records as
9478 well; admit "r" as field name;
9480 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9481 other numeric types and also as the identity of groups, rings, etc.;
9483 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9484 Types nat and int belong to this axclass;
9486 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9487 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9488 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9489 two terms #m*u and #n*u are replaced by #(m+n)*u
9490 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9491 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9492 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9494 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9495 powerful prover for predicate logic but knows nothing of clasets; see
9496 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9498 * HOL: new version of "case_tac" subsumes both boolean case split and
9499 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9500 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9502 * HOL: simplification no longer dives into case-expressions: only the
9503 selector expression is simplified, but not the remaining arms; to
9504 enable full simplification of case-expressions for datatype t, you may
9505 remove t.weak_case_cong from the simpset, either globally (Delcongs
9506 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9508 * HOL/recdef: the recursion equations generated by 'recdef' for
9509 function 'f' are now called f.simps instead of f.rules; if all
9510 termination conditions are proved automatically, these simplification
9511 rules are added to the simpset, as in primrec; rules may be named
9512 individually as well, resulting in a separate list of theorems for
9515 * HOL/While is a new theory that provides a while-combinator. It
9516 permits the definition of tail-recursive functions without the
9517 provision of a termination measure. The latter is necessary once the
9518 invariant proof rule for while is applied.
9520 * HOL: new (overloaded) notation for the set of elements below/above
9521 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9523 * HOL: theorems impI, allI, ballI bound as "strip";
9525 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9526 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9527 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9529 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9531 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9532 main HOL, but was unused);
9534 * HOL: fewer consts declared as global (e.g. have to refer to
9535 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9537 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9538 in case of overlap with user translations (e.g. judgements over
9539 tuples); (note that the underlying logical represenation is still
9545 * ZF: simplification automatically cancels common terms in arithmetic
9546 expressions over nat and int;
9548 * ZF: new treatment of nat to minimize type-checking: all operators
9549 coerce their operands to a natural number using the function natify,
9550 making the algebraic laws unconditional;
9552 * ZF: as above, for int: operators coerce their operands to an integer
9553 using the function intify;
9555 * ZF: the integer library now contains many of the usual laws for the
9556 orderings, including $<=, and monotonicity laws for $+ and $*;
9558 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9561 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9562 to the simplifier and classical reasoner simultaneously;
9567 * Provers: blast_tac now handles actual object-logic rules as
9568 assumptions; note that auto_tac uses blast_tac internally as well;
9570 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9571 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9573 * Provers: delrules now handles destruct rules as well (no longer need
9574 explicit make_elim);
9576 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9577 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9578 use instead the strong form,
9579 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9580 in HOL, FOL and ZF the function cla_make_elim will create such rules
9581 from destruct-rules;
9583 * Provers: Simplifier.easy_setup provides a fast path to basic
9584 Simplifier setup for new object-logics;
9586 * Pure: AST translation rules no longer require constant head on LHS;
9588 * Pure: improved name spaces: ambiguous output is qualified; support
9589 for hiding of names;
9591 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9592 XSYMBOL_HOME; no longer need to do manual configuration in most
9595 * system: compression of ML heaps images may now be controlled via -c
9596 option of isabelle and isatool usedir (currently only observed by
9599 * system: isatool installfonts may handle X-Symbol fonts as well (very
9600 useful for remote X11);
9602 * system: provide TAGS file for Isabelle sources;
9604 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9607 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9608 timing flag supersedes proof_timing and Toplevel.trace;
9610 * ML: new combinators |>> and |>>> for incremental transformations
9611 with secondary results (e.g. certain theory extensions):
9613 * ML: PureThy.add_defs gets additional argument to indicate potential
9614 overloading (usually false);
9616 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9621 New in Isabelle99 (October 1999)
9622 --------------------------------
9624 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9626 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9627 are no longer simplified. (This allows the simplifier to unfold recursive
9628 functional programs.) To restore the old behaviour, declare
9630 Delcongs [if_weak_cong];
9632 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9635 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9637 * HOL/datatype: mutual_induct_tac no longer exists --
9638 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9640 * HOL/typedef: fixed type inference for representing set; type
9641 arguments now have to occur explicitly on the rhs as type constraints;
9643 * ZF: The con_defs part of an inductive definition may no longer refer
9644 to constants declared in the same theory;
9646 * HOL, ZF: the function mk_cases, generated by the inductive
9647 definition package, has lost an argument. To simplify its result, it
9648 uses the default simpset instead of a supplied list of theorems.
9650 * HOL/List: the constructors of type list are now Nil and Cons;
9652 * Simplifier: the type of the infix ML functions
9653 setSSolver addSSolver setSolver addSolver
9654 is now simpset * solver -> simpset where `solver' is a new abstract type
9655 for packaging solvers. A solver is created via
9656 mk_solver: string -> (thm list -> int -> tactic) -> solver
9657 where the string argument is only a comment.
9662 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9663 decision procedure for linear arithmetic. Currently it is used for
9664 types `nat', `int', and `real' in HOL (see below); it can, should and
9665 will be instantiated for other types and logics as well.
9667 * The simplifier now accepts rewrite rules with flexible heads, eg
9668 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9669 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9675 * New Isabelle/Isar subsystem provides an alternative to traditional
9676 tactical theorem proving; together with the ProofGeneral/isar user
9677 interface it offers an interactive environment for developing human
9678 readable proof documents (Isar == Intelligible semi-automated
9679 reasoning); for further information see isatool doc isar-ref,
9680 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9682 * improved and simplified presentation of theories: better HTML markup
9683 (including colors), graph views in several sizes; isatool usedir now
9684 provides a proper interface for user theories (via -P option); actual
9685 document preparation based on (PDF)LaTeX is available as well (for
9686 new-style theories only); see isatool doc system for more information;
9688 * native support for Proof General, both for classic Isabelle and
9691 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9692 using the graph browser tool;
9694 * Isabelle manuals now also available as PDF;
9696 * theory loader rewritten from scratch (may not be fully
9697 bug-compatible); old loadpath variable has been replaced by show_path,
9698 add_path, del_path, reset_path functions; new operations such as
9699 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9702 * improved isatool install: option -k creates KDE application icon,
9703 option -p DIR installs standalone binaries;
9705 * added ML_PLATFORM setting (useful for cross-platform installations);
9706 more robust handling of platform specific ML images for SML/NJ;
9708 * the settings environment is now statically scoped, i.e. it is never
9709 created again in sub-processes invoked from isabelle, isatool, or
9712 * path element specification '~~' refers to '$ISABELLE_HOME';
9714 * in locales, the "assumes" and "defines" parts may be omitted if
9717 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9720 * new print_mode "HTML";
9722 * new flag show_tags controls display of tags of theorems (which are
9723 basically just comments that may be attached by some tools);
9725 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9726 mode and goal output format:
9728 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9730 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9732 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9733 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9735 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9737 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9739 * function bind_thms stores lists of theorems (cf. bind_thm);
9741 * new shorthand tactics ftac, eatac, datac, fatac;
9743 * qed (and friends) now accept "" as result name; in that case the
9744 theorem is not stored, but proper checks and presentation of the
9747 * theorem database now also indexes constants "Trueprop", "all",
9748 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9753 ** HOL arithmetic **
9755 * There are now decision procedures for linear arithmetic over nat and
9758 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9759 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9760 are treated as atomic; subformulae not involving type `nat' or `int'
9761 are ignored; quantified subformulae are ignored unless they are
9762 positive universal or negative existential. The tactic has to be
9763 invoked by hand and can be a little bit slow. In particular, the
9764 running time is exponential in the number of occurrences of `min' and
9765 `max', and `-' on `nat'.
9767 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9768 (negated) (in)equalities among the premises and the conclusion into
9769 account (i.e. no compound formulae) and does not know about `min' and
9770 `max', and `-' on `nat'. It is fast and is used automatically by the
9773 NB: At the moment, these decision procedures do not cope with mixed
9774 nat/int formulae where the two parts interact, such as `m < n ==>
9777 * HOL/Numeral provides a generic theory of numerals (encoded
9778 efficiently as bit strings); setup for types nat/int/real is in place;
9779 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9780 int, existing theories and proof scripts may require a few additional
9783 * integer division and remainder can now be performed on constant
9786 * many properties of integer multiplication, division and remainder
9789 * An interface to the Stanford Validity Checker (SVC) is available through the
9790 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9791 are proved automatically. SVC must be installed separately, and its results
9792 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9793 invocation of the underlying oracle). For SVC see
9794 http://verify.stanford.edu/SVC
9796 * IsaMakefile: the HOL-Real target now builds an actual image;
9801 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9802 (in Isabelle/Isar) -- by Gertrud Bauer;
9804 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9805 analysis for assembly languages with subtypes;
9807 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9808 -- avoids syntactic ambiguities and treats state, transition, and
9809 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9810 changed syntax and (many) tactics;
9812 * HOL/inductive: Now also handles more general introduction rules such
9813 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9814 theorems are now maintained within the theory (maintained via the
9817 * HOL/datatype: Now also handles arbitrarily branching datatypes
9818 (using function types) such as
9820 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9822 * HOL/record: record_simproc (part of the default simpset) takes care
9823 of selectors applied to updated records; record_split_tac is no longer
9824 part of the default claset; update_defs may now be removed from the
9825 simpset in many cases; COMPATIBILITY: old behavior achieved by
9827 claset_ref () := claset() addSWrapper record_split_wrapper;
9828 Delsimprocs [record_simproc]
9830 * HOL/typedef: fixed type inference for representing set; type
9831 arguments now have to occur explicitly on the rhs as type constraints;
9833 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9834 names rather than an ML expression;
9836 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9837 supplied later. Program schemes can be defined, such as
9838 "While B C s = (if B s then While B C (C s) else s)"
9839 where the well-founded relation can be chosen after B and C have been given.
9841 * HOL/List: the constructors of type list are now Nil and Cons;
9842 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9843 course, ML tools referring to List.list.op # etc. have to be adapted;
9845 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9846 disabled by default; run isabelle with option -m HOL to get back to
9847 the original Gordon/HOL-style output;
9849 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9850 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9852 * HOL basic syntax simplified (more orthogonal): all variants of
9853 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9854 Eps operator is provided as well: "SOME x. P[x]";
9856 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9858 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9859 thus available for user theories;
9861 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9862 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9865 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9866 several times and then mp;
9871 * the notation <<...>> is now available as a notation for sequences of
9874 * the simplifier is now installed
9876 * the axiom system has been generalized (thanks to Soren Heilmann)
9878 * the classical reasoner now has a default rule database
9883 * new primrec section allows primitive recursive functions to be given
9884 directly (as in HOL) over datatypes and the natural numbers;
9886 * new tactics induct_tac and exhaust_tac for induction (or case
9887 analysis) over datatypes and the natural numbers;
9889 * the datatype declaration of type T now defines the recursor T_rec;
9891 * simplification automatically does freeness reasoning for datatype
9894 * automatic type-inference, with AddTCs command to insert new
9895 type-checking rules;
9897 * datatype introduction rules are now added as Safe Introduction rules
9900 * the syntax "if P then x else y" is now available in addition to
9904 *** Internal programming interfaces ***
9906 * tuned simplifier trace output; new flag debug_simp;
9908 * structures Vartab / Termtab (instances of TableFun) offer efficient
9909 tables indexed by indexname_ord / term_ord (compatible with aconv);
9911 * AxClass.axclass_tac lost the theory argument;
9913 * tuned current_goals_markers semantics: begin / end goal avoids
9914 printing empty lines;
9916 * removed prs and prs_fn hook, which was broken because it did not
9917 include \n in its semantics, forcing writeln to add one
9918 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9919 string -> unit if you really want to output text without newline;
9921 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9922 plain output, interface builders may have to enable 'isabelle_font'
9923 mode to get Isabelle font glyphs as before;
9925 * refined token_translation interface; INCOMPATIBILITY: output length
9926 now of type real instead of int;
9928 * theory loader actions may be traced via new ThyInfo.add_hook
9929 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9930 your own database of information attached to *whole* theories -- as
9931 opposed to intra-theory data slots offered via TheoryDataFun;
9933 * proper handling of dangling sort hypotheses (at last!);
9934 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9935 extra sort hypotheses that can be witnessed from the type signature;
9936 the force_strip_shyps flag is gone, any remaining shyps are simply
9937 left in the theorem (with a warning issued by strip_shyps_warning);
9941 New in Isabelle98-1 (October 1998)
9942 ----------------------------------
9944 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9946 * several changes of automated proof tools;
9948 * HOL: major changes to the inductive and datatype packages, including
9949 some minor incompatibilities of theory syntax;
9951 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9954 * HOL: removed duplicate thms in Arith:
9955 less_imp_add_less should be replaced by trans_less_add1
9956 le_imp_add_le should be replaced by trans_le_add1
9958 * HOL: unary minus is now overloaded (new type constraints may be
9961 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9962 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9963 now taken as an integer constant.
9965 * Pure: ML function 'theory_of' renamed to 'theory';
9971 1. Asm_full_simp_tac is now more aggressive.
9972 1. It will sometimes reorient premises if that increases their power to
9974 2. It does no longer proceed strictly from left to right but may also
9975 rotate premises to achieve further simplification.
9976 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9977 old Asm_full_simp_tac in that it does not rotate premises.
9978 2. The simplifier now knows a little bit about nat-arithmetic.
9980 * Classical reasoner: wrapper mechanism for the classical reasoner now
9981 allows for selected deletion of wrappers, by introduction of names for
9982 wrapper functionals. This implies that addbefore, addSbefore,
9983 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9984 and that adding two tactics with the same name overwrites the first
9985 one (emitting a warning).
9986 type wrapper = (int -> tactic) -> (int -> tactic)
9987 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9988 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9989 delWrapper, delSWrapper: claset * string -> claset
9990 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9992 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9993 semantics; addbefore now affects only the unsafe part of step_tac
9994 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9995 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9998 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9999 compWrapper; added safe wrapper (and access functions for it);
10001 * HOL/split_all_tac is now much faster and fails if there is nothing
10002 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
10003 and the names of the automatically generated variables have changed.
10004 split_all_tac has moved within claset() from unsafe wrappers to safe
10005 wrappers, which means that !!-bound variables are split much more
10006 aggressively, and safe_tac and clarify_tac now split such variables.
10007 If this splitting is not appropriate, use delSWrapper "split_all_tac".
10008 Note: the same holds for record_split_tac, which does the job of
10009 split_all_tac for record fields.
10011 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
10012 permanently to the default simpset using Addsplits just like
10013 Addsimps. They can be removed via Delsplits just like
10014 Delsimps. Lower-case versions are also available.
10016 * HOL/Simplifier: The rule split_if is now part of the default
10017 simpset. This means that the simplifier will eliminate all occurrences
10018 of if-then-else in the conclusion of a goal. To prevent this, you can
10019 either remove split_if completely from the default simpset by
10020 `Delsplits [split_if]' or remove it in a specific call of the
10021 simplifier using `... delsplits [split_if]'. You can also add/delete
10022 other case splitting rules to/from the default simpset: every datatype
10023 generates suitable rules `split_t_case' and `split_t_case_asm' (where
10024 t is the name of the datatype).
10026 * Classical reasoner / Simplifier combination: new force_tac (and
10027 derivatives Force_tac, force) combines rewriting and classical
10028 reasoning (and whatever other tools) similarly to auto_tac, but is
10029 aimed to solve the given subgoal completely.
10034 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
10035 and `goalw': the theory is no longer needed as an explicit argument -
10036 the current theory context is used; assumptions are no longer returned
10037 at the ML-level unless one of them starts with ==> or !!; it is
10038 recommended to convert to these new commands using isatool fixgoal
10039 (backup your sources first!);
10041 * new top-level commands 'thm' and 'thms' for retrieving theorems from
10042 the current theory context, and 'theory' to lookup stored theories;
10044 * new theory section 'locale' for declaring constants, assumptions and
10045 definitions that have local scope;
10047 * new theory section 'nonterminals' for purely syntactic types;
10049 * new theory section 'setup' for generic ML setup functions
10050 (e.g. package initialization);
10052 * the distribution now includes Isabelle icons: see
10053 lib/logo/isabelle-{small,tiny}.xpm;
10055 * isatool install - install binaries with absolute references to
10058 * isatool logo -- create instances of the Isabelle logo (as EPS);
10060 * print mode 'emacs' reserved for Isamode;
10062 * support multiple print (ast) translations per constant name;
10064 * theorems involving oracles are now printed with a suffixed [!];
10069 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
10071 * HOL/inductive package reorganized and improved: now supports mutual
10072 definitions such as
10077 oddI "n : EVEN ==> Suc n : ODD"
10078 evenI "n : ODD ==> Suc n : EVEN"
10080 new theorem list "elims" contains an elimination rule for each of the
10081 recursive sets; inductive definitions now handle disjunctive premises
10082 correctly (also ZF);
10084 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10085 "mutual_induct" no longer exists - the induction rule is always
10086 contained in "induct";
10089 * HOL/datatype package re-implemented and greatly improved: now
10090 supports mutually recursive datatypes such as
10093 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10094 | SUM ('a aexp) ('a aexp)
10095 | DIFF ('a aexp) ('a aexp)
10098 'a bexp = LESS ('a aexp) ('a aexp)
10099 | AND ('a bexp) ('a bexp)
10100 | OR ('a bexp) ('a bexp)
10102 as well as indirectly recursive datatypes such as
10105 ('a, 'b) term = Var 'a
10106 | App 'b ((('a, 'b) term) list)
10108 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10109 induction on mutually / indirectly recursive datatypes.
10111 Primrec equations are now stored in theory and can be accessed via
10112 <function_name>.simps.
10116 - Theories using datatypes must now have theory Datatype as an
10118 - The specific <typename>.induct_tac no longer exists - use the
10119 generic induct_tac instead.
10120 - natE has been renamed to nat.exhaust - use exhaust_tac
10121 instead of res_inst_tac ... natE. Note that the variable
10122 names in nat.exhaust differ from the names in natE, this
10123 may cause some "fragile" proofs to fail.
10124 - The theorems split_<typename>_case and split_<typename>_case_asm
10125 have been renamed to <typename>.split and <typename>.split_asm.
10126 - Since default sorts of type variables are now handled correctly,
10127 some datatype definitions may have to be annotated with explicit
10129 - Primrec definitions no longer require function name and type
10130 of recursive argument.
10132 Consider using isatool fixdatatype to adapt your theories and proof
10133 scripts to the new package (backup your sources first!).
10136 * HOL/record package: considerably improved implementation; now
10137 includes concrete syntax for record types, terms, updates; theorems
10138 for surjective pairing and splitting !!-bound record variables; proof
10139 support is as follows:
10141 1) standard conversions (selectors or updates applied to record
10142 constructor terms) are part of the standard simpset;
10144 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10145 made part of standard simpset and claset via addIffs;
10147 3) a tactic for record field splitting (record_split_tac) is part of
10148 the standard claset (addSWrapper);
10150 To get a better idea about these rules you may retrieve them via
10151 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10152 the name of your record type.
10154 The split tactic 3) conceptually simplifies by the following rule:
10156 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10158 Thus any record variable that is bound by meta-all will automatically
10159 blow up into some record constructor term, consequently the
10160 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10161 solve record problems automatically.
10164 * reorganized the main HOL image: HOL/Integ and String loaded by
10165 default; theory Main includes everything;
10167 * automatic simplification of integer sums and comparisons, using cancellation;
10169 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10171 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10173 * many new identities for unions, intersections, set difference, etc.;
10175 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10176 called split_if, split_split, split_sum_case and split_nat_case (to go
10177 with add/delsplits);
10179 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10180 (?x::unit) = (); this is made part of the default simpset, which COULD
10181 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10182 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10183 unit_abs_eta_conv is added in order to counter the effect of
10184 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10187 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10190 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10191 It and 'sym RS equals0D' are now in the default claset, giving automatic
10192 disjointness reasoning but breaking a few old proofs.
10194 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10195 to 'converse' from 'inverse' (for compatibility with ZF and some
10198 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10199 the well-founded relation;
10201 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10202 Compl A. The "Compl" syntax remains available as input syntax for this
10205 * HOL/Update: new theory of function updates:
10206 f(a:=b) == %x. if x=a then b else f x
10207 may also be iterated as in f(a:=b,c:=d,...);
10209 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10212 - new function list_update written xs[i:=v] that updates the i-th
10213 list position. May also be iterated as in xs[i:=a,j:=b,...].
10214 - new function `upt' written [i..j(] which generates the list
10215 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10216 bound write [i..j], which is a shorthand for [i..j+1(].
10217 - new lexicographic orderings and corresponding wellfoundedness theorems.
10220 - removed 'pred' (predecessor) function;
10221 - generalized some theorems about n-1;
10222 - many new laws about "div" and "mod";
10223 - new laws about greatest common divisors (see theory ex/Primes);
10225 * HOL/Relation: renamed the relational operator r^-1 "converse"
10226 instead of "inverse";
10228 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10229 of the multiset ordering;
10231 * directory HOL/Real: a construction of the reals using Dedekind cuts
10232 (not included by default);
10234 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10236 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10237 programs, i.e. different program variables may have different types.
10239 * calling (stac rew i) now fails if "rew" has no effect on the goal
10240 [previously, this check worked only if the rewrite rule was unconditional]
10241 Now rew can involve either definitions or equalities (either == or =).
10246 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10247 only the theorems proved on ZF.ML;
10249 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10250 It and 'sym RS equals0D' are now in the default claset, giving automatic
10251 disjointness reasoning but breaking a few old proofs.
10253 * ZF/Update: new theory of function updates
10254 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10255 may also be iterated as in f(a:=b,c:=d,...);
10257 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10259 * calling (stac rew i) now fails if "rew" has no effect on the goal
10260 [previously, this check worked only if the rewrite rule was unconditional]
10261 Now rew can involve either definitions or equalities (either == or =).
10263 * case_tac provided for compatibility with HOL
10264 (like the old excluded_middle_tac, but with subgoals swapped)
10267 *** Internal programming interfaces ***
10269 * Pure: several new basic modules made available for general use, see
10270 also src/Pure/README;
10272 * improved the theory data mechanism to support encapsulation (data
10273 kind name replaced by private Object.kind, acting as authorization
10274 key); new type-safe user interface via functor TheoryDataFun; generic
10275 print_data function becomes basically useless;
10277 * removed global_names compatibility flag -- all theory declarations
10278 are qualified by default;
10280 * module Pure/Syntax now offers quote / antiquote translation
10281 functions (useful for Hoare logic etc. with implicit dependencies);
10282 see HOL/ex/Antiquote for an example use;
10284 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10287 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10290 * Display.print_goals function moved to Locale.print_goals;
10292 * standard print function for goals supports current_goals_markers
10293 variable for marking begin of proof, end of proof, start of goal; the
10294 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10295 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10300 New in Isabelle98 (January 1998)
10301 --------------------------------
10303 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10305 * changed lexical syntax of terms / types: dots made part of long
10306 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10308 * simpset (and claset) reference variable replaced by functions
10309 simpset / simpset_ref;
10311 * no longer supports theory aliases (via merge) and non-trivial
10312 implicit merge of thms' signatures;
10314 * most internal names of constants changed due to qualified names;
10316 * changed Pure/Sequence interface (see Pure/seq.ML);
10319 *** General Changes ***
10321 * hierachically structured name spaces (for consts, types, axms, thms
10322 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10323 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10324 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10325 long_names for fully qualified output names; NOTE: ML programs
10326 (special tactics, packages etc.) referring to internal names may have
10327 to be adapted to cope with fully qualified names; in case of severe
10328 backward campatibility problems try setting 'global_names' at compile
10329 time to have enrything declared within a flat name space; one may also
10330 fine tune name declarations in theories via the 'global' and 'local'
10333 * reimplemented the implicit simpset and claset using the new anytype
10334 data filed in signatures; references simpset:simpset ref etc. are
10335 replaced by functions simpset:unit->simpset and
10336 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10337 to patch your ML files accordingly;
10339 * HTML output now includes theory graph data for display with Java
10340 applet or isatool browser; data generated automatically via isatool
10341 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10343 * defs may now be conditional; improved rewrite_goals_tac to handle
10344 conditional equations;
10346 * defs now admits additional type arguments, using TYPE('a) syntax;
10348 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10349 creates a new theory node; implicit merge of thms' signatures is
10350 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10351 transfer:theory->thm->thm in (rare) cases;
10353 * improved handling of draft signatures / theories; draft thms (and
10354 ctyps, cterms) are automatically promoted to real ones;
10356 * slightly changed interfaces for oracles: admit many per theory, named
10357 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10359 * print_goals: optional output of const types (set show_consts and
10362 * improved output of warnings (###) and errors (***);
10364 * subgoal_tac displays a warning if the new subgoal has type variables;
10366 * removed old README and Makefiles;
10368 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10370 * removed obsolete init_pps and init_database;
10372 * deleted the obsolete tactical STATE, which was declared by
10373 fun STATE tacfun st = tacfun st st;
10375 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10376 (which abbreviates $HOME);
10378 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10379 use isatool fixseq to adapt your ML programs (this works for fully
10380 qualified references to the Sequence structure only!);
10382 * use_thy no longer requires writable current directory; it always
10383 reloads .ML *and* .thy file, if either one is out of date;
10386 *** Classical Reasoner ***
10388 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10389 tactics that use classical reasoning to simplify a subgoal without
10390 splitting it into several subgoals;
10392 * Safe_tac: like safe_tac but uses the default claset;
10397 * added simplification meta rules:
10398 (asm_)(full_)simplify: simpset -> thm -> thm;
10400 * simplifier.ML no longer part of Pure -- has to be loaded by object
10403 * added prems argument to simplification procedures;
10405 * HOL, FOL, ZF: added infix function `addsplits':
10406 instead of `<simpset> setloop (split_tac <thms>)'
10407 you can simply write `<simpset> addsplits <thms>'
10412 * TYPE('a) syntax for type reflection terms;
10414 * no longer handles consts with name "" -- declare as 'syntax' instead;
10416 * pretty printer: changed order of mixfix annotation preference (again!);
10418 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10423 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10424 with `addloop' of the simplifier to faciliate case splitting in premises.
10426 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10428 * HOL/Auth: new protocol proofs including some for the Internet
10431 * HOL/Map: new theory of `maps' a la VDM;
10433 * HOL/simplifier: simplification procedures nat_cancel_sums for
10434 cancelling out common nat summands from =, <, <= (in)equalities, or
10435 differences; simplification procedures nat_cancel_factor for
10436 cancelling common factor from =, <, <= (in)equalities over natural
10437 sums; nat_cancel contains both kinds of procedures, it is installed by
10438 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10440 * HOL/simplifier: terms of the form
10441 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10443 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10444 and those of the form
10445 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10447 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10450 Each datatype `t' now comes with a theorem `split_t_case' of the form
10452 P(t_case f1 ... fn x) =
10453 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10455 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10458 and a theorem `split_t_case_asm' of the form
10460 P(t_case f1 ... fn x) =
10461 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10463 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10465 which can be added to a simpset via `addsplits'. The existing theorems
10466 expand_list_case and expand_option_case have been renamed to
10467 split_list_case and split_option_case.
10470 - `pred n' is automatically converted to `n-1'.
10471 Users are strongly encouraged not to use `pred' any longer,
10472 because it will disappear altogether at some point.
10473 - Users are strongly encouraged to write "0 < n" rather than
10474 "n ~= 0". Theorems and proof tools have been modified towards this
10478 the function "set_of_list" has been renamed "set" (and its theorems too);
10479 the function "nth" now takes its arguments in the reverse order and
10480 has acquired the infix notation "!" as in "xs!n".
10482 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10484 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10485 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10487 * HOL/record: extensible records with schematic structural subtyping
10488 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10489 still lacks various theorems and concrete record syntax;
10494 * removed "axioms" and "generated by" sections;
10496 * replaced "ops" section by extended "consts" section, which is capable of
10497 handling the continuous function space "->" directly;
10500 . proves theorems immediately and stores them in the theory,
10501 . creates hierachical name space,
10502 . now uses normal mixfix annotations (instead of cinfix...),
10503 . minor changes to some names and values (for consistency),
10504 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10505 . separator between mutual domain defs: changed "," to "and",
10506 . improved handling of sort constraints; now they have to
10507 appear on the left-hand side of the equations only;
10509 * fixed LAM <x,y,zs>.b syntax;
10511 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10512 adm (%x. P (t x)), where P is chainfinite and t continuous;
10517 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10518 with `addloop' of the simplifier to faciliate case splitting in premises.
10520 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10521 in HOL, they strip ALL and --> from proved theorems;
10525 New in Isabelle94-8 (May 1997)
10526 ------------------------------
10528 *** General Changes ***
10530 * new utilities to build / run / maintain Isabelle etc. (in parts
10531 still somewhat experimental); old Makefiles etc. still functional;
10533 * new 'Isabelle System Manual';
10535 * INSTALL text, together with ./configure and ./build scripts;
10537 * reimplemented type inference for greater efficiency, better error
10538 messages and clean internal interface;
10540 * prlim command for dealing with lots of subgoals (an easier way of
10541 setting goals_limit);
10546 * supports alternative (named) syntax tables (parser and pretty
10547 printer); internal interface is provided by add_modesyntax(_i);
10549 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10550 be used in conjunction with the Isabelle symbol font; uses the
10551 "symbols" syntax table;
10553 * added token_translation interface (may translate name tokens in
10554 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10555 the current print_mode); IMPORTANT: user print translation functions
10556 are responsible for marking newly introduced bounds
10557 (Syntax.mark_boundT);
10559 * token translations for modes "xterm" and "xterm_color" that display
10560 names in bold, underline etc. or colors (which requires a color
10563 * infixes may now be declared with names independent of their syntax;
10565 * added typed_print_translation (like print_translation, but may
10566 access type of constant);
10569 *** Classical Reasoner ***
10571 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10572 some limitations. Blast_tac...
10573 + ignores addss, addbefore, addafter; this restriction is intrinsic
10574 + ignores elimination rules that don't have the correct format
10575 (the conclusion MUST be a formula variable)
10576 + ignores types, which can make HOL proofs fail
10577 + rules must not require higher-order unification, e.g. apply_type in ZF
10578 [message "Function Var's argument not a bound variable" relates to this]
10579 + its proof strategy is more general but can actually be slower
10581 * substitution with equality assumptions no longer permutes other
10584 * minor changes in semantics of addafter (now called addaltern); renamed
10585 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10586 (and access functions for it);
10588 * improved combination of classical reasoner and simplifier:
10589 + functions for handling clasimpsets
10590 + improvement of addss: now the simplifier is called _after_ the
10592 + safe variant of addss called addSss: uses safe simplifications
10593 _during_ the safe steps. It is more complete as it allows multiple
10594 instantiations of unknowns (e.g. with slow_tac).
10598 * added interface for simplification procedures (functions that
10599 produce *proven* rewrite rules on the fly, depending on current
10602 * ordering on terms as parameter (used for ordered rewriting);
10604 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10606 * the solver is now split into a safe and an unsafe part.
10607 This should be invisible for the normal user, except that the
10608 functions setsolver and addsolver have been renamed to setSolver and
10609 addSolver; added safe_asm_full_simp_tac;
10614 * a generic induction tactic `induct_tac' which works for all datatypes and
10615 also for type `nat';
10617 * a generic case distinction tactic `exhaust_tac' which works for all
10618 datatypes and also for type `nat';
10620 * each datatype comes with a function `size';
10622 * patterns in case expressions allow tuple patterns as arguments to
10623 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10625 * primrec now also works with type nat;
10627 * recdef: a new declaration form, allows general recursive functions to be
10628 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10630 * the constant for negation has been renamed from "not" to "Not" to
10631 harmonize with FOL, ZF, LK, etc.;
10633 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10636 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10638 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10639 problems in commutative rings, using axiomatic type classes for + and *;
10641 * more examples in HOL/MiniML and HOL/Auth;
10643 * more default rewrite rules for quantifiers, union/intersection;
10645 * a new constant `arbitrary == @x.False';
10647 * HOLCF/IOA replaces old HOL/IOA;
10649 * HOLCF changes: derived all rules and arities
10650 + axiomatic type classes instead of classes
10651 + typedef instead of faking type definitions
10652 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10653 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10654 + eliminated the types void, one, tr
10655 + use unit lift and bool lift (with translations) instead of one and tr
10656 + eliminated blift from Lift3.thy (use Def instead of blift)
10657 all eliminated rules are derived as theorems --> no visible changes ;
10662 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10663 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10664 as ZF_cs addSIs [equalityI];
10668 New in Isabelle94-7 (November 96)
10669 ---------------------------------
10671 * allowing negative levels (as offsets) in prlev and choplev;
10673 * super-linear speedup for large simplifications;
10675 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10676 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10677 FAIL); can suppress it using the command Delsimps (ex_simps @
10678 all_simps); De Morgan laws are also now included, by default;
10680 * improved printing of ==> : ~:
10682 * new object-logic "Sequents" adds linear logic, while replacing LK
10683 and Modal (thanks to Sara Kalvala);
10685 * HOL/Auth: correctness proofs for authentication protocols;
10687 * HOL: new auto_tac combines rewriting and classical reasoning (many
10688 examples on HOL/Auth);
10690 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10691 the rewriter and classical reasoner simultaneously;
10693 * function uresult no longer returns theorems in "standard" format;
10694 regain previous version by: val uresult = standard o uresult;
10698 New in Isabelle94-6
10699 -------------------
10701 * oracles -- these establish an interface between Isabelle and trusted
10702 external reasoners, which may deliver results as theorems;
10704 * proof objects (in particular record all uses of oracles);
10706 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10708 * "constdefs" section in theory files;
10710 * "primrec" section (HOL) no longer requires names;
10712 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10716 New in Isabelle94-5
10717 -------------------
10719 * reduced space requirements;
10721 * automatic HTML generation from theories;
10723 * theory files no longer require "..." (quotes) around most types;
10725 * new examples, including two proofs of the Church-Rosser theorem;
10727 * non-curried (1994) version of HOL is no longer distributed;
10731 New in Isabelle94-4
10732 -------------------
10734 * greatly reduced space requirements;
10736 * theory files (.thy) no longer require \...\ escapes at line breaks;
10738 * searchable theorem database (see the section "Retrieving theorems" on
10739 page 8 of the Reference Manual);
10741 * new examples, including Grabczewski's monumental case study of the
10744 * The previous version of HOL renamed to Old_HOL;
10746 * The new version of HOL (previously called CHOL) uses a curried syntax
10747 for functions. Application looks like f a b instead of f(a,b);
10749 * Mutually recursive inductive definitions finally work in HOL;
10751 * In ZF, pattern-matching on tuples is now available in all abstractions and
10752 translates to the operator "split";
10756 New in Isabelle94-3
10757 -------------------
10759 * new infix operator, addss, allowing the classical reasoner to
10760 perform simplification at each step of its search. Example:
10761 fast_tac (cs addss ss)
10763 * a new logic, CHOL, the same as HOL, but with a curried syntax
10764 for functions. Application looks like f a b instead of f(a,b). Also pairs
10765 look like (a,b) instead of <a,b>;
10767 * PLEASE NOTE: CHOL will eventually replace HOL!
10769 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10770 It translates to the operator "split". A new theory of integers is available;
10772 * In ZF, integer numerals now denote two's-complement binary integers.
10773 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10775 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10776 of the Axiom of Choice;
10780 New in Isabelle94-2
10781 -------------------
10783 * Significantly faster resolution;
10785 * the different sections in a .thy file can now be mixed and repeated
10788 * Database of theorems for FOL, HOL and ZF. New
10789 commands including qed, qed_goal and bind_thm store theorems in the database.
10791 * Simple database queries: return a named theorem (get_thm) or all theorems of
10792 a given theory (thms_of), or find out what theory a theorem was proved in
10795 * Bugs fixed in the inductive definition and datatype packages;
10797 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10798 and HOL_dup_cs obsolete;
10800 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10803 * Simpler definition of function space in ZF;
10805 * new results about cardinal and ordinal arithmetic in ZF;
10807 * 'subtype' facility in HOL for introducing new types as subsets of existing
10810 :mode=isabelle-news:wrap=hard:maxLineLen=72: