Sat, 21 May 2011 00:00:14 +0200 misc tuning and update;
wenzelm [Sat, 21 May 2011 00:00:14 +0200] rev 42899
misc tuning and update;
Fri, 20 May 2011 23:59:46 +0200 updated versions;
wenzelm [Fri, 20 May 2011 23:59:46 +0200] rev 42898
updated versions;
Fri, 20 May 2011 20:44:03 +0200 added Isabelle_Process.is_active;
wenzelm [Fri, 20 May 2011 20:44:03 +0200] rev 42897
added Isabelle_Process.is_active; tuned signature;
Fri, 20 May 2011 18:12:12 +0200 update example
blanchet [Fri, 20 May 2011 18:12:12 +0200] rev 42896
update example
Fri, 20 May 2011 18:01:46 +0200 name tuning
blanchet [Fri, 20 May 2011 18:01:46 +0200] rev 42895
name tuning
Fri, 20 May 2011 17:16:13 +0200 further improvements to "poly_{preds,tags}_{bang,query}" -- better solution to the combinator problem + make sure type assumptions can be discharged
blanchet [Fri, 20 May 2011 17:16:13 +0200] rev 42894
further improvements to "poly_{preds,tags}_{bang,query}" -- better solution to the combinator problem + make sure type assumptions can be discharged
Fri, 20 May 2011 17:16:13 +0200 prevent unsound combinator proofs in partially typed polymorphic type systems
blanchet [Fri, 20 May 2011 17:16:13 +0200] rev 42893
prevent unsound combinator proofs in partially typed polymorphic type systems
Fri, 20 May 2011 16:23:03 +0200 add lemma prob_finite_product
hoelzl [Fri, 20 May 2011 16:23:03 +0200] rev 42892
add lemma prob_finite_product
Fri, 20 May 2011 16:22:24 +0200 simp rules for empty intervals on dense linear order
hoelzl [Fri, 20 May 2011 16:22:24 +0200] rev 42891
simp rules for empty intervals on dense linear order
Fri, 20 May 2011 14:12:59 +0200 merged
wenzelm [Fri, 20 May 2011 14:12:59 +0200] rev 42890
merged
Fri, 20 May 2011 12:59:33 +0200 exercise more type systems (but only sound or quasi-sound ones)
blanchet [Fri, 20 May 2011 12:59:33 +0200] rev 42889
exercise more type systems (but only sound or quasi-sound ones)
Fri, 20 May 2011 12:47:59 +0200 added see also
blanchet [Fri, 20 May 2011 12:47:59 +0200] rev 42888
added see also
Fri, 20 May 2011 12:47:59 +0200 document new type system and soundness properties of the different systems
blanchet [Fri, 20 May 2011 12:47:59 +0200] rev 42887
document new type system and soundness properties of the different systems
Fri, 20 May 2011 12:47:59 +0200 improved "poly_preds_{bang,query}" by picking up good witnesses for the possible infinity of common type classes and ensuring that "?'a::type" doesn't ruin everything
blanchet [Fri, 20 May 2011 12:47:59 +0200] rev 42886
improved "poly_preds_{bang,query}" by picking up good witnesses for the possible infinity of common type classes and ensuring that "?'a::type" doesn't ruin everything
Fri, 20 May 2011 12:47:59 +0200 reintroduced type encodings "poly_preds_{bang,query}", but this time being more liberal about type variables of known safe sorts
blanchet [Fri, 20 May 2011 12:47:59 +0200] rev 42885
reintroduced type encodings "poly_preds_{bang,query}", but this time being more liberal about type variables of known safe sorts
Fri, 20 May 2011 12:47:59 +0200 more doc fiddling
blanchet [Fri, 20 May 2011 12:47:59 +0200] rev 42884
more doc fiddling
Fri, 20 May 2011 12:47:59 +0200 more FAQs
blanchet [Fri, 20 May 2011 12:47:59 +0200] rev 42883
more FAQs
Fri, 20 May 2011 12:47:59 +0200 make sure the Vampire incomplete proof detection code kicks in
blanchet [Fri, 20 May 2011 12:47:59 +0200] rev 42882
make sure the Vampire incomplete proof detection code kicks in
Fri, 20 May 2011 12:47:59 +0200 automatically use "metisFT" when typed helpers are necessary
blanchet [Fri, 20 May 2011 12:47:59 +0200] rev 42881
automatically use "metisFT" when typed helpers are necessary
Fri, 20 May 2011 12:47:58 +0200 tuning
blanchet [Fri, 20 May 2011 12:47:58 +0200] rev 42880
tuning
Fri, 20 May 2011 12:47:58 +0200 generate useful information for type axioms
blanchet [Fri, 20 May 2011 12:47:58 +0200] rev 42879
generate useful information for type axioms
Fri, 20 May 2011 12:47:58 +0200 slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous
blanchet [Fri, 20 May 2011 12:47:58 +0200] rev 42878
slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous
Fri, 20 May 2011 12:47:58 +0200 updated FAQ
blanchet [Fri, 20 May 2011 12:47:58 +0200] rev 42877
updated FAQ
Fri, 20 May 2011 12:47:58 +0200 more informative message when Sledgehammer finds an unsound proof
blanchet [Fri, 20 May 2011 12:47:58 +0200] rev 42876
more informative message when Sledgehammer finds an unsound proof
Fri, 20 May 2011 12:35:44 +0200 tuned proofs
haftmann [Fri, 20 May 2011 12:35:44 +0200] rev 42875
tuned proofs
Fri, 20 May 2011 12:09:54 +0200 NEWS
haftmann [Fri, 20 May 2011 12:09:54 +0200] rev 42874
NEWS
Fri, 20 May 2011 12:07:17 +0200 point-free characterization of operations on finite sets
haftmann [Fri, 20 May 2011 12:07:17 +0200] rev 42873
point-free characterization of operations on finite sets
Fri, 20 May 2011 11:44:34 +0200 merged
haftmann [Fri, 20 May 2011 11:44:34 +0200] rev 42872
merged
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -28 +28 +50 +100 +300 +1000 +3000 +10000 +30000 tip