agocorona

5 ms·

1.
by agocorona 8y ago
There is already a kind of unison for Haskell: https://github.com/transient-haskell/transient
2.
Composing distributed spark and akka-like applications (and web apps). haskell(github.com)
3 points by agocorona 10y ago|0 comments
3.
by agocorona 10y ago
This one too: https://github.com/agocorona/Workflow
4.
by agocorona 10y ago
Since JavaScript and the browser is the only thing that matters nowadays: transient-universe can run Browser nodes compiled from haskell to Javascript. they can display DOM widgets and are integrated with server nodes, using websockets comm
5.
by agocorona 10y ago
Haxl is a great Haskell library and probably the biggest contribution to getting Haskell out of the academia. It is optimized for fetching querying and caching data sources, among other things, making use of parallelism and concurrency whil
6.
by agocorona 10y ago
Good question. The actor model communicate via mailboxes, which execute callbacks sort to say. Essentially this produces the callback hell. Taking away the initializations, this is the ping pong example in Erlang: https://gist.gi
7.
by agocorona 10y ago
I think that it meets the guidelines. It is a matter of reposting it with the prefix "Show HN"?
8.
Show HN: A Haskell library for web and distributed composable applications(github.com)
18 points by agocorona 10y ago|8 comments
9.
by agocorona 11y ago
Yes, I will add more examples as soon as I can. It is in an early stage, but I plan to update the article with more examples.
10.
by agocorona 11y ago
I'm the author. Thanks for publishing it here
11.
by agocorona 12y ago
Do you have seen the monad of the article before? I would like to know your reference, please.
12.
by agocorona 12y ago
I added the backtracking effect in this article without stacking a new transformer. In a way somewhat similar in which a new interpreter can add a new effect to a free monad.
13.
by agocorona 12y ago
Very glad that you appreciate it. I think that there is a gold mine of applications under this simple realization.
14.
by agocorona 12y ago
In STM the backtracking is a bit different. It has a single backtracking point and usually it is implemented by killing the thread and restarting it anew. That is because doing IO actions is really unsafe under STM. Really it is not impleme
15.
Using backtracking to undo transactions in Haskell(fpcomplete.com)
15 points by agocorona 12y ago|9 comments
16.
by agocorona 12y ago
http://www.google.com/trends/explore#q=reactjs%2C%20Angular.... ;)
17.
by agocorona 12y ago
I think that there are objective measures of complexity. So there are objective measures of simplicity. ideographic writing is more complex and less composable than phonetic writing and yet can express the same ideas. Subjectively, a chine
18.
by agocorona 12y ago
Well though. I agree with that. The good abstraction is more about interfaces rather than objects. I complain more about the primitive use of objects as message receivers" with state. That was at the moment the best solution available
19.
by agocorona 12y ago
Hi In the case of events, it is because I later have to store different event types in a List so I define the list as [Event] . That is the container that feed the monad with events. If I define Event as you suggest, I would need a existent
20.
by agocorona 12y ago
I added a bit more context. Thanks
21.
by agocorona 12y ago
No, I mean "the combinators that I just developed and want to explain here".
22.
by agocorona 12y ago
Too bad. I fixed it
23.
Programming at the specification level with Haskell (fixed URL)(fpcomplete.com)
1 points by agocorona 12y ago|0 comments
24.
by agocorona 12y ago
It seems that there is no way to change the original URL
25.
by agocorona 12y ago
Very sorry: https://www.fpcomplete.com/user/agocorona/EDSL-for-hard-work...
26.
Programming at the specification level with Haskell(fpcomplete.com)
43 points by agocorona 12y ago|28 comments