Re: [Haskell-cafe] type families, fun deps, lattices imposed on/by types

l structures are needed. http://www.cse.unsw.edu.au/~pls/thesis/aja-thesis.pdf > Thanks again! I'll try to read it quite soon. -- br, Isto ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] type families, fun deps, lattices imposed on/by types

? (I just wouldn't like write a lot of instances...) If not, would it be possible to extend, say ghc, to work that way or are there too much inconsistencies in the above presentation? (Yes, where is the bottom. Why top and not bottom? Should it be possible to tell, which one to use, if

Re: [Haskell-cafe] Re: HDBC or HSQL

ot;dList" return lst readTable2 = do dbh <- connect server database user_id passwd values <- retrieveRecords2 dbh putStrLn $ "dLists are : " ++ (show values) br, Isto 2007/8/1, Alex Jacobson <[EMAIL PROTECTED]>: > >

Re: [Haskell-cafe] Re: HDBC or HSQL

o be allergic to this) I was even wondering, should I propose a patch in some near future for this. But if HDBC can handle those sql-arrays or if you can give a couple of hints, how to proceed in order to add them there, given your view below, I'd be willing to try to help / to try to use HD

Re: [Haskell-cafe] Re: Writing "Haskell For Dummies Or At Least For People Who Feel Like Dummies When They See The Word 'Monad'"

that is the equivalent of 'design > patterns', but for functional languages. I thought Osasaki's book Hi, Would the following fit the need? http://www.cs.vu.nl/Strafunski/ http://www.cs.vu.nl/Strafunski/dp-sf/ br, Isto ___ Has

Re: [Haskell-cafe] On improving libraries: wanted list

ht would like to see easily is the license e.g. as a last word on the title? Could/can Cabal tell all this to me with one command? That is, give a list of available libraries to be downloaded with their versions, licences and current #downloads? :) br, Isto ___

Re: [Haskell-cafe] Optimizing a hash function

ok of core -ddump-simpl > core.txt and to check memory leaks, you could run with +RTS -sstderr br, Isto ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] type keeping rounding, typeable (and a difficulty)

> ] somehow in the spirit above? > > Maybe you want something like... This time, however, I'm not sure after seeing oleg's email: http://www.haskell.org/pipermail/haskell/2006-November/018736.html I'll have yet to re-read it carefully to be sure... :) br, Isto

[Haskell-cafe] list monad and controlling the backtracking

take much more lines to do it in some other way. br, Isto ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Difficult memory leak in array processing

ed to contain and explain these flags? Hopefully this helped you a bit! And hopefully someone who knows how these things go have time to give you a detailed answer! br, Isto ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] type keeping rounding, typeable (and a difficulty)

ke, 2006-11-15 kello 13:31 -0800, Greg Buchholz kirjoitti: > isto wrote: > ] let t = show (typeOf a) > ] in case t of > ] "Double" -> roundDDec d a > ] "Complex Double" -> roundCDec d a > Maybe you want type class

[Haskell-cafe] type keeping rounding, typeable (and a difficulty)

tionality can be written differently, but I wanted to try write rounding having in a signature at least "(Num a) => Int -> a -> a". Again, any help would be appreciated a lot! Thanks in advance! br, Isto ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] 64bit code output is less optimized than 32bit in ghc?

. So what is happening here? :) Thanks again for any comments! br, Isto Core (32 and 64 nexts) Rec { Mersenne.$wnext64 :: Data.Array.IO.Internals.IOUArray GHC.Base.Int GHC.Word.W

Re: [Haskell-cafe] How to improve speed? (MersenneTwister is several times slower than C version)

er languages out as one goal here is to learn Haskelling and somehow solutions that require writing code only in one language sounds nicer. br, Isto to, 2006-11-02 kello 08:18 -0500, Lennart Augustsson kirjoitti: > Oh, sorry, I thought your version was a rewritten version of mine. :) >

Re: [Haskell-cafe] How to improve speed? (MersenneTwister is several times slower than C version)

There were some good suggestions on this thread - next I'll try to get grasp on how to apply the suggestions and do something... br, Isto ke, 2006-11-01 kello 22:04 -0500, Lennart Augustsson kirjoitti: > The whole point of writing the Mersenne Twister was that I wanted to > sho

[Haskell-cafe] How to improve speed? (MersenneTwister is several times slower than C version)

ciency and make everything better will be appreciated a lot! br, Isto - testMTla.hs (MersenneTwister, see HaWiki) module Main where -- ghc -O3 -optc-O3 -optc-ffast-math -fexcess-precision --make testMTla import MersenneTwister main = do putStrLn "T