Viewing profile — davdar
davdar
HN member- Joined
- Tue, Nov 02, 2010, 4:49 AM UTC
- HN karma
- 13
- Public activity
- 11 items
- HN profile
- View on Hacker News ↗
About davdar
david.darais.com
Recent public activity
- story
- story
-
comment
Comment #8964719
I'm curious, what do you mean they compose better and allow for analysis [better than monads]?
-
comment
Comment #8532590
That's like saying "your program is more elegant if it has no monads". It's an incorrect statement. The monadic version is perfectly elegant. Even better: it's the right one.
- comment
-
comment
Comment #8154687
In the non-continuous FRP literature[1], i.e. the kind you actually implement, SF a b = [a] -> [b], which is isomorphic to: Fold a -> Fold b, where Fold a = (exists s. (s, s -> (a,…
-
comment
Comment #8145776
Clojure transducers are exactly signal functions from Haskell FRP literature, for those interested in such a connection.
-
comment
Comment #1956054
Yes, breadth first traversal of the solution space is very similar in spirit to our approach. I have since completely rewritten the Haskell implementation. You should really check …
-
comment
Comment #1951041
Here is my latest Haskell implementation that Matt is referring to (git repo): http://david.darais.com/git/research/der-parser-3/
-
comment
Comment #1951033
I have since rewritten the Haskell implementation to compute fixed points on cyclic graphs without using pointers or Monads. Check it out if it interests you (git repo): http://dav…
-
comment
Comment #1951023
Here is the git repo (over http) for my Haskell implementation which exploits the technique to be linear for LL(k) (the Zip module is where this technique is implemented). The cons…