freyrs3

29 ms·

241.
by freyrs3 13y ago
I find the whole hubris of this article kind of alarming, I'm not sure if the author is doing this out of some form of satire or whether he/she actually think that the "disciple of PL theory is just full of misguided imbecile
242.
by freyrs3 13y ago
This isn't a function of ghci or Haskell, that's an editor feature. If you want that kind of functionality than emacs is probably your best bet. Though you can send arbitrary code blocks from vim using vim-slime. [1] https:/
243.
by freyrs3 13y ago
A simple program is an interesting comparison, but it's kind odd to consider this to compare the whole typesystem. It's hard to understate that GHC has a /big/ typesystem and has had a significant amount of research done
244.
by freyrs3 13y ago
> Single threaded. Concurrency via processes, impossible to share state. Which language doesn't have these options? This could be a description of Bash.
245.
by freyrs3 13y ago
Typically if they are the type of programmer inclined to learn Clojure, Haskell, and/or Scala the experience part isn't a problem.
246.
by freyrs3 13y ago
Companies based entirely around building better Skinner boxes is a rather alarming phenomenon.
247.
by freyrs3 13y ago
Arguably there's a lot of folks reinventing things poorly in ad-hoc ways, doubtful that will ever change. What's more concerning is the flagrant anti-theory attitude that, at least to me, seems to be on the rise. In the context of
248.
by freyrs3 13y ago
> for any inference engine, any type system, any language, you can't use it if you don't know what it's going to do. My whole argument is that you don't need to know anything about the implementation of the inference
249.
by freyrs3 13y ago
> If you expect people to understand the theory, this is also a UI problem in a different way. I don't really understand what you mean by "theory", you don't need to know /any/ PL theory to write Haskell and
250.
by freyrs3 13y ago
> Haskell has an adoption problem, n'est ce pas? So where does my reasoning go wrong? The problem is thinking that this comes from unification-based inference algorithms which is an implementation detail thats fairly far removed fro
251.
by freyrs3 13y ago
> The programmer has to model what the inference system is doing in his or her head, and it's a source of significant cognitive load. Huh? I don't know what your type-inferred language of choice is, but personally I never have
252.
by freyrs3 13y ago
Of course he deserves to be in jail, but he should be in jail under harassment and identity theft laws instead of the hacking charges.
253.
by freyrs3 13y ago
It's rather alarming that the only reason helium balloons are so common is that it is being sold at prices that don't reflect it’s scarcity due to government subsidies.
254.
by freyrs3 13y ago
The paper from the arxiv mentioned in the article: http://arxiv.org/pdf/1212.5605v1.pdf
255.
by freyrs3 13y ago
Until you run out of memory.
256.
by freyrs3 13y ago
It's worth noting that there are excellent Python bindings to Z3. http://rise4fun.com/z3py/tutorial
257.
by freyrs3 13y ago
Reality: "Type systems don't keep you from writing wrong logic, they only forbid you to write inconsistent logic."
258.
by freyrs3 13y ago
That would catch the SyntaxError instances he mentioned but certainly not every case of AttributeError or ValueError exception. Even good testing would not catch all of them.
259.
by freyrs3 13y ago
An improvement over "Beefy Miracle".
260.
by freyrs3 13y ago
Simon Marlow said on reddit this morning that some of the technology is getting merged upstream into GHC 7.8. So we'll all benefit from it.
261.
by freyrs3 13y ago
Both of those projects implement fairly simple type systems, they both even look simpler than even ML. Having at least outer rank-1 quantification is what I consider a "modern" typing system.
262.
by freyrs3 13y ago
> Both Clojure and Common Lisp have type systems that can do most things ml and haskell can do. I don't know about that, Haskell has quite a few very non-trivial extensions in it's type system that I have yet to see replicated
263.
by freyrs3 13y ago
Running Javascript is arguably not that important to an "open device", we need a full compiler that goes down to native code and can access system internals.
264.
by freyrs3 13y ago
Notepad++ is more popular than both vim and emacs. I don't believe this.
265.
by freyrs3 13y ago
I have spent several months doing proofs in Coq, as well as in Isabelle. I contest conflating Coq with "real logic", it is perfectly possible to do rigorous proofs without the aid of a computer-aided proof assistant, if that wasn&
266.
by freyrs3 13y ago
> mathematical proofs are not based on logic Mathematical proofs are explicitly logical statements, if they aren't based in logic they aren't proofs by definition. Mathematical intuition is what leads us to ideas but it's
267.
by freyrs3 13y ago
> Theorems and conclude that in every logic there are statements which are true, but not provable, or provable, but not true. And this is the ultimate problem with type systems: in their quest to reject "bad" programs, they mus
268.
by freyrs3 13y ago
Poorly worded, and a bit disingenuous to bring Gödel's theorem in this context. Taken to it's logical conclusion, by his argument we shouldn't bother analyzing the properties of programs at all.
269.
by freyrs3 13y ago
Naive implementation might be: fib :: Integer -> Integer fib x = truncate $ ( 1 / sqrt 5 ) * ( phi ^ x - psi ^ x ) where phi = ( 1 + sqrt 5 ) / 2 psi = ( 1 - sqrt 5 ) / 2
270.
by freyrs3 13y ago
Region-based memory management in Rust makes it possible to deal with shared memory without having to deal with life-cycle maintenance that you deal with in C. C++ has some similar concepts but like most things in C++ they are horribly comp

More ›