Mon, 21 Sep 2009 15:35:15 +0200 tuned proofs
haftmann [Mon, 21 Sep 2009 15:35:15 +0200] rev 32693
tuned proofs
Mon, 21 Sep 2009 15:35:14 +0200 tuned header
haftmann [Mon, 21 Sep 2009 15:35:14 +0200] rev 32692
tuned header
Mon, 21 Sep 2009 15:35:14 +0200 added note on simp rules
haftmann [Mon, 21 Sep 2009 15:35:14 +0200] rev 32691
added note on simp rules
Mon, 21 Sep 2009 14:23:12 +0200 merged
haftmann [Mon, 21 Sep 2009 14:23:12 +0200] rev 32690
merged
Mon, 21 Sep 2009 14:23:04 +0200 tuned proof; tuned headers
haftmann [Mon, 21 Sep 2009 14:23:04 +0200] rev 32689
tuned proof; tuned headers
Mon, 21 Sep 2009 12:24:21 +0200 merged
haftmann [Mon, 21 Sep 2009 12:24:21 +0200] rev 32688
merged
Mon, 21 Sep 2009 12:23:52 +0200 tuned proofs; be more cautios wrt. default simp rules
haftmann [Mon, 21 Sep 2009 12:23:52 +0200] rev 32687
tuned proofs; be more cautios wrt. default simp rules
Mon, 21 Sep 2009 11:01:49 +0200 merged
haftmann [Mon, 21 Sep 2009 11:01:49 +0200] rev 32686
merged
Mon, 21 Sep 2009 11:01:39 +0200 tuned proofs
haftmann [Mon, 21 Sep 2009 11:01:39 +0200] rev 32685
tuned proofs
Sat, 19 Sep 2009 07:38:11 +0200 merged
haftmann [Sat, 19 Sep 2009 07:38:11 +0200] rev 32684
merged
Sat, 19 Sep 2009 07:38:03 +0200 inter and union are mere abbreviations for inf and sup
haftmann [Sat, 19 Sep 2009 07:38:03 +0200] rev 32683
inter and union are mere abbreviations for inf and sup
Thu, 24 Sep 2009 19:14:18 +0200 merged
haftmann [Thu, 24 Sep 2009 19:14:18 +0200] rev 32682
merged
Thu, 24 Sep 2009 18:29:29 +0200 lemma relating fold1 and foldl; code_unfold rules for Inf_fin, Sup_fin, Min, Max, Inf, Sup
haftmann [Thu, 24 Sep 2009 18:29:29 +0200] rev 32681
lemma relating fold1 and foldl; code_unfold rules for Inf_fin, Sup_fin, Min, Max, Inf, Sup
Thu, 24 Sep 2009 18:29:29 +0200 subsumed by more general setup in List.thy
haftmann [Thu, 24 Sep 2009 18:29:29 +0200] rev 32680
subsumed by more general setup in List.thy
Thu, 24 Sep 2009 18:29:29 +0200 idempotency case for fold1
haftmann [Thu, 24 Sep 2009 18:29:29 +0200] rev 32679
idempotency case for fold1
Thu, 24 Sep 2009 18:29:28 +0200 added dual for complete lattice
haftmann [Thu, 24 Sep 2009 18:29:28 +0200] rev 32678
added dual for complete lattice
Thu, 24 Sep 2009 17:26:05 +0200 merged
nipkow [Thu, 24 Sep 2009 17:26:05 +0200] rev 32677
merged
Thu, 24 Sep 2009 17:25:42 +0200 record how many "proof"s are solved by s/h
nipkow [Thu, 24 Sep 2009 17:25:42 +0200] rev 32676
record how many "proof"s are solved by s/h
Thu, 24 Sep 2009 15:00:17 +0200 added quotes for filenames;
boehmes [Thu, 24 Sep 2009 15:00:17 +0200] rev 32675
added quotes for filenames; truncated remaining time (no floats supported by ulimit)
Thu, 24 Sep 2009 08:28:27 +0200 merged; adopted to changes from Code_Evaluation in the predicate compiler
bulwahn [Thu, 24 Sep 2009 08:28:27 +0200] rev 32674
merged; adopted to changes from Code_Evaluation in the predicate compiler
Wed, 23 Sep 2009 16:20:13 +0200 replaced sorry by oops; removed old debug functions in predicate compiler
bulwahn [Wed, 23 Sep 2009 16:20:13 +0200] rev 32673
replaced sorry by oops; removed old debug functions in predicate compiler
Wed, 23 Sep 2009 16:20:13 +0200 added first version of quickcheck based on the predicate compiler; added a few quickcheck examples
bulwahn [Wed, 23 Sep 2009 16:20:13 +0200] rev 32672
added first version of quickcheck based on the predicate compiler; added a few quickcheck examples
Wed, 23 Sep 2009 16:20:12 +0200 adapted configuration for DatatypeCase.make_case
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32671
adapted configuration for DatatypeCase.make_case
Wed, 23 Sep 2009 16:20:12 +0200 added a new example for the predicate compiler
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32670
added a new example for the predicate compiler
Wed, 23 Sep 2009 16:20:12 +0200 added context free grammar example; removed dead code; adapted to work without quick and dirty mode; fixed typo
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32669
added context free grammar example; removed dead code; adapted to work without quick and dirty mode; fixed typo
Wed, 23 Sep 2009 16:20:12 +0200 added first prototype of the extended predicate compiler
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32668
added first prototype of the extended predicate compiler
Wed, 23 Sep 2009 16:20:12 +0200 moved predicate compiler to Tools
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32667
moved predicate compiler to Tools
Wed, 23 Sep 2009 16:20:12 +0200 removed generation of strange tuple modes in predicate compiler
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32666
removed generation of strange tuple modes in predicate compiler
Wed, 23 Sep 2009 16:20:12 +0200 extending predicate compiler and proof procedure to support tuples; testing predicate wirh HOL-MicroJava semantics
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32665
extending predicate compiler and proof procedure to support tuples; testing predicate wirh HOL-MicroJava semantics
Wed, 23 Sep 2009 16:20:12 +0200 modified predicate compiler further to support tuples
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32664
modified predicate compiler further to support tuples
Wed, 23 Sep 2009 16:20:12 +0200 changed preprocessing due to problems with LightweightJava; added transfer of thereoms; changed the type of mode to support tuples in the predicate compiler
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32663
changed preprocessing due to problems with LightweightJava; added transfer of thereoms; changed the type of mode to support tuples in the predicate compiler
Wed, 23 Sep 2009 16:20:12 +0200 handling of definitions
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32662
handling of definitions
Wed, 23 Sep 2009 16:20:12 +0200 experimenting to add some useful interface for definitions
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32661
experimenting to add some useful interface for definitions
Wed, 23 Sep 2009 16:20:12 +0200 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 32660
added predicate compile preprocessing structure for definitional thms -- probably is replaced by hooking the theorem command differently
Wed, 23 Sep 2009 16:20:12 +0200 modified handling of side conditions in proof procedure of predicate compiler
bulwahn [Wed, 23 Sep 2009 16:20:12 +0200] rev 32659
modified handling of side conditions in proof procedure of predicate compiler
Wed, 23 Sep 2009 15:25:25 +0200 merged
haftmann [Wed, 23 Sep 2009 15:25:25 +0200] rev 32658
merged
Wed, 23 Sep 2009 14:00:12 +0200 Code_Eval(uation)
haftmann [Wed, 23 Sep 2009 14:00:12 +0200] rev 32657
Code_Eval(uation)
Wed, 23 Sep 2009 13:48:16 +0200 merged
blanchet [Wed, 23 Sep 2009 13:48:16 +0200] rev 32656
merged
Wed, 23 Sep 2009 13:47:08 +0200 Added "nitpick_const_simp" tags to lazy list theories.
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.)
Wed, 23 Sep 2009 13:48:35 +0200 atbroy101 is long dead, use atbroy99; comment out broken SML test invocation
krauss [Wed, 23 Sep 2009 13:48:35 +0200] rev 32654
atbroy101 is long dead, use atbroy99; comment out broken SML test invocation
Wed, 23 Sep 2009 13:42:53 +0200 merged
haftmann [Wed, 23 Sep 2009 13:42:53 +0200] rev 32653
merged
Wed, 23 Sep 2009 12:03:47 +0200 stripped legacy ML bindings
haftmann [Wed, 23 Sep 2009 12:03:47 +0200] rev 32652
stripped legacy ML bindings
Wed, 23 Sep 2009 13:31:38 +0200 Undo errornous commit of Statespace change
hoelzl [Wed, 23 Sep 2009 13:31:38 +0200] rev 32651
Undo errornous commit of Statespace change
Wed, 23 Sep 2009 13:17:17 +0200 correct variable order in approximate-method
hoelzl [Wed, 23 Sep 2009 13:17:17 +0200] rev 32650
correct variable order in approximate-method
Wed, 23 Sep 2009 11:06:32 +0100 merged
paulson [Wed, 23 Sep 2009 11:06:32 +0100] rev 32649
merged
Wed, 23 Sep 2009 11:05:28 +0100 Correct chasing of type variable instantiations during type unification.
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]
Wed, 23 Sep 2009 11:33:52 +0200 hide newly introduced constants
haftmann [Wed, 23 Sep 2009 11:33:52 +0200] rev 32647
hide newly introduced constants
Tue, 22 Sep 2009 11:26:46 +0200 used standard fold function and type aliases
Philipp Meyer [Tue, 22 Sep 2009 11:26:46 +0200] rev 32646
used standard fold function and type aliases
Mon, 21 Sep 2009 15:05:26 +0200 sos method generates and uses proof certificates
Philipp Meyer [Mon, 21 Sep 2009 15:05:26 +0200] rev 32645
sos method generates and uses proof certificates
Tue, 22 Sep 2009 20:25:31 +0200 full reserve of worker threads -- for improved CPU utilization;
wenzelm [Tue, 22 Sep 2009 20:25:31 +0200] rev 32644
full reserve of worker threads -- for improved CPU utilization;
Tue, 22 Sep 2009 15:38:12 +0200 merged
haftmann [Tue, 22 Sep 2009 15:38:12 +0200] rev 32643
merged
Tue, 22 Sep 2009 15:36:55 +0200 be more cautious wrt. simp rules: inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp rules by default any longer
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
Tue, 22 Sep 2009 15:12:45 +0200 tail -n 20: more helpful output if make fails
krauss [Tue, 22 Sep 2009 15:12:45 +0200] rev 32641
tail -n 20: more helpful output if make fails
Tue, 22 Sep 2009 08:58:08 +0200 corrected order of type variables in code equations; more precise certificate for cases
haftmann [Tue, 22 Sep 2009 08:58:08 +0200] rev 32640
corrected order of type variables in code equations; more precise certificate for cases
Mon, 21 Sep 2009 16:16:16 +0200 merged
Christian Urban <urbanc@in.tum.de> [Mon, 21 Sep 2009 16:16:16 +0200] rev 32639
merged
Mon, 21 Sep 2009 15:02:23 +0200 tuned some proofs
Christian Urban <urbanc@in.tum.de> [Mon, 21 Sep 2009 15:02:23 +0200] rev 32638
tuned some proofs
(0) -30000 -10000 -3000 -1000 -300 -100 -56 +56 +100 +300 +1000 +3000 +10000 +30000 tip