tel

60 ms·

691.
by tel 11y ago
SML can do this well with embedded DSLs, but effect typing is a powerful tool for this idea.
692.
by tel 11y ago
This is a big part, if not the most important part, of why I like Haskell. "Purity" is a giant stroke in the direction of using the least powerful language possible at all times (and the advanced types let you both declare the l
693.
by tel 11y ago
Non-strictness can be implemented with functions. function thunk(f) { return { force: f } } This, for instance, gives you a lazy stream function unfold(step, state) { return thunk(function () { let m = step(stat
694.
by tel 11y ago
Informing patients is a hugely variable thing. It's "fast moving" at the moment to make it more digitized at least, but that isn't always clearly the best solution for patients even if it may be an improvement over the r
695.
by tel 11y ago
Basically it's more fundamental because if you try to bootstrap mathematics from set theory you need a set of 10 axioms which seem unmotivated and disconnected. To bootstrap math from category theory invokes stepping through a rich ser
696.
by tel 11y ago
How in the world do typeclasses work in Hoon?
697.
by tel 11y ago
If you're willing to introduce the term "projection" then I think it's illustrative and has a good connection to other metaphorically identical connected projection concepts. "A mold is a projection function rangi
698.
by tel 11y ago
If it's comparable to other computer go ais then it's low dan.
699.
by tel 11y ago
That's been happening for a while now. My understanding is that there was a major wall many go AIs were stuck on prior to the invention of monte carlo tree search (essentially, a way of evaluating a better play objective function) and
700.
by tel 11y ago
Yeah, or at least be reduced to some amount of tuple flipping depending on instantiating some other auxiliary classes.
701.
by tel 11y ago
I always heard that Coq was revenge for 'bit'.
702.
by tel 11y ago
They're ready in small forms in Haskell today. The compiler doesn't take a whole lot of advantage of these yet, but you start to see avenues toward it.
703.
by tel 11y ago
:D
704.
by tel 11y ago
Also worth noting that the "observing all of time" thing which I mention in the last line suggest that this model of FRP arrows can be acausal (along with other things). Indeed it can! And this is a major semantic and implementati
705.
by tel 11y ago
Errata: " (() -> b) is equivalent to (Time -> b)" should be " (() ~> b) is equivalent to (Time -> b)".
706.
by tel 11y ago
I understand it's convenience and importance in arrow notation... but it definitely feels like too large a jump! Maybe in another 10 years we'll have the Profunctor-Strong-GArrow-Arrow Proposal to fix up that superclass hierarchy.
707.
by tel 11y ago
Arrows are a generalization of functions. A type `P a b` is a bit like the type `a -> b` in that it "consumes" `a`s and "produces" `b`s in some sense or another, but it may behave in many ways differently from the fun
708.
by tel 11y ago
To be fair that's the article quoting "officials" and the article directly mentions other attempts a paragraph later.
709.
by tel 11y ago
Certainly "get". Sorry for the semantic confusion. Another word I use a lot is "lookup".
710.
by tel 11y ago
And of course checked exceptions (wrapped in a try block) are "just" the nomadic effect of the option (or "result") type.
711.
by tel 11y ago
Of course, ClassX::doSomething must still be at least in principle prepared to handle nulls.
712.
by tel 11y ago
> That said, it's pretty rare to need exactly 0 or 1 of something. That's interesting and sort of hard to agree with. I think uniqueness is very often desirable and very often paired with a lack of certainty about existence.
713.
by tel 11y ago
Identity is not the only function for which that holds. As an immediate example, constant functions have this property as well. More interesting examples exist as well. Also what was stated was not an equation for any old fixed point but in
714.
by tel 11y ago
Otoh, what's the difference between { "number": "1.0000000000000000000000000000001" } along with { "number": { "type": "ModelReal", precision: 64 } } versus <
715.
by tel 11y ago
Even with a defined precision they're weird in that they "ought to" be modeling the reals and therefore lack computable equality. Which makes it hard to write a well-defined hash.
716.
by tel 11y ago
That's an exterior thing. It's perfectly reasonable to talk about XML the schemaless markup language.
717.
by tel 11y ago
Not really. What will have to happen is a readjustment for realizing that many models, especially made by people with little experience and training, will be wrong. Right now it's the glory days of ML when nobody much has the ability t
718.
by tel 11y ago
Not really. What will have to happen is a readjustment for recognizing that poorly designed models just don't work very well.
719.
by tel 11y ago
Staltz
720.
by tel 11y ago
Because it's written intentionally to make data access patterns which are weird. Having multiple modalities should theoretically make a lot of different design options awkward. Presumably Stalz intends to use cycle and show that captur

More ›