Tyr42

65 ms·

721.
by Tyr42 12y ago
Though there are some claiming that Haskell is the best imperative language because of having to state upfront what effects each bit of code can have. Since evaluation order is not very straight forward in Haskell, effectful code has to
722.
by Tyr42 12y ago
I think there was some work into this called "SouthPaw", to contrast with the external NorthPaw.
723.
by Tyr42 12y ago
It's also comparable to GPL compliance too. The companies that do open source their code and comply are leaning on the FSF to make sure their competitors are also held to the same standard. If the FSF let them off, then why should an
724.
by Tyr42 12y ago
How is it different from Sage[1]? (Quickstart here http://www.sagemath.org/tour-quickstart.html , and really awesome cloud version (that requires an account, but is very worth it here: https://cloud.sagemath.com&#
725.
by Tyr42 12y ago
I think it works ok if you make a new branch from a known good commit, add the test, then rebase the new changes on top. You could do that with git checkout -b testing git rebase -i HEAD~50 (or whatever) move test commit to bottom, then s
726.
by Tyr42 12y ago
As a rule of thumb, they permit recursion where one parameter "obviously" is getting smaller each time, with a base case at 0 or the empty list or whatever. You can annotate the program in ways to make the compiler see that a para
727.
by Tyr42 12y ago
Oh no, that redirect!
728.
by Tyr42 12y ago
Oh, I'm using Anki to learn Chinese, and it's actually not very hard at all to modify a deck to include English->Chinese as well. Anki has a set of `fields` which you can embed in html templates to make each card's front a
729.
CMake Tutorial(johnlamp.net)
3 points by Tyr42 12y ago|0 comments
730.
by Tyr42 12y ago
I'm pretty sure it would end up being slower, if only for the overhead. But don't take my word for it, go ahead and run it. I know it's not too hard to write gates for testing with QCViewer [ https://github.com&#x2
731.
by Tyr42 12y ago
Having just finished reading it a few days ago, I have to disagree with you. I really enjoyed it, and as a programmer and gamer, found it really interesting to read about what goes on outside of just writing a great game and shipping it. I
732.
by Tyr42 12y ago
It's just as if you showed off insertion sort. Even if it looks good, it's not the best algorithm to show off.
733.
by Tyr42 12y ago
Well, I'm a Haskeller who's just leaning some Clojure, and I kinda miss the compiler catching dumb type errors sooner. But the data-structures that are built in are pretty slick.
734.
by Tyr42 12y ago
I feel like the sieve is a poor example, since it's not actually the same algorithm as a sieve, and has a worse running time. It is possible to write a very nice lazy infinite sieve. See O’Neill's "The Genuine Sieve of Erato
735.
by Tyr42 12y ago
Not the same really. Strike Suit Zero is somewhat close, as are the great FreeSpace 2 mods. Games that put you in the pilot seat are not that common.
736.
by Tyr42 12y ago
I agree you that the second proof is complete. I've been experimenting with Coq[1] recently, which I really hope could be the best of both, where everything is formalized and complete (or else the compiles yells at you), but it's
737.
by Tyr42 12y ago
I don't know, I feel like POpen and friends in python just aren't as nice as doing 'thing-one | thing-two' kinda stuff, with some ifs, and some variables.
738.
by Tyr42 12y ago
That sounds a lot like my workflow actually. You can still actually use tmux with it, with one session per workflow ('^b $' can name the session from inside it). I found it useful, especially with Clojure and vim. The splits are n
739.
by Tyr42 12y ago
I don't understand where you have "run += 7" and break if run = 35 in the python code. Does the Python code have more error checking than the Haskell code?
740.
by Tyr42 12y ago
>Quantum Computers have been proved to be more powerful than classical. wrong . I take issue with that claim. Take for example, the Deutsch-Jozsa problem. Given some function f, on n bits to one bit, such that f is either {zero on all t
741.
by Tyr42 12y ago
Then, are mergesort and quicksort both patentable as specific, concrete ways of implementing the idea of sorting with desirable properties and trade-offs?
742.
by Tyr42 12y ago
Earlier, Google already agreed to remove their website, as defined by some 350 urls. But the defendant started auto generating new urls, which had to go back to the judge (I think) to be blocked. Google was fine with blocking specific url
743.
by Tyr42 12y ago
Thank you. That is a good read.
744.
by Tyr42 12y ago
One of the problems with that is that people have friends. That can cause some stickiness in server choice.
745.
by Tyr42 12y ago
This is a reversed form of the preceding Unicode symbol located at U+1F543 (proposed location): . This symbol is used on right-hand pages to denote an Orthodox Lower Rank feast. As well, this symbol can be used to denote one of the t
746.
by Tyr42 12y ago
Note that that's not quite true for Haskell. In Haskell, each line is not sequenced implicitly, though there are useful patterns (monads) which do specify the evaluation order. IO, State, and Writer are all sequenced, [] is depth firs
747.
by Tyr42 12y ago
Oh, shoot, I googled for the Haskell one, and saw the other one on the way. I should have read about two more lines, and I would have got it. In my defence, I always thought the main feature of Hamlet is the static checking of everything,
748.
by Tyr42 12y ago
Oh, I thought this was the already existing Hamlet language. Of which there are at least two. http://www.yesodweb.com/book/shakespearean-templates https://github.com/gregwebs/hamlet.rb It does loo
749.
by Tyr42 12y ago
Here's a cute little jq script I used to munge some json around. https://gist.github.com/tbelaire/d00cb77fb0db7b38bed2
750.
by Tyr42 12y ago
I'm going to agree on the Go part, but do think that Rust can beat C and C++ at their own game. I really do feel like it's the best of C++, combined with Haskell, and a really smart compiler. A lot of Rust could be translated ba

More ›