Group items tagged questions - Haskell

shared by Javier Neira on 07 Jan 10 - Cached

Semantically, FRP's concurrency is fine-grained, determinate, and continuous.
...

Cancel
Dynamic/evolving values (i.e., values "over time") are first class values in themselves. You can define them and combine them, pass them into & out of functions. I called these things "behaviors".
...

Cancel
Each occurrence has an associated time and value.
...

Cancel
...3 more annotations...
In software design, I always ask the same question: "what does it mean?".
...

Cancel
It's been quite a challenge to implement this model correctly and efficiently, but that's another story.
...

Cancel
The basic idea behind reactive programming is that there are certain datatypes that represent a value "over time". Computations that involve these changing-over-time values will themselves have values that change over time.
...

Cancel

shared by Javier Neira on 10 Nov 09 - Cached

data NestedList a = Elem a | List [NestedList a]   flatten :: NestedList a -> [a] flatten (Elem x) = [x] flatten (List x) = concatMap flatten x
...

Cancel
compress :: Eq a => [a] -> [a] compress = map head . group We simply group equal values together (group), then take the head of each. Note that (with GHC) we must give an explicit type to compress otherwise we get:
...

Cancel