wenzelm [Fri, 13 Jan 2006 01:13:06 +0100] rev 18668
uniform handling of fixes;
tuned;
wenzelm [Fri, 13 Jan 2006 01:13:05 +0100] rev 18667
tuned;
wenzelm [Fri, 13 Jan 2006 01:13:03 +0100] rev 18666
generic_setup: optional argument, defaults to Context.setup();
wenzelm [Fri, 13 Jan 2006 01:13:02 +0100] rev 18665
added map_theory, map_proof;
wenzelm [Fri, 13 Jan 2006 01:13:00 +0100] rev 18664
removed obsolete sign_of;
wenzelm [Fri, 13 Jan 2006 01:12:59 +0100] rev 18663
implicit setup, which admits exception_trace;
wenzelm [Fri, 13 Jan 2006 01:12:58 +0100] rev 18662
ProofContext.def_export;
urbanc [Wed, 11 Jan 2006 18:46:31 +0100] rev 18661
updated to new induction principle
urbanc [Wed, 11 Jan 2006 18:39:19 +0100] rev 18660
cahges to use the new induction-principle (now proved in
full glory)
urbanc [Wed, 11 Jan 2006 18:38:32 +0100] rev 18659
changes to make use of the new induction principle proved by
Stefan horay (hooraayyy)
berghofe [Wed, 11 Jan 2006 18:21:23 +0100] rev 18658
Implemented proof of (strong) induction rule.
berghofe [Wed, 11 Jan 2006 18:20:59 +0100] rev 18657
Added theorem at_finite_select.
urbanc [Wed, 11 Jan 2006 17:12:30 +0100] rev 18656
added lemmas perm_empty, perm_insert to do with
permutations on sets
urbanc [Wed, 11 Jan 2006 17:10:11 +0100] rev 18655
merged the silly lemmas into the eqvt proof of subtype
urbanc [Wed, 11 Jan 2006 17:07:57 +0100] rev 18654
tuned proofs
urbanc [Wed, 11 Jan 2006 14:00:11 +0100] rev 18653
tuned the eqvt-proof
urbanc [Wed, 11 Jan 2006 12:21:01 +0100] rev 18652
rolled back the last addition since these lemmas were already
in the simpset.
urbanc [Wed, 11 Jan 2006 12:14:25 +0100] rev 18651
added the thms-collection "pt_id" (collection of all pt_<ak>1 lemmas)
urbanc [Wed, 11 Jan 2006 12:11:53 +0100] rev 18650
tuned
paulson [Wed, 11 Jan 2006 11:00:26 +0100] rev 18649
tidied, and added missing thm divide_less_eq_1_neg
paulson [Wed, 11 Jan 2006 10:59:55 +0100] rev 18648
tidied, and giving theorems names
huffman [Wed, 11 Jan 2006 03:10:04 +0100] rev 18647
add transitivity rules
wenzelm [Wed, 11 Jan 2006 00:11:05 +0100] rev 18646
tuned;
wenzelm [Wed, 11 Jan 2006 00:11:02 +0100] rev 18645
updated;
wenzelm [Tue, 10 Jan 2006 19:36:59 +0100] rev 18644
tuned;
wenzelm [Tue, 10 Jan 2006 19:34:04 +0100] rev 18643
generic attributes;
wenzelm [Tue, 10 Jan 2006 19:33:42 +0100] rev 18642
* ML: generic context, data, attributes;
wenzelm [Tue, 10 Jan 2006 19:33:41 +0100] rev 18641
added context_of -- generic context;
wenzelm [Tue, 10 Jan 2006 19:33:39 +0100] rev 18640
generic attributes;
tuned;
wenzelm [Tue, 10 Jan 2006 19:33:38 +0100] rev 18639
print rules: generic context;
wenzelm [Tue, 10 Jan 2006 19:33:37 +0100] rev 18638
Specification.pretty_consts ctxt;
wenzelm [Tue, 10 Jan 2006 19:33:36 +0100] rev 18637
generic data and attributes;
tuned;
wenzelm [Tue, 10 Jan 2006 19:33:35 +0100] rev 18636
added rule, declaration;
support generic attributes: theory, context, generic, common, generic_attribute(_i);
added generic syntax;
basic attributes now generic;
tuned;
wenzelm [Tue, 10 Jan 2006 19:33:34 +0100] rev 18635
added generic syntax;
mk_attribute: generic;
wenzelm [Tue, 10 Jan 2006 19:33:33 +0100] rev 18634
tuned dependencies;
wenzelm [Tue, 10 Jan 2006 19:33:32 +0100] rev 18633
added declaration_attribute;
wenzelm [Tue, 10 Jan 2006 19:33:31 +0100] rev 18632
support for generic contexts with data;
wenzelm [Tue, 10 Jan 2006 19:33:30 +0100] rev 18631
fix_tac: no warning;
wenzelm [Tue, 10 Jan 2006 19:33:29 +0100] rev 18630
generic attributes;
added low-level modifiers from Pure/context_rules.ML;
wenzelm [Tue, 10 Jan 2006 19:33:27 +0100] rev 18629
Attrib.rule;
urbanc [Tue, 10 Jan 2006 15:23:31 +0100] rev 18628
tuned
urbanc [Tue, 10 Jan 2006 02:32:10 +0100] rev 18627
added the lemmas supp_char and supp_string
urbanc [Mon, 09 Jan 2006 15:55:15 +0100] rev 18626
added some lemmas to the collection "abs_fresh"
the lemmas are of the form
finite (supp x) ==> (b # [a].x) = (b=a \/ b # x)
previously only lemmas of the form
(b # [a].x) = (b=a \/ b # x)
with the type-constraint that x is finitely supported
were included.
paulson [Mon, 09 Jan 2006 13:29:08 +0100] rev 18625
_E suffix for compatibility with AddIffs
paulson [Mon, 09 Jan 2006 13:28:34 +0100] rev 18624
tidied
paulson [Mon, 09 Jan 2006 13:28:06 +0100] rev 18623
simplified the special-case simprules
paulson [Mon, 09 Jan 2006 13:27:44 +0100] rev 18622
theorems need names
urbanc [Mon, 09 Jan 2006 00:05:10 +0100] rev 18621
commented the transitivity and narrowing proof
wenzelm [Sat, 07 Jan 2006 23:28:01 +0100] rev 18620
Theory specifications --- with type-inference, but no internal polymorphism.
wenzelm [Sat, 07 Jan 2006 23:28:00 +0100] rev 18619
added infer_type, declared_type;
wenzelm [Sat, 07 Jan 2006 23:27:59 +0100] rev 18618
added param, spec, named_spec;
wenzelm [Sat, 07 Jan 2006 23:27:58 +0100] rev 18617
added init;
tuned signature;
wenzelm [Sat, 07 Jan 2006 23:27:56 +0100] rev 18616
added 'axiomatization';
wenzelm [Sat, 07 Jan 2006 23:27:55 +0100] rev 18615
Specification.pretty_consts;
wenzelm [Sat, 07 Jan 2006 23:27:53 +0100] rev 18614
gen_names: preserve empty names;
wenzelm [Sat, 07 Jan 2006 23:27:52 +0100] rev 18613
added Isar/specification.ML;
wenzelm [Sat, 07 Jan 2006 23:27:51 +0100] rev 18612
updated;
urbanc [Sat, 07 Jan 2006 13:50:38 +0100] rev 18611
another change for the new induct-method
wenzelm [Sat, 07 Jan 2006 12:28:25 +0100] rev 18610
RuleCases.make_nested;
wenzelm [Sat, 07 Jan 2006 12:26:35 +0100] rev 18609
support nested cases;
tuned apply_case;