- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] What on earth
by Miguel Mitrofanov 21 Sep '07

21 Sep '07

> tfoldr (-) 1 [4,3] > = 4-3-(-1) > = 2 Erm? You mean "foldr"? foldr (-) a [x,y,z,t,w] == x - (y - (z - (t - (w - a)))) So, foldr (-) 1 [4,3] == 4 - (3 - 1). > A similar thing happens with foldr (/) 2 [8,2] = 8.0 8/(2/2) = 8/1 = 8 > I thought foldr \oplus v [] = v Yeah, that's right.

2 1

Haskell guards
by Victor Nazarov 20 Sep '07

20 Sep '07

I still can't remember how guards are treated in Haskell. Here is the code snippet in question: foo a | a == 1 = 6 foo a | a == 2 = 7 foo a = 8 Would Haskell fall through to the third alternative if a is not equal to 1 or 2. I know that this can be rewritten more sanely, but I just consider guard behavior. What would be the value of (foo 3)? -- vir http://vir.comtv.ru/

2 1

length defined with foldr
by PR Stanley 20 Sep '07

20 Sep '07

Hi length = foldr (. n . 1 + n) 0 Any idea how to define length with foldr. The above definition doesn't make much sense. Many thanks, Paul

4 3

Spot the difference!
by PR Stanley 20 Sep '07

20 Sep '07

Hi \_ n -> 1 + n \_ -> (\n -> 1 + n) The outcome seems to be identical. is there a substantive difference between the two definitions? The second one seems to be more expressive of the currying principle. Any thoughts? Thanks, Paul

6 9

Call for Abstracts for 3rd SAPLING Meeting, November 12, 2007
by Manuel M T Chakravarty 20 Sep '07

20 Sep '07

Call for Abstracts for 3rd SAPLING Meeting, November 12, 2007 Sydney Area Programming Language INterest Group http://www.comp.mq.edu.au/plrg/sapling.html 10am-4:30pm, November 12, 2007 Engineering Theatre, Building 32 (Engineering) Australian National University Invited Speaker --------------- Prof William M Waite, University of Colorado, Boulder, USA About SAPLING ------------- SAPLING aims to promote and develop academic research in the Programming Languages field within the Sydney area, including nearby regional centres such as Canberra, Newcastle and Wollongong. Important Dates: ---------------- - Submission deadline: Oct 15, 2007 - Notification: Oct 19, 2007 - Workshop: November 12, 2007 SAPLING Meetings ---------------- SAPLING meetings are held twice a year to allow programming language academics, researchers and students to present and discuss their research in an informal setting. The third meeting will be held at the Australian National University. SAPLING talks are generally of 20 minutes duration with substantial periods of time available for discussion. Talks can present completed work, outline work in progress, demonstrate a system, or provide a short tutorial on a topic of general interest. Submissions for talks should be in the form of an abstract no longer than one A4 page in plain text, PostScript or PDF format. The abstract should be emailed to Tony Sloane (asloane AT ics.mq.edu.au) by close of business on October 15, 2007. As far as possible, selection of presenters is non-competitive, with all interested qualified speakers given an opportunity to talk, within the time constraints of a one day meeting. Preference will be given to topics of general interest. No proceedings will be published but the talk abstracts and links to related material will be published on the SAPLING website. There is no registration fee to attend this meeting. Participants will be responsible for their own lunch costs. Accommodation ------------- For non-Canberra residents, some accommodation suggestions are available on the web site for this meeting: http://www.comp.mq.edu.au/~asloane/pmwiki.php/SAPLING/SAPLING072 Steering Committee: ------------------- Anthony Sloane, Macquarie (Chair), asloane AT ics.mq.edu.au Manuel Chakravarty, UNSW, chak AT cse.unsw.edu.au Clem Baker-Finch, ANU, Clem.Baker-Finch AT anu.edu.au

1 0

wxhaskell package for ubuntu feisty, amd64
by Iván Pérez Domínguez 20 Sep '07

20 Sep '07

I'm trying to install wxhaskell in ubuntu feisty, with ghc-6.6. After several days of trial and error and a few hours trying to change all types in my program to gtk2hs types, I'm tired. Does anyone have a .deb for wxhaskell that works with ghc-6.6?

3 3

What on earth
by PR Stanley 20 Sep '07

20 Sep '07

Hi tfoldr (-) 1 [4,3] = 4-3-(-1) = 2 A similar thing happens with foldr (/) 2 [8,2] = 8.0 I thought foldr \oplus v [] = v Any ideas? Thanks, Paul

1 0

Re: [Haskell-cafe] length defined with foldr
by PR Stanley 20 Sep '07

20 Sep '07

>>Still fighting with the botched OCR? >>I am, as a matter of fact! Is that okay with you? *smile* > > > >>length = foldr (\_ n -> 1 + n) 0 >> >>-- >>brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery(a)kf8nh.com >>system administrator [openafs,heimdal,too many hats] allbery(a)ece.cmu.edu >>electrical and computer engineering, carnegie mellon university KF8NH

1 0

Why isn't pattern matching lazy by default?
by Peter Verswyvelen 20 Sep '07

20 Sep '07

I'm experimenting with functional reactive programming for creating simple 2D/3D video games and interactive apps, trying to develop my own version of it from scratch, for learning Haskell. I got stuck with an endless loop when trying to split a stream into a pair of two streams (a kind of reactive if/then/else). Luckily I first read the Haskell School of Expression so I remembered that pattern matching is not lazy and this could be the cause, which it was (I had to replace (x:xs) by ~(x:xs)) I could also fix the problem by not using pattern matching at all, using head/tail calls instead. Now why isn't pattern matching lazy by default? This seems odd for a newbie since everything else is lazy by default. Thanks, Peter

11 20

Re: [Haskell-cafe] Missing Symbol (2)
by PR Stanley 19 Sep '07

19 Sep '07

The book is very well written. I did try to follow the wikibook thingummajig but found the English a bit trying. Cheers Paul t 07:43 19/09/2007, you wrote: >Paul, > >The Hutton book has gotten great reviews, but pouring over a faulty >OCRd version can only be counterproductive. I highly recommend Yet >Another Haskell Tutorial[1]. After that you can check out all the >other wonderful online resources (starting here [2]). At that point a >few OCR errors won't be able to stand in your way! > >Best wishes on you Haskell explorations, >Joel > >[1] http://www.cs.utah.edu/~hal/docs/daume02yaht.pdf >[2] http://haskell.org/haskellwiki/Learning_Haskell >_______________________________________________ >Haskell-Cafe mailing list >Haskell-Cafe(a)haskell.org >http://www.haskell.org/mailman/listinfo/haskell-cafe

3 4