Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
mrkgnao
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
12 ms
·
61.
▲
by
mrkgnao
9y ago
The closest thing number theory has to a Grand Unified Theory is the Langlands program. It's a huge, highly interconnected, often surprising bunch of conjectures relating number theory to geometry, algebra, and even[s] string theory --
62.
▲
by
mrkgnao
9y ago
This sentence doesn't really make sense, insofar as TFA isn't about some conjecture.
63.
▲
by
mrkgnao
9y ago
Optionals are also "applicative", but Haskellers used them for a long time before applicative functors became popular. A concept can support a certain way of thinking about it without everyone needing to think that way :)
64.
▲
glirc: an advanced console IRC client (in Haskell)
(github.com)
1 points
by
mrkgnao
9y ago
|
0 comments
65.
▲
Attempto Controlled English
(en.wikipedia.org)
3 points
by
mrkgnao
9y ago
|
0 comments
66.
▲
Building a CPU with Haskell, part 1
(yager.io)
17 points
by
mrkgnao
9y ago
|
1 comments
67.
▲
You don't need more than one cursor in Vim
(medium.com)
1 points
by
mrkgnao
9y ago
|
0 comments
68.
▲
by
mrkgnao
9y ago
Working with streams of data often makes pointfree syntax beneficial, since you can start to see the omitted arguments "flow" through your chain of composed functions. If you write f # g = \x -> g (f x) then you could i
69.
▲
by
mrkgnao
9y ago
Thanks! I'd say at least some of the blame for that is due to how C-family languages make these concepts appear somewhat ... opaque.
70.
▲
by
mrkgnao
9y ago
I won't comment on Haskell's speed here, but function composition can't possibly be making Haskell less faster. The reason is simple: the compiler inlines the composition operator in the vast majority of (probably all?) cases
71.
▲
by
mrkgnao
9y ago
Tasteful, minimal pointfree-ization can sometimes help one think at the "level" of functions instead of thinking about how those functions transform arguments. If you're familiar with the Maybe type (called Option in Rust and
72.
▲
by
mrkgnao
9y ago
When you forgot $EDITOR, ^O^X had your back. :)
73.
▲
by
mrkgnao
9y ago
Using even better (PureScript) syntax, the pointfree version of the latter can be written in notation similar to a hom-functor. f1 = pow 2 f2 = pow _ 2 This makes it look like a lambda but without having to bind an argument expli
74.
▲
by
mrkgnao
9y ago
Pointfree style uses composition (among other operators), currying, and partially applied functions, but it refers to something distinct from the sum of those concepts/features. Consider the following function of two parameters, writ
75.
▲
by
mrkgnao
9y ago
Is this a hammer question, or one of e.g., concrete vs. wood?
76.
▲
by
mrkgnao
9y ago
Clear, readable value-level Haskell is an underappreciated joy. What are you using this for, if anything?
77.
▲
Simula: a 3D/VR window manager for Linux written in Haskell
(github.com)
3 points
by
mrkgnao
9y ago
|
1 comments
78.
▲
by
mrkgnao
9y ago
Oh, thanks for the correction. It would appear that my knowledge is out of date: did Rust use something closer to H-M in the past? (Going off of https://github.com/rust-lang/rust/pull/15955 here.)
79.
▲
by
mrkgnao
9y ago
Rust uses Hindley-Milner type inference. OCaml uses Hindley-Milner. Swift apparently uses a variant of the system with more features. None of these make use of monads or anything rooted in category theory. https://en.wikipedia.
80.
▲
by
mrkgnao
9y ago
https://github.com/knedlsepp/nix-cheatsheet
81.
▲
by
mrkgnao
9y ago
In view of some replies downthread: yes, application-level management is entirely possible with Nix(OS). Currently, this works best for Haskell, for which there is a sizeable amount (relatively speaking) of Nix tooling available. This is la
82.
▲
NixOps – Declarative cloud provisioning and deployment with NixOS
(nixos.org)
248 points
by
mrkgnao
9y ago
|
66 comments
83.
▲
by
mrkgnao
9y ago
IIRC discriminated unions are plain C(++) unions with an added type tag, like at the beginning of the article. Brittle, prone to breakage when refactoring, etc. when compared to real sum types.
84.
▲
by
mrkgnao
9y ago
From the point of view of "onboarding" (aka barriers to entry), as you say, point-and-click is miles ahead of the unfriendly-at-first-glance Vim. But I'd like to say that I cannot honestly recall an instance where I was in
85.
▲
by
mrkgnao
9y ago
For those unwilling to click through, I.F. is Ivan Fesenko. Among other things, he wrote this article about Mochizuki's work: http://inference-review.com/article/fukugen
86.
▲
by
mrkgnao
9y ago
But how do you write a list with only one element, x (func y) z ?
87.
▲
by
mrkgnao
9y ago
That's not the sense in which it is used most of the time (at least outside of academia). To repeat something I quoted up-thread: > 'Cultural Marxism' in modern political parlance refers to a conspiracy theory which sees t
88.
▲
by
mrkgnao
9y ago
Without taking "sides" -- I don't have a horse in the "is postmodernism true?" race -- it bears pointing out that afaict Jordan Peterson doesn't really know what he's talking about when it comes to 20th-ce
89.
▲
by
mrkgnao
9y ago
I'm currently playing with Reflex, a wonderful functional reactive programming library that lets you compile the same code into into webapps with GHCJS (a JavaScript backend for GHC) or into standalone desktop apps (using WebKitGTK).
90.
▲
by
mrkgnao
9y ago
Pandoc, the "universal document converter", is a good example of a large, feature-complete Haskell project in wide use. https://pandoc.org/ Most people who use it aren't aware it's written in Haskell!
More ›