marvy

32 ms·

301.
by marvy 10y ago
> entirely possible But that's his point, isn't it? It sounds like it should be possible, yet he never saw it happen.
302.
by marvy 10y ago
That would be a pity.
303.
by marvy 10y ago
Hm. Good point.
304.
by marvy 10y ago
So, you think it's a good thing (for Lua) that Netscape made JS instead of just using Lua?
305.
by marvy 10y ago
That's what I was wondering.
306.
by marvy 10y ago
As someone else in the comments pointed out, they didn't transcribe it by reading it. The right letter to type was lit up on the screen. (The article mentions this, but doesn't emphasize it too well.)
307.
by marvy 10y ago
Which I notice a lot of commenters here in fact do. (Though to be fair, HN doesn't quite support proper hyperlinks.)
308.
by marvy 10y ago
Forth allows comments. The quote is just saying "why bother using them?"
309.
by marvy 10y ago
Lest someone thinks you're exaggerating: http://archive.is/YLh6I Quote: Forth does it differently. There is no syntax, no redundancy, no typing. There are no errors that can be detected. Forth uses postfix, there are n
310.
by marvy 10y ago
I've been tempted to look at the HackerRank challenge for a long time out of sheer curiosity, but I don't want to move to California, and feel guilty about starting what is tantamount to a job application for a position I don&#x27
311.
by marvy 10y ago
Asooka: a lot of your comments are showing up as dead. I have no clue why, they seem fine to me. I can't reply directly to the one you made in this thread: it's dead too.
312.
by marvy 10y ago
You could, but then it's not quite so quick-and-dirty anymore :) The de-queue method goes from "self.i += 1" (Python syntax) to self.i +=1 if self.i > len(self.a)/2: self.a[:self.i] = [] self.i
313.
by marvy 10y ago
Most languages have a built in type for a dynamic array, but many of them lack a built-in queue. I have a favorite trick for a quick-and dirty queue in those languages. You need an array (initially empty) and an integer (initially zero).
314.
by marvy 10y ago
Neat! I thought host was optional, I didn't realize it didn't exist at all.
315.
by marvy 10y ago
Wasn't the spec designed so that pretty much everything was already mostly conformant?
316.
by marvy 10y ago
One thing that is slightly misleading about the article is that it talks as if HTTP/1.0 first came into being in 1996, and everyone was using version 0.9 before then. In fact, one need only observe that the original spec for adding co
317.
by marvy 10y ago
This is something the HN urls do poorly, whereas stackoverflow does well.
318.
by marvy 10y ago
the only way I can think of is if the site doesn't support https
319.
by marvy 10y ago
perhaps I should
320.
by marvy 10y ago
Puns like these make my day.
321.
by marvy 10y ago
Thanks again!
322.
by marvy 10y ago
Cool. Two more silly questions. (1) How fast is mu these days? Is it roughly competitive with CPython? (2) You mentioned it would be nice to have a compiler someday. It occurred that maybe something like the JVM would be closed to the
323.
by marvy 10y ago
Okay, factorial and linked list changed my mind. This is way more ergonomic than I gave it credit for. It doesn't seem to quite agree with /post/mu; in particular, I see no usage of next-ingredient and instead I see the typ
324.
by marvy 10y ago
I've superficially glanced at mu. It seems to have even more awesome stuff than I realized. But still: you're basically programming in glorified assembly. You can't add three numbers without splitting the thing into two st
325.
by marvy 10y ago
Wow. If you can combine Python and Prolog, I can't help but feel you can combine anything. Those are pretty different!
326.
by marvy 10y ago
> Yeah, I'm inclined to just eat that one-time slowdown. Maybe eventually the world will agree with you. We already eat the slowdown that comes with bounds-checked arrays. And indeed, compilers are getting better at removing that
327.
by marvy 10y ago
Okay, finally I get it! As far as I know, Rust has a few types in the stdlib that are guaranteed to overflow, that you can use if that's what you want. C# has something even more interesting: checked(a+b) // crash on
328.
by marvy 10y ago
Hm, I'm still missing something here, but I think your comment about phone numbers might be the key to the mystery, so let's go with that for now. If you choose to add two phone numbers, I think we both agree that the phone number
329.
by marvy 10y ago
Sure, but when all is said and done, what's the cost? There are plenty of Rust benchmarks by now, possibly some of them are part of the test suite. How much do they slow down?
330.
by marvy 10y ago
What can you usefully do with a nominal number, besides input/output and comparing two of them for equality? I don't think you need language support here, library support should suffice, unless I'm missing something.

More ›