dwenzek

23 ms·

181.
by dwenzek 12y ago
In the same vein you have this site [1], with misc type related algorithms and implementations in OCaml . [2] is a paper with a modula-2 implementation. Written by Luca Cardelli, a type fellow, it really helped me to understand type infere
182.
by dwenzek 12y ago
Yes, there is a risk to be boastful. But the risk is shared by many positions and roles. It's not enough to say I'm an architect or a full stack developer or UX designer, there are a lot of skills and attitudes to have along the d
183.
by dwenzek 12y ago
I agree. My concerns are not really about the contrived usage of only 2 buckets and decimal numbers. This may give a picture to start with. But, this is a pity to elude how the final cardinal estimate is computed. And this is shame to publi
184.
by dwenzek 12y ago
A related way of composing code is railway oriented programming already commented on HN (1) Underneath there are monads, sure, but the author has deliberately chosen a more mechanical metaphor which may help those for whom monads sound too
185.
by dwenzek 12y ago
Yes, this paper is interesting. It shows well how a slight shift on the problem expression can lead to a more powerful, simpler to use and general solution. In this case, the shift is to design stream processors (like `sed` and `awk`) to wo
186.
by dwenzek 12y ago
Yes, it may be quit hard to design such a combiner due to constraints both on the input (as the need for cross-chunk recombination), and on the output (as too early finalization preventing further combinations); with the consequence that we
187.
by dwenzek 12y ago
Post related to folds and parallelism: https://news.ycombinator.com/item?id=8646181
188.
by dwenzek 12y ago
This pattern can be applied to a large set of collection representations, as long as a former collection can be divided into smaller parts which can be processed independently giving partial results to be combined into a final outcome using
189.
by dwenzek 12y ago
The first comment of joaorico quotes the translation of paragraphe 3rd,4th and 5th of the full quotation in french.
190.
Why Tellybug Moved from Cassandra to Amazon DynamoDB (2013)(attentionshard.wordpress.com)
3 points by dwenzek 12y ago|0 comments
191.
by dwenzek 12y ago
The code can be simplified, removing all stuff related to null. Initialise the transducer field of reducibles with the identity transformation !
192.
by dwenzek 12y ago
Yes, the former is more efficient and the latter more comprehensible. But there is a simple step which can reconcile both approaches. For that, we have to add some functions, so we can write : reduce([0,1,2,3,4]).map(inc).filter(isEve
193.
by dwenzek 12y ago
> a "topology" in Storm is a directed acyclical graph. The nodes are called "bolts" and the edges are called spouts" Not really. Edges are streams and nodes are either spouts or bolts. Spouts have no predecessors
194.
by dwenzek 12y ago
I don't understand why you use a "Moore-style State Machine". I don't understand too why all the typed transducers which are shown here use a restricted version of reducers (i.e. a step function of type `r -> a ->
195.
by dwenzek 12y ago
To code typed transducers we only need "for all" generics. type Transducer a b = forall r . (r -> b -> r) -> (r -> a -> r) This may seems unusual or complex but is available in mainstream languages. In java: