momentoftop

12 ms·

91.
by momentoftop 6y ago
I've nixified my emacs configuration for a while now and, relevant to this thread, it's put up a bit of a roadblock for me trying EXWM (I'm a long time xmonad user). Changing my emacs configurations means restarting my emacs
92.
by momentoftop 6y ago
One thing I found interesting about the novel was that the depicted Martian utopia is just as growth hungry as contemporary capitalism. [spoiler warning] The premise, in fact, is that Mars has consumed its major resources, and now needs to
93.
by momentoftop 6y ago
An MITM attack on an HTTPS connection looks exactly like an untrusted HTTPS connection, and the main purpose of HTTPS is to prevent a MITM. The browser should rightly scream louder here than it does for an unsecure HTTP connection.
94.
by momentoftop 6y ago
This code relies on GHC and GHC specific extensions. The mentioned pragmas are not defined by the 2010 standard. The lastest GHC release is from August 8th of this year.
95.
by momentoftop 6y ago
https://mail.haskell.org/pipermail/libraries/2020-September/...
96.
by momentoftop 6y ago
The Haskell community, in my experience, is far more academic. A recent post to the Haskell libraries mailing list began with: "It was pointed out to me in a private communication that the tuple function \x->(x,x) is actually a spec
97.
by momentoftop 6y ago
> The most popular theorem provers (at least among computer scientists) are based on some form of Martin-Löf type theory. Are they? Judging by posts on HN, I 100% agree. But judging by the number of users and the amount of verified mathe
98.
by momentoftop 6y ago
> I’m amazed that anyone ever actually solved Exile. I think I might have gotten as much as 30% of the way through... I reached the windy tunnel,... This was about as far as I got without a walkthrough. And I fear it wasn't close to
99.
by momentoftop 6y ago
Oh wow! The paper [1] already introduces "tacticals", being functions from tactics to tactics that give you a very powerful language for composing tactics, and its examples are still very close to what you would see in things like
100.
by momentoftop 6y ago
To follow up: I believe the original paper introducing tactics is Milner's still excellent "The Use of Machines to Assist in Rigorous Proof" from 1984 [1]. The basic idea is that a "tactic" is a function which input
101.
by momentoftop 6y ago
When I got hold of a BBC emulator, I played many of these games through to completion with the use of "save state". Castle Quest ended up being pretty underwhelming. Exile, on the other hand, is absolutely insane in its level of c
102.
by momentoftop 6y ago
SML has always let you abstract over type-constructors using modules, and it was always routine to do so. You can express monads abstractly in this way, and some people have (Ocaml, but the SML is the same modulo syntax): http:/&#x2
103.
by momentoftop 6y ago
It definitely works, starting emacs with "--daemon".
104.
by momentoftop 6y ago
Exactly. My emacs uptimes (M-x emacs-uptime) are generally the same as my machine's uptime, which is typically months. Emacs is one of the most rock-solid pieces of software I have running. It's also great for remote. I have emacs
105.
by momentoftop 6y ago
Functors are indeed a poor substitute for typeclasses if I want ad-hoc polymorphism. If I want ad-hoc polymorphism, I want typeclasses. I find Scala's implicits to be a poor substitute (though not as poor as functors), and I'm sce
106.
by momentoftop 6y ago
I'm not the parent, but thanks for the link to Dante. One of the main things I like about Ocaml and merlin is how robustly it can tell you the types of expressions by hitting "C-t". It usually works on incomplete code, and it
107.
by momentoftop 6y ago
In part, that's right. For example, there is an extension called "rank-n" types where global type inference is provably impossible. But even in Haskell 98, type classes often create ambiguities that mean the compiler doesn&#x
108.
by momentoftop 6y ago
Ah, sadly I haven't come across any refactoring tools for Ocaml. But in Emacs with Merlin, I regularly hit "C-t C-t" on a module identifier, and it brings up the signature in another window, whether there is an ".mli&quo
109.
by momentoftop 6y ago
Ocaml and the MLs have a very strong commitment to global type inference, much stronger than Haskell's. Scala has no commitment. That said, you do see a lot of types in Ocaml code. Ocaml source files typically have an accompanying sign
110.
by momentoftop 7y ago
Modules are structurally subtyped in SML. They are not nominally subtyped. You do give them names for readability and reuse, but the name is not important to the typechecking. Module types (signatures) are checked according to the types of
111.
by momentoftop 7y ago
And it inherited its module system from Standard ML, where module types (signatures) obey structural subtyping: a module can be typed to any signature it includes.
112.
by momentoftop 7y ago
If by "generics", you are referring to the sort of parametric polymorphism that you have in .NET and Java, then no, you don't use functors for that. # let foo x = x;; val foo : 'a -> 'a You need to u
113.
by momentoftop 7y ago
The second thing I tried was: "The square root of..." I'm sure I've started sentences that way many many times. The results are pretty funny: "The square root of four (e.g. 1.6 or 1.18) is 1,913,511."
114.
by momentoftop 7y ago
He had a few director credits as well, with Cleese tweeting today: "Of his many achievements, for me the greatest gift he gave us all was his direction of 'Life of Brian'. Perfection"
115.
by momentoftop 7y ago
One of the most famous games on the Micro was Repton, which the 16-year old Tim Tyler wrote mostly in BASIC, and then gradually optimised into inline assembly.
116.
by momentoftop 7y ago
I don't have a Twitter account, so I browse it by going to mobile.twitter.com, which allows me to view tweets and replies. I assume this is an oversight by Twitter, and it will be locked down at some time, but it serves me for now. Sim
117.
by momentoftop 7y ago
F# has had typed units of measure for over a decade, with Hindley-Milner style type-inference, so you can do stuff like let foo x y = (x:int<m>) * y + 10<m/s>;; And it infers that y has type <1/s>. You ca
118.
by momentoftop 7y ago
ML has always had easy mutables in the form of references, and the closest deployed language to Standard ML (Ocaml and Reason), has always had for-loops and while-loops. Mutable references are used frequently. Rust is great because it'
119.
by momentoftop 7y ago
It solves it so long as you are happy to upload several gigabytes a day seeding nothing just to keep up with DHT chatter: https://github.com/ipfs/go-ipfs/issues/3429
120.
by momentoftop 7y ago
The beginner isn't defining the instances. But the experts want the flexibility to define such instances, and that means even beginner code can involve an unhelpful amount of polymorphism. This isn't the case in Rust, where litera

More ›