Viewing profile — sclv
sclv
HN member- Joined
- Fri, Mar 23, 2012, 9:23 PM UTC
- HN karma
- 62
- Public activity
- 30 items
- HN profile
- View on Hacker News ↗
About sclv
No profile information was provided.
Recent public activity
-
comment
Comment #37276381
Indeed, as you note, a reinstallable base is a goal everyone wants. Its basically historical reasons and coupling of primitives (tied to the compiler innards) to nonprimitives whic…
-
comment
Comment #31818141
I don't think any of this is impossible to change. There was just a Labor Notes conference this weekend where thousands of people pushing for more democratic and rank and file run …
-
comment
Comment #31818089
Yes, companies are not democracies. That's why we need unions! That's the only way to exercise our collective power to negotiate with the employer on more equal terms. When we nego…
-
comment
Comment #17739448
Holy moly that is not at all what that paper says! It specifically argues that certain equational properties of a given total language continue to hold in the total fragment of a g…
-
comment
Comment #17737859
Your edit is starting to get it. If by the argument of the article x/y = cotton candy for all x,y, then probably the argument of the article isn't good. And the reason is precisely…
-
comment
Comment #17737816
I know what he's doing. The problem is when you make it a different function (even by just extending it) then you change its equational properties. So equational properties that he…
-
comment
Comment #17737460
The problem this and the other replies miss is that the standard definition of division is multiplication by the inverse. The entire argument rests on a notational slight of hand. …
-
comment
Comment #17737081
Right. So the multiplicative inverse property _breaks_! He just points out that it breaks, and thus you need to use a more complicated property instead. That doesn't mean that the …
-
comment
Comment #13075940
I think this list is not reflective of a general Haskell outlook. Its reflective of an outlook of people standing _outside_ Haskell (LC is historically a scala-heavy conference) an…
-
comment
Comment #12293134
If you think reading X loc/min is the norm, and then hit a language where you read much slower, you might think "this is hard to read". But if you're reading the same density of _l…
-
comment
Comment #12243720
You do get 0 * x <= 0. You just need a splash of domain theory to make the medicine go down.
-
comment
Comment #12215641
once you end up with a typeclass and associate the methods the unpacking goes away and you're just working in a context parameterized by some typeclass. i expressed it via that rou…
-
comment
Comment #12212797
This is an interesting question. As much more of a Haskeller than an MLer I don't tend to feel the "need" to structure my programs explicitly modularly, and when I do I sort of ins…
-
comment
Comment #12180754
i should have specified "modulo bottom" because i somehow didn't cotton i was talking to someone more interested in pedantry than actual discussion. that said, constructing an inha…
-
comment
Comment #12180738
> I need univalence for this argument to hold water. No, you don't. Univalence is the axiom that transporting operations across such equivalences _always_ works. If you're doing eq…
-
comment
Comment #12178887
> Parametricity is too good to give up. With the minor exception of reference cells (`IORef`, `STRef`, etc.), if two types are isomorphic, applying the same type constructor to the…
-
comment
Comment #12178873
> You wanna play the dependent type theory card? Type families as provided in Haskell are incompatible with univalence. Hi. As someone that knows type theory and knows homotopy typ…
-
comment
Comment #12068259
YHC, Hugs, and nhc all discontinued development. The former is now virtually uncompilable (and was never complete), Hugs is officially unmaintained, nhc hasn't seen a release since…
-
comment
Comment #12059462
The official website of the compiler itself is here: https://www.haskell.org/ghc/
-
comment
Comment #12059326
I have no idea either. The new site was never discussed once on the list ( https://groups.google.com/forum/#!forum/commercialhaskell ) nor does there seem to be anything in the CHG…
-
comment
Comment #12059301
No major component of Haskell is splitting in half fwiw. A small group of people have simply decided to fork a single website. ¯\_(ツ)_/¯
-
comment
Comment #11921063
The reason he cites union-find is that it is one of the only significant data structures where sustained research hasn't either produced an immutable version with the same performa…
-
comment
Comment #11477176
There's no free speech on hackernews. People get moderated all the time! If hackernews can moderate its comments, then can't a conference moderate its speakers?
-
comment
Comment #9322368
> as of right now, you need to know category theory to understand the language and it's base libraries. This is patently false. You need to know what a Functor and a Monad are, as …
-
comment
Comment #9322352
GADTs, phantom types, and arrows (not to mention monad transformers) aren't "mathematical terms" in that the names aren't borrowed from mathematical terminology. They're just _term…