tuned -- Variable.declare_term is already part of Variable.auto_fixes;

ex/Tree23.thy: prove that insertion preserves tree balance and order

more IMP fragments

string -> vname

JMPF(LESS|GE) -> JMP(LESS|GE) because jumps are int now.

more IMP text fragments

moved latex generation for HOL-IMP out of distribution

renaming Quotient_Set and List_Quotient_Set to Quotient_Cset and List_Quotient_Cset to avoid name clash with existing Quotient_Set (again, cf. 66823a0066db)

merged

more robust, declarative and unsurprising computation of types in the quotient type definition

improve handling of bound type variables (esp. for TFF1)

improved TFF1 output

clarified signature

tuned

tuned

even more uniform Local_Theory.declaration for locales (cf. 57def0b39696, aa35859c8741);

removed obsolete argument (cf. aa35859c8741);

removed ad-hoc simp rules sin_cos_eq[symmetric], minus_sin_cos_eq[symmetric], cos_sin_eq[symmetric]

extend cancellation simproc patterns to cover terms like '- (2 * pi) < pi'

merged

remove unused function

also export DFG formats

always use DFG format to talk to SPASS -- since that's what we'll need to use anyway to benefit from sorts and other extensions

added DFG unsorted support (like in the old days)

gracefully do nothing if the SPASS input file is already in DFG format

added sorted DFG output for coming version of SPASS

specify proof output level 1 (i.e. no detailed, potentially huge E proofs) to LEO-II; requires version 1.2.9

check "sound" flag before doing something unsound...

uniform treatment of syntax declaration wrt. aux. context (NB: notation avoids duplicate mixfix internally);

tuned;

more accurate class constraints on cancellation simproc patterns

tuned;

tuned Named_Thms: proper binding;

refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;

more robust data storage (NB: the morphism can change the shape of qconst, and in the auxiliary context it is not even a constant yet);

uniform Local_Theory.declaration with explicit params;

tuned signature -- refined terminology;

slightly more explicit/syntactic modelling of morphisms;

correct import path

allow to build Probability and MV-Analysis with one ROOT.ML

removing dead code

ex/Simproc_Tests.thy: remove duplicate simprocs

use simproc_setup for cancellation simprocs, to get proper name bindings

tuned;

eliminated aliases of standard functions;

more standard attribute setup;

localized quotient data;

simplified/standardized signatures;

tuned signature;

uses IMP and hence requires its tex setup

merged

tuned text

respecting isabelle's programming style in the quotient package by simplifying qconsts_lookup function for data access; removing odd NotFound exception

respecting isabelle's programming style in the quotient package by simplifying map_lookup function for data access

respecting isabelle's programming style in the quotient package by simplifying quotdata_lookup function for data access

merged

fix bug in cancel_factor simprocs so they will work on goals like 'x * y < x * z' where the common term is already on the left

more robust ML pretty printing (cf. b6c527c64789);

tuned;

renaming Cset and List_Cset in Quotient_Examples to Quotient_Set and List_Quotient_Set to avoid a name clash of theory names with the ones in HOL-Library

tuned text

tuned names to avoid shadowing

merge Gcd/GCD and Lcm/LCM

clarify types of terms: use proper set type

instance bool :: linorder

removing poor man's dictionary construction which were only for the ancient code generator with no support of type classes

fixed typo

latex output not needed because errors manifest themselves earlier

some text on inner-syntax;

renamed in ASM

tuned order of eqns

tuned

script for exporting filtered IMP files as tar.gz

removed Norbert's email from isatest (bounces)

class Lexicon as abstract datatype;

more private stuff;

class Text.Edit as abstract datatype;

class Time as abstract datatype;

class Volatile as abstract datatype;

merged

added isaverbatimwrite that allows to cut out snippets of thy files in their latex form and dump them in a file

experimental support for Scala 2.9.1.final;

class Path as abstract datatype;

class Counter as abstract datatype;

discontinued redundant ASCII syntax;

modernized specifications;

proper normal form for Perspective.ranges (overlapping ranges could be joined in wrong order, crashing multiple editor views); clarified Text.Range apartness, with try_restrict and try_join operations; private Perspective constructor to ensure abstract datatype integrity;

merged

tuned

merged

replacing metis proofs with facts xt1 by new proof with more readable names

more robust parsing of TSTP sources -- Vampire has nonstandard "introduced()" tags and Waldmeister(OnTPTP) has weird "theory(...)" dependencies

disable Vampire's BDD optimization, which sometimes yields so huge proofs that this causes problems for reconstruction

NEWS

updating documentation: code_inline -> code_unfold; added documentation about attribute code_unfold_post

replacing code_inline by code_unfold, removing obsolete code_unfold, code_inline del now that the ancient code generator is removed

removing redundant attribute code_inline in the code generator

tuned;

tuned;

improving mutabelle script again after missing some changes in f4896c792316

correcting code_prolog

merged

add HOL/ex/Simproc_Tests.thy: testing for Tools/numeral_simprocs.ML

merged

tuned

mark "xt..." rules as "no_atp", since they are easy consequences of other better named properties

merged

removed mult_Bit1 from int_arith_rules (cf. 882403378a41 and 3078fd2eec7b, where mult_num1 erroneously replaced mult_1)

removed [trans] concept from basic material

merged

tuned

merged

modernizing predicate_compile_quickcheck

adding depth as an quickcheck configuration

renamed name -> vname

removed some remaining artefacts of ancient SML code generator

NEWS

cleaner LEO-II extensionality step detection

marginally cleaner proof parsing, that doesn't stumble upon LEO-II's E-step proofs

one more LEO-II failure

merged

merged

hide typedef-generated constants Product_Type.prod and Sum_Type.sum

more uniform SZS status handling

avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"

merged

renamed B to Bc

tuned comment;

proper source positions for @{lemma};

more robust toplevel_error reporting (NB: Context.proof_of on a stale theory crashes ungracefully);

inlined @{thms} (ML compile-time) allows to get rid of legacy zadd_ac as well (cf. 49e305100097);

tuned legacy signature;

further cleanup of stats (cf. 97e81a8aa277);

updated keywords;

really document just one code generator;

NEWS

removing old code generator

removing declaration of code_unfold to address the old code generator

removing dependency of the generic code generator to old code generator functions thyname_of_type and thyname_of_const

removing documentation about the old code generator

removing old code generator setup for executable sets

removing old code generator setup for efficient natural numbers; cleaned typo

removing old code generator setup for real numbers; tuned

removing old code generator setup for rational numbers; tuned

removing old code generator setup for strings

removing old code generator setup for lists

removing old code generator setup for integers

removing old code generator for inductive predicates

removing quickcheck tester SML-inductive based on the old code generator

removing old code generator setup for inductive sets in the inductive set package

removing old code generator setup of inductive predicates

removing old code generator setup for product types

removing old code generator setup for function types

removing old code generator setup for datatypes

removing old code generator for recursive functions

removing old code generator setup in the HOL theory

removing invocations of the evaluation method based on the old code generator

removing invocations of the old code generator

freeze conjecture schematics before applying lambda-translation, which sometimes calls "close_form" and ruins it for freezing

gracefully handle quantifiers of the form "All $ t" where "t" is not a lambda-abstraction in higher-order translations

tuned

adding testing of quickcheck narrowing with finite types to mutabelle script; modified is_executable in mutabelle_extra

mira: collect size of heap images

updated doc related to Satallax

parse Satallax unsat cores

merged

(old) NEWS

moving some common functions from quickcheck to the more HOL-specific quickcheck_common; renamed inductive_SML's configurations to more canonical names; adds automatically left and right hand sides of equations as evaluation terms

always use sockets on Windows/Cygwin; discontinued special raw_dump facility;

mira configuration: use official polyml 5.4.1 on lxbroy10

added Term.dummy_pattern conveniences;

slightly more standard-conformant XML parsing (see also 94033767ef9b);

tuned proof

tuned type annnotation

hide not_member as also member

misc tuning and modernization;

updated to Scala 2.8.2.final;

prefer recent polyml-5.4.1, but retain potentially fragile polyml-5.2.1 as experimental test;

updated to polyml-5.4.1;

updated to polyml-5.4.1;

merged

monadic bind

moved sublists to More_List.thy

NEWS

more complete stats, including small sessions which provide some clues on main HOL baseline performance;

avoid very specific code equation for card; corrected spelling

bouned transitive closure

moved acyclic predicate up in hierarchy

tuned

modernized definitions

static dummy_task (again) to avoid a few extra allocations;

tuned markup

discontinued obsolete 'types' command;

modernized structure Induct_Tacs;

tuned signature;

misc tuning and clarification;

tuned ML style;

tuned proofs -- eliminated vacuous "induct arbitrary: ..." situations;

discontinued obsolete alias structure ProofContext;

separated monotonicity reasoning and defined narrowing with while_option

include no-smlnj targets into library (cf. e54a985daa61);

increasing values_timeout to avoid SML_makeall failures on our current tests

merged

removed obsolete RC tags;

Int.thy: discontinued some legacy theorems

Set.thy: remove redundant [simp] declarations

removing code equation for card on finite types when loading the Executable_Set theory; should resolve a code generation issue with CoreC++

tune text for document generation

adding examples with relations to Quickcheck_Examples to show that quickcheck can actually handle operators on relations as well

adding code equations for cardinality and (reflexive) transitive closure on finite types

adding lemma about rel_pow in Transitive_Closure for executable equation of the (refl) transitive closure

adding lemma to List library for executable equation of the (refl) transitive closure

fixed typos in IMP

added nice interval syntax

Added dependecies

Added Hoare-like Abstract Interpretation

moved IMP/AbsInt stuff into subdirectory Abs_Int_Den

back to post-release mode;

Added tag Isabelle2011-1 for changeset 76fef3e57004

tuned;

updated ISABELLE_HOME_USER;

more explicit check of Java executable -- relevant for Linux x86/x86_64 mismatch and absence on Mac OS Lion;

Added tag Isabelle2011-1-RC2 for changeset a45121ffcfcb

some amendments due to Jean Pichon;

correct coercion generation in case of unknown map functions

proper platform_file_url for Windows UNC paths (server shares);

proper platform_file_url;

observe base URL of rendered document; added PIDE logo;

more README;

tuned README.html;

tuned;

retain output, which is required for non-existent JRE, for example (cf. b455e4f42c04);

tuned message, which is displayed after termination of Isabelle.app on Mac OS;

keep top-level "Isabelle" executable -- now an alias for "isabelle jedit";

tuned;

ensure Isabelle env;

Added tag Isabelle2011-1-RC1 for changeset 24ad77c3a147

tuned;

misc tuning for release;

reverted 09cdc4209d25 for formal reasons: it did not say what was "broken" nor "fixed", but broke IsaMakefile dependencies;