Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
tel
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
28 ms
·
211.
▲
by
tel
5y ago
I understand that distinction. Russell came up with a mathematically rigorous theory for the foundations of mathematics and happened to use a very simple type system to accomplish it. He wasn't the first to formally make use of types,
212.
▲
by
tel
5y ago
I don't know Kotlin, but these usually are distinct from Options in an important way, idempotency `String?? = String?` or `String|null|null = String|null`. This equation makes sense for some mental models, but isn't quite the same
213.
▲
by
tel
5y ago
I think this is basically true. Impermanence is part of what makes possession important. I can totally see the value of all NFTs decaying on long time scales because they're just boring. But on short time scales all age is similar and
214.
▲
by
tel
5y ago
I don't want to try to answer your question, but instead I'll turn it around: logic and epistemology are the fields most centered on understanding and shaping exactly what it means for a human to effectively come to know something
215.
▲
by
tel
5y ago
I think that's all correct, but am blurring the lines between logic and epistemology in the sense of Martin Löf, logic is the mechanism of judgement and judgement is the currency of knowing. Formally, anyway.
216.
▲
by
tel
5y ago
This is certainly more true. That explosion of logics I mentioned was a big movement of many authors to expand our understanding of types (among other things).
217.
▲
by
tel
5y ago
But then I come by and scan your card and print a fresh one. This is fairly cheap to do. Why is mine not valuable? Does this process devalue yours? NFTs posit that the answer is that yours isn’t authentic and the process won’t devalue mine
218.
▲
by
tel
5y ago
Yeah, saying Russell invented types is fun but horribly wrong. He invented other things and stood at the center of an explosion in formal logics. But types are way old.
219.
▲
by
tel
5y ago
It’s kind of a long range gesture. Normally, a judgement e: B can only capture some truths about the program e, but if B could encode arbitrary logical statements about e, what does the system look like? It turns out that if you have that s
220.
▲
by
tel
5y ago
Mathematical papers are essentially mathematicians shipping pseudo code back and forth. There are good reasons for it, but it’s not meant for most audiences. Mathematicians absolutely do write accessibly from time to time, but when they do
221.
▲
by
tel
5y ago
Russell's Hierarchy of Types isn't particularly where type theories came from, though it was an early reference to the word and obviously very adjacent to these developments. It is a type system employed to solve a particular pr
222.
▲
by
tel
5y ago
Learning FP takes real investment both in time spent learning and practicing the concepts and in time spent slowly misusing them in real projects until you develop your taste for where they're appropriate. This investment is regularly
223.
▲
by
tel
5y ago
I think I see what the question is now. A type is defined by picking how its values are introduced and/or used. It doesn’t mean that those rules have to be actually productive. In fact there are many kinds of uninhabited types (the emp
224.
▲
by
tel
5y ago
What's the question? For uninhabited types there's a universe (empty), ways to construct (no ways), ways to work with (any way), and you can (tautologically) pick out values and put them in sets. Constructors aren't first ord
225.
▲
by
tel
5y ago
This is an old yarn distinguishing sets and types, extrinsic and intrinsic, "run time" and "compile time". The idea of a runtime procedure `?- atom(_)` which determines `true.` or `false.` is fundamentally an extrinsic p
226.
▲
by
tel
5y ago
FogBugz used to do something of that nature. I never used it, so I'm not sure how well it worked out ultimately.
227.
▲
by
tel
5y ago
It happens regularly when, surprise, you deal with infinities in some other place. A good, fairly intuitive example is integration where, I think, it's common to prove convergence using AoC in the multidimensional case. More or less, y
228.
▲
by
tel
5y ago
Yeah, basically. Also need the strike, spot, an estimate of the risk free rate (probably not today). The implied vol is a useful way to make sense of the actual market prices of options. We also might have some predictions about the market&
229.
▲
by
tel
5y ago
Be careful using this formula too naively. Predicting tomorrow's expected return is quite difficult, though predicting tomorrow's expected volatility is doable.
230.
▲
by
tel
5y ago
I forget what he said in the video, but generally this thing can be a little surprising because even a pretty decent looking bet can blow you up with high probability if you size it wrong. The other side of this is Shannon's Demon: a s
231.
▲
by
tel
5y ago
That's something of a moot argument, though, since BSM computes prices in terms of the future volatility. Since we have the actual price, the volatility is actually what we solve for with BSM. Even if we had neither price nor volatilit
232.
▲
by
tel
6y ago
That's helpful, thanks! I've been learning about it in a simulation environment, not a game dev one. I think some, but not all, of the constraints are similar. I'll take a look at those references.
233.
▲
by
tel
6y ago
This appears to be more-or-less the entity-component system (ECS) architecture as well.
234.
▲
by
tel
6y ago
The trivial implementation isn't law abiding. This law doesn't hold (written in Kleisli form for simplicity) pure >=> f == f (left identity) There are no other monads for Maybe. First, any definition of pure must b
235.
▲
by
tel
6y ago
I would like to see this done more granularly (counties?) and again using population flows to weight edges (and thus introducing non-local edges). I’m somewhat surprised I’ve never seen this before and think it’d be very illustrative.
236.
▲
by
tel
6y ago
That definitely toes the important line between FP as defined and FP as practiced. Although, I’d argue that proper state management requires discipline in all cases. I’ve seen OO codebases that operated from lots of trick mutable shared red
237.
▲
by
tel
6y ago
I was thinking of “static” state as being the idea of state existing “in the program text” and “in the continuation”. Perhaps I don’t yet fully grasp what you’re thinking of with those ideas of state. Especially given the correspondence bet
238.
▲
by
tel
6y ago
I find your depiction of FP state interesting as I think of it as the opposite. In my practice of FP, it tends to force me to make state explicit and and available. I follow what you’re saying as well with regard to the continuation of the
239.
▲
by
tel
6y ago
I was thinking VSTs as well. It's kind of funny, I truly dislike the UI of most VSTs I use. Cluttered, hard to understand, many hidden features and menus, and often rampant unhelpful skeuomorphism. But also there are a few which are re
240.
▲
by
tel
6y ago
Bayesian modeling has a somewhat distinct feeling to both (typical) deep learning algorithms and boosting/bagging classifiers. Most particularly, Bayesian modeling tends to be generative modeling as opposed to discriminative. This mean
More ›