|
why does this not work??? monoids and stuff...
|
| |
I would like to thank this community for answering my off the wall questions in the past, comp.lang.haskell has been quite helpful to me in learning haskell, but also functional programming. Here comes another. In a paper by Mark Jones "Functional Programming with Overloading and Higher-Order Polymorphism" he (re)defines the monoid class... далі ⇒
|
|
|
Why my list function eats memory?
|
| |
Hello haskellers, I am writing a little program and I need a function that will convert a list of some values into the list of overlapping windows, for example, for window size 4: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10,......] -> [[1, 2, 3, 4], [3, 4, 5, 6], [5, 6, 7, 8], [7, 8, 9, 10],......] Windows must overlap by one half and input list is always infinite.... далі ⇒
|
|
|
Book: Haskell School of Expression by Paul Hudack
|
| |
I've got a brand new, mint condition, copy of this book that I don't want. I am asking $20 (this is more than 50% off the Amazon list price) + $4 bookrate shipping to anywhere in the continental U.S. If you are interested then please reply to my gmail address. First come first served. This message will not repeat.... далі ⇒
|
|
|
help with maybe, dropUntil xs pred
|
| |
dropUntil :: [(Maybe a, b)] -> (b -> Bool) -> Maybe a dropUntil [] _ = Nothing --dropUntil [x] _ = fst x dropUntil (x:xs) pred = if pred (snd x) then fst x else dropUntil xs pred i still dont get how to use maybe. how would i call this function? i used it like this first which works for what i want but the function... далі ⇒
|
|
|
How to use Data.Map?
|
| |
Hello haskellers, I have a question relating to the use of Data.Map. I admit I havn't fully understood all the concepts of functional programming yet, and thus am having trouble understanding how one might employ the Data.Map type. Consider the following python code: =============== combos = dict()... далі ⇒
|
|
|
An idea about functional colors
|
| |
{- I am (sort of) new to Haskell, as well as programming, but love Haskell. I decided that the best way for me to learn my way around is to just play with the language a bit. I thought of a problem that could potentially bring a lot of the principles of the language out, and would love comments and suggestions on making it better. The... далі ⇒
|
|
|
Difficulty deriving a general type for combinator
|
| |
Suppose I have a set of functions like these: 2app_id_maybe :: (forall a. a -> Maybe a) -> (b,c) -> (Maybe b,Maybe c) 2app_id_maybe f (x, y) = (f x, f y) 2app_maybe_id :: (forall a. Maybe a -> a) -> (Maybe b,Maybe c) -> (b,c) 2app_maybe_id f (x, y) = (f x, f y) 2app_id_list :: (forall a. a -> [a]) -> (b, c) -> ([b], [c])... далі ⇒
|
|
|
job advert: senior role at Credit Suisse
|
| |
[I apologise if this is off-topic for either of comp.lang.functional or comp.lang.haskell - in the former case I was unable to find a charter at all, and in the latter case I could only find a draft charter that didn't mention job ads either way] Credit Suisse is seeking to recruit an expert in functional... далі ⇒
|
|
|
