Darmani

9 ms·

61.
by Darmani 1y ago
I loved the 90s. Evenings alternating between playing flash games on nick.com and waiting for the page to load. Some people tried showing me a website called Google. It sounded like it should be a fun game, but it was really boring. Terribl
62.
by Darmani 1y ago
Okay, I added Tailwind. https://vibe-coded.lol/#tailwind
63.
by Darmani 1y ago
Static webpage and not React, but Claude offered to add more of a shadcn aesthetic.
64.
by Darmani 1y ago
I shared your feedback with Claude and it updated the website for you.
65.
by Darmani 1y ago
Author here. It is. Almost one-shotted, in fact. In follow up, I just asked it to add the byline and to add more gradients. 85% the same as the initial one-shot. I gave it dagusa.com as a reference, which helped a lot, but also gave it a bi
66.
by Darmani 1y ago
The people saying that were wrong, BTW -- Watson did have to physically press a button. https://www.wired.com/2011/02/ibm-watson-speed/ > __Brown: __ Watson has a mechanical button-presser. It uses the sam
67.
by Darmani 1y ago
I like it too and just added it to the slides, as an interlude after Exercise 5.
68.
by Darmani 1y ago
Wow, good catch! I had not noticed. I don't know if there is a fix for this. It seems to be a fundamental issue of the delete-and-add way of representing change hunks.
69.
by Darmani 1y ago
Creator here. Done.
70.
by Darmani 1y ago
Sounds like review time is the bottleneck for you. I'm currently working on something that that makes people much faster at reviewing the output of coding agents. If you have some time, I'm very interested in interviewing you abou
71.
by Darmani 1y ago
I prefer to think of Haskell-like lazy evaluation as constructing a dataflow graph. The expression `map f (sort xs)` constructs a dataflow graph that streams each output of the sort function to `f`, and then printing the result begins runni
72.
by Darmani 1y ago
Former academic here. That kind of stuff looks within the normal range of a Broader Impacts section. Since the 80s, if you do some obscure fundamental research, then you have to say how it's going to benefit people. Say you think there
73.
by Darmani 1y ago
That is a thing in the ACM-ICPC. Typically competitors would come in with printouts of times they've implemented a tricky algorithm like the Hungarian Algorithm or the Blossom Algorithm in the past, so that having it would help jog the
74.
by Darmani 2y ago
Thanks! I'll have to muse about what the more dumbed down version would look like (as this version is already quite dumbed down compared to the primary sources). It wouldn't be quite a matter of saying "This code contains an
75.
by Darmani 2y ago
> if I were to define only one operation (checking whether two TV's are the same), would it make it a good abstraction, as now it is both sound and precise? It would! > And what are the practical benefits of using this definition
76.
by Darmani 2y ago
TCP is great. Long chains of one-line functions that just permute the arguments really suck. These both get called abstraction, and yet they're quite different. But then you hear people describe abstraction ahem abstractly. "Abs
77.
by Darmani 2y ago
Hey Jonathan! > each interface should pay us back for the trouble of defining it—and the more payback the better This seems to be the core question of this comment. I'll make the boring claim that every piece of code should pay us b
78.
by Darmani 2y ago
Hi Mawr, I don't have much to say to most of your comment --- a lot of the text reads to me like a rather uncharitable description of the pedagogical intent of most of my writing. I'll just respond to the part about deep modules,
79.
by Darmani 2y ago
My review has a bit of a negative vibe, but when when I look through my paper copy of PoSD, the margins are full of comments like "Yes!" and "Well said."
80.
by Darmani 2y ago
I'd say he's in between — he strongly recommends that most modules be "deep." I agree that blindly making lots of tiny things is bad, but his criteria for how to chunk modules is flawed.
81.
by Darmani 2y ago
Not necessarily. The implementation is very often more defined than the specific. If the implementation is the spec, then it means that even the smallest change in behavior may break callers.
82.
by Darmani 2y ago
"Define errors out of existence" might sound like "make illegal states unrepresentable," it's actually not. Instead it's a pastiche of ideas rather foreign to most FP readers, such as broadening the space of va
83.
by Darmani 2y ago
This is correct, and I came to the comments to say the same thing. It takes some work to implement without arbitrary-precision floating point, but arithmetic coding can make use of the full entropy in the input stream, whereas the approach
84.
AI Scientist: Is it really any good?(twitter.com)
2 points by Darmani 2y ago|0 comments
85.
by Darmani 2y ago
Oh, some of the big banks are. But: Au contraire. It's existed much longer than that. So you've heard of products called vitamins and painkillers? The CEO of Semantic Designs, Ira Baxter, calls the kinds of migrations and mass cha
86.
by Darmani 2y ago
That's very relevant to generate-and-test program search. The SBSE (search-based software engineering) and APR (automated program repair) communities do that kind of stuff. E.g.: There's a paper from that world, which I can't
87.
by Darmani 2y ago
Supporting an old codebase is a pretty broad question. There are quite a few companies supporting COBOL. But for migrations, and really anything interesting or unique, I recommend Semantic Designs. http://www.semdesigns.com/
88.
by Darmani 2y ago
1. I've been a doomer since before the term was invented, and I never had any worry about synthesis research based on symbolic techniques. Gödel is our friend here: they're not powerful enough to model themselves. The best you get
89.
by Darmani 2y ago
Hi Squircle! I mostly left academia after graduating, and am not actively following current research, although I still live in Cambridge and attend a fair number of research events. I can say that deep learning has taken over PL research, j
90.
by Darmani 2y ago
Hi! I was the TA for this course in 2020, and did my Ph. D. under the professor. Ask me anything.

More ›