- Haskell-Cafe - Haskell.org

Monad.Reader #20 call for copy
by Edward Z. Yang 07 Mar '12

07 Mar '12

I'm pleased to announce that I, Edward Z. Yang, will be taking over Brent Yorgey's role as lead editor of the Monad Reader! Call for Copy: The Monad.Reader - Issue 20 -------------------------------------------- Whether you're an established academic or have only just started learning Haskell, if you have something to say, please consider writing an article for The Monad.Reader! The submission deadline for Issue 20 will be: **Monday, March 5** The Monad.Reader ~~~~~~~~~~~~~~~~ The Monad.Reader is a electronic magazine about all things Haskell. It is less formal than journal, but somehow more enduring than a wiki- page. There have been a wide variety of articles: exciting code fragments, intriguing puzzles, book reviews, tutorials, and even half-baked research ideas. Submission Details ~~~~~~~~~~~~~~~~~~ Get in touch with me if you intend to submit something -- the sooner you let me know what you're up to, the better. Please submit articles for the next issue to me by e-mail (ezyang(a)mit.edu) Articles should be written according to the guidelines available from http://themonadreader.wordpress.com/contributing/ Please submit your article in PDF, together with any source files you used. The sources will be released together with the magazine under a BSD license. If you would like to submit an article, but have trouble with LaTeX please let me know and we'll work something out.

1 1

Re: [Haskell-cafe] Summer of Code idea: Haskell Web Toolkit
by Greg Weber 07 Mar '12

07 Mar '12

This is obviously a great concept. However, it may not be appropriate for a GSoC. The design space is far too open, and it is not clear if anything in that space will end up beating plain old javascript. I think my proposal for an awesome websockets library [1] shows that this is putting the cart before the horse. For some of the potential javascript solutions, websockets is a dependency anyways. Without being able to hold open a connection to the server, required server interaction will be too slow. Yesod has been successful by explicitly avoiding any new radical paradigms, but by instead just trying to get the basics of web development established correctly. Without websockets, we don't have the basics down for fluid client-side interaction. The groundwork for this ticket has been laid: it should be easy to accomplish with time left over. So we are guaranteed a clear win for the community. With the time left over, a solution to the javascript problem can be attempted. But there is no burden for it to be solved within the summer. Next year the landscape will be more mature and we can try to come up with a solid proposal for the javscript problem if the community hasn't already created a solution. [1] http://hackage.haskell.org/trac/summer-of-code/ticket/1607

2 2

Summer of Code idea: Haskell Web Toolkit
by Dimitry Golubovsky 07 Mar '12

07 Mar '12

Hi, Alejandro Serrano Mena wrote: > My idea is to make a client-side Haskell Web Toolkit, in the spirit of > Google Web Toolkit, which would allow to program in Haskell the client part > of a web application, and would complement the web frameworks already > existing for Haskell (such as Yesod and Snap). http://www.haskell.org/haskellwiki/Haskell_web_toolkit - In memoriam ;) Feel free to use these ideas. It would be nice if you could pick it up and complete - I never did... -- Dimitry Golubovsky Anywhere on the Web

1 0

Re: [Haskell-cafe] [Haskell] Higher types in contexts
by Henning Thielemann 06 Mar '12

06 Mar '12

moved to haskell-cafe On Mon, 5 Mar 2012, Barney Hilken wrote: > Is there any deep reason why I can't write a polymorphic type in a context? I think the record update problem can be (sort of) solved if you could write: > > class Has r Rev (forall a. [a] -> [a]) => HRClass r where > setHRClass :: (forall a.[a] -> [a]) -> r -> r > > but polymorphic types are not allowed in contexts. Is this one of the problems SPJ considers "Hard" or is it a feasible extension? I don't know what you want to do, but you may wrap the (forall a. [a] -> [a]) in an existential type: data ListFunc = forall a. ListFunc ([a] -> [a]) class Has r Rev ListFunc => HRClass r where setHRClass :: ListFunc -> r -> r

4 3

Re: [Haskell-cafe] Adding type annotations to an AST?
by oleg＠okmij.org 06 Mar '12

06 Mar '12

> How do I add type annotations to interior locations in an abstract > syntax tree?.... > i.e. the type it [algorithm] infers is the type of the whole > program, I would also like the types of any internal let-rec > definitions so I can label my AST. I had exactly the same problem: type reconstruction and the annotation of all sub-terms with their inferred types. Even if the overall type inference fails, the user can still see what the type checker was able to infer before the error. Here is the solution http://okmij.org/ftp/Computation/FLOLAC/TEvalNR.hs There is a bit of the explanation here: http://okmij.org/ftp/Computation/FLOLAC/lecture.pdf

2 1

Double-dispatch
by Clark Gaebel 06 Mar '12

06 Mar '12

Is there any way in Haskell to have the correct function selected based on the types of two different types? For example, let's say I'm writing intersection tests: aABBandAABB :: AABB -> AABB -> Bool oBBandOBB :: OBB -> OBB -> Bool oBBandPoint :: OBB -> Point -> Bool Is there some way (such as with Type Families) that I can write some sort of generic method for this: intersects :: Intersectable -> Intersectable -> Bool which automatically selects the right function to call based on the types of the two intersectables? Regards, - clark

3 4

Conduit Sink fork
by t helfferich 05 Mar '12

05 Mar '12

Hi! So, it turns out I have a need for a sink that forks input into two other sinks using the Conduit package. Here is what I came up with: https://gist.github.com/1975383 Is this the right way to write it? Also, what left over value(s) should I return in the Done constructor? I appreciate any help you can give me. Thanks so much,Grant

2 6

Reasons for Super-Linear Speedup
by burak ekici 05 Mar '12

05 Mar '12

Dear List; I have parallelized RSA decryption and encryption schemes by using second generation strategies of Haskell p.l. In that case, what I got in the sense of speed up was nearly 10 times of better performances (on a quad-core CPU with 8M cache) in the parallel evaluation of 125K long plain text with 180-bit of an encryption key, in comparison with the serial evaluation, abnormally. All my thoughts are in the direction of getting wrong serial-time performances. My question here is that is there any difference between serial and parallel evaluation of any arbitrary computation in terms of "cache usage methodologies" in Haskell compiler design. If no; what could be other possible reasons? I would be much more than appreciated, if somebody brings an acceptable pinpoint for the issue. Many thanks in advance. Kind regards Burak.

2 1

[haskell-cafe] Question about 64bit target on Windows platform
by C K Kashyap 05 Mar '12

05 Mar '12

Hi All, Can someone please let me know if there is a 64bit target on Windows on the horizon for GHC? I am trying to push for changing the current implementation in my organization in C++ to Haskell - Our primary targets are Windows and Mac. Not being able to generate 64bit DLL's on Windows would be a big bottleneck. Regards, Kashyap

3 4

Looking for an heap-like data structure allowing efficient update
by Arnaud Bailly 05 Mar '12

05 Mar '12

Hello Cafe, I am looking for a data structure that would have the following informal properties: - allow efficient retrieval of minimum element for some ordering relation on a computed property of the elements - allow efficient update of any element wrt to this property I have first tried to use a PQueue from fingertree package but it does not allow deletion/update of arbitrary elements. I then started to try combining this with a map but ran into the same issue. I skimmed through Okasaki's book (oldies but goldies...) and the basic finger tree structure but these does not seem to fit my needs. Thanks for your help Regards, Arnaud Bailly

2 2