- Haskell-Cafe - Haskell.org

Fwd: Pointers by using functions
by Holden Lee 21 Sep '14

21 Sep '14

What is the best way to implement data structures that use pointers in Haskell? My first thought is as follows. Suppose for simplicity the labels are just integers, and each object need to point to one other one. I would have a getObject:: Int -> a f:: Int -> Int But I don't understand how Haskell maintains functions in memory, and in particular whether lookup/update is efficient. So suppose I define a f f x = case x of 1 -> 2 2 -> 3 .... (etc.) Q: if there are n entries here, how long does looking up (f m) take? Suppose later I update, with something like this: update::Int->Int->(Int->Int)->(Int->Int) update x y f z = (if z==x then y else f x) Q: how is "update x y f" maintained? Is using a f::Int->Int like using a pointer in terms of time complexity, and if not, what data structure should I use instead? Thanks, Holden

3 2

ANN: vimus - An MPD client with vim-like key bindings
by Simon Hengel 21 Sep '14

21 Sep '14

Hi, I just uploaded vimus [1] to Hackage. vimus is an MPD client with vim-like key bindings. I've been using it as my exclusive music player since early 2010. It comes with it's own quick & dirty ncurses bindings, which is one of the reasons why I was reluctant to push it to Hackage so far. Check the README for installation and usage: https://github.com/vimus/vimus#readme vimus is not a masterpiece of coding beauty** , but it's incredibly useful to me and a couple of other people over at #vimus on Freenode. Patches are welcome as long as they - reduce code bloat and improve hackability - do not conflict with my use cases (in case of doubt we make things configurable) - do not require lots of work from my side (vimus already works incredibly well for me and I can not spend too many cycles on it) vimus would not be what it is today without the help of others. In particular I'm grateful to - Niklas Haas for being the second user of vimus and contributing many useful features - Joachim Fasting for his work on libmpd and contributing high quality patches to vimus - Markus Klinik for contributing documentation and features - Matvey Aksenov for adding even more features Cheers, Simon ** Indeed, vimus served me as a testing ground for experimenting with both Haskell and lean software development. [1] http://hackage.haskell.org/package/vimus [2] https://github.com/vimus/vimus#using-vimus

1 1

Linking/uploading a PDF file in HaskellWiki
by Henk-Jan van Tuyl 21 Sep '14

21 Sep '14

L.S., I am trying to link a PDF file, that is to be uploaded to the HaskellWiki environment, but I encounter several problems: - The link [[File:wxhaskell.pdf | wxHaskell - A Portable and Concise GUI Library for Haskell]] is displayed as File:wxhaskell.pdf instead of wxHaskell - A Portable and Concise GUI Library for Haskell If I leave out the vertical bar, the entire string between the brackets is displayed and used as filename - If I click the link, I am asked to upload the file; the resulting file should be http://www.haskell.org/haskellwiki/File:Wxhaskell.pdf but this URL results in a blank page - The list of uploaded files should be at http://www.haskell.org/haskellwiki/Special:ListFiles but this URL results in a blank page as well Am I doing something wrong, or are these Wiki bugs? Regards, Henk-Jan van Tuyl -- Folding@home What if you could share your unused computer power to help find a cure? In just 5 minutes you can join the world's biggest networked computer and get us closer sooner. Watch the video. http://folding.stanford.edu/ http://Van.Tuyl.eu/ http://members.chello.nl/hjgtuyl/tourdemonad.html Haskell programming --

2 1

Chaining modifications using (>>>)
by martin 20 Sep '14

20 Sep '14

Hello all, I've been playing with Data.Graph.Inductive, which provides functions to modify a graph. I take these functions and build something more complex from them. To do so, I have to apply several such modifications one after the other. I can write this using ($) or (.), but I didn't like to write things backwards (last function to apply comes first), so I use (>>>) from the Arrows module to chain functions Graph -> Graph (aka GraphTransforms) and my complex function looks like f >>> g >>> h. To actually build a Graph I have to apply my function to some Graph (often "empty"). This works okay as long as the inidividual functions f,g,h do not need access to the graph. However, there is one function where I use "pre" (predecessors) and "suc" (succerssors), which need the Graph as a parameter. groupNodes :: DynGraph gr => (Label,[Node]) -> GraphTransform gr pl groupNodes (lbl,ids) gr = let id = head $ newNodes 1 gr oldEdgesTo = [(toOld, old) | old <- ids, toOld <- pre gr old] -- <== here "pre" oldEdgesFrom = [(old, fromOld) | old <- ids, fromOld <- suc gr old] oldEdges = oldEdgesTo ++ oldEdgesFrom oldEdgesWithin = [ (i,j) | (i,j) <- oldEdges, i `elem` ids, j `elem` ids] newEdges = map (uncurry e0) $ uniq $ map (setDest id) (oldEdgesTo \\ oldEdgesWithin) ++ map (setOrig id) (oldEdgesFrom \\ oldEdgesWithin) in --------------- look here: ----------------------- ( insNode (id, (NN lbl)) >>> delNodes ids >>> delEdges oldEdges >>> insEdges newEdges ) gr This works, but I don't like the "in" part and I'd rather omit the braces and the gr argument. Without the gr argument to the whole function this would work, however with the gr I have to kinda eta expand (?) it. Is there a way I can write this more point free and still have access to gr for pre and suc?

2 1

Haskell FFI Question
by ye yan 20 Sep '14

20 Sep '14

I have been play around with Haskell FFI. My question is for ByteString (Strict) is there a trailing null append to it when pass to it C functions?

2 4

Confused about AllowAmbiguousTypes
by Audun Skaugen 19 Sep '14

19 Sep '14

I am confused about the behaviour of the AllowAmbiguousTypes extension. I tried the basic example of the user manual: > class C a where > f :: C a => Int > f = 3 > main = print f Using ghc 7.8.3, without the extension, this will cause a type error at the type signature (line 2). Adding AllowAmbgiuousTypes causes an error at the call site instead (line 4). So far so good. However, if I replace the (C a) constraint with (Num a), no type error is reported, and the example runs fine! This is true with or without the extension. Using ghc 7.6.3, however, the example is still rejected with an "ambiguous constraint" error. Is this a bug in ghc 7.8? Is ghc somehow able to prove the Num constraint even though a is universally quantified? -- Audun Skaugen

2 1

Craig Gentry of IBM
by Vasili I. Galchin 19 Sep '14

19 Sep '14

Hi, Gentry is doing on homomorphic functions cryptography. I looked on Hackage but did see a homomorphic function library. Is there.any effort in this area in Haskell? If so by whom and is contact info? Vasya

1 0

Constructors on left and right hand sides of equation
by PATRICK BROWNE 19 Sep '14

19 Sep '14

Dear list In Eq 1 is (NewGlass i) on the LHS distinct from (NewGlass i) on the RHS? In Eq2 are the occurrences of the data constructor Fill on the LHS and RHS distinct? Thanks Pat data Glass = NewGlass Int | Fill Glass Int deriving Show drink :: Glass -> Int -> Glass drink (NewGlass i) j = (NewGlass i) -- Eq 1 drink (Fill m i) j | full (Fill m i) = Fill (NewGlass (size m)) ((size m) - j) -- Eq 2 | (i >= j) = Fill m (i-j) | otherwise = drink m (j-1) size :: Glass -> Int size (NewGlass i) = i size (Fill m i) = size m level :: Glass -> Int level (NewGlass i) = 0 level (Fill m i) | (level m) + i > (size m) = size m | otherwise = (level m) + i empty :: Glass -> Bool empty m = (level m) == 0 full :: Glass -> Bool full m = (level m) == (size m) {- drink (Fill (NewGlass 4) 5) 5 drink (Fill (NewGlass 4) 3) 3 -} -- This email originated from DIT. If you received this email in error, please delete it from your system. Please note that if you are not the named addressee, disclosing, copying, distributing or taking any action based on the contents of this email or attachments is prohibited. www.dit.ie Is ó ITBÁC a tháinig an ríomhphost seo. Má fuair tú an ríomhphost seo trí earráid, scrios de do chóras é le do thoil. Tabhair ar aird, mura tú an seolaí ainmnithe, go bhfuil dianchosc ar aon nochtadh, aon chóipeáil, aon dáileadh nó ar aon ghníomh a dhéanfar bunaithe ar an ábhar atá sa ríomhphost nó sna hiatáin seo. www.dit.ie Tá ITBÁC ag aistriú go Gráinseach Ghormáin – DIT is on the move to Grangegorman <http://www.dit.ie/grangegorman>

4 6

move sandboxes
by Corentin Dupont 19 Sep '14

19 Sep '14

Hi guys, is there a pratical way to move a sandbox? I see the absolute path are hard-coded in all the .conf files. I ask the question because I have an application that uses Hint. So it needs to run with the same object files that it was compiled with. If I want to deploy the application on a server, I need to send the whole sandbox there: this way Hint/GHC finds the database when I start with "cabal exec". But this forces me to deploy it on the same path it was compiled, which is not very practical. Cheers C

1 0

preventing space leaks?
by Baojun Wang 19 Sep '14

19 Sep '14

Hi Cafe, I'm very new to Haskell, and I'm confused about haskell space leaks, even I read some wiki pages from haskell.org. Below is the scenario I''m facing at: When I use listArray to create either IArray or UArray, I found it could lead to space leaks (very high GC time), is there a way to prevent this, and why there is no fusion when create IArray/UArray from the list? I don't need the list anyway after array is created. (I used this few times for DP, based on this link: http://jelv.is/blog/Lazy-Dynamic-Programming/) Further more, suppose if I create a IArray A from list 1, later I create UArray B based some computations based on A (also I need discard another list 2). After B is generated, I don't need A anymore (so this lead to space leaks, correct)? Another quetion, by the way, after the lazy IArray is created (say from a DP), is there a way convert it to UArray for better performance (IArray -> UArray)? How can I improve the space leak problems with above use case? Best Regards Baojun

2 2