mrkgnao

16 ms·

91.
by mrkgnao 9y ago
The extensive README is also a pretty good intro to how one can do crypto (as in cryptography: get off my lawn!) in Haskell using the excellent cryptonite library. For those who won't click through to TFR: > import Crypto.Nu
92.
by mrkgnao 9y ago
And compiles are really, really fast. (It's an OCaml thing, I gather.)
93.
by mrkgnao 9y ago
Oddly enough, s/high school English/mandatory Bible reading in Catholic school as a third-grader/ and it's the same for me. This comment is a fine Proustian madeleine, if I may :)
94.
by mrkgnao 9y ago
Making HTTP requests is the same thing as having rays of light reflect off the storefront, I'd say.
95.
by mrkgnao 9y ago
> C_major D_minor E_minor F_major G_major A_minor B_diminished C_major A good way to see where this comes from is to note that the major scale with C as the tonic ("root") note is C D E F G A B (the white keys on a pia
96.
by mrkgnao 9y ago
You're right, thanks for catching this. See my edit.
97.
by mrkgnao 9y ago
Edit: ignore this, it's false. Proof: https://www.reddit.com/r/Guitar/comments/1cgrdq/ama_this_is_... I don't know how this stuck with me for so long, I've practically known it to be true
98.
by mrkgnao 9y ago
> so the language accepted by GHC today is often called GHC Haskell for disambiguation s/by GHC today/by the newest available GHC/
99.
by mrkgnao 9y ago
There was a 1998 "Haskell Report" which formally defined Haskell-the-language. This version of Haskell is called Haskell 98 (sort of like C++98). There is also an updated version released in 2010, which defines an expanded langu
100.
An Asteroids clone in CodeWorld, a Haskell teaching playground(code.world)
2 points by mrkgnao 9y ago|0 comments
101.
by mrkgnao 9y ago
https://code.world/
102.
by mrkgnao 9y ago
That's gracious of you. :)
103.
by mrkgnao 9y ago
Again, at the risk of repeating myself, it's not Haskell, it's "many languages other than Go, of which Haskell is one I'll be using by way of example". (I'm not sure why you made that edit, but I've made a
104.
by mrkgnao 9y ago
I use Haskell examples because that's the language I'm most comfortable with, but, e.g. the Result type used in Rust is another example of how this can be done better. https://rustbyexample.com/std/result.html
105.
by mrkgnao 9y ago
Apologies. In any case, monadic errors in Haskell allow you to make "failing early" automatic. Even a simple use of optional types can make a difference. For instance, here you're failing with the same error every time, like
106.
by mrkgnao 9y ago
I'm sadly too young and ignorant of CS/technology history to be well-acquainted with the "old times". (It's something I intend to fix.) Even so, I'm all for praising the good things that Go does: if nothing, be
107.
by mrkgnao 9y ago
> estabilished idioms I'll note that The Fine Article is about why one of those established idioms confuses newcomers. Even better, it bites people because the type of an interface needs to be nil for something to work. (Insert ap
108.
by mrkgnao 9y ago
> Go is an open language From what I've seen, this holds only as long as you keep the proposals minimal and restricted to aforesaid hacking around the limitations built into the language. I'm happy to be shown evidence to the c
109.
by mrkgnao 9y ago
> I see no reason that a good proposal and example implementation wouldn't be accepted for addition to go. I'm sorry to bring the age-old "but generics" thing up, but how do you even implement (what Haskell-alikes cal
110.
by mrkgnao 9y ago
Does this look like a design mistake or a bit of oversight? There is no excuse why one should have to do result, err := Foo() if err != nil { ... } over and over again in a language designed after 2000. The usual argumen
111.
by mrkgnao 9y ago
Go is a lesson in how complexity can't be eliminated, only distributed properly from the beginning so that one doesn't have to hack it in later with messy special-casing that needs you to know how the compiler represents things un
112.
by mrkgnao 9y ago
There are many, many, many "legitimate" "real-world" situations where you need data structures ouside of the two or three Go gives you by default. Queues? Dequeues? Trees , for the love of $DEITY? Tries? Sets? Effecti
113.
by mrkgnao 9y ago
Mhm, sure, I can go back a couple decades for the sake of argument. Say I can make do with instances of my data structure for, I don't know, int8, int16, and strings.
114.
by mrkgnao 9y ago
What is the Go way to implement a generic data structure that can't be trivially realised by wrapping a couple maps and arrays into a struct (without using interface{} and throwing away the safety Go's type system, such as it is,
115.
by mrkgnao 9y ago
Elliptic curves are "generalized modular arithmetic" only in the sense that they involve a different kind of addition law (the set of points on a nice EC is a group ). Also, you can look at the points on an elliptic curve where y
116.
by mrkgnao 9y ago
Neither is well-posed. Humans, contrary to what they may tell themselves, are not effective, impartial judges of "merit". Diversity initiatives correct for this deficiency.
117.
by mrkgnao 9y ago
In general, number theory is notorious for containing many questions that are accessible to a layperson but whose proofs rely on arguments that are so difficult that even the basic idea of how the argument works takes many years of study. F
118.
by mrkgnao 9y ago
So what do I mean by "well-connected"? Elliptic curves are associated with a) number theory - many questions about number theory boil down to finding points on elliptic curves with rational coordinates b) algebraic geometry - elli
119.
by mrkgnao 9y ago
For anyone looking to learn more about elliptic curves, which are astoundingly "well-connected" as math topics go, here's a good book that should be accessible to anyone with some calculus under their belt: https:/&#x2F
120.
by mrkgnao 9y ago
Um, isn't that "constant-time in practice"? (Something like log-star.) Am I missing some matter of convention here?

More ›