February 2008 - Generics

patch applied (generics): TestHigherOrder -> TestGMapQ1
by Alexey Rodriguez Yakushev 13 Feb '08

13 Feb '08

Wed Feb 13 05:08:32 PST 2008 Alexey Rodriguez <alexey(a)cs.uu.nl> * TestHigherOrder -> TestGMapQ1 ./comparison/TestHigherOrder1.exp -> ./comparison/TestGMapQ1.exp ./comparison/TestHigherOrder1.lhs -> ./comparison/TestGMapQ1.lhs ./comparison/TestHigherOrder2.exp -> ./comparison/TestGMapQ2.exp ./comparison/TestHigherOrder2.lhs -> ./comparison/TestGMapQ2.lhs M ./comparison/test.hs -1 +1

1 0

patch applied (generics): Universe extension tests and separate compilation test
by Alexey Rodriguez Yakushev 13 Feb '08

13 Feb '08

Wed Feb 13 04:54:18 PST 2008 Alexey Rodriguez <alexey(a)cs.uu.nl> * Universe extension tests and separate compilation test * Universe extension to datatype T is called TestGEqT. * The separate compilation test is called TestGEq. It is tested on the BinTree datatype, so it is assumed to be supported (i.e. universe extension to it is possible) by all approches. * Maybe it would be good to add a universe extension test for BinTree anyway. At the moment it is missing. ./comparison/TestGEq.exp -> ./comparison/TestGEqCompany.exp ./comparison/TestGEq.lhs -> ./comparison/TestGEqCompany.lhs ./comparison/TestGEqBTree.exp -> ./comparison/TestGEq.exp ./comparison/TestGEqBTree.lhs -> ./comparison/TestGEq.lhs M ./comparison/TestGEq.lhs -1 +2 M ./comparison/TestGEqCompany.lhs -2 +1 M ./comparison/TestGEqGRose.lhs -1 +4 M ./comparison/TestGEqNGRose.lhs +4 M ./comparison/test.hs -5 +5

1 0

patch applied (generics): Small edit on RepLib's crushRight
by Alexey Rodriguez Yakushev 12 Feb '08

12 Feb '08

Tue Feb 12 11:09:31 PST 2008 Alexey Rodriguez <alexey(a)cs.uu.nl> * Small edit on RepLib's crushRight M ./comparison/RepLib/CrushRight.lhs -3 +1

1 0

patch applied (generics): CrushRight working for RepLib, not very satisfactory though.
by Alexey Rodriguez Yakushev 12 Feb '08

12 Feb '08

Tue Feb 12 10:56:31 PST 2008 Alexey Rodriguez <alexey(a)cs.uu.nl> * CrushRight working for RepLib, not very satisfactory though. * crushRight is instantiated to perform operations on the |a| elements of |WTree a w|. So the type class approach from the paper does not work very well. It would mean a different typeclass per kind. The same would happen if you would want to obtain | (a->b) -> WTree a w -> WTree b w |. * Okay, so let's forget about type classes right? This is still painful. Let us see the problems: * The representation of lists, for example, is something like |R f [a]|, but in order to construct it, the function |rList1| needs a function |f a| and another |f [a]|. The former is sort of okay, you need to know how to process elements. The second is tricky, but needed in RepLib: it is used for extension. Normally you use typeclasses to simplify building the second. So now instantiating crushRight has become quite more difficult than in other approaches. * The second problem has to do with a more complex type expression, like [WTree a w], that is, a list of WTree's. Now, if you want to build a list rep, you must a pass a function that works on WTree's. This means that the representation of WTree's which builds a representation for them, must be converted to a function that only then can be passed to rList1, the builder of list representations. You can see that in function r2crsh. Needless to say this makes things more complicated than in other approaches. Solutions wanted! A ./comparison/RepLib/CrushRight.lhs R ./comparison/RepLib/Reduce.lhs

1 0

patch applied (generics): Further simplifications in CrushRight for LIGD and EMGM, as per RepLib paper section 5
by Alexey Rodriguez Yakushev 12 Feb '08

12 Feb '08

Tue Feb 12 09:45:49 PST 2008 Alexey Rodriguez <alexey(a)cs.uu.nl> * Further simplifications in CrushRight for LIGD and EMGM, as per RepLib paper section 5 M ./comparison/EMGM/CrushRight.lhs -20 +20 M ./comparison/LIGD/CrushRight.lhs -23 +24

1 0

patch applied (generics): Simplification of representation of arity two
by Alexey Rodriguez Yakushev 12 Feb '08

12 Feb '08

Tue Feb 12 03:25:04 PST 2008 Alexey Rodriguez <alexey(a)cs.uu.nl> * Simplification of representation of arity two Previously the arity two representation was |data Rep2 f a b c d = ...| where |c| and |c| represented the non-generic variables (for example for the two variables used in crushRight: |Rep2 CrushRight a b c d| and |newtype CrushRight c b a x = CrushRight { crushRight :: (c -> b -> b) -> b -> a -> b } ). It turns out that |Rep2| does not need the additional c and d, we do the same thing that the EMGM version of the test was doing: > data Rep2 f a b = ... > newtype CrushRight c b a x = CrushRight { crushRight :: (c -> b -> b) -> b -> a -> b } so it is represented as |Rep2 (CrushRight c d) a b|. M ./comparison/LIGD/BinTreeReps.hs -1 +1 M ./comparison/LIGD/CrushRight.lhs -5 +4 M ./comparison/LIGD/GMap.lhs -6 +4 M ./comparison/LIGD/LIGD.lhs -27 +27 M ./comparison/LIGD/TreeReps.hs -1 +1

1 0

patch applied (generics): SYB1_2 fails for CrushRight.
by Alexey Rodriguez Yakushev 12 Feb '08

12 Feb '08

Mon Feb 11 13:01:02 PST 2008 Alexey Rodriguez <alexey(a)cs.uu.nl> * SYB1_2 fails for CrushRight. ./comparison/SYB1_2/Reduce.lhs -> ./comparison/SYB1_2/CrushRight.lhs M ./comparison/SYB1_2/CrushRight.lhs -10 +19

1 0

patch applied (generics): GShowExt SYB1_2 added (working)
by Alexey Rodriguez Yakushev 11 Feb '08

11 Feb '08

Mon Feb 11 12:19:10 PST 2008 patrikj(a)chalmers.se * GShowExt SYB1_2 added (working) A ./comparison/SYB1_2/GShowExt.lhs

1 0

patch applied (generics): GShow SYB1_2 fixes
by Alexey Rodriguez Yakushev 11 Feb '08

11 Feb '08

Mon Feb 11 06:58:21 PST 2008 patrikj(a)chalmers.se * GShow SYB1_2 fixes M ./comparison/SYB1_2/GShow.lhs -30 +10 M ./comparison/log.txt -2 +5

1 0

patch applied (generics): GShow[Ext] Spine: removed cheating in GShow, added (failing) GShowExt
by Alexey Rodriguez Yakushev 11 Feb '08

11 Feb '08

Mon Feb 11 06:44:30 PST 2008 patrikj(a)chalmers.se * GShow[Ext] Spine: removed cheating in GShow, added (failing) GShowExt M ./comparison/Spine/GShow.lhs -4 +6 A ./comparison/Spine/GShowExt.lhs

1 0