@int_index You're welcome :) It was mostly David Knothe implementing it, though
English
Sebastian Graf
711 posts
Sebastian Graf
@sgraf1337
Talk to me about Haskell, GHC, general CS or my trumpet Mastodon: @[email protected]
Karlsruhe, Baden-Württemberg Katılım Temmuz 2014
250 Takip Edilen276 Takipçiler
@Ngnghm Just came here to say that this kind of monologue would lead me to immediately leave your discussion round with an audible WTF
English
Lexi also complains about lack of female Haskellers. But Haskell recruits at the higher end of the IQ spectrum, and especially the math part of it. Between extra variance and skew towards shape rotators vs wordcels, males vastly dominate this population.
Alexis King@lexi_lambda
I have published my first new blog post in four years lexi-lambda.github.io/blog/2025/05/2…
English
@tomjaguarpaw @kmett Day 1 fires "ends with odd number", Day 2 fires "begins with odd number"
English
Color coded impact of Ramaswamy's thought experiment, based on the SSN ranges assigned to those states before 2011.
Red = basically all federal employees over 13 years old who were born in that state are gone,
Green = only about 1/2.
I realize it was intended to be a hyperbolic way to make a point, but I figure the that admits an equally hyperbolic response.
(Generated in about 2 minutes via Claude and the Google Maps API.)
Pirate Wires@PirateWires
Vivek Ramaswamy's thought experiment for reducing the size of government on @lexfridman: "Day 1, anybody in the federal bureaucracy who's not elected, whose Social Security number ends in an odd number, you're out. [Day 2], of those who remain, if your Social Security starts in an even number, you're in, and if it starts with an odd number, you're out. That's a 75% reduction." "Now imagine that you could run that thought experiment at scale, but you had a metric for screening people who had the greatest competence, as well as the greatest commitment and knowledge of the Constitution. That would immediately raise not only the civic character of the United States... it would also stimulate the economy. The regulatory state is like a wet blanket on the economy." "One of the virtues of that thought experiment is you don't have a bunch of lawsuits you're dealing with about gender discrimination or racial discrimination... [And] the reality is... on Day 3, not a thing will have changed for the ordinary American, other than their government being a lot smaller and more restrained, and spending a lot less money."
English
@alpha_convert I think explicit recursion is easier to read/resolve, but ironically it also makes it much harder for me to see whether a huge recursive function is a plain catamorphism (e.g. foldr).
This is important when actually trying to comprehend the function's semantics.
English
@_osa1 I think the following book taught me awareness of the general issue: amazon.de/-/en/Growing-O… It is fair to say that no other book has had such a lasting influence on me
English
@_osa1 Of course, the alternative of having an abstract super class isn't so bad here (especially beause no .equals is involved), but it can be in general. Plus, I prefer the more decoupled design I end up with.
English
@_osa1 It is difficult to ensure that all OO subtyping is behavioral, which is why I dislike deriving from classes so much. Instead of deriving from an abstract super class, I heavily follow the decorator pattern, which extracts and constructor-injects instances into the class.
English
@int_index I don't care much for the separator; the quantifier is much more important to me. I think I'd prefer `.`
English
@int_index I *really* don't like anything that is too close to `forall`.
`exists` and `some` sound good to me. `some` sounds a bit better because it really says "here is one" rather than "you can conjure up something using the axiom of choice". I.e., `some` is Σ, `exists` is classical.
English
Trying to come up with a keyword to denote Σ-types in Haskell. Perhaps `some`?
Our future quantifiers:
forall (a ∷ A). F a
forall (a ∷ A) → F a
foreach (a ∷ A). F a
foreach (a ∷ A) → F a
exists (a ∷ A). F a
exists (a ∷ A) | F a
some (a ∷ A). F a
some (a ∷ A) | F a
English
@scheminglunatic @int_index Aha, so `some` is `Either`?
Jokes aside, the potential for confusion between "dependent sum" (the non-dependent form of which is a product type) and "sum type" is quite real. IMO this would be a reason *against* using `some`.
English