Viewing profile — richhickey
richhickey
HN member- Joined
- Wed, Apr 30, 2008, 11:58 PM UTC
- HN karma
- 852
- Public activity
- 72 items
- HN profile
- View on Hacker News ↗
About richhickey
No profile information was provided.
Recent public activity
-
comment
Comment #46421421
Time to update your dictionary - slop: "digital content of low quality that is produced usually in quantity by means of artificial intelligence" https://www.merriam-webster.com/dic…
-
comment
Comment #44541502
Well, at least I know how to form an argument that is not ad hominem. Remind me who you are next time 'KingMob' so I don't waste my time chatting with you again.
-
comment
Comment #40382896
An advantage of using lists is that tx data tends to be built up serially in code. Having to look at your tx data in a different (set) order would make proofreading alongside the c…
-
comment
Comment #25436335
Companies still compete to attract and retain top devs. What if those devs insisted that the companies they work for sponsor open source, and prefer sponsoring companies when makin…
-
comment
Comment #11963502
"datum" means "a thing given" - a fact or presumed fact. http://www.dictionary.com/browse/datum
-
comment
Comment #11962116
If we can't agree on what words mean we can't communicate. This discussion is undermined by differing meanings for "data", to no purpose. You can of course instead send me a progra…
-
comment
Comment #11949133
It contravenes the common and historical use of the word 'data' to imply undifferentiated bits/scribbles. It means facts/observations/measurements/information and you must at least…
-
comment
Comment #11948919
Data, and the entirety of human understanding and knowledge derived from recording, measurement and analysis of data, predates computing, so I don't see the relevance of these rece…
-
comment
Comment #11947809
Without the 'idea' of data we couldn't even have a conversation about what interpreters interpret. How could it be a "really bad" idea? Data needn't be accompanied by an interprete…
-
comment
Comment #11946764
Data without an interpreter is certainly subject to (multiple) interpretation :) For instance, the implications of your sentence weren't clear to me, in spite of it being in Englis…
-
comment
Comment #11945869
Data like that sentence? Or all of the other sentences in this chat? I find 'data' hard to consider a bad idea in and of itself, i.e. if data == information, records of things know…
-
comment
Comment #8147148
It seems counterintuitive, but composing transducers yields a reducing function that runs the transformation steps left->right. What you are composing is the reducing function tran…
-
comment
Comment #8145995
While not mentioned in the blog post, the transducers implementation supports both early termination and result completion/flushing/cleanup.
-
comment
Comment #8145880
I'm not yet seeing that, given: Signal a :: Time -> a SF a b :: Signal a -> Signal b thus (Time -> a) -> (Time -> b) not exactly: (x->a->x) -> (x->b->x) Can you point me to a paper…
-
comment
Comment #8145722
Because mapcat's signature was not amenable to the additional arity, there's now also flatmap (note you can write the lazy collection version of any transducer fn using sequence as…
-
comment
Comment #8145707
Yes, it's not just the 'reduce' function. You can think of many kinds of jobs in terms of seeded left reductions. Here's an example of some of the functions that can apply a transd…
-
comment
Comment #8144971
I'm not seeing anything that looks like a reducing function transformer there. That all looks like variants of ordinary function composition, currying and partial application. Is t…
-
comment
Comment #8144861
Kind of. The idea is to get out of the context of the 'whole job' (the ->r->r bit above) and focus on transformations of the step function (a->r->r) -> (b->r->r) {using your arg or…
-
comment
Comment #8144729
Precisely the opposite - these functions compose because they are representation-free.
-
comment
Comment #8144497
These sigs are for the arities below only. map f: (a->b)->(x->b->x)->(x->a->x) filter pred: (a->bool)->(x->a->x)->(x->a->x) flatmap f: (a->[b])->(x->b->x)->(x->a->x) etc.
-
comment
Comment #8144385
a la Haskell: ;;reducing fn x->a->x ;;transducer fn (x->a->x)->(x->b->x)
-
comment
Comment #8144148
Your typical definition of map, filter etc includes concrete usage of e.g. lists. These don't. Transducers are not just currying or partial application of the map function over lis…
-
comment
Comment #8144037
No, (map f) is not curried map. It returns an entirely different thing - a function of reducing function to reducing function, aka a reducing function transformer, aka a transducer…
-
comment
Comment #8069714
The biggest difference is that MessagePack extensibility (which is not yet widely implemented) is based upon binary blobs, whereas Transit defines extensions in terms of other Tran…
-
comment
Comment #7701958
I am not, and have never been, a Ruby user.