- Haskell-Cafe - Haskell.org

Modeling multiple inheritance
by Brandon Michael Moore 05 Nov '03

05 Nov '03

I'm trying to build a nicer interface over the one generated by jvm-bridge. I'm using fancy type classes to remove the need to mangle method names. I would like methods to be automatcially inherited, following an inheritance hierarcy defined with another set of type classes. My basic classes look like this class HasFooMethod cls args result | cls args -> result where foo :: cls -> args -> result If I have classes A and B with foo methods like foo_JA_Jint :: ClassA -> Jint -> Bool foo_JB_Jboolean :: ClassB -> Bool -> Jint then I can make instances instance HasFooMethod ClassA Jint Bool instance HasFooMethod ClassB Bool Jint Now I can just use foo everywhere. I would like to avoid declaring an instance for every class though. In java methods are inherited from a superclass, and I would like to inherit methods automatically as well. In the bindings jvm-bridge generates a method is invoked with a function mangled after the highest ancestor that defined that particular overloading, so the implementation of HasFooMethod at a particular overloading is the same for any descendant. So I defined a class to model the inheritance relationships class SubType super sub | sub -> super where upCast :: sub -> super Now I can define a default instance of HasFooMethod: instance (HasFooMethod super args result, SubClass super sub) => HasFooMethod sub args result where foo sub args = foo (upCast sub) args This will propagate foo methods down the inheritance hierarcy. If a new class C is derived from A, I just need to say instance SubClass ClassA ClassC and ClassC gets a foo method. (In the actually code I piggy-back on a transitive subclass relation jvm-bridge defines that already includes an upcast method, so upCast has a default that should always be acceptable). The problem comes when interfaces are added to the mix. Interfaces are treated just like classes by jvm-bridge, and even though no implementation is inherited from instances in Java, the method accessors generated by jvm-bridge should be inherited. One problem is that the subclass relationship needs the functional dependency so that the default instance of HasFooMethod will respects the functional dependencies of HasFooMethod, so I can't declare subclass instances for multiple inheritance. On the other hand, if I don't use the functional dependency on HasFooMethod I end up needing to annotate most of the return values in a program. I run into similar problems trying to use numeric literals as arguments, because they are also overloaded. Does anyone know of clever solutions that would model multiple inheritance while preserving the functional dependencies (unsafe compiler flags are fine too), or ways to reduce the pain of overloading resolution without the functional dependency? One alternative is generating seperate HasFooMethod instances for every class in the system. The problem is that this would require alterating the bit of jvm-bridge that uses JNI to find information on classes, which currently only reports newly defined methods. JNI is black magic to me. Thanks Brandon

3 11

AW: AW: Heap profiling in GHC broken?
by Markus.Schnell＠infineon.com 04 Nov '03

04 Nov '03

> The canonical tutorial paper is in the Advanced Functional Programming > Summer Schools series: > > C. Runciman and N. Ro"jemo. Heap profiling for space efficiency. > In J. Launchbury, E. Meijer, and T. Sheard, editors, 2nd > Intl. School > on Advanced Functional Programming, pages 159-183, Olympia, WA, > August 1996. Springer LNCS Vol. 1129. Great! I knew only the more compiler-oriented Runciman/Röjemo papers. (Which were already helpful, but not very 'tutorial'.) Thanks, Markus

1 0

AW: Heap profiling in GHC broken?
by Markus.Schnell＠infineon.com 04 Nov '03

04 Nov '03

I have no idea how to set up cvs under windows to get things from a non-local repository, but anyway, profiling worked on the macintosh. I spent the whole weekend plus monday to find the space leak, but eventually I did. Heap Profiling was very helpful there. Unfortunately, space leaks are barely mentioned in the Haskell books/tutorials, but they are a real burden if you want to run programs for larger problems. A tutorial on this by one of the experts would be very welcome. :-) Thanks, Markus > -----Ursprüngliche Nachricht----- > Von: haskell-cafe-bounces(a)haskell.org > [mailto:haskell-cafe-bounces@haskell.org] Im Auftrag von David Roundy > Gesendet: Donnerstag, 30. Oktober 2003 13:48 > An: haskell-cafe(a)haskell.org > Betreff: Re: Heap profiling in GHC broken? > > > On Wed, Oct 29, 2003 at 05:43:23PM +0100, > Markus.Schnell(a)infineon.com wrote: > > When I tried to profile my program in search for space leaks, > > it core dumped on me (actually on Win2000/Cygwin). I'm > using ghc 6.0.1. > > Does anybody know what could be the problem? > > > > (To be more precise: any +RTS -h_ options make problems, > +RTS -p works > > fine. I get a message meaning the equivalent of "statement in > > '0x0058db43' points to memory in '0xfffffffc'. Could not read.") > > I believe this bug is fixed in CVS, so you could get it there > or wait for > 6.2. (I didn't fix it, I just reported it.) > -- > David Roundy > http://www.abridgegame.org/darcs > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe >

3 2

Data representation, maybe reflection, laziness
by Mark Carroll 04 Nov '03

04 Nov '03

People have been talking about transmitting Haskell values on the GHC users' list, and I wanted to ask some more general stuff, partly out of mild ignorance. Ralf Hinze and Simon Peyton-Jones wrote an interesting paper on generic programming and derivable type classes. It looked like maybe programmers would be able to write their own "deriving xml" stuff and whatever, which looked great because, if there's not already one out there, I'd love to derive some read/show analogue automatically for data in some encoding that's very efficient to write and parse (i.e. not XML (-:). I was also wondering how the ability to write "deriving" stuff related to what one might think of as being reflection - that is, for example, could a definition of deepSeq be derived that automatically knows how to recurse into and traverse data structures and make sure everything's evaluated? This leads me to the point that little of the code I write needs laziness, but many of my unpleasant performance surprises come from laziness. I do find it hard to figure out where to put strictness annotations to actually make things work - for instance, I think it's laziness things that are causing my uses of Control.Exception.evaluate to actually work more by trial and error. No doubt it'll all grow clearer in time. Maybe I need "laziness annotations" instead. (-: Still, I was wondering what current thinking and directions were with regard to any of the above! -- Mark

4 4

Doubt regarding Types
by Karthik Kumar 04 Nov '03

04 Nov '03

Hi All, I was trying to write go program in haskell - My code fragment looks like this - <---- > getBoardSize :: IO Bool -- TODO : What could be the type of getBoardSize getBoardSize = do c <- getLine validateBoardSize ( atoi c ) -- Convert a string to an integer. -- This works perfectly fine. atoi :: [Char] -> Int atoi (h : []) = if isDigit h then digitToInt h else 0 atoi (h : t) = if isDigit h then digitToInt h * ( 10 ^ length t) + atoi t else 0 -- validateBoardSize -- To validate the board size validateBoardSize :: Int -> Bool validateBoardSize d = (d == 9 || d == 13 || d == 19 ) <----> ERROR "test1.hs":21 - Type error in final generator *** Term : validateBoardSize (atoi c) *** Type : Bool *** Does not match : IO a Actually i guess there is something wrong with the type mentioned for getBoardSize function , but am clueless abt this. Thanks in advance for your help in this regard. Cheers Karthik __________________________________ Do you Yahoo!? Exclusive Video Premiere - Britney Spears http://launch.yahoo.com/promos/britneyspears/

3 4

Help ? :)
by Patty Fong 03 Nov '03

03 Nov '03

3 2

RE: fixed point
by Dean Herington 01 Nov '03

01 Nov '03

At 11:15 AM -0500 2003/10/31, Harris, Andrew wrote: > Hi - > I am trying to work out how the following function using "fix" is > evaluated. I am hoping someone could look at my step-by-step breakdown > of how I think evaluation works and see if I'm correct. My main > question is how the order of operation (fixity?) is understood in going > from step [3] to [4], if this is indeed how the evaluation would take > place. > > Any help is appreciated, > -andrew > > Here's the Haskell function: > > --- > fix f = f (fix f) > > wierdFunc2 x y z = if y - z > z then x (y-z) z > else y - z > > myRemainder = fix wierdFunc2 > --- > > Here's my "evaluation": You're pretty close. I've noted a couple of differences below. > myRemainder 12 5 -- [1] > = > fix wierdFunc2 12 5 -- [2] by substitution > = > wierdFunc2 fix wierdFunc2 12 5 -- [3] apply "fix" wierdfunc2 (fix wierdFunc2) 12 5 > = > wierdFunc2 myRemainder 12 5 -- [4] by substitution (?) No, equations "rewrite" only "from left to right". Skip the step above and the step below. > = > myRemainder 7 5 -- [5] apply "wierdFunc2" > = > fix wierdFunc2 7 5 -- [6] by substitution > = > wierdFunc2 fix wierdFunc2 7 5 -- [7] apply "fix" Similarly, the above needs (fix wierdFunc2) to be parenthesized. > = > wierdFunc2 myRemainder 7 5 -- [8] by substitution (?) Skip the above step. > = > 2 -- [9] apply "wierdFunc2" Dean

1 0

newbie question regarding type declarations
by gangadhar npk 01 Nov '03

01 Nov '03

hi, I am a newbie to Haskell. I am reading the tutorial by Hal Daume III. Regarding the function types which are an extension of lambda calculus, I was wondering if at all it is possible to write a type that would return two values as the output - something like a square function which would take a pair and return a pair. I tried this, but there are errors square :: (Num a, Num b) => (a ,b) square (x , y) = (x*x , y*y) How can I specify that the square functions output would be a pair ? thank you gangadhar

5 4

Monad @ Microsoft
by Josef Svenningsson 31 Oct '03

31 Oct '03

OK, this one is just too good not to post about it. Microsoft has developed a now command line interface. Guess what they call it? Read it here: http://slashdot.org/articles/03/10/31/1346201.shtml?tid=185&tid=190&tid=201 Well, it seems Simoj PJ is doing a good job introducting functional programming at MS although his methods are subtle in the extreme :-) /Josef

1 0

RE: fixed point
by Harris, Andrew 31 Oct '03

31 Oct '03

Hi - I am trying to work out how the following function using "fix" is evaluated. I am hoping someone could look at my step-by-step breakdown of how I think evaluation works and see if I'm correct. My main question is how the order of operation (fixity?) is understood in going from step [3] to [4], if this is indeed how the evaluation would take place. Any help is appreciated, -andrew Here's the Haskell function: --- fix f = f (fix f) wierdFunc2 x y z = if y - z > z then x (y-z) z else y - z myRemainder = fix wierdFunc2 --- Here's my "evaluation": myRemainder 12 5 -- [1] = fix wierdFunc2 12 5 -- [2] by substitution = wierdFunc2 fix wierdFunc2 12 5 -- [3] apply "fix" = wierdFunc2 myRemainder 12 5 -- [4] by substitution (?) = myRemainder 7 5 -- [5] apply "wierdFunc2" = fix wierdFunc2 7 5 -- [6] by substitution = wierdFunc2 fix wierdFunc2 7 5 -- [7] apply "fix" = wierdFunc2 myRemainder 7 5 -- [8] by substitution (?) = 2 -- [9] apply "wierdFunc2"

1 0