bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32662
handling of definitions
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32661
experimenting to add some useful interface for definitions
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32660
added predicate compile preprocessing structure for definitional thms -- probably is replaced by hooking the theorem command differently
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32659
modified handling of side conditions in proof procedure of predicate compiler
haftmann [Wed, 23 Sep 2009 15:25:25 +0200] rev 32658
merged
haftmann [Wed, 23 Sep 2009 14:00:12 +0200] rev 32657
Code_Eval(uation)
blanchet [Wed, 23 Sep 2009 13:48:16 +0200] rev 32656
merged
blanchet [Wed, 23 Sep 2009 13:47:08 +0200] rev 32655
Added "nitpick_const_simp" tags to lazy list theories.
(Will be useful once Nitpick is integrated in Isabelle.)
krauss [Wed, 23 Sep 2009 13:48:35 +0200] rev 32654
atbroy101 is long dead, use atbroy99; comment out broken SML test invocation
haftmann [Wed, 23 Sep 2009 13:42:53 +0200] rev 32653
merged
haftmann [Wed, 23 Sep 2009 12:03:47 +0200] rev 32652
stripped legacy ML bindings
hoelzl [Wed, 23 Sep 2009 13:31:38 +0200] rev 32651
Undo errornous commit of Statespace change
hoelzl [Wed, 23 Sep 2009 13:17:17 +0200] rev 32650
correct variable order in approximate-method
paulson [Wed, 23 Sep 2009 11:06:32 +0100] rev 32649
merged
paulson [Wed, 23 Sep 2009 11:05:28 +0100] rev 32648
Correct chasing of type variable instantiations during type unification.
The following theory should not raise exception TERM:
constdefs
somepredicate :: "(('b => 'b) => ('a => 'a))
=> 'a => 'b => bool"
"somepredicate upd v x == True"
lemma somepredicate_idI:
"somepredicate id (f v) v"
by (simp add: somepredicate_def)
lemma somepredicate_triv:
"somepredicate upd v x ==> somepredicate upd v x"
by assumption
lemmas somepredicate_triv [OF somepredicate_idI]
lemmas st' = somepredicate_triv[where v="h :: nat => bool"]
lemmas st2 = st'[OF somepredicate_idI]
haftmann [Wed, 23 Sep 2009 11:33:52 +0200] rev 32647
hide newly introduced constants
Philipp Meyer [Tue, 22 Sep 2009 11:26:46 +0200] rev 32646
used standard fold function and type aliases
Philipp Meyer [Mon, 21 Sep 2009 15:05:26 +0200] rev 32645
sos method generates and uses proof certificates
wenzelm [Tue, 22 Sep 2009 20:25:31 +0200] rev 32644
full reserve of worker threads -- for improved CPU utilization;
haftmann [Tue, 22 Sep 2009 15:38:12 +0200] rev 32643
merged
haftmann [Tue, 22 Sep 2009 15:36:55 +0200] rev 32642
be more cautious wrt. simp rules: inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp rules by default any longer
krauss [Tue, 22 Sep 2009 15:12:45 +0200] rev 32641
tail -n 20: more helpful output if make fails
haftmann [Tue, 22 Sep 2009 08:58:08 +0200] rev 32640
corrected order of type variables in code equations; more precise certificate for cases
Christian Urban <urbanc@in.tum.de> [Mon, 21 Sep 2009 16:16:16 +0200] rev 32639
merged
Christian Urban <urbanc@in.tum.de> [Mon, 21 Sep 2009 15:02:23 +0200] rev 32638
tuned some proofs
haftmann [Mon, 21 Sep 2009 16:11:36 +0200] rev 32637
merged
haftmann [Mon, 21 Sep 2009 16:01:38 +0200] rev 32636
added session theory for Bali and Nominal_Examples
haftmann [Mon, 21 Sep 2009 16:01:30 +0200] rev 32635
added session theory for Nominal_Examples
haftmann [Mon, 21 Sep 2009 16:00:53 +0200] rev 32634
added session theory for Bali
haftmann [Mon, 21 Sep 2009 16:00:34 +0200] rev 32633
adjusted to new Number Theory scenario