- Haskell-Cafe - Haskell.org

Hackage vs. legacy support in Cabal files
by John D. Ramsdell 05 Mar '10

05 Mar '10

I'd like to support Hackage and GHC 6.8 with one source distribution. The enclosed Cabal file would do the trick if Hackage would simply evaluate the Cabal file using the default flag values. Instead, it chokes on a hack required to support GHC 6.8. The directory containing the autogen files has to be on the source path. if flag(old) Hs-Source-Dirs: src dist/build/autogen else Hs-Source-Dirs: src Is there a way to force Hackage to respect flag values? John

1 0

Re: A few ideas about FRP and arbitrary access in time
by Patai Gergely 05 Mar '10

05 Mar '10

> I'm not sure I want to follow WWRD all the way. I do want events, for > example mouse clicks (for which there doesn't seem to be any logical > behavior representation). As you note the pull-based approach does a > lot more work in those cases than seems necessary. Events are indispensable for practically all applications, even those that have continuous output, so leaving them out would be no option. I only did so for Elerea to be able to quickly get a working system running, so I can actually experiment with application-side design. But yeah, it can't be used for serious purposes without some support for events. > In any case, what I'm discussing in that report is mostly centered on > the continuous-time values, so I'm more concerned with what we call > behaviors. The question is how to model memory-full operations with > point-wise operations. I think it would help if you tried to solve more specific problems first and see what common structure you can factor out from the solutions. It's easy to get into a dead end if you go for the big picture right away. > Right. You'll agree that it would be nice to have a general approach? > How will that work? That's what I'd like to find out. And I do hope you'll manage to find a useful result. My intuition says, however, that looking for a sensible interface between events and behaviours is more fruitful than trying to unify these two notions. The reason is the difference in TCMs, as noted previously. > report. I'd like things to be unified, so maybe playing with the idea > of a total function to 'Maybe a' for events is the right direction. I > think this was already explored by some FRP incarnations, but I don't > recall what came out of it. Yes, that's the Yampa way. The problem is that in this case you'll need an awkward operator to refer to 'the time of last defined point'. > But isn't Lucid Synchrone essentially discrete-timed? Also, events > shouldn't be semantically constrained to multiples of some basic > clock, they are defined over continuous time. Of course, it's more like a possible model for operational semantics (I know you're interested in denotation, but inspiration can come from anywhere). I just thought that clock calculus might be an interesting topic to throw into the hat. Gergely -- http://www.fastmail.fm - Email service worth paying for. Try it for free

1 0

How to put data from a string to a tuple
by Pradeep Wickramanayake 05 Mar '10

05 Mar '10

Hi, Im self learner in Haskell. And im stuck in a small place which I tried searching in google but couldn't find Proper answer I have some values in a string, Im removing them one by one from the string (word by word) and I want to put them in a tuple. Because it contain Integers and Strings. Can someone help me __________ Information from ESET NOD32 Antivirus, version of virus signature database 4917 (20100305) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

3 2

How do you rewrite your code?
by Sean Leather 05 Mar '10

05 Mar '10

There are numerous threads on the Haskell Café involving rewriting, refactoring, refining, and in general improving code (for some definition of improve). I am interested in seeing examples of how Haskell code can be rewritten to make it better. Some general examples are: - Eta-reduce - Make more pointfree - Introduce monadic operators or do-notation - e.g. for Maybe, lists, State - Eliminate monadic operators or do-notation - Generalize types - e.g. change map to fmap, (++) to mappend - Use instances of Functor, Applicative, Alternative, Category, Arrow, Monoid, Traversable, etc. - Use library functions from Data.List, Data.Map, Data.Set, etc. - Use some form of generic programming (e.g. SYB, Uniplate, EMGM, Alloy) - Use other libraries not included in the Platform My question is simple: *How do you rewrite your code to improve it?* You can answer this in any way you like, but I think the most useful answer is to show a reasonably small, concrete example of what your code looked like before and after. Also, please describe how you think the rewrite improves such code. - Is it better style? More useful? More efficient? - Are the types (before and after) the same? - Are the semantics the same? - How did you prove or test equivalence? (e.g. Can you use equational reasoning to confirm the rewrite is valid? Did you use QuickCheck?) Here is an example that I find myself doing occasionally. For all x, f: x >>= return . f --> fmap f x or f <$> x -- requires importing Control.Applicative I think the right-hand side (RHS) is more concise and simpler. The types here do change: the type constructor has a Monad constraint in the left-hand side and a Functor constraint in the RHS. Types that are Monad instances are generally also Functor instances, so this is often possible. I'm convinced the semantics are preserved, though I haven't proven it. What's an example of a rewrite that you've encountered? Thanks, Sean

13 14

QOTM: It's a series of 3 TLAs designed to make people who know what they are feel more in-the-know than those who don't.
by caseyh＠istar.ca 05 Mar '10

05 Mar '10

CBV, CBN, CBL

2 1

ANNOUNCE: wai-0.0.0 (Web Application Interface)
by Michael Snoyman 04 Mar '10

04 Mar '10

Hello all, I'd like to announce the first release of the Web Application Interface package[1]. The WAI is a common protocol between web server backends and web applications, allowing application writers to target a single interface and have their code run on multiple server types. There are two previous implementations of the same idea: the Network.Wai module as implemented in the Hyena package, and Hack. Some distinguishing characteristics of the wai package include: * Unlike Hack, this does not rely upon lazy I/O for passing request and response bodies within constrained memory. * Unlike Hyena, the request body is passed via a "Source" instead of Enumerator, so that it can easily be converted to a lazy bytestring for those who wish. * Unlike both, it attempts to achieve more type safety by have explicit types of request headers, response headers, HTTP version and status code. * It also removes any variables which are not universal to all web server backends. For example, scriptName has been removed, since it has no meaning for standalone servers. This package also contains separate modules for conversions to and from Sources and Enumerators. I am also simultaneously releasing two other packages: web-encodings 0.2.4[2] includes a new function, parseRequestBody, which directly parses a request body in a WAI request. It handles both URL-encoded and multipart data, and can store file contents in a file instead of memory. This should allow dealing with large file submits in a memory-efficient manner. You can also receive the file contents as a lazy bytestring. Finally, wai-extra 0.0.0 [3] is a collection of middleware and backends I use regularly in web application development. On the middleware side, there are five modules, including GZIP encoding and storing session data in an encrypted cookie (ClientSession). On the backend side, it includes CGI and SimpleServer. The latter is especially useful for testing web applications, though some people have reported using it in a production environment. All of the code is directly ported from previous packages I had written against Hack, so they are fairly well tested. As far as stability, I don't expect the interface to change too drastically in the future. I am happy to hear any suggestions people have for moving forward, but expect future versions to be mostly backwards compatible with this release. Also, future versions will respect the Package Versioning Policy[4]. Thanks to everyone who contributed their input. Michael [1] http://hackage.haskell.org/package/wai [2] http://hackage.haskell.org/package/web-encodings [3] http://hackage.haskell.org/package/wai-extra [4] http://www.haskell.org/haskellwiki/Package_versioning_policy

1 0

How do you set up windows enviroment
by Maciej Piechotka 04 Mar '10

04 Mar '10

How do you set up Windows environment? I'd like to develop few platform-specific code or rather port it to this platform. I tried to set up environment but I failed (darcs hanging on copy via ssh, command line is... well slightly better then in W98 etc.). Does anyone have a tips for setting Haskell environment on Windows 7. Regards

6 10

Prelude.undefined
by Tom Hawkins 04 Mar '10

04 Mar '10

How do I track down an reference to an undefined value? My program must not be using a library correctly because the program makes no direct use of 'undefined'. Running with +RTS -xc yields: <GHC.Err.CAF>Test: Prelude.undefined

8 12

ANNOUNCE: Parsec 3.1.0
by Derek Elkins 04 Mar '10

04 Mar '10

Parsec is a monadic combinator library that is well-documented, simple to use, and produces good error messages. Parsec is not inherently lazy/incremental and is not well-suited to handling large quantities of simply formatted data. Parsec 3 adds to Parsec the ability to use Parsec as a monad transformer and generalizes the input Parsec accepts. Parsec 3 includes a compatibility layer for Parsec 2 and should be a drop-in replacement for code using Parsec 2. Code using the features of Parsec 3 should use the modules in Text.Parsec. Due almost entirely to the work of Antoine Latter there is a new version of Parsec 3 available. He documented some of his thoughts on this in this series of blog posts: http://panicsonic.blogspot.com/2009/12/adventures-in-parsec.html The main features of this release are: - the performance should be much better and comparable to Parsec 2 - notFollowedBy's type and behavior have been generalized Changes: - the changes to the core of Parsec lead to some changes to when things get executed when it is used as a monad transformer "In the new version bind, return and mplus no longer run in the inner monad, so if the inner monad was side-effecting for these actions the behavior of existing code will change." - notFollowedBy p now behaves like notFollowedBy (try p) which changes the behavior slightly when p consumes input, though the behavior should be more natural now. - the set of names exported from Text.Parsec.Prim has changed somewhat

4 3

How to break strings and put to a tuple
by Pradeep Wickramanayake 04 Mar '10

04 Mar '10

Hi, sortList2 :: String -> String sortList2 (x:xs) | x == ',' = "" | otherwise = [x] ++ sortList2 xs im breaking a one specific string and putting them to each word. But I need to put them to a tuple. Can someone help me with the code Please.

2 1