- Haskell-Cafe - Haskell.org

Fwd: C9 video in the Monadic Design Patterns for the Web series
by Greg Meredith 27 Jul '11

27 Jul '11

Dear Haskellians, A new C9 video in the series! So, you folks already know most of this... except for maybe the generalization of the Conway construction! Best wishes, --greg ---------- Forwarded message ---------- From: Charles Torre <...> Date: Tue, Jul 26, 2011 at 1:12 PM Subject: C9 video in the Monadic Design Patterns for the Web series To: Meredith Gregory <lgreg.meredith(a)gmail.com> Cc: Brian Beckman <...> And we’re live!**** ** ** http://channel9.msdn.com/Shows/Going+Deep/C9-Lectures-Greg-Meredith-Monadic… **** C**** ** ** *From:* Charles Torre *Sent:* Tuesday, July 26, 2011 11:51 AM *To:* 'Meredith Gregory' *Cc:* Brian Beckman *Subject:* C9 video in the Monadic Design Patterns for the Web series**** ** ** Here it ‘tis:**** ** ** Greg Meredith <http://biosimilarity.blogspot.com/>, a mathematician and computer scientist, has graciously agreed to do a C9 lecture series covering monadic design principles applied to web development. You've met Greg before in a Whiteboard jam session with Brian Beckman<http://channel9.msdn.com/shows/Going+Deep/E2E-Whiteboard-Jam-Session-with-B…> .**** The fundamental concept here is the monad, and Greg has a novel and conceptually simplified explanation of what a monad is and why it matters. This is a very important and required first step in the series since the whole of it is about the application of monadic composition to real world web development.**** In *part 4, *Greg primarily focuses on the idea that *a monad is really an API* -- it's a view onto the organization of data and control structures, not those structures themselves. In OO terms, it's an *interface*. To make this point concrete Greg explores one of the simplest possible data structures that supports at least two different, yet consistent interpretations of the same API. The structure used, Conway's partisan games<http://mathworld.wolfram.com/ConwayGame.html>, turned out to be tailor-made for this investigation. Not only does this data structure have the requisite container-like shape, it provided opportunities to see just what's necessary in a container to implement the monadic interface. ** ** Running throughout the presentation is a more general comparison of reuse between an OO approach versus a more functional one. When the monadic API is "mixed into" the implementing structure we get less reuse than when the implementing structure is passed as a type parameter. Finally, doing the work put us in a unique position to see not just how to generalize Conway's construction, *monadically*, but the underlying pattern which allows the generalization to suggest itself.**** See *part 1 <http://channel9.msdn.com/Shows/Going+Deep/C9-Lectures-Greg-Meredith-Monadic…> *See *part 2<http://channel9.msdn.com/Shows/Going+Deep/C9-Lectures-Greg-Meredith-Monadic…> ** *See* part 3<http://channel9.msdn.com/Shows/Going+Deep/C9-Lectures-Greg-Meredith-Monadic…> ***** ** -- L.G. Meredith Managing Partner Biosimilarity LLC 7329 39th Ave SW Seattle, WA 98136 +1 206.650.3740 http://biosimilarity.blogspot.com -- L.G. Meredith Managing Partner Biosimilarity LLC 1219 NW 83rd St Seattle, WA 98117 +1 206.650.3740 http://biosimilarity.blogspot.com

3 5

Approximate String Matching
by dokondr 27 Jul '11

27 Jul '11

Hi, I am looking for Haskell libraries to do approximate string matching: http://en.wikipedia.org/wiki/Approximate_string_matching I need this to reduce a set of English word variants with spelling errors to a single canonical dictionary entry. Any libraries to work with spelling will also help. Thanks, Dmitri

2 1

Stack space overflow in HaskellNet
by Manfred Lotz 27 Jul '11

27 Jul '11

Hi there, If I take example imap.hs import System.IO import Network.HaskellNet.IMAP import Text.Mime import qualified Data.ByteString.Char8 as BS import Control.Monad -- the next lines were changed to fit to my local imap server imapServer = "imap.mail.org" user = "" pass = "" main = do con <- connectIMAP imapServer login con user pass mboxes <- list con mapM print mboxes select con "INBOX" msgs <- search con [ALLs] mapM_ (\x -> print x) (take 4 msgs) forM_ (take 4msgs) (\x -> fetch con x >>= print) and change the last line (in order to print all messages of the mailbox) into: forM_ msgs (\x -> fetch con x >>= print) I get Stack space overflow: current size 8388608 bytes. Use `+RTS -Ksize -RTS' to increase it. Is this something to be fixed in the HaskellNet code, or in the example code? -- Manfred

6 13

Question re SMTPClient
by Jayakumar Ramanathan 27 Jul '11

27 Jul '11

How does one pass authentication info to the SMTP server when using the package STMPClient? Thanks! Jay

1 0

Typeclasses, data, constructors
by Sergiy Nazarenko 27 Jul '11

27 Jul '11

Hi everyone! I have data declaration like this: data MyTable = MyTableOne Int String | MyTableTwo Int String String and function that insert new row in tables: newRow :: MyTable -> IO Int newRow (MyTableOne fld1 fld2 ) = ..... newRow (MyTableTwo fld1 fld2 fld3 ) = ...... That work perfectly, I enjoy it. But now I want to get rows, and I don't know what to do :( I want func something like this: getRow :: Int -> [MyTable] .... - what should I write here ? Possibly use this function: getRow 23 :: MyTableTwo (like haskell function Read for example: read "7" :: Int) I try to use typeclasses, class GetRow a where hasID :: Int -> IO a instance GetRow MyTableOne where hasID myid = return [(MyTableOne 1 "name")] instance GetRow MyTableTwo where hasID myid = return [(MyTableTwo 1 "name" "path")] But I have error: Not in scope: type constructor or class `MyTableOne' make: *** [Foo.so] Error 1 Not in scope: type constructor or class `MyTableTwo' make: *** [Foo.so] Error 1 I ask you to suggest me right way in my efforts Cheers!

2 1

file splitter with enumerator package
by Eric Rasmussen 27 Jul '11

27 Jul '11

Hi everyone, A friend of mine recently asked if I knew of a utility to split a large file (4gb in his case) into arbitrarily-sized files on Windows. Although there are a number of file-splitting utilities, the catch was it couldn't break in the middle of a line. When the standard "why don't you use Linux?" response proved unhelpful, I took this as an opportunity to write my first program using the enumerator package. If anyone has time, I'm really interested in knowing if there's a better way to take the incoming stream and output it directly to a file. The basic steps I'm taking are: 1) Data.Enumerator.Binary.take -- grabs the user-specified number of bytes, then (because it returns a lazy ByteString) I use Data.ByteString.Lazy.hPut to output the chunk 2) Data.Enumerator.Binary.head -- after using take for the big chunk, it inspects and outputs individual characters and stops after it outputs the next newline character 3) I close the handle that steps 1&2 used to output the data and then repeat 1&2 with the next handle (an infinite lazy list of filepaths like part1.csv, part2.csv, and so on) The full code is pasted here: http://hpaste.org/49366, and while I'd like to get any other feedback on how to make it better, I want to note that I'm not planning to release this as a utility so I wouldn't want anyone to spend extra time performing a full code review. Thanks! Eric

5 13

Library for Sparse Vectors?
by dokondr 26 Jul '11

26 Jul '11

Hi, Can't find on hackage any sparse vector library. Does such thing exist? I need efficient storage and dot product calculation for very sparse vectors with about 10 out of 40 000 non-zero components. One solution would be to represent Sparse Vector as Data.Map with (component_index, component_value) pairs to store non-zero components of the vector. In this case, for example, calculating cosine similarity ( http://en.wikipedia.org/wiki/Cosine_similarity) for for every pair of 10 000 vectors, would not be very nice and efficient, I am afraid. Thanks!

3 5

Effects of Monads in Parallelisation
by Burak Ekici 26 Jul '11

26 Jul '11

Dear List, I am currently trying to understand the effects of monads in the sense of parallelisation in Haskell. Could somebody please explain the difference between 'rpar' and 'par'? I mean, what has been changed after the encapsulation of 'par' function by Eval monad? If you asked to compare the parallelisation via monads with non-monadic manner of it, what could you say? Many thanks in advance. All the best, Burak.

2 1

Fwd: Re: How to select last inserted record from Table Using Database.HSQL.MySQL
by Steffen Schuldenzucker 26 Jul '11

26 Jul '11

Forwarding to list -------- Original Message -------- Subject: Re: [Haskell-cafe] How to select last inserted record from Table Using Database.HSQL.MySQL Date: Tue, 26 Jul 2011 14:27:56 +0300 From: Sergiy Nazarenko <nazarenko.sergiy(a)gmail.com> To: Steffen Schuldenzucker <sschuldenzucker(a)uni-bonn.de> Thanx a lot! I could solve that problem in this way: cmd = " INSERT INTO mytable (bar,foo) VALUES ("val1","val2"); SELECT LAST_INSERT_ID() as id;" lst <- query connection cmd >>= collectRows (\st -> getFieldValue st "id") lst has required value Cheers!

1 0

Why the reluctance to introduce the Functor requirement on Monad?
by Arlen Cuss 26 Jul '11

26 Jul '11

Hi cafe! I feel a bit like I'm speaking out of turn for bringing this up -- and I'm sure it must have been brought up many times before -- but I hope there can be something fruitful had from a discussion. In my travels I've read several people with much better grasp of Haskell than I have mention -- with a sad sigh of resignation -- that functions like liftM and return abound because some Monads don't state their fulfillment of Functor (or Applicative, but that's even more recent), and thus we can't use fmap/<$> or pure. I understand a motivation might be that code would break if the former lot were removed, but surely they could shifted to the latter (and the former simply be defined as the latter). It might be a very large effort, I suppose, to comb through the standard libraries and make everything compile again, but is there something else I'm surely missing? Cheers, A

10 13