December 2007 - Haskell-Cafe

fast Array operations: foldl, drop
by Henning Thielemann 02 Dec '07

02 Dec '07

I thought operations like "foldl'" and "drop" must be very fast on arrays (especially UArray) with appropriate pointer tricks, I mean pointer incrementing instead of indexing for "foldl'" and a pointer into the array for "drop". Is it planned to add such functions? Ok, if "foldl f x . elems" and "listArray (i,sufficientlyBig) . drop n . elems" are fused to high speed code, then these functions do not need to materialize in the API.

8 11

ANN: Teach Yourself Gtk2Hs in 21 Hours
by Hans van Thiel 02 Dec '07

02 Dec '07

Hello All, The Gtk2Hs basics tutorial, based on the Tony Gale and Ian Main GTK+2.0 tutorial, is now available for review and comment. The TOC: 1. Introduction 2. Getting Started 3. Packing 3.1 Packing Widgets 3.2 Packing Demonstration Program 3.3 Packing Using Tables 4. Miscellaneous Widgets 4.1 The Button Widget 4.2 Adjustments, Scale and Range 4.3 Labels 4.4 Arrows and Tooltips 4.5 Dialogs, Stock Items and Progress Bars 4.6 Text Entries and Status Bars 4.7 Spin Buttons 5. Aggregated Widgets 5.1 Calendar 5.2 File Selection 5.3 Font and Color Selection 5.4 Notebook 6 Supporting Widgets 6.1 Scrolled Windows 6.2 Event Boxes and Button Boxes 6.3 The Layout Container 6.4 Paned Windows and Aspect Frames 7. Action Based Widgets 7.1 Menus and Toolbars 7.2 Popup Menus, Radio Actions and Toggle Actions This covers about half of Gtk2Hs (guesstimate) but (hopefully) most of what's needed for the run of the mill GUI. It's available or will be on http://darcs.haskell.org/gtk2hs/docs/tutorial/Tutorial_Port/ http://j-van-thiel.speedlinq.nl/gtk2hs/index.html Thanks to Alex Tarkovsky it's in XHTML and well structured for easy maintenance and adaptation. I hope a Gtk2Hs basics tutorial will help to popularize this large, powerful and sophisticated gui library for Haskell. Needless to say, please don't hesitate to comment and report errors. Regards, Hans van Thiel

4 3

Happy parsing wierdness
by Mike Menzel 02 Dec '07

02 Dec '07

Hi, I'm using the Happy parser, and I've threaded a Success/Failure monad-like thing through it so that if the parse succeeds, Success AST (AST is the datatype I want to turn my tokens into) is returned and if it fails, Fail String is returned (in a similar manner to how such threading is described in the Happy Documentation). That is, data SorF a = Succeed a | Fail String. Now, if the input is valid, I get the correct result (namely Success AST). If invalid input is given (ie the wrong token is encountered), happyError is triggered correctly, and and a Fail String is returned. However, if incomplete info is given (let's say a rule is expecting two tokens, and only one is read before the end of input), the parser generated by happy throws error("Reading EOF"). I have defined happyError on both the empty list of tokens, and the non-empty list as returning a Fail String. I'm stumped as to why I get this error. Any advice? Best, Mike.

1 0

Modelling a mutable variable store
by Kannan Goundan 01 Dec '07

01 Dec '07

I'm implementing an interpreter for the lambda calculus augmented with mutable variables. I'm having problems doing the mutable state stuff in Haskell. Here's what I have so far: type Expr = ... terms in the language ... type Value = ... values in the language ... type Ident = String type VarId = String type Env = Map Ident Target data Target = TValue Value | TVar VarId -- idents might refer to values or vars in the store. type Store = Map VarId (Maybe Value) -- Using "Maybe" because vars start out uninitialized. eval :: (Env, Store, Expr) -> (Store, Value) -- The Store is threaded through the evaluator. One problem is that the link between an identifier and it's entry in the store is via VarIds, which are just strings. For example, if I see the identifier "x", I first look it up in the Env, and if it is a "TVar", I then look it up in the store. I'd like to get something stronger (in Java, I would use a pointer). Another problem is that entries in my Store never get garbage collected. Again, if I were using pointers in Java, this wouldn't be an issue. There's also the issue of finding a more elegant way of threading the Store through my evaluator, but I'm not concerned too much about that at this point. I can probably define a state-carrying monad like Parsec. My real concerns are the first two issues. Thanks. - Kannan

4 5

Illegal type def
by PR Stanley 01 Dec '07

01 Dec '07

Hi > type assoc k v = [(k, v)] works beautifully and everything makes sense. > type Assoc v = (Ord k) => [(k, v)] This doesn't work. Is there any wayof defining k as an element of type Ordinal. I could redefine k by putting Char or Int in its place. Why can't I be more general? Thanks, Paul

3 2

Re: [Haskell-cafe] Sequencing Parsers: a Simple Example
by PR Stanley 01 Dec '07

01 Dec '07

> > PRS: (>>=) :: Parser a -> Parser b -> Parser b > > p >>= f = \inp -> > > case p inp of > > [] -> [] > > [(v, out)] -> parse (f v) out > >You probably want: > >(>>=) :: Parser a -> (a -> Parser b) -> Parser b >p >>= f = \inp -> case parse p inp of > [] -> [] > [(v,out)] -> parse (f v) out > >Assuming that you're following Graham Hutton's book. > >Note that this definition won't actually compile; you probably need a >Monad instance and a newtype to get this to work properly (see >http://www.cs.nott.ac.uk/~gmh/Parsing.lhs for a working version of the >same code). PRS: That explains it then. [(v, out)] -> parse (f v) out caused a type mismatch. Cheers, Paul

1 0

Sequencing Parsers: a Simple Example
by PR Stanley 01 Dec '07

01 Dec '07

Hi (>>=) :: Parser a -> Parser b -> Parser b p >>= f = \inp -> case p inp of [] -> [] [(v, out)] -> parse (f v) out based on a lot of guesswork, after the mess created by the OCR, I managed to get the above example to work syntactically but is it semantically correct? Thanks, Paul

2 1

trouble building "unix-2.2.0.0" on cygwin
by Galchin Vasili 01 Dec '07

01 Dec '07

Hello, 0) All work being done on cygwin. Version 6.8.1 of ghc. 1) I ran "runhaskell Setup.lhs configure" and did a "tail -f config.log" in order to follow the config process. 2) Next I did the build "runhaskell Setup.lhs build" but there were many include files referenced in HsUnix.h that couldn't be found, e.g. sys/times.h, sys/resources.h, sys/wait.h, .... 3) I went back through the file config.log and all of the so-called missing include files had supposedly been found during the config process. 4) Next I went to c:/cygwin/usr/include/sys and found all of the so-called missing include files. I am trying to get my confidence level up with respect to the config/build/install (and along with darcs and haddock) process up high so I can make a significant contribution to the Haskell effort. please .. any help will be appreciated. Kind regards, Vasya

2 2

Categories list in French (off-topic?)
by Maurício 01 Dec '07

01 Dec '07

Hi, I'm learning about categories using Saunders Mac Lane book. I'm also learning French. Do you guys know of a nice French mailing list, or forum, where people discuss about categories (and where beginners are accepted)? Sorry to ask that in a Haskell list, but you guys are the ones I know with interest in category theory. Thanks, Maurício

3 3

Editorial error or something meaningful?
by PR Stanley 01 Dec '07

01 Dec '07

Hi taken from ch.8.3 in the Hutton book: "Whereas return v always succeeds, the dual parser failure always fails regardless of the contents of the input string:" The dual parser failure? Cheers, Paul

3 2