Kutta

16 ms·

91.
by Kutta 11y ago
A usual reply is that physicists don't or shouldn't care about metrics of the size of the universe but rather the simplicity and symmetry of physics. After all, the universe might well be infinite without many worlds, and why do e
92.
by Kutta 11y ago
Not faster, just able to search prefixes and suffixes of a string, while plain DAWG can only do suffixes efficiently.
93.
by Kutta 11y ago
I had a Prolog class in university and also fiddled with it a bit extracurricularry. My biggest gripe was that (aside from being untyped and having poor support for higher-order programming, but that's probably remedied in more modern
94.
by Kutta 11y ago
Well, the Economist is a newspaper with an officially non-neutral stance. I can hardly view it "the worst form of manipulation" when it's not different from every blog and personal column ever in this sense. As to the Iraq wa
95.
by Kutta 11y ago
The article advocates explicitly typed effects rather than less effects in code. Effect systems are also useful for making high-performance code safer (or enforce considerably static safety at small or no runtime cost). The core feature of
96.
by Kutta 11y ago
Mutable state is sometimes the best and simplest solution even in a purely functional setting, so it's good to have an effect system for that.
97.
by Kutta 11y ago
Polymorphic return types, most notoriously. But also anything that's complex enough so that dynamically typed implementations become unfeasible or effectively unmaintainable.
98.
by Kutta 11y ago
Could you give pointers wrt cubical model being a dead end? As yet I've heard nothing about this.
99.
by Kutta 11y ago
A more interesting example: substitute natural numbers with binary trees. After all, they're equivalent. Now univalence would have to implement the binary tree analogue for every function on naturals, in a way that preserves semantics
100.
by Kutta 11y ago
Another addendum to the discussion, from an angle more relevant to computer programmers: if we find a computational meaning for the univalence axiom, then it'll be a crazy nuclear weapon of generic programming and code generation. The
101.
by Kutta 11y ago
Addendum: the author of Ur/Web is the same person as the author of the linked book.
102.
What is the largest possible inhabitable world?(aleph.se)
17 points by Kutta 11y ago|1 comments
103.
by Kutta 11y ago
Type inference doesn't somehow fail if we go beyond Haskell's type system. The inferable subset of the language remains inferable. Haskell already has inferable (Hindley-Milner) and uninferable (higher-rank polymorphism, GADTs) pa
104.
by Kutta 12y ago
Laziness slows everything down by a constant factor. In this example, Haskell would perform about the same as C++, because of optimizations that turn operations on linked list cells into loops (arriving at a result much like the external it
105.
by Kutta 12y ago
I'm happy to see this in the preface (where EY looks back and details what he thinks he did wrong): "Today I would write more courteously, I think. The discourtesy did serve a function, and I think there were people who were helpe
106.
by Kutta 12y ago
Tallinn, Tegmark and Bostrom are long-time MIRI supporters, so this probably won't be positioned as a competitor. It also seems that there was a not-very-advertised AI conference in January, with pretty much everyone in the AI-risk sce
107.
by Kutta 12y ago
The key point here is that Clojure-style vectors have logarithmic random reads/writes, while Okasaki's aforementioned deques do the same in linear time. Clojure uses the persistent vector by default, so it's essential that pe
108.
by Kutta 12y ago
How much are we willing to hurt an economy with sanctions and embargoes (Iran, Cuba anyone?), instead of focusing on overthrowing a nasty government? I'm being somewhat facetious here, as current Hungary is far from the point where dir
109.
by Kutta 12y ago
Rust is pretty much the first mainstream-ish language ever to have substructural typing as a core feature. I can't see how this is archaic.
110.
by Kutta 12y ago
I totally disagree; Rust is shaping up to be the best alternative to C++ by far. As for being 2014, I'd argue that linear and substructural typing is pretty much in the cutting edge of language research.
111.
by Kutta 12y ago
Probably it was, but was subsequently lost/sunk alongside the stage hull.
112.
by Kutta 12y ago
It is always right to institutionalize correct ideas, like Newtonian mechanics (while having in mind its later refinements, of course), or the notion that parapsychology doesn't exist.
113.
by Kutta 12y ago
I'm excited about practical linear typing implemented on the top of full-dependent systems. It would bode pretty well for experimentation and research, more so than baked-in linear type systems, because of the possibility of writing ne
114.
by Kutta 12y ago
I disagree with some of the sentiment expressed in the article; mostly functional programming works much better than profoundly non-functional code, and more functional programming usually delivers marginal benefits. The fact that effects c
115.
by Kutta 13y ago
You're not misunderstanding. In short, we should rightfully expect our dependent type checker to be sound, if not complete. Weaker, non-dependent type systems can have complete checkers though, see for example http://www.mpi
116.
by Kutta 13y ago
Both Idris and Agda check whether functions provably terminate. Halting problem notwithstanding it is possible to have conservative checks that never return false positives, so that an OK from the checker implies termination, but a FAIL doe
117.
by Kutta 13y ago
Note though that undecidability is not really an issue in practice. You can always just refuse to run any function compile time that has not yet passed termination check. In fact Idris does exactly this. This already puts Idris ahead of C++
118.
by Kutta 13y ago
> But how do you get from untrusted, potentially invalid data into the world of trusted, guaranteed-valid data? The main point is that you can write provably correct validation functions. Then your program can branch on the result of tha
119.
by Kutta 13y ago
I somewhat agree on the last point. The temptation is often too great to use those horrible, horrible O(n^2) set functions (nub, difference, intersection) from Data.List just because of the immediate availability.
120.
by Kutta 13y ago
I guess it's not wrong, but not designed by Anders.

More ›