ac

9 ms·

31.
by ac 14y ago
+2, and even the highest difficulty singleplayer is nothing compared to multiplayer. Beware, though, it has an extremely steep learning curve.
32.
by ac 14y ago
As Tyr42 has so astutely observed, I have meant that pattern matches in function declarations, let-bindings and list comprehensions are desugared into the case expression. Also, it would be kind of pointless to compare C switch and Haskell
33.
by ac 14y ago
> like exceptions (quite un-Haskell-like) Haskell has exceptions [1]. [1] http://www.haskell.org/haskellwiki/Exception
34.
by ac 14y ago
I think it's quite misleading to list Haskell in the title: the only common thing between Loop and Haskell that I've found is pattern matching, and that's not even exclusive to Haskell -- other languages have it. Besides, it's not clear fro
35.
by ac 14y ago
I mentioned earlier that I found the GHCI use-case extremely useful (see my root comment after EDIT). But I have an issue with the uses like turning off the typesystem and have the project compile just so that you could feel good about your
36.
by ac 14y ago
I wasn't talking about the bleeding edge GHC -- merely the stable releases available to download from the official web-page with both sources and binaries. If that's "bleeding edge", it should clearly be specified as such. Anyway, I don't e
37.
by ac 14y ago
Yes, things like changes to core library types are disastrous. But, if you have a core data-type that you know will change and you haven't isolated the impact of these changes by, say, using accessor functions, you're the one to blame. See
38.
by ac 14y ago
GHC is a bit of a pathological case, which doesn't make it less valid. I wouldn't really dare to estimate how much refactoring you need to do if you change, say, one constructor of GenStgExpr, primarily, because I don't know the GHC codebas
39.
by ac 14y ago
> Now you can update and test in batches without having to refactor 1000s of lines in one go. If a change in a datatype forces you to update 1000s of LoCs, you are doing something wrong.
40.
by ac 14y ago
I don't buy it. Why have erroneous code that is not used anyway in your program? Why not comment it out? If you still need to have that code, there's an easier way to typecheck -- use 'error'. (I don't assume dons doesn't know that, though)
41.
by ac 14y ago
Never understood the Lisp-mania: how could you like a language where you won't get a type error until after you run the program?
42.
by ac 15y ago
A smarter way might be just implementing a new LLVM backend (gives us C via Clang, some other languages). However, even with C, the standard library probably won't leave much space for the user code itself -- so you might need something sli
43.
by ac 15y ago
Type inference for higher-order dependent types is undecidable[1]. Going higher up the ladder of "polymorphism orders" one would eventually have to sacrifice Haskell's type inference -- which, I'm sure, few want to: otherwise, a lot more pe
44.
by ac 15y ago
I've been looking to switch from PowerPoint (OO Impress in fact) and LaTeX beamer to something else for some time, because none of them did everything I needed: * I like LaTeX/beamer for the declarative style. If I need a two-column layout
45.
by ac 15y ago
That's good and I'll definitely try Chrome. But, wouldn't it be great if the library/framework just took care of that? In fact, one of the frameworks -- Shining -- referred from the other post has a JavaScript plug-in that seems to do the r
46.
by ac 15y ago
> It looks beutiful and all. But does people actually do presentations like this for hand? (css and html). Yep, I've used LaTeX/beamer for quite some time. It's great for some things (not only math, but really any advanced text formatti
47.
by ac 15y ago
There's only one problem that's holding me back from switching to HTML/SVG/CSS/JS for my slides: the problem of monitor/projector resolution scale. Most projectors I've presented on had a low resolution: 640x480 or 800x600. Let's say my mon
48.
by ac 16y ago
No they didn't. And proving correctness of software isn't the same as solving the halting problem. You're confusing formal verification and static analysis (that doesn't mean that the latter doesn't work). Please, google Curry-Howard Isomor
49.
by ac 16y ago
I recommend Simon-Peyton Jones' classic "How to give a good research talk" http://research.microsoft.com/en-us/um/people/simonpj/papers... And also some loose bits of advice from me: * 10 minutes is not enough to present "all the material
50.
by ac 16y ago
I think that's very good that people still control the military drones. You don't want the drone dropping a bomb where it is not supposed to just because there was some suspicious movement there. No matter how well you can program the robot
51.
by ac 17y ago
Aquinas Router, anyone?...
52.
by ac 17y ago
The basic premise of the article is that a web application firewall can detect and deter all the attacks an internal mechanism can. Well, good luck with such an attitude!