pka

40 ms·

1. 331.▲
   by pka 12y ago

   Still, you are supplying the record fields to match on as T.Text. Check out [1] for a type-safer approach. I've been working on a typed expression builder for just this purpose, but due to lack of time haven't been able to finish
2. 332.▲
   by pka 12y ago

   [1] is a nice read regarding continuations (and the Cont monad), though a bit more advanced. [1] http://blog.sigfpe.com/2008/12/mother-of-all-monads.html
3. 333.▲
   by pka 12y ago

   I started doing a redesign some time ago, but never finished it [1]. https://dl.dropboxusercontent.com/u/30225560/poc-haskell.png
4. 334.▲
   by pka 12y ago

   For Clojure there is core.match [1]. [1] https://github.com/clojure/core.match
5. 335.▲
   Mps-youtube – Terminal based YouTube jukebox with playlist management(github.com)

   1 points by pka 12y ago|0 comments
6. 336.▲
   by pka 13y ago

   Nice to see how this contrasts with the other post about things like bla.split('').join(' ') .
7. 337.▲
   by pka 13y ago

   So you're mixing view logic (rendering DOM elements, listening to events) with controller logic, and from my experience this is exactly the type of stuff that leads to an unmaintainable mess when your codebase grows. For one, you can&#
8. 338.▲
   by pka 13y ago

   The same way it's always done, by exploiting a bug somewhere? Anyway, I wasn't trying to sound hostile, I was genuinely wondering whether hacking BSD is considered to be much harder than hacking anything else.
9. 339.▲
   by pka 13y ago

   Are you implying that BSD is unexploitable and 100% secure?
10. 340.▲
    by pka 13y ago

    That is my biggest concern too. Let's say they somehow manage to perfect street landing, so that drones won't come crashing down on people, parked cars, construction sites etc, independent of weather conditions (snow, ice) - what
11. 341.▲
    List of potential habitable exoplanets(en.wikipedia.org)

    1 points by pka 13y ago|0 comments
12. 342.▲
    by pka 13y ago

    What exactly is the problem in writing a web app in Haskell?
13. 343.▲
    by pka 13y ago

    Datomic is an example of a database-as-a-value - http://www.infoq.com/presentations/Datomic-Database-Value
14. 344.▲
    by pka 13y ago

    A function like sqrt :: Double -> Double is pure. Still, when evaluated on a CPU somewhere a register or a memory location gets mutated, i.e. it produces a side effect. In that sense nothing would be pure. So if sqrt is pure, why
15. 345.▲
    by pka 13y ago

    Purity is, informally speaking, "same output for same input". If you start out with the same database and feed the same input in the same time intervals to a FRP program, the resulting database will always be the same, (i.e. if yo
16. 346.▲
    by pka 13y ago

    Well, then nothing is pure, since even a declarative, non-FRP, pure program needs to be executed on a stateful CPU with registers and so on. FRP just deals with time explicitly, i.e. a fold over time over a signal is just as pure as a nor
17. 347.▲
    by pka 13y ago

    [1] is a good simple explanation of what FRP is about. A DB interaction for example can be viewed as a pure function from a signal of Requests to a signal of Records. Same with files (Signal Path -> Signal FileContents), etc. [1] http:&
18. 348.▲
    by pka 13y ago

    Not quite - iirc Yesod still runs in some kind of IO monad, i.e. it is stateful. In contrast signal functions are declarative (pure).
19. 349.▲
    by pka 13y ago

    I've been thinking about structuring servers around FRP [1] and declarative programming for a while now. FRP is based on the notion of events / signals as first class objects and the ability to compose those; it has been gaining p
20. 350.▲
    by pka 14y ago

    Yes, we should write our editors in assembler.
21. 351.▲
    by pka 14y ago

    RIP Paul :( You've helped make some of the best games of all times. Thanks.
22. 352.▲
    by pka 14y ago

    I can't believe this. Just 2 or so weeks ago I set about writing exactly something like this in Haskell [1]. It's by no means complete or even working at this point, but basically what I had in mind was something like: yls | yfilter '
23. 353.▲
    by pka 14y ago

    This [1] is an attempt to do just that. I haven't really looked at the source, but from what I gather it is a way to combine keymaps, actions, parsers, and syntax grammars however you like. There's also a vi mode (don't know how complete) a
24. 354.▲
    by pka 14y ago

    I did exactly the same thing in 2008 for the Google Android Challenge. After starting the app, you would see two big buttons - browse and stream - and clicking on stream would automatically start, well, recording and streaming video. Only
25. 355.▲
    by pka 14y ago

    For those who missed it, here's a VOD: http://www.ustream.tv/recorded/24512027 Landing starts at about 19:00 minutes.
26. 356.▲
    by pka 14y ago

    http://www.ustream.tv/recorded/24512027
27. 357.▲
    by pka 14y ago

    For that rate I'd maybe hire Simon Peyton Jones, but $1000 for iOS "optimization advice"? The market must be in a really bad place.
28. 358.▲
    by pka 14y ago

    Just for the record, the transplant extension [1] seems to be how you do cherry picking in Mercurial. [1] http://mercurial.selenic.com/wiki/TransplantExtension
29. 359.▲
    by pka 14y ago

    I gotta go in a sec, but I'll link you to previous comments of why I recommend Haskell [1] and/or Erlang [2] for a more massive backend architecture. [1] http://news.ycombinator.com/item?id=4181223 [2] http://news.ycombinator.com/item?id
30. 360.▲
    by pka 14y ago

    Ah, good to know. Everytime I've googled this it was something about reset --hard (or --soft) and HEAD or ^HEAD or whatever else. git stash is hg shelve. Don't know about cherry picking (I've never needed it). Anyways, the argument I'm maki