codygman

61 ms·

601.
by codygman 12y ago
> Because everything from the web is a string. Do you consider JSON a string? Would you manipulate it as a string or use a JSON parser? > How does putting (int) before the arguments to function help anything? It throws an error in cas
602.
by codygman 12y ago
I bet evil's vim keybindings are better, at least they are the best I've seen.
603.
by codygman 12y ago
Just getting into R, what are some killer features it has CL doesn't?
604.
by codygman 12y ago
Does company-mode completion not work for you? > In case of rarely used languages, for example, Idris, Agda, etc, they often just don't work. Really? My experience is that emacs had the only support for rarely used languages. >
605.
by codygman 12y ago
Your problem reminds me of the "Why would you use Emacs over intellij thread".
606.
by codygman 12y ago
> Eh, you're right, that came off as far too aggressive—I didn't really mean it to be. Of course the OP isn't going to be omnipotent, but then why default to male? I know English doesn't have singular gender-neutral
607.
by codygman 12y ago
> Assuming that (s)he is "privileged" is just yet another prejudice, not a fact upon which to base your opinion. ??? Men are more privileged than women, that is fact.
608.
by codygman 12y ago
> I don't know Haskell, so there wasn't anything in my head. Then what were you impling by saying: > Do you know how this would look in Haskell? Because that sentence seems to imply it would be very convoluted in Haskell. Ho
609.
by codygman 12y ago
Emacs, vim (increasingly less), rxvt-unicode (terminal emulator), org-mode, org-agenda-mode, and xmonad window manager. My goal is to be able to interactively develop all languages I may come across with a repl and at least a stepping deb
610.
by codygman 12y ago
Also a good tutorial for getting a good feel what good Haskell code looks like and how to lay out an application is the howistart tutorial[0]. 0: http://howistart.org/posts/haskell/1
611.
by codygman 12y ago
> Do you know how this would look in Haskell? I'm curious, how did you think it would look in haskell? Can you give a code example of what was in your head?
612.
by codygman 12y ago
"(Minorities) who do X are more likely to be Y" and "(Privileged) are more likely to reinforce their privilege (because the don't see their privilege and/or want to keep it)" are two different things. At face v
613.
by codygman 12y ago
I personally would have gone with: > The author spends a lot of effort trying to make their functions point free.
614.
by codygman 12y ago
> Does assuming that someone is a male programmer make them sexist? Not really - not unless you _also_ assume other implications like "women can't program", or other such nonsense. But that's a leap to make. In my exp
615.
by codygman 12y ago
A little tired, but here are a few things that gave you a very big advantage in your Haskell endeavour IMO. - Knowing to start from scratch and assuming it's some install issue with ghc-mod (this probably saved you a lot of time) -
616.
by codygman 12y ago
> Broadly making assumptions about everyone within a particular field is as bad if not worse than someone using an incorrect pronoun. Not really, minorities have to face stuff like this on a more frequent basis. Gendered pronouns are mor
617.
by codygman 12y ago
Do you have any links to Reid Barton's 2010 Google code jam code? I briefly looked and couldn't find it. I'm guessing someone more familiar with code jam would know right where it was or if it existed.
618.
by codygman 12y ago
This was a great read, I'll be passing it along to anyone wanting to learn Haskell so they can get a good feel for what it's like. You had some advantages though since you've used Racket in the past. I feel like your Racket e
619.
by codygman 12y ago
You know how people use Python for most of their code and write c bindings for performance intensive parts? Idiomatic Haskell for most of my code and imperative Haskell for performance achieves something similar without having to switch lan
620.
by codygman 12y ago
Ignore them all, use these: http://blog.sigfpe.com/2006/08/you-could-have-invented-monad... http://homepages.inf.ed.ac.uk/wadler/papers/marktoberdorf/ba... http://blog.jl
621.
by codygman 12y ago
Diagrams? Here you go! http://projects.haskell.org/diagrams/
622.
by codygman 12y ago
Oh cool, slices don't return index errors: >>> print sum(sorted([])[-2:]) 0
623.
by codygman 12y ago
Ha, that's basically what I just did with the Haskell version: Prelude> import Data.List Prelude Data.List> sum . take 2 . reverse . sort $ [1..5] 9
624.
Simple and quick text parsing tutorial using Haskell(codygman.github.io)
1 points by codygman 12y ago|0 comments
625.
by codygman 12y ago
So you would prefer a language without sum types but with pattern matching and exhaustiveness checking for nil then?
626.
by codygman 12y ago
> extra layer of `Maybe` doesn't buy me anything. Wouldn't that layer be there all the time anyway? Either in the form of a sum type (Just a | Nothing), explicit nil checking, or ignoring nil's and getting a runtime error.
627.
by codygman 12y ago
> Can we at least agree here that complexity implies a larger cognitive burden? Right, but remember simple doesn't necessarily mean easy. The reason I use functional languages is because in my experience they handle complexity bette
628.
by codygman 12y ago
For whatever reason I felt the random need to parse your table here in Haskell, so.... here's the code :P λ> import qualified Data.Text.IO as T λ> import qualified Data.Text as T λ> data Entry = Entry {name :: T.
629.
by codygman 12y ago
> My point is that you can be writing useful programs in c in a weekend. We'll need to define criteria for "useful program" but I believe most people could write useful programs in most languages in a weekend. > I'
630.
by codygman 12y ago
Wow, I'm going to use this to explain monoids in the future. Great explanation!

More ›