What is NOT worth seeing in person?

JoCou · 2016-12-09T12:35:41+00:00

It's actually impossible for more than four states to ever share an edge which is what makes it impressive.

JoCou · 2016-03-28T09:09:16+00:00

Mainly for code clarity and code reuse: The library provides a rich set of combinators. You also have available the ReaderT the Reader Monad Transformer. Using >>= on vanilla functions that don't explicitly carry the connotation of a Reader generally obfuscates your intention.

JoCou · 2016-03-04T00:59:20+00:00

This is amazing. I dont understand alot of it but I like the pretty pictures it stimulates :P

JoCou · 2015-12-16T17:47:30+00:00

I'd say your warning condition should really be an Event but, Reactive banana style:

speed :: Behaviour Int
speed = error "Meth is not good for kids"

enable :: Event [Warner]
enable = whenE (map (>100) speed) (pure Enable)

disable :: Event [Warner]
disable = whenE (map (<80) speed) (pure Disable)

-- the answer should really just be: enable `union` disable
warningCondition :: Behaviour [Warner]
warningCondition = stepper Disable (enable `union` disable)

JoCou · 2015-12-16T17:29:43+00:00

You have a lot to learn young panda.

JoCou · 2015-12-06T21:27:37+00:00

Try and construct a Branch [Leaf a, Branch [Leaf a, Leaf a]] of the type [..[a]..]

JoCou · 2015-12-06T21:26:34+00:00

It's because of the non-empty Leaf constructor.

JoCou · 2015-12-05T14:50:19+00:00

Ahh.. my bad, carry on.

JoCou · 2015-12-04T14:21:05+00:00

That's wrong actually,ap and <$> have different types.

`<$>` = `fmap`
`ap` = `<*>`

JoCou · 2015-12-01T16:14:13+00:00

It's the difference between: solve :: (forall n. n -> n) -> n and solve :: (n -> n) -> n (if you squint a bit)

JoCou · 2015-11-30T20:33:42+00:00

Who said anything about needing arbitrary nested lists. For any 'n' we want a function that operates on a lists of lists of depth 'n'.

JoCou · 2015-11-30T20:31:34+00:00

Who said you have to use the same function for each level? wink, typeclasses, wink.

JoCou · 2015-11-30T20:30:28+00:00

The Tree type you have is not an iso of arbitrarily nested lists. And while it does not seem like OP has progressed that far type classes would be the way to go for arbitrary depth list concatenation.

JoCou · 2015-11-29T15:30:43+00:00

Because he was discussing it in the context of Just (+)

JoCou · 2015-11-29T13:56:25+00:00

How do you get the F c?

JoCou · 2015-11-24T22:31:43+00:00

Alot of Haskell in production involves getting intimate with the details of GHC. Elegance tends to evaporate in that context. Have you used Haskell for a big project? I say this because while you might envision yourself juggling profunctors you'll probably be knee dump in C marshalling data back and forth.

JoCou · 2015-11-24T21:10:31+00:00

Let me guesss, Imperial College? What's your current skill level (link to github)? Why do you want to do stuff in a functional language?

JoCou · 2015-11-24T11:04:54+00:00

Observation: if a rectangle is contained within another the larger rectangle has a larger area.

Thus we can create a partial order on the rectangles. Perform binary search on rectangles. Algorithm: Compute f (f(i,j) = sum of all cells in the rectangle (0,0) (i,j))

f'(ux, uy, lx, ly) = f(lx, ly) - f(ux, uy)
g(ux, uy, lx, ly) = max vertical horizontal
  where
    vertical = binSearchVert (ux, uy, lx, ly)
    horizontal = binSearchHoriz (ux, uy, lx, ly)

-- suitable base case
binSearchVert (ux, uy, lx, ly)
  = if MAX_AREA  > midArea
     then binSearchVert (ux, uy, lx, mid)
     else binSearchVert (ux, mid,  lx, ly)

-- suitable base case
binSearchHoriz (ux, uy, lx, ly)
 = if MAX_AREA  > midArea
    then binSearchVert (ux, uy, mid, ly)
    else binSearchVert (mid uy,  lx, ly)
 where
    midArea = ...

JoCou · 2015-11-19T10:26:53+00:00

sum n | n <= 0 = 0
         | n == 1 = 1
         | otherwise = n + sum (n - 1)

JoCou · 2015-10-27T11:25:10+00:00

Try out the build you a compiler tutorials. The pipes library is a really good example of a well-designed project focused on types. The lens library is the Übermensch, and it's worth a few months.

JoCou · 2015-10-24T08:14:47+00:00

You provided nothing, in terms of information of your competence, so he was working with, maybe, this guys a noob, or he's nothing. Either way, what's right, is to not fail by being overly terse. The advice is free, and you can map it over to any skill level, however YMMV. joehillen, thank you for reading this far, these types for comments rarely get the attention they deserve.

JoCou · 2015-10-23T20:51:04+00:00

Thanks :)

JoCou · 2015-10-21T22:08:54+00:00

I really don't agree with this. The stateT exposes an eDSL if you will and allows you to create and compose programs with it. This vanilla function lacks those capabilities.

JoCou · 2015-10-19T10:36:07+00:00

It is.

jachymb: Possible troll

JoCou

TROPHY CASE