Mon, 29 Mar 2010 17:30:54 +0200 bulwahn generalized alternative functions to alternative compilation to handle arithmetic functions better
Mon, 29 Mar 2010 17:30:54 +0200 bulwahn correcting alternative functions with tuples
Mon, 29 Mar 2010 17:30:53 +0200 bulwahn no specialisation for patterns with only tuples in the predicate compiler
Mon, 29 Mar 2010 17:30:53 +0200 bulwahn adding registration of functions in the function flattening
Mon, 29 Mar 2010 17:30:53 +0200 bulwahn added book-keeping, registration and compilation with alternative functions for predicates in the predicate compiler
Mon, 29 Mar 2010 17:30:52 +0200 bulwahn adding specialisation examples of the predicate compiler
Mon, 29 Mar 2010 17:30:52 +0200 bulwahn adding specialisation of predicates to the predicate compiler
Mon, 29 Mar 2010 17:30:50 +0200 bulwahn returning an more understandable user error message in the values command
Mon, 29 Mar 2010 17:30:49 +0200 bulwahn adding Lazy_Sequences with explicit depth-bound
Mon, 29 Mar 2010 17:30:48 +0200 bulwahn removing fishing for split thm in the predicate compiler
Mon, 29 Mar 2010 17:30:46 +0200 bulwahn prefer recursive calls before others in the mode inference
Mon, 29 Mar 2010 17:30:45 +0200 bulwahn added statistics to values command for random generation
Mon, 29 Mar 2010 17:30:43 +0200 bulwahn adopting Predicate_Compile_Quickcheck
Mon, 29 Mar 2010 17:30:43 +0200 bulwahn made quickcheck generic with respect to which compilation; added random compilation to quickcheck
Mon, 29 Mar 2010 17:30:41 +0200 bulwahn removed yieldn in Lazy_Sequence and put in the ML structure; corrects behaviour of values command
Mon, 29 Mar 2010 17:30:40 +0200 bulwahn adding a hook for experiments in the predicate compilation process
Mon, 29 Mar 2010 17:30:40 +0200 bulwahn removing simple equalities in introduction rules in the predicate compiler
Mon, 29 Mar 2010 17:30:39 +0200 bulwahn adopting Predicate_Compile
Mon, 29 Mar 2010 17:30:38 +0200 bulwahn adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
Mon, 29 Mar 2010 17:30:36 +0200 bulwahn generalizing the compilation process of the predicate compiler
Mon, 29 Mar 2010 17:30:36 +0200 bulwahn added new compilation to predicate_compiler
Mon, 29 Mar 2010 17:30:34 +0200 bulwahn adding new depth-limited and new random monad for the predicate compiler
Tue, 30 Mar 2010 00:47:52 +0200 wenzelm recovered StringBuilder functionality after subtle change of + and ++ in Scala 2.8.0 Beta 1;
Tue, 30 Mar 2010 00:13:27 +0200 wenzelm adapted to Scala 2.8.0 Beta 1;
Tue, 30 Mar 2010 00:12:42 +0200 wenzelm auto update by Netbeans 6.8;
Tue, 30 Mar 2010 00:11:41 +0200 wenzelm adapted to Netbeans 6.8 and Scala for Netbeans 6.8v1.1;
Mon, 29 Mar 2010 22:55:57 +0200 wenzelm replaced some deprecated methods;
Mon, 29 Mar 2010 22:43:56 +0200 wenzelm adapted to Scala 2.8.0 Beta1 -- with notable changes to scala.collection;
Mon, 29 Mar 2010 01:07:01 -0700 huffman merged
Sun, 28 Mar 2010 12:50:38 -0700 huffman use lattice theorems to prove set theorems
Sun, 28 Mar 2010 12:49:14 -0700 huffman add/change some lemmas about lattices
Sun, 28 Mar 2010 10:34:02 -0700 huffman cleaned up some proofs
Mon, 29 Mar 2010 09:06:34 +0200 boehmes the configuration option 'trace_simp' now uses the reference of the ProofGeneral settings menu as (dynamic) default value
Sun, 28 Mar 2010 19:34:08 +0200 wenzelm merged
Sun, 28 Mar 2010 19:20:52 +0200 wenzelm implicit checkpoint in Local_Theory.theory as well -- no longer export Local_Theory.checkpoint;
Sun, 28 Mar 2010 18:39:27 +0200 blanchet make SML/NJ happy
Sun, 28 Mar 2010 17:43:09 +0200 wenzelm pass raw Context.generic, to avoid wasteful Context.proof_of -- Config.get_thy is often used in performance critical spots like unify.ML;
Sun, 28 Mar 2010 16:59:06 +0200 wenzelm static defaults for configuration options;
Sun, 28 Mar 2010 16:13:29 +0200 wenzelm configuration options admit dynamic default values;
Sun, 28 Mar 2010 16:29:51 +0200 wenzelm tuned;
Sun, 28 Mar 2010 15:38:07 +0200 wenzelm do not export Attrib.register_config, to make it harder to use low-level Config.declare after the bootstrap phase;
Sun, 28 Mar 2010 15:13:19 +0200 wenzelm use regular Attrib.config instead of low-level Config.declare/Attrib.register_config;
Sat, 27 Mar 2010 21:46:10 +0100 wenzelm merged
Sat, 27 Mar 2010 21:34:28 +0100 boehmes re-introduce reference to control simplifier tracing (needed for ProofGeneral settings menu) (cf. 12bb31230550)
Sat, 27 Mar 2010 21:38:38 +0100 wenzelm Typedef.info: separate global and local part, only the latter is transformed by morphisms;
Sat, 27 Mar 2010 18:43:11 +0100 nipkow merged
Sat, 27 Mar 2010 18:42:27 +0100 nipkow added reference to Trace Simp Depth.
Sat, 27 Mar 2010 18:12:02 +0100 wenzelm merged
Sat, 27 Mar 2010 14:48:46 +0100 Cezary Kaliszyk Automated lifting can be restricted to specific quotient types
Sat, 27 Mar 2010 18:07:21 +0100 wenzelm moved Primitive_Defs.mk_defpair to OldGoals.mk_defpair;
Sat, 27 Mar 2010 17:36:32 +0100 wenzelm disallow premises in primitive Theory.add_def -- handle in Thm.add_def;
Sat, 27 Mar 2010 16:01:45 +0100 wenzelm disallow sort constraints in primitive Theory.add_axiom/add_def -- handled in Thm.add_axiom/add_def;
Sat, 27 Mar 2010 15:47:57 +0100 wenzelm added Term.fold_atyps_sorts convenience;
Sat, 27 Mar 2010 15:20:31 +0100 wenzelm moved Drule.forall_intr_frees to Thm.forall_intr_frees (in more_thm.ML, which is loaded before pure_thy.ML);
Sat, 27 Mar 2010 14:10:37 +0100 wenzelm eliminated old-style Theory.add_defs_i;
Sat, 27 Mar 2010 02:10:00 +0100 boehmes slightly more general simproc (avoids errors of linarith)
Sat, 27 Mar 2010 00:08:39 +0100 boehmes merged
Fri, 26 Mar 2010 23:58:27 +0100 boehmes updated SMT certificates
Fri, 26 Mar 2010 23:57:35 +0100 boehmes made renamings stable under name changes in the original problem (uninterpreted names are irrelevant to the SMT solver, and caching of SMT certificates relies on irrelevancy of renamings)
Fri, 26 Mar 2010 23:46:22 +0100 boehmes replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip