- Beginners - Haskell.org

not able to compile Happy GLR files
by trailblayzr 22 Sep '08

22 Sep '08

I'm unable to compile the GLR examples (in the 'glr' directory) provided with Happy, version 1.16. I'm using ghc version 6.6.1. I've looked at the version of Happy currently in darcs and the pertinent part of the examples has not been updated there, either. This Happy seems out of date because it uses the flag "-package data"; my searching indicates that the 'data' package is old. Other errors remained after I removed the flag. Would someone please verify the error? Also, does anyone know of or have a GLR example that works? Thank you for reading or helping.

1 0

fold over elem?
by Logesh Pillay 20 Sep '08

20 Sep '08

I want to check if all the numbers in a list A are elements of a bigger unordered list B. Is there some way to fold /A into elem /B?

4 3

Request for Another State Monad Example
by Mike Sullivan 19 Sep '08

19 Sep '08

Hi All, As I'm sure all Haskell beginners do, I'm having a bit of a struggle wrapping my head around all of the uses for monads. My current frustration is trying to figure out how to use the state monad to attach some persistent state between different calls to a function. I have two questions that I would appreciate it if somebody could help me with. The ubiquitous state monad example for Haskell tutorials seems to be a random number generator, with a function like the following (from http://www.haskell.org/all_about_monads/html/statemonad.html#example) getAny :: (Random a) => State StdGen a getAny = do g <- get (x,g') <- return $ random g put g' return x My first question is very basic, but here it goes: I see it everywhere, but what does the "=>" signify? Specifically, in this example what does "(Random a) =>" do in the type signature? My second question is more of a request, I suppose. I think it would be useful to get another example that does not have the added complications of dealing with the Random package, and saves more than one piece of data as state. How would one go about (for example) creating a Fibonacci sequence generator that saves the last state, such that on each call it returns the next number in the Fibonacci sequence? Thank you, Mike

2 3

Looking for a data structure
by Levi Stephen 17 Sep '08

17 Sep '08

Hi, I'm looking for how best to represent selections from a set of items. For example, consider a soccer/football type game. You would have a Player data type. The game would store a player pool of all players in that game. Each club will have a number of players from that player pool, each match will involve that club selecting a number of players from its list of players. What is the best way to structure this data and hopefully at the type level enforce this subset type relationship? Thanks, Levi

3 3

Random nub questions!
by Casey Rodarmor 15 Sep '08

15 Sep '08

Hi everybody, Haskell is great! I have some questions: Why is this: (+ 1) a curried invocation of the the plus operator, but this: (+ 1 2) is an error? And in the same vein, why is this a negative number: (- 1) instead of a curried invocation of the subtraction operator? Why can't I do this: 1 `(+)` 2 even if it is a little pathological? And this might be a little implementation dependent, although I'll hazard it anyways: Why can't I assign to things when running GHCi? Given my experience with C like languages, the first thing I wanted to do with GHCi was to start assigning to variables. I know that Haskell is purely functional, but it seems like it should be able to allow assignment from the interpreter by raising errors on rebinding. (Just like in erl, the erlang interpreter.) All the best, Casey

2 1

Named (custom) recursions vs clever comonadic recursions
by Federico Brubacher 14 Sep '08

14 Sep '08

Hey all, Today I had a small exchange with another reddit user about CT and why is important to Haskell programming... What I don't get yet (as the subject says) is a real-world example on where you might apply cathegory theory to a recursion. Here is the small thread : fbru02: Sorry for maybe the OT posting but I have a question of my own: While learning Haskell and being a curious procrastinator I started learning Category theory but although I get , I don't get it yet. What I want to ask is practical uses of cathegory theory ? I know that it is used for high availability systems for theoretical proof that a System has the correct side effects. Also I know there are in reality recursions that might need this stuff as they are not as simple as what one would write in a toy project. What are this recursion schemes ?? What other uses there are for CT? nbloomf: Disclaimer- I am only beginning to understand this stuff myself. I am also a mathematician, not a computer scientist or a professional programmer. Two papers that give a good overview of what categories can do are "Functional Programming with Bananas, Lenses, etc." and "Recursion Schemes from Comonads". My understanding of the role of categories in FP (at least partly) is as follows. Arbitrary recursion is very useful to writers of programs. However, like arbitrary GOTOs, it can make it hard to see what's "really" happening in a program. A long time ago people figured out that fold/reduce was a common recursive pattern, but it was generally only used on lists and couldn't express all the recursion people wanted to do. More recently it was discovered that if your language is strongly typed, you can think of the types as objects in a category. Then some type constructors become endofunctors, and the traditional fold can be expressed as a particular map, parameterized by the functor, having a nice universal property. Moreover, as the "Recursion schemes from comonads" paper discusses, by parameterizing on the comonad the fold operator can become several different recursion schemes. This means a much smaller amount of code can express a larger number of ideas- even ideas that haven't been had yet. Moreover, it makes optimizations (such as fold fusion) much more powerful. So the real power of category theory is as a metalanguage- these ideas might never have become "obvious" without the language of functors, algebras, initial objects, and such. fbru02 : thank you for great response. Have you yourself used this parametraizing of the comonad? In which context or solving which problem and why couldn't you solving easily making a normal named recursion :D Thanks a lot ! :D Thanks ! -- Federico Brubacher www.fbrubacher.com Colonial Duty Free Shop www.colonial.com.uy

2 1

Non-exhaustive case leads to runtime error?
by Rafal Kolanski 09 Sep '08

09 Sep '08

Greetings, I just ran into the following situation in an IO do block: case msel of Just sel -> do toggleFretArea selectionRef sel widgetQueueDraw canvas Nothing -> return () except I omitted the last line. I expected the compiler to complain, but it silently compiled it, and I got a runtime exception when the program ran instead. Is this behaviour intentional? Can I get ghc to warn me about it anyway (something like -Wall)? Two more guiding questions: 1. What is a good idiom for "In this case do blah otherwise don't do anything"? 2. Is there a shorter way of writing a no-op in a do block than "return ()"? Thanks in advance! Rafal Kolanski.

2 1

(no subject)
by Anish Muttreja 09 Sep '08

09 Sep '08

-- As an adolescent I aspired to lasting fame, I craved factual certainty, and I thirsted for a meaningful vision of human life - so I became a scientist. This is like becoming an archbishop so you can meet girls. -Matt Cartmill, anthropology professor and author (1943- )

1 0

[Haskell-cafe] select :: [(Float, a)] -> a -- Weighted stochastic selection - help?
by Tim Millea 08 Sep '08

08 Sep '08

I am already using the following function pickOne xs g = (xs !! r, g') where (r, g') = Random.randomR (0, length xs - 1) g but I need to weight the items in the list, e.g. [(0.1, 'a') , (0.9, 'b')] for stochastic selection in a purely functional way, i.e. no monads. Any ideas welcome. Tim.

8 22

Explanation of double astrix
by Paul Johnston 03 Sep '08

03 Sep '08

Hi Was playing around with ghci and lambda expressions and: *Main> map (\x -> 2 * x) [1 ..3] [2,4,6] Then thinking back to Fortran (yes I'm not young anymore!) *Main> map (\x -> 2 ** x) [1 ..3] [2.0,4.0,8.0] Curious as to what is going on. *Main> :t (\x -> 2 ** x) (\x -> 2 ** x) :: (Floating t) => t -> t *Main> :t (\x -> 2 * x) (\x -> 2 * x) :: (Num t) => t -> t Somehow the type has gone from Num to Floating I am using the excellent (IMHO) tutorial by Hal Daume and the book by Graham Hutton but can find no clues. Cheers Paul

4 3