rntz

43 ms·

361.
by rntz 13y ago
You could elaborate polymorphic values to type functions; and if you were compiling ML to System F or System F-omega, that is certainly what you would do. But in practice this might produce performance problems (I shouldn't have to call a
362.
Computer program that learns to play classic NES games(youtube.com)
2 points by rntz 14y ago|0 comments
363.
by rntz 14y ago
Oh! Closure pointers would absolutely suffice. But as far as I could tell, asm.js doesn't support closure pointers either. Obviously I could use a value of "unknown" type to pass them in, but section 2.1.9 says "Since asm.js does not allow
364.
by rntz 14y ago
The fact that you can't represent function pointers (not closures, just plain old C-style function pointers) in asm.js severely limits its usability as a target language for even C-like languages.
365.
by rntz 14y ago
Maybe I'm missing something, but I don't see any infix notation on the linked page.
366.
by rntz 14y ago
It's twitter-endemic, if not twitter-specific, for the simple reason that it's hard to express a coherent, well-justified argument in 140 characters, but easy to express anger. The anger might even be justified; just don't go to twitter exp
367.
by rntz 14y ago
All that means is that Go was announced much later in the development process than Rust was. If Rust had been developed like Go, it wouldn't have been made public yet. But that's not the way Mozilla does things.
368.
by rntz 14y ago
This has strong similarity to the thesis of the classic article "The Anti-Mac Interface": http://www.useit.com/papers/anti-mac.html The connection to the ideas in the Kingdom of Nouns, though, is new and intriguing. It's obvious only in h
369.
by rntz 14y ago
If a user uses your service in an inappropriate way, then stop letting that user send messages. Don't reveal their identity. Threats of physical harm might constitute a valid exception. At that point, law enforcement should be involved.
370.
by rntz 14y ago
> the GHC Haskell compiler now allows you to treat type errors as warnings. Explain? Or post a link? EDIT : found it: http://hackage.haskell.org/trac/ghc/ticket/5624
371.
by rntz 14y ago
The author places a lot of stress on memory. I think he's overgeneralizing from his personal experience. Personally, I have a very bad memory, especially when confronted with query-like questions like "explain how you solved some hard probl
372.
by rntz 15y ago
Both Rust and Go have GCs. It is true that Rust has mostly per-thread GC, which should help to curb performance concerns quite a bit. And Rust aims to have more explicit control over where things are allocated. But it's still a GCed langu
373.
by rntz 15y ago
You misunderstand his argument. He's not arguing that we should replace C with "higher-level languages" that don't give you precise control of the hardware; in fact, he bemoans the fact that the PL community at large seems interested only i
374.
by rntz 15y ago
"Prototype as fast as possible" is itself a rigid programming philosophy.
375.
by rntz 15y ago
Rust, while interesting and admirable, isn't quite as low-level as C or Deca. For example, one of Deca's explicit goals is to not require a garbage collector or a runtime library. Rust has GC and a light-weight-threading runtime. So it's no
376.
by rntz 15y ago
This article touches on some interesting ideas, but doesn't hint at the enormous amount of work that would need to be done to even see if they are feasible, let alone implement them. The author also makes important mistakes regarding PL imp
377.
by rntz 15y ago
Most code is buggy. Usually its author isn't nearby, and even if they are, hitting them rarely helps. Knowing the symptoms of buggy code, however, will help you debug it.
378.
by rntz 15y ago
Sussman says Lisp can't do it, need to use C; Greenspun proposes Common Lisp; Sussman says that if that's true (if CL can do it but Scheme can't), then Scheme has been a waste of time (an odd conclusion IMO); Greenspun proves that CL can do
379.
by rntz 15y ago
It has nothing to do with compilation. It has to do with static typing -- that, before ever evaluating something, you typecheck it. It is perfectly feasible to interpret a statically typed language -- SML/NJ for example, includes an interpr
380.
by rntz 15y ago
> If you choose to live in a democratic society, why not obey the democratically ordained laws? As opposed to choosing not to live in a democratic society? Is there some psychedelic-utopian society out there that's just like a standar
381.
by rntz 15y ago
> People die after playing video games for 16 hours Really? In what context? Do you have a link or citation I could read?
382.
by rntz 15y ago
Close, but no cigar. functor MonadUtils (M : MONAD) = struct (* type annotations not strictly necessary *) fun sequence (ms : 'a M.monad list) : 'a list M.monad = let fun mcons (elt, rest) = M.bnd elt (fn e => M.bnd re
383.
by rntz 15y ago
SML is impure. You are arguing for purity, which is a separate issue from support for monads. Saying "SML doesn't really have support for monads because it's impure" is confusing an idea (monads) with a particular application of that idea (
384.
by rntz 16y ago
No, you just have to make sure the function you pass is associative. Only in really strongly typed languages like Agda can you make the associativity constraint /part of the type/ of the function, and thus statically checked by the compiler
385.
by rntz 16y ago
I dunno, I just TA for the guy. I suspect it depends on what you mean by "real programming of significance". I can tell you that Harper is really damn smart. I'd be truly surprised if he was bad at programming. But his actual experience, I
386.
by rntz 16y ago
In brief: I prefer Haskell, but I think it has its flaws, and I understand why we're not using it as a teaching language. In long: Haskell has much better concrete syntax, better library and tool support, a more active community, and is sub
387.
by rntz 16y ago
That's hard for me to know because, as a TA, I mostly get to see students when they're confused or frustrated, up against a deadline. The fact that almost all our students are also enrolled in spring 251 with Luis von Ahn, and therefore inc
388.
by rntz 16y ago
I'm a TA (one of four) for the course Harper is talking about in this post. As they say on reddit, ask me anything. I do not guarantee I'll answer. I'll check back in in the morning.
389.
Abolishing truancy and unintended consequences(jseliger.com)
3 points by rntz 16y ago|0 comments
390.
by rntz 16y ago
I can only speculate at the intentions of the grandparent poster; but it's not necessarily their intention to indicate that you shouldn't repost things. It's helpful to link to old discussions of the same post so that interested HNers (like

More ›