Viewing profile — mrgriffin
mrgriffin
HN member- Joined
- Mon, May 30, 2016, 1:36 PM UTC
- HN karma
- 189
- Public activity
- 58 items
- HN profile
- View on Hacker News ↗
About mrgriffin
No profile information was provided.
Recent public activity
-
comment
Comment #48628167
Steelmanning this decision: I would guess for the use-case of "I have a C project and I want to run it in Fil-C" the ability for this to be a warning + run-time panic is very helpf…
-
comment
Comment #46586606
I'm sure Bill understands what I'm about to say, but as a person on team "require explicit initializations" I think the mitigations I would be looking at are: 1. Only require that …
-
comment
Comment #45735158
Making all registers caller-saved around context switches is a neat insight, it's intuitive how that could potentially lead to needing fewer instructions to execute when switching …
-
comment
Comment #43935031
> `foo :: Semigroup a, Traversable t => t a -> a` I already know that whatever is passed to this function can be traversed and have it's sum computed. It's impossible to pass somet…
-
comment
Comment #43769709
Would you expect IS_CONST to evaluate to the constant? With a name like that I would expect it to evaluate to true/false. C here is asserting that the value inside is a constant an…
-
comment
Comment #42355921
> One very frustration aspect is that there is basically no real documentation I looked at DRM/KMS briefly earlier in the year and this is what made me abandon it in the end. Can y…
-
comment
Comment #42348345
> doesn't run against the grain of the entire language Not an expert, but my gut says maybe it runs against zero values? As in, "what's the zero value for a non-nullable reference?…
-
comment
Comment #24849191
I think the person you're responding to is agreeing with you that you should optimize for languages other than English rather than for people naming a label "Bin" and then switchin…
-
comment
Comment #24373703
FWIW, that's not dependent typing, because the type doesn't depend on run-time values. A bool is either true or false, a [0...1] is either 0 or, ..., or 1. As for which languages a…
-
comment
Comment #22960969
Please write a blog post!
-
comment
Comment #22832296
I'd probably find the name Natural Seitan misleading (i.e. mistakenly buy it thinking it was vegan), but calling it "Animal Seitan" would be perfectly acceptable/clear to me .
-
comment
Comment #22827089
Forbid "\t* *\t"?
-
comment
Comment #22825525
I wouldn't do it, but this works perfectly fine. The rule is "use tabs to indent blocks of code, use spaces to align within those blocks". function name(arg1, arg2, arg3)
- comment
-
comment
Comment #22316714
What about implementing something like map for lists? You know literally nothing about the values and the function except for their types. map :: (a -> b) -> [a] -> [b] map f [] = …
-
comment
Comment #22310865
I'd probably think of Bool as being isomorphic to Maybe (), which would mean your map implementation looks a bit like: map :: Bool -> (() -> b) -> Maybe b map True f = Just (f ()) …
-
comment
Comment #21770763
I've gotta say, if I was a third party to the exchange that involved your suggested message I would think the senior developer was a pompous and condescending ass. In the UK we (or…
-
comment
Comment #21703161
I had meant to restrict my weight lifting comments to the kind of weight lifting that goes on in gyms (what was being discussed upthread). And I have to confess I don't know much a…
-
comment
Comment #21702007
Don't many QuickCheck-inspired libraries have special cases to ensure they generate common numbers like those? I could be misremembering, but I would have sworn I read that in the …
-
comment
Comment #21701463
That isn't a very good comparison. Lifting weights isn't a competition in the way that basketball is. I want to say the latter is more "zero-sum", but I'm not sure if that's correc…
-
comment
Comment #21512910
From the article: > multiplied does not: it starts off 0, and every time it is multiplied via multiplied = multiplied * count it remains 0. The article then goes on to use that fac…
-
comment
Comment #21484261
You might be right, it's been a long time for me too. But if it can define new classes, then I'd expect that the code for those classes' methods would also be in the pickled format…
-
comment
Comment #21482202
I'm pretty confident that you could write something that was equivalent to all the useful `pickle` calls. By that I mean you'll need to know which operations you'll want to do on y…
-
comment
Comment #21481775
I think (but cannot guarantee) there's nothing much stopping you writing template Haskell to construct valid values at compile time if you want. It's just that most of the time you…
-
comment
Comment #21407159
Not to sound like a pedant, but the small spelling mistakes would scare me away if I were a potential customer. > but even the most beautiful code is useless if it takes to long to…