Fixnum

5 ms·

1.
by Fixnum 12y ago
On the other hand, the burden of proof is on the library writer who creates the typeclass instance, not on the end user - possible largely thanks to purity - whereas programmers may expect to re-implement various patterns by hand.
2.
by Fixnum 13y ago
It could be related to StackOverflow displaying "Hot Network Questions" in a sidebar, some of which are from the aviation StackExchange, combined with the usual phenomenon of upvoted stories attracting similar submissions. Inciden
3.
by Fixnum 13y ago
Julia seems nice, but the fact that the developers don't care about TCO is annoying and vaguely reminiscent of Python. If this were added, not only would many algorithms become more natural to express, but it'd go to the top of m
4.
by Fixnum 13y ago
It's being fixed. http://www.reddit.com/r/haskell/comments/1rpte3/explanation_...
5.
by Fixnum 13y ago
They're not similar at all. FoCS is mostly about introductory programming and data structures (with a tiny bit about automata). Sipser's book is about computation and complexity - it's comparable to Hopcroft and Ullman&#x
6.
by Fixnum 13y ago
Actually, Scheme is more accessible than ever before. If installing MIT Scheme and Edwin/Emacs is too difficult, now there's Racket-SICP, which allows you to program with DrRacket, a beginner-friendly graphical IDE, and actually c
7.
by Fixnum 13y ago
For one thing, you generate as few as possible by aggressively fusing away intermediate lists (at least if your language is pure). Also, the garbage collector will often move lists into contiguous region(s) of memory. More to the point, tho
8.
by Fixnum 13y ago
The point is you're supposed to use truly random word combinations since those are at least memorable. $ wc -l /usr/share/dict/words 119095 $ python -c 'print(119095 ** 4)' 201175048646341950625
9.
by Fixnum 13y ago
DARPA is trying it: http://www.crash-safe.org/node/9
10.
by Fixnum 13y ago
For imperative languages, the most popular approach to formal proof is to add partial correctness annotations in an axiomatic semantics such as Hoare logic. I've heard that Microsoft does this to verify many properties of the Windows
11.
by Fixnum 13y ago
I think Vidarh's point is that the US has a long history of manipulating and overthrowing democratically elected governments, a practice certainly made easier when the CIA or NSA have access to the complete communications of the politi
12.
by Fixnum 13y ago
Something like http://scratch.mit.edu/ ?
13.
by Fixnum 13y ago
Out of curiosity, what's wrong with Unison?
14.
by Fixnum 13y ago
I was involved in marking a standardized test for high school students and one question involved inventing a story on an (unspecified) election. What shocked me the most, aside from the poor writing ability, the unintentionally unbelievable
15.
by Fixnum 13y ago
Google didn't exactly invent the self-driving car - they basically bought the Stanford team and some people from CMU and elsewhere.
16.
by Fixnum 13y ago
It's funny you mention these two books in the same comment, since I always assumed Landau was one of the targets of Sussman and Wisdom's comment, "It is surprisingly easy to get the right answer with unclear and informal symbol manipulation
17.
by Fixnum 13y ago
The soon-to-be-released GHC 7.8 (Haskell) can defer type errors until runtime to allow you run your program even if part of it is broken, and you can also add "holes" in place of an arbitrary expression and the compiler will tell you the ty
18.
Online draft of "Parallel and Concurrent Programming in Haskell"(ofps.oreilly.com)
2 points by Fixnum 14y ago|0 comments
19.
by Fixnum 14y ago
> I'd concentrate first on building internally consistent mental models. I strongly agree -- and the Lisp/REPL combination is extremely helpful. Specifically, I believe a Scheme-based approach is the best way to learn programming, even
20.
by Fixnum 14y ago
A number of relevant disclosures are listed at http://www.salon.com/2010/12/24/wikileaks_23/ . I don't know how one could argue that, e.g., releasing cables showing the Afghanistan war is "unwinnable" (a la Daniel Ellsberg), showing the d
21.
by Fixnum 14y ago
Roughly speaking, CPUs are highly optimized for sequential execution, with long pipelines, high power consumption, and complex implementations of arithmetic/logic instructions (I'm not an expert, but I _believe_ these are much _better_ than
22.
by Fixnum 14y ago
Yet Google still has a reputation for very selective hiring ... is that because most of the hiring decision isn't interview-related (degree/GPA/projects/resume)? Or is it that, while the data structures/algorithms questions might not be to
23.
by Fixnum 14y ago
The idea of a nation-state considering itself bound by the GPL is absurd. Only users can keep themselves safe -- developers can't.
24.
by Fixnum 14y ago
Until recently, Haskell didn't have an equivalent to Erlang's built-in support for distributed computing, but the new Cloud Haskell library ( http://www.haskell.org/haskellwiki/Cloud_Haskell ) provides message-passing concurrency with a sem
25.
by Fixnum 14y ago
Unfortunately, it's only the first 95 pages.
26.
by Fixnum 14y ago
> Is there a language, like Latin, that can help form the basis for understanding other languages and make learning easier? As inetsee says, Scheme is this. It will provide you with a firm basis for actually understanding how programs
27.
by Fixnum 14y ago
Be careful -- this doesn't fully memoize recursive functions unless you force the computation of intermediate results, since the recursive calls don't use memoization: (define memo-fib (memoize fib)) ;; example from SICP (memo-fib 40) ;; lo
28.
Pharmaceutical research routinely suppressed: BMJ study(mcclatchydc.com)
4 points by Fixnum 15y ago|0 comments
29.
by Fixnum 15y ago
I see what you're saying about the quiz questions every few minutes. On the other hand, she's not arguing for limiting ourselves to video lectures. Her point (see page 2) is that class time is precious and shouldn't be wasted on lecturin
30.
by Fixnum 15y ago
I assume the article is referring to Fermi-Dirac statistics [1], not the Dirac equation. That said, the Dirac equation (or relativistic QM more generally) as well as the Feynman path integral (the idea of which originated from a 1933 paper

More ›