skolemize conjecture properly in Isar proof

tuning -- refactoring in preparation for handling skolemization of conjecture

removed dead weight from data structure

tuned code

tuned code

less customary term_of conversions; spurious side effect on method reflection

two target language numeral types: integer and natural, as replacement for code_numeral; former theory HOL/Library/Code_Numeral_Types replaces HOL/Code_Numeral; refined stack of theories implementing int and/or nat by target language numerals; reduced number of target language numeral types to exactly one

explicit code equation for integer_of_nat

extended stream library

merged

partially revert 0dac0158b8d4 as it too aggressively spreads card_UNIV type class whose dictionary constructions can slow down generated code; provide better error messages instead for card and subseteq

killed legacy alias

updated news

avoid crude/wrong theorem comparision

tuned code

more MaSh tracing

tuning

fixed metis_steps_total - was off by one

preplay subblocks

renamed sledgehammer_shrink to sledgehammer_compress

dont skolemize conjecture

introduced subblock in isar_step datatype for conjecture herbrandization

write_pdf for JFreeChart;

reform of predicate compiler / quickcheck theories: implement yieldn operations uniformly on the ML level -- predicate compiler uses negative integers as parameter to yieldn, whereas code_numeral represents natural numbers! avoid odd New_ prefix by joining related theories; avoid overcompact name DSequence; separated predicate inside random monad into separate theory; consolidated name of theory Quickcheck

merged

instantiate finite_UNIV and card_UNIV for finfun type

merged

more parallel proofs in 'nominal_datatype', although sequential dark matter remains;

tuned proof;

obsolete;

tuned proofs;

tuned signature -- legacy packages might want to fork proofs as well;

merged

implement code generation for finite, card, op = and op <= for sets always via finite_UNIV and card_UNIV, as fragile rewrites based on sorts are hard to find and debug

consolidation of library theories on product orders

type lifting setup for code numeral types

factored out shared preprocessor setup into theory Code_Abstract_Nat, tuning descriptions

abandoned theory Plain

tuned;

clarified default according to etc/options;

Java assumes regular "re-parenting" window manager;

merged

complete metric for formal power series

eliminated union_closed_basis; cleanup Fin_Map

fine grained instantiations

use maximum norm for type finmap

generalized

generalized

merged

discontinued home-made sharing for proof terms -- leave memory management to the Poly/ML RTS;

more thorough error handling of load/save (see also c1be3072ea8f);

file system operations for Graphics2D output;

updated isabelle-release URLs;

combinator List.those; simprule for case distinction on Option.map expression

explicit conversion integer_of_nat already in Code_Numeral_Types; tuned code postprocessor setup: present arithmetic results as plain numerals without conversions

IArray ignorant of particular representation of nat

tuned, particulary name

formal cleanup of sources

another attempt for a uniform abort on code generation errors

tuned spelling