Tue, 16 Oct 2012 17:33:08 +0200 a few notations changed in HOL/BNF/Examples/Derivation_Trees
popescua [Tue, 16 Oct 2012 17:33:08 +0200] rev 49878
a few notations changed in HOL/BNF/Examples/Derivation_Trees
Tue, 16 Oct 2012 17:08:20 +0200 ported HOL/BNF/Examples/Derivation_Trees to the latest status of the codatatype package
popescua [Tue, 16 Oct 2012 17:08:20 +0200] rev 49877
ported HOL/BNF/Examples/Derivation_Trees to the latest status of the codatatype package
Tue, 16 Oct 2012 13:57:08 +0200 adding test cases for f x y : S patterns in set_comprehension_pointfree simproc
bulwahn [Tue, 16 Oct 2012 13:57:08 +0200] rev 49876
adding test cases for f x y : S patterns in set_comprehension_pointfree simproc
Tue, 16 Oct 2012 13:18:13 +0200 tactic of set_comprehension_pointfree simproc handles f x y : S patterns with Set.vimage
bulwahn [Tue, 16 Oct 2012 13:18:13 +0200] rev 49875
tactic of set_comprehension_pointfree simproc handles f x y : S patterns with Set.vimage
Tue, 16 Oct 2012 13:18:12 +0200 term construction of set_comprehension_pointfree simproc handles f x y : S patterns with Set.vimage
bulwahn [Tue, 16 Oct 2012 13:18:12 +0200] rev 49874
term construction of set_comprehension_pointfree simproc handles f x y : S patterns with Set.vimage
Tue, 16 Oct 2012 13:18:10 +0200 extending preprocessing of simproc to rewrite subset inequality into membership of powerset
bulwahn [Tue, 16 Oct 2012 13:18:10 +0200] rev 49873
extending preprocessing of simproc to rewrite subset inequality into membership of powerset
(0) -30000 -10000 -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip