- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] Linking to third party libraries in windows
by Matthew Bromberg 26 May '06

26 May '06

Not only does your suggestion make more sense than what I was doing, but also it causes the 'matrices' to behave as expected, namely to have the side effects incorporated into their array values. I can't say I fully understand why this is true. In both cases I was wrapping Rmatrix in a monad after every computation. The difference is that the array component had an additional monad wrapper around and now it doesn't. That is, old case newtype Rmatrix = Rmatrix (Int, Int, IO(StorableArray Int CDouble)) new case newtype Rmatrix = Rmatrix (Int, Int, StorableArray Int CDouble) In the old way, the additional IO wrapper forces an additional nesting of do loops for most processing. It is certainly the case that the do loop that performs the withStorableArray operations has the contents of the array modified. Outside that loop, once all actions on the monad are done, I am not convinced the array will mutate unless it's explicitly returned. Now hopefully I won't induce unnecessary copying. Thanks again for your help. Brian Hulley wrote: > > Hi Matthew - > Sorry about the long delay in my reply to your last message - I'd > composed the reply but when I tried to send it I was blocked by > spamhaus.com because the dynamic IP that my ISP had allocated to me at > the time I was connected had been listed on some composite spam > blocker database, and even when I tried reconnecting several times I > kept ending up being allocated the same client IP. So I did a complete > scan of my system and now (several hours later) when I tried to > reconnect again, I've been allocated a different client IP so my reply > to your last message was sent at last! ... > > I hope it answers your question relating to the above: the array is > not created in the let statement, but twice, in > rout <- mac r2 (-0.5) rmat > and then again in > mprint r2 > > Rmatrix really needs to have type (Int, Int, StorableArray Int > CDouble) if your intention is to pass around an actual allocated > matrix together with its dimensions, and listtoRmatrix would need to > be typed as: > > listtoRmatrix :: Int -> Int -> IO Rmatrix > > so that the let statement could be replaced by > > r2 <- listtoRmatrix 3 2 [1, 1, 1, 1, 1, 1] > > and for example mprint would be defined as: > > mprint :: Rmatrix -> IO () > mprint (Rmatrix cols rows arr) = do > -- just print element at (0,0) for the moment > readArray arr 0 >>= print > > (Of course the above needs to iterate through the rows cols etc but > you've already got the code to do this...) > > Hope this helps, > > Brian. >

2 1

Re: [Haskell-cafe] Linking to third party libraries in windows
by Matthew Bromberg 26 May '06

26 May '06

OK I'm punting on the AMD libraries for now and will just use the Atlas libraries until I can get to the bottom of this. However, for me, it seems the rabbit hole goes a little deeper on the issue of array copies. Consider this code snippet import Matrix main = do print "Matrices" let r2 = listtoRmatrix 3 2 [1, 1, 1, 1, 1, 1] rout <- mac r2 (-0.5) rmat putStrLn "\nrout" mprint rout putStrLn "\nrmat2" mprint r2 putStrLn "\nrmat" mprint rmat An Rmatrix has type (Int, Int, IO (StorableArray Int CDouble)) and mac (multiply and accumulate) should provide the side effecting operation A <- A+ alpha * B for mac A alpha B . It returns IO(Rmatrix) for clarity here. listtoRmatrix just returns a regular Rmatrix. Now mac is implemented via daxpy and it should modify the mutable array in r2. rout is printed prior to r2, which (surprisingly?) remains unchanged. Here are the outputs rout 0.5000000 -1.0000000 0.0000000 -1.5000000 -0.5000000 -2.0000000 rmat2 1.0000000 1.0000000 1.0000000 1.0000000 1.0000000 1.0000000 rmat 1.0000000 4.0000000 2.0000000 5.0000000 3.0000000 6.0000000 Thus Haskell does not allow the side effect to affect the let binding. How does it achieve this without copying r2? If I bound r2 to this matrix using <- and a monad wrapper the result is the same. Does it recreate r2 just prior to the call to mprint r2? If Haskell has a magic way of doing this, without actually making a copy of the mutable array in r2, that would be pretty nifty actually. Brian Hulley wrote: > > I'd thought the stub was just to give the compiler something to > compile against, and that __stdcall was only used by Windows API > rather than all DLLs, but no doubt you're right. Ive just been looking > at the "Exporting from a DLL" help page from Visual Studio and it says > "When exporting functions with either method, make sure to use > __stdcall", so perhaps the functions I've exported using > __declspec(dllexport) are using __stdcall after all. > >> >> Now for my 'surprising' result. The matrix library is working against >> double arrays stored in a StorableArray. Presumably these storable >> arrays are mutable, but in fact the compiler makes sure that the >> array's are copied, when I enter a do clause. So for example >> arrx = newListArray (1 , 3) [3,2,1]:: IO (StorableArray Int CDouble) >> arry = newListArray (1 , 3) [1,1,1]:: IO (StorableArray Int CDouble) >> >> allocates two Storable arrays. > > No - this doesn't do any allocation. It just sets up two equations so > that anywhere you write arrx is equivalent to writing newListArray (1 > , 3) [3,2,1]:: IO (StorableArray Int CDouble) > > > It's not copied. A new array is created. Your do loop is the same as: > > -- the outer do > do > -- presumably you wrote arr <- arrx somewhere here > arr <- newListArray (1 , 3) [3,2,1]:: IO (StorableArray Int CDouble) > > -- the do loop quoted above > do > arr <- newListArray (1 , 3) [3,2,1]:: IO (StorableArray Int > CDouble) > withStorableArray arr sumarr >>= print > > -- view the contents of the first "arr" > putStrLn "Element 1: " >> (readArray arr 1 >>= print) > > Regards, Brian. >

1 0

The values of infinite lists
by Deokhwan Kim 25 May '06

25 May '06

Are the values of infinite lists _|_ (bottom)? In section 1.3, the Haskell 98 report said as follows: Errors in Haskell are semantically equivalent to _|_. Technically, they are not distinguishable from nontermination, so the language includes no mechanism for detecting or acting upon errors. Therefore, the value of the following infinity is _|_. Right? data Nat = Zero | Succ Nat infinity = Succ infinity What about infinite lists? For example, is the value of [1 ..] also _|_? Thanks.

9 26

Re: Editors for Haskell
by Jeremy O'Donoghue 25 May '06

25 May '06

Hi Walt, > I'm using Haskell (GHC and Hugs) on several different platforms. > Windows, OS X and Linux systems. Assuming that you want your students to be able to use any of the above platforms, the only options I know of which work well on all of the platforms are Emacsen, Vim, hIDE, Eclipse and JEdit. > I'd like to have an IDE that works well for medium to large size > projects. I know of Eclipse and hIDE. > Vim works fine but I'd like more. hiDE seems to be "in process." Much as I love Emacs, I can possibly imagine that you'd prefer to spend the course teaching Haskell, rather than how to use your editor. I personally found Eclipse very difficult to get on with, although YMMV. Although I don't use it much any more, I found JEdit to be very straightforward to use (very good menu-based GUI, plenty of features, syntax highlighting for most languages any sane person could want, and generally very easy to pick up). It's very underrated IMHO. The main reason I switched is that it does slow down with lots (>20, some very large) of files open. Emacs is better with very large projects (I mean > 10,000 files here), which is why I use it. I'd recommend it as a very good editor / simple IDE for people who don't want to spend their life learning to use their editor... HTH Regards Jeremy

3 2

QuickChecking IO
by Mike Gunter 25 May '06

25 May '06

I'd like to use QuickCheck on IO code. For instance, I'd like to check a property of type String -> IO Bool. Using unsafePerformIO seems straightforward (though I haven't written the code, so I may be wrong about that) and it might be possible to make a solution involving unsafeInterleaveIO work. Short of rewriting QuickCheck, is there any way to check IO code "safely"? Barring that, I suspect it's possible modify QuickCheck to accommodate IO code (or perhaps, general monadic code). Has anyone done this? thanks -m

3 3

Linking to third party libraries in windows
by SevenThunders 25 May '06

25 May '06

Has anyone actually seen ghc link successfully to third party libraries on windows? While I have been able to link to C object code compiled by ghc (and thus gcc by proxy), I have not been able to actually link against any substantial third party library or dll in windows. I am currently attempting to link to an amd linear algebra library that was compiled, in fact via gcc (libacml.a) . As soon as I include the following statement in my haskell code foreign import ccall "acml.h daxpy" daxpy:: CInt -> CDouble -> Ptr CDouble -> CInt -> Ptr CDouble -> CInt -> IO () and then link against the acml library using ghc via flags of the form ghc -O2 -fglasgow-exts main.hs -L. -llibacml my executable becomes a "do nothing" routine. That is inclusion of the foreign import prevents any output from occurring even though it compiles just fine. In fact this happens even if I don't use daxpy in the code. Removal of the foreign import allows the program to run. The same problem occurs whether or not I'm linking against a static library or a library providing stubs for a .dll. -- View this message in context: http://www.nabble.com/Linking+to+third+party+libraries+in+windows-t1681736.… Sent from the Haskell - Haskell-Cafe forum at Nabble.com.

2 1

UTF-8 Strings and GHC
by Dmitry V'yal 25 May '06

25 May '06

Hi, all. I'm writing a GUI app using Haskell and Gtk2HS. All goes well besides one thing. I need to display some messages in russian and I can't figure out, how to handle that. Gtk uses UTF-8 internally, so i have to pass UTF-8 strings to it somehow. But how to define them in source file? I get "lexical error in string/character literal" message then compiling using GHC-6.4.1. I tried to bypass it by using koi8-r in sources and converting strings to UTF-8 on the fly using ffi binding to iconv I found in MissingH (iirc). Works fine on Linux though is a little awkward, but I get wried results on Win32. Is there any way to use unicode strings in sources?

3 2

TypeCasting in Haskell
by Christophe Poucet 24 May '06

24 May '06

Dear all, I typically use indirect composite for making AST's. It allows me to easily make new types with other annotations without having to duplicate all elements but only those that actually change. It also allows a whole amalgam of other possibilities. Recently I have observed a type error which seems to be fixable only by doing a "typecast". What do I call a typecast, you may ask? Basically a noop that changes the type. Here attached you will find the code that demonstrates this. > module TypeCast where > > data FooBar foo bar = --- Indirect composite > Foo { unFoo :: foo} > | Bar { unBar :: bar} > > --- Assume some PFoobar (parsed) > data PFooBar = PF {unPF :: FooBar String String} > --- Assume some TFoobar (typed) > data TFooBar = TF {unTF :: FooBar Int String } > > -- Merrily we write our conversion, using binding to optimize slightly > typer :: PFooBar -> TFooBar > typer pFooBar = > case unPF pFooBar of > f@Foo { unFoo = foo} -> -- We only need to change foo > TF $ f{unFoo = 1} > b@Bar { unBar = bar} -> -- We don't need to change this string > TF $ b -- So we just return b > > --- Nice little main to make this a full module: > main :: IO () > main = do > print . typer . PF . Foo $ "Hello" > > --- Type error: > -- TypeCast.hs:19:11: > -- Couldn't match `Int' against `String' > -- Expected type: FooBar Int String > -- Inferred type: FooBar String String > -- In the second argument of `($)', namely `b' > -- In a case alternative: (b@Bar {unBar = bar}) -> TF $ b > > --- what is the fix? Basically do a noop on b > --- b@Bar {unBar = bar} -> > --- TF $ b{unBar = bar} > Cheers, Christophe -- Christophe Poucet Ph.D. Student Phone:+32 16 28 87 20 E-mail: Christophe (dot) Poucet (at) imec (dot) be Website: http://notvincenz.com/ IMEC vzw – Register of Legal Entities Leuven VAT BE 0425.260.668 – Kapeldreef 75, B-3001 Leuven, Belgium – www.imec.be *****DISCLAIMER***** This e-mail and/or its attachments may contain confidential information. It is intended solely for the intended addressee(s). Any use of the information contained herein by other persons is prohibited. IMEC vzw does not accept any liability for the contents of this e-mail and/or its attachments. **********

2 1

GHC wish
by Christophe Poucet 24 May '06

24 May '06

Dear all, I recently stumbled upon something that I think should be added to the GHC wishlist. Not knowing where to put it, I will put it here. As there is deriving(Show) for most basic data types, wouldn't it be possible to have something similar but then deriving(Pretty). When printing ASTs it could make it much easier to look at the output. With regards, Christophe -- Christophe Poucet Ph.D. Student Phone:+32 16 28 87 20 E-mail: Christophe (dot) Poucet (at) imec (dot) be Website: http://notvincenz.com/ IMEC vzw – Register of Legal Entities Leuven VAT BE 0425.260.668 – Kapeldreef 75, B-3001 Leuven, Belgium – www.imec.be *****DISCLAIMER***** This e-mail and/or its attachments may contain confidential information. It is intended solely for the intended addressee(s). Any use of the information contained herein by other persons is prohibited. IMEC vzw does not accept any liability for the contents of this e-mail and/or its attachments. **********

2 1

How to automatically free memory allocated by malloc? and how to reliably realloc such buffer?
by Bulat Ziganshin 24 May '06

24 May '06

Hello Haskell-Cafe, my program uses datastructure that contains plain Ptr, this Ptr points to the memory area allocated by 'malloc': createRawMemBuf size = do buf <- mallocBytes (fromIntegral size) bufRef <- newURef buf ... return (Mem bufRef ...) i need to free this memory buffer on GC if there are no more references to Mem structure. how i can accomplish this? i can't allocate this buffer in GHC heap because later i can use 'realloc' on it. i think that i should use ForeignPtr what points to nothing and performs 'readURef bufRef >>= free' in it's finalizer? something like this: createRawMemBuf size = do buf <- mallocBytes (fromIntegral size) bufRef <- newURef buf ... fin <- mkFinalizer (\_ -> readURef bufRef >>= free) fptr <- newForeignPtr fin nullPtr return (Mem bufRef ... fptr) type Finalizer a = Ptr a -> IO () foreign import ccall "wrapper" mkFinalizer :: Finalizer a -> IO (FinalizerPtr a) ... well, i implemented this and it seems to work - at least memory freed at performGC. another question is how to free 'fin' - i should apply 'freeHaskellFunPtr' to it, but i think i can't do it in finalizer itself The second question is how to make buffer reallocation reliable. Currently i use the following code: reallocBuffer (Mem bufRef ...) newsize = do buf <- readURef bufRef writeURef bufRef nullPtr newbuf <- reallocBytes buf newsize writeURef bufRef newbuf First 'writeURef' is used to prevent repetitive memory deallocation by finalizer i this routine will be interrupted just after 'reallocBytes' operation. will it be enough to use 'block' instead? i.e.: reallocBuffer (Mem bufRef ...) newsize = do buf <- readURef bufRef block $ do newbuf <- reallocBytes buf newsize writeURef bufRef newbuf -- Best regards, Bulat mailto:Bulat.Ziganshin@gmail.com

2 3