- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] Choice of Linux distro redux
by John Wagner 21 Jun '11

21 Jun '11

Friends: When you say that support for GHCi is in general best among the Linux distros (unordered) "Gentoo, Arch, Fedora and Debian (I think Testing)", is Ubuntu to be inferred from Debian, or is there some scandalous and well-known to all (but me) malady that lingers around the bellies of Ubuntu distros that interferes with the purity of Glasgow, producing side-effects? My grandfather was a Scot, so I can be trusted: tell me if I should cast off Canonical ways. Thanks, John Wagner -- John Wagner Alhambra and Los Angeles

3 2

Re: [Haskell-cafe] [Haskell-beginners] boomBangs xs = [ if x < 10 then "BOOM!" else "BANG!" | x <- xs, odd x]
by Jack Henahan 21 Jun '11

21 Jun '11

Hi Anthony. What you've got there is a list comprehension. I'll try to break down what it says for you. The basic structure of a list comprehension is function <arguments> = [ description of the list ] In this function, the argument 'xs' is a Haskell idiom. We use 'xs' to mean "a list of x's". 'xs' doesn't *have* to be a list (since you can call anything 'xs'), but conventionally it is. So 'boomBang xs' simply means "the function boomBangs takes a list xs as an argument." Now the odd part, the list comprehension itself. The first part describes what will be in the list, and the second part limits it. What this comprehension does is construct a list of all the odd members of the list 'xs' (in this case, they're numbers) and map "BOOM!" to values under 10, and "BANG!" to anything above 10. So what is says is "if the nth number in my list is less than 10, I want you to make the nth element of the new list "BOOM!", otherwise I want you to make it "BANG!". Furthermore, I only want you to consider odd values of x from my list." So testList xs = [ x | x <- xs, odd x ] called with the list [1,4,8,9,12,15] would return [1,9,15] -- That is, all the odd members of the list xs Now, if 'x' is the expression 'if x < 10 then "BOOM!" else "BANG!"', the list returned is instead ["BOOM!","BOOM!","BANG!"] Decent explanation? Or have I just muddled the issue? On Jun 21, 2011, at 3:58 PM, anthony niro wrote: > Hello, > > My name is Anthony i have few question about Haskell. > > I was reading a tutorial everything goes well. but now i have few things that i dont understang. > > HERE: > > boomBangs xs = [ if x < 10 then "BOOM!" else "BANG!" | x <- xs, odd x] > > > > I dont understand this line except the "if" "then" "else". > What is xs? > what is the | ? > and why doing this " | x <- xs, odd x]" > > why x <- xs????? what is that > > and what is odd x? > > thx everyone for answer me. > _______________________________________________ > Beginners mailing list > Beginners(a)haskell.org > http://www.haskell.org/mailman/listinfo/beginners

1 0

[ANN] mysql-simple - your go-to package for talking to MySQL
by Bryan O'Sullivan 21 Jun '11

21 Jun '11

Hi, folks - Over the past few days, I've released two MySQL-related packages on Hackage that I think should be pretty useful. The first is mysql-simple: http://hackage.haskell.org/package/mysql-simple This is a mid-level binding to the MySQL client API. I aimed it squarely at being both fast and easy to use, and I'm very pleased with the results so far. - Performance: compared to HDBC-mysql, mysql-simple yields a 60% performance improvement on my real-world application. - Ease of use: compared again to HDBC, my real-world application's DB-specific code shrunk by 50% while achieving the above performance increase. - Type safety: it's intentionally hard to construct SQL queries by string concatenation, but of course I provide some nice safe APIs for formatting queries and converting results. That safety does not come at the expense of performance or expressive bloat, as the above results indicate. Because I know that some people favour interacting with their databases via a model such as iteratees, the mysql-simple library is built on top of a very lightweight library. That lower-level library is named mysql: http://hackage.haskell.org/package/mysql This is a low-level binding to the MySQL client API. It is aimed at high performance and simplicity, but more specifically for consumption by authors of higher-level database libraries. It is bare enough of features that it doesn't even perform conversion between Haskell and SQL types, but at the same time it uses bytestrings sensibly, cheaply avoids some nasty signal interruption problems with the MySQL client library, and abstracts some of the tiresome details of memory management. It gives a higher-level library complete control over result conversion, how to fetch results, and all that, so you can focus purely on building iteratees and not the lower-level gunk. Enjoy! B.

5 11

Opaque types vs automated instance deriving
by Alexey Karakulov 21 Jun '11

21 Jun '11

Hi all, I encountered a problem when trying to > derive makeBinary ''DiffTime with help of *derive* package. The error was: Not in scope: data constructor `MkDiffTime' Which makes a sense, since it's not exported in Data.Time.Clock. I bypassed the problem (yes, I'm too lazy to write instances by hands) with > instance Binary UTCTime where > put = putGeneric > get = getGeneric But it must be less efficient (and more verbose) than compile-time deriving. If there was such a module like Data.Time.Clock.Internal, I could import it to get hidden constructors (and maybe I'll have to fork the library for this purpose). OTOH, is it possible to change the derive TH function so it can bypass module encapsulation mechanism and access un-exported things?

2 1

Haskell on iPad? (Scheme and Ocaml are there)
by John Velman 21 Jun '11

21 Jun '11

There are (at least) two Scheme interpreters for iPad at the iTunes store: PixieScheme and GambitREPL. Both allow entry of scripts, by typing or pasting. The Gambit community is very busy trying to expand the usefulness of their interpreter. Both have pretty good interfaces. There is also an Ocaml app, but I don't know or want to know Ocaml, and the interface looks very unfriendly. I'd really like to have something like this in Haskell, in the "education" pot, as is the GambitREPL. Hugs is written in C, if I recall correctly. Would it be possible to compile Hugs for the iPad processor, taking out enough system calls to make it acceptable? John Velman

8 14

Job position for haskell/clojure dev. in San Dimas, CA
by vagif.verdi＠gmail.com 20 Jun '11

20 Jun '11

Anyone interested in full time employment working with haskell and clojure in San Dimas, CA (local job only, NO telecommute) please let me know. Regards, Vagif Verdi

2 1

AusHac2011 - The Australasian Haskell Hackathon - July 8-10
by Alex Mason 20 Jun '11

20 Jun '11

It's almost that time of year again! Next month is the second annual AusHac event, at UNSW in Sydney, and you are invited! But if you want to come, we need to hear from you soon, as we need to organise access to the university network for you. If you're an Australian Haskell hacker, enthusiast, newbie or professional, we would love to see you there. Below is the announcement, if you have any questions, please just hit reply, and Ivan or I will get back to you. We would absolutely love to see you there if you can make it, we'd love for this year to be even more awesome than last year. -- Alex Mason ------------------------------------------------------------------------------ ==== Attention all Australasian Haskellers! ==== After last year’s fantastic turnout for the first Australian Haskell Hackathon - AusHac 2010 - we’ve decided to organise another. As it’s rather boring to have a Hackathon with only two people, we encourage and welcome anyone interested in Haskell in Australia, New Zealand and surrounding areas (or further afield if you want!) to come and join us. Last year we had more than 25 Haskellers come from Brisbane, Canberra, Melbourne, Sydney and even two from as far away as New Zealand. AusHac 2011 will be held from Friday July 8th until Sunday July 10th, again at UNSW’s Computer Science building in Sydney. There’s no need to come for the entire weekend, just for whenever you’re able to. Last year, people worked on several projects including: • Accelerate: a high performance library for array computations using various backends (CUDA, LLVM, etc.) being written at UNSW. • Leksah: the Haskell IDE written in Haskell • DDC: the compiler for the Haskell-like language Disciple, which has strict evaluation by default, region, effect and closure typing and other interesting language features. • Hubris: the Haskell/Ruby bridge for calling Haskell from Ruby and vice-versa. • haskell-mpi: bindings to MPI, the message passing interface used frequently on high performance super-computers to allow programs to run on many nodes in parallel with easy communication. • There was even some work on LLVM to produce HTML output showing register allocations (as an aid to those writing new code generators etc.), which has now been included upstream. This work did not use Haskell, but it did happen at AusHac 2010. • And much more! This is a great chance to collaborate with others and get feedback on your work, while having heaps of fun and meeting other Haskellers, to verify they do actually exist! And don’t worry if you can’t think of a project to work on; just come along and pitch in with whatever strikes your fancy! If you’re interested in coming and have a project you’d like to work on, check out the wikipage http://www.haskell.org/haskellwiki/AusHac2011 where you can add your project ideas, or just take a look and see what others will be working on that you can help out with. People of all skill levels are welcome, from complete beginners to Oleg-level sage masters. We’re more than happy to help you learn Haskell if you’re just starting out or help you solve that little niggly bit in your code. If you’re interested in coming along, fill out our registration form http://axman6.wufoo.com/forms/aushac-2011-sign-up/. Registration is required so we know numbers and for you to get access to the university Wifi. Even if you’re not sure, fill it in to express your interest, obligation free. We’d rather know we have room for too many people than not enough. So come along! And if for some reason you don’t enjoy yourself, registration comes with a money-back guarantee! Hope to see you there, -- Alex Mason and Ivan Miljenovic, AusHac organisers ------------------------------------------------------------------------------

1 0

Text report tools?
by Dmitri O.Kondratiev 20 Jun '11

20 Jun '11

Hi, I am looking for an easy way to generate text reports. For starters I need a very simple report that may contain: - Some headers - Lists of text strings where each string can include instances of basic Haskell types. Each string should be printed on a separate line (terminated with LF). Do I understand this right that for such simple reports (as above) Text.Printf is the main tool? As a next step, a simple report engine controlled by templates or DSL would help. Thanks!

3 2

Probably type checker error.
by Serguey Zefirov 20 Jun '11

20 Jun '11

Right now I write a quite heavy transformation of Haskell source code and found some strange behaviour of typechecker. Some prerequisites: -- dummy class. My own class is much bigger, but I -- could reproduce that behaviour with that class. class ToWires a -- a type with phantom type arguments. data E ins outs = E -- a function that relates E and its inputs. projectInsType :: E ins outs -> ins projectInsType = error "projectInsType gets evaluated." -- "register" function. register :: a -> a -> a register def a = def -- a simple addition. add2 :: (ToWires a, Num a) => (a,a) -> a add2 (a,b) = a+b First I have a function: func :: (ToWires a, Num a) => Maybe a -> a func mbA = currentSum where x = case mbA of Just a -> a Nothing -> 0 nextSum = add2 (x,currentSum) currentSum = register 0 nextSum It typechecks and works just fine after some transformation. The transformation I work on transform code into something like that: func_E :: (ToWires a, Num a) => E (Maybe a) a func_E = r where r = E -- here we relate mbA and r. mbA = projectInsType r x = case mbA of Just a -> a Nothing -> 0 nextSum = add2 (x,currentSum) currentSum = register 0 nextSum Note the absence of input of func in transformed func_E. I relate mbA with it's proper type using binding "mbA = projectInsType r". Then suddently ghc loses all of the context associated with mbA. And find type error at the calling of add2. If I drop ToWires from contexts of func_E and add2 types, all works fine. If I change add2 to simple addition (x + currentSum), all works fine. Full source code is in attachment. I found it using ghc 6.12.1. I asked colleagues, they told me that the same error manifests itself in ghc 7.0.3. Should I fill a bug report or maybe I misunderstood something?

5 8

ANNOUNCEMENT: TinyLaunchbury 1.0.1
by Elliot Stern 20 Jun '11

20 Jun '11

Sankel Software is pleased to announce the release of TinyLaunchbury 1.0.1 [1], a small implementation of John Launchbury's natural semantics for call-by-need. We hope that is is useful in helping to understand how call-by-need works. There is also a new blog post[2], explaining the semantics, the code and why the semantics are useful to understand. Elliot Stern Sankel Software [1] http://hackage.haskell.org/package/TinyLaunchbury [2] http://netsuperbrain.com/blog/posts/haskells-evaluation-isnt-magic/

1 0