Wed, 18 Mar 2009 21:55:38 +0100 wenzelm de-camelized Symbol_Pos;
Wed, 18 Mar 2009 20:03:01 +0100 wenzelm Library.merge/OrdList.union: optimize the important special case where the tables coincide -- NOTE: this changes both the operational behaviour and the result for non-standard eq/ord notion;
Wed, 18 Mar 2009 19:11:26 +0100 wenzelm reduced verbosity;
Wed, 18 Mar 2009 15:23:52 +0100 haftmann made SML/NJ happy
Wed, 18 Mar 2009 11:57:28 +0100 haftmann tuned interpunctation
Tue, 17 Mar 2009 19:53:57 +0100 wenzelm strip_abss: always strip abstractions as far as possible, without keeping alternatives (which appear to be redundant anyway, but cause significant slowdown since discrimination nets collapse abstractions);
Tue, 17 Mar 2009 19:06:04 +0100 wenzelm close/all_assm_tac: finish all subgoals from left to right (cf. Proof.goal_tac a28d83e903ce) -- NB: ALLGOALS/THEN_ALL_NEW operate from right to left;
Tue, 17 Mar 2009 16:55:21 +0100 wenzelm reverted abbreviations: improved performance via Item_Net.T;
Tue, 17 Mar 2009 15:35:27 +0100 wenzelm export match_rew -- useful for implementing "procs" for rewrite_term;
Tue, 17 Mar 2009 15:34:42 +0100 wenzelm tuned comment;
Tue, 17 Mar 2009 14:14:25 +0100 wenzelm merged
Mon, 16 Mar 2009 15:58:41 -0700 huffman document new additions to HOL/Library
Mon, 16 Mar 2009 15:10:59 -0700 huffman clean up proofs
Tue, 17 Mar 2009 14:12:43 +0100 wenzelm adapted to general Item_Net;
Tue, 17 Mar 2009 14:12:06 +0100 wenzelm turned structure NetRules into general Item_Net, which is loaded earlier;
Tue, 17 Mar 2009 14:09:20 +0100 wenzelm renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
Tue, 17 Mar 2009 13:33:21 +0100 wenzelm goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
Tue, 17 Mar 2009 12:10:42 +0100 wenzelm eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
Tue, 17 Mar 2009 12:09:43 +0100 wenzelm tuned aeconv: test plain aconv before expensive eta_contract;
Mon, 16 Mar 2009 23:52:30 +0100 wenzelm substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
Mon, 16 Mar 2009 23:39:44 +0100 wenzelm refined is_norm_hhf: reject beta-redexes (rules based on term nets or could_unify assume normal form), also potentially faster by avoiding expensive Envir.beta_eta_contract;
Mon, 16 Mar 2009 23:36:55 +0100 wenzelm provide Simplifier.norm_hhf(_protect) as regular simplifier operation;
Mon, 16 Mar 2009 19:40:03 +0100 wenzelm method parser: pass proper context;
Mon, 16 Mar 2009 18:24:39 +0100 wenzelm merged
Mon, 16 Mar 2009 18:24:30 +0100 wenzelm simplified method setup;
Mon, 16 Mar 2009 17:51:24 +0100 wenzelm updated generated file;
Mon, 16 Mar 2009 17:51:07 +0100 wenzelm simplifief 'method_setup' command;
Mon, 16 Mar 2009 17:48:02 +0100 wenzelm spelling;
Mon, 16 Mar 2009 17:47:26 +0100 wenzelm export method parser;
Mon, 16 Mar 2009 17:46:49 +0100 wenzelm adapted 'method_setup' command to Method.setup;
Mon, 16 Mar 2009 17:46:11 +0100 wenzelm tuned signature;
Mon, 16 Mar 2009 14:26:30 +0100 immler have remote script interrupted like the other provers
Sun, 15 Mar 2009 20:25:58 +0100 wenzelm simplified method setup;
Sun, 15 Mar 2009 20:19:14 +0100 wenzelm export section, sections;
Sun, 15 Mar 2009 16:59:17 +0100 wenzelm merged
Sat, 14 Mar 2009 17:52:53 +0100 immler updated NEWS
Sat, 14 Mar 2009 16:50:25 +0100 immler use goal instead of Proof State
Sat, 14 Mar 2009 16:46:23 +0100 immler split relevance-filter and writing of problem-files;
Sat, 14 Mar 2009 15:45:45 +0100 immler show certain errors to the user
Sat, 14 Mar 2009 15:15:44 +0100 immler removed connection check;
Sun, 15 Mar 2009 16:02:22 +0100 wenzelm merged
Sat, 14 Mar 2009 12:51:13 +0100 haftmann merged
Sat, 14 Mar 2009 12:50:29 +0100 haftmann reverted to old version of Set.thy -- strange effects have to be traced first
Sun, 15 Mar 2009 15:59:45 +0100 wenzelm simplified attribute and method setup;
Sun, 15 Mar 2009 15:59:44 +0100 wenzelm simplified attribute setup;
Sun, 15 Mar 2009 15:59:44 +0100 wenzelm simplified attribute setup;
Sun, 15 Mar 2009 15:59:44 +0100 wenzelm updated generated files;
Sun, 15 Mar 2009 15:59:43 +0100 wenzelm added 'attribute_setup' command;
Sun, 15 Mar 2009 15:59:43 +0100 wenzelm added setup and attribute_setup -- expect plain parser instead of syntax function;
Sun, 15 Mar 2009 15:59:43 +0100 wenzelm ML_Syntax.make_binding;
Sun, 15 Mar 2009 15:59:42 +0100 wenzelm added make_binding;
Sat, 14 Mar 2009 00:13:50 +0100 wenzelm removed obsolete no_base_names naming policy;
Fri, 13 Mar 2009 23:56:07 +0100 wenzelm merged
Fri, 13 Mar 2009 19:18:07 +0100 haftmann merged
Fri, 13 Mar 2009 19:17:58 +0100 haftmann coherent binding policy with primitive target operations
Fri, 13 Mar 2009 19:17:57 +0100 haftmann moved some generic nonsense to arith_data.ML
Fri, 13 Mar 2009 19:17:57 +0100 haftmann tuned ML code
Fri, 13 Mar 2009 10:14:47 -0700 huffman remove legacy ML bindings
Fri, 13 Mar 2009 23:50:05 +0100 wenzelm simplified method setup;
Fri, 13 Mar 2009 23:32:40 +0100 wenzelm simplified goal_spec: default to first goal;
Fri, 13 Mar 2009 21:25:15 +0100 wenzelm eliminated type Args.T;
Fri, 13 Mar 2009 21:24:21 +0100 wenzelm added simplified setup;
Fri, 13 Mar 2009 21:22:45 +0100 wenzelm pervasive types 'a parser and 'a context_parser;
Fri, 13 Mar 2009 19:58:26 +0100 wenzelm unified type Proof.method and pervasive METHOD combinators;
Fri, 13 Mar 2009 19:53:09 +0100 wenzelm more regular method setup via SIMPLE_METHOD;
Fri, 13 Mar 2009 19:10:46 +0100 wenzelm tuned Method exports: non-pervasive type method (cf. Proof.method), pervasive METHOD combinators;
Fri, 13 Mar 2009 15:52:23 +0100 wenzelm merged
Fri, 13 Mar 2009 07:35:18 -0700 huffman fix typed print translation for CARD('a)
Fri, 13 Mar 2009 07:30:47 -0700 huffman introduce new helper functions; clean up proofs
Fri, 13 Mar 2009 13:06:36 +0100 nipkow merged
Fri, 13 Mar 2009 13:06:00 +0100 nipkow added comment
Fri, 13 Mar 2009 12:32:29 +0100 nipkow hiding numeric coercions in LaTeX
Fri, 13 Mar 2009 12:29:38 +0100 haftmann merged
Fri, 13 Mar 2009 08:16:18 +0100 haftmann dropped spurious `quote` tags
Thu, 12 Mar 2009 23:01:25 +0100 haftmann merged
Thu, 12 Mar 2009 18:01:27 +0100 haftmann tuned
Thu, 12 Mar 2009 18:01:26 +0100 haftmann strippd Id
Thu, 12 Mar 2009 18:01:26 +0100 haftmann vague cleanup in arith proof tools setup: deleted dead code, more proper structures, clearer arrangement
Thu, 12 Mar 2009 18:01:25 +0100 haftmann tuned
Thu, 12 Mar 2009 18:01:25 +0100 haftmann consider exit status of code generation direcitve
Fri, 13 Mar 2009 15:50:06 +0100 wenzelm provide regular ML interfaces for Isar source language elements;
Fri, 13 Mar 2009 15:50:05 +0100 wenzelm get data from plain Proof.context;
Thu, 12 Mar 2009 23:12:53 +0100 wenzelm more user aliases;
Thu, 12 Mar 2009 22:16:25 +0100 wenzelm merged
Thu, 12 Mar 2009 09:27:23 -0700 huffman remove trailing spaces
Thu, 12 Mar 2009 08:57:03 -0700 huffman remove trailing spaces
Thu, 12 Mar 2009 21:55:02 +0100 wenzelm simplified preparation and outer parsing of specification;
Thu, 12 Mar 2009 21:51:02 +0100 wenzelm simplified preparation and outer parsing of specification;
Thu, 12 Mar 2009 21:47:36 +0100 wenzelm removed legacy_infer_term, legacy_infer_prop;
Thu, 12 Mar 2009 21:44:01 +0100 wenzelm old name_spec for 'axioms' and 'defs' (from spec_parse.ML);
Thu, 12 Mar 2009 21:42:02 +0100 wenzelm added legacy type inference (from fixrec_package.ML);
Thu, 12 Mar 2009 21:37:18 +0100 wenzelm simplified versions check_spec, read_spec, check_free_spec, read_free_spec: operate on list of singleton statements;
Thu, 12 Mar 2009 21:33:06 +0100 wenzelm removed old named_spec, spec_name, spec_opt_name;
Thu, 12 Mar 2009 21:29:04 +0100 wenzelm keep dead code fresh;
Thu, 12 Mar 2009 16:13:14 +0100 wenzelm tuned;
Thu, 12 Mar 2009 15:56:32 +0100 wenzelm merged
(0) -30000 -10000 -3000 -1000 -300 -100 -96 +96 +100 +300 +1000 +3000 +10000 +30000 tip