Includes the derivates of polynomials -- reals specific content of Poly

Two simple theorems about cmod moved to Complex.thy

Now imports Funamental_Theorem_Algebra

Added trivial theorems aboud cmod

Included theories Library/Univ_Poly.thy and Complex/Fundamental_Theorem_Algebra.thy ; Theory Hyperreal/Poly.thy Removed

removed dead code; some cleanup

non-operative code antiquotation

non-operative code antiquotation

added further interface for reading constants

added first version of datatype antiquotation

moved refute_tac to linarith.ML

more elaborate structure Distribution (filled-in by makedist);

keep ChangeLog.gz within distribution; more elaborate structure Distribution (filled-in by makedist);

removed junk;

moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas

moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and added some

removed NBE;

removed ex/NBE.thy;

fix proofs involving ile_def

tuned structures in arith_data.ML

using only an relation predicate to construct div and mod

now in AFP

added system_out (back to multithreaded version -- still suffers from non-interruptible wait in Poly/ML 5.1);

removed General/system_process.ML (back to multithreaded version);

replaced setpgrp by more elaborate setsid;

slightly tuned

Yet another proof of False, this time using the strong case analysis rule.

tuned

system.pl - invoke shell command line (with robust signal handling);

updated

added eqvt-flag to subseteq-lemma

proved linorder and wellorder class instances

added get_parent (for AWE); tuned;

added perl wrapper for robust signal handling;

New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1

removed spurious PolyML.makestring;

replaced ignore/raise_interrupt by more flexible (un)interruptible combinators;

removed managed_process (cf. General/shell_process.ML); replaced ignore/raise_interrupt by more flexible (un)interruptible combinators; tuned timeLimit: sleep already interruptible by default; schedule: restore attributes of body, instead of forcing interruptible execution;

removed managed_process (cf. General/shell_process.ML);

exn_message: added TimeLimit.TimeOut; replaced ignore/raise_interrupt by more flexible (un)interruptible combinators;

export deny_secure;

setmp: uninterruptible;

System shell processes, with static input/output and propagation of interrupts.

added General/system_process.ML;

added lemma lists {normalize,succ,pred,minus,add,mult}_bin_simps

added lemma lists {normalize,succ,pred,minus,add,mult}_bin_simps

support for managed external processes;

more lemmas

<= and < on nat no longer depend on wellfounded relations

moved *_reorient lemmas here

tuned names;

syntax error: suppress expected categories altogether;

expected syntax categories: reduced duplication, report minimal priorities only;

Fixed typing problem that caused instantiation of induct_aux_rec to go wrong.

make_meta_clause bugfix: now works for higher-order clauses like LeastI_ex

fixed record pretty printing

using integers for pattern matching

tuned whitespace

more abstract lemmas

fix spelling

imports Main;

removed unnecessary theory qualifiers;

simultaneous use_thys;

added Id;

Made theory names in ZF disjoint from HOL theory names to allow loading both developments in a single session (but not merge them).

tuned proofs and comments

tuned spaces;

tuned default position;

added default_properties;

added position_properties;

maintain default position;

overloading: reduced code redundancy, no xstrings here;

overloading: tuned signature;

Instead of raising an exception, pred_set_conv now ignores conversion rules that would cause a clash. This allows multiple interpretations of locales containing inductive sets.

fix broken syntax translations

use ML antiquotations

lemma wf_union_compatible: "wf R ==> wf S ==> S O R <= R ==> wf (R Un S)"

between constant removed

continued

locales ACf, ACIf, ACIfSL and ACIfSLlin have been abandoned in favour of the existing algebraic classes ab_semigroup_mult, ab_semigroup_idem_mult, lower_semilattice (resp. uper_semilattice) and linorder

replaced class by locale

*** MESSAGE REFERS TO 1.29 and 1.44 *** sort_of_term: be permissive about _class *output* markers, to allow print translations invoke this function as well;

towards quickcheck

suppport for messages and indices

added indexT

instance "*" :: (sq_ord, sq_ord) sq_ord

cleaned up

modified MCollect syntax

<TERM> syntax

fixed term_of_sort

fixed record problem

add lemmas prod_lessI and Pair_less_iff [simp]

add lemma is_lub_lambda

add lemma cpo_lubI

add lemma cpo_lubI

instances for class discrete_cpo

new lemma cont_discrete_cpo

new discrete_cpo axclass

temporary adjustions

explicit del_funcs

proper term_of functions

avoiding dynamic simpset lookup

new lemma is_lub_Pair; cleaned up some proofs

commented stuff out

added multiset comprehension

idempotent semigroups

dual orders and dual lattices

Theorem Inductive.lfp_ordinal_induct generalized to complete lattices

new term-building combinators

cleaned up evaluation interfaces

tuned names

treating division by zero properly

eliminated escaped white space;

basic scanners: produce symbol list instead of imploded string; tuned signature;

* Outer syntax: string tokens no longer admit escaped white space;

location_of_position: Position.column_of (which counts Isabelle symbols, not characters);

added count/counted: improved position handling for token syntax; removed obsolete incr_line/keep_line/scan_blank; string tokens no longer admit escaped white space, which was an accidental (undocumented) feature;

added column field; replaced inc by general advance operation; str_of: no output for file without line information;

T.count/counted: improved position handling for token syntax;

added column property;