sgeisenh

14 ms·

91.
by sgeisenh 11y ago
The SAT subject tests and AP exams are usually easier than the general SAT because they require a narrower area of preparation and are typically associated with courses that students have already taken. At least that was my experience takin
92.
by sgeisenh 11y ago
Use of templates isn't frowned upon. TMP is frowned upon because usually the performance gains don't justify the loss of readability. It has been said many times in many ways: don't write code for yourself, write it for other
93.
by sgeisenh 11y ago
There are fairly strict regulations concerning how insiders are able to trade, legally. If an insider learns of information that can potentially influence stock price, they may only execute trades as part of a preexisting plan or agreement.
94.
by sgeisenh 11y ago
I don't think it is sad. You explained why it is necessary, C++ has been around for a while, is/was great but there are now languages that can compete in terms of performance with fewer drawbacks in terms of security and undefined
95.
by sgeisenh 11y ago
Formally, everything has to be effect free; furthermore, everything has to be strict (the potential for any value to be "bottom" breaks things). You can apply the same intuition and things mostly work, but there can be a few surpr
96.
by sgeisenh 11y ago
There is plenty of work in PL that covers why type theory is useful. Check out the classic paper by Philip Wadler called "Theorems for free" that covers some of the terrific benefits of parametric polymorphism. There has also been
97.
by sgeisenh 11y ago
I don't want to weigh in on the discussion about The Phantom Menace, but I do want to address the sentiment that in order to have a valid opinion about some craft, you have to be proficient at that craft. When you practice something, y
98.
by sgeisenh 11y ago
I'll just add this on: https://www.cs.cmu.edu/~fp/courses/15411-f14/schedule.html The lecture notes are simple and excellent, though at a very high level of abstraction. Though most of the notes are full
99.
by sgeisenh 11y ago
At first I thought this was the name of a court case concerning intellectual property. Was a nice read. Thanks for posting!
100.
by sgeisenh 11y ago
Most academic languages don't have large numbers of stack overflow answers. Look at Standard ML or most dependently typed languages (Agda, Coq, Twelf, etc.). Though, Agda produces snippets for you with hole based programming and there
101.
by sgeisenh 11y ago
In my opinion, it is very easy to teach the basic principles of software development and design. Algorithmic thinking is much harder to teach. A CS background sets you up to contribute ideas and produce efficient solutions to challenging pr
102.
by sgeisenh 11y ago
Once you've experienced the joys of parametricity, you can never go back!
103.
by sgeisenh 11y ago
Yes, you can always convert direct style code to continuation passing style code. And continuation passing only uses tail calls. This is one of the big advantages of CPS. Of course if you don't have a tail call optimization, then you o
104.
by sgeisenh 11y ago
The example is actually wrong. Functions are contravariant on their input and covariant on their output. The basic premise behind subtypes is that an object of a subtype can be used anywhere that an object of its supertype can be used. Just
105.
by sgeisenh 11y ago
Honestly, that's what makes LaTeX great. Formatting is decoupled from content. If you want to make a formatting change, you can Google it and chances are that somebody else has done the same thing.
106.
by sgeisenh 11y ago
It really isn't narrow. Mathematics, philosophy and computer science are just three different ways of viewing the same problems.
107.
by sgeisenh 11y ago
The commonplace languages in use are difficult to reason about. It would take a serious paradigm shift for most companies to stop what they're doing and develop a tool chain for wholesale program verification. Additionally, it takes a
108.
by sgeisenh 11y ago
Check out compcert for a verified c compiler. And several Haskell projects have been verified.
109.
by sgeisenh 11y ago
If you instead use a language with algebraic datatypes, you can get a nice concise implementation. Let's try OCaml: type 'a tree = | Node of 'a tree * 'a * 'a tree | Leaf let rec reverse = function
110.
by sgeisenh 11y ago
What material did you spend time on that you don't know how to reverse a binary tree? It isn't a difficult problem, even having never seen it before. This is one of those warmup problems to test how comfortable a candidate is with
111.
by sgeisenh 11y ago
It is in an actual language! It's called ML! And modules are better for abstraction than type classes.
112.
by sgeisenh 11y ago
Just about every eagerly evaluated functional language supports laziness through thunks. This is just syntactic sugar.
113.
by sgeisenh 11y ago
Ela is a type safe, strictly typed language, which is, however, not burden by limitations of any particular type checker. By nature, a language which is type safe and strictly typed must be burdened by the limitations of a "particula
114.
by sgeisenh 11y ago
This is Simpson's paradox at work. And the article even acknowledges it. Most of the universities on the list have disproportionate numbers of students in STEM fields. That's why Ivy League schools aren't well represented. An
115.
by sgeisenh 11y ago
A lot of interviewers like to ensure that you're comfortable with pointers and the distinction between the stack and the heap. It can be nice to list a familiarity on your resume just to let people know that you're comfortable wit
116.
by sgeisenh 12y ago
> I'll mention, though, that Haskell does have one form of modularity which ML doesn't really, which is the fact that you can write algorithms separately, compose them together after the fact, and expect to get reasonable perfo
117.
by sgeisenh 12y ago
If somebody joins your company and finds that it isn't a good fit, isn't it preferable for both parties that they leave? When an employee isn't motivated, both the employee and employer lose.
118.
by sgeisenh 12y ago
Purity is almost used in a pejorative sense throughout the page. If it wasn't for poor library support, I would prefer using SML to OCaml. SML is syntactically simpler and both SML/NJ and MLton have a lot to offer that I haven&#x2
119.
by sgeisenh 12y ago
If you think recursively, the n log n divide and conquer solution is pretty straightforward. The problem becomes much more interesting when you consider optimal parallel performance. The best span you can do is log^2 n. I believe the proble
120.
by sgeisenh 12y ago
Yeah. The movers and shakers in software are always the big companies. But there are quite a few institutions that feature functional programming in their undergraduate curriculum. One of the main gripes that people mention with functional

More ›